| /hardware/ti/omap4xxx/security/tf_daemon/ |
| smc_properties_parser.h | 58 typedef struct NODE
60 struct NODE* pLeft;
61 struct NODE* pRight;
62 struct NODE* pNext;
63 struct NODE* pPrevious;
65 } NODE;
69 NODE* pRoot;
70 NODE* pFirst;
75 NODE sNode;
82 NODE sNode
[all...] |
| smc_properties_parser.c | 116 static NODE* static_listFindNodeElement(NODE* pList,char* pName,bool bIsCaseSensitive)
149 static S_RESULT static_listSortedAddNode(NODE* pList,NODE* pNode)
202 static S_RESULT SMCPropListSortedAdd(LIST* pList,NODE* pNode)
210 TRACE_ERROR("Trying to insert a NULL node name !\n");
223 /* update the first node of the linked list */
233 static NODE* SMCPropListFindElement(LIST* pList,char* pName,bool bIsCaseSensitive)
377 nError=SMCPropListSortedAdd(pPublicPropertyList,(NODE*)pProperty);
388 nError=SMCPropListSortedAdd(pPrivatePropertyList,(NODE*)pProperty)
[all...] |
| /prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/cp/ |
| cp-tree.h | 164 The BV_DELTA of each node gives the amount by which to adjust the
170 The BV_VCALL_INDEX of each node, if non-NULL, gives the vtable
193 #define VAR_OR_FUNCTION_DECL_CHECK(NODE) \
194 TREE_CHECK2(NODE,VAR_DECL,FUNCTION_DECL)
196 #define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) \
197 TREE_CHECK3(NODE,VAR_DECL,FUNCTION_DECL,PARM_DECL)
199 #define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) \
200 TREE_CHECK4(NODE,VAR_DECL,FUNCTION_DECL,TYPE_DECL,TEMPLATE_DECL)
202 #define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) \
203 TREE_CHECK(NODE,BOUND_TEMPLATE_TEMPLATE_PARM
[all...] |
| name-lookup.h | 61 #define LOCAL_BINDING_P(NODE) ((NODE)->is_local)
63 /* True if NODE->value is from a base class of the class which is
65 #define INHERITED_VALUE_BINDING_P(NODE) ((NODE)->value_is_inherited)
277 /* The tree node representing the global scope. */
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/cp/ |
| cp-tree.h | 164 The BV_DELTA of each node gives the amount by which to adjust the
170 The BV_VCALL_INDEX of each node, if non-NULL, gives the vtable
193 #define VAR_OR_FUNCTION_DECL_CHECK(NODE) \
194 TREE_CHECK2(NODE,VAR_DECL,FUNCTION_DECL)
196 #define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) \
197 TREE_CHECK3(NODE,VAR_DECL,FUNCTION_DECL,PARM_DECL)
199 #define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) \
200 TREE_CHECK4(NODE,VAR_DECL,FUNCTION_DECL,TYPE_DECL,TEMPLATE_DECL)
202 #define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) \
203 TREE_CHECK(NODE,BOUND_TEMPLATE_TEMPLATE_PARM
[all...] |
| name-lookup.h | 61 #define LOCAL_BINDING_P(NODE) ((NODE)->is_local)
63 /* True if NODE->value is from a base class of the class which is
65 #define INHERITED_VALUE_BINDING_P(NODE) ((NODE)->value_is_inherited)
277 /* The tree node representing the global scope. */
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/cp/ |
| cp-tree.h | 164 The BV_DELTA of each node gives the amount by which to adjust the
170 The BV_VCALL_INDEX of each node, if non-NULL, gives the vtable
193 #define VAR_OR_FUNCTION_DECL_CHECK(NODE) \
194 TREE_CHECK2(NODE,VAR_DECL,FUNCTION_DECL)
196 #define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) \
197 TREE_CHECK3(NODE,VAR_DECL,FUNCTION_DECL,PARM_DECL)
199 #define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) \
200 TREE_CHECK4(NODE,VAR_DECL,FUNCTION_DECL,TYPE_DECL,TEMPLATE_DECL)
202 #define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) \
203 TREE_CHECK(NODE,BOUND_TEMPLATE_TEMPLATE_PARM
[all...] |
| name-lookup.h | 61 #define LOCAL_BINDING_P(NODE) ((NODE)->is_local)
63 /* True if NODE->value is from a base class of the class which is
65 #define INHERITED_VALUE_BINDING_P(NODE) ((NODE)->value_is_inherited)
277 /* The tree node representing the global scope. */
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| tree.h | 176 /* Returns nonzero iff NODE is an expression of some kind. */
178 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
180 /* Number of argument-words in each kind of tree-node. */
266 /* In an OMP_CLAUSE node. */
335 /* A tree node can represent a data type, a variable, an expression
336 or a statement. Each node has a TREE_CODE which says what kind of
344 As for the contents of a tree node: there are some fields
346 fields as well. The fields of a node are never accessed directly,
349 /* Every kind of tree node starts with this structure
[all...] |
| symtab.h | 37 #define HT_LEN(NODE) ((NODE)->len)
38 #define HT_STR(NODE) ((NODE)->str)
52 /* Call back, allocate a node. */
54 /* Call back, allocate something that hangs off a node like a cpp_macro.
87 TABLE->PFILE, the node, and a PTR, and the callback sequence stops
93 a nonzero value, the node is removed from the table. */
|
| c-common.h | 193 (&(((struct c_common_identifier *) (id))->node))
195 ((enum rid) (((struct c_common_identifier *) (id))->node.rid_code))
197 (((struct c_common_identifier *) (id))->node.rid_code = (unsigned char) code)
204 struct cpp_hashnode node; local
269 /* A node for `((void) 0)'. */
272 /* The node for C++ `__null'. */
790 #define STATEMENT_LIST_STMT_EXPR(NODE) \
791 TREE_LANG_FLAG_1 (STATEMENT_LIST_CHECK (NODE))
794 #define STATEMENT_LIST_HAS_LABEL(NODE) \
795 TREE_LANG_FLAG_3 (STATEMENT_LIST_CHECK (NODE))
[all...] |
| cpplib.h | 209 node; member in union:cpp_token_u
553 /* The structure of a node in the hash table. The hash table has
561 diagnostic may be required for this node. Currently this only
564 /* Hash node flags. */
575 /* Different flavors of hash node. */
600 #define HT_NODE(NODE) ((ht_identifier *) (NODE))
601 #define NODE_LEN(NODE) HT_LEN (&(NODE)->ident)
602 #define NODE_NAME(NODE) HT_STR (&(NODE)->ident
[all...] |
| /prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/ |
| tree.h | 176 /* Returns nonzero iff NODE is an expression of some kind. */
178 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
180 /* Number of argument-words in each kind of tree-node. */
266 /* In an OMP_CLAUSE node. */
335 /* A tree node can represent a data type, a variable, an expression
336 or a statement. Each node has a TREE_CODE which says what kind of
344 As for the contents of a tree node: there are some fields
346 fields as well. The fields of a node are never accessed directly,
349 /* Every kind of tree node starts with this structure
[all...] |
| symtab.h | 37 #define HT_LEN(NODE) ((NODE)->len)
38 #define HT_STR(NODE) ((NODE)->str)
52 /* Call back, allocate a node. */
54 /* Call back, allocate something that hangs off a node like a cpp_macro.
87 TABLE->PFILE, the node, and a PTR, and the callback sequence stops
93 a nonzero value, the node is removed from the table. */
|
| c-common.h | 193 (&(((struct c_common_identifier *) (id))->node))
195 ((enum rid) (((struct c_common_identifier *) (id))->node.rid_code))
197 (((struct c_common_identifier *) (id))->node.rid_code = (unsigned char) code)
204 struct cpp_hashnode node; local
269 /* A node for `((void) 0)'. */
272 /* The node for C++ `__null'. */
790 #define STATEMENT_LIST_STMT_EXPR(NODE) \
791 TREE_LANG_FLAG_1 (STATEMENT_LIST_CHECK (NODE))
794 #define STATEMENT_LIST_HAS_LABEL(NODE) \
795 TREE_LANG_FLAG_3 (STATEMENT_LIST_CHECK (NODE))
[all...] |
| cpplib.h | 209 node; member in union:cpp_token_u
553 /* The structure of a node in the hash table. The hash table has
561 diagnostic may be required for this node. Currently this only
564 /* Hash node flags. */
575 /* Different flavors of hash node. */
600 #define HT_NODE(NODE) ((ht_identifier *) (NODE))
601 #define NODE_LEN(NODE) HT_LEN (&(NODE)->ident)
602 #define NODE_NAME(NODE) HT_STR (&(NODE)->ident
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| tree.h | 176 /* Returns nonzero iff NODE is an expression of some kind. */
178 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
180 /* Number of argument-words in each kind of tree-node. */
266 /* In an OMP_CLAUSE node. */
335 /* A tree node can represent a data type, a variable, an expression
336 or a statement. Each node has a TREE_CODE which says what kind of
344 As for the contents of a tree node: there are some fields
346 fields as well. The fields of a node are never accessed directly,
349 /* Every kind of tree node starts with this structure
[all...] |
| symtab.h | 37 #define HT_LEN(NODE) ((NODE)->len)
38 #define HT_STR(NODE) ((NODE)->str)
52 /* Call back, allocate a node. */
54 /* Call back, allocate something that hangs off a node like a cpp_macro.
87 TABLE->PFILE, the node, and a PTR, and the callback sequence stops
93 a nonzero value, the node is removed from the table. */
|
| c-common.h | 193 (&(((struct c_common_identifier *) (id))->node))
195 ((enum rid) (((struct c_common_identifier *) (id))->node.rid_code))
197 (((struct c_common_identifier *) (id))->node.rid_code = (unsigned char) code)
204 struct cpp_hashnode node; local
269 /* A node for `((void) 0)'. */
272 /* The node for C++ `__null'. */
790 #define STATEMENT_LIST_STMT_EXPR(NODE) \
791 TREE_LANG_FLAG_1 (STATEMENT_LIST_CHECK (NODE))
794 #define STATEMENT_LIST_HAS_LABEL(NODE) \
795 TREE_LANG_FLAG_3 (STATEMENT_LIST_CHECK (NODE))
[all...] |
| cpplib.h | 209 node; member in union:cpp_token_u
553 /* The structure of a node in the hash table. The hash table has
561 diagnostic may be required for this node. Currently this only
564 /* Hash node flags. */
575 /* Different flavors of hash node. */
600 #define HT_NODE(NODE) ((ht_identifier *) (NODE))
601 #define NODE_LEN(NODE) HT_LEN (&(NODE)->ident)
602 #define NODE_NAME(NODE) HT_STR (&(NODE)->ident
[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 | 33 template <typename NODE>
36 NODE* mFirst;
37 NODE* mLast;
42 NODE const* head() const { return mFirst; }
43 NODE* head() { return mFirst; }
44 NODE const* tail() const { return mLast; }
45 NODE* tail() { return mLast; }
47 void insertAfter(NODE* node, NODE* newNode)
[all...] |
| /libcore/luni/src/main/java/javax/xml/xpath/ |
| XPathConstants.java | 70 * <p>Maps to Java {@link org.w3c.dom.Node}.</p>
72 public static final QName NODE = new QName("http://www.w3.org/1999/XSL/Transform", "NODE");
|
| /frameworks/base/libs/binder/ |
| MemoryDealer.cpp | 48 template <typename NODE>
51 NODE* mFirst;
52 NODE* mLast;
57 NODE const* head() const { return mFirst; }
58 NODE* head() { return mFirst; }
59 NODE const* tail() const { return mLast; }
60 NODE* tail() { return mLast; }
62 void insertAfter(NODE* node, NODE* newNode)
273 chunk_t* node = new chunk_t(0, mHeapSize \/ kMemoryAlign); local
[all...] |
| /development/build/tools/ |
| mk_sdk_repo_xml.sh | 132 local NODE LAST_NODE
137 NODE="${KEY%%/*}"
139 [[ "$NODE" == "$KEY" ]] && NODE=""
140 if [[ "$NODE" != "$LAST_NODE" ]]; then
142 LAST_NODE="$NODE"
143 [[ "$NODE" ]] && echo " <sdk:$NODE>" >> "$OUT"
218 # Parse the libs for an addon and generate the <libs> node
|
