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