/bionic/libc/bionic/ |
tdestroy.cpp | 24 node_t* root_node = (node_t*) root; local 25 if (root_node == NULL) { 28 if (root_node->llink) { 29 tdestroy(root_node->llink, destroy_func); 31 if (root_node->rlink) { 32 tdestroy(root_node->rlink, destroy_func); 34 (*destroy_func)(root_node->key);
|
system_properties.cpp | 348 static prop_bt *root_node() function 598 return find_property(root_node(), name, strlen(name), NULL, 0, false); 687 pi = find_property(root_node(), name, namelen, value, valuelen, true);
|
/external/chromium_org/ui/accessibility/ |
ax_tree_unittest.cc | 97 const AXNode* root_node = dst_tree.GetRoot(); local 98 ASSERT_TRUE(root_node != NULL); 99 EXPECT_EQ(root.id, root_node->id()); 100 EXPECT_EQ(root.role, root_node->data().role); 102 ASSERT_EQ(2, root_node->child_count()); 104 const AXNode* button_node = root_node->ChildAtIndex(0); 108 const AXNode* checkbox_node = root_node->ChildAtIndex(1);
|
/external/chromium_org/components/bookmarks/browser/ |
bookmark_model.h | 87 const BookmarkNode* root_node() const { return &root_; } function in class:BookmarkModel
|
bookmark_utils.cc | 237 model->root_node(), base::Bind(&PruneInvisibleFolders)); 262 // only children of the root_node. 263 const BookmarkNode* root_node = model->root_node(); local 265 for (int i = 0; i < root_node->child_count(); ++i) { 266 const BookmarkNode* node = root_node->GetChild(i); 282 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node()); 316 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node()); 462 return GetNodeByID(model->root_node(), id);
|
/external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
vp8_partition_aggregator.cc | 39 PartitionTreeNode* root_node = local 42 root_node->set_packet_start(true); 43 return root_node;
|
/external/chromium_org/tools/cr/cr/ |
visitor.py | 64 def root_node(self): member in class:Visitor 83 return self.root_node.Resolve(self, key, value)
|
/external/opencv/cv/src/ |
_cvkdtree.hpp | 80 int root_node; // index of root node, -1 if empty tree member in class:CvKDTree 238 : deref(_deref), root_node(-1) { 267 root_node = insert(first, last, ctor); 276 return remove(&root_node, p); 280 print(root_node); 392 if (root_node == -1) 395 // add root_node to bbf_node priority queue; 398 tmp_pq.push_back(bbf_node(root_node, 0)); 452 find_ortho_range(root_node, bounds_min, bounds_max, inbounds);
|
/external/chromium_org/chrome/browser/ui/views/bookmarks/ |
bookmark_editor_view.cc | 422 EditorNode* root_node = CreateRootNode(); local 423 tree_model_.reset(new EditorTreeModel(root_node)); 496 EditorNode* root_node = new EditorNode(base::string16(), 0); local 497 const BookmarkNode* bb_root_node = bb_model_->root_node(); 498 CreateNodes(bb_root_node, root_node); 499 DCHECK(root_node->child_count() >= 2 && root_node->child_count() <= 4); 502 if (root_node->child_count() >= 3) 504 return root_node; 569 bb_model_->root_node(), tree_model_->GetRoot(), parent, &new_parent) [all...] |
/external/chromium_org/net/spdy/ |
spdy_priority_tree.h | 160 Node* root_node = &all_nodes_[kRootNodeId]; local 161 root_node->id = kRootNodeId; 162 root_node->weight = kDefaultWeight; 163 root_node->parent_id = static_cast<NodeId>(kRootNodeId); 164 root_node->child_list = new std::list<NodeId>; 165 root_node->priority = 1.0; 166 root_node->ready = true; 449 const Node* root_node = FindNode(kRootNodeId); local 450 DCHECK(root_node->priority == 1.0); 452 for (typename List::iterator it = root_node->child_list->begin() [all...] |
/external/chromium_org/chrome/browser/android/bookmarks/ |
bookmarks_bridge.cc | 183 const BookmarkNode* root_node = bookmark_model_->root_node(); local 184 permanent_nodes->push_back(root_node); 185 for (int i = 0; i < root_node->child_count(); ++i) { 186 permanent_nodes->push_back(root_node->GetChild(i)); 207 env, j_result_obj, bookmark_model_->root_node()->id(), 208 GetBookmarkType(bookmark_model_->root_node())); 238 DCHECK_EQ(bookmark_model_->root_node()->child_count(), 4); 442 folders.push_back(bookmark_model_->root_node()); [all...] |
/external/chromium_org/chrome/browser/sync/test/integration/ |
bookmarks_helper.cc | 145 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node()); 357 model_a->root_node(), base::Bind(&NodeCantBeSynced, model_a->client())); 359 model_b->root_node(), base::Bind(&NodeCantBeSynced, model_b->client())); 384 while (walker != foreign_model->root_node()) { 390 walker = bookmarks_helper::GetVerifierBookmarkModel()->root_node(); 623 const BookmarkNode* root_node = GetVerifierBookmarkModel()->root_node(); local 624 for (int i = 0; i < root_node->child_count(); ++i) { 625 const BookmarkNode* permanent_node = root_node->GetChild(i); 743 GetBookmarkModel(profile)->root_node()); [all...] |
/external/chromium_org/components/policy/core/common/ |
schema.cc | 152 const SchemaNode* root_node() const { function in class:policy::Schema::InternalStorage 769 return Schema(storage, storage->root_node()); [all...] |
/external/jemalloc/src/ |
ctl.c | 409 static const ctl_named_node_t root_node[] = { variable [all...] |
/external/opencv/cxcore/src/ |
cxpersistence.cpp | 1293 CvFileNode* root_node = (CvFileNode*)cvSeqPush( fs->roots, 0 ); local 2212 CvFileNode* root_node; local [all...] |