/external/lldb/examples/scripting/ |
H A D | dictionary.c | 52 insert (tree_node *root, char *word) argument 54 if (root == NULL) 57 int compare_value = strcmp (word, root->word); 64 if (root->left != NULL) 65 insert (root->left, word); 72 root->left = new_node; 77 if (root->right != NULL) 78 insert (root->right, word); 85 root->right = new_node;
|
/external/lldb/source/Core/ |
H A D | ValueObject.cpp | 524 ValueObjectSP root(GetSP()); 527 root = root->GetChildAtIndex(idx, true); 528 if (!root) 532 return root; 535 return root; 544 ValueObjectSP root(GetSP()); 547 root = root->GetChildAtIndex(idx.first, idx.second); 548 if (!root) 2584 ValueObjectSP root = GetSP(); local 3051 ExpandArraySliceExpression(const char* expression_cstr, const char** first_unparsed, ValueObjectSP root, ValueObjectListSP& list, ExpressionPathScanEndReason* reason_to_stop, ExpressionPathEndResultType* final_result, const GetValueForExpressionPathOptions& options, ExpressionPathAftermath* what_next) argument [all...] |
/external/lldb/test/functionalities/recursion/ |
H A D | main.cpp | 22 void make_tree(node* root, int count) argument 25 if (!root) 27 root->value = countdown; 30 root->next = new node(++countdown); 31 root = root->next; 38 node root(1); 39 make_tree(&root,25000);
|
/external/libvpx/libvpx/vpx_mem/memory_manager/include/ |
H A D | cavl_if.h | 5 * that can be found in the LICENSE file in the root of the source 8 * be found in the AUTHORS file in the root of the source tree. 86 AVL_HANDLE root; member in struct:__anon24994 173 ** take the less branch. bit 0 gives branch from root, and 180 /* Handles of nodes in path from root to current node (returned by *). */
|
/external/libxml2/ |
H A D | debugXML.c | 2153 * @node: the root element 2157 * which registers all namespaces declarations found on the root element. 2163 xmlNodePtr root, xmlNodePtr node2 ATTRIBUTE_UNUSED) 2167 if ((root == NULL) || (root->type != XML_ELEMENT_NODE) || 2168 (root->nsDef == NULL) || (ctxt == NULL) || (ctxt->pctxt == NULL)) 2170 ns = root->nsDef; 2759 * Show the full path from the root to the node, if needed building 2905 fprintf(ctxt->output, "\tcd [path] change directory to path or to root\n"); 2918 fprintf(ctxt->output, "\tsetrootns register all namespace found on the root elemen 2162 xmlShellRegisterRootNamespaces(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr root, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 3058 xmlNodePtr root; local [all...] |
H A D | pattern.c | 1333 "Unexpected selection of the document root in '%s'.\n", 1446 printf("root "); 1579 int i, s = 0, root = 0, flags = 0, prevs = -1; local 1620 root = 1; 1721 if ((! root) && (comp->flags & XML_PATTERN_NOTPATTERN) == 0) { 1738 if (root) 1850 * Both @name and @ns being NULL means the / i.e. the root of the document. 2208 * Both @name and @ns being NULL means the / i.e. the root of the document. 2231 * Both @name and @ns being NULL means the / i.e. the root of the document. 2258 * Both @name and @ns being NULL means the / i.e. the root o [all...] |
H A D | relaxng.c | 1189 xmlNodePtr root = NULL; local 1192 root = xmlDocGetRootElement(ctxt->doc); 1193 if (root == NULL) 1222 ret->seq = root; 1601 xmlNodePtr root, cur; local 1652 root = xmlDocGetRootElement(doc); 1653 if (root != NULL) { 1654 if (xmlHasProp(root, BAD_CAST "ns") == NULL) { 1655 xmlSetProp(root, BAD_CAST "ns", ns); 1690 root 1937 xmlNodePtr root; local 4544 xmlNodePtr root; local 4732 xmlNodePtr root, tmp; local 6996 xmlRelaxNGCleanupTree(xmlRelaxNGParserCtxtPtr ctxt, xmlNodePtr root) argument 7440 xmlNodePtr root; local 7470 xmlNodePtr root; local [all...] |
H A D | schematron.c | 1027 /* do the URI base composition, load and find the root */ 1042 "could not find root from include '%s'.\n", 1079 xmlNodePtr root, cur; local 1127 * Then extract the root and Schematron parse it 1129 root = xmlDocGetRootElement(doc); 1130 if (root == NULL) { 1140 if (!IS_SCHEMATRON(root, "schema")) { 1141 xmlSchematronPErr(ctxt, root, 1155 cur = root->children; 1204 xmlSchematronPErr(ctxt, root, 1666 xmlNodePtr cur, root; local [all...] |
H A D | tree.c | 3999 xmlNodePtr root = target; local 4002 while (root->parent != NULL) { 4003 pred = root; 4004 root = root->parent; 4006 if (root == (xmlNodePtr) target->doc) { 4008 root = pred; 4010 ret->ns = xmlNewNs(root, ns->href, ns->prefix); 4240 xmlNodePtr root = ret; local 4242 while (root 4888 xmlDocSetRootElement(xmlDocPtr doc, xmlNodePtr root) argument [all...] |
H A D | valid.c | 262 * set of nodes currently open from the document root to the current element. 6295 * Try to validate a the root element 6306 xmlNodePtr root; local 6311 root = xmlDocGetRootElement(doc); 6312 if ((root == NULL) || (root->name == NULL)) { 6314 "no root element\n", NULL); 6325 * Check first the document root against the NQName 6327 if (!xmlStrEqual(doc->intSubset->name, root->name)) { 6328 if ((root 6616 xmlNodePtr root; local 6803 xmlNodePtr root; local [all...] |
H A D | xmllint.c | 1994 xmlNodePtr root; local 1999 root = xmlDocGetRootElement(doc); 2000 for (ns = root->nsDef, i = 0;ns != NULL && i < 20;ns=ns->next) { 2480 fprintf(stderr, "No element can be inserted under root\n"); 2482 fprintf(stderr, "%d element types can be inserted under root:\n",
|
H A D | xmlschemas.c | 9529 * @node: the root of the document. 9534 xmlSchemaCleanupDoc(xmlSchemaParserCtxtPtr ctxt, xmlNodePtr root) argument 9538 if ((ctxt == NULL) || (root == NULL)) return; 9544 cur = root; 9584 if (cur == root) { 25563 * root node if no namespace declaration is in scope. 26436 * Skip further processing if we are on the validation root. 26463 * VAL TODO: 7 If the element information item is the �validation root�, it must be 26486 "not intended for the validation root"); 26891 * Get the declaration of the validation root [all...] |
H A D | xpath.c | 2981 xmlNodePtr cur, root; local 3045 * compute depth to root 3052 root = cur; 3061 if (root != cur) { 3130 xmlNodePtr cur, root; local 3337 * compute depth to root 3344 root = cur; 3353 if (root != cur) { 4351 * it with the tree root @val 8268 /* avoid searching if ancestor or node is the root nod [all...] |
/external/linux-tools-perf/perf-3.12.0/include/linux/ |
H A D | rbtree_augmented.h | 44 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, 47 rb_insert_augmented(struct rb_node *node, struct rb_root *root, argument 50 __rb_insert_augmented(node, root, augment->rotate); 112 struct rb_node *parent, struct rb_root *root) 120 root->rb_node = new; 123 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root, 127 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, argument 144 __rb_change_child(node, child, parent, root); 155 __rb_change_child(node, tmp, parent, root); 206 __rb_change_child(node, successor, tmp, root); 111 __rb_change_child(struct rb_node *old, struct rb_node *new, struct rb_node *parent, struct rb_root *root) argument 224 rb_erase_augmented(struct rb_node *node, struct rb_root *root, const struct rb_augment_callbacks *augment) argument [all...] |
/external/linux-tools-perf/perf-3.12.0/lib/ |
H A D | rbtree.c | 31 * 2) The root is black 34 * 5) Every simple path from root to leaves contains the same number 64 struct rb_root *root, int color) 69 __rb_change_child(old, new, parent, root); 73 __rb_insert(struct rb_node *node, struct rb_root *root, argument 84 * want a red root or two consecutive red nodes. 156 __rb_rotate_set_parents(gparent, parent, root, RB_RED); 190 __rb_rotate_set_parents(gparent, parent, root, RB_RED); 202 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, argument 211 * - node is not the root (paren 63 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, struct rb_root *root, int color) argument 364 __rb_erase_color(struct rb_node *parent, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) argument 386 rb_insert_color(struct rb_node *node, struct rb_root *root) argument 392 rb_erase(struct rb_node *node, struct rb_root *root) argument 408 __rb_insert_augmented(struct rb_node *node, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) argument 418 rb_first(const struct rb_root *root) argument 431 rb_last(const struct rb_root *root) argument 505 rb_replace_node(struct rb_node *victim, struct rb_node *new, struct rb_root *root) argument 553 rb_first_postorder(const struct rb_root *root) argument [all...] |
/external/linux-tools-perf/perf-3.12.0/tools/perf/ |
H A D | builtin-diff.c | 399 struct rb_root *root; local 403 root = &hists->entries_collapsed; 405 root = hists->entries_in; 407 next = rb_first(root); 413 rb_erase(&he->rb_node_in, root); 421 struct rb_root *root; local 425 root = &hists->entries_collapsed; 427 root = hists->entries_in; 429 next = rb_first(root); 529 static void insert_hist_entry_by_compute(struct rb_root *root, argument 552 struct rb_root *root; local [all...] |
H A D | builtin-kmem.c | 252 struct rb_root *root, 255 struct rb_node *node = root->rb_node; 341 static void __print_result(struct rb_root *root, struct perf_session *session, argument 352 next = rb_first(root); 424 static void sort_insert(struct rb_root *root, struct alloc_stat *data, argument 427 struct rb_node **new = &(root->rb_node); 451 rb_insert_color(&data->node, root); 454 static void __sort_result(struct rb_root *root, struct rb_root *root_sorted, argument 461 node = rb_first(root); 465 rb_erase(node, root); 250 search_alloc_stat(unsigned long ptr, unsigned long call_site, struct rb_root *root, sort_fn_t sort_fn) argument [all...] |
/external/libvorbis/lib/ |
H A D | lsp.c | 26 an iterative root polisher (CACM algorithm 283). It *is* possible 302 /* Newton-Raphson-Maehly actually functioned as a decent root finder, 303 but there are root sets for which it gets into limit cycles 319 /* iterate a root */ 333 return(-1); /* complex root! The LPC generator handed us a bad filter */ 369 double *root=alloca(ord*sizeof(*root)); local 371 for(i=0; i<ord;i++) root[i] = r[i]; 378 double rooti=root[i]; 387 root[ [all...] |
/external/libpcap/ |
H A D | gencode.c | 167 static struct block *root; variable in typeref:struct:block 445 root = NULL; 476 if (root == NULL) 477 root = gen_retblk(snaplen); 480 bpf_optimize(&root); 481 if (root == NULL || 482 (root->s.code == (BPF_RET|BPF_K) && root->s.k == 0)) 485 program->bf_insns = icode_to_fcode(root, &len); 576 * Insert before the statements of the first (root) bloc [all...] |
H A D | optimize.c | 216 * N_LEVELS at the root. The levels[] array points to the 221 find_levels(struct block *root) argument 225 find_levels_r(root); 233 find_dom(struct block *root) argument 248 root->dom[i] = 0; 250 /* root->level is the highest level no found. */ 251 for (i = root->level; i >= 0; --i) { 277 find_edom(struct block *root) argument 287 /* root->level is the highest level no found. */ 288 memset(root 306 find_closure(struct block *root) argument 478 find_ud(struct block *root) argument 1557 opt_blks(struct block *root, int do_stmts) argument 1601 find_inedges(struct block *root) argument 1646 opt_loop(struct block *root, int do_stmts) argument 1678 struct block *root; local 1760 intern_blocks(struct block *root) argument 1897 opt_init(struct block *root) argument 2167 icode_to_fcode(struct block *root, u_int *lenp) argument 2237 opt_dump(struct block *root) argument [all...] |
/external/libpng/contrib/gregbook/ |
H A D | rpng-x.c | 436 Window root; local 450 root = RootWindow(display, screen); 509 colormap = XCreateColormap(display, root, visual, AllocNone); 551 window = XCreateWindow(display, root, 0, 0, image_width, image_height, 0,
|
H A D | rpng2-x.c | 811 Window root; local 827 root = RootWindow(display, screen); 872 colormap = XCreateColormap(display, root, visual, AllocNone); 909 window = XCreateWindow(display, root, 0, 0, rpng2_info.width,
|
/external/libnl/lib/route/cls/ |
H A D | ematch.c | 227 struct nl_list_head *root) 235 nl_list_add_tail(&ematch->e_list, root); 226 link_tree(struct rtnl_ematch *index[], int nmatches, int pos, struct nl_list_head *root) argument
|
/external/libcxx/test/containers/associative/ |
H A D | tree_balance_after_insert.pass.cpp | 34 Node root; local 40 root.__left_ = &c; 42 c.__parent_ = &root; 62 std::__tree_balance_after_insert(root.__left_, &a); 64 assert(std::__tree_invariant(root.__left_)); 66 assert(root.__left_ == &c); 68 assert(c.__parent_ == &root); 89 Node root; local 95 root.__left_ = &c; 97 c.__parent_ = &root; 144 Node root; local 199 Node root; local 254 Node root; local 329 Node root; local 404 Node root; local 479 Node root; local 559 Node root; local 603 Node root; local 647 Node root; local 719 Node root; local 796 Node root; local 840 Node root; local 884 Node root; local 956 Node root; local 1032 Node root; local 1322 Node root; local [all...] |
H A D | tree_left_rotate.pass.cpp | 32 Node root; local 35 root.__left_ = &x; 38 x.__parent_ = &root; 43 assert(root.__parent_ == 0); 44 assert(root.__left_ == &y); 45 assert(root.__right_ == 0); 46 assert(y.__parent_ == &root); 57 Node root; local 63 root.__left_ = &x; 66 x.__parent_ = &root; [all...] |