HomeSort by relevance Sort by last modified time
    Searched defs:new_node (Results 1 - 25 of 30) sorted by null

1 2

  /external/oprofile/libdb/
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;
  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/
ipa-utils.h 29 bool new_node; member in struct:ipa_dfs_info
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
ipa-utils.h 33 bool new_node; member in struct:ipa_dfs_info
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
ipa-utils.h 33 bool new_node; member in struct:ipa_dfs_info
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
ipa-utils.h 33 bool new_node; member in struct:ipa_dfs_info
  /hardware/qcom/media/mm-video/vidc/vdec/src/
queue.c 81 Node *new_node = (Node *) malloc(sizeof(Node)); local
83 if (new_node == NULL)
86 new_node->element = element;
87 new_node->next = NULL;
91 q->head = new_node;
95 q->tail->next = new_node;
98 q->tail = new_node;
  /external/chromium/testing/gtest/samples/
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/doclava/res/assets/templates/assets/
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/gtest/samples/
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/protobuf/gtest/samples/
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;
  /build/tools/droiddoc/templates-pdk/assets/
android-developer-reference.js 96 function new_node(me, mom, text, link, children_data, api_level) function
199 mom.children[i] = new_node(me, mom, node_data[0], node_data[1],
  /external/bison/src/
vcg.c 133 new_node (&g->node);
138 new_node (node *n) function
  /external/chromium/chrome/browser/ui/gtk/bookmarks/
bookmark_editor_gtk_unittest.cc 283 const BookmarkNode* new_node = bb_node->GetChild(3); local
284 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
285 EXPECT_TRUE(GURL(base_path() + "a") == new_node->GetURL());
304 const BookmarkNode* new_node = other_node->GetChild(0); local
306 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
307 EXPECT_TRUE(GURL(base_path() + "a") == new_node->GetURL());
323 const BookmarkNode* new_node = other_node->GetChild(0); local
324 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
  /external/chromium/chrome/browser/ui/views/bookmarks/
bookmark_editor_view_unittest.cc 265 const BookmarkNode* new_node = bb_node->GetChild(3); local
267 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
268 EXPECT_TRUE(GURL(base_path() + "a") == new_node->GetURL());
285 const BookmarkNode* new_node = other_node->GetChild(0); local
287 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
288 EXPECT_TRUE(GURL(base_path() + "a") == new_node->GetURL());
304 const BookmarkNode* new_node = other_node->GetChild(0); local
306 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
326 const BookmarkNode* new_node = local
328 EXPECT_EQ(BookmarkNode::FOLDER, new_node->type())
356 const BookmarkNode* new_node = model_->other_node()->GetChild(2); local
    [all...]
bookmark_editor_view.cc 460 EditorNode* new_node = new EditorNode(); local
461 new_node->set_title(
463 new_node->value = 0;
464 // new_node is now owned by parent.
465 tree_model_->Add(parent, new_node, parent->child_count());
466 return new_node;
  /external/libsepol/src/
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->mask_sz = node->mask_sz
    [all...]
conditional.c 143 cond_node_t *new_node; local
146 new_node = (cond_node_t *)malloc(sizeof(cond_node_t));
147 if (!new_node) {
150 memset(new_node, 0, sizeof(cond_node_t));
153 new_node->expr = cond_copy_expr(node->expr);
154 if (!new_node->expr) {
155 free(new_node);
158 new_node->cur_state = cond_evaluate_expr(p, new_node->expr);
159 new_node->nbools = node->nbools
    [all...]
  /external/libvpx/vpx_mem/memory_manager/include/
cavl_if.h 106 L_SC AVL_HANDLE L_(subst)(L_(avl) *tree, AVL_HANDLE new_node); variable
  /external/antlr/antlr-3.4/runtime/Ruby/test/unit/
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_token 103
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/valgrind/main/callgrind/
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/bluetooth/glib/glib/
ghash.c 414 GHashNode *new_node; local
422 new_node = &new_nodes [hash_val];
424 while (new_node->key_hash)
429 new_node = &new_nodes [hash_val];
432 *new_node = *node;
    [all...]
  /external/chromium/chrome/browser/bookmarks/
bookmark_model.cc 383 BookmarkNode* new_node = new BookmarkNode(generate_next_node_id(), local
385 new_node->set_date_folder_modified(Time::Now());
386 new_node->set_title(title);
387 new_node->set_type(BookmarkNode::FOLDER);
389 return AddNode(AsMutable(parent), index, new_node, false);
415 BookmarkNode* new_node = new BookmarkNode(generate_next_node_id(), url); local
416 new_node->set_title(title);
417 new_node->set_date_added(creation_time);
418 new_node->set_type(BookmarkNode::URL);
423 nodes_ordered_by_url_set_.insert(new_node);
    [all...]
bookmark_model_unittest.cc 189 const BookmarkNode* new_node = model.AddURL(root, 0, title, url); local
194 ASSERT_EQ(title, new_node->GetTitle());
195 ASSERT_TRUE(url == new_node->GetURL());
196 ASSERT_EQ(BookmarkNode::URL, new_node->type());
197 ASSERT_TRUE(new_node == model.GetMostRecentlyAddedNodeForURL(url));
199 EXPECT_TRUE(new_node->id() != root->id() &&
200 new_node->id() != model.other_node()->id());
207 const BookmarkNode* new_node = model.AddFolder(root, 0, title); local
212 ASSERT_EQ(title, new_node->GetTitle());
213 ASSERT_EQ(BookmarkNode::FOLDER, new_node->type())
587 TestNode* new_node = local
    [all...]
  /external/chromium/sdch/open-vcdiff/src/gtest/src/
gtest-internal-inl.h 239 ListNode<E> * new_node = new ListNode<E>(element); local
242 head_ = last_ = new_node;
245 last_->next_ = new_node;
246 last_ = new_node;
253 ListNode<E>* const new_node = new ListNode<E>(element); local
256 head_ = last_ = new_node;
259 new_node->next_ = head_;
260 head_ = new_node;
298 ListNode<E>* const new_node = new ListNode<E>(element); local
299 new_node->next_ = node->next_
    [all...]
  /external/e2fsprogs/e2fsck/
dict.c 1268 static dnode_t *new_node(void *c) function
    [all...]

Completed in 1608 milliseconds

1 2