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