itree_node 3950 src/alloc.c struct itree_node *node = xmalloc (sizeof (*node)); itree_node 6832 src/alloc.c mark_overlays (struct itree_node *node) itree_node 672 src/buffer.c struct itree_node *node; itree_node 949 src/buffer.c struct itree_node *node; itree_node 992 src/buffer.c struct itree_node **nodes = NULL; itree_node 1002 src/buffer.c struct itree_node *node, **cursor = nodes; itree_node 1009 src/buffer.c struct itree_node * const node = *nodes; itree_node 2466 src/buffer.c struct itree_node *node; itree_node 3001 src/buffer.c struct itree_node *node; itree_node 3066 src/buffer.c struct itree_node *node; itree_node 3091 src/buffer.c struct itree_node *node; itree_node 3174 src/buffer.c struct itree_node *node; itree_node 3383 src/buffer.c struct itree_node *node; itree_node 3499 src/buffer.c struct itree_node *node; itree_node 3931 src/buffer.c struct itree_node *node; itree_node 4068 src/buffer.c struct itree_node *node; itree_node 4990 src/buffer.c make_lispy_itree_node (const struct itree_node *node) itree_node 5009 src/buffer.c const struct itree_node *node) itree_node 137 src/itree.c struct itree_node **nodes; itree_node 149 src/itree.c stack->nodes = xmalloc (stack->size * sizeof (struct itree_node*)); itree_node 178 src/itree.c itree_stack_push (struct itree_stack *stack, struct itree_node *node) itree_node 187 src/itree.c static inline struct itree_node * itree_node 217 src/itree.c check_subtree (struct itree_node *node, itree_node 297 src/itree.c struct itree_node *node = tree->root; itree_node 313 src/itree.c null_safe_is_red (struct itree_node *node) itree_node 319 src/itree.c null_safe_is_black (struct itree_node *node) itree_node 325 src/itree.c itree_newlimit (struct itree_node *node) itree_node 340 src/itree.c itree_update_limit (struct itree_node *node) itree_node 355 src/itree.c itree_inherit_offset (uintmax_t otick, struct itree_node *node) itree_node 392 src/itree.c itree_propagate_limit (struct itree_node *node) itree_node 412 src/itree.c static struct itree_node* itree_node 413 src/itree.c itree_validate (struct itree_tree *tree, struct itree_node *node) itree_node 432 src/itree.c itree_node_init (struct itree_node *node, itree_node 450 src/itree.c struct itree_node *node) itree_node 460 src/itree.c struct itree_node *node) itree_node 516 src/itree.c struct itree_node *node) itree_node 520 src/itree.c struct itree_node *right = node->right; itree_node 559 src/itree.c struct itree_node *node) itree_node 563 src/itree.c struct itree_node *left = node->left; itree_node 598 src/itree.c struct itree_node *node) itree_node 612 src/itree.c struct itree_node *uncle = node->parent->parent->right; itree_node 642 src/itree.c struct itree_node *uncle = node->parent->parent->left; itree_node 676 src/itree.c itree_insert_node (struct itree_tree *tree, struct itree_node *node) itree_node 683 src/itree.c struct itree_node *parent = NULL; itree_node 684 src/itree.c struct itree_node *child = tree->root; itree_node 732 src/itree.c itree_insert (struct itree_tree *tree, struct itree_node *node, itree_node 745 src/itree.c struct itree_node *node, itree_node 767 src/itree.c itree_contains (struct itree_tree *tree, struct itree_node *node) itree_node 770 src/itree.c struct itree_node *other; itree_node 779 src/itree.c itree_limit_is_stable (struct itree_node *node) itree_node 787 src/itree.c static struct itree_node* itree_node 788 src/itree.c itree_subtree_min (uintmax_t otick, struct itree_node *node) itree_node 804 src/itree.c struct itree_node *node, itree_node 805 src/itree.c struct itree_node *parent) itree_node 818 src/itree.c struct itree_node *other = parent->right; itree_node 855 src/itree.c struct itree_node *other = parent->left; itree_node 899 src/itree.c itree_total_offset (struct itree_node *node) itree_node 920 src/itree.c struct itree_node *source, itree_node 921 src/itree.c struct itree_node *dest) itree_node 946 src/itree.c struct itree_node *source, itree_node 947 src/itree.c struct itree_node *dest) itree_node 961 src/itree.c struct itree_node* itree_node 962 src/itree.c itree_remove (struct itree_tree *tree, struct itree_node *node) itree_node 971 src/itree.c struct itree_node *splice itree_node 980 src/itree.c struct itree_node *subtree itree_node 985 src/itree.c struct itree_node *subtree_parent itree_node 1060 src/itree.c struct itree_node *node = NULL; itree_node 1151 src/itree.c struct itree_node *node; itree_node 1200 src/itree.c itree_node_intersects (const struct itree_node *node, itree_node 1219 src/itree.c static struct itree_node * itree_node 1220 src/itree.c itree_iter_next_in_subtree (struct itree_node *node, itree_node 1228 src/itree.c struct itree_node *next; itree_node 1335 src/itree.c static struct itree_node * itree_node 1339 src/itree.c struct itree_node *node = tree->root; itree_node 1342 src/itree.c struct itree_node dummy; itree_node 1400 src/itree.c struct itree_node * itree_node 1403 src/itree.c struct itree_node *node = iter->node; itree_node 46 src/itree.h struct itree_node *parent; itree_node 47 src/itree.h struct itree_node *left; itree_node 48 src/itree.h struct itree_node *right; itree_node 99 src/itree.h struct itree_node *root; itree_node 112 src/itree.h extern void itree_node_init (struct itree_node *, bool, bool, Lisp_Object); itree_node 113 src/itree.h extern ptrdiff_t itree_node_begin (struct itree_tree *, struct itree_node *); itree_node 114 src/itree.h extern ptrdiff_t itree_node_end (struct itree_tree *, struct itree_node *); itree_node 115 src/itree.h extern void itree_node_set_region (struct itree_tree *, struct itree_node *, itree_node 126 src/itree.h extern void itree_insert (struct itree_tree *, struct itree_node *, itree_node 128 src/itree.h extern struct itree_node *itree_remove (struct itree_tree *, itree_node 129 src/itree.h struct itree_node *); itree_node 142 src/itree.h extern struct itree_node *itree_iterator_next (struct itree_iterator *); itree_node 147 src/itree.h struct itree_node *node; itree_node 2612 src/lisp.h struct itree_node *interval; itree_node 2136 src/pdumper.c dump_interval_node (struct dump_context *ctx, struct itree_node *node, itree_node 2142 src/pdumper.c struct itree_node out; itree_node 2163 src/pdumper.c offset + dump_offsetof (struct itree_node, parent), itree_node 2168 src/pdumper.c offset + dump_offsetof (struct itree_node, left), itree_node 2173 src/pdumper.c offset + dump_offsetof (struct itree_node, right), itree_node 637 src/textprop.c struct itree_node *node; itree_node 6763 src/xdisp.c struct itree_node *node; itree_node 7237 src/xdisp.c struct itree_node *node; itree_node 35 test/manual/noverlay/itree-tests.c static struct itree_node A, B, C, D, E; itree_node 36 test/manual/noverlay/itree-tests.c static struct itree_node N_05, N_10, N_15, N_20, N_30, N_40; itree_node 37 test/manual/noverlay/itree-tests.c static struct itree_node N_50, N_70, N_80, N_90, N_85, N_95; itree_node 54 test/manual/noverlay/itree-tests.c struct itree_node *nodes[N] = {&N_50, &N_30, &N_20, &N_10, &N_15, &N_05}; itree_node 239 test/manual/noverlay/itree-tests.c struct itree_node *nodes[N] = {&N_50, &N_70, &N_80, &N_90, &N_85, &N_95}; itree_node 420 test/manual/noverlay/itree-tests.c struct itree_node *nodes[N] = {&N_10, &N_20, &N_30, &N_40}; itree_node 439 test/manual/noverlay/itree-tests.c struct itree_node nodes[N] = {0}; itree_node 677 test/manual/noverlay/itree-tests.c struct itree_node *nodes[N] = {&N_10, &N_20, &N_30, &N_40}; itree_node 725 test/manual/noverlay/itree-tests.c struct itree_node nodes[N] = {0}; itree_node 750 test/manual/noverlay/itree-tests.c struct itree_node node = {0}, *n; itree_node 783 test/manual/noverlay/itree-tests.c struct itree_node *node = itree_iterator_next (g); itree_node 795 test/manual/noverlay/itree-tests.c struct itree_node nodes[3] = {0}; itree_node 818 test/manual/noverlay/itree-tests.c test_create_tree (struct itree_node *nodes, int n, bool doshuffle) itree_node 832 test/manual/noverlay/itree-tests.c struct itree_node *node = &nodes[index[i]]; itree_node 841 test/manual/noverlay/itree-tests.c struct itree_node nodes[N] = {{.begin = 10, .end = 10}, itree_node 856 test/manual/noverlay/itree-tests.c struct itree_node nodes[N] = {{.begin = 10, .end = 30}, itree_node 865 test/manual/noverlay/itree-tests.c struct itree_node *n = itree_iterator_next (g); itree_node 881 test/manual/noverlay/itree-tests.c struct itree_node nodes[N] = {{.begin = 10, .end = 30}, itree_node 890 test/manual/noverlay/itree-tests.c struct itree_node *n = itree_iterator_next (g); itree_node 906 test/manual/noverlay/itree-tests.c struct itree_node nodes[N] = {{.begin = 10, .end = 30}, itree_node 915 test/manual/noverlay/itree-tests.c struct itree_node *n = itree_iterator_next (g); itree_node 931 test/manual/noverlay/itree-tests.c struct itree_node nodes[N] = {{.begin = 20, .end = 30}, itree_node 936 test/manual/noverlay/itree-tests.c struct itree_node *n = itree_iterator_next (g); itree_node 947 test/manual/noverlay/itree-tests.c struct itree_node nodes[N] = {{.begin = 25, .end = 25}, itree_node 952 test/manual/noverlay/itree-tests.c struct itree_node *n = itree_iterator_next (g); itree_node 966 test/manual/noverlay/itree-tests.c static struct itree_node gap_node;