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