]> code.delx.au - gnu-emacs/blob - src/fringe.c
Small doc fix.
[gnu-emacs] / src / fringe.c
1 /* Fringe handling (split from xdisp.c).
2 Copyright (C) 1985, 1986, 1987, 1988, 1993, 1994, 1995, 1997,
3 1998, 1999, 2000, 2000, 2001, 2002, 2003, 2004,
4 2005 Free Software Foundation, Inc.
5
6 This file is part of GNU Emacs.
7
8 GNU Emacs is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
11 any later version.
12
13 GNU Emacs is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
17
18 You should have received a copy of the GNU General Public License
19 along with GNU Emacs; see the file COPYING. If not, write to
20 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
21 Boston, MA 02110-1301, USA. */
22
23 #include <config.h>
24 #include <stdio.h>
25
26 #include "lisp.h"
27 #include "frame.h"
28 #include "window.h"
29 #include "dispextern.h"
30 #include "buffer.h"
31 #include "blockinput.h"
32
33 #ifdef HAVE_WINDOW_SYSTEM
34
35 extern Lisp_Object Qfringe;
36 extern Lisp_Object Qtop, Qbottom, Qcenter;
37 extern Lisp_Object Qup, Qdown, Qleft, Qright;
38
39 /* Non-nil means that newline may flow into the right fringe. */
40
41 Lisp_Object Voverflow_newline_into_fringe;
42
43 /* List of known fringe bitmap symbols.
44
45 The fringe bitmap number is stored in the `fringe' property on
46 those symbols. Names for the built-in bitmaps are installed by
47 loading fringe.el.
48 */
49
50 Lisp_Object Vfringe_bitmaps;
51
52 enum fringe_bitmap_type
53 {
54 NO_FRINGE_BITMAP = 0,
55 UNDEF_FRINGE_BITMAP,
56 LEFT_TRUNCATION_BITMAP,
57 RIGHT_TRUNCATION_BITMAP,
58 UP_ARROW_BITMAP,
59 DOWN_ARROW_BITMAP,
60 CONTINUED_LINE_BITMAP,
61 CONTINUATION_LINE_BITMAP,
62 OVERLAY_ARROW_BITMAP,
63 TOP_LEFT_ANGLE_BITMAP,
64 TOP_RIGHT_ANGLE_BITMAP,
65 BOTTOM_LEFT_ANGLE_BITMAP,
66 BOTTOM_RIGHT_ANGLE_BITMAP,
67 LEFT_BRACKET_BITMAP,
68 RIGHT_BRACKET_BITMAP,
69 FILLED_BOX_CURSOR_BITMAP,
70 HOLLOW_BOX_CURSOR_BITMAP,
71 HOLLOW_SQUARE_BITMAP,
72 BAR_CURSOR_BITMAP,
73 HBAR_CURSOR_BITMAP,
74 ZV_LINE_BITMAP,
75 MAX_STANDARD_FRINGE_BITMAPS
76 };
77
78 enum fringe_bitmap_align
79 {
80 ALIGN_BITMAP_CENTER = 0,
81 ALIGN_BITMAP_TOP,
82 ALIGN_BITMAP_BOTTOM
83 };
84
85 struct fringe_bitmap
86 {
87 unsigned short *bits;
88 unsigned height : 8;
89 unsigned width : 8;
90 unsigned period : 8;
91 unsigned align : 2;
92 unsigned dynamic : 1;
93 };
94
95 \f
96 /***********************************************************************
97 Fringe bitmaps
98 ***********************************************************************/
99
100 /* Undefined bitmap. A question mark. */
101 /*
102 ..xxxx..
103 .xxxxxx.
104 xx....xx
105 xx....xx
106 ....xx..
107 ...xx...
108 ...xx...
109 ........
110 ...xx...
111 ...xx...
112 */
113 static unsigned short unknown_bits[] = {
114 0x3c, 0x7e, 0x7e, 0x0c, 0x18, 0x18, 0x00, 0x18, 0x18};
115
116 /* An arrow like this: `<-'. */
117 /*
118 ...xx...
119 ..xx....
120 .xx.....
121 xxxxxx..
122 xxxxxx..
123 .xx.....
124 ..xx....
125 ...xx...
126 */
127 static unsigned short left_arrow_bits[] = {
128 0x18, 0x30, 0x60, 0xfc, 0xfc, 0x60, 0x30, 0x18};
129
130
131 /* Right truncation arrow bitmap `->'. */
132 /*
133 ...xx...
134 ....xx..
135 .....xx.
136 ..xxxxxx
137 ..xxxxxx
138 .....xx.
139 ....xx..
140 ...xx...
141 */
142 static unsigned short right_arrow_bits[] = {
143 0x18, 0x0c, 0x06, 0x3f, 0x3f, 0x06, 0x0c, 0x18};
144
145
146 /* Up arrow bitmap. */
147 /*
148 ...xx...
149 ..xxxx..
150 .xxxxxx.
151 xxxxxxxx
152 ...xx...
153 ...xx...
154 ...xx...
155 ...xx...
156 */
157 static unsigned short up_arrow_bits[] = {
158 0x18, 0x3c, 0x7e, 0xff, 0x18, 0x18, 0x18, 0x18};
159
160
161 /* Down arrow bitmap. */
162 /*
163 ...xx...
164 ...xx...
165 ...xx...
166 ...xx...
167 xxxxxxxx
168 .xxxxxx.
169 ..xxxx..
170 ...xx...
171 */
172 static unsigned short down_arrow_bits[] = {
173 0x18, 0x18, 0x18, 0x18, 0xff, 0x7e, 0x3c, 0x18};
174
175 /* Marker for continued lines. */
176 /*
177 ..xxxx..
178 ..xxxxx.
179 ......xx
180 ..x..xxx
181 ..xxxxxx
182 ..xxxxx.
183 ..xxxx..
184 ..xxxxx.
185 */
186 static unsigned short continued_bits[] = {
187 0x3c, 0x3e, 0x03, 0x27, 0x3f, 0x3e, 0x3c, 0x3e};
188
189 /* Marker for continuation lines. */
190 /*
191 ..xxxx..
192 .xxxxx..
193 xx......
194 xxx..x..
195 xxxxxx..
196 .xxxxx..
197 ..xxxx..
198 .xxxxx..
199 */
200 static unsigned short continuation_bits[] = {
201 0x3c, 0x7c, 0xc0, 0xe4, 0xfc, 0x7c, 0x3c, 0x7c};
202
203 /* Overlay arrow bitmap. A triangular arrow. */
204 /*
205 xx......
206 xxxx....
207 xxxxx...
208 xxxxxx..
209 xxxxxx..
210 xxxxx...
211 xxxx....
212 xx......
213 */
214 static unsigned short ov_bits[] = {
215 0xc0, 0xf0, 0xf8, 0xfc, 0xfc, 0xf8, 0xf0, 0xc0};
216
217 #if 0
218 /* Reverse Overlay arrow bitmap. A triangular arrow. */
219 /*
220 ......xx
221 ....xxxx
222 ...xxxxx
223 ..xxxxxx
224 ..xxxxxx
225 ...xxxxx
226 ....xxxx
227 ......xx
228 */
229 static unsigned short rev_ov_bits[] = {
230 0x03, 0x0f, 0x1f, 0x3f, 0x3f, 0x1f, 0x0f, 0x03};
231 #endif
232
233 /* First line bitmap. An top-left angle. */
234 /*
235 xxxxxx..
236 xxxxxx..
237 xx......
238 xx......
239 xx......
240 xx......
241 xx......
242 ........
243 */
244 static unsigned short top_left_angle_bits[] = {
245 0xfc, 0xfc, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0x00};
246
247 /* First line bitmap. An right-up angle. */
248 /*
249 ..xxxxxx
250 ..xxxxxx
251 ......xx
252 ......xx
253 ......xx
254 ......xx
255 ......xx
256 ........
257 */
258 static unsigned short top_right_angle_bits[] = {
259 0x3f, 0x3f, 0x03, 0x03, 0x03, 0x03, 0x03, 0x00};
260
261 /* Last line bitmap. An left-down angle. */
262 /*
263 ........
264 xx......
265 xx......
266 xx......
267 xx......
268 xx......
269 xxxxxx..
270 xxxxxx..
271 */
272 static unsigned short bottom_left_angle_bits[] = {
273 0x00, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0xfc, 0xfc};
274
275 /* Last line bitmap. An right-down angle. */
276 /*
277 ........
278 ......xx
279 ......xx
280 ......xx
281 ......xx
282 ......xx
283 ..xxxxxx
284 ..xxxxxx
285 */
286 static unsigned short bottom_right_angle_bits[] = {
287 0x00, 0x03, 0x03, 0x03, 0x03, 0x03, 0x3f, 0x3f};
288
289 /* First/last line bitmap. An left bracket. */
290 /*
291 xxxxxx..
292 xxxxxx..
293 xx......
294 xx......
295 xx......
296 xx......
297 xx......
298 xx......
299 xxxxxx..
300 xxxxxx..
301 */
302 static unsigned short left_bracket_bits[] = {
303 0xfc, 0xfc, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0xfc, 0xfc};
304
305 /* First/last line bitmap. An right bracket. */
306 /*
307 ..xxxxxx
308 ..xxxxxx
309 ......xx
310 ......xx
311 ......xx
312 ......xx
313 ......xx
314 ......xx
315 ..xxxxxx
316 ..xxxxxx
317 */
318 static unsigned short right_bracket_bits[] = {
319 0x3f, 0x3f, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x3f, 0x3f};
320
321 /* Filled box cursor bitmap. A filled box; max 13 pixels high. */
322 /*
323 xxxxxxx.
324 xxxxxxx.
325 xxxxxxx.
326 xxxxxxx.
327 xxxxxxx.
328 xxxxxxx.
329 xxxxxxx.
330 xxxxxxx.
331 xxxxxxx.
332 xxxxxxx.
333 xxxxxxx.
334 xxxxxxx.
335 xxxxxxx.
336 */
337 static unsigned short filled_box_cursor_bits[] = {
338 0xfe, 0xfe, 0xfe, 0xfe, 0xfe, 0xfe, 0xfe, 0xfe, 0xfe, 0xfe, 0xfe, 0xfe, 0xfe};
339
340 /* Hollow box cursor bitmap. A hollow box; max 13 pixels high. */
341 /*
342 xxxxxxx.
343 x.....x.
344 x.....x.
345 x.....x.
346 x.....x.
347 x.....x.
348 x.....x.
349 x.....x.
350 x.....x.
351 x.....x.
352 x.....x.
353 x.....x.
354 xxxxxxx.
355 */
356 static unsigned short hollow_box_cursor_bits[] = {
357 0xfe, 0x82, 0x82, 0x82, 0x82, 0x82, 0x82, 0x82, 0x82, 0x82, 0x82, 0x82, 0xfe};
358
359 /* Bar cursor bitmap. A vertical bar; max 13 pixels high. */
360 /*
361 xx......
362 xx......
363 xx......
364 xx......
365 xx......
366 xx......
367 xx......
368 xx......
369 xx......
370 xx......
371 xx......
372 xx......
373 xx......
374 */
375 static unsigned short bar_cursor_bits[] = {
376 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0, 0xc0};
377
378 /* HBar cursor bitmap. A horisontal bar; 2 pixels high. */
379 /*
380 xxxxxxx.
381 xxxxxxx.
382 */
383 static unsigned short hbar_cursor_bits[] = {
384 0xfe, 0xfe};
385
386
387 /* Bitmap drawn to indicate lines not displaying text if
388 `indicate-empty-lines' is non-nil. */
389 /*
390 ........
391 ..xxxx..
392 ........
393 ........
394 ..xxxx..
395 ........
396 */
397 static unsigned short zv_bits[] = {
398 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00,
399 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00,
400 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00,
401 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00,
402 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00,
403 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00,
404 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00,
405 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00, 0x00, 0x3c, 0x00};
406
407 /* Hollow square bitmap. */
408 /*
409 .xxxxxx.
410 .x....x.
411 .x....x.
412 .x....x.
413 .x....x.
414 .xxxxxx.
415 */
416 static unsigned short hollow_square_bits[] = {
417 0x7e, 0x42, 0x42, 0x42, 0x42, 0x7e};
418
419
420 #define BYTES_PER_BITMAP_ROW (sizeof (unsigned short))
421 #define STANDARD_BITMAP_HEIGHT(bits) (sizeof (bits)/BYTES_PER_BITMAP_ROW)
422 #define FRBITS(bits) bits, STANDARD_BITMAP_HEIGHT (bits)
423
424 struct fringe_bitmap standard_bitmaps[MAX_STANDARD_FRINGE_BITMAPS] =
425 {
426 { NULL, 0, 0, 0, 0, 0 }, /* NO_FRINGE_BITMAP */
427 { FRBITS (unknown_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
428 { FRBITS (left_arrow_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
429 { FRBITS (right_arrow_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
430 { FRBITS (up_arrow_bits), 8, 0, ALIGN_BITMAP_TOP, 0 },
431 { FRBITS (down_arrow_bits), 8, 0, ALIGN_BITMAP_BOTTOM, 0 },
432 { FRBITS (continued_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
433 { FRBITS (continuation_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
434 { FRBITS (ov_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
435 { FRBITS (top_left_angle_bits), 8, 0, ALIGN_BITMAP_TOP, 0 },
436 { FRBITS (top_right_angle_bits), 8, 0, ALIGN_BITMAP_TOP, 0 },
437 { FRBITS (bottom_left_angle_bits), 8, 0, ALIGN_BITMAP_BOTTOM, 0 },
438 { FRBITS (bottom_right_angle_bits), 8, 0, ALIGN_BITMAP_BOTTOM, 0 },
439 { FRBITS (left_bracket_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
440 { FRBITS (right_bracket_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
441 { FRBITS (filled_box_cursor_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
442 { FRBITS (hollow_box_cursor_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
443 { FRBITS (hollow_square_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
444 { FRBITS (bar_cursor_bits), 8, 0, ALIGN_BITMAP_CENTER, 0 },
445 { FRBITS (hbar_cursor_bits), 8, 0, ALIGN_BITMAP_BOTTOM, 0 },
446 { FRBITS (zv_bits), 8, 3, ALIGN_BITMAP_TOP, 0 },
447 };
448
449 static struct fringe_bitmap **fringe_bitmaps;
450 static Lisp_Object *fringe_faces;
451 static int max_fringe_bitmaps;
452
453 static int max_used_fringe_bitmap = MAX_STANDARD_FRINGE_BITMAPS;
454
455
456 /* Lookup bitmap number for symbol BITMAP.
457 Return 0 if not a bitmap. */
458
459 int
460 lookup_fringe_bitmap (bitmap)
461 Lisp_Object bitmap;
462 {
463 int bn;
464
465 bitmap = Fget (bitmap, Qfringe);
466 if (!INTEGERP (bitmap))
467 return 0;
468
469 bn = XINT (bitmap);
470 if (bn > NO_FRINGE_BITMAP
471 && bn < max_used_fringe_bitmap
472 && (bn < MAX_STANDARD_FRINGE_BITMAPS
473 || fringe_bitmaps[bn] != NULL))
474 return bn;
475
476 return 0;
477 }
478
479 /* Get fringe bitmap name for bitmap number BN.
480
481 Found by traversing Vfringe_bitmaps comparing BN to the
482 fringe property for each symbol.
483
484 Return BN if not found in Vfringe_bitmaps. */
485
486 static Lisp_Object
487 get_fringe_bitmap_name (bn)
488 int bn;
489 {
490 Lisp_Object bitmaps;
491 Lisp_Object num;
492
493 /* Zero means no bitmap -- return nil. */
494 if (bn <= 0)
495 return Qnil;
496
497 bitmaps = Vfringe_bitmaps;
498 num = make_number (bn);
499
500 while (CONSP (bitmaps))
501 {
502 Lisp_Object bitmap = XCAR (bitmaps);
503 if (EQ (num, Fget (bitmap, Qfringe)))
504 return bitmap;
505 bitmaps = XCDR (bitmaps);
506 }
507
508 return num;
509 }
510
511
512 /* Draw the bitmap WHICH in one of the left or right fringes of
513 window W. ROW is the glyph row for which to display the bitmap; it
514 determines the vertical position at which the bitmap has to be
515 drawn.
516 LEFT_P is 1 for left fringe, 0 for right fringe.
517 */
518
519 void
520 draw_fringe_bitmap_1 (w, row, left_p, overlay, which)
521 struct window *w;
522 struct glyph_row *row;
523 int left_p, overlay;
524 enum fringe_bitmap_type which;
525 {
526 struct frame *f = XFRAME (WINDOW_FRAME (w));
527 struct draw_fringe_bitmap_params p;
528 struct fringe_bitmap *fb;
529 int period;
530 int face_id = DEFAULT_FACE_ID;
531
532 p.cursor_p = 0;
533 p.overlay_p = (overlay & 1) == 1;
534 p.cursor_p = (overlay & 2) == 2;
535
536 if (which != NO_FRINGE_BITMAP)
537 {
538 }
539 else if (left_p)
540 {
541 which = row->left_fringe_bitmap;
542 face_id = row->left_fringe_face_id;
543 }
544 else
545 {
546 which = row->right_fringe_bitmap;
547 face_id = row->right_fringe_face_id;
548 }
549
550 if (face_id == DEFAULT_FACE_ID)
551 {
552 Lisp_Object face;
553
554 if ((face = fringe_faces[which], NILP (face))
555 || (face_id = lookup_derived_face (f, face, 'A', FRINGE_FACE_ID, 0),
556 face_id < 0))
557 face_id = FRINGE_FACE_ID;
558 }
559
560 fb = fringe_bitmaps[which];
561 if (fb == NULL)
562 fb = &standard_bitmaps[which < MAX_STANDARD_FRINGE_BITMAPS
563 ? which : UNDEF_FRINGE_BITMAP];
564
565 period = fb->period;
566
567 /* Convert row to frame coordinates. */
568 p.y = WINDOW_TO_FRAME_PIXEL_Y (w, row->y);
569
570 p.which = which;
571 p.bits = fb->bits;
572 p.wd = fb->width;
573
574 p.h = fb->height;
575 p.dh = (period > 0 ? (p.y % period) : 0);
576 p.h -= p.dh;
577 /* Clip bitmap if too high. */
578 if (p.h > row->height)
579 p.h = row->height;
580
581 p.face = FACE_FROM_ID (f, face_id);
582
583 if (p.face == NULL)
584 {
585 /* This could happen after clearing face cache.
586 But it shouldn't happen anymore. ++kfs */
587 return;
588 }
589
590 PREPARE_FACE_FOR_DISPLAY (f, p.face);
591
592 /* Clear left fringe if no bitmap to draw or if bitmap doesn't fill
593 the fringe. */
594 p.bx = -1;
595 if (left_p)
596 {
597 int wd = WINDOW_LEFT_FRINGE_WIDTH (w);
598 int x = window_box_left (w, (WINDOW_HAS_FRINGES_OUTSIDE_MARGINS (w)
599 ? LEFT_MARGIN_AREA
600 : TEXT_AREA));
601 if (p.wd > wd)
602 p.wd = wd;
603 p.x = x - p.wd - (wd - p.wd) / 2;
604
605 if (p.wd < wd || row->height > p.h)
606 {
607 /* If W has a vertical border to its left, don't draw over it. */
608 wd -= ((!WINDOW_LEFTMOST_P (w)
609 && !WINDOW_HAS_VERTICAL_SCROLL_BAR (w))
610 ? 1 : 0);
611 p.bx = x - wd;
612 p.nx = wd;
613 }
614 }
615 else
616 {
617 int x = window_box_right (w,
618 (WINDOW_HAS_FRINGES_OUTSIDE_MARGINS (w)
619 ? RIGHT_MARGIN_AREA
620 : TEXT_AREA));
621 int wd = WINDOW_RIGHT_FRINGE_WIDTH (w);
622 if (p.wd > wd)
623 p.wd = wd;
624 p.x = x + (wd - p.wd) / 2;
625 /* Clear right fringe if no bitmap to draw of if bitmap doesn't fill
626 the fringe. */
627 if (p.wd < wd || row->height > p.h)
628 {
629 p.bx = x;
630 p.nx = wd;
631 }
632 }
633
634 if (p.bx >= 0)
635 {
636 int header_line_height = WINDOW_HEADER_LINE_HEIGHT (w);
637
638 p.by = WINDOW_TO_FRAME_PIXEL_Y (w, max (header_line_height, row->y));
639 p.ny = row->visible_height;
640 }
641
642 /* Adjust y to the offset in the row to start drawing the bitmap. */
643 switch (fb->align)
644 {
645 case ALIGN_BITMAP_CENTER:
646 p.y += (row->height - p.h) / 2;
647 break;
648 case ALIGN_BITMAP_BOTTOM:
649 p.h = fb->height;
650 p.y += (row->visible_height - p.h);
651 break;
652 case ALIGN_BITMAP_TOP:
653 break;
654 }
655
656 rif->draw_fringe_bitmap (w, row, &p);
657 }
658
659 void
660 draw_fringe_bitmap (w, row, left_p)
661 struct window *w;
662 struct glyph_row *row;
663 int left_p;
664 {
665 int overlay = 0;
666
667 if (!left_p && row->cursor_in_fringe_p)
668 {
669 int cursor = NO_FRINGE_BITMAP;
670
671 switch (w->phys_cursor_type)
672 {
673 case HOLLOW_BOX_CURSOR:
674 if (row->visible_height >= STANDARD_BITMAP_HEIGHT (hollow_box_cursor_bits))
675 cursor = HOLLOW_BOX_CURSOR_BITMAP;
676 else
677 cursor = HOLLOW_SQUARE_BITMAP;
678 break;
679 case FILLED_BOX_CURSOR:
680 cursor = FILLED_BOX_CURSOR_BITMAP;
681 break;
682 case BAR_CURSOR:
683 cursor = BAR_CURSOR_BITMAP;
684 break;
685 case HBAR_CURSOR:
686 cursor = HBAR_CURSOR_BITMAP;
687 break;
688 case NO_CURSOR:
689 default:
690 w->phys_cursor_on_p = 0;
691 row->cursor_in_fringe_p = 0;
692 break;
693 }
694 if (cursor != NO_FRINGE_BITMAP)
695 {
696 draw_fringe_bitmap_1 (w, row, 0, 2, cursor);
697 overlay = cursor == FILLED_BOX_CURSOR_BITMAP ? 3 : 1;
698 }
699 }
700
701 draw_fringe_bitmap_1 (w, row, left_p, overlay, NO_FRINGE_BITMAP);
702
703 if (left_p && row->overlay_arrow_bitmap != NO_FRINGE_BITMAP)
704 draw_fringe_bitmap_1 (w, row, 1, 1,
705 (row->overlay_arrow_bitmap < 0
706 ? OVERLAY_ARROW_BITMAP
707 : row->overlay_arrow_bitmap));
708 }
709
710
711 /* Draw fringe bitmaps for glyph row ROW on window W. Call this
712 function with input blocked. */
713
714 void
715 draw_row_fringe_bitmaps (w, row)
716 struct window *w;
717 struct glyph_row *row;
718 {
719 xassert (interrupt_input_blocked);
720
721 /* If row is completely invisible, because of vscrolling, we
722 don't have to draw anything. */
723 if (row->visible_height <= 0)
724 return;
725
726 if (WINDOW_LEFT_FRINGE_WIDTH (w) != 0)
727 draw_fringe_bitmap (w, row, 1);
728
729 if (WINDOW_RIGHT_FRINGE_WIDTH (w) != 0)
730 draw_fringe_bitmap (w, row, 0);
731 }
732
733 /* Draw the fringes of window W. Only fringes for rows marked for
734 update in redraw_fringe_bitmaps_p are drawn.
735
736 Return >0 if left or right fringe was redrawn in any way.
737
738 If NO_FRINGE is non-zero, also return >0 if either fringe has zero width.
739
740 A return value >0 indicates that the vertical line between windows
741 needs update (as it may be drawn in the fringe).
742 */
743
744 int
745 draw_window_fringes (w, no_fringe)
746 struct window *w;
747 int no_fringe;
748 {
749 struct glyph_row *row;
750 int yb = window_text_bottom_y (w);
751 int nrows = w->current_matrix->nrows;
752 int y = 0, rn;
753 int updated = 0;
754
755 if (w->pseudo_window_p)
756 return 0;
757
758 /* Must draw line if no fringe */
759 if (no_fringe
760 && (WINDOW_LEFT_FRINGE_WIDTH (w) == 0
761 || WINDOW_RIGHT_FRINGE_WIDTH (w) == 0))
762 updated++;
763
764 for (y = 0, rn = 0, row = w->current_matrix->rows;
765 y < yb && rn < nrows;
766 y += row->height, ++row, ++rn)
767 {
768 if (!row->redraw_fringe_bitmaps_p)
769 continue;
770 draw_row_fringe_bitmaps (w, row);
771 row->redraw_fringe_bitmaps_p = 0;
772 updated++;
773 }
774
775 return updated;
776 }
777
778
779 /* Recalculate the bitmaps to show in the fringes of window W.
780 Only mark rows with modified bitmaps for update in redraw_fringe_bitmaps_p.
781
782 If KEEP_CURRENT_P is 0, update current_matrix too. */
783
784 int
785 update_window_fringes (w, keep_current_p)
786 struct window *w;
787 int keep_current_p;
788 {
789 struct glyph_row *row, *cur = 0;
790 int yb = window_text_bottom_y (w);
791 int rn, nrows = w->current_matrix->nrows;
792 int y;
793 int redraw_p = 0;
794 Lisp_Object boundary_top = Qnil, boundary_bot = Qnil;
795 Lisp_Object arrow_top = Qnil, arrow_bot = Qnil;
796 Lisp_Object empty_pos;
797 Lisp_Object ind = Qnil;
798
799 if (w->pseudo_window_p)
800 return 0;
801
802 if (!MINI_WINDOW_P (w)
803 && (ind = XBUFFER (w->buffer)->indicate_buffer_boundaries, !NILP (ind)))
804 {
805 if (EQ (ind, Qleft) || EQ (ind, Qright))
806 boundary_top = boundary_bot = arrow_top = arrow_bot = ind;
807 else if (CONSP (ind) && CONSP (XCAR (ind)))
808 {
809 Lisp_Object pos;
810 if (pos = Fassq (Qt, ind), !NILP (pos))
811 boundary_top = boundary_bot = arrow_top = arrow_bot = XCDR (pos);
812 if (pos = Fassq (Qtop, ind), !NILP (pos))
813 boundary_top = XCDR (pos);
814 if (pos = Fassq (Qbottom, ind), !NILP (pos))
815 boundary_bot = XCDR (pos);
816 if (pos = Fassq (Qup, ind), !NILP (pos))
817 arrow_top = XCDR (pos);
818 if (pos = Fassq (Qdown, ind), !NILP (pos))
819 arrow_bot = XCDR (pos);
820 }
821 else
822 /* Anything else means boundary on left and no arrows. */
823 boundary_top = boundary_bot = Qleft;
824 }
825
826 if (!NILP (ind))
827 {
828 int done_top = 0, done_bot = 0;
829
830 for (y = 0, rn = 0;
831 y < yb && rn < nrows;
832 y += row->height, ++rn)
833 {
834 unsigned indicate_bob_p, indicate_top_line_p;
835 unsigned indicate_eob_p, indicate_bottom_line_p;
836
837 row = w->desired_matrix->rows + rn;
838 if (!row->enabled_p)
839 row = w->current_matrix->rows + rn;
840
841 indicate_bob_p = row->indicate_bob_p;
842 indicate_top_line_p = row->indicate_top_line_p;
843 indicate_eob_p = row->indicate_eob_p;
844 indicate_bottom_line_p = row->indicate_bottom_line_p;
845
846 row->indicate_bob_p = row->indicate_top_line_p = 0;
847 row->indicate_eob_p = row->indicate_bottom_line_p = 0;
848
849 if (!row->mode_line_p)
850 {
851 if (!done_top)
852 {
853 if (MATRIX_ROW_START_CHARPOS (row) <= BUF_BEGV (XBUFFER (w->buffer))
854 && !MATRIX_ROW_PARTIALLY_VISIBLE_AT_TOP_P (w, row))
855 row->indicate_bob_p = !NILP (boundary_top);
856 else
857 row->indicate_top_line_p = !NILP (arrow_top);
858 done_top = 1;
859 }
860
861 if (!done_bot)
862 {
863 if (MATRIX_ROW_END_CHARPOS (row) >= BUF_ZV (XBUFFER (w->buffer))
864 && !MATRIX_ROW_PARTIALLY_VISIBLE_AT_BOTTOM_P (w, row))
865 row->indicate_eob_p = !NILP (boundary_bot), done_bot = 1;
866 else if (y + row->height >= yb)
867 row->indicate_bottom_line_p = !NILP (arrow_bot), done_bot = 1;
868 }
869 }
870
871 if (indicate_bob_p != row->indicate_bob_p
872 || indicate_top_line_p != row->indicate_top_line_p
873 || indicate_eob_p != row->indicate_eob_p
874 || indicate_bottom_line_p != row->indicate_bottom_line_p)
875 row->redraw_fringe_bitmaps_p = 1;
876 }
877 }
878
879 empty_pos = XBUFFER (w->buffer)->indicate_empty_lines;
880 if (!NILP (empty_pos) && !EQ (empty_pos, Qright))
881 empty_pos = WINDOW_LEFT_FRINGE_WIDTH (w) == 0 ? Qright : Qleft;
882
883 for (y = 0, rn = 0;
884 y < yb && rn < nrows;
885 y += row->height, rn++)
886 {
887 enum fringe_bitmap_type left, right;
888 unsigned left_face_id, right_face_id;
889
890 row = w->desired_matrix->rows + rn;
891 cur = w->current_matrix->rows + rn;
892 if (!row->enabled_p)
893 row = cur;
894
895 left_face_id = right_face_id = DEFAULT_FACE_ID;
896
897 /* Decide which bitmap to draw in the left fringe. */
898 if (WINDOW_LEFT_FRINGE_WIDTH (w) == 0)
899 left = NO_FRINGE_BITMAP;
900 else if (row->left_user_fringe_bitmap != NO_FRINGE_BITMAP)
901 {
902 left = row->left_user_fringe_bitmap;
903 left_face_id = row->left_user_fringe_face_id;
904 }
905 else if (row->truncated_on_left_p)
906 left = LEFT_TRUNCATION_BITMAP;
907 else if (row->indicate_bob_p && EQ (boundary_top, Qleft))
908 left = ((row->indicate_eob_p && EQ (boundary_bot, Qleft))
909 ? LEFT_BRACKET_BITMAP : TOP_LEFT_ANGLE_BITMAP);
910 else if (row->indicate_eob_p && EQ (boundary_bot, Qleft))
911 left = BOTTOM_LEFT_ANGLE_BITMAP;
912 else if (MATRIX_ROW_CONTINUATION_LINE_P (row))
913 left = CONTINUATION_LINE_BITMAP;
914 else if (row->indicate_empty_line_p && EQ (empty_pos, Qleft))
915 left = ZV_LINE_BITMAP;
916 else if (row->indicate_top_line_p && EQ (arrow_top, Qleft))
917 left = UP_ARROW_BITMAP;
918 else if (row->indicate_bottom_line_p && EQ (arrow_bot, Qleft))
919 left = DOWN_ARROW_BITMAP;
920 else
921 left = NO_FRINGE_BITMAP;
922
923 /* Decide which bitmap to draw in the right fringe. */
924 if (WINDOW_RIGHT_FRINGE_WIDTH (w) == 0)
925 right = NO_FRINGE_BITMAP;
926 else if (row->right_user_fringe_bitmap != NO_FRINGE_BITMAP)
927 {
928 right = row->right_user_fringe_bitmap;
929 right_face_id = row->right_user_fringe_face_id;
930 }
931 else if (row->truncated_on_right_p)
932 right = RIGHT_TRUNCATION_BITMAP;
933 else if (row->indicate_bob_p && EQ (boundary_top, Qright))
934 right = ((row->indicate_eob_p && EQ (boundary_bot, Qright))
935 ? RIGHT_BRACKET_BITMAP : TOP_RIGHT_ANGLE_BITMAP);
936 else if (row->indicate_eob_p && EQ (boundary_bot, Qright))
937 right = BOTTOM_RIGHT_ANGLE_BITMAP;
938 else if (row->continued_p)
939 right = CONTINUED_LINE_BITMAP;
940 else if (row->indicate_top_line_p && EQ (arrow_top, Qright))
941 right = UP_ARROW_BITMAP;
942 else if (row->indicate_bottom_line_p && EQ (arrow_bot, Qright))
943 right = DOWN_ARROW_BITMAP;
944 else if (row->indicate_empty_line_p && EQ (empty_pos, Qright))
945 right = ZV_LINE_BITMAP;
946 else
947 right = NO_FRINGE_BITMAP;
948
949 if (row->y != cur->y
950 || row->visible_height != cur->visible_height
951 || row->ends_at_zv_p != cur->ends_at_zv_p
952 || left != cur->left_fringe_bitmap
953 || right != cur->right_fringe_bitmap
954 || left_face_id != cur->left_fringe_face_id
955 || right_face_id != cur->right_fringe_face_id
956 || cur->redraw_fringe_bitmaps_p)
957 {
958 redraw_p = row->redraw_fringe_bitmaps_p = 1;
959 if (!keep_current_p)
960 {
961 cur->redraw_fringe_bitmaps_p = 1;
962 cur->left_fringe_bitmap = left;
963 cur->right_fringe_bitmap = right;
964 cur->left_fringe_face_id = left_face_id;
965 cur->right_fringe_face_id = right_face_id;
966 }
967 }
968
969 if (row->overlay_arrow_bitmap != cur->overlay_arrow_bitmap)
970 {
971 redraw_p = row->redraw_fringe_bitmaps_p = cur->redraw_fringe_bitmaps_p = 1;
972 cur->overlay_arrow_bitmap = row->overlay_arrow_bitmap;
973 }
974
975 row->left_fringe_bitmap = left;
976 row->right_fringe_bitmap = right;
977 row->left_fringe_face_id = left_face_id;
978 row->right_fringe_face_id = right_face_id;
979
980 if (rn > 0 && row->redraw_fringe_bitmaps_p)
981 row[-1].redraw_fringe_bitmaps_p = cur[-1].redraw_fringe_bitmaps_p = 1;
982 }
983
984 return redraw_p && !keep_current_p;
985 }
986
987
988 /* Compute actual fringe widths for frame F.
989
990 If REDRAW is 1, redraw F if the fringe settings was actually
991 modified and F is visible.
992
993 Since the combined left and right fringe must occupy an integral
994 number of columns, we may need to add some pixels to each fringe.
995 Typically, we add an equal amount (+/- 1 pixel) to each fringe,
996 but a negative width value is taken literally (after negating it).
997
998 We never make the fringes narrower than specified.
999 */
1000
1001 void
1002 compute_fringe_widths (f, redraw)
1003 struct frame *f;
1004 int redraw;
1005 {
1006 int o_left = FRAME_LEFT_FRINGE_WIDTH (f);
1007 int o_right = FRAME_RIGHT_FRINGE_WIDTH (f);
1008 int o_cols = FRAME_FRINGE_COLS (f);
1009
1010 Lisp_Object left_fringe = Fassq (Qleft_fringe, f->param_alist);
1011 Lisp_Object right_fringe = Fassq (Qright_fringe, f->param_alist);
1012 int left_fringe_width, right_fringe_width;
1013
1014 if (!NILP (left_fringe))
1015 left_fringe = Fcdr (left_fringe);
1016 if (!NILP (right_fringe))
1017 right_fringe = Fcdr (right_fringe);
1018
1019 left_fringe_width = ((NILP (left_fringe) || !INTEGERP (left_fringe)) ? 8 :
1020 XINT (left_fringe));
1021 right_fringe_width = ((NILP (right_fringe) || !INTEGERP (right_fringe)) ? 8 :
1022 XINT (right_fringe));
1023
1024 if (left_fringe_width || right_fringe_width)
1025 {
1026 int left_wid = left_fringe_width >= 0 ? left_fringe_width : -left_fringe_width;
1027 int right_wid = right_fringe_width >= 0 ? right_fringe_width : -right_fringe_width;
1028 int conf_wid = left_wid + right_wid;
1029 int font_wid = FRAME_COLUMN_WIDTH (f);
1030 int cols = (left_wid + right_wid + font_wid-1) / font_wid;
1031 int real_wid = cols * font_wid;
1032 if (left_wid && right_wid)
1033 {
1034 if (left_fringe_width < 0)
1035 {
1036 /* Left fringe width is fixed, adjust right fringe if necessary */
1037 FRAME_LEFT_FRINGE_WIDTH (f) = left_wid;
1038 FRAME_RIGHT_FRINGE_WIDTH (f) = real_wid - left_wid;
1039 }
1040 else if (right_fringe_width < 0)
1041 {
1042 /* Right fringe width is fixed, adjust left fringe if necessary */
1043 FRAME_LEFT_FRINGE_WIDTH (f) = real_wid - right_wid;
1044 FRAME_RIGHT_FRINGE_WIDTH (f) = right_wid;
1045 }
1046 else
1047 {
1048 /* Adjust both fringes with an equal amount.
1049 Note that we are doing integer arithmetic here, so don't
1050 lose a pixel if the total width is an odd number. */
1051 int fill = real_wid - conf_wid;
1052 FRAME_LEFT_FRINGE_WIDTH (f) = left_wid + fill/2;
1053 FRAME_RIGHT_FRINGE_WIDTH (f) = right_wid + fill - fill/2;
1054 }
1055 }
1056 else if (left_fringe_width)
1057 {
1058 FRAME_LEFT_FRINGE_WIDTH (f) = real_wid;
1059 FRAME_RIGHT_FRINGE_WIDTH (f) = 0;
1060 }
1061 else
1062 {
1063 FRAME_LEFT_FRINGE_WIDTH (f) = 0;
1064 FRAME_RIGHT_FRINGE_WIDTH (f) = real_wid;
1065 }
1066 FRAME_FRINGE_COLS (f) = cols;
1067 }
1068 else
1069 {
1070 FRAME_LEFT_FRINGE_WIDTH (f) = 0;
1071 FRAME_RIGHT_FRINGE_WIDTH (f) = 0;
1072 FRAME_FRINGE_COLS (f) = 0;
1073 }
1074
1075 if (redraw && FRAME_VISIBLE_P (f))
1076 if (o_left != FRAME_LEFT_FRINGE_WIDTH (f) ||
1077 o_right != FRAME_RIGHT_FRINGE_WIDTH (f) ||
1078 o_cols != FRAME_FRINGE_COLS (f))
1079 redraw_frame (f);
1080 }
1081
1082
1083 /* Free resources used by a user-defined bitmap. */
1084
1085 void
1086 destroy_fringe_bitmap (n)
1087 int n;
1088 {
1089 struct fringe_bitmap **fbp;
1090
1091 fringe_faces[n] = Qnil;
1092
1093 fbp = &fringe_bitmaps[n];
1094 if (*fbp && (*fbp)->dynamic)
1095 {
1096 if (rif && rif->destroy_fringe_bitmap)
1097 rif->destroy_fringe_bitmap (n);
1098 xfree (*fbp);
1099 *fbp = NULL;
1100 }
1101
1102 while (max_used_fringe_bitmap > MAX_STANDARD_FRINGE_BITMAPS
1103 && fringe_bitmaps[max_used_fringe_bitmap - 1] == NULL)
1104 max_used_fringe_bitmap--;
1105 }
1106
1107
1108 DEFUN ("destroy-fringe-bitmap", Fdestroy_fringe_bitmap, Sdestroy_fringe_bitmap,
1109 1, 1, 0,
1110 doc: /* Destroy fringe bitmap BITMAP.
1111 If BITMAP overrides a standard fringe bitmap, the original bitmap is restored. */)
1112 (bitmap)
1113 Lisp_Object bitmap;
1114 {
1115 int n;
1116
1117 CHECK_SYMBOL (bitmap);
1118 n = lookup_fringe_bitmap (bitmap);
1119 if (!n)
1120 return Qnil;
1121
1122 destroy_fringe_bitmap (n);
1123
1124 if (n >= MAX_STANDARD_FRINGE_BITMAPS)
1125 {
1126 Vfringe_bitmaps = Fdelq (bitmap, Vfringe_bitmaps);
1127 /* It would be better to remove the fringe property. */
1128 Fput (bitmap, Qfringe, Qnil);
1129 }
1130
1131 return Qnil;
1132 }
1133
1134
1135 /* Initialize bitmap bit.
1136
1137 On X, we bit-swap the built-in bitmaps and reduce bitmap
1138 from short to char array if width is <= 8 bits.
1139
1140 On MAC with big-endian CPU, we need to byte-swap each short.
1141
1142 On W32 and MAC (little endian), there's no need to do this.
1143 */
1144
1145 void
1146 init_fringe_bitmap (which, fb, once_p)
1147 enum fringe_bitmap_type which;
1148 struct fringe_bitmap *fb;
1149 int once_p;
1150 {
1151 if (once_p || fb->dynamic)
1152 {
1153 #if defined (HAVE_X_WINDOWS)
1154 static unsigned char swap_nibble[16]
1155 = { 0x0, 0x8, 0x4, 0xc, /* 0000 1000 0100 1100 */
1156 0x2, 0xa, 0x6, 0xe, /* 0010 1010 0110 1110 */
1157 0x1, 0x9, 0x5, 0xd, /* 0001 1001 0101 1101 */
1158 0x3, 0xb, 0x7, 0xf }; /* 0011 1011 0111 1111 */
1159 unsigned short *bits = fb->bits;
1160 int j;
1161
1162 if (fb->width <= 8)
1163 {
1164 unsigned char *cbits = (unsigned char *)fb->bits;
1165 for (j = 0; j < fb->height; j++)
1166 {
1167 unsigned short b = *bits++;
1168 unsigned char c;
1169 c = (unsigned char)((swap_nibble[b & 0xf] << 4)
1170 | (swap_nibble[(b>>4) & 0xf]));
1171 *cbits++ = (c >> (8 - fb->width));
1172 }
1173 }
1174 else
1175 {
1176 for (j = 0; j < fb->height; j++)
1177 {
1178 unsigned short b = *bits;
1179 b = (unsigned short)((swap_nibble[b & 0xf] << 12)
1180 | (swap_nibble[(b>>4) & 0xf] << 8)
1181 | (swap_nibble[(b>>8) & 0xf] << 4)
1182 | (swap_nibble[(b>>12) & 0xf]));
1183 *bits++ = (b >> (16 - fb->width));
1184 }
1185 }
1186 #endif /* HAVE_X_WINDOWS */
1187
1188 #if defined (MAC_OS) && defined (WORDS_BIG_ENDIAN)
1189 unsigned short *bits = fb->bits;
1190 int j;
1191 for (j = 0; j < fb->height; j++)
1192 {
1193 unsigned short b = *bits;
1194 *bits++ = ((b >> 8) & 0xff) | ((b & 0xff) << 8);
1195 }
1196 #endif /* MAC_OS && WORDS_BIG_ENDIAN */
1197 }
1198
1199 if (!once_p)
1200 {
1201 destroy_fringe_bitmap (which);
1202
1203 if (rif && rif->define_fringe_bitmap)
1204 rif->define_fringe_bitmap (which, fb->bits, fb->height, fb->width);
1205
1206 fringe_bitmaps[which] = fb;
1207 if (which >= max_used_fringe_bitmap)
1208 max_used_fringe_bitmap = which + 1;
1209 }
1210 }
1211
1212
1213 DEFUN ("define-fringe-bitmap", Fdefine_fringe_bitmap, Sdefine_fringe_bitmap,
1214 2, 5, 0,
1215 doc: /* Define fringe bitmap BITMAP from BITS of size HEIGHT x WIDTH.
1216 BITMAP is a symbol or string naming the new fringe bitmap.
1217 BITS is either a string or a vector of integers.
1218 HEIGHT is height of bitmap. If HEIGHT is nil, use length of BITS.
1219 WIDTH must be an integer between 1 and 16, or nil which defaults to 8.
1220 Optional fifth arg ALIGN may be one of `top', `center', or `bottom',
1221 indicating the positioning of the bitmap relative to the rows where it
1222 is used; the default is to center the bitmap. Fourth arg may also be a
1223 list (ALIGN PERIODIC) where PERIODIC non-nil specifies that the bitmap
1224 should be repeated.
1225 If BITMAP already exists, the existing definition is replaced. */)
1226 (bitmap, bits, height, width, align)
1227 Lisp_Object bitmap, bits, height, width, align;
1228 {
1229 int n, h, i, j;
1230 unsigned short *b;
1231 struct fringe_bitmap fb, *xfb;
1232 int fill1 = 0, fill2 = 0;
1233
1234 CHECK_SYMBOL (bitmap);
1235
1236 if (STRINGP (bits))
1237 h = SCHARS (bits);
1238 else if (VECTORP (bits))
1239 h = XVECTOR (bits)->size;
1240 else
1241 bits = wrong_type_argument (Qsequencep, bits);
1242
1243 if (NILP (height))
1244 fb.height = h;
1245 else
1246 {
1247 CHECK_NUMBER (height);
1248 fb.height = min (XINT (height), 255);
1249 if (fb.height > h)
1250 {
1251 fill1 = (fb.height - h) / 2;
1252 fill2 = fb.height - h - fill1;
1253 }
1254 }
1255
1256 if (NILP (width))
1257 fb.width = 8;
1258 else
1259 {
1260 CHECK_NUMBER (width);
1261 fb.width = min (XINT (width), 255);
1262 }
1263
1264 fb.period = 0;
1265 fb.align = ALIGN_BITMAP_CENTER;
1266
1267 if (CONSP (align))
1268 {
1269 Lisp_Object period = XCDR (align);
1270 if (CONSP (period))
1271 {
1272 period = XCAR (period);
1273 if (!NILP (period))
1274 {
1275 fb.period = fb.height;
1276 fb.height = 255;
1277 }
1278 }
1279 align = XCAR (align);
1280 }
1281 if (EQ (align, Qtop))
1282 fb.align = ALIGN_BITMAP_TOP;
1283 else if (EQ (align, Qbottom))
1284 fb.align = ALIGN_BITMAP_BOTTOM;
1285 else if (!NILP (align) && !EQ (align, Qcenter))
1286 error ("Bad align argument");
1287
1288 n = lookup_fringe_bitmap (bitmap);
1289 if (!n)
1290 {
1291 if (max_used_fringe_bitmap < max_fringe_bitmaps)
1292 n = max_used_fringe_bitmap++;
1293 else
1294 {
1295 for (n = MAX_STANDARD_FRINGE_BITMAPS;
1296 n < max_fringe_bitmaps;
1297 n++)
1298 if (fringe_bitmaps[n] == NULL)
1299 break;
1300
1301 if (n == max_fringe_bitmaps)
1302 {
1303 if ((max_fringe_bitmaps + 20) > MAX_FRINGE_BITMAPS)
1304 error ("No free fringe bitmap slots");
1305
1306 i = max_fringe_bitmaps;
1307 max_fringe_bitmaps += 20;
1308 fringe_bitmaps
1309 = ((struct fringe_bitmap **)
1310 xrealloc (fringe_bitmaps, max_fringe_bitmaps * sizeof (struct fringe_bitmap *)));
1311 fringe_faces
1312 = (Lisp_Object *) xrealloc (fringe_faces, max_fringe_bitmaps * sizeof (Lisp_Object));
1313
1314 for (; i < max_fringe_bitmaps; i++)
1315 {
1316 fringe_bitmaps[i] = NULL;
1317 fringe_faces[i] = Qnil;
1318 }
1319 }
1320 }
1321
1322 Vfringe_bitmaps = Fcons (bitmap, Vfringe_bitmaps);
1323 Fput (bitmap, Qfringe, make_number (n));
1324 }
1325
1326 fb.dynamic = 1;
1327
1328 xfb = (struct fringe_bitmap *) xmalloc (sizeof fb
1329 + fb.height * BYTES_PER_BITMAP_ROW);
1330 fb.bits = b = (unsigned short *) (xfb + 1);
1331 bzero (b, fb.height);
1332
1333 j = 0;
1334 while (j < fb.height)
1335 {
1336 for (i = 0; i < fill1 && j < fb.height; i++)
1337 b[j++] = 0;
1338 for (i = 0; i < h && j < fb.height; i++)
1339 {
1340 Lisp_Object elt = Faref (bits, make_number (i));
1341 b[j++] = NUMBERP (elt) ? XINT (elt) : 0;
1342 }
1343 for (i = 0; i < fill2 && j < fb.height; i++)
1344 b[j++] = 0;
1345 }
1346
1347 *xfb = fb;
1348
1349 init_fringe_bitmap (n, xfb, 0);
1350
1351 return bitmap;
1352 }
1353
1354 DEFUN ("set-fringe-bitmap-face", Fset_fringe_bitmap_face, Sset_fringe_bitmap_face,
1355 1, 2, 0,
1356 doc: /* Set face for fringe bitmap BITMAP to FACE.
1357 If FACE is nil, reset face to default fringe face. */)
1358 (bitmap, face)
1359 Lisp_Object bitmap, face;
1360 {
1361 int n;
1362 int face_id;
1363
1364 CHECK_SYMBOL (bitmap);
1365 n = lookup_fringe_bitmap (bitmap);
1366 if (!n)
1367 error ("Undefined fringe bitmap");
1368
1369 if (!NILP (face))
1370 {
1371 face_id = lookup_derived_face (SELECTED_FRAME (), face,
1372 'A', FRINGE_FACE_ID, 1);
1373 if (face_id < 0)
1374 error ("No such face");
1375 }
1376
1377 fringe_faces[n] = face;
1378
1379 return Qnil;
1380 }
1381
1382 DEFUN ("fringe-bitmaps-at-pos", Ffringe_bitmaps_at_pos, Sfringe_bitmaps_at_pos,
1383 0, 2, 0,
1384 doc: /* Return fringe bitmaps of row containing position POS in window WINDOW.
1385 If WINDOW is nil, use selected window. If POS is nil, use value of point
1386 in that window. Return value is a list (LEFT RIGHT OV), where LEFT
1387 is the symbol for the bitmap in the left fringe (or nil if no bitmap),
1388 RIGHT is similar for the right fringe, and OV is non-nil if there is an
1389 overlay arrow in the left fringe.
1390 Return nil if POS is not visible in WINDOW. */)
1391 (pos, window)
1392 Lisp_Object pos, window;
1393 {
1394 struct window *w;
1395 struct glyph_row *row;
1396 int textpos;
1397
1398 if (NILP (window))
1399 window = selected_window;
1400 CHECK_WINDOW (window);
1401 w = XWINDOW (window);
1402
1403 if (!NILP (pos))
1404 {
1405 CHECK_NUMBER_COERCE_MARKER (pos);
1406 textpos = XINT (pos);
1407 }
1408 else if (w == XWINDOW (selected_window))
1409 textpos = PT;
1410 else
1411 textpos = XMARKER (w->pointm)->charpos;
1412
1413 row = MATRIX_FIRST_TEXT_ROW (w->current_matrix);
1414 row = row_containing_pos (w, textpos, row, NULL, 0);
1415 if (row)
1416 return list3 (get_fringe_bitmap_name (row->left_fringe_bitmap),
1417 get_fringe_bitmap_name (row->right_fringe_bitmap),
1418 (row->overlay_arrow_bitmap == 0 ? Qnil
1419 : row->overlay_arrow_bitmap < 0 ? Qt
1420 : get_fringe_bitmap_name (row->overlay_arrow_bitmap)));
1421 else
1422 return Qnil;
1423 }
1424
1425
1426 /***********************************************************************
1427 Initialization
1428 ***********************************************************************/
1429
1430 void
1431 syms_of_fringe ()
1432 {
1433 defsubr (&Sdestroy_fringe_bitmap);
1434 defsubr (&Sdefine_fringe_bitmap);
1435 defsubr (&Sfringe_bitmaps_at_pos);
1436 defsubr (&Sset_fringe_bitmap_face);
1437
1438 DEFVAR_LISP ("overflow-newline-into-fringe", &Voverflow_newline_into_fringe,
1439 doc: /* *Non-nil means that newline may flow into the right fringe.
1440 This means that display lines which are exactly as wide as the window
1441 (not counting the final newline) will only occupy one screen line, by
1442 showing (or hiding) the final newline in the right fringe; when point
1443 is at the final newline, the cursor is shown in the right fringe.
1444 If nil, also continue lines which are exactly as wide as the window. */);
1445 Voverflow_newline_into_fringe = Qt;
1446
1447 DEFVAR_LISP ("fringe-bitmaps", &Vfringe_bitmaps,
1448 doc: /* List of fringe bitmap symbols.
1449 You must (require 'fringe) to use fringe bitmap symbols in your programs." */);
1450 Vfringe_bitmaps = Qnil;
1451 }
1452
1453 /* Garbage collection hook */
1454
1455 void
1456 mark_fringe_data ()
1457 {
1458 int i;
1459
1460 for (i = 0; i < max_fringe_bitmaps; i++)
1461 if (!NILP (fringe_faces[i]))
1462 mark_object (fringe_faces[i]);
1463 }
1464
1465 /* Initialize this module when Emacs starts. */
1466
1467 void
1468 init_fringe_once ()
1469 {
1470 enum fringe_bitmap_type bt;
1471
1472 for (bt = NO_FRINGE_BITMAP + 1; bt < MAX_STANDARD_FRINGE_BITMAPS; bt++)
1473 init_fringe_bitmap(bt, &standard_bitmaps[bt], 1);
1474 }
1475
1476 void
1477 init_fringe ()
1478 {
1479 int i;
1480
1481 max_fringe_bitmaps = MAX_STANDARD_FRINGE_BITMAPS + 20;
1482
1483 fringe_bitmaps
1484 = (struct fringe_bitmap **) xmalloc (max_fringe_bitmaps * sizeof (struct fringe_bitmap *));
1485 fringe_faces
1486 = (Lisp_Object *) xmalloc (max_fringe_bitmaps * sizeof (Lisp_Object));
1487
1488 for (i = 0; i < max_fringe_bitmaps; i++)
1489 {
1490 fringe_bitmaps[i] = NULL;
1491 fringe_faces[i] = Qnil;
1492 }
1493 }
1494
1495 #ifdef HAVE_NTGUI
1496
1497 void
1498 w32_init_fringe ()
1499 {
1500 enum fringe_bitmap_type bt;
1501
1502 if (!rif)
1503 return;
1504
1505 for (bt = NO_FRINGE_BITMAP + 1; bt < MAX_STANDARD_FRINGE_BITMAPS; bt++)
1506 {
1507 struct fringe_bitmap *fb = &standard_bitmaps[bt];
1508 rif->define_fringe_bitmap (bt, fb->bits, fb->height, fb->width);
1509 }
1510 }
1511
1512 void
1513 w32_reset_fringes ()
1514 {
1515 /* Destroy row bitmaps. */
1516 int bt;
1517
1518 if (!rif)
1519 return;
1520
1521 for (bt = NO_FRINGE_BITMAP + 1; bt < max_used_fringe_bitmap; bt++)
1522 rif->destroy_fringe_bitmap (bt);
1523 }
1524
1525 #endif /* HAVE_NTGUI */
1526
1527 #endif /* HAVE_WINDOW_SYSTEM */
1528
1529 /* arch-tag: 04596920-43eb-473d-b319-82712338162d
1530 (do not change this comment) */