blob: ea7d0e13b28a61d9cb76c837f899157a75beeb74 [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 }
Bram Moolenaardf88dda2007-01-09 13:34:50 +00001332 if (buf != NULL)
1333 {
1334 vim_free(buf->b_ml.ml_stack);
1335 vim_free(buf);
1336 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00001337 if (serious_error && called_from_main)
1338 ml_close(curbuf, TRUE);
1339#ifdef FEAT_AUTOCMD
1340 else
1341 {
1342 apply_autocmds(EVENT_BUFREADPOST, NULL, curbuf->b_fname, FALSE, curbuf);
1343 apply_autocmds(EVENT_BUFWINENTER, NULL, curbuf->b_fname, FALSE, curbuf);
1344 }
1345#endif
1346 return;
1347}
1348
1349/*
1350 * Find the names of swap files in current directory and the directory given
1351 * with the 'directory' option.
1352 *
1353 * Used to:
1354 * - list the swap files for "vim -r"
1355 * - count the number of swap files when recovering
1356 * - list the swap files when recovering
1357 * - find the name of the n'th swap file when recovering
1358 */
1359 int
1360recover_names(fname, list, nr)
1361 char_u **fname; /* base for swap file name */
1362 int list; /* when TRUE, list the swap file names */
1363 int nr; /* when non-zero, return nr'th swap file name */
1364{
1365 int num_names;
1366 char_u *(names[6]);
1367 char_u *tail;
1368 char_u *p;
1369 int num_files;
1370 int file_count = 0;
1371 char_u **files;
1372 int i;
1373 char_u *dirp;
1374 char_u *dir_name;
1375
1376 if (list)
1377 {
1378 /* use msg() to start the scrolling properly */
1379 msg((char_u *)_("Swap files found:"));
1380 msg_putchar('\n');
1381 }
1382
1383 /*
1384 * Do the loop for every directory in 'directory'.
1385 * First allocate some memory to put the directory name in.
1386 */
1387 dir_name = alloc((unsigned)STRLEN(p_dir) + 1);
1388 dirp = p_dir;
1389 while (dir_name != NULL && *dirp)
1390 {
1391 /*
1392 * Isolate a directory name from *dirp and put it in dir_name (we know
1393 * it is large enough, so use 31000 for length).
1394 * Advance dirp to next directory name.
1395 */
1396 (void)copy_option_part(&dirp, dir_name, 31000, ",");
1397
1398 if (dir_name[0] == '.' && dir_name[1] == NUL) /* check current dir */
1399 {
1400 if (fname == NULL || *fname == NULL)
1401 {
1402#ifdef VMS
1403 names[0] = vim_strsave((char_u *)"*_sw%");
1404#else
1405# ifdef RISCOS
1406 names[0] = vim_strsave((char_u *)"*_sw#");
1407# else
1408 names[0] = vim_strsave((char_u *)"*.sw?");
1409# endif
1410#endif
Bram Moolenaar2cc93182006-10-10 19:56:03 +00001411#if defined(UNIX) || defined(WIN3264)
1412 /* For Unix names starting with a dot are special. MS-Windows
1413 * supports this too, on some file systems. */
Bram Moolenaar071d4272004-06-13 20:20:40 +00001414 names[1] = vim_strsave((char_u *)".*.sw?");
1415 names[2] = vim_strsave((char_u *)".sw?");
1416 num_names = 3;
1417#else
1418# ifdef VMS
1419 names[1] = vim_strsave((char_u *)".*_sw%");
1420 num_names = 2;
1421# else
1422 num_names = 1;
1423# endif
1424#endif
1425 }
1426 else
1427 num_names = recov_file_names(names, *fname, TRUE);
1428 }
1429 else /* check directory dir_name */
1430 {
1431 if (fname == NULL || *fname == NULL)
1432 {
1433#ifdef VMS
1434 names[0] = concat_fnames(dir_name, (char_u *)"*_sw%", TRUE);
1435#else
1436# ifdef RISCOS
1437 names[0] = concat_fnames(dir_name, (char_u *)"*_sw#", TRUE);
1438# else
1439 names[0] = concat_fnames(dir_name, (char_u *)"*.sw?", TRUE);
1440# endif
1441#endif
Bram Moolenaar2cc93182006-10-10 19:56:03 +00001442#if defined(UNIX) || defined(WIN3264)
1443 /* For Unix names starting with a dot are special. MS-Windows
1444 * supports this too, on some file systems. */
Bram Moolenaar071d4272004-06-13 20:20:40 +00001445 names[1] = concat_fnames(dir_name, (char_u *)".*.sw?", TRUE);
1446 names[2] = concat_fnames(dir_name, (char_u *)".sw?", TRUE);
1447 num_names = 3;
1448#else
1449# ifdef VMS
1450 names[1] = concat_fnames(dir_name, (char_u *)".*_sw%", TRUE);
1451 num_names = 2;
1452# else
1453 num_names = 1;
1454# endif
1455#endif
1456 }
1457 else
1458 {
1459#if defined(UNIX) || defined(WIN3264)
1460 p = dir_name + STRLEN(dir_name);
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001461 if (after_pathsep(dir_name, p) && p[-1] == p[-2])
Bram Moolenaar071d4272004-06-13 20:20:40 +00001462 {
1463 /* Ends with '//', Use Full path for swap name */
1464 tail = make_percent_swname(dir_name, *fname);
1465 }
1466 else
1467#endif
1468 {
1469 tail = gettail(*fname);
1470 tail = concat_fnames(dir_name, tail, TRUE);
1471 }
1472 if (tail == NULL)
1473 num_names = 0;
1474 else
1475 {
1476 num_names = recov_file_names(names, tail, FALSE);
1477 vim_free(tail);
1478 }
1479 }
1480 }
1481
1482 /* check for out-of-memory */
1483 for (i = 0; i < num_names; ++i)
1484 {
1485 if (names[i] == NULL)
1486 {
1487 for (i = 0; i < num_names; ++i)
1488 vim_free(names[i]);
1489 num_names = 0;
1490 }
1491 }
1492 if (num_names == 0)
1493 num_files = 0;
1494 else if (expand_wildcards(num_names, names, &num_files, &files,
1495 EW_KEEPALL|EW_FILE|EW_SILENT) == FAIL)
1496 num_files = 0;
1497
1498 /*
1499 * When no swap file found, wildcard expansion might have failed (e.g.
1500 * not able to execute the shell).
1501 * Try finding a swap file by simply adding ".swp" to the file name.
1502 */
1503 if (*dirp == NUL && file_count + num_files == 0
1504 && fname != NULL && *fname != NULL)
1505 {
1506 struct stat st;
1507 char_u *swapname;
1508
1509#if defined(VMS) || defined(RISCOS)
1510 swapname = modname(*fname, (char_u *)"_swp", FALSE);
1511#else
1512 swapname = modname(*fname, (char_u *)".swp", TRUE);
1513#endif
1514 if (swapname != NULL)
1515 {
1516 if (mch_stat((char *)swapname, &st) != -1) /* It exists! */
1517 {
1518 files = (char_u **)alloc((unsigned)sizeof(char_u *));
1519 if (files != NULL)
1520 {
1521 files[0] = swapname;
1522 swapname = NULL;
1523 num_files = 1;
1524 }
1525 }
1526 vim_free(swapname);
1527 }
1528 }
1529
1530 /*
1531 * remove swapfile name of the current buffer, it must be ignored
1532 */
1533 if (curbuf->b_ml.ml_mfp != NULL
1534 && (p = curbuf->b_ml.ml_mfp->mf_fname) != NULL)
1535 {
1536 for (i = 0; i < num_files; ++i)
1537 if (fullpathcmp(p, files[i], TRUE) & FPC_SAME)
1538 {
1539 vim_free(files[i]);
1540 --num_files;
1541 for ( ; i < num_files; ++i)
1542 files[i] = files[i + 1];
1543 }
1544 }
Bram Moolenaarfc1421e2006-04-20 22:17:20 +00001545 if (nr > 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00001546 {
1547 file_count += num_files;
1548 if (nr <= file_count)
1549 {
1550 *fname = vim_strsave(files[nr - 1 + num_files - file_count]);
1551 dirp = (char_u *)""; /* stop searching */
1552 }
1553 }
1554 else if (list)
1555 {
1556 if (dir_name[0] == '.' && dir_name[1] == NUL)
1557 {
1558 if (fname == NULL || *fname == NULL)
1559 MSG_PUTS(_(" In current directory:\n"));
1560 else
1561 MSG_PUTS(_(" Using specified name:\n"));
1562 }
1563 else
1564 {
1565 MSG_PUTS(_(" In directory "));
1566 msg_home_replace(dir_name);
1567 MSG_PUTS(":\n");
1568 }
1569
1570 if (num_files)
1571 {
1572 for (i = 0; i < num_files; ++i)
1573 {
1574 /* print the swap file name */
1575 msg_outnum((long)++file_count);
1576 MSG_PUTS(". ");
1577 msg_puts(gettail(files[i]));
1578 msg_putchar('\n');
1579 (void)swapfile_info(files[i]);
1580 }
1581 }
1582 else
1583 MSG_PUTS(_(" -- none --\n"));
1584 out_flush();
1585 }
1586 else
1587 file_count += num_files;
1588
1589 for (i = 0; i < num_names; ++i)
1590 vim_free(names[i]);
Bram Moolenaarfc1421e2006-04-20 22:17:20 +00001591 if (num_files > 0)
1592 FreeWild(num_files, files);
Bram Moolenaar071d4272004-06-13 20:20:40 +00001593 }
1594 vim_free(dir_name);
1595 return file_count;
1596}
1597
1598#if defined(UNIX) || defined(WIN3264) /* Need _very_ long file names */
1599/*
1600 * Append the full path to name with path separators made into percent
1601 * signs, to dir. An unnamed buffer is handled as "" (<currentdir>/"")
1602 */
1603 static char_u *
1604make_percent_swname(dir, name)
1605 char_u *dir;
1606 char_u *name;
1607{
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001608 char_u *d, *s, *f;
Bram Moolenaar071d4272004-06-13 20:20:40 +00001609
1610 f = fix_fname(name != NULL ? name : (char_u *) "");
1611 d = NULL;
1612 if (f != NULL)
1613 {
1614 s = alloc((unsigned)(STRLEN(f) + 1));
1615 if (s != NULL)
1616 {
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001617 STRCPY(s, f);
1618 for (d = s; *d != NUL; mb_ptr_adv(d))
1619 if (vim_ispathsep(*d))
1620 *d = '%';
Bram Moolenaar071d4272004-06-13 20:20:40 +00001621 d = concat_fnames(dir, s, TRUE);
1622 vim_free(s);
1623 }
1624 vim_free(f);
1625 }
1626 return d;
1627}
1628#endif
1629
1630#if (defined(UNIX) || defined(__EMX__) || defined(VMS)) && (defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG))
1631static int process_still_running;
1632#endif
1633
1634/*
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00001635 * Give information about an existing swap file.
Bram Moolenaar071d4272004-06-13 20:20:40 +00001636 * Returns timestamp (0 when unknown).
1637 */
1638 static time_t
1639swapfile_info(fname)
1640 char_u *fname;
1641{
1642 struct stat st;
1643 int fd;
1644 struct block0 b0;
1645 time_t x = (time_t)0;
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00001646 char *p;
Bram Moolenaar071d4272004-06-13 20:20:40 +00001647#ifdef UNIX
1648 char_u uname[B0_UNAME_SIZE];
1649#endif
1650
1651 /* print the swap file date */
1652 if (mch_stat((char *)fname, &st) != -1)
1653 {
1654#ifdef UNIX
1655 /* print name of owner of the file */
1656 if (mch_get_uname(st.st_uid, uname, B0_UNAME_SIZE) == OK)
1657 {
1658 MSG_PUTS(_(" owned by: "));
1659 msg_outtrans(uname);
1660 MSG_PUTS(_(" dated: "));
1661 }
1662 else
1663#endif
1664 MSG_PUTS(_(" dated: "));
1665 x = st.st_mtime; /* Manx C can't do &st.st_mtime */
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00001666 p = ctime(&x); /* includes '\n' */
1667 if (p == NULL)
1668 MSG_PUTS("(invalid)\n");
1669 else
1670 MSG_PUTS(p);
Bram Moolenaar071d4272004-06-13 20:20:40 +00001671 }
1672
1673 /*
1674 * print the original file name
1675 */
1676 fd = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
1677 if (fd >= 0)
1678 {
1679 if (read(fd, (char *)&b0, sizeof(b0)) == sizeof(b0))
1680 {
1681 if (STRNCMP(b0.b0_version, "VIM 3.0", 7) == 0)
1682 {
1683 MSG_PUTS(_(" [from Vim version 3.0]"));
1684 }
1685 else if (b0.b0_id[0] != BLOCK0_ID0 || b0.b0_id[1] != BLOCK0_ID1)
1686 {
1687 MSG_PUTS(_(" [does not look like a Vim swap file]"));
1688 }
1689 else
1690 {
1691 MSG_PUTS(_(" file name: "));
1692 if (b0.b0_fname[0] == NUL)
Bram Moolenaar69a7cb42004-06-20 12:51:53 +00001693 MSG_PUTS(_("[No Name]"));
Bram Moolenaar071d4272004-06-13 20:20:40 +00001694 else
1695 msg_outtrans(b0.b0_fname);
1696
1697 MSG_PUTS(_("\n modified: "));
1698 MSG_PUTS(b0.b0_dirty ? _("YES") : _("no"));
1699
1700 if (*(b0.b0_uname) != NUL)
1701 {
1702 MSG_PUTS(_("\n user name: "));
1703 msg_outtrans(b0.b0_uname);
1704 }
1705
1706 if (*(b0.b0_hname) != NUL)
1707 {
1708 if (*(b0.b0_uname) != NUL)
1709 MSG_PUTS(_(" host name: "));
1710 else
1711 MSG_PUTS(_("\n host name: "));
1712 msg_outtrans(b0.b0_hname);
1713 }
1714
1715 if (char_to_long(b0.b0_pid) != 0L)
1716 {
1717 MSG_PUTS(_("\n process ID: "));
1718 msg_outnum(char_to_long(b0.b0_pid));
1719#if defined(UNIX) || defined(__EMX__)
1720 /* EMX kill() not working correctly, it seems */
1721 if (kill((pid_t)char_to_long(b0.b0_pid), 0) == 0)
1722 {
1723 MSG_PUTS(_(" (still running)"));
1724# if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)
1725 process_still_running = TRUE;
1726# endif
1727 }
1728#endif
1729 }
1730
1731 if (b0_magic_wrong(&b0))
1732 {
1733#if defined(MSDOS) || defined(MSWIN)
1734 if (STRNCMP(b0.b0_hname, "PC ", 3) == 0)
1735 MSG_PUTS(_("\n [not usable with this version of Vim]"));
1736 else
1737#endif
1738 MSG_PUTS(_("\n [not usable on this computer]"));
1739 }
1740 }
1741 }
1742 else
1743 MSG_PUTS(_(" [cannot be read]"));
1744 close(fd);
1745 }
1746 else
1747 MSG_PUTS(_(" [cannot be opened]"));
1748 msg_putchar('\n');
1749
1750 return x;
1751}
1752
1753 static int
1754recov_file_names(names, path, prepend_dot)
1755 char_u **names;
1756 char_u *path;
1757 int prepend_dot;
1758{
1759 int num_names;
1760
1761#ifdef SHORT_FNAME
1762 /*
1763 * (MS-DOS) always short names
1764 */
1765 names[0] = modname(path, (char_u *)".sw?", FALSE);
1766 num_names = 1;
1767#else /* !SHORT_FNAME */
1768 /*
1769 * (Win32 and Win64) never short names, but do prepend a dot.
1770 * (Not MS-DOS or Win32 or Win64) maybe short name, maybe not: Try both.
1771 * Only use the short name if it is different.
1772 */
1773 char_u *p;
1774 int i;
1775# ifndef WIN3264
1776 int shortname = curbuf->b_shortname;
1777
1778 curbuf->b_shortname = FALSE;
1779# endif
1780
1781 num_names = 0;
1782
1783 /*
1784 * May also add the file name with a dot prepended, for swap file in same
1785 * dir as original file.
1786 */
1787 if (prepend_dot)
1788 {
1789 names[num_names] = modname(path, (char_u *)".sw?", TRUE);
1790 if (names[num_names] == NULL)
1791 goto end;
1792 ++num_names;
1793 }
1794
1795 /*
1796 * Form the normal swap file name pattern by appending ".sw?".
1797 */
1798#ifdef VMS
1799 names[num_names] = concat_fnames(path, (char_u *)"_sw%", FALSE);
1800#else
1801# ifdef RISCOS
1802 names[num_names] = concat_fnames(path, (char_u *)"_sw#", FALSE);
1803# else
1804 names[num_names] = concat_fnames(path, (char_u *)".sw?", FALSE);
1805# endif
1806#endif
1807 if (names[num_names] == NULL)
1808 goto end;
1809 if (num_names >= 1) /* check if we have the same name twice */
1810 {
1811 p = names[num_names - 1];
1812 i = (int)STRLEN(names[num_names - 1]) - (int)STRLEN(names[num_names]);
1813 if (i > 0)
1814 p += i; /* file name has been expanded to full path */
1815
1816 if (STRCMP(p, names[num_names]) != 0)
1817 ++num_names;
1818 else
1819 vim_free(names[num_names]);
1820 }
1821 else
1822 ++num_names;
1823
1824# ifndef WIN3264
1825 /*
1826 * Also try with 'shortname' set, in case the file is on a DOS filesystem.
1827 */
1828 curbuf->b_shortname = TRUE;
1829#ifdef VMS
1830 names[num_names] = modname(path, (char_u *)"_sw%", FALSE);
1831#else
1832# ifdef RISCOS
1833 names[num_names] = modname(path, (char_u *)"_sw#", FALSE);
1834# else
1835 names[num_names] = modname(path, (char_u *)".sw?", FALSE);
1836# endif
1837#endif
1838 if (names[num_names] == NULL)
1839 goto end;
1840
1841 /*
1842 * Remove the one from 'shortname', if it's the same as with 'noshortname'.
1843 */
1844 p = names[num_names];
1845 i = STRLEN(names[num_names]) - STRLEN(names[num_names - 1]);
1846 if (i > 0)
1847 p += i; /* file name has been expanded to full path */
1848 if (STRCMP(names[num_names - 1], p) == 0)
1849 vim_free(names[num_names]);
1850 else
1851 ++num_names;
1852# endif
1853
1854end:
1855# ifndef WIN3264
1856 curbuf->b_shortname = shortname;
1857# endif
1858
1859#endif /* !SHORT_FNAME */
1860
1861 return num_names;
1862}
1863
1864/*
1865 * sync all memlines
1866 *
1867 * If 'check_file' is TRUE, check if original file exists and was not changed.
1868 * If 'check_char' is TRUE, stop syncing when character becomes available, but
1869 * always sync at least one block.
1870 */
1871 void
1872ml_sync_all(check_file, check_char)
1873 int check_file;
1874 int check_char;
1875{
1876 buf_T *buf;
1877 struct stat st;
1878
1879 for (buf = firstbuf; buf != NULL; buf = buf->b_next)
1880 {
1881 if (buf->b_ml.ml_mfp == NULL || buf->b_ml.ml_mfp->mf_fname == NULL)
1882 continue; /* no file */
1883
1884 ml_flush_line(buf); /* flush buffered line */
1885 /* flush locked block */
1886 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH);
1887 if (bufIsChanged(buf) && check_file && mf_need_trans(buf->b_ml.ml_mfp)
1888 && buf->b_ffname != NULL)
1889 {
1890 /*
1891 * If the original file does not exist anymore or has been changed
1892 * call ml_preserve() to get rid of all negative numbered blocks.
1893 */
1894 if (mch_stat((char *)buf->b_ffname, &st) == -1
1895 || st.st_mtime != buf->b_mtime_read
1896 || (size_t)st.st_size != buf->b_orig_size)
1897 {
1898 ml_preserve(buf, FALSE);
1899 did_check_timestamps = FALSE;
1900 need_check_timestamps = TRUE; /* give message later */
1901 }
1902 }
1903 if (buf->b_ml.ml_mfp->mf_dirty)
1904 {
1905 (void)mf_sync(buf->b_ml.ml_mfp, (check_char ? MFS_STOP : 0)
1906 | (bufIsChanged(buf) ? MFS_FLUSH : 0));
1907 if (check_char && ui_char_avail()) /* character available now */
1908 break;
1909 }
1910 }
1911}
1912
1913/*
1914 * sync one buffer, including negative blocks
1915 *
1916 * after this all the blocks are in the swap file
1917 *
1918 * Used for the :preserve command and when the original file has been
1919 * changed or deleted.
1920 *
1921 * when message is TRUE the success of preserving is reported
1922 */
1923 void
1924ml_preserve(buf, message)
1925 buf_T *buf;
1926 int message;
1927{
1928 bhdr_T *hp;
1929 linenr_T lnum;
1930 memfile_T *mfp = buf->b_ml.ml_mfp;
1931 int status;
1932 int got_int_save = got_int;
1933
1934 if (mfp == NULL || mfp->mf_fname == NULL)
1935 {
1936 if (message)
1937 EMSG(_("E313: Cannot preserve, there is no swap file"));
1938 return;
1939 }
1940
1941 /* We only want to stop when interrupted here, not when interrupted
1942 * before. */
1943 got_int = FALSE;
1944
1945 ml_flush_line(buf); /* flush buffered line */
1946 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush locked block */
1947 status = mf_sync(mfp, MFS_ALL | MFS_FLUSH);
1948
1949 /* stack is invalid after mf_sync(.., MFS_ALL) */
1950 buf->b_ml.ml_stack_top = 0;
1951
1952 /*
1953 * Some of the data blocks may have been changed from negative to
1954 * positive block number. In that case the pointer blocks need to be
1955 * updated.
1956 *
1957 * We don't know in which pointer block the references are, so we visit
1958 * all data blocks until there are no more translations to be done (or
1959 * we hit the end of the file, which can only happen in case a write fails,
1960 * e.g. when file system if full).
1961 * ml_find_line() does the work by translating the negative block numbers
1962 * when getting the first line of each data block.
1963 */
1964 if (mf_need_trans(mfp) && !got_int)
1965 {
1966 lnum = 1;
1967 while (mf_need_trans(mfp) && lnum <= buf->b_ml.ml_line_count)
1968 {
1969 hp = ml_find_line(buf, lnum, ML_FIND);
1970 if (hp == NULL)
1971 {
1972 status = FAIL;
1973 goto theend;
1974 }
1975 CHECK(buf->b_ml.ml_locked_low != lnum, "low != lnum");
1976 lnum = buf->b_ml.ml_locked_high + 1;
1977 }
1978 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush locked block */
1979 /* sync the updated pointer blocks */
1980 if (mf_sync(mfp, MFS_ALL | MFS_FLUSH) == FAIL)
1981 status = FAIL;
1982 buf->b_ml.ml_stack_top = 0; /* stack is invalid now */
1983 }
1984theend:
1985 got_int |= got_int_save;
1986
1987 if (message)
1988 {
1989 if (status == OK)
1990 MSG(_("File preserved"));
1991 else
1992 EMSG(_("E314: Preserve failed"));
1993 }
1994}
1995
1996/*
1997 * NOTE: The pointer returned by the ml_get_*() functions only remains valid
1998 * until the next call!
1999 * line1 = ml_get(1);
2000 * line2 = ml_get(2); // line1 is now invalid!
2001 * Make a copy of the line if necessary.
2002 */
2003/*
2004 * get a pointer to a (read-only copy of a) line
2005 *
2006 * On failure an error message is given and IObuff is returned (to avoid
2007 * having to check for error everywhere).
2008 */
2009 char_u *
2010ml_get(lnum)
2011 linenr_T lnum;
2012{
2013 return ml_get_buf(curbuf, lnum, FALSE);
2014}
2015
2016/*
2017 * ml_get_pos: get pointer to position 'pos'
2018 */
2019 char_u *
2020ml_get_pos(pos)
2021 pos_T *pos;
2022{
2023 return (ml_get_buf(curbuf, pos->lnum, FALSE) + pos->col);
2024}
2025
2026/*
2027 * ml_get_curline: get pointer to cursor line.
2028 */
2029 char_u *
2030ml_get_curline()
2031{
2032 return ml_get_buf(curbuf, curwin->w_cursor.lnum, FALSE);
2033}
2034
2035/*
2036 * ml_get_cursor: get pointer to cursor position
2037 */
2038 char_u *
2039ml_get_cursor()
2040{
2041 return (ml_get_buf(curbuf, curwin->w_cursor.lnum, FALSE) +
2042 curwin->w_cursor.col);
2043}
2044
2045/*
2046 * get a pointer to a line in a specific buffer
2047 *
2048 * "will_change": if TRUE mark the buffer dirty (chars in the line will be
2049 * changed)
2050 */
2051 char_u *
2052ml_get_buf(buf, lnum, will_change)
2053 buf_T *buf;
2054 linenr_T lnum;
2055 int will_change; /* line will be changed */
2056{
2057 bhdr_T *hp;
2058 DATA_BL *dp;
2059 char_u *ptr;
2060
2061 if (lnum > buf->b_ml.ml_line_count) /* invalid line number */
2062 {
2063 EMSGN(_("E315: ml_get: invalid lnum: %ld"), lnum);
2064errorret:
2065 STRCPY(IObuff, "???");
2066 return IObuff;
2067 }
2068 if (lnum <= 0) /* pretend line 0 is line 1 */
2069 lnum = 1;
2070
2071 if (buf->b_ml.ml_mfp == NULL) /* there are no lines */
2072 return (char_u *)"";
2073
2074/*
2075 * See if it is the same line as requested last time.
2076 * Otherwise may need to flush last used line.
2077 */
2078 if (buf->b_ml.ml_line_lnum != lnum)
2079 {
2080 ml_flush_line(buf);
2081
2082 /*
2083 * Find the data block containing the line.
2084 * This also fills the stack with the blocks from the root to the data
2085 * block and releases any locked block.
2086 */
2087 if ((hp = ml_find_line(buf, lnum, ML_FIND)) == NULL)
2088 {
2089 EMSGN(_("E316: ml_get: cannot find line %ld"), lnum);
2090 goto errorret;
2091 }
2092
2093 dp = (DATA_BL *)(hp->bh_data);
2094
2095 ptr = (char_u *)dp + ((dp->db_index[lnum - buf->b_ml.ml_locked_low]) & DB_INDEX_MASK);
2096 buf->b_ml.ml_line_ptr = ptr;
2097 buf->b_ml.ml_line_lnum = lnum;
2098 buf->b_ml.ml_flags &= ~ML_LINE_DIRTY;
2099 }
2100 if (will_change)
2101 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
2102
2103 return buf->b_ml.ml_line_ptr;
2104}
2105
2106/*
2107 * Check if a line that was just obtained by a call to ml_get
2108 * is in allocated memory.
2109 */
2110 int
2111ml_line_alloced()
2112{
2113 return (curbuf->b_ml.ml_flags & ML_LINE_DIRTY);
2114}
2115
2116/*
2117 * Append a line after lnum (may be 0 to insert a line in front of the file).
2118 * "line" does not need to be allocated, but can't be another line in a
2119 * buffer, unlocking may make it invalid.
2120 *
2121 * newfile: TRUE when starting to edit a new file, meaning that pe_old_lnum
2122 * will be set for recovery
2123 * Check: The caller of this function should probably also call
2124 * appended_lines().
2125 *
2126 * return FAIL for failure, OK otherwise
2127 */
2128 int
2129ml_append(lnum, line, len, newfile)
2130 linenr_T lnum; /* append after this line (can be 0) */
2131 char_u *line; /* text of the new line */
2132 colnr_T len; /* length of new line, including NUL, or 0 */
2133 int newfile; /* flag, see above */
2134{
2135 /* When starting up, we might still need to create the memfile */
2136 if (curbuf->b_ml.ml_mfp == NULL && open_buffer(FALSE, NULL) == FAIL)
2137 return FAIL;
2138
2139 if (curbuf->b_ml.ml_line_lnum != 0)
2140 ml_flush_line(curbuf);
2141 return ml_append_int(curbuf, lnum, line, len, newfile, FALSE);
2142}
2143
Bram Moolenaara1956f62006-03-12 22:18:00 +00002144#if defined(FEAT_SPELL) || defined(PROTO)
Bram Moolenaar4770d092006-01-12 23:22:24 +00002145/*
2146 * Like ml_append() but for an arbitrary buffer. The buffer must already have
2147 * a memline.
2148 */
2149 int
2150ml_append_buf(buf, lnum, line, len, newfile)
2151 buf_T *buf;
2152 linenr_T lnum; /* append after this line (can be 0) */
2153 char_u *line; /* text of the new line */
2154 colnr_T len; /* length of new line, including NUL, or 0 */
2155 int newfile; /* flag, see above */
2156{
2157 if (buf->b_ml.ml_mfp == NULL)
2158 return FAIL;
2159
2160 if (buf->b_ml.ml_line_lnum != 0)
2161 ml_flush_line(buf);
2162 return ml_append_int(buf, lnum, line, len, newfile, FALSE);
2163}
2164#endif
2165
Bram Moolenaar071d4272004-06-13 20:20:40 +00002166 static int
2167ml_append_int(buf, lnum, line, len, newfile, mark)
2168 buf_T *buf;
2169 linenr_T lnum; /* append after this line (can be 0) */
2170 char_u *line; /* text of the new line */
2171 colnr_T len; /* length of line, including NUL, or 0 */
2172 int newfile; /* flag, see above */
2173 int mark; /* mark the new line */
2174{
2175 int i;
2176 int line_count; /* number of indexes in current block */
2177 int offset;
2178 int from, to;
2179 int space_needed; /* space needed for new line */
2180 int page_size;
2181 int page_count;
2182 int db_idx; /* index for lnum in data block */
2183 bhdr_T *hp;
2184 memfile_T *mfp;
2185 DATA_BL *dp;
2186 PTR_BL *pp;
2187 infoptr_T *ip;
2188
2189 /* lnum out of range */
2190 if (lnum > buf->b_ml.ml_line_count || buf->b_ml.ml_mfp == NULL)
2191 return FAIL;
2192
2193 if (lowest_marked && lowest_marked > lnum)
2194 lowest_marked = lnum + 1;
2195
2196 if (len == 0)
2197 len = (colnr_T)STRLEN(line) + 1; /* space needed for the text */
2198 space_needed = len + INDEX_SIZE; /* space needed for text + index */
2199
2200 mfp = buf->b_ml.ml_mfp;
2201 page_size = mfp->mf_page_size;
2202
2203/*
2204 * find the data block containing the previous line
2205 * This also fills the stack with the blocks from the root to the data block
2206 * This also releases any locked block.
2207 */
2208 if ((hp = ml_find_line(buf, lnum == 0 ? (linenr_T)1 : lnum,
2209 ML_INSERT)) == NULL)
2210 return FAIL;
2211
2212 buf->b_ml.ml_flags &= ~ML_EMPTY;
2213
2214 if (lnum == 0) /* got line one instead, correct db_idx */
2215 db_idx = -1; /* careful, it is negative! */
2216 else
2217 db_idx = lnum - buf->b_ml.ml_locked_low;
2218 /* get line count before the insertion */
2219 line_count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low;
2220
2221 dp = (DATA_BL *)(hp->bh_data);
2222
2223/*
2224 * If
2225 * - there is not enough room in the current block
2226 * - appending to the last line in the block
2227 * - not appending to the last line in the file
2228 * insert in front of the next block.
2229 */
2230 if ((int)dp->db_free < space_needed && db_idx == line_count - 1
2231 && lnum < buf->b_ml.ml_line_count)
2232 {
2233 /*
2234 * Now that the line is not going to be inserted in the block that we
2235 * expected, the line count has to be adjusted in the pointer blocks
2236 * by using ml_locked_lineadd.
2237 */
2238 --(buf->b_ml.ml_locked_lineadd);
2239 --(buf->b_ml.ml_locked_high);
2240 if ((hp = ml_find_line(buf, lnum + 1, ML_INSERT)) == NULL)
2241 return FAIL;
2242
2243 db_idx = -1; /* careful, it is negative! */
2244 /* get line count before the insertion */
2245 line_count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low;
2246 CHECK(buf->b_ml.ml_locked_low != lnum + 1, "locked_low != lnum + 1");
2247
2248 dp = (DATA_BL *)(hp->bh_data);
2249 }
2250
2251 ++buf->b_ml.ml_line_count;
2252
2253 if ((int)dp->db_free >= space_needed) /* enough room in data block */
2254 {
2255/*
2256 * Insert new line in existing data block, or in data block allocated above.
2257 */
2258 dp->db_txt_start -= len;
2259 dp->db_free -= space_needed;
2260 ++(dp->db_line_count);
2261
2262 /*
2263 * move the text of the lines that follow to the front
2264 * adjust the indexes of the lines that follow
2265 */
2266 if (line_count > db_idx + 1) /* if there are following lines */
2267 {
2268 /*
2269 * Offset is the start of the previous line.
2270 * This will become the character just after the new line.
2271 */
2272 if (db_idx < 0)
2273 offset = dp->db_txt_end;
2274 else
2275 offset = ((dp->db_index[db_idx]) & DB_INDEX_MASK);
2276 mch_memmove((char *)dp + dp->db_txt_start,
2277 (char *)dp + dp->db_txt_start + len,
2278 (size_t)(offset - (dp->db_txt_start + len)));
2279 for (i = line_count - 1; i > db_idx; --i)
2280 dp->db_index[i + 1] = dp->db_index[i] - len;
2281 dp->db_index[db_idx + 1] = offset - len;
2282 }
2283 else /* add line at the end */
2284 dp->db_index[db_idx + 1] = dp->db_txt_start;
2285
2286 /*
2287 * copy the text into the block
2288 */
2289 mch_memmove((char *)dp + dp->db_index[db_idx + 1], line, (size_t)len);
2290 if (mark)
2291 dp->db_index[db_idx + 1] |= DB_MARKED;
2292
2293 /*
2294 * Mark the block dirty.
2295 */
2296 buf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2297 if (!newfile)
2298 buf->b_ml.ml_flags |= ML_LOCKED_POS;
2299 }
2300 else /* not enough space in data block */
2301 {
2302/*
2303 * If there is not enough room we have to create a new data block and copy some
2304 * lines into it.
2305 * Then we have to insert an entry in the pointer block.
2306 * If this pointer block also is full, we go up another block, and so on, up
2307 * to the root if necessary.
2308 * The line counts in the pointer blocks have already been adjusted by
2309 * ml_find_line().
2310 */
2311 long line_count_left, line_count_right;
2312 int page_count_left, page_count_right;
2313 bhdr_T *hp_left;
2314 bhdr_T *hp_right;
2315 bhdr_T *hp_new;
2316 int lines_moved;
2317 int data_moved = 0; /* init to shut up gcc */
2318 int total_moved = 0; /* init to shut up gcc */
2319 DATA_BL *dp_right, *dp_left;
2320 int stack_idx;
2321 int in_left;
2322 int lineadd;
2323 blocknr_T bnum_left, bnum_right;
2324 linenr_T lnum_left, lnum_right;
2325 int pb_idx;
2326 PTR_BL *pp_new;
2327
2328 /*
2329 * We are going to allocate a new data block. Depending on the
2330 * situation it will be put to the left or right of the existing
2331 * block. If possible we put the new line in the left block and move
2332 * the lines after it to the right block. Otherwise the new line is
2333 * also put in the right block. This method is more efficient when
2334 * inserting a lot of lines at one place.
2335 */
2336 if (db_idx < 0) /* left block is new, right block is existing */
2337 {
2338 lines_moved = 0;
2339 in_left = TRUE;
2340 /* space_needed does not change */
2341 }
2342 else /* left block is existing, right block is new */
2343 {
2344 lines_moved = line_count - db_idx - 1;
2345 if (lines_moved == 0)
2346 in_left = FALSE; /* put new line in right block */
2347 /* space_needed does not change */
2348 else
2349 {
2350 data_moved = ((dp->db_index[db_idx]) & DB_INDEX_MASK) -
2351 dp->db_txt_start;
2352 total_moved = data_moved + lines_moved * INDEX_SIZE;
2353 if ((int)dp->db_free + total_moved >= space_needed)
2354 {
2355 in_left = TRUE; /* put new line in left block */
2356 space_needed = total_moved;
2357 }
2358 else
2359 {
2360 in_left = FALSE; /* put new line in right block */
2361 space_needed += total_moved;
2362 }
2363 }
2364 }
2365
2366 page_count = ((space_needed + HEADER_SIZE) + page_size - 1) / page_size;
2367 if ((hp_new = ml_new_data(mfp, newfile, page_count)) == NULL)
2368 {
2369 /* correct line counts in pointer blocks */
2370 --(buf->b_ml.ml_locked_lineadd);
2371 --(buf->b_ml.ml_locked_high);
2372 return FAIL;
2373 }
2374 if (db_idx < 0) /* left block is new */
2375 {
2376 hp_left = hp_new;
2377 hp_right = hp;
2378 line_count_left = 0;
2379 line_count_right = line_count;
2380 }
2381 else /* right block is new */
2382 {
2383 hp_left = hp;
2384 hp_right = hp_new;
2385 line_count_left = line_count;
2386 line_count_right = 0;
2387 }
2388 dp_right = (DATA_BL *)(hp_right->bh_data);
2389 dp_left = (DATA_BL *)(hp_left->bh_data);
2390 bnum_left = hp_left->bh_bnum;
2391 bnum_right = hp_right->bh_bnum;
2392 page_count_left = hp_left->bh_page_count;
2393 page_count_right = hp_right->bh_page_count;
2394
2395 /*
2396 * May move the new line into the right/new block.
2397 */
2398 if (!in_left)
2399 {
2400 dp_right->db_txt_start -= len;
2401 dp_right->db_free -= len + INDEX_SIZE;
2402 dp_right->db_index[0] = dp_right->db_txt_start;
2403 if (mark)
2404 dp_right->db_index[0] |= DB_MARKED;
2405
2406 mch_memmove((char *)dp_right + dp_right->db_txt_start,
2407 line, (size_t)len);
2408 ++line_count_right;
2409 }
2410 /*
2411 * may move lines from the left/old block to the right/new one.
2412 */
2413 if (lines_moved)
2414 {
2415 /*
2416 */
2417 dp_right->db_txt_start -= data_moved;
2418 dp_right->db_free -= total_moved;
2419 mch_memmove((char *)dp_right + dp_right->db_txt_start,
2420 (char *)dp_left + dp_left->db_txt_start,
2421 (size_t)data_moved);
2422 offset = dp_right->db_txt_start - dp_left->db_txt_start;
2423 dp_left->db_txt_start += data_moved;
2424 dp_left->db_free += total_moved;
2425
2426 /*
2427 * update indexes in the new block
2428 */
2429 for (to = line_count_right, from = db_idx + 1;
2430 from < line_count_left; ++from, ++to)
2431 dp_right->db_index[to] = dp->db_index[from] + offset;
2432 line_count_right += lines_moved;
2433 line_count_left -= lines_moved;
2434 }
2435
2436 /*
2437 * May move the new line into the left (old or new) block.
2438 */
2439 if (in_left)
2440 {
2441 dp_left->db_txt_start -= len;
2442 dp_left->db_free -= len + INDEX_SIZE;
2443 dp_left->db_index[line_count_left] = dp_left->db_txt_start;
2444 if (mark)
2445 dp_left->db_index[line_count_left] |= DB_MARKED;
2446 mch_memmove((char *)dp_left + dp_left->db_txt_start,
2447 line, (size_t)len);
2448 ++line_count_left;
2449 }
2450
2451 if (db_idx < 0) /* left block is new */
2452 {
2453 lnum_left = lnum + 1;
2454 lnum_right = 0;
2455 }
2456 else /* right block is new */
2457 {
2458 lnum_left = 0;
2459 if (in_left)
2460 lnum_right = lnum + 2;
2461 else
2462 lnum_right = lnum + 1;
2463 }
2464 dp_left->db_line_count = line_count_left;
2465 dp_right->db_line_count = line_count_right;
2466
2467 /*
2468 * release the two data blocks
2469 * The new one (hp_new) already has a correct blocknumber.
2470 * The old one (hp, in ml_locked) gets a positive blocknumber if
2471 * we changed it and we are not editing a new file.
2472 */
2473 if (lines_moved || in_left)
2474 buf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2475 if (!newfile && db_idx >= 0 && in_left)
2476 buf->b_ml.ml_flags |= ML_LOCKED_POS;
2477 mf_put(mfp, hp_new, TRUE, FALSE);
2478
2479 /*
2480 * flush the old data block
2481 * set ml_locked_lineadd to 0, because the updating of the
2482 * pointer blocks is done below
2483 */
2484 lineadd = buf->b_ml.ml_locked_lineadd;
2485 buf->b_ml.ml_locked_lineadd = 0;
2486 ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush data block */
2487
2488 /*
2489 * update pointer blocks for the new data block
2490 */
2491 for (stack_idx = buf->b_ml.ml_stack_top - 1; stack_idx >= 0;
2492 --stack_idx)
2493 {
2494 ip = &(buf->b_ml.ml_stack[stack_idx]);
2495 pb_idx = ip->ip_index;
2496 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
2497 return FAIL;
2498 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
2499 if (pp->pb_id != PTR_ID)
2500 {
2501 EMSG(_("E317: pointer block id wrong 3"));
2502 mf_put(mfp, hp, FALSE, FALSE);
2503 return FAIL;
2504 }
2505 /*
2506 * TODO: If the pointer block is full and we are adding at the end
2507 * try to insert in front of the next block
2508 */
2509 /* block not full, add one entry */
2510 if (pp->pb_count < pp->pb_count_max)
2511 {
2512 if (pb_idx + 1 < (int)pp->pb_count)
2513 mch_memmove(&pp->pb_pointer[pb_idx + 2],
2514 &pp->pb_pointer[pb_idx + 1],
2515 (size_t)(pp->pb_count - pb_idx - 1) * sizeof(PTR_EN));
2516 ++pp->pb_count;
2517 pp->pb_pointer[pb_idx].pe_line_count = line_count_left;
2518 pp->pb_pointer[pb_idx].pe_bnum = bnum_left;
2519 pp->pb_pointer[pb_idx].pe_page_count = page_count_left;
2520 pp->pb_pointer[pb_idx + 1].pe_line_count = line_count_right;
2521 pp->pb_pointer[pb_idx + 1].pe_bnum = bnum_right;
2522 pp->pb_pointer[pb_idx + 1].pe_page_count = page_count_right;
2523
2524 if (lnum_left != 0)
2525 pp->pb_pointer[pb_idx].pe_old_lnum = lnum_left;
2526 if (lnum_right != 0)
2527 pp->pb_pointer[pb_idx + 1].pe_old_lnum = lnum_right;
2528
2529 mf_put(mfp, hp, TRUE, FALSE);
2530 buf->b_ml.ml_stack_top = stack_idx + 1; /* truncate stack */
2531
2532 if (lineadd)
2533 {
2534 --(buf->b_ml.ml_stack_top);
2535 /* fix line count for rest of blocks in the stack */
2536 ml_lineadd(buf, lineadd);
2537 /* fix stack itself */
2538 buf->b_ml.ml_stack[buf->b_ml.ml_stack_top].ip_high +=
2539 lineadd;
2540 ++(buf->b_ml.ml_stack_top);
2541 }
2542
2543 /*
2544 * We are finished, break the loop here.
2545 */
2546 break;
2547 }
2548 else /* pointer block full */
2549 {
2550 /*
2551 * split the pointer block
2552 * allocate a new pointer block
2553 * move some of the pointer into the new block
2554 * prepare for updating the parent block
2555 */
2556 for (;;) /* do this twice when splitting block 1 */
2557 {
2558 hp_new = ml_new_ptr(mfp);
2559 if (hp_new == NULL) /* TODO: try to fix tree */
2560 return FAIL;
2561 pp_new = (PTR_BL *)(hp_new->bh_data);
2562
2563 if (hp->bh_bnum != 1)
2564 break;
2565
2566 /*
2567 * if block 1 becomes full the tree is given an extra level
2568 * The pointers from block 1 are moved into the new block.
2569 * block 1 is updated to point to the new block
2570 * then continue to split the new block
2571 */
2572 mch_memmove(pp_new, pp, (size_t)page_size);
2573 pp->pb_count = 1;
2574 pp->pb_pointer[0].pe_bnum = hp_new->bh_bnum;
2575 pp->pb_pointer[0].pe_line_count = buf->b_ml.ml_line_count;
2576 pp->pb_pointer[0].pe_old_lnum = 1;
2577 pp->pb_pointer[0].pe_page_count = 1;
2578 mf_put(mfp, hp, TRUE, FALSE); /* release block 1 */
2579 hp = hp_new; /* new block is to be split */
2580 pp = pp_new;
2581 CHECK(stack_idx != 0, _("stack_idx should be 0"));
2582 ip->ip_index = 0;
2583 ++stack_idx; /* do block 1 again later */
2584 }
2585 /*
2586 * move the pointers after the current one to the new block
2587 * If there are none, the new entry will be in the new block.
2588 */
2589 total_moved = pp->pb_count - pb_idx - 1;
2590 if (total_moved)
2591 {
2592 mch_memmove(&pp_new->pb_pointer[0],
2593 &pp->pb_pointer[pb_idx + 1],
2594 (size_t)(total_moved) * sizeof(PTR_EN));
2595 pp_new->pb_count = total_moved;
2596 pp->pb_count -= total_moved - 1;
2597 pp->pb_pointer[pb_idx + 1].pe_bnum = bnum_right;
2598 pp->pb_pointer[pb_idx + 1].pe_line_count = line_count_right;
2599 pp->pb_pointer[pb_idx + 1].pe_page_count = page_count_right;
2600 if (lnum_right)
2601 pp->pb_pointer[pb_idx + 1].pe_old_lnum = lnum_right;
2602 }
2603 else
2604 {
2605 pp_new->pb_count = 1;
2606 pp_new->pb_pointer[0].pe_bnum = bnum_right;
2607 pp_new->pb_pointer[0].pe_line_count = line_count_right;
2608 pp_new->pb_pointer[0].pe_page_count = page_count_right;
2609 pp_new->pb_pointer[0].pe_old_lnum = lnum_right;
2610 }
2611 pp->pb_pointer[pb_idx].pe_bnum = bnum_left;
2612 pp->pb_pointer[pb_idx].pe_line_count = line_count_left;
2613 pp->pb_pointer[pb_idx].pe_page_count = page_count_left;
2614 if (lnum_left)
2615 pp->pb_pointer[pb_idx].pe_old_lnum = lnum_left;
2616 lnum_left = 0;
2617 lnum_right = 0;
2618
2619 /*
2620 * recompute line counts
2621 */
2622 line_count_right = 0;
2623 for (i = 0; i < (int)pp_new->pb_count; ++i)
2624 line_count_right += pp_new->pb_pointer[i].pe_line_count;
2625 line_count_left = 0;
2626 for (i = 0; i < (int)pp->pb_count; ++i)
2627 line_count_left += pp->pb_pointer[i].pe_line_count;
2628
2629 bnum_left = hp->bh_bnum;
2630 bnum_right = hp_new->bh_bnum;
2631 page_count_left = 1;
2632 page_count_right = 1;
2633 mf_put(mfp, hp, TRUE, FALSE);
2634 mf_put(mfp, hp_new, TRUE, FALSE);
2635 }
2636 }
2637
2638 /*
2639 * Safety check: fallen out of for loop?
2640 */
2641 if (stack_idx < 0)
2642 {
2643 EMSG(_("E318: Updated too many blocks?"));
2644 buf->b_ml.ml_stack_top = 0; /* invalidate stack */
2645 }
2646 }
2647
2648#ifdef FEAT_BYTEOFF
2649 /* The line was inserted below 'lnum' */
2650 ml_updatechunk(buf, lnum + 1, (long)len, ML_CHNK_ADDLINE);
2651#endif
2652#ifdef FEAT_NETBEANS_INTG
2653 if (usingNetbeans)
2654 {
2655 if (STRLEN(line) > 0)
Bram Moolenaara93fa7e2006-04-17 22:14:47 +00002656 netbeans_inserted(buf, lnum+1, (colnr_T)0, line, (int)STRLEN(line));
Bram Moolenaar35a9aaa2004-10-24 19:23:07 +00002657 netbeans_inserted(buf, lnum+1, (colnr_T)STRLEN(line),
Bram Moolenaar071d4272004-06-13 20:20:40 +00002658 (char_u *)"\n", 1);
2659 }
2660#endif
2661 return OK;
2662}
2663
2664/*
Bram Moolenaar4770d092006-01-12 23:22:24 +00002665 * Replace line lnum, with buffering, in current buffer.
Bram Moolenaar071d4272004-06-13 20:20:40 +00002666 *
Bram Moolenaar1056d982006-03-09 22:37:52 +00002667 * If "copy" is TRUE, make a copy of the line, otherwise the line has been
Bram Moolenaar071d4272004-06-13 20:20:40 +00002668 * copied to allocated memory already.
2669 *
2670 * Check: The caller of this function should probably also call
2671 * changed_lines(), unless update_screen(NOT_VALID) is used.
2672 *
2673 * return FAIL for failure, OK otherwise
2674 */
2675 int
2676ml_replace(lnum, line, copy)
2677 linenr_T lnum;
2678 char_u *line;
2679 int copy;
2680{
2681 if (line == NULL) /* just checking... */
2682 return FAIL;
2683
2684 /* When starting up, we might still need to create the memfile */
2685 if (curbuf->b_ml.ml_mfp == NULL && open_buffer(FALSE, NULL) == FAIL)
2686 return FAIL;
2687
2688 if (copy && (line = vim_strsave(line)) == NULL) /* allocate memory */
2689 return FAIL;
2690#ifdef FEAT_NETBEANS_INTG
2691 if (usingNetbeans)
2692 {
2693 netbeans_removed(curbuf, lnum, 0, (long)STRLEN(ml_get(lnum)));
Bram Moolenaara93fa7e2006-04-17 22:14:47 +00002694 netbeans_inserted(curbuf, lnum, 0, line, (int)STRLEN(line));
Bram Moolenaar071d4272004-06-13 20:20:40 +00002695 }
2696#endif
2697 if (curbuf->b_ml.ml_line_lnum != lnum) /* other line buffered */
2698 ml_flush_line(curbuf); /* flush it */
2699 else if (curbuf->b_ml.ml_flags & ML_LINE_DIRTY) /* same line allocated */
2700 vim_free(curbuf->b_ml.ml_line_ptr); /* free it */
2701 curbuf->b_ml.ml_line_ptr = line;
2702 curbuf->b_ml.ml_line_lnum = lnum;
2703 curbuf->b_ml.ml_flags = (curbuf->b_ml.ml_flags | ML_LINE_DIRTY) & ~ML_EMPTY;
2704
2705 return OK;
2706}
2707
2708/*
Bram Moolenaar4770d092006-01-12 23:22:24 +00002709 * Delete line 'lnum' in the current buffer.
Bram Moolenaar071d4272004-06-13 20:20:40 +00002710 *
2711 * Check: The caller of this function should probably also call
2712 * deleted_lines() after this.
2713 *
2714 * return FAIL for failure, OK otherwise
2715 */
2716 int
2717ml_delete(lnum, message)
2718 linenr_T lnum;
2719 int message;
2720{
2721 ml_flush_line(curbuf);
2722 return ml_delete_int(curbuf, lnum, message);
2723}
2724
2725 static int
2726ml_delete_int(buf, lnum, message)
2727 buf_T *buf;
2728 linenr_T lnum;
2729 int message;
2730{
2731 bhdr_T *hp;
2732 memfile_T *mfp;
2733 DATA_BL *dp;
2734 PTR_BL *pp;
2735 infoptr_T *ip;
2736 int count; /* number of entries in block */
2737 int idx;
2738 int stack_idx;
2739 int text_start;
2740 int line_start;
2741 long line_size;
2742 int i;
2743
2744 if (lnum < 1 || lnum > buf->b_ml.ml_line_count)
2745 return FAIL;
2746
2747 if (lowest_marked && lowest_marked > lnum)
2748 lowest_marked--;
2749
2750/*
2751 * If the file becomes empty the last line is replaced by an empty line.
2752 */
2753 if (buf->b_ml.ml_line_count == 1) /* file becomes empty */
2754 {
2755 if (message
2756#ifdef FEAT_NETBEANS_INTG
2757 && !netbeansSuppressNoLines
2758#endif
2759 )
Bram Moolenaar238a5642006-02-21 22:12:05 +00002760 set_keep_msg((char_u *)_(no_lines_msg), 0);
2761
Bram Moolenaar071d4272004-06-13 20:20:40 +00002762 /* FEAT_BYTEOFF already handled in there, dont worry 'bout it below */
2763 i = ml_replace((linenr_T)1, (char_u *)"", TRUE);
2764 buf->b_ml.ml_flags |= ML_EMPTY;
2765
2766 return i;
2767 }
2768
2769/*
2770 * find the data block containing the line
2771 * This also fills the stack with the blocks from the root to the data block
2772 * This also releases any locked block.
2773 */
2774 mfp = buf->b_ml.ml_mfp;
2775 if (mfp == NULL)
2776 return FAIL;
2777
2778 if ((hp = ml_find_line(buf, lnum, ML_DELETE)) == NULL)
2779 return FAIL;
2780
2781 dp = (DATA_BL *)(hp->bh_data);
2782 /* compute line count before the delete */
2783 count = (long)(buf->b_ml.ml_locked_high)
2784 - (long)(buf->b_ml.ml_locked_low) + 2;
2785 idx = lnum - buf->b_ml.ml_locked_low;
2786
2787 --buf->b_ml.ml_line_count;
2788
2789 line_start = ((dp->db_index[idx]) & DB_INDEX_MASK);
2790 if (idx == 0) /* first line in block, text at the end */
2791 line_size = dp->db_txt_end - line_start;
2792 else
2793 line_size = ((dp->db_index[idx - 1]) & DB_INDEX_MASK) - line_start;
2794
2795#ifdef FEAT_NETBEANS_INTG
2796 if (usingNetbeans)
Bram Moolenaar35a9aaa2004-10-24 19:23:07 +00002797 netbeans_removed(buf, lnum, 0, (long)line_size);
Bram Moolenaar071d4272004-06-13 20:20:40 +00002798#endif
2799
2800/*
2801 * special case: If there is only one line in the data block it becomes empty.
2802 * Then we have to remove the entry, pointing to this data block, from the
2803 * pointer block. If this pointer block also becomes empty, we go up another
2804 * block, and so on, up to the root if necessary.
2805 * The line counts in the pointer blocks have already been adjusted by
2806 * ml_find_line().
2807 */
2808 if (count == 1)
2809 {
2810 mf_free(mfp, hp); /* free the data block */
2811 buf->b_ml.ml_locked = NULL;
2812
2813 for (stack_idx = buf->b_ml.ml_stack_top - 1; stack_idx >= 0; --stack_idx)
2814 {
2815 buf->b_ml.ml_stack_top = 0; /* stack is invalid when failing */
2816 ip = &(buf->b_ml.ml_stack[stack_idx]);
2817 idx = ip->ip_index;
2818 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
2819 return FAIL;
2820 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
2821 if (pp->pb_id != PTR_ID)
2822 {
2823 EMSG(_("E317: pointer block id wrong 4"));
2824 mf_put(mfp, hp, FALSE, FALSE);
2825 return FAIL;
2826 }
2827 count = --(pp->pb_count);
2828 if (count == 0) /* the pointer block becomes empty! */
2829 mf_free(mfp, hp);
2830 else
2831 {
2832 if (count != idx) /* move entries after the deleted one */
2833 mch_memmove(&pp->pb_pointer[idx], &pp->pb_pointer[idx + 1],
2834 (size_t)(count - idx) * sizeof(PTR_EN));
2835 mf_put(mfp, hp, TRUE, FALSE);
2836
2837 buf->b_ml.ml_stack_top = stack_idx; /* truncate stack */
2838 /* fix line count for rest of blocks in the stack */
2839 if (buf->b_ml.ml_locked_lineadd)
2840 {
2841 ml_lineadd(buf, buf->b_ml.ml_locked_lineadd);
2842 buf->b_ml.ml_stack[buf->b_ml.ml_stack_top].ip_high +=
2843 buf->b_ml.ml_locked_lineadd;
2844 }
2845 ++(buf->b_ml.ml_stack_top);
2846
2847 break;
2848 }
2849 }
2850 CHECK(stack_idx < 0, _("deleted block 1?"));
2851 }
2852 else
2853 {
2854 /*
2855 * delete the text by moving the next lines forwards
2856 */
2857 text_start = dp->db_txt_start;
2858 mch_memmove((char *)dp + text_start + line_size,
2859 (char *)dp + text_start, (size_t)(line_start - text_start));
2860
2861 /*
2862 * delete the index by moving the next indexes backwards
2863 * Adjust the indexes for the text movement.
2864 */
2865 for (i = idx; i < count - 1; ++i)
2866 dp->db_index[i] = dp->db_index[i + 1] + line_size;
2867
2868 dp->db_free += line_size + INDEX_SIZE;
2869 dp->db_txt_start += line_size;
2870 --(dp->db_line_count);
2871
2872 /*
2873 * mark the block dirty and make sure it is in the file (for recovery)
2874 */
2875 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
2876 }
2877
2878#ifdef FEAT_BYTEOFF
2879 ml_updatechunk(buf, lnum, line_size, ML_CHNK_DELLINE);
2880#endif
2881 return OK;
2882}
2883
2884/*
2885 * set the B_MARKED flag for line 'lnum'
2886 */
2887 void
2888ml_setmarked(lnum)
2889 linenr_T lnum;
2890{
2891 bhdr_T *hp;
2892 DATA_BL *dp;
2893 /* invalid line number */
2894 if (lnum < 1 || lnum > curbuf->b_ml.ml_line_count
2895 || curbuf->b_ml.ml_mfp == NULL)
2896 return; /* give error message? */
2897
2898 if (lowest_marked == 0 || lowest_marked > lnum)
2899 lowest_marked = lnum;
2900
2901 /*
2902 * find the data block containing the line
2903 * This also fills the stack with the blocks from the root to the data block
2904 * This also releases any locked block.
2905 */
2906 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2907 return; /* give error message? */
2908
2909 dp = (DATA_BL *)(hp->bh_data);
2910 dp->db_index[lnum - curbuf->b_ml.ml_locked_low] |= DB_MARKED;
2911 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2912}
2913
2914/*
2915 * find the first line with its B_MARKED flag set
2916 */
2917 linenr_T
2918ml_firstmarked()
2919{
2920 bhdr_T *hp;
2921 DATA_BL *dp;
2922 linenr_T lnum;
2923 int i;
2924
2925 if (curbuf->b_ml.ml_mfp == NULL)
2926 return (linenr_T) 0;
2927
2928 /*
2929 * The search starts with lowest_marked line. This is the last line where
2930 * a mark was found, adjusted by inserting/deleting lines.
2931 */
2932 for (lnum = lowest_marked; lnum <= curbuf->b_ml.ml_line_count; )
2933 {
2934 /*
2935 * Find the data block containing the line.
2936 * This also fills the stack with the blocks from the root to the data
2937 * block This also releases any locked block.
2938 */
2939 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2940 return (linenr_T)0; /* give error message? */
2941
2942 dp = (DATA_BL *)(hp->bh_data);
2943
2944 for (i = lnum - curbuf->b_ml.ml_locked_low;
2945 lnum <= curbuf->b_ml.ml_locked_high; ++i, ++lnum)
2946 if ((dp->db_index[i]) & DB_MARKED)
2947 {
2948 (dp->db_index[i]) &= DB_INDEX_MASK;
2949 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2950 lowest_marked = lnum + 1;
2951 return lnum;
2952 }
2953 }
2954
2955 return (linenr_T) 0;
2956}
2957
2958#if 0 /* not used */
2959/*
2960 * return TRUE if line 'lnum' has a mark
2961 */
2962 int
2963ml_has_mark(lnum)
2964 linenr_T lnum;
2965{
2966 bhdr_T *hp;
2967 DATA_BL *dp;
2968
2969 if (curbuf->b_ml.ml_mfp == NULL
2970 || (hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2971 return FALSE;
2972
2973 dp = (DATA_BL *)(hp->bh_data);
2974 return (int)((dp->db_index[lnum - curbuf->b_ml.ml_locked_low]) & DB_MARKED);
2975}
2976#endif
2977
2978/*
2979 * clear all DB_MARKED flags
2980 */
2981 void
2982ml_clearmarked()
2983{
2984 bhdr_T *hp;
2985 DATA_BL *dp;
2986 linenr_T lnum;
2987 int i;
2988
2989 if (curbuf->b_ml.ml_mfp == NULL) /* nothing to do */
2990 return;
2991
2992 /*
2993 * The search starts with line lowest_marked.
2994 */
2995 for (lnum = lowest_marked; lnum <= curbuf->b_ml.ml_line_count; )
2996 {
2997 /*
2998 * Find the data block containing the line.
2999 * This also fills the stack with the blocks from the root to the data
3000 * block and releases any locked block.
3001 */
3002 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
3003 return; /* give error message? */
3004
3005 dp = (DATA_BL *)(hp->bh_data);
3006
3007 for (i = lnum - curbuf->b_ml.ml_locked_low;
3008 lnum <= curbuf->b_ml.ml_locked_high; ++i, ++lnum)
3009 if ((dp->db_index[i]) & DB_MARKED)
3010 {
3011 (dp->db_index[i]) &= DB_INDEX_MASK;
3012 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
3013 }
3014 }
3015
3016 lowest_marked = 0;
3017 return;
3018}
3019
3020/*
3021 * flush ml_line if necessary
3022 */
3023 static void
3024ml_flush_line(buf)
3025 buf_T *buf;
3026{
3027 bhdr_T *hp;
3028 DATA_BL *dp;
3029 linenr_T lnum;
3030 char_u *new_line;
3031 char_u *old_line;
3032 colnr_T new_len;
3033 int old_len;
3034 int extra;
3035 int idx;
3036 int start;
3037 int count;
3038 int i;
3039
3040 if (buf->b_ml.ml_line_lnum == 0 || buf->b_ml.ml_mfp == NULL)
3041 return; /* nothing to do */
3042
3043 if (buf->b_ml.ml_flags & ML_LINE_DIRTY)
3044 {
3045 lnum = buf->b_ml.ml_line_lnum;
3046 new_line = buf->b_ml.ml_line_ptr;
3047
3048 hp = ml_find_line(buf, lnum, ML_FIND);
3049 if (hp == NULL)
3050 EMSGN(_("E320: Cannot find line %ld"), lnum);
3051 else
3052 {
3053 dp = (DATA_BL *)(hp->bh_data);
3054 idx = lnum - buf->b_ml.ml_locked_low;
3055 start = ((dp->db_index[idx]) & DB_INDEX_MASK);
3056 old_line = (char_u *)dp + start;
3057 if (idx == 0) /* line is last in block */
3058 old_len = dp->db_txt_end - start;
3059 else /* text of previous line follows */
3060 old_len = (dp->db_index[idx - 1] & DB_INDEX_MASK) - start;
3061 new_len = (colnr_T)STRLEN(new_line) + 1;
3062 extra = new_len - old_len; /* negative if lines gets smaller */
3063
3064 /*
3065 * if new line fits in data block, replace directly
3066 */
3067 if ((int)dp->db_free >= extra)
3068 {
3069 /* if the length changes and there are following lines */
3070 count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low + 1;
3071 if (extra != 0 && idx < count - 1)
3072 {
3073 /* move text of following lines */
3074 mch_memmove((char *)dp + dp->db_txt_start - extra,
3075 (char *)dp + dp->db_txt_start,
3076 (size_t)(start - dp->db_txt_start));
3077
3078 /* adjust pointers of this and following lines */
3079 for (i = idx + 1; i < count; ++i)
3080 dp->db_index[i] -= extra;
3081 }
3082 dp->db_index[idx] -= extra;
3083
3084 /* adjust free space */
3085 dp->db_free -= extra;
3086 dp->db_txt_start -= extra;
3087
3088 /* copy new line into the data block */
3089 mch_memmove(old_line - extra, new_line, (size_t)new_len);
3090 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
3091#ifdef FEAT_BYTEOFF
3092 /* The else case is already covered by the insert and delete */
3093 ml_updatechunk(buf, lnum, (long)extra, ML_CHNK_UPDLINE);
3094#endif
3095 }
3096 else
3097 {
3098 /*
3099 * Cannot do it in one data block: Delete and append.
3100 * Append first, because ml_delete_int() cannot delete the
3101 * last line in a buffer, which causes trouble for a buffer
3102 * that has only one line.
3103 * Don't forget to copy the mark!
3104 */
3105 /* How about handling errors??? */
3106 (void)ml_append_int(buf, lnum, new_line, new_len, FALSE,
3107 (dp->db_index[idx] & DB_MARKED));
3108 (void)ml_delete_int(buf, lnum, FALSE);
3109 }
3110 }
3111 vim_free(new_line);
3112 }
3113
3114 buf->b_ml.ml_line_lnum = 0;
3115}
3116
3117/*
3118 * create a new, empty, data block
3119 */
3120 static bhdr_T *
3121ml_new_data(mfp, negative, page_count)
3122 memfile_T *mfp;
3123 int negative;
3124 int page_count;
3125{
3126 bhdr_T *hp;
3127 DATA_BL *dp;
3128
3129 if ((hp = mf_new(mfp, negative, page_count)) == NULL)
3130 return NULL;
3131
3132 dp = (DATA_BL *)(hp->bh_data);
3133 dp->db_id = DATA_ID;
3134 dp->db_txt_start = dp->db_txt_end = page_count * mfp->mf_page_size;
3135 dp->db_free = dp->db_txt_start - HEADER_SIZE;
3136 dp->db_line_count = 0;
3137
3138 return hp;
3139}
3140
3141/*
3142 * create a new, empty, pointer block
3143 */
3144 static bhdr_T *
3145ml_new_ptr(mfp)
3146 memfile_T *mfp;
3147{
3148 bhdr_T *hp;
3149 PTR_BL *pp;
3150
3151 if ((hp = mf_new(mfp, FALSE, 1)) == NULL)
3152 return NULL;
3153
3154 pp = (PTR_BL *)(hp->bh_data);
3155 pp->pb_id = PTR_ID;
3156 pp->pb_count = 0;
3157 pp->pb_count_max = (short_u)((mfp->mf_page_size - sizeof(PTR_BL)) / sizeof(PTR_EN) + 1);
3158
3159 return hp;
3160}
3161
3162/*
3163 * lookup line 'lnum' in a memline
3164 *
3165 * action: if ML_DELETE or ML_INSERT the line count is updated while searching
3166 * if ML_FLUSH only flush a locked block
3167 * if ML_FIND just find the line
3168 *
3169 * If the block was found it is locked and put in ml_locked.
3170 * The stack is updated to lead to the locked block. The ip_high field in
3171 * the stack is updated to reflect the last line in the block AFTER the
3172 * insert or delete, also if the pointer block has not been updated yet. But
3173 * if if ml_locked != NULL ml_locked_lineadd must be added to ip_high.
3174 *
3175 * return: NULL for failure, pointer to block header otherwise
3176 */
3177 static bhdr_T *
3178ml_find_line(buf, lnum, action)
3179 buf_T *buf;
3180 linenr_T lnum;
3181 int action;
3182{
3183 DATA_BL *dp;
3184 PTR_BL *pp;
3185 infoptr_T *ip;
3186 bhdr_T *hp;
3187 memfile_T *mfp;
3188 linenr_T t;
3189 blocknr_T bnum, bnum2;
3190 int dirty;
3191 linenr_T low, high;
3192 int top;
3193 int page_count;
3194 int idx;
3195
3196 mfp = buf->b_ml.ml_mfp;
3197
3198 /*
3199 * If there is a locked block check if the wanted line is in it.
3200 * If not, flush and release the locked block.
3201 * Don't do this for ML_INSERT_SAME, because the stack need to be updated.
3202 * Don't do this for ML_FLUSH, because we want to flush the locked block.
3203 */
3204 if (buf->b_ml.ml_locked)
3205 {
3206 if (ML_SIMPLE(action) && buf->b_ml.ml_locked_low <= lnum
3207 && buf->b_ml.ml_locked_high >= lnum)
3208 {
3209 /* remember to update pointer blocks and stack later */
3210 if (action == ML_INSERT)
3211 {
3212 ++(buf->b_ml.ml_locked_lineadd);
3213 ++(buf->b_ml.ml_locked_high);
3214 }
3215 else if (action == ML_DELETE)
3216 {
3217 --(buf->b_ml.ml_locked_lineadd);
3218 --(buf->b_ml.ml_locked_high);
3219 }
3220 return (buf->b_ml.ml_locked);
3221 }
3222
3223 mf_put(mfp, buf->b_ml.ml_locked, buf->b_ml.ml_flags & ML_LOCKED_DIRTY,
3224 buf->b_ml.ml_flags & ML_LOCKED_POS);
3225 buf->b_ml.ml_locked = NULL;
3226
3227 /*
3228 * if lines have been added or deleted in the locked block, need to
3229 * update the line count in pointer blocks
3230 */
3231 if (buf->b_ml.ml_locked_lineadd)
3232 ml_lineadd(buf, buf->b_ml.ml_locked_lineadd);
3233 }
3234
3235 if (action == ML_FLUSH) /* nothing else to do */
3236 return NULL;
3237
3238 bnum = 1; /* start at the root of the tree */
3239 page_count = 1;
3240 low = 1;
3241 high = buf->b_ml.ml_line_count;
3242
3243 if (action == ML_FIND) /* first try stack entries */
3244 {
3245 for (top = buf->b_ml.ml_stack_top - 1; top >= 0; --top)
3246 {
3247 ip = &(buf->b_ml.ml_stack[top]);
3248 if (ip->ip_low <= lnum && ip->ip_high >= lnum)
3249 {
3250 bnum = ip->ip_bnum;
3251 low = ip->ip_low;
3252 high = ip->ip_high;
3253 buf->b_ml.ml_stack_top = top; /* truncate stack at prev entry */
3254 break;
3255 }
3256 }
3257 if (top < 0)
3258 buf->b_ml.ml_stack_top = 0; /* not found, start at the root */
3259 }
3260 else /* ML_DELETE or ML_INSERT */
3261 buf->b_ml.ml_stack_top = 0; /* start at the root */
3262
3263/*
3264 * search downwards in the tree until a data block is found
3265 */
3266 for (;;)
3267 {
3268 if ((hp = mf_get(mfp, bnum, page_count)) == NULL)
3269 goto error_noblock;
3270
3271 /*
3272 * update high for insert/delete
3273 */
3274 if (action == ML_INSERT)
3275 ++high;
3276 else if (action == ML_DELETE)
3277 --high;
3278
3279 dp = (DATA_BL *)(hp->bh_data);
3280 if (dp->db_id == DATA_ID) /* data block */
3281 {
3282 buf->b_ml.ml_locked = hp;
3283 buf->b_ml.ml_locked_low = low;
3284 buf->b_ml.ml_locked_high = high;
3285 buf->b_ml.ml_locked_lineadd = 0;
3286 buf->b_ml.ml_flags &= ~(ML_LOCKED_DIRTY | ML_LOCKED_POS);
3287 return hp;
3288 }
3289
3290 pp = (PTR_BL *)(dp); /* must be pointer block */
3291 if (pp->pb_id != PTR_ID)
3292 {
3293 EMSG(_("E317: pointer block id wrong"));
3294 goto error_block;
3295 }
3296
3297 if ((top = ml_add_stack(buf)) < 0) /* add new entry to stack */
3298 goto error_block;
3299 ip = &(buf->b_ml.ml_stack[top]);
3300 ip->ip_bnum = bnum;
3301 ip->ip_low = low;
3302 ip->ip_high = high;
3303 ip->ip_index = -1; /* index not known yet */
3304
3305 dirty = FALSE;
3306 for (idx = 0; idx < (int)pp->pb_count; ++idx)
3307 {
3308 t = pp->pb_pointer[idx].pe_line_count;
3309 CHECK(t == 0, _("pe_line_count is zero"));
3310 if ((low += t) > lnum)
3311 {
3312 ip->ip_index = idx;
3313 bnum = pp->pb_pointer[idx].pe_bnum;
3314 page_count = pp->pb_pointer[idx].pe_page_count;
3315 high = low - 1;
3316 low -= t;
3317
3318 /*
3319 * a negative block number may have been changed
3320 */
3321 if (bnum < 0)
3322 {
3323 bnum2 = mf_trans_del(mfp, bnum);
3324 if (bnum != bnum2)
3325 {
3326 bnum = bnum2;
3327 pp->pb_pointer[idx].pe_bnum = bnum;
3328 dirty = TRUE;
3329 }
3330 }
3331
3332 break;
3333 }
3334 }
3335 if (idx >= (int)pp->pb_count) /* past the end: something wrong! */
3336 {
3337 if (lnum > buf->b_ml.ml_line_count)
3338 EMSGN(_("E322: line number out of range: %ld past the end"),
3339 lnum - buf->b_ml.ml_line_count);
3340
3341 else
3342 EMSGN(_("E323: line count wrong in block %ld"), bnum);
3343 goto error_block;
3344 }
3345 if (action == ML_DELETE)
3346 {
3347 pp->pb_pointer[idx].pe_line_count--;
3348 dirty = TRUE;
3349 }
3350 else if (action == ML_INSERT)
3351 {
3352 pp->pb_pointer[idx].pe_line_count++;
3353 dirty = TRUE;
3354 }
3355 mf_put(mfp, hp, dirty, FALSE);
3356 }
3357
3358error_block:
3359 mf_put(mfp, hp, FALSE, FALSE);
3360error_noblock:
3361/*
3362 * If action is ML_DELETE or ML_INSERT we have to correct the tree for
3363 * the incremented/decremented line counts, because there won't be a line
3364 * inserted/deleted after all.
3365 */
3366 if (action == ML_DELETE)
3367 ml_lineadd(buf, 1);
3368 else if (action == ML_INSERT)
3369 ml_lineadd(buf, -1);
3370 buf->b_ml.ml_stack_top = 0;
3371 return NULL;
3372}
3373
3374/*
3375 * add an entry to the info pointer stack
3376 *
3377 * return -1 for failure, number of the new entry otherwise
3378 */
3379 static int
3380ml_add_stack(buf)
3381 buf_T *buf;
3382{
3383 int top;
3384 infoptr_T *newstack;
3385
3386 top = buf->b_ml.ml_stack_top;
3387
3388 /* may have to increase the stack size */
3389 if (top == buf->b_ml.ml_stack_size)
3390 {
3391 CHECK(top > 0, _("Stack size increases")); /* more than 5 levels??? */
3392
3393 newstack = (infoptr_T *)alloc((unsigned)sizeof(infoptr_T) *
3394 (buf->b_ml.ml_stack_size + STACK_INCR));
3395 if (newstack == NULL)
3396 return -1;
3397 mch_memmove(newstack, buf->b_ml.ml_stack, (size_t)top * sizeof(infoptr_T));
3398 vim_free(buf->b_ml.ml_stack);
3399 buf->b_ml.ml_stack = newstack;
3400 buf->b_ml.ml_stack_size += STACK_INCR;
3401 }
3402
3403 buf->b_ml.ml_stack_top++;
3404 return top;
3405}
3406
3407/*
3408 * Update the pointer blocks on the stack for inserted/deleted lines.
3409 * The stack itself is also updated.
3410 *
3411 * When a insert/delete line action fails, the line is not inserted/deleted,
3412 * but the pointer blocks have already been updated. That is fixed here by
3413 * walking through the stack.
3414 *
3415 * Count is the number of lines added, negative if lines have been deleted.
3416 */
3417 static void
3418ml_lineadd(buf, count)
3419 buf_T *buf;
3420 int count;
3421{
3422 int idx;
3423 infoptr_T *ip;
3424 PTR_BL *pp;
3425 memfile_T *mfp = buf->b_ml.ml_mfp;
3426 bhdr_T *hp;
3427
3428 for (idx = buf->b_ml.ml_stack_top - 1; idx >= 0; --idx)
3429 {
3430 ip = &(buf->b_ml.ml_stack[idx]);
3431 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
3432 break;
3433 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
3434 if (pp->pb_id != PTR_ID)
3435 {
3436 mf_put(mfp, hp, FALSE, FALSE);
3437 EMSG(_("E317: pointer block id wrong 2"));
3438 break;
3439 }
3440 pp->pb_pointer[ip->ip_index].pe_line_count += count;
3441 ip->ip_high += count;
3442 mf_put(mfp, hp, TRUE, FALSE);
3443 }
3444}
3445
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003446#ifdef HAVE_READLINK
3447static int resolve_symlink __ARGS((char_u *fname, char_u *buf));
3448
3449/*
3450 * Resolve a symlink in the last component of a file name.
3451 * Note that f_resolve() does it for every part of the path, we don't do that
3452 * here.
3453 * If it worked returns OK and the resolved link in "buf[MAXPATHL]".
3454 * Otherwise returns FAIL.
3455 */
3456 static int
3457resolve_symlink(fname, buf)
3458 char_u *fname;
3459 char_u *buf;
3460{
3461 char_u tmp[MAXPATHL];
3462 int ret;
3463 int depth = 0;
3464
3465 if (fname == NULL)
3466 return FAIL;
3467
3468 /* Put the result so far in tmp[], starting with the original name. */
3469 vim_strncpy(tmp, fname, MAXPATHL - 1);
3470
3471 for (;;)
3472 {
3473 /* Limit symlink depth to 100, catch recursive loops. */
3474 if (++depth == 100)
3475 {
3476 EMSG2(_("E773: Symlink loop for \"%s\""), fname);
3477 return FAIL;
3478 }
3479
3480 ret = readlink((char *)tmp, (char *)buf, MAXPATHL - 1);
3481 if (ret <= 0)
3482 {
Bram Moolenaarcc984262005-12-23 22:19:46 +00003483 if (errno == EINVAL || errno == ENOENT)
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003484 {
Bram Moolenaarcc984262005-12-23 22:19:46 +00003485 /* Found non-symlink or not existing file, stop here.
3486 * When at the first level use the unmodifed name, skip the
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003487 * call to vim_FullName(). */
3488 if (depth == 1)
3489 return FAIL;
3490
3491 /* Use the resolved name in tmp[]. */
3492 break;
3493 }
3494
3495 /* There must be some error reading links, use original name. */
3496 return FAIL;
3497 }
3498 buf[ret] = NUL;
3499
3500 /*
3501 * Check whether the symlink is relative or absolute.
3502 * If it's relative, build a new path based on the directory
3503 * portion of the filename (if any) and the path the symlink
3504 * points to.
3505 */
3506 if (mch_isFullName(buf))
3507 STRCPY(tmp, buf);
3508 else
3509 {
3510 char_u *tail;
3511
3512 tail = gettail(tmp);
3513 if (STRLEN(tail) + STRLEN(buf) >= MAXPATHL)
3514 return FAIL;
3515 STRCPY(tail, buf);
3516 }
3517 }
3518
3519 /*
3520 * Try to resolve the full name of the file so that the swapfile name will
3521 * be consistent even when opening a relative symlink from different
3522 * working directories.
3523 */
3524 return vim_FullName(tmp, buf, MAXPATHL, TRUE);
3525}
3526#endif
3527
Bram Moolenaar071d4272004-06-13 20:20:40 +00003528/*
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003529 * Make swap file name out of the file name and a directory name.
3530 * Returns pointer to allocated memory or NULL.
Bram Moolenaar071d4272004-06-13 20:20:40 +00003531 */
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003532/*ARGSUSED*/
3533 char_u *
3534makeswapname(fname, ffname, buf, dir_name)
3535 char_u *fname;
3536 char_u *ffname;
Bram Moolenaar071d4272004-06-13 20:20:40 +00003537 buf_T *buf;
3538 char_u *dir_name;
3539{
3540 char_u *r, *s;
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003541#ifdef HAVE_READLINK
3542 char_u fname_buf[MAXPATHL];
3543 char_u *fname_res;
3544#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00003545
3546#if defined(UNIX) || defined(WIN3264) /* Need _very_ long file names */
3547 s = dir_name + STRLEN(dir_name);
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00003548 if (after_pathsep(dir_name, s) && s[-1] == s[-2])
Bram Moolenaar071d4272004-06-13 20:20:40 +00003549 { /* Ends with '//', Use Full path */
3550 r = NULL;
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003551 if ((s = make_percent_swname(dir_name, fname)) != NULL)
Bram Moolenaar071d4272004-06-13 20:20:40 +00003552 {
3553 r = modname(s, (char_u *)".swp", FALSE);
3554 vim_free(s);
3555 }
3556 return r;
3557 }
3558#endif
3559
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003560#ifdef HAVE_READLINK
3561 /* Expand symlink in the file name, so that we put the swap file with the
3562 * actual file instead of with the symlink. */
3563 if (resolve_symlink(fname, fname_buf) == OK)
3564 fname_res = fname_buf;
3565 else
3566 fname_res = fname;
3567#endif
3568
Bram Moolenaar071d4272004-06-13 20:20:40 +00003569 r = buf_modname(
3570#ifdef SHORT_FNAME
3571 TRUE,
3572#else
3573 (buf->b_p_sn || buf->b_shortname),
3574#endif
3575#ifdef RISCOS
3576 /* Avoid problems if fname has special chars, eg <Wimp$Scrap> */
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003577 ffname,
Bram Moolenaar071d4272004-06-13 20:20:40 +00003578#else
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003579# ifdef HAVE_READLINK
3580 fname_res,
3581# else
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003582 fname,
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003583# endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00003584#endif
3585 (char_u *)
3586#if defined(VMS) || defined(RISCOS)
3587 "_swp",
3588#else
3589 ".swp",
3590#endif
3591#ifdef SHORT_FNAME /* always 8.3 file name */
3592 FALSE
3593#else
3594 /* Prepend a '.' to the swap file name for the current directory. */
3595 dir_name[0] == '.' && dir_name[1] == NUL
3596#endif
3597 );
3598 if (r == NULL) /* out of memory */
3599 return NULL;
3600
3601 s = get_file_in_dir(r, dir_name);
3602 vim_free(r);
3603 return s;
3604}
3605
3606/*
3607 * Get file name to use for swap file or backup file.
3608 * Use the name of the edited file "fname" and an entry in the 'dir' or 'bdir'
3609 * option "dname".
3610 * - If "dname" is ".", return "fname" (swap file in dir of file).
3611 * - If "dname" starts with "./", insert "dname" in "fname" (swap file
3612 * relative to dir of file).
3613 * - Otherwise, prepend "dname" to the tail of "fname" (swap file in specific
3614 * dir).
3615 *
3616 * The return value is an allocated string and can be NULL.
3617 */
3618 char_u *
3619get_file_in_dir(fname, dname)
3620 char_u *fname;
3621 char_u *dname; /* don't use "dirname", it is a global for Alpha */
3622{
3623 char_u *t;
3624 char_u *tail;
3625 char_u *retval;
3626 int save_char;
3627
3628 tail = gettail(fname);
3629
3630 if (dname[0] == '.' && dname[1] == NUL)
3631 retval = vim_strsave(fname);
3632 else if (dname[0] == '.' && vim_ispathsep(dname[1]))
3633 {
3634 if (tail == fname) /* no path before file name */
3635 retval = concat_fnames(dname + 2, tail, TRUE);
3636 else
3637 {
3638 save_char = *tail;
3639 *tail = NUL;
3640 t = concat_fnames(fname, dname + 2, TRUE);
3641 *tail = save_char;
3642 if (t == NULL) /* out of memory */
3643 retval = NULL;
3644 else
3645 {
3646 retval = concat_fnames(t, tail, TRUE);
3647 vim_free(t);
3648 }
3649 }
3650 }
3651 else
3652 retval = concat_fnames(dname, tail, TRUE);
3653
3654 return retval;
3655}
3656
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00003657static void attention_message __ARGS((buf_T *buf, char_u *fname));
3658
3659/*
3660 * Print the ATTENTION message: info about an existing swap file.
3661 */
3662 static void
3663attention_message(buf, fname)
3664 buf_T *buf; /* buffer being edited */
3665 char_u *fname; /* swap file name */
3666{
3667 struct stat st;
3668 time_t x, sx;
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00003669 char *p;
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00003670
3671 ++no_wait_return;
3672 (void)EMSG(_("E325: ATTENTION"));
3673 MSG_PUTS(_("\nFound a swap file by the name \""));
3674 msg_home_replace(fname);
3675 MSG_PUTS("\"\n");
3676 sx = swapfile_info(fname);
3677 MSG_PUTS(_("While opening file \""));
3678 msg_outtrans(buf->b_fname);
3679 MSG_PUTS("\"\n");
3680 if (mch_stat((char *)buf->b_fname, &st) != -1)
3681 {
3682 MSG_PUTS(_(" dated: "));
3683 x = st.st_mtime; /* Manx C can't do &st.st_mtime */
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00003684 p = ctime(&x); /* includes '\n' */
3685 if (p == NULL)
3686 MSG_PUTS("(invalid)\n");
3687 else
3688 MSG_PUTS(p);
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00003689 if (sx != 0 && x > sx)
3690 MSG_PUTS(_(" NEWER than swap file!\n"));
3691 }
3692 /* Some of these messages are long to allow translation to
3693 * other languages. */
3694 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"));
3695 MSG_PUTS(_(" Quit, or continue with caution.\n"));
3696 MSG_PUTS(_("\n(2) An edit session for this file crashed.\n"));
3697 MSG_PUTS(_(" If this is the case, use \":recover\" or \"vim -r "));
3698 msg_outtrans(buf->b_fname);
3699 MSG_PUTS(_("\"\n to recover the changes (see \":help recovery\").\n"));
3700 MSG_PUTS(_(" If you did this already, delete the swap file \""));
3701 msg_outtrans(fname);
3702 MSG_PUTS(_("\"\n to avoid this message.\n"));
3703 cmdline_row = msg_row;
3704 --no_wait_return;
3705}
3706
3707#ifdef FEAT_AUTOCMD
3708static int do_swapexists __ARGS((buf_T *buf, char_u *fname));
3709
3710/*
3711 * Trigger the SwapExists autocommands.
3712 * Returns a value for equivalent to do_dialog() (see below):
3713 * 0: still need to ask for a choice
3714 * 1: open read-only
3715 * 2: edit anyway
3716 * 3: recover
3717 * 4: delete it
3718 * 5: quit
3719 * 6: abort
3720 */
3721 static int
3722do_swapexists(buf, fname)
3723 buf_T *buf;
3724 char_u *fname;
3725{
3726 set_vim_var_string(VV_SWAPNAME, fname, -1);
3727 set_vim_var_string(VV_SWAPCHOICE, NULL, -1);
3728
3729 /* Trigger SwapExists autocommands with <afile> set to the file being
3730 * edited. */
3731 apply_autocmds(EVENT_SWAPEXISTS, buf->b_fname, NULL, FALSE, NULL);
3732
3733 set_vim_var_string(VV_SWAPNAME, NULL, -1);
3734
3735 switch (*get_vim_var_str(VV_SWAPCHOICE))
3736 {
3737 case 'o': return 1;
3738 case 'e': return 2;
3739 case 'r': return 3;
3740 case 'd': return 4;
3741 case 'q': return 5;
3742 case 'a': return 6;
3743 }
3744
3745 return 0;
3746}
3747#endif
3748
Bram Moolenaar071d4272004-06-13 20:20:40 +00003749/*
3750 * Find out what name to use for the swap file for buffer 'buf'.
3751 *
3752 * Several names are tried to find one that does not exist
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003753 * Returns the name in allocated memory or NULL.
Bram Moolenaar071d4272004-06-13 20:20:40 +00003754 *
3755 * Note: If BASENAMELEN is not correct, you will get error messages for
3756 * not being able to open the swapfile
3757 */
3758 static char_u *
3759findswapname(buf, dirp, old_fname)
3760 buf_T *buf;
3761 char_u **dirp; /* pointer to list of directories */
3762 char_u *old_fname; /* don't give warning for this file name */
3763{
3764 char_u *fname;
3765 int n;
Bram Moolenaar071d4272004-06-13 20:20:40 +00003766 char_u *dir_name;
3767#ifdef AMIGA
3768 BPTR fh;
3769#endif
3770#ifndef SHORT_FNAME
3771 int r;
3772#endif
3773
3774#if !defined(SHORT_FNAME) \
3775 && ((!defined(UNIX) && !defined(OS2)) || defined(ARCHIE))
3776# define CREATE_DUMMY_FILE
3777 FILE *dummyfd = NULL;
3778
3779/*
3780 * If we start editing a new file, e.g. "test.doc", which resides on an MSDOS
3781 * compatible filesystem, it is possible that the file "test.doc.swp" which we
3782 * create will be exactly the same file. To avoid this problem we temporarily
3783 * create "test.doc".
3784 * Don't do this when the check below for a 8.3 file name is used.
3785 */
3786 if (!(buf->b_p_sn || buf->b_shortname) && buf->b_fname != NULL
3787 && mch_getperm(buf->b_fname) < 0)
3788 dummyfd = mch_fopen((char *)buf->b_fname, "w");
3789#endif
3790
3791/*
3792 * Isolate a directory name from *dirp and put it in dir_name.
3793 * First allocate some memory to put the directory name in.
3794 */
3795 dir_name = alloc((unsigned)STRLEN(*dirp) + 1);
3796 if (dir_name != NULL)
3797 (void)copy_option_part(dirp, dir_name, 31000, ",");
3798
3799/*
3800 * we try different names until we find one that does not exist yet
3801 */
3802 if (dir_name == NULL) /* out of memory */
3803 fname = NULL;
3804 else
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003805 fname = makeswapname(buf->b_fname, buf->b_ffname, buf, dir_name);
Bram Moolenaar071d4272004-06-13 20:20:40 +00003806
3807 for (;;)
3808 {
3809 if (fname == NULL) /* must be out of memory */
3810 break;
3811 if ((n = (int)STRLEN(fname)) == 0) /* safety check */
3812 {
3813 vim_free(fname);
3814 fname = NULL;
3815 break;
3816 }
3817#if (defined(UNIX) || defined(OS2)) && !defined(ARCHIE) && !defined(SHORT_FNAME)
3818/*
3819 * Some systems have a MS-DOS compatible filesystem that use 8.3 character
3820 * file names. If this is the first try and the swap file name does not fit in
3821 * 8.3, detect if this is the case, set shortname and try again.
3822 */
3823 if (fname[n - 2] == 'w' && fname[n - 1] == 'p'
3824 && !(buf->b_p_sn || buf->b_shortname))
3825 {
3826 char_u *tail;
3827 char_u *fname2;
3828 struct stat s1, s2;
3829 int f1, f2;
3830 int created1 = FALSE, created2 = FALSE;
3831 int same = FALSE;
3832
3833 /*
3834 * Check if swapfile name does not fit in 8.3:
3835 * It either contains two dots, is longer than 8 chars, or starts
3836 * with a dot.
3837 */
3838 tail = gettail(buf->b_fname);
3839 if ( vim_strchr(tail, '.') != NULL
3840 || STRLEN(tail) > (size_t)8
3841 || *gettail(fname) == '.')
3842 {
3843 fname2 = alloc(n + 2);
3844 if (fname2 != NULL)
3845 {
3846 STRCPY(fname2, fname);
3847 /* if fname == "xx.xx.swp", fname2 = "xx.xx.swx"
3848 * if fname == ".xx.swp", fname2 = ".xx.swpx"
3849 * if fname == "123456789.swp", fname2 = "12345678x.swp"
3850 */
3851 if (vim_strchr(tail, '.') != NULL)
3852 fname2[n - 1] = 'x';
3853 else if (*gettail(fname) == '.')
3854 {
3855 fname2[n] = 'x';
3856 fname2[n + 1] = NUL;
3857 }
3858 else
3859 fname2[n - 5] += 1;
3860 /*
3861 * may need to create the files to be able to use mch_stat()
3862 */
3863 f1 = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
3864 if (f1 < 0)
3865 {
3866 f1 = mch_open_rw((char *)fname,
3867 O_RDWR|O_CREAT|O_EXCL|O_EXTRA);
3868#if defined(OS2)
3869 if (f1 < 0 && errno == ENOENT)
3870 same = TRUE;
3871#endif
3872 created1 = TRUE;
3873 }
3874 if (f1 >= 0)
3875 {
3876 f2 = mch_open((char *)fname2, O_RDONLY | O_EXTRA, 0);
3877 if (f2 < 0)
3878 {
3879 f2 = mch_open_rw((char *)fname2,
3880 O_RDWR|O_CREAT|O_EXCL|O_EXTRA);
3881 created2 = TRUE;
3882 }
3883 if (f2 >= 0)
3884 {
3885 /*
3886 * Both files exist now. If mch_stat() returns the
3887 * same device and inode they are the same file.
3888 */
3889 if (mch_fstat(f1, &s1) != -1
3890 && mch_fstat(f2, &s2) != -1
3891 && s1.st_dev == s2.st_dev
3892 && s1.st_ino == s2.st_ino)
3893 same = TRUE;
3894 close(f2);
3895 if (created2)
3896 mch_remove(fname2);
3897 }
3898 close(f1);
3899 if (created1)
3900 mch_remove(fname);
3901 }
3902 vim_free(fname2);
3903 if (same)
3904 {
3905 buf->b_shortname = TRUE;
3906 vim_free(fname);
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003907 fname = makeswapname(buf->b_fname, buf->b_ffname,
3908 buf, dir_name);
Bram Moolenaar071d4272004-06-13 20:20:40 +00003909 continue; /* try again with b_shortname set */
3910 }
3911 }
3912 }
3913 }
3914#endif
3915 /*
3916 * check if the swapfile already exists
3917 */
3918 if (mch_getperm(fname) < 0) /* it does not exist */
3919 {
3920#ifdef HAVE_LSTAT
3921 struct stat sb;
3922
3923 /*
3924 * Extra security check: When a swap file is a symbolic link, this
3925 * is most likely a symlink attack.
3926 */
3927 if (mch_lstat((char *)fname, &sb) < 0)
3928#else
3929# ifdef AMIGA
3930 fh = Open((UBYTE *)fname, (long)MODE_NEWFILE);
3931 /*
3932 * on the Amiga mch_getperm() will return -1 when the file exists
3933 * but is being used by another program. This happens if you edit
3934 * a file twice.
3935 */
3936 if (fh != (BPTR)NULL) /* can open file, OK */
3937 {
3938 Close(fh);
3939 mch_remove(fname);
3940 break;
3941 }
3942 if (IoErr() != ERROR_OBJECT_IN_USE
3943 && IoErr() != ERROR_OBJECT_EXISTS)
3944# endif
3945#endif
3946 break;
3947 }
3948
3949 /*
3950 * A file name equal to old_fname is OK to use.
3951 */
3952 if (old_fname != NULL && fnamecmp(fname, old_fname) == 0)
3953 break;
3954
3955 /*
3956 * get here when file already exists
3957 */
3958 if (fname[n - 2] == 'w' && fname[n - 1] == 'p') /* first try */
3959 {
3960#ifndef SHORT_FNAME
3961 /*
3962 * on MS-DOS compatible filesystems (e.g. messydos) file.doc.swp
3963 * and file.doc are the same file. To guess if this problem is
3964 * present try if file.doc.swx exists. If it does, we set
3965 * buf->b_shortname and try file_doc.swp (dots replaced by
3966 * underscores for this file), and try again. If it doesn't we
3967 * assume that "file.doc.swp" already exists.
3968 */
3969 if (!(buf->b_p_sn || buf->b_shortname)) /* not tried yet */
3970 {
3971 fname[n - 1] = 'x';
3972 r = mch_getperm(fname); /* try "file.swx" */
3973 fname[n - 1] = 'p';
3974 if (r >= 0) /* "file.swx" seems to exist */
3975 {
3976 buf->b_shortname = TRUE;
3977 vim_free(fname);
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003978 fname = makeswapname(buf->b_fname, buf->b_ffname,
3979 buf, dir_name);
Bram Moolenaar071d4272004-06-13 20:20:40 +00003980 continue; /* try again with '.' replaced with '_' */
3981 }
3982 }
3983#endif
3984 /*
3985 * If we get here the ".swp" file really exists.
3986 * Give an error message, unless recovering, no file name, we are
3987 * viewing a help file or when the path of the file is different
3988 * (happens when all .swp files are in one directory).
3989 */
Bram Moolenaar8fc061c2004-12-29 21:03:02 +00003990 if (!recoverymode && buf->b_fname != NULL
3991 && !buf->b_help && !(buf->b_flags & BF_DUMMY))
Bram Moolenaar071d4272004-06-13 20:20:40 +00003992 {
3993 int fd;
3994 struct block0 b0;
3995 int differ = FALSE;
3996
3997 /*
3998 * Try to read block 0 from the swap file to get the original
3999 * file name (and inode number).
4000 */
4001 fd = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
4002 if (fd >= 0)
4003 {
4004 if (read(fd, (char *)&b0, sizeof(b0)) == sizeof(b0))
4005 {
4006 /*
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004007 * If the swapfile has the same directory as the
4008 * buffer don't compare the directory names, they can
4009 * have a different mountpoint.
Bram Moolenaar071d4272004-06-13 20:20:40 +00004010 */
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004011 if (b0.b0_flags & B0_SAME_DIR)
4012 {
4013 if (fnamecmp(gettail(buf->b_ffname),
4014 gettail(b0.b0_fname)) != 0
4015 || !same_directory(fname, buf->b_ffname))
Bram Moolenaar900b4d72005-12-12 22:05:50 +00004016 {
4017#ifdef CHECK_INODE
4018 /* Symlinks may point to the same file even
4019 * when the name differs, need to check the
4020 * inode too. */
4021 expand_env(b0.b0_fname, NameBuff, MAXPATHL);
4022 if (fnamecmp_ino(buf->b_ffname, NameBuff,
4023 char_to_long(b0.b0_ino)))
4024#endif
4025 differ = TRUE;
4026 }
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004027 }
4028 else
4029 {
4030 /*
4031 * The name in the swap file may be
4032 * "~user/path/file". Expand it first.
4033 */
4034 expand_env(b0.b0_fname, NameBuff, MAXPATHL);
Bram Moolenaar071d4272004-06-13 20:20:40 +00004035#ifdef CHECK_INODE
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004036 if (fnamecmp_ino(buf->b_ffname, NameBuff,
Bram Moolenaar900b4d72005-12-12 22:05:50 +00004037 char_to_long(b0.b0_ino)))
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004038 differ = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004039#else
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004040 if (fnamecmp(NameBuff, buf->b_ffname) != 0)
4041 differ = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004042#endif
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004043 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00004044 }
4045 close(fd);
4046 }
4047#ifdef RISCOS
4048 else
4049 /* Can't open swap file, though it does exist.
4050 * Assume that the user is editing two files with
4051 * the same name in different directories. No error.
4052 */
4053 differ = TRUE;
4054#endif
4055
4056 /* give the ATTENTION message when there is an old swap file
4057 * for the current file, and the buffer was not recovered. */
4058 if (differ == FALSE && !(curbuf->b_flags & BF_RECOVERED)
4059 && vim_strchr(p_shm, SHM_ATTENTION) == NULL)
4060 {
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004061#if defined(HAS_SWAP_EXISTS_ACTION)
4062 int choice = 0;
4063#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004064#ifdef CREATE_DUMMY_FILE
4065 int did_use_dummy = FALSE;
4066
4067 /* Avoid getting a warning for the file being created
4068 * outside of Vim, it was created at the start of this
4069 * function. Delete the file now, because Vim might exit
4070 * here if the window is closed. */
4071 if (dummyfd != NULL)
4072 {
4073 fclose(dummyfd);
4074 dummyfd = NULL;
4075 mch_remove(buf->b_fname);
4076 did_use_dummy = TRUE;
4077 }
4078#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004079
4080#if (defined(UNIX) || defined(__EMX__) || defined(VMS)) && (defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG))
4081 process_still_running = FALSE;
4082#endif
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004083#ifdef FEAT_AUTOCMD
4084 /*
4085 * If there is an SwapExists autocommand and we can handle
4086 * the response, trigger it. It may return 0 to ask the
4087 * user anyway.
4088 */
4089 if (swap_exists_action != SEA_NONE
4090 && has_autocmd(EVENT_SWAPEXISTS, buf->b_fname, buf))
4091 choice = do_swapexists(buf, fname);
Bram Moolenaar071d4272004-06-13 20:20:40 +00004092
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004093 if (choice == 0)
4094#endif
4095 {
4096#ifdef FEAT_GUI
4097 /* If we are supposed to start the GUI but it wasn't
4098 * completely started yet, start it now. This makes
4099 * the messages displayed in the Vim window when
4100 * loading a session from the .gvimrc file. */
4101 if (gui.starting && !gui.in_use)
4102 gui_start();
4103#endif
4104 /* Show info about the existing swap file. */
4105 attention_message(buf, fname);
4106
4107 /* We don't want a 'q' typed at the more-prompt
4108 * interrupt loading a file. */
4109 got_int = FALSE;
4110 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00004111
4112#if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004113 if (swap_exists_action != SEA_NONE && choice == 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004114 {
4115 char_u *name;
4116
4117 name = alloc((unsigned)(STRLEN(fname)
4118 + STRLEN(_("Swap file \""))
4119 + STRLEN(_("\" already exists!")) + 5));
4120 if (name != NULL)
4121 {
4122 STRCPY(name, _("Swap file \""));
4123 home_replace(NULL, fname, name + STRLEN(name),
4124 1000, TRUE);
4125 STRCAT(name, _("\" already exists!"));
4126 }
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004127 choice = do_dialog(VIM_WARNING,
Bram Moolenaar071d4272004-06-13 20:20:40 +00004128 (char_u *)_("VIM - ATTENTION"),
4129 name == NULL
4130 ? (char_u *)_("Swap file already exists!")
4131 : name,
4132# if defined(UNIX) || defined(__EMX__) || defined(VMS)
4133 process_still_running
4134 ? (char_u *)_("&Open Read-Only\n&Edit anyway\n&Recover\n&Quit\n&Abort") :
4135# endif
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004136 (char_u *)_("&Open Read-Only\n&Edit anyway\n&Recover\n&Delete it\n&Quit\n&Abort"), 1, NULL);
4137
4138# if defined(UNIX) || defined(__EMX__) || defined(VMS)
4139 if (process_still_running && choice >= 4)
4140 choice++; /* Skip missing "Delete it" button */
4141# endif
4142 vim_free(name);
4143
4144 /* pretend screen didn't scroll, need redraw anyway */
4145 msg_scrolled = 0;
4146 redraw_all_later(NOT_VALID);
4147 }
4148#endif
4149
4150#if defined(HAS_SWAP_EXISTS_ACTION)
4151 if (choice > 0)
4152 {
4153 switch (choice)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004154 {
4155 case 1:
4156 buf->b_p_ro = TRUE;
4157 break;
4158 case 2:
4159 break;
4160 case 3:
4161 swap_exists_action = SEA_RECOVER;
4162 break;
4163 case 4:
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004164 mch_remove(fname);
Bram Moolenaar071d4272004-06-13 20:20:40 +00004165 break;
4166 case 5:
4167 swap_exists_action = SEA_QUIT;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004168 break;
4169 case 6:
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004170 swap_exists_action = SEA_QUIT;
4171 got_int = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004172 break;
4173 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00004174
4175 /* If the file was deleted this fname can be used. */
4176 if (mch_getperm(fname) < 0)
4177 break;
4178 }
4179 else
4180#endif
4181 {
4182 MSG_PUTS("\n");
Bram Moolenaar4770d092006-01-12 23:22:24 +00004183 if (msg_silent == 0)
4184 /* call wait_return() later */
4185 need_wait_return = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004186 }
4187
4188#ifdef CREATE_DUMMY_FILE
4189 /* Going to try another name, need the dummy file again. */
4190 if (did_use_dummy)
4191 dummyfd = mch_fopen((char *)buf->b_fname, "w");
4192#endif
4193 }
4194 }
4195 }
4196
4197 /*
4198 * Change the ".swp" extension to find another file that can be used.
4199 * First decrement the last char: ".swo", ".swn", etc.
4200 * If that still isn't enough decrement the last but one char: ".svz"
Bram Moolenaar69a7cb42004-06-20 12:51:53 +00004201 * Can happen when editing many "No Name" buffers.
Bram Moolenaar071d4272004-06-13 20:20:40 +00004202 */
4203 if (fname[n - 1] == 'a') /* ".s?a" */
4204 {
4205 if (fname[n - 2] == 'a') /* ".saa": tried enough, give up */
4206 {
4207 EMSG(_("E326: Too many swap files found"));
4208 vim_free(fname);
4209 fname = NULL;
4210 break;
4211 }
4212 --fname[n - 2]; /* ".svz", ".suz", etc. */
4213 fname[n - 1] = 'z' + 1;
4214 }
4215 --fname[n - 1]; /* ".swo", ".swn", etc. */
4216 }
4217
4218 vim_free(dir_name);
4219#ifdef CREATE_DUMMY_FILE
4220 if (dummyfd != NULL) /* file has been created temporarily */
4221 {
4222 fclose(dummyfd);
4223 mch_remove(buf->b_fname);
4224 }
4225#endif
4226 return fname;
4227}
4228
4229 static int
4230b0_magic_wrong(b0p)
4231 ZERO_BL *b0p;
4232{
4233 return (b0p->b0_magic_long != (long)B0_MAGIC_LONG
4234 || b0p->b0_magic_int != (int)B0_MAGIC_INT
4235 || b0p->b0_magic_short != (short)B0_MAGIC_SHORT
4236 || b0p->b0_magic_char != B0_MAGIC_CHAR);
4237}
4238
4239#ifdef CHECK_INODE
4240/*
4241 * Compare current file name with file name from swap file.
4242 * Try to use inode numbers when possible.
4243 * Return non-zero when files are different.
4244 *
4245 * When comparing file names a few things have to be taken into consideration:
4246 * - When working over a network the full path of a file depends on the host.
4247 * We check the inode number if possible. It is not 100% reliable though,
4248 * because the device number cannot be used over a network.
4249 * - When a file does not exist yet (editing a new file) there is no inode
4250 * number.
4251 * - The file name in a swap file may not be valid on the current host. The
4252 * "~user" form is used whenever possible to avoid this.
4253 *
4254 * This is getting complicated, let's make a table:
4255 *
4256 * ino_c ino_s fname_c fname_s differ =
4257 *
4258 * both files exist -> compare inode numbers:
4259 * != 0 != 0 X X ino_c != ino_s
4260 *
4261 * inode number(s) unknown, file names available -> compare file names
4262 * == 0 X OK OK fname_c != fname_s
4263 * X == 0 OK OK fname_c != fname_s
4264 *
4265 * current file doesn't exist, file for swap file exist, file name(s) not
4266 * available -> probably different
4267 * == 0 != 0 FAIL X TRUE
4268 * == 0 != 0 X FAIL TRUE
4269 *
4270 * current file exists, inode for swap unknown, file name(s) not
4271 * available -> probably different
4272 * != 0 == 0 FAIL X TRUE
4273 * != 0 == 0 X FAIL TRUE
4274 *
4275 * current file doesn't exist, inode for swap unknown, one file name not
4276 * available -> probably different
4277 * == 0 == 0 FAIL OK TRUE
4278 * == 0 == 0 OK FAIL TRUE
4279 *
4280 * current file doesn't exist, inode for swap unknown, both file names not
4281 * available -> probably same file
4282 * == 0 == 0 FAIL FAIL FALSE
4283 *
4284 * Note that when the ino_t is 64 bits, only the last 32 will be used. This
4285 * can't be changed without making the block 0 incompatible with 32 bit
4286 * versions.
4287 */
4288
4289 static int
4290fnamecmp_ino(fname_c, fname_s, ino_block0)
4291 char_u *fname_c; /* current file name */
4292 char_u *fname_s; /* file name from swap file */
4293 long ino_block0;
4294{
4295 struct stat st;
4296 ino_t ino_c = 0; /* ino of current file */
4297 ino_t ino_s; /* ino of file from swap file */
4298 char_u buf_c[MAXPATHL]; /* full path of fname_c */
4299 char_u buf_s[MAXPATHL]; /* full path of fname_s */
4300 int retval_c; /* flag: buf_c valid */
4301 int retval_s; /* flag: buf_s valid */
4302
4303 if (mch_stat((char *)fname_c, &st) == 0)
4304 ino_c = (ino_t)st.st_ino;
4305
4306 /*
4307 * First we try to get the inode from the file name, because the inode in
4308 * the swap file may be outdated. If that fails (e.g. this path is not
4309 * valid on this machine), use the inode from block 0.
4310 */
4311 if (mch_stat((char *)fname_s, &st) == 0)
4312 ino_s = (ino_t)st.st_ino;
4313 else
4314 ino_s = (ino_t)ino_block0;
4315
4316 if (ino_c && ino_s)
4317 return (ino_c != ino_s);
4318
4319 /*
4320 * One of the inode numbers is unknown, try a forced vim_FullName() and
4321 * compare the file names.
4322 */
4323 retval_c = vim_FullName(fname_c, buf_c, MAXPATHL, TRUE);
4324 retval_s = vim_FullName(fname_s, buf_s, MAXPATHL, TRUE);
4325 if (retval_c == OK && retval_s == OK)
4326 return (STRCMP(buf_c, buf_s) != 0);
4327
4328 /*
4329 * Can't compare inodes or file names, guess that the files are different,
4330 * unless both appear not to exist at all.
4331 */
4332 if (ino_s == 0 && ino_c == 0 && retval_c == FAIL && retval_s == FAIL)
4333 return FALSE;
4334 return TRUE;
4335}
4336#endif /* CHECK_INODE */
4337
4338/*
4339 * Move a long integer into a four byte character array.
4340 * Used for machine independency in block zero.
4341 */
4342 static void
4343long_to_char(n, s)
4344 long n;
4345 char_u *s;
4346{
4347 s[0] = (char_u)(n & 0xff);
4348 n = (unsigned)n >> 8;
4349 s[1] = (char_u)(n & 0xff);
4350 n = (unsigned)n >> 8;
4351 s[2] = (char_u)(n & 0xff);
4352 n = (unsigned)n >> 8;
4353 s[3] = (char_u)(n & 0xff);
4354}
4355
4356 static long
4357char_to_long(s)
4358 char_u *s;
4359{
4360 long retval;
4361
4362 retval = s[3];
4363 retval <<= 8;
4364 retval |= s[2];
4365 retval <<= 8;
4366 retval |= s[1];
4367 retval <<= 8;
4368 retval |= s[0];
4369
4370 return retval;
4371}
4372
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004373/*
4374 * Set the flags in the first block of the swap file:
4375 * - file is modified or not: buf->b_changed
4376 * - 'fileformat'
4377 * - 'fileencoding'
4378 */
Bram Moolenaar071d4272004-06-13 20:20:40 +00004379 void
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004380ml_setflags(buf)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004381 buf_T *buf;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004382{
4383 bhdr_T *hp;
4384 ZERO_BL *b0p;
4385
4386 if (!buf->b_ml.ml_mfp)
4387 return;
4388 for (hp = buf->b_ml.ml_mfp->mf_used_last; hp != NULL; hp = hp->bh_prev)
4389 {
4390 if (hp->bh_bnum == 0)
4391 {
4392 b0p = (ZERO_BL *)(hp->bh_data);
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004393 b0p->b0_dirty = buf->b_changed ? B0_DIRTY : 0;
4394 b0p->b0_flags = (b0p->b0_flags & ~B0_FF_MASK)
4395 | (get_fileformat(buf) + 1);
4396#ifdef FEAT_MBYTE
4397 add_b0_fenc(b0p, buf);
4398#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004399 hp->bh_flags |= BH_DIRTY;
4400 mf_sync(buf->b_ml.ml_mfp, MFS_ZERO);
4401 break;
4402 }
4403 }
4404}
4405
4406#if defined(FEAT_BYTEOFF) || defined(PROTO)
4407
4408#define MLCS_MAXL 800 /* max no of lines in chunk */
4409#define MLCS_MINL 400 /* should be half of MLCS_MAXL */
4410
4411/*
4412 * Keep information for finding byte offset of a line, updtytpe may be one of:
4413 * ML_CHNK_ADDLINE: Add len to parent chunk, possibly splitting it
4414 * Careful: ML_CHNK_ADDLINE may cause ml_find_line() to be called.
4415 * ML_CHNK_DELLINE: Subtract len from parent chunk, possibly deleting it
4416 * ML_CHNK_UPDLINE: Add len to parent chunk, as a signed entity.
4417 */
4418 static void
4419ml_updatechunk(buf, line, len, updtype)
4420 buf_T *buf;
4421 linenr_T line;
4422 long len;
4423 int updtype;
4424{
4425 static buf_T *ml_upd_lastbuf = NULL;
4426 static linenr_T ml_upd_lastline;
4427 static linenr_T ml_upd_lastcurline;
4428 static int ml_upd_lastcurix;
4429
4430 linenr_T curline = ml_upd_lastcurline;
4431 int curix = ml_upd_lastcurix;
4432 long size;
4433 chunksize_T *curchnk;
4434 int rest;
4435 bhdr_T *hp;
4436 DATA_BL *dp;
4437
4438 if (buf->b_ml.ml_usedchunks == -1 || len == 0)
4439 return;
4440 if (buf->b_ml.ml_chunksize == NULL)
4441 {
4442 buf->b_ml.ml_chunksize = (chunksize_T *)
4443 alloc((unsigned)sizeof(chunksize_T) * 100);
4444 if (buf->b_ml.ml_chunksize == NULL)
4445 {
4446 buf->b_ml.ml_usedchunks = -1;
4447 return;
4448 }
4449 buf->b_ml.ml_numchunks = 100;
4450 buf->b_ml.ml_usedchunks = 1;
4451 buf->b_ml.ml_chunksize[0].mlcs_numlines = 1;
4452 buf->b_ml.ml_chunksize[0].mlcs_totalsize = 1;
4453 }
4454
4455 if (updtype == ML_CHNK_UPDLINE && buf->b_ml.ml_line_count == 1)
4456 {
4457 /*
4458 * First line in empty buffer from ml_flush_line() -- reset
4459 */
4460 buf->b_ml.ml_usedchunks = 1;
4461 buf->b_ml.ml_chunksize[0].mlcs_numlines = 1;
4462 buf->b_ml.ml_chunksize[0].mlcs_totalsize =
4463 (long)STRLEN(buf->b_ml.ml_line_ptr) + 1;
4464 return;
4465 }
4466
4467 /*
4468 * Find chunk that our line belongs to, curline will be at start of the
4469 * chunk.
4470 */
4471 if (buf != ml_upd_lastbuf || line != ml_upd_lastline + 1
4472 || updtype != ML_CHNK_ADDLINE)
4473 {
4474 for (curline = 1, curix = 0;
4475 curix < buf->b_ml.ml_usedchunks - 1
4476 && line >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4477 curix++)
4478 {
4479 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4480 }
4481 }
4482 else if (line >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines
4483 && curix < buf->b_ml.ml_usedchunks - 1)
4484 {
4485 /* Adjust cached curix & curline */
4486 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4487 curix++;
4488 }
4489 curchnk = buf->b_ml.ml_chunksize + curix;
4490
4491 if (updtype == ML_CHNK_DELLINE)
Bram Moolenaar5a6404c2006-11-01 17:12:57 +00004492 len = -len;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004493 curchnk->mlcs_totalsize += len;
4494 if (updtype == ML_CHNK_ADDLINE)
4495 {
4496 curchnk->mlcs_numlines++;
4497
4498 /* May resize here so we don't have to do it in both cases below */
4499 if (buf->b_ml.ml_usedchunks + 1 >= buf->b_ml.ml_numchunks)
4500 {
4501 buf->b_ml.ml_numchunks = buf->b_ml.ml_numchunks * 3 / 2;
4502 buf->b_ml.ml_chunksize = (chunksize_T *)
4503 vim_realloc(buf->b_ml.ml_chunksize,
4504 sizeof(chunksize_T) * buf->b_ml.ml_numchunks);
4505 if (buf->b_ml.ml_chunksize == NULL)
4506 {
4507 /* Hmmmm, Give up on offset for this buffer */
4508 buf->b_ml.ml_usedchunks = -1;
4509 return;
4510 }
4511 }
4512
4513 if (buf->b_ml.ml_chunksize[curix].mlcs_numlines >= MLCS_MAXL)
4514 {
4515 int count; /* number of entries in block */
4516 int idx;
4517 int text_end;
4518 int linecnt;
4519
4520 mch_memmove(buf->b_ml.ml_chunksize + curix + 1,
4521 buf->b_ml.ml_chunksize + curix,
4522 (buf->b_ml.ml_usedchunks - curix) *
4523 sizeof(chunksize_T));
4524 /* Compute length of first half of lines in the splitted chunk */
4525 size = 0;
4526 linecnt = 0;
4527 while (curline < buf->b_ml.ml_line_count
4528 && linecnt < MLCS_MINL)
4529 {
4530 if ((hp = ml_find_line(buf, curline, ML_FIND)) == NULL)
4531 {
4532 buf->b_ml.ml_usedchunks = -1;
4533 return;
4534 }
4535 dp = (DATA_BL *)(hp->bh_data);
4536 count = (long)(buf->b_ml.ml_locked_high) -
4537 (long)(buf->b_ml.ml_locked_low) + 1;
4538 idx = curline - buf->b_ml.ml_locked_low;
4539 curline = buf->b_ml.ml_locked_high + 1;
4540 if (idx == 0)/* first line in block, text at the end */
4541 text_end = dp->db_txt_end;
4542 else
4543 text_end = ((dp->db_index[idx - 1]) & DB_INDEX_MASK);
4544 /* Compute index of last line to use in this MEMLINE */
4545 rest = count - idx;
4546 if (linecnt + rest > MLCS_MINL)
4547 {
4548 idx += MLCS_MINL - linecnt - 1;
4549 linecnt = MLCS_MINL;
4550 }
4551 else
4552 {
4553 idx = count - 1;
4554 linecnt += rest;
4555 }
4556 size += text_end - ((dp->db_index[idx]) & DB_INDEX_MASK);
4557 }
4558 buf->b_ml.ml_chunksize[curix].mlcs_numlines = linecnt;
4559 buf->b_ml.ml_chunksize[curix + 1].mlcs_numlines -= linecnt;
4560 buf->b_ml.ml_chunksize[curix].mlcs_totalsize = size;
4561 buf->b_ml.ml_chunksize[curix + 1].mlcs_totalsize -= size;
4562 buf->b_ml.ml_usedchunks++;
4563 ml_upd_lastbuf = NULL; /* Force recalc of curix & curline */
4564 return;
4565 }
4566 else if (buf->b_ml.ml_chunksize[curix].mlcs_numlines >= MLCS_MINL
4567 && curix == buf->b_ml.ml_usedchunks - 1
4568 && buf->b_ml.ml_line_count - line <= 1)
4569 {
4570 /*
4571 * We are in the last chunk and it is cheap to crate a new one
4572 * after this. Do it now to avoid the loop above later on
4573 */
4574 curchnk = buf->b_ml.ml_chunksize + curix + 1;
4575 buf->b_ml.ml_usedchunks++;
4576 if (line == buf->b_ml.ml_line_count)
4577 {
4578 curchnk->mlcs_numlines = 0;
4579 curchnk->mlcs_totalsize = 0;
4580 }
4581 else
4582 {
4583 /*
4584 * Line is just prior to last, move count for last
4585 * This is the common case when loading a new file
4586 */
4587 hp = ml_find_line(buf, buf->b_ml.ml_line_count, ML_FIND);
4588 if (hp == NULL)
4589 {
4590 buf->b_ml.ml_usedchunks = -1;
4591 return;
4592 }
4593 dp = (DATA_BL *)(hp->bh_data);
4594 if (dp->db_line_count == 1)
4595 rest = dp->db_txt_end - dp->db_txt_start;
4596 else
4597 rest =
4598 ((dp->db_index[dp->db_line_count - 2]) & DB_INDEX_MASK)
4599 - dp->db_txt_start;
4600 curchnk->mlcs_totalsize = rest;
4601 curchnk->mlcs_numlines = 1;
4602 curchnk[-1].mlcs_totalsize -= rest;
4603 curchnk[-1].mlcs_numlines -= 1;
4604 }
4605 }
4606 }
4607 else if (updtype == ML_CHNK_DELLINE)
4608 {
4609 curchnk->mlcs_numlines--;
4610 ml_upd_lastbuf = NULL; /* Force recalc of curix & curline */
4611 if (curix < (buf->b_ml.ml_usedchunks - 1)
4612 && (curchnk->mlcs_numlines + curchnk[1].mlcs_numlines)
4613 <= MLCS_MINL)
4614 {
4615 curix++;
4616 curchnk = buf->b_ml.ml_chunksize + curix;
4617 }
4618 else if (curix == 0 && curchnk->mlcs_numlines <= 0)
4619 {
4620 buf->b_ml.ml_usedchunks--;
4621 mch_memmove(buf->b_ml.ml_chunksize, buf->b_ml.ml_chunksize + 1,
4622 buf->b_ml.ml_usedchunks * sizeof(chunksize_T));
4623 return;
4624 }
4625 else if (curix == 0 || (curchnk->mlcs_numlines > 10
4626 && (curchnk->mlcs_numlines + curchnk[-1].mlcs_numlines)
4627 > MLCS_MINL))
4628 {
4629 return;
4630 }
4631
4632 /* Collapse chunks */
4633 curchnk[-1].mlcs_numlines += curchnk->mlcs_numlines;
4634 curchnk[-1].mlcs_totalsize += curchnk->mlcs_totalsize;
4635 buf->b_ml.ml_usedchunks--;
4636 if (curix < buf->b_ml.ml_usedchunks)
4637 {
4638 mch_memmove(buf->b_ml.ml_chunksize + curix,
4639 buf->b_ml.ml_chunksize + curix + 1,
4640 (buf->b_ml.ml_usedchunks - curix) *
4641 sizeof(chunksize_T));
4642 }
4643 return;
4644 }
4645 ml_upd_lastbuf = buf;
4646 ml_upd_lastline = line;
4647 ml_upd_lastcurline = curline;
4648 ml_upd_lastcurix = curix;
4649}
4650
4651/*
4652 * Find offset for line or line with offset.
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004653 * Find line with offset if "lnum" is 0; return remaining offset in offp
4654 * Find offset of line if "lnum" > 0
Bram Moolenaar071d4272004-06-13 20:20:40 +00004655 * return -1 if information is not available
4656 */
4657 long
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004658ml_find_line_or_offset(buf, lnum, offp)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004659 buf_T *buf;
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004660 linenr_T lnum;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004661 long *offp;
4662{
4663 linenr_T curline;
4664 int curix;
4665 long size;
4666 bhdr_T *hp;
4667 DATA_BL *dp;
4668 int count; /* number of entries in block */
4669 int idx;
4670 int start_idx;
4671 int text_end;
4672 long offset;
4673 int len;
4674 int ffdos = (get_fileformat(buf) == EOL_DOS);
4675 int extra = 0;
4676
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004677 /* take care of cached line first */
4678 ml_flush_line(curbuf);
4679
Bram Moolenaar071d4272004-06-13 20:20:40 +00004680 if (buf->b_ml.ml_usedchunks == -1
4681 || buf->b_ml.ml_chunksize == NULL
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004682 || lnum < 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004683 return -1;
4684
4685 if (offp == NULL)
4686 offset = 0;
4687 else
4688 offset = *offp;
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004689 if (lnum == 0 && offset <= 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004690 return 1; /* Not a "find offset" and offset 0 _must_ be in line 1 */
4691 /*
4692 * Find the last chunk before the one containing our line. Last chunk is
4693 * special because it will never qualify
4694 */
4695 curline = 1;
4696 curix = size = 0;
4697 while (curix < buf->b_ml.ml_usedchunks - 1
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004698 && ((lnum != 0
4699 && lnum >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004700 || (offset != 0
4701 && offset > size + buf->b_ml.ml_chunksize[curix].mlcs_totalsize
4702 + ffdos * buf->b_ml.ml_chunksize[curix].mlcs_numlines)))
4703 {
4704 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4705 size += buf->b_ml.ml_chunksize[curix].mlcs_totalsize;
4706 if (offset && ffdos)
4707 size += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4708 curix++;
4709 }
4710
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004711 while ((lnum != 0 && curline < lnum) || (offset != 0 && size < offset))
Bram Moolenaar071d4272004-06-13 20:20:40 +00004712 {
4713 if (curline > buf->b_ml.ml_line_count
4714 || (hp = ml_find_line(buf, curline, ML_FIND)) == NULL)
4715 return -1;
4716 dp = (DATA_BL *)(hp->bh_data);
4717 count = (long)(buf->b_ml.ml_locked_high) -
4718 (long)(buf->b_ml.ml_locked_low) + 1;
4719 start_idx = idx = curline - buf->b_ml.ml_locked_low;
4720 if (idx == 0)/* first line in block, text at the end */
4721 text_end = dp->db_txt_end;
4722 else
4723 text_end = ((dp->db_index[idx - 1]) & DB_INDEX_MASK);
4724 /* Compute index of last line to use in this MEMLINE */
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004725 if (lnum != 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004726 {
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004727 if (curline + (count - idx) >= lnum)
4728 idx += lnum - curline - 1;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004729 else
4730 idx = count - 1;
4731 }
4732 else
4733 {
4734 extra = 0;
4735 while (offset >= size
4736 + text_end - (int)((dp->db_index[idx]) & DB_INDEX_MASK)
4737 + ffdos)
4738 {
4739 if (ffdos)
4740 size++;
4741 if (idx == count - 1)
4742 {
4743 extra = 1;
4744 break;
4745 }
4746 idx++;
4747 }
4748 }
4749 len = text_end - ((dp->db_index[idx]) & DB_INDEX_MASK);
4750 size += len;
4751 if (offset != 0 && size >= offset)
4752 {
4753 if (size + ffdos == offset)
4754 *offp = 0;
4755 else if (idx == start_idx)
4756 *offp = offset - size + len;
4757 else
4758 *offp = offset - size + len
4759 - (text_end - ((dp->db_index[idx - 1]) & DB_INDEX_MASK));
4760 curline += idx - start_idx + extra;
4761 if (curline > buf->b_ml.ml_line_count)
4762 return -1; /* exactly one byte beyond the end */
4763 return curline;
4764 }
4765 curline = buf->b_ml.ml_locked_high + 1;
4766 }
4767
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004768 if (lnum != 0)
Bram Moolenaar5eb86f92004-07-26 12:53:41 +00004769 {
4770 /* Count extra CR characters. */
4771 if (ffdos)
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004772 size += lnum - 1;
Bram Moolenaar5eb86f92004-07-26 12:53:41 +00004773
4774 /* Don't count the last line break if 'bin' and 'noeol'. */
4775 if (buf->b_p_bin && !buf->b_p_eol)
4776 size -= ffdos + 1;
4777 }
4778
Bram Moolenaar071d4272004-06-13 20:20:40 +00004779 return size;
4780}
4781
4782/*
4783 * Goto byte in buffer with offset 'cnt'.
4784 */
4785 void
4786goto_byte(cnt)
4787 long cnt;
4788{
4789 long boff = cnt;
4790 linenr_T lnum;
4791
4792 ml_flush_line(curbuf); /* cached line may be dirty */
4793 setpcmark();
4794 if (boff)
4795 --boff;
4796 lnum = ml_find_line_or_offset(curbuf, (linenr_T)0, &boff);
4797 if (lnum < 1) /* past the end */
4798 {
4799 curwin->w_cursor.lnum = curbuf->b_ml.ml_line_count;
4800 curwin->w_curswant = MAXCOL;
4801 coladvance((colnr_T)MAXCOL);
4802 }
4803 else
4804 {
4805 curwin->w_cursor.lnum = lnum;
4806 curwin->w_cursor.col = (colnr_T)boff;
Bram Moolenaar943d2b52005-12-02 00:50:49 +00004807# ifdef FEAT_VIRTUALEDIT
4808 curwin->w_cursor.coladd = 0;
4809# endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004810 curwin->w_set_curswant = TRUE;
4811 }
4812 check_cursor();
4813
4814# ifdef FEAT_MBYTE
4815 /* Make sure the cursor is on the first byte of a multi-byte char. */
4816 if (has_mbyte)
4817 mb_adjust_cursor();
4818# endif
4819}
4820#endif