blob: 80a870a0edc9edc5b7ac68e2f3e85c74bb058d15 [file] [log] [blame]
Bram Moolenaar071d4272004-06-13 20:20:40 +00001/* vi:set ts=8 sts=4 sw=4:
2 *
3 * VIM - Vi IMproved by Bram Moolenaar
4 *
5 * Do ":help uganda" in Vim to read copying and usage conditions.
6 * Do ":help credits" in Vim to see a list of people who contributed.
7 * See README.txt for an overview of the Vim source code.
8 */
9
10/* for debugging */
11/* #define CHECK(c, s) if (c) EMSG(s) */
12#define CHECK(c, s)
13
14/*
15 * memline.c: Contains the functions for appending, deleting and changing the
Bram Moolenaar4770d092006-01-12 23:22:24 +000016 * text lines. The memfile functions are used to store the information in
17 * blocks of memory, backed up by a file. The structure of the information is
18 * a tree. The root of the tree is a pointer block. The leaves of the tree
19 * are data blocks. In between may be several layers of pointer blocks,
20 * forming branches.
Bram Moolenaar071d4272004-06-13 20:20:40 +000021 *
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.
26 *
27 * Block nr 0 contains the block0 structure (see below).
28 *
29 * Block nr 1 is the first pointer block. It is the root of the tree.
30 * Other pointer blocks are branches.
31 *
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.
35 *
36 * A data block that was filled when starting to edit a file and was not
37 * changed since then, can have a negative block number. This means that it
38 * has not yet been assigned a place in the file. When recovering, the lines
39 * in this data block can be read from the original file. When the block is
40 * changed (lines appended/deleted/changed) or when it is flushed it gets a
41 * positive number. Use mf_trans_del() to get the new number, before calling
42 * mf_get().
43 */
44
45#if defined(MSDOS) || defined(WIN32) || defined(_WIN64)
Bram Moolenaar362e1a32006-03-06 23:29:24 +000046# include "vimio.h"
Bram Moolenaar071d4272004-06-13 20:20:40 +000047#endif
48
49#include "vim.h"
50
51#ifdef HAVE_FCNTL_H
52# include <fcntl.h>
53#endif
54#ifndef UNIX /* it's in os_unix.h for Unix */
55# include <time.h>
56#endif
57
Bram Moolenaar5a6404c2006-11-01 17:12:57 +000058#if defined(SASC) || defined(__amigaos4__)
Bram Moolenaar071d4272004-06-13 20:20:40 +000059# include <proto/dos.h> /* for Open() and Close() */
60#endif
61
Bram Moolenaar5a6404c2006-11-01 17:12:57 +000062#ifdef HAVE_ERRNO_H
63# include <errno.h>
64#endif
65
Bram Moolenaar071d4272004-06-13 20:20:40 +000066typedef struct block0 ZERO_BL; /* contents of the first block */
67typedef struct pointer_block PTR_BL; /* contents of a pointer block */
68typedef struct data_block DATA_BL; /* contents of a data block */
69typedef struct pointer_entry PTR_EN; /* block/line-count pair */
70
71#define DATA_ID (('d' << 8) + 'a') /* data block id */
72#define PTR_ID (('p' << 8) + 't') /* pointer block id */
73#define BLOCK0_ID0 'b' /* block 0 id 0 */
74#define BLOCK0_ID1 '0' /* block 0 id 1 */
75
76/*
77 * pointer to a block, used in a pointer block
78 */
79struct pointer_entry
80{
81 blocknr_T pe_bnum; /* block number */
82 linenr_T pe_line_count; /* number of lines in this branch */
83 linenr_T pe_old_lnum; /* lnum for this block (for recovery) */
84 int pe_page_count; /* number of pages in block pe_bnum */
85};
86
87/*
88 * A pointer block contains a list of branches in the tree.
89 */
90struct pointer_block
91{
92 short_u pb_id; /* ID for pointer block: PTR_ID */
93 short_u pb_count; /* number of pointer in this block */
94 short_u pb_count_max; /* maximum value for pb_count */
95 PTR_EN pb_pointer[1]; /* list of pointers to blocks (actually longer)
96 * followed by empty space until end of page */
97};
98
99/*
100 * A data block is a leaf in the tree.
101 *
102 * The text of the lines is at the end of the block. The text of the first line
103 * in the block is put at the end, the text of the second line in front of it,
104 * etc. Thus the order of the lines is the opposite of the line number.
105 */
106struct data_block
107{
108 short_u db_id; /* ID for data block: DATA_ID */
109 unsigned db_free; /* free space available */
110 unsigned db_txt_start; /* byte where text starts */
111 unsigned db_txt_end; /* byte just after data block */
112 linenr_T db_line_count; /* number of lines in this block */
113 unsigned db_index[1]; /* index for start of line (actually bigger)
114 * followed by empty space upto db_txt_start
115 * followed by the text in the lines until
116 * end of page */
117};
118
119/*
120 * The low bits of db_index hold the actual index. The topmost bit is
121 * used for the global command to be able to mark a line.
122 * This method is not clean, but otherwise there would be at least one extra
123 * byte used for each line.
124 * The mark has to be in this place to keep it with the correct line when other
125 * lines are inserted or deleted.
126 */
127#define DB_MARKED ((unsigned)1 << ((sizeof(unsigned) * 8) - 1))
128#define DB_INDEX_MASK (~DB_MARKED)
129
130#define INDEX_SIZE (sizeof(unsigned)) /* size of one db_index entry */
131#define HEADER_SIZE (sizeof(DATA_BL) - INDEX_SIZE) /* size of data block header */
132
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000133#define B0_FNAME_SIZE_ORG 900 /* what it was in older versions */
134#define B0_FNAME_SIZE 898
135#define B0_UNAME_SIZE 40
136#define B0_HNAME_SIZE 40
Bram Moolenaar071d4272004-06-13 20:20:40 +0000137/*
138 * Restrict the numbers to 32 bits, otherwise most compilers will complain.
139 * This won't detect a 64 bit machine that only swaps a byte in the top 32
140 * bits, but that is crazy anyway.
141 */
142#define B0_MAGIC_LONG 0x30313233L
143#define B0_MAGIC_INT 0x20212223L
144#define B0_MAGIC_SHORT 0x10111213L
145#define B0_MAGIC_CHAR 0x55
146
147/*
148 * Block zero holds all info about the swap file.
149 *
150 * NOTE: DEFINITION OF BLOCK 0 SHOULD NOT CHANGE! It would make all existing
151 * swap files unusable!
152 *
153 * If size of block0 changes anyway, adjust MIN_SWAP_PAGE_SIZE in vim.h!!
154 *
155 * This block is built up of single bytes, to make it portable accros
156 * different machines. b0_magic_* is used to check the byte order and size of
157 * variables, because the rest of the swap file is not portable.
158 */
159struct block0
160{
161 char_u b0_id[2]; /* id for block 0: BLOCK0_ID0 and BLOCK0_ID1 */
162 char_u b0_version[10]; /* Vim version string */
163 char_u b0_page_size[4];/* number of bytes per page */
164 char_u b0_mtime[4]; /* last modification time of file */
165 char_u b0_ino[4]; /* inode of b0_fname */
166 char_u b0_pid[4]; /* process id of creator (or 0) */
167 char_u b0_uname[B0_UNAME_SIZE]; /* name of user (uid if no name) */
168 char_u b0_hname[B0_HNAME_SIZE]; /* host name (if it has a name) */
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000169 char_u b0_fname[B0_FNAME_SIZE_ORG]; /* name of file being edited */
Bram Moolenaar071d4272004-06-13 20:20:40 +0000170 long b0_magic_long; /* check for byte order of long */
171 int b0_magic_int; /* check for byte order of int */
172 short b0_magic_short; /* check for byte order of short */
173 char_u b0_magic_char; /* check for last char */
174};
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000175
176/*
Bram Moolenaar4770d092006-01-12 23:22:24 +0000177 * Note: b0_dirty and b0_flags are put at the end of the file name. For very
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000178 * long file names in older versions of Vim they are invalid.
179 * The 'fileencoding' comes before b0_flags, with a NUL in front. But only
180 * when there is room, for very long file names it's omitted.
181 */
182#define B0_DIRTY 0x55
183#define b0_dirty b0_fname[B0_FNAME_SIZE_ORG-1]
184
185/*
186 * The b0_flags field is new in Vim 7.0.
187 */
188#define b0_flags b0_fname[B0_FNAME_SIZE_ORG-2]
189
190/* The lowest two bits contain the fileformat. Zero means it's not set
191 * (compatible with Vim 6.x), otherwise it's EOL_UNIX + 1, EOL_DOS + 1 or
192 * EOL_MAC + 1. */
193#define B0_FF_MASK 3
194
195/* Swap file is in directory of edited file. Used to find the file from
196 * different mount points. */
197#define B0_SAME_DIR 4
198
199/* The 'fileencoding' is at the end of b0_fname[], with a NUL in front of it.
200 * When empty there is only the NUL. */
201#define B0_HAS_FENC 8
Bram Moolenaar071d4272004-06-13 20:20:40 +0000202
203#define STACK_INCR 5 /* nr of entries added to ml_stack at a time */
204
205/*
206 * The line number where the first mark may be is remembered.
207 * If it is 0 there are no marks at all.
208 * (always used for the current buffer only, no buffer change possible while
209 * executing a global command).
210 */
211static linenr_T lowest_marked = 0;
212
213/*
214 * arguments for ml_find_line()
215 */
216#define ML_DELETE 0x11 /* delete line */
217#define ML_INSERT 0x12 /* insert line */
218#define ML_FIND 0x13 /* just find the line */
219#define ML_FLUSH 0x02 /* flush locked block */
220#define ML_SIMPLE(x) (x & 0x10) /* DEL, INS or FIND */
221
Bram Moolenaar89d40322006-08-29 15:30:07 +0000222static void ml_upd_block0 __ARGS((buf_T *buf, int set_fname));
Bram Moolenaar071d4272004-06-13 20:20:40 +0000223static void set_b0_fname __ARGS((ZERO_BL *, buf_T *buf));
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000224static void set_b0_dir_flag __ARGS((ZERO_BL *b0p, buf_T *buf));
225#ifdef FEAT_MBYTE
226static void add_b0_fenc __ARGS((ZERO_BL *b0p, buf_T *buf));
227#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +0000228static time_t swapfile_info __ARGS((char_u *));
229static int recov_file_names __ARGS((char_u **, char_u *, int prepend_dot));
230static int ml_append_int __ARGS((buf_T *, linenr_T, char_u *, colnr_T, int, int));
231static int ml_delete_int __ARGS((buf_T *, linenr_T, int));
232static char_u *findswapname __ARGS((buf_T *, char_u **, char_u *));
233static void ml_flush_line __ARGS((buf_T *));
234static bhdr_T *ml_new_data __ARGS((memfile_T *, int, int));
235static bhdr_T *ml_new_ptr __ARGS((memfile_T *));
236static bhdr_T *ml_find_line __ARGS((buf_T *, linenr_T, int));
237static int ml_add_stack __ARGS((buf_T *));
Bram Moolenaar071d4272004-06-13 20:20:40 +0000238static void ml_lineadd __ARGS((buf_T *, int));
239static int b0_magic_wrong __ARGS((ZERO_BL *));
240#ifdef CHECK_INODE
241static int fnamecmp_ino __ARGS((char_u *, char_u *, long));
242#endif
243static void long_to_char __ARGS((long, char_u *));
244static long char_to_long __ARGS((char_u *));
245#if defined(UNIX) || defined(WIN3264)
246static char_u *make_percent_swname __ARGS((char_u *dir, char_u *name));
247#endif
248#ifdef FEAT_BYTEOFF
249static void ml_updatechunk __ARGS((buf_T *buf, long line, long len, int updtype));
250#endif
251
252/*
Bram Moolenaar4770d092006-01-12 23:22:24 +0000253 * Open a new memline for "buf".
Bram Moolenaar071d4272004-06-13 20:20:40 +0000254 *
Bram Moolenaar4770d092006-01-12 23:22:24 +0000255 * Return FAIL for failure, OK otherwise.
Bram Moolenaar071d4272004-06-13 20:20:40 +0000256 */
257 int
Bram Moolenaar4770d092006-01-12 23:22:24 +0000258ml_open(buf)
259 buf_T *buf;
Bram Moolenaar071d4272004-06-13 20:20:40 +0000260{
261 memfile_T *mfp;
262 bhdr_T *hp = NULL;
263 ZERO_BL *b0p;
264 PTR_BL *pp;
265 DATA_BL *dp;
266
Bram Moolenaar4770d092006-01-12 23:22:24 +0000267 /*
268 * init fields in memline struct
269 */
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 */
Bram Moolenaar071d4272004-06-13 20:20:40 +0000275#ifdef FEAT_BYTEOFF
Bram Moolenaar4770d092006-01-12 23:22:24 +0000276 buf->b_ml.ml_chunksize = NULL;
Bram Moolenaar071d4272004-06-13 20:20:40 +0000277#endif
278
Bram Moolenaar4770d092006-01-12 23:22:24 +0000279 /*
280 * When 'updatecount' is non-zero swap file may be opened later.
281 */
282 if (p_uc && buf->b_p_swf)
283 buf->b_may_swap = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +0000284 else
Bram Moolenaar4770d092006-01-12 23:22:24 +0000285 buf->b_may_swap = FALSE;
Bram Moolenaar071d4272004-06-13 20:20:40 +0000286
Bram Moolenaar4770d092006-01-12 23:22:24 +0000287 /*
288 * Open the memfile. No swap file is created yet.
289 */
Bram Moolenaar071d4272004-06-13 20:20:40 +0000290 mfp = mf_open(NULL, 0);
291 if (mfp == NULL)
292 goto error;
293
Bram Moolenaar4770d092006-01-12 23:22:24 +0000294 buf->b_ml.ml_mfp = mfp;
295 buf->b_ml.ml_flags = ML_EMPTY;
296 buf->b_ml.ml_line_count = 1;
Bram Moolenaar592e0a22004-07-03 16:05:59 +0000297#ifdef FEAT_LINEBREAK
298 curwin->w_nrwidth_line_count = 0;
299#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +0000300
301#if defined(MSDOS) && !defined(DJGPP)
302 /* for 16 bit MS-DOS create a swapfile now, because we run out of
303 * memory very quickly */
304 if (p_uc != 0)
Bram Moolenaar4770d092006-01-12 23:22:24 +0000305 ml_open_file(buf);
Bram Moolenaar071d4272004-06-13 20:20:40 +0000306#endif
307
308/*
309 * fill block0 struct and write page 0
310 */
311 if ((hp = mf_new(mfp, FALSE, 1)) == NULL)
312 goto error;
313 if (hp->bh_bnum != 0)
314 {
315 EMSG(_("E298: Didn't get block nr 0?"));
316 goto error;
317 }
318 b0p = (ZERO_BL *)(hp->bh_data);
319
320 b0p->b0_id[0] = BLOCK0_ID0;
321 b0p->b0_id[1] = BLOCK0_ID1;
Bram Moolenaar071d4272004-06-13 20:20:40 +0000322 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;
Bram Moolenaar071d4272004-06-13 20:20:40 +0000326 STRNCPY(b0p->b0_version, "VIM ", 4);
327 STRNCPY(b0p->b0_version + 4, Version, 6);
Bram Moolenaar071d4272004-06-13 20:20:40 +0000328 long_to_char((long)mfp->mf_page_size, b0p->b0_page_size);
Bram Moolenaar4770d092006-01-12 23:22:24 +0000329
Bram Moolenaar76b92b22006-03-24 22:46:53 +0000330#ifdef FEAT_SPELL
331 if (!buf->b_spell)
332#endif
Bram Moolenaar4770d092006-01-12 23:22:24 +0000333 {
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);
342 }
Bram Moolenaar071d4272004-06-13 20:20:40 +0000343
344 /*
345 * Always sync block number 0 to disk, so we can check the file name in
Bram Moolenaar4770d092006-01-12 23:22:24 +0000346 * the swap file in findswapname(). Don't do this for help files though
347 * and spell buffer though.
Bram Moolenaar071d4272004-06-13 20:20:40 +0000348 * Only works when there's a swapfile, otherwise it's done when the file
349 * is created.
350 */
351 mf_put(mfp, hp, TRUE, FALSE);
Bram Moolenaar4770d092006-01-12 23:22:24 +0000352 if (!buf->b_help && !B_SPELL(buf))
Bram Moolenaar071d4272004-06-13 20:20:40 +0000353 (void)mf_sync(mfp, 0);
354
Bram Moolenaar4770d092006-01-12 23:22:24 +0000355 /*
356 * Fill in root pointer block and write page 1.
357 */
Bram Moolenaar071d4272004-06-13 20:20:40 +0000358 if ((hp = ml_new_ptr(mfp)) == NULL)
359 goto error;
360 if (hp->bh_bnum != 1)
361 {
362 EMSG(_("E298: Didn't get block nr 1?"));
363 goto error;
364 }
365 pp = (PTR_BL *)(hp->bh_data);
366 pp->pb_count = 1;
367 pp->pb_pointer[0].pe_bnum = 2;
368 pp->pb_pointer[0].pe_page_count = 1;
369 pp->pb_pointer[0].pe_old_lnum = 1;
370 pp->pb_pointer[0].pe_line_count = 1; /* line count after insertion */
371 mf_put(mfp, hp, TRUE, FALSE);
372
Bram Moolenaar4770d092006-01-12 23:22:24 +0000373 /*
374 * Allocate first data block and create an empty line 1.
375 */
Bram Moolenaar071d4272004-06-13 20:20:40 +0000376 if ((hp = ml_new_data(mfp, FALSE, 1)) == NULL)
377 goto error;
378 if (hp->bh_bnum != 2)
379 {
380 EMSG(_("E298: Didn't get block nr 2?"));
381 goto error;
382 }
383
384 dp = (DATA_BL *)(hp->bh_data);
385 dp->db_index[0] = --dp->db_txt_start; /* at end of block */
386 dp->db_free -= 1 + INDEX_SIZE;
387 dp->db_line_count = 1;
388 *((char_u *)dp + dp->db_txt_start) = NUL; /* emtpy line */
389
390 return OK;
391
392error:
393 if (mfp != NULL)
394 {
395 if (hp)
396 mf_put(mfp, hp, FALSE, FALSE);
397 mf_close(mfp, TRUE); /* will also free(mfp->mf_fname) */
398 }
Bram Moolenaar4770d092006-01-12 23:22:24 +0000399 buf->b_ml.ml_mfp = NULL;
Bram Moolenaar071d4272004-06-13 20:20:40 +0000400 return FAIL;
401}
402
403/*
404 * ml_setname() is called when the file name of "buf" has been changed.
405 * It may rename the swap file.
406 */
407 void
408ml_setname(buf)
409 buf_T *buf;
410{
411 int success = FALSE;
412 memfile_T *mfp;
413 char_u *fname;
414 char_u *dirp;
415#if defined(MSDOS) || defined(MSWIN)
416 char_u *p;
417#endif
418
419 mfp = buf->b_ml.ml_mfp;
420 if (mfp->mf_fd < 0) /* there is no swap file yet */
421 {
422 /*
423 * When 'updatecount' is 0 and 'noswapfile' there is no swap file.
424 * For help files we will make a swap file now.
425 */
426 if (p_uc != 0)
427 ml_open_file(buf); /* create a swap file */
428 return;
429 }
430
431 /*
432 * Try all directories in the 'directory' option.
433 */
434 dirp = p_dir;
435 for (;;)
436 {
437 if (*dirp == NUL) /* tried all directories, fail */
438 break;
Bram Moolenaar8fc061c2004-12-29 21:03:02 +0000439 fname = findswapname(buf, &dirp, mfp->mf_fname);
440 /* alloc's fname */
Bram Moolenaar071d4272004-06-13 20:20:40 +0000441 if (fname == NULL) /* no file name found for this dir */
442 continue;
443
444#if defined(MSDOS) || defined(MSWIN)
445 /*
446 * Set full pathname for swap file now, because a ":!cd dir" may
447 * change directory without us knowing it.
448 */
449 p = FullName_save(fname, FALSE);
450 vim_free(fname);
451 fname = p;
452 if (fname == NULL)
453 continue;
454#endif
455 /* if the file name is the same we don't have to do anything */
456 if (fnamecmp(fname, mfp->mf_fname) == 0)
457 {
458 vim_free(fname);
459 success = TRUE;
460 break;
461 }
462 /* need to close the swap file before renaming */
463 if (mfp->mf_fd >= 0)
464 {
465 close(mfp->mf_fd);
466 mfp->mf_fd = -1;
467 }
468
469 /* try to rename the swap file */
470 if (vim_rename(mfp->mf_fname, fname) == 0)
471 {
472 success = TRUE;
473 vim_free(mfp->mf_fname);
474 mfp->mf_fname = fname;
475 vim_free(mfp->mf_ffname);
476#if defined(MSDOS) || defined(MSWIN)
477 mfp->mf_ffname = NULL; /* mf_fname is full pathname already */
478#else
479 mf_set_ffname(mfp);
480#endif
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000481 ml_upd_block0(buf, FALSE);
Bram Moolenaar071d4272004-06-13 20:20:40 +0000482 break;
483 }
484 vim_free(fname); /* this fname didn't work, try another */
485 }
486
487 if (mfp->mf_fd == -1) /* need to (re)open the swap file */
488 {
489 mfp->mf_fd = mch_open((char *)mfp->mf_fname, O_RDWR | O_EXTRA, 0);
490 if (mfp->mf_fd < 0)
491 {
492 /* could not (re)open the swap file, what can we do???? */
493 EMSG(_("E301: Oops, lost the swap file!!!"));
494 return;
495 }
496 }
497 if (!success)
498 EMSG(_("E302: Could not rename swap file"));
499}
500
501/*
502 * Open a file for the memfile for all buffers that are not readonly or have
503 * been modified.
504 * Used when 'updatecount' changes from zero to non-zero.
505 */
506 void
507ml_open_files()
508{
509 buf_T *buf;
510
511 for (buf = firstbuf; buf != NULL; buf = buf->b_next)
512 if (!buf->b_p_ro || buf->b_changed)
513 ml_open_file(buf);
514}
515
516/*
517 * Open a swap file for an existing memfile, if there is no swap file yet.
518 * If we are unable to find a file name, mf_fname will be NULL
519 * and the memfile will be in memory only (no recovery possible).
520 */
521 void
522ml_open_file(buf)
523 buf_T *buf;
524{
525 memfile_T *mfp;
526 char_u *fname;
527 char_u *dirp;
528
529 mfp = buf->b_ml.ml_mfp;
530 if (mfp == NULL || mfp->mf_fd >= 0 || !buf->b_p_swf)
531 return; /* nothing to do */
532
Bram Moolenaara1956f62006-03-12 22:18:00 +0000533#ifdef FEAT_SPELL
Bram Moolenaar4770d092006-01-12 23:22:24 +0000534 /* For a spell buffer use a temp file name. */
535 if (buf->b_spell)
536 {
537 fname = vim_tempname('s');
538 if (fname != NULL)
539 (void)mf_open_file(mfp, fname); /* consumes fname! */
540 buf->b_may_swap = FALSE;
541 return;
542 }
543#endif
544
Bram Moolenaar071d4272004-06-13 20:20:40 +0000545 /*
546 * Try all directories in 'directory' option.
547 */
548 dirp = p_dir;
549 for (;;)
550 {
551 if (*dirp == NUL)
552 break;
553 /* There is a small chance that between chosing the swap file name and
554 * creating it, another Vim creates the file. In that case the
555 * creation will fail and we will use another directory. */
Bram Moolenaar8fc061c2004-12-29 21:03:02 +0000556 fname = findswapname(buf, &dirp, NULL); /* allocates fname */
Bram Moolenaar071d4272004-06-13 20:20:40 +0000557 if (fname == NULL)
558 continue;
559 if (mf_open_file(mfp, fname) == OK) /* consumes fname! */
560 {
561#if defined(MSDOS) || defined(MSWIN) || defined(RISCOS)
562 /*
563 * set full pathname for swap file now, because a ":!cd dir" may
564 * change directory without us knowing it.
565 */
566 mf_fullname(mfp);
567#endif
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000568 ml_upd_block0(buf, FALSE);
569
Bram Moolenaar071d4272004-06-13 20:20:40 +0000570 /* Flush block zero, so others can read it */
571 if (mf_sync(mfp, MFS_ZERO) == OK)
Bram Moolenaarc32840f2006-01-14 21:23:38 +0000572 {
573 /* Mark all blocks that should be in the swapfile as dirty.
574 * Needed for when the 'swapfile' option was reset, so that
575 * the swap file was deleted, and then on again. */
576 mf_set_dirty(mfp);
Bram Moolenaar071d4272004-06-13 20:20:40 +0000577 break;
Bram Moolenaarc32840f2006-01-14 21:23:38 +0000578 }
Bram Moolenaar071d4272004-06-13 20:20:40 +0000579 /* Writing block 0 failed: close the file and try another dir */
580 mf_close_file(buf, FALSE);
581 }
582 }
583
584 if (mfp->mf_fname == NULL) /* Failed! */
585 {
586 need_wait_return = TRUE; /* call wait_return later */
587 ++no_wait_return;
588 (void)EMSG2(_("E303: Unable to open swap file for \"%s\", recovery impossible"),
589 buf_spname(buf) != NULL
590 ? (char_u *)buf_spname(buf)
591 : buf->b_fname);
592 --no_wait_return;
593 }
594
595 /* don't try to open a swap file again */
596 buf->b_may_swap = FALSE;
597}
598
599/*
600 * If still need to create a swap file, and starting to edit a not-readonly
601 * file, or reading into an existing buffer, create a swap file now.
602 */
603 void
604check_need_swap(newfile)
605 int newfile; /* reading file into new buffer */
606{
607 if (curbuf->b_may_swap && (!curbuf->b_p_ro || !newfile))
608 ml_open_file(curbuf);
609}
610
611/*
612 * Close memline for buffer 'buf'.
613 * If 'del_file' is TRUE, delete the swap file
614 */
615 void
616ml_close(buf, del_file)
617 buf_T *buf;
618 int del_file;
619{
620 if (buf->b_ml.ml_mfp == NULL) /* not open */
621 return;
622 mf_close(buf->b_ml.ml_mfp, del_file); /* close the .swp file */
623 if (buf->b_ml.ml_line_lnum != 0 && (buf->b_ml.ml_flags & ML_LINE_DIRTY))
624 vim_free(buf->b_ml.ml_line_ptr);
625 vim_free(buf->b_ml.ml_stack);
626#ifdef FEAT_BYTEOFF
627 vim_free(buf->b_ml.ml_chunksize);
628 buf->b_ml.ml_chunksize = NULL;
629#endif
630 buf->b_ml.ml_mfp = NULL;
631
632 /* Reset the "recovered" flag, give the ATTENTION prompt the next time
633 * this buffer is loaded. */
634 buf->b_flags &= ~BF_RECOVERED;
635}
636
637/*
638 * Close all existing memlines and memfiles.
639 * Only used when exiting.
640 * When 'del_file' is TRUE, delete the memfiles.
Bram Moolenaar81bf7082005-02-12 14:31:42 +0000641 * But don't delete files that were ":preserve"d when we are POSIX compatible.
Bram Moolenaar071d4272004-06-13 20:20:40 +0000642 */
643 void
644ml_close_all(del_file)
645 int del_file;
646{
647 buf_T *buf;
648
649 for (buf = firstbuf; buf != NULL; buf = buf->b_next)
Bram Moolenaar81bf7082005-02-12 14:31:42 +0000650 ml_close(buf, del_file && ((buf->b_flags & BF_PRESERVED) == 0
651 || vim_strchr(p_cpo, CPO_PRESERVE) == NULL));
Bram Moolenaar071d4272004-06-13 20:20:40 +0000652#ifdef TEMPDIRNAMES
653 vim_deltempdir(); /* delete created temp directory */
654#endif
655}
656
657/*
658 * Close all memfiles for not modified buffers.
659 * Only use just before exiting!
660 */
661 void
662ml_close_notmod()
663{
664 buf_T *buf;
665
666 for (buf = firstbuf; buf != NULL; buf = buf->b_next)
667 if (!bufIsChanged(buf))
668 ml_close(buf, TRUE); /* close all not-modified buffers */
669}
670
671/*
672 * Update the timestamp in the .swp file.
673 * Used when the file has been written.
674 */
675 void
676ml_timestamp(buf)
677 buf_T *buf;
678{
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000679 ml_upd_block0(buf, TRUE);
680}
681
682/*
683 * Update the timestamp or the B0_SAME_DIR flag of the .swp file.
684 */
685 static void
Bram Moolenaar89d40322006-08-29 15:30:07 +0000686ml_upd_block0(buf, set_fname)
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000687 buf_T *buf;
Bram Moolenaar89d40322006-08-29 15:30:07 +0000688 int set_fname;
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000689{
Bram Moolenaar071d4272004-06-13 20:20:40 +0000690 memfile_T *mfp;
691 bhdr_T *hp;
692 ZERO_BL *b0p;
693
694 mfp = buf->b_ml.ml_mfp;
Bram Moolenaar071d4272004-06-13 20:20:40 +0000695 if (mfp == NULL || (hp = mf_get(mfp, (blocknr_T)0, 1)) == NULL)
696 return;
697 b0p = (ZERO_BL *)(hp->bh_data);
698 if (b0p->b0_id[0] != BLOCK0_ID0 || b0p->b0_id[1] != BLOCK0_ID1)
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000699 EMSG(_("E304: ml_upd_block0(): Didn't get block 0??"));
Bram Moolenaar071d4272004-06-13 20:20:40 +0000700 else
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000701 {
Bram Moolenaar89d40322006-08-29 15:30:07 +0000702 if (set_fname)
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000703 set_b0_fname(b0p, buf);
704 else
705 set_b0_dir_flag(b0p, buf);
706 }
Bram Moolenaar071d4272004-06-13 20:20:40 +0000707 mf_put(mfp, hp, TRUE, FALSE);
708}
709
710/*
711 * Write file name and timestamp into block 0 of a swap file.
712 * Also set buf->b_mtime.
713 * Don't use NameBuff[]!!!
714 */
715 static void
716set_b0_fname(b0p, buf)
717 ZERO_BL *b0p;
718 buf_T *buf;
719{
720 struct stat st;
721
722 if (buf->b_ffname == NULL)
723 b0p->b0_fname[0] = NUL;
724 else
725 {
726#if defined(MSDOS) || defined(MSWIN) || defined(AMIGA) || defined(RISCOS)
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000727 /* Systems that cannot translate "~user" back into a path: copy the
728 * file name unmodified. Do use slashes instead of backslashes for
729 * portability. */
Bram Moolenaarce0842a2005-07-18 21:58:11 +0000730 vim_strncpy(b0p->b0_fname, buf->b_ffname, B0_FNAME_SIZE - 1);
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000731# ifdef BACKSLASH_IN_FILENAME
732 forward_slash(b0p->b0_fname);
733# endif
Bram Moolenaar071d4272004-06-13 20:20:40 +0000734#else
735 size_t flen, ulen;
736 char_u uname[B0_UNAME_SIZE];
737
738 /*
739 * For a file under the home directory of the current user, we try to
740 * replace the home directory path with "~user". This helps when
741 * editing the same file on different machines over a network.
742 * First replace home dir path with "~/" with home_replace().
743 * Then insert the user name to get "~user/".
744 */
745 home_replace(NULL, buf->b_ffname, b0p->b0_fname, B0_FNAME_SIZE, TRUE);
746 if (b0p->b0_fname[0] == '~')
747 {
748 flen = STRLEN(b0p->b0_fname);
749 /* If there is no user name or it is too long, don't use "~/" */
750 if (get_user_name(uname, B0_UNAME_SIZE) == FAIL
751 || (ulen = STRLEN(uname)) + flen > B0_FNAME_SIZE - 1)
Bram Moolenaarce0842a2005-07-18 21:58:11 +0000752 vim_strncpy(b0p->b0_fname, buf->b_ffname, B0_FNAME_SIZE - 1);
Bram Moolenaar071d4272004-06-13 20:20:40 +0000753 else
754 {
755 mch_memmove(b0p->b0_fname + ulen + 1, b0p->b0_fname + 1, flen);
756 mch_memmove(b0p->b0_fname + 1, uname, ulen);
757 }
758 }
759#endif
760 if (mch_stat((char *)buf->b_ffname, &st) >= 0)
761 {
762 long_to_char((long)st.st_mtime, b0p->b0_mtime);
763#ifdef CHECK_INODE
764 long_to_char((long)st.st_ino, b0p->b0_ino);
765#endif
766 buf_store_time(buf, &st, buf->b_ffname);
767 buf->b_mtime_read = buf->b_mtime;
768 }
769 else
770 {
771 long_to_char(0L, b0p->b0_mtime);
772#ifdef CHECK_INODE
773 long_to_char(0L, b0p->b0_ino);
774#endif
775 buf->b_mtime = 0;
776 buf->b_mtime_read = 0;
777 buf->b_orig_size = 0;
778 buf->b_orig_mode = 0;
779 }
780 }
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000781
782#ifdef FEAT_MBYTE
783 /* Also add the 'fileencoding' if there is room. */
784 add_b0_fenc(b0p, curbuf);
785#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +0000786}
787
788/*
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000789 * Update the B0_SAME_DIR flag of the swap file. It's set if the file and the
790 * swapfile for "buf" are in the same directory.
791 * This is fail safe: if we are not sure the directories are equal the flag is
792 * not set.
793 */
794 static void
795set_b0_dir_flag(b0p, buf)
796 ZERO_BL *b0p;
797 buf_T *buf;
798{
799 if (same_directory(buf->b_ml.ml_mfp->mf_fname, buf->b_ffname))
800 b0p->b0_flags |= B0_SAME_DIR;
801 else
802 b0p->b0_flags &= ~B0_SAME_DIR;
803}
804
805#ifdef FEAT_MBYTE
806/*
807 * When there is room, add the 'fileencoding' to block zero.
808 */
809 static void
810add_b0_fenc(b0p, buf)
811 ZERO_BL *b0p;
812 buf_T *buf;
813{
814 int n;
815
Bram Moolenaara93fa7e2006-04-17 22:14:47 +0000816 n = (int)STRLEN(buf->b_p_fenc);
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000817 if (STRLEN(b0p->b0_fname) + n + 1 > B0_FNAME_SIZE)
818 b0p->b0_flags &= ~B0_HAS_FENC;
819 else
820 {
821 mch_memmove((char *)b0p->b0_fname + B0_FNAME_SIZE - n,
822 (char *)buf->b_p_fenc, (size_t)n);
823 *(b0p->b0_fname + B0_FNAME_SIZE - n - 1) = NUL;
824 b0p->b0_flags |= B0_HAS_FENC;
825 }
826}
827#endif
828
829
830/*
Bram Moolenaar071d4272004-06-13 20:20:40 +0000831 * try to recover curbuf from the .swp file
832 */
833 void
834ml_recover()
835{
836 buf_T *buf = NULL;
837 memfile_T *mfp = NULL;
838 char_u *fname;
839 bhdr_T *hp = NULL;
840 ZERO_BL *b0p;
Bram Moolenaar1cd871b2004-12-19 22:46:22 +0000841 int b0_ff;
842 char_u *b0_fenc = NULL;
Bram Moolenaar071d4272004-06-13 20:20:40 +0000843 PTR_BL *pp;
844 DATA_BL *dp;
845 infoptr_T *ip;
846 blocknr_T bnum;
847 int page_count;
848 struct stat org_stat, swp_stat;
849 int len;
850 int directly;
851 linenr_T lnum;
852 char_u *p;
853 int i;
854 long error;
855 int cannot_open;
856 linenr_T line_count;
857 int has_error;
858 int idx;
859 int top;
860 int txt_start;
861 off_t size;
862 int called_from_main;
863 int serious_error = TRUE;
864 long mtime;
865 int attr;
866
867 recoverymode = TRUE;
868 called_from_main = (curbuf->b_ml.ml_mfp == NULL);
869 attr = hl_attr(HLF_E);
870/*
871 * If the file name ends in ".sw?" we use it directly.
872 * Otherwise a search is done to find the swap file(s).
873 */
874 fname = curbuf->b_fname;
875 if (fname == NULL) /* When there is no file name */
876 fname = (char_u *)"";
877 len = (int)STRLEN(fname);
878 if (len >= 4 &&
879#if defined(VMS) || defined(RISCOS)
880 STRNICMP(fname + len - 4, "_sw" , 3)
881#else
882 STRNICMP(fname + len - 4, ".sw" , 3)
883#endif
884 == 0)
885 {
886 directly = TRUE;
887 fname = vim_strsave(fname); /* make a copy for mf_open() */
888 }
889 else
890 {
891 directly = FALSE;
892
893 /* count the number of matching swap files */
894 len = recover_names(&fname, FALSE, 0);
895 if (len == 0) /* no swap files found */
896 {
897 EMSG2(_("E305: No swap file found for %s"), fname);
898 goto theend;
899 }
900 if (len == 1) /* one swap file found, use it */
901 i = 1;
902 else /* several swap files found, choose */
903 {
904 /* list the names of the swap files */
905 (void)recover_names(&fname, TRUE, 0);
906 msg_putchar('\n');
907 MSG_PUTS(_("Enter number of swap file to use (0 to quit): "));
Bram Moolenaar24bbcfe2005-06-28 23:32:02 +0000908 i = get_number(FALSE, NULL);
Bram Moolenaar071d4272004-06-13 20:20:40 +0000909 if (i < 1 || i > len)
910 goto theend;
911 }
912 /* get the swap file name that will be used */
913 (void)recover_names(&fname, FALSE, i);
914 }
915 if (fname == NULL)
916 goto theend; /* out of memory */
917
918 /* When called from main() still need to initialize storage structure */
Bram Moolenaar4770d092006-01-12 23:22:24 +0000919 if (called_from_main && ml_open(curbuf) == FAIL)
Bram Moolenaar071d4272004-06-13 20:20:40 +0000920 getout(1);
921
922/*
923 * allocate a buffer structure (only the memline in it is really used)
924 */
925 buf = (buf_T *)alloc((unsigned)sizeof(buf_T));
926 if (buf == NULL)
927 {
928 vim_free(fname);
929 goto theend;
930 }
931
932/*
933 * init fields in memline struct
934 */
935 buf->b_ml.ml_stack_size = 0; /* no stack yet */
936 buf->b_ml.ml_stack = NULL; /* no stack yet */
937 buf->b_ml.ml_stack_top = 0; /* nothing in the stack */
938 buf->b_ml.ml_line_lnum = 0; /* no cached line */
939 buf->b_ml.ml_locked = NULL; /* no locked block */
940 buf->b_ml.ml_flags = 0;
941
942/*
943 * open the memfile from the old swap file
944 */
945 p = vim_strsave(fname); /* save fname for the message
946 (mf_open() may free fname) */
947 mfp = mf_open(fname, O_RDONLY); /* consumes fname! */
948 if (mfp == NULL || mfp->mf_fd < 0)
949 {
950 if (p != NULL)
951 {
952 EMSG2(_("E306: Cannot open %s"), p);
953 vim_free(p);
954 }
955 goto theend;
956 }
957 vim_free(p);
958 buf->b_ml.ml_mfp = mfp;
959
960 /*
961 * The page size set in mf_open() might be different from the page size
962 * used in the swap file, we must get it from block 0. But to read block
963 * 0 we need a page size. Use the minimal size for block 0 here, it will
964 * be set to the real value below.
965 */
966 mfp->mf_page_size = MIN_SWAP_PAGE_SIZE;
967
968/*
969 * try to read block 0
970 */
971 if ((hp = mf_get(mfp, (blocknr_T)0, 1)) == NULL)
972 {
973 msg_start();
974 MSG_PUTS_ATTR(_("Unable to read block 0 from "), attr | MSG_HIST);
975 msg_outtrans_attr(mfp->mf_fname, attr | MSG_HIST);
976 MSG_PUTS_ATTR(
977 _("\nMaybe no changes were made or Vim did not update the swap file."),
978 attr | MSG_HIST);
979 msg_end();
980 goto theend;
981 }
982 b0p = (ZERO_BL *)(hp->bh_data);
983 if (STRNCMP(b0p->b0_version, "VIM 3.0", 7) == 0)
984 {
985 msg_start();
986 msg_outtrans_attr(mfp->mf_fname, MSG_HIST);
987 MSG_PUTS_ATTR(_(" cannot be used with this version of Vim.\n"),
988 MSG_HIST);
989 MSG_PUTS_ATTR(_("Use Vim version 3.0.\n"), MSG_HIST);
990 msg_end();
991 goto theend;
992 }
993 if (b0p->b0_id[0] != BLOCK0_ID0 || b0p->b0_id[1] != BLOCK0_ID1)
994 {
995 EMSG2(_("E307: %s does not look like a Vim swap file"), mfp->mf_fname);
996 goto theend;
997 }
998 if (b0_magic_wrong(b0p))
999 {
1000 msg_start();
1001 msg_outtrans_attr(mfp->mf_fname, attr | MSG_HIST);
1002#if defined(MSDOS) || defined(MSWIN)
1003 if (STRNCMP(b0p->b0_hname, "PC ", 3) == 0)
1004 MSG_PUTS_ATTR(_(" cannot be used with this version of Vim.\n"),
1005 attr | MSG_HIST);
1006 else
1007#endif
1008 MSG_PUTS_ATTR(_(" cannot be used on this computer.\n"),
1009 attr | MSG_HIST);
1010 MSG_PUTS_ATTR(_("The file was created on "), attr | MSG_HIST);
1011 /* avoid going past the end of a currupted hostname */
1012 b0p->b0_fname[0] = NUL;
1013 MSG_PUTS_ATTR(b0p->b0_hname, attr | MSG_HIST);
1014 MSG_PUTS_ATTR(_(",\nor the file has been damaged."), attr | MSG_HIST);
1015 msg_end();
1016 goto theend;
1017 }
1018 /*
1019 * If we guessed the wrong page size, we have to recalculate the
1020 * highest block number in the file.
1021 */
1022 if (mfp->mf_page_size != (unsigned)char_to_long(b0p->b0_page_size))
1023 {
1024 mf_new_page_size(mfp, (unsigned)char_to_long(b0p->b0_page_size));
1025 if ((size = lseek(mfp->mf_fd, (off_t)0L, SEEK_END)) <= 0)
1026 mfp->mf_blocknr_max = 0; /* no file or empty file */
1027 else
1028 mfp->mf_blocknr_max = (blocknr_T)(size / mfp->mf_page_size);
1029 mfp->mf_infile_count = mfp->mf_blocknr_max;
1030 }
1031
1032/*
1033 * If .swp file name given directly, use name from swap file for buffer.
1034 */
1035 if (directly)
1036 {
1037 expand_env(b0p->b0_fname, NameBuff, MAXPATHL);
1038 if (setfname(curbuf, NameBuff, NULL, TRUE) == FAIL)
1039 goto theend;
1040 }
1041
1042 home_replace(NULL, mfp->mf_fname, NameBuff, MAXPATHL, TRUE);
Bram Moolenaar555b2802005-05-19 21:08:39 +00001043 smsg((char_u *)_("Using swap file \"%s\""), NameBuff);
Bram Moolenaar071d4272004-06-13 20:20:40 +00001044
1045 if (buf_spname(curbuf) != NULL)
1046 STRCPY(NameBuff, buf_spname(curbuf));
1047 else
1048 home_replace(NULL, curbuf->b_ffname, NameBuff, MAXPATHL, TRUE);
Bram Moolenaar555b2802005-05-19 21:08:39 +00001049 smsg((char_u *)_("Original file \"%s\""), NameBuff);
Bram Moolenaar071d4272004-06-13 20:20:40 +00001050 msg_putchar('\n');
1051
1052/*
1053 * check date of swap file and original file
1054 */
1055 mtime = char_to_long(b0p->b0_mtime);
1056 if (curbuf->b_ffname != NULL
1057 && mch_stat((char *)curbuf->b_ffname, &org_stat) != -1
1058 && ((mch_stat((char *)mfp->mf_fname, &swp_stat) != -1
1059 && org_stat.st_mtime > swp_stat.st_mtime)
1060 || org_stat.st_mtime != mtime))
1061 {
1062 EMSG(_("E308: Warning: Original file may have been changed"));
1063 }
1064 out_flush();
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001065
1066 /* Get the 'fileformat' and 'fileencoding' from block zero. */
1067 b0_ff = (b0p->b0_flags & B0_FF_MASK);
1068 if (b0p->b0_flags & B0_HAS_FENC)
1069 {
1070 for (p = b0p->b0_fname + B0_FNAME_SIZE;
1071 p > b0p->b0_fname && p[-1] != NUL; --p)
1072 ;
Bram Moolenaara93fa7e2006-04-17 22:14:47 +00001073 b0_fenc = vim_strnsave(p, (int)(b0p->b0_fname + B0_FNAME_SIZE - p));
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001074 }
1075
Bram Moolenaar071d4272004-06-13 20:20:40 +00001076 mf_put(mfp, hp, FALSE, FALSE); /* release block 0 */
1077 hp = NULL;
1078
1079 /*
1080 * Now that we are sure that the file is going to be recovered, clear the
1081 * contents of the current buffer.
1082 */
1083 while (!(curbuf->b_ml.ml_flags & ML_EMPTY))
1084 ml_delete((linenr_T)1, FALSE);
1085
1086 /*
1087 * Try reading the original file to obtain the values of 'fileformat',
1088 * 'fileencoding', etc. Ignore errors. The text itself is not used.
1089 */
1090 if (curbuf->b_ffname != NULL)
1091 {
1092 (void)readfile(curbuf->b_ffname, NULL, (linenr_T)0,
1093 (linenr_T)0, (linenr_T)MAXLNUM, NULL, READ_NEW);
1094 while (!(curbuf->b_ml.ml_flags & ML_EMPTY))
1095 ml_delete((linenr_T)1, FALSE);
1096 }
1097
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001098 /* Use the 'fileformat' and 'fileencoding' as stored in the swap file. */
1099 if (b0_ff != 0)
1100 set_fileformat(b0_ff - 1, OPT_LOCAL);
1101 if (b0_fenc != NULL)
1102 {
1103 set_option_value((char_u *)"fenc", 0L, b0_fenc, OPT_LOCAL);
1104 vim_free(b0_fenc);
1105 }
1106 unchanged(curbuf, TRUE);
1107
Bram Moolenaar071d4272004-06-13 20:20:40 +00001108 bnum = 1; /* start with block 1 */
1109 page_count = 1; /* which is 1 page */
1110 lnum = 0; /* append after line 0 in curbuf */
1111 line_count = 0;
1112 idx = 0; /* start with first index in block 1 */
1113 error = 0;
1114 buf->b_ml.ml_stack_top = 0;
1115 buf->b_ml.ml_stack = NULL;
1116 buf->b_ml.ml_stack_size = 0; /* no stack yet */
1117
1118 if (curbuf->b_ffname == NULL)
1119 cannot_open = TRUE;
1120 else
1121 cannot_open = FALSE;
1122
1123 serious_error = FALSE;
1124 for ( ; !got_int; line_breakcheck())
1125 {
1126 if (hp != NULL)
1127 mf_put(mfp, hp, FALSE, FALSE); /* release previous block */
1128
1129 /*
1130 * get block
1131 */
1132 if ((hp = mf_get(mfp, (blocknr_T)bnum, page_count)) == NULL)
1133 {
1134 if (bnum == 1)
1135 {
1136 EMSG2(_("E309: Unable to read block 1 from %s"), mfp->mf_fname);
1137 goto theend;
1138 }
1139 ++error;
1140 ml_append(lnum++, (char_u *)_("???MANY LINES MISSING"),
1141 (colnr_T)0, TRUE);
1142 }
1143 else /* there is a block */
1144 {
1145 pp = (PTR_BL *)(hp->bh_data);
1146 if (pp->pb_id == PTR_ID) /* it is a pointer block */
1147 {
1148 /* check line count when using pointer block first time */
1149 if (idx == 0 && line_count != 0)
1150 {
1151 for (i = 0; i < (int)pp->pb_count; ++i)
1152 line_count -= pp->pb_pointer[i].pe_line_count;
1153 if (line_count != 0)
1154 {
1155 ++error;
1156 ml_append(lnum++, (char_u *)_("???LINE COUNT WRONG"),
1157 (colnr_T)0, TRUE);
1158 }
1159 }
1160
1161 if (pp->pb_count == 0)
1162 {
1163 ml_append(lnum++, (char_u *)_("???EMPTY BLOCK"),
1164 (colnr_T)0, TRUE);
1165 ++error;
1166 }
1167 else if (idx < (int)pp->pb_count) /* go a block deeper */
1168 {
1169 if (pp->pb_pointer[idx].pe_bnum < 0)
1170 {
1171 /*
1172 * Data block with negative block number.
1173 * Try to read lines from the original file.
1174 * This is slow, but it works.
1175 */
1176 if (!cannot_open)
1177 {
1178 line_count = pp->pb_pointer[idx].pe_line_count;
1179 if (readfile(curbuf->b_ffname, NULL, lnum,
1180 pp->pb_pointer[idx].pe_old_lnum - 1,
1181 line_count, NULL, 0) == FAIL)
1182 cannot_open = TRUE;
1183 else
1184 lnum += line_count;
1185 }
1186 if (cannot_open)
1187 {
1188 ++error;
1189 ml_append(lnum++, (char_u *)_("???LINES MISSING"),
1190 (colnr_T)0, TRUE);
1191 }
1192 ++idx; /* get same block again for next index */
1193 continue;
1194 }
1195
1196 /*
1197 * going one block deeper in the tree
1198 */
1199 if ((top = ml_add_stack(buf)) < 0) /* new entry in stack */
1200 {
1201 ++error;
1202 break; /* out of memory */
1203 }
1204 ip = &(buf->b_ml.ml_stack[top]);
1205 ip->ip_bnum = bnum;
1206 ip->ip_index = idx;
1207
1208 bnum = pp->pb_pointer[idx].pe_bnum;
1209 line_count = pp->pb_pointer[idx].pe_line_count;
1210 page_count = pp->pb_pointer[idx].pe_page_count;
1211 continue;
1212 }
1213 }
1214 else /* not a pointer block */
1215 {
1216 dp = (DATA_BL *)(hp->bh_data);
1217 if (dp->db_id != DATA_ID) /* block id wrong */
1218 {
1219 if (bnum == 1)
1220 {
1221 EMSG2(_("E310: Block 1 ID wrong (%s not a .swp file?)"),
1222 mfp->mf_fname);
1223 goto theend;
1224 }
1225 ++error;
1226 ml_append(lnum++, (char_u *)_("???BLOCK MISSING"),
1227 (colnr_T)0, TRUE);
1228 }
1229 else
1230 {
1231 /*
1232 * it is a data block
1233 * Append all the lines in this block
1234 */
1235 has_error = FALSE;
1236 /*
1237 * check length of block
1238 * if wrong, use length in pointer block
1239 */
1240 if (page_count * mfp->mf_page_size != dp->db_txt_end)
1241 {
1242 ml_append(lnum++, (char_u *)_("??? from here until ???END lines may be messed up"),
1243 (colnr_T)0, TRUE);
1244 ++error;
1245 has_error = TRUE;
1246 dp->db_txt_end = page_count * mfp->mf_page_size;
1247 }
1248
1249 /* make sure there is a NUL at the end of the block */
1250 *((char_u *)dp + dp->db_txt_end - 1) = NUL;
1251
1252 /*
1253 * check number of lines in block
1254 * if wrong, use count in data block
1255 */
1256 if (line_count != dp->db_line_count)
1257 {
1258 ml_append(lnum++, (char_u *)_("??? from here until ???END lines may have been inserted/deleted"),
1259 (colnr_T)0, TRUE);
1260 ++error;
1261 has_error = TRUE;
1262 }
1263
1264 for (i = 0; i < dp->db_line_count; ++i)
1265 {
1266 txt_start = (dp->db_index[i] & DB_INDEX_MASK);
1267 if (txt_start <= HEADER_SIZE
1268 || txt_start >= (int)dp->db_txt_end)
1269 {
1270 p = (char_u *)"???";
1271 ++error;
1272 }
1273 else
1274 p = (char_u *)dp + txt_start;
1275 ml_append(lnum++, p, (colnr_T)0, TRUE);
1276 }
1277 if (has_error)
1278 ml_append(lnum++, (char_u *)_("???END"), (colnr_T)0, TRUE);
1279 }
1280 }
1281 }
1282
1283 if (buf->b_ml.ml_stack_top == 0) /* finished */
1284 break;
1285
1286 /*
1287 * go one block up in the tree
1288 */
1289 ip = &(buf->b_ml.ml_stack[--(buf->b_ml.ml_stack_top)]);
1290 bnum = ip->ip_bnum;
1291 idx = ip->ip_index + 1; /* go to next index */
1292 page_count = 1;
1293 }
1294
1295 /*
1296 * The dummy line from the empty buffer will now be after the last line in
1297 * the buffer. Delete it.
1298 */
1299 ml_delete(curbuf->b_ml.ml_line_count, FALSE);
1300 curbuf->b_flags |= BF_RECOVERED;
1301
1302 recoverymode = FALSE;
1303 if (got_int)
1304 EMSG(_("E311: Recovery Interrupted"));
1305 else if (error)
1306 {
1307 ++no_wait_return;
1308 MSG(">>>>>>>>>>>>>");
1309 EMSG(_("E312: Errors detected while recovering; look for lines starting with ???"));
1310 --no_wait_return;
1311 MSG(_("See \":help E312\" for more information."));
1312 MSG(">>>>>>>>>>>>>");
1313 }
1314 else
1315 {
1316 MSG(_("Recovery completed. You should check if everything is OK."));
1317 MSG_PUTS(_("\n(You might want to write out this file under another name\n"));
1318 MSG_PUTS(_("and run diff with the original file to check for changes)\n"));
1319 MSG_PUTS(_("Delete the .swp file afterwards.\n\n"));
1320 cmdline_row = msg_row;
1321 }
1322 redraw_curbuf_later(NOT_VALID);
1323
1324theend:
1325 recoverymode = FALSE;
1326 if (mfp != NULL)
1327 {
1328 if (hp != NULL)
1329 mf_put(mfp, hp, FALSE, FALSE);
1330 mf_close(mfp, FALSE); /* will also vim_free(mfp->mf_fname) */
1331 }
1332 vim_free(buf);
1333 if (serious_error && called_from_main)
1334 ml_close(curbuf, TRUE);
1335#ifdef FEAT_AUTOCMD
1336 else
1337 {
1338 apply_autocmds(EVENT_BUFREADPOST, NULL, curbuf->b_fname, FALSE, curbuf);
1339 apply_autocmds(EVENT_BUFWINENTER, NULL, curbuf->b_fname, FALSE, curbuf);
1340 }
1341#endif
1342 return;
1343}
1344
1345/*
1346 * Find the names of swap files in current directory and the directory given
1347 * with the 'directory' option.
1348 *
1349 * Used to:
1350 * - list the swap files for "vim -r"
1351 * - count the number of swap files when recovering
1352 * - list the swap files when recovering
1353 * - find the name of the n'th swap file when recovering
1354 */
1355 int
1356recover_names(fname, list, nr)
1357 char_u **fname; /* base for swap file name */
1358 int list; /* when TRUE, list the swap file names */
1359 int nr; /* when non-zero, return nr'th swap file name */
1360{
1361 int num_names;
1362 char_u *(names[6]);
1363 char_u *tail;
1364 char_u *p;
1365 int num_files;
1366 int file_count = 0;
1367 char_u **files;
1368 int i;
1369 char_u *dirp;
1370 char_u *dir_name;
1371
1372 if (list)
1373 {
1374 /* use msg() to start the scrolling properly */
1375 msg((char_u *)_("Swap files found:"));
1376 msg_putchar('\n');
1377 }
1378
1379 /*
1380 * Do the loop for every directory in 'directory'.
1381 * First allocate some memory to put the directory name in.
1382 */
1383 dir_name = alloc((unsigned)STRLEN(p_dir) + 1);
1384 dirp = p_dir;
1385 while (dir_name != NULL && *dirp)
1386 {
1387 /*
1388 * Isolate a directory name from *dirp and put it in dir_name (we know
1389 * it is large enough, so use 31000 for length).
1390 * Advance dirp to next directory name.
1391 */
1392 (void)copy_option_part(&dirp, dir_name, 31000, ",");
1393
1394 if (dir_name[0] == '.' && dir_name[1] == NUL) /* check current dir */
1395 {
1396 if (fname == NULL || *fname == NULL)
1397 {
1398#ifdef VMS
1399 names[0] = vim_strsave((char_u *)"*_sw%");
1400#else
1401# ifdef RISCOS
1402 names[0] = vim_strsave((char_u *)"*_sw#");
1403# else
1404 names[0] = vim_strsave((char_u *)"*.sw?");
1405# endif
1406#endif
Bram Moolenaar2cc93182006-10-10 19:56:03 +00001407#if defined(UNIX) || defined(WIN3264)
1408 /* For Unix names starting with a dot are special. MS-Windows
1409 * supports this too, on some file systems. */
Bram Moolenaar071d4272004-06-13 20:20:40 +00001410 names[1] = vim_strsave((char_u *)".*.sw?");
1411 names[2] = vim_strsave((char_u *)".sw?");
1412 num_names = 3;
1413#else
1414# ifdef VMS
1415 names[1] = vim_strsave((char_u *)".*_sw%");
1416 num_names = 2;
1417# else
1418 num_names = 1;
1419# endif
1420#endif
1421 }
1422 else
1423 num_names = recov_file_names(names, *fname, TRUE);
1424 }
1425 else /* check directory dir_name */
1426 {
1427 if (fname == NULL || *fname == NULL)
1428 {
1429#ifdef VMS
1430 names[0] = concat_fnames(dir_name, (char_u *)"*_sw%", TRUE);
1431#else
1432# ifdef RISCOS
1433 names[0] = concat_fnames(dir_name, (char_u *)"*_sw#", TRUE);
1434# else
1435 names[0] = concat_fnames(dir_name, (char_u *)"*.sw?", TRUE);
1436# endif
1437#endif
Bram Moolenaar2cc93182006-10-10 19:56:03 +00001438#if defined(UNIX) || defined(WIN3264)
1439 /* For Unix names starting with a dot are special. MS-Windows
1440 * supports this too, on some file systems. */
Bram Moolenaar071d4272004-06-13 20:20:40 +00001441 names[1] = concat_fnames(dir_name, (char_u *)".*.sw?", TRUE);
1442 names[2] = concat_fnames(dir_name, (char_u *)".sw?", TRUE);
1443 num_names = 3;
1444#else
1445# ifdef VMS
1446 names[1] = concat_fnames(dir_name, (char_u *)".*_sw%", TRUE);
1447 num_names = 2;
1448# else
1449 num_names = 1;
1450# endif
1451#endif
1452 }
1453 else
1454 {
1455#if defined(UNIX) || defined(WIN3264)
1456 p = dir_name + STRLEN(dir_name);
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001457 if (after_pathsep(dir_name, p) && p[-1] == p[-2])
Bram Moolenaar071d4272004-06-13 20:20:40 +00001458 {
1459 /* Ends with '//', Use Full path for swap name */
1460 tail = make_percent_swname(dir_name, *fname);
1461 }
1462 else
1463#endif
1464 {
1465 tail = gettail(*fname);
1466 tail = concat_fnames(dir_name, tail, TRUE);
1467 }
1468 if (tail == NULL)
1469 num_names = 0;
1470 else
1471 {
1472 num_names = recov_file_names(names, tail, FALSE);
1473 vim_free(tail);
1474 }
1475 }
1476 }
1477
1478 /* check for out-of-memory */
1479 for (i = 0; i < num_names; ++i)
1480 {
1481 if (names[i] == NULL)
1482 {
1483 for (i = 0; i < num_names; ++i)
1484 vim_free(names[i]);
1485 num_names = 0;
1486 }
1487 }
1488 if (num_names == 0)
1489 num_files = 0;
1490 else if (expand_wildcards(num_names, names, &num_files, &files,
1491 EW_KEEPALL|EW_FILE|EW_SILENT) == FAIL)
1492 num_files = 0;
1493
1494 /*
1495 * When no swap file found, wildcard expansion might have failed (e.g.
1496 * not able to execute the shell).
1497 * Try finding a swap file by simply adding ".swp" to the file name.
1498 */
1499 if (*dirp == NUL && file_count + num_files == 0
1500 && fname != NULL && *fname != NULL)
1501 {
1502 struct stat st;
1503 char_u *swapname;
1504
1505#if defined(VMS) || defined(RISCOS)
1506 swapname = modname(*fname, (char_u *)"_swp", FALSE);
1507#else
1508 swapname = modname(*fname, (char_u *)".swp", TRUE);
1509#endif
1510 if (swapname != NULL)
1511 {
1512 if (mch_stat((char *)swapname, &st) != -1) /* It exists! */
1513 {
1514 files = (char_u **)alloc((unsigned)sizeof(char_u *));
1515 if (files != NULL)
1516 {
1517 files[0] = swapname;
1518 swapname = NULL;
1519 num_files = 1;
1520 }
1521 }
1522 vim_free(swapname);
1523 }
1524 }
1525
1526 /*
1527 * remove swapfile name of the current buffer, it must be ignored
1528 */
1529 if (curbuf->b_ml.ml_mfp != NULL
1530 && (p = curbuf->b_ml.ml_mfp->mf_fname) != NULL)
1531 {
1532 for (i = 0; i < num_files; ++i)
1533 if (fullpathcmp(p, files[i], TRUE) & FPC_SAME)
1534 {
1535 vim_free(files[i]);
1536 --num_files;
1537 for ( ; i < num_files; ++i)
1538 files[i] = files[i + 1];
1539 }
1540 }
Bram Moolenaarfc1421e2006-04-20 22:17:20 +00001541 if (nr > 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00001542 {
1543 file_count += num_files;
1544 if (nr <= file_count)
1545 {
1546 *fname = vim_strsave(files[nr - 1 + num_files - file_count]);
1547 dirp = (char_u *)""; /* stop searching */
1548 }
1549 }
1550 else if (list)
1551 {
1552 if (dir_name[0] == '.' && dir_name[1] == NUL)
1553 {
1554 if (fname == NULL || *fname == NULL)
1555 MSG_PUTS(_(" In current directory:\n"));
1556 else
1557 MSG_PUTS(_(" Using specified name:\n"));
1558 }
1559 else
1560 {
1561 MSG_PUTS(_(" In directory "));
1562 msg_home_replace(dir_name);
1563 MSG_PUTS(":\n");
1564 }
1565
1566 if (num_files)
1567 {
1568 for (i = 0; i < num_files; ++i)
1569 {
1570 /* print the swap file name */
1571 msg_outnum((long)++file_count);
1572 MSG_PUTS(". ");
1573 msg_puts(gettail(files[i]));
1574 msg_putchar('\n');
1575 (void)swapfile_info(files[i]);
1576 }
1577 }
1578 else
1579 MSG_PUTS(_(" -- none --\n"));
1580 out_flush();
1581 }
1582 else
1583 file_count += num_files;
1584
1585 for (i = 0; i < num_names; ++i)
1586 vim_free(names[i]);
Bram Moolenaarfc1421e2006-04-20 22:17:20 +00001587 if (num_files > 0)
1588 FreeWild(num_files, files);
Bram Moolenaar071d4272004-06-13 20:20:40 +00001589 }
1590 vim_free(dir_name);
1591 return file_count;
1592}
1593
1594#if defined(UNIX) || defined(WIN3264) /* Need _very_ long file names */
1595/*
1596 * Append the full path to name with path separators made into percent
1597 * signs, to dir. An unnamed buffer is handled as "" (<currentdir>/"")
1598 */
1599 static char_u *
1600make_percent_swname(dir, name)
1601 char_u *dir;
1602 char_u *name;
1603{
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001604 char_u *d, *s, *f;
Bram Moolenaar071d4272004-06-13 20:20:40 +00001605
1606 f = fix_fname(name != NULL ? name : (char_u *) "");
1607 d = NULL;
1608 if (f != NULL)
1609 {
1610 s = alloc((unsigned)(STRLEN(f) + 1));
1611 if (s != NULL)
1612 {
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001613 STRCPY(s, f);
1614 for (d = s; *d != NUL; mb_ptr_adv(d))
1615 if (vim_ispathsep(*d))
1616 *d = '%';
Bram Moolenaar071d4272004-06-13 20:20:40 +00001617 d = concat_fnames(dir, s, TRUE);
1618 vim_free(s);
1619 }
1620 vim_free(f);
1621 }
1622 return d;
1623}
1624#endif
1625
1626#if (defined(UNIX) || defined(__EMX__) || defined(VMS)) && (defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG))
1627static int process_still_running;
1628#endif
1629
1630/*
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00001631 * Give information about an existing swap file.
Bram Moolenaar071d4272004-06-13 20:20:40 +00001632 * Returns timestamp (0 when unknown).
1633 */
1634 static time_t
1635swapfile_info(fname)
1636 char_u *fname;
1637{
1638 struct stat st;
1639 int fd;
1640 struct block0 b0;
1641 time_t x = (time_t)0;
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00001642 char *p;
Bram Moolenaar071d4272004-06-13 20:20:40 +00001643#ifdef UNIX
1644 char_u uname[B0_UNAME_SIZE];
1645#endif
1646
1647 /* print the swap file date */
1648 if (mch_stat((char *)fname, &st) != -1)
1649 {
1650#ifdef UNIX
1651 /* print name of owner of the file */
1652 if (mch_get_uname(st.st_uid, uname, B0_UNAME_SIZE) == OK)
1653 {
1654 MSG_PUTS(_(" owned by: "));
1655 msg_outtrans(uname);
1656 MSG_PUTS(_(" dated: "));
1657 }
1658 else
1659#endif
1660 MSG_PUTS(_(" dated: "));
1661 x = st.st_mtime; /* Manx C can't do &st.st_mtime */
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00001662 p = ctime(&x); /* includes '\n' */
1663 if (p == NULL)
1664 MSG_PUTS("(invalid)\n");
1665 else
1666 MSG_PUTS(p);
Bram Moolenaar071d4272004-06-13 20:20:40 +00001667 }
1668
1669 /*
1670 * print the original file name
1671 */
1672 fd = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
1673 if (fd >= 0)
1674 {
1675 if (read(fd, (char *)&b0, sizeof(b0)) == sizeof(b0))
1676 {
1677 if (STRNCMP(b0.b0_version, "VIM 3.0", 7) == 0)
1678 {
1679 MSG_PUTS(_(" [from Vim version 3.0]"));
1680 }
1681 else if (b0.b0_id[0] != BLOCK0_ID0 || b0.b0_id[1] != BLOCK0_ID1)
1682 {
1683 MSG_PUTS(_(" [does not look like a Vim swap file]"));
1684 }
1685 else
1686 {
1687 MSG_PUTS(_(" file name: "));
1688 if (b0.b0_fname[0] == NUL)
Bram Moolenaar69a7cb42004-06-20 12:51:53 +00001689 MSG_PUTS(_("[No Name]"));
Bram Moolenaar071d4272004-06-13 20:20:40 +00001690 else
1691 msg_outtrans(b0.b0_fname);
1692
1693 MSG_PUTS(_("\n modified: "));
1694 MSG_PUTS(b0.b0_dirty ? _("YES") : _("no"));
1695
1696 if (*(b0.b0_uname) != NUL)
1697 {
1698 MSG_PUTS(_("\n user name: "));
1699 msg_outtrans(b0.b0_uname);
1700 }
1701
1702 if (*(b0.b0_hname) != NUL)
1703 {
1704 if (*(b0.b0_uname) != NUL)
1705 MSG_PUTS(_(" host name: "));
1706 else
1707 MSG_PUTS(_("\n host name: "));
1708 msg_outtrans(b0.b0_hname);
1709 }
1710
1711 if (char_to_long(b0.b0_pid) != 0L)
1712 {
1713 MSG_PUTS(_("\n process ID: "));
1714 msg_outnum(char_to_long(b0.b0_pid));
1715#if defined(UNIX) || defined(__EMX__)
1716 /* EMX kill() not working correctly, it seems */
1717 if (kill((pid_t)char_to_long(b0.b0_pid), 0) == 0)
1718 {
1719 MSG_PUTS(_(" (still running)"));
1720# if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)
1721 process_still_running = TRUE;
1722# endif
1723 }
1724#endif
1725 }
1726
1727 if (b0_magic_wrong(&b0))
1728 {
1729#if defined(MSDOS) || defined(MSWIN)
1730 if (STRNCMP(b0.b0_hname, "PC ", 3) == 0)
1731 MSG_PUTS(_("\n [not usable with this version of Vim]"));
1732 else
1733#endif
1734 MSG_PUTS(_("\n [not usable on this computer]"));
1735 }
1736 }
1737 }
1738 else
1739 MSG_PUTS(_(" [cannot be read]"));
1740 close(fd);
1741 }
1742 else
1743 MSG_PUTS(_(" [cannot be opened]"));
1744 msg_putchar('\n');
1745
1746 return x;
1747}
1748
1749 static int
1750recov_file_names(names, path, prepend_dot)
1751 char_u **names;
1752 char_u *path;
1753 int prepend_dot;
1754{
1755 int num_names;
1756
1757#ifdef SHORT_FNAME
1758 /*
1759 * (MS-DOS) always short names
1760 */
1761 names[0] = modname(path, (char_u *)".sw?", FALSE);
1762 num_names = 1;
1763#else /* !SHORT_FNAME */
1764 /*
1765 * (Win32 and Win64) never short names, but do prepend a dot.
1766 * (Not MS-DOS or Win32 or Win64) maybe short name, maybe not: Try both.
1767 * Only use the short name if it is different.
1768 */
1769 char_u *p;
1770 int i;
1771# ifndef WIN3264
1772 int shortname = curbuf->b_shortname;
1773
1774 curbuf->b_shortname = FALSE;
1775# endif
1776
1777 num_names = 0;
1778
1779 /*
1780 * May also add the file name with a dot prepended, for swap file in same
1781 * dir as original file.
1782 */
1783 if (prepend_dot)
1784 {
1785 names[num_names] = modname(path, (char_u *)".sw?", TRUE);
1786 if (names[num_names] == NULL)
1787 goto end;
1788 ++num_names;
1789 }
1790
1791 /*
1792 * Form the normal swap file name pattern by appending ".sw?".
1793 */
1794#ifdef VMS
1795 names[num_names] = concat_fnames(path, (char_u *)"_sw%", FALSE);
1796#else
1797# ifdef RISCOS
1798 names[num_names] = concat_fnames(path, (char_u *)"_sw#", FALSE);
1799# else
1800 names[num_names] = concat_fnames(path, (char_u *)".sw?", FALSE);
1801# endif
1802#endif
1803 if (names[num_names] == NULL)
1804 goto end;
1805 if (num_names >= 1) /* check if we have the same name twice */
1806 {
1807 p = names[num_names - 1];
1808 i = (int)STRLEN(names[num_names - 1]) - (int)STRLEN(names[num_names]);
1809 if (i > 0)
1810 p += i; /* file name has been expanded to full path */
1811
1812 if (STRCMP(p, names[num_names]) != 0)
1813 ++num_names;
1814 else
1815 vim_free(names[num_names]);
1816 }
1817 else
1818 ++num_names;
1819
1820# ifndef WIN3264
1821 /*
1822 * Also try with 'shortname' set, in case the file is on a DOS filesystem.
1823 */
1824 curbuf->b_shortname = TRUE;
1825#ifdef VMS
1826 names[num_names] = modname(path, (char_u *)"_sw%", FALSE);
1827#else
1828# ifdef RISCOS
1829 names[num_names] = modname(path, (char_u *)"_sw#", FALSE);
1830# else
1831 names[num_names] = modname(path, (char_u *)".sw?", FALSE);
1832# endif
1833#endif
1834 if (names[num_names] == NULL)
1835 goto end;
1836
1837 /*
1838 * Remove the one from 'shortname', if it's the same as with 'noshortname'.
1839 */
1840 p = names[num_names];
1841 i = STRLEN(names[num_names]) - STRLEN(names[num_names - 1]);
1842 if (i > 0)
1843 p += i; /* file name has been expanded to full path */
1844 if (STRCMP(names[num_names - 1], p) == 0)
1845 vim_free(names[num_names]);
1846 else
1847 ++num_names;
1848# endif
1849
1850end:
1851# ifndef WIN3264
1852 curbuf->b_shortname = shortname;
1853# endif
1854
1855#endif /* !SHORT_FNAME */
1856
1857 return num_names;
1858}
1859
1860/*
1861 * sync all memlines
1862 *
1863 * If 'check_file' is TRUE, check if original file exists and was not changed.
1864 * If 'check_char' is TRUE, stop syncing when character becomes available, but
1865 * always sync at least one block.
1866 */
1867 void
1868ml_sync_all(check_file, check_char)
1869 int check_file;
1870 int check_char;
1871{
1872 buf_T *buf;
1873 struct stat st;
1874
1875 for (buf = firstbuf; buf != NULL; buf = buf->b_next)
1876 {
1877 if (buf->b_ml.ml_mfp == NULL || buf->b_ml.ml_mfp->mf_fname == NULL)
1878 continue; /* no file */
1879
1880 ml_flush_line(buf); /* flush buffered line */
1881 /* flush locked block */
1882 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH);
1883 if (bufIsChanged(buf) && check_file && mf_need_trans(buf->b_ml.ml_mfp)
1884 && buf->b_ffname != NULL)
1885 {
1886 /*
1887 * If the original file does not exist anymore or has been changed
1888 * call ml_preserve() to get rid of all negative numbered blocks.
1889 */
1890 if (mch_stat((char *)buf->b_ffname, &st) == -1
1891 || st.st_mtime != buf->b_mtime_read
1892 || (size_t)st.st_size != buf->b_orig_size)
1893 {
1894 ml_preserve(buf, FALSE);
1895 did_check_timestamps = FALSE;
1896 need_check_timestamps = TRUE; /* give message later */
1897 }
1898 }
1899 if (buf->b_ml.ml_mfp->mf_dirty)
1900 {
1901 (void)mf_sync(buf->b_ml.ml_mfp, (check_char ? MFS_STOP : 0)
1902 | (bufIsChanged(buf) ? MFS_FLUSH : 0));
1903 if (check_char && ui_char_avail()) /* character available now */
1904 break;
1905 }
1906 }
1907}
1908
1909/*
1910 * sync one buffer, including negative blocks
1911 *
1912 * after this all the blocks are in the swap file
1913 *
1914 * Used for the :preserve command and when the original file has been
1915 * changed or deleted.
1916 *
1917 * when message is TRUE the success of preserving is reported
1918 */
1919 void
1920ml_preserve(buf, message)
1921 buf_T *buf;
1922 int message;
1923{
1924 bhdr_T *hp;
1925 linenr_T lnum;
1926 memfile_T *mfp = buf->b_ml.ml_mfp;
1927 int status;
1928 int got_int_save = got_int;
1929
1930 if (mfp == NULL || mfp->mf_fname == NULL)
1931 {
1932 if (message)
1933 EMSG(_("E313: Cannot preserve, there is no swap file"));
1934 return;
1935 }
1936
1937 /* We only want to stop when interrupted here, not when interrupted
1938 * before. */
1939 got_int = FALSE;
1940
1941 ml_flush_line(buf); /* flush buffered line */
1942 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush locked block */
1943 status = mf_sync(mfp, MFS_ALL | MFS_FLUSH);
1944
1945 /* stack is invalid after mf_sync(.., MFS_ALL) */
1946 buf->b_ml.ml_stack_top = 0;
1947
1948 /*
1949 * Some of the data blocks may have been changed from negative to
1950 * positive block number. In that case the pointer blocks need to be
1951 * updated.
1952 *
1953 * We don't know in which pointer block the references are, so we visit
1954 * all data blocks until there are no more translations to be done (or
1955 * we hit the end of the file, which can only happen in case a write fails,
1956 * e.g. when file system if full).
1957 * ml_find_line() does the work by translating the negative block numbers
1958 * when getting the first line of each data block.
1959 */
1960 if (mf_need_trans(mfp) && !got_int)
1961 {
1962 lnum = 1;
1963 while (mf_need_trans(mfp) && lnum <= buf->b_ml.ml_line_count)
1964 {
1965 hp = ml_find_line(buf, lnum, ML_FIND);
1966 if (hp == NULL)
1967 {
1968 status = FAIL;
1969 goto theend;
1970 }
1971 CHECK(buf->b_ml.ml_locked_low != lnum, "low != lnum");
1972 lnum = buf->b_ml.ml_locked_high + 1;
1973 }
1974 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush locked block */
1975 /* sync the updated pointer blocks */
1976 if (mf_sync(mfp, MFS_ALL | MFS_FLUSH) == FAIL)
1977 status = FAIL;
1978 buf->b_ml.ml_stack_top = 0; /* stack is invalid now */
1979 }
1980theend:
1981 got_int |= got_int_save;
1982
1983 if (message)
1984 {
1985 if (status == OK)
1986 MSG(_("File preserved"));
1987 else
1988 EMSG(_("E314: Preserve failed"));
1989 }
1990}
1991
1992/*
1993 * NOTE: The pointer returned by the ml_get_*() functions only remains valid
1994 * until the next call!
1995 * line1 = ml_get(1);
1996 * line2 = ml_get(2); // line1 is now invalid!
1997 * Make a copy of the line if necessary.
1998 */
1999/*
2000 * get a pointer to a (read-only copy of a) line
2001 *
2002 * On failure an error message is given and IObuff is returned (to avoid
2003 * having to check for error everywhere).
2004 */
2005 char_u *
2006ml_get(lnum)
2007 linenr_T lnum;
2008{
2009 return ml_get_buf(curbuf, lnum, FALSE);
2010}
2011
2012/*
2013 * ml_get_pos: get pointer to position 'pos'
2014 */
2015 char_u *
2016ml_get_pos(pos)
2017 pos_T *pos;
2018{
2019 return (ml_get_buf(curbuf, pos->lnum, FALSE) + pos->col);
2020}
2021
2022/*
2023 * ml_get_curline: get pointer to cursor line.
2024 */
2025 char_u *
2026ml_get_curline()
2027{
2028 return ml_get_buf(curbuf, curwin->w_cursor.lnum, FALSE);
2029}
2030
2031/*
2032 * ml_get_cursor: get pointer to cursor position
2033 */
2034 char_u *
2035ml_get_cursor()
2036{
2037 return (ml_get_buf(curbuf, curwin->w_cursor.lnum, FALSE) +
2038 curwin->w_cursor.col);
2039}
2040
2041/*
2042 * get a pointer to a line in a specific buffer
2043 *
2044 * "will_change": if TRUE mark the buffer dirty (chars in the line will be
2045 * changed)
2046 */
2047 char_u *
2048ml_get_buf(buf, lnum, will_change)
2049 buf_T *buf;
2050 linenr_T lnum;
2051 int will_change; /* line will be changed */
2052{
2053 bhdr_T *hp;
2054 DATA_BL *dp;
2055 char_u *ptr;
2056
2057 if (lnum > buf->b_ml.ml_line_count) /* invalid line number */
2058 {
2059 EMSGN(_("E315: ml_get: invalid lnum: %ld"), lnum);
2060errorret:
2061 STRCPY(IObuff, "???");
2062 return IObuff;
2063 }
2064 if (lnum <= 0) /* pretend line 0 is line 1 */
2065 lnum = 1;
2066
2067 if (buf->b_ml.ml_mfp == NULL) /* there are no lines */
2068 return (char_u *)"";
2069
2070/*
2071 * See if it is the same line as requested last time.
2072 * Otherwise may need to flush last used line.
2073 */
2074 if (buf->b_ml.ml_line_lnum != lnum)
2075 {
2076 ml_flush_line(buf);
2077
2078 /*
2079 * Find the data block containing the line.
2080 * This also fills the stack with the blocks from the root to the data
2081 * block and releases any locked block.
2082 */
2083 if ((hp = ml_find_line(buf, lnum, ML_FIND)) == NULL)
2084 {
2085 EMSGN(_("E316: ml_get: cannot find line %ld"), lnum);
2086 goto errorret;
2087 }
2088
2089 dp = (DATA_BL *)(hp->bh_data);
2090
2091 ptr = (char_u *)dp + ((dp->db_index[lnum - buf->b_ml.ml_locked_low]) & DB_INDEX_MASK);
2092 buf->b_ml.ml_line_ptr = ptr;
2093 buf->b_ml.ml_line_lnum = lnum;
2094 buf->b_ml.ml_flags &= ~ML_LINE_DIRTY;
2095 }
2096 if (will_change)
2097 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
2098
2099 return buf->b_ml.ml_line_ptr;
2100}
2101
2102/*
2103 * Check if a line that was just obtained by a call to ml_get
2104 * is in allocated memory.
2105 */
2106 int
2107ml_line_alloced()
2108{
2109 return (curbuf->b_ml.ml_flags & ML_LINE_DIRTY);
2110}
2111
2112/*
2113 * Append a line after lnum (may be 0 to insert a line in front of the file).
2114 * "line" does not need to be allocated, but can't be another line in a
2115 * buffer, unlocking may make it invalid.
2116 *
2117 * newfile: TRUE when starting to edit a new file, meaning that pe_old_lnum
2118 * will be set for recovery
2119 * Check: The caller of this function should probably also call
2120 * appended_lines().
2121 *
2122 * return FAIL for failure, OK otherwise
2123 */
2124 int
2125ml_append(lnum, line, len, newfile)
2126 linenr_T lnum; /* append after this line (can be 0) */
2127 char_u *line; /* text of the new line */
2128 colnr_T len; /* length of new line, including NUL, or 0 */
2129 int newfile; /* flag, see above */
2130{
2131 /* When starting up, we might still need to create the memfile */
2132 if (curbuf->b_ml.ml_mfp == NULL && open_buffer(FALSE, NULL) == FAIL)
2133 return FAIL;
2134
2135 if (curbuf->b_ml.ml_line_lnum != 0)
2136 ml_flush_line(curbuf);
2137 return ml_append_int(curbuf, lnum, line, len, newfile, FALSE);
2138}
2139
Bram Moolenaara1956f62006-03-12 22:18:00 +00002140#if defined(FEAT_SPELL) || defined(PROTO)
Bram Moolenaar4770d092006-01-12 23:22:24 +00002141/*
2142 * Like ml_append() but for an arbitrary buffer. The buffer must already have
2143 * a memline.
2144 */
2145 int
2146ml_append_buf(buf, lnum, line, len, newfile)
2147 buf_T *buf;
2148 linenr_T lnum; /* append after this line (can be 0) */
2149 char_u *line; /* text of the new line */
2150 colnr_T len; /* length of new line, including NUL, or 0 */
2151 int newfile; /* flag, see above */
2152{
2153 if (buf->b_ml.ml_mfp == NULL)
2154 return FAIL;
2155
2156 if (buf->b_ml.ml_line_lnum != 0)
2157 ml_flush_line(buf);
2158 return ml_append_int(buf, lnum, line, len, newfile, FALSE);
2159}
2160#endif
2161
Bram Moolenaar071d4272004-06-13 20:20:40 +00002162 static int
2163ml_append_int(buf, lnum, line, len, newfile, mark)
2164 buf_T *buf;
2165 linenr_T lnum; /* append after this line (can be 0) */
2166 char_u *line; /* text of the new line */
2167 colnr_T len; /* length of line, including NUL, or 0 */
2168 int newfile; /* flag, see above */
2169 int mark; /* mark the new line */
2170{
2171 int i;
2172 int line_count; /* number of indexes in current block */
2173 int offset;
2174 int from, to;
2175 int space_needed; /* space needed for new line */
2176 int page_size;
2177 int page_count;
2178 int db_idx; /* index for lnum in data block */
2179 bhdr_T *hp;
2180 memfile_T *mfp;
2181 DATA_BL *dp;
2182 PTR_BL *pp;
2183 infoptr_T *ip;
2184
2185 /* lnum out of range */
2186 if (lnum > buf->b_ml.ml_line_count || buf->b_ml.ml_mfp == NULL)
2187 return FAIL;
2188
2189 if (lowest_marked && lowest_marked > lnum)
2190 lowest_marked = lnum + 1;
2191
2192 if (len == 0)
2193 len = (colnr_T)STRLEN(line) + 1; /* space needed for the text */
2194 space_needed = len + INDEX_SIZE; /* space needed for text + index */
2195
2196 mfp = buf->b_ml.ml_mfp;
2197 page_size = mfp->mf_page_size;
2198
2199/*
2200 * find the data block containing the previous line
2201 * This also fills the stack with the blocks from the root to the data block
2202 * This also releases any locked block.
2203 */
2204 if ((hp = ml_find_line(buf, lnum == 0 ? (linenr_T)1 : lnum,
2205 ML_INSERT)) == NULL)
2206 return FAIL;
2207
2208 buf->b_ml.ml_flags &= ~ML_EMPTY;
2209
2210 if (lnum == 0) /* got line one instead, correct db_idx */
2211 db_idx = -1; /* careful, it is negative! */
2212 else
2213 db_idx = lnum - buf->b_ml.ml_locked_low;
2214 /* get line count before the insertion */
2215 line_count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low;
2216
2217 dp = (DATA_BL *)(hp->bh_data);
2218
2219/*
2220 * If
2221 * - there is not enough room in the current block
2222 * - appending to the last line in the block
2223 * - not appending to the last line in the file
2224 * insert in front of the next block.
2225 */
2226 if ((int)dp->db_free < space_needed && db_idx == line_count - 1
2227 && lnum < buf->b_ml.ml_line_count)
2228 {
2229 /*
2230 * Now that the line is not going to be inserted in the block that we
2231 * expected, the line count has to be adjusted in the pointer blocks
2232 * by using ml_locked_lineadd.
2233 */
2234 --(buf->b_ml.ml_locked_lineadd);
2235 --(buf->b_ml.ml_locked_high);
2236 if ((hp = ml_find_line(buf, lnum + 1, ML_INSERT)) == NULL)
2237 return FAIL;
2238
2239 db_idx = -1; /* careful, it is negative! */
2240 /* get line count before the insertion */
2241 line_count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low;
2242 CHECK(buf->b_ml.ml_locked_low != lnum + 1, "locked_low != lnum + 1");
2243
2244 dp = (DATA_BL *)(hp->bh_data);
2245 }
2246
2247 ++buf->b_ml.ml_line_count;
2248
2249 if ((int)dp->db_free >= space_needed) /* enough room in data block */
2250 {
2251/*
2252 * Insert new line in existing data block, or in data block allocated above.
2253 */
2254 dp->db_txt_start -= len;
2255 dp->db_free -= space_needed;
2256 ++(dp->db_line_count);
2257
2258 /*
2259 * move the text of the lines that follow to the front
2260 * adjust the indexes of the lines that follow
2261 */
2262 if (line_count > db_idx + 1) /* if there are following lines */
2263 {
2264 /*
2265 * Offset is the start of the previous line.
2266 * This will become the character just after the new line.
2267 */
2268 if (db_idx < 0)
2269 offset = dp->db_txt_end;
2270 else
2271 offset = ((dp->db_index[db_idx]) & DB_INDEX_MASK);
2272 mch_memmove((char *)dp + dp->db_txt_start,
2273 (char *)dp + dp->db_txt_start + len,
2274 (size_t)(offset - (dp->db_txt_start + len)));
2275 for (i = line_count - 1; i > db_idx; --i)
2276 dp->db_index[i + 1] = dp->db_index[i] - len;
2277 dp->db_index[db_idx + 1] = offset - len;
2278 }
2279 else /* add line at the end */
2280 dp->db_index[db_idx + 1] = dp->db_txt_start;
2281
2282 /*
2283 * copy the text into the block
2284 */
2285 mch_memmove((char *)dp + dp->db_index[db_idx + 1], line, (size_t)len);
2286 if (mark)
2287 dp->db_index[db_idx + 1] |= DB_MARKED;
2288
2289 /*
2290 * Mark the block dirty.
2291 */
2292 buf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2293 if (!newfile)
2294 buf->b_ml.ml_flags |= ML_LOCKED_POS;
2295 }
2296 else /* not enough space in data block */
2297 {
2298/*
2299 * If there is not enough room we have to create a new data block and copy some
2300 * lines into it.
2301 * Then we have to insert an entry in the pointer block.
2302 * If this pointer block also is full, we go up another block, and so on, up
2303 * to the root if necessary.
2304 * The line counts in the pointer blocks have already been adjusted by
2305 * ml_find_line().
2306 */
2307 long line_count_left, line_count_right;
2308 int page_count_left, page_count_right;
2309 bhdr_T *hp_left;
2310 bhdr_T *hp_right;
2311 bhdr_T *hp_new;
2312 int lines_moved;
2313 int data_moved = 0; /* init to shut up gcc */
2314 int total_moved = 0; /* init to shut up gcc */
2315 DATA_BL *dp_right, *dp_left;
2316 int stack_idx;
2317 int in_left;
2318 int lineadd;
2319 blocknr_T bnum_left, bnum_right;
2320 linenr_T lnum_left, lnum_right;
2321 int pb_idx;
2322 PTR_BL *pp_new;
2323
2324 /*
2325 * We are going to allocate a new data block. Depending on the
2326 * situation it will be put to the left or right of the existing
2327 * block. If possible we put the new line in the left block and move
2328 * the lines after it to the right block. Otherwise the new line is
2329 * also put in the right block. This method is more efficient when
2330 * inserting a lot of lines at one place.
2331 */
2332 if (db_idx < 0) /* left block is new, right block is existing */
2333 {
2334 lines_moved = 0;
2335 in_left = TRUE;
2336 /* space_needed does not change */
2337 }
2338 else /* left block is existing, right block is new */
2339 {
2340 lines_moved = line_count - db_idx - 1;
2341 if (lines_moved == 0)
2342 in_left = FALSE; /* put new line in right block */
2343 /* space_needed does not change */
2344 else
2345 {
2346 data_moved = ((dp->db_index[db_idx]) & DB_INDEX_MASK) -
2347 dp->db_txt_start;
2348 total_moved = data_moved + lines_moved * INDEX_SIZE;
2349 if ((int)dp->db_free + total_moved >= space_needed)
2350 {
2351 in_left = TRUE; /* put new line in left block */
2352 space_needed = total_moved;
2353 }
2354 else
2355 {
2356 in_left = FALSE; /* put new line in right block */
2357 space_needed += total_moved;
2358 }
2359 }
2360 }
2361
2362 page_count = ((space_needed + HEADER_SIZE) + page_size - 1) / page_size;
2363 if ((hp_new = ml_new_data(mfp, newfile, page_count)) == NULL)
2364 {
2365 /* correct line counts in pointer blocks */
2366 --(buf->b_ml.ml_locked_lineadd);
2367 --(buf->b_ml.ml_locked_high);
2368 return FAIL;
2369 }
2370 if (db_idx < 0) /* left block is new */
2371 {
2372 hp_left = hp_new;
2373 hp_right = hp;
2374 line_count_left = 0;
2375 line_count_right = line_count;
2376 }
2377 else /* right block is new */
2378 {
2379 hp_left = hp;
2380 hp_right = hp_new;
2381 line_count_left = line_count;
2382 line_count_right = 0;
2383 }
2384 dp_right = (DATA_BL *)(hp_right->bh_data);
2385 dp_left = (DATA_BL *)(hp_left->bh_data);
2386 bnum_left = hp_left->bh_bnum;
2387 bnum_right = hp_right->bh_bnum;
2388 page_count_left = hp_left->bh_page_count;
2389 page_count_right = hp_right->bh_page_count;
2390
2391 /*
2392 * May move the new line into the right/new block.
2393 */
2394 if (!in_left)
2395 {
2396 dp_right->db_txt_start -= len;
2397 dp_right->db_free -= len + INDEX_SIZE;
2398 dp_right->db_index[0] = dp_right->db_txt_start;
2399 if (mark)
2400 dp_right->db_index[0] |= DB_MARKED;
2401
2402 mch_memmove((char *)dp_right + dp_right->db_txt_start,
2403 line, (size_t)len);
2404 ++line_count_right;
2405 }
2406 /*
2407 * may move lines from the left/old block to the right/new one.
2408 */
2409 if (lines_moved)
2410 {
2411 /*
2412 */
2413 dp_right->db_txt_start -= data_moved;
2414 dp_right->db_free -= total_moved;
2415 mch_memmove((char *)dp_right + dp_right->db_txt_start,
2416 (char *)dp_left + dp_left->db_txt_start,
2417 (size_t)data_moved);
2418 offset = dp_right->db_txt_start - dp_left->db_txt_start;
2419 dp_left->db_txt_start += data_moved;
2420 dp_left->db_free += total_moved;
2421
2422 /*
2423 * update indexes in the new block
2424 */
2425 for (to = line_count_right, from = db_idx + 1;
2426 from < line_count_left; ++from, ++to)
2427 dp_right->db_index[to] = dp->db_index[from] + offset;
2428 line_count_right += lines_moved;
2429 line_count_left -= lines_moved;
2430 }
2431
2432 /*
2433 * May move the new line into the left (old or new) block.
2434 */
2435 if (in_left)
2436 {
2437 dp_left->db_txt_start -= len;
2438 dp_left->db_free -= len + INDEX_SIZE;
2439 dp_left->db_index[line_count_left] = dp_left->db_txt_start;
2440 if (mark)
2441 dp_left->db_index[line_count_left] |= DB_MARKED;
2442 mch_memmove((char *)dp_left + dp_left->db_txt_start,
2443 line, (size_t)len);
2444 ++line_count_left;
2445 }
2446
2447 if (db_idx < 0) /* left block is new */
2448 {
2449 lnum_left = lnum + 1;
2450 lnum_right = 0;
2451 }
2452 else /* right block is new */
2453 {
2454 lnum_left = 0;
2455 if (in_left)
2456 lnum_right = lnum + 2;
2457 else
2458 lnum_right = lnum + 1;
2459 }
2460 dp_left->db_line_count = line_count_left;
2461 dp_right->db_line_count = line_count_right;
2462
2463 /*
2464 * release the two data blocks
2465 * The new one (hp_new) already has a correct blocknumber.
2466 * The old one (hp, in ml_locked) gets a positive blocknumber if
2467 * we changed it and we are not editing a new file.
2468 */
2469 if (lines_moved || in_left)
2470 buf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2471 if (!newfile && db_idx >= 0 && in_left)
2472 buf->b_ml.ml_flags |= ML_LOCKED_POS;
2473 mf_put(mfp, hp_new, TRUE, FALSE);
2474
2475 /*
2476 * flush the old data block
2477 * set ml_locked_lineadd to 0, because the updating of the
2478 * pointer blocks is done below
2479 */
2480 lineadd = buf->b_ml.ml_locked_lineadd;
2481 buf->b_ml.ml_locked_lineadd = 0;
2482 ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush data block */
2483
2484 /*
2485 * update pointer blocks for the new data block
2486 */
2487 for (stack_idx = buf->b_ml.ml_stack_top - 1; stack_idx >= 0;
2488 --stack_idx)
2489 {
2490 ip = &(buf->b_ml.ml_stack[stack_idx]);
2491 pb_idx = ip->ip_index;
2492 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
2493 return FAIL;
2494 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
2495 if (pp->pb_id != PTR_ID)
2496 {
2497 EMSG(_("E317: pointer block id wrong 3"));
2498 mf_put(mfp, hp, FALSE, FALSE);
2499 return FAIL;
2500 }
2501 /*
2502 * TODO: If the pointer block is full and we are adding at the end
2503 * try to insert in front of the next block
2504 */
2505 /* block not full, add one entry */
2506 if (pp->pb_count < pp->pb_count_max)
2507 {
2508 if (pb_idx + 1 < (int)pp->pb_count)
2509 mch_memmove(&pp->pb_pointer[pb_idx + 2],
2510 &pp->pb_pointer[pb_idx + 1],
2511 (size_t)(pp->pb_count - pb_idx - 1) * sizeof(PTR_EN));
2512 ++pp->pb_count;
2513 pp->pb_pointer[pb_idx].pe_line_count = line_count_left;
2514 pp->pb_pointer[pb_idx].pe_bnum = bnum_left;
2515 pp->pb_pointer[pb_idx].pe_page_count = page_count_left;
2516 pp->pb_pointer[pb_idx + 1].pe_line_count = line_count_right;
2517 pp->pb_pointer[pb_idx + 1].pe_bnum = bnum_right;
2518 pp->pb_pointer[pb_idx + 1].pe_page_count = page_count_right;
2519
2520 if (lnum_left != 0)
2521 pp->pb_pointer[pb_idx].pe_old_lnum = lnum_left;
2522 if (lnum_right != 0)
2523 pp->pb_pointer[pb_idx + 1].pe_old_lnum = lnum_right;
2524
2525 mf_put(mfp, hp, TRUE, FALSE);
2526 buf->b_ml.ml_stack_top = stack_idx + 1; /* truncate stack */
2527
2528 if (lineadd)
2529 {
2530 --(buf->b_ml.ml_stack_top);
2531 /* fix line count for rest of blocks in the stack */
2532 ml_lineadd(buf, lineadd);
2533 /* fix stack itself */
2534 buf->b_ml.ml_stack[buf->b_ml.ml_stack_top].ip_high +=
2535 lineadd;
2536 ++(buf->b_ml.ml_stack_top);
2537 }
2538
2539 /*
2540 * We are finished, break the loop here.
2541 */
2542 break;
2543 }
2544 else /* pointer block full */
2545 {
2546 /*
2547 * split the pointer block
2548 * allocate a new pointer block
2549 * move some of the pointer into the new block
2550 * prepare for updating the parent block
2551 */
2552 for (;;) /* do this twice when splitting block 1 */
2553 {
2554 hp_new = ml_new_ptr(mfp);
2555 if (hp_new == NULL) /* TODO: try to fix tree */
2556 return FAIL;
2557 pp_new = (PTR_BL *)(hp_new->bh_data);
2558
2559 if (hp->bh_bnum != 1)
2560 break;
2561
2562 /*
2563 * if block 1 becomes full the tree is given an extra level
2564 * The pointers from block 1 are moved into the new block.
2565 * block 1 is updated to point to the new block
2566 * then continue to split the new block
2567 */
2568 mch_memmove(pp_new, pp, (size_t)page_size);
2569 pp->pb_count = 1;
2570 pp->pb_pointer[0].pe_bnum = hp_new->bh_bnum;
2571 pp->pb_pointer[0].pe_line_count = buf->b_ml.ml_line_count;
2572 pp->pb_pointer[0].pe_old_lnum = 1;
2573 pp->pb_pointer[0].pe_page_count = 1;
2574 mf_put(mfp, hp, TRUE, FALSE); /* release block 1 */
2575 hp = hp_new; /* new block is to be split */
2576 pp = pp_new;
2577 CHECK(stack_idx != 0, _("stack_idx should be 0"));
2578 ip->ip_index = 0;
2579 ++stack_idx; /* do block 1 again later */
2580 }
2581 /*
2582 * move the pointers after the current one to the new block
2583 * If there are none, the new entry will be in the new block.
2584 */
2585 total_moved = pp->pb_count - pb_idx - 1;
2586 if (total_moved)
2587 {
2588 mch_memmove(&pp_new->pb_pointer[0],
2589 &pp->pb_pointer[pb_idx + 1],
2590 (size_t)(total_moved) * sizeof(PTR_EN));
2591 pp_new->pb_count = total_moved;
2592 pp->pb_count -= total_moved - 1;
2593 pp->pb_pointer[pb_idx + 1].pe_bnum = bnum_right;
2594 pp->pb_pointer[pb_idx + 1].pe_line_count = line_count_right;
2595 pp->pb_pointer[pb_idx + 1].pe_page_count = page_count_right;
2596 if (lnum_right)
2597 pp->pb_pointer[pb_idx + 1].pe_old_lnum = lnum_right;
2598 }
2599 else
2600 {
2601 pp_new->pb_count = 1;
2602 pp_new->pb_pointer[0].pe_bnum = bnum_right;
2603 pp_new->pb_pointer[0].pe_line_count = line_count_right;
2604 pp_new->pb_pointer[0].pe_page_count = page_count_right;
2605 pp_new->pb_pointer[0].pe_old_lnum = lnum_right;
2606 }
2607 pp->pb_pointer[pb_idx].pe_bnum = bnum_left;
2608 pp->pb_pointer[pb_idx].pe_line_count = line_count_left;
2609 pp->pb_pointer[pb_idx].pe_page_count = page_count_left;
2610 if (lnum_left)
2611 pp->pb_pointer[pb_idx].pe_old_lnum = lnum_left;
2612 lnum_left = 0;
2613 lnum_right = 0;
2614
2615 /*
2616 * recompute line counts
2617 */
2618 line_count_right = 0;
2619 for (i = 0; i < (int)pp_new->pb_count; ++i)
2620 line_count_right += pp_new->pb_pointer[i].pe_line_count;
2621 line_count_left = 0;
2622 for (i = 0; i < (int)pp->pb_count; ++i)
2623 line_count_left += pp->pb_pointer[i].pe_line_count;
2624
2625 bnum_left = hp->bh_bnum;
2626 bnum_right = hp_new->bh_bnum;
2627 page_count_left = 1;
2628 page_count_right = 1;
2629 mf_put(mfp, hp, TRUE, FALSE);
2630 mf_put(mfp, hp_new, TRUE, FALSE);
2631 }
2632 }
2633
2634 /*
2635 * Safety check: fallen out of for loop?
2636 */
2637 if (stack_idx < 0)
2638 {
2639 EMSG(_("E318: Updated too many blocks?"));
2640 buf->b_ml.ml_stack_top = 0; /* invalidate stack */
2641 }
2642 }
2643
2644#ifdef FEAT_BYTEOFF
2645 /* The line was inserted below 'lnum' */
2646 ml_updatechunk(buf, lnum + 1, (long)len, ML_CHNK_ADDLINE);
2647#endif
2648#ifdef FEAT_NETBEANS_INTG
2649 if (usingNetbeans)
2650 {
2651 if (STRLEN(line) > 0)
Bram Moolenaara93fa7e2006-04-17 22:14:47 +00002652 netbeans_inserted(buf, lnum+1, (colnr_T)0, line, (int)STRLEN(line));
Bram Moolenaar35a9aaa2004-10-24 19:23:07 +00002653 netbeans_inserted(buf, lnum+1, (colnr_T)STRLEN(line),
Bram Moolenaar071d4272004-06-13 20:20:40 +00002654 (char_u *)"\n", 1);
2655 }
2656#endif
2657 return OK;
2658}
2659
2660/*
Bram Moolenaar4770d092006-01-12 23:22:24 +00002661 * Replace line lnum, with buffering, in current buffer.
Bram Moolenaar071d4272004-06-13 20:20:40 +00002662 *
Bram Moolenaar1056d982006-03-09 22:37:52 +00002663 * If "copy" is TRUE, make a copy of the line, otherwise the line has been
Bram Moolenaar071d4272004-06-13 20:20:40 +00002664 * copied to allocated memory already.
2665 *
2666 * Check: The caller of this function should probably also call
2667 * changed_lines(), unless update_screen(NOT_VALID) is used.
2668 *
2669 * return FAIL for failure, OK otherwise
2670 */
2671 int
2672ml_replace(lnum, line, copy)
2673 linenr_T lnum;
2674 char_u *line;
2675 int copy;
2676{
2677 if (line == NULL) /* just checking... */
2678 return FAIL;
2679
2680 /* When starting up, we might still need to create the memfile */
2681 if (curbuf->b_ml.ml_mfp == NULL && open_buffer(FALSE, NULL) == FAIL)
2682 return FAIL;
2683
2684 if (copy && (line = vim_strsave(line)) == NULL) /* allocate memory */
2685 return FAIL;
2686#ifdef FEAT_NETBEANS_INTG
2687 if (usingNetbeans)
2688 {
2689 netbeans_removed(curbuf, lnum, 0, (long)STRLEN(ml_get(lnum)));
Bram Moolenaara93fa7e2006-04-17 22:14:47 +00002690 netbeans_inserted(curbuf, lnum, 0, line, (int)STRLEN(line));
Bram Moolenaar071d4272004-06-13 20:20:40 +00002691 }
2692#endif
2693 if (curbuf->b_ml.ml_line_lnum != lnum) /* other line buffered */
2694 ml_flush_line(curbuf); /* flush it */
2695 else if (curbuf->b_ml.ml_flags & ML_LINE_DIRTY) /* same line allocated */
2696 vim_free(curbuf->b_ml.ml_line_ptr); /* free it */
2697 curbuf->b_ml.ml_line_ptr = line;
2698 curbuf->b_ml.ml_line_lnum = lnum;
2699 curbuf->b_ml.ml_flags = (curbuf->b_ml.ml_flags | ML_LINE_DIRTY) & ~ML_EMPTY;
2700
2701 return OK;
2702}
2703
2704/*
Bram Moolenaar4770d092006-01-12 23:22:24 +00002705 * Delete line 'lnum' in the current buffer.
Bram Moolenaar071d4272004-06-13 20:20:40 +00002706 *
2707 * Check: The caller of this function should probably also call
2708 * deleted_lines() after this.
2709 *
2710 * return FAIL for failure, OK otherwise
2711 */
2712 int
2713ml_delete(lnum, message)
2714 linenr_T lnum;
2715 int message;
2716{
2717 ml_flush_line(curbuf);
2718 return ml_delete_int(curbuf, lnum, message);
2719}
2720
2721 static int
2722ml_delete_int(buf, lnum, message)
2723 buf_T *buf;
2724 linenr_T lnum;
2725 int message;
2726{
2727 bhdr_T *hp;
2728 memfile_T *mfp;
2729 DATA_BL *dp;
2730 PTR_BL *pp;
2731 infoptr_T *ip;
2732 int count; /* number of entries in block */
2733 int idx;
2734 int stack_idx;
2735 int text_start;
2736 int line_start;
2737 long line_size;
2738 int i;
2739
2740 if (lnum < 1 || lnum > buf->b_ml.ml_line_count)
2741 return FAIL;
2742
2743 if (lowest_marked && lowest_marked > lnum)
2744 lowest_marked--;
2745
2746/*
2747 * If the file becomes empty the last line is replaced by an empty line.
2748 */
2749 if (buf->b_ml.ml_line_count == 1) /* file becomes empty */
2750 {
2751 if (message
2752#ifdef FEAT_NETBEANS_INTG
2753 && !netbeansSuppressNoLines
2754#endif
2755 )
Bram Moolenaar238a5642006-02-21 22:12:05 +00002756 set_keep_msg((char_u *)_(no_lines_msg), 0);
2757
Bram Moolenaar071d4272004-06-13 20:20:40 +00002758 /* FEAT_BYTEOFF already handled in there, dont worry 'bout it below */
2759 i = ml_replace((linenr_T)1, (char_u *)"", TRUE);
2760 buf->b_ml.ml_flags |= ML_EMPTY;
2761
2762 return i;
2763 }
2764
2765/*
2766 * find the data block containing the line
2767 * This also fills the stack with the blocks from the root to the data block
2768 * This also releases any locked block.
2769 */
2770 mfp = buf->b_ml.ml_mfp;
2771 if (mfp == NULL)
2772 return FAIL;
2773
2774 if ((hp = ml_find_line(buf, lnum, ML_DELETE)) == NULL)
2775 return FAIL;
2776
2777 dp = (DATA_BL *)(hp->bh_data);
2778 /* compute line count before the delete */
2779 count = (long)(buf->b_ml.ml_locked_high)
2780 - (long)(buf->b_ml.ml_locked_low) + 2;
2781 idx = lnum - buf->b_ml.ml_locked_low;
2782
2783 --buf->b_ml.ml_line_count;
2784
2785 line_start = ((dp->db_index[idx]) & DB_INDEX_MASK);
2786 if (idx == 0) /* first line in block, text at the end */
2787 line_size = dp->db_txt_end - line_start;
2788 else
2789 line_size = ((dp->db_index[idx - 1]) & DB_INDEX_MASK) - line_start;
2790
2791#ifdef FEAT_NETBEANS_INTG
2792 if (usingNetbeans)
Bram Moolenaar35a9aaa2004-10-24 19:23:07 +00002793 netbeans_removed(buf, lnum, 0, (long)line_size);
Bram Moolenaar071d4272004-06-13 20:20:40 +00002794#endif
2795
2796/*
2797 * special case: If there is only one line in the data block it becomes empty.
2798 * Then we have to remove the entry, pointing to this data block, from the
2799 * pointer block. If this pointer block also becomes empty, we go up another
2800 * block, and so on, up to the root if necessary.
2801 * The line counts in the pointer blocks have already been adjusted by
2802 * ml_find_line().
2803 */
2804 if (count == 1)
2805 {
2806 mf_free(mfp, hp); /* free the data block */
2807 buf->b_ml.ml_locked = NULL;
2808
2809 for (stack_idx = buf->b_ml.ml_stack_top - 1; stack_idx >= 0; --stack_idx)
2810 {
2811 buf->b_ml.ml_stack_top = 0; /* stack is invalid when failing */
2812 ip = &(buf->b_ml.ml_stack[stack_idx]);
2813 idx = ip->ip_index;
2814 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
2815 return FAIL;
2816 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
2817 if (pp->pb_id != PTR_ID)
2818 {
2819 EMSG(_("E317: pointer block id wrong 4"));
2820 mf_put(mfp, hp, FALSE, FALSE);
2821 return FAIL;
2822 }
2823 count = --(pp->pb_count);
2824 if (count == 0) /* the pointer block becomes empty! */
2825 mf_free(mfp, hp);
2826 else
2827 {
2828 if (count != idx) /* move entries after the deleted one */
2829 mch_memmove(&pp->pb_pointer[idx], &pp->pb_pointer[idx + 1],
2830 (size_t)(count - idx) * sizeof(PTR_EN));
2831 mf_put(mfp, hp, TRUE, FALSE);
2832
2833 buf->b_ml.ml_stack_top = stack_idx; /* truncate stack */
2834 /* fix line count for rest of blocks in the stack */
2835 if (buf->b_ml.ml_locked_lineadd)
2836 {
2837 ml_lineadd(buf, buf->b_ml.ml_locked_lineadd);
2838 buf->b_ml.ml_stack[buf->b_ml.ml_stack_top].ip_high +=
2839 buf->b_ml.ml_locked_lineadd;
2840 }
2841 ++(buf->b_ml.ml_stack_top);
2842
2843 break;
2844 }
2845 }
2846 CHECK(stack_idx < 0, _("deleted block 1?"));
2847 }
2848 else
2849 {
2850 /*
2851 * delete the text by moving the next lines forwards
2852 */
2853 text_start = dp->db_txt_start;
2854 mch_memmove((char *)dp + text_start + line_size,
2855 (char *)dp + text_start, (size_t)(line_start - text_start));
2856
2857 /*
2858 * delete the index by moving the next indexes backwards
2859 * Adjust the indexes for the text movement.
2860 */
2861 for (i = idx; i < count - 1; ++i)
2862 dp->db_index[i] = dp->db_index[i + 1] + line_size;
2863
2864 dp->db_free += line_size + INDEX_SIZE;
2865 dp->db_txt_start += line_size;
2866 --(dp->db_line_count);
2867
2868 /*
2869 * mark the block dirty and make sure it is in the file (for recovery)
2870 */
2871 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
2872 }
2873
2874#ifdef FEAT_BYTEOFF
2875 ml_updatechunk(buf, lnum, line_size, ML_CHNK_DELLINE);
2876#endif
2877 return OK;
2878}
2879
2880/*
2881 * set the B_MARKED flag for line 'lnum'
2882 */
2883 void
2884ml_setmarked(lnum)
2885 linenr_T lnum;
2886{
2887 bhdr_T *hp;
2888 DATA_BL *dp;
2889 /* invalid line number */
2890 if (lnum < 1 || lnum > curbuf->b_ml.ml_line_count
2891 || curbuf->b_ml.ml_mfp == NULL)
2892 return; /* give error message? */
2893
2894 if (lowest_marked == 0 || lowest_marked > lnum)
2895 lowest_marked = lnum;
2896
2897 /*
2898 * find the data block containing the line
2899 * This also fills the stack with the blocks from the root to the data block
2900 * This also releases any locked block.
2901 */
2902 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2903 return; /* give error message? */
2904
2905 dp = (DATA_BL *)(hp->bh_data);
2906 dp->db_index[lnum - curbuf->b_ml.ml_locked_low] |= DB_MARKED;
2907 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2908}
2909
2910/*
2911 * find the first line with its B_MARKED flag set
2912 */
2913 linenr_T
2914ml_firstmarked()
2915{
2916 bhdr_T *hp;
2917 DATA_BL *dp;
2918 linenr_T lnum;
2919 int i;
2920
2921 if (curbuf->b_ml.ml_mfp == NULL)
2922 return (linenr_T) 0;
2923
2924 /*
2925 * The search starts with lowest_marked line. This is the last line where
2926 * a mark was found, adjusted by inserting/deleting lines.
2927 */
2928 for (lnum = lowest_marked; lnum <= curbuf->b_ml.ml_line_count; )
2929 {
2930 /*
2931 * Find the data block containing the line.
2932 * This also fills the stack with the blocks from the root to the data
2933 * block This also releases any locked block.
2934 */
2935 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2936 return (linenr_T)0; /* give error message? */
2937
2938 dp = (DATA_BL *)(hp->bh_data);
2939
2940 for (i = lnum - curbuf->b_ml.ml_locked_low;
2941 lnum <= curbuf->b_ml.ml_locked_high; ++i, ++lnum)
2942 if ((dp->db_index[i]) & DB_MARKED)
2943 {
2944 (dp->db_index[i]) &= DB_INDEX_MASK;
2945 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2946 lowest_marked = lnum + 1;
2947 return lnum;
2948 }
2949 }
2950
2951 return (linenr_T) 0;
2952}
2953
2954#if 0 /* not used */
2955/*
2956 * return TRUE if line 'lnum' has a mark
2957 */
2958 int
2959ml_has_mark(lnum)
2960 linenr_T lnum;
2961{
2962 bhdr_T *hp;
2963 DATA_BL *dp;
2964
2965 if (curbuf->b_ml.ml_mfp == NULL
2966 || (hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2967 return FALSE;
2968
2969 dp = (DATA_BL *)(hp->bh_data);
2970 return (int)((dp->db_index[lnum - curbuf->b_ml.ml_locked_low]) & DB_MARKED);
2971}
2972#endif
2973
2974/*
2975 * clear all DB_MARKED flags
2976 */
2977 void
2978ml_clearmarked()
2979{
2980 bhdr_T *hp;
2981 DATA_BL *dp;
2982 linenr_T lnum;
2983 int i;
2984
2985 if (curbuf->b_ml.ml_mfp == NULL) /* nothing to do */
2986 return;
2987
2988 /*
2989 * The search starts with line lowest_marked.
2990 */
2991 for (lnum = lowest_marked; lnum <= curbuf->b_ml.ml_line_count; )
2992 {
2993 /*
2994 * Find the data block containing the line.
2995 * This also fills the stack with the blocks from the root to the data
2996 * block and releases any locked block.
2997 */
2998 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2999 return; /* give error message? */
3000
3001 dp = (DATA_BL *)(hp->bh_data);
3002
3003 for (i = lnum - curbuf->b_ml.ml_locked_low;
3004 lnum <= curbuf->b_ml.ml_locked_high; ++i, ++lnum)
3005 if ((dp->db_index[i]) & DB_MARKED)
3006 {
3007 (dp->db_index[i]) &= DB_INDEX_MASK;
3008 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
3009 }
3010 }
3011
3012 lowest_marked = 0;
3013 return;
3014}
3015
3016/*
3017 * flush ml_line if necessary
3018 */
3019 static void
3020ml_flush_line(buf)
3021 buf_T *buf;
3022{
3023 bhdr_T *hp;
3024 DATA_BL *dp;
3025 linenr_T lnum;
3026 char_u *new_line;
3027 char_u *old_line;
3028 colnr_T new_len;
3029 int old_len;
3030 int extra;
3031 int idx;
3032 int start;
3033 int count;
3034 int i;
3035
3036 if (buf->b_ml.ml_line_lnum == 0 || buf->b_ml.ml_mfp == NULL)
3037 return; /* nothing to do */
3038
3039 if (buf->b_ml.ml_flags & ML_LINE_DIRTY)
3040 {
3041 lnum = buf->b_ml.ml_line_lnum;
3042 new_line = buf->b_ml.ml_line_ptr;
3043
3044 hp = ml_find_line(buf, lnum, ML_FIND);
3045 if (hp == NULL)
3046 EMSGN(_("E320: Cannot find line %ld"), lnum);
3047 else
3048 {
3049 dp = (DATA_BL *)(hp->bh_data);
3050 idx = lnum - buf->b_ml.ml_locked_low;
3051 start = ((dp->db_index[idx]) & DB_INDEX_MASK);
3052 old_line = (char_u *)dp + start;
3053 if (idx == 0) /* line is last in block */
3054 old_len = dp->db_txt_end - start;
3055 else /* text of previous line follows */
3056 old_len = (dp->db_index[idx - 1] & DB_INDEX_MASK) - start;
3057 new_len = (colnr_T)STRLEN(new_line) + 1;
3058 extra = new_len - old_len; /* negative if lines gets smaller */
3059
3060 /*
3061 * if new line fits in data block, replace directly
3062 */
3063 if ((int)dp->db_free >= extra)
3064 {
3065 /* if the length changes and there are following lines */
3066 count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low + 1;
3067 if (extra != 0 && idx < count - 1)
3068 {
3069 /* move text of following lines */
3070 mch_memmove((char *)dp + dp->db_txt_start - extra,
3071 (char *)dp + dp->db_txt_start,
3072 (size_t)(start - dp->db_txt_start));
3073
3074 /* adjust pointers of this and following lines */
3075 for (i = idx + 1; i < count; ++i)
3076 dp->db_index[i] -= extra;
3077 }
3078 dp->db_index[idx] -= extra;
3079
3080 /* adjust free space */
3081 dp->db_free -= extra;
3082 dp->db_txt_start -= extra;
3083
3084 /* copy new line into the data block */
3085 mch_memmove(old_line - extra, new_line, (size_t)new_len);
3086 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
3087#ifdef FEAT_BYTEOFF
3088 /* The else case is already covered by the insert and delete */
3089 ml_updatechunk(buf, lnum, (long)extra, ML_CHNK_UPDLINE);
3090#endif
3091 }
3092 else
3093 {
3094 /*
3095 * Cannot do it in one data block: Delete and append.
3096 * Append first, because ml_delete_int() cannot delete the
3097 * last line in a buffer, which causes trouble for a buffer
3098 * that has only one line.
3099 * Don't forget to copy the mark!
3100 */
3101 /* How about handling errors??? */
3102 (void)ml_append_int(buf, lnum, new_line, new_len, FALSE,
3103 (dp->db_index[idx] & DB_MARKED));
3104 (void)ml_delete_int(buf, lnum, FALSE);
3105 }
3106 }
3107 vim_free(new_line);
3108 }
3109
3110 buf->b_ml.ml_line_lnum = 0;
3111}
3112
3113/*
3114 * create a new, empty, data block
3115 */
3116 static bhdr_T *
3117ml_new_data(mfp, negative, page_count)
3118 memfile_T *mfp;
3119 int negative;
3120 int page_count;
3121{
3122 bhdr_T *hp;
3123 DATA_BL *dp;
3124
3125 if ((hp = mf_new(mfp, negative, page_count)) == NULL)
3126 return NULL;
3127
3128 dp = (DATA_BL *)(hp->bh_data);
3129 dp->db_id = DATA_ID;
3130 dp->db_txt_start = dp->db_txt_end = page_count * mfp->mf_page_size;
3131 dp->db_free = dp->db_txt_start - HEADER_SIZE;
3132 dp->db_line_count = 0;
3133
3134 return hp;
3135}
3136
3137/*
3138 * create a new, empty, pointer block
3139 */
3140 static bhdr_T *
3141ml_new_ptr(mfp)
3142 memfile_T *mfp;
3143{
3144 bhdr_T *hp;
3145 PTR_BL *pp;
3146
3147 if ((hp = mf_new(mfp, FALSE, 1)) == NULL)
3148 return NULL;
3149
3150 pp = (PTR_BL *)(hp->bh_data);
3151 pp->pb_id = PTR_ID;
3152 pp->pb_count = 0;
3153 pp->pb_count_max = (short_u)((mfp->mf_page_size - sizeof(PTR_BL)) / sizeof(PTR_EN) + 1);
3154
3155 return hp;
3156}
3157
3158/*
3159 * lookup line 'lnum' in a memline
3160 *
3161 * action: if ML_DELETE or ML_INSERT the line count is updated while searching
3162 * if ML_FLUSH only flush a locked block
3163 * if ML_FIND just find the line
3164 *
3165 * If the block was found it is locked and put in ml_locked.
3166 * The stack is updated to lead to the locked block. The ip_high field in
3167 * the stack is updated to reflect the last line in the block AFTER the
3168 * insert or delete, also if the pointer block has not been updated yet. But
3169 * if if ml_locked != NULL ml_locked_lineadd must be added to ip_high.
3170 *
3171 * return: NULL for failure, pointer to block header otherwise
3172 */
3173 static bhdr_T *
3174ml_find_line(buf, lnum, action)
3175 buf_T *buf;
3176 linenr_T lnum;
3177 int action;
3178{
3179 DATA_BL *dp;
3180 PTR_BL *pp;
3181 infoptr_T *ip;
3182 bhdr_T *hp;
3183 memfile_T *mfp;
3184 linenr_T t;
3185 blocknr_T bnum, bnum2;
3186 int dirty;
3187 linenr_T low, high;
3188 int top;
3189 int page_count;
3190 int idx;
3191
3192 mfp = buf->b_ml.ml_mfp;
3193
3194 /*
3195 * If there is a locked block check if the wanted line is in it.
3196 * If not, flush and release the locked block.
3197 * Don't do this for ML_INSERT_SAME, because the stack need to be updated.
3198 * Don't do this for ML_FLUSH, because we want to flush the locked block.
3199 */
3200 if (buf->b_ml.ml_locked)
3201 {
3202 if (ML_SIMPLE(action) && buf->b_ml.ml_locked_low <= lnum
3203 && buf->b_ml.ml_locked_high >= lnum)
3204 {
3205 /* remember to update pointer blocks and stack later */
3206 if (action == ML_INSERT)
3207 {
3208 ++(buf->b_ml.ml_locked_lineadd);
3209 ++(buf->b_ml.ml_locked_high);
3210 }
3211 else if (action == ML_DELETE)
3212 {
3213 --(buf->b_ml.ml_locked_lineadd);
3214 --(buf->b_ml.ml_locked_high);
3215 }
3216 return (buf->b_ml.ml_locked);
3217 }
3218
3219 mf_put(mfp, buf->b_ml.ml_locked, buf->b_ml.ml_flags & ML_LOCKED_DIRTY,
3220 buf->b_ml.ml_flags & ML_LOCKED_POS);
3221 buf->b_ml.ml_locked = NULL;
3222
3223 /*
3224 * if lines have been added or deleted in the locked block, need to
3225 * update the line count in pointer blocks
3226 */
3227 if (buf->b_ml.ml_locked_lineadd)
3228 ml_lineadd(buf, buf->b_ml.ml_locked_lineadd);
3229 }
3230
3231 if (action == ML_FLUSH) /* nothing else to do */
3232 return NULL;
3233
3234 bnum = 1; /* start at the root of the tree */
3235 page_count = 1;
3236 low = 1;
3237 high = buf->b_ml.ml_line_count;
3238
3239 if (action == ML_FIND) /* first try stack entries */
3240 {
3241 for (top = buf->b_ml.ml_stack_top - 1; top >= 0; --top)
3242 {
3243 ip = &(buf->b_ml.ml_stack[top]);
3244 if (ip->ip_low <= lnum && ip->ip_high >= lnum)
3245 {
3246 bnum = ip->ip_bnum;
3247 low = ip->ip_low;
3248 high = ip->ip_high;
3249 buf->b_ml.ml_stack_top = top; /* truncate stack at prev entry */
3250 break;
3251 }
3252 }
3253 if (top < 0)
3254 buf->b_ml.ml_stack_top = 0; /* not found, start at the root */
3255 }
3256 else /* ML_DELETE or ML_INSERT */
3257 buf->b_ml.ml_stack_top = 0; /* start at the root */
3258
3259/*
3260 * search downwards in the tree until a data block is found
3261 */
3262 for (;;)
3263 {
3264 if ((hp = mf_get(mfp, bnum, page_count)) == NULL)
3265 goto error_noblock;
3266
3267 /*
3268 * update high for insert/delete
3269 */
3270 if (action == ML_INSERT)
3271 ++high;
3272 else if (action == ML_DELETE)
3273 --high;
3274
3275 dp = (DATA_BL *)(hp->bh_data);
3276 if (dp->db_id == DATA_ID) /* data block */
3277 {
3278 buf->b_ml.ml_locked = hp;
3279 buf->b_ml.ml_locked_low = low;
3280 buf->b_ml.ml_locked_high = high;
3281 buf->b_ml.ml_locked_lineadd = 0;
3282 buf->b_ml.ml_flags &= ~(ML_LOCKED_DIRTY | ML_LOCKED_POS);
3283 return hp;
3284 }
3285
3286 pp = (PTR_BL *)(dp); /* must be pointer block */
3287 if (pp->pb_id != PTR_ID)
3288 {
3289 EMSG(_("E317: pointer block id wrong"));
3290 goto error_block;
3291 }
3292
3293 if ((top = ml_add_stack(buf)) < 0) /* add new entry to stack */
3294 goto error_block;
3295 ip = &(buf->b_ml.ml_stack[top]);
3296 ip->ip_bnum = bnum;
3297 ip->ip_low = low;
3298 ip->ip_high = high;
3299 ip->ip_index = -1; /* index not known yet */
3300
3301 dirty = FALSE;
3302 for (idx = 0; idx < (int)pp->pb_count; ++idx)
3303 {
3304 t = pp->pb_pointer[idx].pe_line_count;
3305 CHECK(t == 0, _("pe_line_count is zero"));
3306 if ((low += t) > lnum)
3307 {
3308 ip->ip_index = idx;
3309 bnum = pp->pb_pointer[idx].pe_bnum;
3310 page_count = pp->pb_pointer[idx].pe_page_count;
3311 high = low - 1;
3312 low -= t;
3313
3314 /*
3315 * a negative block number may have been changed
3316 */
3317 if (bnum < 0)
3318 {
3319 bnum2 = mf_trans_del(mfp, bnum);
3320 if (bnum != bnum2)
3321 {
3322 bnum = bnum2;
3323 pp->pb_pointer[idx].pe_bnum = bnum;
3324 dirty = TRUE;
3325 }
3326 }
3327
3328 break;
3329 }
3330 }
3331 if (idx >= (int)pp->pb_count) /* past the end: something wrong! */
3332 {
3333 if (lnum > buf->b_ml.ml_line_count)
3334 EMSGN(_("E322: line number out of range: %ld past the end"),
3335 lnum - buf->b_ml.ml_line_count);
3336
3337 else
3338 EMSGN(_("E323: line count wrong in block %ld"), bnum);
3339 goto error_block;
3340 }
3341 if (action == ML_DELETE)
3342 {
3343 pp->pb_pointer[idx].pe_line_count--;
3344 dirty = TRUE;
3345 }
3346 else if (action == ML_INSERT)
3347 {
3348 pp->pb_pointer[idx].pe_line_count++;
3349 dirty = TRUE;
3350 }
3351 mf_put(mfp, hp, dirty, FALSE);
3352 }
3353
3354error_block:
3355 mf_put(mfp, hp, FALSE, FALSE);
3356error_noblock:
3357/*
3358 * If action is ML_DELETE or ML_INSERT we have to correct the tree for
3359 * the incremented/decremented line counts, because there won't be a line
3360 * inserted/deleted after all.
3361 */
3362 if (action == ML_DELETE)
3363 ml_lineadd(buf, 1);
3364 else if (action == ML_INSERT)
3365 ml_lineadd(buf, -1);
3366 buf->b_ml.ml_stack_top = 0;
3367 return NULL;
3368}
3369
3370/*
3371 * add an entry to the info pointer stack
3372 *
3373 * return -1 for failure, number of the new entry otherwise
3374 */
3375 static int
3376ml_add_stack(buf)
3377 buf_T *buf;
3378{
3379 int top;
3380 infoptr_T *newstack;
3381
3382 top = buf->b_ml.ml_stack_top;
3383
3384 /* may have to increase the stack size */
3385 if (top == buf->b_ml.ml_stack_size)
3386 {
3387 CHECK(top > 0, _("Stack size increases")); /* more than 5 levels??? */
3388
3389 newstack = (infoptr_T *)alloc((unsigned)sizeof(infoptr_T) *
3390 (buf->b_ml.ml_stack_size + STACK_INCR));
3391 if (newstack == NULL)
3392 return -1;
3393 mch_memmove(newstack, buf->b_ml.ml_stack, (size_t)top * sizeof(infoptr_T));
3394 vim_free(buf->b_ml.ml_stack);
3395 buf->b_ml.ml_stack = newstack;
3396 buf->b_ml.ml_stack_size += STACK_INCR;
3397 }
3398
3399 buf->b_ml.ml_stack_top++;
3400 return top;
3401}
3402
3403/*
3404 * Update the pointer blocks on the stack for inserted/deleted lines.
3405 * The stack itself is also updated.
3406 *
3407 * When a insert/delete line action fails, the line is not inserted/deleted,
3408 * but the pointer blocks have already been updated. That is fixed here by
3409 * walking through the stack.
3410 *
3411 * Count is the number of lines added, negative if lines have been deleted.
3412 */
3413 static void
3414ml_lineadd(buf, count)
3415 buf_T *buf;
3416 int count;
3417{
3418 int idx;
3419 infoptr_T *ip;
3420 PTR_BL *pp;
3421 memfile_T *mfp = buf->b_ml.ml_mfp;
3422 bhdr_T *hp;
3423
3424 for (idx = buf->b_ml.ml_stack_top - 1; idx >= 0; --idx)
3425 {
3426 ip = &(buf->b_ml.ml_stack[idx]);
3427 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
3428 break;
3429 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
3430 if (pp->pb_id != PTR_ID)
3431 {
3432 mf_put(mfp, hp, FALSE, FALSE);
3433 EMSG(_("E317: pointer block id wrong 2"));
3434 break;
3435 }
3436 pp->pb_pointer[ip->ip_index].pe_line_count += count;
3437 ip->ip_high += count;
3438 mf_put(mfp, hp, TRUE, FALSE);
3439 }
3440}
3441
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003442#ifdef HAVE_READLINK
3443static int resolve_symlink __ARGS((char_u *fname, char_u *buf));
3444
3445/*
3446 * Resolve a symlink in the last component of a file name.
3447 * Note that f_resolve() does it for every part of the path, we don't do that
3448 * here.
3449 * If it worked returns OK and the resolved link in "buf[MAXPATHL]".
3450 * Otherwise returns FAIL.
3451 */
3452 static int
3453resolve_symlink(fname, buf)
3454 char_u *fname;
3455 char_u *buf;
3456{
3457 char_u tmp[MAXPATHL];
3458 int ret;
3459 int depth = 0;
3460
3461 if (fname == NULL)
3462 return FAIL;
3463
3464 /* Put the result so far in tmp[], starting with the original name. */
3465 vim_strncpy(tmp, fname, MAXPATHL - 1);
3466
3467 for (;;)
3468 {
3469 /* Limit symlink depth to 100, catch recursive loops. */
3470 if (++depth == 100)
3471 {
3472 EMSG2(_("E773: Symlink loop for \"%s\""), fname);
3473 return FAIL;
3474 }
3475
3476 ret = readlink((char *)tmp, (char *)buf, MAXPATHL - 1);
3477 if (ret <= 0)
3478 {
Bram Moolenaarcc984262005-12-23 22:19:46 +00003479 if (errno == EINVAL || errno == ENOENT)
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003480 {
Bram Moolenaarcc984262005-12-23 22:19:46 +00003481 /* Found non-symlink or not existing file, stop here.
3482 * When at the first level use the unmodifed name, skip the
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003483 * call to vim_FullName(). */
3484 if (depth == 1)
3485 return FAIL;
3486
3487 /* Use the resolved name in tmp[]. */
3488 break;
3489 }
3490
3491 /* There must be some error reading links, use original name. */
3492 return FAIL;
3493 }
3494 buf[ret] = NUL;
3495
3496 /*
3497 * Check whether the symlink is relative or absolute.
3498 * If it's relative, build a new path based on the directory
3499 * portion of the filename (if any) and the path the symlink
3500 * points to.
3501 */
3502 if (mch_isFullName(buf))
3503 STRCPY(tmp, buf);
3504 else
3505 {
3506 char_u *tail;
3507
3508 tail = gettail(tmp);
3509 if (STRLEN(tail) + STRLEN(buf) >= MAXPATHL)
3510 return FAIL;
3511 STRCPY(tail, buf);
3512 }
3513 }
3514
3515 /*
3516 * Try to resolve the full name of the file so that the swapfile name will
3517 * be consistent even when opening a relative symlink from different
3518 * working directories.
3519 */
3520 return vim_FullName(tmp, buf, MAXPATHL, TRUE);
3521}
3522#endif
3523
Bram Moolenaar071d4272004-06-13 20:20:40 +00003524/*
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003525 * Make swap file name out of the file name and a directory name.
3526 * Returns pointer to allocated memory or NULL.
Bram Moolenaar071d4272004-06-13 20:20:40 +00003527 */
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003528/*ARGSUSED*/
3529 char_u *
3530makeswapname(fname, ffname, buf, dir_name)
3531 char_u *fname;
3532 char_u *ffname;
Bram Moolenaar071d4272004-06-13 20:20:40 +00003533 buf_T *buf;
3534 char_u *dir_name;
3535{
3536 char_u *r, *s;
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003537#ifdef HAVE_READLINK
3538 char_u fname_buf[MAXPATHL];
3539 char_u *fname_res;
3540#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00003541
3542#if defined(UNIX) || defined(WIN3264) /* Need _very_ long file names */
3543 s = dir_name + STRLEN(dir_name);
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00003544 if (after_pathsep(dir_name, s) && s[-1] == s[-2])
Bram Moolenaar071d4272004-06-13 20:20:40 +00003545 { /* Ends with '//', Use Full path */
3546 r = NULL;
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003547 if ((s = make_percent_swname(dir_name, fname)) != NULL)
Bram Moolenaar071d4272004-06-13 20:20:40 +00003548 {
3549 r = modname(s, (char_u *)".swp", FALSE);
3550 vim_free(s);
3551 }
3552 return r;
3553 }
3554#endif
3555
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003556#ifdef HAVE_READLINK
3557 /* Expand symlink in the file name, so that we put the swap file with the
3558 * actual file instead of with the symlink. */
3559 if (resolve_symlink(fname, fname_buf) == OK)
3560 fname_res = fname_buf;
3561 else
3562 fname_res = fname;
3563#endif
3564
Bram Moolenaar071d4272004-06-13 20:20:40 +00003565 r = buf_modname(
3566#ifdef SHORT_FNAME
3567 TRUE,
3568#else
3569 (buf->b_p_sn || buf->b_shortname),
3570#endif
3571#ifdef RISCOS
3572 /* Avoid problems if fname has special chars, eg <Wimp$Scrap> */
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003573 ffname,
Bram Moolenaar071d4272004-06-13 20:20:40 +00003574#else
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003575# ifdef HAVE_READLINK
3576 fname_res,
3577# else
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003578 fname,
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003579# endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00003580#endif
3581 (char_u *)
3582#if defined(VMS) || defined(RISCOS)
3583 "_swp",
3584#else
3585 ".swp",
3586#endif
3587#ifdef SHORT_FNAME /* always 8.3 file name */
3588 FALSE
3589#else
3590 /* Prepend a '.' to the swap file name for the current directory. */
3591 dir_name[0] == '.' && dir_name[1] == NUL
3592#endif
3593 );
3594 if (r == NULL) /* out of memory */
3595 return NULL;
3596
3597 s = get_file_in_dir(r, dir_name);
3598 vim_free(r);
3599 return s;
3600}
3601
3602/*
3603 * Get file name to use for swap file or backup file.
3604 * Use the name of the edited file "fname" and an entry in the 'dir' or 'bdir'
3605 * option "dname".
3606 * - If "dname" is ".", return "fname" (swap file in dir of file).
3607 * - If "dname" starts with "./", insert "dname" in "fname" (swap file
3608 * relative to dir of file).
3609 * - Otherwise, prepend "dname" to the tail of "fname" (swap file in specific
3610 * dir).
3611 *
3612 * The return value is an allocated string and can be NULL.
3613 */
3614 char_u *
3615get_file_in_dir(fname, dname)
3616 char_u *fname;
3617 char_u *dname; /* don't use "dirname", it is a global for Alpha */
3618{
3619 char_u *t;
3620 char_u *tail;
3621 char_u *retval;
3622 int save_char;
3623
3624 tail = gettail(fname);
3625
3626 if (dname[0] == '.' && dname[1] == NUL)
3627 retval = vim_strsave(fname);
3628 else if (dname[0] == '.' && vim_ispathsep(dname[1]))
3629 {
3630 if (tail == fname) /* no path before file name */
3631 retval = concat_fnames(dname + 2, tail, TRUE);
3632 else
3633 {
3634 save_char = *tail;
3635 *tail = NUL;
3636 t = concat_fnames(fname, dname + 2, TRUE);
3637 *tail = save_char;
3638 if (t == NULL) /* out of memory */
3639 retval = NULL;
3640 else
3641 {
3642 retval = concat_fnames(t, tail, TRUE);
3643 vim_free(t);
3644 }
3645 }
3646 }
3647 else
3648 retval = concat_fnames(dname, tail, TRUE);
3649
3650 return retval;
3651}
3652
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00003653static void attention_message __ARGS((buf_T *buf, char_u *fname));
3654
3655/*
3656 * Print the ATTENTION message: info about an existing swap file.
3657 */
3658 static void
3659attention_message(buf, fname)
3660 buf_T *buf; /* buffer being edited */
3661 char_u *fname; /* swap file name */
3662{
3663 struct stat st;
3664 time_t x, sx;
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00003665 char *p;
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00003666
3667 ++no_wait_return;
3668 (void)EMSG(_("E325: ATTENTION"));
3669 MSG_PUTS(_("\nFound a swap file by the name \""));
3670 msg_home_replace(fname);
3671 MSG_PUTS("\"\n");
3672 sx = swapfile_info(fname);
3673 MSG_PUTS(_("While opening file \""));
3674 msg_outtrans(buf->b_fname);
3675 MSG_PUTS("\"\n");
3676 if (mch_stat((char *)buf->b_fname, &st) != -1)
3677 {
3678 MSG_PUTS(_(" dated: "));
3679 x = st.st_mtime; /* Manx C can't do &st.st_mtime */
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00003680 p = ctime(&x); /* includes '\n' */
3681 if (p == NULL)
3682 MSG_PUTS("(invalid)\n");
3683 else
3684 MSG_PUTS(p);
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00003685 if (sx != 0 && x > sx)
3686 MSG_PUTS(_(" NEWER than swap file!\n"));
3687 }
3688 /* Some of these messages are long to allow translation to
3689 * other languages. */
3690 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"));
3691 MSG_PUTS(_(" Quit, or continue with caution.\n"));
3692 MSG_PUTS(_("\n(2) An edit session for this file crashed.\n"));
3693 MSG_PUTS(_(" If this is the case, use \":recover\" or \"vim -r "));
3694 msg_outtrans(buf->b_fname);
3695 MSG_PUTS(_("\"\n to recover the changes (see \":help recovery\").\n"));
3696 MSG_PUTS(_(" If you did this already, delete the swap file \""));
3697 msg_outtrans(fname);
3698 MSG_PUTS(_("\"\n to avoid this message.\n"));
3699 cmdline_row = msg_row;
3700 --no_wait_return;
3701}
3702
3703#ifdef FEAT_AUTOCMD
3704static int do_swapexists __ARGS((buf_T *buf, char_u *fname));
3705
3706/*
3707 * Trigger the SwapExists autocommands.
3708 * Returns a value for equivalent to do_dialog() (see below):
3709 * 0: still need to ask for a choice
3710 * 1: open read-only
3711 * 2: edit anyway
3712 * 3: recover
3713 * 4: delete it
3714 * 5: quit
3715 * 6: abort
3716 */
3717 static int
3718do_swapexists(buf, fname)
3719 buf_T *buf;
3720 char_u *fname;
3721{
3722 set_vim_var_string(VV_SWAPNAME, fname, -1);
3723 set_vim_var_string(VV_SWAPCHOICE, NULL, -1);
3724
3725 /* Trigger SwapExists autocommands with <afile> set to the file being
3726 * edited. */
3727 apply_autocmds(EVENT_SWAPEXISTS, buf->b_fname, NULL, FALSE, NULL);
3728
3729 set_vim_var_string(VV_SWAPNAME, NULL, -1);
3730
3731 switch (*get_vim_var_str(VV_SWAPCHOICE))
3732 {
3733 case 'o': return 1;
3734 case 'e': return 2;
3735 case 'r': return 3;
3736 case 'd': return 4;
3737 case 'q': return 5;
3738 case 'a': return 6;
3739 }
3740
3741 return 0;
3742}
3743#endif
3744
Bram Moolenaar071d4272004-06-13 20:20:40 +00003745/*
3746 * Find out what name to use for the swap file for buffer 'buf'.
3747 *
3748 * Several names are tried to find one that does not exist
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003749 * Returns the name in allocated memory or NULL.
Bram Moolenaar071d4272004-06-13 20:20:40 +00003750 *
3751 * Note: If BASENAMELEN is not correct, you will get error messages for
3752 * not being able to open the swapfile
3753 */
3754 static char_u *
3755findswapname(buf, dirp, old_fname)
3756 buf_T *buf;
3757 char_u **dirp; /* pointer to list of directories */
3758 char_u *old_fname; /* don't give warning for this file name */
3759{
3760 char_u *fname;
3761 int n;
Bram Moolenaar071d4272004-06-13 20:20:40 +00003762 char_u *dir_name;
3763#ifdef AMIGA
3764 BPTR fh;
3765#endif
3766#ifndef SHORT_FNAME
3767 int r;
3768#endif
3769
3770#if !defined(SHORT_FNAME) \
3771 && ((!defined(UNIX) && !defined(OS2)) || defined(ARCHIE))
3772# define CREATE_DUMMY_FILE
3773 FILE *dummyfd = NULL;
3774
3775/*
3776 * If we start editing a new file, e.g. "test.doc", which resides on an MSDOS
3777 * compatible filesystem, it is possible that the file "test.doc.swp" which we
3778 * create will be exactly the same file. To avoid this problem we temporarily
3779 * create "test.doc".
3780 * Don't do this when the check below for a 8.3 file name is used.
3781 */
3782 if (!(buf->b_p_sn || buf->b_shortname) && buf->b_fname != NULL
3783 && mch_getperm(buf->b_fname) < 0)
3784 dummyfd = mch_fopen((char *)buf->b_fname, "w");
3785#endif
3786
3787/*
3788 * Isolate a directory name from *dirp and put it in dir_name.
3789 * First allocate some memory to put the directory name in.
3790 */
3791 dir_name = alloc((unsigned)STRLEN(*dirp) + 1);
3792 if (dir_name != NULL)
3793 (void)copy_option_part(dirp, dir_name, 31000, ",");
3794
3795/*
3796 * we try different names until we find one that does not exist yet
3797 */
3798 if (dir_name == NULL) /* out of memory */
3799 fname = NULL;
3800 else
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003801 fname = makeswapname(buf->b_fname, buf->b_ffname, buf, dir_name);
Bram Moolenaar071d4272004-06-13 20:20:40 +00003802
3803 for (;;)
3804 {
3805 if (fname == NULL) /* must be out of memory */
3806 break;
3807 if ((n = (int)STRLEN(fname)) == 0) /* safety check */
3808 {
3809 vim_free(fname);
3810 fname = NULL;
3811 break;
3812 }
3813#if (defined(UNIX) || defined(OS2)) && !defined(ARCHIE) && !defined(SHORT_FNAME)
3814/*
3815 * Some systems have a MS-DOS compatible filesystem that use 8.3 character
3816 * file names. If this is the first try and the swap file name does not fit in
3817 * 8.3, detect if this is the case, set shortname and try again.
3818 */
3819 if (fname[n - 2] == 'w' && fname[n - 1] == 'p'
3820 && !(buf->b_p_sn || buf->b_shortname))
3821 {
3822 char_u *tail;
3823 char_u *fname2;
3824 struct stat s1, s2;
3825 int f1, f2;
3826 int created1 = FALSE, created2 = FALSE;
3827 int same = FALSE;
3828
3829 /*
3830 * Check if swapfile name does not fit in 8.3:
3831 * It either contains two dots, is longer than 8 chars, or starts
3832 * with a dot.
3833 */
3834 tail = gettail(buf->b_fname);
3835 if ( vim_strchr(tail, '.') != NULL
3836 || STRLEN(tail) > (size_t)8
3837 || *gettail(fname) == '.')
3838 {
3839 fname2 = alloc(n + 2);
3840 if (fname2 != NULL)
3841 {
3842 STRCPY(fname2, fname);
3843 /* if fname == "xx.xx.swp", fname2 = "xx.xx.swx"
3844 * if fname == ".xx.swp", fname2 = ".xx.swpx"
3845 * if fname == "123456789.swp", fname2 = "12345678x.swp"
3846 */
3847 if (vim_strchr(tail, '.') != NULL)
3848 fname2[n - 1] = 'x';
3849 else if (*gettail(fname) == '.')
3850 {
3851 fname2[n] = 'x';
3852 fname2[n + 1] = NUL;
3853 }
3854 else
3855 fname2[n - 5] += 1;
3856 /*
3857 * may need to create the files to be able to use mch_stat()
3858 */
3859 f1 = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
3860 if (f1 < 0)
3861 {
3862 f1 = mch_open_rw((char *)fname,
3863 O_RDWR|O_CREAT|O_EXCL|O_EXTRA);
3864#if defined(OS2)
3865 if (f1 < 0 && errno == ENOENT)
3866 same = TRUE;
3867#endif
3868 created1 = TRUE;
3869 }
3870 if (f1 >= 0)
3871 {
3872 f2 = mch_open((char *)fname2, O_RDONLY | O_EXTRA, 0);
3873 if (f2 < 0)
3874 {
3875 f2 = mch_open_rw((char *)fname2,
3876 O_RDWR|O_CREAT|O_EXCL|O_EXTRA);
3877 created2 = TRUE;
3878 }
3879 if (f2 >= 0)
3880 {
3881 /*
3882 * Both files exist now. If mch_stat() returns the
3883 * same device and inode they are the same file.
3884 */
3885 if (mch_fstat(f1, &s1) != -1
3886 && mch_fstat(f2, &s2) != -1
3887 && s1.st_dev == s2.st_dev
3888 && s1.st_ino == s2.st_ino)
3889 same = TRUE;
3890 close(f2);
3891 if (created2)
3892 mch_remove(fname2);
3893 }
3894 close(f1);
3895 if (created1)
3896 mch_remove(fname);
3897 }
3898 vim_free(fname2);
3899 if (same)
3900 {
3901 buf->b_shortname = TRUE;
3902 vim_free(fname);
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003903 fname = makeswapname(buf->b_fname, buf->b_ffname,
3904 buf, dir_name);
Bram Moolenaar071d4272004-06-13 20:20:40 +00003905 continue; /* try again with b_shortname set */
3906 }
3907 }
3908 }
3909 }
3910#endif
3911 /*
3912 * check if the swapfile already exists
3913 */
3914 if (mch_getperm(fname) < 0) /* it does not exist */
3915 {
3916#ifdef HAVE_LSTAT
3917 struct stat sb;
3918
3919 /*
3920 * Extra security check: When a swap file is a symbolic link, this
3921 * is most likely a symlink attack.
3922 */
3923 if (mch_lstat((char *)fname, &sb) < 0)
3924#else
3925# ifdef AMIGA
3926 fh = Open((UBYTE *)fname, (long)MODE_NEWFILE);
3927 /*
3928 * on the Amiga mch_getperm() will return -1 when the file exists
3929 * but is being used by another program. This happens if you edit
3930 * a file twice.
3931 */
3932 if (fh != (BPTR)NULL) /* can open file, OK */
3933 {
3934 Close(fh);
3935 mch_remove(fname);
3936 break;
3937 }
3938 if (IoErr() != ERROR_OBJECT_IN_USE
3939 && IoErr() != ERROR_OBJECT_EXISTS)
3940# endif
3941#endif
3942 break;
3943 }
3944
3945 /*
3946 * A file name equal to old_fname is OK to use.
3947 */
3948 if (old_fname != NULL && fnamecmp(fname, old_fname) == 0)
3949 break;
3950
3951 /*
3952 * get here when file already exists
3953 */
3954 if (fname[n - 2] == 'w' && fname[n - 1] == 'p') /* first try */
3955 {
3956#ifndef SHORT_FNAME
3957 /*
3958 * on MS-DOS compatible filesystems (e.g. messydos) file.doc.swp
3959 * and file.doc are the same file. To guess if this problem is
3960 * present try if file.doc.swx exists. If it does, we set
3961 * buf->b_shortname and try file_doc.swp (dots replaced by
3962 * underscores for this file), and try again. If it doesn't we
3963 * assume that "file.doc.swp" already exists.
3964 */
3965 if (!(buf->b_p_sn || buf->b_shortname)) /* not tried yet */
3966 {
3967 fname[n - 1] = 'x';
3968 r = mch_getperm(fname); /* try "file.swx" */
3969 fname[n - 1] = 'p';
3970 if (r >= 0) /* "file.swx" seems to exist */
3971 {
3972 buf->b_shortname = TRUE;
3973 vim_free(fname);
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003974 fname = makeswapname(buf->b_fname, buf->b_ffname,
3975 buf, dir_name);
Bram Moolenaar071d4272004-06-13 20:20:40 +00003976 continue; /* try again with '.' replaced with '_' */
3977 }
3978 }
3979#endif
3980 /*
3981 * If we get here the ".swp" file really exists.
3982 * Give an error message, unless recovering, no file name, we are
3983 * viewing a help file or when the path of the file is different
3984 * (happens when all .swp files are in one directory).
3985 */
Bram Moolenaar8fc061c2004-12-29 21:03:02 +00003986 if (!recoverymode && buf->b_fname != NULL
3987 && !buf->b_help && !(buf->b_flags & BF_DUMMY))
Bram Moolenaar071d4272004-06-13 20:20:40 +00003988 {
3989 int fd;
3990 struct block0 b0;
3991 int differ = FALSE;
3992
3993 /*
3994 * Try to read block 0 from the swap file to get the original
3995 * file name (and inode number).
3996 */
3997 fd = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
3998 if (fd >= 0)
3999 {
4000 if (read(fd, (char *)&b0, sizeof(b0)) == sizeof(b0))
4001 {
4002 /*
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004003 * If the swapfile has the same directory as the
4004 * buffer don't compare the directory names, they can
4005 * have a different mountpoint.
Bram Moolenaar071d4272004-06-13 20:20:40 +00004006 */
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004007 if (b0.b0_flags & B0_SAME_DIR)
4008 {
4009 if (fnamecmp(gettail(buf->b_ffname),
4010 gettail(b0.b0_fname)) != 0
4011 || !same_directory(fname, buf->b_ffname))
Bram Moolenaar900b4d72005-12-12 22:05:50 +00004012 {
4013#ifdef CHECK_INODE
4014 /* Symlinks may point to the same file even
4015 * when the name differs, need to check the
4016 * inode too. */
4017 expand_env(b0.b0_fname, NameBuff, MAXPATHL);
4018 if (fnamecmp_ino(buf->b_ffname, NameBuff,
4019 char_to_long(b0.b0_ino)))
4020#endif
4021 differ = TRUE;
4022 }
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004023 }
4024 else
4025 {
4026 /*
4027 * The name in the swap file may be
4028 * "~user/path/file". Expand it first.
4029 */
4030 expand_env(b0.b0_fname, NameBuff, MAXPATHL);
Bram Moolenaar071d4272004-06-13 20:20:40 +00004031#ifdef CHECK_INODE
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004032 if (fnamecmp_ino(buf->b_ffname, NameBuff,
Bram Moolenaar900b4d72005-12-12 22:05:50 +00004033 char_to_long(b0.b0_ino)))
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004034 differ = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004035#else
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004036 if (fnamecmp(NameBuff, buf->b_ffname) != 0)
4037 differ = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004038#endif
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004039 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00004040 }
4041 close(fd);
4042 }
4043#ifdef RISCOS
4044 else
4045 /* Can't open swap file, though it does exist.
4046 * Assume that the user is editing two files with
4047 * the same name in different directories. No error.
4048 */
4049 differ = TRUE;
4050#endif
4051
4052 /* give the ATTENTION message when there is an old swap file
4053 * for the current file, and the buffer was not recovered. */
4054 if (differ == FALSE && !(curbuf->b_flags & BF_RECOVERED)
4055 && vim_strchr(p_shm, SHM_ATTENTION) == NULL)
4056 {
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004057#if defined(HAS_SWAP_EXISTS_ACTION)
4058 int choice = 0;
4059#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004060#ifdef CREATE_DUMMY_FILE
4061 int did_use_dummy = FALSE;
4062
4063 /* Avoid getting a warning for the file being created
4064 * outside of Vim, it was created at the start of this
4065 * function. Delete the file now, because Vim might exit
4066 * here if the window is closed. */
4067 if (dummyfd != NULL)
4068 {
4069 fclose(dummyfd);
4070 dummyfd = NULL;
4071 mch_remove(buf->b_fname);
4072 did_use_dummy = TRUE;
4073 }
4074#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004075
4076#if (defined(UNIX) || defined(__EMX__) || defined(VMS)) && (defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG))
4077 process_still_running = FALSE;
4078#endif
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004079#ifdef FEAT_AUTOCMD
4080 /*
4081 * If there is an SwapExists autocommand and we can handle
4082 * the response, trigger it. It may return 0 to ask the
4083 * user anyway.
4084 */
4085 if (swap_exists_action != SEA_NONE
4086 && has_autocmd(EVENT_SWAPEXISTS, buf->b_fname, buf))
4087 choice = do_swapexists(buf, fname);
Bram Moolenaar071d4272004-06-13 20:20:40 +00004088
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004089 if (choice == 0)
4090#endif
4091 {
4092#ifdef FEAT_GUI
4093 /* If we are supposed to start the GUI but it wasn't
4094 * completely started yet, start it now. This makes
4095 * the messages displayed in the Vim window when
4096 * loading a session from the .gvimrc file. */
4097 if (gui.starting && !gui.in_use)
4098 gui_start();
4099#endif
4100 /* Show info about the existing swap file. */
4101 attention_message(buf, fname);
4102
4103 /* We don't want a 'q' typed at the more-prompt
4104 * interrupt loading a file. */
4105 got_int = FALSE;
4106 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00004107
4108#if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004109 if (swap_exists_action != SEA_NONE && choice == 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004110 {
4111 char_u *name;
4112
4113 name = alloc((unsigned)(STRLEN(fname)
4114 + STRLEN(_("Swap file \""))
4115 + STRLEN(_("\" already exists!")) + 5));
4116 if (name != NULL)
4117 {
4118 STRCPY(name, _("Swap file \""));
4119 home_replace(NULL, fname, name + STRLEN(name),
4120 1000, TRUE);
4121 STRCAT(name, _("\" already exists!"));
4122 }
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004123 choice = do_dialog(VIM_WARNING,
Bram Moolenaar071d4272004-06-13 20:20:40 +00004124 (char_u *)_("VIM - ATTENTION"),
4125 name == NULL
4126 ? (char_u *)_("Swap file already exists!")
4127 : name,
4128# if defined(UNIX) || defined(__EMX__) || defined(VMS)
4129 process_still_running
4130 ? (char_u *)_("&Open Read-Only\n&Edit anyway\n&Recover\n&Quit\n&Abort") :
4131# endif
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004132 (char_u *)_("&Open Read-Only\n&Edit anyway\n&Recover\n&Delete it\n&Quit\n&Abort"), 1, NULL);
4133
4134# if defined(UNIX) || defined(__EMX__) || defined(VMS)
4135 if (process_still_running && choice >= 4)
4136 choice++; /* Skip missing "Delete it" button */
4137# endif
4138 vim_free(name);
4139
4140 /* pretend screen didn't scroll, need redraw anyway */
4141 msg_scrolled = 0;
4142 redraw_all_later(NOT_VALID);
4143 }
4144#endif
4145
4146#if defined(HAS_SWAP_EXISTS_ACTION)
4147 if (choice > 0)
4148 {
4149 switch (choice)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004150 {
4151 case 1:
4152 buf->b_p_ro = TRUE;
4153 break;
4154 case 2:
4155 break;
4156 case 3:
4157 swap_exists_action = SEA_RECOVER;
4158 break;
4159 case 4:
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004160 mch_remove(fname);
Bram Moolenaar071d4272004-06-13 20:20:40 +00004161 break;
4162 case 5:
4163 swap_exists_action = SEA_QUIT;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004164 break;
4165 case 6:
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004166 swap_exists_action = SEA_QUIT;
4167 got_int = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004168 break;
4169 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00004170
4171 /* If the file was deleted this fname can be used. */
4172 if (mch_getperm(fname) < 0)
4173 break;
4174 }
4175 else
4176#endif
4177 {
4178 MSG_PUTS("\n");
Bram Moolenaar4770d092006-01-12 23:22:24 +00004179 if (msg_silent == 0)
4180 /* call wait_return() later */
4181 need_wait_return = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004182 }
4183
4184#ifdef CREATE_DUMMY_FILE
4185 /* Going to try another name, need the dummy file again. */
4186 if (did_use_dummy)
4187 dummyfd = mch_fopen((char *)buf->b_fname, "w");
4188#endif
4189 }
4190 }
4191 }
4192
4193 /*
4194 * Change the ".swp" extension to find another file that can be used.
4195 * First decrement the last char: ".swo", ".swn", etc.
4196 * If that still isn't enough decrement the last but one char: ".svz"
Bram Moolenaar69a7cb42004-06-20 12:51:53 +00004197 * Can happen when editing many "No Name" buffers.
Bram Moolenaar071d4272004-06-13 20:20:40 +00004198 */
4199 if (fname[n - 1] == 'a') /* ".s?a" */
4200 {
4201 if (fname[n - 2] == 'a') /* ".saa": tried enough, give up */
4202 {
4203 EMSG(_("E326: Too many swap files found"));
4204 vim_free(fname);
4205 fname = NULL;
4206 break;
4207 }
4208 --fname[n - 2]; /* ".svz", ".suz", etc. */
4209 fname[n - 1] = 'z' + 1;
4210 }
4211 --fname[n - 1]; /* ".swo", ".swn", etc. */
4212 }
4213
4214 vim_free(dir_name);
4215#ifdef CREATE_DUMMY_FILE
4216 if (dummyfd != NULL) /* file has been created temporarily */
4217 {
4218 fclose(dummyfd);
4219 mch_remove(buf->b_fname);
4220 }
4221#endif
4222 return fname;
4223}
4224
4225 static int
4226b0_magic_wrong(b0p)
4227 ZERO_BL *b0p;
4228{
4229 return (b0p->b0_magic_long != (long)B0_MAGIC_LONG
4230 || b0p->b0_magic_int != (int)B0_MAGIC_INT
4231 || b0p->b0_magic_short != (short)B0_MAGIC_SHORT
4232 || b0p->b0_magic_char != B0_MAGIC_CHAR);
4233}
4234
4235#ifdef CHECK_INODE
4236/*
4237 * Compare current file name with file name from swap file.
4238 * Try to use inode numbers when possible.
4239 * Return non-zero when files are different.
4240 *
4241 * When comparing file names a few things have to be taken into consideration:
4242 * - When working over a network the full path of a file depends on the host.
4243 * We check the inode number if possible. It is not 100% reliable though,
4244 * because the device number cannot be used over a network.
4245 * - When a file does not exist yet (editing a new file) there is no inode
4246 * number.
4247 * - The file name in a swap file may not be valid on the current host. The
4248 * "~user" form is used whenever possible to avoid this.
4249 *
4250 * This is getting complicated, let's make a table:
4251 *
4252 * ino_c ino_s fname_c fname_s differ =
4253 *
4254 * both files exist -> compare inode numbers:
4255 * != 0 != 0 X X ino_c != ino_s
4256 *
4257 * inode number(s) unknown, file names available -> compare file names
4258 * == 0 X OK OK fname_c != fname_s
4259 * X == 0 OK OK fname_c != fname_s
4260 *
4261 * current file doesn't exist, file for swap file exist, file name(s) not
4262 * available -> probably different
4263 * == 0 != 0 FAIL X TRUE
4264 * == 0 != 0 X FAIL TRUE
4265 *
4266 * current file exists, inode for swap unknown, file name(s) not
4267 * available -> probably different
4268 * != 0 == 0 FAIL X TRUE
4269 * != 0 == 0 X FAIL TRUE
4270 *
4271 * current file doesn't exist, inode for swap unknown, one file name not
4272 * available -> probably different
4273 * == 0 == 0 FAIL OK TRUE
4274 * == 0 == 0 OK FAIL TRUE
4275 *
4276 * current file doesn't exist, inode for swap unknown, both file names not
4277 * available -> probably same file
4278 * == 0 == 0 FAIL FAIL FALSE
4279 *
4280 * Note that when the ino_t is 64 bits, only the last 32 will be used. This
4281 * can't be changed without making the block 0 incompatible with 32 bit
4282 * versions.
4283 */
4284
4285 static int
4286fnamecmp_ino(fname_c, fname_s, ino_block0)
4287 char_u *fname_c; /* current file name */
4288 char_u *fname_s; /* file name from swap file */
4289 long ino_block0;
4290{
4291 struct stat st;
4292 ino_t ino_c = 0; /* ino of current file */
4293 ino_t ino_s; /* ino of file from swap file */
4294 char_u buf_c[MAXPATHL]; /* full path of fname_c */
4295 char_u buf_s[MAXPATHL]; /* full path of fname_s */
4296 int retval_c; /* flag: buf_c valid */
4297 int retval_s; /* flag: buf_s valid */
4298
4299 if (mch_stat((char *)fname_c, &st) == 0)
4300 ino_c = (ino_t)st.st_ino;
4301
4302 /*
4303 * First we try to get the inode from the file name, because the inode in
4304 * the swap file may be outdated. If that fails (e.g. this path is not
4305 * valid on this machine), use the inode from block 0.
4306 */
4307 if (mch_stat((char *)fname_s, &st) == 0)
4308 ino_s = (ino_t)st.st_ino;
4309 else
4310 ino_s = (ino_t)ino_block0;
4311
4312 if (ino_c && ino_s)
4313 return (ino_c != ino_s);
4314
4315 /*
4316 * One of the inode numbers is unknown, try a forced vim_FullName() and
4317 * compare the file names.
4318 */
4319 retval_c = vim_FullName(fname_c, buf_c, MAXPATHL, TRUE);
4320 retval_s = vim_FullName(fname_s, buf_s, MAXPATHL, TRUE);
4321 if (retval_c == OK && retval_s == OK)
4322 return (STRCMP(buf_c, buf_s) != 0);
4323
4324 /*
4325 * Can't compare inodes or file names, guess that the files are different,
4326 * unless both appear not to exist at all.
4327 */
4328 if (ino_s == 0 && ino_c == 0 && retval_c == FAIL && retval_s == FAIL)
4329 return FALSE;
4330 return TRUE;
4331}
4332#endif /* CHECK_INODE */
4333
4334/*
4335 * Move a long integer into a four byte character array.
4336 * Used for machine independency in block zero.
4337 */
4338 static void
4339long_to_char(n, s)
4340 long n;
4341 char_u *s;
4342{
4343 s[0] = (char_u)(n & 0xff);
4344 n = (unsigned)n >> 8;
4345 s[1] = (char_u)(n & 0xff);
4346 n = (unsigned)n >> 8;
4347 s[2] = (char_u)(n & 0xff);
4348 n = (unsigned)n >> 8;
4349 s[3] = (char_u)(n & 0xff);
4350}
4351
4352 static long
4353char_to_long(s)
4354 char_u *s;
4355{
4356 long retval;
4357
4358 retval = s[3];
4359 retval <<= 8;
4360 retval |= s[2];
4361 retval <<= 8;
4362 retval |= s[1];
4363 retval <<= 8;
4364 retval |= s[0];
4365
4366 return retval;
4367}
4368
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004369/*
4370 * Set the flags in the first block of the swap file:
4371 * - file is modified or not: buf->b_changed
4372 * - 'fileformat'
4373 * - 'fileencoding'
4374 */
Bram Moolenaar071d4272004-06-13 20:20:40 +00004375 void
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004376ml_setflags(buf)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004377 buf_T *buf;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004378{
4379 bhdr_T *hp;
4380 ZERO_BL *b0p;
4381
4382 if (!buf->b_ml.ml_mfp)
4383 return;
4384 for (hp = buf->b_ml.ml_mfp->mf_used_last; hp != NULL; hp = hp->bh_prev)
4385 {
4386 if (hp->bh_bnum == 0)
4387 {
4388 b0p = (ZERO_BL *)(hp->bh_data);
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004389 b0p->b0_dirty = buf->b_changed ? B0_DIRTY : 0;
4390 b0p->b0_flags = (b0p->b0_flags & ~B0_FF_MASK)
4391 | (get_fileformat(buf) + 1);
4392#ifdef FEAT_MBYTE
4393 add_b0_fenc(b0p, buf);
4394#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004395 hp->bh_flags |= BH_DIRTY;
4396 mf_sync(buf->b_ml.ml_mfp, MFS_ZERO);
4397 break;
4398 }
4399 }
4400}
4401
4402#if defined(FEAT_BYTEOFF) || defined(PROTO)
4403
4404#define MLCS_MAXL 800 /* max no of lines in chunk */
4405#define MLCS_MINL 400 /* should be half of MLCS_MAXL */
4406
4407/*
4408 * Keep information for finding byte offset of a line, updtytpe may be one of:
4409 * ML_CHNK_ADDLINE: Add len to parent chunk, possibly splitting it
4410 * Careful: ML_CHNK_ADDLINE may cause ml_find_line() to be called.
4411 * ML_CHNK_DELLINE: Subtract len from parent chunk, possibly deleting it
4412 * ML_CHNK_UPDLINE: Add len to parent chunk, as a signed entity.
4413 */
4414 static void
4415ml_updatechunk(buf, line, len, updtype)
4416 buf_T *buf;
4417 linenr_T line;
4418 long len;
4419 int updtype;
4420{
4421 static buf_T *ml_upd_lastbuf = NULL;
4422 static linenr_T ml_upd_lastline;
4423 static linenr_T ml_upd_lastcurline;
4424 static int ml_upd_lastcurix;
4425
4426 linenr_T curline = ml_upd_lastcurline;
4427 int curix = ml_upd_lastcurix;
4428 long size;
4429 chunksize_T *curchnk;
4430 int rest;
4431 bhdr_T *hp;
4432 DATA_BL *dp;
4433
4434 if (buf->b_ml.ml_usedchunks == -1 || len == 0)
4435 return;
4436 if (buf->b_ml.ml_chunksize == NULL)
4437 {
4438 buf->b_ml.ml_chunksize = (chunksize_T *)
4439 alloc((unsigned)sizeof(chunksize_T) * 100);
4440 if (buf->b_ml.ml_chunksize == NULL)
4441 {
4442 buf->b_ml.ml_usedchunks = -1;
4443 return;
4444 }
4445 buf->b_ml.ml_numchunks = 100;
4446 buf->b_ml.ml_usedchunks = 1;
4447 buf->b_ml.ml_chunksize[0].mlcs_numlines = 1;
4448 buf->b_ml.ml_chunksize[0].mlcs_totalsize = 1;
4449 }
4450
4451 if (updtype == ML_CHNK_UPDLINE && buf->b_ml.ml_line_count == 1)
4452 {
4453 /*
4454 * First line in empty buffer from ml_flush_line() -- reset
4455 */
4456 buf->b_ml.ml_usedchunks = 1;
4457 buf->b_ml.ml_chunksize[0].mlcs_numlines = 1;
4458 buf->b_ml.ml_chunksize[0].mlcs_totalsize =
4459 (long)STRLEN(buf->b_ml.ml_line_ptr) + 1;
4460 return;
4461 }
4462
4463 /*
4464 * Find chunk that our line belongs to, curline will be at start of the
4465 * chunk.
4466 */
4467 if (buf != ml_upd_lastbuf || line != ml_upd_lastline + 1
4468 || updtype != ML_CHNK_ADDLINE)
4469 {
4470 for (curline = 1, curix = 0;
4471 curix < buf->b_ml.ml_usedchunks - 1
4472 && line >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4473 curix++)
4474 {
4475 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4476 }
4477 }
4478 else if (line >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines
4479 && curix < buf->b_ml.ml_usedchunks - 1)
4480 {
4481 /* Adjust cached curix & curline */
4482 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4483 curix++;
4484 }
4485 curchnk = buf->b_ml.ml_chunksize + curix;
4486
4487 if (updtype == ML_CHNK_DELLINE)
Bram Moolenaar5a6404c2006-11-01 17:12:57 +00004488 len = -len;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004489 curchnk->mlcs_totalsize += len;
4490 if (updtype == ML_CHNK_ADDLINE)
4491 {
4492 curchnk->mlcs_numlines++;
4493
4494 /* May resize here so we don't have to do it in both cases below */
4495 if (buf->b_ml.ml_usedchunks + 1 >= buf->b_ml.ml_numchunks)
4496 {
4497 buf->b_ml.ml_numchunks = buf->b_ml.ml_numchunks * 3 / 2;
4498 buf->b_ml.ml_chunksize = (chunksize_T *)
4499 vim_realloc(buf->b_ml.ml_chunksize,
4500 sizeof(chunksize_T) * buf->b_ml.ml_numchunks);
4501 if (buf->b_ml.ml_chunksize == NULL)
4502 {
4503 /* Hmmmm, Give up on offset for this buffer */
4504 buf->b_ml.ml_usedchunks = -1;
4505 return;
4506 }
4507 }
4508
4509 if (buf->b_ml.ml_chunksize[curix].mlcs_numlines >= MLCS_MAXL)
4510 {
4511 int count; /* number of entries in block */
4512 int idx;
4513 int text_end;
4514 int linecnt;
4515
4516 mch_memmove(buf->b_ml.ml_chunksize + curix + 1,
4517 buf->b_ml.ml_chunksize + curix,
4518 (buf->b_ml.ml_usedchunks - curix) *
4519 sizeof(chunksize_T));
4520 /* Compute length of first half of lines in the splitted chunk */
4521 size = 0;
4522 linecnt = 0;
4523 while (curline < buf->b_ml.ml_line_count
4524 && linecnt < MLCS_MINL)
4525 {
4526 if ((hp = ml_find_line(buf, curline, ML_FIND)) == NULL)
4527 {
4528 buf->b_ml.ml_usedchunks = -1;
4529 return;
4530 }
4531 dp = (DATA_BL *)(hp->bh_data);
4532 count = (long)(buf->b_ml.ml_locked_high) -
4533 (long)(buf->b_ml.ml_locked_low) + 1;
4534 idx = curline - buf->b_ml.ml_locked_low;
4535 curline = buf->b_ml.ml_locked_high + 1;
4536 if (idx == 0)/* first line in block, text at the end */
4537 text_end = dp->db_txt_end;
4538 else
4539 text_end = ((dp->db_index[idx - 1]) & DB_INDEX_MASK);
4540 /* Compute index of last line to use in this MEMLINE */
4541 rest = count - idx;
4542 if (linecnt + rest > MLCS_MINL)
4543 {
4544 idx += MLCS_MINL - linecnt - 1;
4545 linecnt = MLCS_MINL;
4546 }
4547 else
4548 {
4549 idx = count - 1;
4550 linecnt += rest;
4551 }
4552 size += text_end - ((dp->db_index[idx]) & DB_INDEX_MASK);
4553 }
4554 buf->b_ml.ml_chunksize[curix].mlcs_numlines = linecnt;
4555 buf->b_ml.ml_chunksize[curix + 1].mlcs_numlines -= linecnt;
4556 buf->b_ml.ml_chunksize[curix].mlcs_totalsize = size;
4557 buf->b_ml.ml_chunksize[curix + 1].mlcs_totalsize -= size;
4558 buf->b_ml.ml_usedchunks++;
4559 ml_upd_lastbuf = NULL; /* Force recalc of curix & curline */
4560 return;
4561 }
4562 else if (buf->b_ml.ml_chunksize[curix].mlcs_numlines >= MLCS_MINL
4563 && curix == buf->b_ml.ml_usedchunks - 1
4564 && buf->b_ml.ml_line_count - line <= 1)
4565 {
4566 /*
4567 * We are in the last chunk and it is cheap to crate a new one
4568 * after this. Do it now to avoid the loop above later on
4569 */
4570 curchnk = buf->b_ml.ml_chunksize + curix + 1;
4571 buf->b_ml.ml_usedchunks++;
4572 if (line == buf->b_ml.ml_line_count)
4573 {
4574 curchnk->mlcs_numlines = 0;
4575 curchnk->mlcs_totalsize = 0;
4576 }
4577 else
4578 {
4579 /*
4580 * Line is just prior to last, move count for last
4581 * This is the common case when loading a new file
4582 */
4583 hp = ml_find_line(buf, buf->b_ml.ml_line_count, ML_FIND);
4584 if (hp == NULL)
4585 {
4586 buf->b_ml.ml_usedchunks = -1;
4587 return;
4588 }
4589 dp = (DATA_BL *)(hp->bh_data);
4590 if (dp->db_line_count == 1)
4591 rest = dp->db_txt_end - dp->db_txt_start;
4592 else
4593 rest =
4594 ((dp->db_index[dp->db_line_count - 2]) & DB_INDEX_MASK)
4595 - dp->db_txt_start;
4596 curchnk->mlcs_totalsize = rest;
4597 curchnk->mlcs_numlines = 1;
4598 curchnk[-1].mlcs_totalsize -= rest;
4599 curchnk[-1].mlcs_numlines -= 1;
4600 }
4601 }
4602 }
4603 else if (updtype == ML_CHNK_DELLINE)
4604 {
4605 curchnk->mlcs_numlines--;
4606 ml_upd_lastbuf = NULL; /* Force recalc of curix & curline */
4607 if (curix < (buf->b_ml.ml_usedchunks - 1)
4608 && (curchnk->mlcs_numlines + curchnk[1].mlcs_numlines)
4609 <= MLCS_MINL)
4610 {
4611 curix++;
4612 curchnk = buf->b_ml.ml_chunksize + curix;
4613 }
4614 else if (curix == 0 && curchnk->mlcs_numlines <= 0)
4615 {
4616 buf->b_ml.ml_usedchunks--;
4617 mch_memmove(buf->b_ml.ml_chunksize, buf->b_ml.ml_chunksize + 1,
4618 buf->b_ml.ml_usedchunks * sizeof(chunksize_T));
4619 return;
4620 }
4621 else if (curix == 0 || (curchnk->mlcs_numlines > 10
4622 && (curchnk->mlcs_numlines + curchnk[-1].mlcs_numlines)
4623 > MLCS_MINL))
4624 {
4625 return;
4626 }
4627
4628 /* Collapse chunks */
4629 curchnk[-1].mlcs_numlines += curchnk->mlcs_numlines;
4630 curchnk[-1].mlcs_totalsize += curchnk->mlcs_totalsize;
4631 buf->b_ml.ml_usedchunks--;
4632 if (curix < buf->b_ml.ml_usedchunks)
4633 {
4634 mch_memmove(buf->b_ml.ml_chunksize + curix,
4635 buf->b_ml.ml_chunksize + curix + 1,
4636 (buf->b_ml.ml_usedchunks - curix) *
4637 sizeof(chunksize_T));
4638 }
4639 return;
4640 }
4641 ml_upd_lastbuf = buf;
4642 ml_upd_lastline = line;
4643 ml_upd_lastcurline = curline;
4644 ml_upd_lastcurix = curix;
4645}
4646
4647/*
4648 * Find offset for line or line with offset.
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004649 * Find line with offset if "lnum" is 0; return remaining offset in offp
4650 * Find offset of line if "lnum" > 0
Bram Moolenaar071d4272004-06-13 20:20:40 +00004651 * return -1 if information is not available
4652 */
4653 long
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004654ml_find_line_or_offset(buf, lnum, offp)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004655 buf_T *buf;
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004656 linenr_T lnum;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004657 long *offp;
4658{
4659 linenr_T curline;
4660 int curix;
4661 long size;
4662 bhdr_T *hp;
4663 DATA_BL *dp;
4664 int count; /* number of entries in block */
4665 int idx;
4666 int start_idx;
4667 int text_end;
4668 long offset;
4669 int len;
4670 int ffdos = (get_fileformat(buf) == EOL_DOS);
4671 int extra = 0;
4672
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004673 /* take care of cached line first */
4674 ml_flush_line(curbuf);
4675
Bram Moolenaar071d4272004-06-13 20:20:40 +00004676 if (buf->b_ml.ml_usedchunks == -1
4677 || buf->b_ml.ml_chunksize == NULL
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004678 || lnum < 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004679 return -1;
4680
4681 if (offp == NULL)
4682 offset = 0;
4683 else
4684 offset = *offp;
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004685 if (lnum == 0 && offset <= 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004686 return 1; /* Not a "find offset" and offset 0 _must_ be in line 1 */
4687 /*
4688 * Find the last chunk before the one containing our line. Last chunk is
4689 * special because it will never qualify
4690 */
4691 curline = 1;
4692 curix = size = 0;
4693 while (curix < buf->b_ml.ml_usedchunks - 1
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004694 && ((lnum != 0
4695 && lnum >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004696 || (offset != 0
4697 && offset > size + buf->b_ml.ml_chunksize[curix].mlcs_totalsize
4698 + ffdos * buf->b_ml.ml_chunksize[curix].mlcs_numlines)))
4699 {
4700 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4701 size += buf->b_ml.ml_chunksize[curix].mlcs_totalsize;
4702 if (offset && ffdos)
4703 size += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4704 curix++;
4705 }
4706
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004707 while ((lnum != 0 && curline < lnum) || (offset != 0 && size < offset))
Bram Moolenaar071d4272004-06-13 20:20:40 +00004708 {
4709 if (curline > buf->b_ml.ml_line_count
4710 || (hp = ml_find_line(buf, curline, ML_FIND)) == NULL)
4711 return -1;
4712 dp = (DATA_BL *)(hp->bh_data);
4713 count = (long)(buf->b_ml.ml_locked_high) -
4714 (long)(buf->b_ml.ml_locked_low) + 1;
4715 start_idx = idx = curline - buf->b_ml.ml_locked_low;
4716 if (idx == 0)/* first line in block, text at the end */
4717 text_end = dp->db_txt_end;
4718 else
4719 text_end = ((dp->db_index[idx - 1]) & DB_INDEX_MASK);
4720 /* Compute index of last line to use in this MEMLINE */
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004721 if (lnum != 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004722 {
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004723 if (curline + (count - idx) >= lnum)
4724 idx += lnum - curline - 1;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004725 else
4726 idx = count - 1;
4727 }
4728 else
4729 {
4730 extra = 0;
4731 while (offset >= size
4732 + text_end - (int)((dp->db_index[idx]) & DB_INDEX_MASK)
4733 + ffdos)
4734 {
4735 if (ffdos)
4736 size++;
4737 if (idx == count - 1)
4738 {
4739 extra = 1;
4740 break;
4741 }
4742 idx++;
4743 }
4744 }
4745 len = text_end - ((dp->db_index[idx]) & DB_INDEX_MASK);
4746 size += len;
4747 if (offset != 0 && size >= offset)
4748 {
4749 if (size + ffdos == offset)
4750 *offp = 0;
4751 else if (idx == start_idx)
4752 *offp = offset - size + len;
4753 else
4754 *offp = offset - size + len
4755 - (text_end - ((dp->db_index[idx - 1]) & DB_INDEX_MASK));
4756 curline += idx - start_idx + extra;
4757 if (curline > buf->b_ml.ml_line_count)
4758 return -1; /* exactly one byte beyond the end */
4759 return curline;
4760 }
4761 curline = buf->b_ml.ml_locked_high + 1;
4762 }
4763
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004764 if (lnum != 0)
Bram Moolenaar5eb86f92004-07-26 12:53:41 +00004765 {
4766 /* Count extra CR characters. */
4767 if (ffdos)
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004768 size += lnum - 1;
Bram Moolenaar5eb86f92004-07-26 12:53:41 +00004769
4770 /* Don't count the last line break if 'bin' and 'noeol'. */
4771 if (buf->b_p_bin && !buf->b_p_eol)
4772 size -= ffdos + 1;
4773 }
4774
Bram Moolenaar071d4272004-06-13 20:20:40 +00004775 return size;
4776}
4777
4778/*
4779 * Goto byte in buffer with offset 'cnt'.
4780 */
4781 void
4782goto_byte(cnt)
4783 long cnt;
4784{
4785 long boff = cnt;
4786 linenr_T lnum;
4787
4788 ml_flush_line(curbuf); /* cached line may be dirty */
4789 setpcmark();
4790 if (boff)
4791 --boff;
4792 lnum = ml_find_line_or_offset(curbuf, (linenr_T)0, &boff);
4793 if (lnum < 1) /* past the end */
4794 {
4795 curwin->w_cursor.lnum = curbuf->b_ml.ml_line_count;
4796 curwin->w_curswant = MAXCOL;
4797 coladvance((colnr_T)MAXCOL);
4798 }
4799 else
4800 {
4801 curwin->w_cursor.lnum = lnum;
4802 curwin->w_cursor.col = (colnr_T)boff;
Bram Moolenaar943d2b52005-12-02 00:50:49 +00004803# ifdef FEAT_VIRTUALEDIT
4804 curwin->w_cursor.coladd = 0;
4805# endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004806 curwin->w_set_curswant = TRUE;
4807 }
4808 check_cursor();
4809
4810# ifdef FEAT_MBYTE
4811 /* Make sure the cursor is on the first byte of a multi-byte char. */
4812 if (has_mbyte)
4813 mb_adjust_cursor();
4814# endif
4815}
4816#endif