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.
11 /* #define CHECK(c, s) if (c) EMSG(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,
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
45 #if defined(MSDOS) || defined(WIN16) || defined(WIN32) || defined(_WIN64)
46 # include "vimio.h" /* for mch_open(), must be before vim.h */
51 #ifndef UNIX /* it's in os_unix.h for Unix */
55 #if defined(SASC) || defined(__amigaos4__)
56 # include <proto/dos.h> /* for Open() and Close() */
63 typedef struct block0 ZERO_BL
; /* contents of the first block */
64 typedef struct pointer_block PTR_BL
; /* contents of a pointer block */
65 typedef struct data_block DATA_BL
; /* contents of a data block */
66 typedef struct pointer_entry PTR_EN
; /* block/line-count pair */
68 #define DATA_ID (('d' << 8) + 'a') /* data block id */
69 #define PTR_ID (('p' << 8) + 't') /* pointer block id */
70 #define BLOCK0_ID0 'b' /* block 0 id 0 */
71 #define BLOCK0_ID1 '0' /* block 0 id 1 */
74 * pointer to a block, used in a pointer block
78 blocknr_T pe_bnum
; /* block number */
79 linenr_T pe_line_count
; /* number of lines in this branch */
80 linenr_T pe_old_lnum
; /* lnum for this block (for recovery) */
81 int pe_page_count
; /* number of pages in block pe_bnum */
85 * A pointer block contains a list of branches in the tree.
89 short_u pb_id
; /* ID for pointer block: PTR_ID */
90 short_u pb_count
; /* number of pointer in this block */
91 short_u pb_count_max
; /* maximum value for pb_count */
92 PTR_EN pb_pointer
[1]; /* list of pointers to blocks (actually longer)
93 * followed by empty space until end of page */
97 * A data block is a leaf in the tree.
99 * The text of the lines is at the end of the block. The text of the first line
100 * in the block is put at the end, the text of the second line in front of it,
101 * etc. Thus the order of the lines is the opposite of the line number.
105 short_u db_id
; /* ID for data block: DATA_ID */
106 unsigned db_free
; /* free space available */
107 unsigned db_txt_start
; /* byte where text starts */
108 unsigned db_txt_end
; /* byte just after data block */
109 linenr_T db_line_count
; /* number of lines in this block */
110 unsigned db_index
[1]; /* index for start of line (actually bigger)
111 * followed by empty space upto db_txt_start
112 * followed by the text in the lines until
117 * The low bits of db_index hold the actual index. The topmost bit is
118 * used for the global command to be able to mark a line.
119 * This method is not clean, but otherwise there would be at least one extra
120 * byte used for each line.
121 * The mark has to be in this place to keep it with the correct line when other
122 * lines are inserted or deleted.
124 #define DB_MARKED ((unsigned)1 << ((sizeof(unsigned) * 8) - 1))
125 #define DB_INDEX_MASK (~DB_MARKED)
127 #define INDEX_SIZE (sizeof(unsigned)) /* size of one db_index entry */
128 #define HEADER_SIZE (sizeof(DATA_BL) - INDEX_SIZE) /* size of data block header */
130 #define B0_FNAME_SIZE_ORG 900 /* what it was in older versions */
131 #define B0_FNAME_SIZE 898
132 #define B0_UNAME_SIZE 40
133 #define B0_HNAME_SIZE 40
135 * Restrict the numbers to 32 bits, otherwise most compilers will complain.
136 * This won't detect a 64 bit machine that only swaps a byte in the top 32
137 * bits, but that is crazy anyway.
139 #define B0_MAGIC_LONG 0x30313233L
140 #define B0_MAGIC_INT 0x20212223L
141 #define B0_MAGIC_SHORT 0x10111213L
142 #define B0_MAGIC_CHAR 0x55
145 * Block zero holds all info about the swap file.
147 * NOTE: DEFINITION OF BLOCK 0 SHOULD NOT CHANGE! It would make all existing
148 * swap files unusable!
150 * If size of block0 changes anyway, adjust MIN_SWAP_PAGE_SIZE in vim.h!!
152 * This block is built up of single bytes, to make it portable across
153 * different machines. b0_magic_* is used to check the byte order and size of
154 * variables, because the rest of the swap file is not portable.
158 char_u b0_id
[2]; /* id for block 0: BLOCK0_ID0 and BLOCK0_ID1 */
159 char_u b0_version
[10]; /* Vim version string */
160 char_u b0_page_size
[4];/* number of bytes per page */
161 char_u b0_mtime
[4]; /* last modification time of file */
162 char_u b0_ino
[4]; /* inode of b0_fname */
163 char_u b0_pid
[4]; /* process id of creator (or 0) */
164 char_u b0_uname
[B0_UNAME_SIZE
]; /* name of user (uid if no name) */
165 char_u b0_hname
[B0_HNAME_SIZE
]; /* host name (if it has a name) */
166 char_u b0_fname
[B0_FNAME_SIZE_ORG
]; /* name of file being edited */
167 long b0_magic_long
; /* check for byte order of long */
168 int b0_magic_int
; /* check for byte order of int */
169 short b0_magic_short
; /* check for byte order of short */
170 char_u b0_magic_char
; /* check for last char */
174 * Note: b0_dirty and b0_flags are put at the end of the file name. For very
175 * long file names in older versions of Vim they are invalid.
176 * The 'fileencoding' comes before b0_flags, with a NUL in front. But only
177 * when there is room, for very long file names it's omitted.
179 #define B0_DIRTY 0x55
180 #define b0_dirty b0_fname[B0_FNAME_SIZE_ORG-1]
183 * The b0_flags field is new in Vim 7.0.
185 #define b0_flags b0_fname[B0_FNAME_SIZE_ORG-2]
187 /* The lowest two bits contain the fileformat. Zero means it's not set
188 * (compatible with Vim 6.x), otherwise it's EOL_UNIX + 1, EOL_DOS + 1 or
192 /* Swap file is in directory of edited file. Used to find the file from
193 * different mount points. */
194 #define B0_SAME_DIR 4
196 /* The 'fileencoding' is at the end of b0_fname[], with a NUL in front of it.
197 * When empty there is only the NUL. */
198 #define B0_HAS_FENC 8
200 #define STACK_INCR 5 /* nr of entries added to ml_stack at a time */
203 * The line number where the first mark may be is remembered.
204 * If it is 0 there are no marks at all.
205 * (always used for the current buffer only, no buffer change possible while
206 * executing a global command).
208 static linenr_T lowest_marked
= 0;
211 * arguments for ml_find_line()
213 #define ML_DELETE 0x11 /* delete line */
214 #define ML_INSERT 0x12 /* insert line */
215 #define ML_FIND 0x13 /* just find the line */
216 #define ML_FLUSH 0x02 /* flush locked block */
217 #define ML_SIMPLE(x) (x & 0x10) /* DEL, INS or FIND */
219 static void ml_upd_block0
__ARGS((buf_T
*buf
, int set_fname
));
220 static void set_b0_fname
__ARGS((ZERO_BL
*, buf_T
*buf
));
221 static void set_b0_dir_flag
__ARGS((ZERO_BL
*b0p
, buf_T
*buf
));
223 static void add_b0_fenc
__ARGS((ZERO_BL
*b0p
, buf_T
*buf
));
225 static time_t swapfile_info
__ARGS((char_u
*));
226 static int recov_file_names
__ARGS((char_u
**, char_u
*, int prepend_dot
));
227 static int ml_append_int
__ARGS((buf_T
*, linenr_T
, char_u
*, colnr_T
, int, int));
228 static int ml_delete_int
__ARGS((buf_T
*, linenr_T
, int));
229 static char_u
*findswapname
__ARGS((buf_T
*, char_u
**, char_u
*));
230 static void ml_flush_line
__ARGS((buf_T
*));
231 static bhdr_T
*ml_new_data
__ARGS((memfile_T
*, int, int));
232 static bhdr_T
*ml_new_ptr
__ARGS((memfile_T
*));
233 static bhdr_T
*ml_find_line
__ARGS((buf_T
*, linenr_T
, int));
234 static int ml_add_stack
__ARGS((buf_T
*));
235 static void ml_lineadd
__ARGS((buf_T
*, int));
236 static int b0_magic_wrong
__ARGS((ZERO_BL
*));
238 static int fnamecmp_ino
__ARGS((char_u
*, char_u
*, long));
240 static void long_to_char
__ARGS((long, char_u
*));
241 static long char_to_long
__ARGS((char_u
*));
242 #if defined(UNIX) || defined(WIN3264)
243 static char_u
*make_percent_swname
__ARGS((char_u
*dir
, char_u
*name
));
246 static void ml_updatechunk
__ARGS((buf_T
*buf
, long line
, long len
, int updtype
));
249 static int resolve_symlink
__ARGS((char_u
*fname
, char_u
*buf
));
253 * Open a new memline for "buf".
255 * Return FAIL for failure, OK otherwise.
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 */
276 buf
->b_ml
.ml_chunksize
= NULL
;
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
;
285 buf
->b_may_swap
= FALSE
;
288 * Open the memfile. No swap file is created yet.
290 mfp
= mf_open(NULL
, 0);
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;
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 */
309 * fill block0 struct and write page 0
311 if ((hp
= mf_new(mfp
, FALSE
, 1)) == NULL
)
313 if (hp
->bh_bnum
!= 0)
315 EMSG(_("E298: Didn't get block nr 0?"));
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
);
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
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
)
360 if (hp
->bh_bnum
!= 1)
362 EMSG(_("E298: Didn't get block nr 1?"));
365 pp
= (PTR_BL
*)(hp
->bh_data
);
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
)
378 if (hp
->bh_bnum
!= 2)
380 EMSG(_("E298: Didn't get block nr 2?"));
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
; /* empty line */
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
;
404 * ml_setname() is called when the file name of "buf" has been changed.
405 * It may rename the swap file.
415 #if defined(MSDOS) || defined(MSWIN)
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.
427 ml_open_file(buf
); /* create a swap file */
432 * Try all directories in the 'directory' option.
437 if (*dirp
== NUL
) /* tried all directories, fail */
439 fname
= findswapname(buf
, &dirp
, mfp
->mf_fname
);
441 if (fname
== NULL
) /* no file name found for this dir */
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
);
455 /* if the file name is the same we don't have to do anything */
456 if (fnamecmp(fname
, mfp
->mf_fname
) == 0)
462 /* need to close the swap file before renaming */
469 /* try to rename the swap file */
470 if (vim_rename(mfp
->mf_fname
, fname
) == 0)
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 */
481 ml_upd_block0(buf
, FALSE
);
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);
492 /* could not (re)open the swap file, what can we do???? */
493 EMSG(_("E301: Oops, lost the swap file!!!"));
496 #ifdef HAVE_FD_CLOEXEC
498 int fdflags
= fcntl(mfp
->mf_fd
, F_GETFD
);
499 if (fdflags
>= 0 && (fdflags
& FD_CLOEXEC
) == 0)
500 fcntl(mfp
->mf_fd
, F_SETFD
, fdflags
| FD_CLOEXEC
);
505 EMSG(_("E302: Could not rename swap file"));
509 * Open a file for the memfile for all buffers that are not readonly or have
511 * Used when 'updatecount' changes from zero to non-zero.
518 for (buf
= firstbuf
; buf
!= NULL
; buf
= buf
->b_next
)
519 if (!buf
->b_p_ro
|| buf
->b_changed
)
524 * Open a swap file for an existing memfile, if there is no swap file yet.
525 * If we are unable to find a file name, mf_fname will be NULL
526 * and the memfile will be in memory only (no recovery possible).
536 mfp
= buf
->b_ml
.ml_mfp
;
537 if (mfp
== NULL
|| mfp
->mf_fd
>= 0 || !buf
->b_p_swf
)
538 return; /* nothing to do */
541 /* For a spell buffer use a temp file name. */
544 fname
= vim_tempname('s');
546 (void)mf_open_file(mfp
, fname
); /* consumes fname! */
547 buf
->b_may_swap
= FALSE
;
553 * Try all directories in 'directory' option.
560 /* There is a small chance that between chosing the swap file name and
561 * creating it, another Vim creates the file. In that case the
562 * creation will fail and we will use another directory. */
563 fname
= findswapname(buf
, &dirp
, NULL
); /* allocates fname */
566 if (mf_open_file(mfp
, fname
) == OK
) /* consumes fname! */
568 #if defined(MSDOS) || defined(MSWIN) || defined(RISCOS)
570 * set full pathname for swap file now, because a ":!cd dir" may
571 * change directory without us knowing it.
575 ml_upd_block0(buf
, FALSE
);
577 /* Flush block zero, so others can read it */
578 if (mf_sync(mfp
, MFS_ZERO
) == OK
)
580 /* Mark all blocks that should be in the swapfile as dirty.
581 * Needed for when the 'swapfile' option was reset, so that
582 * the swap file was deleted, and then on again. */
586 /* Writing block 0 failed: close the file and try another dir */
587 mf_close_file(buf
, FALSE
);
591 if (mfp
->mf_fname
== NULL
) /* Failed! */
593 need_wait_return
= TRUE
; /* call wait_return later */
595 (void)EMSG2(_("E303: Unable to open swap file for \"%s\", recovery impossible"),
596 buf_spname(buf
) != NULL
597 ? (char_u
*)buf_spname(buf
)
602 /* don't try to open a swap file again */
603 buf
->b_may_swap
= FALSE
;
607 * If still need to create a swap file, and starting to edit a not-readonly
608 * file, or reading into an existing buffer, create a swap file now.
611 check_need_swap(newfile
)
612 int newfile
; /* reading file into new buffer */
614 if (curbuf
->b_may_swap
&& (!curbuf
->b_p_ro
|| !newfile
))
615 ml_open_file(curbuf
);
619 * Close memline for buffer 'buf'.
620 * If 'del_file' is TRUE, delete the swap file
623 ml_close(buf
, del_file
)
627 if (buf
->b_ml
.ml_mfp
== NULL
) /* not open */
629 mf_close(buf
->b_ml
.ml_mfp
, del_file
); /* close the .swp file */
630 if (buf
->b_ml
.ml_line_lnum
!= 0 && (buf
->b_ml
.ml_flags
& ML_LINE_DIRTY
))
631 vim_free(buf
->b_ml
.ml_line_ptr
);
632 vim_free(buf
->b_ml
.ml_stack
);
634 vim_free(buf
->b_ml
.ml_chunksize
);
635 buf
->b_ml
.ml_chunksize
= NULL
;
637 buf
->b_ml
.ml_mfp
= NULL
;
639 /* Reset the "recovered" flag, give the ATTENTION prompt the next time
640 * this buffer is loaded. */
641 buf
->b_flags
&= ~BF_RECOVERED
;
645 * Close all existing memlines and memfiles.
646 * Only used when exiting.
647 * When 'del_file' is TRUE, delete the memfiles.
648 * But don't delete files that were ":preserve"d when we are POSIX compatible.
651 ml_close_all(del_file
)
656 for (buf
= firstbuf
; buf
!= NULL
; buf
= buf
->b_next
)
657 ml_close(buf
, del_file
&& ((buf
->b_flags
& BF_PRESERVED
) == 0
658 || vim_strchr(p_cpo
, CPO_PRESERVE
) == NULL
));
660 vim_deltempdir(); /* delete created temp directory */
665 * Close all memfiles for not modified buffers.
666 * Only use just before exiting!
673 for (buf
= firstbuf
; buf
!= NULL
; buf
= buf
->b_next
)
674 if (!bufIsChanged(buf
))
675 ml_close(buf
, TRUE
); /* close all not-modified buffers */
679 * Update the timestamp in the .swp file.
680 * Used when the file has been written.
686 ml_upd_block0(buf
, TRUE
);
690 * Update the timestamp or the B0_SAME_DIR flag of the .swp file.
693 ml_upd_block0(buf
, set_fname
)
701 mfp
= buf
->b_ml
.ml_mfp
;
702 if (mfp
== NULL
|| (hp
= mf_get(mfp
, (blocknr_T
)0, 1)) == NULL
)
704 b0p
= (ZERO_BL
*)(hp
->bh_data
);
705 if (b0p
->b0_id
[0] != BLOCK0_ID0
|| b0p
->b0_id
[1] != BLOCK0_ID1
)
706 EMSG(_("E304: ml_upd_block0(): Didn't get block 0??"));
710 set_b0_fname(b0p
, buf
);
712 set_b0_dir_flag(b0p
, buf
);
714 mf_put(mfp
, hp
, TRUE
, FALSE
);
718 * Write file name and timestamp into block 0 of a swap file.
719 * Also set buf->b_mtime.
720 * Don't use NameBuff[]!!!
723 set_b0_fname(b0p
, buf
)
729 if (buf
->b_ffname
== NULL
)
730 b0p
->b0_fname
[0] = NUL
;
733 #if defined(MSDOS) || defined(MSWIN) || defined(AMIGA) || defined(RISCOS)
734 /* Systems that cannot translate "~user" back into a path: copy the
735 * file name unmodified. Do use slashes instead of backslashes for
737 vim_strncpy(b0p
->b0_fname
, buf
->b_ffname
, B0_FNAME_SIZE
- 1);
738 # ifdef BACKSLASH_IN_FILENAME
739 forward_slash(b0p
->b0_fname
);
743 char_u uname
[B0_UNAME_SIZE
];
746 * For a file under the home directory of the current user, we try to
747 * replace the home directory path with "~user". This helps when
748 * editing the same file on different machines over a network.
749 * First replace home dir path with "~/" with home_replace().
750 * Then insert the user name to get "~user/".
752 home_replace(NULL
, buf
->b_ffname
, b0p
->b0_fname
, B0_FNAME_SIZE
, TRUE
);
753 if (b0p
->b0_fname
[0] == '~')
755 flen
= STRLEN(b0p
->b0_fname
);
756 /* If there is no user name or it is too long, don't use "~/" */
757 if (get_user_name(uname
, B0_UNAME_SIZE
) == FAIL
758 || (ulen
= STRLEN(uname
)) + flen
> B0_FNAME_SIZE
- 1)
759 vim_strncpy(b0p
->b0_fname
, buf
->b_ffname
, B0_FNAME_SIZE
- 1);
762 mch_memmove(b0p
->b0_fname
+ ulen
+ 1, b0p
->b0_fname
+ 1, flen
);
763 mch_memmove(b0p
->b0_fname
+ 1, uname
, ulen
);
767 if (mch_stat((char *)buf
->b_ffname
, &st
) >= 0)
769 long_to_char((long)st
.st_mtime
, b0p
->b0_mtime
);
771 long_to_char((long)st
.st_ino
, b0p
->b0_ino
);
773 buf_store_time(buf
, &st
, buf
->b_ffname
);
774 buf
->b_mtime_read
= buf
->b_mtime
;
778 long_to_char(0L, b0p
->b0_mtime
);
780 long_to_char(0L, b0p
->b0_ino
);
783 buf
->b_mtime_read
= 0;
784 buf
->b_orig_size
= 0;
785 buf
->b_orig_mode
= 0;
790 /* Also add the 'fileencoding' if there is room. */
791 add_b0_fenc(b0p
, curbuf
);
796 * Update the B0_SAME_DIR flag of the swap file. It's set if the file and the
797 * swapfile for "buf" are in the same directory.
798 * This is fail safe: if we are not sure the directories are equal the flag is
802 set_b0_dir_flag(b0p
, buf
)
806 if (same_directory(buf
->b_ml
.ml_mfp
->mf_fname
, buf
->b_ffname
))
807 b0p
->b0_flags
|= B0_SAME_DIR
;
809 b0p
->b0_flags
&= ~B0_SAME_DIR
;
814 * When there is room, add the 'fileencoding' to block zero.
817 add_b0_fenc(b0p
, buf
)
823 n
= (int)STRLEN(buf
->b_p_fenc
);
824 if (STRLEN(b0p
->b0_fname
) + n
+ 1 > B0_FNAME_SIZE
)
825 b0p
->b0_flags
&= ~B0_HAS_FENC
;
828 mch_memmove((char *)b0p
->b0_fname
+ B0_FNAME_SIZE
- n
,
829 (char *)buf
->b_p_fenc
, (size_t)n
);
830 *(b0p
->b0_fname
+ B0_FNAME_SIZE
- n
- 1) = NUL
;
831 b0p
->b0_flags
|= B0_HAS_FENC
;
838 * try to recover curbuf from the .swp file
844 memfile_T
*mfp
= NULL
;
849 char_u
*b0_fenc
= NULL
;
855 struct stat org_stat
, swp_stat
;
869 int called_from_main
;
870 int serious_error
= TRUE
;
875 called_from_main
= (curbuf
->b_ml
.ml_mfp
== NULL
);
876 attr
= hl_attr(HLF_E
);
879 * If the file name ends in ".s[uvw][a-z]" we assume this is the swap file.
880 * Otherwise a search is done to find the swap file(s).
882 fname
= curbuf
->b_fname
;
883 if (fname
== NULL
) /* When there is no file name */
884 fname
= (char_u
*)"";
885 len
= (int)STRLEN(fname
);
887 #if defined(VMS) || defined(RISCOS)
888 STRNICMP(fname
+ len
- 4, "_s" , 2)
890 STRNICMP(fname
+ len
- 4, ".s" , 2)
893 && vim_strchr((char_u
*)"UVWuvw", fname
[len
- 2]) != NULL
894 && ASCII_ISALPHA(fname
[len
- 1]))
897 fname
= vim_strsave(fname
); /* make a copy for mf_open() */
903 /* count the number of matching swap files */
904 len
= recover_names(&fname
, FALSE
, 0);
905 if (len
== 0) /* no swap files found */
907 EMSG2(_("E305: No swap file found for %s"), fname
);
910 if (len
== 1) /* one swap file found, use it */
912 else /* several swap files found, choose */
914 /* list the names of the swap files */
915 (void)recover_names(&fname
, TRUE
, 0);
917 MSG_PUTS(_("Enter number of swap file to use (0 to quit): "));
918 i
= get_number(FALSE
, NULL
);
919 if (i
< 1 || i
> len
)
922 /* get the swap file name that will be used */
923 (void)recover_names(&fname
, FALSE
, i
);
926 goto theend
; /* out of memory */
928 /* When called from main() still need to initialize storage structure */
929 if (called_from_main
&& ml_open(curbuf
) == FAIL
)
933 * allocate a buffer structure (only the memline in it is really used)
935 buf
= (buf_T
*)alloc((unsigned)sizeof(buf_T
));
943 * init fields in memline struct
945 buf
->b_ml
.ml_stack_size
= 0; /* no stack yet */
946 buf
->b_ml
.ml_stack
= NULL
; /* no stack yet */
947 buf
->b_ml
.ml_stack_top
= 0; /* nothing in the stack */
948 buf
->b_ml
.ml_line_lnum
= 0; /* no cached line */
949 buf
->b_ml
.ml_locked
= NULL
; /* no locked block */
950 buf
->b_ml
.ml_flags
= 0;
953 * open the memfile from the old swap file
955 p
= vim_strsave(fname
); /* save fname for the message
956 (mf_open() may free fname) */
957 mfp
= mf_open(fname
, O_RDONLY
); /* consumes fname! */
958 if (mfp
== NULL
|| mfp
->mf_fd
< 0)
962 EMSG2(_("E306: Cannot open %s"), p
);
968 buf
->b_ml
.ml_mfp
= mfp
;
971 * The page size set in mf_open() might be different from the page size
972 * used in the swap file, we must get it from block 0. But to read block
973 * 0 we need a page size. Use the minimal size for block 0 here, it will
974 * be set to the real value below.
976 mfp
->mf_page_size
= MIN_SWAP_PAGE_SIZE
;
979 * try to read block 0
981 if ((hp
= mf_get(mfp
, (blocknr_T
)0, 1)) == NULL
)
984 MSG_PUTS_ATTR(_("Unable to read block 0 from "), attr
| MSG_HIST
);
985 msg_outtrans_attr(mfp
->mf_fname
, attr
| MSG_HIST
);
987 _("\nMaybe no changes were made or Vim did not update the swap file."),
992 b0p
= (ZERO_BL
*)(hp
->bh_data
);
993 if (STRNCMP(b0p
->b0_version
, "VIM 3.0", 7) == 0)
996 msg_outtrans_attr(mfp
->mf_fname
, MSG_HIST
);
997 MSG_PUTS_ATTR(_(" cannot be used with this version of Vim.\n"),
999 MSG_PUTS_ATTR(_("Use Vim version 3.0.\n"), MSG_HIST
);
1003 if (b0p
->b0_id
[0] != BLOCK0_ID0
|| b0p
->b0_id
[1] != BLOCK0_ID1
)
1005 EMSG2(_("E307: %s does not look like a Vim swap file"), mfp
->mf_fname
);
1008 if (b0_magic_wrong(b0p
))
1011 msg_outtrans_attr(mfp
->mf_fname
, attr
| MSG_HIST
);
1012 #if defined(MSDOS) || defined(MSWIN)
1013 if (STRNCMP(b0p
->b0_hname
, "PC ", 3) == 0)
1014 MSG_PUTS_ATTR(_(" cannot be used with this version of Vim.\n"),
1018 MSG_PUTS_ATTR(_(" cannot be used on this computer.\n"),
1020 MSG_PUTS_ATTR(_("The file was created on "), attr
| MSG_HIST
);
1021 /* avoid going past the end of a currupted hostname */
1022 b0p
->b0_fname
[0] = NUL
;
1023 MSG_PUTS_ATTR(b0p
->b0_hname
, attr
| MSG_HIST
);
1024 MSG_PUTS_ATTR(_(",\nor the file has been damaged."), attr
| MSG_HIST
);
1030 * If we guessed the wrong page size, we have to recalculate the
1031 * highest block number in the file.
1033 if (mfp
->mf_page_size
!= (unsigned)char_to_long(b0p
->b0_page_size
))
1035 unsigned previous_page_size
= mfp
->mf_page_size
;
1037 mf_new_page_size(mfp
, (unsigned)char_to_long(b0p
->b0_page_size
));
1038 if (mfp
->mf_page_size
< previous_page_size
)
1041 msg_outtrans_attr(mfp
->mf_fname
, attr
| MSG_HIST
);
1042 MSG_PUTS_ATTR(_(" has been damaged (page size is smaller than minimum value).\n"),
1047 if ((size
= lseek(mfp
->mf_fd
, (off_t
)0L, SEEK_END
)) <= 0)
1048 mfp
->mf_blocknr_max
= 0; /* no file or empty file */
1050 mfp
->mf_blocknr_max
= (blocknr_T
)(size
/ mfp
->mf_page_size
);
1051 mfp
->mf_infile_count
= mfp
->mf_blocknr_max
;
1053 /* need to reallocate the memory used to store the data */
1054 p
= alloc(mfp
->mf_page_size
);
1057 mch_memmove(p
, hp
->bh_data
, previous_page_size
);
1058 vim_free(hp
->bh_data
);
1060 b0p
= (ZERO_BL
*)(hp
->bh_data
);
1064 * If .swp file name given directly, use name from swap file for buffer.
1068 expand_env(b0p
->b0_fname
, NameBuff
, MAXPATHL
);
1069 if (setfname(curbuf
, NameBuff
, NULL
, TRUE
) == FAIL
)
1073 home_replace(NULL
, mfp
->mf_fname
, NameBuff
, MAXPATHL
, TRUE
);
1074 smsg((char_u
*)_("Using swap file \"%s\""), NameBuff
);
1076 if (buf_spname(curbuf
) != NULL
)
1077 STRCPY(NameBuff
, buf_spname(curbuf
));
1079 home_replace(NULL
, curbuf
->b_ffname
, NameBuff
, MAXPATHL
, TRUE
);
1080 smsg((char_u
*)_("Original file \"%s\""), NameBuff
);
1084 * check date of swap file and original file
1086 mtime
= char_to_long(b0p
->b0_mtime
);
1087 if (curbuf
->b_ffname
!= NULL
1088 && mch_stat((char *)curbuf
->b_ffname
, &org_stat
) != -1
1089 && ((mch_stat((char *)mfp
->mf_fname
, &swp_stat
) != -1
1090 && org_stat
.st_mtime
> swp_stat
.st_mtime
)
1091 || org_stat
.st_mtime
!= mtime
))
1093 EMSG(_("E308: Warning: Original file may have been changed"));
1097 /* Get the 'fileformat' and 'fileencoding' from block zero. */
1098 b0_ff
= (b0p
->b0_flags
& B0_FF_MASK
);
1099 if (b0p
->b0_flags
& B0_HAS_FENC
)
1101 for (p
= b0p
->b0_fname
+ B0_FNAME_SIZE
;
1102 p
> b0p
->b0_fname
&& p
[-1] != NUL
; --p
)
1104 b0_fenc
= vim_strnsave(p
, (int)(b0p
->b0_fname
+ B0_FNAME_SIZE
- p
));
1107 mf_put(mfp
, hp
, FALSE
, FALSE
); /* release block 0 */
1111 * Now that we are sure that the file is going to be recovered, clear the
1112 * contents of the current buffer.
1114 while (!(curbuf
->b_ml
.ml_flags
& ML_EMPTY
))
1115 ml_delete((linenr_T
)1, FALSE
);
1118 * Try reading the original file to obtain the values of 'fileformat',
1119 * 'fileencoding', etc. Ignore errors. The text itself is not used.
1121 if (curbuf
->b_ffname
!= NULL
)
1123 (void)readfile(curbuf
->b_ffname
, NULL
, (linenr_T
)0,
1124 (linenr_T
)0, (linenr_T
)MAXLNUM
, NULL
, READ_NEW
);
1125 while (!(curbuf
->b_ml
.ml_flags
& ML_EMPTY
))
1126 ml_delete((linenr_T
)1, FALSE
);
1129 /* Use the 'fileformat' and 'fileencoding' as stored in the swap file. */
1131 set_fileformat(b0_ff
- 1, OPT_LOCAL
);
1132 if (b0_fenc
!= NULL
)
1134 set_option_value((char_u
*)"fenc", 0L, b0_fenc
, OPT_LOCAL
);
1137 unchanged(curbuf
, TRUE
);
1139 bnum
= 1; /* start with block 1 */
1140 page_count
= 1; /* which is 1 page */
1141 lnum
= 0; /* append after line 0 in curbuf */
1143 idx
= 0; /* start with first index in block 1 */
1145 buf
->b_ml
.ml_stack_top
= 0;
1146 buf
->b_ml
.ml_stack
= NULL
;
1147 buf
->b_ml
.ml_stack_size
= 0; /* no stack yet */
1149 if (curbuf
->b_ffname
== NULL
)
1152 cannot_open
= FALSE
;
1154 serious_error
= FALSE
;
1155 for ( ; !got_int
; line_breakcheck())
1158 mf_put(mfp
, hp
, FALSE
, FALSE
); /* release previous block */
1163 if ((hp
= mf_get(mfp
, (blocknr_T
)bnum
, page_count
)) == NULL
)
1167 EMSG2(_("E309: Unable to read block 1 from %s"), mfp
->mf_fname
);
1171 ml_append(lnum
++, (char_u
*)_("???MANY LINES MISSING"),
1174 else /* there is a block */
1176 pp
= (PTR_BL
*)(hp
->bh_data
);
1177 if (pp
->pb_id
== PTR_ID
) /* it is a pointer block */
1179 /* check line count when using pointer block first time */
1180 if (idx
== 0 && line_count
!= 0)
1182 for (i
= 0; i
< (int)pp
->pb_count
; ++i
)
1183 line_count
-= pp
->pb_pointer
[i
].pe_line_count
;
1184 if (line_count
!= 0)
1187 ml_append(lnum
++, (char_u
*)_("???LINE COUNT WRONG"),
1192 if (pp
->pb_count
== 0)
1194 ml_append(lnum
++, (char_u
*)_("???EMPTY BLOCK"),
1198 else if (idx
< (int)pp
->pb_count
) /* go a block deeper */
1200 if (pp
->pb_pointer
[idx
].pe_bnum
< 0)
1203 * Data block with negative block number.
1204 * Try to read lines from the original file.
1205 * This is slow, but it works.
1209 line_count
= pp
->pb_pointer
[idx
].pe_line_count
;
1210 if (readfile(curbuf
->b_ffname
, NULL
, lnum
,
1211 pp
->pb_pointer
[idx
].pe_old_lnum
- 1,
1212 line_count
, NULL
, 0) == FAIL
)
1220 ml_append(lnum
++, (char_u
*)_("???LINES MISSING"),
1223 ++idx
; /* get same block again for next index */
1228 * going one block deeper in the tree
1230 if ((top
= ml_add_stack(buf
)) < 0) /* new entry in stack */
1233 break; /* out of memory */
1235 ip
= &(buf
->b_ml
.ml_stack
[top
]);
1239 bnum
= pp
->pb_pointer
[idx
].pe_bnum
;
1240 line_count
= pp
->pb_pointer
[idx
].pe_line_count
;
1241 page_count
= pp
->pb_pointer
[idx
].pe_page_count
;
1245 else /* not a pointer block */
1247 dp
= (DATA_BL
*)(hp
->bh_data
);
1248 if (dp
->db_id
!= DATA_ID
) /* block id wrong */
1252 EMSG2(_("E310: Block 1 ID wrong (%s not a .swp file?)"),
1257 ml_append(lnum
++, (char_u
*)_("???BLOCK MISSING"),
1263 * it is a data block
1264 * Append all the lines in this block
1268 * check length of block
1269 * if wrong, use length in pointer block
1271 if (page_count
* mfp
->mf_page_size
!= dp
->db_txt_end
)
1273 ml_append(lnum
++, (char_u
*)_("??? from here until ???END lines may be messed up"),
1277 dp
->db_txt_end
= page_count
* mfp
->mf_page_size
;
1280 /* make sure there is a NUL at the end of the block */
1281 *((char_u
*)dp
+ dp
->db_txt_end
- 1) = NUL
;
1284 * check number of lines in block
1285 * if wrong, use count in data block
1287 if (line_count
!= dp
->db_line_count
)
1289 ml_append(lnum
++, (char_u
*)_("??? from here until ???END lines may have been inserted/deleted"),
1295 for (i
= 0; i
< dp
->db_line_count
; ++i
)
1297 txt_start
= (dp
->db_index
[i
] & DB_INDEX_MASK
);
1298 if (txt_start
<= (int)HEADER_SIZE
1299 || txt_start
>= (int)dp
->db_txt_end
)
1301 p
= (char_u
*)"???";
1305 p
= (char_u
*)dp
+ txt_start
;
1306 ml_append(lnum
++, p
, (colnr_T
)0, TRUE
);
1309 ml_append(lnum
++, (char_u
*)_("???END"),
1315 if (buf
->b_ml
.ml_stack_top
== 0) /* finished */
1319 * go one block up in the tree
1321 ip
= &(buf
->b_ml
.ml_stack
[--(buf
->b_ml
.ml_stack_top
)]);
1323 idx
= ip
->ip_index
+ 1; /* go to next index */
1328 * The dummy line from the empty buffer will now be after the last line in
1329 * the buffer. Delete it.
1331 ml_delete(curbuf
->b_ml
.ml_line_count
, FALSE
);
1332 curbuf
->b_flags
|= BF_RECOVERED
;
1334 recoverymode
= FALSE
;
1336 EMSG(_("E311: Recovery Interrupted"));
1340 MSG(">>>>>>>>>>>>>");
1341 EMSG(_("E312: Errors detected while recovering; look for lines starting with ???"));
1343 MSG(_("See \":help E312\" for more information."));
1344 MSG(">>>>>>>>>>>>>");
1348 MSG(_("Recovery completed. You should check if everything is OK."));
1349 MSG_PUTS(_("\n(You might want to write out this file under another name\n"));
1350 MSG_PUTS(_("and run diff with the original file to check for changes)\n"));
1351 MSG_PUTS(_("Delete the .swp file afterwards.\n\n"));
1352 cmdline_row
= msg_row
;
1354 redraw_curbuf_later(NOT_VALID
);
1357 recoverymode
= FALSE
;
1361 mf_put(mfp
, hp
, FALSE
, FALSE
);
1362 mf_close(mfp
, FALSE
); /* will also vim_free(mfp->mf_fname) */
1366 vim_free(buf
->b_ml
.ml_stack
);
1369 if (serious_error
&& called_from_main
)
1370 ml_close(curbuf
, TRUE
);
1374 apply_autocmds(EVENT_BUFREADPOST
, NULL
, curbuf
->b_fname
, FALSE
, curbuf
);
1375 apply_autocmds(EVENT_BUFWINENTER
, NULL
, curbuf
->b_fname
, FALSE
, curbuf
);
1382 * Find the names of swap files in current directory and the directory given
1383 * with the 'directory' option.
1386 * - list the swap files for "vim -r"
1387 * - count the number of swap files when recovering
1388 * - list the swap files when recovering
1389 * - find the name of the n'th swap file when recovering
1392 recover_names(fname
, list
, nr
)
1393 char_u
**fname
; /* base for swap file name */
1394 int list
; /* when TRUE, list the swap file names */
1395 int nr
; /* when non-zero, return nr'th swap file name */
1407 char_u
*fname_res
= *fname
;
1408 #ifdef HAVE_READLINK
1409 char_u fname_buf
[MAXPATHL
];
1411 /* Expand symlink in the file name, because the swap file is created with
1412 * the actual file instead of with the symlink. */
1413 if (resolve_symlink(*fname
, fname_buf
) == OK
)
1414 fname_res
= fname_buf
;
1419 /* use msg() to start the scrolling properly */
1420 msg((char_u
*)_("Swap files found:"));
1425 * Do the loop for every directory in 'directory'.
1426 * First allocate some memory to put the directory name in.
1428 dir_name
= alloc((unsigned)STRLEN(p_dir
) + 1);
1430 while (dir_name
!= NULL
&& *dirp
)
1433 * Isolate a directory name from *dirp and put it in dir_name (we know
1434 * it is large enough, so use 31000 for length).
1435 * Advance dirp to next directory name.
1437 (void)copy_option_part(&dirp
, dir_name
, 31000, ",");
1439 if (dir_name
[0] == '.' && dir_name
[1] == NUL
) /* check current dir */
1441 if (fname
== NULL
|| *fname
== NULL
)
1444 names
[0] = vim_strsave((char_u
*)"*_sw%");
1447 names
[0] = vim_strsave((char_u
*)"*_sw#");
1449 names
[0] = vim_strsave((char_u
*)"*.sw?");
1452 #if defined(UNIX) || defined(WIN3264)
1453 /* For Unix names starting with a dot are special. MS-Windows
1454 * supports this too, on some file systems. */
1455 names
[1] = vim_strsave((char_u
*)".*.sw?");
1456 names
[2] = vim_strsave((char_u
*)".sw?");
1460 names
[1] = vim_strsave((char_u
*)".*_sw%");
1468 num_names
= recov_file_names(names
, fname_res
, TRUE
);
1470 else /* check directory dir_name */
1472 if (fname
== NULL
|| *fname
== NULL
)
1475 names
[0] = concat_fnames(dir_name
, (char_u
*)"*_sw%", TRUE
);
1478 names
[0] = concat_fnames(dir_name
, (char_u
*)"*_sw#", TRUE
);
1480 names
[0] = concat_fnames(dir_name
, (char_u
*)"*.sw?", TRUE
);
1483 #if defined(UNIX) || defined(WIN3264)
1484 /* For Unix names starting with a dot are special. MS-Windows
1485 * supports this too, on some file systems. */
1486 names
[1] = concat_fnames(dir_name
, (char_u
*)".*.sw?", TRUE
);
1487 names
[2] = concat_fnames(dir_name
, (char_u
*)".sw?", TRUE
);
1491 names
[1] = concat_fnames(dir_name
, (char_u
*)".*_sw%", TRUE
);
1500 #if defined(UNIX) || defined(WIN3264)
1501 p
= dir_name
+ STRLEN(dir_name
);
1502 if (after_pathsep(dir_name
, p
) && p
[-1] == p
[-2])
1504 /* Ends with '//', Use Full path for swap name */
1505 tail
= make_percent_swname(dir_name
, fname_res
);
1510 tail
= gettail(fname_res
);
1511 tail
= concat_fnames(dir_name
, tail
, TRUE
);
1517 num_names
= recov_file_names(names
, tail
, FALSE
);
1523 /* check for out-of-memory */
1524 for (i
= 0; i
< num_names
; ++i
)
1526 if (names
[i
] == NULL
)
1528 for (i
= 0; i
< num_names
; ++i
)
1535 else if (expand_wildcards(num_names
, names
, &num_files
, &files
,
1536 EW_KEEPALL
|EW_FILE
|EW_SILENT
) == FAIL
)
1540 * When no swap file found, wildcard expansion might have failed (e.g.
1541 * not able to execute the shell).
1542 * Try finding a swap file by simply adding ".swp" to the file name.
1544 if (*dirp
== NUL
&& file_count
+ num_files
== 0
1545 && fname
!= NULL
&& *fname
!= NULL
)
1550 swapname
= modname(fname_res
,
1551 #if defined(VMS) || defined(RISCOS)
1552 (char_u
*)"_swp", FALSE
1554 (char_u
*)".swp", TRUE
1557 if (swapname
!= NULL
)
1559 if (mch_stat((char *)swapname
, &st
) != -1) /* It exists! */
1561 files
= (char_u
**)alloc((unsigned)sizeof(char_u
*));
1564 files
[0] = swapname
;
1574 * remove swapfile name of the current buffer, it must be ignored
1576 if (curbuf
->b_ml
.ml_mfp
!= NULL
1577 && (p
= curbuf
->b_ml
.ml_mfp
->mf_fname
) != NULL
)
1579 for (i
= 0; i
< num_files
; ++i
)
1580 if (fullpathcmp(p
, files
[i
], TRUE
) & FPC_SAME
)
1582 /* Remove the name from files[i]. Move further entries
1583 * down. When the array becomes empty free it here, since
1584 * FreeWild() won't be called below. */
1586 if (--num_files
== 0)
1589 for ( ; i
< num_files
; ++i
)
1590 files
[i
] = files
[i
+ 1];
1595 file_count
+= num_files
;
1596 if (nr
<= file_count
)
1598 *fname
= vim_strsave(files
[nr
- 1 + num_files
- file_count
]);
1599 dirp
= (char_u
*)""; /* stop searching */
1604 if (dir_name
[0] == '.' && dir_name
[1] == NUL
)
1606 if (fname
== NULL
|| *fname
== NULL
)
1607 MSG_PUTS(_(" In current directory:\n"));
1609 MSG_PUTS(_(" Using specified name:\n"));
1613 MSG_PUTS(_(" In directory "));
1614 msg_home_replace(dir_name
);
1620 for (i
= 0; i
< num_files
; ++i
)
1622 /* print the swap file name */
1623 msg_outnum((long)++file_count
);
1625 msg_puts(gettail(files
[i
]));
1627 (void)swapfile_info(files
[i
]);
1631 MSG_PUTS(_(" -- none --\n"));
1635 file_count
+= num_files
;
1637 for (i
= 0; i
< num_names
; ++i
)
1640 FreeWild(num_files
, files
);
1646 #if defined(UNIX) || defined(WIN3264) /* Need _very_ long file names */
1648 * Append the full path to name with path separators made into percent
1649 * signs, to dir. An unnamed buffer is handled as "" (<currentdir>/"")
1652 make_percent_swname(dir
, name
)
1658 f
= fix_fname(name
!= NULL
? name
: (char_u
*) "");
1662 s
= alloc((unsigned)(STRLEN(f
) + 1));
1666 for (d
= s
; *d
!= NUL
; mb_ptr_adv(d
))
1667 if (vim_ispathsep(*d
))
1669 d
= concat_fnames(dir
, s
, TRUE
);
1678 #if (defined(UNIX) || defined(__EMX__) || defined(VMS)) && (defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG))
1679 static int process_still_running
;
1683 * Give information about an existing swap file.
1684 * Returns timestamp (0 when unknown).
1687 swapfile_info(fname
)
1693 time_t x
= (time_t)0;
1696 char_u uname
[B0_UNAME_SIZE
];
1699 /* print the swap file date */
1700 if (mch_stat((char *)fname
, &st
) != -1)
1703 /* print name of owner of the file */
1704 if (mch_get_uname(st
.st_uid
, uname
, B0_UNAME_SIZE
) == OK
)
1706 MSG_PUTS(_(" owned by: "));
1707 msg_outtrans(uname
);
1708 MSG_PUTS(_(" dated: "));
1712 MSG_PUTS(_(" dated: "));
1713 x
= st
.st_mtime
; /* Manx C can't do &st.st_mtime */
1714 p
= ctime(&x
); /* includes '\n' */
1716 MSG_PUTS("(invalid)\n");
1722 * print the original file name
1724 fd
= mch_open((char *)fname
, O_RDONLY
| O_EXTRA
, 0);
1727 if (read(fd
, (char *)&b0
, sizeof(b0
)) == sizeof(b0
))
1729 if (STRNCMP(b0
.b0_version
, "VIM 3.0", 7) == 0)
1731 MSG_PUTS(_(" [from Vim version 3.0]"));
1733 else if (b0
.b0_id
[0] != BLOCK0_ID0
|| b0
.b0_id
[1] != BLOCK0_ID1
)
1735 MSG_PUTS(_(" [does not look like a Vim swap file]"));
1739 MSG_PUTS(_(" file name: "));
1740 if (b0
.b0_fname
[0] == NUL
)
1741 MSG_PUTS(_("[No Name]"));
1743 msg_outtrans(b0
.b0_fname
);
1745 MSG_PUTS(_("\n modified: "));
1746 MSG_PUTS(b0
.b0_dirty
? _("YES") : _("no"));
1748 if (*(b0
.b0_uname
) != NUL
)
1750 MSG_PUTS(_("\n user name: "));
1751 msg_outtrans(b0
.b0_uname
);
1754 if (*(b0
.b0_hname
) != NUL
)
1756 if (*(b0
.b0_uname
) != NUL
)
1757 MSG_PUTS(_(" host name: "));
1759 MSG_PUTS(_("\n host name: "));
1760 msg_outtrans(b0
.b0_hname
);
1763 if (char_to_long(b0
.b0_pid
) != 0L)
1765 MSG_PUTS(_("\n process ID: "));
1766 msg_outnum(char_to_long(b0
.b0_pid
));
1767 #if defined(UNIX) || defined(__EMX__)
1768 /* EMX kill() not working correctly, it seems */
1769 if (kill((pid_t
)char_to_long(b0
.b0_pid
), 0) == 0)
1771 MSG_PUTS(_(" (still running)"));
1772 # if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)
1773 process_still_running
= TRUE
;
1779 if (b0_magic_wrong(&b0
))
1781 #if defined(MSDOS) || defined(MSWIN)
1782 if (STRNCMP(b0
.b0_hname
, "PC ", 3) == 0)
1783 MSG_PUTS(_("\n [not usable with this version of Vim]"));
1786 MSG_PUTS(_("\n [not usable on this computer]"));
1791 MSG_PUTS(_(" [cannot be read]"));
1795 MSG_PUTS(_(" [cannot be opened]"));
1802 recov_file_names(names
, path
, prepend_dot
)
1811 * (MS-DOS) always short names
1813 names
[0] = modname(path
, (char_u
*)".sw?", FALSE
);
1815 #else /* !SHORT_FNAME */
1817 * (Win32 and Win64) never short names, but do prepend a dot.
1818 * (Not MS-DOS or Win32 or Win64) maybe short name, maybe not: Try both.
1819 * Only use the short name if it is different.
1824 int shortname
= curbuf
->b_shortname
;
1826 curbuf
->b_shortname
= FALSE
;
1832 * May also add the file name with a dot prepended, for swap file in same
1833 * dir as original file.
1837 names
[num_names
] = modname(path
, (char_u
*)".sw?", TRUE
);
1838 if (names
[num_names
] == NULL
)
1844 * Form the normal swap file name pattern by appending ".sw?".
1847 names
[num_names
] = concat_fnames(path
, (char_u
*)"_sw%", FALSE
);
1850 names
[num_names
] = concat_fnames(path
, (char_u
*)"_sw#", FALSE
);
1852 names
[num_names
] = concat_fnames(path
, (char_u
*)".sw?", FALSE
);
1855 if (names
[num_names
] == NULL
)
1857 if (num_names
>= 1) /* check if we have the same name twice */
1859 p
= names
[num_names
- 1];
1860 i
= (int)STRLEN(names
[num_names
- 1]) - (int)STRLEN(names
[num_names
]);
1862 p
+= i
; /* file name has been expanded to full path */
1864 if (STRCMP(p
, names
[num_names
]) != 0)
1867 vim_free(names
[num_names
]);
1874 * Also try with 'shortname' set, in case the file is on a DOS filesystem.
1876 curbuf
->b_shortname
= TRUE
;
1878 names
[num_names
] = modname(path
, (char_u
*)"_sw%", FALSE
);
1881 names
[num_names
] = modname(path
, (char_u
*)"_sw#", FALSE
);
1883 names
[num_names
] = modname(path
, (char_u
*)".sw?", FALSE
);
1886 if (names
[num_names
] == NULL
)
1890 * Remove the one from 'shortname', if it's the same as with 'noshortname'.
1892 p
= names
[num_names
];
1893 i
= STRLEN(names
[num_names
]) - STRLEN(names
[num_names
- 1]);
1895 p
+= i
; /* file name has been expanded to full path */
1896 if (STRCMP(names
[num_names
- 1], p
) == 0)
1897 vim_free(names
[num_names
]);
1904 curbuf
->b_shortname
= shortname
;
1907 #endif /* !SHORT_FNAME */
1915 * If 'check_file' is TRUE, check if original file exists and was not changed.
1916 * If 'check_char' is TRUE, stop syncing when character becomes available, but
1917 * always sync at least one block.
1920 ml_sync_all(check_file
, check_char
)
1927 for (buf
= firstbuf
; buf
!= NULL
; buf
= buf
->b_next
)
1929 if (buf
->b_ml
.ml_mfp
== NULL
|| buf
->b_ml
.ml_mfp
->mf_fname
== NULL
)
1930 continue; /* no file */
1932 ml_flush_line(buf
); /* flush buffered line */
1933 /* flush locked block */
1934 (void)ml_find_line(buf
, (linenr_T
)0, ML_FLUSH
);
1935 if (bufIsChanged(buf
) && check_file
&& mf_need_trans(buf
->b_ml
.ml_mfp
)
1936 && buf
->b_ffname
!= NULL
)
1939 * If the original file does not exist anymore or has been changed
1940 * call ml_preserve() to get rid of all negative numbered blocks.
1942 if (mch_stat((char *)buf
->b_ffname
, &st
) == -1
1943 || st
.st_mtime
!= buf
->b_mtime_read
1944 || (size_t)st
.st_size
!= buf
->b_orig_size
)
1946 ml_preserve(buf
, FALSE
);
1947 did_check_timestamps
= FALSE
;
1948 need_check_timestamps
= TRUE
; /* give message later */
1951 if (buf
->b_ml
.ml_mfp
->mf_dirty
)
1953 (void)mf_sync(buf
->b_ml
.ml_mfp
, (check_char
? MFS_STOP
: 0)
1954 | (bufIsChanged(buf
) ? MFS_FLUSH
: 0));
1955 if (check_char
&& ui_char_avail()) /* character available now */
1962 * sync one buffer, including negative blocks
1964 * after this all the blocks are in the swap file
1966 * Used for the :preserve command and when the original file has been
1967 * changed or deleted.
1969 * when message is TRUE the success of preserving is reported
1972 ml_preserve(buf
, message
)
1978 memfile_T
*mfp
= buf
->b_ml
.ml_mfp
;
1980 int got_int_save
= got_int
;
1982 if (mfp
== NULL
|| mfp
->mf_fname
== NULL
)
1985 EMSG(_("E313: Cannot preserve, there is no swap file"));
1989 /* We only want to stop when interrupted here, not when interrupted
1993 ml_flush_line(buf
); /* flush buffered line */
1994 (void)ml_find_line(buf
, (linenr_T
)0, ML_FLUSH
); /* flush locked block */
1995 status
= mf_sync(mfp
, MFS_ALL
| MFS_FLUSH
);
1997 /* stack is invalid after mf_sync(.., MFS_ALL) */
1998 buf
->b_ml
.ml_stack_top
= 0;
2001 * Some of the data blocks may have been changed from negative to
2002 * positive block number. In that case the pointer blocks need to be
2005 * We don't know in which pointer block the references are, so we visit
2006 * all data blocks until there are no more translations to be done (or
2007 * we hit the end of the file, which can only happen in case a write fails,
2008 * e.g. when file system if full).
2009 * ml_find_line() does the work by translating the negative block numbers
2010 * when getting the first line of each data block.
2012 if (mf_need_trans(mfp
) && !got_int
)
2015 while (mf_need_trans(mfp
) && lnum
<= buf
->b_ml
.ml_line_count
)
2017 hp
= ml_find_line(buf
, lnum
, ML_FIND
);
2023 CHECK(buf
->b_ml
.ml_locked_low
!= lnum
, "low != lnum");
2024 lnum
= buf
->b_ml
.ml_locked_high
+ 1;
2026 (void)ml_find_line(buf
, (linenr_T
)0, ML_FLUSH
); /* flush locked block */
2027 /* sync the updated pointer blocks */
2028 if (mf_sync(mfp
, MFS_ALL
| MFS_FLUSH
) == FAIL
)
2030 buf
->b_ml
.ml_stack_top
= 0; /* stack is invalid now */
2033 got_int
|= got_int_save
;
2038 MSG(_("File preserved"));
2040 EMSG(_("E314: Preserve failed"));
2045 * NOTE: The pointer returned by the ml_get_*() functions only remains valid
2046 * until the next call!
2047 * line1 = ml_get(1);
2048 * line2 = ml_get(2); // line1 is now invalid!
2049 * Make a copy of the line if necessary.
2052 * get a pointer to a (read-only copy of a) line
2054 * On failure an error message is given and IObuff is returned (to avoid
2055 * having to check for error everywhere).
2061 return ml_get_buf(curbuf
, lnum
, FALSE
);
2065 * ml_get_pos: get pointer to position 'pos'
2071 return (ml_get_buf(curbuf
, pos
->lnum
, FALSE
) + pos
->col
);
2075 * ml_get_curline: get pointer to cursor line.
2080 return ml_get_buf(curbuf
, curwin
->w_cursor
.lnum
, FALSE
);
2084 * ml_get_cursor: get pointer to cursor position
2089 return (ml_get_buf(curbuf
, curwin
->w_cursor
.lnum
, FALSE
) +
2090 curwin
->w_cursor
.col
);
2094 * get a pointer to a line in a specific buffer
2096 * "will_change": if TRUE mark the buffer dirty (chars in the line will be
2100 ml_get_buf(buf
, lnum
, will_change
)
2103 int will_change
; /* line will be changed */
2108 static int recursive
= 0;
2110 if (lnum
> buf
->b_ml
.ml_line_count
) /* invalid line number */
2114 /* Avoid giving this message for a recursive call, may happen when
2115 * the GUI redraws part of the text. */
2117 EMSGN(_("E315: ml_get: invalid lnum: %ld"), lnum
);
2121 STRCPY(IObuff
, "???");
2124 if (lnum
<= 0) /* pretend line 0 is line 1 */
2127 if (buf
->b_ml
.ml_mfp
== NULL
) /* there are no lines */
2128 return (char_u
*)"";
2131 * See if it is the same line as requested last time.
2132 * Otherwise may need to flush last used line.
2133 * Don't use the last used line when 'swapfile' is reset, need to load all
2136 if (buf
->b_ml
.ml_line_lnum
!= lnum
|| mf_dont_release
)
2141 * Find the data block containing the line.
2142 * This also fills the stack with the blocks from the root to the data
2143 * block and releases any locked block.
2145 if ((hp
= ml_find_line(buf
, lnum
, ML_FIND
)) == NULL
)
2149 /* Avoid giving this message for a recursive call, may happen
2150 * when the GUI redraws part of the text. */
2152 EMSGN(_("E316: ml_get: cannot find line %ld"), lnum
);
2158 dp
= (DATA_BL
*)(hp
->bh_data
);
2160 ptr
= (char_u
*)dp
+ ((dp
->db_index
[lnum
- buf
->b_ml
.ml_locked_low
]) & DB_INDEX_MASK
);
2161 buf
->b_ml
.ml_line_ptr
= ptr
;
2162 buf
->b_ml
.ml_line_lnum
= lnum
;
2163 buf
->b_ml
.ml_flags
&= ~ML_LINE_DIRTY
;
2166 buf
->b_ml
.ml_flags
|= (ML_LOCKED_DIRTY
| ML_LOCKED_POS
);
2168 return buf
->b_ml
.ml_line_ptr
;
2172 * Check if a line that was just obtained by a call to ml_get
2173 * is in allocated memory.
2178 return (curbuf
->b_ml
.ml_flags
& ML_LINE_DIRTY
);
2182 * Append a line after lnum (may be 0 to insert a line in front of the file).
2183 * "line" does not need to be allocated, but can't be another line in a
2184 * buffer, unlocking may make it invalid.
2186 * newfile: TRUE when starting to edit a new file, meaning that pe_old_lnum
2187 * will be set for recovery
2188 * Check: The caller of this function should probably also call
2191 * return FAIL for failure, OK otherwise
2194 ml_append(lnum
, line
, len
, newfile
)
2195 linenr_T lnum
; /* append after this line (can be 0) */
2196 char_u
*line
; /* text of the new line */
2197 colnr_T len
; /* length of new line, including NUL, or 0 */
2198 int newfile
; /* flag, see above */
2200 /* When starting up, we might still need to create the memfile */
2201 if (curbuf
->b_ml
.ml_mfp
== NULL
&& open_buffer(FALSE
, NULL
) == FAIL
)
2204 if (curbuf
->b_ml
.ml_line_lnum
!= 0)
2205 ml_flush_line(curbuf
);
2206 return ml_append_int(curbuf
, lnum
, line
, len
, newfile
, FALSE
);
2209 #if defined(FEAT_SPELL) || defined(PROTO)
2211 * Like ml_append() but for an arbitrary buffer. The buffer must already have
2215 ml_append_buf(buf
, lnum
, line
, len
, newfile
)
2217 linenr_T lnum
; /* append after this line (can be 0) */
2218 char_u
*line
; /* text of the new line */
2219 colnr_T len
; /* length of new line, including NUL, or 0 */
2220 int newfile
; /* flag, see above */
2222 if (buf
->b_ml
.ml_mfp
== NULL
)
2225 if (buf
->b_ml
.ml_line_lnum
!= 0)
2227 return ml_append_int(buf
, lnum
, line
, len
, newfile
, FALSE
);
2232 ml_append_int(buf
, lnum
, line
, len
, newfile
, mark
)
2234 linenr_T lnum
; /* append after this line (can be 0) */
2235 char_u
*line
; /* text of the new line */
2236 colnr_T len
; /* length of line, including NUL, or 0 */
2237 int newfile
; /* flag, see above */
2238 int mark
; /* mark the new line */
2241 int line_count
; /* number of indexes in current block */
2244 int space_needed
; /* space needed for new line */
2247 int db_idx
; /* index for lnum in data block */
2254 /* lnum out of range */
2255 if (lnum
> buf
->b_ml
.ml_line_count
|| buf
->b_ml
.ml_mfp
== NULL
)
2258 if (lowest_marked
&& lowest_marked
> lnum
)
2259 lowest_marked
= lnum
+ 1;
2262 len
= (colnr_T
)STRLEN(line
) + 1; /* space needed for the text */
2263 space_needed
= len
+ INDEX_SIZE
; /* space needed for text + index */
2265 mfp
= buf
->b_ml
.ml_mfp
;
2266 page_size
= mfp
->mf_page_size
;
2269 * find the data block containing the previous line
2270 * This also fills the stack with the blocks from the root to the data block
2271 * This also releases any locked block.
2273 if ((hp
= ml_find_line(buf
, lnum
== 0 ? (linenr_T
)1 : lnum
,
2274 ML_INSERT
)) == NULL
)
2277 buf
->b_ml
.ml_flags
&= ~ML_EMPTY
;
2279 if (lnum
== 0) /* got line one instead, correct db_idx */
2280 db_idx
= -1; /* careful, it is negative! */
2282 db_idx
= lnum
- buf
->b_ml
.ml_locked_low
;
2283 /* get line count before the insertion */
2284 line_count
= buf
->b_ml
.ml_locked_high
- buf
->b_ml
.ml_locked_low
;
2286 dp
= (DATA_BL
*)(hp
->bh_data
);
2290 * - there is not enough room in the current block
2291 * - appending to the last line in the block
2292 * - not appending to the last line in the file
2293 * insert in front of the next block.
2295 if ((int)dp
->db_free
< space_needed
&& db_idx
== line_count
- 1
2296 && lnum
< buf
->b_ml
.ml_line_count
)
2299 * Now that the line is not going to be inserted in the block that we
2300 * expected, the line count has to be adjusted in the pointer blocks
2301 * by using ml_locked_lineadd.
2303 --(buf
->b_ml
.ml_locked_lineadd
);
2304 --(buf
->b_ml
.ml_locked_high
);
2305 if ((hp
= ml_find_line(buf
, lnum
+ 1, ML_INSERT
)) == NULL
)
2308 db_idx
= -1; /* careful, it is negative! */
2309 /* get line count before the insertion */
2310 line_count
= buf
->b_ml
.ml_locked_high
- buf
->b_ml
.ml_locked_low
;
2311 CHECK(buf
->b_ml
.ml_locked_low
!= lnum
+ 1, "locked_low != lnum + 1");
2313 dp
= (DATA_BL
*)(hp
->bh_data
);
2316 ++buf
->b_ml
.ml_line_count
;
2318 if ((int)dp
->db_free
>= space_needed
) /* enough room in data block */
2321 * Insert new line in existing data block, or in data block allocated above.
2323 dp
->db_txt_start
-= len
;
2324 dp
->db_free
-= space_needed
;
2325 ++(dp
->db_line_count
);
2328 * move the text of the lines that follow to the front
2329 * adjust the indexes of the lines that follow
2331 if (line_count
> db_idx
+ 1) /* if there are following lines */
2334 * Offset is the start of the previous line.
2335 * This will become the character just after the new line.
2338 offset
= dp
->db_txt_end
;
2340 offset
= ((dp
->db_index
[db_idx
]) & DB_INDEX_MASK
);
2341 mch_memmove((char *)dp
+ dp
->db_txt_start
,
2342 (char *)dp
+ dp
->db_txt_start
+ len
,
2343 (size_t)(offset
- (dp
->db_txt_start
+ len
)));
2344 for (i
= line_count
- 1; i
> db_idx
; --i
)
2345 dp
->db_index
[i
+ 1] = dp
->db_index
[i
] - len
;
2346 dp
->db_index
[db_idx
+ 1] = offset
- len
;
2348 else /* add line at the end */
2349 dp
->db_index
[db_idx
+ 1] = dp
->db_txt_start
;
2352 * copy the text into the block
2354 mch_memmove((char *)dp
+ dp
->db_index
[db_idx
+ 1], line
, (size_t)len
);
2356 dp
->db_index
[db_idx
+ 1] |= DB_MARKED
;
2359 * Mark the block dirty.
2361 buf
->b_ml
.ml_flags
|= ML_LOCKED_DIRTY
;
2363 buf
->b_ml
.ml_flags
|= ML_LOCKED_POS
;
2365 else /* not enough space in data block */
2368 * If there is not enough room we have to create a new data block and copy some
2370 * Then we have to insert an entry in the pointer block.
2371 * If this pointer block also is full, we go up another block, and so on, up
2372 * to the root if necessary.
2373 * The line counts in the pointer blocks have already been adjusted by
2376 long line_count_left
, line_count_right
;
2377 int page_count_left
, page_count_right
;
2382 int data_moved
= 0; /* init to shut up gcc */
2383 int total_moved
= 0; /* init to shut up gcc */
2384 DATA_BL
*dp_right
, *dp_left
;
2388 blocknr_T bnum_left
, bnum_right
;
2389 linenr_T lnum_left
, lnum_right
;
2394 * We are going to allocate a new data block. Depending on the
2395 * situation it will be put to the left or right of the existing
2396 * block. If possible we put the new line in the left block and move
2397 * the lines after it to the right block. Otherwise the new line is
2398 * also put in the right block. This method is more efficient when
2399 * inserting a lot of lines at one place.
2401 if (db_idx
< 0) /* left block is new, right block is existing */
2405 /* space_needed does not change */
2407 else /* left block is existing, right block is new */
2409 lines_moved
= line_count
- db_idx
- 1;
2410 if (lines_moved
== 0)
2411 in_left
= FALSE
; /* put new line in right block */
2412 /* space_needed does not change */
2415 data_moved
= ((dp
->db_index
[db_idx
]) & DB_INDEX_MASK
) -
2417 total_moved
= data_moved
+ lines_moved
* INDEX_SIZE
;
2418 if ((int)dp
->db_free
+ total_moved
>= space_needed
)
2420 in_left
= TRUE
; /* put new line in left block */
2421 space_needed
= total_moved
;
2425 in_left
= FALSE
; /* put new line in right block */
2426 space_needed
+= total_moved
;
2431 page_count
= ((space_needed
+ HEADER_SIZE
) + page_size
- 1) / page_size
;
2432 if ((hp_new
= ml_new_data(mfp
, newfile
, page_count
)) == NULL
)
2434 /* correct line counts in pointer blocks */
2435 --(buf
->b_ml
.ml_locked_lineadd
);
2436 --(buf
->b_ml
.ml_locked_high
);
2439 if (db_idx
< 0) /* left block is new */
2443 line_count_left
= 0;
2444 line_count_right
= line_count
;
2446 else /* right block is new */
2450 line_count_left
= line_count
;
2451 line_count_right
= 0;
2453 dp_right
= (DATA_BL
*)(hp_right
->bh_data
);
2454 dp_left
= (DATA_BL
*)(hp_left
->bh_data
);
2455 bnum_left
= hp_left
->bh_bnum
;
2456 bnum_right
= hp_right
->bh_bnum
;
2457 page_count_left
= hp_left
->bh_page_count
;
2458 page_count_right
= hp_right
->bh_page_count
;
2461 * May move the new line into the right/new block.
2465 dp_right
->db_txt_start
-= len
;
2466 dp_right
->db_free
-= len
+ INDEX_SIZE
;
2467 dp_right
->db_index
[0] = dp_right
->db_txt_start
;
2469 dp_right
->db_index
[0] |= DB_MARKED
;
2471 mch_memmove((char *)dp_right
+ dp_right
->db_txt_start
,
2476 * may move lines from the left/old block to the right/new one.
2482 dp_right
->db_txt_start
-= data_moved
;
2483 dp_right
->db_free
-= total_moved
;
2484 mch_memmove((char *)dp_right
+ dp_right
->db_txt_start
,
2485 (char *)dp_left
+ dp_left
->db_txt_start
,
2486 (size_t)data_moved
);
2487 offset
= dp_right
->db_txt_start
- dp_left
->db_txt_start
;
2488 dp_left
->db_txt_start
+= data_moved
;
2489 dp_left
->db_free
+= total_moved
;
2492 * update indexes in the new block
2494 for (to
= line_count_right
, from
= db_idx
+ 1;
2495 from
< line_count_left
; ++from
, ++to
)
2496 dp_right
->db_index
[to
] = dp
->db_index
[from
] + offset
;
2497 line_count_right
+= lines_moved
;
2498 line_count_left
-= lines_moved
;
2502 * May move the new line into the left (old or new) block.
2506 dp_left
->db_txt_start
-= len
;
2507 dp_left
->db_free
-= len
+ INDEX_SIZE
;
2508 dp_left
->db_index
[line_count_left
] = dp_left
->db_txt_start
;
2510 dp_left
->db_index
[line_count_left
] |= DB_MARKED
;
2511 mch_memmove((char *)dp_left
+ dp_left
->db_txt_start
,
2516 if (db_idx
< 0) /* left block is new */
2518 lnum_left
= lnum
+ 1;
2521 else /* right block is new */
2525 lnum_right
= lnum
+ 2;
2527 lnum_right
= lnum
+ 1;
2529 dp_left
->db_line_count
= line_count_left
;
2530 dp_right
->db_line_count
= line_count_right
;
2533 * release the two data blocks
2534 * The new one (hp_new) already has a correct blocknumber.
2535 * The old one (hp, in ml_locked) gets a positive blocknumber if
2536 * we changed it and we are not editing a new file.
2538 if (lines_moved
|| in_left
)
2539 buf
->b_ml
.ml_flags
|= ML_LOCKED_DIRTY
;
2540 if (!newfile
&& db_idx
>= 0 && in_left
)
2541 buf
->b_ml
.ml_flags
|= ML_LOCKED_POS
;
2542 mf_put(mfp
, hp_new
, TRUE
, FALSE
);
2545 * flush the old data block
2546 * set ml_locked_lineadd to 0, because the updating of the
2547 * pointer blocks is done below
2549 lineadd
= buf
->b_ml
.ml_locked_lineadd
;
2550 buf
->b_ml
.ml_locked_lineadd
= 0;
2551 ml_find_line(buf
, (linenr_T
)0, ML_FLUSH
); /* flush data block */
2554 * update pointer blocks for the new data block
2556 for (stack_idx
= buf
->b_ml
.ml_stack_top
- 1; stack_idx
>= 0;
2559 ip
= &(buf
->b_ml
.ml_stack
[stack_idx
]);
2560 pb_idx
= ip
->ip_index
;
2561 if ((hp
= mf_get(mfp
, ip
->ip_bnum
, 1)) == NULL
)
2563 pp
= (PTR_BL
*)(hp
->bh_data
); /* must be pointer block */
2564 if (pp
->pb_id
!= PTR_ID
)
2566 EMSG(_("E317: pointer block id wrong 3"));
2567 mf_put(mfp
, hp
, FALSE
, FALSE
);
2571 * TODO: If the pointer block is full and we are adding at the end
2572 * try to insert in front of the next block
2574 /* block not full, add one entry */
2575 if (pp
->pb_count
< pp
->pb_count_max
)
2577 if (pb_idx
+ 1 < (int)pp
->pb_count
)
2578 mch_memmove(&pp
->pb_pointer
[pb_idx
+ 2],
2579 &pp
->pb_pointer
[pb_idx
+ 1],
2580 (size_t)(pp
->pb_count
- pb_idx
- 1) * sizeof(PTR_EN
));
2582 pp
->pb_pointer
[pb_idx
].pe_line_count
= line_count_left
;
2583 pp
->pb_pointer
[pb_idx
].pe_bnum
= bnum_left
;
2584 pp
->pb_pointer
[pb_idx
].pe_page_count
= page_count_left
;
2585 pp
->pb_pointer
[pb_idx
+ 1].pe_line_count
= line_count_right
;
2586 pp
->pb_pointer
[pb_idx
+ 1].pe_bnum
= bnum_right
;
2587 pp
->pb_pointer
[pb_idx
+ 1].pe_page_count
= page_count_right
;
2590 pp
->pb_pointer
[pb_idx
].pe_old_lnum
= lnum_left
;
2591 if (lnum_right
!= 0)
2592 pp
->pb_pointer
[pb_idx
+ 1].pe_old_lnum
= lnum_right
;
2594 mf_put(mfp
, hp
, TRUE
, FALSE
);
2595 buf
->b_ml
.ml_stack_top
= stack_idx
+ 1; /* truncate stack */
2599 --(buf
->b_ml
.ml_stack_top
);
2600 /* fix line count for rest of blocks in the stack */
2601 ml_lineadd(buf
, lineadd
);
2602 /* fix stack itself */
2603 buf
->b_ml
.ml_stack
[buf
->b_ml
.ml_stack_top
].ip_high
+=
2605 ++(buf
->b_ml
.ml_stack_top
);
2609 * We are finished, break the loop here.
2613 else /* pointer block full */
2616 * split the pointer block
2617 * allocate a new pointer block
2618 * move some of the pointer into the new block
2619 * prepare for updating the parent block
2621 for (;;) /* do this twice when splitting block 1 */
2623 hp_new
= ml_new_ptr(mfp
);
2624 if (hp_new
== NULL
) /* TODO: try to fix tree */
2626 pp_new
= (PTR_BL
*)(hp_new
->bh_data
);
2628 if (hp
->bh_bnum
!= 1)
2632 * if block 1 becomes full the tree is given an extra level
2633 * The pointers from block 1 are moved into the new block.
2634 * block 1 is updated to point to the new block
2635 * then continue to split the new block
2637 mch_memmove(pp_new
, pp
, (size_t)page_size
);
2639 pp
->pb_pointer
[0].pe_bnum
= hp_new
->bh_bnum
;
2640 pp
->pb_pointer
[0].pe_line_count
= buf
->b_ml
.ml_line_count
;
2641 pp
->pb_pointer
[0].pe_old_lnum
= 1;
2642 pp
->pb_pointer
[0].pe_page_count
= 1;
2643 mf_put(mfp
, hp
, TRUE
, FALSE
); /* release block 1 */
2644 hp
= hp_new
; /* new block is to be split */
2646 CHECK(stack_idx
!= 0, _("stack_idx should be 0"));
2648 ++stack_idx
; /* do block 1 again later */
2651 * move the pointers after the current one to the new block
2652 * If there are none, the new entry will be in the new block.
2654 total_moved
= pp
->pb_count
- pb_idx
- 1;
2657 mch_memmove(&pp_new
->pb_pointer
[0],
2658 &pp
->pb_pointer
[pb_idx
+ 1],
2659 (size_t)(total_moved
) * sizeof(PTR_EN
));
2660 pp_new
->pb_count
= total_moved
;
2661 pp
->pb_count
-= total_moved
- 1;
2662 pp
->pb_pointer
[pb_idx
+ 1].pe_bnum
= bnum_right
;
2663 pp
->pb_pointer
[pb_idx
+ 1].pe_line_count
= line_count_right
;
2664 pp
->pb_pointer
[pb_idx
+ 1].pe_page_count
= page_count_right
;
2666 pp
->pb_pointer
[pb_idx
+ 1].pe_old_lnum
= lnum_right
;
2670 pp_new
->pb_count
= 1;
2671 pp_new
->pb_pointer
[0].pe_bnum
= bnum_right
;
2672 pp_new
->pb_pointer
[0].pe_line_count
= line_count_right
;
2673 pp_new
->pb_pointer
[0].pe_page_count
= page_count_right
;
2674 pp_new
->pb_pointer
[0].pe_old_lnum
= lnum_right
;
2676 pp
->pb_pointer
[pb_idx
].pe_bnum
= bnum_left
;
2677 pp
->pb_pointer
[pb_idx
].pe_line_count
= line_count_left
;
2678 pp
->pb_pointer
[pb_idx
].pe_page_count
= page_count_left
;
2680 pp
->pb_pointer
[pb_idx
].pe_old_lnum
= lnum_left
;
2685 * recompute line counts
2687 line_count_right
= 0;
2688 for (i
= 0; i
< (int)pp_new
->pb_count
; ++i
)
2689 line_count_right
+= pp_new
->pb_pointer
[i
].pe_line_count
;
2690 line_count_left
= 0;
2691 for (i
= 0; i
< (int)pp
->pb_count
; ++i
)
2692 line_count_left
+= pp
->pb_pointer
[i
].pe_line_count
;
2694 bnum_left
= hp
->bh_bnum
;
2695 bnum_right
= hp_new
->bh_bnum
;
2696 page_count_left
= 1;
2697 page_count_right
= 1;
2698 mf_put(mfp
, hp
, TRUE
, FALSE
);
2699 mf_put(mfp
, hp_new
, TRUE
, FALSE
);
2704 * Safety check: fallen out of for loop?
2708 EMSG(_("E318: Updated too many blocks?"));
2709 buf
->b_ml
.ml_stack_top
= 0; /* invalidate stack */
2714 /* The line was inserted below 'lnum' */
2715 ml_updatechunk(buf
, lnum
+ 1, (long)len
, ML_CHNK_ADDLINE
);
2717 #ifdef FEAT_NETBEANS_INTG
2720 if (STRLEN(line
) > 0)
2721 netbeans_inserted(buf
, lnum
+1, (colnr_T
)0, line
, (int)STRLEN(line
));
2722 netbeans_inserted(buf
, lnum
+1, (colnr_T
)STRLEN(line
),
2730 * Replace line lnum, with buffering, in current buffer.
2732 * If "copy" is TRUE, make a copy of the line, otherwise the line has been
2733 * copied to allocated memory already.
2735 * Check: The caller of this function should probably also call
2736 * changed_lines(), unless update_screen(NOT_VALID) is used.
2738 * return FAIL for failure, OK otherwise
2741 ml_replace(lnum
, line
, copy
)
2746 if (line
== NULL
) /* just checking... */
2749 /* When starting up, we might still need to create the memfile */
2750 if (curbuf
->b_ml
.ml_mfp
== NULL
&& open_buffer(FALSE
, NULL
) == FAIL
)
2753 if (copy
&& (line
= vim_strsave(line
)) == NULL
) /* allocate memory */
2755 #ifdef FEAT_NETBEANS_INTG
2758 netbeans_removed(curbuf
, lnum
, 0, (long)STRLEN(ml_get(lnum
)));
2759 netbeans_inserted(curbuf
, lnum
, 0, line
, (int)STRLEN(line
));
2762 if (curbuf
->b_ml
.ml_line_lnum
!= lnum
) /* other line buffered */
2763 ml_flush_line(curbuf
); /* flush it */
2764 else if (curbuf
->b_ml
.ml_flags
& ML_LINE_DIRTY
) /* same line allocated */
2765 vim_free(curbuf
->b_ml
.ml_line_ptr
); /* free it */
2766 curbuf
->b_ml
.ml_line_ptr
= line
;
2767 curbuf
->b_ml
.ml_line_lnum
= lnum
;
2768 curbuf
->b_ml
.ml_flags
= (curbuf
->b_ml
.ml_flags
| ML_LINE_DIRTY
) & ~ML_EMPTY
;
2774 * Delete line 'lnum' in the current buffer.
2776 * Check: The caller of this function should probably also call
2777 * deleted_lines() after this.
2779 * return FAIL for failure, OK otherwise
2782 ml_delete(lnum
, message
)
2786 ml_flush_line(curbuf
);
2787 return ml_delete_int(curbuf
, lnum
, message
);
2791 ml_delete_int(buf
, lnum
, message
)
2801 int count
; /* number of entries in block */
2809 if (lnum
< 1 || lnum
> buf
->b_ml
.ml_line_count
)
2812 if (lowest_marked
&& lowest_marked
> lnum
)
2816 * If the file becomes empty the last line is replaced by an empty line.
2818 if (buf
->b_ml
.ml_line_count
== 1) /* file becomes empty */
2821 #ifdef FEAT_NETBEANS_INTG
2822 && !netbeansSuppressNoLines
2825 set_keep_msg((char_u
*)_(no_lines_msg
), 0);
2827 /* FEAT_BYTEOFF already handled in there, dont worry 'bout it below */
2828 i
= ml_replace((linenr_T
)1, (char_u
*)"", TRUE
);
2829 buf
->b_ml
.ml_flags
|= ML_EMPTY
;
2835 * find the data block containing the line
2836 * This also fills the stack with the blocks from the root to the data block
2837 * This also releases any locked block.
2839 mfp
= buf
->b_ml
.ml_mfp
;
2843 if ((hp
= ml_find_line(buf
, lnum
, ML_DELETE
)) == NULL
)
2846 dp
= (DATA_BL
*)(hp
->bh_data
);
2847 /* compute line count before the delete */
2848 count
= (long)(buf
->b_ml
.ml_locked_high
)
2849 - (long)(buf
->b_ml
.ml_locked_low
) + 2;
2850 idx
= lnum
- buf
->b_ml
.ml_locked_low
;
2852 --buf
->b_ml
.ml_line_count
;
2854 line_start
= ((dp
->db_index
[idx
]) & DB_INDEX_MASK
);
2855 if (idx
== 0) /* first line in block, text at the end */
2856 line_size
= dp
->db_txt_end
- line_start
;
2858 line_size
= ((dp
->db_index
[idx
- 1]) & DB_INDEX_MASK
) - line_start
;
2860 #ifdef FEAT_NETBEANS_INTG
2862 netbeans_removed(buf
, lnum
, 0, (long)line_size
);
2866 * special case: If there is only one line in the data block it becomes empty.
2867 * Then we have to remove the entry, pointing to this data block, from the
2868 * pointer block. If this pointer block also becomes empty, we go up another
2869 * block, and so on, up to the root if necessary.
2870 * The line counts in the pointer blocks have already been adjusted by
2875 mf_free(mfp
, hp
); /* free the data block */
2876 buf
->b_ml
.ml_locked
= NULL
;
2878 for (stack_idx
= buf
->b_ml
.ml_stack_top
- 1; stack_idx
>= 0; --stack_idx
)
2880 buf
->b_ml
.ml_stack_top
= 0; /* stack is invalid when failing */
2881 ip
= &(buf
->b_ml
.ml_stack
[stack_idx
]);
2883 if ((hp
= mf_get(mfp
, ip
->ip_bnum
, 1)) == NULL
)
2885 pp
= (PTR_BL
*)(hp
->bh_data
); /* must be pointer block */
2886 if (pp
->pb_id
!= PTR_ID
)
2888 EMSG(_("E317: pointer block id wrong 4"));
2889 mf_put(mfp
, hp
, FALSE
, FALSE
);
2892 count
= --(pp
->pb_count
);
2893 if (count
== 0) /* the pointer block becomes empty! */
2897 if (count
!= idx
) /* move entries after the deleted one */
2898 mch_memmove(&pp
->pb_pointer
[idx
], &pp
->pb_pointer
[idx
+ 1],
2899 (size_t)(count
- idx
) * sizeof(PTR_EN
));
2900 mf_put(mfp
, hp
, TRUE
, FALSE
);
2902 buf
->b_ml
.ml_stack_top
= stack_idx
; /* truncate stack */
2903 /* fix line count for rest of blocks in the stack */
2904 if (buf
->b_ml
.ml_locked_lineadd
!= 0)
2906 ml_lineadd(buf
, buf
->b_ml
.ml_locked_lineadd
);
2907 buf
->b_ml
.ml_stack
[buf
->b_ml
.ml_stack_top
].ip_high
+=
2908 buf
->b_ml
.ml_locked_lineadd
;
2910 ++(buf
->b_ml
.ml_stack_top
);
2915 CHECK(stack_idx
< 0, _("deleted block 1?"));
2920 * delete the text by moving the next lines forwards
2922 text_start
= dp
->db_txt_start
;
2923 mch_memmove((char *)dp
+ text_start
+ line_size
,
2924 (char *)dp
+ text_start
, (size_t)(line_start
- text_start
));
2927 * delete the index by moving the next indexes backwards
2928 * Adjust the indexes for the text movement.
2930 for (i
= idx
; i
< count
- 1; ++i
)
2931 dp
->db_index
[i
] = dp
->db_index
[i
+ 1] + line_size
;
2933 dp
->db_free
+= line_size
+ INDEX_SIZE
;
2934 dp
->db_txt_start
+= line_size
;
2935 --(dp
->db_line_count
);
2938 * mark the block dirty and make sure it is in the file (for recovery)
2940 buf
->b_ml
.ml_flags
|= (ML_LOCKED_DIRTY
| ML_LOCKED_POS
);
2944 ml_updatechunk(buf
, lnum
, line_size
, ML_CHNK_DELLINE
);
2950 * set the B_MARKED flag for line 'lnum'
2958 /* invalid line number */
2959 if (lnum
< 1 || lnum
> curbuf
->b_ml
.ml_line_count
2960 || curbuf
->b_ml
.ml_mfp
== NULL
)
2961 return; /* give error message? */
2963 if (lowest_marked
== 0 || lowest_marked
> lnum
)
2964 lowest_marked
= lnum
;
2967 * find the data block containing the line
2968 * This also fills the stack with the blocks from the root to the data block
2969 * This also releases any locked block.
2971 if ((hp
= ml_find_line(curbuf
, lnum
, ML_FIND
)) == NULL
)
2972 return; /* give error message? */
2974 dp
= (DATA_BL
*)(hp
->bh_data
);
2975 dp
->db_index
[lnum
- curbuf
->b_ml
.ml_locked_low
] |= DB_MARKED
;
2976 curbuf
->b_ml
.ml_flags
|= ML_LOCKED_DIRTY
;
2980 * find the first line with its B_MARKED flag set
2990 if (curbuf
->b_ml
.ml_mfp
== NULL
)
2991 return (linenr_T
) 0;
2994 * The search starts with lowest_marked line. This is the last line where
2995 * a mark was found, adjusted by inserting/deleting lines.
2997 for (lnum
= lowest_marked
; lnum
<= curbuf
->b_ml
.ml_line_count
; )
3000 * Find the data block containing the line.
3001 * This also fills the stack with the blocks from the root to the data
3002 * block This also releases any locked block.
3004 if ((hp
= ml_find_line(curbuf
, lnum
, ML_FIND
)) == NULL
)
3005 return (linenr_T
)0; /* give error message? */
3007 dp
= (DATA_BL
*)(hp
->bh_data
);
3009 for (i
= lnum
- curbuf
->b_ml
.ml_locked_low
;
3010 lnum
<= curbuf
->b_ml
.ml_locked_high
; ++i
, ++lnum
)
3011 if ((dp
->db_index
[i
]) & DB_MARKED
)
3013 (dp
->db_index
[i
]) &= DB_INDEX_MASK
;
3014 curbuf
->b_ml
.ml_flags
|= ML_LOCKED_DIRTY
;
3015 lowest_marked
= lnum
+ 1;
3020 return (linenr_T
) 0;
3023 #if 0 /* not used */
3025 * return TRUE if line 'lnum' has a mark
3034 if (curbuf
->b_ml
.ml_mfp
== NULL
3035 || (hp
= ml_find_line(curbuf
, lnum
, ML_FIND
)) == NULL
)
3038 dp
= (DATA_BL
*)(hp
->bh_data
);
3039 return (int)((dp
->db_index
[lnum
- curbuf
->b_ml
.ml_locked_low
]) & DB_MARKED
);
3044 * clear all DB_MARKED flags
3054 if (curbuf
->b_ml
.ml_mfp
== NULL
) /* nothing to do */
3058 * The search starts with line lowest_marked.
3060 for (lnum
= lowest_marked
; lnum
<= curbuf
->b_ml
.ml_line_count
; )
3063 * Find the data block containing the line.
3064 * This also fills the stack with the blocks from the root to the data
3065 * block and releases any locked block.
3067 if ((hp
= ml_find_line(curbuf
, lnum
, ML_FIND
)) == NULL
)
3068 return; /* give error message? */
3070 dp
= (DATA_BL
*)(hp
->bh_data
);
3072 for (i
= lnum
- curbuf
->b_ml
.ml_locked_low
;
3073 lnum
<= curbuf
->b_ml
.ml_locked_high
; ++i
, ++lnum
)
3074 if ((dp
->db_index
[i
]) & DB_MARKED
)
3076 (dp
->db_index
[i
]) &= DB_INDEX_MASK
;
3077 curbuf
->b_ml
.ml_flags
|= ML_LOCKED_DIRTY
;
3086 * flush ml_line if necessary
3104 static int entered
= FALSE
;
3106 if (buf
->b_ml
.ml_line_lnum
== 0 || buf
->b_ml
.ml_mfp
== NULL
)
3107 return; /* nothing to do */
3109 if (buf
->b_ml
.ml_flags
& ML_LINE_DIRTY
)
3111 /* This code doesn't work recursively, but Netbeans may call back here
3112 * when obtaining the cursor position. */
3117 lnum
= buf
->b_ml
.ml_line_lnum
;
3118 new_line
= buf
->b_ml
.ml_line_ptr
;
3120 hp
= ml_find_line(buf
, lnum
, ML_FIND
);
3122 EMSGN(_("E320: Cannot find line %ld"), lnum
);
3125 dp
= (DATA_BL
*)(hp
->bh_data
);
3126 idx
= lnum
- buf
->b_ml
.ml_locked_low
;
3127 start
= ((dp
->db_index
[idx
]) & DB_INDEX_MASK
);
3128 old_line
= (char_u
*)dp
+ start
;
3129 if (idx
== 0) /* line is last in block */
3130 old_len
= dp
->db_txt_end
- start
;
3131 else /* text of previous line follows */
3132 old_len
= (dp
->db_index
[idx
- 1] & DB_INDEX_MASK
) - start
;
3133 new_len
= (colnr_T
)STRLEN(new_line
) + 1;
3134 extra
= new_len
- old_len
; /* negative if lines gets smaller */
3137 * if new line fits in data block, replace directly
3139 if ((int)dp
->db_free
>= extra
)
3141 /* if the length changes and there are following lines */
3142 count
= buf
->b_ml
.ml_locked_high
- buf
->b_ml
.ml_locked_low
+ 1;
3143 if (extra
!= 0 && idx
< count
- 1)
3145 /* move text of following lines */
3146 mch_memmove((char *)dp
+ dp
->db_txt_start
- extra
,
3147 (char *)dp
+ dp
->db_txt_start
,
3148 (size_t)(start
- dp
->db_txt_start
));
3150 /* adjust pointers of this and following lines */
3151 for (i
= idx
+ 1; i
< count
; ++i
)
3152 dp
->db_index
[i
] -= extra
;
3154 dp
->db_index
[idx
] -= extra
;
3156 /* adjust free space */
3157 dp
->db_free
-= extra
;
3158 dp
->db_txt_start
-= extra
;
3160 /* copy new line into the data block */
3161 mch_memmove(old_line
- extra
, new_line
, (size_t)new_len
);
3162 buf
->b_ml
.ml_flags
|= (ML_LOCKED_DIRTY
| ML_LOCKED_POS
);
3164 /* The else case is already covered by the insert and delete */
3165 ml_updatechunk(buf
, lnum
, (long)extra
, ML_CHNK_UPDLINE
);
3171 * Cannot do it in one data block: Delete and append.
3172 * Append first, because ml_delete_int() cannot delete the
3173 * last line in a buffer, which causes trouble for a buffer
3174 * that has only one line.
3175 * Don't forget to copy the mark!
3177 /* How about handling errors??? */
3178 (void)ml_append_int(buf
, lnum
, new_line
, new_len
, FALSE
,
3179 (dp
->db_index
[idx
] & DB_MARKED
));
3180 (void)ml_delete_int(buf
, lnum
, FALSE
);
3188 buf
->b_ml
.ml_line_lnum
= 0;
3192 * create a new, empty, data block
3195 ml_new_data(mfp
, negative
, page_count
)
3203 if ((hp
= mf_new(mfp
, negative
, page_count
)) == NULL
)
3206 dp
= (DATA_BL
*)(hp
->bh_data
);
3207 dp
->db_id
= DATA_ID
;
3208 dp
->db_txt_start
= dp
->db_txt_end
= page_count
* mfp
->mf_page_size
;
3209 dp
->db_free
= dp
->db_txt_start
- HEADER_SIZE
;
3210 dp
->db_line_count
= 0;
3216 * create a new, empty, pointer block
3225 if ((hp
= mf_new(mfp
, FALSE
, 1)) == NULL
)
3228 pp
= (PTR_BL
*)(hp
->bh_data
);
3231 pp
->pb_count_max
= (short_u
)((mfp
->mf_page_size
- sizeof(PTR_BL
)) / sizeof(PTR_EN
) + 1);
3237 * lookup line 'lnum' in a memline
3239 * action: if ML_DELETE or ML_INSERT the line count is updated while searching
3240 * if ML_FLUSH only flush a locked block
3241 * if ML_FIND just find the line
3243 * If the block was found it is locked and put in ml_locked.
3244 * The stack is updated to lead to the locked block. The ip_high field in
3245 * the stack is updated to reflect the last line in the block AFTER the
3246 * insert or delete, also if the pointer block has not been updated yet. But
3247 * if ml_locked != NULL ml_locked_lineadd must be added to ip_high.
3249 * return: NULL for failure, pointer to block header otherwise
3252 ml_find_line(buf
, lnum
, action
)
3263 blocknr_T bnum
, bnum2
;
3270 mfp
= buf
->b_ml
.ml_mfp
;
3273 * If there is a locked block check if the wanted line is in it.
3274 * If not, flush and release the locked block.
3275 * Don't do this for ML_INSERT_SAME, because the stack need to be updated.
3276 * Don't do this for ML_FLUSH, because we want to flush the locked block.
3277 * Don't do this when 'swapfile' is reset, we want to load all the blocks.
3279 if (buf
->b_ml
.ml_locked
)
3281 if (ML_SIMPLE(action
)
3282 && buf
->b_ml
.ml_locked_low
<= lnum
3283 && buf
->b_ml
.ml_locked_high
>= lnum
3284 && !mf_dont_release
)
3286 /* remember to update pointer blocks and stack later */
3287 if (action
== ML_INSERT
)
3289 ++(buf
->b_ml
.ml_locked_lineadd
);
3290 ++(buf
->b_ml
.ml_locked_high
);
3292 else if (action
== ML_DELETE
)
3294 --(buf
->b_ml
.ml_locked_lineadd
);
3295 --(buf
->b_ml
.ml_locked_high
);
3297 return (buf
->b_ml
.ml_locked
);
3300 mf_put(mfp
, buf
->b_ml
.ml_locked
, buf
->b_ml
.ml_flags
& ML_LOCKED_DIRTY
,
3301 buf
->b_ml
.ml_flags
& ML_LOCKED_POS
);
3302 buf
->b_ml
.ml_locked
= NULL
;
3305 * If lines have been added or deleted in the locked block, need to
3306 * update the line count in pointer blocks.
3308 if (buf
->b_ml
.ml_locked_lineadd
!= 0)
3309 ml_lineadd(buf
, buf
->b_ml
.ml_locked_lineadd
);
3312 if (action
== ML_FLUSH
) /* nothing else to do */
3315 bnum
= 1; /* start at the root of the tree */
3318 high
= buf
->b_ml
.ml_line_count
;
3320 if (action
== ML_FIND
) /* first try stack entries */
3322 for (top
= buf
->b_ml
.ml_stack_top
- 1; top
>= 0; --top
)
3324 ip
= &(buf
->b_ml
.ml_stack
[top
]);
3325 if (ip
->ip_low
<= lnum
&& ip
->ip_high
>= lnum
)
3330 buf
->b_ml
.ml_stack_top
= top
; /* truncate stack at prev entry */
3335 buf
->b_ml
.ml_stack_top
= 0; /* not found, start at the root */
3337 else /* ML_DELETE or ML_INSERT */
3338 buf
->b_ml
.ml_stack_top
= 0; /* start at the root */
3341 * search downwards in the tree until a data block is found
3345 if ((hp
= mf_get(mfp
, bnum
, page_count
)) == NULL
)
3349 * update high for insert/delete
3351 if (action
== ML_INSERT
)
3353 else if (action
== ML_DELETE
)
3356 dp
= (DATA_BL
*)(hp
->bh_data
);
3357 if (dp
->db_id
== DATA_ID
) /* data block */
3359 buf
->b_ml
.ml_locked
= hp
;
3360 buf
->b_ml
.ml_locked_low
= low
;
3361 buf
->b_ml
.ml_locked_high
= high
;
3362 buf
->b_ml
.ml_locked_lineadd
= 0;
3363 buf
->b_ml
.ml_flags
&= ~(ML_LOCKED_DIRTY
| ML_LOCKED_POS
);
3367 pp
= (PTR_BL
*)(dp
); /* must be pointer block */
3368 if (pp
->pb_id
!= PTR_ID
)
3370 EMSG(_("E317: pointer block id wrong"));
3374 if ((top
= ml_add_stack(buf
)) < 0) /* add new entry to stack */
3376 ip
= &(buf
->b_ml
.ml_stack
[top
]);
3380 ip
->ip_index
= -1; /* index not known yet */
3383 for (idx
= 0; idx
< (int)pp
->pb_count
; ++idx
)
3385 t
= pp
->pb_pointer
[idx
].pe_line_count
;
3386 CHECK(t
== 0, _("pe_line_count is zero"));
3387 if ((low
+= t
) > lnum
)
3390 bnum
= pp
->pb_pointer
[idx
].pe_bnum
;
3391 page_count
= pp
->pb_pointer
[idx
].pe_page_count
;
3396 * a negative block number may have been changed
3400 bnum2
= mf_trans_del(mfp
, bnum
);
3404 pp
->pb_pointer
[idx
].pe_bnum
= bnum
;
3412 if (idx
>= (int)pp
->pb_count
) /* past the end: something wrong! */
3414 if (lnum
> buf
->b_ml
.ml_line_count
)
3415 EMSGN(_("E322: line number out of range: %ld past the end"),
3416 lnum
- buf
->b_ml
.ml_line_count
);
3419 EMSGN(_("E323: line count wrong in block %ld"), bnum
);
3422 if (action
== ML_DELETE
)
3424 pp
->pb_pointer
[idx
].pe_line_count
--;
3427 else if (action
== ML_INSERT
)
3429 pp
->pb_pointer
[idx
].pe_line_count
++;
3432 mf_put(mfp
, hp
, dirty
, FALSE
);
3436 mf_put(mfp
, hp
, FALSE
, FALSE
);
3439 * If action is ML_DELETE or ML_INSERT we have to correct the tree for
3440 * the incremented/decremented line counts, because there won't be a line
3441 * inserted/deleted after all.
3443 if (action
== ML_DELETE
)
3445 else if (action
== ML_INSERT
)
3446 ml_lineadd(buf
, -1);
3447 buf
->b_ml
.ml_stack_top
= 0;
3452 * add an entry to the info pointer stack
3454 * return -1 for failure, number of the new entry otherwise
3461 infoptr_T
*newstack
;
3463 top
= buf
->b_ml
.ml_stack_top
;
3465 /* may have to increase the stack size */
3466 if (top
== buf
->b_ml
.ml_stack_size
)
3468 CHECK(top
> 0, _("Stack size increases")); /* more than 5 levels??? */
3470 newstack
= (infoptr_T
*)alloc((unsigned)sizeof(infoptr_T
) *
3471 (buf
->b_ml
.ml_stack_size
+ STACK_INCR
));
3472 if (newstack
== NULL
)
3474 mch_memmove(newstack
, buf
->b_ml
.ml_stack
,
3475 (size_t)top
* sizeof(infoptr_T
));
3476 vim_free(buf
->b_ml
.ml_stack
);
3477 buf
->b_ml
.ml_stack
= newstack
;
3478 buf
->b_ml
.ml_stack_size
+= STACK_INCR
;
3481 buf
->b_ml
.ml_stack_top
++;
3486 * Update the pointer blocks on the stack for inserted/deleted lines.
3487 * The stack itself is also updated.
3489 * When a insert/delete line action fails, the line is not inserted/deleted,
3490 * but the pointer blocks have already been updated. That is fixed here by
3491 * walking through the stack.
3493 * Count is the number of lines added, negative if lines have been deleted.
3496 ml_lineadd(buf
, count
)
3503 memfile_T
*mfp
= buf
->b_ml
.ml_mfp
;
3506 for (idx
= buf
->b_ml
.ml_stack_top
- 1; idx
>= 0; --idx
)
3508 ip
= &(buf
->b_ml
.ml_stack
[idx
]);
3509 if ((hp
= mf_get(mfp
, ip
->ip_bnum
, 1)) == NULL
)
3511 pp
= (PTR_BL
*)(hp
->bh_data
); /* must be pointer block */
3512 if (pp
->pb_id
!= PTR_ID
)
3514 mf_put(mfp
, hp
, FALSE
, FALSE
);
3515 EMSG(_("E317: pointer block id wrong 2"));
3518 pp
->pb_pointer
[ip
->ip_index
].pe_line_count
+= count
;
3519 ip
->ip_high
+= count
;
3520 mf_put(mfp
, hp
, TRUE
, FALSE
);
3524 #ifdef HAVE_READLINK
3526 * Resolve a symlink in the last component of a file name.
3527 * Note that f_resolve() does it for every part of the path, we don't do that
3529 * If it worked returns OK and the resolved link in "buf[MAXPATHL]".
3530 * Otherwise returns FAIL.
3533 resolve_symlink(fname
, buf
)
3537 char_u tmp
[MAXPATHL
];
3544 /* Put the result so far in tmp[], starting with the original name. */
3545 vim_strncpy(tmp
, fname
, MAXPATHL
- 1);
3549 /* Limit symlink depth to 100, catch recursive loops. */
3552 EMSG2(_("E773: Symlink loop for \"%s\""), fname
);
3556 ret
= readlink((char *)tmp
, (char *)buf
, MAXPATHL
- 1);
3559 if (errno
== EINVAL
|| errno
== ENOENT
)
3561 /* Found non-symlink or not existing file, stop here.
3562 * When at the first level use the unmodified name, skip the
3563 * call to vim_FullName(). */
3567 /* Use the resolved name in tmp[]. */
3571 /* There must be some error reading links, use original name. */
3577 * Check whether the symlink is relative or absolute.
3578 * If it's relative, build a new path based on the directory
3579 * portion of the filename (if any) and the path the symlink
3582 if (mch_isFullName(buf
))
3588 tail
= gettail(tmp
);
3589 if (STRLEN(tail
) + STRLEN(buf
) >= MAXPATHL
)
3596 * Try to resolve the full name of the file so that the swapfile name will
3597 * be consistent even when opening a relative symlink from different
3598 * working directories.
3600 return vim_FullName(tmp
, buf
, MAXPATHL
, TRUE
);
3605 * Make swap file name out of the file name and a directory name.
3606 * Returns pointer to allocated memory or NULL.
3609 makeswapname(fname
, ffname
, buf
, dir_name
)
3611 char_u
*ffname UNUSED
;
3616 char_u
*fname_res
= fname
;
3617 #ifdef HAVE_READLINK
3618 char_u fname_buf
[MAXPATHL
];
3621 #if defined(UNIX) || defined(WIN3264) /* Need _very_ long file names */
3622 s
= dir_name
+ STRLEN(dir_name
);
3623 if (after_pathsep(dir_name
, s
) && s
[-1] == s
[-2])
3624 { /* Ends with '//', Use Full path */
3626 if ((s
= make_percent_swname(dir_name
, fname
)) != NULL
)
3628 r
= modname(s
, (char_u
*)".swp", FALSE
);
3635 #ifdef HAVE_READLINK
3636 /* Expand symlink in the file name, so that we put the swap file with the
3637 * actual file instead of with the symlink. */
3638 if (resolve_symlink(fname
, fname_buf
) == OK
)
3639 fname_res
= fname_buf
;
3646 (buf
->b_p_sn
|| buf
->b_shortname
),
3649 /* Avoid problems if fname has special chars, eg <Wimp$Scrap> */
3655 #if defined(VMS) || defined(RISCOS)
3660 #ifdef SHORT_FNAME /* always 8.3 file name */
3663 /* Prepend a '.' to the swap file name for the current directory. */
3664 dir_name
[0] == '.' && dir_name
[1] == NUL
3667 if (r
== NULL
) /* out of memory */
3670 s
= get_file_in_dir(r
, dir_name
);
3676 * Get file name to use for swap file or backup file.
3677 * Use the name of the edited file "fname" and an entry in the 'dir' or 'bdir'
3679 * - If "dname" is ".", return "fname" (swap file in dir of file).
3680 * - If "dname" starts with "./", insert "dname" in "fname" (swap file
3681 * relative to dir of file).
3682 * - Otherwise, prepend "dname" to the tail of "fname" (swap file in specific
3685 * The return value is an allocated string and can be NULL.
3688 get_file_in_dir(fname
, dname
)
3690 char_u
*dname
; /* don't use "dirname", it is a global for Alpha */
3697 tail
= gettail(fname
);
3699 if (dname
[0] == '.' && dname
[1] == NUL
)
3700 retval
= vim_strsave(fname
);
3701 else if (dname
[0] == '.' && vim_ispathsep(dname
[1]))
3703 if (tail
== fname
) /* no path before file name */
3704 retval
= concat_fnames(dname
+ 2, tail
, TRUE
);
3709 t
= concat_fnames(fname
, dname
+ 2, TRUE
);
3711 if (t
== NULL
) /* out of memory */
3715 retval
= concat_fnames(t
, tail
, TRUE
);
3721 retval
= concat_fnames(dname
, tail
, TRUE
);
3726 static void attention_message
__ARGS((buf_T
*buf
, char_u
*fname
));
3729 * Print the ATTENTION message: info about an existing swap file.
3732 attention_message(buf
, fname
)
3733 buf_T
*buf
; /* buffer being edited */
3734 char_u
*fname
; /* swap file name */
3741 (void)EMSG(_("E325: ATTENTION"));
3742 MSG_PUTS(_("\nFound a swap file by the name \""));
3743 msg_home_replace(fname
);
3745 sx
= swapfile_info(fname
);
3746 MSG_PUTS(_("While opening file \""));
3747 msg_outtrans(buf
->b_fname
);
3749 if (mch_stat((char *)buf
->b_fname
, &st
) != -1)
3751 MSG_PUTS(_(" dated: "));
3752 x
= st
.st_mtime
; /* Manx C can't do &st.st_mtime */
3753 p
= ctime(&x
); /* includes '\n' */
3755 MSG_PUTS("(invalid)\n");
3758 if (sx
!= 0 && x
> sx
)
3759 MSG_PUTS(_(" NEWER than swap file!\n"));
3761 /* Some of these messages are long to allow translation to
3762 * other languages. */
3763 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"));
3764 MSG_PUTS(_(" Quit, or continue with caution.\n"));
3765 MSG_PUTS(_("\n(2) An edit session for this file crashed.\n"));
3766 MSG_PUTS(_(" If this is the case, use \":recover\" or \"vim -r "));
3767 msg_outtrans(buf
->b_fname
);
3768 MSG_PUTS(_("\"\n to recover the changes (see \":help recovery\").\n"));
3769 MSG_PUTS(_(" If you did this already, delete the swap file \""));
3770 msg_outtrans(fname
);
3771 MSG_PUTS(_("\"\n to avoid this message.\n"));
3772 cmdline_row
= msg_row
;
3777 static int do_swapexists
__ARGS((buf_T
*buf
, char_u
*fname
));
3780 * Trigger the SwapExists autocommands.
3781 * Returns a value for equivalent to do_dialog() (see below):
3782 * 0: still need to ask for a choice
3791 do_swapexists(buf
, fname
)
3795 set_vim_var_string(VV_SWAPNAME
, fname
, -1);
3796 set_vim_var_string(VV_SWAPCHOICE
, NULL
, -1);
3798 /* Trigger SwapExists autocommands with <afile> set to the file being
3799 * edited. Disallow changing directory here. */
3801 apply_autocmds(EVENT_SWAPEXISTS
, buf
->b_fname
, NULL
, FALSE
, NULL
);
3804 set_vim_var_string(VV_SWAPNAME
, NULL
, -1);
3806 switch (*get_vim_var_str(VV_SWAPCHOICE
))
3821 * Find out what name to use for the swap file for buffer 'buf'.
3823 * Several names are tried to find one that does not exist
3824 * Returns the name in allocated memory or NULL.
3826 * Note: If BASENAMELEN is not correct, you will get error messages for
3827 * not being able to open the swapfile
3828 * Note: May trigger SwapExists autocmd, pointers may change!
3831 findswapname(buf
, dirp
, old_fname
)
3833 char_u
**dirp
; /* pointer to list of directories */
3834 char_u
*old_fname
; /* don't give warning for this file name */
3846 #if !defined(SHORT_FNAME) \
3847 && ((!defined(UNIX) && !defined(OS2)) || defined(ARCHIE))
3848 # define CREATE_DUMMY_FILE
3849 FILE *dummyfd
= NULL
;
3852 * If we start editing a new file, e.g. "test.doc", which resides on an MSDOS
3853 * compatible filesystem, it is possible that the file "test.doc.swp" which we
3854 * create will be exactly the same file. To avoid this problem we temporarily
3855 * create "test.doc".
3856 * Don't do this when the check below for a 8.3 file name is used.
3858 if (!(buf
->b_p_sn
|| buf
->b_shortname
) && buf
->b_fname
!= NULL
3859 && mch_getperm(buf
->b_fname
) < 0)
3860 dummyfd
= mch_fopen((char *)buf
->b_fname
, "w");
3864 * Isolate a directory name from *dirp and put it in dir_name.
3865 * First allocate some memory to put the directory name in.
3867 dir_name
= alloc((unsigned)STRLEN(*dirp
) + 1);
3868 if (dir_name
!= NULL
)
3869 (void)copy_option_part(dirp
, dir_name
, 31000, ",");
3872 * we try different names until we find one that does not exist yet
3874 if (dir_name
== NULL
) /* out of memory */
3877 fname
= makeswapname(buf
->b_fname
, buf
->b_ffname
, buf
, dir_name
);
3881 if (fname
== NULL
) /* must be out of memory */
3883 if ((n
= (int)STRLEN(fname
)) == 0) /* safety check */
3889 #if (defined(UNIX) || defined(OS2)) && !defined(ARCHIE) && !defined(SHORT_FNAME)
3891 * Some systems have a MS-DOS compatible filesystem that use 8.3 character
3892 * file names. If this is the first try and the swap file name does not fit in
3893 * 8.3, detect if this is the case, set shortname and try again.
3895 if (fname
[n
- 2] == 'w' && fname
[n
- 1] == 'p'
3896 && !(buf
->b_p_sn
|| buf
->b_shortname
))
3902 int created1
= FALSE
, created2
= FALSE
;
3906 * Check if swapfile name does not fit in 8.3:
3907 * It either contains two dots, is longer than 8 chars, or starts
3910 tail
= gettail(buf
->b_fname
);
3911 if ( vim_strchr(tail
, '.') != NULL
3912 || STRLEN(tail
) > (size_t)8
3913 || *gettail(fname
) == '.')
3915 fname2
= alloc(n
+ 2);
3918 STRCPY(fname2
, fname
);
3919 /* if fname == "xx.xx.swp", fname2 = "xx.xx.swx"
3920 * if fname == ".xx.swp", fname2 = ".xx.swpx"
3921 * if fname == "123456789.swp", fname2 = "12345678x.swp"
3923 if (vim_strchr(tail
, '.') != NULL
)
3924 fname2
[n
- 1] = 'x';
3925 else if (*gettail(fname
) == '.')
3928 fname2
[n
+ 1] = NUL
;
3933 * may need to create the files to be able to use mch_stat()
3935 f1
= mch_open((char *)fname
, O_RDONLY
| O_EXTRA
, 0);
3938 f1
= mch_open_rw((char *)fname
,
3939 O_RDWR
|O_CREAT
|O_EXCL
|O_EXTRA
);
3941 if (f1
< 0 && errno
== ENOENT
)
3948 f2
= mch_open((char *)fname2
, O_RDONLY
| O_EXTRA
, 0);
3951 f2
= mch_open_rw((char *)fname2
,
3952 O_RDWR
|O_CREAT
|O_EXCL
|O_EXTRA
);
3958 * Both files exist now. If mch_stat() returns the
3959 * same device and inode they are the same file.
3961 if (mch_fstat(f1
, &s1
) != -1
3962 && mch_fstat(f2
, &s2
) != -1
3963 && s1
.st_dev
== s2
.st_dev
3964 && s1
.st_ino
== s2
.st_ino
)
3977 buf
->b_shortname
= TRUE
;
3979 fname
= makeswapname(buf
->b_fname
, buf
->b_ffname
,
3981 continue; /* try again with b_shortname set */
3988 * check if the swapfile already exists
3990 if (mch_getperm(fname
) < 0) /* it does not exist */
3996 * Extra security check: When a swap file is a symbolic link, this
3997 * is most likely a symlink attack.
3999 if (mch_lstat((char *)fname
, &sb
) < 0)
4002 fh
= Open((UBYTE
*)fname
, (long)MODE_NEWFILE
);
4004 * on the Amiga mch_getperm() will return -1 when the file exists
4005 * but is being used by another program. This happens if you edit
4008 if (fh
!= (BPTR
)NULL
) /* can open file, OK */
4014 if (IoErr() != ERROR_OBJECT_IN_USE
4015 && IoErr() != ERROR_OBJECT_EXISTS
)
4022 * A file name equal to old_fname is OK to use.
4024 if (old_fname
!= NULL
&& fnamecmp(fname
, old_fname
) == 0)
4028 * get here when file already exists
4030 if (fname
[n
- 2] == 'w' && fname
[n
- 1] == 'p') /* first try */
4034 * on MS-DOS compatible filesystems (e.g. messydos) file.doc.swp
4035 * and file.doc are the same file. To guess if this problem is
4036 * present try if file.doc.swx exists. If it does, we set
4037 * buf->b_shortname and try file_doc.swp (dots replaced by
4038 * underscores for this file), and try again. If it doesn't we
4039 * assume that "file.doc.swp" already exists.
4041 if (!(buf
->b_p_sn
|| buf
->b_shortname
)) /* not tried yet */
4044 r
= mch_getperm(fname
); /* try "file.swx" */
4046 if (r
>= 0) /* "file.swx" seems to exist */
4048 buf
->b_shortname
= TRUE
;
4050 fname
= makeswapname(buf
->b_fname
, buf
->b_ffname
,
4052 continue; /* try again with '.' replaced with '_' */
4057 * If we get here the ".swp" file really exists.
4058 * Give an error message, unless recovering, no file name, we are
4059 * viewing a help file or when the path of the file is different
4060 * (happens when all .swp files are in one directory).
4062 if (!recoverymode
&& buf
->b_fname
!= NULL
4063 && !buf
->b_help
&& !(buf
->b_flags
& BF_DUMMY
))
4070 * Try to read block 0 from the swap file to get the original
4071 * file name (and inode number).
4073 fd
= mch_open((char *)fname
, O_RDONLY
| O_EXTRA
, 0);
4076 if (read(fd
, (char *)&b0
, sizeof(b0
)) == sizeof(b0
))
4079 * If the swapfile has the same directory as the
4080 * buffer don't compare the directory names, they can
4081 * have a different mountpoint.
4083 if (b0
.b0_flags
& B0_SAME_DIR
)
4085 if (fnamecmp(gettail(buf
->b_ffname
),
4086 gettail(b0
.b0_fname
)) != 0
4087 || !same_directory(fname
, buf
->b_ffname
))
4090 /* Symlinks may point to the same file even
4091 * when the name differs, need to check the
4093 expand_env(b0
.b0_fname
, NameBuff
, MAXPATHL
);
4094 if (fnamecmp_ino(buf
->b_ffname
, NameBuff
,
4095 char_to_long(b0
.b0_ino
)))
4103 * The name in the swap file may be
4104 * "~user/path/file". Expand it first.
4106 expand_env(b0
.b0_fname
, NameBuff
, MAXPATHL
);
4108 if (fnamecmp_ino(buf
->b_ffname
, NameBuff
,
4109 char_to_long(b0
.b0_ino
)))
4112 if (fnamecmp(NameBuff
, buf
->b_ffname
) != 0)
4121 /* Can't open swap file, though it does exist.
4122 * Assume that the user is editing two files with
4123 * the same name in different directories. No error.
4128 /* give the ATTENTION message when there is an old swap file
4129 * for the current file, and the buffer was not recovered. */
4130 if (differ
== FALSE
&& !(curbuf
->b_flags
& BF_RECOVERED
)
4131 && vim_strchr(p_shm
, SHM_ATTENTION
) == NULL
)
4133 #if defined(HAS_SWAP_EXISTS_ACTION)
4136 #ifdef CREATE_DUMMY_FILE
4137 int did_use_dummy
= FALSE
;
4139 /* Avoid getting a warning for the file being created
4140 * outside of Vim, it was created at the start of this
4141 * function. Delete the file now, because Vim might exit
4142 * here if the window is closed. */
4143 if (dummyfd
!= NULL
)
4147 mch_remove(buf
->b_fname
);
4148 did_use_dummy
= TRUE
;
4152 #if (defined(UNIX) || defined(__EMX__) || defined(VMS)) && (defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG))
4153 process_still_running
= FALSE
;
4157 * If there is an SwapExists autocommand and we can handle
4158 * the response, trigger it. It may return 0 to ask the
4161 if (swap_exists_action
!= SEA_NONE
4162 && has_autocmd(EVENT_SWAPEXISTS
, buf
->b_fname
, buf
))
4163 choice
= do_swapexists(buf
, fname
);
4169 /* If we are supposed to start the GUI but it wasn't
4170 * completely started yet, start it now. This makes
4171 * the messages displayed in the Vim window when
4172 * loading a session from the .gvimrc file. */
4173 if (gui
.starting
&& !gui
.in_use
)
4176 /* Show info about the existing swap file. */
4177 attention_message(buf
, fname
);
4179 /* We don't want a 'q' typed at the more-prompt
4180 * interrupt loading a file. */
4184 #if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)
4185 if (swap_exists_action
!= SEA_NONE
&& choice
== 0)
4189 name
= alloc((unsigned)(STRLEN(fname
)
4190 + STRLEN(_("Swap file \""))
4191 + STRLEN(_("\" already exists!")) + 5));
4194 STRCPY(name
, _("Swap file \""));
4195 home_replace(NULL
, fname
, name
+ STRLEN(name
),
4197 STRCAT(name
, _("\" already exists!"));
4199 choice
= do_dialog(VIM_WARNING
,
4200 (char_u
*)_("VIM - ATTENTION"),
4202 ? (char_u
*)_("Swap file already exists!")
4204 # if defined(UNIX) || defined(__EMX__) || defined(VMS)
4205 process_still_running
4206 ? (char_u
*)_("&Open Read-Only\n&Edit anyway\n&Recover\n&Quit\n&Abort") :
4208 (char_u
*)_("&Open Read-Only\n&Edit anyway\n&Recover\n&Delete it\n&Quit\n&Abort"), 1, NULL
);
4210 # if defined(UNIX) || defined(__EMX__) || defined(VMS)
4211 if (process_still_running
&& choice
>= 4)
4212 choice
++; /* Skip missing "Delete it" button */
4216 /* pretend screen didn't scroll, need redraw anyway */
4218 redraw_all_later(NOT_VALID
);
4222 #if defined(HAS_SWAP_EXISTS_ACTION)
4233 swap_exists_action
= SEA_RECOVER
;
4239 swap_exists_action
= SEA_QUIT
;
4242 swap_exists_action
= SEA_QUIT
;
4247 /* If the file was deleted this fname can be used. */
4248 if (mch_getperm(fname
) < 0)
4255 if (msg_silent
== 0)
4256 /* call wait_return() later */
4257 need_wait_return
= TRUE
;
4260 #ifdef CREATE_DUMMY_FILE
4261 /* Going to try another name, need the dummy file again. */
4263 dummyfd
= mch_fopen((char *)buf
->b_fname
, "w");
4270 * Change the ".swp" extension to find another file that can be used.
4271 * First decrement the last char: ".swo", ".swn", etc.
4272 * If that still isn't enough decrement the last but one char: ".svz"
4273 * Can happen when editing many "No Name" buffers.
4275 if (fname
[n
- 1] == 'a') /* ".s?a" */
4277 if (fname
[n
- 2] == 'a') /* ".saa": tried enough, give up */
4279 EMSG(_("E326: Too many swap files found"));
4284 --fname
[n
- 2]; /* ".svz", ".suz", etc. */
4285 fname
[n
- 1] = 'z' + 1;
4287 --fname
[n
- 1]; /* ".swo", ".swn", etc. */
4291 #ifdef CREATE_DUMMY_FILE
4292 if (dummyfd
!= NULL
) /* file has been created temporarily */
4295 mch_remove(buf
->b_fname
);
4305 return (b0p
->b0_magic_long
!= (long)B0_MAGIC_LONG
4306 || b0p
->b0_magic_int
!= (int)B0_MAGIC_INT
4307 || b0p
->b0_magic_short
!= (short)B0_MAGIC_SHORT
4308 || b0p
->b0_magic_char
!= B0_MAGIC_CHAR
);
4313 * Compare current file name with file name from swap file.
4314 * Try to use inode numbers when possible.
4315 * Return non-zero when files are different.
4317 * When comparing file names a few things have to be taken into consideration:
4318 * - When working over a network the full path of a file depends on the host.
4319 * We check the inode number if possible. It is not 100% reliable though,
4320 * because the device number cannot be used over a network.
4321 * - When a file does not exist yet (editing a new file) there is no inode
4323 * - The file name in a swap file may not be valid on the current host. The
4324 * "~user" form is used whenever possible to avoid this.
4326 * This is getting complicated, let's make a table:
4328 * ino_c ino_s fname_c fname_s differ =
4330 * both files exist -> compare inode numbers:
4331 * != 0 != 0 X X ino_c != ino_s
4333 * inode number(s) unknown, file names available -> compare file names
4334 * == 0 X OK OK fname_c != fname_s
4335 * X == 0 OK OK fname_c != fname_s
4337 * current file doesn't exist, file for swap file exist, file name(s) not
4338 * available -> probably different
4339 * == 0 != 0 FAIL X TRUE
4340 * == 0 != 0 X FAIL TRUE
4342 * current file exists, inode for swap unknown, file name(s) not
4343 * available -> probably different
4344 * != 0 == 0 FAIL X TRUE
4345 * != 0 == 0 X FAIL TRUE
4347 * current file doesn't exist, inode for swap unknown, one file name not
4348 * available -> probably different
4349 * == 0 == 0 FAIL OK TRUE
4350 * == 0 == 0 OK FAIL TRUE
4352 * current file doesn't exist, inode for swap unknown, both file names not
4353 * available -> probably same file
4354 * == 0 == 0 FAIL FAIL FALSE
4356 * Note that when the ino_t is 64 bits, only the last 32 will be used. This
4357 * can't be changed without making the block 0 incompatible with 32 bit
4362 fnamecmp_ino(fname_c
, fname_s
, ino_block0
)
4363 char_u
*fname_c
; /* current file name */
4364 char_u
*fname_s
; /* file name from swap file */
4368 ino_t ino_c
= 0; /* ino of current file */
4369 ino_t ino_s
; /* ino of file from swap file */
4370 char_u buf_c
[MAXPATHL
]; /* full path of fname_c */
4371 char_u buf_s
[MAXPATHL
]; /* full path of fname_s */
4372 int retval_c
; /* flag: buf_c valid */
4373 int retval_s
; /* flag: buf_s valid */
4375 if (mch_stat((char *)fname_c
, &st
) == 0)
4376 ino_c
= (ino_t
)st
.st_ino
;
4379 * First we try to get the inode from the file name, because the inode in
4380 * the swap file may be outdated. If that fails (e.g. this path is not
4381 * valid on this machine), use the inode from block 0.
4383 if (mch_stat((char *)fname_s
, &st
) == 0)
4384 ino_s
= (ino_t
)st
.st_ino
;
4386 ino_s
= (ino_t
)ino_block0
;
4389 return (ino_c
!= ino_s
);
4392 * One of the inode numbers is unknown, try a forced vim_FullName() and
4393 * compare the file names.
4395 retval_c
= vim_FullName(fname_c
, buf_c
, MAXPATHL
, TRUE
);
4396 retval_s
= vim_FullName(fname_s
, buf_s
, MAXPATHL
, TRUE
);
4397 if (retval_c
== OK
&& retval_s
== OK
)
4398 return (STRCMP(buf_c
, buf_s
) != 0);
4401 * Can't compare inodes or file names, guess that the files are different,
4402 * unless both appear not to exist at all.
4404 if (ino_s
== 0 && ino_c
== 0 && retval_c
== FAIL
&& retval_s
== FAIL
)
4408 #endif /* CHECK_INODE */
4411 * Move a long integer into a four byte character array.
4412 * Used for machine independency in block zero.
4419 s
[0] = (char_u
)(n
& 0xff);
4420 n
= (unsigned)n
>> 8;
4421 s
[1] = (char_u
)(n
& 0xff);
4422 n
= (unsigned)n
>> 8;
4423 s
[2] = (char_u
)(n
& 0xff);
4424 n
= (unsigned)n
>> 8;
4425 s
[3] = (char_u
)(n
& 0xff);
4446 * Set the flags in the first block of the swap file:
4447 * - file is modified or not: buf->b_changed
4458 if (!buf
->b_ml
.ml_mfp
)
4460 for (hp
= buf
->b_ml
.ml_mfp
->mf_used_last
; hp
!= NULL
; hp
= hp
->bh_prev
)
4462 if (hp
->bh_bnum
== 0)
4464 b0p
= (ZERO_BL
*)(hp
->bh_data
);
4465 b0p
->b0_dirty
= buf
->b_changed
? B0_DIRTY
: 0;
4466 b0p
->b0_flags
= (b0p
->b0_flags
& ~B0_FF_MASK
)
4467 | (get_fileformat(buf
) + 1);
4469 add_b0_fenc(b0p
, buf
);
4471 hp
->bh_flags
|= BH_DIRTY
;
4472 mf_sync(buf
->b_ml
.ml_mfp
, MFS_ZERO
);
4478 #if defined(FEAT_BYTEOFF) || defined(PROTO)
4480 #define MLCS_MAXL 800 /* max no of lines in chunk */
4481 #define MLCS_MINL 400 /* should be half of MLCS_MAXL */
4484 * Keep information for finding byte offset of a line, updtytpe may be one of:
4485 * ML_CHNK_ADDLINE: Add len to parent chunk, possibly splitting it
4486 * Careful: ML_CHNK_ADDLINE may cause ml_find_line() to be called.
4487 * ML_CHNK_DELLINE: Subtract len from parent chunk, possibly deleting it
4488 * ML_CHNK_UPDLINE: Add len to parent chunk, as a signed entity.
4491 ml_updatechunk(buf
, line
, len
, updtype
)
4497 static buf_T
*ml_upd_lastbuf
= NULL
;
4498 static linenr_T ml_upd_lastline
;
4499 static linenr_T ml_upd_lastcurline
;
4500 static int ml_upd_lastcurix
;
4502 linenr_T curline
= ml_upd_lastcurline
;
4503 int curix
= ml_upd_lastcurix
;
4505 chunksize_T
*curchnk
;
4510 if (buf
->b_ml
.ml_usedchunks
== -1 || len
== 0)
4512 if (buf
->b_ml
.ml_chunksize
== NULL
)
4514 buf
->b_ml
.ml_chunksize
= (chunksize_T
*)
4515 alloc((unsigned)sizeof(chunksize_T
) * 100);
4516 if (buf
->b_ml
.ml_chunksize
== NULL
)
4518 buf
->b_ml
.ml_usedchunks
= -1;
4521 buf
->b_ml
.ml_numchunks
= 100;
4522 buf
->b_ml
.ml_usedchunks
= 1;
4523 buf
->b_ml
.ml_chunksize
[0].mlcs_numlines
= 1;
4524 buf
->b_ml
.ml_chunksize
[0].mlcs_totalsize
= 1;
4527 if (updtype
== ML_CHNK_UPDLINE
&& buf
->b_ml
.ml_line_count
== 1)
4530 * First line in empty buffer from ml_flush_line() -- reset
4532 buf
->b_ml
.ml_usedchunks
= 1;
4533 buf
->b_ml
.ml_chunksize
[0].mlcs_numlines
= 1;
4534 buf
->b_ml
.ml_chunksize
[0].mlcs_totalsize
=
4535 (long)STRLEN(buf
->b_ml
.ml_line_ptr
) + 1;
4540 * Find chunk that our line belongs to, curline will be at start of the
4543 if (buf
!= ml_upd_lastbuf
|| line
!= ml_upd_lastline
+ 1
4544 || updtype
!= ML_CHNK_ADDLINE
)
4546 for (curline
= 1, curix
= 0;
4547 curix
< buf
->b_ml
.ml_usedchunks
- 1
4548 && line
>= curline
+ buf
->b_ml
.ml_chunksize
[curix
].mlcs_numlines
;
4551 curline
+= buf
->b_ml
.ml_chunksize
[curix
].mlcs_numlines
;
4554 else if (line
>= curline
+ buf
->b_ml
.ml_chunksize
[curix
].mlcs_numlines
4555 && curix
< buf
->b_ml
.ml_usedchunks
- 1)
4557 /* Adjust cached curix & curline */
4558 curline
+= buf
->b_ml
.ml_chunksize
[curix
].mlcs_numlines
;
4561 curchnk
= buf
->b_ml
.ml_chunksize
+ curix
;
4563 if (updtype
== ML_CHNK_DELLINE
)
4565 curchnk
->mlcs_totalsize
+= len
;
4566 if (updtype
== ML_CHNK_ADDLINE
)
4568 curchnk
->mlcs_numlines
++;
4570 /* May resize here so we don't have to do it in both cases below */
4571 if (buf
->b_ml
.ml_usedchunks
+ 1 >= buf
->b_ml
.ml_numchunks
)
4573 buf
->b_ml
.ml_numchunks
= buf
->b_ml
.ml_numchunks
* 3 / 2;
4574 buf
->b_ml
.ml_chunksize
= (chunksize_T
*)
4575 vim_realloc(buf
->b_ml
.ml_chunksize
,
4576 sizeof(chunksize_T
) * buf
->b_ml
.ml_numchunks
);
4577 if (buf
->b_ml
.ml_chunksize
== NULL
)
4579 /* Hmmmm, Give up on offset for this buffer */
4580 buf
->b_ml
.ml_usedchunks
= -1;
4585 if (buf
->b_ml
.ml_chunksize
[curix
].mlcs_numlines
>= MLCS_MAXL
)
4587 int count
; /* number of entries in block */
4592 mch_memmove(buf
->b_ml
.ml_chunksize
+ curix
+ 1,
4593 buf
->b_ml
.ml_chunksize
+ curix
,
4594 (buf
->b_ml
.ml_usedchunks
- curix
) *
4595 sizeof(chunksize_T
));
4596 /* Compute length of first half of lines in the split chunk */
4599 while (curline
< buf
->b_ml
.ml_line_count
4600 && linecnt
< MLCS_MINL
)
4602 if ((hp
= ml_find_line(buf
, curline
, ML_FIND
)) == NULL
)
4604 buf
->b_ml
.ml_usedchunks
= -1;
4607 dp
= (DATA_BL
*)(hp
->bh_data
);
4608 count
= (long)(buf
->b_ml
.ml_locked_high
) -
4609 (long)(buf
->b_ml
.ml_locked_low
) + 1;
4610 idx
= curline
- buf
->b_ml
.ml_locked_low
;
4611 curline
= buf
->b_ml
.ml_locked_high
+ 1;
4612 if (idx
== 0)/* first line in block, text at the end */
4613 text_end
= dp
->db_txt_end
;
4615 text_end
= ((dp
->db_index
[idx
- 1]) & DB_INDEX_MASK
);
4616 /* Compute index of last line to use in this MEMLINE */
4618 if (linecnt
+ rest
> MLCS_MINL
)
4620 idx
+= MLCS_MINL
- linecnt
- 1;
4621 linecnt
= MLCS_MINL
;
4628 size
+= text_end
- ((dp
->db_index
[idx
]) & DB_INDEX_MASK
);
4630 buf
->b_ml
.ml_chunksize
[curix
].mlcs_numlines
= linecnt
;
4631 buf
->b_ml
.ml_chunksize
[curix
+ 1].mlcs_numlines
-= linecnt
;
4632 buf
->b_ml
.ml_chunksize
[curix
].mlcs_totalsize
= size
;
4633 buf
->b_ml
.ml_chunksize
[curix
+ 1].mlcs_totalsize
-= size
;
4634 buf
->b_ml
.ml_usedchunks
++;
4635 ml_upd_lastbuf
= NULL
; /* Force recalc of curix & curline */
4638 else if (buf
->b_ml
.ml_chunksize
[curix
].mlcs_numlines
>= MLCS_MINL
4639 && curix
== buf
->b_ml
.ml_usedchunks
- 1
4640 && buf
->b_ml
.ml_line_count
- line
<= 1)
4643 * We are in the last chunk and it is cheap to crate a new one
4644 * after this. Do it now to avoid the loop above later on
4646 curchnk
= buf
->b_ml
.ml_chunksize
+ curix
+ 1;
4647 buf
->b_ml
.ml_usedchunks
++;
4648 if (line
== buf
->b_ml
.ml_line_count
)
4650 curchnk
->mlcs_numlines
= 0;
4651 curchnk
->mlcs_totalsize
= 0;
4656 * Line is just prior to last, move count for last
4657 * This is the common case when loading a new file
4659 hp
= ml_find_line(buf
, buf
->b_ml
.ml_line_count
, ML_FIND
);
4662 buf
->b_ml
.ml_usedchunks
= -1;
4665 dp
= (DATA_BL
*)(hp
->bh_data
);
4666 if (dp
->db_line_count
== 1)
4667 rest
= dp
->db_txt_end
- dp
->db_txt_start
;
4670 ((dp
->db_index
[dp
->db_line_count
- 2]) & DB_INDEX_MASK
)
4672 curchnk
->mlcs_totalsize
= rest
;
4673 curchnk
->mlcs_numlines
= 1;
4674 curchnk
[-1].mlcs_totalsize
-= rest
;
4675 curchnk
[-1].mlcs_numlines
-= 1;
4679 else if (updtype
== ML_CHNK_DELLINE
)
4681 curchnk
->mlcs_numlines
--;
4682 ml_upd_lastbuf
= NULL
; /* Force recalc of curix & curline */
4683 if (curix
< (buf
->b_ml
.ml_usedchunks
- 1)
4684 && (curchnk
->mlcs_numlines
+ curchnk
[1].mlcs_numlines
)
4688 curchnk
= buf
->b_ml
.ml_chunksize
+ curix
;
4690 else if (curix
== 0 && curchnk
->mlcs_numlines
<= 0)
4692 buf
->b_ml
.ml_usedchunks
--;
4693 mch_memmove(buf
->b_ml
.ml_chunksize
, buf
->b_ml
.ml_chunksize
+ 1,
4694 buf
->b_ml
.ml_usedchunks
* sizeof(chunksize_T
));
4697 else if (curix
== 0 || (curchnk
->mlcs_numlines
> 10
4698 && (curchnk
->mlcs_numlines
+ curchnk
[-1].mlcs_numlines
)
4704 /* Collapse chunks */
4705 curchnk
[-1].mlcs_numlines
+= curchnk
->mlcs_numlines
;
4706 curchnk
[-1].mlcs_totalsize
+= curchnk
->mlcs_totalsize
;
4707 buf
->b_ml
.ml_usedchunks
--;
4708 if (curix
< buf
->b_ml
.ml_usedchunks
)
4710 mch_memmove(buf
->b_ml
.ml_chunksize
+ curix
,
4711 buf
->b_ml
.ml_chunksize
+ curix
+ 1,
4712 (buf
->b_ml
.ml_usedchunks
- curix
) *
4713 sizeof(chunksize_T
));
4717 ml_upd_lastbuf
= buf
;
4718 ml_upd_lastline
= line
;
4719 ml_upd_lastcurline
= curline
;
4720 ml_upd_lastcurix
= curix
;
4724 * Find offset for line or line with offset.
4725 * Find line with offset if "lnum" is 0; return remaining offset in offp
4726 * Find offset of line if "lnum" > 0
4727 * return -1 if information is not available
4730 ml_find_line_or_offset(buf
, lnum
, offp
)
4740 int count
; /* number of entries in block */
4746 int ffdos
= (get_fileformat(buf
) == EOL_DOS
);
4749 /* take care of cached line first */
4750 ml_flush_line(curbuf
);
4752 if (buf
->b_ml
.ml_usedchunks
== -1
4753 || buf
->b_ml
.ml_chunksize
== NULL
4761 if (lnum
== 0 && offset
<= 0)
4762 return 1; /* Not a "find offset" and offset 0 _must_ be in line 1 */
4764 * Find the last chunk before the one containing our line. Last chunk is
4765 * special because it will never qualify
4769 while (curix
< buf
->b_ml
.ml_usedchunks
- 1
4771 && lnum
>= curline
+ buf
->b_ml
.ml_chunksize
[curix
].mlcs_numlines
)
4773 && offset
> size
+ buf
->b_ml
.ml_chunksize
[curix
].mlcs_totalsize
4774 + ffdos
* buf
->b_ml
.ml_chunksize
[curix
].mlcs_numlines
)))
4776 curline
+= buf
->b_ml
.ml_chunksize
[curix
].mlcs_numlines
;
4777 size
+= buf
->b_ml
.ml_chunksize
[curix
].mlcs_totalsize
;
4778 if (offset
&& ffdos
)
4779 size
+= buf
->b_ml
.ml_chunksize
[curix
].mlcs_numlines
;
4783 while ((lnum
!= 0 && curline
< lnum
) || (offset
!= 0 && size
< offset
))
4785 if (curline
> buf
->b_ml
.ml_line_count
4786 || (hp
= ml_find_line(buf
, curline
, ML_FIND
)) == NULL
)
4788 dp
= (DATA_BL
*)(hp
->bh_data
);
4789 count
= (long)(buf
->b_ml
.ml_locked_high
) -
4790 (long)(buf
->b_ml
.ml_locked_low
) + 1;
4791 start_idx
= idx
= curline
- buf
->b_ml
.ml_locked_low
;
4792 if (idx
== 0)/* first line in block, text at the end */
4793 text_end
= dp
->db_txt_end
;
4795 text_end
= ((dp
->db_index
[idx
- 1]) & DB_INDEX_MASK
);
4796 /* Compute index of last line to use in this MEMLINE */
4799 if (curline
+ (count
- idx
) >= lnum
)
4800 idx
+= lnum
- curline
- 1;
4807 while (offset
>= size
4808 + text_end
- (int)((dp
->db_index
[idx
]) & DB_INDEX_MASK
)
4813 if (idx
== count
- 1)
4821 len
= text_end
- ((dp
->db_index
[idx
]) & DB_INDEX_MASK
);
4823 if (offset
!= 0 && size
>= offset
)
4825 if (size
+ ffdos
== offset
)
4827 else if (idx
== start_idx
)
4828 *offp
= offset
- size
+ len
;
4830 *offp
= offset
- size
+ len
4831 - (text_end
- ((dp
->db_index
[idx
- 1]) & DB_INDEX_MASK
));
4832 curline
+= idx
- start_idx
+ extra
;
4833 if (curline
> buf
->b_ml
.ml_line_count
)
4834 return -1; /* exactly one byte beyond the end */
4837 curline
= buf
->b_ml
.ml_locked_high
+ 1;
4842 /* Count extra CR characters. */
4846 /* Don't count the last line break if 'bin' and 'noeol'. */
4847 if (buf
->b_p_bin
&& !buf
->b_p_eol
)
4855 * Goto byte in buffer with offset 'cnt'.
4864 ml_flush_line(curbuf
); /* cached line may be dirty */
4868 lnum
= ml_find_line_or_offset(curbuf
, (linenr_T
)0, &boff
);
4869 if (lnum
< 1) /* past the end */
4871 curwin
->w_cursor
.lnum
= curbuf
->b_ml
.ml_line_count
;
4872 curwin
->w_curswant
= MAXCOL
;
4873 coladvance((colnr_T
)MAXCOL
);
4877 curwin
->w_cursor
.lnum
= lnum
;
4878 curwin
->w_cursor
.col
= (colnr_T
)boff
;
4879 # ifdef FEAT_VIRTUALEDIT
4880 curwin
->w_cursor
.coladd
= 0;
4882 curwin
->w_set_curswant
= TRUE
;
4887 /* Make sure the cursor is on the first byte of a multi-byte char. */