| /external/e2fsprogs/e2fsck/ |
| dict.c | 74 static void dnode_free(dnode_t *node, void *context);
77 * Perform a ``left rotation'' adjustment on the tree. The given node P and
93 /* don't need to check for root node here because root->parent is
94 the sentinel nil node, and root->parent->left points back to root */
135 * node and free everything under it. Used by dict_free().
138 static void free_nodes(dict_t *dict, dnode_t *node, dnode_t *nil)
140 if (node == nil)
142 free_nodes(dict, node->left, nil);
143 free_nodes(dict, node->right, nil);
144 dict->freenode(node, dict->context)
836 dnode_t *node = dict->allocnode(dict->context); local
1032 dnode_t *node = dict_first(dict), *next; local
[all...] |
| /external/fio/ |
| graph.c | 54 struct prio_tree_node node; member in struct:graph_value
693 prio_tree_remove(&l->prio_tree, &v->node);
737 INIT_PRIO_TREE_NODE(&x->node);
738 x->node.start = minx;
739 x->node.last = maxx;
741 if (x->node.last == x->node.start) {
742 x->node.last += fabs(g->xtick_delta);
743 if (x->node.last == x->node.start
858 struct flist_head *node; local
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationbuilder.cpp | 315 int64_t node = nodes.elementAti(index); local
316 // If the index is for a "weaker" tailored node,
318 while(strengthFromNode(node) > strength) {
319 index = previousIndexFromNode(node);
320 node = nodes.elementAti(index);
323 // Find or insert a node whose index we will put into a temporary CE.
324 if(strengthFromNode(node) == strength && isTailoredNode(node)) {
325 // Reset to just before this same-strength tailored node.
326 index = previousIndexFromNode(node);
491 int64_t node = nodes.elementAti(index); local
510 int64_t node = nodes.elementAti(index); local
579 int64_t node = nodes.elementAti(index); local
828 int64_t node = nodes[rootPrimaryIndexes[i]]; local
879 int64_t node = nodes.elementAti(index); local
917 int64_t node = nodes.elementAti(index); local
955 int64_t node = nodes.elementAti(index); local
1360 int64_t node = nodesArray[i]; local
1524 int64_t node = nodesArray[i]; local
[all...] |
| plurrule.cpp | 1375 RuleChain *node=header; local
[all...] |
| /external/jemalloc/src/ |
| ctl.c | 21 ctl_named_node(const ctl_node_t *node)
24 return ((node->named) ? (const ctl_named_node_t *)node : NULL);
28 ctl_named_children(const ctl_named_node_t *node, int index)
30 const ctl_named_node_t *children = ctl_named_node(node->children);
36 ctl_indexed_node(const ctl_node_t *node)
39 return ((node->named == false) ? (const ctl_indexed_node_t *)node :
729 const ctl_named_node_t *node; local
739 node = super_root_node
827 const ctl_named_node_t *node; local
871 const ctl_named_node_t *node; local
[all...] |
| /external/libsepol/src/ |
| write.c | 66 for (n = e->node; n; n = n->next)
74 for (n = e->node; n; n = n->next) {
103 avtab_ptr_t node; local
142 for (node = avtab_search_node_next(cur, lookup);
143 node;
144 node = avtab_search_node_next(node, lookup)) {
145 val |= (node->key.specified & ~AVTAB_ENABLED);
147 if (node->key.specified & AVTAB_ENABLED)
172 node = cur
1557 ebitmap_node_t *node; local
[all...] |
| /external/libxml2/ |
| debugXML.c | 46 xmlNodePtr node; /* current node */ member in struct:_xmlDebugCtxt
54 static void xmlCtxtDumpNodeList(xmlDebugCtxtPtr ctxt, xmlNodePtr node);
66 ctxt->node = NULL;
83 * @node: the node
84 * @ns: the namespace node
86 * Check that a given namespace is in scope on a node.
90 * an ancestor node.
93 xmlNsCheckScope(xmlNodePtr node, xmlNsPtr ns
2685 xmlNodePtr node; local
[all...] |
| pattern.c | 20 * and indicating we are on / (the document node), probably need
67 * xmlElementType enums, to indicate a node of any type.
95 int nodeType; /* type of node */
142 xmlNodePtr node; member in struct:_xmlStepState
184 xmlNodePtr elem; /* the current node if any */
464 xmlPatPushState(xmlStepStates *states, int step, xmlNodePtr node) {
481 states->states[states->nbstates++].node = node;
483 fprintf(stderr, "Push: %d, %s\n", step, node->name);
491 * @node: a nod
[all...] |
| schematron.c | 12 * - multiple rules applying in a single pattern/node
47 #define IS_SCHEMATRON(node, elem) \
48 ((node != NULL) && (node->type == XML_ELEMENT_NODE ) && \
49 (node->ns != NULL) && \
50 (xmlStrEqual(node->name, (const xmlChar *) elem)) && \
51 ((xmlStrEqual(node->ns->href, xmlSchematronNs)) || \
52 (xmlStrEqual(node->ns->href, xmlOldSchematronNs))))
54 #define NEXT_SCHEMATRON(node) \
55 while (node != NULL) {
88 xmlNodePtr node; \/* the node in the tree *\/ member in struct:_xmlSchematronTest
104 xmlNodePtr node; \/* the node in the tree *\/ member in struct:_xmlSchematronRule
1243 xmlNodePtr node = NULL; local
1294 xmlNodePtr child, node; local
[all...] |
| xinclude.c | 57 xmlNodePtr ref; /* the node making the reference in the source */
107 xmlXIncludeErrMemory(xmlXIncludeCtxtPtr ctxt, xmlNodePtr node,
112 __xmlRaiseError(NULL, NULL, NULL, ctxt, node, XML_FROM_XINCLUDE,
121 * @node: the context node
128 xmlXIncludeErr(xmlXIncludeCtxtPtr ctxt, xmlNodePtr node, int error,
133 __xmlRaiseError(NULL, NULL, NULL, ctxt, node, XML_FROM_XINCLUDE,
143 * @node: the context node
150 xmlXIncludeWarn(xmlXIncludeCtxtPtr ctxt, xmlNodePtr node, int error
1693 xmlNodePtr node; local
1796 xmlNodePtr node; local
[all...] |
| xpointer.c | 107 ctxt->context->lastError.node = ctxt->context->debugNode;
130 * @cur: the node
152 * @cur: the node
154 * Returns the index of the node in its parent children list, -1
174 * @cur: the node
207 * @node1: the first node
209 * @node2: the second node
236 * @node: the xmlNodePtr
237 * @indx: the indx within the node
244 xmlXPtrNewPoint(xmlNodePtr node, int indx)
1832 xmlNodePtr node = tmp->user; local
1922 xmlNodePtr node = tmp->user2; local
1981 xmlNodePtr node = (xmlNodePtr) loc->user; local
2090 xmlNodePtr node = (xmlNodePtr) loc->user; local
2118 xmlNodePtr node = (xmlNodePtr) loc->user; local
[all...] |
| /external/libxml2/include/libxml/ |
| xpath.h | 77 * A node-set (an unordered collection of nodes without duplicates).
91 * - node-set
185 * @cur: the previous node being explored on that axis
191 * Returns the next node in that axis or NULL if at the end of the axis.
276 * - a node (the context node)
277 * - a node list (the context node list)
283 * The node may be modified when the context is passed to libxml2
290 xmlNodePtr node; /* The current node * member in struct:_xmlXPathContext
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/ |
| builtin-kmem.c | 46 struct rb_node node; member in struct:alloc_stat
57 #define PATH_SYS_NODE "/sys/devices/system/node"
108 sscanf(dent1->d_name, "node%u", &mem) < 1)
130 struct rb_node **node = &root_alloc_stat.rb_node; local
134 while (*node) {
135 parent = *node;
136 data = rb_entry(*node, struct alloc_stat, node);
139 node = &(*node)->rb_right
173 struct rb_node **node = &root_caller_stat.rb_node; local
255 struct rb_node *node = root->rb_node; local
457 struct rb_node *node; local
[all...] |
| builtin-lock.c | 117 struct rb_node *node; local
120 node = thread_stats.rb_node;
121 while (node) {
122 st = container_of(node, struct thread_stat, rb);
126 node = node->rb_left;
128 node = node->rb_right;
296 struct rb_node *node = result.rb_node; local
298 if (!node)
756 struct rb_node *node; local
[all...] |
| builtin-script.c | 576 struct list_head node; member in struct:script_spec
598 list_add_tail(&s->node, &script_specs);
605 list_for_each_entry(s, &script_specs, node)
660 list_for_each_entry(s, &script_specs, node)
857 struct list_head node; member in struct:script_desc
885 list_add_tail(&s->node, &script_descs);
892 list_for_each_entry(s, &script_descs, node)
1031 list_for_each_entry(desc, &script_descs, node) {
1085 &session->evlist->entries, node) {
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| annotate.c | 594 list_add_tail(&line->node, head);
599 list_for_each_entry_continue(pos, head, node)
686 list_for_each_entry_from(queue, ¬es->src->source, node) {
856 dl = list_entry(list->prev, struct disasm_line, node);
868 list_del(&dl->node);
989 iter = rb_entry(parent, struct source_line, node);
1007 rb_link_node(&src_line->node, parent, p);
1008 rb_insert_color(&src_line->node, root);
1032 iter = rb_entry(parent, struct source_line, node);
1040 rb_link_node(&src_line->node, parent, p)
1047 struct rb_node *node; local
1166 struct rb_node *node; local
[all...] |
| machine.c | 53 list_for_each_entry_safe(pos, n, dsos, node) {
54 list_del(&pos->node);
63 list_for_each_entry_safe(t, n, &machine->dead_threads, node) {
64 list_del(&t->node);
244 struct rb_node *node; local
249 for (node = rb_first(&machines->guests); node; node = rb_next(node)) {
250 machine = rb_entry(node, struct machine, rb_node)
[all...] |
| probe-event.c | 144 list_for_each_entry(dso, &machine.kernel_dsos, node) {
559 struct str_node *node; local
587 strlist__for_each(node, vl->vars) {
588 var = strchr(node->s, '\t') + 1;
590 fprintf(stdout, "\t\t%s\n", node->s);
[all...] |
| session.c | 1511 struct callchain_cursor_node *node; local
[all...] |
| /external/mesa3d/src/glsl/ |
| ast_function.cpp | 85 foreach_list(node, parameters) {
86 const ir_variable *const param = (ir_variable *) node;
413 foreach_list (node, &f->signatures) {
414 ir_function_signature *sig = (ir_function_signature *) node;
659 foreach_list(node, &actual_parameters) {
660 ir_rvalue *rhs = (ir_rvalue *) node;
681 foreach_list(node, parameters) {
682 ir_constant *constant = ((ir_instruction *) node)->as_constant();
685 node->replace_with(constant);
756 foreach_list(node, parameters)
1183 exec_node *node = parameters->head; local
1270 exec_node *node = actual_parameters.head; local
[all...] |
| /external/mesa3d/src/mesa/main/ |
| attrib.c | 145 * Node for the attribute stack.
185 * Allocate new attribute node of given type/kind. Attach payload data.
1551 struct gl_attrib_node *node, *next; local
[all...] |
| /external/opencv/cv/src/ |
| cvhistogram.cpp | 207 CvSparseNode *node; local
209 for( node = cvInitSparseMatIterator( mat, &iterator );
210 node != 0; node = cvGetNextSparseNode( &iterator ))
212 float* val = (float*)CV_NODE_VAL( mat, node );
247 CvSparseNode *node; local
250 for( node = cvInitSparseMatIterator( mat, &iterator );
251 node != 0; node = cvGetNextSparseNode( &iterator ))
253 sum += *(float*)CV_NODE_VAL(mat,node);
340 CvSparseNode *node; local
1497 CvSparseNode* node; local
1535 CvSparseNode* node; local
[all...] |
| /external/opencv/cxcore/src/ |
| cxarray.cpp | 755 CvSparseNode* node = 0; local
770 iterator->node = 0;
775 node = iterator->node = (CvSparseNode*)mat->hashtable[idx];
783 return node;
800 CvSparseNode *node; local
821 for( node = (CvSparseNode*)mat->hashtable[tabidx];
822 node != 0; node = node->next
897 CvSparseNode *node, *prev = 0; local
[all...] |
| /external/opencv/ml/src/ |
| ml_inner_functions.cpp | 1258 CvSparseNode* node; local
[all...] |
| mlboost.cpp | 135 CvDTreeNode* node = root; local
137 // traverse the tree and scale all the node values
143 node->value *= scale;
144 if( !node->left )
146 node = node->left;
149 for( parent = node->parent; parent && parent->right == node;
150 node = parent, parent = parent->parent )
156 node = parent->right
[all...] |
