| /frameworks/base/media/libdrm/mobile2/src/util/domcore/ |
| NodeIterator.cpp | 25 NodeImpl* NodeIterator::findNextOrderNode(NodeImpl* node)
27 if (node == endNode)
30 if (node != NULL) {
31 if (node->hasChildNodes() == true) {
32 node = node->getFirstChild();
33 }else if (node == scopeNode && node->hasChildNodes() == false) {
34 node = NULL;
35 } else if (node->getNextSibling() != NULL) {
56 NodeImpl* node = NULL; local
69 NodeImpl* node; local
[all...] |
| /external/qemu/ |
| aio.c | 38 LIST_ENTRY(AioHandler) node;
43 AioHandler *node; local
45 LIST_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 LIST_ENTRY(AioHandler) node;
44 AioHandler *node; local
46 LIST_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...] |
| /system/core/sh/ |
| 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...] |
| /sdk/layoutopt/libs/uix/src/resources/rules/ |
| MergeRootFrameLayout.rule | 3 // Description: Checks whether the root node of the XML document can be
7 // - The node is the root of the document
8 // - The node is a FrameLayout
9 // - The node is match_parent in both orientation *or* it has no layout_gravity
10 // - The node does not have a background nor a foreground
11 // - The node does not have padding
13 if (node.isRoot() && node.is("FrameLayout") && !node.'@android:background' &&
14 !node.'@android:foreground' && ((node.isWidthFillParent() &
[all...] |
| UselessView.rule | 6 // - The node is a container view (LinearLayout, etc.)
7 // - The node has no id
8 // - The node has no background
9 // - The node has no children
11 if (node.isContainer() && node.'*'.size() == 0 && !node.'@android:id' &&
12 !node.'@android:background') {
13 analysis << "This ${node.name()} view is useless (no children, no background, no id)"
|
| IncorrectHeightInScrollView.rule | 6 // - The node has a ScrollView parent
7 // - The node has a height set to match_parent
9 if (node.'..'.is("ScrollView") && node.isHeightFillParent()) {
10 analysis << "This ${node.name()} tag should use android:layout_height=\"wrap_content\""
|
| IncorrectWidthInHorizontalScrollView.rule | 6 // - The node has a HorizontalScrollView parent
7 // - The node has a width set to match_parent
9 if (node.'..'.is("HorizontalScrollView") && node.isWidthFillParent()) {
10 analysis << "This ${node.name()} tag should use android:layout_width=\"wrap_content\""
|
| UseCompoundDrawables.rule | 3 // Description: Checks whether the current node can be replaced by a TextView
7 // - The node is a LinearLayout
8 // - The node has two children, ImageView and TextView
11 if (node.is("LinearLayout") && node.'*'.size() == 2 && node.'TextView'.size() == 1 &&
12 node.'ImageView'.size() == 1 && !node.'ImageView'[0].'@android:layout_weight') {
|
| UselessLayout.rule | 3 // Description: Checks whether current node can be removed.
6 // - The node has children
7 // - The node does not have siblings
8 // - The node's parent is not a scroll view (horizontal or vertical)
9 // - The node does not have a background or its parent does not have a
10 // background or neither the node and its parent have a background
13 if (!node.isRoot() && !(node['..'].name() in ["ScrollView", "HorizontalScrollView"]) &&
14 node['..']['*'].size() == 1 && node['*'].size() > 0 && ((node.'@android:background' |
[all...] |
| /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...] |
| /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...] |
| /external/skia/include/xml/ |
| SkDOM.h | 33 typedef SkDOMNode Node;
38 const Node* build(const char doc[], size_t len);
39 const Node* copy(const SkDOM& dom, const Node* node);
41 const Node* getRootNode() const;
47 Type getType(const Node*) const;
49 const char* getName(const Node*) const;
50 const Node* getFirstChild(const Node*, const char elem[] = NULL) const
[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...] |
| /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...] |
| /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...] |
| /dalvik/libcore/prefs/src/test/resources/prefs/java/util/prefs/ |
| userprefs-ascii.xml | 27 <node name="tests">
29 <node name="api">
31 <node name="java">
33 <node name="util">
35 <node name="prefs">
39 <node name="mock">
41 <node name="child">
45 <node name="grandson">
49 <node name="grandgrandson">
53 </node>
[all...] |
| userprefs-badtype.xml | 27 <node name="tests">
29 <node name="api">
31 <node name="java">
33 <node name="util">
35 <node name="prefs">
40 <node name="mock">
42 <node name="child">
46 <node name="grandson">
50 <node name="grandgrandson">
54 </node>
[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...] |
| /frameworks/base/media/libdrm/mobile2/include/util/domcore/ |
| NodeImpl.h | 41 /** Current node's document context */
45 * Add next slibing node
46 * @param node the node to be add.
48 void appendNextSibling(NodeImpl* node);
57 * Set <code>parentNode</code> as current node's parent.
59 * @param parentNode The specify parent node.
64 * Set the node immediately following node.
66 * @param siblingNode The special node be insert after current node.
[all...] |
| /packages/apps/Mms/src/com/android/mms/dom/ |
| NamedNodeMapImpl.java | 24 import org.w3c.dom.Node;
28 private Vector<Node> mNodes = new Vector<Node>();
34 public Node getNamedItem(String name) {
35 Node node = null; local
38 node = mNodes.elementAt(i);
42 return node;
45 public Node getNamedItemNS(String namespaceURI, String localName) {
50 public Node item(int index)
58 Node node = getNamedItem(name); local
[all...] |
| /dalvik/libcore/xml/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...] |
| /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...] |
| /bionic/libc/kernel/common/linux/ |
| nodemask.h | 22 #define node_set(node, dst) __node_set((node), &(dst))
23 #define node_clear(node, dst) __node_clear((node), &(dst))
26 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits)
27 #define node_test_and_set(node, nodemask) __node_test_and_set((node), &(nodemask))
43 #define nodemask_of_node(node) ({ typeof(_unused_nodemask_arg_) m; if (sizeof(m) == sizeof(unsigned long)) { m.bits[0] = 1UL<<(node); } else { nodes_clear(m); node_set((node), m); } m; }
[all...] |
