HomeSort by relevance Sort by last modified time
    Searched full:root_node (Results 1 - 25 of 66) sorted by null

1 2 3

  /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);
  /external/chromium_org/tools/perf/page_sets/endure/
browser_control_click.html 18 last_node.id = 'root_node';
19 var root_node = last_node;
27 document.body.appendChild(root_node);
31 var root_node = document.getElementById('root_node');
32 document.body.removeChild(root_node);
browser_control.html 22 var root_node = last_node;
30 document.body.appendChild(root_node);
  /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/chrome/browser/ui/gtk/bookmarks/
bookmark_tree_model.cc 118 const BookmarkNode* root_node = model->root_node(); local
119 for (int i = 0; i < root_node->child_count(); ++i) {
120 const BookmarkNode* child = root_node->GetChild(i);
193 const BookmarkNode* root_node = bb_model->root_node(); local
200 for (int j = 0; j < root_node->child_count(); ++j) {
201 const BookmarkNode* node = root_node->GetChild(j);
  /external/chromium_org/ui/accessibility/
ax_tree_unittest.cc 46 AXNode* root_node = dst_tree.GetRoot(); local
47 ASSERT_TRUE(root_node != NULL);
48 EXPECT_EQ(root.id, root_node->id());
49 EXPECT_EQ(root.role, root_node->data().role);
51 ASSERT_EQ(2, root_node->child_count());
53 AXNode* button_node = root_node->ChildAtIndex(0);
57 AXNode* checkbox_node = root_node->ChildAtIndex(1);
  /external/chromium_org/cc/resources/
worker_pool_perftest.cc 76 scoped_ptr<internal::GraphNode> root_node; local
78 root_node = make_scoped_ptr(new internal::GraphNode(root_task, 0u));
87 root_node.get(),
97 if (root_node)
98 graph.set(root_task, root_node.Pass());
  /external/opencv/ml/src/
mlnbayes.cpp 454 void CvNormalBayesClassifier::read( CvFileStorage* fs, CvFileNode* root_node )
469 CV_CALL( var_count = cvReadIntByName( fs, root_node, "var_count", -1 ));
470 CV_CALL( var_all = cvReadIntByName( fs, root_node, "var_all", -1 ));
471 CV_CALL( var_idx = (CvMat*)cvReadByName( fs, root_node, "var_idx" ));
472 CV_CALL( cls_labels = (CvMat*)cvReadByName( fs, root_node, "cls_labels" ));
492 CV_CALL( node = cvGetFileNodeByName( fs, root_node, "count" ));
503 CV_CALL( node = cvGetFileNodeByName( fs, root_node, "sum" ));
514 CV_CALL( node = cvGetFileNodeByName( fs, root_node, "productsum" ));
525 CV_CALL( node = cvGetFileNodeByName( fs, root_node, "avg" ));
536 CV_CALL( node = cvGetFileNodeByName( fs, root_node, "inv_eigen_values" ))
    [all...]
  /external/chromium/chrome/browser/sync/engine/
syncapi_unittest.cc 84 ReadNode root_node(&trans);
85 root_node.InitByRootLookup();
87 EXPECT_TRUE(node.InitUniqueByCreation(model_type, root_node, client_tag));
98 ReadNode root_node(&trans);
99 root_node.InitByRootLookup();
101 EXPECT_TRUE(node.InitUniqueByCreation(model_type, root_node, client_tag));
203 ReadNode root_node(&trans);
204 root_node.InitByRootLookup();
205 EXPECT_EQ(root_node.GetFirstChildId(), 0);
217 ReadNode root_node(&trans)
    [all...]
  /external/chromium_org/chrome/browser/bookmarks/
bookmark_utils.cc 155 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node(),
179 // only children of the root_node.
180 const BookmarkNode* root_node = model->root_node(); local
182 for (int i = 0; i < root_node->child_count(); ++i) {
183 const BookmarkNode* node = root_node->GetChild(i);
199 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node());
230 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node());
bookmark_codec_unittest.cc 152 AsMutable(model->root_node())->
154 AsMutable(model->root_node())->
375 model->SetNodeMetaInfo(model->root_node(), "model_info", "value1");
385 EXPECT_TRUE(model->root_node()->GetMetaInfo("model_info", &meta_value));
387 EXPECT_FALSE(model->root_node()->GetMetaInfo("other_key", &meta_value));
399 model->SetNodeSyncTransactionVersion(model->root_node(), 1);
409 EXPECT_EQ(1, model->root_node()->sync_transaction_version());
432 EXPECT_EQ(1, model.root_node()->sync_transaction_version());
442 EXPECT_FALSE(model.root_node()->GetMetaInfo(kSyncTransactionVersionKey,
  /external/chromium_org/third_party/openssl/openssl/crypto/
sparcv9cap.c 145 di_node_t root_node;
152 if ((root_node = (*di_init)("/",DINFOSUBTREE))!=DI_NODE_NIL)
154 (*di_walk_node)(root_node,DI_WALK_SIBFIRST,
156 (*di_fini)(root_node);
  /external/e2fsprogs/lib/ext2fs/
extent_dbg.ct 14 root_node, root;
  /external/openssl/crypto/
sparcv9cap.c 145 di_node_t root_node;
152 if ((root_node = (*di_init)("/",DINFOSUBTREE))!=DI_NODE_NIL)
154 (*di_walk_node)(root_node,DI_WALK_SIBFIRST,
156 (*di_fini)(root_node);
  /external/chromium_org/net/spdy/
spdy_priority_forest.h 112 enum NodeType { ROOT_NODE, NONROOT_ORDERED, NONROOT_UNORDERED };
114 Node() : type(ROOT_NODE), flags(0), child() {
173 new_node->type = ROOT_NODE;
206 if (node.type != ROOT_NODE) {
217 DCHECK_NE(ROOT_NODE, child->type);
225 if (node.type == ROOT_NODE) {
226 child->type = ROOT_NODE;
241 if (node != NULL && node->type == ROOT_NODE) {
251 if (node != NULL && node->type != ROOT_NODE) {
284 if (node->type != ROOT_NODE) {
    [all...]
  /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/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/android/bookmarks/
partner_bookmarks_shim.h 80 // the shim has now been loaded. Takes ownership of |root_node|.
81 void SetPartnerBookmarksRoot(BookmarkNode* root_node);
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/
NewItemSelectionDialog.java 57 * Can be null -- which means new items must be created in the root_node. */
59 /** The root node chosen by the user, either root_node or the one passed
84 * @param root_node The root of the Ui Tree, either the UiDocumentNode or a sub-node.
89 UiElementNode root_node) {
92 mLocalRootNode = root_node;
140 String xmlName = getLastUsedXmlName(root_node);
143 xmlName = getMostUsedXmlName(root_node);
148 xmlName = getLeafFileName(root_node);
  /external/chromium/chrome/browser/sync/
js_sync_manager_observer_unittest.cc 197 sync_api::ReadNode root_node(&trans);
198 root_node.InitByRootLookup();
201 model_type, root_node,
  /external/chromium_org/chrome/browser/sync/glue/
synced_device_tracker.cc 105 syncer::ReadNode root_node(&trans);
107 if (root_node.InitByTagLookup(
116 root_node.GetChildIds(&children);
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/pages/
ApplicationToggle.java 242 * @param root_node The root of the node hierarchy to examine.
246 private Node validateNode(Node root_node, Node xml_node) {
247 if (root_node == xml_node) {
250 for (Node node = root_node.getFirstChild(); node != null;
252 if (root_node == xml_node || validateNode(node, xml_node) != null) {
  /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/chromium_org/chrome/browser/ui/views/bookmarks/
bookmark_editor_view.cc 411 EditorNode* root_node = CreateRootNode(); local
412 tree_model_.reset(new EditorTreeModel(root_node));
485 EditorNode* root_node = new EditorNode(base::string16(), 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 && root_node->child_count() <= 3);
491 if (root_node->child_count() == 3)
493 return root_node;
557 bb_model_->root_node(), tree_model_->GetRoot(), parent, &new_parent)
    [all...]

Completed in 6184 milliseconds

1 2 3