1079 |
fbp = &fringe_bitmaps[n]; |
fbp = &fringe_bitmaps[n]; |
1080 |
if (*fbp && (*fbp)->dynamic) |
if (*fbp && (*fbp)->dynamic) |
1081 |
{ |
{ |
1082 |
if (rif->destroy_fringe_bitmap) |
if (rif && rif->destroy_fringe_bitmap) |
1083 |
rif->destroy_fringe_bitmap (n); |
rif->destroy_fringe_bitmap (n); |
1084 |
xfree (*fbp); |
xfree (*fbp); |
1085 |
*fbp = NULL; |
*fbp = NULL; |
1185 |
{ |
{ |
1186 |
destroy_fringe_bitmap (which); |
destroy_fringe_bitmap (which); |
1187 |
|
|
1188 |
if (rif->define_fringe_bitmap) |
if (rif && rif->define_fringe_bitmap) |
1189 |
rif->define_fringe_bitmap (which, fb->bits, fb->height, fb->width); |
rif->define_fringe_bitmap (which, fb->bits, fb->height, fb->width); |
1190 |
|
|
1191 |
fringe_bitmaps[which] = fb; |
fringe_bitmaps[which] = fb; |
1445 |
{ |
{ |
1446 |
enum fringe_bitmap_type bt; |
enum fringe_bitmap_type bt; |
1447 |
|
|
1448 |
|
if (!rif) |
1449 |
|
return; |
1450 |
|
|
1451 |
for (bt = NO_FRINGE_BITMAP + 1; bt < MAX_STANDARD_FRINGE_BITMAPS; bt++) |
for (bt = NO_FRINGE_BITMAP + 1; bt < MAX_STANDARD_FRINGE_BITMAPS; bt++) |
1452 |
{ |
{ |
1453 |
struct fringe_bitmap *fb = &standard_bitmaps[bt]; |
struct fringe_bitmap *fb = &standard_bitmaps[bt]; |
1461 |
/* Destroy row bitmaps. */ |
/* Destroy row bitmaps. */ |
1462 |
int bt; |
int bt; |
1463 |
|
|
1464 |
|
if (!rif) |
1465 |
|
return; |
1466 |
|
|
1467 |
for (bt = NO_FRINGE_BITMAP + 1; bt < max_used_fringe_bitmap; bt++) |
for (bt = NO_FRINGE_BITMAP + 1; bt < max_used_fringe_bitmap; bt++) |
1468 |
rif->destroy_fringe_bitmap (bt); |
rif->destroy_fringe_bitmap (bt); |
1469 |
} |
} |