diff options
| author | Stefan Monnier | 2022-10-09 19:45:26 -0400 |
|---|---|---|
| committer | Stefan Monnier | 2022-10-09 19:45:26 -0400 |
| commit | 7cbeeabc7e6271948e7bb93020c2e4e50c65f384 (patch) | |
| tree | 777b281d62878ab7cc5a12b7e3fbc8952bf95dbc /src/itree.h | |
| parent | 4f3f7aebc957732f4fbe5c799da5367f46607680 (diff) | |
| download | emacs-7cbeeabc7e6271948e7bb93020c2e4e50c65f384.tar.gz emacs-7cbeeabc7e6271948e7bb93020c2e4e50c65f384.zip | |
Tighten up handling of `otick`
Move args between `build_overlay` and `add_buffer_overlay`,
to try and keep buffer positions together with their buffer.
Be more strict in the `otick` values passed to `interval_tree_insert`.
Move a few things around to try and reduce dependencies through `.h` files.
Fix a thinko bug in `check_tree`.
* src/alloc.c (build_overlay): Remove `begin` and `end` args.
* src/buffer.c (add_buffer_overlay): Move from `buffer.h`.
Add `begin` and `end` args.
(copy_overlays): Adjust accordingly.
(Fmake_overlay): Use BUF_BEG and BUF_Z; adjust call to `build_overlay`
and `add_buffer_overlay`.
(Fmove_overlay): Use BUF_BEG and BUF_Z; Use the new `begin` and `end`
args of `add_buffer_overlay` so we don't need to use
`interval_node_set_region` when moving to a new buffer.
(remove_buffer_overlay, set_overlay_region): Move from `buffer.h`.
* src/buffer.h (set_overlay_region, add_buffer_overlay)
(remove_buffer_overlay): Move to `buffer.c`.
(build_overlay): Move from `lisp.h`.
(maybe_alloc_buffer_overlays): Delete function (inline into its only
caller).
* src/itree.c (interval_tree_insert): Move declaration `from buffer.h`.
(check_tree): Fix initial offset in call to `recurse_check_tree`.
Remove redundant check of the `limit` value.
(interval_node_init): Remove `begin` and `end` args.
(interval_tree_insert): Mark it as static.
Assert that the new node's `otick` should already be uptodate and its
new parent as well.
(itree_insert_node): New function.
(interval_tree_insert_gap): Assert the otick of the removed+added nodes
were uptodate and mark them as uptodate again after adjusting
their positions.
(interval_tree_inherit_offset): Check that the parent is at least as
uptodate as the child.
* src/lisp.h (build_overlay): Move to `buffer.h`.
* src/itree.h (interval_node_init): Adjust accordingly.
(interval_tree_insert): Remove declaration.
(itree_insert_node): New declaration.
Diffstat (limited to 'src/itree.h')
| -rw-r--r-- | src/itree.h | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/src/itree.h b/src/itree.h index 7fdc9c07c93..5733ec15305 100644 --- a/src/itree.h +++ b/src/itree.h | |||
| @@ -112,7 +112,7 @@ enum interval_tree_order { | |||
| 112 | ITREE_PRE_ORDER, | 112 | ITREE_PRE_ORDER, |
| 113 | }; | 113 | }; |
| 114 | 114 | ||
| 115 | void interval_node_init (struct interval_node *, ptrdiff_t, ptrdiff_t, bool, bool, Lisp_Object); | 115 | void interval_node_init (struct interval_node *, bool, bool, Lisp_Object); |
| 116 | ptrdiff_t interval_node_begin (struct interval_tree *, struct interval_node *); | 116 | ptrdiff_t interval_node_begin (struct interval_tree *, struct interval_node *); |
| 117 | ptrdiff_t interval_node_end (struct interval_tree *, struct interval_node *); | 117 | ptrdiff_t interval_node_end (struct interval_tree *, struct interval_node *); |
| 118 | void interval_node_set_region (struct interval_tree *, struct interval_node *, ptrdiff_t, ptrdiff_t); | 118 | void interval_node_set_region (struct interval_tree *, struct interval_node *, ptrdiff_t, ptrdiff_t); |
| @@ -120,7 +120,8 @@ struct interval_tree *interval_tree_create (void); | |||
| 120 | void interval_tree_destroy (struct interval_tree *); | 120 | void interval_tree_destroy (struct interval_tree *); |
| 121 | intmax_t interval_tree_size (struct interval_tree *); | 121 | intmax_t interval_tree_size (struct interval_tree *); |
| 122 | void interval_tree_clear (struct interval_tree *); | 122 | void interval_tree_clear (struct interval_tree *); |
| 123 | void interval_tree_insert (struct interval_tree *, struct interval_node *); | 123 | void itree_insert_node (struct interval_tree *tree, struct interval_node *node, |
| 124 | ptrdiff_t begin, ptrdiff_t end); | ||
| 124 | struct interval_node *interval_tree_remove (struct interval_tree *, struct interval_node *); | 125 | struct interval_node *interval_tree_remove (struct interval_tree *, struct interval_node *); |
| 125 | struct interval_generator *interval_tree_iter_start (struct interval_tree *, ptrdiff_t, ptrdiff_t, enum interval_tree_order, | 126 | struct interval_generator *interval_tree_iter_start (struct interval_tree *, ptrdiff_t, ptrdiff_t, enum interval_tree_order, |
| 126 | const char* file, int line); | 127 | const char* file, int line); |