Patch 7.0.208 (after 7.0.171 and 7.0.180)
[MacVim.git] / src / memline.c
blobbb1126de107e81740c4bd44f4f33f0959f251e32
1 /* vi:set ts=8 sts=4 sw=4:
3 * VIM - Vi IMproved by Bram Moolenaar
5 * Do ":help uganda" in Vim to read copying and usage conditions.
6 * Do ":help credits" in Vim to see a list of people who contributed.
7 * See README.txt for an overview of the Vim source code.
8 */
10 /* for debugging */
11 /* #define CHECK(c, s) if (c) EMSG(s) */
12 #define CHECK(c, s)
15 * memline.c: Contains the functions for appending, deleting and changing the
16 * text lines. The memfile functions are used to store the information in
17 * blocks of memory, backed up by a file. The structure of the information is
18 * a tree. The root of the tree is a pointer block. The leaves of the tree
19 * are data blocks. In between may be several layers of pointer blocks,
20 * forming branches.
22 * Three types of blocks are used:
23 * - Block nr 0 contains information for recovery
24 * - Pointer blocks contain list of pointers to other blocks.
25 * - Data blocks contain the actual text.
27 * Block nr 0 contains the block0 structure (see below).
29 * Block nr 1 is the first pointer block. It is the root of the tree.
30 * Other pointer blocks are branches.
32 * If a line is too big to fit in a single page, the block containing that
33 * line is made big enough to hold the line. It may span several pages.
34 * Otherwise all blocks are one page.
36 * A data block that was filled when starting to edit a file and was not
37 * changed since then, can have a negative block number. This means that it
38 * has not yet been assigned a place in the file. When recovering, the lines
39 * in this data block can be read from the original file. When the block is
40 * changed (lines appended/deleted/changed) or when it is flushed it gets a
41 * positive number. Use mf_trans_del() to get the new number, before calling
42 * mf_get().
45 #if defined(MSDOS) || defined(WIN32) || defined(_WIN64)
46 # include "vimio.h"
47 #endif
49 #include "vim.h"
51 #ifdef HAVE_FCNTL_H
52 # include <fcntl.h>
53 #endif
54 #ifndef UNIX /* it's in os_unix.h for Unix */
55 # include <time.h>
56 #endif
58 #if defined(SASC) || defined(__amigaos4__)
59 # include <proto/dos.h> /* for Open() and Close() */
60 #endif
62 #ifdef HAVE_ERRNO_H
63 # include <errno.h>
64 #endif
66 typedef struct block0 ZERO_BL; /* contents of the first block */
67 typedef struct pointer_block PTR_BL; /* contents of a pointer block */
68 typedef struct data_block DATA_BL; /* contents of a data block */
69 typedef struct pointer_entry PTR_EN; /* block/line-count pair */
71 #define DATA_ID (('d' << 8) + 'a') /* data block id */
72 #define PTR_ID (('p' << 8) + 't') /* pointer block id */
73 #define BLOCK0_ID0 'b' /* block 0 id 0 */
74 #define BLOCK0_ID1 '0' /* block 0 id 1 */
77 * pointer to a block, used in a pointer block
79 struct pointer_entry
81 blocknr_T pe_bnum; /* block number */
82 linenr_T pe_line_count; /* number of lines in this branch */
83 linenr_T pe_old_lnum; /* lnum for this block (for recovery) */
84 int pe_page_count; /* number of pages in block pe_bnum */
88 * A pointer block contains a list of branches in the tree.
90 struct pointer_block
92 short_u pb_id; /* ID for pointer block: PTR_ID */
93 short_u pb_count; /* number of pointer in this block */
94 short_u pb_count_max; /* maximum value for pb_count */
95 PTR_EN pb_pointer[1]; /* list of pointers to blocks (actually longer)
96 * followed by empty space until end of page */
100 * A data block is a leaf in the tree.
102 * The text of the lines is at the end of the block. The text of the first line
103 * in the block is put at the end, the text of the second line in front of it,
104 * etc. Thus the order of the lines is the opposite of the line number.
106 struct data_block
108 short_u db_id; /* ID for data block: DATA_ID */
109 unsigned db_free; /* free space available */
110 unsigned db_txt_start; /* byte where text starts */
111 unsigned db_txt_end; /* byte just after data block */
112 linenr_T db_line_count; /* number of lines in this block */
113 unsigned db_index[1]; /* index for start of line (actually bigger)
114 * followed by empty space upto db_txt_start
115 * followed by the text in the lines until
116 * end of page */
120 * The low bits of db_index hold the actual index. The topmost bit is
121 * used for the global command to be able to mark a line.
122 * This method is not clean, but otherwise there would be at least one extra
123 * byte used for each line.
124 * The mark has to be in this place to keep it with the correct line when other
125 * lines are inserted or deleted.
127 #define DB_MARKED ((unsigned)1 << ((sizeof(unsigned) * 8) - 1))
128 #define DB_INDEX_MASK (~DB_MARKED)
130 #define INDEX_SIZE (sizeof(unsigned)) /* size of one db_index entry */
131 #define HEADER_SIZE (sizeof(DATA_BL) - INDEX_SIZE) /* size of data block header */
133 #define B0_FNAME_SIZE_ORG 900 /* what it was in older versions */
134 #define B0_FNAME_SIZE 898
135 #define B0_UNAME_SIZE 40
136 #define B0_HNAME_SIZE 40
138 * Restrict the numbers to 32 bits, otherwise most compilers will complain.
139 * This won't detect a 64 bit machine that only swaps a byte in the top 32
140 * bits, but that is crazy anyway.
142 #define B0_MAGIC_LONG 0x30313233L
143 #define B0_MAGIC_INT 0x20212223L
144 #define B0_MAGIC_SHORT 0x10111213L
145 #define B0_MAGIC_CHAR 0x55
148 * Block zero holds all info about the swap file.
150 * NOTE: DEFINITION OF BLOCK 0 SHOULD NOT CHANGE! It would make all existing
151 * swap files unusable!
153 * If size of block0 changes anyway, adjust MIN_SWAP_PAGE_SIZE in vim.h!!
155 * This block is built up of single bytes, to make it portable accros
156 * different machines. b0_magic_* is used to check the byte order and size of
157 * variables, because the rest of the swap file is not portable.
159 struct block0
161 char_u b0_id[2]; /* id for block 0: BLOCK0_ID0 and BLOCK0_ID1 */
162 char_u b0_version[10]; /* Vim version string */
163 char_u b0_page_size[4];/* number of bytes per page */
164 char_u b0_mtime[4]; /* last modification time of file */
165 char_u b0_ino[4]; /* inode of b0_fname */
166 char_u b0_pid[4]; /* process id of creator (or 0) */
167 char_u b0_uname[B0_UNAME_SIZE]; /* name of user (uid if no name) */
168 char_u b0_hname[B0_HNAME_SIZE]; /* host name (if it has a name) */
169 char_u b0_fname[B0_FNAME_SIZE_ORG]; /* name of file being edited */
170 long b0_magic_long; /* check for byte order of long */
171 int b0_magic_int; /* check for byte order of int */
172 short b0_magic_short; /* check for byte order of short */
173 char_u b0_magic_char; /* check for last char */
177 * Note: b0_dirty and b0_flags are put at the end of the file name. For very
178 * long file names in older versions of Vim they are invalid.
179 * The 'fileencoding' comes before b0_flags, with a NUL in front. But only
180 * when there is room, for very long file names it's omitted.
182 #define B0_DIRTY 0x55
183 #define b0_dirty b0_fname[B0_FNAME_SIZE_ORG-1]
186 * The b0_flags field is new in Vim 7.0.
188 #define b0_flags b0_fname[B0_FNAME_SIZE_ORG-2]
190 /* The lowest two bits contain the fileformat. Zero means it's not set
191 * (compatible with Vim 6.x), otherwise it's EOL_UNIX + 1, EOL_DOS + 1 or
192 * EOL_MAC + 1. */
193 #define B0_FF_MASK 3
195 /* Swap file is in directory of edited file. Used to find the file from
196 * different mount points. */
197 #define B0_SAME_DIR 4
199 /* The 'fileencoding' is at the end of b0_fname[], with a NUL in front of it.
200 * When empty there is only the NUL. */
201 #define B0_HAS_FENC 8
203 #define STACK_INCR 5 /* nr of entries added to ml_stack at a time */
206 * The line number where the first mark may be is remembered.
207 * If it is 0 there are no marks at all.
208 * (always used for the current buffer only, no buffer change possible while
209 * executing a global command).
211 static linenr_T lowest_marked = 0;
214 * arguments for ml_find_line()
216 #define ML_DELETE 0x11 /* delete line */
217 #define ML_INSERT 0x12 /* insert line */
218 #define ML_FIND 0x13 /* just find the line */
219 #define ML_FLUSH 0x02 /* flush locked block */
220 #define ML_SIMPLE(x) (x & 0x10) /* DEL, INS or FIND */
222 static void ml_upd_block0 __ARGS((buf_T *buf, int set_fname));
223 static void set_b0_fname __ARGS((ZERO_BL *, buf_T *buf));
224 static void set_b0_dir_flag __ARGS((ZERO_BL *b0p, buf_T *buf));
225 #ifdef FEAT_MBYTE
226 static void add_b0_fenc __ARGS((ZERO_BL *b0p, buf_T *buf));
227 #endif
228 static time_t swapfile_info __ARGS((char_u *));
229 static int recov_file_names __ARGS((char_u **, char_u *, int prepend_dot));
230 static int ml_append_int __ARGS((buf_T *, linenr_T, char_u *, colnr_T, int, int));
231 static int ml_delete_int __ARGS((buf_T *, linenr_T, int));
232 static char_u *findswapname __ARGS((buf_T *, char_u **, char_u *));
233 static void ml_flush_line __ARGS((buf_T *));
234 static bhdr_T *ml_new_data __ARGS((memfile_T *, int, int));
235 static bhdr_T *ml_new_ptr __ARGS((memfile_T *));
236 static bhdr_T *ml_find_line __ARGS((buf_T *, linenr_T, int));
237 static int ml_add_stack __ARGS((buf_T *));
238 static void ml_lineadd __ARGS((buf_T *, int));
239 static int b0_magic_wrong __ARGS((ZERO_BL *));
240 #ifdef CHECK_INODE
241 static int fnamecmp_ino __ARGS((char_u *, char_u *, long));
242 #endif
243 static void long_to_char __ARGS((long, char_u *));
244 static long char_to_long __ARGS((char_u *));
245 #if defined(UNIX) || defined(WIN3264)
246 static char_u *make_percent_swname __ARGS((char_u *dir, char_u *name));
247 #endif
248 #ifdef FEAT_BYTEOFF
249 static void ml_updatechunk __ARGS((buf_T *buf, long line, long len, int updtype));
250 #endif
253 * Open a new memline for "buf".
255 * Return FAIL for failure, OK otherwise.
258 ml_open(buf)
259 buf_T *buf;
261 memfile_T *mfp;
262 bhdr_T *hp = NULL;
263 ZERO_BL *b0p;
264 PTR_BL *pp;
265 DATA_BL *dp;
268 * init fields in memline struct
270 buf->b_ml.ml_stack_size = 0; /* no stack yet */
271 buf->b_ml.ml_stack = NULL; /* no stack yet */
272 buf->b_ml.ml_stack_top = 0; /* nothing in the stack */
273 buf->b_ml.ml_locked = NULL; /* no cached block */
274 buf->b_ml.ml_line_lnum = 0; /* no cached line */
275 #ifdef FEAT_BYTEOFF
276 buf->b_ml.ml_chunksize = NULL;
277 #endif
280 * When 'updatecount' is non-zero swap file may be opened later.
282 if (p_uc && buf->b_p_swf)
283 buf->b_may_swap = TRUE;
284 else
285 buf->b_may_swap = FALSE;
288 * Open the memfile. No swap file is created yet.
290 mfp = mf_open(NULL, 0);
291 if (mfp == NULL)
292 goto error;
294 buf->b_ml.ml_mfp = mfp;
295 buf->b_ml.ml_flags = ML_EMPTY;
296 buf->b_ml.ml_line_count = 1;
297 #ifdef FEAT_LINEBREAK
298 curwin->w_nrwidth_line_count = 0;
299 #endif
301 #if defined(MSDOS) && !defined(DJGPP)
302 /* for 16 bit MS-DOS create a swapfile now, because we run out of
303 * memory very quickly */
304 if (p_uc != 0)
305 ml_open_file(buf);
306 #endif
309 * fill block0 struct and write page 0
311 if ((hp = mf_new(mfp, FALSE, 1)) == NULL)
312 goto error;
313 if (hp->bh_bnum != 0)
315 EMSG(_("E298: Didn't get block nr 0?"));
316 goto error;
318 b0p = (ZERO_BL *)(hp->bh_data);
320 b0p->b0_id[0] = BLOCK0_ID0;
321 b0p->b0_id[1] = BLOCK0_ID1;
322 b0p->b0_magic_long = (long)B0_MAGIC_LONG;
323 b0p->b0_magic_int = (int)B0_MAGIC_INT;
324 b0p->b0_magic_short = (short)B0_MAGIC_SHORT;
325 b0p->b0_magic_char = B0_MAGIC_CHAR;
326 STRNCPY(b0p->b0_version, "VIM ", 4);
327 STRNCPY(b0p->b0_version + 4, Version, 6);
328 long_to_char((long)mfp->mf_page_size, b0p->b0_page_size);
330 #ifdef FEAT_SPELL
331 if (!buf->b_spell)
332 #endif
334 b0p->b0_dirty = buf->b_changed ? B0_DIRTY : 0;
335 b0p->b0_flags = get_fileformat(buf) + 1;
336 set_b0_fname(b0p, buf);
337 (void)get_user_name(b0p->b0_uname, B0_UNAME_SIZE);
338 b0p->b0_uname[B0_UNAME_SIZE - 1] = NUL;
339 mch_get_host_name(b0p->b0_hname, B0_HNAME_SIZE);
340 b0p->b0_hname[B0_HNAME_SIZE - 1] = NUL;
341 long_to_char(mch_get_pid(), b0p->b0_pid);
345 * Always sync block number 0 to disk, so we can check the file name in
346 * the swap file in findswapname(). Don't do this for help files though
347 * and spell buffer though.
348 * Only works when there's a swapfile, otherwise it's done when the file
349 * is created.
351 mf_put(mfp, hp, TRUE, FALSE);
352 if (!buf->b_help && !B_SPELL(buf))
353 (void)mf_sync(mfp, 0);
356 * Fill in root pointer block and write page 1.
358 if ((hp = ml_new_ptr(mfp)) == NULL)
359 goto error;
360 if (hp->bh_bnum != 1)
362 EMSG(_("E298: Didn't get block nr 1?"));
363 goto error;
365 pp = (PTR_BL *)(hp->bh_data);
366 pp->pb_count = 1;
367 pp->pb_pointer[0].pe_bnum = 2;
368 pp->pb_pointer[0].pe_page_count = 1;
369 pp->pb_pointer[0].pe_old_lnum = 1;
370 pp->pb_pointer[0].pe_line_count = 1; /* line count after insertion */
371 mf_put(mfp, hp, TRUE, FALSE);
374 * Allocate first data block and create an empty line 1.
376 if ((hp = ml_new_data(mfp, FALSE, 1)) == NULL)
377 goto error;
378 if (hp->bh_bnum != 2)
380 EMSG(_("E298: Didn't get block nr 2?"));
381 goto error;
384 dp = (DATA_BL *)(hp->bh_data);
385 dp->db_index[0] = --dp->db_txt_start; /* at end of block */
386 dp->db_free -= 1 + INDEX_SIZE;
387 dp->db_line_count = 1;
388 *((char_u *)dp + dp->db_txt_start) = NUL; /* emtpy line */
390 return OK;
392 error:
393 if (mfp != NULL)
395 if (hp)
396 mf_put(mfp, hp, FALSE, FALSE);
397 mf_close(mfp, TRUE); /* will also free(mfp->mf_fname) */
399 buf->b_ml.ml_mfp = NULL;
400 return FAIL;
404 * ml_setname() is called when the file name of "buf" has been changed.
405 * It may rename the swap file.
407 void
408 ml_setname(buf)
409 buf_T *buf;
411 int success = FALSE;
412 memfile_T *mfp;
413 char_u *fname;
414 char_u *dirp;
415 #if defined(MSDOS) || defined(MSWIN)
416 char_u *p;
417 #endif
419 mfp = buf->b_ml.ml_mfp;
420 if (mfp->mf_fd < 0) /* there is no swap file yet */
423 * When 'updatecount' is 0 and 'noswapfile' there is no swap file.
424 * For help files we will make a swap file now.
426 if (p_uc != 0)
427 ml_open_file(buf); /* create a swap file */
428 return;
432 * Try all directories in the 'directory' option.
434 dirp = p_dir;
435 for (;;)
437 if (*dirp == NUL) /* tried all directories, fail */
438 break;
439 fname = findswapname(buf, &dirp, mfp->mf_fname);
440 /* alloc's fname */
441 if (fname == NULL) /* no file name found for this dir */
442 continue;
444 #if defined(MSDOS) || defined(MSWIN)
446 * Set full pathname for swap file now, because a ":!cd dir" may
447 * change directory without us knowing it.
449 p = FullName_save(fname, FALSE);
450 vim_free(fname);
451 fname = p;
452 if (fname == NULL)
453 continue;
454 #endif
455 /* if the file name is the same we don't have to do anything */
456 if (fnamecmp(fname, mfp->mf_fname) == 0)
458 vim_free(fname);
459 success = TRUE;
460 break;
462 /* need to close the swap file before renaming */
463 if (mfp->mf_fd >= 0)
465 close(mfp->mf_fd);
466 mfp->mf_fd = -1;
469 /* try to rename the swap file */
470 if (vim_rename(mfp->mf_fname, fname) == 0)
472 success = TRUE;
473 vim_free(mfp->mf_fname);
474 mfp->mf_fname = fname;
475 vim_free(mfp->mf_ffname);
476 #if defined(MSDOS) || defined(MSWIN)
477 mfp->mf_ffname = NULL; /* mf_fname is full pathname already */
478 #else
479 mf_set_ffname(mfp);
480 #endif
481 ml_upd_block0(buf, FALSE);
482 break;
484 vim_free(fname); /* this fname didn't work, try another */
487 if (mfp->mf_fd == -1) /* need to (re)open the swap file */
489 mfp->mf_fd = mch_open((char *)mfp->mf_fname, O_RDWR | O_EXTRA, 0);
490 if (mfp->mf_fd < 0)
492 /* could not (re)open the swap file, what can we do???? */
493 EMSG(_("E301: Oops, lost the swap file!!!"));
494 return;
497 if (!success)
498 EMSG(_("E302: Could not rename swap file"));
502 * Open a file for the memfile for all buffers that are not readonly or have
503 * been modified.
504 * Used when 'updatecount' changes from zero to non-zero.
506 void
507 ml_open_files()
509 buf_T *buf;
511 for (buf = firstbuf; buf != NULL; buf = buf->b_next)
512 if (!buf->b_p_ro || buf->b_changed)
513 ml_open_file(buf);
517 * Open a swap file for an existing memfile, if there is no swap file yet.
518 * If we are unable to find a file name, mf_fname will be NULL
519 * and the memfile will be in memory only (no recovery possible).
521 void
522 ml_open_file(buf)
523 buf_T *buf;
525 memfile_T *mfp;
526 char_u *fname;
527 char_u *dirp;
529 mfp = buf->b_ml.ml_mfp;
530 if (mfp == NULL || mfp->mf_fd >= 0 || !buf->b_p_swf)
531 return; /* nothing to do */
533 #ifdef FEAT_SPELL
534 /* For a spell buffer use a temp file name. */
535 if (buf->b_spell)
537 fname = vim_tempname('s');
538 if (fname != NULL)
539 (void)mf_open_file(mfp, fname); /* consumes fname! */
540 buf->b_may_swap = FALSE;
541 return;
543 #endif
546 * Try all directories in 'directory' option.
548 dirp = p_dir;
549 for (;;)
551 if (*dirp == NUL)
552 break;
553 /* There is a small chance that between chosing the swap file name and
554 * creating it, another Vim creates the file. In that case the
555 * creation will fail and we will use another directory. */
556 fname = findswapname(buf, &dirp, NULL); /* allocates fname */
557 if (fname == NULL)
558 continue;
559 if (mf_open_file(mfp, fname) == OK) /* consumes fname! */
561 #if defined(MSDOS) || defined(MSWIN) || defined(RISCOS)
563 * set full pathname for swap file now, because a ":!cd dir" may
564 * change directory without us knowing it.
566 mf_fullname(mfp);
567 #endif
568 ml_upd_block0(buf, FALSE);
570 /* Flush block zero, so others can read it */
571 if (mf_sync(mfp, MFS_ZERO) == OK)
573 /* Mark all blocks that should be in the swapfile as dirty.
574 * Needed for when the 'swapfile' option was reset, so that
575 * the swap file was deleted, and then on again. */
576 mf_set_dirty(mfp);
577 break;
579 /* Writing block 0 failed: close the file and try another dir */
580 mf_close_file(buf, FALSE);
584 if (mfp->mf_fname == NULL) /* Failed! */
586 need_wait_return = TRUE; /* call wait_return later */
587 ++no_wait_return;
588 (void)EMSG2(_("E303: Unable to open swap file for \"%s\", recovery impossible"),
589 buf_spname(buf) != NULL
590 ? (char_u *)buf_spname(buf)
591 : buf->b_fname);
592 --no_wait_return;
595 /* don't try to open a swap file again */
596 buf->b_may_swap = FALSE;
600 * If still need to create a swap file, and starting to edit a not-readonly
601 * file, or reading into an existing buffer, create a swap file now.
603 void
604 check_need_swap(newfile)
605 int newfile; /* reading file into new buffer */
607 if (curbuf->b_may_swap && (!curbuf->b_p_ro || !newfile))
608 ml_open_file(curbuf);
612 * Close memline for buffer 'buf'.
613 * If 'del_file' is TRUE, delete the swap file
615 void
616 ml_close(buf, del_file)
617 buf_T *buf;
618 int del_file;
620 if (buf->b_ml.ml_mfp == NULL) /* not open */
621 return;
622 mf_close(buf->b_ml.ml_mfp, del_file); /* close the .swp file */
623 if (buf->b_ml.ml_line_lnum != 0 && (buf->b_ml.ml_flags & ML_LINE_DIRTY))
624 vim_free(buf->b_ml.ml_line_ptr);
625 vim_free(buf->b_ml.ml_stack);
626 #ifdef FEAT_BYTEOFF
627 vim_free(buf->b_ml.ml_chunksize);
628 buf->b_ml.ml_chunksize = NULL;
629 #endif
630 buf->b_ml.ml_mfp = NULL;
632 /* Reset the "recovered" flag, give the ATTENTION prompt the next time
633 * this buffer is loaded. */
634 buf->b_flags &= ~BF_RECOVERED;
638 * Close all existing memlines and memfiles.
639 * Only used when exiting.
640 * When 'del_file' is TRUE, delete the memfiles.
641 * But don't delete files that were ":preserve"d when we are POSIX compatible.
643 void
644 ml_close_all(del_file)
645 int del_file;
647 buf_T *buf;
649 for (buf = firstbuf; buf != NULL; buf = buf->b_next)
650 ml_close(buf, del_file && ((buf->b_flags & BF_PRESERVED) == 0
651 || vim_strchr(p_cpo, CPO_PRESERVE) == NULL));
652 #ifdef TEMPDIRNAMES
653 vim_deltempdir(); /* delete created temp directory */
654 #endif
658 * Close all memfiles for not modified buffers.
659 * Only use just before exiting!
661 void
662 ml_close_notmod()
664 buf_T *buf;
666 for (buf = firstbuf; buf != NULL; buf = buf->b_next)
667 if (!bufIsChanged(buf))
668 ml_close(buf, TRUE); /* close all not-modified buffers */
672 * Update the timestamp in the .swp file.
673 * Used when the file has been written.
675 void
676 ml_timestamp(buf)
677 buf_T *buf;
679 ml_upd_block0(buf, TRUE);
683 * Update the timestamp or the B0_SAME_DIR flag of the .swp file.
685 static void
686 ml_upd_block0(buf, set_fname)
687 buf_T *buf;
688 int set_fname;
690 memfile_T *mfp;
691 bhdr_T *hp;
692 ZERO_BL *b0p;
694 mfp = buf->b_ml.ml_mfp;
695 if (mfp == NULL || (hp = mf_get(mfp, (blocknr_T)0, 1)) == NULL)
696 return;
697 b0p = (ZERO_BL *)(hp->bh_data);
698 if (b0p->b0_id[0] != BLOCK0_ID0 || b0p->b0_id[1] != BLOCK0_ID1)
699 EMSG(_("E304: ml_upd_block0(): Didn't get block 0??"));
700 else
702 if (set_fname)
703 set_b0_fname(b0p, buf);
704 else
705 set_b0_dir_flag(b0p, buf);
707 mf_put(mfp, hp, TRUE, FALSE);
711 * Write file name and timestamp into block 0 of a swap file.
712 * Also set buf->b_mtime.
713 * Don't use NameBuff[]!!!
715 static void
716 set_b0_fname(b0p, buf)
717 ZERO_BL *b0p;
718 buf_T *buf;
720 struct stat st;
722 if (buf->b_ffname == NULL)
723 b0p->b0_fname[0] = NUL;
724 else
726 #if defined(MSDOS) || defined(MSWIN) || defined(AMIGA) || defined(RISCOS)
727 /* Systems that cannot translate "~user" back into a path: copy the
728 * file name unmodified. Do use slashes instead of backslashes for
729 * portability. */
730 vim_strncpy(b0p->b0_fname, buf->b_ffname, B0_FNAME_SIZE - 1);
731 # ifdef BACKSLASH_IN_FILENAME
732 forward_slash(b0p->b0_fname);
733 # endif
734 #else
735 size_t flen, ulen;
736 char_u uname[B0_UNAME_SIZE];
739 * For a file under the home directory of the current user, we try to
740 * replace the home directory path with "~user". This helps when
741 * editing the same file on different machines over a network.
742 * First replace home dir path with "~/" with home_replace().
743 * Then insert the user name to get "~user/".
745 home_replace(NULL, buf->b_ffname, b0p->b0_fname, B0_FNAME_SIZE, TRUE);
746 if (b0p->b0_fname[0] == '~')
748 flen = STRLEN(b0p->b0_fname);
749 /* If there is no user name or it is too long, don't use "~/" */
750 if (get_user_name(uname, B0_UNAME_SIZE) == FAIL
751 || (ulen = STRLEN(uname)) + flen > B0_FNAME_SIZE - 1)
752 vim_strncpy(b0p->b0_fname, buf->b_ffname, B0_FNAME_SIZE - 1);
753 else
755 mch_memmove(b0p->b0_fname + ulen + 1, b0p->b0_fname + 1, flen);
756 mch_memmove(b0p->b0_fname + 1, uname, ulen);
759 #endif
760 if (mch_stat((char *)buf->b_ffname, &st) >= 0)
762 long_to_char((long)st.st_mtime, b0p->b0_mtime);
763 #ifdef CHECK_INODE
764 long_to_char((long)st.st_ino, b0p->b0_ino);
765 #endif
766 buf_store_time(buf, &st, buf->b_ffname);
767 buf->b_mtime_read = buf->b_mtime;
769 else
771 long_to_char(0L, b0p->b0_mtime);
772 #ifdef CHECK_INODE
773 long_to_char(0L, b0p->b0_ino);
774 #endif
775 buf->b_mtime = 0;
776 buf->b_mtime_read = 0;
777 buf->b_orig_size = 0;
778 buf->b_orig_mode = 0;
782 #ifdef FEAT_MBYTE
783 /* Also add the 'fileencoding' if there is room. */
784 add_b0_fenc(b0p, curbuf);
785 #endif
789 * Update the B0_SAME_DIR flag of the swap file. It's set if the file and the
790 * swapfile for "buf" are in the same directory.
791 * This is fail safe: if we are not sure the directories are equal the flag is
792 * not set.
794 static void
795 set_b0_dir_flag(b0p, buf)
796 ZERO_BL *b0p;
797 buf_T *buf;
799 if (same_directory(buf->b_ml.ml_mfp->mf_fname, buf->b_ffname))
800 b0p->b0_flags |= B0_SAME_DIR;
801 else
802 b0p->b0_flags &= ~B0_SAME_DIR;
805 #ifdef FEAT_MBYTE
807 * When there is room, add the 'fileencoding' to block zero.
809 static void
810 add_b0_fenc(b0p, buf)
811 ZERO_BL *b0p;
812 buf_T *buf;
814 int n;
816 n = (int)STRLEN(buf->b_p_fenc);
817 if (STRLEN(b0p->b0_fname) + n + 1 > B0_FNAME_SIZE)
818 b0p->b0_flags &= ~B0_HAS_FENC;
819 else
821 mch_memmove((char *)b0p->b0_fname + B0_FNAME_SIZE - n,
822 (char *)buf->b_p_fenc, (size_t)n);
823 *(b0p->b0_fname + B0_FNAME_SIZE - n - 1) = NUL;
824 b0p->b0_flags |= B0_HAS_FENC;
827 #endif
831 * try to recover curbuf from the .swp file
833 void
834 ml_recover()
836 buf_T *buf = NULL;
837 memfile_T *mfp = NULL;
838 char_u *fname;
839 bhdr_T *hp = NULL;
840 ZERO_BL *b0p;
841 int b0_ff;
842 char_u *b0_fenc = NULL;
843 PTR_BL *pp;
844 DATA_BL *dp;
845 infoptr_T *ip;
846 blocknr_T bnum;
847 int page_count;
848 struct stat org_stat, swp_stat;
849 int len;
850 int directly;
851 linenr_T lnum;
852 char_u *p;
853 int i;
854 long error;
855 int cannot_open;
856 linenr_T line_count;
857 int has_error;
858 int idx;
859 int top;
860 int txt_start;
861 off_t size;
862 int called_from_main;
863 int serious_error = TRUE;
864 long mtime;
865 int attr;
867 recoverymode = TRUE;
868 called_from_main = (curbuf->b_ml.ml_mfp == NULL);
869 attr = hl_attr(HLF_E);
871 * If the file name ends in ".sw?" we use it directly.
872 * Otherwise a search is done to find the swap file(s).
874 fname = curbuf->b_fname;
875 if (fname == NULL) /* When there is no file name */
876 fname = (char_u *)"";
877 len = (int)STRLEN(fname);
878 if (len >= 4 &&
879 #if defined(VMS) || defined(RISCOS)
880 STRNICMP(fname + len - 4, "_sw" , 3)
881 #else
882 STRNICMP(fname + len - 4, ".sw" , 3)
883 #endif
884 == 0)
886 directly = TRUE;
887 fname = vim_strsave(fname); /* make a copy for mf_open() */
889 else
891 directly = FALSE;
893 /* count the number of matching swap files */
894 len = recover_names(&fname, FALSE, 0);
895 if (len == 0) /* no swap files found */
897 EMSG2(_("E305: No swap file found for %s"), fname);
898 goto theend;
900 if (len == 1) /* one swap file found, use it */
901 i = 1;
902 else /* several swap files found, choose */
904 /* list the names of the swap files */
905 (void)recover_names(&fname, TRUE, 0);
906 msg_putchar('\n');
907 MSG_PUTS(_("Enter number of swap file to use (0 to quit): "));
908 i = get_number(FALSE, NULL);
909 if (i < 1 || i > len)
910 goto theend;
912 /* get the swap file name that will be used */
913 (void)recover_names(&fname, FALSE, i);
915 if (fname == NULL)
916 goto theend; /* out of memory */
918 /* When called from main() still need to initialize storage structure */
919 if (called_from_main && ml_open(curbuf) == FAIL)
920 getout(1);
923 * allocate a buffer structure (only the memline in it is really used)
925 buf = (buf_T *)alloc((unsigned)sizeof(buf_T));
926 if (buf == NULL)
928 vim_free(fname);
929 goto theend;
933 * init fields in memline struct
935 buf->b_ml.ml_stack_size = 0; /* no stack yet */
936 buf->b_ml.ml_stack = NULL; /* no stack yet */
937 buf->b_ml.ml_stack_top = 0; /* nothing in the stack */
938 buf->b_ml.ml_line_lnum = 0; /* no cached line */
939 buf->b_ml.ml_locked = NULL; /* no locked block */
940 buf->b_ml.ml_flags = 0;
943 * open the memfile from the old swap file
945 p = vim_strsave(fname); /* save fname for the message
946 (mf_open() may free fname) */
947 mfp = mf_open(fname, O_RDONLY); /* consumes fname! */
948 if (mfp == NULL || mfp->mf_fd < 0)
950 if (p != NULL)
952 EMSG2(_("E306: Cannot open %s"), p);
953 vim_free(p);
955 goto theend;
957 vim_free(p);
958 buf->b_ml.ml_mfp = mfp;
961 * The page size set in mf_open() might be different from the page size
962 * used in the swap file, we must get it from block 0. But to read block
963 * 0 we need a page size. Use the minimal size for block 0 here, it will
964 * be set to the real value below.
966 mfp->mf_page_size = MIN_SWAP_PAGE_SIZE;
969 * try to read block 0
971 if ((hp = mf_get(mfp, (blocknr_T)0, 1)) == NULL)
973 msg_start();
974 MSG_PUTS_ATTR(_("Unable to read block 0 from "), attr | MSG_HIST);
975 msg_outtrans_attr(mfp->mf_fname, attr | MSG_HIST);
976 MSG_PUTS_ATTR(
977 _("\nMaybe no changes were made or Vim did not update the swap file."),
978 attr | MSG_HIST);
979 msg_end();
980 goto theend;
982 b0p = (ZERO_BL *)(hp->bh_data);
983 if (STRNCMP(b0p->b0_version, "VIM 3.0", 7) == 0)
985 msg_start();
986 msg_outtrans_attr(mfp->mf_fname, MSG_HIST);
987 MSG_PUTS_ATTR(_(" cannot be used with this version of Vim.\n"),
988 MSG_HIST);
989 MSG_PUTS_ATTR(_("Use Vim version 3.0.\n"), MSG_HIST);
990 msg_end();
991 goto theend;
993 if (b0p->b0_id[0] != BLOCK0_ID0 || b0p->b0_id[1] != BLOCK0_ID1)
995 EMSG2(_("E307: %s does not look like a Vim swap file"), mfp->mf_fname);
996 goto theend;
998 if (b0_magic_wrong(b0p))
1000 msg_start();
1001 msg_outtrans_attr(mfp->mf_fname, attr | MSG_HIST);
1002 #if defined(MSDOS) || defined(MSWIN)
1003 if (STRNCMP(b0p->b0_hname, "PC ", 3) == 0)
1004 MSG_PUTS_ATTR(_(" cannot be used with this version of Vim.\n"),
1005 attr | MSG_HIST);
1006 else
1007 #endif
1008 MSG_PUTS_ATTR(_(" cannot be used on this computer.\n"),
1009 attr | MSG_HIST);
1010 MSG_PUTS_ATTR(_("The file was created on "), attr | MSG_HIST);
1011 /* avoid going past the end of a currupted hostname */
1012 b0p->b0_fname[0] = NUL;
1013 MSG_PUTS_ATTR(b0p->b0_hname, attr | MSG_HIST);
1014 MSG_PUTS_ATTR(_(",\nor the file has been damaged."), attr | MSG_HIST);
1015 msg_end();
1016 goto theend;
1019 * If we guessed the wrong page size, we have to recalculate the
1020 * highest block number in the file.
1022 if (mfp->mf_page_size != (unsigned)char_to_long(b0p->b0_page_size))
1024 mf_new_page_size(mfp, (unsigned)char_to_long(b0p->b0_page_size));
1025 if ((size = lseek(mfp->mf_fd, (off_t)0L, SEEK_END)) <= 0)
1026 mfp->mf_blocknr_max = 0; /* no file or empty file */
1027 else
1028 mfp->mf_blocknr_max = (blocknr_T)(size / mfp->mf_page_size);
1029 mfp->mf_infile_count = mfp->mf_blocknr_max;
1033 * If .swp file name given directly, use name from swap file for buffer.
1035 if (directly)
1037 expand_env(b0p->b0_fname, NameBuff, MAXPATHL);
1038 if (setfname(curbuf, NameBuff, NULL, TRUE) == FAIL)
1039 goto theend;
1042 home_replace(NULL, mfp->mf_fname, NameBuff, MAXPATHL, TRUE);
1043 smsg((char_u *)_("Using swap file \"%s\""), NameBuff);
1045 if (buf_spname(curbuf) != NULL)
1046 STRCPY(NameBuff, buf_spname(curbuf));
1047 else
1048 home_replace(NULL, curbuf->b_ffname, NameBuff, MAXPATHL, TRUE);
1049 smsg((char_u *)_("Original file \"%s\""), NameBuff);
1050 msg_putchar('\n');
1053 * check date of swap file and original file
1055 mtime = char_to_long(b0p->b0_mtime);
1056 if (curbuf->b_ffname != NULL
1057 && mch_stat((char *)curbuf->b_ffname, &org_stat) != -1
1058 && ((mch_stat((char *)mfp->mf_fname, &swp_stat) != -1
1059 && org_stat.st_mtime > swp_stat.st_mtime)
1060 || org_stat.st_mtime != mtime))
1062 EMSG(_("E308: Warning: Original file may have been changed"));
1064 out_flush();
1066 /* Get the 'fileformat' and 'fileencoding' from block zero. */
1067 b0_ff = (b0p->b0_flags & B0_FF_MASK);
1068 if (b0p->b0_flags & B0_HAS_FENC)
1070 for (p = b0p->b0_fname + B0_FNAME_SIZE;
1071 p > b0p->b0_fname && p[-1] != NUL; --p)
1073 b0_fenc = vim_strnsave(p, (int)(b0p->b0_fname + B0_FNAME_SIZE - p));
1076 mf_put(mfp, hp, FALSE, FALSE); /* release block 0 */
1077 hp = NULL;
1080 * Now that we are sure that the file is going to be recovered, clear the
1081 * contents of the current buffer.
1083 while (!(curbuf->b_ml.ml_flags & ML_EMPTY))
1084 ml_delete((linenr_T)1, FALSE);
1087 * Try reading the original file to obtain the values of 'fileformat',
1088 * 'fileencoding', etc. Ignore errors. The text itself is not used.
1090 if (curbuf->b_ffname != NULL)
1092 (void)readfile(curbuf->b_ffname, NULL, (linenr_T)0,
1093 (linenr_T)0, (linenr_T)MAXLNUM, NULL, READ_NEW);
1094 while (!(curbuf->b_ml.ml_flags & ML_EMPTY))
1095 ml_delete((linenr_T)1, FALSE);
1098 /* Use the 'fileformat' and 'fileencoding' as stored in the swap file. */
1099 if (b0_ff != 0)
1100 set_fileformat(b0_ff - 1, OPT_LOCAL);
1101 if (b0_fenc != NULL)
1103 set_option_value((char_u *)"fenc", 0L, b0_fenc, OPT_LOCAL);
1104 vim_free(b0_fenc);
1106 unchanged(curbuf, TRUE);
1108 bnum = 1; /* start with block 1 */
1109 page_count = 1; /* which is 1 page */
1110 lnum = 0; /* append after line 0 in curbuf */
1111 line_count = 0;
1112 idx = 0; /* start with first index in block 1 */
1113 error = 0;
1114 buf->b_ml.ml_stack_top = 0;
1115 buf->b_ml.ml_stack = NULL;
1116 buf->b_ml.ml_stack_size = 0; /* no stack yet */
1118 if (curbuf->b_ffname == NULL)
1119 cannot_open = TRUE;
1120 else
1121 cannot_open = FALSE;
1123 serious_error = FALSE;
1124 for ( ; !got_int; line_breakcheck())
1126 if (hp != NULL)
1127 mf_put(mfp, hp, FALSE, FALSE); /* release previous block */
1130 * get block
1132 if ((hp = mf_get(mfp, (blocknr_T)bnum, page_count)) == NULL)
1134 if (bnum == 1)
1136 EMSG2(_("E309: Unable to read block 1 from %s"), mfp->mf_fname);
1137 goto theend;
1139 ++error;
1140 ml_append(lnum++, (char_u *)_("???MANY LINES MISSING"),
1141 (colnr_T)0, TRUE);
1143 else /* there is a block */
1145 pp = (PTR_BL *)(hp->bh_data);
1146 if (pp->pb_id == PTR_ID) /* it is a pointer block */
1148 /* check line count when using pointer block first time */
1149 if (idx == 0 && line_count != 0)
1151 for (i = 0; i < (int)pp->pb_count; ++i)
1152 line_count -= pp->pb_pointer[i].pe_line_count;
1153 if (line_count != 0)
1155 ++error;
1156 ml_append(lnum++, (char_u *)_("???LINE COUNT WRONG"),
1157 (colnr_T)0, TRUE);
1161 if (pp->pb_count == 0)
1163 ml_append(lnum++, (char_u *)_("???EMPTY BLOCK"),
1164 (colnr_T)0, TRUE);
1165 ++error;
1167 else if (idx < (int)pp->pb_count) /* go a block deeper */
1169 if (pp->pb_pointer[idx].pe_bnum < 0)
1172 * Data block with negative block number.
1173 * Try to read lines from the original file.
1174 * This is slow, but it works.
1176 if (!cannot_open)
1178 line_count = pp->pb_pointer[idx].pe_line_count;
1179 if (readfile(curbuf->b_ffname, NULL, lnum,
1180 pp->pb_pointer[idx].pe_old_lnum - 1,
1181 line_count, NULL, 0) == FAIL)
1182 cannot_open = TRUE;
1183 else
1184 lnum += line_count;
1186 if (cannot_open)
1188 ++error;
1189 ml_append(lnum++, (char_u *)_("???LINES MISSING"),
1190 (colnr_T)0, TRUE);
1192 ++idx; /* get same block again for next index */
1193 continue;
1197 * going one block deeper in the tree
1199 if ((top = ml_add_stack(buf)) < 0) /* new entry in stack */
1201 ++error;
1202 break; /* out of memory */
1204 ip = &(buf->b_ml.ml_stack[top]);
1205 ip->ip_bnum = bnum;
1206 ip->ip_index = idx;
1208 bnum = pp->pb_pointer[idx].pe_bnum;
1209 line_count = pp->pb_pointer[idx].pe_line_count;
1210 page_count = pp->pb_pointer[idx].pe_page_count;
1211 continue;
1214 else /* not a pointer block */
1216 dp = (DATA_BL *)(hp->bh_data);
1217 if (dp->db_id != DATA_ID) /* block id wrong */
1219 if (bnum == 1)
1221 EMSG2(_("E310: Block 1 ID wrong (%s not a .swp file?)"),
1222 mfp->mf_fname);
1223 goto theend;
1225 ++error;
1226 ml_append(lnum++, (char_u *)_("???BLOCK MISSING"),
1227 (colnr_T)0, TRUE);
1229 else
1232 * it is a data block
1233 * Append all the lines in this block
1235 has_error = FALSE;
1237 * check length of block
1238 * if wrong, use length in pointer block
1240 if (page_count * mfp->mf_page_size != dp->db_txt_end)
1242 ml_append(lnum++, (char_u *)_("??? from here until ???END lines may be messed up"),
1243 (colnr_T)0, TRUE);
1244 ++error;
1245 has_error = TRUE;
1246 dp->db_txt_end = page_count * mfp->mf_page_size;
1249 /* make sure there is a NUL at the end of the block */
1250 *((char_u *)dp + dp->db_txt_end - 1) = NUL;
1253 * check number of lines in block
1254 * if wrong, use count in data block
1256 if (line_count != dp->db_line_count)
1258 ml_append(lnum++, (char_u *)_("??? from here until ???END lines may have been inserted/deleted"),
1259 (colnr_T)0, TRUE);
1260 ++error;
1261 has_error = TRUE;
1264 for (i = 0; i < dp->db_line_count; ++i)
1266 txt_start = (dp->db_index[i] & DB_INDEX_MASK);
1267 if (txt_start <= HEADER_SIZE
1268 || txt_start >= (int)dp->db_txt_end)
1270 p = (char_u *)"???";
1271 ++error;
1273 else
1274 p = (char_u *)dp + txt_start;
1275 ml_append(lnum++, p, (colnr_T)0, TRUE);
1277 if (has_error)
1278 ml_append(lnum++, (char_u *)_("???END"), (colnr_T)0, TRUE);
1283 if (buf->b_ml.ml_stack_top == 0) /* finished */
1284 break;
1287 * go one block up in the tree
1289 ip = &(buf->b_ml.ml_stack[--(buf->b_ml.ml_stack_top)]);
1290 bnum = ip->ip_bnum;
1291 idx = ip->ip_index + 1; /* go to next index */
1292 page_count = 1;
1296 * The dummy line from the empty buffer will now be after the last line in
1297 * the buffer. Delete it.
1299 ml_delete(curbuf->b_ml.ml_line_count, FALSE);
1300 curbuf->b_flags |= BF_RECOVERED;
1302 recoverymode = FALSE;
1303 if (got_int)
1304 EMSG(_("E311: Recovery Interrupted"));
1305 else if (error)
1307 ++no_wait_return;
1308 MSG(">>>>>>>>>>>>>");
1309 EMSG(_("E312: Errors detected while recovering; look for lines starting with ???"));
1310 --no_wait_return;
1311 MSG(_("See \":help E312\" for more information."));
1312 MSG(">>>>>>>>>>>>>");
1314 else
1316 MSG(_("Recovery completed. You should check if everything is OK."));
1317 MSG_PUTS(_("\n(You might want to write out this file under another name\n"));
1318 MSG_PUTS(_("and run diff with the original file to check for changes)\n"));
1319 MSG_PUTS(_("Delete the .swp file afterwards.\n\n"));
1320 cmdline_row = msg_row;
1322 redraw_curbuf_later(NOT_VALID);
1324 theend:
1325 recoverymode = FALSE;
1326 if (mfp != NULL)
1328 if (hp != NULL)
1329 mf_put(mfp, hp, FALSE, FALSE);
1330 mf_close(mfp, FALSE); /* will also vim_free(mfp->mf_fname) */
1332 if (buf != NULL)
1334 vim_free(buf->b_ml.ml_stack);
1335 vim_free(buf);
1337 if (serious_error && called_from_main)
1338 ml_close(curbuf, TRUE);
1339 #ifdef FEAT_AUTOCMD
1340 else
1342 apply_autocmds(EVENT_BUFREADPOST, NULL, curbuf->b_fname, FALSE, curbuf);
1343 apply_autocmds(EVENT_BUFWINENTER, NULL, curbuf->b_fname, FALSE, curbuf);
1345 #endif
1346 return;
1350 * Find the names of swap files in current directory and the directory given
1351 * with the 'directory' option.
1353 * Used to:
1354 * - list the swap files for "vim -r"
1355 * - count the number of swap files when recovering
1356 * - list the swap files when recovering
1357 * - find the name of the n'th swap file when recovering
1360 recover_names(fname, list, nr)
1361 char_u **fname; /* base for swap file name */
1362 int list; /* when TRUE, list the swap file names */
1363 int nr; /* when non-zero, return nr'th swap file name */
1365 int num_names;
1366 char_u *(names[6]);
1367 char_u *tail;
1368 char_u *p;
1369 int num_files;
1370 int file_count = 0;
1371 char_u **files;
1372 int i;
1373 char_u *dirp;
1374 char_u *dir_name;
1376 if (list)
1378 /* use msg() to start the scrolling properly */
1379 msg((char_u *)_("Swap files found:"));
1380 msg_putchar('\n');
1384 * Do the loop for every directory in 'directory'.
1385 * First allocate some memory to put the directory name in.
1387 dir_name = alloc((unsigned)STRLEN(p_dir) + 1);
1388 dirp = p_dir;
1389 while (dir_name != NULL && *dirp)
1392 * Isolate a directory name from *dirp and put it in dir_name (we know
1393 * it is large enough, so use 31000 for length).
1394 * Advance dirp to next directory name.
1396 (void)copy_option_part(&dirp, dir_name, 31000, ",");
1398 if (dir_name[0] == '.' && dir_name[1] == NUL) /* check current dir */
1400 if (fname == NULL || *fname == NULL)
1402 #ifdef VMS
1403 names[0] = vim_strsave((char_u *)"*_sw%");
1404 #else
1405 # ifdef RISCOS
1406 names[0] = vim_strsave((char_u *)"*_sw#");
1407 # else
1408 names[0] = vim_strsave((char_u *)"*.sw?");
1409 # endif
1410 #endif
1411 #if defined(UNIX) || defined(WIN3264)
1412 /* For Unix names starting with a dot are special. MS-Windows
1413 * supports this too, on some file systems. */
1414 names[1] = vim_strsave((char_u *)".*.sw?");
1415 names[2] = vim_strsave((char_u *)".sw?");
1416 num_names = 3;
1417 #else
1418 # ifdef VMS
1419 names[1] = vim_strsave((char_u *)".*_sw%");
1420 num_names = 2;
1421 # else
1422 num_names = 1;
1423 # endif
1424 #endif
1426 else
1427 num_names = recov_file_names(names, *fname, TRUE);
1429 else /* check directory dir_name */
1431 if (fname == NULL || *fname == NULL)
1433 #ifdef VMS
1434 names[0] = concat_fnames(dir_name, (char_u *)"*_sw%", TRUE);
1435 #else
1436 # ifdef RISCOS
1437 names[0] = concat_fnames(dir_name, (char_u *)"*_sw#", TRUE);
1438 # else
1439 names[0] = concat_fnames(dir_name, (char_u *)"*.sw?", TRUE);
1440 # endif
1441 #endif
1442 #if defined(UNIX) || defined(WIN3264)
1443 /* For Unix names starting with a dot are special. MS-Windows
1444 * supports this too, on some file systems. */
1445 names[1] = concat_fnames(dir_name, (char_u *)".*.sw?", TRUE);
1446 names[2] = concat_fnames(dir_name, (char_u *)".sw?", TRUE);
1447 num_names = 3;
1448 #else
1449 # ifdef VMS
1450 names[1] = concat_fnames(dir_name, (char_u *)".*_sw%", TRUE);
1451 num_names = 2;
1452 # else
1453 num_names = 1;
1454 # endif
1455 #endif
1457 else
1459 #if defined(UNIX) || defined(WIN3264)
1460 p = dir_name + STRLEN(dir_name);
1461 if (after_pathsep(dir_name, p) && p[-1] == p[-2])
1463 /* Ends with '//', Use Full path for swap name */
1464 tail = make_percent_swname(dir_name, *fname);
1466 else
1467 #endif
1469 tail = gettail(*fname);
1470 tail = concat_fnames(dir_name, tail, TRUE);
1472 if (tail == NULL)
1473 num_names = 0;
1474 else
1476 num_names = recov_file_names(names, tail, FALSE);
1477 vim_free(tail);
1482 /* check for out-of-memory */
1483 for (i = 0; i < num_names; ++i)
1485 if (names[i] == NULL)
1487 for (i = 0; i < num_names; ++i)
1488 vim_free(names[i]);
1489 num_names = 0;
1492 if (num_names == 0)
1493 num_files = 0;
1494 else if (expand_wildcards(num_names, names, &num_files, &files,
1495 EW_KEEPALL|EW_FILE|EW_SILENT) == FAIL)
1496 num_files = 0;
1499 * When no swap file found, wildcard expansion might have failed (e.g.
1500 * not able to execute the shell).
1501 * Try finding a swap file by simply adding ".swp" to the file name.
1503 if (*dirp == NUL && file_count + num_files == 0
1504 && fname != NULL && *fname != NULL)
1506 struct stat st;
1507 char_u *swapname;
1509 #if defined(VMS) || defined(RISCOS)
1510 swapname = modname(*fname, (char_u *)"_swp", FALSE);
1511 #else
1512 swapname = modname(*fname, (char_u *)".swp", TRUE);
1513 #endif
1514 if (swapname != NULL)
1516 if (mch_stat((char *)swapname, &st) != -1) /* It exists! */
1518 files = (char_u **)alloc((unsigned)sizeof(char_u *));
1519 if (files != NULL)
1521 files[0] = swapname;
1522 swapname = NULL;
1523 num_files = 1;
1526 vim_free(swapname);
1531 * remove swapfile name of the current buffer, it must be ignored
1533 if (curbuf->b_ml.ml_mfp != NULL
1534 && (p = curbuf->b_ml.ml_mfp->mf_fname) != NULL)
1536 for (i = 0; i < num_files; ++i)
1537 if (fullpathcmp(p, files[i], TRUE) & FPC_SAME)
1539 vim_free(files[i]);
1540 --num_files;
1541 for ( ; i < num_files; ++i)
1542 files[i] = files[i + 1];
1545 if (nr > 0)
1547 file_count += num_files;
1548 if (nr <= file_count)
1550 *fname = vim_strsave(files[nr - 1 + num_files - file_count]);
1551 dirp = (char_u *)""; /* stop searching */
1554 else if (list)
1556 if (dir_name[0] == '.' && dir_name[1] == NUL)
1558 if (fname == NULL || *fname == NULL)
1559 MSG_PUTS(_(" In current directory:\n"));
1560 else
1561 MSG_PUTS(_(" Using specified name:\n"));
1563 else
1565 MSG_PUTS(_(" In directory "));
1566 msg_home_replace(dir_name);
1567 MSG_PUTS(":\n");
1570 if (num_files)
1572 for (i = 0; i < num_files; ++i)
1574 /* print the swap file name */
1575 msg_outnum((long)++file_count);
1576 MSG_PUTS(". ");
1577 msg_puts(gettail(files[i]));
1578 msg_putchar('\n');
1579 (void)swapfile_info(files[i]);
1582 else
1583 MSG_PUTS(_(" -- none --\n"));
1584 out_flush();
1586 else
1587 file_count += num_files;
1589 for (i = 0; i < num_names; ++i)
1590 vim_free(names[i]);
1591 if (num_files > 0)
1592 FreeWild(num_files, files);
1594 vim_free(dir_name);
1595 return file_count;
1598 #if defined(UNIX) || defined(WIN3264) /* Need _very_ long file names */
1600 * Append the full path to name with path separators made into percent
1601 * signs, to dir. An unnamed buffer is handled as "" (<currentdir>/"")
1603 static char_u *
1604 make_percent_swname(dir, name)
1605 char_u *dir;
1606 char_u *name;
1608 char_u *d, *s, *f;
1610 f = fix_fname(name != NULL ? name : (char_u *) "");
1611 d = NULL;
1612 if (f != NULL)
1614 s = alloc((unsigned)(STRLEN(f) + 1));
1615 if (s != NULL)
1617 STRCPY(s, f);
1618 for (d = s; *d != NUL; mb_ptr_adv(d))
1619 if (vim_ispathsep(*d))
1620 *d = '%';
1621 d = concat_fnames(dir, s, TRUE);
1622 vim_free(s);
1624 vim_free(f);
1626 return d;
1628 #endif
1630 #if (defined(UNIX) || defined(__EMX__) || defined(VMS)) && (defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG))
1631 static int process_still_running;
1632 #endif
1635 * Give information about an existing swap file.
1636 * Returns timestamp (0 when unknown).
1638 static time_t
1639 swapfile_info(fname)
1640 char_u *fname;
1642 struct stat st;
1643 int fd;
1644 struct block0 b0;
1645 time_t x = (time_t)0;
1646 char *p;
1647 #ifdef UNIX
1648 char_u uname[B0_UNAME_SIZE];
1649 #endif
1651 /* print the swap file date */
1652 if (mch_stat((char *)fname, &st) != -1)
1654 #ifdef UNIX
1655 /* print name of owner of the file */
1656 if (mch_get_uname(st.st_uid, uname, B0_UNAME_SIZE) == OK)
1658 MSG_PUTS(_(" owned by: "));
1659 msg_outtrans(uname);
1660 MSG_PUTS(_(" dated: "));
1662 else
1663 #endif
1664 MSG_PUTS(_(" dated: "));
1665 x = st.st_mtime; /* Manx C can't do &st.st_mtime */
1666 p = ctime(&x); /* includes '\n' */
1667 if (p == NULL)
1668 MSG_PUTS("(invalid)\n");
1669 else
1670 MSG_PUTS(p);
1674 * print the original file name
1676 fd = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
1677 if (fd >= 0)
1679 if (read(fd, (char *)&b0, sizeof(b0)) == sizeof(b0))
1681 if (STRNCMP(b0.b0_version, "VIM 3.0", 7) == 0)
1683 MSG_PUTS(_(" [from Vim version 3.0]"));
1685 else if (b0.b0_id[0] != BLOCK0_ID0 || b0.b0_id[1] != BLOCK0_ID1)
1687 MSG_PUTS(_(" [does not look like a Vim swap file]"));
1689 else
1691 MSG_PUTS(_(" file name: "));
1692 if (b0.b0_fname[0] == NUL)
1693 MSG_PUTS(_("[No Name]"));
1694 else
1695 msg_outtrans(b0.b0_fname);
1697 MSG_PUTS(_("\n modified: "));
1698 MSG_PUTS(b0.b0_dirty ? _("YES") : _("no"));
1700 if (*(b0.b0_uname) != NUL)
1702 MSG_PUTS(_("\n user name: "));
1703 msg_outtrans(b0.b0_uname);
1706 if (*(b0.b0_hname) != NUL)
1708 if (*(b0.b0_uname) != NUL)
1709 MSG_PUTS(_(" host name: "));
1710 else
1711 MSG_PUTS(_("\n host name: "));
1712 msg_outtrans(b0.b0_hname);
1715 if (char_to_long(b0.b0_pid) != 0L)
1717 MSG_PUTS(_("\n process ID: "));
1718 msg_outnum(char_to_long(b0.b0_pid));
1719 #if defined(UNIX) || defined(__EMX__)
1720 /* EMX kill() not working correctly, it seems */
1721 if (kill((pid_t)char_to_long(b0.b0_pid), 0) == 0)
1723 MSG_PUTS(_(" (still running)"));
1724 # if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)
1725 process_still_running = TRUE;
1726 # endif
1728 #endif
1731 if (b0_magic_wrong(&b0))
1733 #if defined(MSDOS) || defined(MSWIN)
1734 if (STRNCMP(b0.b0_hname, "PC ", 3) == 0)
1735 MSG_PUTS(_("\n [not usable with this version of Vim]"));
1736 else
1737 #endif
1738 MSG_PUTS(_("\n [not usable on this computer]"));
1742 else
1743 MSG_PUTS(_(" [cannot be read]"));
1744 close(fd);
1746 else
1747 MSG_PUTS(_(" [cannot be opened]"));
1748 msg_putchar('\n');
1750 return x;
1753 static int
1754 recov_file_names(names, path, prepend_dot)
1755 char_u **names;
1756 char_u *path;
1757 int prepend_dot;
1759 int num_names;
1761 #ifdef SHORT_FNAME
1763 * (MS-DOS) always short names
1765 names[0] = modname(path, (char_u *)".sw?", FALSE);
1766 num_names = 1;
1767 #else /* !SHORT_FNAME */
1769 * (Win32 and Win64) never short names, but do prepend a dot.
1770 * (Not MS-DOS or Win32 or Win64) maybe short name, maybe not: Try both.
1771 * Only use the short name if it is different.
1773 char_u *p;
1774 int i;
1775 # ifndef WIN3264
1776 int shortname = curbuf->b_shortname;
1778 curbuf->b_shortname = FALSE;
1779 # endif
1781 num_names = 0;
1784 * May also add the file name with a dot prepended, for swap file in same
1785 * dir as original file.
1787 if (prepend_dot)
1789 names[num_names] = modname(path, (char_u *)".sw?", TRUE);
1790 if (names[num_names] == NULL)
1791 goto end;
1792 ++num_names;
1796 * Form the normal swap file name pattern by appending ".sw?".
1798 #ifdef VMS
1799 names[num_names] = concat_fnames(path, (char_u *)"_sw%", FALSE);
1800 #else
1801 # ifdef RISCOS
1802 names[num_names] = concat_fnames(path, (char_u *)"_sw#", FALSE);
1803 # else
1804 names[num_names] = concat_fnames(path, (char_u *)".sw?", FALSE);
1805 # endif
1806 #endif
1807 if (names[num_names] == NULL)
1808 goto end;
1809 if (num_names >= 1) /* check if we have the same name twice */
1811 p = names[num_names - 1];
1812 i = (int)STRLEN(names[num_names - 1]) - (int)STRLEN(names[num_names]);
1813 if (i > 0)
1814 p += i; /* file name has been expanded to full path */
1816 if (STRCMP(p, names[num_names]) != 0)
1817 ++num_names;
1818 else
1819 vim_free(names[num_names]);
1821 else
1822 ++num_names;
1824 # ifndef WIN3264
1826 * Also try with 'shortname' set, in case the file is on a DOS filesystem.
1828 curbuf->b_shortname = TRUE;
1829 #ifdef VMS
1830 names[num_names] = modname(path, (char_u *)"_sw%", FALSE);
1831 #else
1832 # ifdef RISCOS
1833 names[num_names] = modname(path, (char_u *)"_sw#", FALSE);
1834 # else
1835 names[num_names] = modname(path, (char_u *)".sw?", FALSE);
1836 # endif
1837 #endif
1838 if (names[num_names] == NULL)
1839 goto end;
1842 * Remove the one from 'shortname', if it's the same as with 'noshortname'.
1844 p = names[num_names];
1845 i = STRLEN(names[num_names]) - STRLEN(names[num_names - 1]);
1846 if (i > 0)
1847 p += i; /* file name has been expanded to full path */
1848 if (STRCMP(names[num_names - 1], p) == 0)
1849 vim_free(names[num_names]);
1850 else
1851 ++num_names;
1852 # endif
1854 end:
1855 # ifndef WIN3264
1856 curbuf->b_shortname = shortname;
1857 # endif
1859 #endif /* !SHORT_FNAME */
1861 return num_names;
1865 * sync all memlines
1867 * If 'check_file' is TRUE, check if original file exists and was not changed.
1868 * If 'check_char' is TRUE, stop syncing when character becomes available, but
1869 * always sync at least one block.
1871 void
1872 ml_sync_all(check_file, check_char)
1873 int check_file;
1874 int check_char;
1876 buf_T *buf;
1877 struct stat st;
1879 for (buf = firstbuf; buf != NULL; buf = buf->b_next)
1881 if (buf->b_ml.ml_mfp == NULL || buf->b_ml.ml_mfp->mf_fname == NULL)
1882 continue; /* no file */
1884 ml_flush_line(buf); /* flush buffered line */
1885 /* flush locked block */
1886 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH);
1887 if (bufIsChanged(buf) && check_file && mf_need_trans(buf->b_ml.ml_mfp)
1888 && buf->b_ffname != NULL)
1891 * If the original file does not exist anymore or has been changed
1892 * call ml_preserve() to get rid of all negative numbered blocks.
1894 if (mch_stat((char *)buf->b_ffname, &st) == -1
1895 || st.st_mtime != buf->b_mtime_read
1896 || (size_t)st.st_size != buf->b_orig_size)
1898 ml_preserve(buf, FALSE);
1899 did_check_timestamps = FALSE;
1900 need_check_timestamps = TRUE; /* give message later */
1903 if (buf->b_ml.ml_mfp->mf_dirty)
1905 (void)mf_sync(buf->b_ml.ml_mfp, (check_char ? MFS_STOP : 0)
1906 | (bufIsChanged(buf) ? MFS_FLUSH : 0));
1907 if (check_char && ui_char_avail()) /* character available now */
1908 break;
1914 * sync one buffer, including negative blocks
1916 * after this all the blocks are in the swap file
1918 * Used for the :preserve command and when the original file has been
1919 * changed or deleted.
1921 * when message is TRUE the success of preserving is reported
1923 void
1924 ml_preserve(buf, message)
1925 buf_T *buf;
1926 int message;
1928 bhdr_T *hp;
1929 linenr_T lnum;
1930 memfile_T *mfp = buf->b_ml.ml_mfp;
1931 int status;
1932 int got_int_save = got_int;
1934 if (mfp == NULL || mfp->mf_fname == NULL)
1936 if (message)
1937 EMSG(_("E313: Cannot preserve, there is no swap file"));
1938 return;
1941 /* We only want to stop when interrupted here, not when interrupted
1942 * before. */
1943 got_int = FALSE;
1945 ml_flush_line(buf); /* flush buffered line */
1946 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush locked block */
1947 status = mf_sync(mfp, MFS_ALL | MFS_FLUSH);
1949 /* stack is invalid after mf_sync(.., MFS_ALL) */
1950 buf->b_ml.ml_stack_top = 0;
1953 * Some of the data blocks may have been changed from negative to
1954 * positive block number. In that case the pointer blocks need to be
1955 * updated.
1957 * We don't know in which pointer block the references are, so we visit
1958 * all data blocks until there are no more translations to be done (or
1959 * we hit the end of the file, which can only happen in case a write fails,
1960 * e.g. when file system if full).
1961 * ml_find_line() does the work by translating the negative block numbers
1962 * when getting the first line of each data block.
1964 if (mf_need_trans(mfp) && !got_int)
1966 lnum = 1;
1967 while (mf_need_trans(mfp) && lnum <= buf->b_ml.ml_line_count)
1969 hp = ml_find_line(buf, lnum, ML_FIND);
1970 if (hp == NULL)
1972 status = FAIL;
1973 goto theend;
1975 CHECK(buf->b_ml.ml_locked_low != lnum, "low != lnum");
1976 lnum = buf->b_ml.ml_locked_high + 1;
1978 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush locked block */
1979 /* sync the updated pointer blocks */
1980 if (mf_sync(mfp, MFS_ALL | MFS_FLUSH) == FAIL)
1981 status = FAIL;
1982 buf->b_ml.ml_stack_top = 0; /* stack is invalid now */
1984 theend:
1985 got_int |= got_int_save;
1987 if (message)
1989 if (status == OK)
1990 MSG(_("File preserved"));
1991 else
1992 EMSG(_("E314: Preserve failed"));
1997 * NOTE: The pointer returned by the ml_get_*() functions only remains valid
1998 * until the next call!
1999 * line1 = ml_get(1);
2000 * line2 = ml_get(2); // line1 is now invalid!
2001 * Make a copy of the line if necessary.
2004 * get a pointer to a (read-only copy of a) line
2006 * On failure an error message is given and IObuff is returned (to avoid
2007 * having to check for error everywhere).
2009 char_u *
2010 ml_get(lnum)
2011 linenr_T lnum;
2013 return ml_get_buf(curbuf, lnum, FALSE);
2017 * ml_get_pos: get pointer to position 'pos'
2019 char_u *
2020 ml_get_pos(pos)
2021 pos_T *pos;
2023 return (ml_get_buf(curbuf, pos->lnum, FALSE) + pos->col);
2027 * ml_get_curline: get pointer to cursor line.
2029 char_u *
2030 ml_get_curline()
2032 return ml_get_buf(curbuf, curwin->w_cursor.lnum, FALSE);
2036 * ml_get_cursor: get pointer to cursor position
2038 char_u *
2039 ml_get_cursor()
2041 return (ml_get_buf(curbuf, curwin->w_cursor.lnum, FALSE) +
2042 curwin->w_cursor.col);
2046 * get a pointer to a line in a specific buffer
2048 * "will_change": if TRUE mark the buffer dirty (chars in the line will be
2049 * changed)
2051 char_u *
2052 ml_get_buf(buf, lnum, will_change)
2053 buf_T *buf;
2054 linenr_T lnum;
2055 int will_change; /* line will be changed */
2057 bhdr_T *hp;
2058 DATA_BL *dp;
2059 char_u *ptr;
2060 static int recursive = 0;
2062 if (lnum > buf->b_ml.ml_line_count) /* invalid line number */
2064 if (recursive == 0)
2066 /* Avoid giving this message for a recursive call, may happen when
2067 * the GUI redraws part of the text. */
2068 ++recursive;
2069 EMSGN(_("E315: ml_get: invalid lnum: %ld"), lnum);
2070 --recursive;
2072 errorret:
2073 STRCPY(IObuff, "???");
2074 return IObuff;
2076 if (lnum <= 0) /* pretend line 0 is line 1 */
2077 lnum = 1;
2079 if (buf->b_ml.ml_mfp == NULL) /* there are no lines */
2080 return (char_u *)"";
2083 * See if it is the same line as requested last time.
2084 * Otherwise may need to flush last used line.
2085 * Don't use the last used line when 'swapfile' is reset, need to load all
2086 * blocks.
2088 if (buf->b_ml.ml_line_lnum != lnum || mf_dont_release)
2090 ml_flush_line(buf);
2093 * Find the data block containing the line.
2094 * This also fills the stack with the blocks from the root to the data
2095 * block and releases any locked block.
2097 if ((hp = ml_find_line(buf, lnum, ML_FIND)) == NULL)
2099 if (recursive == 0)
2101 /* Avoid giving this message for a recursive call, may happen
2102 * when the GUI redraws part of the text. */
2103 ++recursive;
2104 EMSGN(_("E316: ml_get: cannot find line %ld"), lnum);
2105 --recursive;
2107 goto errorret;
2110 dp = (DATA_BL *)(hp->bh_data);
2112 ptr = (char_u *)dp + ((dp->db_index[lnum - buf->b_ml.ml_locked_low]) & DB_INDEX_MASK);
2113 buf->b_ml.ml_line_ptr = ptr;
2114 buf->b_ml.ml_line_lnum = lnum;
2115 buf->b_ml.ml_flags &= ~ML_LINE_DIRTY;
2117 if (will_change)
2118 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
2120 return buf->b_ml.ml_line_ptr;
2124 * Check if a line that was just obtained by a call to ml_get
2125 * is in allocated memory.
2128 ml_line_alloced()
2130 return (curbuf->b_ml.ml_flags & ML_LINE_DIRTY);
2134 * Append a line after lnum (may be 0 to insert a line in front of the file).
2135 * "line" does not need to be allocated, but can't be another line in a
2136 * buffer, unlocking may make it invalid.
2138 * newfile: TRUE when starting to edit a new file, meaning that pe_old_lnum
2139 * will be set for recovery
2140 * Check: The caller of this function should probably also call
2141 * appended_lines().
2143 * return FAIL for failure, OK otherwise
2146 ml_append(lnum, line, len, newfile)
2147 linenr_T lnum; /* append after this line (can be 0) */
2148 char_u *line; /* text of the new line */
2149 colnr_T len; /* length of new line, including NUL, or 0 */
2150 int newfile; /* flag, see above */
2152 /* When starting up, we might still need to create the memfile */
2153 if (curbuf->b_ml.ml_mfp == NULL && open_buffer(FALSE, NULL) == FAIL)
2154 return FAIL;
2156 if (curbuf->b_ml.ml_line_lnum != 0)
2157 ml_flush_line(curbuf);
2158 return ml_append_int(curbuf, lnum, line, len, newfile, FALSE);
2161 #if defined(FEAT_SPELL) || defined(PROTO)
2163 * Like ml_append() but for an arbitrary buffer. The buffer must already have
2164 * a memline.
2167 ml_append_buf(buf, lnum, line, len, newfile)
2168 buf_T *buf;
2169 linenr_T lnum; /* append after this line (can be 0) */
2170 char_u *line; /* text of the new line */
2171 colnr_T len; /* length of new line, including NUL, or 0 */
2172 int newfile; /* flag, see above */
2174 if (buf->b_ml.ml_mfp == NULL)
2175 return FAIL;
2177 if (buf->b_ml.ml_line_lnum != 0)
2178 ml_flush_line(buf);
2179 return ml_append_int(buf, lnum, line, len, newfile, FALSE);
2181 #endif
2183 static int
2184 ml_append_int(buf, lnum, line, len, newfile, mark)
2185 buf_T *buf;
2186 linenr_T lnum; /* append after this line (can be 0) */
2187 char_u *line; /* text of the new line */
2188 colnr_T len; /* length of line, including NUL, or 0 */
2189 int newfile; /* flag, see above */
2190 int mark; /* mark the new line */
2192 int i;
2193 int line_count; /* number of indexes in current block */
2194 int offset;
2195 int from, to;
2196 int space_needed; /* space needed for new line */
2197 int page_size;
2198 int page_count;
2199 int db_idx; /* index for lnum in data block */
2200 bhdr_T *hp;
2201 memfile_T *mfp;
2202 DATA_BL *dp;
2203 PTR_BL *pp;
2204 infoptr_T *ip;
2206 /* lnum out of range */
2207 if (lnum > buf->b_ml.ml_line_count || buf->b_ml.ml_mfp == NULL)
2208 return FAIL;
2210 if (lowest_marked && lowest_marked > lnum)
2211 lowest_marked = lnum + 1;
2213 if (len == 0)
2214 len = (colnr_T)STRLEN(line) + 1; /* space needed for the text */
2215 space_needed = len + INDEX_SIZE; /* space needed for text + index */
2217 mfp = buf->b_ml.ml_mfp;
2218 page_size = mfp->mf_page_size;
2221 * find the data block containing the previous line
2222 * This also fills the stack with the blocks from the root to the data block
2223 * This also releases any locked block.
2225 if ((hp = ml_find_line(buf, lnum == 0 ? (linenr_T)1 : lnum,
2226 ML_INSERT)) == NULL)
2227 return FAIL;
2229 buf->b_ml.ml_flags &= ~ML_EMPTY;
2231 if (lnum == 0) /* got line one instead, correct db_idx */
2232 db_idx = -1; /* careful, it is negative! */
2233 else
2234 db_idx = lnum - buf->b_ml.ml_locked_low;
2235 /* get line count before the insertion */
2236 line_count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low;
2238 dp = (DATA_BL *)(hp->bh_data);
2241 * If
2242 * - there is not enough room in the current block
2243 * - appending to the last line in the block
2244 * - not appending to the last line in the file
2245 * insert in front of the next block.
2247 if ((int)dp->db_free < space_needed && db_idx == line_count - 1
2248 && lnum < buf->b_ml.ml_line_count)
2251 * Now that the line is not going to be inserted in the block that we
2252 * expected, the line count has to be adjusted in the pointer blocks
2253 * by using ml_locked_lineadd.
2255 --(buf->b_ml.ml_locked_lineadd);
2256 --(buf->b_ml.ml_locked_high);
2257 if ((hp = ml_find_line(buf, lnum + 1, ML_INSERT)) == NULL)
2258 return FAIL;
2260 db_idx = -1; /* careful, it is negative! */
2261 /* get line count before the insertion */
2262 line_count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low;
2263 CHECK(buf->b_ml.ml_locked_low != lnum + 1, "locked_low != lnum + 1");
2265 dp = (DATA_BL *)(hp->bh_data);
2268 ++buf->b_ml.ml_line_count;
2270 if ((int)dp->db_free >= space_needed) /* enough room in data block */
2273 * Insert new line in existing data block, or in data block allocated above.
2275 dp->db_txt_start -= len;
2276 dp->db_free -= space_needed;
2277 ++(dp->db_line_count);
2280 * move the text of the lines that follow to the front
2281 * adjust the indexes of the lines that follow
2283 if (line_count > db_idx + 1) /* if there are following lines */
2286 * Offset is the start of the previous line.
2287 * This will become the character just after the new line.
2289 if (db_idx < 0)
2290 offset = dp->db_txt_end;
2291 else
2292 offset = ((dp->db_index[db_idx]) & DB_INDEX_MASK);
2293 mch_memmove((char *)dp + dp->db_txt_start,
2294 (char *)dp + dp->db_txt_start + len,
2295 (size_t)(offset - (dp->db_txt_start + len)));
2296 for (i = line_count - 1; i > db_idx; --i)
2297 dp->db_index[i + 1] = dp->db_index[i] - len;
2298 dp->db_index[db_idx + 1] = offset - len;
2300 else /* add line at the end */
2301 dp->db_index[db_idx + 1] = dp->db_txt_start;
2304 * copy the text into the block
2306 mch_memmove((char *)dp + dp->db_index[db_idx + 1], line, (size_t)len);
2307 if (mark)
2308 dp->db_index[db_idx + 1] |= DB_MARKED;
2311 * Mark the block dirty.
2313 buf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2314 if (!newfile)
2315 buf->b_ml.ml_flags |= ML_LOCKED_POS;
2317 else /* not enough space in data block */
2320 * If there is not enough room we have to create a new data block and copy some
2321 * lines into it.
2322 * Then we have to insert an entry in the pointer block.
2323 * If this pointer block also is full, we go up another block, and so on, up
2324 * to the root if necessary.
2325 * The line counts in the pointer blocks have already been adjusted by
2326 * ml_find_line().
2328 long line_count_left, line_count_right;
2329 int page_count_left, page_count_right;
2330 bhdr_T *hp_left;
2331 bhdr_T *hp_right;
2332 bhdr_T *hp_new;
2333 int lines_moved;
2334 int data_moved = 0; /* init to shut up gcc */
2335 int total_moved = 0; /* init to shut up gcc */
2336 DATA_BL *dp_right, *dp_left;
2337 int stack_idx;
2338 int in_left;
2339 int lineadd;
2340 blocknr_T bnum_left, bnum_right;
2341 linenr_T lnum_left, lnum_right;
2342 int pb_idx;
2343 PTR_BL *pp_new;
2346 * We are going to allocate a new data block. Depending on the
2347 * situation it will be put to the left or right of the existing
2348 * block. If possible we put the new line in the left block and move
2349 * the lines after it to the right block. Otherwise the new line is
2350 * also put in the right block. This method is more efficient when
2351 * inserting a lot of lines at one place.
2353 if (db_idx < 0) /* left block is new, right block is existing */
2355 lines_moved = 0;
2356 in_left = TRUE;
2357 /* space_needed does not change */
2359 else /* left block is existing, right block is new */
2361 lines_moved = line_count - db_idx - 1;
2362 if (lines_moved == 0)
2363 in_left = FALSE; /* put new line in right block */
2364 /* space_needed does not change */
2365 else
2367 data_moved = ((dp->db_index[db_idx]) & DB_INDEX_MASK) -
2368 dp->db_txt_start;
2369 total_moved = data_moved + lines_moved * INDEX_SIZE;
2370 if ((int)dp->db_free + total_moved >= space_needed)
2372 in_left = TRUE; /* put new line in left block */
2373 space_needed = total_moved;
2375 else
2377 in_left = FALSE; /* put new line in right block */
2378 space_needed += total_moved;
2383 page_count = ((space_needed + HEADER_SIZE) + page_size - 1) / page_size;
2384 if ((hp_new = ml_new_data(mfp, newfile, page_count)) == NULL)
2386 /* correct line counts in pointer blocks */
2387 --(buf->b_ml.ml_locked_lineadd);
2388 --(buf->b_ml.ml_locked_high);
2389 return FAIL;
2391 if (db_idx < 0) /* left block is new */
2393 hp_left = hp_new;
2394 hp_right = hp;
2395 line_count_left = 0;
2396 line_count_right = line_count;
2398 else /* right block is new */
2400 hp_left = hp;
2401 hp_right = hp_new;
2402 line_count_left = line_count;
2403 line_count_right = 0;
2405 dp_right = (DATA_BL *)(hp_right->bh_data);
2406 dp_left = (DATA_BL *)(hp_left->bh_data);
2407 bnum_left = hp_left->bh_bnum;
2408 bnum_right = hp_right->bh_bnum;
2409 page_count_left = hp_left->bh_page_count;
2410 page_count_right = hp_right->bh_page_count;
2413 * May move the new line into the right/new block.
2415 if (!in_left)
2417 dp_right->db_txt_start -= len;
2418 dp_right->db_free -= len + INDEX_SIZE;
2419 dp_right->db_index[0] = dp_right->db_txt_start;
2420 if (mark)
2421 dp_right->db_index[0] |= DB_MARKED;
2423 mch_memmove((char *)dp_right + dp_right->db_txt_start,
2424 line, (size_t)len);
2425 ++line_count_right;
2428 * may move lines from the left/old block to the right/new one.
2430 if (lines_moved)
2434 dp_right->db_txt_start -= data_moved;
2435 dp_right->db_free -= total_moved;
2436 mch_memmove((char *)dp_right + dp_right->db_txt_start,
2437 (char *)dp_left + dp_left->db_txt_start,
2438 (size_t)data_moved);
2439 offset = dp_right->db_txt_start - dp_left->db_txt_start;
2440 dp_left->db_txt_start += data_moved;
2441 dp_left->db_free += total_moved;
2444 * update indexes in the new block
2446 for (to = line_count_right, from = db_idx + 1;
2447 from < line_count_left; ++from, ++to)
2448 dp_right->db_index[to] = dp->db_index[from] + offset;
2449 line_count_right += lines_moved;
2450 line_count_left -= lines_moved;
2454 * May move the new line into the left (old or new) block.
2456 if (in_left)
2458 dp_left->db_txt_start -= len;
2459 dp_left->db_free -= len + INDEX_SIZE;
2460 dp_left->db_index[line_count_left] = dp_left->db_txt_start;
2461 if (mark)
2462 dp_left->db_index[line_count_left] |= DB_MARKED;
2463 mch_memmove((char *)dp_left + dp_left->db_txt_start,
2464 line, (size_t)len);
2465 ++line_count_left;
2468 if (db_idx < 0) /* left block is new */
2470 lnum_left = lnum + 1;
2471 lnum_right = 0;
2473 else /* right block is new */
2475 lnum_left = 0;
2476 if (in_left)
2477 lnum_right = lnum + 2;
2478 else
2479 lnum_right = lnum + 1;
2481 dp_left->db_line_count = line_count_left;
2482 dp_right->db_line_count = line_count_right;
2485 * release the two data blocks
2486 * The new one (hp_new) already has a correct blocknumber.
2487 * The old one (hp, in ml_locked) gets a positive blocknumber if
2488 * we changed it and we are not editing a new file.
2490 if (lines_moved || in_left)
2491 buf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2492 if (!newfile && db_idx >= 0 && in_left)
2493 buf->b_ml.ml_flags |= ML_LOCKED_POS;
2494 mf_put(mfp, hp_new, TRUE, FALSE);
2497 * flush the old data block
2498 * set ml_locked_lineadd to 0, because the updating of the
2499 * pointer blocks is done below
2501 lineadd = buf->b_ml.ml_locked_lineadd;
2502 buf->b_ml.ml_locked_lineadd = 0;
2503 ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush data block */
2506 * update pointer blocks for the new data block
2508 for (stack_idx = buf->b_ml.ml_stack_top - 1; stack_idx >= 0;
2509 --stack_idx)
2511 ip = &(buf->b_ml.ml_stack[stack_idx]);
2512 pb_idx = ip->ip_index;
2513 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
2514 return FAIL;
2515 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
2516 if (pp->pb_id != PTR_ID)
2518 EMSG(_("E317: pointer block id wrong 3"));
2519 mf_put(mfp, hp, FALSE, FALSE);
2520 return FAIL;
2523 * TODO: If the pointer block is full and we are adding at the end
2524 * try to insert in front of the next block
2526 /* block not full, add one entry */
2527 if (pp->pb_count < pp->pb_count_max)
2529 if (pb_idx + 1 < (int)pp->pb_count)
2530 mch_memmove(&pp->pb_pointer[pb_idx + 2],
2531 &pp->pb_pointer[pb_idx + 1],
2532 (size_t)(pp->pb_count - pb_idx - 1) * sizeof(PTR_EN));
2533 ++pp->pb_count;
2534 pp->pb_pointer[pb_idx].pe_line_count = line_count_left;
2535 pp->pb_pointer[pb_idx].pe_bnum = bnum_left;
2536 pp->pb_pointer[pb_idx].pe_page_count = page_count_left;
2537 pp->pb_pointer[pb_idx + 1].pe_line_count = line_count_right;
2538 pp->pb_pointer[pb_idx + 1].pe_bnum = bnum_right;
2539 pp->pb_pointer[pb_idx + 1].pe_page_count = page_count_right;
2541 if (lnum_left != 0)
2542 pp->pb_pointer[pb_idx].pe_old_lnum = lnum_left;
2543 if (lnum_right != 0)
2544 pp->pb_pointer[pb_idx + 1].pe_old_lnum = lnum_right;
2546 mf_put(mfp, hp, TRUE, FALSE);
2547 buf->b_ml.ml_stack_top = stack_idx + 1; /* truncate stack */
2549 if (lineadd)
2551 --(buf->b_ml.ml_stack_top);
2552 /* fix line count for rest of blocks in the stack */
2553 ml_lineadd(buf, lineadd);
2554 /* fix stack itself */
2555 buf->b_ml.ml_stack[buf->b_ml.ml_stack_top].ip_high +=
2556 lineadd;
2557 ++(buf->b_ml.ml_stack_top);
2561 * We are finished, break the loop here.
2563 break;
2565 else /* pointer block full */
2568 * split the pointer block
2569 * allocate a new pointer block
2570 * move some of the pointer into the new block
2571 * prepare for updating the parent block
2573 for (;;) /* do this twice when splitting block 1 */
2575 hp_new = ml_new_ptr(mfp);
2576 if (hp_new == NULL) /* TODO: try to fix tree */
2577 return FAIL;
2578 pp_new = (PTR_BL *)(hp_new->bh_data);
2580 if (hp->bh_bnum != 1)
2581 break;
2584 * if block 1 becomes full the tree is given an extra level
2585 * The pointers from block 1 are moved into the new block.
2586 * block 1 is updated to point to the new block
2587 * then continue to split the new block
2589 mch_memmove(pp_new, pp, (size_t)page_size);
2590 pp->pb_count = 1;
2591 pp->pb_pointer[0].pe_bnum = hp_new->bh_bnum;
2592 pp->pb_pointer[0].pe_line_count = buf->b_ml.ml_line_count;
2593 pp->pb_pointer[0].pe_old_lnum = 1;
2594 pp->pb_pointer[0].pe_page_count = 1;
2595 mf_put(mfp, hp, TRUE, FALSE); /* release block 1 */
2596 hp = hp_new; /* new block is to be split */
2597 pp = pp_new;
2598 CHECK(stack_idx != 0, _("stack_idx should be 0"));
2599 ip->ip_index = 0;
2600 ++stack_idx; /* do block 1 again later */
2603 * move the pointers after the current one to the new block
2604 * If there are none, the new entry will be in the new block.
2606 total_moved = pp->pb_count - pb_idx - 1;
2607 if (total_moved)
2609 mch_memmove(&pp_new->pb_pointer[0],
2610 &pp->pb_pointer[pb_idx + 1],
2611 (size_t)(total_moved) * sizeof(PTR_EN));
2612 pp_new->pb_count = total_moved;
2613 pp->pb_count -= total_moved - 1;
2614 pp->pb_pointer[pb_idx + 1].pe_bnum = bnum_right;
2615 pp->pb_pointer[pb_idx + 1].pe_line_count = line_count_right;
2616 pp->pb_pointer[pb_idx + 1].pe_page_count = page_count_right;
2617 if (lnum_right)
2618 pp->pb_pointer[pb_idx + 1].pe_old_lnum = lnum_right;
2620 else
2622 pp_new->pb_count = 1;
2623 pp_new->pb_pointer[0].pe_bnum = bnum_right;
2624 pp_new->pb_pointer[0].pe_line_count = line_count_right;
2625 pp_new->pb_pointer[0].pe_page_count = page_count_right;
2626 pp_new->pb_pointer[0].pe_old_lnum = lnum_right;
2628 pp->pb_pointer[pb_idx].pe_bnum = bnum_left;
2629 pp->pb_pointer[pb_idx].pe_line_count = line_count_left;
2630 pp->pb_pointer[pb_idx].pe_page_count = page_count_left;
2631 if (lnum_left)
2632 pp->pb_pointer[pb_idx].pe_old_lnum = lnum_left;
2633 lnum_left = 0;
2634 lnum_right = 0;
2637 * recompute line counts
2639 line_count_right = 0;
2640 for (i = 0; i < (int)pp_new->pb_count; ++i)
2641 line_count_right += pp_new->pb_pointer[i].pe_line_count;
2642 line_count_left = 0;
2643 for (i = 0; i < (int)pp->pb_count; ++i)
2644 line_count_left += pp->pb_pointer[i].pe_line_count;
2646 bnum_left = hp->bh_bnum;
2647 bnum_right = hp_new->bh_bnum;
2648 page_count_left = 1;
2649 page_count_right = 1;
2650 mf_put(mfp, hp, TRUE, FALSE);
2651 mf_put(mfp, hp_new, TRUE, FALSE);
2656 * Safety check: fallen out of for loop?
2658 if (stack_idx < 0)
2660 EMSG(_("E318: Updated too many blocks?"));
2661 buf->b_ml.ml_stack_top = 0; /* invalidate stack */
2665 #ifdef FEAT_BYTEOFF
2666 /* The line was inserted below 'lnum' */
2667 ml_updatechunk(buf, lnum + 1, (long)len, ML_CHNK_ADDLINE);
2668 #endif
2669 #ifdef FEAT_NETBEANS_INTG
2670 if (usingNetbeans)
2672 if (STRLEN(line) > 0)
2673 netbeans_inserted(buf, lnum+1, (colnr_T)0, line, (int)STRLEN(line));
2674 netbeans_inserted(buf, lnum+1, (colnr_T)STRLEN(line),
2675 (char_u *)"\n", 1);
2677 #endif
2678 return OK;
2682 * Replace line lnum, with buffering, in current buffer.
2684 * If "copy" is TRUE, make a copy of the line, otherwise the line has been
2685 * copied to allocated memory already.
2687 * Check: The caller of this function should probably also call
2688 * changed_lines(), unless update_screen(NOT_VALID) is used.
2690 * return FAIL for failure, OK otherwise
2693 ml_replace(lnum, line, copy)
2694 linenr_T lnum;
2695 char_u *line;
2696 int copy;
2698 if (line == NULL) /* just checking... */
2699 return FAIL;
2701 /* When starting up, we might still need to create the memfile */
2702 if (curbuf->b_ml.ml_mfp == NULL && open_buffer(FALSE, NULL) == FAIL)
2703 return FAIL;
2705 if (copy && (line = vim_strsave(line)) == NULL) /* allocate memory */
2706 return FAIL;
2707 #ifdef FEAT_NETBEANS_INTG
2708 if (usingNetbeans)
2710 netbeans_removed(curbuf, lnum, 0, (long)STRLEN(ml_get(lnum)));
2711 netbeans_inserted(curbuf, lnum, 0, line, (int)STRLEN(line));
2713 #endif
2714 if (curbuf->b_ml.ml_line_lnum != lnum) /* other line buffered */
2715 ml_flush_line(curbuf); /* flush it */
2716 else if (curbuf->b_ml.ml_flags & ML_LINE_DIRTY) /* same line allocated */
2717 vim_free(curbuf->b_ml.ml_line_ptr); /* free it */
2718 curbuf->b_ml.ml_line_ptr = line;
2719 curbuf->b_ml.ml_line_lnum = lnum;
2720 curbuf->b_ml.ml_flags = (curbuf->b_ml.ml_flags | ML_LINE_DIRTY) & ~ML_EMPTY;
2722 return OK;
2726 * Delete line 'lnum' in the current buffer.
2728 * Check: The caller of this function should probably also call
2729 * deleted_lines() after this.
2731 * return FAIL for failure, OK otherwise
2734 ml_delete(lnum, message)
2735 linenr_T lnum;
2736 int message;
2738 ml_flush_line(curbuf);
2739 return ml_delete_int(curbuf, lnum, message);
2742 static int
2743 ml_delete_int(buf, lnum, message)
2744 buf_T *buf;
2745 linenr_T lnum;
2746 int message;
2748 bhdr_T *hp;
2749 memfile_T *mfp;
2750 DATA_BL *dp;
2751 PTR_BL *pp;
2752 infoptr_T *ip;
2753 int count; /* number of entries in block */
2754 int idx;
2755 int stack_idx;
2756 int text_start;
2757 int line_start;
2758 long line_size;
2759 int i;
2761 if (lnum < 1 || lnum > buf->b_ml.ml_line_count)
2762 return FAIL;
2764 if (lowest_marked && lowest_marked > lnum)
2765 lowest_marked--;
2768 * If the file becomes empty the last line is replaced by an empty line.
2770 if (buf->b_ml.ml_line_count == 1) /* file becomes empty */
2772 if (message
2773 #ifdef FEAT_NETBEANS_INTG
2774 && !netbeansSuppressNoLines
2775 #endif
2777 set_keep_msg((char_u *)_(no_lines_msg), 0);
2779 /* FEAT_BYTEOFF already handled in there, dont worry 'bout it below */
2780 i = ml_replace((linenr_T)1, (char_u *)"", TRUE);
2781 buf->b_ml.ml_flags |= ML_EMPTY;
2783 return i;
2787 * find the data block containing the line
2788 * This also fills the stack with the blocks from the root to the data block
2789 * This also releases any locked block.
2791 mfp = buf->b_ml.ml_mfp;
2792 if (mfp == NULL)
2793 return FAIL;
2795 if ((hp = ml_find_line(buf, lnum, ML_DELETE)) == NULL)
2796 return FAIL;
2798 dp = (DATA_BL *)(hp->bh_data);
2799 /* compute line count before the delete */
2800 count = (long)(buf->b_ml.ml_locked_high)
2801 - (long)(buf->b_ml.ml_locked_low) + 2;
2802 idx = lnum - buf->b_ml.ml_locked_low;
2804 --buf->b_ml.ml_line_count;
2806 line_start = ((dp->db_index[idx]) & DB_INDEX_MASK);
2807 if (idx == 0) /* first line in block, text at the end */
2808 line_size = dp->db_txt_end - line_start;
2809 else
2810 line_size = ((dp->db_index[idx - 1]) & DB_INDEX_MASK) - line_start;
2812 #ifdef FEAT_NETBEANS_INTG
2813 if (usingNetbeans)
2814 netbeans_removed(buf, lnum, 0, (long)line_size);
2815 #endif
2818 * special case: If there is only one line in the data block it becomes empty.
2819 * Then we have to remove the entry, pointing to this data block, from the
2820 * pointer block. If this pointer block also becomes empty, we go up another
2821 * block, and so on, up to the root if necessary.
2822 * The line counts in the pointer blocks have already been adjusted by
2823 * ml_find_line().
2825 if (count == 1)
2827 mf_free(mfp, hp); /* free the data block */
2828 buf->b_ml.ml_locked = NULL;
2830 for (stack_idx = buf->b_ml.ml_stack_top - 1; stack_idx >= 0; --stack_idx)
2832 buf->b_ml.ml_stack_top = 0; /* stack is invalid when failing */
2833 ip = &(buf->b_ml.ml_stack[stack_idx]);
2834 idx = ip->ip_index;
2835 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
2836 return FAIL;
2837 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
2838 if (pp->pb_id != PTR_ID)
2840 EMSG(_("E317: pointer block id wrong 4"));
2841 mf_put(mfp, hp, FALSE, FALSE);
2842 return FAIL;
2844 count = --(pp->pb_count);
2845 if (count == 0) /* the pointer block becomes empty! */
2846 mf_free(mfp, hp);
2847 else
2849 if (count != idx) /* move entries after the deleted one */
2850 mch_memmove(&pp->pb_pointer[idx], &pp->pb_pointer[idx + 1],
2851 (size_t)(count - idx) * sizeof(PTR_EN));
2852 mf_put(mfp, hp, TRUE, FALSE);
2854 buf->b_ml.ml_stack_top = stack_idx; /* truncate stack */
2855 /* fix line count for rest of blocks in the stack */
2856 if (buf->b_ml.ml_locked_lineadd)
2858 ml_lineadd(buf, buf->b_ml.ml_locked_lineadd);
2859 buf->b_ml.ml_stack[buf->b_ml.ml_stack_top].ip_high +=
2860 buf->b_ml.ml_locked_lineadd;
2862 ++(buf->b_ml.ml_stack_top);
2864 break;
2867 CHECK(stack_idx < 0, _("deleted block 1?"));
2869 else
2872 * delete the text by moving the next lines forwards
2874 text_start = dp->db_txt_start;
2875 mch_memmove((char *)dp + text_start + line_size,
2876 (char *)dp + text_start, (size_t)(line_start - text_start));
2879 * delete the index by moving the next indexes backwards
2880 * Adjust the indexes for the text movement.
2882 for (i = idx; i < count - 1; ++i)
2883 dp->db_index[i] = dp->db_index[i + 1] + line_size;
2885 dp->db_free += line_size + INDEX_SIZE;
2886 dp->db_txt_start += line_size;
2887 --(dp->db_line_count);
2890 * mark the block dirty and make sure it is in the file (for recovery)
2892 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
2895 #ifdef FEAT_BYTEOFF
2896 ml_updatechunk(buf, lnum, line_size, ML_CHNK_DELLINE);
2897 #endif
2898 return OK;
2902 * set the B_MARKED flag for line 'lnum'
2904 void
2905 ml_setmarked(lnum)
2906 linenr_T lnum;
2908 bhdr_T *hp;
2909 DATA_BL *dp;
2910 /* invalid line number */
2911 if (lnum < 1 || lnum > curbuf->b_ml.ml_line_count
2912 || curbuf->b_ml.ml_mfp == NULL)
2913 return; /* give error message? */
2915 if (lowest_marked == 0 || lowest_marked > lnum)
2916 lowest_marked = lnum;
2919 * find the data block containing the line
2920 * This also fills the stack with the blocks from the root to the data block
2921 * This also releases any locked block.
2923 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2924 return; /* give error message? */
2926 dp = (DATA_BL *)(hp->bh_data);
2927 dp->db_index[lnum - curbuf->b_ml.ml_locked_low] |= DB_MARKED;
2928 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2932 * find the first line with its B_MARKED flag set
2934 linenr_T
2935 ml_firstmarked()
2937 bhdr_T *hp;
2938 DATA_BL *dp;
2939 linenr_T lnum;
2940 int i;
2942 if (curbuf->b_ml.ml_mfp == NULL)
2943 return (linenr_T) 0;
2946 * The search starts with lowest_marked line. This is the last line where
2947 * a mark was found, adjusted by inserting/deleting lines.
2949 for (lnum = lowest_marked; lnum <= curbuf->b_ml.ml_line_count; )
2952 * Find the data block containing the line.
2953 * This also fills the stack with the blocks from the root to the data
2954 * block This also releases any locked block.
2956 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2957 return (linenr_T)0; /* give error message? */
2959 dp = (DATA_BL *)(hp->bh_data);
2961 for (i = lnum - curbuf->b_ml.ml_locked_low;
2962 lnum <= curbuf->b_ml.ml_locked_high; ++i, ++lnum)
2963 if ((dp->db_index[i]) & DB_MARKED)
2965 (dp->db_index[i]) &= DB_INDEX_MASK;
2966 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2967 lowest_marked = lnum + 1;
2968 return lnum;
2972 return (linenr_T) 0;
2975 #if 0 /* not used */
2977 * return TRUE if line 'lnum' has a mark
2980 ml_has_mark(lnum)
2981 linenr_T lnum;
2983 bhdr_T *hp;
2984 DATA_BL *dp;
2986 if (curbuf->b_ml.ml_mfp == NULL
2987 || (hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2988 return FALSE;
2990 dp = (DATA_BL *)(hp->bh_data);
2991 return (int)((dp->db_index[lnum - curbuf->b_ml.ml_locked_low]) & DB_MARKED);
2993 #endif
2996 * clear all DB_MARKED flags
2998 void
2999 ml_clearmarked()
3001 bhdr_T *hp;
3002 DATA_BL *dp;
3003 linenr_T lnum;
3004 int i;
3006 if (curbuf->b_ml.ml_mfp == NULL) /* nothing to do */
3007 return;
3010 * The search starts with line lowest_marked.
3012 for (lnum = lowest_marked; lnum <= curbuf->b_ml.ml_line_count; )
3015 * Find the data block containing the line.
3016 * This also fills the stack with the blocks from the root to the data
3017 * block and releases any locked block.
3019 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
3020 return; /* give error message? */
3022 dp = (DATA_BL *)(hp->bh_data);
3024 for (i = lnum - curbuf->b_ml.ml_locked_low;
3025 lnum <= curbuf->b_ml.ml_locked_high; ++i, ++lnum)
3026 if ((dp->db_index[i]) & DB_MARKED)
3028 (dp->db_index[i]) &= DB_INDEX_MASK;
3029 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
3033 lowest_marked = 0;
3034 return;
3038 * flush ml_line if necessary
3040 static void
3041 ml_flush_line(buf)
3042 buf_T *buf;
3044 bhdr_T *hp;
3045 DATA_BL *dp;
3046 linenr_T lnum;
3047 char_u *new_line;
3048 char_u *old_line;
3049 colnr_T new_len;
3050 int old_len;
3051 int extra;
3052 int idx;
3053 int start;
3054 int count;
3055 int i;
3057 if (buf->b_ml.ml_line_lnum == 0 || buf->b_ml.ml_mfp == NULL)
3058 return; /* nothing to do */
3060 if (buf->b_ml.ml_flags & ML_LINE_DIRTY)
3062 lnum = buf->b_ml.ml_line_lnum;
3063 new_line = buf->b_ml.ml_line_ptr;
3065 hp = ml_find_line(buf, lnum, ML_FIND);
3066 if (hp == NULL)
3067 EMSGN(_("E320: Cannot find line %ld"), lnum);
3068 else
3070 dp = (DATA_BL *)(hp->bh_data);
3071 idx = lnum - buf->b_ml.ml_locked_low;
3072 start = ((dp->db_index[idx]) & DB_INDEX_MASK);
3073 old_line = (char_u *)dp + start;
3074 if (idx == 0) /* line is last in block */
3075 old_len = dp->db_txt_end - start;
3076 else /* text of previous line follows */
3077 old_len = (dp->db_index[idx - 1] & DB_INDEX_MASK) - start;
3078 new_len = (colnr_T)STRLEN(new_line) + 1;
3079 extra = new_len - old_len; /* negative if lines gets smaller */
3082 * if new line fits in data block, replace directly
3084 if ((int)dp->db_free >= extra)
3086 /* if the length changes and there are following lines */
3087 count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low + 1;
3088 if (extra != 0 && idx < count - 1)
3090 /* move text of following lines */
3091 mch_memmove((char *)dp + dp->db_txt_start - extra,
3092 (char *)dp + dp->db_txt_start,
3093 (size_t)(start - dp->db_txt_start));
3095 /* adjust pointers of this and following lines */
3096 for (i = idx + 1; i < count; ++i)
3097 dp->db_index[i] -= extra;
3099 dp->db_index[idx] -= extra;
3101 /* adjust free space */
3102 dp->db_free -= extra;
3103 dp->db_txt_start -= extra;
3105 /* copy new line into the data block */
3106 mch_memmove(old_line - extra, new_line, (size_t)new_len);
3107 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
3108 #ifdef FEAT_BYTEOFF
3109 /* The else case is already covered by the insert and delete */
3110 ml_updatechunk(buf, lnum, (long)extra, ML_CHNK_UPDLINE);
3111 #endif
3113 else
3116 * Cannot do it in one data block: Delete and append.
3117 * Append first, because ml_delete_int() cannot delete the
3118 * last line in a buffer, which causes trouble for a buffer
3119 * that has only one line.
3120 * Don't forget to copy the mark!
3122 /* How about handling errors??? */
3123 (void)ml_append_int(buf, lnum, new_line, new_len, FALSE,
3124 (dp->db_index[idx] & DB_MARKED));
3125 (void)ml_delete_int(buf, lnum, FALSE);
3128 vim_free(new_line);
3131 buf->b_ml.ml_line_lnum = 0;
3135 * create a new, empty, data block
3137 static bhdr_T *
3138 ml_new_data(mfp, negative, page_count)
3139 memfile_T *mfp;
3140 int negative;
3141 int page_count;
3143 bhdr_T *hp;
3144 DATA_BL *dp;
3146 if ((hp = mf_new(mfp, negative, page_count)) == NULL)
3147 return NULL;
3149 dp = (DATA_BL *)(hp->bh_data);
3150 dp->db_id = DATA_ID;
3151 dp->db_txt_start = dp->db_txt_end = page_count * mfp->mf_page_size;
3152 dp->db_free = dp->db_txt_start - HEADER_SIZE;
3153 dp->db_line_count = 0;
3155 return hp;
3159 * create a new, empty, pointer block
3161 static bhdr_T *
3162 ml_new_ptr(mfp)
3163 memfile_T *mfp;
3165 bhdr_T *hp;
3166 PTR_BL *pp;
3168 if ((hp = mf_new(mfp, FALSE, 1)) == NULL)
3169 return NULL;
3171 pp = (PTR_BL *)(hp->bh_data);
3172 pp->pb_id = PTR_ID;
3173 pp->pb_count = 0;
3174 pp->pb_count_max = (short_u)((mfp->mf_page_size - sizeof(PTR_BL)) / sizeof(PTR_EN) + 1);
3176 return hp;
3180 * lookup line 'lnum' in a memline
3182 * action: if ML_DELETE or ML_INSERT the line count is updated while searching
3183 * if ML_FLUSH only flush a locked block
3184 * if ML_FIND just find the line
3186 * If the block was found it is locked and put in ml_locked.
3187 * The stack is updated to lead to the locked block. The ip_high field in
3188 * the stack is updated to reflect the last line in the block AFTER the
3189 * insert or delete, also if the pointer block has not been updated yet. But
3190 * if if ml_locked != NULL ml_locked_lineadd must be added to ip_high.
3192 * return: NULL for failure, pointer to block header otherwise
3194 static bhdr_T *
3195 ml_find_line(buf, lnum, action)
3196 buf_T *buf;
3197 linenr_T lnum;
3198 int action;
3200 DATA_BL *dp;
3201 PTR_BL *pp;
3202 infoptr_T *ip;
3203 bhdr_T *hp;
3204 memfile_T *mfp;
3205 linenr_T t;
3206 blocknr_T bnum, bnum2;
3207 int dirty;
3208 linenr_T low, high;
3209 int top;
3210 int page_count;
3211 int idx;
3213 mfp = buf->b_ml.ml_mfp;
3216 * If there is a locked block check if the wanted line is in it.
3217 * If not, flush and release the locked block.
3218 * Don't do this for ML_INSERT_SAME, because the stack need to be updated.
3219 * Don't do this for ML_FLUSH, because we want to flush the locked block.
3220 * Don't do this when 'swapfile' is reset, we want to load all the blocks.
3222 if (buf->b_ml.ml_locked)
3224 if (ML_SIMPLE(action)
3225 && buf->b_ml.ml_locked_low <= lnum
3226 && buf->b_ml.ml_locked_high >= lnum
3227 && !mf_dont_release)
3229 /* remember to update pointer blocks and stack later */
3230 if (action == ML_INSERT)
3232 ++(buf->b_ml.ml_locked_lineadd);
3233 ++(buf->b_ml.ml_locked_high);
3235 else if (action == ML_DELETE)
3237 --(buf->b_ml.ml_locked_lineadd);
3238 --(buf->b_ml.ml_locked_high);
3240 return (buf->b_ml.ml_locked);
3243 mf_put(mfp, buf->b_ml.ml_locked, buf->b_ml.ml_flags & ML_LOCKED_DIRTY,
3244 buf->b_ml.ml_flags & ML_LOCKED_POS);
3245 buf->b_ml.ml_locked = NULL;
3248 * if lines have been added or deleted in the locked block, need to
3249 * update the line count in pointer blocks
3251 if (buf->b_ml.ml_locked_lineadd)
3252 ml_lineadd(buf, buf->b_ml.ml_locked_lineadd);
3255 if (action == ML_FLUSH) /* nothing else to do */
3256 return NULL;
3258 bnum = 1; /* start at the root of the tree */
3259 page_count = 1;
3260 low = 1;
3261 high = buf->b_ml.ml_line_count;
3263 if (action == ML_FIND) /* first try stack entries */
3265 for (top = buf->b_ml.ml_stack_top - 1; top >= 0; --top)
3267 ip = &(buf->b_ml.ml_stack[top]);
3268 if (ip->ip_low <= lnum && ip->ip_high >= lnum)
3270 bnum = ip->ip_bnum;
3271 low = ip->ip_low;
3272 high = ip->ip_high;
3273 buf->b_ml.ml_stack_top = top; /* truncate stack at prev entry */
3274 break;
3277 if (top < 0)
3278 buf->b_ml.ml_stack_top = 0; /* not found, start at the root */
3280 else /* ML_DELETE or ML_INSERT */
3281 buf->b_ml.ml_stack_top = 0; /* start at the root */
3284 * search downwards in the tree until a data block is found
3286 for (;;)
3288 if ((hp = mf_get(mfp, bnum, page_count)) == NULL)
3289 goto error_noblock;
3292 * update high for insert/delete
3294 if (action == ML_INSERT)
3295 ++high;
3296 else if (action == ML_DELETE)
3297 --high;
3299 dp = (DATA_BL *)(hp->bh_data);
3300 if (dp->db_id == DATA_ID) /* data block */
3302 buf->b_ml.ml_locked = hp;
3303 buf->b_ml.ml_locked_low = low;
3304 buf->b_ml.ml_locked_high = high;
3305 buf->b_ml.ml_locked_lineadd = 0;
3306 buf->b_ml.ml_flags &= ~(ML_LOCKED_DIRTY | ML_LOCKED_POS);
3307 return hp;
3310 pp = (PTR_BL *)(dp); /* must be pointer block */
3311 if (pp->pb_id != PTR_ID)
3313 EMSG(_("E317: pointer block id wrong"));
3314 goto error_block;
3317 if ((top = ml_add_stack(buf)) < 0) /* add new entry to stack */
3318 goto error_block;
3319 ip = &(buf->b_ml.ml_stack[top]);
3320 ip->ip_bnum = bnum;
3321 ip->ip_low = low;
3322 ip->ip_high = high;
3323 ip->ip_index = -1; /* index not known yet */
3325 dirty = FALSE;
3326 for (idx = 0; idx < (int)pp->pb_count; ++idx)
3328 t = pp->pb_pointer[idx].pe_line_count;
3329 CHECK(t == 0, _("pe_line_count is zero"));
3330 if ((low += t) > lnum)
3332 ip->ip_index = idx;
3333 bnum = pp->pb_pointer[idx].pe_bnum;
3334 page_count = pp->pb_pointer[idx].pe_page_count;
3335 high = low - 1;
3336 low -= t;
3339 * a negative block number may have been changed
3341 if (bnum < 0)
3343 bnum2 = mf_trans_del(mfp, bnum);
3344 if (bnum != bnum2)
3346 bnum = bnum2;
3347 pp->pb_pointer[idx].pe_bnum = bnum;
3348 dirty = TRUE;
3352 break;
3355 if (idx >= (int)pp->pb_count) /* past the end: something wrong! */
3357 if (lnum > buf->b_ml.ml_line_count)
3358 EMSGN(_("E322: line number out of range: %ld past the end"),
3359 lnum - buf->b_ml.ml_line_count);
3361 else
3362 EMSGN(_("E323: line count wrong in block %ld"), bnum);
3363 goto error_block;
3365 if (action == ML_DELETE)
3367 pp->pb_pointer[idx].pe_line_count--;
3368 dirty = TRUE;
3370 else if (action == ML_INSERT)
3372 pp->pb_pointer[idx].pe_line_count++;
3373 dirty = TRUE;
3375 mf_put(mfp, hp, dirty, FALSE);
3378 error_block:
3379 mf_put(mfp, hp, FALSE, FALSE);
3380 error_noblock:
3382 * If action is ML_DELETE or ML_INSERT we have to correct the tree for
3383 * the incremented/decremented line counts, because there won't be a line
3384 * inserted/deleted after all.
3386 if (action == ML_DELETE)
3387 ml_lineadd(buf, 1);
3388 else if (action == ML_INSERT)
3389 ml_lineadd(buf, -1);
3390 buf->b_ml.ml_stack_top = 0;
3391 return NULL;
3395 * add an entry to the info pointer stack
3397 * return -1 for failure, number of the new entry otherwise
3399 static int
3400 ml_add_stack(buf)
3401 buf_T *buf;
3403 int top;
3404 infoptr_T *newstack;
3406 top = buf->b_ml.ml_stack_top;
3408 /* may have to increase the stack size */
3409 if (top == buf->b_ml.ml_stack_size)
3411 CHECK(top > 0, _("Stack size increases")); /* more than 5 levels??? */
3413 newstack = (infoptr_T *)alloc((unsigned)sizeof(infoptr_T) *
3414 (buf->b_ml.ml_stack_size + STACK_INCR));
3415 if (newstack == NULL)
3416 return -1;
3417 mch_memmove(newstack, buf->b_ml.ml_stack, (size_t)top * sizeof(infoptr_T));
3418 vim_free(buf->b_ml.ml_stack);
3419 buf->b_ml.ml_stack = newstack;
3420 buf->b_ml.ml_stack_size += STACK_INCR;
3423 buf->b_ml.ml_stack_top++;
3424 return top;
3428 * Update the pointer blocks on the stack for inserted/deleted lines.
3429 * The stack itself is also updated.
3431 * When a insert/delete line action fails, the line is not inserted/deleted,
3432 * but the pointer blocks have already been updated. That is fixed here by
3433 * walking through the stack.
3435 * Count is the number of lines added, negative if lines have been deleted.
3437 static void
3438 ml_lineadd(buf, count)
3439 buf_T *buf;
3440 int count;
3442 int idx;
3443 infoptr_T *ip;
3444 PTR_BL *pp;
3445 memfile_T *mfp = buf->b_ml.ml_mfp;
3446 bhdr_T *hp;
3448 for (idx = buf->b_ml.ml_stack_top - 1; idx >= 0; --idx)
3450 ip = &(buf->b_ml.ml_stack[idx]);
3451 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
3452 break;
3453 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
3454 if (pp->pb_id != PTR_ID)
3456 mf_put(mfp, hp, FALSE, FALSE);
3457 EMSG(_("E317: pointer block id wrong 2"));
3458 break;
3460 pp->pb_pointer[ip->ip_index].pe_line_count += count;
3461 ip->ip_high += count;
3462 mf_put(mfp, hp, TRUE, FALSE);
3466 #ifdef HAVE_READLINK
3467 static int resolve_symlink __ARGS((char_u *fname, char_u *buf));
3470 * Resolve a symlink in the last component of a file name.
3471 * Note that f_resolve() does it for every part of the path, we don't do that
3472 * here.
3473 * If it worked returns OK and the resolved link in "buf[MAXPATHL]".
3474 * Otherwise returns FAIL.
3476 static int
3477 resolve_symlink(fname, buf)
3478 char_u *fname;
3479 char_u *buf;
3481 char_u tmp[MAXPATHL];
3482 int ret;
3483 int depth = 0;
3485 if (fname == NULL)
3486 return FAIL;
3488 /* Put the result so far in tmp[], starting with the original name. */
3489 vim_strncpy(tmp, fname, MAXPATHL - 1);
3491 for (;;)
3493 /* Limit symlink depth to 100, catch recursive loops. */
3494 if (++depth == 100)
3496 EMSG2(_("E773: Symlink loop for \"%s\""), fname);
3497 return FAIL;
3500 ret = readlink((char *)tmp, (char *)buf, MAXPATHL - 1);
3501 if (ret <= 0)
3503 if (errno == EINVAL || errno == ENOENT)
3505 /* Found non-symlink or not existing file, stop here.
3506 * When at the first level use the unmodifed name, skip the
3507 * call to vim_FullName(). */
3508 if (depth == 1)
3509 return FAIL;
3511 /* Use the resolved name in tmp[]. */
3512 break;
3515 /* There must be some error reading links, use original name. */
3516 return FAIL;
3518 buf[ret] = NUL;
3521 * Check whether the symlink is relative or absolute.
3522 * If it's relative, build a new path based on the directory
3523 * portion of the filename (if any) and the path the symlink
3524 * points to.
3526 if (mch_isFullName(buf))
3527 STRCPY(tmp, buf);
3528 else
3530 char_u *tail;
3532 tail = gettail(tmp);
3533 if (STRLEN(tail) + STRLEN(buf) >= MAXPATHL)
3534 return FAIL;
3535 STRCPY(tail, buf);
3540 * Try to resolve the full name of the file so that the swapfile name will
3541 * be consistent even when opening a relative symlink from different
3542 * working directories.
3544 return vim_FullName(tmp, buf, MAXPATHL, TRUE);
3546 #endif
3549 * Make swap file name out of the file name and a directory name.
3550 * Returns pointer to allocated memory or NULL.
3552 /*ARGSUSED*/
3553 char_u *
3554 makeswapname(fname, ffname, buf, dir_name)
3555 char_u *fname;
3556 char_u *ffname;
3557 buf_T *buf;
3558 char_u *dir_name;
3560 char_u *r, *s;
3561 #ifdef HAVE_READLINK
3562 char_u fname_buf[MAXPATHL];
3563 char_u *fname_res;
3564 #endif
3566 #if defined(UNIX) || defined(WIN3264) /* Need _very_ long file names */
3567 s = dir_name + STRLEN(dir_name);
3568 if (after_pathsep(dir_name, s) && s[-1] == s[-2])
3569 { /* Ends with '//', Use Full path */
3570 r = NULL;
3571 if ((s = make_percent_swname(dir_name, fname)) != NULL)
3573 r = modname(s, (char_u *)".swp", FALSE);
3574 vim_free(s);
3576 return r;
3578 #endif
3580 #ifdef HAVE_READLINK
3581 /* Expand symlink in the file name, so that we put the swap file with the
3582 * actual file instead of with the symlink. */
3583 if (resolve_symlink(fname, fname_buf) == OK)
3584 fname_res = fname_buf;
3585 else
3586 fname_res = fname;
3587 #endif
3589 r = buf_modname(
3590 #ifdef SHORT_FNAME
3591 TRUE,
3592 #else
3593 (buf->b_p_sn || buf->b_shortname),
3594 #endif
3595 #ifdef RISCOS
3596 /* Avoid problems if fname has special chars, eg <Wimp$Scrap> */
3597 ffname,
3598 #else
3599 # ifdef HAVE_READLINK
3600 fname_res,
3601 # else
3602 fname,
3603 # endif
3604 #endif
3605 (char_u *)
3606 #if defined(VMS) || defined(RISCOS)
3607 "_swp",
3608 #else
3609 ".swp",
3610 #endif
3611 #ifdef SHORT_FNAME /* always 8.3 file name */
3612 FALSE
3613 #else
3614 /* Prepend a '.' to the swap file name for the current directory. */
3615 dir_name[0] == '.' && dir_name[1] == NUL
3616 #endif
3618 if (r == NULL) /* out of memory */
3619 return NULL;
3621 s = get_file_in_dir(r, dir_name);
3622 vim_free(r);
3623 return s;
3627 * Get file name to use for swap file or backup file.
3628 * Use the name of the edited file "fname" and an entry in the 'dir' or 'bdir'
3629 * option "dname".
3630 * - If "dname" is ".", return "fname" (swap file in dir of file).
3631 * - If "dname" starts with "./", insert "dname" in "fname" (swap file
3632 * relative to dir of file).
3633 * - Otherwise, prepend "dname" to the tail of "fname" (swap file in specific
3634 * dir).
3636 * The return value is an allocated string and can be NULL.
3638 char_u *
3639 get_file_in_dir(fname, dname)
3640 char_u *fname;
3641 char_u *dname; /* don't use "dirname", it is a global for Alpha */
3643 char_u *t;
3644 char_u *tail;
3645 char_u *retval;
3646 int save_char;
3648 tail = gettail(fname);
3650 if (dname[0] == '.' && dname[1] == NUL)
3651 retval = vim_strsave(fname);
3652 else if (dname[0] == '.' && vim_ispathsep(dname[1]))
3654 if (tail == fname) /* no path before file name */
3655 retval = concat_fnames(dname + 2, tail, TRUE);
3656 else
3658 save_char = *tail;
3659 *tail = NUL;
3660 t = concat_fnames(fname, dname + 2, TRUE);
3661 *tail = save_char;
3662 if (t == NULL) /* out of memory */
3663 retval = NULL;
3664 else
3666 retval = concat_fnames(t, tail, TRUE);
3667 vim_free(t);
3671 else
3672 retval = concat_fnames(dname, tail, TRUE);
3674 return retval;
3677 static void attention_message __ARGS((buf_T *buf, char_u *fname));
3680 * Print the ATTENTION message: info about an existing swap file.
3682 static void
3683 attention_message(buf, fname)
3684 buf_T *buf; /* buffer being edited */
3685 char_u *fname; /* swap file name */
3687 struct stat st;
3688 time_t x, sx;
3689 char *p;
3691 ++no_wait_return;
3692 (void)EMSG(_("E325: ATTENTION"));
3693 MSG_PUTS(_("\nFound a swap file by the name \""));
3694 msg_home_replace(fname);
3695 MSG_PUTS("\"\n");
3696 sx = swapfile_info(fname);
3697 MSG_PUTS(_("While opening file \""));
3698 msg_outtrans(buf->b_fname);
3699 MSG_PUTS("\"\n");
3700 if (mch_stat((char *)buf->b_fname, &st) != -1)
3702 MSG_PUTS(_(" dated: "));
3703 x = st.st_mtime; /* Manx C can't do &st.st_mtime */
3704 p = ctime(&x); /* includes '\n' */
3705 if (p == NULL)
3706 MSG_PUTS("(invalid)\n");
3707 else
3708 MSG_PUTS(p);
3709 if (sx != 0 && x > sx)
3710 MSG_PUTS(_(" NEWER than swap file!\n"));
3712 /* Some of these messages are long to allow translation to
3713 * other languages. */
3714 MSG_PUTS(_("\n(1) Another program may be editing the same file.\n If this is the case, be careful not to end up with two\n different instances of the same file when making changes.\n"));
3715 MSG_PUTS(_(" Quit, or continue with caution.\n"));
3716 MSG_PUTS(_("\n(2) An edit session for this file crashed.\n"));
3717 MSG_PUTS(_(" If this is the case, use \":recover\" or \"vim -r "));
3718 msg_outtrans(buf->b_fname);
3719 MSG_PUTS(_("\"\n to recover the changes (see \":help recovery\").\n"));
3720 MSG_PUTS(_(" If you did this already, delete the swap file \""));
3721 msg_outtrans(fname);
3722 MSG_PUTS(_("\"\n to avoid this message.\n"));
3723 cmdline_row = msg_row;
3724 --no_wait_return;
3727 #ifdef FEAT_AUTOCMD
3728 static int do_swapexists __ARGS((buf_T *buf, char_u *fname));
3731 * Trigger the SwapExists autocommands.
3732 * Returns a value for equivalent to do_dialog() (see below):
3733 * 0: still need to ask for a choice
3734 * 1: open read-only
3735 * 2: edit anyway
3736 * 3: recover
3737 * 4: delete it
3738 * 5: quit
3739 * 6: abort
3741 static int
3742 do_swapexists(buf, fname)
3743 buf_T *buf;
3744 char_u *fname;
3746 set_vim_var_string(VV_SWAPNAME, fname, -1);
3747 set_vim_var_string(VV_SWAPCHOICE, NULL, -1);
3749 /* Trigger SwapExists autocommands with <afile> set to the file being
3750 * edited. */
3751 apply_autocmds(EVENT_SWAPEXISTS, buf->b_fname, NULL, FALSE, NULL);
3753 set_vim_var_string(VV_SWAPNAME, NULL, -1);
3755 switch (*get_vim_var_str(VV_SWAPCHOICE))
3757 case 'o': return 1;
3758 case 'e': return 2;
3759 case 'r': return 3;
3760 case 'd': return 4;
3761 case 'q': return 5;
3762 case 'a': return 6;
3765 return 0;
3767 #endif
3770 * Find out what name to use for the swap file for buffer 'buf'.
3772 * Several names are tried to find one that does not exist
3773 * Returns the name in allocated memory or NULL.
3775 * Note: If BASENAMELEN is not correct, you will get error messages for
3776 * not being able to open the swapfile
3778 static char_u *
3779 findswapname(buf, dirp, old_fname)
3780 buf_T *buf;
3781 char_u **dirp; /* pointer to list of directories */
3782 char_u *old_fname; /* don't give warning for this file name */
3784 char_u *fname;
3785 int n;
3786 char_u *dir_name;
3787 #ifdef AMIGA
3788 BPTR fh;
3789 #endif
3790 #ifndef SHORT_FNAME
3791 int r;
3792 #endif
3794 #if !defined(SHORT_FNAME) \
3795 && ((!defined(UNIX) && !defined(OS2)) || defined(ARCHIE))
3796 # define CREATE_DUMMY_FILE
3797 FILE *dummyfd = NULL;
3800 * If we start editing a new file, e.g. "test.doc", which resides on an MSDOS
3801 * compatible filesystem, it is possible that the file "test.doc.swp" which we
3802 * create will be exactly the same file. To avoid this problem we temporarily
3803 * create "test.doc".
3804 * Don't do this when the check below for a 8.3 file name is used.
3806 if (!(buf->b_p_sn || buf->b_shortname) && buf->b_fname != NULL
3807 && mch_getperm(buf->b_fname) < 0)
3808 dummyfd = mch_fopen((char *)buf->b_fname, "w");
3809 #endif
3812 * Isolate a directory name from *dirp and put it in dir_name.
3813 * First allocate some memory to put the directory name in.
3815 dir_name = alloc((unsigned)STRLEN(*dirp) + 1);
3816 if (dir_name != NULL)
3817 (void)copy_option_part(dirp, dir_name, 31000, ",");
3820 * we try different names until we find one that does not exist yet
3822 if (dir_name == NULL) /* out of memory */
3823 fname = NULL;
3824 else
3825 fname = makeswapname(buf->b_fname, buf->b_ffname, buf, dir_name);
3827 for (;;)
3829 if (fname == NULL) /* must be out of memory */
3830 break;
3831 if ((n = (int)STRLEN(fname)) == 0) /* safety check */
3833 vim_free(fname);
3834 fname = NULL;
3835 break;
3837 #if (defined(UNIX) || defined(OS2)) && !defined(ARCHIE) && !defined(SHORT_FNAME)
3839 * Some systems have a MS-DOS compatible filesystem that use 8.3 character
3840 * file names. If this is the first try and the swap file name does not fit in
3841 * 8.3, detect if this is the case, set shortname and try again.
3843 if (fname[n - 2] == 'w' && fname[n - 1] == 'p'
3844 && !(buf->b_p_sn || buf->b_shortname))
3846 char_u *tail;
3847 char_u *fname2;
3848 struct stat s1, s2;
3849 int f1, f2;
3850 int created1 = FALSE, created2 = FALSE;
3851 int same = FALSE;
3854 * Check if swapfile name does not fit in 8.3:
3855 * It either contains two dots, is longer than 8 chars, or starts
3856 * with a dot.
3858 tail = gettail(buf->b_fname);
3859 if ( vim_strchr(tail, '.') != NULL
3860 || STRLEN(tail) > (size_t)8
3861 || *gettail(fname) == '.')
3863 fname2 = alloc(n + 2);
3864 if (fname2 != NULL)
3866 STRCPY(fname2, fname);
3867 /* if fname == "xx.xx.swp", fname2 = "xx.xx.swx"
3868 * if fname == ".xx.swp", fname2 = ".xx.swpx"
3869 * if fname == "123456789.swp", fname2 = "12345678x.swp"
3871 if (vim_strchr(tail, '.') != NULL)
3872 fname2[n - 1] = 'x';
3873 else if (*gettail(fname) == '.')
3875 fname2[n] = 'x';
3876 fname2[n + 1] = NUL;
3878 else
3879 fname2[n - 5] += 1;
3881 * may need to create the files to be able to use mch_stat()
3883 f1 = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
3884 if (f1 < 0)
3886 f1 = mch_open_rw((char *)fname,
3887 O_RDWR|O_CREAT|O_EXCL|O_EXTRA);
3888 #if defined(OS2)
3889 if (f1 < 0 && errno == ENOENT)
3890 same = TRUE;
3891 #endif
3892 created1 = TRUE;
3894 if (f1 >= 0)
3896 f2 = mch_open((char *)fname2, O_RDONLY | O_EXTRA, 0);
3897 if (f2 < 0)
3899 f2 = mch_open_rw((char *)fname2,
3900 O_RDWR|O_CREAT|O_EXCL|O_EXTRA);
3901 created2 = TRUE;
3903 if (f2 >= 0)
3906 * Both files exist now. If mch_stat() returns the
3907 * same device and inode they are the same file.
3909 if (mch_fstat(f1, &s1) != -1
3910 && mch_fstat(f2, &s2) != -1
3911 && s1.st_dev == s2.st_dev
3912 && s1.st_ino == s2.st_ino)
3913 same = TRUE;
3914 close(f2);
3915 if (created2)
3916 mch_remove(fname2);
3918 close(f1);
3919 if (created1)
3920 mch_remove(fname);
3922 vim_free(fname2);
3923 if (same)
3925 buf->b_shortname = TRUE;
3926 vim_free(fname);
3927 fname = makeswapname(buf->b_fname, buf->b_ffname,
3928 buf, dir_name);
3929 continue; /* try again with b_shortname set */
3934 #endif
3936 * check if the swapfile already exists
3938 if (mch_getperm(fname) < 0) /* it does not exist */
3940 #ifdef HAVE_LSTAT
3941 struct stat sb;
3944 * Extra security check: When a swap file is a symbolic link, this
3945 * is most likely a symlink attack.
3947 if (mch_lstat((char *)fname, &sb) < 0)
3948 #else
3949 # ifdef AMIGA
3950 fh = Open((UBYTE *)fname, (long)MODE_NEWFILE);
3952 * on the Amiga mch_getperm() will return -1 when the file exists
3953 * but is being used by another program. This happens if you edit
3954 * a file twice.
3956 if (fh != (BPTR)NULL) /* can open file, OK */
3958 Close(fh);
3959 mch_remove(fname);
3960 break;
3962 if (IoErr() != ERROR_OBJECT_IN_USE
3963 && IoErr() != ERROR_OBJECT_EXISTS)
3964 # endif
3965 #endif
3966 break;
3970 * A file name equal to old_fname is OK to use.
3972 if (old_fname != NULL && fnamecmp(fname, old_fname) == 0)
3973 break;
3976 * get here when file already exists
3978 if (fname[n - 2] == 'w' && fname[n - 1] == 'p') /* first try */
3980 #ifndef SHORT_FNAME
3982 * on MS-DOS compatible filesystems (e.g. messydos) file.doc.swp
3983 * and file.doc are the same file. To guess if this problem is
3984 * present try if file.doc.swx exists. If it does, we set
3985 * buf->b_shortname and try file_doc.swp (dots replaced by
3986 * underscores for this file), and try again. If it doesn't we
3987 * assume that "file.doc.swp" already exists.
3989 if (!(buf->b_p_sn || buf->b_shortname)) /* not tried yet */
3991 fname[n - 1] = 'x';
3992 r = mch_getperm(fname); /* try "file.swx" */
3993 fname[n - 1] = 'p';
3994 if (r >= 0) /* "file.swx" seems to exist */
3996 buf->b_shortname = TRUE;
3997 vim_free(fname);
3998 fname = makeswapname(buf->b_fname, buf->b_ffname,
3999 buf, dir_name);
4000 continue; /* try again with '.' replaced with '_' */
4003 #endif
4005 * If we get here the ".swp" file really exists.
4006 * Give an error message, unless recovering, no file name, we are
4007 * viewing a help file or when the path of the file is different
4008 * (happens when all .swp files are in one directory).
4010 if (!recoverymode && buf->b_fname != NULL
4011 && !buf->b_help && !(buf->b_flags & BF_DUMMY))
4013 int fd;
4014 struct block0 b0;
4015 int differ = FALSE;
4018 * Try to read block 0 from the swap file to get the original
4019 * file name (and inode number).
4021 fd = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
4022 if (fd >= 0)
4024 if (read(fd, (char *)&b0, sizeof(b0)) == sizeof(b0))
4027 * If the swapfile has the same directory as the
4028 * buffer don't compare the directory names, they can
4029 * have a different mountpoint.
4031 if (b0.b0_flags & B0_SAME_DIR)
4033 if (fnamecmp(gettail(buf->b_ffname),
4034 gettail(b0.b0_fname)) != 0
4035 || !same_directory(fname, buf->b_ffname))
4037 #ifdef CHECK_INODE
4038 /* Symlinks may point to the same file even
4039 * when the name differs, need to check the
4040 * inode too. */
4041 expand_env(b0.b0_fname, NameBuff, MAXPATHL);
4042 if (fnamecmp_ino(buf->b_ffname, NameBuff,
4043 char_to_long(b0.b0_ino)))
4044 #endif
4045 differ = TRUE;
4048 else
4051 * The name in the swap file may be
4052 * "~user/path/file". Expand it first.
4054 expand_env(b0.b0_fname, NameBuff, MAXPATHL);
4055 #ifdef CHECK_INODE
4056 if (fnamecmp_ino(buf->b_ffname, NameBuff,
4057 char_to_long(b0.b0_ino)))
4058 differ = TRUE;
4059 #else
4060 if (fnamecmp(NameBuff, buf->b_ffname) != 0)
4061 differ = TRUE;
4062 #endif
4065 close(fd);
4067 #ifdef RISCOS
4068 else
4069 /* Can't open swap file, though it does exist.
4070 * Assume that the user is editing two files with
4071 * the same name in different directories. No error.
4073 differ = TRUE;
4074 #endif
4076 /* give the ATTENTION message when there is an old swap file
4077 * for the current file, and the buffer was not recovered. */
4078 if (differ == FALSE && !(curbuf->b_flags & BF_RECOVERED)
4079 && vim_strchr(p_shm, SHM_ATTENTION) == NULL)
4081 #if defined(HAS_SWAP_EXISTS_ACTION)
4082 int choice = 0;
4083 #endif
4084 #ifdef CREATE_DUMMY_FILE
4085 int did_use_dummy = FALSE;
4087 /* Avoid getting a warning for the file being created
4088 * outside of Vim, it was created at the start of this
4089 * function. Delete the file now, because Vim might exit
4090 * here if the window is closed. */
4091 if (dummyfd != NULL)
4093 fclose(dummyfd);
4094 dummyfd = NULL;
4095 mch_remove(buf->b_fname);
4096 did_use_dummy = TRUE;
4098 #endif
4100 #if (defined(UNIX) || defined(__EMX__) || defined(VMS)) && (defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG))
4101 process_still_running = FALSE;
4102 #endif
4103 #ifdef FEAT_AUTOCMD
4105 * If there is an SwapExists autocommand and we can handle
4106 * the response, trigger it. It may return 0 to ask the
4107 * user anyway.
4109 if (swap_exists_action != SEA_NONE
4110 && has_autocmd(EVENT_SWAPEXISTS, buf->b_fname, buf))
4111 choice = do_swapexists(buf, fname);
4113 if (choice == 0)
4114 #endif
4116 #ifdef FEAT_GUI
4117 /* If we are supposed to start the GUI but it wasn't
4118 * completely started yet, start it now. This makes
4119 * the messages displayed in the Vim window when
4120 * loading a session from the .gvimrc file. */
4121 if (gui.starting && !gui.in_use)
4122 gui_start();
4123 #endif
4124 /* Show info about the existing swap file. */
4125 attention_message(buf, fname);
4127 /* We don't want a 'q' typed at the more-prompt
4128 * interrupt loading a file. */
4129 got_int = FALSE;
4132 #if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)
4133 if (swap_exists_action != SEA_NONE && choice == 0)
4135 char_u *name;
4137 name = alloc((unsigned)(STRLEN(fname)
4138 + STRLEN(_("Swap file \""))
4139 + STRLEN(_("\" already exists!")) + 5));
4140 if (name != NULL)
4142 STRCPY(name, _("Swap file \""));
4143 home_replace(NULL, fname, name + STRLEN(name),
4144 1000, TRUE);
4145 STRCAT(name, _("\" already exists!"));
4147 choice = do_dialog(VIM_WARNING,
4148 (char_u *)_("VIM - ATTENTION"),
4149 name == NULL
4150 ? (char_u *)_("Swap file already exists!")
4151 : name,
4152 # if defined(UNIX) || defined(__EMX__) || defined(VMS)
4153 process_still_running
4154 ? (char_u *)_("&Open Read-Only\n&Edit anyway\n&Recover\n&Quit\n&Abort") :
4155 # endif
4156 (char_u *)_("&Open Read-Only\n&Edit anyway\n&Recover\n&Delete it\n&Quit\n&Abort"), 1, NULL);
4158 # if defined(UNIX) || defined(__EMX__) || defined(VMS)
4159 if (process_still_running && choice >= 4)
4160 choice++; /* Skip missing "Delete it" button */
4161 # endif
4162 vim_free(name);
4164 /* pretend screen didn't scroll, need redraw anyway */
4165 msg_scrolled = 0;
4166 redraw_all_later(NOT_VALID);
4168 #endif
4170 #if defined(HAS_SWAP_EXISTS_ACTION)
4171 if (choice > 0)
4173 switch (choice)
4175 case 1:
4176 buf->b_p_ro = TRUE;
4177 break;
4178 case 2:
4179 break;
4180 case 3:
4181 swap_exists_action = SEA_RECOVER;
4182 break;
4183 case 4:
4184 mch_remove(fname);
4185 break;
4186 case 5:
4187 swap_exists_action = SEA_QUIT;
4188 break;
4189 case 6:
4190 swap_exists_action = SEA_QUIT;
4191 got_int = TRUE;
4192 break;
4195 /* If the file was deleted this fname can be used. */
4196 if (mch_getperm(fname) < 0)
4197 break;
4199 else
4200 #endif
4202 MSG_PUTS("\n");
4203 if (msg_silent == 0)
4204 /* call wait_return() later */
4205 need_wait_return = TRUE;
4208 #ifdef CREATE_DUMMY_FILE
4209 /* Going to try another name, need the dummy file again. */
4210 if (did_use_dummy)
4211 dummyfd = mch_fopen((char *)buf->b_fname, "w");
4212 #endif
4218 * Change the ".swp" extension to find another file that can be used.
4219 * First decrement the last char: ".swo", ".swn", etc.
4220 * If that still isn't enough decrement the last but one char: ".svz"
4221 * Can happen when editing many "No Name" buffers.
4223 if (fname[n - 1] == 'a') /* ".s?a" */
4225 if (fname[n - 2] == 'a') /* ".saa": tried enough, give up */
4227 EMSG(_("E326: Too many swap files found"));
4228 vim_free(fname);
4229 fname = NULL;
4230 break;
4232 --fname[n - 2]; /* ".svz", ".suz", etc. */
4233 fname[n - 1] = 'z' + 1;
4235 --fname[n - 1]; /* ".swo", ".swn", etc. */
4238 vim_free(dir_name);
4239 #ifdef CREATE_DUMMY_FILE
4240 if (dummyfd != NULL) /* file has been created temporarily */
4242 fclose(dummyfd);
4243 mch_remove(buf->b_fname);
4245 #endif
4246 return fname;
4249 static int
4250 b0_magic_wrong(b0p)
4251 ZERO_BL *b0p;
4253 return (b0p->b0_magic_long != (long)B0_MAGIC_LONG
4254 || b0p->b0_magic_int != (int)B0_MAGIC_INT
4255 || b0p->b0_magic_short != (short)B0_MAGIC_SHORT
4256 || b0p->b0_magic_char != B0_MAGIC_CHAR);
4259 #ifdef CHECK_INODE
4261 * Compare current file name with file name from swap file.
4262 * Try to use inode numbers when possible.
4263 * Return non-zero when files are different.
4265 * When comparing file names a few things have to be taken into consideration:
4266 * - When working over a network the full path of a file depends on the host.
4267 * We check the inode number if possible. It is not 100% reliable though,
4268 * because the device number cannot be used over a network.
4269 * - When a file does not exist yet (editing a new file) there is no inode
4270 * number.
4271 * - The file name in a swap file may not be valid on the current host. The
4272 * "~user" form is used whenever possible to avoid this.
4274 * This is getting complicated, let's make a table:
4276 * ino_c ino_s fname_c fname_s differ =
4278 * both files exist -> compare inode numbers:
4279 * != 0 != 0 X X ino_c != ino_s
4281 * inode number(s) unknown, file names available -> compare file names
4282 * == 0 X OK OK fname_c != fname_s
4283 * X == 0 OK OK fname_c != fname_s
4285 * current file doesn't exist, file for swap file exist, file name(s) not
4286 * available -> probably different
4287 * == 0 != 0 FAIL X TRUE
4288 * == 0 != 0 X FAIL TRUE
4290 * current file exists, inode for swap unknown, file name(s) not
4291 * available -> probably different
4292 * != 0 == 0 FAIL X TRUE
4293 * != 0 == 0 X FAIL TRUE
4295 * current file doesn't exist, inode for swap unknown, one file name not
4296 * available -> probably different
4297 * == 0 == 0 FAIL OK TRUE
4298 * == 0 == 0 OK FAIL TRUE
4300 * current file doesn't exist, inode for swap unknown, both file names not
4301 * available -> probably same file
4302 * == 0 == 0 FAIL FAIL FALSE
4304 * Note that when the ino_t is 64 bits, only the last 32 will be used. This
4305 * can't be changed without making the block 0 incompatible with 32 bit
4306 * versions.
4309 static int
4310 fnamecmp_ino(fname_c, fname_s, ino_block0)
4311 char_u *fname_c; /* current file name */
4312 char_u *fname_s; /* file name from swap file */
4313 long ino_block0;
4315 struct stat st;
4316 ino_t ino_c = 0; /* ino of current file */
4317 ino_t ino_s; /* ino of file from swap file */
4318 char_u buf_c[MAXPATHL]; /* full path of fname_c */
4319 char_u buf_s[MAXPATHL]; /* full path of fname_s */
4320 int retval_c; /* flag: buf_c valid */
4321 int retval_s; /* flag: buf_s valid */
4323 if (mch_stat((char *)fname_c, &st) == 0)
4324 ino_c = (ino_t)st.st_ino;
4327 * First we try to get the inode from the file name, because the inode in
4328 * the swap file may be outdated. If that fails (e.g. this path is not
4329 * valid on this machine), use the inode from block 0.
4331 if (mch_stat((char *)fname_s, &st) == 0)
4332 ino_s = (ino_t)st.st_ino;
4333 else
4334 ino_s = (ino_t)ino_block0;
4336 if (ino_c && ino_s)
4337 return (ino_c != ino_s);
4340 * One of the inode numbers is unknown, try a forced vim_FullName() and
4341 * compare the file names.
4343 retval_c = vim_FullName(fname_c, buf_c, MAXPATHL, TRUE);
4344 retval_s = vim_FullName(fname_s, buf_s, MAXPATHL, TRUE);
4345 if (retval_c == OK && retval_s == OK)
4346 return (STRCMP(buf_c, buf_s) != 0);
4349 * Can't compare inodes or file names, guess that the files are different,
4350 * unless both appear not to exist at all.
4352 if (ino_s == 0 && ino_c == 0 && retval_c == FAIL && retval_s == FAIL)
4353 return FALSE;
4354 return TRUE;
4356 #endif /* CHECK_INODE */
4359 * Move a long integer into a four byte character array.
4360 * Used for machine independency in block zero.
4362 static void
4363 long_to_char(n, s)
4364 long n;
4365 char_u *s;
4367 s[0] = (char_u)(n & 0xff);
4368 n = (unsigned)n >> 8;
4369 s[1] = (char_u)(n & 0xff);
4370 n = (unsigned)n >> 8;
4371 s[2] = (char_u)(n & 0xff);
4372 n = (unsigned)n >> 8;
4373 s[3] = (char_u)(n & 0xff);
4376 static long
4377 char_to_long(s)
4378 char_u *s;
4380 long retval;
4382 retval = s[3];
4383 retval <<= 8;
4384 retval |= s[2];
4385 retval <<= 8;
4386 retval |= s[1];
4387 retval <<= 8;
4388 retval |= s[0];
4390 return retval;
4394 * Set the flags in the first block of the swap file:
4395 * - file is modified or not: buf->b_changed
4396 * - 'fileformat'
4397 * - 'fileencoding'
4399 void
4400 ml_setflags(buf)
4401 buf_T *buf;
4403 bhdr_T *hp;
4404 ZERO_BL *b0p;
4406 if (!buf->b_ml.ml_mfp)
4407 return;
4408 for (hp = buf->b_ml.ml_mfp->mf_used_last; hp != NULL; hp = hp->bh_prev)
4410 if (hp->bh_bnum == 0)
4412 b0p = (ZERO_BL *)(hp->bh_data);
4413 b0p->b0_dirty = buf->b_changed ? B0_DIRTY : 0;
4414 b0p->b0_flags = (b0p->b0_flags & ~B0_FF_MASK)
4415 | (get_fileformat(buf) + 1);
4416 #ifdef FEAT_MBYTE
4417 add_b0_fenc(b0p, buf);
4418 #endif
4419 hp->bh_flags |= BH_DIRTY;
4420 mf_sync(buf->b_ml.ml_mfp, MFS_ZERO);
4421 break;
4426 #if defined(FEAT_BYTEOFF) || defined(PROTO)
4428 #define MLCS_MAXL 800 /* max no of lines in chunk */
4429 #define MLCS_MINL 400 /* should be half of MLCS_MAXL */
4432 * Keep information for finding byte offset of a line, updtytpe may be one of:
4433 * ML_CHNK_ADDLINE: Add len to parent chunk, possibly splitting it
4434 * Careful: ML_CHNK_ADDLINE may cause ml_find_line() to be called.
4435 * ML_CHNK_DELLINE: Subtract len from parent chunk, possibly deleting it
4436 * ML_CHNK_UPDLINE: Add len to parent chunk, as a signed entity.
4438 static void
4439 ml_updatechunk(buf, line, len, updtype)
4440 buf_T *buf;
4441 linenr_T line;
4442 long len;
4443 int updtype;
4445 static buf_T *ml_upd_lastbuf = NULL;
4446 static linenr_T ml_upd_lastline;
4447 static linenr_T ml_upd_lastcurline;
4448 static int ml_upd_lastcurix;
4450 linenr_T curline = ml_upd_lastcurline;
4451 int curix = ml_upd_lastcurix;
4452 long size;
4453 chunksize_T *curchnk;
4454 int rest;
4455 bhdr_T *hp;
4456 DATA_BL *dp;
4458 if (buf->b_ml.ml_usedchunks == -1 || len == 0)
4459 return;
4460 if (buf->b_ml.ml_chunksize == NULL)
4462 buf->b_ml.ml_chunksize = (chunksize_T *)
4463 alloc((unsigned)sizeof(chunksize_T) * 100);
4464 if (buf->b_ml.ml_chunksize == NULL)
4466 buf->b_ml.ml_usedchunks = -1;
4467 return;
4469 buf->b_ml.ml_numchunks = 100;
4470 buf->b_ml.ml_usedchunks = 1;
4471 buf->b_ml.ml_chunksize[0].mlcs_numlines = 1;
4472 buf->b_ml.ml_chunksize[0].mlcs_totalsize = 1;
4475 if (updtype == ML_CHNK_UPDLINE && buf->b_ml.ml_line_count == 1)
4478 * First line in empty buffer from ml_flush_line() -- reset
4480 buf->b_ml.ml_usedchunks = 1;
4481 buf->b_ml.ml_chunksize[0].mlcs_numlines = 1;
4482 buf->b_ml.ml_chunksize[0].mlcs_totalsize =
4483 (long)STRLEN(buf->b_ml.ml_line_ptr) + 1;
4484 return;
4488 * Find chunk that our line belongs to, curline will be at start of the
4489 * chunk.
4491 if (buf != ml_upd_lastbuf || line != ml_upd_lastline + 1
4492 || updtype != ML_CHNK_ADDLINE)
4494 for (curline = 1, curix = 0;
4495 curix < buf->b_ml.ml_usedchunks - 1
4496 && line >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4497 curix++)
4499 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4502 else if (line >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines
4503 && curix < buf->b_ml.ml_usedchunks - 1)
4505 /* Adjust cached curix & curline */
4506 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4507 curix++;
4509 curchnk = buf->b_ml.ml_chunksize + curix;
4511 if (updtype == ML_CHNK_DELLINE)
4512 len = -len;
4513 curchnk->mlcs_totalsize += len;
4514 if (updtype == ML_CHNK_ADDLINE)
4516 curchnk->mlcs_numlines++;
4518 /* May resize here so we don't have to do it in both cases below */
4519 if (buf->b_ml.ml_usedchunks + 1 >= buf->b_ml.ml_numchunks)
4521 buf->b_ml.ml_numchunks = buf->b_ml.ml_numchunks * 3 / 2;
4522 buf->b_ml.ml_chunksize = (chunksize_T *)
4523 vim_realloc(buf->b_ml.ml_chunksize,
4524 sizeof(chunksize_T) * buf->b_ml.ml_numchunks);
4525 if (buf->b_ml.ml_chunksize == NULL)
4527 /* Hmmmm, Give up on offset for this buffer */
4528 buf->b_ml.ml_usedchunks = -1;
4529 return;
4533 if (buf->b_ml.ml_chunksize[curix].mlcs_numlines >= MLCS_MAXL)
4535 int count; /* number of entries in block */
4536 int idx;
4537 int text_end;
4538 int linecnt;
4540 mch_memmove(buf->b_ml.ml_chunksize + curix + 1,
4541 buf->b_ml.ml_chunksize + curix,
4542 (buf->b_ml.ml_usedchunks - curix) *
4543 sizeof(chunksize_T));
4544 /* Compute length of first half of lines in the splitted chunk */
4545 size = 0;
4546 linecnt = 0;
4547 while (curline < buf->b_ml.ml_line_count
4548 && linecnt < MLCS_MINL)
4550 if ((hp = ml_find_line(buf, curline, ML_FIND)) == NULL)
4552 buf->b_ml.ml_usedchunks = -1;
4553 return;
4555 dp = (DATA_BL *)(hp->bh_data);
4556 count = (long)(buf->b_ml.ml_locked_high) -
4557 (long)(buf->b_ml.ml_locked_low) + 1;
4558 idx = curline - buf->b_ml.ml_locked_low;
4559 curline = buf->b_ml.ml_locked_high + 1;
4560 if (idx == 0)/* first line in block, text at the end */
4561 text_end = dp->db_txt_end;
4562 else
4563 text_end = ((dp->db_index[idx - 1]) & DB_INDEX_MASK);
4564 /* Compute index of last line to use in this MEMLINE */
4565 rest = count - idx;
4566 if (linecnt + rest > MLCS_MINL)
4568 idx += MLCS_MINL - linecnt - 1;
4569 linecnt = MLCS_MINL;
4571 else
4573 idx = count - 1;
4574 linecnt += rest;
4576 size += text_end - ((dp->db_index[idx]) & DB_INDEX_MASK);
4578 buf->b_ml.ml_chunksize[curix].mlcs_numlines = linecnt;
4579 buf->b_ml.ml_chunksize[curix + 1].mlcs_numlines -= linecnt;
4580 buf->b_ml.ml_chunksize[curix].mlcs_totalsize = size;
4581 buf->b_ml.ml_chunksize[curix + 1].mlcs_totalsize -= size;
4582 buf->b_ml.ml_usedchunks++;
4583 ml_upd_lastbuf = NULL; /* Force recalc of curix & curline */
4584 return;
4586 else if (buf->b_ml.ml_chunksize[curix].mlcs_numlines >= MLCS_MINL
4587 && curix == buf->b_ml.ml_usedchunks - 1
4588 && buf->b_ml.ml_line_count - line <= 1)
4591 * We are in the last chunk and it is cheap to crate a new one
4592 * after this. Do it now to avoid the loop above later on
4594 curchnk = buf->b_ml.ml_chunksize + curix + 1;
4595 buf->b_ml.ml_usedchunks++;
4596 if (line == buf->b_ml.ml_line_count)
4598 curchnk->mlcs_numlines = 0;
4599 curchnk->mlcs_totalsize = 0;
4601 else
4604 * Line is just prior to last, move count for last
4605 * This is the common case when loading a new file
4607 hp = ml_find_line(buf, buf->b_ml.ml_line_count, ML_FIND);
4608 if (hp == NULL)
4610 buf->b_ml.ml_usedchunks = -1;
4611 return;
4613 dp = (DATA_BL *)(hp->bh_data);
4614 if (dp->db_line_count == 1)
4615 rest = dp->db_txt_end - dp->db_txt_start;
4616 else
4617 rest =
4618 ((dp->db_index[dp->db_line_count - 2]) & DB_INDEX_MASK)
4619 - dp->db_txt_start;
4620 curchnk->mlcs_totalsize = rest;
4621 curchnk->mlcs_numlines = 1;
4622 curchnk[-1].mlcs_totalsize -= rest;
4623 curchnk[-1].mlcs_numlines -= 1;
4627 else if (updtype == ML_CHNK_DELLINE)
4629 curchnk->mlcs_numlines--;
4630 ml_upd_lastbuf = NULL; /* Force recalc of curix & curline */
4631 if (curix < (buf->b_ml.ml_usedchunks - 1)
4632 && (curchnk->mlcs_numlines + curchnk[1].mlcs_numlines)
4633 <= MLCS_MINL)
4635 curix++;
4636 curchnk = buf->b_ml.ml_chunksize + curix;
4638 else if (curix == 0 && curchnk->mlcs_numlines <= 0)
4640 buf->b_ml.ml_usedchunks--;
4641 mch_memmove(buf->b_ml.ml_chunksize, buf->b_ml.ml_chunksize + 1,
4642 buf->b_ml.ml_usedchunks * sizeof(chunksize_T));
4643 return;
4645 else if (curix == 0 || (curchnk->mlcs_numlines > 10
4646 && (curchnk->mlcs_numlines + curchnk[-1].mlcs_numlines)
4647 > MLCS_MINL))
4649 return;
4652 /* Collapse chunks */
4653 curchnk[-1].mlcs_numlines += curchnk->mlcs_numlines;
4654 curchnk[-1].mlcs_totalsize += curchnk->mlcs_totalsize;
4655 buf->b_ml.ml_usedchunks--;
4656 if (curix < buf->b_ml.ml_usedchunks)
4658 mch_memmove(buf->b_ml.ml_chunksize + curix,
4659 buf->b_ml.ml_chunksize + curix + 1,
4660 (buf->b_ml.ml_usedchunks - curix) *
4661 sizeof(chunksize_T));
4663 return;
4665 ml_upd_lastbuf = buf;
4666 ml_upd_lastline = line;
4667 ml_upd_lastcurline = curline;
4668 ml_upd_lastcurix = curix;
4672 * Find offset for line or line with offset.
4673 * Find line with offset if "lnum" is 0; return remaining offset in offp
4674 * Find offset of line if "lnum" > 0
4675 * return -1 if information is not available
4677 long
4678 ml_find_line_or_offset(buf, lnum, offp)
4679 buf_T *buf;
4680 linenr_T lnum;
4681 long *offp;
4683 linenr_T curline;
4684 int curix;
4685 long size;
4686 bhdr_T *hp;
4687 DATA_BL *dp;
4688 int count; /* number of entries in block */
4689 int idx;
4690 int start_idx;
4691 int text_end;
4692 long offset;
4693 int len;
4694 int ffdos = (get_fileformat(buf) == EOL_DOS);
4695 int extra = 0;
4697 /* take care of cached line first */
4698 ml_flush_line(curbuf);
4700 if (buf->b_ml.ml_usedchunks == -1
4701 || buf->b_ml.ml_chunksize == NULL
4702 || lnum < 0)
4703 return -1;
4705 if (offp == NULL)
4706 offset = 0;
4707 else
4708 offset = *offp;
4709 if (lnum == 0 && offset <= 0)
4710 return 1; /* Not a "find offset" and offset 0 _must_ be in line 1 */
4712 * Find the last chunk before the one containing our line. Last chunk is
4713 * special because it will never qualify
4715 curline = 1;
4716 curix = size = 0;
4717 while (curix < buf->b_ml.ml_usedchunks - 1
4718 && ((lnum != 0
4719 && lnum >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines)
4720 || (offset != 0
4721 && offset > size + buf->b_ml.ml_chunksize[curix].mlcs_totalsize
4722 + ffdos * buf->b_ml.ml_chunksize[curix].mlcs_numlines)))
4724 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4725 size += buf->b_ml.ml_chunksize[curix].mlcs_totalsize;
4726 if (offset && ffdos)
4727 size += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4728 curix++;
4731 while ((lnum != 0 && curline < lnum) || (offset != 0 && size < offset))
4733 if (curline > buf->b_ml.ml_line_count
4734 || (hp = ml_find_line(buf, curline, ML_FIND)) == NULL)
4735 return -1;
4736 dp = (DATA_BL *)(hp->bh_data);
4737 count = (long)(buf->b_ml.ml_locked_high) -
4738 (long)(buf->b_ml.ml_locked_low) + 1;
4739 start_idx = idx = curline - buf->b_ml.ml_locked_low;
4740 if (idx == 0)/* first line in block, text at the end */
4741 text_end = dp->db_txt_end;
4742 else
4743 text_end = ((dp->db_index[idx - 1]) & DB_INDEX_MASK);
4744 /* Compute index of last line to use in this MEMLINE */
4745 if (lnum != 0)
4747 if (curline + (count - idx) >= lnum)
4748 idx += lnum - curline - 1;
4749 else
4750 idx = count - 1;
4752 else
4754 extra = 0;
4755 while (offset >= size
4756 + text_end - (int)((dp->db_index[idx]) & DB_INDEX_MASK)
4757 + ffdos)
4759 if (ffdos)
4760 size++;
4761 if (idx == count - 1)
4763 extra = 1;
4764 break;
4766 idx++;
4769 len = text_end - ((dp->db_index[idx]) & DB_INDEX_MASK);
4770 size += len;
4771 if (offset != 0 && size >= offset)
4773 if (size + ffdos == offset)
4774 *offp = 0;
4775 else if (idx == start_idx)
4776 *offp = offset - size + len;
4777 else
4778 *offp = offset - size + len
4779 - (text_end - ((dp->db_index[idx - 1]) & DB_INDEX_MASK));
4780 curline += idx - start_idx + extra;
4781 if (curline > buf->b_ml.ml_line_count)
4782 return -1; /* exactly one byte beyond the end */
4783 return curline;
4785 curline = buf->b_ml.ml_locked_high + 1;
4788 if (lnum != 0)
4790 /* Count extra CR characters. */
4791 if (ffdos)
4792 size += lnum - 1;
4794 /* Don't count the last line break if 'bin' and 'noeol'. */
4795 if (buf->b_p_bin && !buf->b_p_eol)
4796 size -= ffdos + 1;
4799 return size;
4803 * Goto byte in buffer with offset 'cnt'.
4805 void
4806 goto_byte(cnt)
4807 long cnt;
4809 long boff = cnt;
4810 linenr_T lnum;
4812 ml_flush_line(curbuf); /* cached line may be dirty */
4813 setpcmark();
4814 if (boff)
4815 --boff;
4816 lnum = ml_find_line_or_offset(curbuf, (linenr_T)0, &boff);
4817 if (lnum < 1) /* past the end */
4819 curwin->w_cursor.lnum = curbuf->b_ml.ml_line_count;
4820 curwin->w_curswant = MAXCOL;
4821 coladvance((colnr_T)MAXCOL);
4823 else
4825 curwin->w_cursor.lnum = lnum;
4826 curwin->w_cursor.col = (colnr_T)boff;
4827 # ifdef FEAT_VIRTUALEDIT
4828 curwin->w_cursor.coladd = 0;
4829 # endif
4830 curwin->w_set_curswant = TRUE;
4832 check_cursor();
4834 # ifdef FEAT_MBYTE
4835 /* Make sure the cursor is on the first byte of a multi-byte char. */
4836 if (has_mbyte)
4837 mb_adjust_cursor();
4838 # endif
4840 #endif