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