Lines Matching refs:fold_T
37 } fold_T; typedef
48 static int foldFind(garray_T *gap, linenr_T lnum, fold_T **fpp);
54 static void foldOpenNested(fold_T *fpr);
58 static int check_closed(win_T *win, fold_T *fp, int *use_levelp, int level, int *maybe_smallp, line…
59 static void checkSmall(win_T *wp, fold_T *fp, linenr_T lnum_off);
63 static void deleteFoldMarkers(fold_T *fp, int recursive, linenr_T lnum_off);
150 fold_T *fp; in hasFoldingWin()
494 fold_T *fp; in newFoldLevelWin()
503 fp = (fold_T *)wp->w_folds.ga_data; in newFoldLevelWin()
531 fold_T *fp; in checkCloseRec()
535 fp = (fold_T *)gap->ga_data; in checkCloseRec()
580 fold_T *fp; in foldCreate()
646 i = (int)(fp - (fold_T *)gap->ga_data); in foldCreate()
651 fp = (fold_T *)gap->ga_data + i; in foldCreate()
652 ga_init2(&fold_ga, (int)sizeof(fold_T), 10); in foldCreate()
670 mch_memmove(fold_ga.ga_data, fp, sizeof(fold_T) * cont); in foldCreate()
677 ((fold_T *)fold_ga.ga_data)[j].fd_top -= start_rel; in foldCreate()
681 mch_memmove(fp + 1, (fold_T *)gap->ga_data + i, in foldCreate()
682 sizeof(fold_T) * (gap->ga_len - i)); in foldCreate()
718 fold_T *fp; in deleteFold()
720 fold_T *found_fp = NULL; in deleteFold()
769 (int)(found_fp - (fold_T *)found_ga->ga_data), recursive); in deleteFold()
822 fold_T *fp; in foldUpdate()
836 while (fp < (fold_T *)wp->w_folds.ga_data + wp->w_folds.ga_len in foldUpdate()
895 fold_T *fp; in foldMoveTo()
926 if (fp - (fold_T *)gap->ga_data >= gap->ga_len) in foldMoveTo()
932 if (fp == (fold_T *)gap->ga_data) in foldMoveTo()
957 if (fp + 1 - (fold_T *)gap->ga_data < gap->ga_len) in foldMoveTo()
967 if (fp > (fold_T *)gap->ga_data) in foldMoveTo()
1023 ga_init2(&new_win->w_folds, (int)sizeof(fold_T), 10); in foldInitWin()
1107 fold_T *from_p; in cloneFoldGrowArray()
1108 fold_T *to_p; in cloneFoldGrowArray()
1114 from_p = (fold_T *)from->ga_data; in cloneFoldGrowArray()
1115 to_p = (fold_T *)to->ga_data; in cloneFoldGrowArray()
1138 foldFind(garray_T *gap, linenr_T lnum, fold_T **fpp) in foldFind()
1141 fold_T *fp; in foldFind()
1155 fp = (fold_T *)gap->ga_data; in foldFind()
1185 fold_T *fp; in foldLevelWin()
1299 fold_T *fp; in setManualFoldWin()
1300 fold_T *fp2; in setManualFoldWin()
1301 fold_T *found = NULL; in setManualFoldWin()
1322 if (fp != NULL && fp < (fold_T *)gap->ga_data + gap->ga_len) in setManualFoldWin()
1331 if (fp + 1 < (fold_T *)gap->ga_data + gap->ga_len) in setManualFoldWin()
1342 fp2 = (fold_T *)fp->fd_nested.ga_data; in setManualFoldWin()
1403 foldOpenNested(fold_T *fpr) in foldOpenNested()
1406 fold_T *fp; in foldOpenNested()
1408 fp = (fold_T *)fpr->fd_nested.ga_data; in foldOpenNested()
1425 fold_T *fp; in deleteFoldEntry()
1428 fold_T *nfp; in deleteFoldEntry()
1430 fp = (fold_T *)gap->ga_data + idx; in deleteFoldEntry()
1437 mch_memmove(fp, fp + 1, sizeof(fold_T) * (gap->ga_len - idx)); in deleteFoldEntry()
1447 fp = (fold_T *)gap->ga_data + idx; in deleteFoldEntry()
1450 nfp = (fold_T *)fp->fd_nested.ga_data; in deleteFoldEntry()
1463 sizeof(fold_T) * (gap->ga_len - (idx + 1))); in deleteFoldEntry()
1465 mch_memmove(fp, nfp, (size_t)(sizeof(fold_T) * moved)); in deleteFoldEntry()
1482 deleteFoldRecurse(&(((fold_T *)(gap->ga_data))[i].fd_nested)); in deleteFoldRecurse()
1518 fold_T *fp; in foldMarkAdjustRecurse()
1539 for (i = (int)(fp - (fold_T *)gap->ga_data); i < gap->ga_len; ++i, ++fp) in foldMarkAdjustRecurse()
1650 fold_T *fp; in getDeepestNestingRecurse()
1652 fp = (fold_T *)gap->ga_data; in getDeepestNestingRecurse()
1670 fold_T *fp, in check_closed()
1710 fold_T *fp, in checkSmall()
1748 fold_T *fp; in setSmallMaybe()
1750 fp = (fold_T *)gap->ga_data; in setSmallMaybe()
1824 fold_T *fp, in deleteFoldMarkers()
1832 deleteFoldMarkers((fold_T *)fp->fd_nested.ga_data + i, TRUE, in deleteFoldMarkers()
2132 static void foldMerge(fold_T *fp1, garray_T *gap, fold_T *fp2);
2154 fold_T *fp; in foldUpdateIEMS()
2274 fold_T *fpn = NULL; in foldUpdateIEMS()
2410 fold_T *fp = NULL; in foldUpdateIEMSRecurse()
2411 fold_T *fp2; in foldUpdateIEMSRecurse()
2430 if (fp != NULL && (fp >= ((fold_T *)gap->ga_data) + gap->ga_len in foldUpdateIEMSRecurse()
2527 || (fp < ((fold_T *)gap->ga_data) + gap->ga_len in foldUpdateIEMSRecurse()
2530 || (fp < ((fold_T *)gap->ga_data) + gap->ga_len in foldUpdateIEMSRecurse()
2597 i = (int)(fp - (fold_T *)gap->ga_data); in foldUpdateIEMSRecurse()
2599 fp = (fold_T *)gap->ga_data + i + 1; in foldUpdateIEMSRecurse()
2612 i = (int)(fp - (fold_T *)gap->ga_data); in foldUpdateIEMSRecurse()
2631 (int)(fp - (fold_T *)gap->ga_data), TRUE); in foldUpdateIEMSRecurse()
2651 i = (int)(fp - (fold_T *)gap->ga_data); in foldUpdateIEMSRecurse()
2654 fp = (fold_T *)gap->ga_data + i; in foldUpdateIEMSRecurse()
2714 i = (int)(fp - (fold_T *)gap->ga_data); in foldUpdateIEMSRecurse()
2718 fp = (fold_T *)gap->ga_data + i; in foldUpdateIEMSRecurse()
2807 i = (int)(fp - (fold_T *)gap->ga_data); in foldUpdateIEMSRecurse()
2809 fp = (fold_T *)gap->ga_data + i; in foldUpdateIEMSRecurse()
2822 if (fp2 >= (fold_T *)gap->ga_data + gap->ga_len in foldUpdateIEMSRecurse()
2846 deleteFoldEntry(gap, (int)(fp2 - (fold_T *)gap->ga_data), TRUE); in foldUpdateIEMSRecurse()
2865 fold_T *fp; in foldInsert()
2869 fp = (fold_T *)gap->ga_data + i; in foldInsert()
2871 mch_memmove(fp + 1, fp, sizeof(fold_T) * (gap->ga_len - i)); in foldInsert()
2873 ga_init2(&fp->fd_nested, (int)sizeof(fold_T), 10); in foldInsert()
2892 fold_T *fp; in foldSplit()
2893 fold_T *fp2; in foldSplit()
2902 fp = (fold_T *)gap->ga_data + i; in foldSplit()
2915 len = (int)((fold_T *)gap1->ga_data + gap1->ga_len - fp2); in foldSplit()
2920 ((fold_T *)gap2->ga_data)[idx] = fp2[idx]; in foldSplit()
2921 ((fold_T *)gap2->ga_data)[idx].fd_top in foldSplit()
2954 fold_T *fp = NULL; in foldRemove()
2969 foldSplit(gap, (int)(fp - (fold_T *)gap->ga_data), top, bot); in foldRemove()
2979 if (fp >= (fold_T *)(gap->ga_data) + gap->ga_len in foldRemove()
3001 deleteFoldEntry(gap, (int)(fp - (fold_T *)gap->ga_data), TRUE); in foldRemove()
3010 fold_T *left, *right; in foldReverseOrder()
3011 fold_T tmp; in foldReverseOrder()
3017 left = (fold_T *)gap->ga_data + start; in foldReverseOrder()
3018 right = (fold_T *)gap->ga_data + end; in foldReverseOrder()
3059 truncate_fold(fold_T *fp, linenr_T end) in truncate_fold()
3067 #define valid_fold(fp, gap) ((gap)->ga_len > 0 && (fp) < ((fold_T *)(gap)->ga_data + (gap)->ga_len))
3068 #define fold_index(fp, gap) ((size_t)(fp - ((fold_T *)(gap)->ga_data)))
3073 fold_T *fp; in foldMoveRange()
3196 foldMerge(fold_T *fp1, garray_T *gap, fold_T *fp2) in foldMerge()
3198 fold_T *fp3; in foldMerge()
3199 fold_T *fp4; in foldMerge()
3214 ((fold_T *)gap1->ga_data)[gap1->ga_len] in foldMerge()
3215 = ((fold_T *)gap2->ga_data)[idx]; in foldMerge()
3216 ((fold_T *)gap1->ga_data)[gap1->ga_len].fd_top += fp1->fd_len; in foldMerge()
3223 deleteFoldEntry(gap, (int)(fp2 - (fold_T *)gap->ga_data), TRUE); in foldMerge()
3517 static int put_fold_open_close(FILE *fd, fold_T *fp, linenr_T off);
3550 fold_T *fp; in put_folds_recurse()
3552 fp = (fold_T *)gap->ga_data; in put_folds_recurse()
3581 fold_T *fp; in put_foldopen_recurse()
3583 fp = (fold_T *)gap->ga_data; in put_foldopen_recurse()
3630 put_fold_open_close(FILE *fd, fold_T *fp, linenr_T off) in put_fold_open_close()