| /external/qemu/ |
| aio.c | 38 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...] |
| aio-android.c | 39 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...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/ |
| CaptureRenderer.java | 25 private ViewNode node; field in class:CaptureRenderer
28 CaptureRenderer(ImageIcon icon, ViewNode node) {
30 this.node = node;
38 if (node.hasMargins) {
39 d.width += node.marginLeft + node.marginRight;
40 d.height += node.marginTop + node.marginBottom;
65 if ((node.paddingBottom | node.paddingLeft
[all...] |
| /system/core/sh/ |
| redir.h | 42 union node;
43 void redirect(union node *, int);
|
| nodes.h | 36 union node *ch1;
37 union node *ch2;
44 union node *args;
45 union node *redirect;
58 union node *n;
59 union node *redirect;
65 union node *test;
66 union node *ifpart;
67 union node *elsepart;
73 union node *args
134 union node { union
[all...] |
| /external/v8/src/ |
| rewriter.cc | 59 // Node visitors.
61 virtual void Visit##type(type* node);
84 void AstOptimizer::VisitBlock(Block* node) {
85 Optimize(node->statements());
89 void AstOptimizer::VisitExpressionStatement(ExpressionStatement* node) {
90 Visit(node->expression());
94 void AstOptimizer::VisitIfStatement(IfStatement* node) {
95 Visit(node->condition());
96 Visit(node->then_statement());
97 if (node->HasElseStatement())
[all...] |
| usage-analyzer.cc | 45 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) {
88 uc.Visit(node);
93 void UsageComputer::VisitBlock(Block* node) {
94 VisitStatements(node->statements());
98 void UsageComputer::VisitDeclaration(Declaration* node) {
99 Write(node->proxy());
100 if (node->fun() != NULL
[all...] |
| /external/webkit/JavaScriptCore/API/tests/ |
| Node.c | 26 #include "Node.h"
30 Node* Node_new(void)
32 Node* node = (Node*)malloc(sizeof(Node)); local
33 node->refCount = 0;
34 node->nodeType = "Node";
35 node->childNodesTail = NULL
[all...] |
| Node.h | 29 typedef struct __Node Node;
33 Node* node; member in struct:__NodeLink
43 extern Node* Node_new(void);
44 extern void Node_ref(Node* node);
45 extern void Node_deref(Node* node);
46 extern void Node_appendChild(Node* node, Node* child)
[all...] |
| /external/chromium/net/disk_cache/ |
| mem_rankings.cc | 16 void MemRankings::Insert(MemEntryImpl* node) {
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) {
29 MemEntryImpl* prev = node->prev();
30 MemEntryImpl* next = node->next();
32 if (head_ == node)
[all...] |
| /external/webkit/WebCore/xml/ |
| XMLSerializer.cpp | 29 String XMLSerializer::serializeToString(Node* node, ExceptionCode& ec)
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);
|
| /external/webkit/WebCore/dom/ |
| NodeIterator.cpp | 39 NodeIterator::NodePointer::NodePointer(PassRefPtr<Node> n, bool b)
40 : node(n)
47 node.clear();
50 bool NodeIterator::NodePointer::moveToNext(Node* root)
52 if (!node)
58 node = node->traverseNextNode(root);
59 return node;
62 bool NodeIterator::NodePointer::moveToPrevious(Node* root)
64 if (!node)
174 Node* node = removedNode->traverseNextNode(root()); local
203 Node* node = removedNode->traversePreviousNode(root()); local
[all...] |
| TreeWalker.cpp | 36 TreeWalker::TreeWalker(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter, bool expandEntityReferences)
42 void TreeWalker::setCurrentNode(PassRefPtr<Node> node, ExceptionCode& ec)
44 if (!node) {
48 m_current = node;
51 inline Node* TreeWalker::setCurrent(PassRefPtr<Node> node)
53 m_current = node;
57 Node* TreeWalker::parentNode(ScriptState* state
59 RefPtr<Node> node = m_current; local
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...] |
| NodeFilter.cpp | 28 #include "Node.h"
32 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/ |
| AccessibilityList.cpp | 75 Node* node = m_renderer->node();
83 return node && node->hasTagName(ulTag);
95 Node* node = m_renderer->node();
96 return node && node->hasTagName(olTag);
[all...] |
| /packages/apps/Email/src/org/apache/james/mime4j/field/address/parser/ |
| AddressListParserVisitor.java | 7 public Object visit(SimpleNode node, Object data);
8 public Object visit(ASTaddress_list node, Object data);
9 public Object visit(ASTaddress node, Object data);
10 public Object visit(ASTmailbox node, Object data);
11 public Object visit(ASTname_addr node, Object data);
12 public Object visit(ASTgroup_body node, Object data);
13 public Object visit(ASTangle_addr node, Object data);
14 public Object visit(ASTroute node, Object data);
15 public Object visit(ASTphrase node, Object data);
16 public Object visit(ASTaddr_spec node, Object data)
[all...] |
| /system/core/init/ |
| list.h | 26 #define node_to_item(node, container, member) \
27 (container *) (((char*) (node)) - offsetof(container, member))
35 #define list_for_each(node, list) \
36 for (node = (list)->next; node != (list); node = node->next)
38 #define list_for_each_reverse(node, list) \
39 for (node = (list)->prev; node != (list); node = node->prev
[all...] |
| /external/webkit/WebCore/bindings/objc/ |
| ObjCNodeFilterCondition.mm | 40 short ObjCNodeFilterCondition::acceptNode(ExecState*, Node* node) const
42 if (!node)
44 return [m_filter.get() acceptNode:kit(node)];
|
| /external/webkit/WebCore/platform/ |
| DeprecatedPtrListImpl.cpp | 49 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->next
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/ |
| rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root)
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)
50 struct rb_node *left = node->rb_left
[all...] |
| /external/libvpx/examples/includes/ASCIIMathPHP-2.0/ |
| htmlMathML.js | 11 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.childNodes[i]))
[all...] |
| /external/webkit/WebCore/editing/ |
| htmlediting.cpp | 60 // Atomic means that the node has no children, or has children which are ignored for the
62 bool isAtomicNode(const Node *node)
64 return node && (!node->hasChildNodes() || editingIgnoresContent(node));
69 bool editingIgnoresContent(const Node* node)
71 return !canHaveChildrenForEditing(node) && !node->isTextNode()
137 Node* node = position.node(); local
176 Node* node = p.node(); local
188 Node* node = pos.node(); local
195 Node* node = p.node(); local
207 Node* node = p.node(); local
931 Node *node = pos.node(); local
[all...] |
| /libcore/luni/src/main/java/javax/xml/transform/dom/ |
| DOMResult.java | 23 import org.w3c.dom.Node;
28 * <p>If no output DOM source is set, the transformation will create a Document node as the holder for the result of the transformation,
45 * <p><code>node</code>,
57 * <p>Use a DOM node to create a new output target.</p>
59 * <p>In practice, the node should be
60 * a {@link org.w3c.dom.Document} node,
61 * a {@link org.w3c.dom.DocumentFragment} node, or
62 * a {@link org.w3c.dom.Element} node.
63 * In other words, a node that accepts children.</p>
69 * @param node The DOM node that will contain the result tree
337 private Node node = null; field in class:DOMResult
[all...] |
| /bionic/libc/kernel/common/asm-generic/ |
| topology.h | 19 #define parent_node(node) (0)
22 #define node_to_cpumask(node) (cpu_online_map)
25 #define node_to_first_cpu(node) (0)
28 #define pcibus_to_node(node) (-1)
|
| /development/ndk/platforms/android-3/include/asm-generic/ |
| topology.h | 19 #define parent_node(node) (0)
22 #define node_to_cpumask(node) (cpu_online_map)
25 #define node_to_first_cpu(node) (0)
28 #define pcibus_to_node(node) (-1)
|
