| /external/openssl/include/openssl/ |
| x509_vfy.h | 556 const ASN1_OBJECT *X509_policy_node_get0_policy(const X509_POLICY_NODE *node);
559 X509_policy_node_get0_qualifiers(const X509_POLICY_NODE *node); variable
561 X509_policy_node_get0_parent(const X509_POLICY_NODE *node);
|
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/ |
| ftobjs.c | 2031 FT_ListNode node = NULL; local
2365 FT_ListNode node; local
2410 FT_ListNode node = 0; local
2468 FT_ListNode node; local
3891 FT_ListNode node = NULL; local
3938 FT_ListNode node; local
3981 FT_ListNode node; local
4039 FT_ListNode node = 0; local
[all...] |
| /external/qemu/android/ |
| console.c | 249 ControlClient node = *pnode; local
250 if ( node == NULL )
252 if ( node == client ) {
253 *pnode = node->next;
254 node->next = NULL;
257 pnode = &node->next;
[all...] |
| hw-qemud.c | 1127 QemudClient* node; local
[all...] |
| /external/sfntly/cpp/src/test/tinyxml/ |
| tinyxml.h | 117 false, <b>no children of this node or its sibilings</b> will be Visited.
145 /// Visit a text node
147 /// Visit a comment node
149 /// Visit an unknown node
226 /** Return the position, in the original source file, of this node or attribute.
419 Nodes have siblings, a parent, and children. A node can be
441 a node to a stream is very well defined. You'll get a nice stream
454 /// Appends the XML node or attribute to a std::string.
499 /** Changes the value of the node. Defined as:
515 /// Delete all the children of this node. Does not affect 'this'
1026 const TiXmlAttribute* node = attributeSet.Find( name ); local
1039 const TiXmlAttribute* node = attributeSet.Find( name ); local
1714 TiXmlNode* node; member in class:TiXmlHandle
[all...] |
| /external/tcpdump/ |
| print-snmp.c | 283 struct obj *node; /* pointer into object table */ member in struct:obj_abrev
689 for (; a->node; a++) {
692 objp = a->node->child;
[all...] |
| /external/tinyxml/ |
| tinyxml.h | 180 /** Return the position, in the original source file, of this node or attribute.
378 Nodes have siblings, a parent, and children. A node can be
400 a node to a stream is very well defined. You'll get a nice stream
413 /// Appends the XML node or attribute to a std::string.
459 /** Changes the value of the node. Defined as:
479 /// Delete all the children of this node. Does not affect 'this'.
486 const TiXmlNode* FirstChild() const { return firstChild; } ///< The first child of this node. Will be null if there are no children.
488 const TiXmlNode* FirstChild( const char * value ) const; ///< The first child of this node with the matching 'value'. Will be null if none found.
489 TiXmlNode* FirstChild( const char * value ); ///< The first child of this node with the matching 'value'. Will be null if none found.
491 const TiXmlNode* LastChild() const { return lastChild; } /// The last child of this node. Will be null if there are no children
1503 TiXmlNode* node; member in class:TiXmlHandle
[all...] |
| /external/tinyxml2/ |
| tinyxml2.cpp | 49 #define DELETE_NODE( node ) { \
50 if ( node ) { \
51 MemPool* pool = node->memPool; \
52 node->~XMLNode(); \
53 pool->Free( node ); \
451 char* XMLDocument::Identify( char* p, XMLNode** node )
522 *node = returnNode;
531 for ( const XMLNode* node=FirstChild(); node; node=node->NextSibling() )
573 XMLNode* node = firstChild; local
749 XMLNode* node = 0; local
[all...] |
| tinyxml2.h | 321 false, <b>no children of this node or its sibilings</b> will be visited.
349 /// Visit a text node.
351 /// Visit a comment node.
353 /// Visit an unknown node.
411 be navigated. A node is always in a XMLDocument.
468 /** Set the Value of an XML node.
473 /// Get the parent of this node on the DOM.
477 /// Returns true if this node has no children.
480 /// Get the first child node, or null if none exists.
489 /// Get the last child node, or null if none exists.
1299 XMLNode* node; member in class:tinyxml2::XMLHandle
1333 const XMLNode* node; member in class:tinyxml2::XMLConstHandle
[all...] |
| /external/valgrind/main/cachegrind/ |
| cg_merge.c | 988 AvlNode* nodeStack[WFM_STKMAX]; // Iterator node stack
1047 just copy a->val to existing node, first returning old ->val field
1048 of existing node in *oldV, so that the caller can finalize it
1140 incorporate the node in the tree */
1440 AvlNode* node; local
1456 AvlNode* node = avl_find_node( fm->root, key, fm->kCmp ); local
1471 AvlNode* node = avl_find_node( fm->root, key, fm->kCmp ); local
[all...] |
| /external/webp/src/dec/ |
| vp8l.c | 156 const HuffmanTreeNode* node = tree->root_; local
166 node += tree->lut_jump_[lut_ix];
171 assert(node != NULL);
173 node = HuffmanTreeNextNode(node, bits & 1);
176 } while (HuffmanTreeNodeIsNotLeaf(node));
178 return node->symbol_;
[all...] |
| /external/webp/src/enc/ |
| quant.c | 518 // Trellis node
520 int8_t prev; // best previous node
523 } Node;
537 #define NODE(n, l) (nodes[(n)][(l) + MIN_DELTA])
558 Node nodes[16][NUM_NODES];
589 // initialize source node.
618 Node* const cur = &NODE(n, m);
628 if (level > MAX_LEVEL || level < 0) { // node is dead?
654 // Examine node assuming it's a non-terminal one
698 const Node* const node = &NODE(n, best_node); local
[all...] |
| /external/wpa_supplicant_8/hs20/client/ |
| osu_client.c | 73 xml_node_t *node)
75 char *str = xml_node_to_str(ctx->xml, node);
105 xml_node_t *node; local
123 node = get_node(ctx->xml, getcert, "enrollmentServerURI");
124 if (node == NULL) {
125 wpa_printf(MSG_INFO, "Could not find enrollmentServerURI node");
129 url = xml_node_get_text(ctx->xml, node);
137 node = get_node(ctx->xml, getcert, "estUserID");
138 if (node == NULL && !ctx->client_cert_present) {
139 wpa_printf(MSG_INFO, "Could not find estUserID node");
363 xml_node_t *pps, *node; local
390 xml_node_t *pps, *node; local
417 xml_node_t *pps, *node, *aaa; local
695 xml_node_t *node; local
771 xml_node_t *node; local
839 xml_node_t *node; local
933 xml_node_t *node; local
1534 xml_node_t *node; local
1777 xml_node_t *pps, *node; local
1810 xml_node_t *mo, *node; local
2349 xml_node_t *pps, *node; local
2507 xml_node_t *node; local
[all...] |
| /external/wpa_supplicant_8/wpa_supplicant/dbus/ |
| dbus_new_handlers_p2p.c | 1034 } *node, *tmp; local
1049 node = os_zalloc(sizeof(struct peer_objpath_node));
1050 if (!node) {
1056 os_snprintf(node->path, WPAS_DBUS_OBJECT_PATH_MAX,
1060 dl_list_add_tail(&peer_objpath_list, &node->list);
1077 dl_list_for_each_safe(node, tmp, &peer_objpath_list,
1079 peer_obj_paths[i++] = node->path;
1090 dl_list_for_each_safe(node, tmp, &peer_objpath_list,
1092 dl_list_del(&node->list);
1093 os_free(node);
[all...] |
| /frameworks/base/core/java/com/google/android/util/ |
| AbstractMessageParser.java | 1360 TrieNode node = children.get(key); local
[all...] |
| /hardware/libhardware/include/hardware/ |
| audio_effect.h | 54 uint8_t node[6]; member in struct:effect_uuid_s
[all...] |
| /hardware/libhardware_legacy/audio/ |
| AudioPolicyManagerBase.cpp | 4115 cnode *node = root->first_child; local
4156 cnode *node = root->first_child; local
4200 cnode *node = config_find(root, OUTPUTS_TAG); local
4245 cnode *node = config_find(root, AUDIO_HW_MODULE_TAG); local
4260 cnode *node = config_find(root, GLOBAL_CONFIG_TAG); local
[all...] |
| /hardware/qcom/audio/hal/ |
| audio_hw.c | 326 struct listnode *node; local
346 list_for_each(node, &adev->usecase_list) {
347 usecase = node_to_item(node, struct audio_usecase, list);
362 list_for_each(node, &adev->usecase_list) {
363 usecase = node_to_item(node, struct audio_usecase, list);
369 list_for_each(node, &adev->usecase_list) {
370 usecase = node_to_item(node, struct audio_usecase, list);
378 list_for_each(node, &adev->usecase_list) {
379 usecase = node_to_item(node, struct audio_usecase, list);
393 struct listnode *node; local
484 struct listnode *node; local
500 struct listnode *node; local
519 struct listnode *node; local
906 struct listnode *node; local
938 struct listnode *node; local
1289 struct listnode *node; local
1878 struct listnode *node; local
2213 struct listnode *node; local
[all...] |
| /hardware/samsung_slsi/exynos5/original-kernel-headers/linux/ |
| fimg2d.h | 406 * @node: list head of blit command queue
416 struct list_head node; member in struct:fimg2d_bltcmd
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListMap.java | 104 * (predecessor, node, successor) in order to detect when and how
110 * marking a pointer, they splice in another node that can be
118 * because any search need only read ahead one more node than
123 * algorithm of changing the next-pointer of a deleted node so
125 * changing the pointer to point to a different node, not by
135 * similar to typical lazy-deletion schemes. If a node's value is
148 * Here's the sequence of events for a deletion of node n with
157 * the node consider this mapping to exist. However, other
161 * 2. CAS n's next pointer to point to a new marker node.
178 * thread noticed during a traversal a node with null value an
512 final Node<K,V> node; field in class:ConcurrentSkipListMap.Index
[all...] |
| /ndk/sources/host-tools/ndk-depends/ |
| ndk-depends.cc | 991 // An enumeration listing possible node types, which are:
1030 LibNode node; local
1035 node.Set(LibNode::NODE_ERROR, error);
1047 node.Set(LibNode::NODE_PATH, libpath);
1048 libfile.GetNeededLibs(&node.needed_libs);
1053 for (size_t n = 0; n < node.needed_libs.size(); ++n) {
1054 LOG(_T(" %s"), node.needed_libs[n].c_str());
1055 queue.push_back(node.needed_libs[n]);
1059 deps[soname] = node;
1099 LibNode node; local
1108 LibNode node; local
1122 const LibNode& node = iter->second; local
1224 const LibNode& node = deps[min_libname]; local
1442 LibNode& node = deps[lib]; local
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| regcomp.c | 44 static reg_errcode_t optimize_subexps (void *extra, bin_tree_t *node);
45 static reg_errcode_t lower_subexps (void *extra, bin_tree_t *node);
47 bin_tree_t *node);
48 static reg_errcode_t calc_first (void *extra, bin_tree_t *node);
49 static reg_errcode_t calc_next (void *extra, bin_tree_t *node);
50 static reg_errcode_t link_nfa_nodes (void *extra, bin_tree_t *node);
56 Idx node, bool root);
122 static void free_token (re_token_t *node);
123 static reg_errcode_t free_tree (void *extra, bin_tree_t *node);
124 static reg_errcode_t mark_opt_subexp (void *extra, bin_tree_t *node);
318 Idx node = init_state->nodes.elems[node_cnt]; local
1062 Idx node; local
1206 bin_tree_t *node, *prev; local
1238 bin_tree_t *node; local
3819 const bin_tree_t *node; local
[all...] |
| /packages/apps/OMA-DM/engine/dmlib/dmtapi/native_async/src/ |
| dmtAsyncAPI.cc | 118 PDmtNode & node = nodeHandlerVector[index]; local
119 if ( node == (DmtNode*)hnode )
[all...] |
| /packages/inputmethods/OpenWnn/libs/libwnnDictionary/engine/ |
| ndbdic.c | 100 static NJ_INT16 search_yomi_node(NJ_UINT8 operation, NJ_UINT8 *node,
552 NJ_UINT8 *root, *now, *node, *node_mid; local
580 node = NULL;
611 node = root;
757 node = now;
766 node = now;
793 now = node;
796 if ((node == NULL) || !(NODE_DATA_EXIST(node))) {
799 (node != NULL))
1541 NJ_UINT8 *root, *now, *node, *node_mid; local
2255 NJ_UINT8 *node; local
[all...] |
| /packages/inputmethods/OpenWnn/libs/libwnnDictionary/include/ |
| nj_lib.h | 120 NJ_UINT8 *node; member in struct:__anon43354
|
