aboutsummaryrefslogtreecommitdiffstats
path: root/src/buffer.c
diff options
context:
space:
mode:
authorMatt Armstrong2022-10-19 16:16:09 -0700
committerStefan Monnier2022-10-19 21:35:09 -0400
commit37a1145410f7d61883ea689255ee7e564c2fb3d0 (patch)
treeea0d6e7eb8aab331e78fe67db3bdc9e426a93572 /src/buffer.c
parentf421b58db5d34f45773a73c699b4b1a5a5b9da03 (diff)
downloademacs-37a1145410f7d61883ea689255ee7e564c2fb3d0.tar.gz
emacs-37a1145410f7d61883ea689255ee7e564c2fb3d0.zip
Rename all exported itree.h functions with the itree_ prefix
For the most part, I replaced the interval_tree_ prefix with itree_, interval_node_ with itree_node_, etc. * src/alloc.c: Rename everywhere as appropriate. * src/alloc.c: ditto. * src/buffer.c: ditto. * src/buffer.h: ditto. * src/itree.c: ditto. * src/itree.h: ditto.
Diffstat (limited to 'src/buffer.c')
-rw-r--r--src/buffer.c26
1 files changed, 13 insertions, 13 deletions
diff --git a/src/buffer.c b/src/buffer.c
index 228c6e60560..3286cd338ff 100644
--- a/src/buffer.c
+++ b/src/buffer.c
@@ -644,9 +644,9 @@ add_buffer_overlay (struct buffer *b, struct Lisp_Overlay *ov,
644{ 644{
645 eassert (! ov->buffer); 645 eassert (! ov->buffer);
646 if (! b->overlays) 646 if (! b->overlays)
647 b->overlays = interval_tree_create (); 647 b->overlays = itree_create ();
648 ov->buffer = b; 648 ov->buffer = b;
649 itree_insert_node (b->overlays, ov->interval, begin, end); 649 itree_insert (b->overlays, ov->interval, begin, end);
650} 650}
651 651
652/* Copy overlays of buffer FROM to buffer TO. */ 652/* Copy overlays of buffer FROM to buffer TO. */
@@ -911,7 +911,7 @@ remove_buffer_overlay (struct buffer *b, struct Lisp_Overlay *ov)
911{ 911{
912 eassert (b->overlays); 912 eassert (b->overlays);
913 eassert (ov->buffer == b); 913 eassert (ov->buffer == b);
914 interval_tree_remove (ov->buffer->overlays, ov->interval); 914 itree_remove (ov->buffer->overlays, ov->interval);
915 ov->buffer = NULL; 915 ov->buffer = NULL;
916} 916}
917 917
@@ -951,7 +951,7 @@ delete_all_overlays (struct buffer *b)
951 /* Where are the nodes freed ? --ap */ 951 /* Where are the nodes freed ? --ap */
952 XOVERLAY (node->data)->buffer = NULL; 952 XOVERLAY (node->data)->buffer = NULL;
953 } 953 }
954 interval_tree_clear (b->overlays); 954 itree_clear (b->overlays);
955} 955}
956 956
957static void 957static void
@@ -960,7 +960,7 @@ free_buffer_overlays (struct buffer *b)
960 /* Actually this does not free any overlay, but the tree only. --ap */ 960 /* Actually this does not free any overlay, but the tree only. --ap */
961 if (b->overlays) 961 if (b->overlays)
962 { 962 {
963 interval_tree_destroy (b->overlays); 963 itree_destroy (b->overlays);
964 b->overlays = NULL; 964 b->overlays = NULL;
965 } 965 }
966} 966}
@@ -980,7 +980,7 @@ set_overlays_multibyte (bool multibyte)
980 980
981 struct itree_node **nodes = NULL; 981 struct itree_node **nodes = NULL;
982 struct itree_tree *tree = current_buffer->overlays; 982 struct itree_tree *tree = current_buffer->overlays;
983 const intmax_t size = interval_tree_size (tree); 983 const intmax_t size = itree_size (tree);
984 984
985 /* We can't use `interval_node_set_region` at the same time 985 /* We can't use `interval_node_set_region` at the same time
986 as we iterate over the itree, so we need an auxiliary storage 986 as we iterate over the itree, so we need an auxiliary storage
@@ -999,8 +999,8 @@ set_overlays_multibyte (bool multibyte)
999 999
1000 if (multibyte) 1000 if (multibyte)
1001 { 1001 {
1002 ptrdiff_t begin = interval_node_begin (tree, node); 1002 ptrdiff_t begin = itree_node_begin (tree, node);
1003 ptrdiff_t end = interval_node_end (tree, node); 1003 ptrdiff_t end = itree_node_end (tree, node);
1004 1004
1005 /* This models the behavior of markers. (The behavior of 1005 /* This models the behavior of markers. (The behavior of
1006 text-intervals differs slightly.) */ 1006 text-intervals differs slightly.) */
@@ -1010,12 +1010,12 @@ set_overlays_multibyte (bool multibyte)
1010 while (end < Z_BYTE 1010 while (end < Z_BYTE
1011 && !CHAR_HEAD_P (FETCH_BYTE (end))) 1011 && !CHAR_HEAD_P (FETCH_BYTE (end)))
1012 end++; 1012 end++;
1013 interval_node_set_region (tree, node, BYTE_TO_CHAR (begin), 1013 itree_node_set_region (tree, node, BYTE_TO_CHAR (begin),
1014 BYTE_TO_CHAR (end)); 1014 BYTE_TO_CHAR (end));
1015 } 1015 }
1016 else 1016 else
1017 { 1017 {
1018 interval_node_set_region (tree, node, CHAR_TO_BYTE (node->begin), 1018 itree_node_set_region (tree, node, CHAR_TO_BYTE (node->begin),
1019 CHAR_TO_BYTE (node->end)); 1019 CHAR_TO_BYTE (node->end));
1020 } 1020 }
1021 } 1021 }
@@ -3446,7 +3446,7 @@ adjust_overlays_for_insert (ptrdiff_t pos, ptrdiff_t length)
3446 but we may need to update the value of the overlay center. */ 3446 but we may need to update the value of the overlay center. */
3447 if (! current_buffer->overlays) 3447 if (! current_buffer->overlays)
3448 return; 3448 return;
3449 interval_tree_insert_gap (current_buffer->overlays, pos, length); 3449 itree_insert_gap (current_buffer->overlays, pos, length);
3450} 3450}
3451 3451
3452void 3452void
@@ -3454,7 +3454,7 @@ adjust_overlays_for_delete (ptrdiff_t pos, ptrdiff_t length)
3454{ 3454{
3455 if (! current_buffer->overlays) 3455 if (! current_buffer->overlays)
3456 return; 3456 return;
3457 interval_tree_delete_gap (current_buffer->overlays, pos, length); 3457 itree_delete_gap (current_buffer->overlays, pos, length);
3458} 3458}
3459 3459
3460 3460
@@ -3594,7 +3594,7 @@ buffer. */)
3594 add_buffer_overlay (XBUFFER (buffer), XOVERLAY (overlay), n_beg, n_end); 3594 add_buffer_overlay (XBUFFER (buffer), XOVERLAY (overlay), n_beg, n_end);
3595 } 3595 }
3596 else 3596 else
3597 interval_node_set_region (b->overlays, XOVERLAY (overlay)->interval, 3597 itree_node_set_region (b->overlays, XOVERLAY (overlay)->interval,
3598 n_beg, n_end); 3598 n_beg, n_end);
3599 3599
3600 /* If the overlay has changed buffers, do a thorough redisplay. */ 3600 /* If the overlay has changed buffers, do a thorough redisplay. */