Mercurial > vim
annotate src/fold.c @ 6052:4625fa27ba6f v7.4.365
updated for version 7.4.365
Problem: Crash when using ":botright split" when there isn't much space.
Solution: Add a check for the minimum width/height. (Yukihiro Nakadaira)
author | Bram Moolenaar <bram@vim.org> |
---|---|
date | Wed, 16 Jul 2014 14:16:46 +0200 |
parents | 50dbef5e774a |
children | c1aa837853ea |
rev | line source |
---|---|
7 | 1 /* vim:set ts=8 sts=4 sw=4: |
2 * vim600:fdm=marker fdl=1 fdc=3: | |
3 * | |
4 * VIM - Vi IMproved by Bram Moolenaar | |
5 * | |
6 * Do ":help uganda" in Vim to read copying and usage conditions. | |
7 * Do ":help credits" in Vim to see a list of people who contributed. | |
8 * See README.txt for an overview of the Vim source code. | |
9 */ | |
10 | |
11 /* | |
12 * fold.c: code for folding | |
13 */ | |
14 | |
15 #include "vim.h" | |
16 | |
17 #if defined(FEAT_FOLDING) || defined(PROTO) | |
18 | |
19 /* local declarations. {{{1 */ | |
20 /* typedef fold_T {{{2 */ | |
21 /* | |
22 * The toplevel folds for each window are stored in the w_folds growarray. | |
23 * Each toplevel fold can contain an array of second level folds in the | |
24 * fd_nested growarray. | |
25 * The info stored in both growarrays is the same: An array of fold_T. | |
26 */ | |
27 typedef struct | |
28 { | |
29 linenr_T fd_top; /* first line of fold; for nested fold | |
30 * relative to parent */ | |
31 linenr_T fd_len; /* number of lines in the fold */ | |
32 garray_T fd_nested; /* array of nested folds */ | |
33 char fd_flags; /* see below */ | |
34 char fd_small; /* TRUE, FALSE or MAYBE: fold smaller than | |
35 'foldminlines'; MAYBE applies to nested | |
36 folds too */ | |
37 } fold_T; | |
38 | |
39 #define FD_OPEN 0 /* fold is open (nested ones can be closed) */ | |
40 #define FD_CLOSED 1 /* fold is closed */ | |
41 #define FD_LEVEL 2 /* depends on 'foldlevel' (nested folds too) */ | |
42 | |
43 #define MAX_LEVEL 20 /* maximum fold depth */ | |
44 | |
45 /* static functions {{{2 */ | |
46 static void newFoldLevelWin __ARGS((win_T *wp)); | |
47 static int checkCloseRec __ARGS((garray_T *gap, linenr_T lnum, int level)); | |
48 static int foldFind __ARGS((garray_T *gap, linenr_T lnum, fold_T **fpp)); | |
49 static int foldLevelWin __ARGS((win_T *wp, linenr_T lnum)); | |
50 static void checkupdate __ARGS((win_T *wp)); | |
1757 | 51 static void setFoldRepeat __ARGS((linenr_T lnum, long count, int do_open)); |
7 | 52 static linenr_T setManualFold __ARGS((linenr_T lnum, int opening, int recurse, int *donep)); |
53 static linenr_T setManualFoldWin __ARGS((win_T *wp, linenr_T lnum, int opening, int recurse, int *donep)); | |
54 static void foldOpenNested __ARGS((fold_T *fpr)); | |
55 static void deleteFoldEntry __ARGS((garray_T *gap, int idx, int recursive)); | |
56 static void foldMarkAdjustRecurse __ARGS((garray_T *gap, linenr_T line1, linenr_T line2, long amount, long amount_after)); | |
57 static int getDeepestNestingRecurse __ARGS((garray_T *gap)); | |
58 static int check_closed __ARGS((win_T *win, fold_T *fp, int *use_levelp, int level, int *maybe_smallp, linenr_T lnum_off)); | |
59 static void checkSmall __ARGS((win_T *wp, fold_T *fp, linenr_T lnum_off)); | |
60 static void setSmallMaybe __ARGS((garray_T *gap)); | |
61 static void foldCreateMarkers __ARGS((linenr_T start, linenr_T end)); | |
62 static void foldAddMarker __ARGS((linenr_T lnum, char_u *marker, int markerlen)); | |
63 static void deleteFoldMarkers __ARGS((fold_T *fp, int recursive, linenr_T lnum_off)); | |
64 static void foldDelMarker __ARGS((linenr_T lnum, char_u *marker, int markerlen)); | |
65 static void foldUpdateIEMS __ARGS((win_T *wp, linenr_T top, linenr_T bot)); | |
66 static void parseMarker __ARGS((win_T *wp)); | |
67 | |
68 static char *e_nofold = N_("E490: No fold found"); | |
69 | |
70 /* | |
71 * While updating the folds lines between invalid_top and invalid_bot have an | |
72 * undefined fold level. Only used for the window currently being updated. | |
73 */ | |
74 static linenr_T invalid_top = (linenr_T)0; | |
75 static linenr_T invalid_bot = (linenr_T)0; | |
76 | |
77 /* | |
78 * When using 'foldexpr' we sometimes get the level of the next line, which | |
79 * calls foldlevel() to get the level of the current line, which hasn't been | |
80 * stored yet. To get around this chicken-egg problem the level of the | |
81 * previous line is stored here when available. prev_lnum is zero when the | |
82 * level is not available. | |
83 */ | |
84 static linenr_T prev_lnum = 0; | |
85 static int prev_lnum_lvl = -1; | |
86 | |
87 /* Flags used for "done" argument of setManualFold. */ | |
88 #define DONE_NOTHING 0 | |
89 #define DONE_ACTION 1 /* did close or open a fold */ | |
90 #define DONE_FOLD 2 /* did find a fold */ | |
91 | |
92 static int foldstartmarkerlen; | |
93 static char_u *foldendmarker; | |
94 static int foldendmarkerlen; | |
95 | |
96 /* Exported folding functions. {{{1 */ | |
97 /* copyFoldingState() {{{2 */ | |
98 #if defined(FEAT_WINDOWS) || defined(PROTO) | |
99 /* | |
100 * Copy that folding state from window "wp_from" to window "wp_to". | |
101 */ | |
102 void | |
103 copyFoldingState(wp_from, wp_to) | |
104 win_T *wp_from; | |
105 win_T *wp_to; | |
106 { | |
107 wp_to->w_fold_manual = wp_from->w_fold_manual; | |
108 wp_to->w_foldinvalid = wp_from->w_foldinvalid; | |
109 cloneFoldGrowArray(&wp_from->w_folds, &wp_to->w_folds); | |
110 } | |
111 #endif | |
112 | |
113 /* hasAnyFolding() {{{2 */ | |
114 /* | |
115 * Return TRUE if there may be folded lines in the current window. | |
116 */ | |
117 int | |
118 hasAnyFolding(win) | |
119 win_T *win; | |
120 { | |
121 /* very simple now, but can become more complex later */ | |
122 return (win->w_p_fen | |
123 && (!foldmethodIsManual(win) || win->w_folds.ga_len > 0)); | |
124 } | |
125 | |
126 /* hasFolding() {{{2 */ | |
127 /* | |
128 * Return TRUE if line "lnum" in the current window is part of a closed | |
129 * fold. | |
130 * When returning TRUE, *firstp and *lastp are set to the first and last | |
131 * lnum of the sequence of folded lines (skipped when NULL). | |
132 */ | |
133 int | |
134 hasFolding(lnum, firstp, lastp) | |
135 linenr_T lnum; | |
136 linenr_T *firstp; | |
137 linenr_T *lastp; | |
138 { | |
139 return hasFoldingWin(curwin, lnum, firstp, lastp, TRUE, NULL); | |
140 } | |
141 | |
142 /* hasFoldingWin() {{{2 */ | |
143 int | |
144 hasFoldingWin(win, lnum, firstp, lastp, cache, infop) | |
145 win_T *win; | |
146 linenr_T lnum; | |
147 linenr_T *firstp; | |
148 linenr_T *lastp; | |
149 int cache; /* when TRUE: use cached values of window */ | |
150 foldinfo_T *infop; /* where to store fold info */ | |
151 { | |
152 int had_folded = FALSE; | |
153 linenr_T first = 0; | |
154 linenr_T last = 0; | |
155 linenr_T lnum_rel = lnum; | |
156 int x; | |
157 fold_T *fp; | |
158 int level = 0; | |
159 int use_level = FALSE; | |
160 int maybe_small = FALSE; | |
161 garray_T *gap; | |
162 int low_level = 0;; | |
163 | |
164 checkupdate(win); | |
165 /* | |
166 * Return quickly when there is no folding at all in this window. | |
167 */ | |
168 if (!hasAnyFolding(win)) | |
169 { | |
170 if (infop != NULL) | |
171 infop->fi_level = 0; | |
172 return FALSE; | |
173 } | |
174 | |
175 if (cache) | |
176 { | |
177 /* | |
178 * First look in cached info for displayed lines. This is probably | |
179 * the fastest, but it can only be used if the entry is still valid. | |
180 */ | |
181 x = find_wl_entry(win, lnum); | |
182 if (x >= 0) | |
183 { | |
184 first = win->w_lines[x].wl_lnum; | |
185 last = win->w_lines[x].wl_lastlnum; | |
186 had_folded = win->w_lines[x].wl_folded; | |
187 } | |
188 } | |
189 | |
190 if (first == 0) | |
191 { | |
192 /* | |
193 * Recursively search for a fold that contains "lnum". | |
194 */ | |
195 gap = &win->w_folds; | |
196 for (;;) | |
197 { | |
198 if (!foldFind(gap, lnum_rel, &fp)) | |
199 break; | |
200 | |
201 /* Remember lowest level of fold that starts in "lnum". */ | |
202 if (lnum_rel == fp->fd_top && low_level == 0) | |
203 low_level = level + 1; | |
204 | |
205 first += fp->fd_top; | |
206 last += fp->fd_top; | |
207 | |
208 /* is this fold closed? */ | |
209 had_folded = check_closed(win, fp, &use_level, level, | |
210 &maybe_small, lnum - lnum_rel); | |
211 if (had_folded) | |
212 { | |
213 /* Fold closed: Set last and quit loop. */ | |
214 last += fp->fd_len - 1; | |
215 break; | |
216 } | |
217 | |
218 /* Fold found, but it's open: Check nested folds. Line number is | |
219 * relative to containing fold. */ | |
220 gap = &fp->fd_nested; | |
221 lnum_rel -= fp->fd_top; | |
222 ++level; | |
223 } | |
224 } | |
225 | |
226 if (!had_folded) | |
227 { | |
228 if (infop != NULL) | |
229 { | |
230 infop->fi_level = level; | |
231 infop->fi_lnum = lnum - lnum_rel; | |
232 infop->fi_low_level = low_level == 0 ? level : low_level; | |
233 } | |
234 return FALSE; | |
235 } | |
236 | |
237 if (lastp != NULL) | |
238 *lastp = last; | |
239 if (firstp != NULL) | |
240 *firstp = first; | |
241 if (infop != NULL) | |
242 { | |
243 infop->fi_level = level + 1; | |
244 infop->fi_lnum = first; | |
245 infop->fi_low_level = low_level == 0 ? level + 1 : low_level; | |
246 } | |
247 return TRUE; | |
248 } | |
249 | |
250 /* foldLevel() {{{2 */ | |
251 /* | |
252 * Return fold level at line number "lnum" in the current window. | |
253 */ | |
254 int | |
255 foldLevel(lnum) | |
256 linenr_T lnum; | |
257 { | |
258 /* While updating the folds lines between invalid_top and invalid_bot have | |
259 * an undefined fold level. Otherwise update the folds first. */ | |
260 if (invalid_top == (linenr_T)0) | |
261 checkupdate(curwin); | |
262 else if (lnum == prev_lnum && prev_lnum_lvl >= 0) | |
263 return prev_lnum_lvl; | |
264 else if (lnum >= invalid_top && lnum <= invalid_bot) | |
265 return -1; | |
266 | |
267 /* Return quickly when there is no folding at all in this window. */ | |
268 if (!hasAnyFolding(curwin)) | |
269 return 0; | |
270 | |
271 return foldLevelWin(curwin, lnum); | |
272 } | |
273 | |
274 /* lineFolded() {{{2 */ | |
275 /* | |
276 * Low level function to check if a line is folded. Doesn't use any caching. | |
277 * Return TRUE if line is folded. | |
278 * Return FALSE if line is not folded. | |
279 * Return MAYBE if the line is folded when next to a folded line. | |
280 */ | |
281 int | |
282 lineFolded(win, lnum) | |
283 win_T *win; | |
284 linenr_T lnum; | |
285 { | |
286 return foldedCount(win, lnum, NULL) != 0; | |
287 } | |
288 | |
289 /* foldedCount() {{{2 */ | |
290 /* | |
291 * Count the number of lines that are folded at line number "lnum". | |
292 * Normally "lnum" is the first line of a possible fold, and the returned | |
293 * number is the number of lines in the fold. | |
294 * Doesn't use caching from the displayed window. | |
295 * Returns number of folded lines from "lnum", or 0 if line is not folded. | |
296 * When "infop" is not NULL, fills *infop with the fold level info. | |
297 */ | |
298 long | |
299 foldedCount(win, lnum, infop) | |
300 win_T *win; | |
301 linenr_T lnum; | |
302 foldinfo_T *infop; | |
303 { | |
304 linenr_T last; | |
305 | |
306 if (hasFoldingWin(win, lnum, NULL, &last, FALSE, infop)) | |
307 return (long)(last - lnum + 1); | |
308 return 0; | |
309 } | |
310 | |
311 /* foldmethodIsManual() {{{2 */ | |
312 /* | |
313 * Return TRUE if 'foldmethod' is "manual" | |
314 */ | |
315 int | |
316 foldmethodIsManual(wp) | |
317 win_T *wp; | |
318 { | |
319 return (wp->w_p_fdm[3] == 'u'); | |
320 } | |
321 | |
322 /* foldmethodIsIndent() {{{2 */ | |
323 /* | |
324 * Return TRUE if 'foldmethod' is "indent" | |
325 */ | |
326 int | |
327 foldmethodIsIndent(wp) | |
328 win_T *wp; | |
329 { | |
330 return (wp->w_p_fdm[0] == 'i'); | |
331 } | |
332 | |
333 /* foldmethodIsExpr() {{{2 */ | |
334 /* | |
335 * Return TRUE if 'foldmethod' is "expr" | |
336 */ | |
337 int | |
338 foldmethodIsExpr(wp) | |
339 win_T *wp; | |
340 { | |
341 return (wp->w_p_fdm[1] == 'x'); | |
342 } | |
343 | |
344 /* foldmethodIsMarker() {{{2 */ | |
345 /* | |
346 * Return TRUE if 'foldmethod' is "marker" | |
347 */ | |
348 int | |
349 foldmethodIsMarker(wp) | |
350 win_T *wp; | |
351 { | |
352 return (wp->w_p_fdm[2] == 'r'); | |
353 } | |
354 | |
355 /* foldmethodIsSyntax() {{{2 */ | |
356 /* | |
357 * Return TRUE if 'foldmethod' is "syntax" | |
358 */ | |
359 int | |
360 foldmethodIsSyntax(wp) | |
361 win_T *wp; | |
362 { | |
363 return (wp->w_p_fdm[0] == 's'); | |
364 } | |
365 | |
366 /* foldmethodIsDiff() {{{2 */ | |
367 /* | |
368 * Return TRUE if 'foldmethod' is "diff" | |
369 */ | |
370 int | |
371 foldmethodIsDiff(wp) | |
372 win_T *wp; | |
373 { | |
374 return (wp->w_p_fdm[0] == 'd'); | |
375 } | |
376 | |
377 /* closeFold() {{{2 */ | |
378 /* | |
379 * Close fold for current window at line "lnum". | |
380 * Repeat "count" times. | |
381 */ | |
382 void | |
383 closeFold(lnum, count) | |
384 linenr_T lnum; | |
385 long count; | |
386 { | |
387 setFoldRepeat(lnum, count, FALSE); | |
388 } | |
389 | |
390 /* closeFoldRecurse() {{{2 */ | |
391 /* | |
392 * Close fold for current window at line "lnum" recursively. | |
393 */ | |
394 void | |
395 closeFoldRecurse(lnum) | |
396 linenr_T lnum; | |
397 { | |
398 (void)setManualFold(lnum, FALSE, TRUE, NULL); | |
399 } | |
400 | |
401 /* opFoldRange() {{{2 */ | |
402 /* | |
403 * Open or Close folds for current window in lines "first" to "last". | |
404 * Used for "zo", "zO", "zc" and "zC" in Visual mode. | |
405 */ | |
406 void | |
407 opFoldRange(first, last, opening, recurse, had_visual) | |
408 linenr_T first; | |
409 linenr_T last; | |
410 int opening; /* TRUE to open, FALSE to close */ | |
411 int recurse; /* TRUE to do it recursively */ | |
412 int had_visual; /* TRUE when Visual selection used */ | |
413 { | |
414 int done = DONE_NOTHING; /* avoid error messages */ | |
415 linenr_T lnum; | |
416 linenr_T lnum_next; | |
417 | |
418 for (lnum = first; lnum <= last; lnum = lnum_next + 1) | |
419 { | |
420 lnum_next = lnum; | |
421 /* Opening one level only: next fold to open is after the one going to | |
422 * be opened. */ | |
423 if (opening && !recurse) | |
424 (void)hasFolding(lnum, NULL, &lnum_next); | |
425 (void)setManualFold(lnum, opening, recurse, &done); | |
426 /* Closing one level only: next line to close a fold is after just | |
427 * closed fold. */ | |
428 if (!opening && !recurse) | |
429 (void)hasFolding(lnum, NULL, &lnum_next); | |
430 } | |
431 if (done == DONE_NOTHING) | |
432 EMSG(_(e_nofold)); | |
433 /* Force a redraw to remove the Visual highlighting. */ | |
434 if (had_visual) | |
435 redraw_curbuf_later(INVERTED); | |
436 } | |
437 | |
438 /* openFold() {{{2 */ | |
439 /* | |
440 * Open fold for current window at line "lnum". | |
441 * Repeat "count" times. | |
442 */ | |
443 void | |
444 openFold(lnum, count) | |
445 linenr_T lnum; | |
446 long count; | |
447 { | |
448 setFoldRepeat(lnum, count, TRUE); | |
449 } | |
450 | |
451 /* openFoldRecurse() {{{2 */ | |
452 /* | |
453 * Open fold for current window at line "lnum" recursively. | |
454 */ | |
455 void | |
456 openFoldRecurse(lnum) | |
457 linenr_T lnum; | |
458 { | |
459 (void)setManualFold(lnum, TRUE, TRUE, NULL); | |
460 } | |
461 | |
462 /* foldOpenCursor() {{{2 */ | |
463 /* | |
464 * Open folds until the cursor line is not in a closed fold. | |
465 */ | |
466 void | |
467 foldOpenCursor() | |
468 { | |
469 int done; | |
470 | |
471 checkupdate(curwin); | |
472 if (hasAnyFolding(curwin)) | |
473 for (;;) | |
474 { | |
475 done = DONE_NOTHING; | |
476 (void)setManualFold(curwin->w_cursor.lnum, TRUE, FALSE, &done); | |
477 if (!(done & DONE_ACTION)) | |
478 break; | |
479 } | |
480 } | |
481 | |
482 /* newFoldLevel() {{{2 */ | |
483 /* | |
484 * Set new foldlevel for current window. | |
485 */ | |
486 void | |
487 newFoldLevel() | |
488 { | |
489 newFoldLevelWin(curwin); | |
490 | |
491 #ifdef FEAT_DIFF | |
492 if (foldmethodIsDiff(curwin) && curwin->w_p_scb) | |
493 { | |
494 win_T *wp; | |
495 | |
496 /* | |
497 * Set the same foldlevel in other windows in diff mode. | |
498 */ | |
499 FOR_ALL_WINDOWS(wp) | |
500 { | |
501 if (wp != curwin && foldmethodIsDiff(wp) && wp->w_p_scb) | |
502 { | |
503 wp->w_p_fdl = curwin->w_p_fdl; | |
504 newFoldLevelWin(wp); | |
505 } | |
506 } | |
507 } | |
508 #endif | |
509 } | |
510 | |
511 static void | |
512 newFoldLevelWin(wp) | |
513 win_T *wp; | |
514 { | |
515 fold_T *fp; | |
516 int i; | |
517 | |
518 checkupdate(wp); | |
519 if (wp->w_fold_manual) | |
520 { | |
521 /* Set all flags for the first level of folds to FD_LEVEL. Following | |
522 * manual open/close will then change the flags to FD_OPEN or | |
523 * FD_CLOSED for those folds that don't use 'foldlevel'. */ | |
524 fp = (fold_T *)wp->w_folds.ga_data; | |
525 for (i = 0; i < wp->w_folds.ga_len; ++i) | |
526 fp[i].fd_flags = FD_LEVEL; | |
527 wp->w_fold_manual = FALSE; | |
528 } | |
529 changed_window_setting_win(wp); | |
530 } | |
531 | |
532 /* foldCheckClose() {{{2 */ | |
533 /* | |
534 * Apply 'foldlevel' to all folds that don't contain the cursor. | |
535 */ | |
536 void | |
537 foldCheckClose() | |
538 { | |
539 if (*p_fcl != NUL) /* can only be "all" right now */ | |
540 { | |
541 checkupdate(curwin); | |
542 if (checkCloseRec(&curwin->w_folds, curwin->w_cursor.lnum, | |
543 (int)curwin->w_p_fdl)) | |
544 changed_window_setting(); | |
545 } | |
546 } | |
547 | |
548 /* checkCloseRec() {{{2 */ | |
549 static int | |
550 checkCloseRec(gap, lnum, level) | |
551 garray_T *gap; | |
552 linenr_T lnum; | |
553 int level; | |
554 { | |
555 fold_T *fp; | |
556 int retval = FALSE; | |
557 int i; | |
558 | |
559 fp = (fold_T *)gap->ga_data; | |
560 for (i = 0; i < gap->ga_len; ++i) | |
561 { | |
562 /* Only manually opened folds may need to be closed. */ | |
563 if (fp[i].fd_flags == FD_OPEN) | |
564 { | |
565 if (level <= 0 && (lnum < fp[i].fd_top | |
566 || lnum >= fp[i].fd_top + fp[i].fd_len)) | |
567 { | |
568 fp[i].fd_flags = FD_LEVEL; | |
569 retval = TRUE; | |
570 } | |
571 else | |
572 retval |= checkCloseRec(&fp[i].fd_nested, lnum - fp[i].fd_top, | |
573 level - 1); | |
574 } | |
575 } | |
576 return retval; | |
577 } | |
578 | |
579 /* foldCreateAllowed() {{{2 */ | |
580 /* | |
581 * Return TRUE if it's allowed to manually create or delete a fold. | |
582 * Give an error message and return FALSE if not. | |
583 */ | |
584 int | |
585 foldManualAllowed(create) | |
586 int create; | |
587 { | |
588 if (foldmethodIsManual(curwin) || foldmethodIsMarker(curwin)) | |
589 return TRUE; | |
590 if (create) | |
591 EMSG(_("E350: Cannot create fold with current 'foldmethod'")); | |
592 else | |
593 EMSG(_("E351: Cannot delete fold with current 'foldmethod'")); | |
594 return FALSE; | |
595 } | |
596 | |
597 /* foldCreate() {{{2 */ | |
598 /* | |
599 * Create a fold from line "start" to line "end" (inclusive) in the current | |
600 * window. | |
601 */ | |
602 void | |
603 foldCreate(start, end) | |
604 linenr_T start; | |
605 linenr_T end; | |
606 { | |
607 fold_T *fp; | |
608 garray_T *gap; | |
609 garray_T fold_ga; | |
610 int i, j; | |
611 int cont; | |
612 int use_level = FALSE; | |
613 int closed = FALSE; | |
614 int level = 0; | |
615 linenr_T start_rel = start; | |
616 linenr_T end_rel = end; | |
617 | |
618 if (start > end) | |
619 { | |
620 /* reverse the range */ | |
621 end = start_rel; | |
622 start = end_rel; | |
623 start_rel = start; | |
624 end_rel = end; | |
625 } | |
626 | |
627 /* When 'foldmethod' is "marker" add markers, which creates the folds. */ | |
628 if (foldmethodIsMarker(curwin)) | |
629 { | |
630 foldCreateMarkers(start, end); | |
631 return; | |
632 } | |
633 | |
634 checkupdate(curwin); | |
635 | |
636 /* Find the place to insert the new fold. */ | |
637 gap = &curwin->w_folds; | |
638 for (;;) | |
639 { | |
640 if (!foldFind(gap, start_rel, &fp)) | |
641 break; | |
642 if (fp->fd_top + fp->fd_len > end_rel) | |
643 { | |
644 /* New fold is completely inside this fold: Go one level deeper. */ | |
645 gap = &fp->fd_nested; | |
646 start_rel -= fp->fd_top; | |
647 end_rel -= fp->fd_top; | |
648 if (use_level || fp->fd_flags == FD_LEVEL) | |
649 { | |
650 use_level = TRUE; | |
651 if (level >= curwin->w_p_fdl) | |
652 closed = TRUE; | |
653 } | |
654 else if (fp->fd_flags == FD_CLOSED) | |
655 closed = TRUE; | |
656 ++level; | |
657 } | |
658 else | |
659 { | |
660 /* This fold and new fold overlap: Insert here and move some folds | |
661 * inside the new fold. */ | |
662 break; | |
663 } | |
664 } | |
665 | |
666 i = (int)(fp - (fold_T *)gap->ga_data); | |
667 if (ga_grow(gap, 1) == OK) | |
668 { | |
669 fp = (fold_T *)gap->ga_data + i; | |
670 ga_init2(&fold_ga, (int)sizeof(fold_T), 10); | |
671 | |
672 /* Count number of folds that will be contained in the new fold. */ | |
673 for (cont = 0; i + cont < gap->ga_len; ++cont) | |
674 if (fp[cont].fd_top > end_rel) | |
675 break; | |
676 if (cont > 0 && ga_grow(&fold_ga, cont) == OK) | |
677 { | |
678 /* If the first fold starts before the new fold, let the new fold | |
679 * start there. Otherwise the existing fold would change. */ | |
680 if (start_rel > fp->fd_top) | |
681 start_rel = fp->fd_top; | |
682 | |
683 /* When last contained fold isn't completely contained, adjust end | |
684 * of new fold. */ | |
685 if (end_rel < fp[cont - 1].fd_top + fp[cont - 1].fd_len - 1) | |
686 end_rel = fp[cont - 1].fd_top + fp[cont - 1].fd_len - 1; | |
687 /* Move contained folds to inside new fold. */ | |
688 mch_memmove(fold_ga.ga_data, fp, sizeof(fold_T) * cont); | |
689 fold_ga.ga_len += cont; | |
690 i += cont; | |
691 | |
692 /* Adjust line numbers in contained folds to be relative to the | |
693 * new fold. */ | |
694 for (j = 0; j < cont; ++j) | |
695 ((fold_T *)fold_ga.ga_data)[j].fd_top -= start_rel; | |
696 } | |
697 /* Move remaining entries to after the new fold. */ | |
698 if (i < gap->ga_len) | |
699 mch_memmove(fp + 1, (fold_T *)gap->ga_data + i, | |
700 sizeof(fold_T) * (gap->ga_len - i)); | |
701 gap->ga_len = gap->ga_len + 1 - cont; | |
702 | |
703 /* insert new fold */ | |
704 fp->fd_nested = fold_ga; | |
705 fp->fd_top = start_rel; | |
706 fp->fd_len = end_rel - start_rel + 1; | |
707 | |
708 /* We want the new fold to be closed. If it would remain open because | |
709 * of using 'foldlevel', need to adjust fd_flags of containing folds. | |
710 */ | |
711 if (use_level && !closed && level < curwin->w_p_fdl) | |
712 closeFold(start, 1L); | |
713 if (!use_level) | |
714 curwin->w_fold_manual = TRUE; | |
715 fp->fd_flags = FD_CLOSED; | |
716 fp->fd_small = MAYBE; | |
717 | |
718 /* redraw */ | |
719 changed_window_setting(); | |
720 } | |
721 } | |
722 | |
723 /* deleteFold() {{{2 */ | |
724 /* | |
725 * Delete a fold at line "start" in the current window. | |
726 * When "end" is not 0, delete all folds from "start" to "end". | |
727 * When "recursive" is TRUE delete recursively. | |
728 */ | |
729 void | |
730 deleteFold(start, end, recursive, had_visual) | |
731 linenr_T start; | |
732 linenr_T end; | |
733 int recursive; | |
734 int had_visual; /* TRUE when Visual selection used */ | |
735 { | |
736 garray_T *gap; | |
737 fold_T *fp; | |
738 garray_T *found_ga; | |
739 fold_T *found_fp = NULL; | |
740 linenr_T found_off = 0; | |
1780 | 741 int use_level; |
7 | 742 int maybe_small = FALSE; |
743 int level = 0; | |
744 linenr_T lnum = start; | |
745 linenr_T lnum_off; | |
746 int did_one = FALSE; | |
747 linenr_T first_lnum = MAXLNUM; | |
748 linenr_T last_lnum = 0; | |
749 | |
750 checkupdate(curwin); | |
751 | |
752 while (lnum <= end) | |
753 { | |
754 /* Find the deepest fold for "start". */ | |
755 gap = &curwin->w_folds; | |
756 found_ga = NULL; | |
757 lnum_off = 0; | |
1780 | 758 use_level = FALSE; |
7 | 759 for (;;) |
760 { | |
761 if (!foldFind(gap, lnum - lnum_off, &fp)) | |
762 break; | |
763 /* lnum is inside this fold, remember info */ | |
764 found_ga = gap; | |
765 found_fp = fp; | |
766 found_off = lnum_off; | |
767 | |
768 /* if "lnum" is folded, don't check nesting */ | |
769 if (check_closed(curwin, fp, &use_level, level, | |
770 &maybe_small, lnum_off)) | |
771 break; | |
772 | |
773 /* check nested folds */ | |
774 gap = &fp->fd_nested; | |
775 lnum_off += fp->fd_top; | |
776 ++level; | |
777 } | |
778 if (found_ga == NULL) | |
779 { | |
780 ++lnum; | |
781 } | |
782 else | |
783 { | |
784 lnum = found_fp->fd_top + found_fp->fd_len + found_off; | |
785 | |
786 if (foldmethodIsManual(curwin)) | |
787 deleteFoldEntry(found_ga, | |
788 (int)(found_fp - (fold_T *)found_ga->ga_data), recursive); | |
789 else | |
790 { | |
1780 | 791 if (first_lnum > found_fp->fd_top + found_off) |
792 first_lnum = found_fp->fd_top + found_off; | |
793 if (last_lnum < lnum) | |
7 | 794 last_lnum = lnum; |
1780 | 795 if (!did_one) |
796 parseMarker(curwin); | |
7 | 797 deleteFoldMarkers(found_fp, recursive, found_off); |
798 } | |
1780 | 799 did_one = TRUE; |
7 | 800 |
801 /* redraw window */ | |
802 changed_window_setting(); | |
803 } | |
804 } | |
805 if (!did_one) | |
806 { | |
807 EMSG(_(e_nofold)); | |
808 /* Force a redraw to remove the Visual highlighting. */ | |
809 if (had_visual) | |
810 redraw_curbuf_later(INVERTED); | |
811 } | |
1780 | 812 else |
813 /* Deleting markers may make cursor column invalid. */ | |
814 check_cursor_col(); | |
815 | |
7 | 816 if (last_lnum > 0) |
817 changed_lines(first_lnum, (colnr_T)0, last_lnum, 0L); | |
818 } | |
819 | |
820 /* clearFolding() {{{2 */ | |
821 /* | |
822 * Remove all folding for window "win". | |
823 */ | |
824 void | |
825 clearFolding(win) | |
826 win_T *win; | |
827 { | |
828 deleteFoldRecurse(&win->w_folds); | |
829 win->w_foldinvalid = FALSE; | |
830 } | |
831 | |
832 /* foldUpdate() {{{2 */ | |
833 /* | |
834 * Update folds for changes in the buffer of a window. | |
835 * Note that inserted/deleted lines must have already been taken care of by | |
836 * calling foldMarkAdjust(). | |
837 * The changes in lines from top to bot (inclusive). | |
838 */ | |
839 void | |
840 foldUpdate(wp, top, bot) | |
841 win_T *wp; | |
842 linenr_T top; | |
843 linenr_T bot; | |
844 { | |
845 fold_T *fp; | |
846 | |
847 /* Mark all folds from top to bot as maybe-small. */ | |
2071
8a0a8f10b43e
updated for version 7.2.356
Bram Moolenaar <bram@zimbu.org>
parents:
2054
diff
changeset
|
848 (void)foldFind(&curwin->w_folds, top, &fp); |
7 | 849 while (fp < (fold_T *)curwin->w_folds.ga_data + curwin->w_folds.ga_len |
850 && fp->fd_top < bot) | |
851 { | |
852 fp->fd_small = MAYBE; | |
853 ++fp; | |
854 } | |
855 | |
856 if (foldmethodIsIndent(wp) | |
857 || foldmethodIsExpr(wp) | |
858 || foldmethodIsMarker(wp) | |
859 #ifdef FEAT_DIFF | |
860 || foldmethodIsDiff(wp) | |
861 #endif | |
862 || foldmethodIsSyntax(wp)) | |
1424 | 863 { |
864 int save_got_int = got_int; | |
865 | |
866 /* reset got_int here, otherwise it won't work */ | |
867 got_int = FALSE; | |
7 | 868 foldUpdateIEMS(wp, top, bot); |
1424 | 869 got_int |= save_got_int; |
870 } | |
7 | 871 } |
872 | |
873 /* foldUpdateAll() {{{2 */ | |
874 /* | |
875 * Update all lines in a window for folding. | |
876 * Used when a fold setting changes or after reloading the buffer. | |
877 * The actual updating is postponed until fold info is used, to avoid doing | |
878 * every time a setting is changed or a syntax item is added. | |
879 */ | |
880 void | |
881 foldUpdateAll(win) | |
882 win_T *win; | |
883 { | |
884 win->w_foldinvalid = TRUE; | |
885 redraw_win_later(win, NOT_VALID); | |
886 } | |
887 | |
888 /* foldMoveTo() {{{2 */ | |
889 /* | |
890 * If "updown" is FALSE: Move to the start or end of the fold. | |
891 * If "updown" is TRUE: move to fold at the same level. | |
892 * If not moved return FAIL. | |
893 */ | |
894 int | |
895 foldMoveTo(updown, dir, count) | |
896 int updown; | |
897 int dir; /* FORWARD or BACKWARD */ | |
898 long count; | |
899 { | |
900 long n; | |
901 int retval = FAIL; | |
902 linenr_T lnum_off; | |
903 linenr_T lnum_found; | |
904 linenr_T lnum; | |
905 int use_level; | |
906 int maybe_small; | |
907 garray_T *gap; | |
908 fold_T *fp; | |
909 int level; | |
910 int last; | |
911 | |
36 | 912 checkupdate(curwin); |
913 | |
7 | 914 /* Repeat "count" times. */ |
915 for (n = 0; n < count; ++n) | |
916 { | |
917 /* Find nested folds. Stop when a fold is closed. The deepest fold | |
918 * that moves the cursor is used. */ | |
919 lnum_off = 0; | |
920 gap = &curwin->w_folds; | |
921 use_level = FALSE; | |
922 maybe_small = FALSE; | |
923 lnum_found = curwin->w_cursor.lnum; | |
924 level = 0; | |
925 last = FALSE; | |
926 for (;;) | |
927 { | |
928 if (!foldFind(gap, curwin->w_cursor.lnum - lnum_off, &fp)) | |
929 { | |
930 if (!updown) | |
931 break; | |
932 | |
933 /* When moving up, consider a fold above the cursor; when | |
934 * moving down consider a fold below the cursor. */ | |
935 if (dir == FORWARD) | |
936 { | |
937 if (fp - (fold_T *)gap->ga_data >= gap->ga_len) | |
938 break; | |
939 --fp; | |
940 } | |
941 else | |
942 { | |
943 if (fp == (fold_T *)gap->ga_data) | |
944 break; | |
945 } | |
946 /* don't look for contained folds, they will always move | |
947 * the cursor too far. */ | |
948 last = TRUE; | |
949 } | |
950 | |
951 if (!last) | |
952 { | |
953 /* Check if this fold is closed. */ | |
954 if (check_closed(curwin, fp, &use_level, level, | |
955 &maybe_small, lnum_off)) | |
956 last = TRUE; | |
957 | |
958 /* "[z" and "]z" stop at closed fold */ | |
959 if (last && !updown) | |
960 break; | |
961 } | |
962 | |
963 if (updown) | |
964 { | |
965 if (dir == FORWARD) | |
966 { | |
967 /* to start of next fold if there is one */ | |
968 if (fp + 1 - (fold_T *)gap->ga_data < gap->ga_len) | |
969 { | |
970 lnum = fp[1].fd_top + lnum_off; | |
971 if (lnum > curwin->w_cursor.lnum) | |
972 lnum_found = lnum; | |
973 } | |
974 } | |
975 else | |
976 { | |
977 /* to end of previous fold if there is one */ | |
978 if (fp > (fold_T *)gap->ga_data) | |
979 { | |
980 lnum = fp[-1].fd_top + lnum_off + fp[-1].fd_len - 1; | |
981 if (lnum < curwin->w_cursor.lnum) | |
982 lnum_found = lnum; | |
983 } | |
984 } | |
985 } | |
986 else | |
987 { | |
988 /* Open fold found, set cursor to its start/end and then check | |
989 * nested folds. */ | |
990 if (dir == FORWARD) | |
991 { | |
992 lnum = fp->fd_top + lnum_off + fp->fd_len - 1; | |
993 if (lnum > curwin->w_cursor.lnum) | |
994 lnum_found = lnum; | |
995 } | |
996 else | |
997 { | |
998 lnum = fp->fd_top + lnum_off; | |
999 if (lnum < curwin->w_cursor.lnum) | |
1000 lnum_found = lnum; | |
1001 } | |
1002 } | |
1003 | |
1004 if (last) | |
1005 break; | |
1006 | |
1007 /* Check nested folds (if any). */ | |
1008 gap = &fp->fd_nested; | |
1009 lnum_off += fp->fd_top; | |
1010 ++level; | |
1011 } | |
1012 if (lnum_found != curwin->w_cursor.lnum) | |
1013 { | |
1014 if (retval == FAIL) | |
1015 setpcmark(); | |
1016 curwin->w_cursor.lnum = lnum_found; | |
1017 curwin->w_cursor.col = 0; | |
1018 retval = OK; | |
1019 } | |
1020 else | |
1021 break; | |
1022 } | |
1023 | |
1024 return retval; | |
1025 } | |
1026 | |
1027 /* foldInitWin() {{{2 */ | |
1028 /* | |
1029 * Init the fold info in a new window. | |
1030 */ | |
1031 void | |
3263 | 1032 foldInitWin(new_win) |
1033 win_T *new_win; | |
7 | 1034 { |
3263 | 1035 ga_init2(&new_win->w_folds, (int)sizeof(fold_T), 10); |
7 | 1036 } |
1037 | |
1038 /* find_wl_entry() {{{2 */ | |
1039 /* | |
1040 * Find an entry in the win->w_lines[] array for buffer line "lnum". | |
1041 * Only valid entries are considered (for entries where wl_valid is FALSE the | |
1042 * line number can be wrong). | |
1043 * Returns index of entry or -1 if not found. | |
1044 */ | |
1045 int | |
1046 find_wl_entry(win, lnum) | |
1047 win_T *win; | |
1048 linenr_T lnum; | |
1049 { | |
1050 int i; | |
1051 | |
2114
5a97d0c03b59
updated for version 7.2.397
Bram Moolenaar <bram@zimbu.org>
parents:
2086
diff
changeset
|
1052 for (i = 0; i < win->w_lines_valid; ++i) |
5a97d0c03b59
updated for version 7.2.397
Bram Moolenaar <bram@zimbu.org>
parents:
2086
diff
changeset
|
1053 if (win->w_lines[i].wl_valid) |
5a97d0c03b59
updated for version 7.2.397
Bram Moolenaar <bram@zimbu.org>
parents:
2086
diff
changeset
|
1054 { |
5a97d0c03b59
updated for version 7.2.397
Bram Moolenaar <bram@zimbu.org>
parents:
2086
diff
changeset
|
1055 if (lnum < win->w_lines[i].wl_lnum) |
5a97d0c03b59
updated for version 7.2.397
Bram Moolenaar <bram@zimbu.org>
parents:
2086
diff
changeset
|
1056 return -1; |
5a97d0c03b59
updated for version 7.2.397
Bram Moolenaar <bram@zimbu.org>
parents:
2086
diff
changeset
|
1057 if (lnum <= win->w_lines[i].wl_lastlnum) |
5a97d0c03b59
updated for version 7.2.397
Bram Moolenaar <bram@zimbu.org>
parents:
2086
diff
changeset
|
1058 return i; |
5a97d0c03b59
updated for version 7.2.397
Bram Moolenaar <bram@zimbu.org>
parents:
2086
diff
changeset
|
1059 } |
7 | 1060 return -1; |
1061 } | |
1062 | |
1063 /* foldAdjustVisual() {{{2 */ | |
1064 /* | |
1065 * Adjust the Visual area to include any fold at the start or end completely. | |
1066 */ | |
1067 void | |
1068 foldAdjustVisual() | |
1069 { | |
1070 pos_T *start, *end; | |
1071 char_u *ptr; | |
1072 | |
1073 if (!VIsual_active || !hasAnyFolding(curwin)) | |
1074 return; | |
1075 | |
1076 if (ltoreq(VIsual, curwin->w_cursor)) | |
1077 { | |
1078 start = &VIsual; | |
1079 end = &curwin->w_cursor; | |
1080 } | |
1081 else | |
1082 { | |
1083 start = &curwin->w_cursor; | |
1084 end = &VIsual; | |
1085 } | |
1086 if (hasFolding(start->lnum, &start->lnum, NULL)) | |
1087 start->col = 0; | |
1088 if (hasFolding(end->lnum, NULL, &end->lnum)) | |
1089 { | |
1090 ptr = ml_get(end->lnum); | |
1091 end->col = (colnr_T)STRLEN(ptr); | |
1092 if (end->col > 0 && *p_sel == 'o') | |
1093 --end->col; | |
1094 #ifdef FEAT_MBYTE | |
1095 /* prevent cursor from moving on the trail byte */ | |
1096 if (has_mbyte) | |
1097 mb_adjust_cursor(); | |
1098 #endif | |
1099 } | |
1100 } | |
1101 | |
1102 /* cursor_foldstart() {{{2 */ | |
1103 /* | |
1104 * Move the cursor to the first line of a closed fold. | |
1105 */ | |
1106 void | |
1107 foldAdjustCursor() | |
1108 { | |
1109 (void)hasFolding(curwin->w_cursor.lnum, &curwin->w_cursor.lnum, NULL); | |
1110 } | |
1111 | |
1112 /* Internal functions for "fold_T" {{{1 */ | |
1113 /* cloneFoldGrowArray() {{{2 */ | |
1114 /* | |
1115 * Will "clone" (i.e deep copy) a garray_T of folds. | |
1116 * | |
1117 * Return FAIL if the operation cannot be completed, otherwise OK. | |
1118 */ | |
1119 void | |
1120 cloneFoldGrowArray(from, to) | |
1121 garray_T *from; | |
1122 garray_T *to; | |
1123 { | |
1124 int i; | |
1125 fold_T *from_p; | |
1126 fold_T *to_p; | |
1127 | |
1128 ga_init2(to, from->ga_itemsize, from->ga_growsize); | |
1129 if (from->ga_len == 0 || ga_grow(to, from->ga_len) == FAIL) | |
1130 return; | |
1131 | |
1132 from_p = (fold_T *)from->ga_data; | |
1133 to_p = (fold_T *)to->ga_data; | |
1134 | |
1135 for (i = 0; i < from->ga_len; i++) | |
1136 { | |
1137 to_p->fd_top = from_p->fd_top; | |
1138 to_p->fd_len = from_p->fd_len; | |
1139 to_p->fd_flags = from_p->fd_flags; | |
1140 to_p->fd_small = from_p->fd_small; | |
1141 cloneFoldGrowArray(&from_p->fd_nested, &to_p->fd_nested); | |
1142 ++to->ga_len; | |
1143 ++from_p; | |
1144 ++to_p; | |
1145 } | |
1146 } | |
1147 | |
1148 /* foldFind() {{{2 */ | |
1149 /* | |
1150 * Search for line "lnum" in folds of growarray "gap". | |
1151 * Set *fpp to the fold struct for the fold that contains "lnum" or | |
1152 * the first fold below it (careful: it can be beyond the end of the array!). | |
1153 * Returns FALSE when there is no fold that contains "lnum". | |
1154 */ | |
1155 static int | |
1156 foldFind(gap, lnum, fpp) | |
1157 garray_T *gap; | |
1158 linenr_T lnum; | |
1159 fold_T **fpp; | |
1160 { | |
1161 linenr_T low, high; | |
1162 fold_T *fp; | |
1163 int i; | |
1164 | |
1165 /* | |
1166 * Perform a binary search. | |
1167 * "low" is lowest index of possible match. | |
1168 * "high" is highest index of possible match. | |
1169 */ | |
1170 fp = (fold_T *)gap->ga_data; | |
1171 low = 0; | |
1172 high = gap->ga_len - 1; | |
1173 while (low <= high) | |
1174 { | |
1175 i = (low + high) / 2; | |
1176 if (fp[i].fd_top > lnum) | |
1177 /* fold below lnum, adjust high */ | |
1178 high = i - 1; | |
1179 else if (fp[i].fd_top + fp[i].fd_len <= lnum) | |
1180 /* fold above lnum, adjust low */ | |
1181 low = i + 1; | |
1182 else | |
1183 { | |
1184 /* lnum is inside this fold */ | |
1185 *fpp = fp + i; | |
1186 return TRUE; | |
1187 } | |
1188 } | |
1189 *fpp = fp + low; | |
1190 return FALSE; | |
1191 } | |
1192 | |
1193 /* foldLevelWin() {{{2 */ | |
1194 /* | |
1195 * Return fold level at line number "lnum" in window "wp". | |
1196 */ | |
1197 static int | |
1198 foldLevelWin(wp, lnum) | |
1199 win_T *wp; | |
1200 linenr_T lnum; | |
1201 { | |
1202 fold_T *fp; | |
1203 linenr_T lnum_rel = lnum; | |
1204 int level = 0; | |
1205 garray_T *gap; | |
1206 | |
1207 /* Recursively search for a fold that contains "lnum". */ | |
1208 gap = &wp->w_folds; | |
1209 for (;;) | |
1210 { | |
1211 if (!foldFind(gap, lnum_rel, &fp)) | |
1212 break; | |
1213 /* Check nested folds. Line number is relative to containing fold. */ | |
1214 gap = &fp->fd_nested; | |
1215 lnum_rel -= fp->fd_top; | |
1216 ++level; | |
1217 } | |
1218 | |
1219 return level; | |
1220 } | |
1221 | |
1222 /* checkupdate() {{{2 */ | |
1223 /* | |
1224 * Check if the folds in window "wp" are invalid and update them if needed. | |
1225 */ | |
1226 static void | |
1227 checkupdate(wp) | |
1228 win_T *wp; | |
1229 { | |
1230 if (wp->w_foldinvalid) | |
1231 { | |
1232 foldUpdate(wp, (linenr_T)1, (linenr_T)MAXLNUM); /* will update all */ | |
1233 wp->w_foldinvalid = FALSE; | |
1234 } | |
1235 } | |
1236 | |
1237 /* setFoldRepeat() {{{2 */ | |
1238 /* | |
1239 * Open or close fold for current window at line "lnum". | |
1240 * Repeat "count" times. | |
1241 */ | |
1242 static void | |
1757 | 1243 setFoldRepeat(lnum, count, do_open) |
7 | 1244 linenr_T lnum; |
1245 long count; | |
1757 | 1246 int do_open; |
7 | 1247 { |
1248 int done; | |
1249 long n; | |
1250 | |
1251 for (n = 0; n < count; ++n) | |
1252 { | |
1253 done = DONE_NOTHING; | |
1757 | 1254 (void)setManualFold(lnum, do_open, FALSE, &done); |
7 | 1255 if (!(done & DONE_ACTION)) |
1256 { | |
1257 /* Only give an error message when no fold could be opened. */ | |
1258 if (n == 0 && !(done & DONE_FOLD)) | |
1259 EMSG(_(e_nofold)); | |
1260 break; | |
1261 } | |
1262 } | |
1263 } | |
1264 | |
1265 /* setManualFold() {{{2 */ | |
1266 /* | |
1267 * Open or close the fold in the current window which contains "lnum". | |
1268 * Also does this for other windows in diff mode when needed. | |
1269 */ | |
1270 static linenr_T | |
1271 setManualFold(lnum, opening, recurse, donep) | |
1272 linenr_T lnum; | |
1273 int opening; /* TRUE when opening, FALSE when closing */ | |
1274 int recurse; /* TRUE when closing/opening recursive */ | |
1275 int *donep; | |
1276 { | |
1277 #ifdef FEAT_DIFF | |
1278 if (foldmethodIsDiff(curwin) && curwin->w_p_scb) | |
1279 { | |
1280 win_T *wp; | |
1281 linenr_T dlnum; | |
1282 | |
1283 /* | |
1284 * Do the same operation in other windows in diff mode. Calculate the | |
1285 * line number from the diffs. | |
1286 */ | |
1287 FOR_ALL_WINDOWS(wp) | |
1288 { | |
1289 if (wp != curwin && foldmethodIsDiff(wp) && wp->w_p_scb) | |
1290 { | |
1291 dlnum = diff_lnum_win(curwin->w_cursor.lnum, wp); | |
1292 if (dlnum != 0) | |
1293 (void)setManualFoldWin(wp, dlnum, opening, recurse, NULL); | |
1294 } | |
1295 } | |
1296 } | |
1297 #endif | |
1298 | |
1299 return setManualFoldWin(curwin, lnum, opening, recurse, donep); | |
1300 } | |
1301 | |
1302 /* setManualFoldWin() {{{2 */ | |
1303 /* | |
1304 * Open or close the fold in window "wp" which contains "lnum". | |
1305 * "donep", when not NULL, points to flag that is set to DONE_FOLD when some | |
1306 * fold was found and to DONE_ACTION when some fold was opened or closed. | |
1307 * When "donep" is NULL give an error message when no fold was found for | |
1308 * "lnum", but only if "wp" is "curwin". | |
1309 * Return the line number of the next line that could be closed. | |
1310 * It's only valid when "opening" is TRUE! | |
1311 */ | |
1312 static linenr_T | |
1313 setManualFoldWin(wp, lnum, opening, recurse, donep) | |
1314 win_T *wp; | |
1315 linenr_T lnum; | |
1316 int opening; /* TRUE when opening, FALSE when closing */ | |
1317 int recurse; /* TRUE when closing/opening recursive */ | |
1318 int *donep; | |
1319 { | |
1320 fold_T *fp; | |
1321 fold_T *fp2; | |
1322 fold_T *found = NULL; | |
1323 int j; | |
1324 int level = 0; | |
1325 int use_level = FALSE; | |
1326 int found_fold = FALSE; | |
1327 garray_T *gap; | |
1328 linenr_T next = MAXLNUM; | |
1329 linenr_T off = 0; | |
1330 int done = 0; | |
1331 | |
1332 checkupdate(wp); | |
1333 | |
1334 /* | |
1335 * Find the fold, open or close it. | |
1336 */ | |
1337 gap = &wp->w_folds; | |
1338 for (;;) | |
1339 { | |
1340 if (!foldFind(gap, lnum, &fp)) | |
1341 { | |
1342 /* If there is a following fold, continue there next time. */ | |
1343 if (fp < (fold_T *)gap->ga_data + gap->ga_len) | |
1344 next = fp->fd_top + off; | |
1345 break; | |
1346 } | |
1347 | |
1348 /* lnum is inside this fold */ | |
1349 found_fold = TRUE; | |
1350 | |
1351 /* If there is a following fold, continue there next time. */ | |
1352 if (fp + 1 < (fold_T *)gap->ga_data + gap->ga_len) | |
1353 next = fp[1].fd_top + off; | |
1354 | |
1355 /* Change from level-dependent folding to manual. */ | |
1356 if (use_level || fp->fd_flags == FD_LEVEL) | |
1357 { | |
1358 use_level = TRUE; | |
1359 if (level >= wp->w_p_fdl) | |
1360 fp->fd_flags = FD_CLOSED; | |
1361 else | |
1362 fp->fd_flags = FD_OPEN; | |
1363 fp2 = (fold_T *)fp->fd_nested.ga_data; | |
1364 for (j = 0; j < fp->fd_nested.ga_len; ++j) | |
1365 fp2[j].fd_flags = FD_LEVEL; | |
1366 } | |
1367 | |
1368 /* Simple case: Close recursively means closing the fold. */ | |
1369 if (!opening && recurse) | |
1370 { | |
1371 if (fp->fd_flags != FD_CLOSED) | |
1372 { | |
1373 done |= DONE_ACTION; | |
1374 fp->fd_flags = FD_CLOSED; | |
1375 } | |
1376 } | |
1377 else if (fp->fd_flags == FD_CLOSED) | |
1378 { | |
1379 /* When opening, open topmost closed fold. */ | |
1380 if (opening) | |
1381 { | |
1382 fp->fd_flags = FD_OPEN; | |
1383 done |= DONE_ACTION; | |
1384 if (recurse) | |
1385 foldOpenNested(fp); | |
1386 } | |
1387 break; | |
1388 } | |
1389 | |
1390 /* fold is open, check nested folds */ | |
1391 found = fp; | |
1392 gap = &fp->fd_nested; | |
1393 lnum -= fp->fd_top; | |
1394 off += fp->fd_top; | |
1395 ++level; | |
1396 } | |
1397 if (found_fold) | |
1398 { | |
1399 /* When closing and not recurse, close deepest open fold. */ | |
1400 if (!opening && found != NULL) | |
1401 { | |
1402 found->fd_flags = FD_CLOSED; | |
1403 done |= DONE_ACTION; | |
1404 } | |
1405 wp->w_fold_manual = TRUE; | |
1406 if (done & DONE_ACTION) | |
1407 changed_window_setting_win(wp); | |
1408 done |= DONE_FOLD; | |
1409 } | |
1410 else if (donep == NULL && wp == curwin) | |
1411 EMSG(_(e_nofold)); | |
1412 | |
1413 if (donep != NULL) | |
1414 *donep |= done; | |
1415 | |
1416 return next; | |
1417 } | |
1418 | |
1419 /* foldOpenNested() {{{2 */ | |
1420 /* | |
1421 * Open all nested folds in fold "fpr" recursively. | |
1422 */ | |
1423 static void | |
1424 foldOpenNested(fpr) | |
1425 fold_T *fpr; | |
1426 { | |
1427 int i; | |
1428 fold_T *fp; | |
1429 | |
1430 fp = (fold_T *)fpr->fd_nested.ga_data; | |
1431 for (i = 0; i < fpr->fd_nested.ga_len; ++i) | |
1432 { | |
1433 foldOpenNested(&fp[i]); | |
1434 fp[i].fd_flags = FD_OPEN; | |
1435 } | |
1436 } | |
1437 | |
1438 /* deleteFoldEntry() {{{2 */ | |
1439 /* | |
1440 * Delete fold "idx" from growarray "gap". | |
1441 * When "recursive" is TRUE also delete all the folds contained in it. | |
1442 * When "recursive" is FALSE contained folds are moved one level up. | |
1443 */ | |
1444 static void | |
1445 deleteFoldEntry(gap, idx, recursive) | |
1446 garray_T *gap; | |
1447 int idx; | |
1448 int recursive; | |
1449 { | |
1450 fold_T *fp; | |
1451 int i; | |
1452 long moved; | |
1453 fold_T *nfp; | |
1454 | |
1455 fp = (fold_T *)gap->ga_data + idx; | |
1456 if (recursive || fp->fd_nested.ga_len == 0) | |
1457 { | |
1458 /* recursively delete the contained folds */ | |
1459 deleteFoldRecurse(&fp->fd_nested); | |
1460 --gap->ga_len; | |
1461 if (idx < gap->ga_len) | |
1462 mch_memmove(fp, fp + 1, sizeof(fold_T) * (gap->ga_len - idx)); | |
1463 } | |
1464 else | |
1465 { | |
3028 | 1466 /* Move nested folds one level up, to overwrite the fold that is |
7 | 1467 * deleted. */ |
1468 moved = fp->fd_nested.ga_len; | |
1469 if (ga_grow(gap, (int)(moved - 1)) == OK) | |
1470 { | |
3028 | 1471 /* Get "fp" again, the array may have been reallocated. */ |
1472 fp = (fold_T *)gap->ga_data + idx; | |
1473 | |
7 | 1474 /* adjust fd_top and fd_flags for the moved folds */ |
1475 nfp = (fold_T *)fp->fd_nested.ga_data; | |
1476 for (i = 0; i < moved; ++i) | |
1477 { | |
1478 nfp[i].fd_top += fp->fd_top; | |
1479 if (fp->fd_flags == FD_LEVEL) | |
1480 nfp[i].fd_flags = FD_LEVEL; | |
1481 if (fp->fd_small == MAYBE) | |
1482 nfp[i].fd_small = MAYBE; | |
1483 } | |
1484 | |
1485 /* move the existing folds down to make room */ | |
3028 | 1486 if (idx + 1 < gap->ga_len) |
7 | 1487 mch_memmove(fp + moved, fp + 1, |
3028 | 1488 sizeof(fold_T) * (gap->ga_len - (idx + 1))); |
7 | 1489 /* move the contained folds one level up */ |
1490 mch_memmove(fp, nfp, (size_t)(sizeof(fold_T) * moved)); | |
1491 vim_free(nfp); | |
1492 gap->ga_len += moved - 1; | |
1493 } | |
1494 } | |
1495 } | |
1496 | |
1497 /* deleteFoldRecurse() {{{2 */ | |
1498 /* | |
1499 * Delete nested folds in a fold. | |
1500 */ | |
1501 void | |
1502 deleteFoldRecurse(gap) | |
1503 garray_T *gap; | |
1504 { | |
1505 int i; | |
1506 | |
1507 for (i = 0; i < gap->ga_len; ++i) | |
1508 deleteFoldRecurse(&(((fold_T *)(gap->ga_data))[i].fd_nested)); | |
1509 ga_clear(gap); | |
1510 } | |
1511 | |
1512 /* foldMarkAdjust() {{{2 */ | |
1513 /* | |
1514 * Update line numbers of folds for inserted/deleted lines. | |
1515 */ | |
1516 void | |
1517 foldMarkAdjust(wp, line1, line2, amount, amount_after) | |
1518 win_T *wp; | |
1519 linenr_T line1; | |
1520 linenr_T line2; | |
1521 long amount; | |
1522 long amount_after; | |
1523 { | |
1524 /* If deleting marks from line1 to line2, but not deleting all those | |
1525 * lines, set line2 so that only deleted lines have their folds removed. */ | |
1526 if (amount == MAXLNUM && line2 >= line1 && line2 - line1 >= -amount_after) | |
1527 line2 = line1 - amount_after - 1; | |
1528 /* If appending a line in Insert mode, it should be included in the fold | |
1529 * just above the line. */ | |
1530 if ((State & INSERT) && amount == (linenr_T)1 && line2 == MAXLNUM) | |
1531 --line1; | |
1532 foldMarkAdjustRecurse(&wp->w_folds, line1, line2, amount, amount_after); | |
1533 } | |
1534 | |
1535 /* foldMarkAdjustRecurse() {{{2 */ | |
1536 static void | |
1537 foldMarkAdjustRecurse(gap, line1, line2, amount, amount_after) | |
1538 garray_T *gap; | |
1539 linenr_T line1; | |
1540 linenr_T line2; | |
1541 long amount; | |
1542 long amount_after; | |
1543 { | |
1544 fold_T *fp; | |
1545 int i; | |
1546 linenr_T last; | |
1547 linenr_T top; | |
1548 | |
1549 /* In Insert mode an inserted line at the top of a fold is considered part | |
1550 * of the fold, otherwise it isn't. */ | |
1551 if ((State & INSERT) && amount == (linenr_T)1 && line2 == MAXLNUM) | |
1552 top = line1 + 1; | |
1553 else | |
1554 top = line1; | |
1555 | |
1556 /* Find the fold containing or just below "line1". */ | |
1557 (void)foldFind(gap, line1, &fp); | |
1558 | |
1559 /* | |
1560 * Adjust all folds below "line1" that are affected. | |
1561 */ | |
1562 for (i = (int)(fp - (fold_T *)gap->ga_data); i < gap->ga_len; ++i, ++fp) | |
1563 { | |
1564 /* | |
1565 * Check for these situations: | |
1566 * 1 2 3 | |
1567 * 1 2 3 | |
1568 * line1 2 3 4 5 | |
1569 * 2 3 4 5 | |
1570 * 2 3 4 5 | |
1571 * line2 2 3 4 5 | |
1572 * 3 5 6 | |
1573 * 3 5 6 | |
1574 */ | |
1575 | |
1576 last = fp->fd_top + fp->fd_len - 1; /* last line of fold */ | |
1577 | |
1578 /* 1. fold completely above line1: nothing to do */ | |
1579 if (last < line1) | |
1580 continue; | |
1581 | |
1582 /* 6. fold below line2: only adjust for amount_after */ | |
1583 if (fp->fd_top > line2) | |
1584 { | |
1585 if (amount_after == 0) | |
1586 break; | |
1587 fp->fd_top += amount_after; | |
1588 } | |
1589 else | |
1590 { | |
1591 if (fp->fd_top >= top && last <= line2) | |
1592 { | |
1593 /* 4. fold completely contained in range */ | |
1594 if (amount == MAXLNUM) | |
1595 { | |
1596 /* Deleting lines: delete the fold completely */ | |
1597 deleteFoldEntry(gap, i, TRUE); | |
1598 --i; /* adjust index for deletion */ | |
1599 --fp; | |
1600 } | |
1601 else | |
1602 fp->fd_top += amount; | |
1603 } | |
1604 else | |
1605 { | |
1606 if (fp->fd_top < top) | |
1607 { | |
1964 | 1608 /* 2 or 3: need to correct nested folds too */ |
1609 foldMarkAdjustRecurse(&fp->fd_nested, line1 - fp->fd_top, | |
1610 line2 - fp->fd_top, amount, amount_after); | |
7 | 1611 if (last <= line2) |
1612 { | |
1613 /* 2. fold contains line1, line2 is below fold */ | |
1614 if (amount == MAXLNUM) | |
1615 fp->fd_len = line1 - fp->fd_top; | |
1616 else | |
1617 fp->fd_len += amount; | |
1618 } | |
1619 else | |
1620 { | |
1621 /* 3. fold contains line1 and line2 */ | |
1622 fp->fd_len += amount_after; | |
1623 } | |
1624 } | |
1625 else | |
1626 { | |
1964 | 1627 /* 5. fold is below line1 and contains line2; need to |
1628 * correct nested folds too */ | |
1629 foldMarkAdjustRecurse(&fp->fd_nested, line1 - fp->fd_top, | |
1630 line2 - fp->fd_top, amount, | |
1631 amount_after + (fp->fd_top - top)); | |
7 | 1632 if (amount == MAXLNUM) |
1633 { | |
1634 fp->fd_len -= line2 - fp->fd_top + 1; | |
1635 fp->fd_top = line1; | |
1636 } | |
1637 else | |
1638 { | |
1639 fp->fd_len += amount_after - amount; | |
1640 fp->fd_top += amount; | |
1641 } | |
1642 } | |
1643 } | |
1644 } | |
1645 } | |
1646 } | |
1647 | |
1648 /* getDeepestNesting() {{{2 */ | |
1649 /* | |
1650 * Get the lowest 'foldlevel' value that makes the deepest nested fold in the | |
1651 * current window open. | |
1652 */ | |
1653 int | |
1654 getDeepestNesting() | |
1655 { | |
1656 checkupdate(curwin); | |
1657 return getDeepestNestingRecurse(&curwin->w_folds); | |
1658 } | |
1659 | |
1660 static int | |
1661 getDeepestNestingRecurse(gap) | |
1662 garray_T *gap; | |
1663 { | |
1664 int i; | |
1665 int level; | |
1666 int maxlevel = 0; | |
1667 fold_T *fp; | |
1668 | |
1669 fp = (fold_T *)gap->ga_data; | |
1670 for (i = 0; i < gap->ga_len; ++i) | |
1671 { | |
1672 level = getDeepestNestingRecurse(&fp[i].fd_nested) + 1; | |
1673 if (level > maxlevel) | |
1674 maxlevel = level; | |
1675 } | |
1676 | |
1677 return maxlevel; | |
1678 } | |
1679 | |
1680 /* check_closed() {{{2 */ | |
1681 /* | |
1682 * Check if a fold is closed and update the info needed to check nested folds. | |
1683 */ | |
1684 static int | |
1685 check_closed(win, fp, use_levelp, level, maybe_smallp, lnum_off) | |
1686 win_T *win; | |
1687 fold_T *fp; | |
1688 int *use_levelp; /* TRUE: outer fold had FD_LEVEL */ | |
1689 int level; /* folding depth */ | |
1690 int *maybe_smallp; /* TRUE: outer this had fd_small == MAYBE */ | |
1691 linenr_T lnum_off; /* line number offset for fp->fd_top */ | |
1692 { | |
1693 int closed = FALSE; | |
1694 | |
1695 /* Check if this fold is closed. If the flag is FD_LEVEL this | |
1696 * fold and all folds it contains depend on 'foldlevel'. */ | |
1697 if (*use_levelp || fp->fd_flags == FD_LEVEL) | |
1698 { | |
1699 *use_levelp = TRUE; | |
1700 if (level >= win->w_p_fdl) | |
1701 closed = TRUE; | |
1702 } | |
1703 else if (fp->fd_flags == FD_CLOSED) | |
1704 closed = TRUE; | |
1705 | |
1706 /* Small fold isn't closed anyway. */ | |
1707 if (fp->fd_small == MAYBE) | |
1708 *maybe_smallp = TRUE; | |
1709 if (closed) | |
1710 { | |
1711 if (*maybe_smallp) | |
1712 fp->fd_small = MAYBE; | |
1713 checkSmall(win, fp, lnum_off); | |
1714 if (fp->fd_small == TRUE) | |
1715 closed = FALSE; | |
1716 } | |
1717 return closed; | |
1718 } | |
1719 | |
1720 /* checkSmall() {{{2 */ | |
1721 /* | |
1722 * Update fd_small field of fold "fp". | |
1723 */ | |
1724 static void | |
1725 checkSmall(wp, fp, lnum_off) | |
1726 win_T *wp; | |
1727 fold_T *fp; | |
1728 linenr_T lnum_off; /* offset for fp->fd_top */ | |
1729 { | |
1730 int count; | |
1731 int n; | |
1732 | |
1733 if (fp->fd_small == MAYBE) | |
1734 { | |
1735 /* Mark any nested folds to maybe-small */ | |
1736 setSmallMaybe(&fp->fd_nested); | |
1737 | |
1738 if (fp->fd_len > curwin->w_p_fml) | |
1739 fp->fd_small = FALSE; | |
1740 else | |
1741 { | |
1742 count = 0; | |
1743 for (n = 0; n < fp->fd_len; ++n) | |
1744 { | |
1745 count += plines_win_nofold(wp, fp->fd_top + lnum_off + n); | |
1746 if (count > curwin->w_p_fml) | |
1747 { | |
1748 fp->fd_small = FALSE; | |
1749 return; | |
1750 } | |
1751 } | |
1752 fp->fd_small = TRUE; | |
1753 } | |
1754 } | |
1755 } | |
1756 | |
1757 /* setSmallMaybe() {{{2 */ | |
1758 /* | |
1759 * Set small flags in "gap" to MAYBE. | |
1760 */ | |
1761 static void | |
1762 setSmallMaybe(gap) | |
1763 garray_T *gap; | |
1764 { | |
1765 int i; | |
1766 fold_T *fp; | |
1767 | |
1768 fp = (fold_T *)gap->ga_data; | |
1769 for (i = 0; i < gap->ga_len; ++i) | |
1770 fp[i].fd_small = MAYBE; | |
1771 } | |
1772 | |
1773 /* foldCreateMarkers() {{{2 */ | |
1774 /* | |
1775 * Create a fold from line "start" to line "end" (inclusive) in the current | |
1776 * window by adding markers. | |
1777 */ | |
1778 static void | |
1779 foldCreateMarkers(start, end) | |
1780 linenr_T start; | |
1781 linenr_T end; | |
1782 { | |
1783 if (!curbuf->b_p_ma) | |
1784 { | |
1785 EMSG(_(e_modifiable)); | |
1786 return; | |
1787 } | |
1788 parseMarker(curwin); | |
1789 | |
1790 foldAddMarker(start, curwin->w_p_fmr, foldstartmarkerlen); | |
1791 foldAddMarker(end, foldendmarker, foldendmarkerlen); | |
1792 | |
1793 /* Update both changes here, to avoid all folds after the start are | |
1794 * changed when the start marker is inserted and the end isn't. */ | |
1795 changed_lines(start, (colnr_T)0, end, 0L); | |
1796 } | |
1797 | |
1798 /* foldAddMarker() {{{2 */ | |
1799 /* | |
1800 * Add "marker[markerlen]" in 'commentstring' to line "lnum". | |
1801 */ | |
1802 static void | |
1803 foldAddMarker(lnum, marker, markerlen) | |
1804 linenr_T lnum; | |
1805 char_u *marker; | |
1806 int markerlen; | |
1807 { | |
1808 char_u *cms = curbuf->b_p_cms; | |
1809 char_u *line; | |
1810 int line_len; | |
1811 char_u *newline; | |
1812 char_u *p = (char_u *)strstr((char *)curbuf->b_p_cms, "%s"); | |
1813 | |
1814 /* Allocate a new line: old-line + 'cms'-start + marker + 'cms'-end */ | |
1815 line = ml_get(lnum); | |
1816 line_len = (int)STRLEN(line); | |
1817 | |
1818 if (u_save(lnum - 1, lnum + 1) == OK) | |
1819 { | |
1820 newline = alloc((unsigned)(line_len + markerlen + STRLEN(cms) + 1)); | |
1821 if (newline == NULL) | |
1822 return; | |
1823 STRCPY(newline, line); | |
1824 if (p == NULL) | |
419 | 1825 vim_strncpy(newline + line_len, marker, markerlen); |
7 | 1826 else |
1827 { | |
1828 STRCPY(newline + line_len, cms); | |
1829 STRNCPY(newline + line_len + (p - cms), marker, markerlen); | |
1830 STRCPY(newline + line_len + (p - cms) + markerlen, p + 2); | |
1831 } | |
1832 | |
1833 ml_replace(lnum, newline, FALSE); | |
1834 } | |
1835 } | |
1836 | |
1837 /* deleteFoldMarkers() {{{2 */ | |
1838 /* | |
1839 * Delete the markers for a fold, causing it to be deleted. | |
1840 */ | |
1841 static void | |
1842 deleteFoldMarkers(fp, recursive, lnum_off) | |
1843 fold_T *fp; | |
1844 int recursive; | |
1845 linenr_T lnum_off; /* offset for fp->fd_top */ | |
1846 { | |
1847 int i; | |
1848 | |
1849 if (recursive) | |
1850 for (i = 0; i < fp->fd_nested.ga_len; ++i) | |
1851 deleteFoldMarkers((fold_T *)fp->fd_nested.ga_data + i, TRUE, | |
1852 lnum_off + fp->fd_top); | |
1853 foldDelMarker(fp->fd_top + lnum_off, curwin->w_p_fmr, foldstartmarkerlen); | |
1854 foldDelMarker(fp->fd_top + lnum_off + fp->fd_len - 1, | |
1855 foldendmarker, foldendmarkerlen); | |
1856 } | |
1857 | |
1858 /* foldDelMarker() {{{2 */ | |
1859 /* | |
1860 * Delete marker "marker[markerlen]" at the end of line "lnum". | |
1861 * Delete 'commentstring' if it matches. | |
1862 * If the marker is not found, there is no error message. Could a missing | |
1863 * close-marker. | |
1864 */ | |
1865 static void | |
1866 foldDelMarker(lnum, marker, markerlen) | |
1867 linenr_T lnum; | |
1868 char_u *marker; | |
1869 int markerlen; | |
1870 { | |
1871 char_u *line; | |
1872 char_u *newline; | |
1873 char_u *p; | |
1874 int len; | |
1875 char_u *cms = curbuf->b_p_cms; | |
1876 char_u *cms2; | |
1877 | |
1878 line = ml_get(lnum); | |
1879 for (p = line; *p != NUL; ++p) | |
1880 if (STRNCMP(p, marker, markerlen) == 0) | |
1881 { | |
1882 /* Found the marker, include a digit if it's there. */ | |
1883 len = markerlen; | |
1884 if (VIM_ISDIGIT(p[len])) | |
1885 ++len; | |
1886 if (*cms != NUL) | |
1887 { | |
1888 /* Also delete 'commentstring' if it matches. */ | |
1889 cms2 = (char_u *)strstr((char *)cms, "%s"); | |
1890 if (p - line >= cms2 - cms | |
1891 && STRNCMP(p - (cms2 - cms), cms, cms2 - cms) == 0 | |
1892 && STRNCMP(p + len, cms2 + 2, STRLEN(cms2 + 2)) == 0) | |
1893 { | |
1894 p -= cms2 - cms; | |
1895 len += (int)STRLEN(cms) - 2; | |
1896 } | |
1897 } | |
1898 if (u_save(lnum - 1, lnum + 1) == OK) | |
1899 { | |
1900 /* Make new line: text-before-marker + text-after-marker */ | |
1901 newline = alloc((unsigned)(STRLEN(line) - len + 1)); | |
1902 if (newline != NULL) | |
1903 { | |
1904 STRNCPY(newline, line, p - line); | |
1905 STRCPY(newline + (p - line), p + len); | |
1906 ml_replace(lnum, newline, FALSE); | |
1907 } | |
1908 } | |
1909 break; | |
1910 } | |
1911 } | |
1912 | |
29 | 1913 /* get_foldtext() {{{2 */ |
1914 /* | |
1915 * Return the text for a closed fold at line "lnum", with last line "lnume". | |
1916 * When 'foldtext' isn't set puts the result in "buf[51]". Otherwise the | |
1917 * result is in allocated memory. | |
1918 */ | |
1919 char_u * | |
1920 get_foldtext(wp, lnum, lnume, foldinfo, buf) | |
1921 win_T *wp; | |
1922 linenr_T lnum, lnume; | |
1923 foldinfo_T *foldinfo; | |
1924 char_u *buf; | |
1925 { | |
1926 char_u *text = NULL; | |
4907
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1927 #ifdef FEAT_EVAL |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1928 /* an error occurred when evaluating 'fdt' setting */ |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1929 static int got_fdt_error = FALSE; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1930 int save_did_emsg = did_emsg; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1931 static win_T *last_wp = NULL; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1932 static linenr_T last_lnum = 0; |
29 | 1933 |
4907
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1934 if (last_wp != wp || last_wp == NULL |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1935 || last_lnum > lnum || last_lnum == 0) |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1936 /* window changed, try evaluating foldtext setting once again */ |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1937 got_fdt_error = FALSE; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1938 |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1939 if (!got_fdt_error) |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1940 /* a previous error should not abort evaluating 'foldexpr' */ |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1941 did_emsg = FALSE; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1942 |
29 | 1943 if (*wp->w_p_fdt != NUL) |
1944 { | |
1981 | 1945 char_u dashes[MAX_LEVEL + 2]; |
29 | 1946 win_T *save_curwin; |
1947 int level; | |
1948 char_u *p; | |
1949 | |
1950 /* Set "v:foldstart" and "v:foldend". */ | |
1951 set_vim_var_nr(VV_FOLDSTART, lnum); | |
1952 set_vim_var_nr(VV_FOLDEND, lnume); | |
1953 | |
1954 /* Set "v:folddashes" to a string of "level" dashes. */ | |
1955 /* Set "v:foldlevel" to "level". */ | |
1956 level = foldinfo->fi_level; | |
1981 | 1957 if (level > (int)sizeof(dashes) - 1) |
1958 level = (int)sizeof(dashes) - 1; | |
29 | 1959 vim_memset(dashes, '-', (size_t)level); |
1960 dashes[level] = NUL; | |
1961 set_vim_var_string(VV_FOLDDASHES, dashes, -1); | |
1962 set_vim_var_nr(VV_FOLDLEVEL, (long)level); | |
4907
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1963 |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1964 /* skip evaluating foldtext on errors */ |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1965 if (!got_fdt_error) |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1966 { |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1967 save_curwin = curwin; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1968 curwin = wp; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1969 curbuf = wp->w_buffer; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1970 |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1971 ++emsg_silent; /* handle exceptions, but don't display errors */ |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1972 text = eval_to_string_safe(wp->w_p_fdt, NULL, |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1973 was_set_insecurely((char_u *)"foldtext", OPT_LOCAL)); |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1974 --emsg_silent; |
29 | 1975 |
4907
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1976 if (text == NULL || did_emsg) |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1977 got_fdt_error = TRUE; |
29 | 1978 |
4907
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1979 curwin = save_curwin; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1980 curbuf = curwin->w_buffer; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1981 } |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1982 last_lnum = lnum; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1983 last_wp = wp; |
29 | 1984 set_vim_var_string(VV_FOLDDASHES, NULL, -1); |
1985 | |
4907
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1986 if (!did_emsg && save_did_emsg) |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1987 did_emsg = save_did_emsg; |
be2973afe770
updated for version 7.3.1199
Bram Moolenaar <bram@vim.org>
parents:
3766
diff
changeset
|
1988 |
29 | 1989 if (text != NULL) |
1990 { | |
1991 /* Replace unprintable characters, if there are any. But | |
1992 * replace a TAB with a space. */ | |
1993 for (p = text; *p != NUL; ++p) | |
1994 { | |
1995 # ifdef FEAT_MBYTE | |
33 | 1996 int len; |
1997 | |
474 | 1998 if (has_mbyte && (len = (*mb_ptr2len)(p)) > 1) |
29 | 1999 { |
2000 if (!vim_isprintc((*mb_ptr2char)(p))) | |
2001 break; | |
2002 p += len - 1; | |
2003 } | |
2004 else | |
2005 # endif | |
2006 if (*p == TAB) | |
2007 *p = ' '; | |
2008 else if (ptr2cells(p) > 1) | |
2009 break; | |
2010 } | |
2011 if (*p != NUL) | |
2012 { | |
2013 p = transstr(text); | |
2014 vim_free(text); | |
2015 text = p; | |
2016 } | |
2017 } | |
2018 } | |
2019 if (text == NULL) | |
2020 #endif | |
2021 { | |
2022 sprintf((char *)buf, _("+--%3ld lines folded "), | |
2023 (long)(lnume - lnum + 1)); | |
2024 text = buf; | |
2025 } | |
2026 return text; | |
2027 } | |
2028 | |
7 | 2029 /* foldtext_cleanup() {{{2 */ |
2030 /* | |
2031 * Remove 'foldmarker' and 'commentstring' from "str" (in-place). | |
2032 */ | |
2033 void | |
2034 foldtext_cleanup(str) | |
2035 char_u *str; | |
2036 { | |
2037 char_u *cms_start; /* first part or the whole comment */ | |
2038 int cms_slen = 0; /* length of cms_start */ | |
2039 char_u *cms_end; /* last part of the comment or NULL */ | |
2040 int cms_elen = 0; /* length of cms_end */ | |
2041 char_u *s; | |
45 | 2042 char_u *p; |
7 | 2043 int len; |
2044 int did1 = FALSE; | |
2045 int did2 = FALSE; | |
2046 | |
2047 /* Ignore leading and trailing white space in 'commentstring'. */ | |
2048 cms_start = skipwhite(curbuf->b_p_cms); | |
835 | 2049 cms_slen = (int)STRLEN(cms_start); |
7 | 2050 while (cms_slen > 0 && vim_iswhite(cms_start[cms_slen - 1])) |
2051 --cms_slen; | |
2052 | |
2053 /* locate "%s" in 'commentstring', use the part before and after it. */ | |
2054 cms_end = (char_u *)strstr((char *)cms_start, "%s"); | |
2055 if (cms_end != NULL) | |
2056 { | |
835 | 2057 cms_elen = cms_slen - (int)(cms_end - cms_start); |
2058 cms_slen = (int)(cms_end - cms_start); | |
7 | 2059 |
2060 /* exclude white space before "%s" */ | |
2061 while (cms_slen > 0 && vim_iswhite(cms_start[cms_slen - 1])) | |
2062 --cms_slen; | |
2063 | |
2064 /* skip "%s" and white space after it */ | |
2065 s = skipwhite(cms_end + 2); | |
835 | 2066 cms_elen -= (int)(s - cms_end); |
7 | 2067 cms_end = s; |
2068 } | |
2069 parseMarker(curwin); | |
2070 | |
2071 for (s = str; *s != NUL; ) | |
2072 { | |
2073 len = 0; | |
2074 if (STRNCMP(s, curwin->w_p_fmr, foldstartmarkerlen) == 0) | |
45 | 2075 len = foldstartmarkerlen; |
2076 else if (STRNCMP(s, foldendmarker, foldendmarkerlen) == 0) | |
2077 len = foldendmarkerlen; | |
2078 if (len > 0) | |
7 | 2079 { |
2080 if (VIM_ISDIGIT(s[len])) | |
2081 ++len; | |
45 | 2082 |
2083 /* May remove 'commentstring' start. Useful when it's a double | |
2084 * quote and we already removed a double quote. */ | |
2085 for (p = s; p > str && vim_iswhite(p[-1]); --p) | |
2086 ; | |
2087 if (p >= str + cms_slen | |
2088 && STRNCMP(p - cms_slen, cms_start, cms_slen) == 0) | |
2089 { | |
835 | 2090 len += (int)(s - p) + cms_slen; |
45 | 2091 s = p - cms_slen; |
2092 } | |
7 | 2093 } |
2094 else if (cms_end != NULL) | |
2095 { | |
45 | 2096 if (!did1 && cms_slen > 0 && STRNCMP(s, cms_start, cms_slen) == 0) |
7 | 2097 { |
2098 len = cms_slen; | |
2099 did1 = TRUE; | |
2100 } | |
45 | 2101 else if (!did2 && cms_elen > 0 |
2102 && STRNCMP(s, cms_end, cms_elen) == 0) | |
7 | 2103 { |
2104 len = cms_elen; | |
2105 did2 = TRUE; | |
2106 } | |
2107 } | |
2108 if (len != 0) | |
2109 { | |
2110 while (vim_iswhite(s[len])) | |
2111 ++len; | |
1624 | 2112 STRMOVE(s, s + len); |
7 | 2113 } |
2114 else | |
2115 { | |
39 | 2116 mb_ptr_adv(s); |
7 | 2117 } |
2118 } | |
2119 } | |
2120 | |
2121 /* Folding by indent, expr, marker and syntax. {{{1 */ | |
2122 /* Define "fline_T", passed to get fold level for a line. {{{2 */ | |
2123 typedef struct | |
2124 { | |
2125 win_T *wp; /* window */ | |
2126 linenr_T lnum; /* current line number */ | |
2127 linenr_T off; /* offset between lnum and real line number */ | |
2128 linenr_T lnum_save; /* line nr used by foldUpdateIEMSRecurse() */ | |
2129 int lvl; /* current level (-1 for undefined) */ | |
2130 int lvl_next; /* level used for next line */ | |
2131 int start; /* number of folds that are forced to start at | |
2132 this line. */ | |
2133 int end; /* level of fold that is forced to end below | |
2134 this line */ | |
2135 int had_end; /* level of fold that is forced to end above | |
2136 this line (copy of "end" of prev. line) */ | |
2137 } fline_T; | |
2138 | |
2139 /* Flag is set when redrawing is needed. */ | |
2140 static int fold_changed; | |
2141 | |
2142 /* Function declarations. {{{2 */ | |
2143 static linenr_T foldUpdateIEMSRecurse __ARGS((garray_T *gap, int level, linenr_T startlnum, fline_T *flp, void (*getlevel)__ARGS((fline_T *)), linenr_T bot, int topflags)); | |
2144 static int foldInsert __ARGS((garray_T *gap, int i)); | |
2145 static void foldSplit __ARGS((garray_T *gap, int i, linenr_T top, linenr_T bot)); | |
2146 static void foldRemove __ARGS((garray_T *gap, linenr_T top, linenr_T bot)); | |
2147 static void foldMerge __ARGS((fold_T *fp1, garray_T *gap, fold_T *fp2)); | |
2148 static void foldlevelIndent __ARGS((fline_T *flp)); | |
2149 #ifdef FEAT_DIFF | |
2150 static void foldlevelDiff __ARGS((fline_T *flp)); | |
2151 #endif | |
2152 static void foldlevelExpr __ARGS((fline_T *flp)); | |
2153 static void foldlevelMarker __ARGS((fline_T *flp)); | |
2154 static void foldlevelSyntax __ARGS((fline_T *flp)); | |
2155 | |
2156 /* foldUpdateIEMS() {{{2 */ | |
2157 /* | |
2158 * Update the folding for window "wp", at least from lines "top" to "bot". | |
2159 * Return TRUE if any folds did change. | |
2160 */ | |
2161 static void | |
2162 foldUpdateIEMS(wp, top, bot) | |
2163 win_T *wp; | |
2164 linenr_T top; | |
2165 linenr_T bot; | |
2166 { | |
2167 linenr_T start; | |
2168 linenr_T end; | |
2169 fline_T fline; | |
2170 void (*getlevel)__ARGS((fline_T *)); | |
2171 int level; | |
2172 fold_T *fp; | |
2173 | |
2174 /* Avoid problems when being called recursively. */ | |
2175 if (invalid_top != (linenr_T)0) | |
2176 return; | |
2177 | |
2178 if (wp->w_foldinvalid) | |
2179 { | |
2180 /* Need to update all folds. */ | |
2181 top = 1; | |
2182 bot = wp->w_buffer->b_ml.ml_line_count; | |
2183 wp->w_foldinvalid = FALSE; | |
2184 | |
2185 /* Mark all folds a maybe-small. */ | |
2186 setSmallMaybe(&wp->w_folds); | |
2187 } | |
2188 | |
2189 #ifdef FEAT_DIFF | |
2190 /* add the context for "diff" folding */ | |
2191 if (foldmethodIsDiff(wp)) | |
2192 { | |
2193 if (top > diff_context) | |
2194 top -= diff_context; | |
2195 else | |
2196 top = 1; | |
2197 bot += diff_context; | |
2198 } | |
2199 #endif | |
2200 | |
2201 /* When deleting lines at the end of the buffer "top" can be past the end | |
2202 * of the buffer. */ | |
2203 if (top > wp->w_buffer->b_ml.ml_line_count) | |
2204 top = wp->w_buffer->b_ml.ml_line_count; | |
2205 | |
2206 fold_changed = FALSE; | |
2207 fline.wp = wp; | |
2208 fline.off = 0; | |
2209 fline.lvl = 0; | |
2210 fline.lvl_next = -1; | |
2211 fline.start = 0; | |
2212 fline.end = MAX_LEVEL + 1; | |
2213 fline.had_end = MAX_LEVEL + 1; | |
2214 | |
2215 invalid_top = top; | |
2216 invalid_bot = bot; | |
2217 | |
2218 if (foldmethodIsMarker(wp)) | |
2219 { | |
2220 getlevel = foldlevelMarker; | |
2221 | |
2222 /* Init marker variables to speed up foldlevelMarker(). */ | |
2223 parseMarker(wp); | |
2224 | |
2225 /* Need to get the level of the line above top, it is used if there is | |
2226 * no marker at the top. */ | |
2227 if (top > 1) | |
2228 { | |
2229 /* Get the fold level at top - 1. */ | |
2230 level = foldLevelWin(wp, top - 1); | |
2231 | |
2232 /* The fold may end just above the top, check for that. */ | |
2233 fline.lnum = top - 1; | |
2234 fline.lvl = level; | |
2235 getlevel(&fline); | |
2236 | |
2237 /* If a fold started here, we already had the level, if it stops | |
2238 * here, we need to use lvl_next. Could also start and end a fold | |
2239 * in the same line. */ | |
2240 if (fline.lvl > level) | |
2241 fline.lvl = level - (fline.lvl - fline.lvl_next); | |
2242 else | |
2243 fline.lvl = fline.lvl_next; | |
2244 } | |
2245 fline.lnum = top; | |
2246 getlevel(&fline); | |
2247 } | |
2248 else | |
2249 { | |
2250 fline.lnum = top; | |
2251 if (foldmethodIsExpr(wp)) | |
2252 { | |
2253 getlevel = foldlevelExpr; | |
2254 /* start one line back, because a "<1" may indicate the end of a | |
2255 * fold in the topline */ | |
2256 if (top > 1) | |
2257 --fline.lnum; | |
2258 } | |
2259 else if (foldmethodIsSyntax(wp)) | |
2260 getlevel = foldlevelSyntax; | |
2261 #ifdef FEAT_DIFF | |
2262 else if (foldmethodIsDiff(wp)) | |
2263 getlevel = foldlevelDiff; | |
2264 #endif | |
2265 else | |
2266 getlevel = foldlevelIndent; | |
2267 | |
2268 /* Backup to a line for which the fold level is defined. Since it's | |
2269 * always defined for line one, we will stop there. */ | |
2270 fline.lvl = -1; | |
2271 for ( ; !got_int; --fline.lnum) | |
2272 { | |
2273 /* Reset lvl_next each time, because it will be set to a value for | |
2274 * the next line, but we search backwards here. */ | |
2275 fline.lvl_next = -1; | |
2276 getlevel(&fline); | |
2277 if (fline.lvl >= 0) | |
2278 break; | |
2279 } | |
2280 } | |
2281 | |
1977 | 2282 /* |
2283 * If folding is defined by the syntax, it is possible that a change in | |
2284 * one line will cause all sub-folds of the current fold to change (e.g., | |
2285 * closing a C-style comment can cause folds in the subsequent lines to | |
2286 * appear). To take that into account we should adjust the value of "bot" | |
2287 * to point to the end of the current fold: | |
2288 */ | |
2289 if (foldlevelSyntax == getlevel) | |
2290 { | |
2291 garray_T *gap = &wp->w_folds; | |
2271
2b33a7678e7b
Fix compiler warnings for shadowed variables. Make 'conceal' a long instead
Bram Moolenaar <bram@vim.org>
parents:
2114
diff
changeset
|
2292 fold_T *fpn = NULL; |
1977 | 2293 int current_fdl = 0; |
2294 linenr_T fold_start_lnum = 0; | |
2295 linenr_T lnum_rel = fline.lnum; | |
2296 | |
2297 while (current_fdl < fline.lvl) | |
2298 { | |
2271
2b33a7678e7b
Fix compiler warnings for shadowed variables. Make 'conceal' a long instead
Bram Moolenaar <bram@vim.org>
parents:
2114
diff
changeset
|
2299 if (!foldFind(gap, lnum_rel, &fpn)) |
1977 | 2300 break; |
2301 ++current_fdl; | |
2302 | |
2271
2b33a7678e7b
Fix compiler warnings for shadowed variables. Make 'conceal' a long instead
Bram Moolenaar <bram@vim.org>
parents:
2114
diff
changeset
|
2303 fold_start_lnum += fpn->fd_top; |
2b33a7678e7b
Fix compiler warnings for shadowed variables. Make 'conceal' a long instead
Bram Moolenaar <bram@vim.org>
parents:
2114
diff
changeset
|
2304 gap = &fpn->fd_nested; |
2b33a7678e7b
Fix compiler warnings for shadowed variables. Make 'conceal' a long instead
Bram Moolenaar <bram@vim.org>
parents:
2114
diff
changeset
|
2305 lnum_rel -= fpn->fd_top; |
1977 | 2306 } |
2271
2b33a7678e7b
Fix compiler warnings for shadowed variables. Make 'conceal' a long instead
Bram Moolenaar <bram@vim.org>
parents:
2114
diff
changeset
|
2307 if (fpn != NULL && current_fdl == fline.lvl) |
1977 | 2308 { |
2271
2b33a7678e7b
Fix compiler warnings for shadowed variables. Make 'conceal' a long instead
Bram Moolenaar <bram@vim.org>
parents:
2114
diff
changeset
|
2309 linenr_T fold_end_lnum = fold_start_lnum + fpn->fd_len; |
1977 | 2310 |
2311 if (fold_end_lnum > bot) | |
2312 bot = fold_end_lnum; | |
2313 } | |
2314 } | |
2315 | |
7 | 2316 start = fline.lnum; |
2317 end = bot; | |
2318 /* Do at least one line. */ | |
2319 if (start > end && end < wp->w_buffer->b_ml.ml_line_count) | |
2320 end = start; | |
2321 while (!got_int) | |
2322 { | |
2323 /* Always stop at the end of the file ("end" can be past the end of | |
2324 * the file). */ | |
2325 if (fline.lnum > wp->w_buffer->b_ml.ml_line_count) | |
2326 break; | |
2327 if (fline.lnum > end) | |
2328 { | |
2329 /* For "marker", "expr" and "syntax" methods: If a change caused | |
2330 * a fold to be removed, we need to continue at least until where | |
2331 * it ended. */ | |
2332 if (getlevel != foldlevelMarker | |
2333 && getlevel != foldlevelSyntax | |
2334 && getlevel != foldlevelExpr) | |
2335 break; | |
2336 if ((start <= end | |
2337 && foldFind(&wp->w_folds, end, &fp) | |
2338 && fp->fd_top + fp->fd_len - 1 > end) | |
2339 || (fline.lvl == 0 | |
2340 && foldFind(&wp->w_folds, fline.lnum, &fp) | |
2341 && fp->fd_top < fline.lnum)) | |
2342 end = fp->fd_top + fp->fd_len - 1; | |
2343 else if (getlevel == foldlevelSyntax | |
2344 && foldLevelWin(wp, fline.lnum) != fline.lvl) | |
2345 /* For "syntax" method: Compare the foldlevel that the syntax | |
2346 * tells us to the foldlevel from the existing folds. If they | |
2347 * don't match continue updating folds. */ | |
2348 end = fline.lnum; | |
2349 else | |
2350 break; | |
2351 } | |
2352 | |
2353 /* A level 1 fold starts at a line with foldlevel > 0. */ | |
2354 if (fline.lvl > 0) | |
2355 { | |
2356 invalid_top = fline.lnum; | |
2357 invalid_bot = end; | |
2358 end = foldUpdateIEMSRecurse(&wp->w_folds, | |
2359 1, start, &fline, getlevel, end, FD_LEVEL); | |
2360 start = fline.lnum; | |
2361 } | |
2362 else | |
2363 { | |
2364 if (fline.lnum == wp->w_buffer->b_ml.ml_line_count) | |
2365 break; | |
2366 ++fline.lnum; | |
2367 fline.lvl = fline.lvl_next; | |
2368 getlevel(&fline); | |
2369 } | |
2370 } | |
2371 | |
2372 /* There can't be any folds from start until end now. */ | |
2373 foldRemove(&wp->w_folds, start, end); | |
2374 | |
2375 /* If some fold changed, need to redraw and position cursor. */ | |
2376 if (fold_changed && wp->w_p_fen) | |
1554 | 2377 changed_window_setting_win(wp); |
7 | 2378 |
2379 /* If we updated folds past "bot", need to redraw more lines. Don't do | |
2380 * this in other situations, the changed lines will be redrawn anyway and | |
2381 * this method can cause the whole window to be updated. */ | |
2382 if (end != bot) | |
2383 { | |
2384 if (wp->w_redraw_top == 0 || wp->w_redraw_top > top) | |
2385 wp->w_redraw_top = top; | |
2386 if (wp->w_redraw_bot < end) | |
2387 wp->w_redraw_bot = end; | |
2388 } | |
2389 | |
2390 invalid_top = (linenr_T)0; | |
2391 } | |
2392 | |
2393 /* foldUpdateIEMSRecurse() {{{2 */ | |
2394 /* | |
2395 * Update a fold that starts at "flp->lnum". At this line there is always a | |
2396 * valid foldlevel, and its level >= "level". | |
2397 * "flp" is valid for "flp->lnum" when called and it's valid when returning. | |
2398 * "flp->lnum" is set to the lnum just below the fold, if it ends before | |
2399 * "bot", it's "bot" plus one if the fold continues and it's bigger when using | |
2400 * the marker method and a text change made following folds to change. | |
2401 * When returning, "flp->lnum_save" is the line number that was used to get | |
2402 * the level when the level at "flp->lnum" is invalid. | |
2403 * Remove any folds from "startlnum" up to here at this level. | |
2404 * Recursively update nested folds. | |
2405 * Below line "bot" there are no changes in the text. | |
2406 * "flp->lnum", "flp->lnum_save" and "bot" are relative to the start of the | |
2407 * outer fold. | |
2408 * "flp->off" is the offset to the real line number in the buffer. | |
2409 * | |
2410 * All this would be a lot simpler if all folds in the range would be deleted | |
1698 | 2411 * and then created again. But we would lose all information about the |
7 | 2412 * folds, even when making changes that don't affect the folding (e.g. "vj~"). |
2413 * | |
2414 * Returns bot, which may have been increased for lines that also need to be | |
2415 * updated as a result of a detected change in the fold. | |
2416 */ | |
2417 static linenr_T | |
2418 foldUpdateIEMSRecurse(gap, level, startlnum, flp, getlevel, bot, topflags) | |
2419 garray_T *gap; | |
2420 int level; | |
2421 linenr_T startlnum; | |
2422 fline_T *flp; | |
2423 void (*getlevel)__ARGS((fline_T *)); | |
2424 linenr_T bot; | |
2425 int topflags; /* flags used by containing fold */ | |
2426 { | |
2427 linenr_T ll; | |
2428 fold_T *fp = NULL; | |
2429 fold_T *fp2; | |
2430 int lvl = level; | |
2431 linenr_T startlnum2 = startlnum; | |
2432 linenr_T firstlnum = flp->lnum; /* first lnum we got */ | |
2433 int i; | |
2434 int finish = FALSE; | |
2435 linenr_T linecount = flp->wp->w_buffer->b_ml.ml_line_count - flp->off; | |
2436 int concat; | |
2437 | |
2438 /* | |
2439 * If using the marker method, the start line is not the start of a fold | |
2440 * at the level we're dealing with and the level is non-zero, we must use | |
2441 * the previous fold. But ignore a fold that starts at or below | |
2442 * startlnum, it must be deleted. | |
2443 */ | |
2444 if (getlevel == foldlevelMarker && flp->start <= flp->lvl - level | |
2445 && flp->lvl > 0) | |
2446 { | |
2447 foldFind(gap, startlnum - 1, &fp); | |
2448 if (fp >= ((fold_T *)gap->ga_data) + gap->ga_len | |
2449 || fp->fd_top >= startlnum) | |
2450 fp = NULL; | |
2451 } | |
2452 | |
2453 /* | |
2454 * Loop over all lines in this fold, or until "bot" is hit. | |
2455 * Handle nested folds inside of this fold. | |
2456 * "flp->lnum" is the current line. When finding the end of the fold, it | |
2457 * is just below the end of the fold. | |
2458 * "*flp" contains the level of the line "flp->lnum" or a following one if | |
2459 * there are lines with an invalid fold level. "flp->lnum_save" is the | |
2460 * line number that was used to get the fold level (below "flp->lnum" when | |
2461 * it has an invalid fold level). When called the fold level is always | |
2462 * valid, thus "flp->lnum_save" is equal to "flp->lnum". | |
2463 */ | |
2464 flp->lnum_save = flp->lnum; | |
2465 while (!got_int) | |
2466 { | |
2467 /* Updating folds can be slow, check for CTRL-C. */ | |
2468 line_breakcheck(); | |
2469 | |
2470 /* Set "lvl" to the level of line "flp->lnum". When flp->start is set | |
2471 * and after the first line of the fold, set the level to zero to | |
2472 * force the fold to end. Do the same when had_end is set: Previous | |
2473 * line was marked as end of a fold. */ | |
2474 lvl = flp->lvl; | |
2475 if (lvl > MAX_LEVEL) | |
2476 lvl = MAX_LEVEL; | |
2477 if (flp->lnum > firstlnum | |
2478 && (level > lvl - flp->start || level >= flp->had_end)) | |
2479 lvl = 0; | |
2480 | |
2481 if (flp->lnum > bot && !finish && fp != NULL) | |
2482 { | |
2483 /* For "marker" and "syntax" methods: | |
2484 * - If a change caused a nested fold to be removed, we need to | |
2485 * delete it and continue at least until where it ended. | |
2486 * - If a change caused a nested fold to be created, or this fold | |
2487 * to continue below its original end, need to finish this fold. | |
2488 */ | |
2489 if (getlevel != foldlevelMarker | |
2490 && getlevel != foldlevelExpr | |
2491 && getlevel != foldlevelSyntax) | |
2492 break; | |
2493 i = 0; | |
2494 fp2 = fp; | |
2495 if (lvl >= level) | |
2496 { | |
2497 /* Compute how deep the folds currently are, if it's deeper | |
2498 * than "lvl" then some must be deleted, need to update | |
2499 * at least one nested fold. */ | |
2500 ll = flp->lnum - fp->fd_top; | |
2501 while (foldFind(&fp2->fd_nested, ll, &fp2)) | |
2502 { | |
2503 ++i; | |
2504 ll -= fp2->fd_top; | |
2505 } | |
2506 } | |
2507 if (lvl < level + i) | |
2508 { | |
2509 foldFind(&fp->fd_nested, flp->lnum - fp->fd_top, &fp2); | |
2510 if (fp2 != NULL) | |
2511 bot = fp2->fd_top + fp2->fd_len - 1 + fp->fd_top; | |
2512 } | |
2513 else if (fp->fd_top + fp->fd_len <= flp->lnum && lvl >= level) | |
2514 finish = TRUE; | |
2515 else | |
2516 break; | |
2517 } | |
2518 | |
2519 /* At the start of the first nested fold and at the end of the current | |
2520 * fold: check if existing folds at this level, before the current | |
2521 * one, need to be deleted or truncated. */ | |
2522 if (fp == NULL | |
2523 && (lvl != level | |
2524 || flp->lnum_save >= bot | |
2525 || flp->start != 0 | |
2526 || flp->had_end <= MAX_LEVEL | |
2527 || flp->lnum == linecount)) | |
2528 { | |
2529 /* | |
2530 * Remove or update folds that have lines between startlnum and | |
2531 * firstlnum. | |
2532 */ | |
2533 while (!got_int) | |
2534 { | |
2535 /* set concat to 1 if it's allowed to concatenated this fold | |
2536 * with a previous one that touches it. */ | |
2537 if (flp->start != 0 || flp->had_end <= MAX_LEVEL) | |
2538 concat = 0; | |
2539 else | |
2540 concat = 1; | |
2541 | |
2542 /* Find an existing fold to re-use. Preferably one that | |
2543 * includes startlnum, otherwise one that ends just before | |
2544 * startlnum or starts after it. */ | |
2545 if (foldFind(gap, startlnum, &fp) | |
2546 || (fp < ((fold_T *)gap->ga_data) + gap->ga_len | |
2547 && fp->fd_top <= firstlnum) | |
2548 || foldFind(gap, firstlnum - concat, &fp) | |
2549 || (fp < ((fold_T *)gap->ga_data) + gap->ga_len | |
2550 && ((lvl < level && fp->fd_top < flp->lnum) | |
2551 || (lvl >= level | |
2552 && fp->fd_top <= flp->lnum_save)))) | |
2553 { | |
2554 if (fp->fd_top + fp->fd_len + concat > firstlnum) | |
2555 { | |
2556 /* Use existing fold for the new fold. If it starts | |
2557 * before where we started looking, extend it. If it | |
2558 * starts at another line, update nested folds to keep | |
2559 * their position, compensating for the new fd_top. */ | |
2560 if (fp->fd_top >= startlnum && fp->fd_top != firstlnum) | |
2561 { | |
2562 if (fp->fd_top > firstlnum) | |
2563 /* like lines are inserted */ | |
2564 foldMarkAdjustRecurse(&fp->fd_nested, | |
2565 (linenr_T)0, (linenr_T)MAXLNUM, | |
2566 (long)(fp->fd_top - firstlnum), 0L); | |
2567 else | |
2568 /* like lines are deleted */ | |
2569 foldMarkAdjustRecurse(&fp->fd_nested, | |
2570 (linenr_T)0, | |
2571 (long)(firstlnum - fp->fd_top - 1), | |
2572 (linenr_T)MAXLNUM, | |
2573 (long)(fp->fd_top - firstlnum)); | |
2574 fp->fd_len += fp->fd_top - firstlnum; | |
2575 fp->fd_top = firstlnum; | |
2576 fold_changed = TRUE; | |
2577 } | |
2578 else if (flp->start != 0 && lvl == level | |
2579 && fp->fd_top != firstlnum) | |
2580 { | |
2581 /* Existing fold that includes startlnum must stop | |
2582 * if we find the start of a new fold at the same | |
2583 * level. Split it. Delete contained folds at | |
2584 * this point to split them too. */ | |
2585 foldRemove(&fp->fd_nested, flp->lnum - fp->fd_top, | |
2586 flp->lnum - fp->fd_top); | |
2587 i = (int)(fp - (fold_T *)gap->ga_data); | |
2588 foldSplit(gap, i, flp->lnum, flp->lnum - 1); | |
2589 fp = (fold_T *)gap->ga_data + i + 1; | |
2590 /* If using the "marker" or "syntax" method, we | |
2591 * need to continue until the end of the fold is | |
2592 * found. */ | |
2593 if (getlevel == foldlevelMarker | |
2594 || getlevel == foldlevelExpr | |
2595 || getlevel == foldlevelSyntax) | |
2596 finish = TRUE; | |
2597 } | |
2598 break; | |
2599 } | |
2600 if (fp->fd_top >= startlnum) | |
2601 { | |
2602 /* A fold that starts at or after startlnum and stops | |
2603 * before the new fold must be deleted. Continue | |
2604 * looking for the next one. */ | |
2605 deleteFoldEntry(gap, | |
2606 (int)(fp - (fold_T *)gap->ga_data), TRUE); | |
2607 } | |
2608 else | |
2609 { | |
2610 /* A fold has some lines above startlnum, truncate it | |
2611 * to stop just above startlnum. */ | |
2612 fp->fd_len = startlnum - fp->fd_top; | |
2613 foldMarkAdjustRecurse(&fp->fd_nested, | |
2614 (linenr_T)fp->fd_len, (linenr_T)MAXLNUM, | |
2615 (linenr_T)MAXLNUM, 0L); | |
2616 fold_changed = TRUE; | |
2617 } | |
2618 } | |
2619 else | |
2620 { | |
2621 /* Insert new fold. Careful: ga_data may be NULL and it | |
2622 * may change! */ | |
2623 i = (int)(fp - (fold_T *)gap->ga_data); | |
2624 if (foldInsert(gap, i) != OK) | |
2625 return bot; | |
2626 fp = (fold_T *)gap->ga_data + i; | |
2627 /* The new fold continues until bot, unless we find the | |
2628 * end earlier. */ | |
2629 fp->fd_top = firstlnum; | |
2630 fp->fd_len = bot - firstlnum + 1; | |
2631 /* When the containing fold is open, the new fold is open. | |
2632 * The new fold is closed if the fold above it is closed. | |
2633 * The first fold depends on the containing fold. */ | |
2634 if (topflags == FD_OPEN) | |
2635 { | |
2636 flp->wp->w_fold_manual = TRUE; | |
2637 fp->fd_flags = FD_OPEN; | |
2638 } | |
2639 else if (i <= 0) | |
2640 { | |
2641 fp->fd_flags = topflags; | |
2642 if (topflags != FD_LEVEL) | |
2643 flp->wp->w_fold_manual = TRUE; | |
2644 } | |
2645 else | |
2646 fp->fd_flags = (fp - 1)->fd_flags; | |
2647 fp->fd_small = MAYBE; | |
2648 /* If using the "marker", "expr" or "syntax" method, we | |
2649 * need to continue until the end of the fold is found. */ | |
2650 if (getlevel == foldlevelMarker | |
2651 || getlevel == foldlevelExpr | |
2652 || getlevel == foldlevelSyntax) | |
2653 finish = TRUE; | |
2654 fold_changed = TRUE; | |
2655 break; | |
2656 } | |
2657 } | |
2658 } | |
2659 | |
2660 if (lvl < level || flp->lnum > linecount) | |
2661 { | |
2662 /* | |
2663 * Found a line with a lower foldlevel, this fold ends just above | |
2664 * "flp->lnum". | |
2665 */ | |
2666 break; | |
2667 } | |
2668 | |
2669 /* | |
2670 * The fold includes the line "flp->lnum" and "flp->lnum_save". | |
840 | 2671 * Check "fp" for safety. |
7 | 2672 */ |
840 | 2673 if (lvl > level && fp != NULL) |
7 | 2674 { |
2675 /* | |
2676 * There is a nested fold, handle it recursively. | |
2677 */ | |
2678 /* At least do one line (can happen when finish is TRUE). */ | |
2679 if (bot < flp->lnum) | |
2680 bot = flp->lnum; | |
2681 | |
2682 /* Line numbers in the nested fold are relative to the start of | |
2683 * this fold. */ | |
2684 flp->lnum = flp->lnum_save - fp->fd_top; | |
2685 flp->off += fp->fd_top; | |
2686 i = (int)(fp - (fold_T *)gap->ga_data); | |
2687 bot = foldUpdateIEMSRecurse(&fp->fd_nested, level + 1, | |
2688 startlnum2 - fp->fd_top, flp, getlevel, | |
2689 bot - fp->fd_top, fp->fd_flags); | |
2690 fp = (fold_T *)gap->ga_data + i; | |
2691 flp->lnum += fp->fd_top; | |
2692 flp->lnum_save += fp->fd_top; | |
2693 flp->off -= fp->fd_top; | |
2694 bot += fp->fd_top; | |
2695 startlnum2 = flp->lnum; | |
2696 | |
2697 /* This fold may end at the same line, don't incr. flp->lnum. */ | |
2698 } | |
2699 else | |
2700 { | |
2701 /* | |
2702 * Get the level of the next line, then continue the loop to check | |
2703 * if it ends there. | |
2704 * Skip over undefined lines, to find the foldlevel after it. | |
2705 * For the last line in the file the foldlevel is always valid. | |
2706 */ | |
2707 flp->lnum = flp->lnum_save; | |
2708 ll = flp->lnum + 1; | |
2709 while (!got_int) | |
2710 { | |
2711 /* Make the previous level available to foldlevel(). */ | |
2712 prev_lnum = flp->lnum; | |
2713 prev_lnum_lvl = flp->lvl; | |
2714 | |
2715 if (++flp->lnum > linecount) | |
2716 break; | |
2717 flp->lvl = flp->lvl_next; | |
2718 getlevel(flp); | |
2719 if (flp->lvl >= 0 || flp->had_end <= MAX_LEVEL) | |
2720 break; | |
2721 } | |
2722 prev_lnum = 0; | |
2723 if (flp->lnum > linecount) | |
2724 break; | |
2725 | |
2726 /* leave flp->lnum_save to lnum of the line that was used to get | |
2727 * the level, flp->lnum to the lnum of the next line. */ | |
2728 flp->lnum_save = flp->lnum; | |
2729 flp->lnum = ll; | |
2730 } | |
2731 } | |
2732 | |
2733 if (fp == NULL) /* only happens when got_int is set */ | |
2734 return bot; | |
2735 | |
2736 /* | |
2737 * Get here when: | |
2738 * lvl < level: the folds ends just above "flp->lnum" | |
2739 * lvl >= level: fold continues below "bot" | |
2740 */ | |
2741 | |
2742 /* Current fold at least extends until lnum. */ | |
2743 if (fp->fd_len < flp->lnum - fp->fd_top) | |
2744 { | |
2745 fp->fd_len = flp->lnum - fp->fd_top; | |
1513 | 2746 fp->fd_small = MAYBE; |
7 | 2747 fold_changed = TRUE; |
2748 } | |
2749 | |
2750 /* Delete contained folds from the end of the last one found until where | |
2751 * we stopped looking. */ | |
2752 foldRemove(&fp->fd_nested, startlnum2 - fp->fd_top, | |
2753 flp->lnum - 1 - fp->fd_top); | |
2754 | |
2755 if (lvl < level) | |
2756 { | |
2757 /* End of fold found, update the length when it got shorter. */ | |
2758 if (fp->fd_len != flp->lnum - fp->fd_top) | |
2759 { | |
2760 if (fp->fd_top + fp->fd_len > bot + 1) | |
2761 { | |
1224 | 2762 /* fold continued below bot */ |
7 | 2763 if (getlevel == foldlevelMarker |
2764 || getlevel == foldlevelExpr | |
2765 || getlevel == foldlevelSyntax) | |
2766 { | |
2767 /* marker method: truncate the fold and make sure the | |
2768 * previously included lines are processed again */ | |
2769 bot = fp->fd_top + fp->fd_len - 1; | |
2770 fp->fd_len = flp->lnum - fp->fd_top; | |
2771 } | |
2772 else | |
2773 { | |
2774 /* indent or expr method: split fold to create a new one | |
2775 * below bot */ | |
2776 i = (int)(fp - (fold_T *)gap->ga_data); | |
2777 foldSplit(gap, i, flp->lnum, bot); | |
2778 fp = (fold_T *)gap->ga_data + i; | |
2779 } | |
2780 } | |
2781 else | |
2782 fp->fd_len = flp->lnum - fp->fd_top; | |
2783 fold_changed = TRUE; | |
2784 } | |
2785 } | |
2786 | |
2787 /* delete following folds that end before the current line */ | |
2788 for (;;) | |
2789 { | |
2790 fp2 = fp + 1; | |
2791 if (fp2 >= (fold_T *)gap->ga_data + gap->ga_len | |
2792 || fp2->fd_top > flp->lnum) | |
2793 break; | |
2794 if (fp2->fd_top + fp2->fd_len > flp->lnum) | |
2795 { | |
2796 if (fp2->fd_top < flp->lnum) | |
2797 { | |
2798 /* Make fold that includes lnum start at lnum. */ | |
2799 foldMarkAdjustRecurse(&fp2->fd_nested, | |
2800 (linenr_T)0, (long)(flp->lnum - fp2->fd_top - 1), | |
2801 (linenr_T)MAXLNUM, (long)(fp2->fd_top - flp->lnum)); | |
2802 fp2->fd_len -= flp->lnum - fp2->fd_top; | |
2803 fp2->fd_top = flp->lnum; | |
2804 fold_changed = TRUE; | |
2805 } | |
2806 | |
2807 if (lvl >= level) | |
2808 { | |
2809 /* merge new fold with existing fold that follows */ | |
2810 foldMerge(fp, gap, fp2); | |
2811 } | |
2812 break; | |
2813 } | |
2814 fold_changed = TRUE; | |
2815 deleteFoldEntry(gap, (int)(fp2 - (fold_T *)gap->ga_data), TRUE); | |
2816 } | |
2817 | |
2818 /* Need to redraw the lines we inspected, which might be further down than | |
2819 * was asked for. */ | |
2820 if (bot < flp->lnum - 1) | |
2821 bot = flp->lnum - 1; | |
2822 | |
2823 return bot; | |
2824 } | |
2825 | |
2826 /* foldInsert() {{{2 */ | |
2827 /* | |
2828 * Insert a new fold in "gap" at position "i". | |
2829 * Returns OK for success, FAIL for failure. | |
2830 */ | |
2831 static int | |
2832 foldInsert(gap, i) | |
2833 garray_T *gap; | |
2834 int i; | |
2835 { | |
2836 fold_T *fp; | |
2837 | |
2838 if (ga_grow(gap, 1) != OK) | |
2839 return FAIL; | |
2840 fp = (fold_T *)gap->ga_data + i; | |
2841 if (i < gap->ga_len) | |
2842 mch_memmove(fp + 1, fp, sizeof(fold_T) * (gap->ga_len - i)); | |
2843 ++gap->ga_len; | |
2844 ga_init2(&fp->fd_nested, (int)sizeof(fold_T), 10); | |
2845 return OK; | |
2846 } | |
2847 | |
2848 /* foldSplit() {{{2 */ | |
2849 /* | |
2850 * Split the "i"th fold in "gap", which starts before "top" and ends below | |
2851 * "bot" in two pieces, one ending above "top" and the other starting below | |
2852 * "bot". | |
2853 * The caller must first have taken care of any nested folds from "top" to | |
2854 * "bot"! | |
2855 */ | |
2856 static void | |
2857 foldSplit(gap, i, top, bot) | |
2858 garray_T *gap; | |
2859 int i; | |
2860 linenr_T top; | |
2861 linenr_T bot; | |
2862 { | |
2863 fold_T *fp; | |
2864 fold_T *fp2; | |
2865 garray_T *gap1; | |
2866 garray_T *gap2; | |
2867 int idx; | |
2868 int len; | |
2869 | |
2870 /* The fold continues below bot, need to split it. */ | |
2871 if (foldInsert(gap, i + 1) == FAIL) | |
2872 return; | |
2873 fp = (fold_T *)gap->ga_data + i; | |
2874 fp[1].fd_top = bot + 1; | |
2875 fp[1].fd_len = fp->fd_len - (fp[1].fd_top - fp->fd_top); | |
2876 fp[1].fd_flags = fp->fd_flags; | |
1985 | 2877 fp[1].fd_small = MAYBE; |
2878 fp->fd_small = MAYBE; | |
7 | 2879 |
2880 /* Move nested folds below bot to new fold. There can't be | |
2881 * any between top and bot, they have been removed by the caller. */ | |
2882 gap1 = &fp->fd_nested; | |
2883 gap2 = &fp[1].fd_nested; | |
2884 (void)(foldFind(gap1, bot + 1 - fp->fd_top, &fp2)); | |
2885 len = (int)((fold_T *)gap1->ga_data + gap1->ga_len - fp2); | |
2886 if (len > 0 && ga_grow(gap2, len) == OK) | |
2887 { | |
2888 for (idx = 0; idx < len; ++idx) | |
2889 { | |
2890 ((fold_T *)gap2->ga_data)[idx] = fp2[idx]; | |
2891 ((fold_T *)gap2->ga_data)[idx].fd_top | |
2892 -= fp[1].fd_top - fp->fd_top; | |
2893 } | |
2894 gap2->ga_len = len; | |
2895 gap1->ga_len -= len; | |
2896 } | |
2897 fp->fd_len = top - fp->fd_top; | |
2898 fold_changed = TRUE; | |
2899 } | |
2900 | |
2901 /* foldRemove() {{{2 */ | |
2902 /* | |
2903 * Remove folds within the range "top" to and including "bot". | |
2904 * Check for these situations: | |
2905 * 1 2 3 | |
2906 * 1 2 3 | |
2907 * top 2 3 4 5 | |
2908 * 2 3 4 5 | |
2909 * bot 2 3 4 5 | |
2910 * 3 5 6 | |
2911 * 3 5 6 | |
2912 * | |
2913 * 1: not changed | |
1224 | 2914 * 2: truncate to stop above "top" |
7 | 2915 * 3: split in two parts, one stops above "top", other starts below "bot". |
2916 * 4: deleted | |
2917 * 5: made to start below "bot". | |
2918 * 6: not changed | |
2919 */ | |
2920 static void | |
2921 foldRemove(gap, top, bot) | |
2922 garray_T *gap; | |
2923 linenr_T top; | |
2924 linenr_T bot; | |
2925 { | |
2926 fold_T *fp = NULL; | |
2927 | |
2928 if (bot < top) | |
2929 return; /* nothing to do */ | |
2930 | |
2931 for (;;) | |
2932 { | |
2933 /* Find fold that includes top or a following one. */ | |
2934 if (foldFind(gap, top, &fp) && fp->fd_top < top) | |
2935 { | |
2936 /* 2: or 3: need to delete nested folds */ | |
2937 foldRemove(&fp->fd_nested, top - fp->fd_top, bot - fp->fd_top); | |
2938 if (fp->fd_top + fp->fd_len > bot + 1) | |
2939 { | |
2940 /* 3: need to split it. */ | |
2941 foldSplit(gap, (int)(fp - (fold_T *)gap->ga_data), top, bot); | |
2942 } | |
2943 else | |
2944 { | |
2945 /* 2: truncate fold at "top". */ | |
2946 fp->fd_len = top - fp->fd_top; | |
2947 } | |
2948 fold_changed = TRUE; | |
2949 continue; | |
2950 } | |
2951 if (fp >= (fold_T *)(gap->ga_data) + gap->ga_len | |
2952 || fp->fd_top > bot) | |
2953 { | |
2954 /* 6: Found a fold below bot, can stop looking. */ | |
2955 break; | |
2956 } | |
2957 if (fp->fd_top >= top) | |
2958 { | |
2959 /* Found an entry below top. */ | |
2960 fold_changed = TRUE; | |
36 | 2961 if (fp->fd_top + fp->fd_len - 1 > bot) |
7 | 2962 { |
2963 /* 5: Make fold that includes bot start below bot. */ | |
2964 foldMarkAdjustRecurse(&fp->fd_nested, | |
2965 (linenr_T)0, (long)(bot - fp->fd_top), | |
2966 (linenr_T)MAXLNUM, (long)(fp->fd_top - bot - 1)); | |
2967 fp->fd_len -= bot - fp->fd_top + 1; | |
2968 fp->fd_top = bot + 1; | |
2969 break; | |
2970 } | |
2971 | |
2972 /* 4: Delete completely contained fold. */ | |
2973 deleteFoldEntry(gap, (int)(fp - (fold_T *)gap->ga_data), TRUE); | |
2974 } | |
2975 } | |
2976 } | |
2977 | |
2978 /* foldMerge() {{{2 */ | |
2979 /* | |
1224 | 2980 * Merge two adjacent folds (and the nested ones in them). |
2981 * This only works correctly when the folds are really adjacent! Thus "fp1" | |
7 | 2982 * must end just above "fp2". |
2983 * The resulting fold is "fp1", nested folds are moved from "fp2" to "fp1". | |
2984 * Fold entry "fp2" in "gap" is deleted. | |
2985 */ | |
2986 static void | |
2987 foldMerge(fp1, gap, fp2) | |
2988 fold_T *fp1; | |
2989 garray_T *gap; | |
2990 fold_T *fp2; | |
2991 { | |
2992 fold_T *fp3; | |
2993 fold_T *fp4; | |
2994 int idx; | |
2995 garray_T *gap1 = &fp1->fd_nested; | |
2996 garray_T *gap2 = &fp2->fd_nested; | |
2997 | |
2998 /* If the last nested fold in fp1 touches the first nested fold in fp2, | |
2999 * merge them recursively. */ | |
3000 if (foldFind(gap1, fp1->fd_len - 1L, &fp3) && foldFind(gap2, 0L, &fp4)) | |
3001 foldMerge(fp3, gap2, fp4); | |
3002 | |
3003 /* Move nested folds in fp2 to the end of fp1. */ | |
3004 if (gap2->ga_len > 0 && ga_grow(gap1, gap2->ga_len) == OK) | |
3005 { | |
3006 for (idx = 0; idx < gap2->ga_len; ++idx) | |
3007 { | |
3008 ((fold_T *)gap1->ga_data)[gap1->ga_len] | |
3009 = ((fold_T *)gap2->ga_data)[idx]; | |
3010 ((fold_T *)gap1->ga_data)[gap1->ga_len].fd_top += fp1->fd_len; | |
3011 ++gap1->ga_len; | |
3012 } | |
3013 gap2->ga_len = 0; | |
3014 } | |
3015 | |
3016 fp1->fd_len += fp2->fd_len; | |
3017 deleteFoldEntry(gap, (int)(fp2 - (fold_T *)gap->ga_data), TRUE); | |
3018 fold_changed = TRUE; | |
3019 } | |
3020 | |
3021 /* foldlevelIndent() {{{2 */ | |
3022 /* | |
3023 * Low level function to get the foldlevel for the "indent" method. | |
3024 * Doesn't use any caching. | |
3025 * Returns a level of -1 if the foldlevel depends on surrounding lines. | |
3026 */ | |
3027 static void | |
3028 foldlevelIndent(flp) | |
3029 fline_T *flp; | |
3030 { | |
3031 char_u *s; | |
3032 buf_T *buf; | |
3033 linenr_T lnum = flp->lnum + flp->off; | |
3034 | |
3035 buf = flp->wp->w_buffer; | |
3036 s = skipwhite(ml_get_buf(buf, lnum, FALSE)); | |
3037 | |
3038 /* empty line or lines starting with a character in 'foldignore': level | |
3039 * depends on surrounding lines */ | |
3040 if (*s == NUL || vim_strchr(flp->wp->w_p_fdi, *s) != NULL) | |
3041 { | |
3042 /* first and last line can't be undefined, use level 0 */ | |
3043 if (lnum == 1 || lnum == buf->b_ml.ml_line_count) | |
3044 flp->lvl = 0; | |
3045 else | |
3046 flp->lvl = -1; | |
3047 } | |
3048 else | |
5438 | 3049 flp->lvl = get_indent_buf(buf, lnum) / get_sw_value(curbuf); |
7 | 3050 if (flp->lvl > flp->wp->w_p_fdn) |
1028 | 3051 { |
7 | 3052 flp->lvl = flp->wp->w_p_fdn; |
1028 | 3053 if (flp->lvl < 0) |
3054 flp->lvl = 0; | |
3055 } | |
7 | 3056 } |
3057 | |
3058 /* foldlevelDiff() {{{2 */ | |
3059 #ifdef FEAT_DIFF | |
3060 /* | |
3061 * Low level function to get the foldlevel for the "diff" method. | |
3062 * Doesn't use any caching. | |
3063 */ | |
3064 static void | |
3065 foldlevelDiff(flp) | |
3066 fline_T *flp; | |
3067 { | |
3068 if (diff_infold(flp->wp, flp->lnum + flp->off)) | |
3069 flp->lvl = 1; | |
3070 else | |
3071 flp->lvl = 0; | |
3072 } | |
3073 #endif | |
3074 | |
3075 /* foldlevelExpr() {{{2 */ | |
3076 /* | |
3077 * Low level function to get the foldlevel for the "expr" method. | |
3078 * Doesn't use any caching. | |
3079 * Returns a level of -1 if the foldlevel depends on surrounding lines. | |
3080 */ | |
3081 static void | |
3082 foldlevelExpr(flp) | |
3083 fline_T *flp; | |
3084 { | |
3085 #ifndef FEAT_EVAL | |
3086 flp->start = FALSE; | |
3087 flp->lvl = 0; | |
3088 #else | |
3089 win_T *win; | |
3090 int n; | |
3091 int c; | |
3092 linenr_T lnum = flp->lnum + flp->off; | |
3093 int save_keytyped; | |
3094 | |
3095 win = curwin; | |
3096 curwin = flp->wp; | |
3097 curbuf = flp->wp->w_buffer; | |
3098 set_vim_var_nr(VV_LNUM, lnum); | |
3099 | |
3100 flp->start = 0; | |
3101 flp->had_end = flp->end; | |
3102 flp->end = MAX_LEVEL + 1; | |
3103 if (lnum <= 1) | |
3104 flp->lvl = 0; | |
3105 | |
3106 /* KeyTyped may be reset to 0 when calling a function which invokes | |
3107 * do_cmdline(). To make 'foldopen' work correctly restore KeyTyped. */ | |
3108 save_keytyped = KeyTyped; | |
3109 n = eval_foldexpr(flp->wp->w_p_fde, &c); | |
3110 KeyTyped = save_keytyped; | |
3111 | |
3112 switch (c) | |
3113 { | |
3114 /* "a1", "a2", .. : add to the fold level */ | |
3115 case 'a': if (flp->lvl >= 0) | |
3116 { | |
3117 flp->lvl += n; | |
3118 flp->lvl_next = flp->lvl; | |
3119 } | |
3120 flp->start = n; | |
3121 break; | |
3122 | |
3123 /* "s1", "s2", .. : subtract from the fold level */ | |
3124 case 's': if (flp->lvl >= 0) | |
3125 { | |
3126 if (n > flp->lvl) | |
3127 flp->lvl_next = 0; | |
3128 else | |
3129 flp->lvl_next = flp->lvl - n; | |
3130 flp->end = flp->lvl_next + 1; | |
3131 } | |
3132 break; | |
3133 | |
3134 /* ">1", ">2", .. : start a fold with a certain level */ | |
3135 case '>': flp->lvl = n; | |
3136 flp->lvl_next = n; | |
3137 flp->start = 1; | |
3138 break; | |
3139 | |
3140 /* "<1", "<2", .. : end a fold with a certain level */ | |
3141 case '<': flp->lvl_next = n - 1; | |
3142 flp->end = n; | |
3143 break; | |
3144 | |
3145 /* "=": No change in level */ | |
3146 case '=': flp->lvl_next = flp->lvl; | |
3147 break; | |
3148 | |
3149 /* "-1", "0", "1", ..: set fold level */ | |
3150 default: if (n < 0) | |
3151 /* Use the current level for the next line, so that "a1" | |
3152 * will work there. */ | |
3153 flp->lvl_next = flp->lvl; | |
3154 else | |
3155 flp->lvl_next = n; | |
3156 flp->lvl = n; | |
3157 break; | |
3158 } | |
3159 | |
3160 /* If the level is unknown for the first or the last line in the file, use | |
3161 * level 0. */ | |
3162 if (flp->lvl < 0) | |
3163 { | |
3164 if (lnum <= 1) | |
3165 { | |
3166 flp->lvl = 0; | |
3167 flp->lvl_next = 0; | |
3168 } | |
3169 if (lnum == curbuf->b_ml.ml_line_count) | |
3170 flp->lvl_next = 0; | |
3171 } | |
3172 | |
3173 curwin = win; | |
3174 curbuf = curwin->w_buffer; | |
3175 #endif | |
3176 } | |
3177 | |
3178 /* parseMarker() {{{2 */ | |
3179 /* | |
3180 * Parse 'foldmarker' and set "foldendmarker", "foldstartmarkerlen" and | |
3181 * "foldendmarkerlen". | |
3182 * Relies on the option value to have been checked for correctness already. | |
3183 */ | |
3184 static void | |
3185 parseMarker(wp) | |
3186 win_T *wp; | |
3187 { | |
3188 foldendmarker = vim_strchr(wp->w_p_fmr, ','); | |
3189 foldstartmarkerlen = (int)(foldendmarker++ - wp->w_p_fmr); | |
3190 foldendmarkerlen = (int)STRLEN(foldendmarker); | |
3191 } | |
3192 | |
3193 /* foldlevelMarker() {{{2 */ | |
3194 /* | |
3195 * Low level function to get the foldlevel for the "marker" method. | |
3196 * "foldendmarker", "foldstartmarkerlen" and "foldendmarkerlen" must have been | |
3197 * set before calling this. | |
3198 * Requires that flp->lvl is set to the fold level of the previous line! | |
3199 * Careful: This means you can't call this function twice on the same line. | |
3200 * Doesn't use any caching. | |
3201 * Sets flp->start when a start marker was found. | |
3202 */ | |
3203 static void | |
3204 foldlevelMarker(flp) | |
3205 fline_T *flp; | |
3206 { | |
3207 char_u *startmarker; | |
3208 int cstart; | |
3209 int cend; | |
3210 int start_lvl = flp->lvl; | |
3211 char_u *s; | |
3212 int n; | |
3213 | |
3214 /* cache a few values for speed */ | |
3215 startmarker = flp->wp->w_p_fmr; | |
3216 cstart = *startmarker; | |
3217 ++startmarker; | |
3218 cend = *foldendmarker; | |
3219 | |
3220 /* Default: no start found, next level is same as current level */ | |
3221 flp->start = 0; | |
3222 flp->lvl_next = flp->lvl; | |
3223 | |
3224 s = ml_get_buf(flp->wp->w_buffer, flp->lnum + flp->off, FALSE); | |
3225 while (*s) | |
3226 { | |
3227 if (*s == cstart | |
3228 && STRNCMP(s + 1, startmarker, foldstartmarkerlen - 1) == 0) | |
3229 { | |
3230 /* found startmarker: set flp->lvl */ | |
3231 s += foldstartmarkerlen; | |
3232 if (VIM_ISDIGIT(*s)) | |
3233 { | |
3234 n = atoi((char *)s); | |
3235 if (n > 0) | |
3236 { | |
3237 flp->lvl = n; | |
3238 flp->lvl_next = n; | |
3239 if (n <= start_lvl) | |
3240 flp->start = 1; | |
3241 else | |
3242 flp->start = n - start_lvl; | |
3243 } | |
3244 } | |
3245 else | |
3246 { | |
3247 ++flp->lvl; | |
3248 ++flp->lvl_next; | |
3249 ++flp->start; | |
3250 } | |
3251 } | |
3252 else if (*s == cend | |
3253 && STRNCMP(s + 1, foldendmarker + 1, foldendmarkerlen - 1) == 0) | |
3254 { | |
3255 /* found endmarker: set flp->lvl_next */ | |
3256 s += foldendmarkerlen; | |
3257 if (VIM_ISDIGIT(*s)) | |
3258 { | |
3259 n = atoi((char *)s); | |
3260 if (n > 0) | |
3261 { | |
3262 flp->lvl = n; | |
3263 flp->lvl_next = n - 1; | |
3264 /* never start a fold with an end marker */ | |
2054
79b8d69a4588
updated for version 7.2.340
Bram Moolenaar <bram@zimbu.org>
parents:
1985
diff
changeset
|
3265 if (flp->lvl_next > start_lvl) |
79b8d69a4588
updated for version 7.2.340
Bram Moolenaar <bram@zimbu.org>
parents:
1985
diff
changeset
|
3266 flp->lvl_next = start_lvl; |
7 | 3267 } |
3268 } | |
3269 else | |
3270 --flp->lvl_next; | |
3271 } | |
3272 else | |
651 | 3273 mb_ptr_adv(s); |
7 | 3274 } |
3275 | |
3276 /* The level can't go negative, must be missing a start marker. */ | |
3277 if (flp->lvl_next < 0) | |
3278 flp->lvl_next = 0; | |
3279 } | |
3280 | |
3281 /* foldlevelSyntax() {{{2 */ | |
3282 /* | |
3283 * Low level function to get the foldlevel for the "syntax" method. | |
3284 * Doesn't use any caching. | |
3285 */ | |
3286 static void | |
3287 foldlevelSyntax(flp) | |
3288 fline_T *flp; | |
3289 { | |
3290 #ifndef FEAT_SYN_HL | |
3291 flp->start = 0; | |
3292 flp->lvl = 0; | |
3293 #else | |
3294 linenr_T lnum = flp->lnum + flp->off; | |
3295 int n; | |
3296 | |
3297 /* Use the maximum fold level at the start of this line and the next. */ | |
3298 flp->lvl = syn_get_foldlevel(flp->wp, lnum); | |
3299 flp->start = 0; | |
3300 if (lnum < flp->wp->w_buffer->b_ml.ml_line_count) | |
3301 { | |
3302 n = syn_get_foldlevel(flp->wp, lnum + 1); | |
3303 if (n > flp->lvl) | |
3304 { | |
3305 flp->start = n - flp->lvl; /* fold(s) start here */ | |
3306 flp->lvl = n; | |
3307 } | |
3308 } | |
3309 #endif | |
3310 } | |
3311 | |
3312 /* functions for storing the fold state in a View {{{1 */ | |
3313 /* put_folds() {{{2 */ | |
3314 #if defined(FEAT_SESSION) || defined(PROTO) | |
3315 static int put_folds_recurse __ARGS((FILE *fd, garray_T *gap, linenr_T off)); | |
3392 | 3316 static int put_foldopen_recurse __ARGS((FILE *fd, win_T *wp, garray_T *gap, linenr_T off)); |
3317 static int put_fold_open_close __ARGS((FILE *fd, fold_T *fp, linenr_T off)); | |
7 | 3318 |
3319 /* | |
3320 * Write commands to "fd" to restore the manual folds in window "wp". | |
3321 * Return FAIL if writing fails. | |
3322 */ | |
3323 int | |
3324 put_folds(fd, wp) | |
3325 FILE *fd; | |
3326 win_T *wp; | |
3327 { | |
3328 if (foldmethodIsManual(wp)) | |
3329 { | |
3330 if (put_line(fd, "silent! normal! zE") == FAIL | |
3331 || put_folds_recurse(fd, &wp->w_folds, (linenr_T)0) == FAIL) | |
3332 return FAIL; | |
3333 } | |
3334 | |
3335 /* If some folds are manually opened/closed, need to restore that. */ | |
3336 if (wp->w_fold_manual) | |
3392 | 3337 return put_foldopen_recurse(fd, wp, &wp->w_folds, (linenr_T)0); |
7 | 3338 |
3339 return OK; | |
3340 } | |
3341 | |
3342 /* put_folds_recurse() {{{2 */ | |
3343 /* | |
3344 * Write commands to "fd" to recreate manually created folds. | |
3345 * Returns FAIL when writing failed. | |
3346 */ | |
3347 static int | |
3348 put_folds_recurse(fd, gap, off) | |
3349 FILE *fd; | |
3350 garray_T *gap; | |
3351 linenr_T off; | |
3352 { | |
3353 int i; | |
3354 fold_T *fp; | |
3355 | |
3356 fp = (fold_T *)gap->ga_data; | |
3357 for (i = 0; i < gap->ga_len; i++) | |
3358 { | |
3359 /* Do nested folds first, they will be created closed. */ | |
3360 if (put_folds_recurse(fd, &fp->fd_nested, off + fp->fd_top) == FAIL) | |
3361 return FAIL; | |
3362 if (fprintf(fd, "%ld,%ldfold", fp->fd_top + off, | |
3363 fp->fd_top + off + fp->fd_len - 1) < 0 | |
3364 || put_eol(fd) == FAIL) | |
3365 return FAIL; | |
3366 ++fp; | |
3367 } | |
3368 return OK; | |
3369 } | |
3370 | |
3371 /* put_foldopen_recurse() {{{2 */ | |
3372 /* | |
3373 * Write commands to "fd" to open and close manually opened/closed folds. | |
3374 * Returns FAIL when writing failed. | |
3375 */ | |
3376 static int | |
3392 | 3377 put_foldopen_recurse(fd, wp, gap, off) |
7 | 3378 FILE *fd; |
3392 | 3379 win_T *wp; |
7 | 3380 garray_T *gap; |
3381 linenr_T off; | |
3382 { | |
3383 int i; | |
3392 | 3384 int level; |
7 | 3385 fold_T *fp; |
3386 | |
3387 fp = (fold_T *)gap->ga_data; | |
3388 for (i = 0; i < gap->ga_len; i++) | |
3389 { | |
3390 if (fp->fd_flags != FD_LEVEL) | |
3391 { | |
3392 if (fp->fd_nested.ga_len > 0) | |
3393 { | |
3392 | 3394 /* open nested folds while this fold is open */ |
7 | 3395 if (fprintf(fd, "%ld", fp->fd_top + off) < 0 |
3396 || put_eol(fd) == FAIL | |
3766 | 3397 || put_line(fd, "normal! zo") == FAIL) |
7 | 3398 return FAIL; |
3392 | 3399 if (put_foldopen_recurse(fd, wp, &fp->fd_nested, |
3400 off + fp->fd_top) | |
7 | 3401 == FAIL) |
3402 return FAIL; | |
3392 | 3403 /* close the parent when needed */ |
3404 if (fp->fd_flags == FD_CLOSED) | |
3405 { | |
3406 if (put_fold_open_close(fd, fp, off) == FAIL) | |
3407 return FAIL; | |
3408 } | |
3409 } | |
3410 else | |
3411 { | |
3412 /* Open or close the leaf according to the window foldlevel. | |
3413 * Do not close a leaf that is already closed, as it will close | |
3414 * the parent. */ | |
3415 level = foldLevelWin(wp, off + fp->fd_top); | |
3416 if ((fp->fd_flags == FD_CLOSED && wp->w_p_fdl >= level) | |
3417 || (fp->fd_flags != FD_CLOSED && wp->w_p_fdl < level)) | |
3418 if (put_fold_open_close(fd, fp, off) == FAIL) | |
3419 return FAIL; | |
7 | 3420 } |
3421 } | |
3422 ++fp; | |
3423 } | |
3424 | |
3425 return OK; | |
3426 } | |
3392 | 3427 |
3428 /* put_fold_open_close() {{{2 */ | |
3429 /* | |
3430 * Write the open or close command to "fd". | |
3431 * Returns FAIL when writing failed. | |
3432 */ | |
3433 static int | |
3434 put_fold_open_close(fd, fp, off) | |
3435 FILE *fd; | |
3436 fold_T *fp; | |
3437 linenr_T off; | |
3438 { | |
3439 if (fprintf(fd, "%ld", fp->fd_top + off) < 0 | |
3440 || put_eol(fd) == FAIL | |
3766 | 3441 || fprintf(fd, "normal! z%c", |
3392 | 3442 fp->fd_flags == FD_CLOSED ? 'c' : 'o') < 0 |
3443 || put_eol(fd) == FAIL) | |
3444 return FAIL; | |
3445 | |
3446 return OK; | |
3447 } | |
7 | 3448 #endif /* FEAT_SESSION */ |
3449 | |
3450 /* }}}1 */ | |
3451 #endif /* defined(FEAT_FOLDING) || defined(PROTO) */ |