2 * Copyright (C) 1984-2019 Mark Nudelman
4 * You may distribute under the terms of either the GNU General Public
5 * License or the Less License, as specified in the README file.
7 * For more information, see the README file.
12 * Routines to search a file for a pattern.
19 #define MINPOS(a,b) (((a) < (b)) ? (a) : (b))
20 #define MAXPOS(a,b) (((a) > (b)) ? (a) : (b))
23 extern int how_search
;
27 extern int jump_sline
;
30 extern int status_col
;
31 extern void *ml_search
;
32 extern POSITION start_attnpos
;
33 extern POSITION end_attnpos
;
35 extern int screen_trashed
;
37 extern int hilite_search
;
38 extern int size_linebuf
;
40 extern int can_goto_line
;
41 static int hide_hilite
;
42 static POSITION prep_startpos
;
43 static POSITION prep_endpos
;
44 static int is_caseless
;
45 static int is_ucase_pattern
;
48 * Structures for maintaining a set of ranges for hilites and filtered-out
49 * lines. Each range is stored as a node within a red-black tree, and we
50 * try to extend existing ranges (without creating overlaps) rather than
51 * create new nodes if possible. We remember the last node found by a
52 * search for constant-time lookup if the next search is near enough to
53 * the previous. To aid that, we overlay a secondary doubly-linked list
54 * on top of the red-black tree so we can find the preceding/succeeding
55 * nodes also in constant time.
57 * Each node is allocated from a series of pools, each pool double the size
58 * of the previous (for amortised constant time allocation). Since our only
59 * tree operations are clear and node insertion, not node removal, we don't
60 * need to maintain a usage bitmap or freelist and can just return nodes
61 * from the pool in-order until capacity is reached.
70 struct hilite_node
*parent
;
71 struct hilite_node
*left
;
72 struct hilite_node
*right
;
73 struct hilite_node
*prev
;
74 struct hilite_node
*next
;
82 struct hilite_storage
*next
;
83 struct hilite_node
*nodes
;
87 struct hilite_storage
*first
;
88 struct hilite_storage
*current
;
89 struct hilite_node
*root
;
90 struct hilite_node
*lookaside
;
92 #define HILITE_INITIALIZER() { NULL, NULL, NULL, NULL }
93 #define HILITE_LOOKASIDE_STEPS 2
95 static struct hilite_tree hilite_anchor
= HILITE_INITIALIZER();
96 static struct hilite_tree filter_anchor
= HILITE_INITIALIZER();
101 * These are the static variables that represent the "remembered"
102 * search pattern and filter pattern.
104 struct pattern_info
{
105 PATTERN_TYPE compiled
;
111 #define info_compiled(info) ((void*)0)
113 #define info_compiled(info) ((info)->compiled)
116 static struct pattern_info search_info
;
117 static struct pattern_info filter_info
;
120 * Are there any uppercase letters in this string?
126 char *str_end
= str
+ strlen(str
);
129 while (str
< str_end
)
131 ch
= step_char(&str
, +1, str_end
);
139 * Compile and save a search pattern.
142 set_pattern(info
, pattern
, search_type
)
143 struct pattern_info
*info
;
149 CLEAR_PATTERN(info
->compiled
);
150 else if (compile_pattern(pattern
, search_type
, &info
->compiled
) < 0)
153 /* Pattern compiled successfully; save the text too. */
154 if (info
->text
!= NULL
)
159 info
->text
= (char *) ecalloc(1, strlen(pattern
)+1);
160 strcpy(info
->text
, pattern
);
162 info
->search_type
= search_type
;
165 * Ignore case if -I is set OR
166 * -i is set AND the pattern is all lowercase.
168 is_ucase_pattern
= is_ucase(pattern
);
169 if (is_ucase_pattern
&& caseless
!= OPT_ONPLUS
)
172 is_caseless
= caseless
;
177 * Discard a saved pattern.
181 struct pattern_info
*info
;
183 if (info
->text
!= NULL
)
187 uncompile_pattern(&info
->compiled
);
192 * Initialize saved pattern to nothing.
196 struct pattern_info
*info
;
198 CLEAR_PATTERN(info
->compiled
);
200 info
->search_type
= 0;
204 * Initialize search variables.
207 init_search(VOID_PARAM
)
209 init_pattern(&search_info
);
210 init_pattern(&filter_info
);
214 * Determine which text conversions to perform before pattern matching.
217 get_cvt_ops(VOID_PARAM
)
220 if (is_caseless
|| bs_mode
== BS_SPECIAL
)
224 if (bs_mode
== BS_SPECIAL
)
226 if (bs_mode
!= BS_CONTROL
)
228 } else if (bs_mode
!= BS_CONTROL
)
232 if (ctldisp
== OPT_ONPLUS
)
238 * Is there a previous (remembered) search pattern?
242 struct pattern_info
*info
;
245 if ((info
->search_type
& SRCH_NO_REGEX
) == 0)
246 return (!is_null_pattern(info
->compiled
));
248 return (info
->text
!= NULL
);
253 * Repaint the hilites currently displayed on the screen.
254 * Repaint each line which contains highlighted text.
255 * If on==0, force all hilites off.
263 int save_hide_hilite
;
268 save_hide_hilite
= hide_hilite
;
279 hide_hilite
= save_hide_hilite
;
283 for (sindex
= TOP
; sindex
< TOP
+ sc_height
-1; sindex
++)
285 pos
= position(sindex
);
286 if (pos
== NULL_POSITION
)
288 (void) forw_line(pos
);
293 hide_hilite
= save_hide_hilite
;
297 * Clear the attn hilite.
300 clear_attn(VOID_PARAM
)
303 POSITION old_start_attnpos
;
304 POSITION old_end_attnpos
;
309 if (start_attnpos
== NULL_POSITION
)
311 old_start_attnpos
= start_attnpos
;
312 old_end_attnpos
= end_attnpos
;
313 start_attnpos
= end_attnpos
= NULL_POSITION
;
323 for (sindex
= TOP
; sindex
< TOP
+ sc_height
-1; sindex
++)
325 pos
= position(sindex
);
326 if (pos
== NULL_POSITION
)
328 epos
= position(sindex
+1);
329 if (pos
<= old_end_attnpos
&&
330 (epos
== NULL_POSITION
|| epos
> old_start_attnpos
))
332 (void) forw_line(pos
);
344 * Hide search string highlighting.
347 undo_search(VOID_PARAM
)
349 if (!prev_pattern(&search_info
))
351 if (hilite_anchor
.first
== NULL
)
353 error("No previous regular expression", NULL_PARG
);
356 clr_hilite(); /* Next time, hilite_anchor.first will be NULL. */
358 clear_pattern(&search_info
);
360 hide_hilite
= !hide_hilite
;
367 * Clear the hilite list.
371 struct hilite_tree
*anchor
;
373 struct hilite_storage
*hls
;
374 struct hilite_storage
*nexthls
;
376 for (hls
= anchor
->first
; hls
!= NULL
; hls
= nexthls
)
379 free((void*)hls
->nodes
);
382 anchor
->first
= NULL
;
383 anchor
->current
= NULL
;
386 anchor
->lookaside
= NULL
;
388 prep_startpos
= prep_endpos
= NULL_POSITION
;
392 clr_hilite(VOID_PARAM
)
394 clr_hlist(&hilite_anchor
);
398 clr_filter(VOID_PARAM
)
400 clr_hlist(&filter_anchor
);
405 struct hilite_tree
*anchor
;
407 struct hilite_node
*n
= anchor
->root
;
408 while (n
!= NULL
&& n
->right
!= NULL
)
415 struct hilite_node
*n
;
422 struct hilite_node
*n
;
428 * Find the node covering pos, or the node after it if no node covers it,
429 * or return NULL if pos is after the last range. Remember the found node,
430 * to speed up subsequent searches for the same or similar positions (if
431 * we return NULL, remember the last node.)
434 hlist_find(anchor
, pos
)
435 struct hilite_tree
*anchor
;
438 struct hilite_node
*n
, *m
;
440 if (anchor
->lookaside
)
445 n
= anchor
->lookaside
;
449 if (pos
< n
->r
.hl_endpos
)
451 if (n
->prev
== NULL
|| pos
>= n
->prev
->r
.hl_endpos
)
456 } else if (n
->next
== NULL
)
464 * If we don't find the right node within a small
465 * distance, don't keep doing a linear search!
467 if (steps
>= HILITE_LOOKASIDE_STEPS
)
471 if (pos
< n
->r
.hl_endpos
)
472 anchor
->lookaside
= n
= n
->prev
;
474 anchor
->lookaside
= n
= n
->next
;
486 if (pos
< n
->r
.hl_startpos
)
496 if (pos
>= n
->r
.hl_endpos
)
498 if (n
->right
!= NULL
)
516 anchor
->lookaside
= n
;
518 anchor
->lookaside
= m
;
524 * Should any characters in a specified range be highlighted?
527 is_hilited_range(pos
, epos
)
531 struct hilite_node
*n
= hlist_find(&hilite_anchor
, pos
);
532 return (n
!= NULL
&& (epos
== NULL_POSITION
|| epos
> n
->r
.hl_startpos
));
536 * Is a line "filtered" -- that is, should it be hidden?
542 struct hilite_node
*n
;
544 if (ch_getflags() & CH_HELPFILE
)
547 n
= hlist_find(&filter_anchor
, pos
);
548 return (n
!= NULL
&& pos
>= n
->r
.hl_startpos
);
552 * If pos is hidden, return the next position which isn't, otherwise
559 struct hilite_node
*n
;
561 if (ch_getflags() & CH_HELPFILE
)
564 n
= hlist_find(&filter_anchor
, pos
);
565 while (n
!= NULL
&& pos
>= n
->r
.hl_startpos
)
567 pos
= n
->r
.hl_endpos
;
574 * If pos is hidden, return the previous position which isn't or 0 if
575 * we're filtered right to the beginning, otherwise just return pos.
581 struct hilite_node
*n
;
583 if (ch_getflags() & CH_HELPFILE
)
586 n
= hlist_find(&filter_anchor
, pos
);
587 while (n
!= NULL
&& pos
>= n
->r
.hl_startpos
)
589 pos
= n
->r
.hl_startpos
;
600 * Should any characters in a specified range be highlighted?
601 * If nohide is nonzero, don't consider hide_hilite.
604 is_hilited(pos
, epos
, nohide
, p_matches
)
612 if (p_matches
!= NULL
)
616 start_attnpos
!= NULL_POSITION
&&
618 (epos
== NULL_POSITION
|| epos
> start_attnpos
))
620 * The attn line overlaps this range.
624 match
= is_hilited_range(pos
, epos
);
628 if (p_matches
== NULL
)
630 * Kinda kludgy way to recognize that caller is checking for
631 * hilite in status column. In this case we want to return
632 * hilite status even if hiliting is disabled or hidden.
637 * Report matches, even if we're hiding highlights.
641 if (hilite_search
== 0)
643 * Not doing highlighting.
647 if (!nohide
&& hide_hilite
)
649 * Highlighting is hidden.
657 * Tree node storage: get the current block of nodes if it has spare
658 * capacity, or create a new one if not.
660 static struct hilite_storage
*
661 hlist_getstorage(anchor
)
662 struct hilite_tree
*anchor
;
665 struct hilite_storage
*s
;
669 if (anchor
->current
->used
< anchor
->current
->capacity
)
670 return anchor
->current
;
671 capacity
= anchor
->current
->capacity
* 2;
674 s
= (struct hilite_storage
*) ecalloc(1, sizeof(struct hilite_storage
));
675 s
->nodes
= (struct hilite_node
*) ecalloc(capacity
, sizeof(struct hilite_node
));
676 s
->capacity
= capacity
;
680 anchor
->current
->next
= s
;
688 * Tree node storage: retrieve a new empty node to be inserted into the
691 static struct hilite_node
*
692 hlist_getnode(anchor
)
693 struct hilite_tree
*anchor
;
695 struct hilite_storage
*s
= hlist_getstorage(anchor
);
696 return &s
->nodes
[s
->used
++];
700 * Rotate the tree left around a pivot node.
703 hlist_rotate_left(anchor
, n
)
704 struct hilite_tree
*anchor
;
705 struct hilite_node
*n
;
707 struct hilite_node
*np
= n
->parent
;
708 struct hilite_node
*nr
= n
->right
;
709 struct hilite_node
*nrl
= n
->right
->left
;
731 * Rotate the tree right around a pivot node.
734 hlist_rotate_right(anchor
, n
)
735 struct hilite_tree
*anchor
;
736 struct hilite_node
*n
;
738 struct hilite_node
*np
= n
->parent
;
739 struct hilite_node
*nl
= n
->left
;
740 struct hilite_node
*nlr
= n
->left
->right
;
763 * Add a new hilite to a hilite list.
766 add_hilite(anchor
, hl
)
767 struct hilite_tree
*anchor
;
770 struct hilite_node
*p
, *n
, *u
;
772 /* Ignore empty ranges. */
773 if (hl
->hl_startpos
>= hl
->hl_endpos
)
778 /* Inserting the very first node is trivial. */
781 n
= hlist_getnode(anchor
);
784 anchor
->lookaside
= n
;
789 * Find our insertion point. If we come across any overlapping
790 * or adjoining existing ranges, shrink our range and discard
791 * if it become empty.
795 if (hl
->hl_startpos
< p
->r
.hl_startpos
)
797 if (hl
->hl_endpos
> p
->r
.hl_startpos
)
798 hl
->hl_endpos
= p
->r
.hl_startpos
;
806 if (hl
->hl_startpos
< p
->r
.hl_endpos
) {
807 hl
->hl_startpos
= p
->r
.hl_endpos
;
808 if (hl
->hl_startpos
>= hl
->hl_endpos
)
811 if (p
->right
!= NULL
)
820 * Now we're at the right leaf, again check for contiguous ranges
821 * and extend the existing node if possible to avoid the
822 * insertion. Otherwise insert a new node at the leaf.
824 if (hl
->hl_startpos
< p
->r
.hl_startpos
) {
825 if (hl
->hl_endpos
== p
->r
.hl_startpos
)
827 p
->r
.hl_startpos
= hl
->hl_startpos
;
830 if (p
->prev
!= NULL
&& p
->prev
->r
.hl_endpos
== hl
->hl_startpos
)
832 p
->prev
->r
.hl_endpos
= hl
->hl_endpos
;
836 p
->left
= n
= hlist_getnode(anchor
);
845 if (p
->r
.hl_endpos
== hl
->hl_startpos
)
847 p
->r
.hl_endpos
= hl
->hl_endpos
;
850 if (p
->next
!= NULL
&& hl
->hl_endpos
== p
->next
->r
.hl_startpos
) {
851 p
->next
->r
.hl_startpos
= hl
->hl_startpos
;
855 p
->right
= n
= hlist_getnode(anchor
);
869 * The tree is in the correct order and covers the right ranges
870 * now, but may have become unbalanced. Rebalance it using the
871 * standard red-black tree constraints and operations.
875 /* case 1 - current is root, root is always black */
876 if (n
->parent
== NULL
)
882 /* case 2 - parent is black, we can always be red */
887 * constraint: because the root must be black, if our
888 * parent is red it cannot be the root therefore we must
893 * case 3 - parent and uncle are red, repaint them black,
894 * the grandparent red, and start again at the grandparent.
896 u
= n
->parent
->parent
->left
;
898 u
= n
->parent
->parent
->right
;
899 if (u
!= NULL
&& u
->red
)
903 n
= n
->parent
->parent
;
909 * case 4 - parent is red but uncle is black, parent and
910 * grandparent on opposite sides. We need to start
911 * changing the structure now. This and case 5 will shorten
912 * our branch and lengthen the sibling, between them
915 if (n
== n
->parent
->right
&&
916 n
->parent
== n
->parent
->parent
->left
)
918 hlist_rotate_left(anchor
, n
->parent
);
920 } else if (n
== n
->parent
->left
&&
921 n
->parent
== n
->parent
->parent
->right
)
923 hlist_rotate_right(anchor
, n
->parent
);
928 * case 5 - parent is red but uncle is black, parent and
929 * grandparent on same side
932 n
->parent
->parent
->red
= 1;
933 if (n
== n
->parent
->left
)
934 hlist_rotate_right(anchor
, n
->parent
->parent
);
936 hlist_rotate_left(anchor
, n
->parent
->parent
);
942 * Hilight every character in a range of displayed characters.
945 create_hilites(linepos
, start_index
, end_index
, chpos
)
954 /* Start the first hilite. */
955 hl
.hl_startpos
= linepos
+ chpos
[start_index
];
958 * Step through the displayed chars.
959 * If the source position (before cvt) of the char is one more
960 * than the source pos of the previous char (the usual case),
961 * just increase the size of the current hilite by one.
962 * Otherwise (there are backspaces or something involved),
963 * finish the current hilite and start a new one.
965 for (i
= start_index
+1; i
<= end_index
; i
++)
967 if (chpos
[i
] != chpos
[i
-1] + 1 || i
== end_index
)
969 hl
.hl_endpos
= linepos
+ chpos
[i
-1] + 1;
970 add_hilite(&hilite_anchor
, &hl
);
971 /* Start new hilite unless this is the last char. */
974 hl
.hl_startpos
= linepos
+ chpos
[i
];
981 * Make a hilite for each string in a physical line which matches
982 * the current pattern.
983 * sp,ep delimit the first match already found.
986 hilite_line(linepos
, line
, line_len
, chpos
, sp
, ep
, cvt_ops
)
996 char *line_end
= line
+ line_len
;
999 * sp and ep delimit the first match in the line.
1000 * Mark the corresponding file positions, then
1001 * look for further matches and mark them.
1002 * {{ This technique, of calling match_pattern on subsequent
1003 * substrings of the line, may mark more than is correct
1004 * if the pattern starts with "^". This bug is fixed
1005 * for those regex functions that accept a notbol parameter
1006 * (currently POSIX, PCRE and V8-with-regexec2). }}
1010 if (sp
== NULL
|| ep
== NULL
)
1012 create_hilites(linepos
, sp
-line
, ep
-line
, chpos
);
1014 * If we matched more than zero characters,
1015 * move to the first char after the string we matched.
1016 * If we matched zero, just move to the next char.
1020 else if (searchp
!= line_end
)
1022 else /* end of line */
1024 } while (match_pattern(info_compiled(&search_info
), search_info
.text
,
1025 searchp
, line_end
- searchp
, &sp
, &ep
, 1, search_info
.search_type
));
1031 * Find matching text which is currently on screen and highlight it.
1034 hilite_screen(VOID_PARAM
)
1036 struct scrpos scrpos
;
1038 get_scrpos(&scrpos
, TOP
);
1039 if (scrpos
.pos
== NULL_POSITION
)
1041 prep_hilite(scrpos
.pos
, position(BOTTOM_PLUS_ONE
), -1);
1046 * Change highlighting parameters.
1049 chg_hilite(VOID_PARAM
)
1052 * Erase any highlights currently on screen.
1057 if (hilite_search
== OPT_ONPLUS
)
1059 * Display highlights.
1066 * Figure out where to start a search.
1069 search_pos(search_type
)
1078 * Start at the beginning (or end) of the file.
1079 * The empty_screen() case is mainly for
1080 * command line initiated searches;
1081 * for example, "+/xyz" on the command line.
1082 * Also for multi-file (SRCH_PAST_EOF) searches.
1084 if (search_type
& SRCH_FORW
)
1090 if (pos
== NULL_POSITION
)
1092 (void) ch_end_seek();
1101 if (how_search
== OPT_ON
)
1104 * Search does not include current screen.
1106 if (search_type
& SRCH_FORW
)
1107 sindex
= sc_height
-1; /* BOTTOM_PLUS_ONE */
1109 sindex
= 0; /* TOP */
1110 } else if (how_search
== OPT_ONPLUS
&& !(search_type
& SRCH_AFTER_TARGET
))
1113 * Search includes all of displayed screen.
1115 if (search_type
& SRCH_FORW
)
1116 sindex
= 0; /* TOP */
1118 sindex
= sc_height
-1; /* BOTTOM_PLUS_ONE */
1122 * Search includes the part of current screen beyond the jump target.
1123 * It starts at the jump target (if searching backwards),
1124 * or at the jump target plus one (if forwards).
1126 sindex
= sindex_from_sline(jump_sline
);
1127 if (search_type
& SRCH_FORW
)
1130 pos
= position(sindex
);
1132 pos
= forw_raw_line(pos
, (char **)NULL
, (int *)NULL
);
1136 * If the line is empty, look around for a plausible starting place.
1138 if (search_type
& SRCH_FORW
)
1140 while (pos
== NULL_POSITION
)
1142 if (++sindex
>= sc_height
)
1144 pos
= position(sindex
);
1148 while (pos
== NULL_POSITION
)
1152 pos
= position(sindex
);
1159 * Search a subset of the file, specified by start/end position.
1162 search_range(pos
, endpos
, search_type
, matches
, maxlines
, plinepos
, pendpos
)
1180 POSITION linepos
, oldpos
;
1182 linenum
= find_linenum(pos
);
1187 * Get lines until we find a matching one or until
1188 * we hit end-of-file (or beginning-of-file if we're
1189 * going backwards), or until we hit the end position.
1194 * A signal aborts the search.
1199 if ((endpos
!= NULL_POSITION
&& pos
>= endpos
) || maxlines
== 0)
1202 * Reached end position without a match.
1204 if (pendpos
!= NULL
)
1211 if (search_type
& SRCH_FORW
)
1214 * Read the next line, and save the
1215 * starting position of that line in linepos.
1218 pos
= forw_raw_line(pos
, &line
, &line_len
);
1224 * Read the previous line and save the
1225 * starting position of that line in linepos.
1227 pos
= back_raw_line(pos
, &line
, &line_len
);
1233 if (pos
== NULL_POSITION
)
1236 * Reached EOF/BOF without a match.
1238 if (pendpos
!= NULL
)
1244 * If we're using line numbers, we might as well
1245 * remember the information we have now (the position
1246 * and line number of the current line).
1247 * Don't do it for every line because it slows down
1248 * the search. Remember the line number only if
1249 * we're "far" from the last place we remembered it.
1251 if (linenums
&& abs((int)(pos
- oldpos
)) > 2048)
1252 add_lnum(linenum
, pos
);
1255 if (is_filtered(linepos
))
1259 * If it's a caseless search, convert the line to lowercase.
1260 * If we're doing backspace processing, delete backspaces.
1262 cvt_ops
= get_cvt_ops();
1263 cvt_len
= cvt_length(line_len
, cvt_ops
);
1264 cline
= (char *) ecalloc(1, cvt_len
);
1265 chpos
= cvt_alloc_chpos(cvt_len
);
1266 cvt_text(cline
, line
, chpos
, &line_len
, cvt_ops
);
1270 * Check to see if the line matches the filter pattern.
1271 * If so, add an entry to the filter list.
1273 if (((search_type
& SRCH_FIND_ALL
) ||
1274 prep_startpos
== NULL_POSITION
||
1275 linepos
< prep_startpos
|| linepos
>= prep_endpos
) &&
1276 prev_pattern(&filter_info
)) {
1277 int line_filter
= match_pattern(info_compiled(&filter_info
), filter_info
.text
,
1278 cline
, line_len
, &sp
, &ep
, 0, filter_info
.search_type
);
1282 hl
.hl_startpos
= linepos
;
1284 add_hilite(&filter_anchor
, &hl
);
1293 * Test the next line to see if we have a match.
1294 * We are successful if we either want a match and got one,
1295 * or if we want a non-match and got one.
1297 if (prev_pattern(&search_info
))
1299 line_match
= match_pattern(info_compiled(&search_info
), search_info
.text
,
1300 cline
, line_len
, &sp
, &ep
, 0, search_type
);
1306 if (search_type
& SRCH_FIND_ALL
)
1310 * We are supposed to find all matches in the range.
1311 * Just add the matches in this line to the
1312 * hilite list and keep searching.
1314 hilite_line(linepos
, cline
, line_len
, chpos
, sp
, ep
, cvt_ops
);
1316 } else if (--matches
<= 0)
1319 * Found the one match we're looking for.
1323 if (hilite_search
== OPT_ON
)
1326 * Clear the hilite list and add only
1327 * the matches in this one line.
1330 hilite_line(linepos
, cline
, line_len
, chpos
, sp
, ep
, cvt_ops
);
1335 if (plinepos
!= NULL
)
1336 *plinepos
= linepos
;
1347 * search for a pattern in history. If found, compile that pattern.
1350 hist_pattern(search_type
)
1356 set_mlist(ml_search
, 0);
1357 pattern
= cmd_lastpattern();
1358 if (pattern
== NULL
)
1361 if (set_pattern(&search_info
, pattern
, search_type
) < 0)
1365 if (hilite_search
== OPT_ONPLUS
&& !hide_hilite
)
1370 #else /* CMD_HISTORY */
1372 #endif /* CMD_HISTORY */
1376 * Change the caseless-ness of searches.
1377 * Updates the internal search state to reflect a change in the -i flag.
1380 chg_caseless(VOID_PARAM
)
1382 if (!is_ucase_pattern
)
1384 * Pattern did not have uppercase.
1385 * Just set the search caselessness to the global caselessness.
1387 is_caseless
= caseless
;
1391 * Pattern did have uppercase.
1392 * Regenerate the pattern using the new state.
1394 clear_pattern(&search_info
);
1395 hist_pattern(search_info
.search_type
);
1400 * Search for the n-th occurrence of a specified pattern,
1401 * either forward or backward.
1402 * Return the number of matches not yet found in this file
1403 * (that is, n minus the number of matches found).
1404 * Return -1 if the search should be aborted.
1405 * Caller may continue the search in another file
1406 * if less than n matches are found in this file.
1409 search(search_type
, pattern
, n
)
1416 if (pattern
== NULL
|| *pattern
== '\0')
1419 * A null pattern means use the previously compiled pattern.
1421 search_type
|= SRCH_AFTER_TARGET
;
1422 if (!prev_pattern(&search_info
) && !hist_pattern(search_type
))
1424 error("No previous regular expression", NULL_PARG
);
1427 if ((search_type
& SRCH_NO_REGEX
) !=
1428 (search_info
.search_type
& SRCH_NO_REGEX
))
1430 error("Please re-enter search pattern", NULL_PARG
);
1434 if (hilite_search
== OPT_ON
|| status_col
)
1437 * Erase the highlights currently on screen.
1438 * If the search fails, we'll redisplay them later.
1442 if (hilite_search
== OPT_ONPLUS
&& hide_hilite
)
1445 * Highlight any matches currently on screen,
1446 * before we actually start the search.
1456 * Compile the pattern.
1458 if (set_pattern(&search_info
, pattern
, search_type
) < 0)
1461 if (hilite_search
|| status_col
)
1464 * Erase the highlights currently on screen.
1465 * Also permanently delete them from the hilite list.
1471 if (hilite_search
== OPT_ONPLUS
|| status_col
)
1474 * Highlight any matches currently on screen,
1475 * before we actually start the search.
1483 * Figure out where to start the search.
1485 pos
= search_pos(search_type
);
1486 if (pos
== NULL_POSITION
)
1489 * Can't find anyplace to start searching from.
1491 if (search_type
& SRCH_PAST_EOF
)
1493 if (hilite_search
== OPT_ON
|| status_col
)
1495 error("Nothing to search", NULL_PARG
);
1499 n
= search_range(pos
, NULL_POSITION
, search_type
, n
, -1,
1500 &pos
, (POSITION
*)NULL
);
1504 * Search was unsuccessful.
1507 if ((hilite_search
== OPT_ON
|| status_col
) && n
> 0)
1509 * Redisplay old hilites.
1516 if (!(search_type
& SRCH_NO_MOVE
))
1519 * Go to the matching line.
1521 jump_loc(pos
, jump_sline
);
1525 if (hilite_search
== OPT_ON
|| status_col
)
1527 * Display new hilites in the matching line.
1537 * Prepare hilites in a given range of the file.
1539 * The pair (prep_startpos,prep_endpos) delimits a contiguous region
1540 * of the file that has been "prepared"; that is, scanned for matches for
1541 * the current search pattern, and hilites have been created for such matches.
1542 * If prep_startpos == NULL_POSITION, the prep region is empty.
1543 * If prep_endpos == NULL_POSITION, the prep region extends to EOF.
1544 * prep_hilite asks that the range (spos,epos) be covered by the prep region.
1547 prep_hilite(spos
, epos
, maxlines
)
1552 POSITION nprep_startpos
= prep_startpos
;
1553 POSITION nprep_endpos
= prep_endpos
;
1560 * Search beyond where we're asked to search, so the prep region covers
1561 * more than we need. Do one big search instead of a bunch of small ones.
1563 #define SEARCH_MORE (3*size_linebuf)
1565 if (!prev_pattern(&search_info
) && !is_filtering())
1569 * Make sure our prep region always starts at the beginning of
1570 * a line. (search_range takes care of the end boundary below.)
1572 spos
= back_raw_line(spos
+1, (char **)NULL
, (int *)NULL
);
1575 * If we're limited to a max number of lines, figure out the
1576 * file position we should stop at.
1579 max_epos
= NULL_POSITION
;
1583 for (i
= 0; i
< maxlines
; i
++)
1584 max_epos
= forw_raw_line(max_epos
, (char **)NULL
, (int *)NULL
);
1589 * The range that we need to search (spos,epos); and the range that
1590 * the "prep" region will then cover (nprep_startpos,nprep_endpos).
1593 if (prep_startpos
== NULL_POSITION
||
1594 (epos
!= NULL_POSITION
&& epos
< prep_startpos
) ||
1598 * New range is not contiguous with old prep region.
1599 * Discard the old prep region and start a new one.
1603 if (epos
!= NULL_POSITION
)
1604 epos
+= SEARCH_MORE
;
1605 nprep_startpos
= spos
;
1609 * New range partially or completely overlaps old prep region.
1611 if (epos
== NULL_POSITION
)
1614 * New range goes to end of file.
1617 } else if (epos
> prep_endpos
)
1620 * New range ends after old prep region.
1621 * Extend prep region to end at end of new range.
1623 epos
+= SEARCH_MORE
;
1624 } else /* (epos <= prep_endpos) */
1627 * New range ends within old prep region.
1628 * Truncate search to end at start of old prep region.
1630 epos
= prep_startpos
;
1633 if (spos
< prep_startpos
)
1636 * New range starts before old prep region.
1637 * Extend old prep region backwards to start at
1638 * start of new range.
1640 if (spos
< SEARCH_MORE
)
1643 spos
-= SEARCH_MORE
;
1644 nprep_startpos
= spos
;
1645 } else /* (spos >= prep_startpos) */
1648 * New range starts within or after old prep region.
1649 * Trim search to start at end of old prep region.
1655 if (epos
!= NULL_POSITION
&& max_epos
!= NULL_POSITION
&&
1658 * Don't go past the max position we're allowed.
1662 if (epos
== NULL_POSITION
|| epos
> spos
)
1664 int search_type
= SRCH_FORW
| SRCH_FIND_ALL
;
1665 search_type
|= (search_info
.search_type
& SRCH_NO_REGEX
);
1668 result
= search_range(spos
, epos
, search_type
, 0, maxlines
, (POSITION
*)NULL
, &new_epos
);
1671 if (prep_endpos
== NULL_POSITION
|| new_epos
> prep_endpos
)
1672 nprep_endpos
= new_epos
;
1675 * Check both ends of the resulting prep region to
1676 * make sure they're not filtered. If they are,
1677 * keep going at least one more line until we find
1678 * something that isn't filtered, or hit the end.
1680 if (prep_endpos
== NULL_POSITION
|| nprep_endpos
> prep_endpos
)
1682 if (new_epos
>= nprep_endpos
&& is_filtered(new_epos
-1))
1684 spos
= nprep_endpos
;
1685 epos
= forw_raw_line(nprep_endpos
, (char **)NULL
, (int *)NULL
);
1686 if (epos
== NULL_POSITION
)
1693 if (prep_startpos
== NULL_POSITION
|| nprep_startpos
< prep_startpos
)
1695 if (nprep_startpos
> 0 && is_filtered(nprep_startpos
))
1697 epos
= nprep_startpos
;
1698 spos
= back_raw_line(nprep_startpos
, (char **)NULL
, (int *)NULL
);
1699 if (spos
== NULL_POSITION
)
1701 nprep_startpos
= spos
;
1709 prep_startpos
= nprep_startpos
;
1710 prep_endpos
= nprep_endpos
;
1714 * Set the pattern to be used for line filtering.
1717 set_filter_pattern(pattern
, search_type
)
1722 if (pattern
== NULL
|| *pattern
== '\0')
1723 clear_pattern(&filter_info
);
1725 set_pattern(&filter_info
, pattern
, search_type
);
1730 * Is there a line filter in effect?
1733 is_filtering(VOID_PARAM
)
1735 if (ch_getflags() & CH_HELPFILE
)
1737 return prev_pattern(&filter_info
);
1743 * This function is called by the V8 regcomp to report
1744 * errors in regular expressions.
1746 public int reg_show_error
= 1;
1754 if (!reg_show_error
)