| /ndk/build/platforms/android-3/arch-arm/usr/include/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...] |
| /ndk/build/platforms/android-4/arch-arm/usr/include/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...] |
| /ndk/build/platforms/android-5/arch-arm/usr/include/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...] |
| /ndk/build/platforms/android-5/arch-x86/usr/include/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...] |
| /ndk/build/platforms/android-8/arch-arm/usr/include/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...] |
| /ndk/build/platforms/android-8/arch-x86/usr/include/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...] |
| /external/webkit/WebCore/xml/ |
| XPathUtil.cpp | 37 bool isRootDomNode(Node* node)
39 return node && !node->parentNode();
42 String stringValue(Node* node)
44 switch (node->nodeType()) {
45 case Node::ATTRIBUTE_NODE:
46 case Node::PROCESSING_INSTRUCTION_NODE:
47 case Node::COMMENT_NODE
[all...] |
| /external/v8/src/ |
| 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...] |
| prettyprinter.cc | 53 void PrettyPrinter::VisitBlock(Block* node) {
54 if (!node->is_initializer_block()) Print("{ ");
55 PrintStatements(node->statements());
56 if (node->statements()->length() > 0) Print(" ");
57 if (!node->is_initializer_block()) Print("}");
61 void PrettyPrinter::VisitDeclaration(Declaration* node) {
63 PrintLiteral(node->proxy()->name(), false);
64 if (node->fun() != NULL) {
66 PrintFunctionLiteral(node->fun());
72 void PrettyPrinter::VisitExpressionStatement(ExpressionStatement* node) {
[all...] |
| /external/e2fsprogs/tests/f_h_reindex/ |
| expect.1 | 5 Problem in HTREE directory inode 16001: node (1) has bad max hash
6 Problem in HTREE directory inode 16001: node (2) has bad min hash
7 Problem in HTREE directory inode 16001: node (2) has bad max hash
8 Problem in HTREE directory inode 16001: node (3) has bad min hash
9 Problem in HTREE directory inode 16001: node (3) has bad max hash
10 Problem in HTREE directory inode 16001: node (4) has bad min hash
11 Problem in HTREE directory inode 16001: node (4) has bad max hash
12 Problem in HTREE directory inode 16001: node (5) has bad min hash
13 Problem in HTREE directory inode 16001: node (5) has bad max hash
14 Problem in HTREE directory inode 16001: node (6) has bad min has
[all...] |
| /dalvik/libcore/luni/src/main/java/java/util/ |
| TreeMap.java | 45 transient Node<K, V> root;
50 final Node<K, V> node; field in class:TreeMap.MapEntry
53 MapEntry(Node<K, V> node, int offset) {
54 this.node = node;
56 key = node.keys[offset];
89 if (node.keys[offset] == key) {
90 return node.values[offset]
172 Node<K, V> node; field in class:TreeMap.AbstractMapIterator
510 Node<K, V> node = backingMap.root; local
571 Node<K, V> node = minimum(backingMap.root); local
629 Node<K, V> node = backingMap.root; local
693 Node<K, V> node = maximum(backingMap.root); local
1058 Node<K, V> node = minimum(clone.root); local
1114 Node<K, V> node = root; local
1165 Node<K, V> node = minimum(root); local
1255 Node<K, V> node = minimum(root); local
1278 Node<K, V> node = root; local
1405 Node<K, V> node = maximum(root); local
1457 Node<K, V> node = root; local
2388 Node<K, V> node = minimum(root); local
[all...] |
| /hardware/msm7k/libgralloc/ |
| allocator.h | 32 template <typename NODE>
35 NODE* mFirst;
36 NODE* mLast;
41 NODE const* head() const { return mFirst; }
42 NODE* head() { return mFirst; }
43 NODE const* tail() const { return mLast; }
44 NODE* tail() { return mLast; }
46 void insertAfter(NODE* node, NODE* newNode)
[all...] |
| /hardware/msm7k/libgralloc-qsd8k/ |
| allocator.h | 32 template <typename NODE>
35 NODE* mFirst;
36 NODE* mLast;
41 NODE const* head() const { return mFirst; }
42 NODE* head() { return mFirst; }
43 NODE const* tail() const { return mLast; }
44 NODE* tail() { return mLast; }
46 void insertAfter(NODE* node, NODE* newNode)
[all...] |
| /dalvik/libcore/prefs/src/test/resources/prefs/java/util/prefs/ |
| userprefs-badform.xml | 27 <node name="java">
29 <node name="util">
31 <node name="prefs">
33 <node name="mock">
35 <node name="child">
39 <node name="grandson">
43 <node name="grandgrandson">
47 </node>
48 </node>
49 </node>
[all...] |
| userprefs-badencoding.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...] |
| userprefs-higherversion.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...] |
| userprefs.xml | 27 <node name="org">
29 <node name="apache">
31 <node name="harmony">
33 <node name="prefs">
35 <node name="tests">
37 <node name="java">
39 <node name="util">
42 <node name="prefs">
48 <node name="mock">
50 <node name="child"
[all...] |
| /external/webkit/JavaScriptCore/API/tests/ |
| 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/skia/src/xml/ |
| SkDOM.cpp | 24 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node)
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);
84 const SkDOM::Node* SkDOM::getRootNode() const
89 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) cons
225 SkDOM::Node* node = (SkDOM::Node*)fAlloc->alloc(sizeof(SkDOM::Node) + attrCount * sizeof(SkDOM::Attr), local
[all...] |
| /dalvik/libcore/prefs/src/main/java/java/util/prefs/ |
| NodeSet.java | 3 import org.w3c.dom.Node;
15 ArrayList<Node> list = new ArrayList<Node>();
17 public NodeSet(Iterator<Node> nodes) {
27 public Node item(int index) {
28 Node result = null;
|
| /external/clearsilver/man/man3/ |
| hdf_obj_value.3 | 14 hdf_obj_value - Return the value of a node
25 hdf -> the hdf dataset node
28 hdf_obj_value is an accessor function for a dataset node
29 which returns the value of the node, or NULL if the node
31 node retains ownership of the value
|
| hdf_set_copy.3 | 26 hdf -> the pointer to the dataset node
28 dest -> the name of the destination node
30 src -> the name of the source node
34 node, and then copies that value to the named dest node.
35 If the src node is not found, an error is raised.
|
| /external/tinyxml/ |
| tinyxml.cpp | 157 TiXmlNode* node = firstChild; local
160 while ( node )
162 temp = node;
163 node = node->next;
178 TiXmlNode* node = firstChild; local
181 while ( node )
183 temp = node;
184 node = node->next
212 TiXmlNode* node = addThis.Clone(); local
324 const TiXmlNode* node; local
336 TiXmlNode* node; local
348 const TiXmlNode* node; local
359 TiXmlNode* node; local
422 const TiXmlNode* node; local
433 TiXmlNode* node; local
444 const TiXmlNode* node; local
455 TiXmlNode* node; local
466 TiXmlAttribute* node = attributeSet.Find( name ); local
476 const TiXmlNode* node; local
490 TiXmlNode* node; local
504 const TiXmlNode* node; local
518 TiXmlNode* node; local
532 const TiXmlNode* node; local
546 TiXmlNode* node; local
560 const TiXmlNode* node; local
574 TiXmlNode* node; local
589 const TiXmlNode* node; local
601 TiXmlNode* node; local
655 TiXmlAttribute* node = attributeSet.First(); local
664 const TiXmlAttribute* node = attributeSet.Find( name ); local
703 const TiXmlAttribute* node = attributeSet.Find( name ); local
713 const TiXmlAttribute* node = attributeSet.Find( name ); local
747 TiXmlAttribute* node = attributeSet.Find( name ); local
787 TiXmlNode* node; local
830 TiXmlNode* node; local
863 TiXmlNode* node = 0; local
1138 const TiXmlNode* node; local
1148 const TiXmlNode* node; local
1545 TiXmlAttribute* node; local
1563 const TiXmlAttribute* node; local
1575 TiXmlAttribute* node; local
[all...] |
| /external/webkit/WebCore/editing/ |
| ModifySelectionListLevel.cpp | 49 static bool getStartEndListChildren(const VisibleSelection& selection, Node*& start, Node*& end)
55 Node* startListChild = enclosingListChild(selection.start().node());
60 Node* endListChild = selection.isRange() ? enclosingListChild(selection.end().node()) : startListChild;
82 if (r && isListElement(r->node()))
83 endListChild = r->node();
91 void ModifySelectionListLevelCommand::insertSiblingNodeRangeBefore(Node* startNode, Node* endNode, Node* refNode
93 Node* node = startNode; local
108 Node* node = startNode; local
124 Node* node = startNode; local
[all...] |
| /external/kernel-headers/original/linux/ |
| node.h | 2 * 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...] |
