blob: f5a68b19fead2716eb7cad002757d78b914726a8 [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);
867/*
868 * If the file name ends in ".sw?" we use it directly.
869 * Otherwise a search is done to find the swap file(s).
870 */
871 fname = curbuf->b_fname;
872 if (fname == NULL) /* When there is no file name */
873 fname = (char_u *)"";
874 len = (int)STRLEN(fname);
875 if (len >= 4 &&
876#if defined(VMS) || defined(RISCOS)
877 STRNICMP(fname + len - 4, "_sw" , 3)
878#else
879 STRNICMP(fname + len - 4, ".sw" , 3)
880#endif
881 == 0)
882 {
883 directly = TRUE;
884 fname = vim_strsave(fname); /* make a copy for mf_open() */
885 }
886 else
887 {
888 directly = FALSE;
889
890 /* count the number of matching swap files */
891 len = recover_names(&fname, FALSE, 0);
892 if (len == 0) /* no swap files found */
893 {
894 EMSG2(_("E305: No swap file found for %s"), fname);
895 goto theend;
896 }
897 if (len == 1) /* one swap file found, use it */
898 i = 1;
899 else /* several swap files found, choose */
900 {
901 /* list the names of the swap files */
902 (void)recover_names(&fname, TRUE, 0);
903 msg_putchar('\n');
904 MSG_PUTS(_("Enter number of swap file to use (0 to quit): "));
Bram Moolenaar24bbcfe2005-06-28 23:32:02 +0000905 i = get_number(FALSE, NULL);
Bram Moolenaar071d4272004-06-13 20:20:40 +0000906 if (i < 1 || i > len)
907 goto theend;
908 }
909 /* get the swap file name that will be used */
910 (void)recover_names(&fname, FALSE, i);
911 }
912 if (fname == NULL)
913 goto theend; /* out of memory */
914
915 /* When called from main() still need to initialize storage structure */
Bram Moolenaar4770d092006-01-12 23:22:24 +0000916 if (called_from_main && ml_open(curbuf) == FAIL)
Bram Moolenaar071d4272004-06-13 20:20:40 +0000917 getout(1);
918
919/*
920 * allocate a buffer structure (only the memline in it is really used)
921 */
922 buf = (buf_T *)alloc((unsigned)sizeof(buf_T));
923 if (buf == NULL)
924 {
925 vim_free(fname);
926 goto theend;
927 }
928
929/*
930 * init fields in memline struct
931 */
932 buf->b_ml.ml_stack_size = 0; /* no stack yet */
933 buf->b_ml.ml_stack = NULL; /* no stack yet */
934 buf->b_ml.ml_stack_top = 0; /* nothing in the stack */
935 buf->b_ml.ml_line_lnum = 0; /* no cached line */
936 buf->b_ml.ml_locked = NULL; /* no locked block */
937 buf->b_ml.ml_flags = 0;
938
939/*
940 * open the memfile from the old swap file
941 */
942 p = vim_strsave(fname); /* save fname for the message
943 (mf_open() may free fname) */
944 mfp = mf_open(fname, O_RDONLY); /* consumes fname! */
945 if (mfp == NULL || mfp->mf_fd < 0)
946 {
947 if (p != NULL)
948 {
949 EMSG2(_("E306: Cannot open %s"), p);
950 vim_free(p);
951 }
952 goto theend;
953 }
954 vim_free(p);
955 buf->b_ml.ml_mfp = mfp;
956
957 /*
958 * The page size set in mf_open() might be different from the page size
959 * used in the swap file, we must get it from block 0. But to read block
960 * 0 we need a page size. Use the minimal size for block 0 here, it will
961 * be set to the real value below.
962 */
963 mfp->mf_page_size = MIN_SWAP_PAGE_SIZE;
964
965/*
966 * try to read block 0
967 */
968 if ((hp = mf_get(mfp, (blocknr_T)0, 1)) == NULL)
969 {
970 msg_start();
971 MSG_PUTS_ATTR(_("Unable to read block 0 from "), attr | MSG_HIST);
972 msg_outtrans_attr(mfp->mf_fname, attr | MSG_HIST);
973 MSG_PUTS_ATTR(
974 _("\nMaybe no changes were made or Vim did not update the swap file."),
975 attr | MSG_HIST);
976 msg_end();
977 goto theend;
978 }
979 b0p = (ZERO_BL *)(hp->bh_data);
980 if (STRNCMP(b0p->b0_version, "VIM 3.0", 7) == 0)
981 {
982 msg_start();
983 msg_outtrans_attr(mfp->mf_fname, MSG_HIST);
984 MSG_PUTS_ATTR(_(" cannot be used with this version of Vim.\n"),
985 MSG_HIST);
986 MSG_PUTS_ATTR(_("Use Vim version 3.0.\n"), MSG_HIST);
987 msg_end();
988 goto theend;
989 }
990 if (b0p->b0_id[0] != BLOCK0_ID0 || b0p->b0_id[1] != BLOCK0_ID1)
991 {
992 EMSG2(_("E307: %s does not look like a Vim swap file"), mfp->mf_fname);
993 goto theend;
994 }
995 if (b0_magic_wrong(b0p))
996 {
997 msg_start();
998 msg_outtrans_attr(mfp->mf_fname, attr | MSG_HIST);
999#if defined(MSDOS) || defined(MSWIN)
1000 if (STRNCMP(b0p->b0_hname, "PC ", 3) == 0)
1001 MSG_PUTS_ATTR(_(" cannot be used with this version of Vim.\n"),
1002 attr | MSG_HIST);
1003 else
1004#endif
1005 MSG_PUTS_ATTR(_(" cannot be used on this computer.\n"),
1006 attr | MSG_HIST);
1007 MSG_PUTS_ATTR(_("The file was created on "), attr | MSG_HIST);
1008 /* avoid going past the end of a currupted hostname */
1009 b0p->b0_fname[0] = NUL;
1010 MSG_PUTS_ATTR(b0p->b0_hname, attr | MSG_HIST);
1011 MSG_PUTS_ATTR(_(",\nor the file has been damaged."), attr | MSG_HIST);
1012 msg_end();
1013 goto theend;
1014 }
Bram Moolenaar1c536282007-04-26 15:21:56 +00001015
Bram Moolenaar071d4272004-06-13 20:20:40 +00001016 /*
1017 * If we guessed the wrong page size, we have to recalculate the
1018 * highest block number in the file.
1019 */
1020 if (mfp->mf_page_size != (unsigned)char_to_long(b0p->b0_page_size))
1021 {
Bram Moolenaar1c536282007-04-26 15:21:56 +00001022 unsigned previous_page_size = mfp->mf_page_size;
1023
Bram Moolenaar071d4272004-06-13 20:20:40 +00001024 mf_new_page_size(mfp, (unsigned)char_to_long(b0p->b0_page_size));
Bram Moolenaar1c536282007-04-26 15:21:56 +00001025 if (mfp->mf_page_size < previous_page_size)
1026 {
1027 msg_start();
1028 msg_outtrans_attr(mfp->mf_fname, attr | MSG_HIST);
1029 MSG_PUTS_ATTR(_(" has been damaged (page size is smaller than minimum value).\n"),
1030 attr | MSG_HIST);
1031 msg_end();
1032 goto theend;
1033 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00001034 if ((size = lseek(mfp->mf_fd, (off_t)0L, SEEK_END)) <= 0)
1035 mfp->mf_blocknr_max = 0; /* no file or empty file */
1036 else
1037 mfp->mf_blocknr_max = (blocknr_T)(size / mfp->mf_page_size);
1038 mfp->mf_infile_count = mfp->mf_blocknr_max;
Bram Moolenaar1c536282007-04-26 15:21:56 +00001039
1040 /* need to reallocate the memory used to store the data */
1041 p = alloc(mfp->mf_page_size);
1042 if (p == NULL)
1043 goto theend;
1044 mch_memmove(p, hp->bh_data, previous_page_size);
1045 vim_free(hp->bh_data);
1046 hp->bh_data = p;
1047 b0p = (ZERO_BL *)(hp->bh_data);
Bram Moolenaar071d4272004-06-13 20:20:40 +00001048 }
1049
1050/*
1051 * If .swp file name given directly, use name from swap file for buffer.
1052 */
1053 if (directly)
1054 {
1055 expand_env(b0p->b0_fname, NameBuff, MAXPATHL);
1056 if (setfname(curbuf, NameBuff, NULL, TRUE) == FAIL)
1057 goto theend;
1058 }
1059
1060 home_replace(NULL, mfp->mf_fname, NameBuff, MAXPATHL, TRUE);
Bram Moolenaar555b2802005-05-19 21:08:39 +00001061 smsg((char_u *)_("Using swap file \"%s\""), NameBuff);
Bram Moolenaar071d4272004-06-13 20:20:40 +00001062
1063 if (buf_spname(curbuf) != NULL)
1064 STRCPY(NameBuff, buf_spname(curbuf));
1065 else
1066 home_replace(NULL, curbuf->b_ffname, NameBuff, MAXPATHL, TRUE);
Bram Moolenaar555b2802005-05-19 21:08:39 +00001067 smsg((char_u *)_("Original file \"%s\""), NameBuff);
Bram Moolenaar071d4272004-06-13 20:20:40 +00001068 msg_putchar('\n');
1069
1070/*
1071 * check date of swap file and original file
1072 */
1073 mtime = char_to_long(b0p->b0_mtime);
1074 if (curbuf->b_ffname != NULL
1075 && mch_stat((char *)curbuf->b_ffname, &org_stat) != -1
1076 && ((mch_stat((char *)mfp->mf_fname, &swp_stat) != -1
1077 && org_stat.st_mtime > swp_stat.st_mtime)
1078 || org_stat.st_mtime != mtime))
1079 {
1080 EMSG(_("E308: Warning: Original file may have been changed"));
1081 }
1082 out_flush();
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001083
1084 /* Get the 'fileformat' and 'fileencoding' from block zero. */
1085 b0_ff = (b0p->b0_flags & B0_FF_MASK);
1086 if (b0p->b0_flags & B0_HAS_FENC)
1087 {
1088 for (p = b0p->b0_fname + B0_FNAME_SIZE;
1089 p > b0p->b0_fname && p[-1] != NUL; --p)
1090 ;
Bram Moolenaara93fa7e2006-04-17 22:14:47 +00001091 b0_fenc = vim_strnsave(p, (int)(b0p->b0_fname + B0_FNAME_SIZE - p));
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001092 }
1093
Bram Moolenaar071d4272004-06-13 20:20:40 +00001094 mf_put(mfp, hp, FALSE, FALSE); /* release block 0 */
1095 hp = NULL;
1096
1097 /*
1098 * Now that we are sure that the file is going to be recovered, clear the
1099 * contents of the current buffer.
1100 */
1101 while (!(curbuf->b_ml.ml_flags & ML_EMPTY))
1102 ml_delete((linenr_T)1, FALSE);
1103
1104 /*
1105 * Try reading the original file to obtain the values of 'fileformat',
1106 * 'fileencoding', etc. Ignore errors. The text itself is not used.
1107 */
1108 if (curbuf->b_ffname != NULL)
1109 {
1110 (void)readfile(curbuf->b_ffname, NULL, (linenr_T)0,
1111 (linenr_T)0, (linenr_T)MAXLNUM, NULL, READ_NEW);
1112 while (!(curbuf->b_ml.ml_flags & ML_EMPTY))
1113 ml_delete((linenr_T)1, FALSE);
1114 }
1115
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001116 /* Use the 'fileformat' and 'fileencoding' as stored in the swap file. */
1117 if (b0_ff != 0)
1118 set_fileformat(b0_ff - 1, OPT_LOCAL);
1119 if (b0_fenc != NULL)
1120 {
1121 set_option_value((char_u *)"fenc", 0L, b0_fenc, OPT_LOCAL);
1122 vim_free(b0_fenc);
1123 }
1124 unchanged(curbuf, TRUE);
1125
Bram Moolenaar071d4272004-06-13 20:20:40 +00001126 bnum = 1; /* start with block 1 */
1127 page_count = 1; /* which is 1 page */
1128 lnum = 0; /* append after line 0 in curbuf */
1129 line_count = 0;
1130 idx = 0; /* start with first index in block 1 */
1131 error = 0;
1132 buf->b_ml.ml_stack_top = 0;
1133 buf->b_ml.ml_stack = NULL;
1134 buf->b_ml.ml_stack_size = 0; /* no stack yet */
1135
1136 if (curbuf->b_ffname == NULL)
1137 cannot_open = TRUE;
1138 else
1139 cannot_open = FALSE;
1140
1141 serious_error = FALSE;
1142 for ( ; !got_int; line_breakcheck())
1143 {
1144 if (hp != NULL)
1145 mf_put(mfp, hp, FALSE, FALSE); /* release previous block */
1146
1147 /*
1148 * get block
1149 */
1150 if ((hp = mf_get(mfp, (blocknr_T)bnum, page_count)) == NULL)
1151 {
1152 if (bnum == 1)
1153 {
1154 EMSG2(_("E309: Unable to read block 1 from %s"), mfp->mf_fname);
1155 goto theend;
1156 }
1157 ++error;
1158 ml_append(lnum++, (char_u *)_("???MANY LINES MISSING"),
1159 (colnr_T)0, TRUE);
1160 }
1161 else /* there is a block */
1162 {
1163 pp = (PTR_BL *)(hp->bh_data);
1164 if (pp->pb_id == PTR_ID) /* it is a pointer block */
1165 {
1166 /* check line count when using pointer block first time */
1167 if (idx == 0 && line_count != 0)
1168 {
1169 for (i = 0; i < (int)pp->pb_count; ++i)
1170 line_count -= pp->pb_pointer[i].pe_line_count;
1171 if (line_count != 0)
1172 {
1173 ++error;
1174 ml_append(lnum++, (char_u *)_("???LINE COUNT WRONG"),
1175 (colnr_T)0, TRUE);
1176 }
1177 }
1178
1179 if (pp->pb_count == 0)
1180 {
1181 ml_append(lnum++, (char_u *)_("???EMPTY BLOCK"),
1182 (colnr_T)0, TRUE);
1183 ++error;
1184 }
1185 else if (idx < (int)pp->pb_count) /* go a block deeper */
1186 {
1187 if (pp->pb_pointer[idx].pe_bnum < 0)
1188 {
1189 /*
1190 * Data block with negative block number.
1191 * Try to read lines from the original file.
1192 * This is slow, but it works.
1193 */
1194 if (!cannot_open)
1195 {
1196 line_count = pp->pb_pointer[idx].pe_line_count;
1197 if (readfile(curbuf->b_ffname, NULL, lnum,
1198 pp->pb_pointer[idx].pe_old_lnum - 1,
1199 line_count, NULL, 0) == FAIL)
1200 cannot_open = TRUE;
1201 else
1202 lnum += line_count;
1203 }
1204 if (cannot_open)
1205 {
1206 ++error;
1207 ml_append(lnum++, (char_u *)_("???LINES MISSING"),
1208 (colnr_T)0, TRUE);
1209 }
1210 ++idx; /* get same block again for next index */
1211 continue;
1212 }
1213
1214 /*
1215 * going one block deeper in the tree
1216 */
1217 if ((top = ml_add_stack(buf)) < 0) /* new entry in stack */
1218 {
1219 ++error;
1220 break; /* out of memory */
1221 }
1222 ip = &(buf->b_ml.ml_stack[top]);
1223 ip->ip_bnum = bnum;
1224 ip->ip_index = idx;
1225
1226 bnum = pp->pb_pointer[idx].pe_bnum;
1227 line_count = pp->pb_pointer[idx].pe_line_count;
1228 page_count = pp->pb_pointer[idx].pe_page_count;
1229 continue;
1230 }
1231 }
1232 else /* not a pointer block */
1233 {
1234 dp = (DATA_BL *)(hp->bh_data);
1235 if (dp->db_id != DATA_ID) /* block id wrong */
1236 {
1237 if (bnum == 1)
1238 {
1239 EMSG2(_("E310: Block 1 ID wrong (%s not a .swp file?)"),
1240 mfp->mf_fname);
1241 goto theend;
1242 }
1243 ++error;
1244 ml_append(lnum++, (char_u *)_("???BLOCK MISSING"),
1245 (colnr_T)0, TRUE);
1246 }
1247 else
1248 {
1249 /*
1250 * it is a data block
1251 * Append all the lines in this block
1252 */
1253 has_error = FALSE;
1254 /*
1255 * check length of block
1256 * if wrong, use length in pointer block
1257 */
1258 if (page_count * mfp->mf_page_size != dp->db_txt_end)
1259 {
1260 ml_append(lnum++, (char_u *)_("??? from here until ???END lines may be messed up"),
1261 (colnr_T)0, TRUE);
1262 ++error;
1263 has_error = TRUE;
1264 dp->db_txt_end = page_count * mfp->mf_page_size;
1265 }
1266
1267 /* make sure there is a NUL at the end of the block */
1268 *((char_u *)dp + dp->db_txt_end - 1) = NUL;
1269
1270 /*
1271 * check number of lines in block
1272 * if wrong, use count in data block
1273 */
1274 if (line_count != dp->db_line_count)
1275 {
1276 ml_append(lnum++, (char_u *)_("??? from here until ???END lines may have been inserted/deleted"),
1277 (colnr_T)0, TRUE);
1278 ++error;
1279 has_error = TRUE;
1280 }
1281
1282 for (i = 0; i < dp->db_line_count; ++i)
1283 {
1284 txt_start = (dp->db_index[i] & DB_INDEX_MASK);
1285 if (txt_start <= HEADER_SIZE
1286 || txt_start >= (int)dp->db_txt_end)
1287 {
1288 p = (char_u *)"???";
1289 ++error;
1290 }
1291 else
1292 p = (char_u *)dp + txt_start;
1293 ml_append(lnum++, p, (colnr_T)0, TRUE);
1294 }
1295 if (has_error)
1296 ml_append(lnum++, (char_u *)_("???END"), (colnr_T)0, TRUE);
1297 }
1298 }
1299 }
1300
1301 if (buf->b_ml.ml_stack_top == 0) /* finished */
1302 break;
1303
1304 /*
1305 * go one block up in the tree
1306 */
1307 ip = &(buf->b_ml.ml_stack[--(buf->b_ml.ml_stack_top)]);
1308 bnum = ip->ip_bnum;
1309 idx = ip->ip_index + 1; /* go to next index */
1310 page_count = 1;
1311 }
1312
1313 /*
1314 * The dummy line from the empty buffer will now be after the last line in
1315 * the buffer. Delete it.
1316 */
1317 ml_delete(curbuf->b_ml.ml_line_count, FALSE);
1318 curbuf->b_flags |= BF_RECOVERED;
1319
1320 recoverymode = FALSE;
1321 if (got_int)
1322 EMSG(_("E311: Recovery Interrupted"));
1323 else if (error)
1324 {
1325 ++no_wait_return;
1326 MSG(">>>>>>>>>>>>>");
1327 EMSG(_("E312: Errors detected while recovering; look for lines starting with ???"));
1328 --no_wait_return;
1329 MSG(_("See \":help E312\" for more information."));
1330 MSG(">>>>>>>>>>>>>");
1331 }
1332 else
1333 {
1334 MSG(_("Recovery completed. You should check if everything is OK."));
1335 MSG_PUTS(_("\n(You might want to write out this file under another name\n"));
1336 MSG_PUTS(_("and run diff with the original file to check for changes)\n"));
1337 MSG_PUTS(_("Delete the .swp file afterwards.\n\n"));
1338 cmdline_row = msg_row;
1339 }
1340 redraw_curbuf_later(NOT_VALID);
1341
1342theend:
1343 recoverymode = FALSE;
1344 if (mfp != NULL)
1345 {
1346 if (hp != NULL)
1347 mf_put(mfp, hp, FALSE, FALSE);
1348 mf_close(mfp, FALSE); /* will also vim_free(mfp->mf_fname) */
1349 }
Bram Moolenaardf88dda2007-01-09 13:34:50 +00001350 if (buf != NULL)
1351 {
1352 vim_free(buf->b_ml.ml_stack);
1353 vim_free(buf);
1354 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00001355 if (serious_error && called_from_main)
1356 ml_close(curbuf, TRUE);
1357#ifdef FEAT_AUTOCMD
1358 else
1359 {
1360 apply_autocmds(EVENT_BUFREADPOST, NULL, curbuf->b_fname, FALSE, curbuf);
1361 apply_autocmds(EVENT_BUFWINENTER, NULL, curbuf->b_fname, FALSE, curbuf);
1362 }
1363#endif
1364 return;
1365}
1366
1367/*
1368 * Find the names of swap files in current directory and the directory given
1369 * with the 'directory' option.
1370 *
1371 * Used to:
1372 * - list the swap files for "vim -r"
1373 * - count the number of swap files when recovering
1374 * - list the swap files when recovering
1375 * - find the name of the n'th swap file when recovering
1376 */
1377 int
1378recover_names(fname, list, nr)
1379 char_u **fname; /* base for swap file name */
1380 int list; /* when TRUE, list the swap file names */
1381 int nr; /* when non-zero, return nr'th swap file name */
1382{
1383 int num_names;
1384 char_u *(names[6]);
1385 char_u *tail;
1386 char_u *p;
1387 int num_files;
1388 int file_count = 0;
1389 char_u **files;
1390 int i;
1391 char_u *dirp;
1392 char_u *dir_name;
1393
1394 if (list)
1395 {
1396 /* use msg() to start the scrolling properly */
1397 msg((char_u *)_("Swap files found:"));
1398 msg_putchar('\n');
1399 }
1400
1401 /*
1402 * Do the loop for every directory in 'directory'.
1403 * First allocate some memory to put the directory name in.
1404 */
1405 dir_name = alloc((unsigned)STRLEN(p_dir) + 1);
1406 dirp = p_dir;
1407 while (dir_name != NULL && *dirp)
1408 {
1409 /*
1410 * Isolate a directory name from *dirp and put it in dir_name (we know
1411 * it is large enough, so use 31000 for length).
1412 * Advance dirp to next directory name.
1413 */
1414 (void)copy_option_part(&dirp, dir_name, 31000, ",");
1415
1416 if (dir_name[0] == '.' && dir_name[1] == NUL) /* check current dir */
1417 {
1418 if (fname == NULL || *fname == NULL)
1419 {
1420#ifdef VMS
1421 names[0] = vim_strsave((char_u *)"*_sw%");
1422#else
1423# ifdef RISCOS
1424 names[0] = vim_strsave((char_u *)"*_sw#");
1425# else
1426 names[0] = vim_strsave((char_u *)"*.sw?");
1427# endif
1428#endif
Bram Moolenaar2cc93182006-10-10 19:56:03 +00001429#if defined(UNIX) || defined(WIN3264)
1430 /* For Unix names starting with a dot are special. MS-Windows
1431 * supports this too, on some file systems. */
Bram Moolenaar071d4272004-06-13 20:20:40 +00001432 names[1] = vim_strsave((char_u *)".*.sw?");
1433 names[2] = vim_strsave((char_u *)".sw?");
1434 num_names = 3;
1435#else
1436# ifdef VMS
1437 names[1] = vim_strsave((char_u *)".*_sw%");
1438 num_names = 2;
1439# else
1440 num_names = 1;
1441# endif
1442#endif
1443 }
1444 else
1445 num_names = recov_file_names(names, *fname, TRUE);
1446 }
1447 else /* check directory dir_name */
1448 {
1449 if (fname == NULL || *fname == NULL)
1450 {
1451#ifdef VMS
1452 names[0] = concat_fnames(dir_name, (char_u *)"*_sw%", TRUE);
1453#else
1454# ifdef RISCOS
1455 names[0] = concat_fnames(dir_name, (char_u *)"*_sw#", TRUE);
1456# else
1457 names[0] = concat_fnames(dir_name, (char_u *)"*.sw?", TRUE);
1458# endif
1459#endif
Bram Moolenaar2cc93182006-10-10 19:56:03 +00001460#if defined(UNIX) || defined(WIN3264)
1461 /* For Unix names starting with a dot are special. MS-Windows
1462 * supports this too, on some file systems. */
Bram Moolenaar071d4272004-06-13 20:20:40 +00001463 names[1] = concat_fnames(dir_name, (char_u *)".*.sw?", TRUE);
1464 names[2] = concat_fnames(dir_name, (char_u *)".sw?", TRUE);
1465 num_names = 3;
1466#else
1467# ifdef VMS
1468 names[1] = concat_fnames(dir_name, (char_u *)".*_sw%", TRUE);
1469 num_names = 2;
1470# else
1471 num_names = 1;
1472# endif
1473#endif
1474 }
1475 else
1476 {
1477#if defined(UNIX) || defined(WIN3264)
1478 p = dir_name + STRLEN(dir_name);
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001479 if (after_pathsep(dir_name, p) && p[-1] == p[-2])
Bram Moolenaar071d4272004-06-13 20:20:40 +00001480 {
1481 /* Ends with '//', Use Full path for swap name */
1482 tail = make_percent_swname(dir_name, *fname);
1483 }
1484 else
1485#endif
1486 {
1487 tail = gettail(*fname);
1488 tail = concat_fnames(dir_name, tail, TRUE);
1489 }
1490 if (tail == NULL)
1491 num_names = 0;
1492 else
1493 {
1494 num_names = recov_file_names(names, tail, FALSE);
1495 vim_free(tail);
1496 }
1497 }
1498 }
1499
1500 /* check for out-of-memory */
1501 for (i = 0; i < num_names; ++i)
1502 {
1503 if (names[i] == NULL)
1504 {
1505 for (i = 0; i < num_names; ++i)
1506 vim_free(names[i]);
1507 num_names = 0;
1508 }
1509 }
1510 if (num_names == 0)
1511 num_files = 0;
1512 else if (expand_wildcards(num_names, names, &num_files, &files,
1513 EW_KEEPALL|EW_FILE|EW_SILENT) == FAIL)
1514 num_files = 0;
1515
1516 /*
1517 * When no swap file found, wildcard expansion might have failed (e.g.
1518 * not able to execute the shell).
1519 * Try finding a swap file by simply adding ".swp" to the file name.
1520 */
1521 if (*dirp == NUL && file_count + num_files == 0
1522 && fname != NULL && *fname != NULL)
1523 {
1524 struct stat st;
1525 char_u *swapname;
1526
1527#if defined(VMS) || defined(RISCOS)
1528 swapname = modname(*fname, (char_u *)"_swp", FALSE);
1529#else
1530 swapname = modname(*fname, (char_u *)".swp", TRUE);
1531#endif
1532 if (swapname != NULL)
1533 {
1534 if (mch_stat((char *)swapname, &st) != -1) /* It exists! */
1535 {
1536 files = (char_u **)alloc((unsigned)sizeof(char_u *));
1537 if (files != NULL)
1538 {
1539 files[0] = swapname;
1540 swapname = NULL;
1541 num_files = 1;
1542 }
1543 }
1544 vim_free(swapname);
1545 }
1546 }
1547
1548 /*
1549 * remove swapfile name of the current buffer, it must be ignored
1550 */
1551 if (curbuf->b_ml.ml_mfp != NULL
1552 && (p = curbuf->b_ml.ml_mfp->mf_fname) != NULL)
1553 {
1554 for (i = 0; i < num_files; ++i)
1555 if (fullpathcmp(p, files[i], TRUE) & FPC_SAME)
1556 {
1557 vim_free(files[i]);
1558 --num_files;
1559 for ( ; i < num_files; ++i)
1560 files[i] = files[i + 1];
1561 }
1562 }
Bram Moolenaarfc1421e2006-04-20 22:17:20 +00001563 if (nr > 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00001564 {
1565 file_count += num_files;
1566 if (nr <= file_count)
1567 {
1568 *fname = vim_strsave(files[nr - 1 + num_files - file_count]);
1569 dirp = (char_u *)""; /* stop searching */
1570 }
1571 }
1572 else if (list)
1573 {
1574 if (dir_name[0] == '.' && dir_name[1] == NUL)
1575 {
1576 if (fname == NULL || *fname == NULL)
1577 MSG_PUTS(_(" In current directory:\n"));
1578 else
1579 MSG_PUTS(_(" Using specified name:\n"));
1580 }
1581 else
1582 {
1583 MSG_PUTS(_(" In directory "));
1584 msg_home_replace(dir_name);
1585 MSG_PUTS(":\n");
1586 }
1587
1588 if (num_files)
1589 {
1590 for (i = 0; i < num_files; ++i)
1591 {
1592 /* print the swap file name */
1593 msg_outnum((long)++file_count);
1594 MSG_PUTS(". ");
1595 msg_puts(gettail(files[i]));
1596 msg_putchar('\n');
1597 (void)swapfile_info(files[i]);
1598 }
1599 }
1600 else
1601 MSG_PUTS(_(" -- none --\n"));
1602 out_flush();
1603 }
1604 else
1605 file_count += num_files;
1606
1607 for (i = 0; i < num_names; ++i)
1608 vim_free(names[i]);
Bram Moolenaarfc1421e2006-04-20 22:17:20 +00001609 if (num_files > 0)
1610 FreeWild(num_files, files);
Bram Moolenaar071d4272004-06-13 20:20:40 +00001611 }
1612 vim_free(dir_name);
1613 return file_count;
1614}
1615
1616#if defined(UNIX) || defined(WIN3264) /* Need _very_ long file names */
1617/*
1618 * Append the full path to name with path separators made into percent
1619 * signs, to dir. An unnamed buffer is handled as "" (<currentdir>/"")
1620 */
1621 static char_u *
1622make_percent_swname(dir, name)
1623 char_u *dir;
1624 char_u *name;
1625{
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001626 char_u *d, *s, *f;
Bram Moolenaar071d4272004-06-13 20:20:40 +00001627
1628 f = fix_fname(name != NULL ? name : (char_u *) "");
1629 d = NULL;
1630 if (f != NULL)
1631 {
1632 s = alloc((unsigned)(STRLEN(f) + 1));
1633 if (s != NULL)
1634 {
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00001635 STRCPY(s, f);
1636 for (d = s; *d != NUL; mb_ptr_adv(d))
1637 if (vim_ispathsep(*d))
1638 *d = '%';
Bram Moolenaar071d4272004-06-13 20:20:40 +00001639 d = concat_fnames(dir, s, TRUE);
1640 vim_free(s);
1641 }
1642 vim_free(f);
1643 }
1644 return d;
1645}
1646#endif
1647
1648#if (defined(UNIX) || defined(__EMX__) || defined(VMS)) && (defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG))
1649static int process_still_running;
1650#endif
1651
1652/*
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00001653 * Give information about an existing swap file.
Bram Moolenaar071d4272004-06-13 20:20:40 +00001654 * Returns timestamp (0 when unknown).
1655 */
1656 static time_t
1657swapfile_info(fname)
1658 char_u *fname;
1659{
1660 struct stat st;
1661 int fd;
1662 struct block0 b0;
1663 time_t x = (time_t)0;
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00001664 char *p;
Bram Moolenaar071d4272004-06-13 20:20:40 +00001665#ifdef UNIX
1666 char_u uname[B0_UNAME_SIZE];
1667#endif
1668
1669 /* print the swap file date */
1670 if (mch_stat((char *)fname, &st) != -1)
1671 {
1672#ifdef UNIX
1673 /* print name of owner of the file */
1674 if (mch_get_uname(st.st_uid, uname, B0_UNAME_SIZE) == OK)
1675 {
1676 MSG_PUTS(_(" owned by: "));
1677 msg_outtrans(uname);
1678 MSG_PUTS(_(" dated: "));
1679 }
1680 else
1681#endif
1682 MSG_PUTS(_(" dated: "));
1683 x = st.st_mtime; /* Manx C can't do &st.st_mtime */
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00001684 p = ctime(&x); /* includes '\n' */
1685 if (p == NULL)
1686 MSG_PUTS("(invalid)\n");
1687 else
1688 MSG_PUTS(p);
Bram Moolenaar071d4272004-06-13 20:20:40 +00001689 }
1690
1691 /*
1692 * print the original file name
1693 */
1694 fd = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
1695 if (fd >= 0)
1696 {
1697 if (read(fd, (char *)&b0, sizeof(b0)) == sizeof(b0))
1698 {
1699 if (STRNCMP(b0.b0_version, "VIM 3.0", 7) == 0)
1700 {
1701 MSG_PUTS(_(" [from Vim version 3.0]"));
1702 }
1703 else if (b0.b0_id[0] != BLOCK0_ID0 || b0.b0_id[1] != BLOCK0_ID1)
1704 {
1705 MSG_PUTS(_(" [does not look like a Vim swap file]"));
1706 }
1707 else
1708 {
1709 MSG_PUTS(_(" file name: "));
1710 if (b0.b0_fname[0] == NUL)
Bram Moolenaar69a7cb42004-06-20 12:51:53 +00001711 MSG_PUTS(_("[No Name]"));
Bram Moolenaar071d4272004-06-13 20:20:40 +00001712 else
1713 msg_outtrans(b0.b0_fname);
1714
1715 MSG_PUTS(_("\n modified: "));
1716 MSG_PUTS(b0.b0_dirty ? _("YES") : _("no"));
1717
1718 if (*(b0.b0_uname) != NUL)
1719 {
1720 MSG_PUTS(_("\n user name: "));
1721 msg_outtrans(b0.b0_uname);
1722 }
1723
1724 if (*(b0.b0_hname) != NUL)
1725 {
1726 if (*(b0.b0_uname) != NUL)
1727 MSG_PUTS(_(" host name: "));
1728 else
1729 MSG_PUTS(_("\n host name: "));
1730 msg_outtrans(b0.b0_hname);
1731 }
1732
1733 if (char_to_long(b0.b0_pid) != 0L)
1734 {
1735 MSG_PUTS(_("\n process ID: "));
1736 msg_outnum(char_to_long(b0.b0_pid));
1737#if defined(UNIX) || defined(__EMX__)
1738 /* EMX kill() not working correctly, it seems */
1739 if (kill((pid_t)char_to_long(b0.b0_pid), 0) == 0)
1740 {
1741 MSG_PUTS(_(" (still running)"));
1742# if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)
1743 process_still_running = TRUE;
1744# endif
1745 }
1746#endif
1747 }
1748
1749 if (b0_magic_wrong(&b0))
1750 {
1751#if defined(MSDOS) || defined(MSWIN)
1752 if (STRNCMP(b0.b0_hname, "PC ", 3) == 0)
1753 MSG_PUTS(_("\n [not usable with this version of Vim]"));
1754 else
1755#endif
1756 MSG_PUTS(_("\n [not usable on this computer]"));
1757 }
1758 }
1759 }
1760 else
1761 MSG_PUTS(_(" [cannot be read]"));
1762 close(fd);
1763 }
1764 else
1765 MSG_PUTS(_(" [cannot be opened]"));
1766 msg_putchar('\n');
1767
1768 return x;
1769}
1770
1771 static int
1772recov_file_names(names, path, prepend_dot)
1773 char_u **names;
1774 char_u *path;
1775 int prepend_dot;
1776{
1777 int num_names;
1778
1779#ifdef SHORT_FNAME
1780 /*
1781 * (MS-DOS) always short names
1782 */
1783 names[0] = modname(path, (char_u *)".sw?", FALSE);
1784 num_names = 1;
1785#else /* !SHORT_FNAME */
1786 /*
1787 * (Win32 and Win64) never short names, but do prepend a dot.
1788 * (Not MS-DOS or Win32 or Win64) maybe short name, maybe not: Try both.
1789 * Only use the short name if it is different.
1790 */
1791 char_u *p;
1792 int i;
1793# ifndef WIN3264
1794 int shortname = curbuf->b_shortname;
1795
1796 curbuf->b_shortname = FALSE;
1797# endif
1798
1799 num_names = 0;
1800
1801 /*
1802 * May also add the file name with a dot prepended, for swap file in same
1803 * dir as original file.
1804 */
1805 if (prepend_dot)
1806 {
1807 names[num_names] = modname(path, (char_u *)".sw?", TRUE);
1808 if (names[num_names] == NULL)
1809 goto end;
1810 ++num_names;
1811 }
1812
1813 /*
1814 * Form the normal swap file name pattern by appending ".sw?".
1815 */
1816#ifdef VMS
1817 names[num_names] = concat_fnames(path, (char_u *)"_sw%", FALSE);
1818#else
1819# ifdef RISCOS
1820 names[num_names] = concat_fnames(path, (char_u *)"_sw#", FALSE);
1821# else
1822 names[num_names] = concat_fnames(path, (char_u *)".sw?", FALSE);
1823# endif
1824#endif
1825 if (names[num_names] == NULL)
1826 goto end;
1827 if (num_names >= 1) /* check if we have the same name twice */
1828 {
1829 p = names[num_names - 1];
1830 i = (int)STRLEN(names[num_names - 1]) - (int)STRLEN(names[num_names]);
1831 if (i > 0)
1832 p += i; /* file name has been expanded to full path */
1833
1834 if (STRCMP(p, names[num_names]) != 0)
1835 ++num_names;
1836 else
1837 vim_free(names[num_names]);
1838 }
1839 else
1840 ++num_names;
1841
1842# ifndef WIN3264
1843 /*
1844 * Also try with 'shortname' set, in case the file is on a DOS filesystem.
1845 */
1846 curbuf->b_shortname = TRUE;
1847#ifdef VMS
1848 names[num_names] = modname(path, (char_u *)"_sw%", FALSE);
1849#else
1850# ifdef RISCOS
1851 names[num_names] = modname(path, (char_u *)"_sw#", FALSE);
1852# else
1853 names[num_names] = modname(path, (char_u *)".sw?", FALSE);
1854# endif
1855#endif
1856 if (names[num_names] == NULL)
1857 goto end;
1858
1859 /*
1860 * Remove the one from 'shortname', if it's the same as with 'noshortname'.
1861 */
1862 p = names[num_names];
1863 i = STRLEN(names[num_names]) - STRLEN(names[num_names - 1]);
1864 if (i > 0)
1865 p += i; /* file name has been expanded to full path */
1866 if (STRCMP(names[num_names - 1], p) == 0)
1867 vim_free(names[num_names]);
1868 else
1869 ++num_names;
1870# endif
1871
1872end:
1873# ifndef WIN3264
1874 curbuf->b_shortname = shortname;
1875# endif
1876
1877#endif /* !SHORT_FNAME */
1878
1879 return num_names;
1880}
1881
1882/*
1883 * sync all memlines
1884 *
1885 * If 'check_file' is TRUE, check if original file exists and was not changed.
1886 * If 'check_char' is TRUE, stop syncing when character becomes available, but
1887 * always sync at least one block.
1888 */
1889 void
1890ml_sync_all(check_file, check_char)
1891 int check_file;
1892 int check_char;
1893{
1894 buf_T *buf;
1895 struct stat st;
1896
1897 for (buf = firstbuf; buf != NULL; buf = buf->b_next)
1898 {
1899 if (buf->b_ml.ml_mfp == NULL || buf->b_ml.ml_mfp->mf_fname == NULL)
1900 continue; /* no file */
1901
1902 ml_flush_line(buf); /* flush buffered line */
1903 /* flush locked block */
1904 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH);
1905 if (bufIsChanged(buf) && check_file && mf_need_trans(buf->b_ml.ml_mfp)
1906 && buf->b_ffname != NULL)
1907 {
1908 /*
1909 * If the original file does not exist anymore or has been changed
1910 * call ml_preserve() to get rid of all negative numbered blocks.
1911 */
1912 if (mch_stat((char *)buf->b_ffname, &st) == -1
1913 || st.st_mtime != buf->b_mtime_read
1914 || (size_t)st.st_size != buf->b_orig_size)
1915 {
1916 ml_preserve(buf, FALSE);
1917 did_check_timestamps = FALSE;
1918 need_check_timestamps = TRUE; /* give message later */
1919 }
1920 }
1921 if (buf->b_ml.ml_mfp->mf_dirty)
1922 {
1923 (void)mf_sync(buf->b_ml.ml_mfp, (check_char ? MFS_STOP : 0)
1924 | (bufIsChanged(buf) ? MFS_FLUSH : 0));
1925 if (check_char && ui_char_avail()) /* character available now */
1926 break;
1927 }
1928 }
1929}
1930
1931/*
1932 * sync one buffer, including negative blocks
1933 *
1934 * after this all the blocks are in the swap file
1935 *
1936 * Used for the :preserve command and when the original file has been
1937 * changed or deleted.
1938 *
1939 * when message is TRUE the success of preserving is reported
1940 */
1941 void
1942ml_preserve(buf, message)
1943 buf_T *buf;
1944 int message;
1945{
1946 bhdr_T *hp;
1947 linenr_T lnum;
1948 memfile_T *mfp = buf->b_ml.ml_mfp;
1949 int status;
1950 int got_int_save = got_int;
1951
1952 if (mfp == NULL || mfp->mf_fname == NULL)
1953 {
1954 if (message)
1955 EMSG(_("E313: Cannot preserve, there is no swap file"));
1956 return;
1957 }
1958
1959 /* We only want to stop when interrupted here, not when interrupted
1960 * before. */
1961 got_int = FALSE;
1962
1963 ml_flush_line(buf); /* flush buffered line */
1964 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush locked block */
1965 status = mf_sync(mfp, MFS_ALL | MFS_FLUSH);
1966
1967 /* stack is invalid after mf_sync(.., MFS_ALL) */
1968 buf->b_ml.ml_stack_top = 0;
1969
1970 /*
1971 * Some of the data blocks may have been changed from negative to
1972 * positive block number. In that case the pointer blocks need to be
1973 * updated.
1974 *
1975 * We don't know in which pointer block the references are, so we visit
1976 * all data blocks until there are no more translations to be done (or
1977 * we hit the end of the file, which can only happen in case a write fails,
1978 * e.g. when file system if full).
1979 * ml_find_line() does the work by translating the negative block numbers
1980 * when getting the first line of each data block.
1981 */
1982 if (mf_need_trans(mfp) && !got_int)
1983 {
1984 lnum = 1;
1985 while (mf_need_trans(mfp) && lnum <= buf->b_ml.ml_line_count)
1986 {
1987 hp = ml_find_line(buf, lnum, ML_FIND);
1988 if (hp == NULL)
1989 {
1990 status = FAIL;
1991 goto theend;
1992 }
1993 CHECK(buf->b_ml.ml_locked_low != lnum, "low != lnum");
1994 lnum = buf->b_ml.ml_locked_high + 1;
1995 }
1996 (void)ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush locked block */
1997 /* sync the updated pointer blocks */
1998 if (mf_sync(mfp, MFS_ALL | MFS_FLUSH) == FAIL)
1999 status = FAIL;
2000 buf->b_ml.ml_stack_top = 0; /* stack is invalid now */
2001 }
2002theend:
2003 got_int |= got_int_save;
2004
2005 if (message)
2006 {
2007 if (status == OK)
2008 MSG(_("File preserved"));
2009 else
2010 EMSG(_("E314: Preserve failed"));
2011 }
2012}
2013
2014/*
2015 * NOTE: The pointer returned by the ml_get_*() functions only remains valid
2016 * until the next call!
2017 * line1 = ml_get(1);
2018 * line2 = ml_get(2); // line1 is now invalid!
2019 * Make a copy of the line if necessary.
2020 */
2021/*
2022 * get a pointer to a (read-only copy of a) line
2023 *
2024 * On failure an error message is given and IObuff is returned (to avoid
2025 * having to check for error everywhere).
2026 */
2027 char_u *
2028ml_get(lnum)
2029 linenr_T lnum;
2030{
2031 return ml_get_buf(curbuf, lnum, FALSE);
2032}
2033
2034/*
2035 * ml_get_pos: get pointer to position 'pos'
2036 */
2037 char_u *
2038ml_get_pos(pos)
2039 pos_T *pos;
2040{
2041 return (ml_get_buf(curbuf, pos->lnum, FALSE) + pos->col);
2042}
2043
2044/*
2045 * ml_get_curline: get pointer to cursor line.
2046 */
2047 char_u *
2048ml_get_curline()
2049{
2050 return ml_get_buf(curbuf, curwin->w_cursor.lnum, FALSE);
2051}
2052
2053/*
2054 * ml_get_cursor: get pointer to cursor position
2055 */
2056 char_u *
2057ml_get_cursor()
2058{
2059 return (ml_get_buf(curbuf, curwin->w_cursor.lnum, FALSE) +
2060 curwin->w_cursor.col);
2061}
2062
2063/*
2064 * get a pointer to a line in a specific buffer
2065 *
2066 * "will_change": if TRUE mark the buffer dirty (chars in the line will be
2067 * changed)
2068 */
2069 char_u *
2070ml_get_buf(buf, lnum, will_change)
2071 buf_T *buf;
2072 linenr_T lnum;
2073 int will_change; /* line will be changed */
2074{
Bram Moolenaarad40f022007-02-13 03:01:39 +00002075 bhdr_T *hp;
2076 DATA_BL *dp;
2077 char_u *ptr;
2078 static int recursive = 0;
Bram Moolenaar071d4272004-06-13 20:20:40 +00002079
2080 if (lnum > buf->b_ml.ml_line_count) /* invalid line number */
2081 {
Bram Moolenaarad40f022007-02-13 03:01:39 +00002082 if (recursive == 0)
2083 {
2084 /* Avoid giving this message for a recursive call, may happen when
2085 * the GUI redraws part of the text. */
2086 ++recursive;
2087 EMSGN(_("E315: ml_get: invalid lnum: %ld"), lnum);
2088 --recursive;
2089 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00002090errorret:
2091 STRCPY(IObuff, "???");
2092 return IObuff;
2093 }
2094 if (lnum <= 0) /* pretend line 0 is line 1 */
2095 lnum = 1;
2096
2097 if (buf->b_ml.ml_mfp == NULL) /* there are no lines */
2098 return (char_u *)"";
2099
2100/*
2101 * See if it is the same line as requested last time.
2102 * Otherwise may need to flush last used line.
Bram Moolenaar47b8b152007-02-07 02:41:57 +00002103 * Don't use the last used line when 'swapfile' is reset, need to load all
2104 * blocks.
Bram Moolenaar071d4272004-06-13 20:20:40 +00002105 */
Bram Moolenaar47b8b152007-02-07 02:41:57 +00002106 if (buf->b_ml.ml_line_lnum != lnum || mf_dont_release)
Bram Moolenaar071d4272004-06-13 20:20:40 +00002107 {
2108 ml_flush_line(buf);
2109
2110 /*
2111 * Find the data block containing the line.
2112 * This also fills the stack with the blocks from the root to the data
2113 * block and releases any locked block.
2114 */
2115 if ((hp = ml_find_line(buf, lnum, ML_FIND)) == NULL)
2116 {
Bram Moolenaarad40f022007-02-13 03:01:39 +00002117 if (recursive == 0)
2118 {
2119 /* Avoid giving this message for a recursive call, may happen
2120 * when the GUI redraws part of the text. */
2121 ++recursive;
2122 EMSGN(_("E316: ml_get: cannot find line %ld"), lnum);
2123 --recursive;
2124 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00002125 goto errorret;
2126 }
2127
2128 dp = (DATA_BL *)(hp->bh_data);
2129
2130 ptr = (char_u *)dp + ((dp->db_index[lnum - buf->b_ml.ml_locked_low]) & DB_INDEX_MASK);
2131 buf->b_ml.ml_line_ptr = ptr;
2132 buf->b_ml.ml_line_lnum = lnum;
2133 buf->b_ml.ml_flags &= ~ML_LINE_DIRTY;
2134 }
2135 if (will_change)
2136 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
2137
2138 return buf->b_ml.ml_line_ptr;
2139}
2140
2141/*
2142 * Check if a line that was just obtained by a call to ml_get
2143 * is in allocated memory.
2144 */
2145 int
2146ml_line_alloced()
2147{
2148 return (curbuf->b_ml.ml_flags & ML_LINE_DIRTY);
2149}
2150
2151/*
2152 * Append a line after lnum (may be 0 to insert a line in front of the file).
2153 * "line" does not need to be allocated, but can't be another line in a
2154 * buffer, unlocking may make it invalid.
2155 *
2156 * newfile: TRUE when starting to edit a new file, meaning that pe_old_lnum
2157 * will be set for recovery
2158 * Check: The caller of this function should probably also call
2159 * appended_lines().
2160 *
2161 * return FAIL for failure, OK otherwise
2162 */
2163 int
2164ml_append(lnum, line, len, newfile)
2165 linenr_T lnum; /* append after this line (can be 0) */
2166 char_u *line; /* text of the new line */
2167 colnr_T len; /* length of new line, including NUL, or 0 */
2168 int newfile; /* flag, see above */
2169{
2170 /* When starting up, we might still need to create the memfile */
2171 if (curbuf->b_ml.ml_mfp == NULL && open_buffer(FALSE, NULL) == FAIL)
2172 return FAIL;
2173
2174 if (curbuf->b_ml.ml_line_lnum != 0)
2175 ml_flush_line(curbuf);
2176 return ml_append_int(curbuf, lnum, line, len, newfile, FALSE);
2177}
2178
Bram Moolenaara1956f62006-03-12 22:18:00 +00002179#if defined(FEAT_SPELL) || defined(PROTO)
Bram Moolenaar4770d092006-01-12 23:22:24 +00002180/*
2181 * Like ml_append() but for an arbitrary buffer. The buffer must already have
2182 * a memline.
2183 */
2184 int
2185ml_append_buf(buf, lnum, line, len, newfile)
2186 buf_T *buf;
2187 linenr_T lnum; /* append after this line (can be 0) */
2188 char_u *line; /* text of the new line */
2189 colnr_T len; /* length of new line, including NUL, or 0 */
2190 int newfile; /* flag, see above */
2191{
2192 if (buf->b_ml.ml_mfp == NULL)
2193 return FAIL;
2194
2195 if (buf->b_ml.ml_line_lnum != 0)
2196 ml_flush_line(buf);
2197 return ml_append_int(buf, lnum, line, len, newfile, FALSE);
2198}
2199#endif
2200
Bram Moolenaar071d4272004-06-13 20:20:40 +00002201 static int
2202ml_append_int(buf, lnum, line, len, newfile, mark)
2203 buf_T *buf;
2204 linenr_T lnum; /* append after this line (can be 0) */
2205 char_u *line; /* text of the new line */
2206 colnr_T len; /* length of line, including NUL, or 0 */
2207 int newfile; /* flag, see above */
2208 int mark; /* mark the new line */
2209{
2210 int i;
2211 int line_count; /* number of indexes in current block */
2212 int offset;
2213 int from, to;
2214 int space_needed; /* space needed for new line */
2215 int page_size;
2216 int page_count;
2217 int db_idx; /* index for lnum in data block */
2218 bhdr_T *hp;
2219 memfile_T *mfp;
2220 DATA_BL *dp;
2221 PTR_BL *pp;
2222 infoptr_T *ip;
2223
2224 /* lnum out of range */
2225 if (lnum > buf->b_ml.ml_line_count || buf->b_ml.ml_mfp == NULL)
2226 return FAIL;
2227
2228 if (lowest_marked && lowest_marked > lnum)
2229 lowest_marked = lnum + 1;
2230
2231 if (len == 0)
2232 len = (colnr_T)STRLEN(line) + 1; /* space needed for the text */
2233 space_needed = len + INDEX_SIZE; /* space needed for text + index */
2234
2235 mfp = buf->b_ml.ml_mfp;
2236 page_size = mfp->mf_page_size;
2237
2238/*
2239 * find the data block containing the previous line
2240 * This also fills the stack with the blocks from the root to the data block
2241 * This also releases any locked block.
2242 */
2243 if ((hp = ml_find_line(buf, lnum == 0 ? (linenr_T)1 : lnum,
2244 ML_INSERT)) == NULL)
2245 return FAIL;
2246
2247 buf->b_ml.ml_flags &= ~ML_EMPTY;
2248
2249 if (lnum == 0) /* got line one instead, correct db_idx */
2250 db_idx = -1; /* careful, it is negative! */
2251 else
2252 db_idx = lnum - buf->b_ml.ml_locked_low;
2253 /* get line count before the insertion */
2254 line_count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low;
2255
2256 dp = (DATA_BL *)(hp->bh_data);
2257
2258/*
2259 * If
2260 * - there is not enough room in the current block
2261 * - appending to the last line in the block
2262 * - not appending to the last line in the file
2263 * insert in front of the next block.
2264 */
2265 if ((int)dp->db_free < space_needed && db_idx == line_count - 1
2266 && lnum < buf->b_ml.ml_line_count)
2267 {
2268 /*
2269 * Now that the line is not going to be inserted in the block that we
2270 * expected, the line count has to be adjusted in the pointer blocks
2271 * by using ml_locked_lineadd.
2272 */
2273 --(buf->b_ml.ml_locked_lineadd);
2274 --(buf->b_ml.ml_locked_high);
2275 if ((hp = ml_find_line(buf, lnum + 1, ML_INSERT)) == NULL)
2276 return FAIL;
2277
2278 db_idx = -1; /* careful, it is negative! */
2279 /* get line count before the insertion */
2280 line_count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low;
2281 CHECK(buf->b_ml.ml_locked_low != lnum + 1, "locked_low != lnum + 1");
2282
2283 dp = (DATA_BL *)(hp->bh_data);
2284 }
2285
2286 ++buf->b_ml.ml_line_count;
2287
2288 if ((int)dp->db_free >= space_needed) /* enough room in data block */
2289 {
2290/*
2291 * Insert new line in existing data block, or in data block allocated above.
2292 */
2293 dp->db_txt_start -= len;
2294 dp->db_free -= space_needed;
2295 ++(dp->db_line_count);
2296
2297 /*
2298 * move the text of the lines that follow to the front
2299 * adjust the indexes of the lines that follow
2300 */
2301 if (line_count > db_idx + 1) /* if there are following lines */
2302 {
2303 /*
2304 * Offset is the start of the previous line.
2305 * This will become the character just after the new line.
2306 */
2307 if (db_idx < 0)
2308 offset = dp->db_txt_end;
2309 else
2310 offset = ((dp->db_index[db_idx]) & DB_INDEX_MASK);
2311 mch_memmove((char *)dp + dp->db_txt_start,
2312 (char *)dp + dp->db_txt_start + len,
2313 (size_t)(offset - (dp->db_txt_start + len)));
2314 for (i = line_count - 1; i > db_idx; --i)
2315 dp->db_index[i + 1] = dp->db_index[i] - len;
2316 dp->db_index[db_idx + 1] = offset - len;
2317 }
2318 else /* add line at the end */
2319 dp->db_index[db_idx + 1] = dp->db_txt_start;
2320
2321 /*
2322 * copy the text into the block
2323 */
2324 mch_memmove((char *)dp + dp->db_index[db_idx + 1], line, (size_t)len);
2325 if (mark)
2326 dp->db_index[db_idx + 1] |= DB_MARKED;
2327
2328 /*
2329 * Mark the block dirty.
2330 */
2331 buf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2332 if (!newfile)
2333 buf->b_ml.ml_flags |= ML_LOCKED_POS;
2334 }
2335 else /* not enough space in data block */
2336 {
2337/*
2338 * If there is not enough room we have to create a new data block and copy some
2339 * lines into it.
2340 * Then we have to insert an entry in the pointer block.
2341 * If this pointer block also is full, we go up another block, and so on, up
2342 * to the root if necessary.
2343 * The line counts in the pointer blocks have already been adjusted by
2344 * ml_find_line().
2345 */
2346 long line_count_left, line_count_right;
2347 int page_count_left, page_count_right;
2348 bhdr_T *hp_left;
2349 bhdr_T *hp_right;
2350 bhdr_T *hp_new;
2351 int lines_moved;
2352 int data_moved = 0; /* init to shut up gcc */
2353 int total_moved = 0; /* init to shut up gcc */
2354 DATA_BL *dp_right, *dp_left;
2355 int stack_idx;
2356 int in_left;
2357 int lineadd;
2358 blocknr_T bnum_left, bnum_right;
2359 linenr_T lnum_left, lnum_right;
2360 int pb_idx;
2361 PTR_BL *pp_new;
2362
2363 /*
2364 * We are going to allocate a new data block. Depending on the
2365 * situation it will be put to the left or right of the existing
2366 * block. If possible we put the new line in the left block and move
2367 * the lines after it to the right block. Otherwise the new line is
2368 * also put in the right block. This method is more efficient when
2369 * inserting a lot of lines at one place.
2370 */
2371 if (db_idx < 0) /* left block is new, right block is existing */
2372 {
2373 lines_moved = 0;
2374 in_left = TRUE;
2375 /* space_needed does not change */
2376 }
2377 else /* left block is existing, right block is new */
2378 {
2379 lines_moved = line_count - db_idx - 1;
2380 if (lines_moved == 0)
2381 in_left = FALSE; /* put new line in right block */
2382 /* space_needed does not change */
2383 else
2384 {
2385 data_moved = ((dp->db_index[db_idx]) & DB_INDEX_MASK) -
2386 dp->db_txt_start;
2387 total_moved = data_moved + lines_moved * INDEX_SIZE;
2388 if ((int)dp->db_free + total_moved >= space_needed)
2389 {
2390 in_left = TRUE; /* put new line in left block */
2391 space_needed = total_moved;
2392 }
2393 else
2394 {
2395 in_left = FALSE; /* put new line in right block */
2396 space_needed += total_moved;
2397 }
2398 }
2399 }
2400
2401 page_count = ((space_needed + HEADER_SIZE) + page_size - 1) / page_size;
2402 if ((hp_new = ml_new_data(mfp, newfile, page_count)) == NULL)
2403 {
2404 /* correct line counts in pointer blocks */
2405 --(buf->b_ml.ml_locked_lineadd);
2406 --(buf->b_ml.ml_locked_high);
2407 return FAIL;
2408 }
2409 if (db_idx < 0) /* left block is new */
2410 {
2411 hp_left = hp_new;
2412 hp_right = hp;
2413 line_count_left = 0;
2414 line_count_right = line_count;
2415 }
2416 else /* right block is new */
2417 {
2418 hp_left = hp;
2419 hp_right = hp_new;
2420 line_count_left = line_count;
2421 line_count_right = 0;
2422 }
2423 dp_right = (DATA_BL *)(hp_right->bh_data);
2424 dp_left = (DATA_BL *)(hp_left->bh_data);
2425 bnum_left = hp_left->bh_bnum;
2426 bnum_right = hp_right->bh_bnum;
2427 page_count_left = hp_left->bh_page_count;
2428 page_count_right = hp_right->bh_page_count;
2429
2430 /*
2431 * May move the new line into the right/new block.
2432 */
2433 if (!in_left)
2434 {
2435 dp_right->db_txt_start -= len;
2436 dp_right->db_free -= len + INDEX_SIZE;
2437 dp_right->db_index[0] = dp_right->db_txt_start;
2438 if (mark)
2439 dp_right->db_index[0] |= DB_MARKED;
2440
2441 mch_memmove((char *)dp_right + dp_right->db_txt_start,
2442 line, (size_t)len);
2443 ++line_count_right;
2444 }
2445 /*
2446 * may move lines from the left/old block to the right/new one.
2447 */
2448 if (lines_moved)
2449 {
2450 /*
2451 */
2452 dp_right->db_txt_start -= data_moved;
2453 dp_right->db_free -= total_moved;
2454 mch_memmove((char *)dp_right + dp_right->db_txt_start,
2455 (char *)dp_left + dp_left->db_txt_start,
2456 (size_t)data_moved);
2457 offset = dp_right->db_txt_start - dp_left->db_txt_start;
2458 dp_left->db_txt_start += data_moved;
2459 dp_left->db_free += total_moved;
2460
2461 /*
2462 * update indexes in the new block
2463 */
2464 for (to = line_count_right, from = db_idx + 1;
2465 from < line_count_left; ++from, ++to)
2466 dp_right->db_index[to] = dp->db_index[from] + offset;
2467 line_count_right += lines_moved;
2468 line_count_left -= lines_moved;
2469 }
2470
2471 /*
2472 * May move the new line into the left (old or new) block.
2473 */
2474 if (in_left)
2475 {
2476 dp_left->db_txt_start -= len;
2477 dp_left->db_free -= len + INDEX_SIZE;
2478 dp_left->db_index[line_count_left] = dp_left->db_txt_start;
2479 if (mark)
2480 dp_left->db_index[line_count_left] |= DB_MARKED;
2481 mch_memmove((char *)dp_left + dp_left->db_txt_start,
2482 line, (size_t)len);
2483 ++line_count_left;
2484 }
2485
2486 if (db_idx < 0) /* left block is new */
2487 {
2488 lnum_left = lnum + 1;
2489 lnum_right = 0;
2490 }
2491 else /* right block is new */
2492 {
2493 lnum_left = 0;
2494 if (in_left)
2495 lnum_right = lnum + 2;
2496 else
2497 lnum_right = lnum + 1;
2498 }
2499 dp_left->db_line_count = line_count_left;
2500 dp_right->db_line_count = line_count_right;
2501
2502 /*
2503 * release the two data blocks
2504 * The new one (hp_new) already has a correct blocknumber.
2505 * The old one (hp, in ml_locked) gets a positive blocknumber if
2506 * we changed it and we are not editing a new file.
2507 */
2508 if (lines_moved || in_left)
2509 buf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2510 if (!newfile && db_idx >= 0 && in_left)
2511 buf->b_ml.ml_flags |= ML_LOCKED_POS;
2512 mf_put(mfp, hp_new, TRUE, FALSE);
2513
2514 /*
2515 * flush the old data block
2516 * set ml_locked_lineadd to 0, because the updating of the
2517 * pointer blocks is done below
2518 */
2519 lineadd = buf->b_ml.ml_locked_lineadd;
2520 buf->b_ml.ml_locked_lineadd = 0;
2521 ml_find_line(buf, (linenr_T)0, ML_FLUSH); /* flush data block */
2522
2523 /*
2524 * update pointer blocks for the new data block
2525 */
2526 for (stack_idx = buf->b_ml.ml_stack_top - 1; stack_idx >= 0;
2527 --stack_idx)
2528 {
2529 ip = &(buf->b_ml.ml_stack[stack_idx]);
2530 pb_idx = ip->ip_index;
2531 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
2532 return FAIL;
2533 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
2534 if (pp->pb_id != PTR_ID)
2535 {
2536 EMSG(_("E317: pointer block id wrong 3"));
2537 mf_put(mfp, hp, FALSE, FALSE);
2538 return FAIL;
2539 }
2540 /*
2541 * TODO: If the pointer block is full and we are adding at the end
2542 * try to insert in front of the next block
2543 */
2544 /* block not full, add one entry */
2545 if (pp->pb_count < pp->pb_count_max)
2546 {
2547 if (pb_idx + 1 < (int)pp->pb_count)
2548 mch_memmove(&pp->pb_pointer[pb_idx + 2],
2549 &pp->pb_pointer[pb_idx + 1],
2550 (size_t)(pp->pb_count - pb_idx - 1) * sizeof(PTR_EN));
2551 ++pp->pb_count;
2552 pp->pb_pointer[pb_idx].pe_line_count = line_count_left;
2553 pp->pb_pointer[pb_idx].pe_bnum = bnum_left;
2554 pp->pb_pointer[pb_idx].pe_page_count = page_count_left;
2555 pp->pb_pointer[pb_idx + 1].pe_line_count = line_count_right;
2556 pp->pb_pointer[pb_idx + 1].pe_bnum = bnum_right;
2557 pp->pb_pointer[pb_idx + 1].pe_page_count = page_count_right;
2558
2559 if (lnum_left != 0)
2560 pp->pb_pointer[pb_idx].pe_old_lnum = lnum_left;
2561 if (lnum_right != 0)
2562 pp->pb_pointer[pb_idx + 1].pe_old_lnum = lnum_right;
2563
2564 mf_put(mfp, hp, TRUE, FALSE);
2565 buf->b_ml.ml_stack_top = stack_idx + 1; /* truncate stack */
2566
2567 if (lineadd)
2568 {
2569 --(buf->b_ml.ml_stack_top);
Bram Moolenaar6b803a72007-05-06 14:25:46 +00002570 /* fix line count for rest of blocks in the stack */
Bram Moolenaar071d4272004-06-13 20:20:40 +00002571 ml_lineadd(buf, lineadd);
2572 /* fix stack itself */
2573 buf->b_ml.ml_stack[buf->b_ml.ml_stack_top].ip_high +=
2574 lineadd;
2575 ++(buf->b_ml.ml_stack_top);
2576 }
2577
2578 /*
2579 * We are finished, break the loop here.
2580 */
2581 break;
2582 }
2583 else /* pointer block full */
2584 {
2585 /*
2586 * split the pointer block
2587 * allocate a new pointer block
2588 * move some of the pointer into the new block
2589 * prepare for updating the parent block
2590 */
2591 for (;;) /* do this twice when splitting block 1 */
2592 {
2593 hp_new = ml_new_ptr(mfp);
2594 if (hp_new == NULL) /* TODO: try to fix tree */
2595 return FAIL;
2596 pp_new = (PTR_BL *)(hp_new->bh_data);
2597
2598 if (hp->bh_bnum != 1)
2599 break;
2600
2601 /*
2602 * if block 1 becomes full the tree is given an extra level
2603 * The pointers from block 1 are moved into the new block.
2604 * block 1 is updated to point to the new block
2605 * then continue to split the new block
2606 */
2607 mch_memmove(pp_new, pp, (size_t)page_size);
2608 pp->pb_count = 1;
2609 pp->pb_pointer[0].pe_bnum = hp_new->bh_bnum;
2610 pp->pb_pointer[0].pe_line_count = buf->b_ml.ml_line_count;
2611 pp->pb_pointer[0].pe_old_lnum = 1;
2612 pp->pb_pointer[0].pe_page_count = 1;
2613 mf_put(mfp, hp, TRUE, FALSE); /* release block 1 */
2614 hp = hp_new; /* new block is to be split */
2615 pp = pp_new;
2616 CHECK(stack_idx != 0, _("stack_idx should be 0"));
2617 ip->ip_index = 0;
2618 ++stack_idx; /* do block 1 again later */
2619 }
2620 /*
2621 * move the pointers after the current one to the new block
2622 * If there are none, the new entry will be in the new block.
2623 */
2624 total_moved = pp->pb_count - pb_idx - 1;
2625 if (total_moved)
2626 {
2627 mch_memmove(&pp_new->pb_pointer[0],
2628 &pp->pb_pointer[pb_idx + 1],
2629 (size_t)(total_moved) * sizeof(PTR_EN));
2630 pp_new->pb_count = total_moved;
2631 pp->pb_count -= total_moved - 1;
2632 pp->pb_pointer[pb_idx + 1].pe_bnum = bnum_right;
2633 pp->pb_pointer[pb_idx + 1].pe_line_count = line_count_right;
2634 pp->pb_pointer[pb_idx + 1].pe_page_count = page_count_right;
2635 if (lnum_right)
2636 pp->pb_pointer[pb_idx + 1].pe_old_lnum = lnum_right;
2637 }
2638 else
2639 {
2640 pp_new->pb_count = 1;
2641 pp_new->pb_pointer[0].pe_bnum = bnum_right;
2642 pp_new->pb_pointer[0].pe_line_count = line_count_right;
2643 pp_new->pb_pointer[0].pe_page_count = page_count_right;
2644 pp_new->pb_pointer[0].pe_old_lnum = lnum_right;
2645 }
2646 pp->pb_pointer[pb_idx].pe_bnum = bnum_left;
2647 pp->pb_pointer[pb_idx].pe_line_count = line_count_left;
2648 pp->pb_pointer[pb_idx].pe_page_count = page_count_left;
2649 if (lnum_left)
2650 pp->pb_pointer[pb_idx].pe_old_lnum = lnum_left;
2651 lnum_left = 0;
2652 lnum_right = 0;
2653
2654 /*
2655 * recompute line counts
2656 */
2657 line_count_right = 0;
2658 for (i = 0; i < (int)pp_new->pb_count; ++i)
2659 line_count_right += pp_new->pb_pointer[i].pe_line_count;
2660 line_count_left = 0;
2661 for (i = 0; i < (int)pp->pb_count; ++i)
2662 line_count_left += pp->pb_pointer[i].pe_line_count;
2663
2664 bnum_left = hp->bh_bnum;
2665 bnum_right = hp_new->bh_bnum;
2666 page_count_left = 1;
2667 page_count_right = 1;
2668 mf_put(mfp, hp, TRUE, FALSE);
2669 mf_put(mfp, hp_new, TRUE, FALSE);
2670 }
2671 }
2672
2673 /*
2674 * Safety check: fallen out of for loop?
2675 */
2676 if (stack_idx < 0)
2677 {
2678 EMSG(_("E318: Updated too many blocks?"));
2679 buf->b_ml.ml_stack_top = 0; /* invalidate stack */
2680 }
2681 }
2682
2683#ifdef FEAT_BYTEOFF
2684 /* The line was inserted below 'lnum' */
2685 ml_updatechunk(buf, lnum + 1, (long)len, ML_CHNK_ADDLINE);
2686#endif
2687#ifdef FEAT_NETBEANS_INTG
2688 if (usingNetbeans)
2689 {
2690 if (STRLEN(line) > 0)
Bram Moolenaara93fa7e2006-04-17 22:14:47 +00002691 netbeans_inserted(buf, lnum+1, (colnr_T)0, line, (int)STRLEN(line));
Bram Moolenaar35a9aaa2004-10-24 19:23:07 +00002692 netbeans_inserted(buf, lnum+1, (colnr_T)STRLEN(line),
Bram Moolenaar071d4272004-06-13 20:20:40 +00002693 (char_u *)"\n", 1);
2694 }
2695#endif
2696 return OK;
2697}
2698
2699/*
Bram Moolenaar4770d092006-01-12 23:22:24 +00002700 * Replace line lnum, with buffering, in current buffer.
Bram Moolenaar071d4272004-06-13 20:20:40 +00002701 *
Bram Moolenaar1056d982006-03-09 22:37:52 +00002702 * If "copy" is TRUE, make a copy of the line, otherwise the line has been
Bram Moolenaar071d4272004-06-13 20:20:40 +00002703 * copied to allocated memory already.
2704 *
2705 * Check: The caller of this function should probably also call
2706 * changed_lines(), unless update_screen(NOT_VALID) is used.
2707 *
2708 * return FAIL for failure, OK otherwise
2709 */
2710 int
2711ml_replace(lnum, line, copy)
2712 linenr_T lnum;
2713 char_u *line;
2714 int copy;
2715{
2716 if (line == NULL) /* just checking... */
2717 return FAIL;
2718
2719 /* When starting up, we might still need to create the memfile */
2720 if (curbuf->b_ml.ml_mfp == NULL && open_buffer(FALSE, NULL) == FAIL)
2721 return FAIL;
2722
2723 if (copy && (line = vim_strsave(line)) == NULL) /* allocate memory */
2724 return FAIL;
2725#ifdef FEAT_NETBEANS_INTG
2726 if (usingNetbeans)
2727 {
2728 netbeans_removed(curbuf, lnum, 0, (long)STRLEN(ml_get(lnum)));
Bram Moolenaara93fa7e2006-04-17 22:14:47 +00002729 netbeans_inserted(curbuf, lnum, 0, line, (int)STRLEN(line));
Bram Moolenaar071d4272004-06-13 20:20:40 +00002730 }
2731#endif
2732 if (curbuf->b_ml.ml_line_lnum != lnum) /* other line buffered */
2733 ml_flush_line(curbuf); /* flush it */
2734 else if (curbuf->b_ml.ml_flags & ML_LINE_DIRTY) /* same line allocated */
2735 vim_free(curbuf->b_ml.ml_line_ptr); /* free it */
2736 curbuf->b_ml.ml_line_ptr = line;
2737 curbuf->b_ml.ml_line_lnum = lnum;
2738 curbuf->b_ml.ml_flags = (curbuf->b_ml.ml_flags | ML_LINE_DIRTY) & ~ML_EMPTY;
2739
2740 return OK;
2741}
2742
2743/*
Bram Moolenaar4770d092006-01-12 23:22:24 +00002744 * Delete line 'lnum' in the current buffer.
Bram Moolenaar071d4272004-06-13 20:20:40 +00002745 *
2746 * Check: The caller of this function should probably also call
2747 * deleted_lines() after this.
2748 *
2749 * return FAIL for failure, OK otherwise
2750 */
2751 int
2752ml_delete(lnum, message)
2753 linenr_T lnum;
2754 int message;
2755{
2756 ml_flush_line(curbuf);
2757 return ml_delete_int(curbuf, lnum, message);
2758}
2759
2760 static int
2761ml_delete_int(buf, lnum, message)
2762 buf_T *buf;
2763 linenr_T lnum;
2764 int message;
2765{
2766 bhdr_T *hp;
2767 memfile_T *mfp;
2768 DATA_BL *dp;
2769 PTR_BL *pp;
2770 infoptr_T *ip;
2771 int count; /* number of entries in block */
2772 int idx;
2773 int stack_idx;
2774 int text_start;
2775 int line_start;
2776 long line_size;
2777 int i;
2778
2779 if (lnum < 1 || lnum > buf->b_ml.ml_line_count)
2780 return FAIL;
2781
2782 if (lowest_marked && lowest_marked > lnum)
2783 lowest_marked--;
2784
2785/*
2786 * If the file becomes empty the last line is replaced by an empty line.
2787 */
2788 if (buf->b_ml.ml_line_count == 1) /* file becomes empty */
2789 {
2790 if (message
2791#ifdef FEAT_NETBEANS_INTG
2792 && !netbeansSuppressNoLines
2793#endif
2794 )
Bram Moolenaar238a5642006-02-21 22:12:05 +00002795 set_keep_msg((char_u *)_(no_lines_msg), 0);
2796
Bram Moolenaar071d4272004-06-13 20:20:40 +00002797 /* FEAT_BYTEOFF already handled in there, dont worry 'bout it below */
2798 i = ml_replace((linenr_T)1, (char_u *)"", TRUE);
2799 buf->b_ml.ml_flags |= ML_EMPTY;
2800
2801 return i;
2802 }
2803
2804/*
2805 * find the data block containing the line
2806 * This also fills the stack with the blocks from the root to the data block
2807 * This also releases any locked block.
2808 */
2809 mfp = buf->b_ml.ml_mfp;
2810 if (mfp == NULL)
2811 return FAIL;
2812
2813 if ((hp = ml_find_line(buf, lnum, ML_DELETE)) == NULL)
2814 return FAIL;
2815
2816 dp = (DATA_BL *)(hp->bh_data);
2817 /* compute line count before the delete */
2818 count = (long)(buf->b_ml.ml_locked_high)
2819 - (long)(buf->b_ml.ml_locked_low) + 2;
2820 idx = lnum - buf->b_ml.ml_locked_low;
2821
2822 --buf->b_ml.ml_line_count;
2823
2824 line_start = ((dp->db_index[idx]) & DB_INDEX_MASK);
2825 if (idx == 0) /* first line in block, text at the end */
2826 line_size = dp->db_txt_end - line_start;
2827 else
2828 line_size = ((dp->db_index[idx - 1]) & DB_INDEX_MASK) - line_start;
2829
2830#ifdef FEAT_NETBEANS_INTG
2831 if (usingNetbeans)
Bram Moolenaar35a9aaa2004-10-24 19:23:07 +00002832 netbeans_removed(buf, lnum, 0, (long)line_size);
Bram Moolenaar071d4272004-06-13 20:20:40 +00002833#endif
2834
2835/*
2836 * special case: If there is only one line in the data block it becomes empty.
2837 * Then we have to remove the entry, pointing to this data block, from the
2838 * pointer block. If this pointer block also becomes empty, we go up another
2839 * block, and so on, up to the root if necessary.
2840 * The line counts in the pointer blocks have already been adjusted by
2841 * ml_find_line().
2842 */
2843 if (count == 1)
2844 {
2845 mf_free(mfp, hp); /* free the data block */
2846 buf->b_ml.ml_locked = NULL;
2847
2848 for (stack_idx = buf->b_ml.ml_stack_top - 1; stack_idx >= 0; --stack_idx)
2849 {
2850 buf->b_ml.ml_stack_top = 0; /* stack is invalid when failing */
2851 ip = &(buf->b_ml.ml_stack[stack_idx]);
2852 idx = ip->ip_index;
2853 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
2854 return FAIL;
2855 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
2856 if (pp->pb_id != PTR_ID)
2857 {
2858 EMSG(_("E317: pointer block id wrong 4"));
2859 mf_put(mfp, hp, FALSE, FALSE);
2860 return FAIL;
2861 }
2862 count = --(pp->pb_count);
2863 if (count == 0) /* the pointer block becomes empty! */
2864 mf_free(mfp, hp);
2865 else
2866 {
2867 if (count != idx) /* move entries after the deleted one */
2868 mch_memmove(&pp->pb_pointer[idx], &pp->pb_pointer[idx + 1],
2869 (size_t)(count - idx) * sizeof(PTR_EN));
2870 mf_put(mfp, hp, TRUE, FALSE);
2871
2872 buf->b_ml.ml_stack_top = stack_idx; /* truncate stack */
Bram Moolenaar6b803a72007-05-06 14:25:46 +00002873 /* fix line count for rest of blocks in the stack */
2874 if (buf->b_ml.ml_locked_lineadd != 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00002875 {
2876 ml_lineadd(buf, buf->b_ml.ml_locked_lineadd);
2877 buf->b_ml.ml_stack[buf->b_ml.ml_stack_top].ip_high +=
Bram Moolenaar6b803a72007-05-06 14:25:46 +00002878 buf->b_ml.ml_locked_lineadd;
Bram Moolenaar071d4272004-06-13 20:20:40 +00002879 }
2880 ++(buf->b_ml.ml_stack_top);
2881
2882 break;
2883 }
2884 }
2885 CHECK(stack_idx < 0, _("deleted block 1?"));
2886 }
2887 else
2888 {
2889 /*
2890 * delete the text by moving the next lines forwards
2891 */
2892 text_start = dp->db_txt_start;
2893 mch_memmove((char *)dp + text_start + line_size,
2894 (char *)dp + text_start, (size_t)(line_start - text_start));
2895
2896 /*
2897 * delete the index by moving the next indexes backwards
2898 * Adjust the indexes for the text movement.
2899 */
2900 for (i = idx; i < count - 1; ++i)
2901 dp->db_index[i] = dp->db_index[i + 1] + line_size;
2902
2903 dp->db_free += line_size + INDEX_SIZE;
2904 dp->db_txt_start += line_size;
2905 --(dp->db_line_count);
2906
2907 /*
2908 * mark the block dirty and make sure it is in the file (for recovery)
2909 */
2910 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
2911 }
2912
2913#ifdef FEAT_BYTEOFF
2914 ml_updatechunk(buf, lnum, line_size, ML_CHNK_DELLINE);
2915#endif
2916 return OK;
2917}
2918
2919/*
2920 * set the B_MARKED flag for line 'lnum'
2921 */
2922 void
2923ml_setmarked(lnum)
2924 linenr_T lnum;
2925{
2926 bhdr_T *hp;
2927 DATA_BL *dp;
2928 /* invalid line number */
2929 if (lnum < 1 || lnum > curbuf->b_ml.ml_line_count
2930 || curbuf->b_ml.ml_mfp == NULL)
2931 return; /* give error message? */
2932
2933 if (lowest_marked == 0 || lowest_marked > lnum)
2934 lowest_marked = lnum;
2935
2936 /*
2937 * find the data block containing the line
2938 * This also fills the stack with the blocks from the root to the data block
2939 * This also releases any locked block.
2940 */
2941 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2942 return; /* give error message? */
2943
2944 dp = (DATA_BL *)(hp->bh_data);
2945 dp->db_index[lnum - curbuf->b_ml.ml_locked_low] |= DB_MARKED;
2946 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2947}
2948
2949/*
2950 * find the first line with its B_MARKED flag set
2951 */
2952 linenr_T
2953ml_firstmarked()
2954{
2955 bhdr_T *hp;
2956 DATA_BL *dp;
2957 linenr_T lnum;
2958 int i;
2959
2960 if (curbuf->b_ml.ml_mfp == NULL)
2961 return (linenr_T) 0;
2962
2963 /*
2964 * The search starts with lowest_marked line. This is the last line where
2965 * a mark was found, adjusted by inserting/deleting lines.
2966 */
2967 for (lnum = lowest_marked; lnum <= curbuf->b_ml.ml_line_count; )
2968 {
2969 /*
2970 * Find the data block containing the line.
2971 * This also fills the stack with the blocks from the root to the data
2972 * block This also releases any locked block.
2973 */
2974 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
2975 return (linenr_T)0; /* give error message? */
2976
2977 dp = (DATA_BL *)(hp->bh_data);
2978
2979 for (i = lnum - curbuf->b_ml.ml_locked_low;
2980 lnum <= curbuf->b_ml.ml_locked_high; ++i, ++lnum)
2981 if ((dp->db_index[i]) & DB_MARKED)
2982 {
2983 (dp->db_index[i]) &= DB_INDEX_MASK;
2984 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
2985 lowest_marked = lnum + 1;
2986 return lnum;
2987 }
2988 }
2989
2990 return (linenr_T) 0;
2991}
2992
2993#if 0 /* not used */
2994/*
2995 * return TRUE if line 'lnum' has a mark
2996 */
2997 int
2998ml_has_mark(lnum)
2999 linenr_T lnum;
3000{
3001 bhdr_T *hp;
3002 DATA_BL *dp;
3003
3004 if (curbuf->b_ml.ml_mfp == NULL
3005 || (hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
3006 return FALSE;
3007
3008 dp = (DATA_BL *)(hp->bh_data);
3009 return (int)((dp->db_index[lnum - curbuf->b_ml.ml_locked_low]) & DB_MARKED);
3010}
3011#endif
3012
3013/*
3014 * clear all DB_MARKED flags
3015 */
3016 void
3017ml_clearmarked()
3018{
3019 bhdr_T *hp;
3020 DATA_BL *dp;
3021 linenr_T lnum;
3022 int i;
3023
3024 if (curbuf->b_ml.ml_mfp == NULL) /* nothing to do */
3025 return;
3026
3027 /*
3028 * The search starts with line lowest_marked.
3029 */
3030 for (lnum = lowest_marked; lnum <= curbuf->b_ml.ml_line_count; )
3031 {
3032 /*
3033 * Find the data block containing the line.
3034 * This also fills the stack with the blocks from the root to the data
3035 * block and releases any locked block.
3036 */
3037 if ((hp = ml_find_line(curbuf, lnum, ML_FIND)) == NULL)
3038 return; /* give error message? */
3039
3040 dp = (DATA_BL *)(hp->bh_data);
3041
3042 for (i = lnum - curbuf->b_ml.ml_locked_low;
3043 lnum <= curbuf->b_ml.ml_locked_high; ++i, ++lnum)
3044 if ((dp->db_index[i]) & DB_MARKED)
3045 {
3046 (dp->db_index[i]) &= DB_INDEX_MASK;
3047 curbuf->b_ml.ml_flags |= ML_LOCKED_DIRTY;
3048 }
3049 }
3050
3051 lowest_marked = 0;
3052 return;
3053}
3054
3055/*
3056 * flush ml_line if necessary
3057 */
3058 static void
3059ml_flush_line(buf)
3060 buf_T *buf;
3061{
3062 bhdr_T *hp;
3063 DATA_BL *dp;
3064 linenr_T lnum;
3065 char_u *new_line;
3066 char_u *old_line;
3067 colnr_T new_len;
3068 int old_len;
3069 int extra;
3070 int idx;
3071 int start;
3072 int count;
3073 int i;
3074
3075 if (buf->b_ml.ml_line_lnum == 0 || buf->b_ml.ml_mfp == NULL)
3076 return; /* nothing to do */
3077
3078 if (buf->b_ml.ml_flags & ML_LINE_DIRTY)
3079 {
3080 lnum = buf->b_ml.ml_line_lnum;
3081 new_line = buf->b_ml.ml_line_ptr;
3082
3083 hp = ml_find_line(buf, lnum, ML_FIND);
3084 if (hp == NULL)
3085 EMSGN(_("E320: Cannot find line %ld"), lnum);
3086 else
3087 {
3088 dp = (DATA_BL *)(hp->bh_data);
3089 idx = lnum - buf->b_ml.ml_locked_low;
3090 start = ((dp->db_index[idx]) & DB_INDEX_MASK);
3091 old_line = (char_u *)dp + start;
3092 if (idx == 0) /* line is last in block */
3093 old_len = dp->db_txt_end - start;
3094 else /* text of previous line follows */
3095 old_len = (dp->db_index[idx - 1] & DB_INDEX_MASK) - start;
3096 new_len = (colnr_T)STRLEN(new_line) + 1;
3097 extra = new_len - old_len; /* negative if lines gets smaller */
3098
3099 /*
3100 * if new line fits in data block, replace directly
3101 */
3102 if ((int)dp->db_free >= extra)
3103 {
3104 /* if the length changes and there are following lines */
3105 count = buf->b_ml.ml_locked_high - buf->b_ml.ml_locked_low + 1;
3106 if (extra != 0 && idx < count - 1)
3107 {
3108 /* move text of following lines */
3109 mch_memmove((char *)dp + dp->db_txt_start - extra,
3110 (char *)dp + dp->db_txt_start,
3111 (size_t)(start - dp->db_txt_start));
3112
3113 /* adjust pointers of this and following lines */
3114 for (i = idx + 1; i < count; ++i)
3115 dp->db_index[i] -= extra;
3116 }
3117 dp->db_index[idx] -= extra;
3118
3119 /* adjust free space */
3120 dp->db_free -= extra;
3121 dp->db_txt_start -= extra;
3122
3123 /* copy new line into the data block */
3124 mch_memmove(old_line - extra, new_line, (size_t)new_len);
3125 buf->b_ml.ml_flags |= (ML_LOCKED_DIRTY | ML_LOCKED_POS);
3126#ifdef FEAT_BYTEOFF
3127 /* The else case is already covered by the insert and delete */
3128 ml_updatechunk(buf, lnum, (long)extra, ML_CHNK_UPDLINE);
3129#endif
3130 }
3131 else
3132 {
3133 /*
3134 * Cannot do it in one data block: Delete and append.
3135 * Append first, because ml_delete_int() cannot delete the
3136 * last line in a buffer, which causes trouble for a buffer
3137 * that has only one line.
3138 * Don't forget to copy the mark!
3139 */
3140 /* How about handling errors??? */
3141 (void)ml_append_int(buf, lnum, new_line, new_len, FALSE,
3142 (dp->db_index[idx] & DB_MARKED));
3143 (void)ml_delete_int(buf, lnum, FALSE);
3144 }
3145 }
3146 vim_free(new_line);
3147 }
3148
3149 buf->b_ml.ml_line_lnum = 0;
3150}
3151
3152/*
3153 * create a new, empty, data block
3154 */
3155 static bhdr_T *
3156ml_new_data(mfp, negative, page_count)
3157 memfile_T *mfp;
3158 int negative;
3159 int page_count;
3160{
3161 bhdr_T *hp;
3162 DATA_BL *dp;
3163
3164 if ((hp = mf_new(mfp, negative, page_count)) == NULL)
3165 return NULL;
3166
3167 dp = (DATA_BL *)(hp->bh_data);
3168 dp->db_id = DATA_ID;
3169 dp->db_txt_start = dp->db_txt_end = page_count * mfp->mf_page_size;
3170 dp->db_free = dp->db_txt_start - HEADER_SIZE;
3171 dp->db_line_count = 0;
3172
3173 return hp;
3174}
3175
3176/*
3177 * create a new, empty, pointer block
3178 */
3179 static bhdr_T *
3180ml_new_ptr(mfp)
3181 memfile_T *mfp;
3182{
3183 bhdr_T *hp;
3184 PTR_BL *pp;
3185
3186 if ((hp = mf_new(mfp, FALSE, 1)) == NULL)
3187 return NULL;
3188
3189 pp = (PTR_BL *)(hp->bh_data);
3190 pp->pb_id = PTR_ID;
3191 pp->pb_count = 0;
3192 pp->pb_count_max = (short_u)((mfp->mf_page_size - sizeof(PTR_BL)) / sizeof(PTR_EN) + 1);
3193
3194 return hp;
3195}
3196
3197/*
3198 * lookup line 'lnum' in a memline
3199 *
3200 * action: if ML_DELETE or ML_INSERT the line count is updated while searching
3201 * if ML_FLUSH only flush a locked block
3202 * if ML_FIND just find the line
3203 *
3204 * If the block was found it is locked and put in ml_locked.
3205 * The stack is updated to lead to the locked block. The ip_high field in
3206 * the stack is updated to reflect the last line in the block AFTER the
3207 * insert or delete, also if the pointer block has not been updated yet. But
Bram Moolenaar6b803a72007-05-06 14:25:46 +00003208 * if ml_locked != NULL ml_locked_lineadd must be added to ip_high.
Bram Moolenaar071d4272004-06-13 20:20:40 +00003209 *
3210 * return: NULL for failure, pointer to block header otherwise
3211 */
3212 static bhdr_T *
3213ml_find_line(buf, lnum, action)
3214 buf_T *buf;
3215 linenr_T lnum;
3216 int action;
3217{
3218 DATA_BL *dp;
3219 PTR_BL *pp;
3220 infoptr_T *ip;
3221 bhdr_T *hp;
3222 memfile_T *mfp;
3223 linenr_T t;
3224 blocknr_T bnum, bnum2;
3225 int dirty;
3226 linenr_T low, high;
3227 int top;
3228 int page_count;
3229 int idx;
3230
3231 mfp = buf->b_ml.ml_mfp;
3232
3233 /*
3234 * If there is a locked block check if the wanted line is in it.
3235 * If not, flush and release the locked block.
3236 * Don't do this for ML_INSERT_SAME, because the stack need to be updated.
3237 * Don't do this for ML_FLUSH, because we want to flush the locked block.
Bram Moolenaar47b8b152007-02-07 02:41:57 +00003238 * Don't do this when 'swapfile' is reset, we want to load all the blocks.
Bram Moolenaar071d4272004-06-13 20:20:40 +00003239 */
3240 if (buf->b_ml.ml_locked)
3241 {
Bram Moolenaar47b8b152007-02-07 02:41:57 +00003242 if (ML_SIMPLE(action)
3243 && buf->b_ml.ml_locked_low <= lnum
3244 && buf->b_ml.ml_locked_high >= lnum
3245 && !mf_dont_release)
Bram Moolenaar071d4272004-06-13 20:20:40 +00003246 {
Bram Moolenaar47b8b152007-02-07 02:41:57 +00003247 /* remember to update pointer blocks and stack later */
Bram Moolenaar071d4272004-06-13 20:20:40 +00003248 if (action == ML_INSERT)
3249 {
3250 ++(buf->b_ml.ml_locked_lineadd);
3251 ++(buf->b_ml.ml_locked_high);
3252 }
3253 else if (action == ML_DELETE)
3254 {
3255 --(buf->b_ml.ml_locked_lineadd);
3256 --(buf->b_ml.ml_locked_high);
3257 }
3258 return (buf->b_ml.ml_locked);
3259 }
3260
3261 mf_put(mfp, buf->b_ml.ml_locked, buf->b_ml.ml_flags & ML_LOCKED_DIRTY,
3262 buf->b_ml.ml_flags & ML_LOCKED_POS);
3263 buf->b_ml.ml_locked = NULL;
3264
Bram Moolenaar6b803a72007-05-06 14:25:46 +00003265 /*
3266 * If lines have been added or deleted in the locked block, need to
3267 * update the line count in pointer blocks.
3268 */
3269 if (buf->b_ml.ml_locked_lineadd != 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00003270 ml_lineadd(buf, buf->b_ml.ml_locked_lineadd);
3271 }
3272
3273 if (action == ML_FLUSH) /* nothing else to do */
3274 return NULL;
3275
3276 bnum = 1; /* start at the root of the tree */
3277 page_count = 1;
3278 low = 1;
3279 high = buf->b_ml.ml_line_count;
3280
3281 if (action == ML_FIND) /* first try stack entries */
3282 {
3283 for (top = buf->b_ml.ml_stack_top - 1; top >= 0; --top)
3284 {
3285 ip = &(buf->b_ml.ml_stack[top]);
3286 if (ip->ip_low <= lnum && ip->ip_high >= lnum)
3287 {
3288 bnum = ip->ip_bnum;
3289 low = ip->ip_low;
3290 high = ip->ip_high;
3291 buf->b_ml.ml_stack_top = top; /* truncate stack at prev entry */
3292 break;
3293 }
3294 }
3295 if (top < 0)
3296 buf->b_ml.ml_stack_top = 0; /* not found, start at the root */
3297 }
3298 else /* ML_DELETE or ML_INSERT */
3299 buf->b_ml.ml_stack_top = 0; /* start at the root */
3300
3301/*
3302 * search downwards in the tree until a data block is found
3303 */
3304 for (;;)
3305 {
3306 if ((hp = mf_get(mfp, bnum, page_count)) == NULL)
3307 goto error_noblock;
3308
3309 /*
3310 * update high for insert/delete
3311 */
3312 if (action == ML_INSERT)
3313 ++high;
3314 else if (action == ML_DELETE)
3315 --high;
3316
3317 dp = (DATA_BL *)(hp->bh_data);
3318 if (dp->db_id == DATA_ID) /* data block */
3319 {
3320 buf->b_ml.ml_locked = hp;
3321 buf->b_ml.ml_locked_low = low;
3322 buf->b_ml.ml_locked_high = high;
3323 buf->b_ml.ml_locked_lineadd = 0;
3324 buf->b_ml.ml_flags &= ~(ML_LOCKED_DIRTY | ML_LOCKED_POS);
3325 return hp;
3326 }
3327
3328 pp = (PTR_BL *)(dp); /* must be pointer block */
3329 if (pp->pb_id != PTR_ID)
3330 {
3331 EMSG(_("E317: pointer block id wrong"));
3332 goto error_block;
3333 }
3334
3335 if ((top = ml_add_stack(buf)) < 0) /* add new entry to stack */
3336 goto error_block;
3337 ip = &(buf->b_ml.ml_stack[top]);
3338 ip->ip_bnum = bnum;
3339 ip->ip_low = low;
3340 ip->ip_high = high;
3341 ip->ip_index = -1; /* index not known yet */
3342
3343 dirty = FALSE;
3344 for (idx = 0; idx < (int)pp->pb_count; ++idx)
3345 {
3346 t = pp->pb_pointer[idx].pe_line_count;
3347 CHECK(t == 0, _("pe_line_count is zero"));
3348 if ((low += t) > lnum)
3349 {
3350 ip->ip_index = idx;
3351 bnum = pp->pb_pointer[idx].pe_bnum;
3352 page_count = pp->pb_pointer[idx].pe_page_count;
3353 high = low - 1;
3354 low -= t;
3355
3356 /*
3357 * a negative block number may have been changed
3358 */
3359 if (bnum < 0)
3360 {
3361 bnum2 = mf_trans_del(mfp, bnum);
3362 if (bnum != bnum2)
3363 {
3364 bnum = bnum2;
3365 pp->pb_pointer[idx].pe_bnum = bnum;
3366 dirty = TRUE;
3367 }
3368 }
3369
3370 break;
3371 }
3372 }
3373 if (idx >= (int)pp->pb_count) /* past the end: something wrong! */
3374 {
3375 if (lnum > buf->b_ml.ml_line_count)
3376 EMSGN(_("E322: line number out of range: %ld past the end"),
3377 lnum - buf->b_ml.ml_line_count);
3378
3379 else
3380 EMSGN(_("E323: line count wrong in block %ld"), bnum);
3381 goto error_block;
3382 }
3383 if (action == ML_DELETE)
3384 {
3385 pp->pb_pointer[idx].pe_line_count--;
3386 dirty = TRUE;
3387 }
3388 else if (action == ML_INSERT)
3389 {
3390 pp->pb_pointer[idx].pe_line_count++;
3391 dirty = TRUE;
3392 }
3393 mf_put(mfp, hp, dirty, FALSE);
3394 }
3395
3396error_block:
3397 mf_put(mfp, hp, FALSE, FALSE);
3398error_noblock:
3399/*
3400 * If action is ML_DELETE or ML_INSERT we have to correct the tree for
3401 * the incremented/decremented line counts, because there won't be a line
3402 * inserted/deleted after all.
3403 */
3404 if (action == ML_DELETE)
3405 ml_lineadd(buf, 1);
3406 else if (action == ML_INSERT)
3407 ml_lineadd(buf, -1);
3408 buf->b_ml.ml_stack_top = 0;
3409 return NULL;
3410}
3411
3412/*
3413 * add an entry to the info pointer stack
3414 *
3415 * return -1 for failure, number of the new entry otherwise
3416 */
3417 static int
3418ml_add_stack(buf)
3419 buf_T *buf;
3420{
3421 int top;
3422 infoptr_T *newstack;
3423
3424 top = buf->b_ml.ml_stack_top;
3425
3426 /* may have to increase the stack size */
3427 if (top == buf->b_ml.ml_stack_size)
3428 {
3429 CHECK(top > 0, _("Stack size increases")); /* more than 5 levels??? */
3430
3431 newstack = (infoptr_T *)alloc((unsigned)sizeof(infoptr_T) *
3432 (buf->b_ml.ml_stack_size + STACK_INCR));
3433 if (newstack == NULL)
3434 return -1;
Bram Moolenaar8c8de832008-06-24 22:58:06 +00003435 mch_memmove(newstack, buf->b_ml.ml_stack,
3436 (size_t)top * sizeof(infoptr_T));
Bram Moolenaar071d4272004-06-13 20:20:40 +00003437 vim_free(buf->b_ml.ml_stack);
3438 buf->b_ml.ml_stack = newstack;
3439 buf->b_ml.ml_stack_size += STACK_INCR;
3440 }
3441
3442 buf->b_ml.ml_stack_top++;
3443 return top;
3444}
3445
3446/*
3447 * Update the pointer blocks on the stack for inserted/deleted lines.
3448 * The stack itself is also updated.
3449 *
3450 * When a insert/delete line action fails, the line is not inserted/deleted,
3451 * but the pointer blocks have already been updated. That is fixed here by
3452 * walking through the stack.
3453 *
3454 * Count is the number of lines added, negative if lines have been deleted.
3455 */
3456 static void
3457ml_lineadd(buf, count)
3458 buf_T *buf;
3459 int count;
3460{
3461 int idx;
3462 infoptr_T *ip;
3463 PTR_BL *pp;
3464 memfile_T *mfp = buf->b_ml.ml_mfp;
3465 bhdr_T *hp;
3466
3467 for (idx = buf->b_ml.ml_stack_top - 1; idx >= 0; --idx)
3468 {
3469 ip = &(buf->b_ml.ml_stack[idx]);
3470 if ((hp = mf_get(mfp, ip->ip_bnum, 1)) == NULL)
3471 break;
3472 pp = (PTR_BL *)(hp->bh_data); /* must be pointer block */
3473 if (pp->pb_id != PTR_ID)
3474 {
3475 mf_put(mfp, hp, FALSE, FALSE);
3476 EMSG(_("E317: pointer block id wrong 2"));
3477 break;
3478 }
3479 pp->pb_pointer[ip->ip_index].pe_line_count += count;
3480 ip->ip_high += count;
3481 mf_put(mfp, hp, TRUE, FALSE);
3482 }
3483}
3484
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003485#ifdef HAVE_READLINK
3486static int resolve_symlink __ARGS((char_u *fname, char_u *buf));
3487
3488/*
3489 * Resolve a symlink in the last component of a file name.
3490 * Note that f_resolve() does it for every part of the path, we don't do that
3491 * here.
3492 * If it worked returns OK and the resolved link in "buf[MAXPATHL]".
3493 * Otherwise returns FAIL.
3494 */
3495 static int
3496resolve_symlink(fname, buf)
3497 char_u *fname;
3498 char_u *buf;
3499{
3500 char_u tmp[MAXPATHL];
3501 int ret;
3502 int depth = 0;
3503
3504 if (fname == NULL)
3505 return FAIL;
3506
3507 /* Put the result so far in tmp[], starting with the original name. */
3508 vim_strncpy(tmp, fname, MAXPATHL - 1);
3509
3510 for (;;)
3511 {
3512 /* Limit symlink depth to 100, catch recursive loops. */
3513 if (++depth == 100)
3514 {
3515 EMSG2(_("E773: Symlink loop for \"%s\""), fname);
3516 return FAIL;
3517 }
3518
3519 ret = readlink((char *)tmp, (char *)buf, MAXPATHL - 1);
3520 if (ret <= 0)
3521 {
Bram Moolenaarcc984262005-12-23 22:19:46 +00003522 if (errno == EINVAL || errno == ENOENT)
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003523 {
Bram Moolenaarcc984262005-12-23 22:19:46 +00003524 /* Found non-symlink or not existing file, stop here.
3525 * When at the first level use the unmodifed name, skip the
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003526 * call to vim_FullName(). */
3527 if (depth == 1)
3528 return FAIL;
3529
3530 /* Use the resolved name in tmp[]. */
3531 break;
3532 }
3533
3534 /* There must be some error reading links, use original name. */
3535 return FAIL;
3536 }
3537 buf[ret] = NUL;
3538
3539 /*
3540 * Check whether the symlink is relative or absolute.
3541 * If it's relative, build a new path based on the directory
3542 * portion of the filename (if any) and the path the symlink
3543 * points to.
3544 */
3545 if (mch_isFullName(buf))
3546 STRCPY(tmp, buf);
3547 else
3548 {
3549 char_u *tail;
3550
3551 tail = gettail(tmp);
3552 if (STRLEN(tail) + STRLEN(buf) >= MAXPATHL)
3553 return FAIL;
3554 STRCPY(tail, buf);
3555 }
3556 }
3557
3558 /*
3559 * Try to resolve the full name of the file so that the swapfile name will
3560 * be consistent even when opening a relative symlink from different
3561 * working directories.
3562 */
3563 return vim_FullName(tmp, buf, MAXPATHL, TRUE);
3564}
3565#endif
3566
Bram Moolenaar071d4272004-06-13 20:20:40 +00003567/*
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003568 * Make swap file name out of the file name and a directory name.
3569 * Returns pointer to allocated memory or NULL.
Bram Moolenaar071d4272004-06-13 20:20:40 +00003570 */
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003571/*ARGSUSED*/
3572 char_u *
3573makeswapname(fname, ffname, buf, dir_name)
3574 char_u *fname;
3575 char_u *ffname;
Bram Moolenaar071d4272004-06-13 20:20:40 +00003576 buf_T *buf;
3577 char_u *dir_name;
3578{
3579 char_u *r, *s;
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003580#ifdef HAVE_READLINK
3581 char_u fname_buf[MAXPATHL];
3582 char_u *fname_res;
3583#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00003584
3585#if defined(UNIX) || defined(WIN3264) /* Need _very_ long file names */
3586 s = dir_name + STRLEN(dir_name);
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00003587 if (after_pathsep(dir_name, s) && s[-1] == s[-2])
Bram Moolenaar071d4272004-06-13 20:20:40 +00003588 { /* Ends with '//', Use Full path */
3589 r = NULL;
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003590 if ((s = make_percent_swname(dir_name, fname)) != NULL)
Bram Moolenaar071d4272004-06-13 20:20:40 +00003591 {
3592 r = modname(s, (char_u *)".swp", FALSE);
3593 vim_free(s);
3594 }
3595 return r;
3596 }
3597#endif
3598
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003599#ifdef HAVE_READLINK
3600 /* Expand symlink in the file name, so that we put the swap file with the
3601 * actual file instead of with the symlink. */
3602 if (resolve_symlink(fname, fname_buf) == OK)
3603 fname_res = fname_buf;
3604 else
3605 fname_res = fname;
3606#endif
3607
Bram Moolenaar071d4272004-06-13 20:20:40 +00003608 r = buf_modname(
3609#ifdef SHORT_FNAME
3610 TRUE,
3611#else
3612 (buf->b_p_sn || buf->b_shortname),
3613#endif
Bram Moolenaar38323e42007-03-06 19:22:53 +00003614#ifdef RISCOS
3615 /* Avoid problems if fname has special chars, eg <Wimp$Scrap> */
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003616 ffname,
Bram Moolenaar071d4272004-06-13 20:20:40 +00003617#else
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003618# ifdef HAVE_READLINK
3619 fname_res,
3620# else
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003621 fname,
Bram Moolenaar900b4d72005-12-12 22:05:50 +00003622# endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00003623#endif
3624 (char_u *)
3625#if defined(VMS) || defined(RISCOS)
3626 "_swp",
3627#else
3628 ".swp",
3629#endif
3630#ifdef SHORT_FNAME /* always 8.3 file name */
3631 FALSE
3632#else
3633 /* Prepend a '.' to the swap file name for the current directory. */
3634 dir_name[0] == '.' && dir_name[1] == NUL
3635#endif
3636 );
3637 if (r == NULL) /* out of memory */
3638 return NULL;
3639
3640 s = get_file_in_dir(r, dir_name);
3641 vim_free(r);
3642 return s;
3643}
3644
3645/*
3646 * Get file name to use for swap file or backup file.
3647 * Use the name of the edited file "fname" and an entry in the 'dir' or 'bdir'
3648 * option "dname".
3649 * - If "dname" is ".", return "fname" (swap file in dir of file).
3650 * - If "dname" starts with "./", insert "dname" in "fname" (swap file
3651 * relative to dir of file).
3652 * - Otherwise, prepend "dname" to the tail of "fname" (swap file in specific
3653 * dir).
3654 *
3655 * The return value is an allocated string and can be NULL.
3656 */
3657 char_u *
3658get_file_in_dir(fname, dname)
3659 char_u *fname;
3660 char_u *dname; /* don't use "dirname", it is a global for Alpha */
3661{
3662 char_u *t;
3663 char_u *tail;
3664 char_u *retval;
3665 int save_char;
3666
3667 tail = gettail(fname);
3668
3669 if (dname[0] == '.' && dname[1] == NUL)
3670 retval = vim_strsave(fname);
3671 else if (dname[0] == '.' && vim_ispathsep(dname[1]))
3672 {
3673 if (tail == fname) /* no path before file name */
3674 retval = concat_fnames(dname + 2, tail, TRUE);
3675 else
3676 {
3677 save_char = *tail;
3678 *tail = NUL;
3679 t = concat_fnames(fname, dname + 2, TRUE);
3680 *tail = save_char;
3681 if (t == NULL) /* out of memory */
3682 retval = NULL;
3683 else
3684 {
3685 retval = concat_fnames(t, tail, TRUE);
3686 vim_free(t);
3687 }
3688 }
3689 }
3690 else
3691 retval = concat_fnames(dname, tail, TRUE);
3692
3693 return retval;
3694}
3695
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00003696static void attention_message __ARGS((buf_T *buf, char_u *fname));
3697
3698/*
3699 * Print the ATTENTION message: info about an existing swap file.
3700 */
3701 static void
3702attention_message(buf, fname)
3703 buf_T *buf; /* buffer being edited */
3704 char_u *fname; /* swap file name */
3705{
3706 struct stat st;
3707 time_t x, sx;
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00003708 char *p;
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00003709
3710 ++no_wait_return;
3711 (void)EMSG(_("E325: ATTENTION"));
3712 MSG_PUTS(_("\nFound a swap file by the name \""));
3713 msg_home_replace(fname);
3714 MSG_PUTS("\"\n");
3715 sx = swapfile_info(fname);
3716 MSG_PUTS(_("While opening file \""));
3717 msg_outtrans(buf->b_fname);
3718 MSG_PUTS("\"\n");
3719 if (mch_stat((char *)buf->b_fname, &st) != -1)
3720 {
3721 MSG_PUTS(_(" dated: "));
3722 x = st.st_mtime; /* Manx C can't do &st.st_mtime */
Bram Moolenaar31e97bf2006-10-10 14:20:13 +00003723 p = ctime(&x); /* includes '\n' */
3724 if (p == NULL)
3725 MSG_PUTS("(invalid)\n");
3726 else
3727 MSG_PUTS(p);
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00003728 if (sx != 0 && x > sx)
3729 MSG_PUTS(_(" NEWER than swap file!\n"));
3730 }
3731 /* Some of these messages are long to allow translation to
3732 * other languages. */
3733 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"));
3734 MSG_PUTS(_(" Quit, or continue with caution.\n"));
3735 MSG_PUTS(_("\n(2) An edit session for this file crashed.\n"));
3736 MSG_PUTS(_(" If this is the case, use \":recover\" or \"vim -r "));
3737 msg_outtrans(buf->b_fname);
3738 MSG_PUTS(_("\"\n to recover the changes (see \":help recovery\").\n"));
3739 MSG_PUTS(_(" If you did this already, delete the swap file \""));
3740 msg_outtrans(fname);
3741 MSG_PUTS(_("\"\n to avoid this message.\n"));
3742 cmdline_row = msg_row;
3743 --no_wait_return;
3744}
3745
3746#ifdef FEAT_AUTOCMD
3747static int do_swapexists __ARGS((buf_T *buf, char_u *fname));
3748
3749/*
3750 * Trigger the SwapExists autocommands.
3751 * Returns a value for equivalent to do_dialog() (see below):
3752 * 0: still need to ask for a choice
3753 * 1: open read-only
3754 * 2: edit anyway
3755 * 3: recover
3756 * 4: delete it
3757 * 5: quit
3758 * 6: abort
3759 */
3760 static int
3761do_swapexists(buf, fname)
3762 buf_T *buf;
3763 char_u *fname;
3764{
3765 set_vim_var_string(VV_SWAPNAME, fname, -1);
3766 set_vim_var_string(VV_SWAPCHOICE, NULL, -1);
3767
3768 /* Trigger SwapExists autocommands with <afile> set to the file being
3769 * edited. */
3770 apply_autocmds(EVENT_SWAPEXISTS, buf->b_fname, NULL, FALSE, NULL);
3771
3772 set_vim_var_string(VV_SWAPNAME, NULL, -1);
3773
3774 switch (*get_vim_var_str(VV_SWAPCHOICE))
3775 {
3776 case 'o': return 1;
3777 case 'e': return 2;
3778 case 'r': return 3;
3779 case 'd': return 4;
3780 case 'q': return 5;
3781 case 'a': return 6;
3782 }
3783
3784 return 0;
3785}
3786#endif
3787
Bram Moolenaar071d4272004-06-13 20:20:40 +00003788/*
3789 * Find out what name to use for the swap file for buffer 'buf'.
3790 *
3791 * Several names are tried to find one that does not exist
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003792 * Returns the name in allocated memory or NULL.
Bram Moolenaar071d4272004-06-13 20:20:40 +00003793 *
3794 * Note: If BASENAMELEN is not correct, you will get error messages for
3795 * not being able to open the swapfile
3796 */
3797 static char_u *
3798findswapname(buf, dirp, old_fname)
3799 buf_T *buf;
3800 char_u **dirp; /* pointer to list of directories */
3801 char_u *old_fname; /* don't give warning for this file name */
3802{
3803 char_u *fname;
3804 int n;
Bram Moolenaar071d4272004-06-13 20:20:40 +00003805 char_u *dir_name;
3806#ifdef AMIGA
3807 BPTR fh;
3808#endif
3809#ifndef SHORT_FNAME
3810 int r;
3811#endif
3812
3813#if !defined(SHORT_FNAME) \
3814 && ((!defined(UNIX) && !defined(OS2)) || defined(ARCHIE))
3815# define CREATE_DUMMY_FILE
3816 FILE *dummyfd = NULL;
3817
3818/*
3819 * If we start editing a new file, e.g. "test.doc", which resides on an MSDOS
3820 * compatible filesystem, it is possible that the file "test.doc.swp" which we
3821 * create will be exactly the same file. To avoid this problem we temporarily
3822 * create "test.doc".
3823 * Don't do this when the check below for a 8.3 file name is used.
3824 */
3825 if (!(buf->b_p_sn || buf->b_shortname) && buf->b_fname != NULL
3826 && mch_getperm(buf->b_fname) < 0)
3827 dummyfd = mch_fopen((char *)buf->b_fname, "w");
3828#endif
3829
3830/*
3831 * Isolate a directory name from *dirp and put it in dir_name.
3832 * First allocate some memory to put the directory name in.
3833 */
3834 dir_name = alloc((unsigned)STRLEN(*dirp) + 1);
3835 if (dir_name != NULL)
3836 (void)copy_option_part(dirp, dir_name, 31000, ",");
3837
3838/*
3839 * we try different names until we find one that does not exist yet
3840 */
3841 if (dir_name == NULL) /* out of memory */
3842 fname = NULL;
3843 else
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003844 fname = makeswapname(buf->b_fname, buf->b_ffname, buf, dir_name);
Bram Moolenaar071d4272004-06-13 20:20:40 +00003845
3846 for (;;)
3847 {
3848 if (fname == NULL) /* must be out of memory */
3849 break;
3850 if ((n = (int)STRLEN(fname)) == 0) /* safety check */
3851 {
3852 vim_free(fname);
3853 fname = NULL;
3854 break;
3855 }
3856#if (defined(UNIX) || defined(OS2)) && !defined(ARCHIE) && !defined(SHORT_FNAME)
3857/*
3858 * Some systems have a MS-DOS compatible filesystem that use 8.3 character
3859 * file names. If this is the first try and the swap file name does not fit in
3860 * 8.3, detect if this is the case, set shortname and try again.
3861 */
3862 if (fname[n - 2] == 'w' && fname[n - 1] == 'p'
3863 && !(buf->b_p_sn || buf->b_shortname))
3864 {
3865 char_u *tail;
3866 char_u *fname2;
3867 struct stat s1, s2;
3868 int f1, f2;
3869 int created1 = FALSE, created2 = FALSE;
3870 int same = FALSE;
3871
3872 /*
3873 * Check if swapfile name does not fit in 8.3:
3874 * It either contains two dots, is longer than 8 chars, or starts
3875 * with a dot.
3876 */
3877 tail = gettail(buf->b_fname);
3878 if ( vim_strchr(tail, '.') != NULL
3879 || STRLEN(tail) > (size_t)8
3880 || *gettail(fname) == '.')
3881 {
3882 fname2 = alloc(n + 2);
3883 if (fname2 != NULL)
3884 {
3885 STRCPY(fname2, fname);
3886 /* if fname == "xx.xx.swp", fname2 = "xx.xx.swx"
3887 * if fname == ".xx.swp", fname2 = ".xx.swpx"
3888 * if fname == "123456789.swp", fname2 = "12345678x.swp"
3889 */
3890 if (vim_strchr(tail, '.') != NULL)
3891 fname2[n - 1] = 'x';
3892 else if (*gettail(fname) == '.')
3893 {
3894 fname2[n] = 'x';
3895 fname2[n + 1] = NUL;
3896 }
3897 else
3898 fname2[n - 5] += 1;
3899 /*
3900 * may need to create the files to be able to use mch_stat()
3901 */
3902 f1 = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
3903 if (f1 < 0)
3904 {
3905 f1 = mch_open_rw((char *)fname,
3906 O_RDWR|O_CREAT|O_EXCL|O_EXTRA);
3907#if defined(OS2)
3908 if (f1 < 0 && errno == ENOENT)
3909 same = TRUE;
3910#endif
3911 created1 = TRUE;
3912 }
3913 if (f1 >= 0)
3914 {
3915 f2 = mch_open((char *)fname2, O_RDONLY | O_EXTRA, 0);
3916 if (f2 < 0)
3917 {
3918 f2 = mch_open_rw((char *)fname2,
3919 O_RDWR|O_CREAT|O_EXCL|O_EXTRA);
3920 created2 = TRUE;
3921 }
3922 if (f2 >= 0)
3923 {
3924 /*
3925 * Both files exist now. If mch_stat() returns the
3926 * same device and inode they are the same file.
3927 */
3928 if (mch_fstat(f1, &s1) != -1
3929 && mch_fstat(f2, &s2) != -1
3930 && s1.st_dev == s2.st_dev
3931 && s1.st_ino == s2.st_ino)
3932 same = TRUE;
3933 close(f2);
3934 if (created2)
3935 mch_remove(fname2);
3936 }
3937 close(f1);
3938 if (created1)
3939 mch_remove(fname);
3940 }
3941 vim_free(fname2);
3942 if (same)
3943 {
3944 buf->b_shortname = TRUE;
3945 vim_free(fname);
Bram Moolenaar04a09c12005-08-01 22:02:32 +00003946 fname = makeswapname(buf->b_fname, buf->b_ffname,
3947 buf, dir_name);
Bram Moolenaar071d4272004-06-13 20:20:40 +00003948 continue; /* try again with b_shortname set */
3949 }
3950 }
3951 }
3952 }
3953#endif
3954 /*
3955 * check if the swapfile already exists
3956 */
3957 if (mch_getperm(fname) < 0) /* it does not exist */
3958 {
3959#ifdef HAVE_LSTAT
3960 struct stat sb;
3961
3962 /*
3963 * Extra security check: When a swap file is a symbolic link, this
3964 * is most likely a symlink attack.
3965 */
3966 if (mch_lstat((char *)fname, &sb) < 0)
3967#else
3968# ifdef AMIGA
3969 fh = Open((UBYTE *)fname, (long)MODE_NEWFILE);
3970 /*
3971 * on the Amiga mch_getperm() will return -1 when the file exists
3972 * but is being used by another program. This happens if you edit
3973 * a file twice.
3974 */
3975 if (fh != (BPTR)NULL) /* can open file, OK */
3976 {
3977 Close(fh);
3978 mch_remove(fname);
3979 break;
3980 }
3981 if (IoErr() != ERROR_OBJECT_IN_USE
3982 && IoErr() != ERROR_OBJECT_EXISTS)
3983# endif
3984#endif
3985 break;
3986 }
3987
3988 /*
3989 * A file name equal to old_fname is OK to use.
3990 */
3991 if (old_fname != NULL && fnamecmp(fname, old_fname) == 0)
3992 break;
3993
3994 /*
3995 * get here when file already exists
3996 */
3997 if (fname[n - 2] == 'w' && fname[n - 1] == 'p') /* first try */
3998 {
3999#ifndef SHORT_FNAME
4000 /*
4001 * on MS-DOS compatible filesystems (e.g. messydos) file.doc.swp
4002 * and file.doc are the same file. To guess if this problem is
4003 * present try if file.doc.swx exists. If it does, we set
4004 * buf->b_shortname and try file_doc.swp (dots replaced by
4005 * underscores for this file), and try again. If it doesn't we
4006 * assume that "file.doc.swp" already exists.
4007 */
4008 if (!(buf->b_p_sn || buf->b_shortname)) /* not tried yet */
4009 {
4010 fname[n - 1] = 'x';
4011 r = mch_getperm(fname); /* try "file.swx" */
4012 fname[n - 1] = 'p';
4013 if (r >= 0) /* "file.swx" seems to exist */
4014 {
4015 buf->b_shortname = TRUE;
4016 vim_free(fname);
Bram Moolenaar04a09c12005-08-01 22:02:32 +00004017 fname = makeswapname(buf->b_fname, buf->b_ffname,
4018 buf, dir_name);
Bram Moolenaar071d4272004-06-13 20:20:40 +00004019 continue; /* try again with '.' replaced with '_' */
4020 }
4021 }
4022#endif
4023 /*
4024 * If we get here the ".swp" file really exists.
4025 * Give an error message, unless recovering, no file name, we are
4026 * viewing a help file or when the path of the file is different
4027 * (happens when all .swp files are in one directory).
4028 */
Bram Moolenaar8fc061c2004-12-29 21:03:02 +00004029 if (!recoverymode && buf->b_fname != NULL
4030 && !buf->b_help && !(buf->b_flags & BF_DUMMY))
Bram Moolenaar071d4272004-06-13 20:20:40 +00004031 {
4032 int fd;
4033 struct block0 b0;
4034 int differ = FALSE;
4035
4036 /*
4037 * Try to read block 0 from the swap file to get the original
4038 * file name (and inode number).
4039 */
4040 fd = mch_open((char *)fname, O_RDONLY | O_EXTRA, 0);
4041 if (fd >= 0)
4042 {
4043 if (read(fd, (char *)&b0, sizeof(b0)) == sizeof(b0))
4044 {
4045 /*
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004046 * If the swapfile has the same directory as the
4047 * buffer don't compare the directory names, they can
4048 * have a different mountpoint.
Bram Moolenaar071d4272004-06-13 20:20:40 +00004049 */
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004050 if (b0.b0_flags & B0_SAME_DIR)
4051 {
4052 if (fnamecmp(gettail(buf->b_ffname),
4053 gettail(b0.b0_fname)) != 0
4054 || !same_directory(fname, buf->b_ffname))
Bram Moolenaar900b4d72005-12-12 22:05:50 +00004055 {
4056#ifdef CHECK_INODE
4057 /* Symlinks may point to the same file even
4058 * when the name differs, need to check the
4059 * inode too. */
4060 expand_env(b0.b0_fname, NameBuff, MAXPATHL);
4061 if (fnamecmp_ino(buf->b_ffname, NameBuff,
4062 char_to_long(b0.b0_ino)))
4063#endif
4064 differ = TRUE;
4065 }
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004066 }
4067 else
4068 {
4069 /*
4070 * The name in the swap file may be
4071 * "~user/path/file". Expand it first.
4072 */
4073 expand_env(b0.b0_fname, NameBuff, MAXPATHL);
Bram Moolenaar071d4272004-06-13 20:20:40 +00004074#ifdef CHECK_INODE
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004075 if (fnamecmp_ino(buf->b_ffname, NameBuff,
Bram Moolenaar900b4d72005-12-12 22:05:50 +00004076 char_to_long(b0.b0_ino)))
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004077 differ = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004078#else
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004079 if (fnamecmp(NameBuff, buf->b_ffname) != 0)
4080 differ = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004081#endif
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004082 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00004083 }
4084 close(fd);
4085 }
4086#ifdef RISCOS
4087 else
4088 /* Can't open swap file, though it does exist.
4089 * Assume that the user is editing two files with
4090 * the same name in different directories. No error.
4091 */
4092 differ = TRUE;
4093#endif
4094
4095 /* give the ATTENTION message when there is an old swap file
4096 * for the current file, and the buffer was not recovered. */
4097 if (differ == FALSE && !(curbuf->b_flags & BF_RECOVERED)
4098 && vim_strchr(p_shm, SHM_ATTENTION) == NULL)
4099 {
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004100#if defined(HAS_SWAP_EXISTS_ACTION)
4101 int choice = 0;
4102#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004103#ifdef CREATE_DUMMY_FILE
4104 int did_use_dummy = FALSE;
4105
4106 /* Avoid getting a warning for the file being created
4107 * outside of Vim, it was created at the start of this
4108 * function. Delete the file now, because Vim might exit
4109 * here if the window is closed. */
4110 if (dummyfd != NULL)
4111 {
4112 fclose(dummyfd);
4113 dummyfd = NULL;
4114 mch_remove(buf->b_fname);
4115 did_use_dummy = TRUE;
4116 }
4117#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004118
4119#if (defined(UNIX) || defined(__EMX__) || defined(VMS)) && (defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG))
4120 process_still_running = FALSE;
4121#endif
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004122#ifdef FEAT_AUTOCMD
4123 /*
4124 * If there is an SwapExists autocommand and we can handle
4125 * the response, trigger it. It may return 0 to ask the
4126 * user anyway.
4127 */
4128 if (swap_exists_action != SEA_NONE
4129 && has_autocmd(EVENT_SWAPEXISTS, buf->b_fname, buf))
4130 choice = do_swapexists(buf, fname);
Bram Moolenaar071d4272004-06-13 20:20:40 +00004131
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004132 if (choice == 0)
4133#endif
4134 {
4135#ifdef FEAT_GUI
4136 /* If we are supposed to start the GUI but it wasn't
4137 * completely started yet, start it now. This makes
4138 * the messages displayed in the Vim window when
4139 * loading a session from the .gvimrc file. */
4140 if (gui.starting && !gui.in_use)
4141 gui_start();
4142#endif
4143 /* Show info about the existing swap file. */
4144 attention_message(buf, fname);
4145
4146 /* We don't want a 'q' typed at the more-prompt
4147 * interrupt loading a file. */
4148 got_int = FALSE;
4149 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00004150
4151#if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004152 if (swap_exists_action != SEA_NONE && choice == 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004153 {
4154 char_u *name;
4155
4156 name = alloc((unsigned)(STRLEN(fname)
4157 + STRLEN(_("Swap file \""))
4158 + STRLEN(_("\" already exists!")) + 5));
4159 if (name != NULL)
4160 {
4161 STRCPY(name, _("Swap file \""));
4162 home_replace(NULL, fname, name + STRLEN(name),
4163 1000, TRUE);
4164 STRCAT(name, _("\" already exists!"));
4165 }
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004166 choice = do_dialog(VIM_WARNING,
Bram Moolenaar071d4272004-06-13 20:20:40 +00004167 (char_u *)_("VIM - ATTENTION"),
4168 name == NULL
4169 ? (char_u *)_("Swap file already exists!")
4170 : name,
4171# if defined(UNIX) || defined(__EMX__) || defined(VMS)
4172 process_still_running
4173 ? (char_u *)_("&Open Read-Only\n&Edit anyway\n&Recover\n&Quit\n&Abort") :
4174# endif
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004175 (char_u *)_("&Open Read-Only\n&Edit anyway\n&Recover\n&Delete it\n&Quit\n&Abort"), 1, NULL);
4176
4177# if defined(UNIX) || defined(__EMX__) || defined(VMS)
4178 if (process_still_running && choice >= 4)
4179 choice++; /* Skip missing "Delete it" button */
4180# endif
4181 vim_free(name);
4182
4183 /* pretend screen didn't scroll, need redraw anyway */
4184 msg_scrolled = 0;
4185 redraw_all_later(NOT_VALID);
4186 }
4187#endif
4188
4189#if defined(HAS_SWAP_EXISTS_ACTION)
4190 if (choice > 0)
4191 {
4192 switch (choice)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004193 {
4194 case 1:
4195 buf->b_p_ro = TRUE;
4196 break;
4197 case 2:
4198 break;
4199 case 3:
4200 swap_exists_action = SEA_RECOVER;
4201 break;
4202 case 4:
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004203 mch_remove(fname);
Bram Moolenaar071d4272004-06-13 20:20:40 +00004204 break;
4205 case 5:
4206 swap_exists_action = SEA_QUIT;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004207 break;
4208 case 6:
Bram Moolenaard5bc83f2005-12-07 21:07:59 +00004209 swap_exists_action = SEA_QUIT;
4210 got_int = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004211 break;
4212 }
Bram Moolenaar071d4272004-06-13 20:20:40 +00004213
4214 /* If the file was deleted this fname can be used. */
4215 if (mch_getperm(fname) < 0)
4216 break;
4217 }
4218 else
4219#endif
4220 {
4221 MSG_PUTS("\n");
Bram Moolenaar4770d092006-01-12 23:22:24 +00004222 if (msg_silent == 0)
4223 /* call wait_return() later */
4224 need_wait_return = TRUE;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004225 }
4226
4227#ifdef CREATE_DUMMY_FILE
4228 /* Going to try another name, need the dummy file again. */
4229 if (did_use_dummy)
4230 dummyfd = mch_fopen((char *)buf->b_fname, "w");
4231#endif
4232 }
4233 }
4234 }
4235
4236 /*
4237 * Change the ".swp" extension to find another file that can be used.
4238 * First decrement the last char: ".swo", ".swn", etc.
4239 * If that still isn't enough decrement the last but one char: ".svz"
Bram Moolenaar69a7cb42004-06-20 12:51:53 +00004240 * Can happen when editing many "No Name" buffers.
Bram Moolenaar071d4272004-06-13 20:20:40 +00004241 */
4242 if (fname[n - 1] == 'a') /* ".s?a" */
4243 {
4244 if (fname[n - 2] == 'a') /* ".saa": tried enough, give up */
4245 {
4246 EMSG(_("E326: Too many swap files found"));
4247 vim_free(fname);
4248 fname = NULL;
4249 break;
4250 }
4251 --fname[n - 2]; /* ".svz", ".suz", etc. */
4252 fname[n - 1] = 'z' + 1;
4253 }
4254 --fname[n - 1]; /* ".swo", ".swn", etc. */
4255 }
4256
4257 vim_free(dir_name);
4258#ifdef CREATE_DUMMY_FILE
4259 if (dummyfd != NULL) /* file has been created temporarily */
4260 {
4261 fclose(dummyfd);
4262 mch_remove(buf->b_fname);
4263 }
4264#endif
4265 return fname;
4266}
4267
4268 static int
4269b0_magic_wrong(b0p)
4270 ZERO_BL *b0p;
4271{
4272 return (b0p->b0_magic_long != (long)B0_MAGIC_LONG
4273 || b0p->b0_magic_int != (int)B0_MAGIC_INT
4274 || b0p->b0_magic_short != (short)B0_MAGIC_SHORT
4275 || b0p->b0_magic_char != B0_MAGIC_CHAR);
4276}
4277
4278#ifdef CHECK_INODE
4279/*
4280 * Compare current file name with file name from swap file.
4281 * Try to use inode numbers when possible.
4282 * Return non-zero when files are different.
4283 *
4284 * When comparing file names a few things have to be taken into consideration:
4285 * - When working over a network the full path of a file depends on the host.
4286 * We check the inode number if possible. It is not 100% reliable though,
4287 * because the device number cannot be used over a network.
4288 * - When a file does not exist yet (editing a new file) there is no inode
4289 * number.
4290 * - The file name in a swap file may not be valid on the current host. The
4291 * "~user" form is used whenever possible to avoid this.
4292 *
4293 * This is getting complicated, let's make a table:
4294 *
4295 * ino_c ino_s fname_c fname_s differ =
4296 *
4297 * both files exist -> compare inode numbers:
4298 * != 0 != 0 X X ino_c != ino_s
4299 *
4300 * inode number(s) unknown, file names available -> compare file names
4301 * == 0 X OK OK fname_c != fname_s
4302 * X == 0 OK OK fname_c != fname_s
4303 *
4304 * current file doesn't exist, file for swap file exist, file name(s) not
4305 * available -> probably different
4306 * == 0 != 0 FAIL X TRUE
4307 * == 0 != 0 X FAIL TRUE
4308 *
4309 * current file exists, inode for swap unknown, file name(s) not
4310 * available -> probably different
4311 * != 0 == 0 FAIL X TRUE
4312 * != 0 == 0 X FAIL TRUE
4313 *
4314 * current file doesn't exist, inode for swap unknown, one file name not
4315 * available -> probably different
4316 * == 0 == 0 FAIL OK TRUE
4317 * == 0 == 0 OK FAIL TRUE
4318 *
4319 * current file doesn't exist, inode for swap unknown, both file names not
4320 * available -> probably same file
4321 * == 0 == 0 FAIL FAIL FALSE
4322 *
4323 * Note that when the ino_t is 64 bits, only the last 32 will be used. This
4324 * can't be changed without making the block 0 incompatible with 32 bit
4325 * versions.
4326 */
4327
4328 static int
4329fnamecmp_ino(fname_c, fname_s, ino_block0)
4330 char_u *fname_c; /* current file name */
4331 char_u *fname_s; /* file name from swap file */
4332 long ino_block0;
4333{
4334 struct stat st;
4335 ino_t ino_c = 0; /* ino of current file */
4336 ino_t ino_s; /* ino of file from swap file */
4337 char_u buf_c[MAXPATHL]; /* full path of fname_c */
4338 char_u buf_s[MAXPATHL]; /* full path of fname_s */
4339 int retval_c; /* flag: buf_c valid */
4340 int retval_s; /* flag: buf_s valid */
4341
4342 if (mch_stat((char *)fname_c, &st) == 0)
4343 ino_c = (ino_t)st.st_ino;
4344
4345 /*
4346 * First we try to get the inode from the file name, because the inode in
4347 * the swap file may be outdated. If that fails (e.g. this path is not
4348 * valid on this machine), use the inode from block 0.
4349 */
4350 if (mch_stat((char *)fname_s, &st) == 0)
4351 ino_s = (ino_t)st.st_ino;
4352 else
4353 ino_s = (ino_t)ino_block0;
4354
4355 if (ino_c && ino_s)
4356 return (ino_c != ino_s);
4357
4358 /*
4359 * One of the inode numbers is unknown, try a forced vim_FullName() and
4360 * compare the file names.
4361 */
4362 retval_c = vim_FullName(fname_c, buf_c, MAXPATHL, TRUE);
4363 retval_s = vim_FullName(fname_s, buf_s, MAXPATHL, TRUE);
4364 if (retval_c == OK && retval_s == OK)
4365 return (STRCMP(buf_c, buf_s) != 0);
4366
4367 /*
4368 * Can't compare inodes or file names, guess that the files are different,
4369 * unless both appear not to exist at all.
4370 */
4371 if (ino_s == 0 && ino_c == 0 && retval_c == FAIL && retval_s == FAIL)
4372 return FALSE;
4373 return TRUE;
4374}
4375#endif /* CHECK_INODE */
4376
4377/*
4378 * Move a long integer into a four byte character array.
4379 * Used for machine independency in block zero.
4380 */
4381 static void
4382long_to_char(n, s)
4383 long n;
4384 char_u *s;
4385{
4386 s[0] = (char_u)(n & 0xff);
4387 n = (unsigned)n >> 8;
4388 s[1] = (char_u)(n & 0xff);
4389 n = (unsigned)n >> 8;
4390 s[2] = (char_u)(n & 0xff);
4391 n = (unsigned)n >> 8;
4392 s[3] = (char_u)(n & 0xff);
4393}
4394
4395 static long
4396char_to_long(s)
4397 char_u *s;
4398{
4399 long retval;
4400
4401 retval = s[3];
4402 retval <<= 8;
4403 retval |= s[2];
4404 retval <<= 8;
4405 retval |= s[1];
4406 retval <<= 8;
4407 retval |= s[0];
4408
4409 return retval;
4410}
4411
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004412/*
4413 * Set the flags in the first block of the swap file:
4414 * - file is modified or not: buf->b_changed
4415 * - 'fileformat'
4416 * - 'fileencoding'
4417 */
Bram Moolenaar071d4272004-06-13 20:20:40 +00004418 void
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004419ml_setflags(buf)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004420 buf_T *buf;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004421{
4422 bhdr_T *hp;
4423 ZERO_BL *b0p;
4424
4425 if (!buf->b_ml.ml_mfp)
4426 return;
4427 for (hp = buf->b_ml.ml_mfp->mf_used_last; hp != NULL; hp = hp->bh_prev)
4428 {
4429 if (hp->bh_bnum == 0)
4430 {
4431 b0p = (ZERO_BL *)(hp->bh_data);
Bram Moolenaar1cd871b2004-12-19 22:46:22 +00004432 b0p->b0_dirty = buf->b_changed ? B0_DIRTY : 0;
4433 b0p->b0_flags = (b0p->b0_flags & ~B0_FF_MASK)
4434 | (get_fileformat(buf) + 1);
4435#ifdef FEAT_MBYTE
4436 add_b0_fenc(b0p, buf);
4437#endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004438 hp->bh_flags |= BH_DIRTY;
4439 mf_sync(buf->b_ml.ml_mfp, MFS_ZERO);
4440 break;
4441 }
4442 }
4443}
4444
4445#if defined(FEAT_BYTEOFF) || defined(PROTO)
4446
4447#define MLCS_MAXL 800 /* max no of lines in chunk */
4448#define MLCS_MINL 400 /* should be half of MLCS_MAXL */
4449
4450/*
4451 * Keep information for finding byte offset of a line, updtytpe may be one of:
4452 * ML_CHNK_ADDLINE: Add len to parent chunk, possibly splitting it
4453 * Careful: ML_CHNK_ADDLINE may cause ml_find_line() to be called.
4454 * ML_CHNK_DELLINE: Subtract len from parent chunk, possibly deleting it
4455 * ML_CHNK_UPDLINE: Add len to parent chunk, as a signed entity.
4456 */
4457 static void
4458ml_updatechunk(buf, line, len, updtype)
4459 buf_T *buf;
4460 linenr_T line;
4461 long len;
4462 int updtype;
4463{
4464 static buf_T *ml_upd_lastbuf = NULL;
4465 static linenr_T ml_upd_lastline;
4466 static linenr_T ml_upd_lastcurline;
4467 static int ml_upd_lastcurix;
4468
4469 linenr_T curline = ml_upd_lastcurline;
4470 int curix = ml_upd_lastcurix;
4471 long size;
4472 chunksize_T *curchnk;
4473 int rest;
4474 bhdr_T *hp;
4475 DATA_BL *dp;
4476
4477 if (buf->b_ml.ml_usedchunks == -1 || len == 0)
4478 return;
4479 if (buf->b_ml.ml_chunksize == NULL)
4480 {
4481 buf->b_ml.ml_chunksize = (chunksize_T *)
4482 alloc((unsigned)sizeof(chunksize_T) * 100);
4483 if (buf->b_ml.ml_chunksize == NULL)
4484 {
4485 buf->b_ml.ml_usedchunks = -1;
4486 return;
4487 }
4488 buf->b_ml.ml_numchunks = 100;
4489 buf->b_ml.ml_usedchunks = 1;
4490 buf->b_ml.ml_chunksize[0].mlcs_numlines = 1;
4491 buf->b_ml.ml_chunksize[0].mlcs_totalsize = 1;
4492 }
4493
4494 if (updtype == ML_CHNK_UPDLINE && buf->b_ml.ml_line_count == 1)
4495 {
4496 /*
4497 * First line in empty buffer from ml_flush_line() -- reset
4498 */
4499 buf->b_ml.ml_usedchunks = 1;
4500 buf->b_ml.ml_chunksize[0].mlcs_numlines = 1;
4501 buf->b_ml.ml_chunksize[0].mlcs_totalsize =
4502 (long)STRLEN(buf->b_ml.ml_line_ptr) + 1;
4503 return;
4504 }
4505
4506 /*
4507 * Find chunk that our line belongs to, curline will be at start of the
4508 * chunk.
4509 */
4510 if (buf != ml_upd_lastbuf || line != ml_upd_lastline + 1
4511 || updtype != ML_CHNK_ADDLINE)
4512 {
4513 for (curline = 1, curix = 0;
4514 curix < buf->b_ml.ml_usedchunks - 1
4515 && line >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4516 curix++)
4517 {
4518 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4519 }
4520 }
4521 else if (line >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines
4522 && curix < buf->b_ml.ml_usedchunks - 1)
4523 {
4524 /* Adjust cached curix & curline */
4525 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4526 curix++;
4527 }
4528 curchnk = buf->b_ml.ml_chunksize + curix;
4529
4530 if (updtype == ML_CHNK_DELLINE)
Bram Moolenaar5a6404c2006-11-01 17:12:57 +00004531 len = -len;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004532 curchnk->mlcs_totalsize += len;
4533 if (updtype == ML_CHNK_ADDLINE)
4534 {
4535 curchnk->mlcs_numlines++;
4536
4537 /* May resize here so we don't have to do it in both cases below */
4538 if (buf->b_ml.ml_usedchunks + 1 >= buf->b_ml.ml_numchunks)
4539 {
4540 buf->b_ml.ml_numchunks = buf->b_ml.ml_numchunks * 3 / 2;
4541 buf->b_ml.ml_chunksize = (chunksize_T *)
4542 vim_realloc(buf->b_ml.ml_chunksize,
4543 sizeof(chunksize_T) * buf->b_ml.ml_numchunks);
4544 if (buf->b_ml.ml_chunksize == NULL)
4545 {
4546 /* Hmmmm, Give up on offset for this buffer */
4547 buf->b_ml.ml_usedchunks = -1;
4548 return;
4549 }
4550 }
4551
4552 if (buf->b_ml.ml_chunksize[curix].mlcs_numlines >= MLCS_MAXL)
4553 {
4554 int count; /* number of entries in block */
4555 int idx;
4556 int text_end;
4557 int linecnt;
4558
4559 mch_memmove(buf->b_ml.ml_chunksize + curix + 1,
4560 buf->b_ml.ml_chunksize + curix,
4561 (buf->b_ml.ml_usedchunks - curix) *
4562 sizeof(chunksize_T));
4563 /* Compute length of first half of lines in the splitted chunk */
4564 size = 0;
4565 linecnt = 0;
4566 while (curline < buf->b_ml.ml_line_count
4567 && linecnt < MLCS_MINL)
4568 {
4569 if ((hp = ml_find_line(buf, curline, ML_FIND)) == NULL)
4570 {
4571 buf->b_ml.ml_usedchunks = -1;
4572 return;
4573 }
4574 dp = (DATA_BL *)(hp->bh_data);
4575 count = (long)(buf->b_ml.ml_locked_high) -
4576 (long)(buf->b_ml.ml_locked_low) + 1;
4577 idx = curline - buf->b_ml.ml_locked_low;
4578 curline = buf->b_ml.ml_locked_high + 1;
4579 if (idx == 0)/* first line in block, text at the end */
4580 text_end = dp->db_txt_end;
4581 else
4582 text_end = ((dp->db_index[idx - 1]) & DB_INDEX_MASK);
4583 /* Compute index of last line to use in this MEMLINE */
4584 rest = count - idx;
4585 if (linecnt + rest > MLCS_MINL)
4586 {
4587 idx += MLCS_MINL - linecnt - 1;
4588 linecnt = MLCS_MINL;
4589 }
4590 else
4591 {
4592 idx = count - 1;
4593 linecnt += rest;
4594 }
4595 size += text_end - ((dp->db_index[idx]) & DB_INDEX_MASK);
4596 }
4597 buf->b_ml.ml_chunksize[curix].mlcs_numlines = linecnt;
4598 buf->b_ml.ml_chunksize[curix + 1].mlcs_numlines -= linecnt;
4599 buf->b_ml.ml_chunksize[curix].mlcs_totalsize = size;
4600 buf->b_ml.ml_chunksize[curix + 1].mlcs_totalsize -= size;
4601 buf->b_ml.ml_usedchunks++;
4602 ml_upd_lastbuf = NULL; /* Force recalc of curix & curline */
4603 return;
4604 }
4605 else if (buf->b_ml.ml_chunksize[curix].mlcs_numlines >= MLCS_MINL
4606 && curix == buf->b_ml.ml_usedchunks - 1
4607 && buf->b_ml.ml_line_count - line <= 1)
4608 {
4609 /*
4610 * We are in the last chunk and it is cheap to crate a new one
4611 * after this. Do it now to avoid the loop above later on
4612 */
4613 curchnk = buf->b_ml.ml_chunksize + curix + 1;
4614 buf->b_ml.ml_usedchunks++;
4615 if (line == buf->b_ml.ml_line_count)
4616 {
4617 curchnk->mlcs_numlines = 0;
4618 curchnk->mlcs_totalsize = 0;
4619 }
4620 else
4621 {
4622 /*
4623 * Line is just prior to last, move count for last
4624 * This is the common case when loading a new file
4625 */
4626 hp = ml_find_line(buf, buf->b_ml.ml_line_count, ML_FIND);
4627 if (hp == NULL)
4628 {
4629 buf->b_ml.ml_usedchunks = -1;
4630 return;
4631 }
4632 dp = (DATA_BL *)(hp->bh_data);
4633 if (dp->db_line_count == 1)
4634 rest = dp->db_txt_end - dp->db_txt_start;
4635 else
4636 rest =
4637 ((dp->db_index[dp->db_line_count - 2]) & DB_INDEX_MASK)
4638 - dp->db_txt_start;
4639 curchnk->mlcs_totalsize = rest;
4640 curchnk->mlcs_numlines = 1;
4641 curchnk[-1].mlcs_totalsize -= rest;
4642 curchnk[-1].mlcs_numlines -= 1;
4643 }
4644 }
4645 }
4646 else if (updtype == ML_CHNK_DELLINE)
4647 {
4648 curchnk->mlcs_numlines--;
4649 ml_upd_lastbuf = NULL; /* Force recalc of curix & curline */
4650 if (curix < (buf->b_ml.ml_usedchunks - 1)
4651 && (curchnk->mlcs_numlines + curchnk[1].mlcs_numlines)
4652 <= MLCS_MINL)
4653 {
4654 curix++;
4655 curchnk = buf->b_ml.ml_chunksize + curix;
4656 }
4657 else if (curix == 0 && curchnk->mlcs_numlines <= 0)
4658 {
4659 buf->b_ml.ml_usedchunks--;
4660 mch_memmove(buf->b_ml.ml_chunksize, buf->b_ml.ml_chunksize + 1,
4661 buf->b_ml.ml_usedchunks * sizeof(chunksize_T));
4662 return;
4663 }
4664 else if (curix == 0 || (curchnk->mlcs_numlines > 10
4665 && (curchnk->mlcs_numlines + curchnk[-1].mlcs_numlines)
4666 > MLCS_MINL))
4667 {
4668 return;
4669 }
4670
4671 /* Collapse chunks */
4672 curchnk[-1].mlcs_numlines += curchnk->mlcs_numlines;
4673 curchnk[-1].mlcs_totalsize += curchnk->mlcs_totalsize;
4674 buf->b_ml.ml_usedchunks--;
4675 if (curix < buf->b_ml.ml_usedchunks)
4676 {
4677 mch_memmove(buf->b_ml.ml_chunksize + curix,
4678 buf->b_ml.ml_chunksize + curix + 1,
4679 (buf->b_ml.ml_usedchunks - curix) *
4680 sizeof(chunksize_T));
4681 }
4682 return;
4683 }
4684 ml_upd_lastbuf = buf;
4685 ml_upd_lastline = line;
4686 ml_upd_lastcurline = curline;
4687 ml_upd_lastcurix = curix;
4688}
4689
4690/*
4691 * Find offset for line or line with offset.
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004692 * Find line with offset if "lnum" is 0; return remaining offset in offp
4693 * Find offset of line if "lnum" > 0
Bram Moolenaar071d4272004-06-13 20:20:40 +00004694 * return -1 if information is not available
4695 */
4696 long
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004697ml_find_line_or_offset(buf, lnum, offp)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004698 buf_T *buf;
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004699 linenr_T lnum;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004700 long *offp;
4701{
4702 linenr_T curline;
4703 int curix;
4704 long size;
4705 bhdr_T *hp;
4706 DATA_BL *dp;
4707 int count; /* number of entries in block */
4708 int idx;
4709 int start_idx;
4710 int text_end;
4711 long offset;
4712 int len;
4713 int ffdos = (get_fileformat(buf) == EOL_DOS);
4714 int extra = 0;
4715
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004716 /* take care of cached line first */
4717 ml_flush_line(curbuf);
4718
Bram Moolenaar071d4272004-06-13 20:20:40 +00004719 if (buf->b_ml.ml_usedchunks == -1
4720 || buf->b_ml.ml_chunksize == NULL
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004721 || lnum < 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004722 return -1;
4723
4724 if (offp == NULL)
4725 offset = 0;
4726 else
4727 offset = *offp;
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004728 if (lnum == 0 && offset <= 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004729 return 1; /* Not a "find offset" and offset 0 _must_ be in line 1 */
4730 /*
4731 * Find the last chunk before the one containing our line. Last chunk is
4732 * special because it will never qualify
4733 */
4734 curline = 1;
4735 curix = size = 0;
4736 while (curix < buf->b_ml.ml_usedchunks - 1
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004737 && ((lnum != 0
4738 && lnum >= curline + buf->b_ml.ml_chunksize[curix].mlcs_numlines)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004739 || (offset != 0
4740 && offset > size + buf->b_ml.ml_chunksize[curix].mlcs_totalsize
4741 + ffdos * buf->b_ml.ml_chunksize[curix].mlcs_numlines)))
4742 {
4743 curline += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4744 size += buf->b_ml.ml_chunksize[curix].mlcs_totalsize;
4745 if (offset && ffdos)
4746 size += buf->b_ml.ml_chunksize[curix].mlcs_numlines;
4747 curix++;
4748 }
4749
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004750 while ((lnum != 0 && curline < lnum) || (offset != 0 && size < offset))
Bram Moolenaar071d4272004-06-13 20:20:40 +00004751 {
4752 if (curline > buf->b_ml.ml_line_count
4753 || (hp = ml_find_line(buf, curline, ML_FIND)) == NULL)
4754 return -1;
4755 dp = (DATA_BL *)(hp->bh_data);
4756 count = (long)(buf->b_ml.ml_locked_high) -
4757 (long)(buf->b_ml.ml_locked_low) + 1;
4758 start_idx = idx = curline - buf->b_ml.ml_locked_low;
4759 if (idx == 0)/* first line in block, text at the end */
4760 text_end = dp->db_txt_end;
4761 else
4762 text_end = ((dp->db_index[idx - 1]) & DB_INDEX_MASK);
4763 /* Compute index of last line to use in this MEMLINE */
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004764 if (lnum != 0)
Bram Moolenaar071d4272004-06-13 20:20:40 +00004765 {
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004766 if (curline + (count - idx) >= lnum)
4767 idx += lnum - curline - 1;
Bram Moolenaar071d4272004-06-13 20:20:40 +00004768 else
4769 idx = count - 1;
4770 }
4771 else
4772 {
4773 extra = 0;
4774 while (offset >= size
4775 + text_end - (int)((dp->db_index[idx]) & DB_INDEX_MASK)
4776 + ffdos)
4777 {
4778 if (ffdos)
4779 size++;
4780 if (idx == count - 1)
4781 {
4782 extra = 1;
4783 break;
4784 }
4785 idx++;
4786 }
4787 }
4788 len = text_end - ((dp->db_index[idx]) & DB_INDEX_MASK);
4789 size += len;
4790 if (offset != 0 && size >= offset)
4791 {
4792 if (size + ffdos == offset)
4793 *offp = 0;
4794 else if (idx == start_idx)
4795 *offp = offset - size + len;
4796 else
4797 *offp = offset - size + len
4798 - (text_end - ((dp->db_index[idx - 1]) & DB_INDEX_MASK));
4799 curline += idx - start_idx + extra;
4800 if (curline > buf->b_ml.ml_line_count)
4801 return -1; /* exactly one byte beyond the end */
4802 return curline;
4803 }
4804 curline = buf->b_ml.ml_locked_high + 1;
4805 }
4806
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004807 if (lnum != 0)
Bram Moolenaar5eb86f92004-07-26 12:53:41 +00004808 {
4809 /* Count extra CR characters. */
4810 if (ffdos)
Bram Moolenaar5313dcb2005-02-22 08:56:13 +00004811 size += lnum - 1;
Bram Moolenaar5eb86f92004-07-26 12:53:41 +00004812
4813 /* Don't count the last line break if 'bin' and 'noeol'. */
4814 if (buf->b_p_bin && !buf->b_p_eol)
4815 size -= ffdos + 1;
4816 }
4817
Bram Moolenaar071d4272004-06-13 20:20:40 +00004818 return size;
4819}
4820
4821/*
4822 * Goto byte in buffer with offset 'cnt'.
4823 */
4824 void
4825goto_byte(cnt)
4826 long cnt;
4827{
4828 long boff = cnt;
4829 linenr_T lnum;
4830
4831 ml_flush_line(curbuf); /* cached line may be dirty */
4832 setpcmark();
4833 if (boff)
4834 --boff;
4835 lnum = ml_find_line_or_offset(curbuf, (linenr_T)0, &boff);
4836 if (lnum < 1) /* past the end */
4837 {
4838 curwin->w_cursor.lnum = curbuf->b_ml.ml_line_count;
4839 curwin->w_curswant = MAXCOL;
4840 coladvance((colnr_T)MAXCOL);
4841 }
4842 else
4843 {
4844 curwin->w_cursor.lnum = lnum;
4845 curwin->w_cursor.col = (colnr_T)boff;
Bram Moolenaar943d2b52005-12-02 00:50:49 +00004846# ifdef FEAT_VIRTUALEDIT
4847 curwin->w_cursor.coladd = 0;
4848# endif
Bram Moolenaar071d4272004-06-13 20:20:40 +00004849 curwin->w_set_curswant = TRUE;
4850 }
4851 check_cursor();
4852
4853# ifdef FEAT_MBYTE
4854 /* Make sure the cursor is on the first byte of a multi-byte char. */
4855 if (has_mbyte)
4856 mb_adjust_cursor();
4857# endif
4858}
4859#endif