Searched refs:node (Results 1 - 25 of 810) sorted by relevance

1234567891011>>

/external/qemu/
H A Daio.c38 QLIST_ENTRY(AioHandler) node;
43 AioHandler *node; local
45 QLIST_FOREACH(node, &aio_handlers, node) {
46 if (node->fd == fd)
47 if (!node->deleted)
48 return node;
60 AioHandler *node; local
62 node = find_aio_handler(fd);
66 if (node) {
100 AioHandler *node; local
126 AioHandler *node; local
[all...]
H A Daio-android.c39 QLIST_ENTRY(AioHandler) node;
44 AioHandler *node; local
46 QLIST_FOREACH(node, &aio_handlers, node) {
47 if (node->fd == fd)
48 if (!node->deleted)
49 return node;
61 AioHandler *node; local
63 node = find_aio_handler(fd);
67 if (node) {
101 AioHandler *node; local
130 AioHandler *node; local
[all...]
/external/v8/src/
H A Drewriter.cc61 virtual void Visit##type(type* node);
84 void AstOptimizer::VisitBlock(Block* node) { argument
85 Optimize(node->statements());
89 void AstOptimizer::VisitExpressionStatement(ExpressionStatement* node) { argument
90 Visit(node->expression());
94 void AstOptimizer::VisitIfStatement(IfStatement* node) { argument
95 Visit(node->condition());
96 Visit(node->then_statement());
97 if (node->HasElseStatement()) {
98 Visit(node
103 VisitDoWhileStatement(DoWhileStatement* node) argument
109 VisitWhileStatement(WhileStatement* node) argument
117 VisitForStatement(ForStatement* node) argument
133 VisitForInStatement(ForInStatement* node) argument
140 VisitTryCatchStatement(TryCatchStatement* node) argument
147 VisitTryFinallyStatement(TryFinallyStatement* node) argument
153 VisitSwitchStatement(SwitchStatement* node) argument
165 VisitContinueStatement(ContinueStatement* node) argument
170 VisitBreakStatement(BreakStatement* node) argument
175 VisitDeclaration(Declaration* node) argument
181 VisitEmptyStatement(EmptyStatement* node) argument
186 VisitReturnStatement(ReturnStatement* node) argument
191 VisitWithEnterStatement(WithEnterStatement* node) argument
196 VisitWithExitStatement(WithExitStatement* node) argument
201 VisitDebuggerStatement(DebuggerStatement* node) argument
206 VisitFunctionLiteral(FunctionLiteral* node) argument
216 VisitFunctionBoilerplateLiteral( FunctionBoilerplateLiteral* node) argument
222 VisitConditional(Conditional* node) argument
229 VisitSlot(Slot* node) argument
234 VisitVariableProxy(VariableProxy* node) argument
251 VisitLiteral(Literal* node) argument
264 VisitRegExpLiteral(RegExpLiteral* node) argument
269 VisitArrayLiteral(ArrayLiteral* node) argument
275 VisitObjectLiteral(ObjectLiteral* node) argument
285 VisitCatchExtensionObject(CatchExtensionObject* node) argument
291 VisitAssignment(Assignment* node) argument
381 VisitThrow(Throw* node) argument
386 VisitProperty(Property* node) argument
392 VisitCall(Call* node) argument
398 VisitCallNew(CallNew* node) argument
404 VisitCallRuntime(CallRuntime* node) argument
415 VisitUnaryOperation(UnaryOperation* node) argument
420 VisitCountOperation(CountOperation* node) argument
428 VisitBinaryOperation(BinaryOperation* node) argument
489 VisitCompareOperation(CompareOperation* node) argument
524 VisitThisFunction(ThisFunction* node) argument
580 VisitBlock(Block* node) argument
593 VisitExpressionStatement(ExpressionStatement* node) argument
602 VisitIfStatement(IfStatement* node) argument
613 VisitIterationStatement(IterationStatement* node) argument
621 VisitDoWhileStatement(DoWhileStatement* node) argument
626 VisitWhileStatement(WhileStatement* node) argument
631 VisitForStatement(ForStatement* node) argument
636 VisitForInStatement(ForInStatement* node) argument
641 VisitTryCatchStatement(TryCatchStatement* node) argument
653 VisitTryFinallyStatement(TryFinallyStatement* node) argument
663 VisitSwitchStatement(SwitchStatement* node) argument
675 VisitContinueStatement(ContinueStatement* node) argument
680 VisitBreakStatement(BreakStatement* node) argument
686 VisitDeclaration(Declaration* node) argument
687 VisitEmptyStatement(EmptyStatement* node) argument
688 VisitReturnStatement(ReturnStatement* node) argument
689 VisitWithEnterStatement(WithEnterStatement* node) argument
690 VisitWithExitStatement(WithExitStatement* node) argument
691 VisitDebuggerStatement(DebuggerStatement* node) argument
695 VisitFunctionLiteral(FunctionLiteral* node) argument
701 VisitFunctionBoilerplateLiteral( FunctionBoilerplateLiteral* node) argument
708 VisitConditional(Conditional* node) argument
714 VisitSlot(Slot* node) argument
720 VisitVariableProxy(VariableProxy* node) argument
726 VisitLiteral(Literal* node) argument
732 VisitRegExpLiteral(RegExpLiteral* node) argument
738 VisitArrayLiteral(ArrayLiteral* node) argument
744 VisitObjectLiteral(ObjectLiteral* node) argument
750 VisitCatchExtensionObject(CatchExtensionObject* node) argument
756 VisitAssignment(Assignment* node) argument
762 VisitThrow(Throw* node) argument
768 VisitProperty(Property* node) argument
774 VisitCall(Call* node) argument
780 VisitCallNew(CallNew* node) argument
786 VisitCallRuntime(CallRuntime* node) argument
792 VisitUnaryOperation(UnaryOperation* node) argument
798 VisitCountOperation(CountOperation* node) argument
804 VisitBinaryOperation(BinaryOperation* node) argument
810 VisitCompareOperation(CompareOperation* node) argument
816 VisitThisFunction(ThisFunction* node) argument
[all...]
H A Dusage-analyzer.cc45 static bool Traverse(AstNode* node);
47 // AST node visit functions.
48 #define DECLARE_VISIT(type) void Visit##type(type* node);
86 bool UsageComputer::Traverse(AstNode* node) { argument
88 uc.Visit(node);
93 void UsageComputer::VisitBlock(Block* node) { argument
94 VisitStatements(node->statements());
98 void UsageComputer::VisitDeclaration(Declaration* node) { argument
99 Write(node->proxy());
100 if (node
105 VisitExpressionStatement(ExpressionStatement* node) argument
110 VisitEmptyStatement(EmptyStatement* node) argument
115 VisitIfStatement(IfStatement* node) argument
124 VisitContinueStatement(ContinueStatement* node) argument
129 VisitBreakStatement(BreakStatement* node) argument
134 VisitReturnStatement(ReturnStatement* node) argument
139 VisitWithEnterStatement(WithEnterStatement* node) argument
144 VisitWithExitStatement(WithExitStatement* node) argument
149 VisitSwitchStatement(SwitchStatement* node) argument
162 VisitDoWhileStatement(DoWhileStatement* node) argument
169 VisitWhileStatement(WhileStatement* node) argument
176 VisitForStatement(ForStatement* node) argument
186 VisitForInStatement(ForInStatement* node) argument
194 VisitTryCatchStatement(TryCatchStatement* node) argument
203 VisitTryFinallyStatement(TryFinallyStatement* node) argument
209 VisitDebuggerStatement(DebuggerStatement* node) argument
213 VisitFunctionLiteral(FunctionLiteral* node) argument
220 VisitFunctionBoilerplateLiteral( FunctionBoilerplateLiteral* node) argument
226 VisitConditional(Conditional* node) argument
235 VisitSlot(Slot* node) argument
240 VisitVariable(Variable* node) argument
245 VisitVariableProxy(VariableProxy* node) argument
252 VisitLiteral(Literal* node) argument
256 VisitRegExpLiteral(RegExpLiteral* node) argument
261 VisitObjectLiteral(ObjectLiteral* node) argument
266 VisitArrayLiteral(ArrayLiteral* node) argument
271 VisitCatchExtensionObject(CatchExtensionObject* node) argument
276 VisitAssignment(Assignment* node) argument
284 VisitThrow(Throw* node) argument
289 VisitProperty(Property* node) argument
304 VisitCall(Call* node) argument
310 VisitCallNew(CallNew* node) argument
316 VisitCallRuntime(CallRuntime* node) argument
321 VisitUnaryOperation(UnaryOperation* node) argument
326 VisitCountOperation(CountOperation* node) argument
332 VisitBinaryOperation(BinaryOperation* node) argument
338 VisitCompareOperation(CompareOperation* node) argument
344 VisitThisFunction(ThisFunction* node) argument
[all...]
/external/webkit/JavaScriptCore/API/tests/
H A DNode.c32 Node* node = (Node*)malloc(sizeof(Node)); local
33 node->refCount = 0;
34 node->nodeType = "Node";
35 node->childNodesTail = NULL;
37 return node;
40 void Node_appendChild(Node* node, Node* child) argument
44 nodeLink->node = child;
45 nodeLink->prev = node->childNodesTail;
46 node->childNodesTail = nodeLink;
49 void Node_removeChild(Node* node, Nod argument
64 Node_replaceChild(Node* node, Node* newChild, Node* oldChild) argument
76 Node_ref(Node* node) argument
81 Node_deref(Node* node) argument
[all...]
H A DNode.h33 Node* node; member in struct:__NodeLink
44 extern void Node_ref(Node* node);
45 extern void Node_deref(Node* node);
46 extern void Node_appendChild(Node* node, Node* child);
47 extern void Node_removeChild(Node* node, Node* child);
48 extern void Node_replaceChild(Node* node, Node* newChild, Node* oldChild);
/external/libvpx/examples/includes/ASCIIMathPHP-2.0/
H A DhtmlMathML.js11 function convertMath(node) {// for Gecko
12 if (node.nodeType==1) {
15 node.nodeName.toLowerCase());
16 for(var i=0; i < node.attributes.length; i++) {
17 if (node.attributes[i].nodeName == 'displaystyle') {
18 newnode.setAttribute(node.attributes[i].nodeName,node.attributes[i].nodeValue);
21 for (var i=0; i<node.childNodes.length; i++) {
22 var st = node.childNodes[i].nodeValue;
24 newnode.appendChild(convertMath(node
[all...]
/external/chromium/net/disk_cache/
H A Dmem_rankings.cc16 void MemRankings::Insert(MemEntryImpl* node) { argument
18 head_->set_prev(node);
21 tail_ = node;
23 node->set_prev(NULL);
24 node->set_next(head_);
25 head_ = node;
28 void MemRankings::Remove(MemEntryImpl* node) { argument
29 MemEntryImpl* prev = node->prev();
30 MemEntryImpl* next = node->next();
32 if (head_ == node)
48 UpdateRank(MemEntryImpl* node) argument
53 GetNext(MemEntryImpl* node) argument
60 GetPrev(MemEntryImpl* node) argument
[all...]
H A Dmem_rankings.h23 void Insert(MemEntryImpl* node);
26 void Remove(MemEntryImpl* node);
29 void UpdateRank(MemEntryImpl* node);
32 MemEntryImpl* GetNext(MemEntryImpl* node);
33 MemEntryImpl* GetPrev(MemEntryImpl* node);
/external/webkit/WebCore/xml/
H A DXMLSerializer.cpp29 String XMLSerializer::serializeToString(Node* node, ExceptionCode& ec) argument
31 if (!node)
34 if (!node->document()) {
37 // with it. It should be the only type of node where this is possible.
38 ASSERT(node->nodeType() == Node::DOCUMENT_TYPE_NODE);
44 return createMarkup(node);
H A DXPathUtil.cpp37 bool isRootDomNode(Node* node) argument
39 return node && !node->parentNode();
42 String stringValue(Node* node) argument
44 switch (node->nodeType()) {
51 return node->nodeValue();
53 if (isRootDomNode(node) || node->nodeType() == Node::ELEMENT_NODE) {
57 for (Node* n = node->firstChild(); n; n = n->traverseNextNode(node)) {
71 isValidContextNode(Node* node) argument
[all...]
/external/webkit/WebCore/dom/
H A DNodeIterator.cpp40 : node(n)
47 node.clear();
52 if (!node)
58 node = node->traverseNextNode(root);
59 return node;
64 if (!node)
70 node = node->traversePreviousNode(root);
71 return node;
174 Node* node = removedNode->traverseNextNode(root()); local
203 Node* node = removedNode->traversePreviousNode(root()); local
[all...]
H A DTreeWalker.cpp42 void TreeWalker::setCurrentNode(PassRefPtr<Node> node, ExceptionCode& ec) argument
44 if (!node) {
48 m_current = node;
51 inline Node* TreeWalker::setCurrent(PassRefPtr<Node> node) argument
53 m_current = node;
59 RefPtr<Node> node = m_current; local
60 while (node != root()) {
61 node = node->parentNode();
62 if (!node)
141 RefPtr<Node> node = m_current; local
177 RefPtr<Node> node = m_current; local
213 RefPtr<Node> node = m_current; local
252 RefPtr<Node> node = m_current; local
[all...]
H A DNodeFilter.cpp32 short NodeFilter::acceptNode(ScriptState* state, Node* node) const
35 return m_condition ? m_condition->acceptNode(state, node) : static_cast<short>(FILTER_ACCEPT);
/external/webkit/WebCore/accessibility/
H A DAccessibilityList.cpp75 Node* node = m_renderer->node();
83 return node && node->hasTagName(ulTag);
95 Node* node = m_renderer->node();
96 return node && node->hasTagName(olTag);
104 Node* node = m_renderer->node();
[all...]
/external/webkit/WebCore/bindings/objc/
H A DObjCNodeFilterCondition.mm40 short ObjCNodeFilterCondition::acceptNode(ExecState*, Node* node) const
42 if (!node)
44 return [m_filter.get() acceptNode:kit(node)];
/external/webkit/WebCore/platform/
H A DDeprecatedPtrListImpl.cpp49 DeprecatedListNode *node = l; local
53 while (node != 0) {
54 DeprecatedListNode *copy = new DeprecatedListNode(node->data);
64 node = node->next;
99 ASSERT(!it->node);
109 for (DeprecatedListNode *node = head; node; node = next) {
110 next = node
127 DeprecatedListNode *node; local
147 DeprecatedListNode *node = new DeprecatedListNode(const_cast<void*>(item)); local
191 DeprecatedListNode *node = cur; local
252 DeprecatedListNode *node; local
365 DeprecatedListNode *node = head; local
[all...]
/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/webkit/WebCore/editing/
H A Dhtmlediting.cpp60 // Atomic means that the node has no children, or has children which are ignored for the
62 bool isAtomicNode(const Node *node) argument
64 return node && (!node->hasChildNodes() || editingIgnoresContent(node));
69 bool editingIgnoresContent(const Node* node) argument
71 return !canHaveChildrenForEditing(node) && !node->isTextNode();
74 bool canHaveChildrenForEditing(const Node* node) argument
76 return !node
137 Node* node = position.node(); local
157 lowestEditableAncestor(Node* node) argument
176 Node* node = p.node(); local
188 Node* node = pos.node(); local
195 Node* node = p.node(); local
207 Node* node = p.node(); local
321 isBlock(const Node* node) argument
330 enclosingBlock(Node* node) argument
387 lastOffsetForEditing(const Node* node) argument
428 isTableStructureNode(const Node *node) argument
596 visiblePositionBeforeNode(Node* node) argument
606 visiblePositionAfterNode(Node* node) argument
734 enclosingList(Node* node) argument
751 enclosingListChild(Node *node) argument
814 outermostEnclosingList(Node* node) argument
836 highestAncestor(Node* node) argument
855 isTableCell(const Node* node) argument
864 isEmptyTableCell(const Node* node) argument
904 isTabSpanNode(const Node *node) argument
909 isTabSpanTextNode(const Node *node) argument
914 tabSpanNode(const Node *node) argument
919 isNodeInTextFormControl(Node* node) argument
931 Node *node = pos.node(); local
968 isNodeRendered(const Node *node) argument
980 nearestMailBlockquote(const Node *node) argument
999 isMailBlockquote(const Node *node) argument
1093 isNodeVisiblyContainedWithin(Node* node, const Range* selectedRange) argument
1107 isRenderedAsNonInlineTableImageOrHR(const Node* node) argument
1115 avoidIntersectionWithNode(const Range* range, Node* node) argument
1146 avoidIntersectionWithNode(const VisibleSelection& selection, Node* node) argument
[all...]
/external/kernel-headers/original/asm-generic/
H A Dtopology.h36 #define parent_node(node) (0)
39 #define node_to_cpumask(node) (cpu_online_map)
42 #define node_to_first_cpu(node) (0)
45 #define pcibus_to_node(node) (-1)
/external/kernel-headers/original/linux/
H A Dnode.h2 * include/linux/node.h - generic node definition
5 * basic 'struct node' here, which can be embedded in per-arch
8 * Basic handling of the devices is done in drivers/base/node.c
11 * Nodes are exported via driverfs in the class/node/devices/
14 * Per-node interfaces can be implemented using a struct device_interface.
25 struct node { struct
29 extern struct node node_devices[];
31 extern int register_node(struct node *, int, struct node *);
[all...]
/external/bluetooth/glib/glib/
H A Dgnode.h60 typedef gboolean (*GNodeTraverseFunc) (GNode *node,
62 typedef void (*GNodeForeachFunc) (GNode *node,
70 * A function of this signature is used to copy the node data
93 * @node: a #GNode
100 #define G_NODE_IS_ROOT(node) (((GNode*) (node))->parent == NULL && \
101 ((GNode*) (node))->prev == NULL && \
102 ((GNode*) (node))->next == NULL)
106 * @node: a #GNode
108 * Returns %TRUE if a #GNode is a leaf node
[all...]
/external/skia/src/views/
H A DSkParsePaint.cpp7 static SkShader* inflate_shader(const SkDOM& dom, const SkDOM::Node* node) argument
9 if ((node = dom.getFirstChild(node, "shader")) == NULL)
14 if (dom.hasAttr(node, "type", "linear-gradient"))
20 if ((str = dom.findAttr(node, "c0")) != NULL &&
22 (str = dom.findAttr(node, "c1")) != NULL &&
24 dom.findScalars(node, "p0", &pts[0].fX, 2) &&
25 dom.findScalars(node, "p1", &pts[1].fX, 2))
30 if ((index = dom.findList(node, "tile-mode", "clamp,repeat,mirror")) >= 0)
35 else if (dom.hasAttr(node, "typ
56 SkPaint_Inflate(SkPaint* paint, const SkDOM& dom, const SkDOM::Node* node) argument
[all...]
/external/skia/src/xml/
H A DSkDOM.cpp24 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node) argument
26 const char* elemName = dom.getName(node);
31 SkDOM::AttrIter iter(dom, node);
38 if ((node = dom.getFirstChild(node)) != NULL)
40 if (!this->parse(dom, node))
42 } while ((node = dom.getNextSibling(node)) != NULL);
89 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) const argument
91 SkASSERT(node);
103 getNextSibling(const Node* node, const char name[]) const argument
128 findAttr(const Node* node, const char name[]) const argument
150 getNextAttr(const Node* node, const Attr* attr) const argument
158 getAttrName(const Node* node, const Attr* attr) const argument
165 getAttrValue(const Node* node, const Attr* attr) const argument
174 AttrIter(const SkDOM&, const SkDOM::Node* node) argument
225 SkDOM::Node* node = (SkDOM::Node*)fAlloc->alloc(sizeof(SkDOM::Node) + attrCount * sizeof(SkDOM::Attr), local
318 walk_dom(const SkDOM& dom, const SkDOM::Node* node, SkXMLParser* parser) argument
340 copy(const SkDOM& dom, const SkDOM::Node* node) argument
353 countChildren(const Node* node, const char elem[]) const argument
370 findS32(const Node* node, const char name[], int32_t* value) const argument
376 findScalars(const Node* node, const char name[], SkScalar value[], int count) const argument
382 findHex(const Node* node, const char name[], uint32_t* value) const argument
388 findBool(const Node* node, const char name[], bool* value) const argument
394 findList(const Node* node, const char name[], const char list[]) const argument
400 hasAttr(const Node* node, const char name[], const char value[]) const argument
406 hasS32(const Node* node, const char name[], int32_t target) const argument
413 hasScalar(const Node* node, const char name[], SkScalar target) const argument
420 hasHex(const Node* node, const char name[], uint32_t target) const argument
427 hasBool(const Node* node, const char name[], bool target) const argument
444 dump(const Node* node, int level) const argument
[all...]
/external/webkit/WebCore/page/
H A DMouseEventWithHitTestResults.cpp38 Node* node = m_hitTestResult.innerNode(); local
39 if (!node)
41 if (node->inDocument())
42 return node;
44 Element* element = node->parentElement();
48 return node;

Completed in 2023 milliseconds

1234567891011>>