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

  /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.c 332 static prop_bt *root_node() function
438 return find_property(root_node(), name, strlen(name), NULL, 0, false);
614 pi = find_property(root_node(), name, namelen, value, valuelen, true);
  /external/chromium_org/ui/oak/
oak_tree_model.cc 32 WindowNode* root_node = new WindowNode(GetNodeTitleForWindow(root), root); local
33 TreeOfWindows* tree = new TreeOfWindows(root_node);
34 AddChildWindows(root, root_node);
  /external/chromium/chrome/browser/ui/gtk/bookmarks/
bookmark_tree_model.cc 105 const BookmarkNode* root_node = model->root_node(); local
106 for (int i = 0; i < root_node->child_count(); ++i) {
107 AddToTreeStoreAt(root_node->GetChild(i), selected_id, store, selected_iter,
179 const BookmarkNode* root_node = bb_model->root_node(); local
186 for (int j = 0; j < root_node->child_count(); ++j) {
187 const BookmarkNode* node = root_node->GetChild(j);
  /external/chromium_org/cc/resources/
worker_pool_perftest.cc 74 scoped_ptr<internal::GraphNode> root_node; local
76 root_node = make_scoped_ptr(new internal::GraphNode(root_task, 0u));
85 root_node.get(),
95 if (root_node)
96 graph.set(root_task, root_node.Pass());
  /external/chromium_org/chrome/browser/bookmarks/
bookmark_utils.cc 144 iterator(model->root_node(), PruneInvisibleFolders);
167 // only children of the root_node.
168 const BookmarkNode* root_node = model->root_node(); local
170 for (int i = 0; i < root_node->child_count(); ++i) {
171 const BookmarkNode* node = root_node->GetChild(i);
187 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node());
218 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node());
bookmark_model.h 248 const BookmarkNode* root_node() { return &root_; } function in class:BookmarkModel
  /external/chromium_org/chrome/browser/ui/gtk/bookmarks/
bookmark_tree_model.cc 120 const BookmarkNode* root_node = model->root_node(); local
121 for (int i = 0; i < root_node->child_count(); ++i) {
122 const BookmarkNode* child = root_node->GetChild(i);
195 const BookmarkNode* root_node = bb_model->root_node(); local
202 for (int j = 0; j < root_node->child_count(); ++j) {
203 const BookmarkNode* node = root_node->GetChild(j);
  /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/chrome/browser/bookmarks/
bookmark_model.h 188 const BookmarkNode* root_node() { return &root_; } function in class:BookmarkModel
  /external/chromium/chrome/browser/ui/views/bookmarks/
bookmark_editor_view.cc 418 EditorNode* root_node = CreateRootNode(); local
419 tree_model_.reset(new EditorTreeModel(root_node));
485 EditorNode* root_node = new EditorNode(std::wstring(), 0); local
486 const BookmarkNode* bb_root_node = bb_model_->root_node();
487 CreateNodes(bb_root_node, root_node);
488 DCHECK(root_node->child_count() == 2);
491 return root_node;
553 bb_model_->root_node(), tree_model_->GetRoot(), parent, &new_parent);
  /external/chromium_org/chrome/browser/ui/views/bookmarks/
bookmark_editor_view.cc 407 EditorNode* root_node = CreateRootNode(); local
408 tree_model_.reset(new EditorTreeModel(root_node));
481 EditorNode* root_node = new EditorNode(string16(), 0); local
482 const BookmarkNode* bb_root_node = bb_model_->root_node();
483 CreateNodes(bb_root_node, root_node);
484 DCHECK(root_node->child_count() >= 2 && root_node->child_count() <= 3);
487 if (root_node->child_count() == 3)
489 return root_node;
553 bb_model_->root_node(), tree_model_->GetRoot(), parent, &new_parent)
    [all...]
  /external/chromium_org/chrome/browser/sync/test/integration/
bookmarks_helper.cc 134 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node());
335 ui::TreeNodeIterator<const BookmarkNode> iterator_a(model_a->root_node());
336 ui::TreeNodeIterator<const BookmarkNode> iterator_b(model_b->root_node());
361 while (walker != foreign_model->root_node()) {
367 walker = bookmarks_helper::GetVerifierBookmarkModel()->root_node();
581 const BookmarkNode* root_node = GetVerifierBookmarkModel()->root_node(); local
582 for (int i = 0; i < root_node->child_count(); ++i) {
583 const BookmarkNode* permanent_node = root_node->GetChild(i);
663 GetBookmarkModel(profile)->root_node());
    [all...]
  /external/opencv/cxcore/src/
cxpersistence.cpp 1293 CvFileNode* root_node = (CvFileNode*)cvSeqPush( fs->roots, 0 ); local
2212 CvFileNode* root_node; local
    [all...]

Completed in 1029 milliseconds