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