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