Searched refs:node (Results 26 - 50 of 3060) sorted by relevance

1234567891011>>

/external/fio/lib/
H A Drbtree.c25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) argument
27 struct rb_node *right = node->rb_right;
28 struct rb_node *parent = rb_parent(node);
30 if ((node->rb_right = right->rb_left))
31 rb_set_parent(right->rb_left, node);
32 right->rb_left = node;
38 if (node == parent->rb_left)
45 rb_set_parent(node, right);
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) argument
50 struct rb_node *left = node
71 rb_insert_color(struct rb_node *node, struct rb_root *root) argument
136 __rb_erase_color(struct rb_node *node, struct rb_node *parent, struct rb_root *root) argument
222 rb_erase(struct rb_node *node, struct rb_root *root) argument
304 rb_next(const struct rb_node *node) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DParentNode.h42 static PassRefPtrWillBeRawPtr<HTMLCollection> children(ContainerNode& node) argument
44 return node.children();
47 static Element* firstElementChild(ContainerNode& node) argument
49 return ElementTraversal::firstChild(node);
52 static Element* lastElementChild(ContainerNode& node) argument
54 return ElementTraversal::lastChild(node);
57 static unsigned childElementCount(ContainerNode& node) argument
60 for (Element* child = ElementTraversal::firstChild(node); child; child = ElementTraversal::nextSibling(*child))
65 static PassRefPtrWillBeRawPtr<Element> querySelector(ContainerNode& node, const AtomicString& selectors, ExceptionState& exceptionState) argument
67 return node
70 querySelectorAll(ContainerNode& node, const AtomicString& selectors, ExceptionState& exceptionState) argument
[all...]
/external/chromium_org/third_party/bintrees/bintrees/
H A Dcwalker.pyx17 self.node = NULL
29 self.node = self.root
33 return <object> self.node.key
37 return <object> self.node.value
41 return (<object>self.node.key, <object>self.node.value)
45 return self.node != NULL
49 self.node = self.root
50 while self.node != NULL:
51 cval = ct_compare(key, <object> self.node
[all...]
H A Dbintree.py51 A binary tree is a tree data structure in which each node has at most two
70 def _clear(node):
71 if node is not None:
72 _clear(node.left)
73 _clear(node.right)
74 node.free()
81 """ root node of T """
90 """ Create a new tree node. """
101 node = self._root
103 if node i
[all...]
/external/chromium_org/third_party/cython/src/Cython/Compiler/
H A DCodeGeneration.py24 def visit_FuncDefNode(self, node):
25 self.funcs.append(node)
28 return node
30 def visit_Node(self, node):
31 self.visitchildren(node)
32 return node
/external/chromium_org/v8/src/compiler/
H A Dnode-properties.h8 #include "src/compiler/node.h"
17 // A facade that simplifies access to the different kinds of inputs to a node.
20 static inline Node* GetValueInput(Node* node, int index);
21 static inline Node* GetContextInput(Node* node);
22 static inline Node* GetFrameStateInput(Node* node);
23 static inline Node* GetEffectInput(Node* node, int index = 0);
24 static inline Node* GetControlInput(Node* node, int index = 0);
26 static inline int GetFrameStateIndex(Node* node);
33 static inline bool IsControl(Node* node);
35 static inline void ReplaceControlInput(Node* node, Nod
[all...]
/external/chromium_org/ppapi/generators/
H A Didl_ast.py21 def Depart(self, node, ignore, childdata):
23 if node.IsA('LabelItem'):
24 channel = node.GetProperty('channel')
27 return (node.GetName(), node.GetProperty('VALUE'), channel)
31 if node.IsA('Label') and node.GetName() == GetOption('label'):
33 node.parent.release_map = IDLReleaseMap(childdata)
35 node.Error('Unable to build release map: %s' % str(err))
38 if node
[all...]
H A Didl_visitor.py12 # node, the visitor will call the 'Arrive' member passing in the node and
24 # Return TRUE if the node should be visited
25 def VisitFilter(self, node, data):
28 def Visit(self, node, data):
29 if not self.VisitFilter(node, data): return None
32 newdata = self.Arrive(node, data)
33 for child in node.GetChildren():
37 return self.Depart(node, newdata, childdata)
39 def Arrive(self, node, dat
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/
H A DTypeResolver.java20 import com.google.clearsilver.jsilver.syntax.node.AAddExpression;
21 import com.google.clearsilver.jsilver.syntax.node.ADecimalExpression;
22 import com.google.clearsilver.jsilver.syntax.node.ADivideExpression;
23 import com.google.clearsilver.jsilver.syntax.node.AEqExpression;
24 import com.google.clearsilver.jsilver.syntax.node.AFunctionExpression;
25 import com.google.clearsilver.jsilver.syntax.node.AHexExpression;
26 import com.google.clearsilver.jsilver.syntax.node.AModuloExpression;
27 import com.google.clearsilver.jsilver.syntax.node.AMultiplyExpression;
28 import com.google.clearsilver.jsilver.syntax.node.ANameVariable;
29 import com.google.clearsilver.jsilver.syntax.node
78 caseAAddExpression(AAddExpression node) argument
88 caseAEqExpression(AEqExpression node) argument
98 caseANeExpression(ANeExpression node) argument
111 isNumeric(PExpression node) argument
127 isNumericFunction(PExpression node) argument
[all...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
H A Dcursor.js18 * Note: we cache the text of a particular node at the time we
21 * NOTE: Undefined behavior if node is null
22 * @param {Node} node The DOM node.
23 * @param {number} index The index of the character within the node.
24 * @param {string} text The cached text contents of the node.
27 cvox.Cursor = function(node, index, text) {
28 this.node = node;
37 return new cvox.Cursor(this.node, thi
[all...]
/external/chromium_org/native_client_sdk/src/libraries/nacl_io/syscalls/socket/
H A Dgetaddrinfo.c8 int getaddrinfo(const char *node, const char *service, argument
11 return ki_getaddrinfo(node, service, hints, res);
/external/chromium_org/third_party/angle/src/compiler/translator/
H A DDetectDiscontinuity.h22 bool traverse(TIntermNode *node);
25 bool visitBranch(Visit visit, TIntermBranch *node);
27 bool visitAggregate(Visit visit, TIntermAggregate *node);
33 bool containsLoopDiscontinuity(TIntermNode *node);
39 bool traverse(TIntermNode *node);
42 bool visitUnary(Visit visit, TIntermUnary *node);
43 bool visitAggregate(Visit visit, TIntermAggregate *node);
48 bool containsGradientOperation(TIntermNode *node);
H A DDetectDiscontinuity.cpp17 bool DetectLoopDiscontinuity::traverse(TIntermNode *node) argument
21 node->traverse(this);
39 bool DetectLoopDiscontinuity::visitBranch(Visit visit, TIntermBranch *node) argument
51 switch (node->getFlowOp())
66 bool DetectLoopDiscontinuity::visitAggregate(Visit visit, TIntermAggregate *node) argument
71 bool containsLoopDiscontinuity(TIntermNode *node) argument
74 return detectLoopDiscontinuity.traverse(node);
77 bool DetectGradientOperation::traverse(TIntermNode *node) argument
80 node->traverse(this);
84 bool DetectGradientOperation::visitUnary(Visit visit, TIntermUnary *node) argument
103 visitAggregate(Visit visit, TIntermAggregate *node) argument
134 containsGradientOperation(TIntermNode *node) argument
[all...]
H A DUnfoldShortCircuit.cpp24 void UnfoldShortCircuit::traverse(TIntermNode *node) argument
27 node->traverse(this);
31 bool UnfoldShortCircuit::visitBinary(Visit visit, TIntermBinary *node) argument
35 // If our right node doesn't have side effects, we know we don't need to unfold this
37 // (note: unfolding doesn't depend on the left node -- it will always be evaluated)
38 if (!node->getRight()->hasSideEffects())
43 switch (node->getOp())
56 node->getLeft()->traverse(this);
59 node->getLeft()->traverse(mOutputHLSL);
64 node
112 visitSelection(Visit visit, TIntermSelection *node) argument
157 visitLoop(Visit visit, TIntermLoop *node) argument
[all...]
/external/chromium_org/ui/base/models/
H A Dtree_model.cc11 void TreeModel::SetTitle(TreeModelNode* node, argument
16 int TreeModel::GetIconIndex(TreeModelNode* node) { argument
/external/lldb/test/functionalities/recursion/
H A Dmain.cpp14 struct node;
15 struct node { struct
17 node* next;
18 node () : value(1),next(NULL) {} function in struct:node
19 node (int v) : value(v), next(NULL) {} function in struct:node
22 void make_tree(node* root, int count)
30 root->next = new node(++countdown);
38 node root(1);
/external/blktrace/
H A Drbtree.c25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) argument
27 struct rb_node *right = node->rb_right;
28 struct rb_node *parent = rb_parent(node);
30 if ((node->rb_right = right->rb_left))
31 rb_set_parent(right->rb_left, node);
32 right->rb_left = node;
38 if (node == parent->rb_left)
45 rb_set_parent(node, right);
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) argument
50 struct rb_node *left = node
71 rb_insert_color(struct rb_node *node, struct rb_root *root) argument
136 __rb_erase_color(struct rb_node *node, struct rb_node *parent, struct rb_root *root) argument
222 rb_erase(struct rb_node *node, struct rb_root *root) argument
316 rb_next(struct rb_node *node) argument
344 rb_prev(struct rb_node *node) argument
[all...]
/external/ltrace/
H A Dexpr.c29 expr_init_common(struct expr_node *node, enum expr_node_kind kind) argument
31 node->kind = kind;
32 node->lhs = NULL;
33 node->own_lhs = 0;
34 memset(&node->u, 0, sizeof(node->u));
38 expr_init_self(struct expr_node *node) argument
40 expr_init_common(node, EXPR_OP_SELF);
44 expr_init_named(struct expr_node *node, argument
47 expr_init_common(node, EXPR_OP_NAME
53 expr_init_argno(struct expr_node *node, size_t num) argument
60 expr_init_const(struct expr_node *node, struct value *val) argument
67 expr_init_const_word(struct expr_node *node, long l, struct arg_type_info *type, int own_type) argument
77 expr_init_index(struct expr_node *node, struct expr_node *lhs, int own_lhs, struct expr_node *rhs, int own_rhs) argument
89 expr_init_up(struct expr_node *node, struct expr_node *lhs, int own_lhs) argument
98 expr_init_cb1(struct expr_node *node, int (*cb)(struct value *ret_value, struct value *value, struct value_dict *arguments, void *data), struct expr_node *lhs, int own_lhs, void *data) argument
111 expr_init_cb2(struct expr_node *node, int (*cb)(struct value *ret_value, struct value *lhs, struct value *rhs, struct value_dict *arguments, void *data), struct expr_node *lhs, int own_lhs, struct expr_node *rhs, int own_rhs, void *data) argument
128 release_expr(struct expr_node *node, int own) argument
137 expr_destroy(struct expr_node *node) argument
175 expr_alloc_and_clone(struct expr_node **retpp, struct expr_node *node, int own) argument
189 expr_clone(struct expr_node *retp, const struct expr_node *node) argument
254 expr_is_compile_constant(struct expr_node *node) argument
260 eval_up(struct expr_node *node, struct value *context, struct value_dict *arguments, struct value *ret_value) argument
275 eval_cb1(struct expr_node *node, struct value *context, struct value_dict *arguments, struct value *ret_value) argument
294 eval_cb2(struct expr_node *node, struct value *context, struct value_dict *arguments, struct value *ret_value) argument
320 eval_index(struct expr_node *node, struct value *context, struct value_dict *arguments, struct value *ret_value) argument
340 expr_eval(struct expr_node *node, struct value *context, struct value_dict *arguments, struct value *ret_value) argument
385 expr_eval_word(struct expr_node *node, struct value *context, struct value_dict *arguments, long *ret_value) argument
399 expr_eval_constant(struct expr_node *node, long *valuep) argument
410 static struct expr_node node; local
[all...]
/external/chromium_org/third_party/jinja2/
H A Doptimizer.py23 def optimize(node, environment):
27 return optimizer.visit(node)
35 def visit_If(self, node):
39 if node.find(nodes.Block) is not None:
40 return self.generic_visit(node)
42 val = self.visit(node.test).as_const()
44 return self.generic_visit(node)
46 body = node.body
48 body = node.else_
50 for node i
[all...]
H A Dvisitor.py16 node found. The visitor functions may return values which will be
20 class name of the node. So a `TryFinally` node visit function would
22 the `get_visitor` function. If no visitor function exists for a node
26 def get_visitor(self, node):
27 """Return the visitor function for this node or `None` if no visitor
28 exists for this node. In that case the generic visit function is
31 method = 'visit_' + node.__class__.__name__
34 def visit(self, node, *args, **kwargs):
35 """Visit a node
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/layers/
H A DLayerTreeOutline.js61 var node = layer && this._treeOutline.getCachedTreeElement(layer);
62 if (node)
63 node.revealAndSelect(true);
73 var node = layer && this._treeOutline.getCachedTreeElement(layer);
74 if (node === this._lastHoveredNode)
78 if (node)
79 node.setHovered(true);
80 this._lastHoveredNode = node;
99 var node = this._treeOutline.getCachedTreeElement(layer);
103 if (!node) {
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/
H A DALoopIncCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
67 public void setPosition(PPosition node) argument
74 if(node != null)
76 if(node.parent() != null)
78 node.parent().removeChild(node);
81 node.parent(this);
84 this._position_ = node;
92 public void setVariable(PVariable node) argument
99 if(node !
117 setStart(PExpression node) argument
142 setEnd(PExpression node) argument
167 setIncrement(PExpression node) argument
192 setCommand(PCommand node) argument
[all...]
/external/chromium_org/third_party/freetype/src/cache/
H A Dftcmru.c30 FTC_MruNode node )
47 if ( cnode == node )
58 first->prev = node;
59 last->next = node;
60 node->next = first;
61 node->prev = last;
65 node->next = node;
66 node->prev = node;
207 FTC_MruNode first, node; local
241 FTC_MruNode node = NULL; local
295 FTC_MruNode node; local
331 FTC_MruNode first, node, next; local
[all...]
/external/freetype/src/cache/
H A Dftcmru.c30 FTC_MruNode node )
47 if ( cnode == node )
58 first->prev = node;
59 last->next = node;
60 node->next = first;
61 node->prev = last;
65 node->next = node;
66 node->prev = node;
207 FTC_MruNode first, node; local
241 FTC_MruNode node = NULL; local
295 FTC_MruNode node; local
331 FTC_MruNode first, node, next; local
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Drbtree.c25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) argument
27 struct rb_node *right = node->rb_right;
28 struct rb_node *parent = ext2fs_rb_parent(node);
30 if ((node->rb_right = right->rb_left))
31 ext2fs_rb_set_parent(right->rb_left, node);
32 right->rb_left = node;
38 if (node == parent->rb_left)
45 ext2fs_rb_set_parent(node, right);
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) argument
50 struct rb_node *left = node
71 ext2fs_rb_insert_color(struct rb_node *node, struct rb_root *root) argument
136 __rb_erase_color(struct rb_node *node, struct rb_node *parent, struct rb_root *root) argument
216 ext2fs_rb_erase(struct rb_node *node, struct rb_root *root) argument
283 ext2fs_rb_augment_path(struct rb_node *node, rb_augment_f func, void *data) argument
306 ext2fs_rb_augment_insert(struct rb_node *node, rb_augment_f func, void *data) argument
320 ext2fs_rb_augment_erase_begin(struct rb_node *node) argument
345 ext2fs_rb_augment_erase_end(struct rb_node *node, rb_augment_f func, void *data) argument
378 ext2fs_rb_next(struct rb_node *node) argument
406 ext2fs_rb_prev(struct rb_node *node) argument
[all...]

Completed in 1512 milliseconds

1234567891011>>