HomeSort by relevance Sort by last modified time
    Searched defs:child_node (Results 1 - 5 of 5) sorted by null

  /system/core/property_service/libpropertyinfoparser/
property_info_parser.cpp 72 const char* child_name = child_node(array_offset).name();
87 *child = child_node(node_index);
136 TrieNode child_node; local
137 if (!trie_node.FindChildForString(remaining_name, substr_size, &child_node)) {
141 trie_node = child_node;
  /system/core/property_service/libpropertyinfoparser/include/property_info_parser/
property_info_parser.h 109 TrieNode child_node(int n) const { function in class:android::properties::TrieNode
  /system/libufdt/
ufdt_convert.c 131 struct ufdt_node *res, *child_node; local
134 child_node = NULL;
153 child_node = fdt_to_ufdt_tree(fdtp, cur_fdt_tag_offset,
155 ufdt_node_add_child(res, child_node);
  /external/tensorflow/tensorflow/contrib/boosted_trees/kernels/
training_ops.cc 120 const auto& child_node = nodes[child_id]; local
121 CHECK(child_node.node_case() != TreeNode::NODE_NOT_SET);
122 if (child_node.node_case() != TreeNode::kLeaf) {
153 auto& child_node = (*nodes)[child_id]; local
154 child_node.Clear();
    [all...]
  /external/cmockery/cmockery_0_1_2/src/
cmockery.c 556 ListNode * const child_node = child_list->next; local
558 if (child_node->refcount < -1) {
559 list_remove_free(child_node, free_value, NULL);
595 const ListNode *child_node; local
599 for (child_node = child_list->next; child_node != child_list;
600 child_node = child_node->next) {
601 const SourceLocation * const location = child_node->value;
    [all...]

Completed in 172 milliseconds