forked from uncrustify/uncrustify
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathchunk_list.cpp
More file actions
703 lines (592 loc) · 13.6 KB
/
chunk_list.cpp
File metadata and controls
703 lines (592 loc) · 13.6 KB
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
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
/**
* @file chunk_list.cpp
* Manages and navigates the list of chunks.
*
* @author Ben Gardner
* @license GPL v2+
*/
#include "chunk_list.h"
#include <cstring>
#include <cstdlib>
#include "ListManager.h"
#include "prototypes.h"
typedef ListManager<chunk_t> ChunkList;
ChunkList g_cl;
chunk_t *chunk_get_head(void)
{
return(g_cl.GetHead());
}
chunk_t *chunk_get_tail(void)
{
return(g_cl.GetTail());
}
chunk_t *chunk_get_next(chunk_t *cur, chunk_nav_t nav)
{
if (cur == NULL)
{
return(NULL);
}
chunk_t *pc = g_cl.GetNext(cur);
if ((pc == NULL) || (nav == CNAV_ALL))
{
return(pc);
}
if (cur->flags & PCF_IN_PREPROC)
{
/* If in a preproc, return NULL if trying to leave */
if ((pc->flags & PCF_IN_PREPROC) == 0)
{
return(NULL);
}
return(pc);
}
/* Not in a preproc, skip any preproc */
while ((pc != NULL) && (pc->flags & PCF_IN_PREPROC))
{
pc = g_cl.GetNext(pc);
}
return(pc);
}
chunk_t *chunk_get_prev(chunk_t *cur, chunk_nav_t nav)
{
if (cur == NULL)
{
return(NULL);
}
chunk_t *pc = g_cl.GetPrev(cur);
if ((pc == NULL) || (nav == CNAV_ALL))
{
return(pc);
}
if (cur->flags & PCF_IN_PREPROC)
{
/* If in a preproc, return NULL if trying to leave */
if ((pc->flags & PCF_IN_PREPROC) == 0)
{
return(NULL);
}
return(pc);
}
/* Not in a preproc, skip any proproc */
while ((pc != NULL) && (pc->flags & PCF_IN_PREPROC))
{
pc = g_cl.GetPrev(pc);
}
return(pc);
}
chunk_t *chunk_dup(const chunk_t *pc_in)
{
chunk_t *pc;
/* Allocate the entry */
pc = new chunk_t;
if (pc == NULL)
{
exit(1);
}
/* Copy all fields and then init the entry */
*pc = *pc_in;
g_cl.InitEntry(pc);
return(pc);
}
/**
* Add to the tail of the list
*/
chunk_t *chunk_add(const chunk_t *pc_in)
{
chunk_t *pc;
if ((pc = chunk_dup(pc_in)) != NULL)
{
g_cl.AddTail(pc);
}
return(pc);
}
/**
* Add a copy after the given chunk.
* If ref is NULL, add at the head.
*/
chunk_t *chunk_add_after(const chunk_t *pc_in, chunk_t *ref)
{
chunk_t *pc;
if ((pc = chunk_dup(pc_in)) != NULL)
{
if (ref != NULL)
{
g_cl.AddAfter(pc, ref);
}
else
{
g_cl.AddHead(pc);
}
}
return(pc);
}
/**
* Add a copy before the given chunk.
* If ref is NULL, add at the head.
*/
chunk_t *chunk_add_before(const chunk_t *pc_in, chunk_t *ref)
{
chunk_t *pc;
if ((pc = chunk_dup(pc_in)) != NULL)
{
if (ref != NULL)
{
g_cl.AddBefore(pc, ref);
}
else
{
g_cl.AddTail(pc);
}
}
return(pc);
}
void chunk_del(chunk_t *pc)
{
g_cl.Pop(pc);
//if ((pc->flags & PCF_OWN_STR) && (pc->str != NULL))
//{
// delete[] (char *)pc->str;
// pc->str = NULL;
//}
delete pc;
}
void chunk_move_after(chunk_t *pc_in, chunk_t *ref)
{
LOG_FUNC_ENTRY();
g_cl.Pop(pc_in);
g_cl.AddAfter(pc_in, ref);
/* HACK: Adjust the original column */
pc_in->column = ref->column + space_col_align(ref, pc_in);
pc_in->orig_col = pc_in->column;
pc_in->orig_col_end = pc_in->orig_col + pc_in->len();
}
/**
* Gets the next NEWLINE chunk
*/
chunk_t *chunk_get_next_nl(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_next(pc, nav);
} while ((pc != NULL) && !chunk_is_newline(pc));
return(pc);
}
/**
* Gets the prev NEWLINE chunk
*/
chunk_t *chunk_get_prev_nl(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_prev(pc, nav);
} while ((pc != NULL) && !chunk_is_newline(pc));
return(pc);
}
/**
* Gets the next non-NEWLINE chunk
*/
chunk_t *chunk_get_next_nnl(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_next(pc, nav);
} while (chunk_is_newline(pc));
return(pc);
}
/**
* Gets the prev non-NEWLINE chunk
*/
chunk_t *chunk_get_prev_nnl(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_prev(pc, nav);
} while ((pc != NULL) && chunk_is_newline(pc));
return(pc);
}
/**
* Gets the next non-NEWLINE and non-comment chunk
*/
chunk_t *chunk_get_next_ncnl(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_next(pc, nav);
} while ((pc != NULL) && (chunk_is_comment(pc) || chunk_is_newline(pc)));
return(pc);
}
/**
* Gets the next non-NEWLINE and non-comment chunk, non-preprocessor chunk
*/
chunk_t *chunk_get_next_ncnlnp(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
if (chunk_is_preproc(cur))
{
do
{
pc = chunk_get_next(pc, nav);
} while ((pc != NULL) && chunk_is_preproc(pc) &&
(chunk_is_comment(pc) || chunk_is_newline(pc)));
}
else
{
do
{
pc = chunk_get_next(pc, nav);
} while ((pc != NULL) && (chunk_is_comment(pc) ||
chunk_is_newline(pc) ||
chunk_is_preproc(pc)));
}
return(pc);
}
/**
* Gets the prev non-NEWLINE and non-comment chunk, non-preprocessor chunk
*/
chunk_t *chunk_get_prev_ncnlnp(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
if (chunk_is_preproc(cur))
{
do
{
pc = chunk_get_prev(pc, nav);
} while ((pc != NULL) && chunk_is_preproc(pc) &&
(chunk_is_comment(pc) || chunk_is_newline(pc)));
}
else
{
do
{
pc = chunk_get_prev(pc, nav);
} while ((pc != NULL) && (chunk_is_comment(pc) ||
chunk_is_newline(pc) ||
chunk_is_preproc(pc)));
}
return(pc);
}
/**
* Gets the next non-blank chunk
*/
chunk_t *chunk_get_next_nblank(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_next(pc, nav);
} while ((pc != NULL) && (chunk_is_comment(pc) ||
chunk_is_newline(pc) ||
chunk_is_blank(pc)));
return(pc);
}
/**
* Gets the prev non-blank chunk
*/
chunk_t *chunk_get_prev_nblank(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_prev(pc, nav);
} while ((pc != NULL) && (chunk_is_comment(pc) || chunk_is_newline(pc) ||
chunk_is_blank(pc)));
return(pc);
}
/**
* Gets the next non-comment chunk
*/
chunk_t *chunk_get_next_nc(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_next(pc, nav);
} while ((pc != NULL) && chunk_is_comment(pc));
return(pc);
}
/**
* Gets the next chunk not in or part of balanced square
* brackets. This handles stacked [] instances to acommodate
* multi-dimensional array declarations
*
* @param cur Starting chunk
* @return NULL or the next chunk not in or part of
* square brackets
*/
chunk_t *chunk_get_next_nisq(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_next(pc, nav);
} while (pc && ((pc->type == CT_SQUARE_OPEN) ||
(pc->type == CT_TSQUARE) ||
(pc->type == CT_SQUARE_CLOSE)));
return(pc);
}
/**
* Gets the prev non-NEWLINE and non-comment chunk
*/
chunk_t *chunk_get_prev_ncnl(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_prev(pc, nav);
} while ((pc != NULL) && (chunk_is_comment(pc) || chunk_is_newline(pc)));
return(pc);
}
/**
* Gets the prev non-comment chunk
*/
chunk_t *chunk_get_prev_nc(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_prev(pc, nav);
} while ((pc != NULL) && chunk_is_comment(pc));
return(pc);
}
/**
* Grabs the next chunk of the given type at the level.
*
* @param cur Starting chunk
* @param type The type to look for
* @param level -1 (any level) or the level to match
* @return NULL or the match
*/
chunk_t *chunk_get_next_type(chunk_t *cur, c_token_t type,
int level, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_next(pc, nav);
if ((pc == NULL) ||
((pc->type == type) && ((pc->level == level) || (level < 0))))
{
break;
}
} while (pc != NULL);
return(pc);
}
chunk_t *chunk_get_next_str(chunk_t *cur, const char *str, int len, int level,
chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_next(pc, nav);
if ((pc == NULL) ||
((pc->len() == len) && (memcmp(str, pc->text(), len) == 0) &&
((pc->level == level) || (level < 0))))
{
break;
}
} while (pc != NULL);
return(pc);
}
/**
* Grabs the prev chunk of the given type at the level.
*
* @param cur Starting chunk
* @param type The type to look for
* @param level -1 (any level) or the level to match
* @return NULL or the match
*/
chunk_t *chunk_get_prev_type(chunk_t *cur, c_token_t type,
int level, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_prev(pc, nav);
if ((pc == NULL) ||
((pc->type == type) && ((pc->level == level) || (level < 0))))
{
break;
}
} while (pc != NULL);
return(pc);
}
chunk_t *chunk_get_prev_str(chunk_t *cur, const char *str, int len, int level,
chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_prev(pc, nav);
if ((pc == NULL) ||
((pc->len() == len) && (memcmp(str, pc->text(), len) == 0) &&
((pc->level == level) || (level < 0))))
{
break;
}
} while (pc != NULL);
return(pc);
}
/**
* Check to see if there is a newline bewteen the two chunks
*/
bool chunk_is_newline_between(chunk_t *start, chunk_t *end)
{
chunk_t *pc;
for (pc = start; pc != end; pc = chunk_get_next(pc))
{
if (chunk_is_newline(pc))
{
return(true);
}
}
return(false);
}
/**
* Swaps the two chunks.
*
* @param pc1 The first chunk
* @param pc2 The second chunk
*/
void chunk_swap(chunk_t *pc1, chunk_t *pc2)
{
g_cl.Swap(pc1, pc2);
}
/**
* Finds the first chunk on the line that pc is on.
* This just backs up until a newline or NULL is hit.
*
* given: [ a - b - c - n1 - d - e - n2 ]
* input: [ a | b | c | n1 ] => a
* input: [ d | e | n2 ] => d
*/
chunk_t *chunk_first_on_line(chunk_t *pc)
{
chunk_t *first = pc;
while (((pc = chunk_get_prev(pc)) != NULL) && !chunk_is_newline(pc))
{
first = pc;
}
return(first);
}
/**
* Swaps two lines that are started with the specified chunks.
*
* @param pc1 The first chunk of line 1
* @param pc2 The first chunk of line 2
*/
void chunk_swap_lines(chunk_t *pc1, chunk_t *pc2)
{
chunk_t *ref2;
chunk_t *tmp;
pc1 = chunk_first_on_line(pc1);
pc2 = chunk_first_on_line(pc2);
if ((pc1 == NULL) || (pc2 == NULL) || (pc1 == pc2))
{
return;
}
/**
* Example start:
* ? - start1 - a1 - b1 - nl1 - ? - ref2 - start2 - a2 - b2 - nl2 - ?
* ^- pc1 ^- pc2
*/
ref2 = chunk_get_prev(pc2);
/* Move the line started at pc2 before pc1 */
while ((pc2 != NULL) && !chunk_is_newline(pc2))
{
tmp = chunk_get_next(pc2);
g_cl.Pop(pc2);
g_cl.AddBefore(pc2, pc1);
pc2 = tmp;
}
/**
* Should now be:
* ? - start2 - a2 - b2 - start1 - a1 - b1 - nl1 - ? - ref2 - nl2 - ?
* ^- pc1 ^- pc2
*/
/* Now move the line started at pc1 after ref2 */
while ((pc1 != NULL) && !chunk_is_newline(pc1))
{
tmp = chunk_get_next(pc1);
g_cl.Pop(pc1);
if (ref2 != NULL)
{
g_cl.AddAfter(pc1, ref2);
}
else
{
g_cl.AddHead(pc1);
}
ref2 = pc1;
pc1 = tmp;
}
/**
* Should now be:
* ? - start2 - a2 - b2 - nl1 - ? - ref2 - start1 - a1 - b1 - nl2 - ?
* ^- pc1 ^- pc2
*/
/* pc1 and pc2 should be the newlines for their lines.
* swap the chunks and the nl_count so that the spacing remains the same.
*/
if ((pc1 != NULL) && (pc2 != NULL))
{
int nl_count = pc1->nl_count;
pc1->nl_count = pc2->nl_count;
pc2->nl_count = nl_count;
chunk_swap(pc1, pc2);
}
}
/**
* Gets the next non-vbrace chunk
*/
chunk_t *chunk_get_next_nvb(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_next(pc, nav);
} while (chunk_is_vbrace(pc));
return(pc);
}
/**
* Gets the prev non-vbrace chunk
*/
chunk_t *chunk_get_prev_nvb(chunk_t *cur, chunk_nav_t nav)
{
chunk_t *pc = cur;
do
{
pc = chunk_get_prev(pc, nav);
} while (chunk_is_vbrace(pc));
return(pc);
}
void set_chunk_type(chunk_t *pc, c_token_t tt)
{
LOG_FUNC_ENTRY();
if (pc && (pc->type != tt))
{
LOG_FMT(LSETTYP, "set_chunk_type: %d:%d '%s' %s:%s => %s:%s",
pc->orig_line, pc->orig_col, pc->text(),
get_token_name(pc->type), get_token_name(pc->parent_type),
get_token_name(tt), get_token_name(pc->parent_type));
log_func_stack_inline(LSETTYP);
pc->type = tt;
}
}
void set_chunk_parent(chunk_t *pc, c_token_t pt)
{
LOG_FUNC_ENTRY();
if (pc && (pc->parent_type != pt))
{
LOG_FMT(LSETPAR, "set_chunk_parent: %d:%d '%s' %s:%s => %s:%s",
pc->orig_line, pc->orig_col, pc->text(),
get_token_name(pc->type), get_token_name(pc->parent_type),
get_token_name(pc->type), get_token_name(pt));
log_func_stack_inline(LSETPAR);
pc->parent_type = pt;
}
}