-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathbuffer_pos.c
569 lines (468 loc) · 13.8 KB
/
buffer_pos.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
/*
* Copyright (C) 2015 Richard Burke
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <assert.h>
#include "buffer_pos.h"
#include "util.h"
#include "status.h"
#define CORRECT_LINE_NO(lineno, maxlineno) \
((lineno) == 0 ? 1 : MIN((lineno), (maxlineno)))
#define CORRECT_COL_NO(colno) ((colno) == 0 ? 1 : (colno))
typedef enum {
NP_BUFFER_START,
NP_KNOWN_POS,
NP_BUFFER_END,
NP_ENTRY_NUM
} NearestPos;
static int bp_is_char_before(const BufferPos *, size_t offset, char ch);
static void calc_new_col(BufferPos *, size_t new_offset);
static NearestPos bp_determine_nearest_pos(size_t pos, size_t start,
size_t known, size_t end);
int bp_init(BufferPos *pos, const GapBuffer *data,
const FileFormat *file_format,
const HashMap *config)
{
assert(pos != NULL);
assert(data != NULL);
assert(file_format != NULL);
assert(config != NULL);
pos->offset = 0;
pos->line_no = 1;
pos->col_no = 1;
pos->data = data;
pos->file_format = file_format;
pos->config = config;
return 1;
}
Mark *bp_new_mark(BufferPos *pos, MarkProperties prop)
{
Mark *mark = malloc(sizeof(Mark));
RETURN_IF_NULL(mark);
memset(mark, 0, sizeof(Mark));
mark->pos = pos;
mark->prop = prop;
return mark;
}
void bp_free_mark(Mark *mark)
{
if (mark != NULL) {
free(mark);
}
}
char bp_get_char(const BufferPos *pos)
{
return gb_get_at(pos->data, pos->offset);
}
unsigned char bp_get_uchar(const BufferPos *pos)
{
return gb_getu_at(pos->data, pos->offset);
}
static int bp_is_char_before(const BufferPos *pos, size_t offset, char ch)
{
return pos->offset >= offset &&
gb_get_at(pos->data, pos->offset - offset) == ch;
}
int bp_compare(const BufferPos *pos1, const BufferPos *pos2)
{
if (pos1->line_no == pos2->line_no) {
return (pos1->col_no < pos2->col_no ? -1 : pos1->col_no > pos2->col_no);
}
return (pos1->line_no < pos2->line_no ? -1 : pos1->line_no > pos2->line_no);
}
BufferPos bp_min(const BufferPos *pos1, const BufferPos *pos2)
{
if (bp_compare(pos1, pos2) == -1) {
return *pos1;
}
return *pos2;
}
BufferPos bp_max(const BufferPos *pos1, const BufferPos *pos2)
{
if (bp_compare(pos1, pos2) == 1) {
return *pos1;
}
return *pos2;
}
int bp_at_line_start(const BufferPos *pos)
{
if (pos->offset == 0) {
return 1;
}
return gb_get_at(pos->data, pos->offset - 1) == '\n';
}
int bp_at_line_end(const BufferPos *pos)
{
size_t buffer_len = gb_length(pos->data);
if (pos->offset == buffer_len) {
return 1;
}
if (*pos->file_format == FF_WINDOWS &&
bp_get_char(pos) == '\r' &&
pos->offset + 1 < buffer_len &&
gb_get_at(pos->data, pos->offset + 1) == '\n') {
return 1;
}
return bp_get_char(pos) == '\n';
}
int bp_on_empty_line(const BufferPos *pos)
{
return bp_at_line_start(pos) && bp_at_line_end(pos);
}
int bp_on_whitespace_line(const BufferPos *pos)
{
BufferPos tmp = *pos;
bp_to_line_start(&tmp);
while (!bp_at_line_end(&tmp)) {
if (!isspace(bp_get_char(&tmp))) {
return 0;
}
bp_next_char(&tmp);
}
return 1;
}
int bp_at_first_line(const BufferPos *pos)
{
return pos->line_no == 1;
}
int bp_at_last_line(const BufferPos *pos)
{
return pos->line_no == gb_lines(pos->data) + 1;
}
int bp_at_buffer_start(const BufferPos *pos)
{
return bp_at_first_line(pos) && bp_at_line_start(pos);
}
int bp_at_buffer_end(const BufferPos *pos)
{
return bp_at_last_line(pos) && bp_at_line_end(pos);
}
int bp_at_buffer_extreme(const BufferPos *pos)
{
return bp_at_buffer_start(pos) || bp_at_buffer_end(pos);
}
void bp_next_char(BufferPos *pos)
{
if (bp_at_buffer_end(pos)) {
return;
}
if (bp_at_line_end(pos)) {
if (*pos->file_format == FF_WINDOWS &&
bp_get_char(pos) == '\r') {
pos->offset++;
}
pos->offset++;
pos->line_no++;
pos->col_no = 1;
} else {
CharInfo char_info;
en_utf8_char_info(&char_info, CIP_SCREEN_LENGTH,
pos, pos->config);
pos->offset += char_info.byte_length;
pos->col_no += char_info.screen_length;
}
}
void bp_prev_char(BufferPos *pos)
{
if (bp_at_buffer_start(pos)) {
return;
}
if (bp_at_line_start(pos)) {
pos->offset--;
pos->line_no--;
if (*pos->file_format == FF_WINDOWS &&
bp_is_char_before(pos, 1, '\r')) {
pos->offset--;
}
bp_recalc_col(pos);
} else {
size_t prev_offset = en_utf8_previous_char_offset(pos);
pos->offset -= prev_offset;
if (bp_get_char(pos) == '\t') {
bp_recalc_col(pos);
} else {
CharInfo char_info;
en_utf8_char_info(&char_info, CIP_SCREEN_LENGTH,
pos, pos->config);
if (char_info.byte_length == prev_offset) {
pos->col_no -= char_info.screen_length;
} else {
/* Invalid UTF-8 byte sequence encountered.
* Ensure we don't skip back too far */
size_t remaining_bytes = prev_offset - char_info.byte_length;
while (remaining_bytes > 0) {
pos->offset += char_info.byte_length;
en_utf8_char_info(&char_info, CIP_SCREEN_LENGTH,
pos, pos->config);
remaining_bytes -= char_info.byte_length;
}
pos->col_no -= char_info.screen_length;
}
}
}
}
void bp_to_line_start(BufferPos *pos)
{
if (bp_at_line_start(pos)) {
pos->col_no = 1;
return;
}
if (gb_find_prev(pos->data, pos->offset, &pos->offset, '\n')) {
pos->offset++;
} else {
pos->offset = 0;
}
pos->col_no = 1;
}
void bp_to_line_end(BufferPos *pos)
{
if (bp_at_line_end(pos)) {
return;
}
size_t line_end_offset;
if (gb_find_next(pos->data, pos->offset, &line_end_offset, '\n')) {
if (*pos->file_format == FF_WINDOWS &&
line_end_offset > 0 &&
gb_get_at(pos->data, line_end_offset - 1) == '\r') {
line_end_offset--;
}
} else {
line_end_offset = gb_length(pos->data);
}
calc_new_col(pos, line_end_offset);
}
void bp_recalc_col(BufferPos *pos)
{
BufferPos tmp = *pos;
bp_to_line_start(&tmp);
calc_new_col(&tmp, pos->offset);
*pos = tmp;
}
static void calc_new_col(BufferPos *pos, size_t new_offset)
{
CharInfo char_info;
while (pos->offset < new_offset) {
en_utf8_char_info(&char_info, CIP_SCREEN_LENGTH,
pos, pos->config);
pos->col_no += char_info.screen_length;
pos->offset += char_info.byte_length;
}
}
int bp_next_line(BufferPos *pos)
{
if (gb_find_next(pos->data, pos->offset, &pos->offset, '\n')) {
pos->offset++;
pos->line_no++;
pos->col_no = 1;
return 1;
}
return 0;
}
int bp_prev_line(BufferPos *pos)
{
size_t offset;
if (gb_find_prev(pos->data, pos->offset, &offset, '\n')) {
if (pos->line_no == 2) {
bp_to_buffer_start(pos);
return 1;
} else if (offset > 0 &&
gb_find_prev(pos->data, offset, &offset, '\n')) {
pos->offset = offset + 1;
pos->line_no--;
pos->col_no = 1;
return 1;
}
}
return 0;
}
void bp_to_buffer_start(BufferPos *pos)
{
pos->offset = 0;
pos->line_no = 1;
pos->col_no = 1;
}
void bp_to_buffer_end(BufferPos *pos)
{
pos->offset = gb_length(pos->data);
/* gb_lines returns the number of line endings
* i.e. 0 line endings means we're on line 1 */
pos->line_no = gb_lines(pos->data) + 1;
bp_recalc_col(pos);
}
void bp_advance_to_offset(BufferPos *pos, size_t offset)
{
BufferPos tmp = *pos;
offset = MIN(offset, gb_length(pos->data));
while (tmp.offset < offset) {
*pos = tmp;
if (!bp_next_line(&tmp)) {
break;
}
}
if (tmp.offset == offset) {
pos->line_no = tmp.line_no;
}
pos->offset = offset;
bp_recalc_col(pos);
}
void bp_reverse_to_offset(BufferPos *pos, size_t offset)
{
BufferPos tmp = *pos;
bp_to_line_start(&tmp);
while (tmp.offset > offset) {
*pos = tmp;
if (!bp_prev_line(&tmp)) {
break;
}
}
if (tmp.offset <= offset) {
pos->line_no = tmp.line_no;
}
pos->offset = offset;
bp_recalc_col(pos);
}
void bp_advance_to_line(BufferPos *pos, size_t line_no)
{
size_t lines = gb_lines(pos->data) + 1;
line_no = CORRECT_LINE_NO(line_no, lines);
while (pos->line_no < line_no) {
if (!bp_next_line(pos)) {
break;
}
}
}
void bp_reverse_to_line(BufferPos *pos, size_t line_no, int end_of_line)
{
const size_t lines = gb_lines(pos->data) + 1;
line_no = CORRECT_LINE_NO(line_no, lines);
/* end_of_line reverses to the end of the line we want
* instead of the start */
const size_t limit_line = end_of_line ? line_no + 1 : line_no;
while (pos->line_no > limit_line) {
if (!bp_prev_line(pos)) {
break;
}
}
if (end_of_line) {
if (pos->line_no > line_no) {
bp_to_line_start(pos);
bp_prev_char(pos);
}
}
}
void bp_advance_to_col(BufferPos *pos, size_t col_no)
{
col_no = CORRECT_COL_NO(col_no);
while (pos->col_no < col_no && !bp_at_line_end(pos)) {
bp_next_char(pos);
}
}
void bp_reverse_to_col(BufferPos *pos, size_t col_no)
{
col_no = CORRECT_COL_NO(col_no);
while (pos->col_no > col_no && !bp_at_line_start(pos)) {
bp_prev_char(pos);
}
}
void bp_advance_to_line_col(BufferPos *pos, size_t line_no, size_t col_no)
{
size_t lines = gb_lines(pos->data) + 1;
line_no = CORRECT_LINE_NO(line_no, lines);
col_no = CORRECT_COL_NO(col_no);
bp_advance_to_line(pos, line_no);
bp_advance_to_col(pos, col_no);
}
void bp_reverse_to_line_col(BufferPos *pos, size_t line_no, size_t col_no)
{
size_t lines = gb_lines(pos->data) + 1;
line_no = CORRECT_LINE_NO(line_no, lines);
col_no = CORRECT_COL_NO(col_no);
bp_reverse_to_line(pos, line_no, 1);
bp_reverse_to_col(pos, col_no);
}
BufferPos bp_init_from_offset(size_t offset, const BufferPos *known_pos)
{
size_t buffer_len = gb_length(known_pos->data);
offset = MIN(offset, buffer_len);
BufferPos pos = *known_pos;
NearestPos nearest_pos = bp_determine_nearest_pos(offset, 0,
known_pos->offset,
buffer_len);
if (nearest_pos == NP_BUFFER_END) {
bp_to_buffer_end(&pos);
bp_reverse_to_offset(&pos, offset);
} else if (nearest_pos == NP_KNOWN_POS) {
if (known_pos->offset > offset) {
bp_reverse_to_offset(&pos, offset);
} else if (known_pos->offset < offset) {
bp_advance_to_offset(&pos, offset);
}
} else {
bp_to_buffer_start(&pos);
bp_advance_to_offset(&pos, offset);
}
return pos;
}
BufferPos bp_init_from_line_col(size_t line_no, size_t col_no,
const BufferPos *known_pos)
{
size_t lines = gb_lines(known_pos->data) + 1;
line_no = CORRECT_LINE_NO(line_no, lines);
col_no = CORRECT_COL_NO(col_no);
NearestPos nearest_pos = bp_determine_nearest_pos(line_no, 1,
known_pos->line_no,
lines);
BufferPos pos = *known_pos;
if (nearest_pos == NP_BUFFER_END) {
bp_to_buffer_end(&pos);
bp_reverse_to_line_col(&pos, line_no, col_no);
} else if (nearest_pos == NP_KNOWN_POS) {
if (line_no < known_pos->line_no) {
bp_reverse_to_line_col(&pos, line_no, col_no);
} else if (line_no > known_pos->line_no) {
bp_advance_to_line_col(&pos, line_no, col_no);
} else {
if (col_no > known_pos->col_no) {
bp_advance_to_col(&pos, col_no);
} else if (col_no < known_pos->col_no) {
bp_reverse_to_col(&pos, col_no);
}
}
} else {
bp_to_buffer_start(&pos);
bp_advance_to_line_col(&pos, line_no, col_no);
}
return pos;
}
static NearestPos bp_determine_nearest_pos(size_t pos, size_t start,
size_t known, size_t end)
{
size_t pos_diffs[NP_ENTRY_NUM] = {
[NP_BUFFER_START] = ABS_DIFF(pos, start),
[NP_KNOWN_POS] = ABS_DIFF(pos, known),
[NP_BUFFER_END] = ABS_DIFF(pos, end)
};
NearestPos nearest_pos = NP_BUFFER_START;
for (size_t k = 1; k < NP_ENTRY_NUM; k++) {
if (pos_diffs[k] < pos_diffs[nearest_pos]) {
nearest_pos = k;
}
}
return nearest_pos;
}