node 393 lib-src/etags.c static void add_node (node *, node **); node 398 lib-src/etags.c static void free_tree (node *); node 401 lib-src/etags.c static void invalidate_nodes (fdesc *, node **); node 402 lib-src/etags.c static void put_entries (node *); node 449 lib-src/etags.c static node *nodehead; /* the head of the binary tree of tags */ node 450 lib-src/etags.c static node *last_node; /* the last node created */ node 1815 lib-src/etags.c node *np, *prev; node 1937 lib-src/etags.c node *old_last_node = last_node; node 2074 lib-src/etags.c register node *np; node 2083 lib-src/etags.c np = xnew (1, node); node 2129 lib-src/etags.c node *np; node 2134 lib-src/etags.c push_node (node *np, stkentry **stack_top) node 2146 lib-src/etags.c static node * node 2149 lib-src/etags.c node *ret = NULL; node 2167 lib-src/etags.c free_tree (register node *np) node 2180 lib-src/etags.c node *node_right = np->right; node 2226 lib-src/etags.c add_node (node *np, node **cur_node_p) node 2228 lib-src/etags.c node *cur_node = *cur_node_p; node 2286 lib-src/etags.c node **next_node = &cur_node; node 2332 lib-src/etags.c invalidate_nodes (fdesc *badfdp, node **npp) node 2334 lib-src/etags.c node *np = *npp; node 2369 lib-src/etags.c node super_root, *np_parent = NULL; node 2399 lib-src/etags.c static ptrdiff_t total_size_of_entries (node *); node 2419 lib-src/etags.c total_size_of_entries (node *np) node 2439 lib-src/etags.c put_entry (node *np) node 2512 lib-src/etags.c put_entries (node *np) node 43 lib-src/pop.c int sys_getaddrinfo (const char * node, const char * service, node 1604 lib-src/pop.c sys_getaddrinfo (const char *node, const char *service, node 1616 lib-src/pop.c rc = pfn_getaddrinfo (node, service, hints, res); node 1630 lib-src/pop.c if (!node) node 1647 lib-src/pop.c host_info = gethostbyname (node); node 41 lib/regcomp.c static reg_errcode_t optimize_subexps (void *extra, bin_tree_t *node); node 42 lib/regcomp.c static reg_errcode_t lower_subexps (void *extra, bin_tree_t *node); node 44 lib/regcomp.c bin_tree_t *node); node 45 lib/regcomp.c static reg_errcode_t calc_first (void *extra, bin_tree_t *node); node 46 lib/regcomp.c static reg_errcode_t calc_next (void *extra, bin_tree_t *node); node 47 lib/regcomp.c static reg_errcode_t link_nfa_nodes (void *extra, bin_tree_t *node); node 53 lib/regcomp.c Idx node, bool root); node 110 lib/regcomp.c static void free_token (re_token_t *node); node 111 lib/regcomp.c static reg_errcode_t free_tree (void *extra, bin_tree_t *node); node 112 lib/regcomp.c static reg_errcode_t mark_opt_subexp (void *extra, bin_tree_t *node); node 289 lib/regcomp.c Idx node = init_state->nodes.elems[node_cnt]; node 290 lib/regcomp.c re_token_type_t type = dfa->nodes[node].type; node 294 lib/regcomp.c re_set_fastmap (fastmap, icase, dfa->nodes[node].opr.c); node 303 lib/regcomp.c *p++ = dfa->nodes[node].opr.c; node 304 lib/regcomp.c while (++node < dfa->nodes_len node 305 lib/regcomp.c && dfa->nodes[node].type == CHARACTER node 306 lib/regcomp.c && dfa->nodes[node].mb_partial) node 307 lib/regcomp.c *p++ = dfa->nodes[node].opr.c; node 322 lib/regcomp.c bitset_word_t w = dfa->nodes[node].opr.sbcset[i]; node 330 lib/regcomp.c re_charset_t *cset = dfa->nodes[node].opr.mbcset; node 1048 lib/regcomp.c Idx node; node 1053 lib/regcomp.c for (node = 0; node < dfa->nodes_len; ++node) node 1054 lib/regcomp.c switch (dfa->nodes[node].type) node 1057 lib/regcomp.c if (dfa->nodes[node].opr.c >= ASCII_CHARS) node 1061 lib/regcomp.c switch (dfa->nodes[node].opr.ctx_type) node 1095 lib/regcomp.c if (dfa->nodes[node].opr.sbcset[i] >> rshift != 0) node 1106 lib/regcomp.c for (node = 0; node < dfa->nodes_len; ++node) node 1108 lib/regcomp.c if (dfa->nodes[node].type == CHARACTER node 1109 lib/regcomp.c && dfa->nodes[node].opr.c >= ASCII_CHARS) node 1110 lib/regcomp.c dfa->nodes[node].mb_partial = 0; node 1111 lib/regcomp.c else if (dfa->nodes[node].type == OP_PERIOD) node 1112 lib/regcomp.c dfa->nodes[node].type = OP_UTF8_PERIOD; node 1191 lib/regcomp.c bin_tree_t *node, *prev; node 1193 lib/regcomp.c for (node = root; ; ) node 1197 lib/regcomp.c while (node->left || node->right) node 1198 lib/regcomp.c if (node->left) node 1199 lib/regcomp.c node = node->left; node 1201 lib/regcomp.c node = node->right; node 1205 lib/regcomp.c reg_errcode_t err = fn (extra, node); node 1208 lib/regcomp.c if (node->parent == NULL) node 1210 lib/regcomp.c prev = node; node 1211 lib/regcomp.c node = node->parent; node 1214 lib/regcomp.c while (node->right == prev || node->right == NULL); node 1215 lib/regcomp.c node = node->right; node 1223 lib/regcomp.c bin_tree_t *node; node 1225 lib/regcomp.c for (node = root; ; ) node 1227 lib/regcomp.c reg_errcode_t err = fn (extra, node); node 1232 lib/regcomp.c if (node->left) node 1233 lib/regcomp.c node = node->left; node 1237 lib/regcomp.c while (node->right == prev || node->right == NULL) node 1239 lib/regcomp.c prev = node; node 1240 lib/regcomp.c node = node->parent; node 1241 lib/regcomp.c if (!node) node 1244 lib/regcomp.c node = node->right; node 1253 lib/regcomp.c optimize_subexps (void *extra, bin_tree_t *node) node 1257 lib/regcomp.c if (node->token.type == OP_BACK_REF && dfa->subexp_map) node 1259 lib/regcomp.c int idx = node->token.opr.idx; node 1260 lib/regcomp.c node->token.opr.idx = dfa->subexp_map[idx]; node 1261 lib/regcomp.c dfa->used_bkref_map |= 1 << node->token.opr.idx; node 1264 lib/regcomp.c else if (node->token.type == SUBEXP node 1265 lib/regcomp.c && node->left && node->left->token.type == SUBEXP) node 1267 lib/regcomp.c Idx other_idx = node->left->token.opr.idx; node 1269 lib/regcomp.c node->left = node->left->left; node 1270 lib/regcomp.c if (node->left) node 1271 lib/regcomp.c node->left->parent = node; node 1273 lib/regcomp.c dfa->subexp_map[other_idx] = dfa->subexp_map[node->token.opr.idx]; node 1284 lib/regcomp.c lower_subexps (void *extra, bin_tree_t *node) node 1289 lib/regcomp.c if (node->left && node->left->token.type == SUBEXP) node 1291 lib/regcomp.c node->left = lower_subexp (&err, preg, node->left); node 1292 lib/regcomp.c if (node->left) node 1293 lib/regcomp.c node->left->parent = node; node 1295 lib/regcomp.c if (node->right && node->right->token.type == SUBEXP) node 1297 lib/regcomp.c node->right = lower_subexp (&err, preg, node->right); node 1298 lib/regcomp.c if (node->right) node 1299 lib/regcomp.c node->right->parent = node; node 1306 lib/regcomp.c lower_subexp (reg_errcode_t *err, regex_t *preg, bin_tree_t *node) node 1309 lib/regcomp.c bin_tree_t *body = node->left; node 1317 lib/regcomp.c && node->left != NULL node 1318 lib/regcomp.c && (node->token.opr.idx >= BITSET_WORD_BITS node 1320 lib/regcomp.c & ((bitset_word_t) 1 << node->token.opr.idx)))) node 1321 lib/regcomp.c return node->left; node 1336 lib/regcomp.c op->token.opr.idx = cls->token.opr.idx = node->token.opr.idx; node 1337 lib/regcomp.c op->token.opt_subexp = cls->token.opt_subexp = node->token.opt_subexp; node 1344 lib/regcomp.c calc_first (void *extra, bin_tree_t *node) node 1347 lib/regcomp.c if (node->token.type == CONCAT) node 1349 lib/regcomp.c node->first = node->left->first; node 1350 lib/regcomp.c node->node_idx = node->left->node_idx; node 1354 lib/regcomp.c node->first = node; node 1355 lib/regcomp.c node->node_idx = re_dfa_add_node (dfa, node->token); node 1356 lib/regcomp.c if (__glibc_unlikely (node->node_idx == -1)) node 1358 lib/regcomp.c if (node->token.type == ANCHOR) node 1359 lib/regcomp.c dfa->nodes[node->node_idx].constraint = node->token.opr.ctx_type; node 1366 lib/regcomp.c calc_next (void *extra, bin_tree_t *node) node 1368 lib/regcomp.c switch (node->token.type) node 1371 lib/regcomp.c node->left->next = node; node 1374 lib/regcomp.c node->left->next = node->right->first; node 1375 lib/regcomp.c node->right->next = node->next; node 1378 lib/regcomp.c if (node->left) node 1379 lib/regcomp.c node->left->next = node->next; node 1380 lib/regcomp.c if (node->right) node 1381 lib/regcomp.c node->right->next = node->next; node 1389 lib/regcomp.c link_nfa_nodes (void *extra, bin_tree_t *node) node 1392 lib/regcomp.c Idx idx = node->node_idx; node 1395 lib/regcomp.c switch (node->token.type) node 1401 lib/regcomp.c DEBUG_ASSERT (node->next == NULL); node 1409 lib/regcomp.c if (node->left != NULL) node 1410 lib/regcomp.c left = node->left->first->node_idx; node 1412 lib/regcomp.c left = node->next->node_idx; node 1413 lib/regcomp.c if (node->right != NULL) node 1414 lib/regcomp.c right = node->right->first->node_idx; node 1416 lib/regcomp.c right = node->next->node_idx; node 1426 lib/regcomp.c err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx); node 1430 lib/regcomp.c dfa->nexts[idx] = node->next->node_idx; node 1431 lib/regcomp.c if (node->token.type == OP_BACK_REF) node 1436 lib/regcomp.c DEBUG_ASSERT (!IS_EPSILON_NODE (node->token.type)); node 1437 lib/regcomp.c dfa->nexts[idx] = node->next->node_idx; node 1655 lib/regcomp.c calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, Idx node, bool root) node 1661 lib/regcomp.c err = re_node_set_alloc (&eclosure, dfa->edests[node].nelem + 1); node 1666 lib/regcomp.c eclosure.elems[eclosure.nelem++] = node; node 1670 lib/regcomp.c dfa->eclosures[node].nelem = -1; node 1674 lib/regcomp.c if (dfa->nodes[node].constraint node 1675 lib/regcomp.c && dfa->edests[node].nelem node 1676 lib/regcomp.c && !dfa->nodes[dfa->edests[node].elems[0]].duplicated) node 1678 lib/regcomp.c err = duplicate_node_closure (dfa, node, node, node, node 1679 lib/regcomp.c dfa->nodes[node].constraint); node 1685 lib/regcomp.c if (IS_EPSILON_NODE(dfa->nodes[node].type)) node 1686 lib/regcomp.c for (i = 0; i < dfa->edests[node].nelem; ++i) node 1689 lib/regcomp.c Idx edest = dfa->edests[node].elems[i]; node 1721 lib/regcomp.c dfa->eclosures[node].nelem = 0; node 1723 lib/regcomp.c dfa->eclosures[node] = eclosure; node 3714 lib/regcomp.c mark_opt_subexp (void *extra, bin_tree_t *node) node 3717 lib/regcomp.c if (node->token.type == SUBEXP && node->token.opr.idx == idx) node 3718 lib/regcomp.c node->token.opt_subexp = 1; node 3726 lib/regcomp.c free_token (re_token_t *node) node 3728 lib/regcomp.c if (node->type == COMPLEX_BRACKET && node->duplicated == 0) node 3729 lib/regcomp.c free_charset (node->opr.mbcset); node 3730 lib/regcomp.c else if (node->type == SIMPLE_BRACKET && node->duplicated == 0) node 3731 lib/regcomp.c re_free (node->opr.sbcset); node 3738 lib/regcomp.c free_tree (void *extra, bin_tree_t *node) node 3740 lib/regcomp.c free_token (&node->token); node 3753 lib/regcomp.c const bin_tree_t *node; node 3757 lib/regcomp.c for (node = root; ; ) node 3760 lib/regcomp.c *p_new = create_token_tree (dfa, NULL, NULL, &node->token); node 3768 lib/regcomp.c if (node->left) node 3770 lib/regcomp.c node = node->left; node 3776 lib/regcomp.c while (node->right == prev || node->right == NULL) node 3778 lib/regcomp.c prev = node; node 3779 lib/regcomp.c node = node->parent; node 3781 lib/regcomp.c if (!node) node 3784 lib/regcomp.c node = node->right; node 1612 lib/regex_internal.c re_token_t *node = dfa->nodes + nodes->elems[i]; node 1613 lib/regex_internal.c re_token_type_t type = node->type; node 1614 lib/regex_internal.c if (type == CHARACTER && !node->constraint) node 1616 lib/regex_internal.c newstate->accept_mb |= node->accept_mb; node 1623 lib/regex_internal.c else if (type == ANCHOR || node->constraint) node 1662 lib/regex_internal.c re_token_t *node = dfa->nodes + nodes->elems[i]; node 1663 lib/regex_internal.c re_token_type_t type = node->type; node 1664 lib/regex_internal.c unsigned int constraint = node->constraint; node 1668 lib/regex_internal.c newstate->accept_mb |= node->accept_mb; node 550 lib/regex_internal.h Idx node; node 562 lib/regex_internal.h Idx node; node 571 lib/regex_internal.h Idx node; node 614 lib/regex_internal.h Idx node; node 24 lib/regexec.c static reg_errcode_t match_ctx_add_entry (re_match_context_t *cache, Idx node, node 27 lib/regexec.c static reg_errcode_t match_ctx_add_subtop (re_match_context_t *mctx, Idx node, node 30 lib/regexec.c Idx node, Idx str_idx); node 94 lib/regexec.c Idx node, Idx str_idx, node 166 lib/regexec.c const re_token_t *node, Idx idx); node 1162 lib/regexec.c check_halt_node_context (const re_dfa_t *dfa, Idx node, unsigned int context) node 1164 lib/regexec.c re_token_type_t type = dfa->nodes[node].type; node 1165 lib/regexec.c unsigned int constraint = dfa->nodes[node].constraint; node 1201 lib/regexec.c Idx *pidx, Idx node, re_node_set *eps_via_nodes, node 1205 lib/regexec.c if (IS_EPSILON_NODE (dfa->nodes[node].type)) node 1208 lib/regexec.c re_node_set *edests = &dfa->edests[node]; node 1210 lib/regexec.c if (! re_node_set_contains (eps_via_nodes, node)) node 1212 lib/regexec.c bool ok = re_node_set_insert (eps_via_nodes, node); node 1249 lib/regexec.c re_token_type_t type = dfa->nodes[node].type; node 1251 lib/regexec.c if (dfa->nodes[node].accept_mb) node 1252 lib/regexec.c naccepted = check_node_accept_bytes (dfa, node, &mctx->input, *pidx); node 1255 lib/regexec.c Idx subexp_idx = dfa->nodes[node].opr.idx + 1; node 1278 lib/regexec.c bool ok = re_node_set_insert (eps_via_nodes, node); node 1281 lib/regexec.c dest_node = dfa->edests[node].elems[0]; node 1289 lib/regexec.c || check_node_accept (mctx, dfa->nodes + node, *pidx)) node 1291 lib/regexec.c Idx dest_node = dfa->nexts[node]; node 1323 lib/regexec.c fs->stack[num].node = dest_node; node 1348 lib/regexec.c DEBUG_ASSERT (0 <= fs->stack[num].node); node 1349 lib/regexec.c return fs->stack[num].node; node 1541 lib/regexec.c #define STATE_NODE_CONTAINS(state,node) \ node 1542 lib/regexec.c ((state) != NULL && re_node_set_contains (&(state)->nodes, node)) node 1785 lib/regexec.c sub_epsilon_src_nodes (const re_dfa_t *dfa, Idx node, re_node_set *dest_nodes, node 1790 lib/regexec.c re_node_set *inv_eclosure = dfa->inveclosures + node; node 1796 lib/regexec.c if (cur_node == node) node 1846 lib/regexec.c subexp_idx = dfa->nodes[ent->node].opr.idx; node 1879 lib/regexec.c Idx node = eclosures->elems[node_idx]; node 1880 lib/regexec.c switch (dfa->nodes[node].type) node 1891 lib/regexec.c if (ent->node != node) node 1905 lib/regexec.c dst = dfa->edests[node].elems[0]; node 1931 lib/regexec.c if ((boundaries & 1) && subexp_idx == dfa->nodes[node].opr.idx) node 1936 lib/regexec.c if ((boundaries & 2) && subexp_idx == dfa->nodes[node].opr.idx) node 1994 lib/regexec.c subexp_idx = dfa->nodes[ent->node].opr.idx; node 2001 lib/regexec.c Idx node = dest_nodes->elems[node_idx]; node 2002 lib/regexec.c re_token_type_t type = dfa->nodes[node].type; node 2004 lib/regexec.c && subexp_idx == dfa->nodes[node].opr.idx) node 2005 lib/regexec.c ops_node = node; node 2007 lib/regexec.c && subexp_idx == dfa->nodes[node].opr.idx) node 2008 lib/regexec.c cls_node = node; node 2025 lib/regexec.c Idx node = dest_nodes->elems[node_idx]; node 2026 lib/regexec.c if (!re_node_set_contains (dfa->inveclosures + node, node 2028 lib/regexec.c && !re_node_set_contains (dfa->eclosures + node, node 2033 lib/regexec.c err = sub_epsilon_src_nodes (dfa, node, dest_nodes, node 2045 lib/regexec.c Idx node = dest_nodes->elems[node_idx]; node 2046 lib/regexec.c re_token_type_t type = dfa->nodes[node].type; node 2049 lib/regexec.c if (subexp_idx != dfa->nodes[node].opr.idx) node 2053 lib/regexec.c err = sub_epsilon_src_nodes (dfa, node, dest_nodes, node 2071 lib/regexec.c Idx node_idx, node; node 2085 lib/regexec.c node = candidates->elems[node_idx]; node 2086 lib/regexec.c type = dfa->nodes[node].type; node 2088 lib/regexec.c if (node == sctx->last_node && str_idx == sctx->last_str_idx) node 2103 lib/regexec.c if (entry->node != node) node 2107 lib/regexec.c dst_node = (subexp_len ? dfa->nexts[node] node 2108 lib/regexec.c : dfa->edests[node].elems[0]); node 2113 lib/regexec.c || check_dst_limits (mctx, &sctx->limits, node, node 2124 lib/regexec.c local_sctx.last_node = node; node 2370 lib/regexec.c Idx node = cur_nodes->elems[node_idx]; node 2371 lib/regexec.c if (dfa->nodes[node].type == OP_OPEN_SUBEXP node 2372 lib/regexec.c && dfa->nodes[node].opr.idx < BITSET_WORD_BITS node 2374 lib/regexec.c & ((bitset_word_t) 1 << dfa->nodes[node].opr.idx))) node 2376 lib/regexec.c err = match_ctx_add_subtop (mctx, node, str_idx); node 2507 lib/regexec.c const re_token_t *node = dfa->nodes + node_idx; node 2511 lib/regexec.c if (node->type != OP_BACK_REF) node 2514 lib/regexec.c if (node->constraint) node 2518 lib/regexec.c if (NOT_SATISFY_NEXT_CONSTRAINT (node->constraint, context)) node 2538 lib/regexec.c if (bkref_ent->node != node_idx || bkref_ent->str_idx != cur_str_idx) node 2619 lib/regexec.c if (entry->node == bkref_node) node 2634 lib/regexec.c if (dfa->nodes[sub_top->node].opr.idx != subexp_num) node 2731 lib/regexec.c err = check_arrival (mctx, sub_top->path, sub_top->node, node 2766 lib/regexec.c err = check_arrival (mctx, &sub_last->path, sub_last->node, node 2795 lib/regexec.c const re_token_t *node = dfa->nodes + cls_node; node 2796 lib/regexec.c if (node->type == type node 2797 lib/regexec.c && node->opr.idx == subexp_idx) node 3165 lib/regexec.c if (!re_node_set_contains (cur_nodes, ent->node)) node 3177 lib/regexec.c next_node = dfa->edests[ent->node].elems[0]; node 3197 lib/regexec.c next_node = dfa->nexts[ent->node]; node 3439 lib/regexec.c re_token_t *node = &dfa->nodes[cur_nodes->elems[i]]; node 3440 lib/regexec.c re_token_type_t type = node->type; node 3441 lib/regexec.c unsigned int constraint = node->constraint; node 3445 lib/regexec.c bitset_set (accepts, node->opr.c); node 3448 lib/regexec.c bitset_merge (accepts, node->opr.sbcset); node 3497 lib/regexec.c if (type == CHARACTER && !node->word_char) node 3514 lib/regexec.c if (type == CHARACTER && node->word_char) node 3540 lib/regexec.c if (type == CHARACTER && !bitset_contain (dests_ch[j], node->opr.c)) node 3615 lib/regexec.c const re_token_t *node = dfa->nodes + node_idx; node 3619 lib/regexec.c if (__glibc_unlikely (node->type == OP_UTF8_PERIOD)) node 3671 lib/regexec.c if (node->type == OP_PERIOD) node 3690 lib/regexec.c if (node->type == COMPLEX_BRACKET) node 3692 lib/regexec.c const re_charset_t *cset = node->opr.mbcset; node 3900 lib/regexec.c check_node_accept (const re_match_context_t *mctx, const re_token_t *node, node 3905 lib/regexec.c switch (node->type) node 3908 lib/regexec.c if (node->opr.c != ch) node 3913 lib/regexec.c if (!bitset_contain (node->opr.sbcset, ch)) node 3931 lib/regexec.c if (node->constraint) node 3937 lib/regexec.c if (NOT_SATISFY_NEXT_CONSTRAINT (node->constraint, context)) node 4088 lib/regexec.c match_ctx_add_entry (re_match_context_t *mctx, Idx node, Idx str_idx, Idx from, node 4110 lib/regexec.c mctx->bkref_ents[mctx->nbkref_ents].node = node; node 4159 lib/regexec.c match_ctx_add_subtop (re_match_context_t *mctx, Idx node, Idx str_idx) node 4177 lib/regexec.c mctx->sub_tops[mctx->nsub_tops]->node = node; node 4187 lib/regexec.c match_ctx_add_sublast (re_sub_match_top_t *subtop, Idx node, Idx str_idx) node 4205 lib/regexec.c new_entry->node = node; node 133 nt/inc/sys/socket.h int sys_getaddrinfo (const char * node, const char * service, node 3950 src/alloc.c struct itree_node *node = xmalloc (sizeof (*node)); node 3951 src/alloc.c itree_node_init (node, front_advance, rear_advance, overlay); node 3952 src/alloc.c p->interval = node; node 6832 src/alloc.c mark_overlays (struct itree_node *node) node 6834 src/alloc.c if (node == NULL) node 6836 src/alloc.c mark_object (node->data); node 6837 src/alloc.c mark_overlays (node->left); node 6838 src/alloc.c mark_overlays (node->right); node 672 src/buffer.c struct itree_node *node; node 674 src/buffer.c ITREE_FOREACH (node, from->overlays, PTRDIFF_MIN, PTRDIFF_MAX, ASCENDING) node 676 src/buffer.c Lisp_Object ov = node->data; node 677 src/buffer.c Lisp_Object copy = build_overlay (node->front_advance, node 678 src/buffer.c node->rear_advance, node 680 src/buffer.c add_buffer_overlay (to, XOVERLAY (copy), node->begin, node->end); node 949 src/buffer.c struct itree_node *node; node 957 src/buffer.c ITREE_FOREACH (node, b->overlays, PTRDIFF_MIN, PTRDIFF_MAX, POST_ORDER) node 959 src/buffer.c modify_overlay (b, node->begin, node->end); node 960 src/buffer.c XOVERLAY (node->data)->buffer = NULL; node 961 src/buffer.c node->parent = NULL; node 962 src/buffer.c node->left = NULL; node 963 src/buffer.c node->right = NULL; node 1002 src/buffer.c struct itree_node *node, **cursor = nodes; node 1003 src/buffer.c ITREE_FOREACH (node, tree, PTRDIFF_MIN, PTRDIFF_MAX, ASCENDING) node 1004 src/buffer.c *(cursor++) = node; node 1009 src/buffer.c struct itree_node * const node = *nodes; node 1013 src/buffer.c ptrdiff_t begin = itree_node_begin (tree, node); node 1014 src/buffer.c ptrdiff_t end = itree_node_end (tree, node); node 1024 src/buffer.c itree_node_set_region (tree, node, BYTE_TO_CHAR (begin), node 1029 src/buffer.c itree_node_set_region (tree, node, CHAR_TO_BYTE (node->begin), node 1030 src/buffer.c CHAR_TO_BYTE (node->end)); node 2466 src/buffer.c struct itree_node *node; node 2468 src/buffer.c ITREE_FOREACH (node, buffer->overlays, PTRDIFF_MIN, PTRDIFF_MAX, ASCENDING) node 2469 src/buffer.c XOVERLAY (node->data)->buffer = other; node 2471 src/buffer.c ITREE_FOREACH (node, other->overlays, PTRDIFF_MIN, PTRDIFF_MAX, ASCENDING) node 2472 src/buffer.c XOVERLAY (node->data)->buffer = buffer; node 3001 src/buffer.c struct itree_node *node; node 3009 src/buffer.c ITREE_FOREACH (node, current_buffer->overlays, beg, search_end, node 3012 src/buffer.c if (node->begin > end) node 3014 src/buffer.c next = min (next, node->begin); node 3017 src/buffer.c else if (node->begin == end) node 3019 src/buffer.c next = node->begin; node 3022 src/buffer.c if (empty && node->begin != node->end) node 3026 src/buffer.c if (! empty && node->begin == node->end) node 3037 src/buffer.c vec[idx] = node->data; node 3066 src/buffer.c struct itree_node *node; node 3068 src/buffer.c ITREE_FOREACH (node, current_buffer->overlays, pos, next, ASCENDING) node 3070 src/buffer.c if (node->begin > pos) node 3074 src/buffer.c eassert (node->begin < next); node 3075 src/buffer.c next = node->begin; node 3078 src/buffer.c else if (node->begin < node->end && node->end < next) node 3080 src/buffer.c next = node->end; node 3091 src/buffer.c struct itree_node *node; node 3094 src/buffer.c ITREE_FOREACH (node, current_buffer->overlays, prev, pos, DESCENDING) node 3096 src/buffer.c if (node->end < pos) node 3097 src/buffer.c prev = node->end; node 3099 src/buffer.c prev = max (prev, node->begin); node 3174 src/buffer.c struct itree_node *node; node 3178 src/buffer.c ITREE_FOREACH (node, current_buffer->overlays, pos - 1, pos + 1, DESCENDING) node 3179 src/buffer.c if (node->begin == pos || node->end == pos) node 3383 src/buffer.c struct itree_node *node; node 3388 src/buffer.c ITREE_FOREACH (node, current_buffer->overlays, pos - 1, pos + 1, DESCENDING) node 3390 src/buffer.c Lisp_Object overlay = node->data; node 3393 src/buffer.c ptrdiff_t startpos = node->begin; node 3394 src/buffer.c ptrdiff_t endpos = node->end; node 3499 src/buffer.c struct itree_node *node; node 3509 src/buffer.c ITREE_FOREACH (node, buf->overlays, pos, pos, ASCENDING) node 3511 src/buffer.c if (node->end == pos && node->begin == pos node 3512 src/buffer.c && ! NILP (Foverlay_get (node->data, Qevaporate))) node 3513 src/buffer.c hit_list = Fcons (node->data, hit_list); node 3931 src/buffer.c struct itree_node *node; node 3933 src/buffer.c ITREE_FOREACH (node, current_buffer->overlays, BEG, Z, DESCENDING) node 3934 src/buffer.c overlays = Fcons (node->data, overlays); node 4068 src/buffer.c struct itree_node *node; node 4077 src/buffer.c ITREE_FOREACH (node, current_buffer->overlays, node 4082 src/buffer.c Lisp_Object overlay = node->data; node 4990 src/buffer.c make_lispy_itree_node (const struct itree_node *node) node 4994 src/buffer.c make_fixnum (node->begin), node 4996 src/buffer.c make_fixnum (node->end), node 4998 src/buffer.c make_fixnum (node->limit), node 5000 src/buffer.c make_fixnum (node->offset), node 5002 src/buffer.c node->rear_advance ? Qt : Qnil, node 5004 src/buffer.c node->front_advance ? Qt : Qnil); node 5009 src/buffer.c const struct itree_node *node) node 5011 src/buffer.c if (node == ITREE_NULL) node 5013 src/buffer.c return list3 (make_lispy_itree_node (node), node 5014 src/buffer.c overlay_tree (tree, node->left), node 5015 src/buffer.c overlay_tree (tree, node->right)); node 1076 src/fns.c Lisp_Object node = Fcons (elt, Qnil); node 1078 src/fns.c result = node; node 1080 src/fns.c XSETCDR (last, node); node 1081 src/fns.c last = node; node 621 src/gtkutil.c xg_list_insert (xg_list_node *list, xg_list_node *node) node 625 src/gtkutil.c if (list_start) list_start->prev = node; node 626 src/gtkutil.c node->next = list_start; node 627 src/gtkutil.c node->prev = 0; node 628 src/gtkutil.c list->next = node; node 634 src/gtkutil.c xg_list_remove (xg_list_node *list, xg_list_node *node) node 637 src/gtkutil.c if (node == list_start) node 639 src/gtkutil.c list->next = node->next; node 644 src/gtkutil.c node->prev->next = node->next; node 645 src/gtkutil.c if (node->next) node->next->prev = node->prev; node 1116 src/haiku_font_support.cc BNode node; node 1143 src/haiku_font_support.cc rc = node.SetTo (path.Path ()); node 1148 src/haiku_font_support.cc if (node.GetNodeRef (&node_ref) < B_OK) node 5528 src/haiku_support.cc BNode node (path); node 5534 src/haiku_support.cc rc = node.InitCheck (); node 5555 src/haiku_support.cc result = node.WriteAttr (name, B_MIME_TYPE, 0, node 178 src/itree.c itree_stack_push (struct itree_stack *stack, struct itree_node *node) node 180 src/itree.c eassert (node); node 183 src/itree.c stack->nodes[stack->length] = node; node 217 src/itree.c check_subtree (struct itree_node *node, node 225 src/itree.c if (node == NULL) node 229 src/itree.c eassert (node->left == NULL || node->left->parent == node); node 230 src/itree.c eassert (node->right == NULL || node->right->parent == node); node 239 src/itree.c eassert (node->otick <= tree_otick); node 240 src/itree.c eassert (node->parent == NULL || node->otick <= node->parent->otick); node 241 src/itree.c eassert (node->otick != tree_otick || node->offset == 0); node 243 src/itree.c offset += node->offset; node 244 src/itree.c ptrdiff_t begin = node->begin + offset; node 245 src/itree.c ptrdiff_t end = node->end + offset; node 246 src/itree.c ptrdiff_t limit = node->limit + offset; node 254 src/itree.c = check_subtree (node->left, check_red_black_invariants, node 257 src/itree.c = check_subtree (node->right, check_red_black_invariants, node 267 src/itree.c eassert (node->parent == NULL || !node->red || !node->parent->red); node 272 src/itree.c result.black_height = (node->red ? 0 : 1) + left_result.black_height; node 297 src/itree.c struct itree_node *node = tree->root; node 299 src/itree.c = check_subtree (node, check_red_black_invariants, tree->otick, node 300 src/itree.c node->offset, PTRDIFF_MIN, node 313 src/itree.c null_safe_is_red (struct itree_node *node) node 315 src/itree.c return node != NULL && node->red; node 319 src/itree.c null_safe_is_black (struct itree_node *node) node 321 src/itree.c return node == NULL || !node->red; /* NULL nodes are black */ node 325 src/itree.c itree_newlimit (struct itree_node *node) node 327 src/itree.c eassert (node != NULL); node 328 src/itree.c return max (node->end, node 329 src/itree.c max (node->left == NULL node 331 src/itree.c : node->left->limit + node->left->offset, node 332 src/itree.c node->right == NULL node 334 src/itree.c : node->right->limit + node->right->offset)); node 340 src/itree.c itree_update_limit (struct itree_node *node) node 342 src/itree.c if (node == NULL) node 345 src/itree.c node->limit = itree_newlimit (node); node 355 src/itree.c itree_inherit_offset (uintmax_t otick, struct itree_node *node) node 357 src/itree.c eassert (node->parent == NULL || node->parent->otick >= node->otick); node 358 src/itree.c if (node->otick == otick) node 360 src/itree.c eassert (node->offset == 0); node 370 src/itree.c if (node->offset) node 372 src/itree.c node->begin += node->offset; node 373 src/itree.c node->end += node->offset; node 374 src/itree.c node->limit += node->offset; node 375 src/itree.c if (node->left != NULL) node 376 src/itree.c node->left->offset += node->offset; node 377 src/itree.c if (node->right != NULL) node 378 src/itree.c node->right->offset += node->offset; node 379 src/itree.c node->offset = 0; node 384 src/itree.c if (node->parent == NULL || node->parent->otick == otick) node 385 src/itree.c node->otick = otick; node 392 src/itree.c itree_propagate_limit (struct itree_node *node) node 396 src/itree.c if (node == NULL) node 401 src/itree.c newlimit = itree_newlimit (node); node 403 src/itree.c if (newlimit == node->limit) node 405 src/itree.c node->limit = newlimit; node 406 src/itree.c if (node->parent == NULL) node 408 src/itree.c node = node->parent; node 413 src/itree.c itree_validate (struct itree_tree *tree, struct itree_node *node) node 416 src/itree.c if (tree->otick == node->otick || node == NULL) node 417 src/itree.c return node; node 418 src/itree.c if (node != tree->root) node 419 src/itree.c itree_validate (tree, node->parent); node 421 src/itree.c itree_inherit_offset (tree->otick, node); node 422 src/itree.c return node; node 432 src/itree.c itree_node_init (struct itree_node *node, node 436 src/itree.c node->parent = NULL; node 437 src/itree.c node->left = NULL; node 438 src/itree.c node->right = NULL; node 439 src/itree.c node->begin = -1; node 440 src/itree.c node->end = -1; node 441 src/itree.c node->front_advance = front_advance; node 442 src/itree.c node->rear_advance = rear_advance; node 443 src/itree.c node->data = data; node 450 src/itree.c struct itree_node *node) node 452 src/itree.c itree_validate (tree, node); node 453 src/itree.c return node->begin; node 460 src/itree.c struct itree_node *node) node 462 src/itree.c itree_validate (tree, node); node 463 src/itree.c return node->end; node 516 src/itree.c struct itree_node *node) node 518 src/itree.c eassert (node->right != NULL); node 520 src/itree.c struct itree_node *right = node->right; node 522 src/itree.c itree_inherit_offset (tree->otick, node); node 526 src/itree.c node->right = right->left; node 528 src/itree.c right->left->parent = node; node 532 src/itree.c right->parent = node->parent; node 535 src/itree.c if (node != tree->root) node 537 src/itree.c if (node == node->parent->left) node 538 src/itree.c node->parent->left = right; node 540 src/itree.c node->parent->right = right; node 546 src/itree.c right->left = node; node 547 src/itree.c if (node != NULL) node 548 src/itree.c node->parent = right; node 551 src/itree.c itree_update_limit (node); node 559 src/itree.c struct itree_node *node) node 561 src/itree.c eassert (tree && node && node->left != NULL); node 563 src/itree.c struct itree_node *left = node->left; node 565 src/itree.c itree_inherit_offset (tree->otick, node); node 568 src/itree.c node->left = left->right; node 570 src/itree.c left->right->parent = node; node 573 src/itree.c left->parent = node->parent; node 574 src/itree.c if (node != tree->root) node 576 src/itree.c if (node == node->parent->right) node 577 src/itree.c node->parent->right = left; node 579 src/itree.c node->parent->left = left; node 584 src/itree.c left->right = node; node 585 src/itree.c if (node != NULL) node 586 src/itree.c node->parent = left; node 589 src/itree.c itree_update_limit (node); node 598 src/itree.c struct itree_node *node) node 602 src/itree.c while (null_safe_is_red (node->parent)) node 606 src/itree.c eassert (node->red); node 608 src/itree.c if (node->parent == node->parent->parent->left) node 612 src/itree.c struct itree_node *uncle = node->parent->parent->right; node 619 src/itree.c node->parent->red = false; node 621 src/itree.c node->parent->parent->red = true; node 622 src/itree.c node = node->parent->parent; node 628 src/itree.c if (node == node->parent->right) /* case 2.a */ node 630 src/itree.c node = node->parent; node 631 src/itree.c itree_rotate_left (tree, node); node 634 src/itree.c node->parent->red = false; node 635 src/itree.c node->parent->parent->red = true; node 636 src/itree.c itree_rotate_right (tree, node->parent->parent); node 642 src/itree.c struct itree_node *uncle = node->parent->parent->left; node 646 src/itree.c node->parent->red = false; node 648 src/itree.c node->parent->parent->red = true; node 649 src/itree.c node = node->parent->parent; node 653 src/itree.c if (node == node->parent->left) /* case 2.b */ node 655 src/itree.c node = node->parent; node 656 src/itree.c itree_rotate_right (tree, node); node 659 src/itree.c node->parent->red = false; node 660 src/itree.c node->parent->parent->red = true; node 661 src/itree.c itree_rotate_left (tree, node->parent->parent); node 676 src/itree.c itree_insert_node (struct itree_tree *tree, struct itree_node *node) node 678 src/itree.c eassert (node && node->begin <= node->end); node 679 src/itree.c eassert (node->left == NULL && node->right == NULL node 680 src/itree.c && node->parent == NULL); node 688 src/itree.c eassert (node->otick == otick); node 697 src/itree.c child->limit = max (child->limit, node->end); node 700 src/itree.c child = node->begin <= child->begin ? child->left : child->right; node 705 src/itree.c tree->root = node; node 706 src/itree.c else if (node->begin <= parent->begin) node 707 src/itree.c parent->left = node; node 709 src/itree.c parent->right = node; node 712 src/itree.c node->parent = parent; node 713 src/itree.c node->left = NULL; node 714 src/itree.c node->right = NULL; node 715 src/itree.c node->offset = 0; node 716 src/itree.c node->limit = node->end; node 717 src/itree.c eassert (node->parent == NULL || node->parent->otick >= node->otick); node 721 src/itree.c if (node == tree->root) node 722 src/itree.c node->red = false; node 725 src/itree.c node->red = true; node 727 src/itree.c itree_insert_fix (tree, node); node 732 src/itree.c itree_insert (struct itree_tree *tree, struct itree_node *node, node 735 src/itree.c node->begin = begin; node 736 src/itree.c node->end = end; node 737 src/itree.c node->otick = tree->otick; node 738 src/itree.c itree_insert_node (tree, node); node 745 src/itree.c struct itree_node *node, node 748 src/itree.c itree_validate (tree, node); node 749 src/itree.c if (begin != node->begin) node 751 src/itree.c itree_remove (tree, node); node 752 src/itree.c node->begin = min (begin, PTRDIFF_MAX - 1); node 753 src/itree.c node->end = max (node->begin, end); node 754 src/itree.c itree_insert_node (tree, node); node 756 src/itree.c else if (end != node->end) node 758 src/itree.c node->end = max (node->begin, end); node 759 src/itree.c eassert (node != NULL); node 760 src/itree.c itree_propagate_limit (node); node 767 src/itree.c itree_contains (struct itree_tree *tree, struct itree_node *node) node 769 src/itree.c eassert (node); node 771 src/itree.c ITREE_FOREACH (other, tree, node->begin, PTRDIFF_MAX, ASCENDING) node 772 src/itree.c if (other == node) node 779 src/itree.c itree_limit_is_stable (struct itree_node *node) node 781 src/itree.c if (node == NULL) node 783 src/itree.c ptrdiff_t newlimit = itree_newlimit (node); node 784 src/itree.c return (newlimit == node->limit); node 788 src/itree.c itree_subtree_min (uintmax_t otick, struct itree_node *node) node 790 src/itree.c if (node == NULL) node 791 src/itree.c return node; node 792 src/itree.c while ((itree_inherit_offset (otick, node), node 793 src/itree.c node->left != NULL)) node 794 src/itree.c node = node->left; node 795 src/itree.c return node; node 804 src/itree.c struct itree_node *node, node 808 src/itree.c eassert (node == tree->root); node 810 src/itree.c eassert (node == NULL || node->parent == parent); node 812 src/itree.c while (parent != NULL && null_safe_is_black (node)) node 814 src/itree.c eassert (node == parent->left || node == parent->right); node 816 src/itree.c if (node == parent->left) node 832 src/itree.c node = parent; node 833 src/itree.c eassert (node != NULL); node 834 src/itree.c parent = node->parent; node 849 src/itree.c node = tree->root; node 869 src/itree.c node = parent; node 870 src/itree.c eassert (node != NULL); node 871 src/itree.c parent = node->parent; node 887 src/itree.c node = tree->root; node 893 src/itree.c if (node != NULL) node 894 src/itree.c node->red = false; node 899 src/itree.c itree_total_offset (struct itree_node *node) node 901 src/itree.c eassert (node != NULL); node 903 src/itree.c while (node->parent != NULL) node 905 src/itree.c node = node->parent; node 906 src/itree.c offset += node->offset; node 962 src/itree.c itree_remove (struct itree_tree *tree, struct itree_node *node) node 964 src/itree.c eassert (itree_contains (tree, node)); node 970 src/itree.c itree_inherit_offset (tree->otick, node); node 972 src/itree.c = (node->left == NULL || node->right == NULL) node 973 src/itree.c ? node node 974 src/itree.c : itree_subtree_min (tree->otick, node->right); node 986 src/itree.c = (splice->parent != node) ? splice->parent : splice; node 1002 src/itree.c if (splice != node) node 1004 src/itree.c itree_transplant (tree, splice, node); node 1021 src/itree.c node->red = false; node 1022 src/itree.c node->right = node->left = node->parent = NULL; node 1023 src/itree.c node->limit = 0; node 1027 src/itree.c eassert (node->otick == tree->otick); node 1028 src/itree.c eassert (node->offset == 0); node 1030 src/itree.c return node; node 1060 src/itree.c struct itree_node *node = NULL; node 1064 src/itree.c ITREE_FOREACH (node, tree, pos, pos + 1, PRE_ORDER) node 1066 src/itree.c if (node->begin == pos && node->front_advance node 1070 src/itree.c && (node->begin != node->end || node->rear_advance)) node 1071 src/itree.c itree_stack_push (saved, node); node 1084 src/itree.c while ((node = itree_stack_pop (stack))) node 1087 src/itree.c itree_inherit_offset (tree->otick, node); node 1088 src/itree.c if (pos > node->limit) node 1090 src/itree.c if (node->right != NULL) node 1092 src/itree.c if (node->begin > pos) node 1095 src/itree.c node->right->offset += length; node 1099 src/itree.c itree_stack_push (stack, node->right); node 1101 src/itree.c if (node->left != NULL) node 1102 src/itree.c itree_stack_push (stack, node->left); node 1105 src/itree.c ? node->begin >= pos node 1106 src/itree.c : node->begin > pos) /* node->begin == pos => !front-advance */ node 1107 src/itree.c node->begin += length; node 1108 src/itree.c if (node->end > pos node 1109 src/itree.c || (node->end == pos && (before_markers || node->rear_advance))) node 1111 src/itree.c node->end += length; node 1112 src/itree.c eassert (node != NULL); node 1113 src/itree.c itree_propagate_limit (node); node 1121 src/itree.c while ((node = itree_stack_pop (saved))) node 1123 src/itree.c eassert (node->otick == ootick); node 1124 src/itree.c eassert (node->begin == pos); node 1125 src/itree.c eassert (node->end > pos || node->rear_advance); node 1126 src/itree.c node->begin += length; node 1127 src/itree.c node->end += length; node 1128 src/itree.c node->otick = notick; node 1129 src/itree.c itree_insert_node (tree, node); node 1151 src/itree.c struct itree_node *node; node 1154 src/itree.c while ((node = itree_stack_pop (stack))) node 1156 src/itree.c itree_inherit_offset (tree->otick, node); node 1157 src/itree.c if (pos > node->limit) node 1159 src/itree.c if (node->right != NULL) node 1161 src/itree.c if (node->begin > pos + length) node 1164 src/itree.c node->right->offset -= length; node 1168 src/itree.c itree_stack_push (stack, node->right); node 1170 src/itree.c if (node->left != NULL) node 1171 src/itree.c itree_stack_push (stack, node->left); node 1173 src/itree.c if (pos < node->begin) node 1174 src/itree.c node->begin = max (pos, node->begin - length); node 1175 src/itree.c if (node->end > pos) node 1177 src/itree.c node->end = max (pos , node->end - length); node 1178 src/itree.c eassert (node != NULL); node 1179 src/itree.c itree_propagate_limit (node); node 1200 src/itree.c itree_node_intersects (const struct itree_node *node, node 1203 src/itree.c return (begin < node->end && node->begin < end) node 1204 src/itree.c || (node->begin == node->end && begin == node->begin); node 1220 src/itree.c itree_iter_next_in_subtree (struct itree_node *node, node 1232 src/itree.c next = node->right; node 1235 src/itree.c while ((next = node->parent) node 1236 src/itree.c && next->right == node) node 1237 src/itree.c node = next; node 1240 src/itree.c node = next; node 1244 src/itree.c node = next; node 1245 src/itree.c itree_inherit_offset (iter->otick, node); node 1246 src/itree.c while ((next = node->left) node 1249 src/itree.c node = next; node 1251 src/itree.c if (node->begin > iter->end) node 1253 src/itree.c return node; node 1256 src/itree.c next = node->left; node 1261 src/itree.c while ((next = node->parent) node 1262 src/itree.c && next->left == node) node 1263 src/itree.c node = next; node 1266 src/itree.c node = next; node 1270 src/itree.c node = next; node 1271 src/itree.c while (node->begin <= iter->end node 1272 src/itree.c && (next = node->right)) node 1275 src/itree.c node = next; node 1278 src/itree.c return node; node 1281 src/itree.c next = node->left; node 1286 src/itree.c next = node->right; node 1287 src/itree.c if (node->begin <= iter->end && next) node 1292 src/itree.c while ((next = node->parent)) node 1294 src/itree.c if (next->right == node) node 1295 src/itree.c node = next; node 1298 src/itree.c eassert (next->left == node); node 1299 src/itree.c node = next; node 1300 src/itree.c next = node->right; node 1301 src/itree.c if (node->begin <= iter->end && next) node 1311 src/itree.c next = node->parent; node 1312 src/itree.c if (!next || next->right == node) node 1314 src/itree.c eassert (next->left == node); node 1315 src/itree.c node = next; node 1316 src/itree.c next = node->right; node 1317 src/itree.c if (!(node->begin <= iter->end && next)) node 1318 src/itree.c return node; node 1319 src/itree.c node = next; node 1320 src/itree.c itree_inherit_offset (iter->otick, node); node 1321 src/itree.c while (((next = node->left) node 1324 src/itree.c || (node->begin <= iter->end node 1325 src/itree.c && (next = node->right) node 1327 src/itree.c node = next; node 1328 src/itree.c return node; node 1339 src/itree.c struct itree_node *node = tree->root; node 1340 src/itree.c if (node) node 1346 src/itree.c itree_inherit_offset (iter->otick, node); node 1350 src/itree.c dummy.right = node; node 1352 src/itree.c node = itree_iter_next_in_subtree (&dummy, iter); node 1356 src/itree.c dummy.left = node; node 1357 src/itree.c node = itree_iter_next_in_subtree (&dummy, iter); node 1366 src/itree.c dummy.right = node; node 1368 src/itree.c node = itree_iter_next_in_subtree (&dummy, iter); node 1374 src/itree.c return node; node 1396 src/itree.c iter->node = itree_iterator_first_node (tree, iter); node 1403 src/itree.c struct itree_node *node = iter->node; node 1404 src/itree.c while (node node 1405 src/itree.c && !itree_node_intersects (node, iter->begin, iter->end)) node 1407 src/itree.c node = itree_iter_next_in_subtree (node, iter); node 1408 src/itree.c eassert (itree_limit_is_stable (node)); node 1410 src/itree.c iter->node = node ? itree_iter_next_in_subtree (node, iter) : NULL; node 1411 src/itree.c return node; node 147 src/itree.h struct itree_node *node; node 2136 src/pdumper.c dump_interval_node (struct dump_context *ctx, struct itree_node *node, node 2144 src/pdumper.c if (node->parent) node 2145 src/pdumper.c dump_field_fixup_later (ctx, &out, node, &node->parent); node 2146 src/pdumper.c if (node->left) node 2147 src/pdumper.c dump_field_fixup_later (ctx, &out, node, &node->parent); node 2148 src/pdumper.c if (node->right) node 2149 src/pdumper.c dump_field_fixup_later (ctx, &out, node, &node->parent); node 2150 src/pdumper.c DUMP_FIELD_COPY (&out, node, begin); node 2151 src/pdumper.c DUMP_FIELD_COPY (&out, node, end); node 2152 src/pdumper.c DUMP_FIELD_COPY (&out, node, limit); node 2153 src/pdumper.c DUMP_FIELD_COPY (&out, node, offset); node 2154 src/pdumper.c DUMP_FIELD_COPY (&out, node, otick); node 2155 src/pdumper.c dump_field_lv (ctx, &out, node, &node->data, WEIGHT_STRONG); node 2156 src/pdumper.c DUMP_FIELD_COPY (&out, node, red); node 2157 src/pdumper.c DUMP_FIELD_COPY (&out, node, rear_advance); node 2158 src/pdumper.c DUMP_FIELD_COPY (&out, node, front_advance); node 2160 src/pdumper.c if (node->parent) node 2164 src/pdumper.c dump_interval_node (ctx, node->parent, offset)); node 2165 src/pdumper.c if (node->left) node 2169 src/pdumper.c dump_interval_node (ctx, node->left, offset)); node 2170 src/pdumper.c if (node->right) node 2174 src/pdumper.c dump_interval_node (ctx, node->right, offset)); node 2040 src/print.c bool named = treesit_named_node_p (XTS_NODE (obj)->node); node 637 src/textprop.c struct itree_node *node; node 647 src/textprop.c ITREE_FOREACH (node, b->overlays, pos, pos + 1, ASCENDING) node 649 src/textprop.c Lisp_Object tem = Foverlay_get (node->data, prop); node 652 src/textprop.c if (NILP (tem) || node->end < pos + 1 node 653 src/textprop.c || (w && ! overlay_matches_window (w, node->data))) node 657 src/textprop.c make_sortvec_item (this, node->data); node 1178 src/treesit.c make_treesit_node (Lisp_Object parser, TSNode node) node 1185 src/treesit.c lisp_node->node = node; node 1225 src/treesit.c treesit_named_node_p (TSNode node) node 1227 src/treesit.c return ts_node_is_named (node); node 1370 src/treesit.c (Lisp_Object node) node 1372 src/treesit.c CHECK_TS_NODE (node); node 1373 src/treesit.c return XTS_NODE (node)->parser; node 1819 src/treesit.c (Lisp_Object node) node 1821 src/treesit.c if (NILP (node)) return Qnil; node 1822 src/treesit.c treesit_check_node (node); node 1825 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 1834 src/treesit.c (Lisp_Object node) node 1836 src/treesit.c if (NILP (node)) return Qnil; node 1837 src/treesit.c treesit_check_node (node); node 1840 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 1841 src/treesit.c ptrdiff_t visible_beg = XTS_PARSER (XTS_NODE (node)->parser)->visible_beg; node 1844 src/treesit.c = XBUFFER (XTS_PARSER (XTS_NODE (node)->parser)->buffer); node 1855 src/treesit.c (Lisp_Object node) node 1857 src/treesit.c if (NILP (node)) return Qnil; node 1858 src/treesit.c treesit_check_node (node); node 1861 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 1862 src/treesit.c ptrdiff_t visible_beg = XTS_PARSER (XTS_NODE (node)->parser)->visible_beg; node 1865 src/treesit.c = XBUFFER (XTS_PARSER (XTS_NODE (node)->parser)->buffer); node 1875 src/treesit.c (Lisp_Object node) node 1877 src/treesit.c if (NILP (node)) return Qnil; node 1878 src/treesit.c treesit_check_node (node); node 1881 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 1892 src/treesit.c (Lisp_Object node) node 1894 src/treesit.c if (NILP (node)) return Qnil; node 1895 src/treesit.c treesit_check_node (node); node 1900 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 1901 src/treesit.c Lisp_Object parser = XTS_NODE (node)->parser; node 1924 src/treesit.c (Lisp_Object node, Lisp_Object n, Lisp_Object named) node 1926 src/treesit.c if (NILP (node)) return Qnil; node 1927 src/treesit.c treesit_check_node (node); node 1933 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 1957 src/treesit.c return make_treesit_node (XTS_NODE (node)->parser, child); node 1985 src/treesit.c (Lisp_Object node, Lisp_Object property) node 1987 src/treesit.c if (NILP (node)) return Qnil; node 1988 src/treesit.c CHECK_TS_NODE (node); node 1992 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 1996 src/treesit.c return treesit_node_uptodate_p (node) ? Qnil : Qt; node 1998 src/treesit.c treesit_check_node (node); node 2008 src/treesit.c result = treesit_parser_live_p (XTS_NODE (node)->parser); node 2027 src/treesit.c (Lisp_Object node, Lisp_Object n) node 2029 src/treesit.c if (NILP (node)) node 2031 src/treesit.c treesit_check_node (node); node 2036 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 2062 src/treesit.c (Lisp_Object node, Lisp_Object named) node 2064 src/treesit.c if (NILP (node)) node 2066 src/treesit.c treesit_check_node (node); node 2069 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 2083 src/treesit.c (Lisp_Object node, Lisp_Object field_name) node 2085 src/treesit.c if (NILP (node)) node 2087 src/treesit.c treesit_check_node (node); node 2092 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 2100 src/treesit.c return make_treesit_node (XTS_NODE (node)->parser, child); node 2110 src/treesit.c (Lisp_Object node, Lisp_Object named) node 2112 src/treesit.c if (NILP (node)) return Qnil; node 2113 src/treesit.c treesit_check_node (node); node 2116 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 2126 src/treesit.c return make_treesit_node (XTS_NODE (node)->parser, sibling); node 2137 src/treesit.c (Lisp_Object node, Lisp_Object named) node 2139 src/treesit.c if (NILP (node)) return Qnil; node 2140 src/treesit.c treesit_check_node (node); node 2143 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 2154 src/treesit.c return make_treesit_node (XTS_NODE (node)->parser, sibling); node 2172 src/treesit.c TSNode node = ts_tree_cursor_current_node (cursor); node 2173 src/treesit.c while (ts_node_end_byte (node) <= pos) node 2176 src/treesit.c node = ts_tree_cursor_current_node (cursor); node 2181 src/treesit.c while (named && (!ts_node_is_named (node))) node 2184 src/treesit.c node = ts_tree_cursor_current_node (cursor); node 2202 src/treesit.c (Lisp_Object node, Lisp_Object pos, Lisp_Object named) node 2204 src/treesit.c if (NILP (node)) node 2206 src/treesit.c treesit_check_node (node); node 2208 src/treesit.c struct buffer *buf = XBUFFER (XTS_PARSER (XTS_NODE (node)->parser)->buffer); node 2209 src/treesit.c ptrdiff_t visible_beg = XTS_PARSER (XTS_NODE (node)->parser)->visible_beg; node 2215 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 2227 src/treesit.c return make_treesit_node (XTS_NODE (node)->parser, child); node 2239 src/treesit.c (Lisp_Object node, Lisp_Object beg, Lisp_Object end, Lisp_Object named) node 2241 src/treesit.c if (NILP (node)) return Qnil; node 2242 src/treesit.c treesit_check_node (node); node 2244 src/treesit.c struct buffer *buf = XBUFFER (XTS_PARSER (XTS_NODE (node)->parser)->buffer); node 2245 src/treesit.c ptrdiff_t visible_beg = XTS_PARSER (XTS_NODE (node)->parser)->visible_beg; node 2254 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 2267 src/treesit.c return make_treesit_node (XTS_NODE (node)->parser, child); node 2275 src/treesit.c TSNode treesit_node_1 = XTS_NODE (node1)->node; node 2276 src/treesit.c TSNode treesit_node_2 = XTS_NODE (node2)->node; node 2493 src/treesit.c Lisp_Object *node, node 2496 src/treesit.c *node = Qnil; node 2502 src/treesit.c *node = XCDR (XCAR (tail)); node 2507 src/treesit.c if (NILP (*node)) node 2528 src/treesit.c Lisp_Object node = Qnil; node 2529 src/treesit.c if (!treesit_predicate_capture_name_to_node (name, captures, &node, signal_data)) node 2533 src/treesit.c set_buffer_internal (XBUFFER (XTS_PARSER (XTS_NODE (node)->parser)->buffer)); node 2534 src/treesit.c *text = Fbuffer_substring (Ftreesit_node_start (node), node 2535 src/treesit.c Ftreesit_node_end (node)); node 2607 src/treesit.c Lisp_Object node = Qnil; node 2608 src/treesit.c if (!treesit_predicate_capture_name_to_node (capture_name, captures, &node, node 2612 src/treesit.c TSNode treesit_node = XTS_NODE (node)->node; node 2613 src/treesit.c ptrdiff_t visible_beg = XTS_PARSER (XTS_NODE (node)->parser)->visible_beg; node 2663 src/treesit.c Lisp_Object node = Qnil; node 2664 src/treesit.c if (!treesit_predicate_capture_name_to_node (XCAR (tail), captures, &node, node 2667 src/treesit.c nodes = Fcons (node, nodes); node 2868 src/treesit.c (Lisp_Object node, Lisp_Object query, node 2878 src/treesit.c Lisp_Object lisp_node = treesit_resolve_node (node); node 2881 src/treesit.c TSNode treesit_node = XTS_NODE (lisp_node)->node; node 2958 src/treesit.c capture.node); node 3081 src/treesit.c treesit_cursor_helper (TSTreeCursor *cursor, TSNode node, Lisp_Object parser) node 3083 src/treesit.c uint32_t end_pos = ts_node_end_byte (node); node 3086 src/treesit.c bool success = treesit_cursor_helper_1 (cursor, &node, end_pos, node 3352 src/treesit.c TSNode node = ts_tree_cursor_current_node (cursor); node 3353 src/treesit.c if (named && !ts_node_is_named (node)) node 3358 src/treesit.c const char *type = ts_node_type (node); node 3363 src/treesit.c Lisp_Object lisp_node = make_treesit_node (parser, node); node 3395 src/treesit.c const char *type = ts_node_type (node); node 3399 src/treesit.c Lisp_Object lisp_node = make_treesit_node (parser, node); node 3520 src/treesit.c (Lisp_Object node, Lisp_Object predicate, Lisp_Object backward, node 3523 src/treesit.c CHECK_TS_NODE (node); node 3538 src/treesit.c Lisp_Object parser = XTS_NODE (node)->parser; node 3548 src/treesit.c if (!treesit_cursor_helper (&cursor, XTS_NODE (node)->node, parser)) node 3557 src/treesit.c TSNode node = ts_tree_cursor_current_node (&cursor); node 3558 src/treesit.c return_value = make_treesit_node (parser, node); node 3613 src/treesit.c if (!treesit_cursor_helper (&cursor, XTS_NODE (start)->node, parser)) node 3622 src/treesit.c TSNode node = ts_tree_cursor_current_node (&cursor); node 3623 src/treesit.c return_value = make_treesit_node (parser, node); node 3645 src/treesit.c TSNode node = ts_tree_cursor_current_node (cursor); node 3646 src/treesit.c Lisp_Object lisp_node = make_treesit_node (parser, node); node 3746 src/treesit.c TSTreeCursor cursor = ts_tree_cursor_new (XTS_NODE (root)->node); node 3772 src/treesit.c (Lisp_Object node, Lisp_Object predicate) node 3774 src/treesit.c CHECK_TS_NODE (node); node 3776 src/treesit.c Lisp_Object parser = XTS_NODE (node)->parser; node 3784 src/treesit.c TSTreeCursor cursor = ts_tree_cursor_new (XTS_NODE (node)->node); node 3807 src/treesit.c (Lisp_Object node) node 3811 src/treesit.c CHECK_TS_NODE (node); node 3815 src/treesit.c TSTreeCursor cursor = ts_tree_cursor_new (XTS_NODE (node)->node); node 89 src/treesit.h TSNode node; node 170 src/treesit.h CHECK_TS_NODE (Lisp_Object node) node 172 src/treesit.h CHECK_TYPE (TS_NODEP (node), Qtreesit_node_p, node); node 8262 src/w32.c sys_getaddrinfo (const char *node, const char *service, node 8275 src/w32.c rc = pfn_getaddrinfo (node, service, hints, res); node 8289 src/w32.c if (!node) node 8315 src/w32.c host_info = sys_gethostbyname (node); node 8325 src/w32.c unsigned long numeric_addr = sys_inet_addr (node); node 6763 src/xdisp.c struct itree_node *node; node 6798 src/xdisp.c ITREE_FOREACH (node, current_buffer->overlays, charpos - 1, charpos + 1, DESCENDING) node 6800 src/xdisp.c Lisp_Object overlay = node->data; node 6802 src/xdisp.c ptrdiff_t start = node->begin; node 6803 src/xdisp.c ptrdiff_t end = node->end; node 7237 src/xdisp.c struct itree_node *node; node 7239 src/xdisp.c ITREE_FOREACH (node, current_buffer->overlays, startpos, endpos, DESCENDING) node 7241 src/xdisp.c Lisp_Object overlay = node->data; node 7249 src/xdisp.c ptrdiff_t ostart = node->begin; node 7250 src/xdisp.c ptrdiff_t oend = node->end; node 123 src/xml.c make_dom (xmlNode *node) node 125 src/xml.c if (node->type == XML_ELEMENT_NODE) node 127 src/xml.c Lisp_Object result = list1 (intern ((char *) node->name)); node 133 src/xml.c property = node->properties; node 149 src/xml.c child = node->children; node 158 src/xml.c else if (node->type == XML_TEXT_NODE || node->type == XML_CDATA_SECTION_NODE) node 160 src/xml.c if (node->content) node 161 src/xml.c return build_string ((char *) node->content); node 165 src/xml.c else if (node->type == XML_COMMENT_NODE) node 167 src/xml.c if (node->content) node 169 src/xml.c build_string ((char *) node->content)); node 257 src/xml.c xmlNode *node = xmlDocGetRootElement (doc); node 258 src/xml.c if (node != NULL) node 259 src/xml.c result = make_dom (node); node 162 test/manual/etags/c-src/c.c node *lasta = NULL; node 168 test/manual/etags/c-src/c.c node *lastb = NULL; node 315 test/manual/etags/c-src/etags.c static void add_node (node *, node **); node 321 test/manual/etags/c-src/etags.c static void free_tree (node *); node 324 test/manual/etags/c-src/etags.c static void invalidate_nodes (fdesc *, node **); node 325 test/manual/etags/c-src/etags.c static void put_entries (node *); node 363 test/manual/etags/c-src/etags.c static node *nodehead; /* the head of the binary tree of tags */ node 364 test/manual/etags/c-src/etags.c static node *last_node; /* the last node created */ node 1595 test/manual/etags/c-src/etags.c node *np, *prev; node 1729 test/manual/etags/c-src/etags.c node *old_last_node = last_node; node 1865 test/manual/etags/c-src/etags.c register node *np; node 1871 test/manual/etags/c-src/etags.c np = xnew (1, node); node 1917 test/manual/etags/c-src/etags.c free_tree (register node *np) node 1921 test/manual/etags/c-src/etags.c register node *node_right = np->right; node 1955 test/manual/etags/c-src/etags.c add_node (node *np, node **cur_node_p) node 1958 test/manual/etags/c-src/etags.c register node *cur_node = *cur_node_p; node 2035 test/manual/etags/c-src/etags.c invalidate_nodes (fdesc *badfdp, node **npp) node 2037 test/manual/etags/c-src/etags.c node *np = *npp; node 2067 test/manual/etags/c-src/etags.c static int total_size_of_entries (node *); node 2087 test/manual/etags/c-src/etags.c total_size_of_entries (register node *np) node 2107 test/manual/etags/c-src/etags.c put_entries (register node *np) node 81 test/manual/etags/y-src/parse.c typedef struct node *YYSTYPE; node 1148 test/manual/etags/y-src/parse.c (yyvsp[-3])->n_x.v_subs[1]=(struct node *)0; node 1175 test/manual/etags/y-src/parse.c (yyvsp[-3])->n_x.v_subs[0]=(struct node *)0; node 1242 test/manual/etags/y-src/parse.c (yyvsp[-3])->n_x.v_subs[0]=(struct node *)0; node 1361 test/manual/etags/y-src/parse.c yyvsp[-1]->n_x.v_subs[1]=(struct node *)0; node 1369 test/manual/etags/y-src/parse.c yyvsp[-1]->n_x.v_subs[1]=(struct node *)0; node 1667 test/manual/etags/y-src/parse.c extern struct node *yylval; node 1679 test/manual/etags/y-src/parse.c struct node *new; node 1701 test/manual/etags/y-src/parse.c new=(struct node *)obstack_alloc(&tmp_mem,sizeof(struct node)); node 73 test/manual/etags/y-src/parse.y typedef struct node *YYSTYPE; node 101 test/manual/etags/y-src/parse.y ($1)->n_x.v_subs[1]=(struct node *)0; node 116 test/manual/etags/y-src/parse.y ($1)->n_x.v_subs[0]=(struct node *)0; node 161 test/manual/etags/y-src/parse.y ($1)->n_x.v_subs[0]=(struct node *)0; node 239 test/manual/etags/y-src/parse.y $1->n_x.v_subs[1]=(struct node *)0; node 244 test/manual/etags/y-src/parse.y $1->n_x.v_subs[1]=(struct node *)0; node 306 test/manual/etags/y-src/parse.y extern struct node *yylval; node 318 test/manual/etags/y-src/parse.y struct node *new; node 340 test/manual/etags/y-src/parse.y new=(struct node *)obstack_alloc(&tmp_mem,sizeof(struct node)); node 750 test/manual/noverlay/itree-tests.c struct itree_node node = {0}, *n; node 754 test/manual/noverlay/itree-tests.c itree_insert (&tree, &node, 10, 20); node 757 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (n, &node); node 783 test/manual/noverlay/itree-tests.c struct itree_node *node = itree_iterator_next (g); node 784 test/manual/noverlay/itree-tests.c ck_assert_ptr_nonnull (node); node 785 test/manual/noverlay/itree-tests.c ck_assert_int_eq (node->begin, va_arg (ap, ptrdiff_t)); node 832 test/manual/noverlay/itree-tests.c struct itree_node *node = &nodes[index[i]]; node 833 test/manual/noverlay/itree-tests.c itree_insert (&tree, node, node->begin, node->end);