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