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 #ifdef FEAT_VISUAL
|
|
434 /* Force a redraw to remove the Visual highlighting. */
|
|
435 if (had_visual)
|
|
436 redraw_curbuf_later(INVERTED);
|
|
437 #endif
|
|
438 }
|
|
439
|
|
440 /* openFold() {{{2 */
|
|
441 /*
|
|
442 * Open fold for current window at line "lnum".
|
|
443 * Repeat "count" times.
|
|
444 */
|
|
445 void
|
|
446 openFold(lnum, count)
|
|
447 linenr_T lnum;
|
|
448 long count;
|
|
449 {
|
|
450 setFoldRepeat(lnum, count, TRUE);
|
|
451 }
|
|
452
|
|
453 /* openFoldRecurse() {{{2 */
|
|
454 /*
|
|
455 * Open fold for current window at line "lnum" recursively.
|
|
456 */
|
|
457 void
|
|
458 openFoldRecurse(lnum)
|
|
459 linenr_T lnum;
|
|
460 {
|
|
461 (void)setManualFold(lnum, TRUE, TRUE, NULL);
|
|
462 }
|
|
463
|
|
464 /* foldOpenCursor() {{{2 */
|
|
465 /*
|
|
466 * Open folds until the cursor line is not in a closed fold.
|
|
467 */
|
|
468 void
|
|
469 foldOpenCursor()
|
|
470 {
|
|
471 int done;
|
|
472
|
|
473 checkupdate(curwin);
|
|
474 if (hasAnyFolding(curwin))
|
|
475 for (;;)
|
|
476 {
|
|
477 done = DONE_NOTHING;
|
|
478 (void)setManualFold(curwin->w_cursor.lnum, TRUE, FALSE, &done);
|
|
479 if (!(done & DONE_ACTION))
|
|
480 break;
|
|
481 }
|
|
482 }
|
|
483
|
|
484 /* newFoldLevel() {{{2 */
|
|
485 /*
|
|
486 * Set new foldlevel for current window.
|
|
487 */
|
|
488 void
|
|
489 newFoldLevel()
|
|
490 {
|
|
491 newFoldLevelWin(curwin);
|
|
492
|
|
493 #ifdef FEAT_DIFF
|
|
494 if (foldmethodIsDiff(curwin) && curwin->w_p_scb)
|
|
495 {
|
|
496 win_T *wp;
|
|
497
|
|
498 /*
|
|
499 * Set the same foldlevel in other windows in diff mode.
|
|
500 */
|
|
501 FOR_ALL_WINDOWS(wp)
|
|
502 {
|
|
503 if (wp != curwin && foldmethodIsDiff(wp) && wp->w_p_scb)
|
|
504 {
|
|
505 wp->w_p_fdl = curwin->w_p_fdl;
|
|
506 newFoldLevelWin(wp);
|
|
507 }
|
|
508 }
|
|
509 }
|
|
510 #endif
|
|
511 }
|
|
512
|
|
513 static void
|
|
514 newFoldLevelWin(wp)
|
|
515 win_T *wp;
|
|
516 {
|
|
517 fold_T *fp;
|
|
518 int i;
|
|
519
|
|
520 checkupdate(wp);
|
|
521 if (wp->w_fold_manual)
|
|
522 {
|
|
523 /* Set all flags for the first level of folds to FD_LEVEL. Following
|
|
524 * manual open/close will then change the flags to FD_OPEN or
|
|
525 * FD_CLOSED for those folds that don't use 'foldlevel'. */
|
|
526 fp = (fold_T *)wp->w_folds.ga_data;
|
|
527 for (i = 0; i < wp->w_folds.ga_len; ++i)
|
|
528 fp[i].fd_flags = FD_LEVEL;
|
|
529 wp->w_fold_manual = FALSE;
|
|
530 }
|
|
531 changed_window_setting_win(wp);
|
|
532 }
|
|
533
|
|
534 /* foldCheckClose() {{{2 */
|
|
535 /*
|
|
536 * Apply 'foldlevel' to all folds that don't contain the cursor.
|
|
537 */
|
|
538 void
|
|
539 foldCheckClose()
|
|
540 {
|
|
541 if (*p_fcl != NUL) /* can only be "all" right now */
|
|
542 {
|
|
543 checkupdate(curwin);
|
|
544 if (checkCloseRec(&curwin->w_folds, curwin->w_cursor.lnum,
|
|
545 (int)curwin->w_p_fdl))
|
|
546 changed_window_setting();
|
|
547 }
|
|
548 }
|
|
549
|
|
550 /* checkCloseRec() {{{2 */
|
|
551 static int
|
|
552 checkCloseRec(gap, lnum, level)
|
|
553 garray_T *gap;
|
|
554 linenr_T lnum;
|
|
555 int level;
|
|
556 {
|
|
557 fold_T *fp;
|
|
558 int retval = FALSE;
|
|
559 int i;
|
|
560
|
|
561 fp = (fold_T *)gap->ga_data;
|
|
562 for (i = 0; i < gap->ga_len; ++i)
|
|
563 {
|
|
564 /* Only manually opened folds may need to be closed. */
|
|
565 if (fp[i].fd_flags == FD_OPEN)
|
|
566 {
|
|
567 if (level <= 0 && (lnum < fp[i].fd_top
|
|
568 || lnum >= fp[i].fd_top + fp[i].fd_len))
|
|
569 {
|
|
570 fp[i].fd_flags = FD_LEVEL;
|
|
571 retval = TRUE;
|
|
572 }
|
|
573 else
|
|
574 retval |= checkCloseRec(&fp[i].fd_nested, lnum - fp[i].fd_top,
|
|
575 level - 1);
|
|
576 }
|
|
577 }
|
|
578 return retval;
|
|
579 }
|
|
580
|
|
581 /* foldCreateAllowed() {{{2 */
|
|
582 /*
|
|
583 * Return TRUE if it's allowed to manually create or delete a fold.
|
|
584 * Give an error message and return FALSE if not.
|
|
585 */
|
|
586 int
|
|
587 foldManualAllowed(create)
|
|
588 int create;
|
|
589 {
|
|
590 if (foldmethodIsManual(curwin) || foldmethodIsMarker(curwin))
|
|
591 return TRUE;
|
|
592 if (create)
|
|
593 EMSG(_("E350: Cannot create fold with current 'foldmethod'"));
|
|
594 else
|
|
595 EMSG(_("E351: Cannot delete fold with current 'foldmethod'"));
|
|
596 return FALSE;
|
|
597 }
|
|
598
|
|
599 /* foldCreate() {{{2 */
|
|
600 /*
|
|
601 * Create a fold from line "start" to line "end" (inclusive) in the current
|
|
602 * window.
|
|
603 */
|
|
604 void
|
|
605 foldCreate(start, end)
|
|
606 linenr_T start;
|
|
607 linenr_T end;
|
|
608 {
|
|
609 fold_T *fp;
|
|
610 garray_T *gap;
|
|
611 garray_T fold_ga;
|
|
612 int i, j;
|
|
613 int cont;
|
|
614 int use_level = FALSE;
|
|
615 int closed = FALSE;
|
|
616 int level = 0;
|
|
617 linenr_T start_rel = start;
|
|
618 linenr_T end_rel = end;
|
|
619
|
|
620 if (start > end)
|
|
621 {
|
|
622 /* reverse the range */
|
|
623 end = start_rel;
|
|
624 start = end_rel;
|
|
625 start_rel = start;
|
|
626 end_rel = end;
|
|
627 }
|
|
628
|
|
629 /* When 'foldmethod' is "marker" add markers, which creates the folds. */
|
|
630 if (foldmethodIsMarker(curwin))
|
|
631 {
|
|
632 foldCreateMarkers(start, end);
|
|
633 return;
|
|
634 }
|
|
635
|
|
636 checkupdate(curwin);
|
|
637
|
|
638 /* Find the place to insert the new fold. */
|
|
639 gap = &curwin->w_folds;
|
|
640 for (;;)
|
|
641 {
|
|
642 if (!foldFind(gap, start_rel, &fp))
|
|
643 break;
|
|
644 if (fp->fd_top + fp->fd_len > end_rel)
|
|
645 {
|
|
646 /* New fold is completely inside this fold: Go one level deeper. */
|
|
647 gap = &fp->fd_nested;
|
|
648 start_rel -= fp->fd_top;
|
|
649 end_rel -= fp->fd_top;
|
|
650 if (use_level || fp->fd_flags == FD_LEVEL)
|
|
651 {
|
|
652 use_level = TRUE;
|
|
653 if (level >= curwin->w_p_fdl)
|
|
654 closed = TRUE;
|
|
655 }
|
|
656 else if (fp->fd_flags == FD_CLOSED)
|
|
657 closed = TRUE;
|
|
658 ++level;
|
|
659 }
|
|
660 else
|
|
661 {
|
|
662 /* This fold and new fold overlap: Insert here and move some folds
|
|
663 * inside the new fold. */
|
|
664 break;
|
|
665 }
|
|
666 }
|
|
667
|
|
668 i = (int)(fp - (fold_T *)gap->ga_data);
|
|
669 if (ga_grow(gap, 1) == OK)
|
|
670 {
|
|
671 fp = (fold_T *)gap->ga_data + i;
|
|
672 ga_init2(&fold_ga, (int)sizeof(fold_T), 10);
|
|
673
|
|
674 /* Count number of folds that will be contained in the new fold. */
|
|
675 for (cont = 0; i + cont < gap->ga_len; ++cont)
|
|
676 if (fp[cont].fd_top > end_rel)
|
|
677 break;
|
|
678 if (cont > 0 && ga_grow(&fold_ga, cont) == OK)
|
|
679 {
|
|
680 /* If the first fold starts before the new fold, let the new fold
|
|
681 * start there. Otherwise the existing fold would change. */
|
|
682 if (start_rel > fp->fd_top)
|
|
683 start_rel = fp->fd_top;
|
|
684
|
|
685 /* When last contained fold isn't completely contained, adjust end
|
|
686 * of new fold. */
|
|
687 if (end_rel < fp[cont - 1].fd_top + fp[cont - 1].fd_len - 1)
|
|
688 end_rel = fp[cont - 1].fd_top + fp[cont - 1].fd_len - 1;
|
|
689 /* Move contained folds to inside new fold. */
|
|
690 mch_memmove(fold_ga.ga_data, fp, sizeof(fold_T) * cont);
|
|
691 fold_ga.ga_len += cont;
|
|
692 i += cont;
|
|
693
|
|
694 /* Adjust line numbers in contained folds to be relative to the
|
|
695 * new fold. */
|
|
696 for (j = 0; j < cont; ++j)
|
|
697 ((fold_T *)fold_ga.ga_data)[j].fd_top -= start_rel;
|
|
698 }
|
|
699 /* Move remaining entries to after the new fold. */
|
|
700 if (i < gap->ga_len)
|
|
701 mch_memmove(fp + 1, (fold_T *)gap->ga_data + i,
|
|
702 sizeof(fold_T) * (gap->ga_len - i));
|
|
703 gap->ga_len = gap->ga_len + 1 - cont;
|
|
704
|
|
705 /* insert new fold */
|
|
706 fp->fd_nested = fold_ga;
|
|
707 fp->fd_top = start_rel;
|
|
708 fp->fd_len = end_rel - start_rel + 1;
|
|
709
|
|
710 /* We want the new fold to be closed. If it would remain open because
|
|
711 * of using 'foldlevel', need to adjust fd_flags of containing folds.
|
|
712 */
|
|
713 if (use_level && !closed && level < curwin->w_p_fdl)
|
|
714 closeFold(start, 1L);
|
|
715 if (!use_level)
|
|
716 curwin->w_fold_manual = TRUE;
|
|
717 fp->fd_flags = FD_CLOSED;
|
|
718 fp->fd_small = MAYBE;
|
|
719
|
|
720 /* redraw */
|
|
721 changed_window_setting();
|
|
722 }
|
|
723 }
|
|
724
|
|
725 /* deleteFold() {{{2 */
|
|
726 /*
|
|
727 * Delete a fold at line "start" in the current window.
|
|
728 * When "end" is not 0, delete all folds from "start" to "end".
|
|
729 * When "recursive" is TRUE delete recursively.
|
|
730 */
|
|
731 void
|
|
732 deleteFold(start, end, recursive, had_visual)
|
|
733 linenr_T start;
|
|
734 linenr_T end;
|
|
735 int recursive;
|
|
736 int had_visual; /* TRUE when Visual selection used */
|
|
737 {
|
|
738 garray_T *gap;
|
|
739 fold_T *fp;
|
|
740 garray_T *found_ga;
|
|
741 fold_T *found_fp = NULL;
|
|
742 linenr_T found_off = 0;
|
1780
|
743 int use_level;
|
7
|
744 int maybe_small = FALSE;
|
|
745 int level = 0;
|
|
746 linenr_T lnum = start;
|
|
747 linenr_T lnum_off;
|
|
748 int did_one = FALSE;
|
|
749 linenr_T first_lnum = MAXLNUM;
|
|
750 linenr_T last_lnum = 0;
|
|
751
|
|
752 checkupdate(curwin);
|
|
753
|
|
754 while (lnum <= end)
|
|
755 {
|
|
756 /* Find the deepest fold for "start". */
|
|
757 gap = &curwin->w_folds;
|
|
758 found_ga = NULL;
|
|
759 lnum_off = 0;
|
1780
|
760 use_level = FALSE;
|
7
|
761 for (;;)
|
|
762 {
|
|
763 if (!foldFind(gap, lnum - lnum_off, &fp))
|
|
764 break;
|
|
765 /* lnum is inside this fold, remember info */
|
|
766 found_ga = gap;
|
|
767 found_fp = fp;
|
|
768 found_off = lnum_off;
|
|
769
|
|
770 /* if "lnum" is folded, don't check nesting */
|
|
771 if (check_closed(curwin, fp, &use_level, level,
|
|
772 &maybe_small, lnum_off))
|
|
773 break;
|
|
774
|
|
775 /* check nested folds */
|
|
776 gap = &fp->fd_nested;
|
|
777 lnum_off += fp->fd_top;
|
|
778 ++level;
|
|
779 }
|
|
780 if (found_ga == NULL)
|
|
781 {
|
|
782 ++lnum;
|
|
783 }
|
|
784 else
|
|
785 {
|
|
786 lnum = found_fp->fd_top + found_fp->fd_len + found_off;
|
|
787
|
|
788 if (foldmethodIsManual(curwin))
|
|
789 deleteFoldEntry(found_ga,
|
|
790 (int)(found_fp - (fold_T *)found_ga->ga_data), recursive);
|
|
791 else
|
|
792 {
|
1780
|
793 if (first_lnum > found_fp->fd_top + found_off)
|
|
794 first_lnum = found_fp->fd_top + found_off;
|
|
795 if (last_lnum < lnum)
|
7
|
796 last_lnum = lnum;
|
1780
|
797 if (!did_one)
|
|
798 parseMarker(curwin);
|
7
|
799 deleteFoldMarkers(found_fp, recursive, found_off);
|
|
800 }
|
1780
|
801 did_one = TRUE;
|
7
|
802
|
|
803 /* redraw window */
|
|
804 changed_window_setting();
|
|
805 }
|
|
806 }
|
|
807 if (!did_one)
|
|
808 {
|
|
809 EMSG(_(e_nofold));
|
|
810 #ifdef FEAT_VISUAL
|
|
811 /* Force a redraw to remove the Visual highlighting. */
|
|
812 if (had_visual)
|
|
813 redraw_curbuf_later(INVERTED);
|
|
814 #endif
|
|
815 }
|
1780
|
816 else
|
|
817 /* Deleting markers may make cursor column invalid. */
|
|
818 check_cursor_col();
|
|
819
|
7
|
820 if (last_lnum > 0)
|
|
821 changed_lines(first_lnum, (colnr_T)0, last_lnum, 0L);
|
|
822 }
|
|
823
|
|
824 /* clearFolding() {{{2 */
|
|
825 /*
|
|
826 * Remove all folding for window "win".
|
|
827 */
|
|
828 void
|
|
829 clearFolding(win)
|
|
830 win_T *win;
|
|
831 {
|
|
832 deleteFoldRecurse(&win->w_folds);
|
|
833 win->w_foldinvalid = FALSE;
|
|
834 }
|
|
835
|
|
836 /* foldUpdate() {{{2 */
|
|
837 /*
|
|
838 * Update folds for changes in the buffer of a window.
|
|
839 * Note that inserted/deleted lines must have already been taken care of by
|
|
840 * calling foldMarkAdjust().
|
|
841 * The changes in lines from top to bot (inclusive).
|
|
842 */
|
|
843 void
|
|
844 foldUpdate(wp, top, bot)
|
|
845 win_T *wp;
|
|
846 linenr_T top;
|
|
847 linenr_T bot;
|
|
848 {
|
|
849 fold_T *fp;
|
|
850
|
|
851 /* Mark all folds from top to bot as maybe-small. */
|
|
852 (void)foldFind(&curwin->w_folds, curwin->w_cursor.lnum, &fp);
|
|
853 while (fp < (fold_T *)curwin->w_folds.ga_data + curwin->w_folds.ga_len
|
|
854 && fp->fd_top < bot)
|
|
855 {
|
|
856 fp->fd_small = MAYBE;
|
|
857 ++fp;
|
|
858 }
|
|
859
|
|
860 if (foldmethodIsIndent(wp)
|
|
861 || foldmethodIsExpr(wp)
|
|
862 || foldmethodIsMarker(wp)
|
|
863 #ifdef FEAT_DIFF
|
|
864 || foldmethodIsDiff(wp)
|
|
865 #endif
|
|
866 || foldmethodIsSyntax(wp))
|
1424
|
867 {
|
|
868 int save_got_int = got_int;
|
|
869
|
|
870 /* reset got_int here, otherwise it won't work */
|
|
871 got_int = FALSE;
|
7
|
872 foldUpdateIEMS(wp, top, bot);
|
1424
|
873 got_int |= save_got_int;
|
|
874 }
|
7
|
875 }
|
|
876
|
|
877 /* foldUpdateAll() {{{2 */
|
|
878 /*
|
|
879 * Update all lines in a window for folding.
|
|
880 * Used when a fold setting changes or after reloading the buffer.
|
|
881 * The actual updating is postponed until fold info is used, to avoid doing
|
|
882 * every time a setting is changed or a syntax item is added.
|
|
883 */
|
|
884 void
|
|
885 foldUpdateAll(win)
|
|
886 win_T *win;
|
|
887 {
|
|
888 win->w_foldinvalid = TRUE;
|
|
889 redraw_win_later(win, NOT_VALID);
|
|
890 }
|
|
891
|
|
892 /* foldMoveTo() {{{2 */
|
|
893 /*
|
|
894 * If "updown" is FALSE: Move to the start or end of the fold.
|
|
895 * If "updown" is TRUE: move to fold at the same level.
|
|
896 * If not moved return FAIL.
|
|
897 */
|
|
898 int
|
|
899 foldMoveTo(updown, dir, count)
|
|
900 int updown;
|
|
901 int dir; /* FORWARD or BACKWARD */
|
|
902 long count;
|
|
903 {
|
|
904 long n;
|
|
905 int retval = FAIL;
|
|
906 linenr_T lnum_off;
|
|
907 linenr_T lnum_found;
|
|
908 linenr_T lnum;
|
|
909 int use_level;
|
|
910 int maybe_small;
|
|
911 garray_T *gap;
|
|
912 fold_T *fp;
|
|
913 int level;
|
|
914 int last;
|
|
915
|
36
|
916 checkupdate(curwin);
|
|
917
|
7
|
918 /* Repeat "count" times. */
|
|
919 for (n = 0; n < count; ++n)
|
|
920 {
|
|
921 /* Find nested folds. Stop when a fold is closed. The deepest fold
|
|
922 * that moves the cursor is used. */
|
|
923 lnum_off = 0;
|
|
924 gap = &curwin->w_folds;
|
|
925 use_level = FALSE;
|
|
926 maybe_small = FALSE;
|
|
927 lnum_found = curwin->w_cursor.lnum;
|
|
928 level = 0;
|
|
929 last = FALSE;
|
|
930 for (;;)
|
|
931 {
|
|
932 if (!foldFind(gap, curwin->w_cursor.lnum - lnum_off, &fp))
|
|
933 {
|
|
934 if (!updown)
|
|
935 break;
|
|
936
|
|
937 /* When moving up, consider a fold above the cursor; when
|
|
938 * moving down consider a fold below the cursor. */
|
|
939 if (dir == FORWARD)
|
|
940 {
|
|
941 if (fp - (fold_T *)gap->ga_data >= gap->ga_len)
|
|
942 break;
|
|
943 --fp;
|
|
944 }
|
|
945 else
|
|
946 {
|
|
947 if (fp == (fold_T *)gap->ga_data)
|
|
948 break;
|
|
949 }
|
|
950 /* don't look for contained folds, they will always move
|
|
951 * the cursor too far. */
|
|
952 last = TRUE;
|
|
953 }
|
|
954
|
|
955 if (!last)
|
|
956 {
|
|
957 /* Check if this fold is closed. */
|
|
958 if (check_closed(curwin, fp, &use_level, level,
|
|
959 &maybe_small, lnum_off))
|
|
960 last = TRUE;
|
|
961
|
|
962 /* "[z" and "]z" stop at closed fold */
|
|
963 if (last && !updown)
|
|
964 break;
|
|
965 }
|
|
966
|
|
967 if (updown)
|
|
968 {
|
|
969 if (dir == FORWARD)
|
|
970 {
|
|
971 /* to start of next fold if there is one */
|
|
972 if (fp + 1 - (fold_T *)gap->ga_data < gap->ga_len)
|
|
973 {
|
|
974 lnum = fp[1].fd_top + lnum_off;
|
|
975 if (lnum > curwin->w_cursor.lnum)
|
|
976 lnum_found = lnum;
|
|
977 }
|
|
978 }
|
|
979 else
|
|
980 {
|
|
981 /* to end of previous fold if there is one */
|
|
982 if (fp > (fold_T *)gap->ga_data)
|
|
983 {
|
|
984 lnum = fp[-1].fd_top + lnum_off + fp[-1].fd_len - 1;
|
|
985 if (lnum < curwin->w_cursor.lnum)
|
|
986 lnum_found = lnum;
|
|
987 }
|
|
988 }
|
|
989 }
|
|
990 else
|
|
991 {
|
|
992 /* Open fold found, set cursor to its start/end and then check
|
|
993 * nested folds. */
|
|
994 if (dir == FORWARD)
|
|
995 {
|
|
996 lnum = fp->fd_top + lnum_off + fp->fd_len - 1;
|
|
997 if (lnum > curwin->w_cursor.lnum)
|
|
998 lnum_found = lnum;
|
|
999 }
|
|
1000 else
|
|
1001 {
|
|
1002 lnum = fp->fd_top + lnum_off;
|
|
1003 if (lnum < curwin->w_cursor.lnum)
|
|
1004 lnum_found = lnum;
|
|
1005 }
|
|
1006 }
|
|
1007
|
|
1008 if (last)
|
|
1009 break;
|
|
1010
|
|
1011 /* Check nested folds (if any). */
|
|
1012 gap = &fp->fd_nested;
|
|
1013 lnum_off += fp->fd_top;
|
|
1014 ++level;
|
|
1015 }
|
|
1016 if (lnum_found != curwin->w_cursor.lnum)
|
|
1017 {
|
|
1018 if (retval == FAIL)
|
|
1019 setpcmark();
|
|
1020 curwin->w_cursor.lnum = lnum_found;
|
|
1021 curwin->w_cursor.col = 0;
|
|
1022 retval = OK;
|
|
1023 }
|
|
1024 else
|
|
1025 break;
|
|
1026 }
|
|
1027
|
|
1028 return retval;
|
|
1029 }
|
|
1030
|
|
1031 /* foldInitWin() {{{2 */
|
|
1032 /*
|
|
1033 * Init the fold info in a new window.
|
|
1034 */
|
|
1035 void
|
|
1036 foldInitWin(newwin)
|
|
1037 win_T *newwin;
|
|
1038 {
|
|
1039 ga_init2(&newwin->w_folds, (int)sizeof(fold_T), 10);
|
|
1040 }
|
|
1041
|
|
1042 /* find_wl_entry() {{{2 */
|
|
1043 /*
|
|
1044 * Find an entry in the win->w_lines[] array for buffer line "lnum".
|
|
1045 * Only valid entries are considered (for entries where wl_valid is FALSE the
|
|
1046 * line number can be wrong).
|
|
1047 * Returns index of entry or -1 if not found.
|
|
1048 */
|
|
1049 int
|
|
1050 find_wl_entry(win, lnum)
|
|
1051 win_T *win;
|
|
1052 linenr_T lnum;
|
|
1053 {
|
|
1054 int i;
|
|
1055
|
|
1056 if (win->w_lines_valid > 0)
|
|
1057 for (i = 0; i < win->w_lines_valid; ++i)
|
|
1058 if (win->w_lines[i].wl_valid)
|
|
1059 {
|
|
1060 if (lnum < win->w_lines[i].wl_lnum)
|
|
1061 return -1;
|
|
1062 if (lnum <= win->w_lines[i].wl_lastlnum)
|
|
1063 return i;
|
|
1064 }
|
|
1065 return -1;
|
|
1066 }
|
|
1067
|
|
1068 /* foldAdjustVisual() {{{2 */
|
|
1069 #ifdef FEAT_VISUAL
|
|
1070 /*
|
|
1071 * Adjust the Visual area to include any fold at the start or end completely.
|
|
1072 */
|
|
1073 void
|
|
1074 foldAdjustVisual()
|
|
1075 {
|
|
1076 pos_T *start, *end;
|
|
1077 char_u *ptr;
|
|
1078
|
|
1079 if (!VIsual_active || !hasAnyFolding(curwin))
|
|
1080 return;
|
|
1081
|
|
1082 if (ltoreq(VIsual, curwin->w_cursor))
|
|
1083 {
|
|
1084 start = &VIsual;
|
|
1085 end = &curwin->w_cursor;
|
|
1086 }
|
|
1087 else
|
|
1088 {
|
|
1089 start = &curwin->w_cursor;
|
|
1090 end = &VIsual;
|
|
1091 }
|
|
1092 if (hasFolding(start->lnum, &start->lnum, NULL))
|
|
1093 start->col = 0;
|
|
1094 if (hasFolding(end->lnum, NULL, &end->lnum))
|
|
1095 {
|
|
1096 ptr = ml_get(end->lnum);
|
|
1097 end->col = (colnr_T)STRLEN(ptr);
|
|
1098 if (end->col > 0 && *p_sel == 'o')
|
|
1099 --end->col;
|
|
1100 #ifdef FEAT_MBYTE
|
|
1101 /* prevent cursor from moving on the trail byte */
|
|
1102 if (has_mbyte)
|
|
1103 mb_adjust_cursor();
|
|
1104 #endif
|
|
1105 }
|
|
1106 }
|
|
1107 #endif
|
|
1108
|
|
1109 /* cursor_foldstart() {{{2 */
|
|
1110 /*
|
|
1111 * Move the cursor to the first line of a closed fold.
|
|
1112 */
|
|
1113 void
|
|
1114 foldAdjustCursor()
|
|
1115 {
|
|
1116 (void)hasFolding(curwin->w_cursor.lnum, &curwin->w_cursor.lnum, NULL);
|
|
1117 }
|
|
1118
|
|
1119 /* Internal functions for "fold_T" {{{1 */
|
|
1120 /* cloneFoldGrowArray() {{{2 */
|
|
1121 /*
|
|
1122 * Will "clone" (i.e deep copy) a garray_T of folds.
|
|
1123 *
|
|
1124 * Return FAIL if the operation cannot be completed, otherwise OK.
|
|
1125 */
|
|
1126 void
|
|
1127 cloneFoldGrowArray(from, to)
|
|
1128 garray_T *from;
|
|
1129 garray_T *to;
|
|
1130 {
|
|
1131 int i;
|
|
1132 fold_T *from_p;
|
|
1133 fold_T *to_p;
|
|
1134
|
|
1135 ga_init2(to, from->ga_itemsize, from->ga_growsize);
|
|
1136 if (from->ga_len == 0 || ga_grow(to, from->ga_len) == FAIL)
|
|
1137 return;
|
|
1138
|
|
1139 from_p = (fold_T *)from->ga_data;
|
|
1140 to_p = (fold_T *)to->ga_data;
|
|
1141
|
|
1142 for (i = 0; i < from->ga_len; i++)
|
|
1143 {
|
|
1144 to_p->fd_top = from_p->fd_top;
|
|
1145 to_p->fd_len = from_p->fd_len;
|
|
1146 to_p->fd_flags = from_p->fd_flags;
|
|
1147 to_p->fd_small = from_p->fd_small;
|
|
1148 cloneFoldGrowArray(&from_p->fd_nested, &to_p->fd_nested);
|
|
1149 ++to->ga_len;
|
|
1150 ++from_p;
|
|
1151 ++to_p;
|
|
1152 }
|
|
1153 }
|
|
1154
|
|
1155 /* foldFind() {{{2 */
|
|
1156 /*
|
|
1157 * Search for line "lnum" in folds of growarray "gap".
|
|
1158 * Set *fpp to the fold struct for the fold that contains "lnum" or
|
|
1159 * the first fold below it (careful: it can be beyond the end of the array!).
|
|
1160 * Returns FALSE when there is no fold that contains "lnum".
|
|
1161 */
|
|
1162 static int
|
|
1163 foldFind(gap, lnum, fpp)
|
|
1164 garray_T *gap;
|
|
1165 linenr_T lnum;
|
|
1166 fold_T **fpp;
|
|
1167 {
|
|
1168 linenr_T low, high;
|
|
1169 fold_T *fp;
|
|
1170 int i;
|
|
1171
|
|
1172 /*
|
|
1173 * Perform a binary search.
|
|
1174 * "low" is lowest index of possible match.
|
|
1175 * "high" is highest index of possible match.
|
|
1176 */
|
|
1177 fp = (fold_T *)gap->ga_data;
|
|
1178 low = 0;
|
|
1179 high = gap->ga_len - 1;
|
|
1180 while (low <= high)
|
|
1181 {
|
|
1182 i = (low + high) / 2;
|
|
1183 if (fp[i].fd_top > lnum)
|
|
1184 /* fold below lnum, adjust high */
|
|
1185 high = i - 1;
|
|
1186 else if (fp[i].fd_top + fp[i].fd_len <= lnum)
|
|
1187 /* fold above lnum, adjust low */
|
|
1188 low = i + 1;
|
|
1189 else
|
|
1190 {
|
|
1191 /* lnum is inside this fold */
|
|
1192 *fpp = fp + i;
|
|
1193 return TRUE;
|
|
1194 }
|
|
1195 }
|
|
1196 *fpp = fp + low;
|
|
1197 return FALSE;
|
|
1198 }
|
|
1199
|
|
1200 /* foldLevelWin() {{{2 */
|
|
1201 /*
|
|
1202 * Return fold level at line number "lnum" in window "wp".
|
|
1203 */
|
|
1204 static int
|
|
1205 foldLevelWin(wp, lnum)
|
|
1206 win_T *wp;
|
|
1207 linenr_T lnum;
|
|
1208 {
|
|
1209 fold_T *fp;
|
|
1210 linenr_T lnum_rel = lnum;
|
|
1211 int level = 0;
|
|
1212 garray_T *gap;
|
|
1213
|
|
1214 /* Recursively search for a fold that contains "lnum". */
|
|
1215 gap = &wp->w_folds;
|
|
1216 for (;;)
|
|
1217 {
|
|
1218 if (!foldFind(gap, lnum_rel, &fp))
|
|
1219 break;
|
|
1220 /* Check nested folds. Line number is relative to containing fold. */
|
|
1221 gap = &fp->fd_nested;
|
|
1222 lnum_rel -= fp->fd_top;
|
|
1223 ++level;
|
|
1224 }
|
|
1225
|
|
1226 return level;
|
|
1227 }
|
|
1228
|
|
1229 /* checkupdate() {{{2 */
|
|
1230 /*
|
|
1231 * Check if the folds in window "wp" are invalid and update them if needed.
|
|
1232 */
|
|
1233 static void
|
|
1234 checkupdate(wp)
|
|
1235 win_T *wp;
|
|
1236 {
|
|
1237 if (wp->w_foldinvalid)
|
|
1238 {
|
|
1239 foldUpdate(wp, (linenr_T)1, (linenr_T)MAXLNUM); /* will update all */
|
|
1240 wp->w_foldinvalid = FALSE;
|
|
1241 }
|
|
1242 }
|
|
1243
|
|
1244 /* setFoldRepeat() {{{2 */
|
|
1245 /*
|
|
1246 * Open or close fold for current window at line "lnum".
|
|
1247 * Repeat "count" times.
|
|
1248 */
|
|
1249 static void
|
1757
|
1250 setFoldRepeat(lnum, count, do_open)
|
7
|
1251 linenr_T lnum;
|
|
1252 long count;
|
1757
|
1253 int do_open;
|
7
|
1254 {
|
|
1255 int done;
|
|
1256 long n;
|
|
1257
|
|
1258 for (n = 0; n < count; ++n)
|
|
1259 {
|
|
1260 done = DONE_NOTHING;
|
1757
|
1261 (void)setManualFold(lnum, do_open, FALSE, &done);
|
7
|
1262 if (!(done & DONE_ACTION))
|
|
1263 {
|
|
1264 /* Only give an error message when no fold could be opened. */
|
|
1265 if (n == 0 && !(done & DONE_FOLD))
|
|
1266 EMSG(_(e_nofold));
|
|
1267 break;
|
|
1268 }
|
|
1269 }
|
|
1270 }
|
|
1271
|
|
1272 /* setManualFold() {{{2 */
|
|
1273 /*
|
|
1274 * Open or close the fold in the current window which contains "lnum".
|
|
1275 * Also does this for other windows in diff mode when needed.
|
|
1276 */
|
|
1277 static linenr_T
|
|
1278 setManualFold(lnum, opening, recurse, donep)
|
|
1279 linenr_T lnum;
|
|
1280 int opening; /* TRUE when opening, FALSE when closing */
|
|
1281 int recurse; /* TRUE when closing/opening recursive */
|
|
1282 int *donep;
|
|
1283 {
|
|
1284 #ifdef FEAT_DIFF
|
|
1285 if (foldmethodIsDiff(curwin) && curwin->w_p_scb)
|
|
1286 {
|
|
1287 win_T *wp;
|
|
1288 linenr_T dlnum;
|
|
1289
|
|
1290 /*
|
|
1291 * Do the same operation in other windows in diff mode. Calculate the
|
|
1292 * line number from the diffs.
|
|
1293 */
|
|
1294 FOR_ALL_WINDOWS(wp)
|
|
1295 {
|
|
1296 if (wp != curwin && foldmethodIsDiff(wp) && wp->w_p_scb)
|
|
1297 {
|
|
1298 dlnum = diff_lnum_win(curwin->w_cursor.lnum, wp);
|
|
1299 if (dlnum != 0)
|
|
1300 (void)setManualFoldWin(wp, dlnum, opening, recurse, NULL);
|
|
1301 }
|
|
1302 }
|
|
1303 }
|
|
1304 #endif
|
|
1305
|
|
1306 return setManualFoldWin(curwin, lnum, opening, recurse, donep);
|
|
1307 }
|
|
1308
|
|
1309 /* setManualFoldWin() {{{2 */
|
|
1310 /*
|
|
1311 * Open or close the fold in window "wp" which contains "lnum".
|
|
1312 * "donep", when not NULL, points to flag that is set to DONE_FOLD when some
|
|
1313 * fold was found and to DONE_ACTION when some fold was opened or closed.
|
|
1314 * When "donep" is NULL give an error message when no fold was found for
|
|
1315 * "lnum", but only if "wp" is "curwin".
|
|
1316 * Return the line number of the next line that could be closed.
|
|
1317 * It's only valid when "opening" is TRUE!
|
|
1318 */
|
|
1319 static linenr_T
|
|
1320 setManualFoldWin(wp, lnum, opening, recurse, donep)
|
|
1321 win_T *wp;
|
|
1322 linenr_T lnum;
|
|
1323 int opening; /* TRUE when opening, FALSE when closing */
|
|
1324 int recurse; /* TRUE when closing/opening recursive */
|
|
1325 int *donep;
|
|
1326 {
|
|
1327 fold_T *fp;
|
|
1328 fold_T *fp2;
|
|
1329 fold_T *found = NULL;
|
|
1330 int j;
|
|
1331 int level = 0;
|
|
1332 int use_level = FALSE;
|
|
1333 int found_fold = FALSE;
|
|
1334 garray_T *gap;
|
|
1335 linenr_T next = MAXLNUM;
|
|
1336 linenr_T off = 0;
|
|
1337 int done = 0;
|
|
1338
|
|
1339 checkupdate(wp);
|
|
1340
|
|
1341 /*
|
|
1342 * Find the fold, open or close it.
|
|
1343 */
|
|
1344 gap = &wp->w_folds;
|
|
1345 for (;;)
|
|
1346 {
|
|
1347 if (!foldFind(gap, lnum, &fp))
|
|
1348 {
|
|
1349 /* If there is a following fold, continue there next time. */
|
|
1350 if (fp < (fold_T *)gap->ga_data + gap->ga_len)
|
|
1351 next = fp->fd_top + off;
|
|
1352 break;
|
|
1353 }
|
|
1354
|
|
1355 /* lnum is inside this fold */
|
|
1356 found_fold = TRUE;
|
|
1357
|
|
1358 /* If there is a following fold, continue there next time. */
|
|
1359 if (fp + 1 < (fold_T *)gap->ga_data + gap->ga_len)
|
|
1360 next = fp[1].fd_top + off;
|
|
1361
|
|
1362 /* Change from level-dependent folding to manual. */
|
|
1363 if (use_level || fp->fd_flags == FD_LEVEL)
|
|
1364 {
|
|
1365 use_level = TRUE;
|
|
1366 if (level >= wp->w_p_fdl)
|
|
1367 fp->fd_flags = FD_CLOSED;
|
|
1368 else
|
|
1369 fp->fd_flags = FD_OPEN;
|
|
1370 fp2 = (fold_T *)fp->fd_nested.ga_data;
|
|
1371 for (j = 0; j < fp->fd_nested.ga_len; ++j)
|
|
1372 fp2[j].fd_flags = FD_LEVEL;
|
|
1373 }
|
|
1374
|
|
1375 /* Simple case: Close recursively means closing the fold. */
|
|
1376 if (!opening && recurse)
|
|
1377 {
|
|
1378 if (fp->fd_flags != FD_CLOSED)
|
|
1379 {
|
|
1380 done |= DONE_ACTION;
|
|
1381 fp->fd_flags = FD_CLOSED;
|
|
1382 }
|
|
1383 }
|
|
1384 else if (fp->fd_flags == FD_CLOSED)
|
|
1385 {
|
|
1386 /* When opening, open topmost closed fold. */
|
|
1387 if (opening)
|
|
1388 {
|
|
1389 fp->fd_flags = FD_OPEN;
|
|
1390 done |= DONE_ACTION;
|
|
1391 if (recurse)
|
|
1392 foldOpenNested(fp);
|
|
1393 }
|
|
1394 break;
|
|
1395 }
|
|
1396
|
|
1397 /* fold is open, check nested folds */
|
|
1398 found = fp;
|
|
1399 gap = &fp->fd_nested;
|
|
1400 lnum -= fp->fd_top;
|
|
1401 off += fp->fd_top;
|
|
1402 ++level;
|
|
1403 }
|
|
1404 if (found_fold)
|
|
1405 {
|
|
1406 /* When closing and not recurse, close deepest open fold. */
|
|
1407 if (!opening && found != NULL)
|
|
1408 {
|
|
1409 found->fd_flags = FD_CLOSED;
|
|
1410 done |= DONE_ACTION;
|
|
1411 }
|
|
1412 wp->w_fold_manual = TRUE;
|
|
1413 if (done & DONE_ACTION)
|
|
1414 changed_window_setting_win(wp);
|
|
1415 done |= DONE_FOLD;
|
|
1416 }
|
|
1417 else if (donep == NULL && wp == curwin)
|
|
1418 EMSG(_(e_nofold));
|
|
1419
|
|
1420 if (donep != NULL)
|
|
1421 *donep |= done;
|
|
1422
|
|
1423 return next;
|
|
1424 }
|
|
1425
|
|
1426 /* foldOpenNested() {{{2 */
|
|
1427 /*
|
|
1428 * Open all nested folds in fold "fpr" recursively.
|
|
1429 */
|
|
1430 static void
|
|
1431 foldOpenNested(fpr)
|
|
1432 fold_T *fpr;
|
|
1433 {
|
|
1434 int i;
|
|
1435 fold_T *fp;
|
|
1436
|
|
1437 fp = (fold_T *)fpr->fd_nested.ga_data;
|
|
1438 for (i = 0; i < fpr->fd_nested.ga_len; ++i)
|
|
1439 {
|
|
1440 foldOpenNested(&fp[i]);
|
|
1441 fp[i].fd_flags = FD_OPEN;
|
|
1442 }
|
|
1443 }
|
|
1444
|
|
1445 /* deleteFoldEntry() {{{2 */
|
|
1446 /*
|
|
1447 * Delete fold "idx" from growarray "gap".
|
|
1448 * When "recursive" is TRUE also delete all the folds contained in it.
|
|
1449 * When "recursive" is FALSE contained folds are moved one level up.
|
|
1450 */
|
|
1451 static void
|
|
1452 deleteFoldEntry(gap, idx, recursive)
|
|
1453 garray_T *gap;
|
|
1454 int idx;
|
|
1455 int recursive;
|
|
1456 {
|
|
1457 fold_T *fp;
|
|
1458 int i;
|
|
1459 long moved;
|
|
1460 fold_T *nfp;
|
|
1461
|
|
1462 fp = (fold_T *)gap->ga_data + idx;
|
|
1463 if (recursive || fp->fd_nested.ga_len == 0)
|
|
1464 {
|
|
1465 /* recursively delete the contained folds */
|
|
1466 deleteFoldRecurse(&fp->fd_nested);
|
|
1467 --gap->ga_len;
|
|
1468 if (idx < gap->ga_len)
|
|
1469 mch_memmove(fp, fp + 1, sizeof(fold_T) * (gap->ga_len - idx));
|
|
1470 }
|
|
1471 else
|
|
1472 {
|
|
1473 /* move nested folds one level up, to overwrite the fold that is
|
|
1474 * deleted. */
|
|
1475 moved = fp->fd_nested.ga_len;
|
|
1476 if (ga_grow(gap, (int)(moved - 1)) == OK)
|
|
1477 {
|
|
1478 /* adjust fd_top and fd_flags for the moved folds */
|
|
1479 nfp = (fold_T *)fp->fd_nested.ga_data;
|
|
1480 for (i = 0; i < moved; ++i)
|
|
1481 {
|
|
1482 nfp[i].fd_top += fp->fd_top;
|
|
1483 if (fp->fd_flags == FD_LEVEL)
|
|
1484 nfp[i].fd_flags = FD_LEVEL;
|
|
1485 if (fp->fd_small == MAYBE)
|
|
1486 nfp[i].fd_small = MAYBE;
|
|
1487 }
|
|
1488
|
|
1489 /* move the existing folds down to make room */
|
|
1490 if (idx < gap->ga_len)
|
|
1491 mch_memmove(fp + moved, fp + 1,
|
|
1492 sizeof(fold_T) * (gap->ga_len - idx));
|
|
1493 /* move the contained folds one level up */
|
|
1494 mch_memmove(fp, nfp, (size_t)(sizeof(fold_T) * moved));
|
|
1495 vim_free(nfp);
|
|
1496 gap->ga_len += moved - 1;
|
|
1497 }
|
|
1498 }
|
|
1499 }
|
|
1500
|
|
1501 /* deleteFoldRecurse() {{{2 */
|
|
1502 /*
|
|
1503 * Delete nested folds in a fold.
|
|
1504 */
|
|
1505 void
|
|
1506 deleteFoldRecurse(gap)
|
|
1507 garray_T *gap;
|
|
1508 {
|
|
1509 int i;
|
|
1510
|
|
1511 for (i = 0; i < gap->ga_len; ++i)
|
|
1512 deleteFoldRecurse(&(((fold_T *)(gap->ga_data))[i].fd_nested));
|
|
1513 ga_clear(gap);
|
|
1514 }
|
|
1515
|
|
1516 /* foldMarkAdjust() {{{2 */
|
|
1517 /*
|
|
1518 * Update line numbers of folds for inserted/deleted lines.
|
|
1519 */
|
|
1520 void
|
|
1521 foldMarkAdjust(wp, line1, line2, amount, amount_after)
|
|
1522 win_T *wp;
|
|
1523 linenr_T line1;
|
|
1524 linenr_T line2;
|
|
1525 long amount;
|
|
1526 long amount_after;
|
|
1527 {
|
|
1528 /* If deleting marks from line1 to line2, but not deleting all those
|
|
1529 * lines, set line2 so that only deleted lines have their folds removed. */
|
|
1530 if (amount == MAXLNUM && line2 >= line1 && line2 - line1 >= -amount_after)
|
|
1531 line2 = line1 - amount_after - 1;
|
|
1532 /* If appending a line in Insert mode, it should be included in the fold
|
|
1533 * just above the line. */
|
|
1534 if ((State & INSERT) && amount == (linenr_T)1 && line2 == MAXLNUM)
|
|
1535 --line1;
|
|
1536 foldMarkAdjustRecurse(&wp->w_folds, line1, line2, amount, amount_after);
|
|
1537 }
|
|
1538
|
|
1539 /* foldMarkAdjustRecurse() {{{2 */
|
|
1540 static void
|
|
1541 foldMarkAdjustRecurse(gap, line1, line2, amount, amount_after)
|
|
1542 garray_T *gap;
|
|
1543 linenr_T line1;
|
|
1544 linenr_T line2;
|
|
1545 long amount;
|
|
1546 long amount_after;
|
|
1547 {
|
|
1548 fold_T *fp;
|
|
1549 int i;
|
|
1550 linenr_T last;
|
|
1551 linenr_T top;
|
|
1552
|
|
1553 /* In Insert mode an inserted line at the top of a fold is considered part
|
|
1554 * of the fold, otherwise it isn't. */
|
|
1555 if ((State & INSERT) && amount == (linenr_T)1 && line2 == MAXLNUM)
|
|
1556 top = line1 + 1;
|
|
1557 else
|
|
1558 top = line1;
|
|
1559
|
|
1560 /* Find the fold containing or just below "line1". */
|
|
1561 (void)foldFind(gap, line1, &fp);
|
|
1562
|
|
1563 /*
|
|
1564 * Adjust all folds below "line1" that are affected.
|
|
1565 */
|
|
1566 for (i = (int)(fp - (fold_T *)gap->ga_data); i < gap->ga_len; ++i, ++fp)
|
|
1567 {
|
|
1568 /*
|
|
1569 * Check for these situations:
|
|
1570 * 1 2 3
|
|
1571 * 1 2 3
|
|
1572 * line1 2 3 4 5
|
|
1573 * 2 3 4 5
|
|
1574 * 2 3 4 5
|
|
1575 * line2 2 3 4 5
|
|
1576 * 3 5 6
|
|
1577 * 3 5 6
|
|
1578 */
|
|
1579
|
|
1580 last = fp->fd_top + fp->fd_len - 1; /* last line of fold */
|
|
1581
|
|
1582 /* 1. fold completely above line1: nothing to do */
|
|
1583 if (last < line1)
|
|
1584 continue;
|
|
1585
|
|
1586 /* 6. fold below line2: only adjust for amount_after */
|
|
1587 if (fp->fd_top > line2)
|
|
1588 {
|
|
1589 if (amount_after == 0)
|
|
1590 break;
|
|
1591 fp->fd_top += amount_after;
|
|
1592 }
|
|
1593 else
|
|
1594 {
|
|
1595 if (fp->fd_top >= top && last <= line2)
|
|
1596 {
|
|
1597 /* 4. fold completely contained in range */
|
|
1598 if (amount == MAXLNUM)
|
|
1599 {
|
|
1600 /* Deleting lines: delete the fold completely */
|
|
1601 deleteFoldEntry(gap, i, TRUE);
|
|
1602 --i; /* adjust index for deletion */
|
|
1603 --fp;
|
|
1604 }
|
|
1605 else
|
|
1606 fp->fd_top += amount;
|
|
1607 }
|
|
1608 else
|
|
1609 {
|
|
1610 /* 2, 3, or 5: need to correct nested folds too */
|
|
1611 foldMarkAdjustRecurse(&fp->fd_nested, line1 - fp->fd_top,
|
|
1612 line2 - fp->fd_top, amount, amount_after);
|
|
1613 if (fp->fd_top < top)
|
|
1614 {
|
|
1615 if (last <= line2)
|
|
1616 {
|
|
1617 /* 2. fold contains line1, line2 is below fold */
|
|
1618 if (amount == MAXLNUM)
|
|
1619 fp->fd_len = line1 - fp->fd_top;
|
|
1620 else
|
|
1621 fp->fd_len += amount;
|
|
1622 }
|
|
1623 else
|
|
1624 {
|
|
1625 /* 3. fold contains line1 and line2 */
|
|
1626 fp->fd_len += amount_after;
|
|
1627 }
|
|
1628 }
|
|
1629 else
|
|
1630 {
|
|
1631 /* 5. fold is below line1 and contains line2 */
|
|
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;
|
|
1927
|
|
1928 #ifdef FEAT_EVAL
|
|
1929 if (*wp->w_p_fdt != NUL)
|
|
1930 {
|
|
1931 char_u dashes[51];
|
|
1932 win_T *save_curwin;
|
|
1933 int level;
|
|
1934 char_u *p;
|
|
1935
|
|
1936 /* Set "v:foldstart" and "v:foldend". */
|
|
1937 set_vim_var_nr(VV_FOLDSTART, lnum);
|
|
1938 set_vim_var_nr(VV_FOLDEND, lnume);
|
|
1939
|
|
1940 /* Set "v:folddashes" to a string of "level" dashes. */
|
|
1941 /* Set "v:foldlevel" to "level". */
|
|
1942 level = foldinfo->fi_level;
|
|
1943 if (level > 50)
|
|
1944 level = 50;
|
|
1945 vim_memset(dashes, '-', (size_t)level);
|
|
1946 dashes[level] = NUL;
|
|
1947 set_vim_var_string(VV_FOLDDASHES, dashes, -1);
|
|
1948 set_vim_var_nr(VV_FOLDLEVEL, (long)level);
|
|
1949 save_curwin = curwin;
|
|
1950 curwin = wp;
|
|
1951 curbuf = wp->w_buffer;
|
|
1952
|
|
1953 ++emsg_off;
|
634
|
1954 text = eval_to_string_safe(wp->w_p_fdt, NULL,
|
681
|
1955 was_set_insecurely((char_u *)"foldtext", OPT_LOCAL));
|
29
|
1956 --emsg_off;
|
|
1957
|
|
1958 curwin = save_curwin;
|
|
1959 curbuf = curwin->w_buffer;
|
|
1960 set_vim_var_string(VV_FOLDDASHES, NULL, -1);
|
|
1961
|
|
1962 if (text != NULL)
|
|
1963 {
|
|
1964 /* Replace unprintable characters, if there are any. But
|
|
1965 * replace a TAB with a space. */
|
|
1966 for (p = text; *p != NUL; ++p)
|
|
1967 {
|
|
1968 # ifdef FEAT_MBYTE
|
33
|
1969 int len;
|
|
1970
|
474
|
1971 if (has_mbyte && (len = (*mb_ptr2len)(p)) > 1)
|
29
|
1972 {
|
|
1973 if (!vim_isprintc((*mb_ptr2char)(p)))
|
|
1974 break;
|
|
1975 p += len - 1;
|
|
1976 }
|
|
1977 else
|
|
1978 # endif
|
|
1979 if (*p == TAB)
|
|
1980 *p = ' ';
|
|
1981 else if (ptr2cells(p) > 1)
|
|
1982 break;
|
|
1983 }
|
|
1984 if (*p != NUL)
|
|
1985 {
|
|
1986 p = transstr(text);
|
|
1987 vim_free(text);
|
|
1988 text = p;
|
|
1989 }
|
|
1990 }
|
|
1991 }
|
|
1992 if (text == NULL)
|
|
1993 #endif
|
|
1994 {
|
|
1995 sprintf((char *)buf, _("+--%3ld lines folded "),
|
|
1996 (long)(lnume - lnum + 1));
|
|
1997 text = buf;
|
|
1998 }
|
|
1999 return text;
|
|
2000 }
|
|
2001
|
7
|
2002 /* foldtext_cleanup() {{{2 */
|
|
2003 /*
|
|
2004 * Remove 'foldmarker' and 'commentstring' from "str" (in-place).
|
|
2005 */
|
|
2006 void
|
|
2007 foldtext_cleanup(str)
|
|
2008 char_u *str;
|
|
2009 {
|
|
2010 char_u *cms_start; /* first part or the whole comment */
|
|
2011 int cms_slen = 0; /* length of cms_start */
|
|
2012 char_u *cms_end; /* last part of the comment or NULL */
|
|
2013 int cms_elen = 0; /* length of cms_end */
|
|
2014 char_u *s;
|
45
|
2015 char_u *p;
|
7
|
2016 int len;
|
|
2017 int did1 = FALSE;
|
|
2018 int did2 = FALSE;
|
|
2019
|
|
2020 /* Ignore leading and trailing white space in 'commentstring'. */
|
|
2021 cms_start = skipwhite(curbuf->b_p_cms);
|
835
|
2022 cms_slen = (int)STRLEN(cms_start);
|
7
|
2023 while (cms_slen > 0 && vim_iswhite(cms_start[cms_slen - 1]))
|
|
2024 --cms_slen;
|
|
2025
|
|
2026 /* locate "%s" in 'commentstring', use the part before and after it. */
|
|
2027 cms_end = (char_u *)strstr((char *)cms_start, "%s");
|
|
2028 if (cms_end != NULL)
|
|
2029 {
|
835
|
2030 cms_elen = cms_slen - (int)(cms_end - cms_start);
|
|
2031 cms_slen = (int)(cms_end - cms_start);
|
7
|
2032
|
|
2033 /* exclude white space before "%s" */
|
|
2034 while (cms_slen > 0 && vim_iswhite(cms_start[cms_slen - 1]))
|
|
2035 --cms_slen;
|
|
2036
|
|
2037 /* skip "%s" and white space after it */
|
|
2038 s = skipwhite(cms_end + 2);
|
835
|
2039 cms_elen -= (int)(s - cms_end);
|
7
|
2040 cms_end = s;
|
|
2041 }
|
|
2042 parseMarker(curwin);
|
|
2043
|
|
2044 for (s = str; *s != NUL; )
|
|
2045 {
|
|
2046 len = 0;
|
|
2047 if (STRNCMP(s, curwin->w_p_fmr, foldstartmarkerlen) == 0)
|
45
|
2048 len = foldstartmarkerlen;
|
|
2049 else if (STRNCMP(s, foldendmarker, foldendmarkerlen) == 0)
|
|
2050 len = foldendmarkerlen;
|
|
2051 if (len > 0)
|
7
|
2052 {
|
|
2053 if (VIM_ISDIGIT(s[len]))
|
|
2054 ++len;
|
45
|
2055
|
|
2056 /* May remove 'commentstring' start. Useful when it's a double
|
|
2057 * quote and we already removed a double quote. */
|
|
2058 for (p = s; p > str && vim_iswhite(p[-1]); --p)
|
|
2059 ;
|
|
2060 if (p >= str + cms_slen
|
|
2061 && STRNCMP(p - cms_slen, cms_start, cms_slen) == 0)
|
|
2062 {
|
835
|
2063 len += (int)(s - p) + cms_slen;
|
45
|
2064 s = p - cms_slen;
|
|
2065 }
|
7
|
2066 }
|
|
2067 else if (cms_end != NULL)
|
|
2068 {
|
45
|
2069 if (!did1 && cms_slen > 0 && STRNCMP(s, cms_start, cms_slen) == 0)
|
7
|
2070 {
|
|
2071 len = cms_slen;
|
|
2072 did1 = TRUE;
|
|
2073 }
|
45
|
2074 else if (!did2 && cms_elen > 0
|
|
2075 && STRNCMP(s, cms_end, cms_elen) == 0)
|
7
|
2076 {
|
|
2077 len = cms_elen;
|
|
2078 did2 = TRUE;
|
|
2079 }
|
|
2080 }
|
|
2081 if (len != 0)
|
|
2082 {
|
|
2083 while (vim_iswhite(s[len]))
|
|
2084 ++len;
|
1624
|
2085 STRMOVE(s, s + len);
|
7
|
2086 }
|
|
2087 else
|
|
2088 {
|
39
|
2089 mb_ptr_adv(s);
|
7
|
2090 }
|
|
2091 }
|
|
2092 }
|
|
2093
|
|
2094 /* Folding by indent, expr, marker and syntax. {{{1 */
|
|
2095 /* Define "fline_T", passed to get fold level for a line. {{{2 */
|
|
2096 typedef struct
|
|
2097 {
|
|
2098 win_T *wp; /* window */
|
|
2099 linenr_T lnum; /* current line number */
|
|
2100 linenr_T off; /* offset between lnum and real line number */
|
|
2101 linenr_T lnum_save; /* line nr used by foldUpdateIEMSRecurse() */
|
|
2102 int lvl; /* current level (-1 for undefined) */
|
|
2103 int lvl_next; /* level used for next line */
|
|
2104 int start; /* number of folds that are forced to start at
|
|
2105 this line. */
|
|
2106 int end; /* level of fold that is forced to end below
|
|
2107 this line */
|
|
2108 int had_end; /* level of fold that is forced to end above
|
|
2109 this line (copy of "end" of prev. line) */
|
|
2110 } fline_T;
|
|
2111
|
|
2112 /* Flag is set when redrawing is needed. */
|
|
2113 static int fold_changed;
|
|
2114
|
|
2115 /* Function declarations. {{{2 */
|
|
2116 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));
|
|
2117 static int foldInsert __ARGS((garray_T *gap, int i));
|
|
2118 static void foldSplit __ARGS((garray_T *gap, int i, linenr_T top, linenr_T bot));
|
|
2119 static void foldRemove __ARGS((garray_T *gap, linenr_T top, linenr_T bot));
|
|
2120 static void foldMerge __ARGS((fold_T *fp1, garray_T *gap, fold_T *fp2));
|
|
2121 static void foldlevelIndent __ARGS((fline_T *flp));
|
|
2122 #ifdef FEAT_DIFF
|
|
2123 static void foldlevelDiff __ARGS((fline_T *flp));
|
|
2124 #endif
|
|
2125 static void foldlevelExpr __ARGS((fline_T *flp));
|
|
2126 static void foldlevelMarker __ARGS((fline_T *flp));
|
|
2127 static void foldlevelSyntax __ARGS((fline_T *flp));
|
|
2128
|
|
2129 /* foldUpdateIEMS() {{{2 */
|
|
2130 /*
|
|
2131 * Update the folding for window "wp", at least from lines "top" to "bot".
|
|
2132 * Return TRUE if any folds did change.
|
|
2133 */
|
|
2134 static void
|
|
2135 foldUpdateIEMS(wp, top, bot)
|
|
2136 win_T *wp;
|
|
2137 linenr_T top;
|
|
2138 linenr_T bot;
|
|
2139 {
|
|
2140 linenr_T start;
|
|
2141 linenr_T end;
|
|
2142 fline_T fline;
|
|
2143 void (*getlevel)__ARGS((fline_T *));
|
|
2144 int level;
|
|
2145 fold_T *fp;
|
|
2146
|
|
2147 /* Avoid problems when being called recursively. */
|
|
2148 if (invalid_top != (linenr_T)0)
|
|
2149 return;
|
|
2150
|
|
2151 if (wp->w_foldinvalid)
|
|
2152 {
|
|
2153 /* Need to update all folds. */
|
|
2154 top = 1;
|
|
2155 bot = wp->w_buffer->b_ml.ml_line_count;
|
|
2156 wp->w_foldinvalid = FALSE;
|
|
2157
|
|
2158 /* Mark all folds a maybe-small. */
|
|
2159 setSmallMaybe(&wp->w_folds);
|
|
2160 }
|
|
2161
|
|
2162 #ifdef FEAT_DIFF
|
|
2163 /* add the context for "diff" folding */
|
|
2164 if (foldmethodIsDiff(wp))
|
|
2165 {
|
|
2166 if (top > diff_context)
|
|
2167 top -= diff_context;
|
|
2168 else
|
|
2169 top = 1;
|
|
2170 bot += diff_context;
|
|
2171 }
|
|
2172 #endif
|
|
2173
|
|
2174 /* When deleting lines at the end of the buffer "top" can be past the end
|
|
2175 * of the buffer. */
|
|
2176 if (top > wp->w_buffer->b_ml.ml_line_count)
|
|
2177 top = wp->w_buffer->b_ml.ml_line_count;
|
|
2178
|
|
2179 fold_changed = FALSE;
|
|
2180 fline.wp = wp;
|
|
2181 fline.off = 0;
|
|
2182 fline.lvl = 0;
|
|
2183 fline.lvl_next = -1;
|
|
2184 fline.start = 0;
|
|
2185 fline.end = MAX_LEVEL + 1;
|
|
2186 fline.had_end = MAX_LEVEL + 1;
|
|
2187
|
|
2188 invalid_top = top;
|
|
2189 invalid_bot = bot;
|
|
2190
|
|
2191 if (foldmethodIsMarker(wp))
|
|
2192 {
|
|
2193 getlevel = foldlevelMarker;
|
|
2194
|
|
2195 /* Init marker variables to speed up foldlevelMarker(). */
|
|
2196 parseMarker(wp);
|
|
2197
|
|
2198 /* Need to get the level of the line above top, it is used if there is
|
|
2199 * no marker at the top. */
|
|
2200 if (top > 1)
|
|
2201 {
|
|
2202 /* Get the fold level at top - 1. */
|
|
2203 level = foldLevelWin(wp, top - 1);
|
|
2204
|
|
2205 /* The fold may end just above the top, check for that. */
|
|
2206 fline.lnum = top - 1;
|
|
2207 fline.lvl = level;
|
|
2208 getlevel(&fline);
|
|
2209
|
|
2210 /* If a fold started here, we already had the level, if it stops
|
|
2211 * here, we need to use lvl_next. Could also start and end a fold
|
|
2212 * in the same line. */
|
|
2213 if (fline.lvl > level)
|
|
2214 fline.lvl = level - (fline.lvl - fline.lvl_next);
|
|
2215 else
|
|
2216 fline.lvl = fline.lvl_next;
|
|
2217 }
|
|
2218 fline.lnum = top;
|
|
2219 getlevel(&fline);
|
|
2220 }
|
|
2221 else
|
|
2222 {
|
|
2223 fline.lnum = top;
|
|
2224 if (foldmethodIsExpr(wp))
|
|
2225 {
|
|
2226 getlevel = foldlevelExpr;
|
|
2227 /* start one line back, because a "<1" may indicate the end of a
|
|
2228 * fold in the topline */
|
|
2229 if (top > 1)
|
|
2230 --fline.lnum;
|
|
2231 }
|
|
2232 else if (foldmethodIsSyntax(wp))
|
|
2233 getlevel = foldlevelSyntax;
|
|
2234 #ifdef FEAT_DIFF
|
|
2235 else if (foldmethodIsDiff(wp))
|
|
2236 getlevel = foldlevelDiff;
|
|
2237 #endif
|
|
2238 else
|
|
2239 getlevel = foldlevelIndent;
|
|
2240
|
|
2241 /* Backup to a line for which the fold level is defined. Since it's
|
|
2242 * always defined for line one, we will stop there. */
|
|
2243 fline.lvl = -1;
|
|
2244 for ( ; !got_int; --fline.lnum)
|
|
2245 {
|
|
2246 /* Reset lvl_next each time, because it will be set to a value for
|
|
2247 * the next line, but we search backwards here. */
|
|
2248 fline.lvl_next = -1;
|
|
2249 getlevel(&fline);
|
|
2250 if (fline.lvl >= 0)
|
|
2251 break;
|
|
2252 }
|
|
2253 }
|
|
2254
|
|
2255 start = fline.lnum;
|
|
2256 end = bot;
|
|
2257 /* Do at least one line. */
|
|
2258 if (start > end && end < wp->w_buffer->b_ml.ml_line_count)
|
|
2259 end = start;
|
|
2260 while (!got_int)
|
|
2261 {
|
|
2262 /* Always stop at the end of the file ("end" can be past the end of
|
|
2263 * the file). */
|
|
2264 if (fline.lnum > wp->w_buffer->b_ml.ml_line_count)
|
|
2265 break;
|
|
2266 if (fline.lnum > end)
|
|
2267 {
|
|
2268 /* For "marker", "expr" and "syntax" methods: If a change caused
|
|
2269 * a fold to be removed, we need to continue at least until where
|
|
2270 * it ended. */
|
|
2271 if (getlevel != foldlevelMarker
|
|
2272 && getlevel != foldlevelSyntax
|
|
2273 && getlevel != foldlevelExpr)
|
|
2274 break;
|
|
2275 if ((start <= end
|
|
2276 && foldFind(&wp->w_folds, end, &fp)
|
|
2277 && fp->fd_top + fp->fd_len - 1 > end)
|
|
2278 || (fline.lvl == 0
|
|
2279 && foldFind(&wp->w_folds, fline.lnum, &fp)
|
|
2280 && fp->fd_top < fline.lnum))
|
|
2281 end = fp->fd_top + fp->fd_len - 1;
|
|
2282 else if (getlevel == foldlevelSyntax
|
|
2283 && foldLevelWin(wp, fline.lnum) != fline.lvl)
|
|
2284 /* For "syntax" method: Compare the foldlevel that the syntax
|
|
2285 * tells us to the foldlevel from the existing folds. If they
|
|
2286 * don't match continue updating folds. */
|
|
2287 end = fline.lnum;
|
|
2288 else
|
|
2289 break;
|
|
2290 }
|
|
2291
|
|
2292 /* A level 1 fold starts at a line with foldlevel > 0. */
|
|
2293 if (fline.lvl > 0)
|
|
2294 {
|
|
2295 invalid_top = fline.lnum;
|
|
2296 invalid_bot = end;
|
|
2297 end = foldUpdateIEMSRecurse(&wp->w_folds,
|
|
2298 1, start, &fline, getlevel, end, FD_LEVEL);
|
|
2299 start = fline.lnum;
|
|
2300 }
|
|
2301 else
|
|
2302 {
|
|
2303 if (fline.lnum == wp->w_buffer->b_ml.ml_line_count)
|
|
2304 break;
|
|
2305 ++fline.lnum;
|
|
2306 fline.lvl = fline.lvl_next;
|
|
2307 getlevel(&fline);
|
|
2308 }
|
|
2309 }
|
|
2310
|
|
2311 /* There can't be any folds from start until end now. */
|
|
2312 foldRemove(&wp->w_folds, start, end);
|
|
2313
|
|
2314 /* If some fold changed, need to redraw and position cursor. */
|
|
2315 if (fold_changed && wp->w_p_fen)
|
1554
|
2316 changed_window_setting_win(wp);
|
7
|
2317
|
|
2318 /* If we updated folds past "bot", need to redraw more lines. Don't do
|
|
2319 * this in other situations, the changed lines will be redrawn anyway and
|
|
2320 * this method can cause the whole window to be updated. */
|
|
2321 if (end != bot)
|
|
2322 {
|
|
2323 if (wp->w_redraw_top == 0 || wp->w_redraw_top > top)
|
|
2324 wp->w_redraw_top = top;
|
|
2325 if (wp->w_redraw_bot < end)
|
|
2326 wp->w_redraw_bot = end;
|
|
2327 }
|
|
2328
|
|
2329 invalid_top = (linenr_T)0;
|
|
2330 }
|
|
2331
|
|
2332 /* foldUpdateIEMSRecurse() {{{2 */
|
|
2333 /*
|
|
2334 * Update a fold that starts at "flp->lnum". At this line there is always a
|
|
2335 * valid foldlevel, and its level >= "level".
|
|
2336 * "flp" is valid for "flp->lnum" when called and it's valid when returning.
|
|
2337 * "flp->lnum" is set to the lnum just below the fold, if it ends before
|
|
2338 * "bot", it's "bot" plus one if the fold continues and it's bigger when using
|
|
2339 * the marker method and a text change made following folds to change.
|
|
2340 * When returning, "flp->lnum_save" is the line number that was used to get
|
|
2341 * the level when the level at "flp->lnum" is invalid.
|
|
2342 * Remove any folds from "startlnum" up to here at this level.
|
|
2343 * Recursively update nested folds.
|
|
2344 * Below line "bot" there are no changes in the text.
|
|
2345 * "flp->lnum", "flp->lnum_save" and "bot" are relative to the start of the
|
|
2346 * outer fold.
|
|
2347 * "flp->off" is the offset to the real line number in the buffer.
|
|
2348 *
|
|
2349 * All this would be a lot simpler if all folds in the range would be deleted
|
1698
|
2350 * and then created again. But we would lose all information about the
|
7
|
2351 * folds, even when making changes that don't affect the folding (e.g. "vj~").
|
|
2352 *
|
|
2353 * Returns bot, which may have been increased for lines that also need to be
|
|
2354 * updated as a result of a detected change in the fold.
|
|
2355 */
|
|
2356 static linenr_T
|
|
2357 foldUpdateIEMSRecurse(gap, level, startlnum, flp, getlevel, bot, topflags)
|
|
2358 garray_T *gap;
|
|
2359 int level;
|
|
2360 linenr_T startlnum;
|
|
2361 fline_T *flp;
|
|
2362 void (*getlevel)__ARGS((fline_T *));
|
|
2363 linenr_T bot;
|
|
2364 int topflags; /* flags used by containing fold */
|
|
2365 {
|
|
2366 linenr_T ll;
|
|
2367 fold_T *fp = NULL;
|
|
2368 fold_T *fp2;
|
|
2369 int lvl = level;
|
|
2370 linenr_T startlnum2 = startlnum;
|
|
2371 linenr_T firstlnum = flp->lnum; /* first lnum we got */
|
|
2372 int i;
|
|
2373 int finish = FALSE;
|
|
2374 linenr_T linecount = flp->wp->w_buffer->b_ml.ml_line_count - flp->off;
|
|
2375 int concat;
|
|
2376
|
|
2377 /*
|
|
2378 * If using the marker method, the start line is not the start of a fold
|
|
2379 * at the level we're dealing with and the level is non-zero, we must use
|
|
2380 * the previous fold. But ignore a fold that starts at or below
|
|
2381 * startlnum, it must be deleted.
|
|
2382 */
|
|
2383 if (getlevel == foldlevelMarker && flp->start <= flp->lvl - level
|
|
2384 && flp->lvl > 0)
|
|
2385 {
|
|
2386 foldFind(gap, startlnum - 1, &fp);
|
|
2387 if (fp >= ((fold_T *)gap->ga_data) + gap->ga_len
|
|
2388 || fp->fd_top >= startlnum)
|
|
2389 fp = NULL;
|
|
2390 }
|
|
2391
|
|
2392 /*
|
|
2393 * Loop over all lines in this fold, or until "bot" is hit.
|
|
2394 * Handle nested folds inside of this fold.
|
|
2395 * "flp->lnum" is the current line. When finding the end of the fold, it
|
|
2396 * is just below the end of the fold.
|
|
2397 * "*flp" contains the level of the line "flp->lnum" or a following one if
|
|
2398 * there are lines with an invalid fold level. "flp->lnum_save" is the
|
|
2399 * line number that was used to get the fold level (below "flp->lnum" when
|
|
2400 * it has an invalid fold level). When called the fold level is always
|
|
2401 * valid, thus "flp->lnum_save" is equal to "flp->lnum".
|
|
2402 */
|
|
2403 flp->lnum_save = flp->lnum;
|
|
2404 while (!got_int)
|
|
2405 {
|
|
2406 /* Updating folds can be slow, check for CTRL-C. */
|
|
2407 line_breakcheck();
|
|
2408
|
|
2409 /* Set "lvl" to the level of line "flp->lnum". When flp->start is set
|
|
2410 * and after the first line of the fold, set the level to zero to
|
|
2411 * force the fold to end. Do the same when had_end is set: Previous
|
|
2412 * line was marked as end of a fold. */
|
|
2413 lvl = flp->lvl;
|
|
2414 if (lvl > MAX_LEVEL)
|
|
2415 lvl = MAX_LEVEL;
|
|
2416 if (flp->lnum > firstlnum
|
|
2417 && (level > lvl - flp->start || level >= flp->had_end))
|
|
2418 lvl = 0;
|
|
2419
|
|
2420 if (flp->lnum > bot && !finish && fp != NULL)
|
|
2421 {
|
|
2422 /* For "marker" and "syntax" methods:
|
|
2423 * - If a change caused a nested fold to be removed, we need to
|
|
2424 * delete it and continue at least until where it ended.
|
|
2425 * - If a change caused a nested fold to be created, or this fold
|
|
2426 * to continue below its original end, need to finish this fold.
|
|
2427 */
|
|
2428 if (getlevel != foldlevelMarker
|
|
2429 && getlevel != foldlevelExpr
|
|
2430 && getlevel != foldlevelSyntax)
|
|
2431 break;
|
|
2432 i = 0;
|
|
2433 fp2 = fp;
|
|
2434 if (lvl >= level)
|
|
2435 {
|
|
2436 /* Compute how deep the folds currently are, if it's deeper
|
|
2437 * than "lvl" then some must be deleted, need to update
|
|
2438 * at least one nested fold. */
|
|
2439 ll = flp->lnum - fp->fd_top;
|
|
2440 while (foldFind(&fp2->fd_nested, ll, &fp2))
|
|
2441 {
|
|
2442 ++i;
|
|
2443 ll -= fp2->fd_top;
|
|
2444 }
|
|
2445 }
|
|
2446 if (lvl < level + i)
|
|
2447 {
|
|
2448 foldFind(&fp->fd_nested, flp->lnum - fp->fd_top, &fp2);
|
|
2449 if (fp2 != NULL)
|
|
2450 bot = fp2->fd_top + fp2->fd_len - 1 + fp->fd_top;
|
|
2451 }
|
|
2452 else if (fp->fd_top + fp->fd_len <= flp->lnum && lvl >= level)
|
|
2453 finish = TRUE;
|
|
2454 else
|
|
2455 break;
|
|
2456 }
|
|
2457
|
|
2458 /* At the start of the first nested fold and at the end of the current
|
|
2459 * fold: check if existing folds at this level, before the current
|
|
2460 * one, need to be deleted or truncated. */
|
|
2461 if (fp == NULL
|
|
2462 && (lvl != level
|
|
2463 || flp->lnum_save >= bot
|
|
2464 || flp->start != 0
|
|
2465 || flp->had_end <= MAX_LEVEL
|
|
2466 || flp->lnum == linecount))
|
|
2467 {
|
|
2468 /*
|
|
2469 * Remove or update folds that have lines between startlnum and
|
|
2470 * firstlnum.
|
|
2471 */
|
|
2472 while (!got_int)
|
|
2473 {
|
|
2474 /* set concat to 1 if it's allowed to concatenated this fold
|
|
2475 * with a previous one that touches it. */
|
|
2476 if (flp->start != 0 || flp->had_end <= MAX_LEVEL)
|
|
2477 concat = 0;
|
|
2478 else
|
|
2479 concat = 1;
|
|
2480
|
|
2481 /* Find an existing fold to re-use. Preferably one that
|
|
2482 * includes startlnum, otherwise one that ends just before
|
|
2483 * startlnum or starts after it. */
|
|
2484 if (foldFind(gap, startlnum, &fp)
|
|
2485 || (fp < ((fold_T *)gap->ga_data) + gap->ga_len
|
|
2486 && fp->fd_top <= firstlnum)
|
|
2487 || foldFind(gap, firstlnum - concat, &fp)
|
|
2488 || (fp < ((fold_T *)gap->ga_data) + gap->ga_len
|
|
2489 && ((lvl < level && fp->fd_top < flp->lnum)
|
|
2490 || (lvl >= level
|
|
2491 && fp->fd_top <= flp->lnum_save))))
|
|
2492 {
|
|
2493 if (fp->fd_top + fp->fd_len + concat > firstlnum)
|
|
2494 {
|
|
2495 /* Use existing fold for the new fold. If it starts
|
|
2496 * before where we started looking, extend it. If it
|
|
2497 * starts at another line, update nested folds to keep
|
|
2498 * their position, compensating for the new fd_top. */
|
|
2499 if (fp->fd_top >= startlnum && fp->fd_top != firstlnum)
|
|
2500 {
|
|
2501 if (fp->fd_top > firstlnum)
|
|
2502 /* like lines are inserted */
|
|
2503 foldMarkAdjustRecurse(&fp->fd_nested,
|
|
2504 (linenr_T)0, (linenr_T)MAXLNUM,
|
|
2505 (long)(fp->fd_top - firstlnum), 0L);
|
|
2506 else
|
|
2507 /* like lines are deleted */
|
|
2508 foldMarkAdjustRecurse(&fp->fd_nested,
|
|
2509 (linenr_T)0,
|
|
2510 (long)(firstlnum - fp->fd_top - 1),
|
|
2511 (linenr_T)MAXLNUM,
|
|
2512 (long)(fp->fd_top - firstlnum));
|
|
2513 fp->fd_len += fp->fd_top - firstlnum;
|
|
2514 fp->fd_top = firstlnum;
|
|
2515 fold_changed = TRUE;
|
|
2516 }
|
|
2517 else if (flp->start != 0 && lvl == level
|
|
2518 && fp->fd_top != firstlnum)
|
|
2519 {
|
|
2520 /* Existing fold that includes startlnum must stop
|
|
2521 * if we find the start of a new fold at the same
|
|
2522 * level. Split it. Delete contained folds at
|
|
2523 * this point to split them too. */
|
|
2524 foldRemove(&fp->fd_nested, flp->lnum - fp->fd_top,
|
|
2525 flp->lnum - fp->fd_top);
|
|
2526 i = (int)(fp - (fold_T *)gap->ga_data);
|
|
2527 foldSplit(gap, i, flp->lnum, flp->lnum - 1);
|
|
2528 fp = (fold_T *)gap->ga_data + i + 1;
|
|
2529 /* If using the "marker" or "syntax" method, we
|
|
2530 * need to continue until the end of the fold is
|
|
2531 * found. */
|
|
2532 if (getlevel == foldlevelMarker
|
|
2533 || getlevel == foldlevelExpr
|
|
2534 || getlevel == foldlevelSyntax)
|
|
2535 finish = TRUE;
|
|
2536 }
|
|
2537 break;
|
|
2538 }
|
|
2539 if (fp->fd_top >= startlnum)
|
|
2540 {
|
|
2541 /* A fold that starts at or after startlnum and stops
|
|
2542 * before the new fold must be deleted. Continue
|
|
2543 * looking for the next one. */
|
|
2544 deleteFoldEntry(gap,
|
|
2545 (int)(fp - (fold_T *)gap->ga_data), TRUE);
|
|
2546 }
|
|
2547 else
|
|
2548 {
|
|
2549 /* A fold has some lines above startlnum, truncate it
|
|
2550 * to stop just above startlnum. */
|
|
2551 fp->fd_len = startlnum - fp->fd_top;
|
|
2552 foldMarkAdjustRecurse(&fp->fd_nested,
|
|
2553 (linenr_T)fp->fd_len, (linenr_T)MAXLNUM,
|
|
2554 (linenr_T)MAXLNUM, 0L);
|
|
2555 fold_changed = TRUE;
|
|
2556 }
|
|
2557 }
|
|
2558 else
|
|
2559 {
|
|
2560 /* Insert new fold. Careful: ga_data may be NULL and it
|
|
2561 * may change! */
|
|
2562 i = (int)(fp - (fold_T *)gap->ga_data);
|
|
2563 if (foldInsert(gap, i) != OK)
|
|
2564 return bot;
|
|
2565 fp = (fold_T *)gap->ga_data + i;
|
|
2566 /* The new fold continues until bot, unless we find the
|
|
2567 * end earlier. */
|
|
2568 fp->fd_top = firstlnum;
|
|
2569 fp->fd_len = bot - firstlnum + 1;
|
|
2570 /* When the containing fold is open, the new fold is open.
|
|
2571 * The new fold is closed if the fold above it is closed.
|
|
2572 * The first fold depends on the containing fold. */
|
|
2573 if (topflags == FD_OPEN)
|
|
2574 {
|
|
2575 flp->wp->w_fold_manual = TRUE;
|
|
2576 fp->fd_flags = FD_OPEN;
|
|
2577 }
|
|
2578 else if (i <= 0)
|
|
2579 {
|
|
2580 fp->fd_flags = topflags;
|
|
2581 if (topflags != FD_LEVEL)
|
|
2582 flp->wp->w_fold_manual = TRUE;
|
|
2583 }
|
|
2584 else
|
|
2585 fp->fd_flags = (fp - 1)->fd_flags;
|
|
2586 fp->fd_small = MAYBE;
|
|
2587 /* If using the "marker", "expr" or "syntax" method, we
|
|
2588 * need to continue until the end of the fold is found. */
|
|
2589 if (getlevel == foldlevelMarker
|
|
2590 || getlevel == foldlevelExpr
|
|
2591 || getlevel == foldlevelSyntax)
|
|
2592 finish = TRUE;
|
|
2593 fold_changed = TRUE;
|
|
2594 break;
|
|
2595 }
|
|
2596 }
|
|
2597 }
|
|
2598
|
|
2599 if (lvl < level || flp->lnum > linecount)
|
|
2600 {
|
|
2601 /*
|
|
2602 * Found a line with a lower foldlevel, this fold ends just above
|
|
2603 * "flp->lnum".
|
|
2604 */
|
|
2605 break;
|
|
2606 }
|
|
2607
|
|
2608 /*
|
|
2609 * The fold includes the line "flp->lnum" and "flp->lnum_save".
|
840
|
2610 * Check "fp" for safety.
|
7
|
2611 */
|
840
|
2612 if (lvl > level && fp != NULL)
|
7
|
2613 {
|
|
2614 /*
|
|
2615 * There is a nested fold, handle it recursively.
|
|
2616 */
|
|
2617 /* At least do one line (can happen when finish is TRUE). */
|
|
2618 if (bot < flp->lnum)
|
|
2619 bot = flp->lnum;
|
|
2620
|
|
2621 /* Line numbers in the nested fold are relative to the start of
|
|
2622 * this fold. */
|
|
2623 flp->lnum = flp->lnum_save - fp->fd_top;
|
|
2624 flp->off += fp->fd_top;
|
|
2625 i = (int)(fp - (fold_T *)gap->ga_data);
|
|
2626 bot = foldUpdateIEMSRecurse(&fp->fd_nested, level + 1,
|
|
2627 startlnum2 - fp->fd_top, flp, getlevel,
|
|
2628 bot - fp->fd_top, fp->fd_flags);
|
|
2629 fp = (fold_T *)gap->ga_data + i;
|
|
2630 flp->lnum += fp->fd_top;
|
|
2631 flp->lnum_save += fp->fd_top;
|
|
2632 flp->off -= fp->fd_top;
|
|
2633 bot += fp->fd_top;
|
|
2634 startlnum2 = flp->lnum;
|
|
2635
|
|
2636 /* This fold may end at the same line, don't incr. flp->lnum. */
|
|
2637 }
|
|
2638 else
|
|
2639 {
|
|
2640 /*
|
|
2641 * Get the level of the next line, then continue the loop to check
|
|
2642 * if it ends there.
|
|
2643 * Skip over undefined lines, to find the foldlevel after it.
|
|
2644 * For the last line in the file the foldlevel is always valid.
|
|
2645 */
|
|
2646 flp->lnum = flp->lnum_save;
|
|
2647 ll = flp->lnum + 1;
|
|
2648 while (!got_int)
|
|
2649 {
|
|
2650 /* Make the previous level available to foldlevel(). */
|
|
2651 prev_lnum = flp->lnum;
|
|
2652 prev_lnum_lvl = flp->lvl;
|
|
2653
|
|
2654 if (++flp->lnum > linecount)
|
|
2655 break;
|
|
2656 flp->lvl = flp->lvl_next;
|
|
2657 getlevel(flp);
|
|
2658 if (flp->lvl >= 0 || flp->had_end <= MAX_LEVEL)
|
|
2659 break;
|
|
2660 }
|
|
2661 prev_lnum = 0;
|
|
2662 if (flp->lnum > linecount)
|
|
2663 break;
|
|
2664
|
|
2665 /* leave flp->lnum_save to lnum of the line that was used to get
|
|
2666 * the level, flp->lnum to the lnum of the next line. */
|
|
2667 flp->lnum_save = flp->lnum;
|
|
2668 flp->lnum = ll;
|
|
2669 }
|
|
2670 }
|
|
2671
|
|
2672 if (fp == NULL) /* only happens when got_int is set */
|
|
2673 return bot;
|
|
2674
|
|
2675 /*
|
|
2676 * Get here when:
|
|
2677 * lvl < level: the folds ends just above "flp->lnum"
|
|
2678 * lvl >= level: fold continues below "bot"
|
|
2679 */
|
|
2680
|
|
2681 /* Current fold at least extends until lnum. */
|
|
2682 if (fp->fd_len < flp->lnum - fp->fd_top)
|
|
2683 {
|
|
2684 fp->fd_len = flp->lnum - fp->fd_top;
|
1513
|
2685 fp->fd_small = MAYBE;
|
7
|
2686 fold_changed = TRUE;
|
|
2687 }
|
|
2688
|
|
2689 /* Delete contained folds from the end of the last one found until where
|
|
2690 * we stopped looking. */
|
|
2691 foldRemove(&fp->fd_nested, startlnum2 - fp->fd_top,
|
|
2692 flp->lnum - 1 - fp->fd_top);
|
|
2693
|
|
2694 if (lvl < level)
|
|
2695 {
|
|
2696 /* End of fold found, update the length when it got shorter. */
|
|
2697 if (fp->fd_len != flp->lnum - fp->fd_top)
|
|
2698 {
|
|
2699 if (fp->fd_top + fp->fd_len > bot + 1)
|
|
2700 {
|
1224
|
2701 /* fold continued below bot */
|
7
|
2702 if (getlevel == foldlevelMarker
|
|
2703 || getlevel == foldlevelExpr
|
|
2704 || getlevel == foldlevelSyntax)
|
|
2705 {
|
|
2706 /* marker method: truncate the fold and make sure the
|
|
2707 * previously included lines are processed again */
|
|
2708 bot = fp->fd_top + fp->fd_len - 1;
|
|
2709 fp->fd_len = flp->lnum - fp->fd_top;
|
|
2710 }
|
|
2711 else
|
|
2712 {
|
|
2713 /* indent or expr method: split fold to create a new one
|
|
2714 * below bot */
|
|
2715 i = (int)(fp - (fold_T *)gap->ga_data);
|
|
2716 foldSplit(gap, i, flp->lnum, bot);
|
|
2717 fp = (fold_T *)gap->ga_data + i;
|
|
2718 }
|
|
2719 }
|
|
2720 else
|
|
2721 fp->fd_len = flp->lnum - fp->fd_top;
|
|
2722 fold_changed = TRUE;
|
|
2723 }
|
|
2724 }
|
|
2725
|
|
2726 /* delete following folds that end before the current line */
|
|
2727 for (;;)
|
|
2728 {
|
|
2729 fp2 = fp + 1;
|
|
2730 if (fp2 >= (fold_T *)gap->ga_data + gap->ga_len
|
|
2731 || fp2->fd_top > flp->lnum)
|
|
2732 break;
|
|
2733 if (fp2->fd_top + fp2->fd_len > flp->lnum)
|
|
2734 {
|
|
2735 if (fp2->fd_top < flp->lnum)
|
|
2736 {
|
|
2737 /* Make fold that includes lnum start at lnum. */
|
|
2738 foldMarkAdjustRecurse(&fp2->fd_nested,
|
|
2739 (linenr_T)0, (long)(flp->lnum - fp2->fd_top - 1),
|
|
2740 (linenr_T)MAXLNUM, (long)(fp2->fd_top - flp->lnum));
|
|
2741 fp2->fd_len -= flp->lnum - fp2->fd_top;
|
|
2742 fp2->fd_top = flp->lnum;
|
|
2743 fold_changed = TRUE;
|
|
2744 }
|
|
2745
|
|
2746 if (lvl >= level)
|
|
2747 {
|
|
2748 /* merge new fold with existing fold that follows */
|
|
2749 foldMerge(fp, gap, fp2);
|
|
2750 }
|
|
2751 break;
|
|
2752 }
|
|
2753 fold_changed = TRUE;
|
|
2754 deleteFoldEntry(gap, (int)(fp2 - (fold_T *)gap->ga_data), TRUE);
|
|
2755 }
|
|
2756
|
|
2757 /* Need to redraw the lines we inspected, which might be further down than
|
|
2758 * was asked for. */
|
|
2759 if (bot < flp->lnum - 1)
|
|
2760 bot = flp->lnum - 1;
|
|
2761
|
|
2762 return bot;
|
|
2763 }
|
|
2764
|
|
2765 /* foldInsert() {{{2 */
|
|
2766 /*
|
|
2767 * Insert a new fold in "gap" at position "i".
|
|
2768 * Returns OK for success, FAIL for failure.
|
|
2769 */
|
|
2770 static int
|
|
2771 foldInsert(gap, i)
|
|
2772 garray_T *gap;
|
|
2773 int i;
|
|
2774 {
|
|
2775 fold_T *fp;
|
|
2776
|
|
2777 if (ga_grow(gap, 1) != OK)
|
|
2778 return FAIL;
|
|
2779 fp = (fold_T *)gap->ga_data + i;
|
|
2780 if (i < gap->ga_len)
|
|
2781 mch_memmove(fp + 1, fp, sizeof(fold_T) * (gap->ga_len - i));
|
|
2782 ++gap->ga_len;
|
|
2783 ga_init2(&fp->fd_nested, (int)sizeof(fold_T), 10);
|
|
2784 return OK;
|
|
2785 }
|
|
2786
|
|
2787 /* foldSplit() {{{2 */
|
|
2788 /*
|
|
2789 * Split the "i"th fold in "gap", which starts before "top" and ends below
|
|
2790 * "bot" in two pieces, one ending above "top" and the other starting below
|
|
2791 * "bot".
|
|
2792 * The caller must first have taken care of any nested folds from "top" to
|
|
2793 * "bot"!
|
|
2794 */
|
|
2795 static void
|
|
2796 foldSplit(gap, i, top, bot)
|
|
2797 garray_T *gap;
|
|
2798 int i;
|
|
2799 linenr_T top;
|
|
2800 linenr_T bot;
|
|
2801 {
|
|
2802 fold_T *fp;
|
|
2803 fold_T *fp2;
|
|
2804 garray_T *gap1;
|
|
2805 garray_T *gap2;
|
|
2806 int idx;
|
|
2807 int len;
|
|
2808
|
|
2809 /* The fold continues below bot, need to split it. */
|
|
2810 if (foldInsert(gap, i + 1) == FAIL)
|
|
2811 return;
|
|
2812 fp = (fold_T *)gap->ga_data + i;
|
|
2813 fp[1].fd_top = bot + 1;
|
|
2814 fp[1].fd_len = fp->fd_len - (fp[1].fd_top - fp->fd_top);
|
|
2815 fp[1].fd_flags = fp->fd_flags;
|
|
2816
|
|
2817 /* Move nested folds below bot to new fold. There can't be
|
|
2818 * any between top and bot, they have been removed by the caller. */
|
|
2819 gap1 = &fp->fd_nested;
|
|
2820 gap2 = &fp[1].fd_nested;
|
|
2821 (void)(foldFind(gap1, bot + 1 - fp->fd_top, &fp2));
|
|
2822 len = (int)((fold_T *)gap1->ga_data + gap1->ga_len - fp2);
|
|
2823 if (len > 0 && ga_grow(gap2, len) == OK)
|
|
2824 {
|
|
2825 for (idx = 0; idx < len; ++idx)
|
|
2826 {
|
|
2827 ((fold_T *)gap2->ga_data)[idx] = fp2[idx];
|
|
2828 ((fold_T *)gap2->ga_data)[idx].fd_top
|
|
2829 -= fp[1].fd_top - fp->fd_top;
|
|
2830 }
|
|
2831 gap2->ga_len = len;
|
|
2832 gap1->ga_len -= len;
|
|
2833 }
|
|
2834 fp->fd_len = top - fp->fd_top;
|
|
2835 fold_changed = TRUE;
|
|
2836 }
|
|
2837
|
|
2838 /* foldRemove() {{{2 */
|
|
2839 /*
|
|
2840 * Remove folds within the range "top" to and including "bot".
|
|
2841 * Check for these situations:
|
|
2842 * 1 2 3
|
|
2843 * 1 2 3
|
|
2844 * top 2 3 4 5
|
|
2845 * 2 3 4 5
|
|
2846 * bot 2 3 4 5
|
|
2847 * 3 5 6
|
|
2848 * 3 5 6
|
|
2849 *
|
|
2850 * 1: not changed
|
1224
|
2851 * 2: truncate to stop above "top"
|
7
|
2852 * 3: split in two parts, one stops above "top", other starts below "bot".
|
|
2853 * 4: deleted
|
|
2854 * 5: made to start below "bot".
|
|
2855 * 6: not changed
|
|
2856 */
|
|
2857 static void
|
|
2858 foldRemove(gap, top, bot)
|
|
2859 garray_T *gap;
|
|
2860 linenr_T top;
|
|
2861 linenr_T bot;
|
|
2862 {
|
|
2863 fold_T *fp = NULL;
|
|
2864
|
|
2865 if (bot < top)
|
|
2866 return; /* nothing to do */
|
|
2867
|
|
2868 for (;;)
|
|
2869 {
|
|
2870 /* Find fold that includes top or a following one. */
|
|
2871 if (foldFind(gap, top, &fp) && fp->fd_top < top)
|
|
2872 {
|
|
2873 /* 2: or 3: need to delete nested folds */
|
|
2874 foldRemove(&fp->fd_nested, top - fp->fd_top, bot - fp->fd_top);
|
|
2875 if (fp->fd_top + fp->fd_len > bot + 1)
|
|
2876 {
|
|
2877 /* 3: need to split it. */
|
|
2878 foldSplit(gap, (int)(fp - (fold_T *)gap->ga_data), top, bot);
|
|
2879 }
|
|
2880 else
|
|
2881 {
|
|
2882 /* 2: truncate fold at "top". */
|
|
2883 fp->fd_len = top - fp->fd_top;
|
|
2884 }
|
|
2885 fold_changed = TRUE;
|
|
2886 continue;
|
|
2887 }
|
|
2888 if (fp >= (fold_T *)(gap->ga_data) + gap->ga_len
|
|
2889 || fp->fd_top > bot)
|
|
2890 {
|
|
2891 /* 6: Found a fold below bot, can stop looking. */
|
|
2892 break;
|
|
2893 }
|
|
2894 if (fp->fd_top >= top)
|
|
2895 {
|
|
2896 /* Found an entry below top. */
|
|
2897 fold_changed = TRUE;
|
36
|
2898 if (fp->fd_top + fp->fd_len - 1 > bot)
|
7
|
2899 {
|
|
2900 /* 5: Make fold that includes bot start below bot. */
|
|
2901 foldMarkAdjustRecurse(&fp->fd_nested,
|
|
2902 (linenr_T)0, (long)(bot - fp->fd_top),
|
|
2903 (linenr_T)MAXLNUM, (long)(fp->fd_top - bot - 1));
|
|
2904 fp->fd_len -= bot - fp->fd_top + 1;
|
|
2905 fp->fd_top = bot + 1;
|
|
2906 break;
|
|
2907 }
|
|
2908
|
|
2909 /* 4: Delete completely contained fold. */
|
|
2910 deleteFoldEntry(gap, (int)(fp - (fold_T *)gap->ga_data), TRUE);
|
|
2911 }
|
|
2912 }
|
|
2913 }
|
|
2914
|
|
2915 /* foldMerge() {{{2 */
|
|
2916 /*
|
1224
|
2917 * Merge two adjacent folds (and the nested ones in them).
|
|
2918 * This only works correctly when the folds are really adjacent! Thus "fp1"
|
7
|
2919 * must end just above "fp2".
|
|
2920 * The resulting fold is "fp1", nested folds are moved from "fp2" to "fp1".
|
|
2921 * Fold entry "fp2" in "gap" is deleted.
|
|
2922 */
|
|
2923 static void
|
|
2924 foldMerge(fp1, gap, fp2)
|
|
2925 fold_T *fp1;
|
|
2926 garray_T *gap;
|
|
2927 fold_T *fp2;
|
|
2928 {
|
|
2929 fold_T *fp3;
|
|
2930 fold_T *fp4;
|
|
2931 int idx;
|
|
2932 garray_T *gap1 = &fp1->fd_nested;
|
|
2933 garray_T *gap2 = &fp2->fd_nested;
|
|
2934
|
|
2935 /* If the last nested fold in fp1 touches the first nested fold in fp2,
|
|
2936 * merge them recursively. */
|
|
2937 if (foldFind(gap1, fp1->fd_len - 1L, &fp3) && foldFind(gap2, 0L, &fp4))
|
|
2938 foldMerge(fp3, gap2, fp4);
|
|
2939
|
|
2940 /* Move nested folds in fp2 to the end of fp1. */
|
|
2941 if (gap2->ga_len > 0 && ga_grow(gap1, gap2->ga_len) == OK)
|
|
2942 {
|
|
2943 for (idx = 0; idx < gap2->ga_len; ++idx)
|
|
2944 {
|
|
2945 ((fold_T *)gap1->ga_data)[gap1->ga_len]
|
|
2946 = ((fold_T *)gap2->ga_data)[idx];
|
|
2947 ((fold_T *)gap1->ga_data)[gap1->ga_len].fd_top += fp1->fd_len;
|
|
2948 ++gap1->ga_len;
|
|
2949 }
|
|
2950 gap2->ga_len = 0;
|
|
2951 }
|
|
2952
|
|
2953 fp1->fd_len += fp2->fd_len;
|
|
2954 deleteFoldEntry(gap, (int)(fp2 - (fold_T *)gap->ga_data), TRUE);
|
|
2955 fold_changed = TRUE;
|
|
2956 }
|
|
2957
|
|
2958 /* foldlevelIndent() {{{2 */
|
|
2959 /*
|
|
2960 * Low level function to get the foldlevel for the "indent" method.
|
|
2961 * Doesn't use any caching.
|
|
2962 * Returns a level of -1 if the foldlevel depends on surrounding lines.
|
|
2963 */
|
|
2964 static void
|
|
2965 foldlevelIndent(flp)
|
|
2966 fline_T *flp;
|
|
2967 {
|
|
2968 char_u *s;
|
|
2969 buf_T *buf;
|
|
2970 linenr_T lnum = flp->lnum + flp->off;
|
|
2971
|
|
2972 buf = flp->wp->w_buffer;
|
|
2973 s = skipwhite(ml_get_buf(buf, lnum, FALSE));
|
|
2974
|
|
2975 /* empty line or lines starting with a character in 'foldignore': level
|
|
2976 * depends on surrounding lines */
|
|
2977 if (*s == NUL || vim_strchr(flp->wp->w_p_fdi, *s) != NULL)
|
|
2978 {
|
|
2979 /* first and last line can't be undefined, use level 0 */
|
|
2980 if (lnum == 1 || lnum == buf->b_ml.ml_line_count)
|
|
2981 flp->lvl = 0;
|
|
2982 else
|
|
2983 flp->lvl = -1;
|
|
2984 }
|
|
2985 else
|
|
2986 flp->lvl = get_indent_buf(buf, lnum) / buf->b_p_sw;
|
|
2987 if (flp->lvl > flp->wp->w_p_fdn)
|
1028
|
2988 {
|
7
|
2989 flp->lvl = flp->wp->w_p_fdn;
|
1028
|
2990 if (flp->lvl < 0)
|
|
2991 flp->lvl = 0;
|
|
2992 }
|
7
|
2993 }
|
|
2994
|
|
2995 /* foldlevelDiff() {{{2 */
|
|
2996 #ifdef FEAT_DIFF
|
|
2997 /*
|
|
2998 * Low level function to get the foldlevel for the "diff" method.
|
|
2999 * Doesn't use any caching.
|
|
3000 */
|
|
3001 static void
|
|
3002 foldlevelDiff(flp)
|
|
3003 fline_T *flp;
|
|
3004 {
|
|
3005 if (diff_infold(flp->wp, flp->lnum + flp->off))
|
|
3006 flp->lvl = 1;
|
|
3007 else
|
|
3008 flp->lvl = 0;
|
|
3009 }
|
|
3010 #endif
|
|
3011
|
|
3012 /* foldlevelExpr() {{{2 */
|
|
3013 /*
|
|
3014 * Low level function to get the foldlevel for the "expr" method.
|
|
3015 * Doesn't use any caching.
|
|
3016 * Returns a level of -1 if the foldlevel depends on surrounding lines.
|
|
3017 */
|
|
3018 static void
|
|
3019 foldlevelExpr(flp)
|
|
3020 fline_T *flp;
|
|
3021 {
|
|
3022 #ifndef FEAT_EVAL
|
|
3023 flp->start = FALSE;
|
|
3024 flp->lvl = 0;
|
|
3025 #else
|
|
3026 win_T *win;
|
|
3027 int n;
|
|
3028 int c;
|
|
3029 linenr_T lnum = flp->lnum + flp->off;
|
|
3030 int save_keytyped;
|
|
3031
|
|
3032 win = curwin;
|
|
3033 curwin = flp->wp;
|
|
3034 curbuf = flp->wp->w_buffer;
|
|
3035 set_vim_var_nr(VV_LNUM, lnum);
|
|
3036
|
|
3037 flp->start = 0;
|
|
3038 flp->had_end = flp->end;
|
|
3039 flp->end = MAX_LEVEL + 1;
|
|
3040 if (lnum <= 1)
|
|
3041 flp->lvl = 0;
|
|
3042
|
|
3043 /* KeyTyped may be reset to 0 when calling a function which invokes
|
|
3044 * do_cmdline(). To make 'foldopen' work correctly restore KeyTyped. */
|
|
3045 save_keytyped = KeyTyped;
|
|
3046 n = eval_foldexpr(flp->wp->w_p_fde, &c);
|
|
3047 KeyTyped = save_keytyped;
|
|
3048
|
|
3049 switch (c)
|
|
3050 {
|
|
3051 /* "a1", "a2", .. : add to the fold level */
|
|
3052 case 'a': if (flp->lvl >= 0)
|
|
3053 {
|
|
3054 flp->lvl += n;
|
|
3055 flp->lvl_next = flp->lvl;
|
|
3056 }
|
|
3057 flp->start = n;
|
|
3058 break;
|
|
3059
|
|
3060 /* "s1", "s2", .. : subtract from the fold level */
|
|
3061 case 's': if (flp->lvl >= 0)
|
|
3062 {
|
|
3063 if (n > flp->lvl)
|
|
3064 flp->lvl_next = 0;
|
|
3065 else
|
|
3066 flp->lvl_next = flp->lvl - n;
|
|
3067 flp->end = flp->lvl_next + 1;
|
|
3068 }
|
|
3069 break;
|
|
3070
|
|
3071 /* ">1", ">2", .. : start a fold with a certain level */
|
|
3072 case '>': flp->lvl = n;
|
|
3073 flp->lvl_next = n;
|
|
3074 flp->start = 1;
|
|
3075 break;
|
|
3076
|
|
3077 /* "<1", "<2", .. : end a fold with a certain level */
|
|
3078 case '<': flp->lvl_next = n - 1;
|
|
3079 flp->end = n;
|
|
3080 break;
|
|
3081
|
|
3082 /* "=": No change in level */
|
|
3083 case '=': flp->lvl_next = flp->lvl;
|
|
3084 break;
|
|
3085
|
|
3086 /* "-1", "0", "1", ..: set fold level */
|
|
3087 default: if (n < 0)
|
|
3088 /* Use the current level for the next line, so that "a1"
|
|
3089 * will work there. */
|
|
3090 flp->lvl_next = flp->lvl;
|
|
3091 else
|
|
3092 flp->lvl_next = n;
|
|
3093 flp->lvl = n;
|
|
3094 break;
|
|
3095 }
|
|
3096
|
|
3097 /* If the level is unknown for the first or the last line in the file, use
|
|
3098 * level 0. */
|
|
3099 if (flp->lvl < 0)
|
|
3100 {
|
|
3101 if (lnum <= 1)
|
|
3102 {
|
|
3103 flp->lvl = 0;
|
|
3104 flp->lvl_next = 0;
|
|
3105 }
|
|
3106 if (lnum == curbuf->b_ml.ml_line_count)
|
|
3107 flp->lvl_next = 0;
|
|
3108 }
|
|
3109
|
|
3110 curwin = win;
|
|
3111 curbuf = curwin->w_buffer;
|
|
3112 #endif
|
|
3113 }
|
|
3114
|
|
3115 /* parseMarker() {{{2 */
|
|
3116 /*
|
|
3117 * Parse 'foldmarker' and set "foldendmarker", "foldstartmarkerlen" and
|
|
3118 * "foldendmarkerlen".
|
|
3119 * Relies on the option value to have been checked for correctness already.
|
|
3120 */
|
|
3121 static void
|
|
3122 parseMarker(wp)
|
|
3123 win_T *wp;
|
|
3124 {
|
|
3125 foldendmarker = vim_strchr(wp->w_p_fmr, ',');
|
|
3126 foldstartmarkerlen = (int)(foldendmarker++ - wp->w_p_fmr);
|
|
3127 foldendmarkerlen = (int)STRLEN(foldendmarker);
|
|
3128 }
|
|
3129
|
|
3130 /* foldlevelMarker() {{{2 */
|
|
3131 /*
|
|
3132 * Low level function to get the foldlevel for the "marker" method.
|
|
3133 * "foldendmarker", "foldstartmarkerlen" and "foldendmarkerlen" must have been
|
|
3134 * set before calling this.
|
|
3135 * Requires that flp->lvl is set to the fold level of the previous line!
|
|
3136 * Careful: This means you can't call this function twice on the same line.
|
|
3137 * Doesn't use any caching.
|
|
3138 * Sets flp->start when a start marker was found.
|
|
3139 */
|
|
3140 static void
|
|
3141 foldlevelMarker(flp)
|
|
3142 fline_T *flp;
|
|
3143 {
|
|
3144 char_u *startmarker;
|
|
3145 int cstart;
|
|
3146 int cend;
|
|
3147 int start_lvl = flp->lvl;
|
|
3148 char_u *s;
|
|
3149 int n;
|
|
3150
|
|
3151 /* cache a few values for speed */
|
|
3152 startmarker = flp->wp->w_p_fmr;
|
|
3153 cstart = *startmarker;
|
|
3154 ++startmarker;
|
|
3155 cend = *foldendmarker;
|
|
3156
|
|
3157 /* Default: no start found, next level is same as current level */
|
|
3158 flp->start = 0;
|
|
3159 flp->lvl_next = flp->lvl;
|
|
3160
|
|
3161 s = ml_get_buf(flp->wp->w_buffer, flp->lnum + flp->off, FALSE);
|
|
3162 while (*s)
|
|
3163 {
|
|
3164 if (*s == cstart
|
|
3165 && STRNCMP(s + 1, startmarker, foldstartmarkerlen - 1) == 0)
|
|
3166 {
|
|
3167 /* found startmarker: set flp->lvl */
|
|
3168 s += foldstartmarkerlen;
|
|
3169 if (VIM_ISDIGIT(*s))
|
|
3170 {
|
|
3171 n = atoi((char *)s);
|
|
3172 if (n > 0)
|
|
3173 {
|
|
3174 flp->lvl = n;
|
|
3175 flp->lvl_next = n;
|
|
3176 if (n <= start_lvl)
|
|
3177 flp->start = 1;
|
|
3178 else
|
|
3179 flp->start = n - start_lvl;
|
|
3180 }
|
|
3181 }
|
|
3182 else
|
|
3183 {
|
|
3184 ++flp->lvl;
|
|
3185 ++flp->lvl_next;
|
|
3186 ++flp->start;
|
|
3187 }
|
|
3188 }
|
|
3189 else if (*s == cend
|
|
3190 && STRNCMP(s + 1, foldendmarker + 1, foldendmarkerlen - 1) == 0)
|
|
3191 {
|
|
3192 /* found endmarker: set flp->lvl_next */
|
|
3193 s += foldendmarkerlen;
|
|
3194 if (VIM_ISDIGIT(*s))
|
|
3195 {
|
|
3196 n = atoi((char *)s);
|
|
3197 if (n > 0)
|
|
3198 {
|
|
3199 flp->lvl = n;
|
|
3200 flp->lvl_next = n - 1;
|
|
3201 /* never start a fold with an end marker */
|
|
3202 if (flp->lvl_next > flp->lvl)
|
|
3203 flp->lvl_next = flp->lvl;
|
|
3204 }
|
|
3205 }
|
|
3206 else
|
|
3207 --flp->lvl_next;
|
|
3208 }
|
|
3209 else
|
651
|
3210 mb_ptr_adv(s);
|
7
|
3211 }
|
|
3212
|
|
3213 /* The level can't go negative, must be missing a start marker. */
|
|
3214 if (flp->lvl_next < 0)
|
|
3215 flp->lvl_next = 0;
|
|
3216 }
|
|
3217
|
|
3218 /* foldlevelSyntax() {{{2 */
|
|
3219 /*
|
|
3220 * Low level function to get the foldlevel for the "syntax" method.
|
|
3221 * Doesn't use any caching.
|
|
3222 */
|
|
3223 static void
|
|
3224 foldlevelSyntax(flp)
|
|
3225 fline_T *flp;
|
|
3226 {
|
|
3227 #ifndef FEAT_SYN_HL
|
|
3228 flp->start = 0;
|
|
3229 flp->lvl = 0;
|
|
3230 #else
|
|
3231 linenr_T lnum = flp->lnum + flp->off;
|
|
3232 int n;
|
|
3233
|
|
3234 /* Use the maximum fold level at the start of this line and the next. */
|
|
3235 flp->lvl = syn_get_foldlevel(flp->wp, lnum);
|
|
3236 flp->start = 0;
|
|
3237 if (lnum < flp->wp->w_buffer->b_ml.ml_line_count)
|
|
3238 {
|
|
3239 n = syn_get_foldlevel(flp->wp, lnum + 1);
|
|
3240 if (n > flp->lvl)
|
|
3241 {
|
|
3242 flp->start = n - flp->lvl; /* fold(s) start here */
|
|
3243 flp->lvl = n;
|
|
3244 }
|
|
3245 }
|
|
3246 #endif
|
|
3247 }
|
|
3248
|
|
3249 /* functions for storing the fold state in a View {{{1 */
|
|
3250 /* put_folds() {{{2 */
|
|
3251 #if defined(FEAT_SESSION) || defined(PROTO)
|
|
3252 static int put_folds_recurse __ARGS((FILE *fd, garray_T *gap, linenr_T off));
|
|
3253 static int put_foldopen_recurse __ARGS((FILE *fd, garray_T *gap, linenr_T off));
|
|
3254
|
|
3255 /*
|
|
3256 * Write commands to "fd" to restore the manual folds in window "wp".
|
|
3257 * Return FAIL if writing fails.
|
|
3258 */
|
|
3259 int
|
|
3260 put_folds(fd, wp)
|
|
3261 FILE *fd;
|
|
3262 win_T *wp;
|
|
3263 {
|
|
3264 if (foldmethodIsManual(wp))
|
|
3265 {
|
|
3266 if (put_line(fd, "silent! normal! zE") == FAIL
|
|
3267 || put_folds_recurse(fd, &wp->w_folds, (linenr_T)0) == FAIL)
|
|
3268 return FAIL;
|
|
3269 }
|
|
3270
|
|
3271 /* If some folds are manually opened/closed, need to restore that. */
|
|
3272 if (wp->w_fold_manual)
|
|
3273 return put_foldopen_recurse(fd, &wp->w_folds, (linenr_T)0);
|
|
3274
|
|
3275 return OK;
|
|
3276 }
|
|
3277
|
|
3278 /* put_folds_recurse() {{{2 */
|
|
3279 /*
|
|
3280 * Write commands to "fd" to recreate manually created folds.
|
|
3281 * Returns FAIL when writing failed.
|
|
3282 */
|
|
3283 static int
|
|
3284 put_folds_recurse(fd, gap, off)
|
|
3285 FILE *fd;
|
|
3286 garray_T *gap;
|
|
3287 linenr_T off;
|
|
3288 {
|
|
3289 int i;
|
|
3290 fold_T *fp;
|
|
3291
|
|
3292 fp = (fold_T *)gap->ga_data;
|
|
3293 for (i = 0; i < gap->ga_len; i++)
|
|
3294 {
|
|
3295 /* Do nested folds first, they will be created closed. */
|
|
3296 if (put_folds_recurse(fd, &fp->fd_nested, off + fp->fd_top) == FAIL)
|
|
3297 return FAIL;
|
|
3298 if (fprintf(fd, "%ld,%ldfold", fp->fd_top + off,
|
|
3299 fp->fd_top + off + fp->fd_len - 1) < 0
|
|
3300 || put_eol(fd) == FAIL)
|
|
3301 return FAIL;
|
|
3302 ++fp;
|
|
3303 }
|
|
3304 return OK;
|
|
3305 }
|
|
3306
|
|
3307 /* put_foldopen_recurse() {{{2 */
|
|
3308 /*
|
|
3309 * Write commands to "fd" to open and close manually opened/closed folds.
|
|
3310 * Returns FAIL when writing failed.
|
|
3311 */
|
|
3312 static int
|
|
3313 put_foldopen_recurse(fd, gap, off)
|
|
3314 FILE *fd;
|
|
3315 garray_T *gap;
|
|
3316 linenr_T off;
|
|
3317 {
|
|
3318 int i;
|
|
3319 fold_T *fp;
|
|
3320
|
|
3321 fp = (fold_T *)gap->ga_data;
|
|
3322 for (i = 0; i < gap->ga_len; i++)
|
|
3323 {
|
|
3324 if (fp->fd_flags != FD_LEVEL)
|
|
3325 {
|
|
3326 if (fp->fd_nested.ga_len > 0)
|
|
3327 {
|
|
3328 /* open/close nested folds while this fold is open */
|
|
3329 if (fprintf(fd, "%ld", fp->fd_top + off) < 0
|
|
3330 || put_eol(fd) == FAIL
|
|
3331 || put_line(fd, "normal zo") == FAIL)
|
|
3332 return FAIL;
|
|
3333 if (put_foldopen_recurse(fd, &fp->fd_nested, off + fp->fd_top)
|
|
3334 == FAIL)
|
|
3335 return FAIL;
|
|
3336 }
|
|
3337 if (fprintf(fd, "%ld", fp->fd_top + off) < 0
|
|
3338 || put_eol(fd) == FAIL
|
|
3339 || fprintf(fd, "normal z%c",
|
|
3340 fp->fd_flags == FD_CLOSED ? 'c' : 'o') < 0
|
|
3341 || put_eol(fd) == FAIL)
|
|
3342 return FAIL;
|
|
3343 }
|
|
3344 ++fp;
|
|
3345 }
|
|
3346
|
|
3347 return OK;
|
|
3348 }
|
|
3349 #endif /* FEAT_SESSION */
|
|
3350
|
|
3351 /* }}}1 */
|
|
3352 #endif /* defined(FEAT_FOLDING) || defined(PROTO) */
|