/external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
H A D | ptw32_MCS_lock.c | 257 ptw32_mcs_node_transfer (ptw32_mcs_local_node_t * new_node, ptw32_mcs_local_node_t * old_node) argument 259 new_node->lock = old_node->lock; 260 new_node->nextFlag = 0; /* Not needed - used only in initial Acquire */ 261 new_node->readyFlag = 0; /* Not needed - we were waiting on this */ 262 new_node->next = 0; 264 if ((ptw32_mcs_local_node_t *)PTW32_INTERLOCKED_COMPARE_EXCHANGE_PTR((PTW32_INTERLOCKED_PVOID_PTR)new_node->lock, 265 (PTW32_INTERLOCKED_PVOID)new_node, 276 new_node->next = old_node->next;
|
/external/oprofile/libdb/ |
H A D | db_insert.c | 23 odb_index_t new_node; local 36 new_node = data->descr->current_size; 38 node = &data->node_base[new_node]; 44 data->hash_base[index] = new_node;
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | rblist.c | 17 struct rb_node *parent = NULL, *new_node; local 33 new_node = rblist->node_new(rblist, new_entry); 34 if (new_node == NULL) 37 rb_link_node(new_node, parent, p); 38 rb_insert_color(new_node, &rblist->entries);
|
/external/chromium_org/chrome/browser/ui/bookmarks/ |
H A D | recently_used_folders_combo_model_unittest.cc | 86 const BookmarkNode* new_node = GetModel()->AddURL( local 89 RecentlyUsedFoldersComboModel model(GetModel(), new_node); local 103 const BookmarkNode* new_node = GetModel()->AddURL( local 105 RecentlyUsedFoldersComboModel model(GetModel(), new_node); local
|
/external/chromium_org/components/bookmarks/test/ |
H A D | bookmark_test_helpers.cc | 71 const BookmarkNode* new_node = local 73 end_pos = AddNodesFromString(model, new_node, model_string,
|
/external/chromium_org/testing/gtest/samples/ |
H A D | sample3-inl.h | 117 QueueNode<E>* new_node = new QueueNode<E>(element); local 120 head_ = last_ = new_node; 123 last_->next_ = new_node; 124 last_ = new_node;
|
/external/chromium_org/third_party/libvpx/source/libvpx/ |
H A D | warnings.c | 42 struct WarningListNode *new_node = malloc(sizeof(*new_node)); local 43 if (new_node == NULL) { 47 new_node->warning_string = warning_string; 48 new_node->next_warning = NULL; 53 *node = new_node;
|
/external/doclava/res/assets/templates/assets/ |
H A D | doclava-developer-reference.js | 98 function new_node(me, mom, text, link, children_data, api_level) function 201 mom.children[i] = new_node(me, mom, node_data[0], node_data[1],
|
/external/libvpx/libvpx/ |
H A D | warnings.c | 42 struct WarningListNode *new_node = malloc(sizeof(*new_node)); local 43 if (new_node == NULL) { 47 new_node->warning_string = warning_string; 48 new_node->next_warning = NULL; 53 *node = new_node;
|
/external/lldb/examples/scripting/ |
H A D | dictionary.c | 68 tree_node *new_node = (tree_node *) malloc (sizeof (tree_node)); local 69 new_node->word = strdup (word); 70 new_node->left = NULL; 71 new_node->right = NULL; 72 root->left = new_node; 81 tree_node *new_node = (tree_node *) malloc (sizeof (tree_node)); local 82 new_node->word = strdup (word); 83 new_node->left = NULL; 84 new_node->right = NULL; 85 root->right = new_node; 108 tree_node *new_node = (tree_node *) malloc (sizeof (tree_node)); local [all...] |
/external/protobuf/gtest/samples/ |
H A D | sample3-inl.h | 118 QueueNode<E> * new_node = new QueueNode<E>(element); local 121 head_ = last_ = new_node; 124 last_->next_ = new_node; 125 last_ = new_node;
|
/external/chromium_org/ui/views/controls/tree/ |
H A D | tree_view_unittest.cc | 81 TestNode* new_node = new TestNode; local 82 new_node->SetTitle(ASCIIToUTF16(title)); 83 model_.Add(parent, new_node, index); 84 return new_node;
|
/external/chromium_org/ui/views/examples/ |
H A D | tree_view_example.cc | 85 NodeType* new_node = new NodeType(selected_node->GetTitle(), 1); local 86 model_.Add(selected_node, new_node, selected_node->child_count()); 87 tree_view_->SetSelectedNode(new_node);
|
/external/libsepol/src/ |
H A D | node_record.c | 602 sepol_node_t *new_node = NULL; local 603 if (sepol_node_create(handle, &new_node) < 0) 607 new_node->addr = malloc(node->addr_sz); 608 new_node->mask = malloc(node->mask_sz); 609 if (!new_node->addr || !new_node->mask) 612 memcpy(new_node->addr, node->addr, node->addr_sz); 613 memcpy(new_node->mask, node->mask, node->mask_sz); 614 new_node->addr_sz = node->addr_sz; 615 new_node [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
H A D | test-trees.rb | 163 r0 = new_node new_token(101) 164 r1 = new_node new_token(102) 166 r1.add_child(new_node new_token(103)) 167 r2 = new_node new_token(106) 168 r2.add_child new_node( new_token 107 ) 170 r0.add_child new_node( new_token 104 ) 171 r0.add_child new_node( new_token 105 ) 189 r0 = new_node new_token(101) 190 r1 = new_node new_token(102) 192 r1.add_child new_node( new_toke 306 def new_node(token) method in class:TestTreeNodeStream 450 def new_node(token) method in class:TestCommonTreeNodeStream 786 def new_node(token) method in class:TestCommonTree [all...] |
/external/chromium_org/chrome/browser/ui/views/bookmarks/ |
H A D | bookmark_editor_view_unittest.cc | 304 const BookmarkNode* new_node = bb_node->GetChild(1); local 306 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle()); 307 EXPECT_TRUE(GURL(base_path() + "a") == new_node->url()); 326 const BookmarkNode* new_node = other_node->GetChild(0); local 328 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle()); 329 EXPECT_TRUE(GURL(base_path() + "a") == new_node->url()); 347 const BookmarkNode* new_node = other_node->GetChild(0); local 349 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle()); 369 const BookmarkNode* new_node = bb_node->GetChild(1); local 370 EXPECT_EQ(BookmarkNode::FOLDER, new_node 398 const BookmarkNode* new_node = model_->other_node()->GetChild(2); local [all...] |
H A D | bookmark_editor_view.cc | 465 EditorNode* new_node = new EditorNode( local 467 // |new_node| is now owned by |parent|. 468 tree_model_->Add(parent, new_node, parent->child_count()); 469 return new_node;
|
/external/chromium_org/native_client_sdk/src/libraries/nacl_io/devfs/ |
H A D | dev_fs.cc | 296 ScopedNode new_node(new FsNode(this, other_fs)); 297 return fs_dir_->AddChild(path, new_node); 311 new_node = ScopedNode(new klass(this)); \ 312 error = root_->AddChild(path, new_node); \ 317 new_node = ScopedNode(new klass(this, arg)); \ 318 error = root_->AddChild(path, new_node); \ 329 ScopedNode new_node; local 342 new_node->Ioctl(NACL_IOC_PIPE_SETNAME, "jspipe1"); 344 new_node->Ioctl(NACL_IOC_PIPE_SETNAME, "jspipe2"); 346 new_node [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vpx_mem/memory_manager/include/ |
H A D | cavl_if.h | 106 L_SC AVL_HANDLE L_(subst)(L_(avl) *tree, AVL_HANDLE new_node); variable
|
/external/chromium_org/ui/accessibility/ |
H A D | ax_tree.cc | 139 AXNode* new_node = new AXNode(parent, id, index_in_parent); local 140 id_map_[new_node->id()] = new_node; 142 delegate_->OnNodeCreated(new_node); 143 return new_node;
|
/external/libvpx/libvpx/vpx_mem/memory_manager/include/ |
H A D | cavl_if.h | 106 L_SC AVL_HANDLE L_(subst)(L_(avl) *tree, AVL_HANDLE new_node); variable
|
/external/valgrind/main/callgrind/ |
H A D | clo.c | 221 config_node *new_node; local 224 new_node = new_config(n->name, len); 226 nprev->next = new_node; 228 node->sub_node[ n->name[0]%NODE_DEGREE ] = new_node; 229 new_node->next = n->next; 231 new_node->sub_node[ n->name[len]%NODE_DEGREE ] = n; 242 /* this sub_node of new_node could already be set: chain! */ 243 new_sub->next = new_node->sub_node[ name[0]%NODE_DEGREE ]; 244 new_node->sub_node[ name[0]%NODE_DEGREE ] = new_sub;
|
/external/chromium_org/net/spdy/ |
H A D | spdy_priority_forest.h | 173 Node* new_node = &all_nodes_[node_id]; local 174 new_node->type = ROOT_NODE; 175 new_node->depends_on.priority = priority; 191 Node* new_node = &all_nodes_[node_id]; local 192 new_node->type = (unordered ? NONROOT_UNORDERED : NONROOT_ORDERED); 193 new_node->depends_on.parent_id = parent_id;
|
H A D | spdy_priority_tree.h | 218 Node* new_node = &all_nodes_[node_id]; local 219 new_node->id = node_id; 220 new_node->weight = weight; 221 new_node->parent_id = parent_id; 224 new_node->child_list = parent->child_list; 225 new_node->total_child_weights = parent->total_child_weights; 227 for (typename List::iterator it = new_node->child_list->begin(); 228 it != new_node->child_list->end(); ++it) { 236 new_node->child_list = new std::list<NodeId>;
|
/external/chromium_org/third_party/bintrees/bintrees/ |
H A D | ctrees.c | 27 node_t *new_node = PyMem_Malloc(sizeof(node_t)); local 28 if (new_node != NULL) { 29 KEY(new_node) = key; 31 VALUE(new_node) = value; 33 LEFT_NODE(new_node) = NULL; 34 RIGHT_NODE(new_node) = NULL; 35 XDATA(new_node) = xdata; 37 return new_node; 299 int new_node = 0; local 316 new_node [all...] |