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