HomeSort by relevance Sort by last modified time
    Searched refs:new_node (Results 1 - 18 of 18) sorted by null

  /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;
  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/
ipa-utils.h 29 bool new_node; member in struct:ipa_dfs_info
  /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
  /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;
  /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;
  /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/gtest/src/
gtest-internal-inl.h 301 ListNode<E> * new_node = new ListNode<E>(element); local
304 head_ = last_ = new_node;
307 last_->next_ = new_node;
308 last_ = new_node;
315 ListNode<E>* const new_node = new ListNode<E>(element); local
318 head_ = last_ = new_node;
321 new_node->next_ = head_;
322 head_ = new_node;
360 ListNode<E>* const new_node = new ListNode<E>(element); local
361 new_node->next_ = node->next_
    [all...]
  /external/webkit/JavaScriptCore/wtf/
AVLTree.h 153 inline handle subst(handle new_node);
918 AVLTree<Abstractor, maxDepth, BSet>::subst(handle new_node)
929 cmp = cmp_n_n(new_node, h);
939 set_lt(new_node, get_lt(h));
940 set_gt(new_node, get_gt(h));
941 set_bf(new_node, get_bf(h));
945 abs.root = new_node;
949 set_lt(parent, new_node);
951 set_gt(parent, new_node);
  /external/libvpx/vpx_mem/memory_manager/include/
cavl_impl.h 802 L_SC AVL_HANDLE L_(subst)(L_(avl) *l_tree, AVL_HANDLE new_node)
815 cmp = AVL_COMPARE_NODE_NODE(new_node, h);
828 AVL_SET_LESS(new_node, AVL_GET_LESS(h, 0))
829 AVL_SET_GREATER(new_node, AVL_GET_GREATER(h, 0))
830 AVL_SET_BALANCE_FACTOR(new_node, AVL_GET_BALANCE_FACTOR(h))
834 l_tree->root = new_node;
839 AVL_SET_LESS(parent, new_node)
841 AVL_SET_GREATER(parent, new_node)
cavl_if.h 106 L_SC AVL_HANDLE L_(subst)(L_(avl) *tree, AVL_HANDLE new_node); variable
  /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/bison/src/
print_graph.c 177 new_node (&n);
vcg.h     [all...]
vcg.c 133 new_node (&g->node);
138 new_node (node *n) function
  /build/tools/droiddoc/templates/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/e2fsprogs/e2fsck/
dict.c 1268 static dnode_t *new_node(void *c) function
    [all...]
  /external/srec/srec/crec/
srec_context.c 2233 FSMnode* new_node; local
    [all...]

Completed in 875 milliseconds