| /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...] |
| /hardware/qcom/media/msm8974/mm-video-legacy/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;
|
| /hardware/qcom/media/msm8974/mm-video-v4l2/vidc/vdec/src/ |
| queue.c | 79 Node *new_node = (Node *) malloc(sizeof(Node)); local
81 if (new_node == NULL)
84 new_node->element = element;
85 new_node->next = NULL;
88 q->head = new_node;
90 q->tail->next = new_node;
93 q->tail = new_node;
|
| /device/huawei/angler/power/ |
| list.c | 50 struct list_node *new_node; local
56 if (!(new_node = malloc(sizeof(struct list_node)))) {
60 new_node->data = data;
61 new_node->next = head->next;
62 new_node->compare = head->compare;
63 new_node->dump = head->dump;
64 head->next = new_node;
66 return new_node;
|
| /device/lge/bullhead/power/ |
| list.c | 50 struct list_node *new_node; local
56 if (!(new_node = malloc(sizeof(struct list_node)))) {
60 new_node->data = data;
61 new_node->next = head->next;
62 new_node->compare = head->compare;
63 new_node->dump = head->dump;
64 head->next = new_node;
66 return new_node;
|
| /external/c-ares/ |
| ares_llist.c | 45 /* Inserts new_node before old_node */
46 void ares__insert_in_list(struct list_node* new_node,
48 new_node->next = old_node;
49 new_node->prev = old_node->prev;
50 old_node->prev->next = new_node;
51 old_node->prev = new_node;
|
| ares_llist.h | 34 void ares__insert_in_list(struct list_node* new_node,
|
| /external/libvpx/libvpx/ |
| 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;
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/ |
| 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;
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/ |
| btm_utils.py | 112 new_node = None
122 new_node = reduce_tree(node.children[0], parent)
125 new_node = MinNode(type=TYPE_ALTERNATIVES)
130 reduced = reduce_tree(child, new_node)
132 new_node.children.append(reduced)
136 new_node = MinNode(type=TYPE_GROUP)
138 reduced = reduce_tree(child, new_node)
140 new_node.children.append(reduced)
141 if not new_node.children:
143 new_node = Non
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/ |
| btm_utils.py | 112 new_node = None
122 new_node = reduce_tree(node.children[0], parent)
125 new_node = MinNode(type=TYPE_ALTERNATIVES)
130 reduced = reduce_tree(child, new_node)
132 new_node.children.append(reduced)
136 new_node = MinNode(type=TYPE_GROUP)
138 reduced = reduce_tree(child, new_node)
140 new_node.children.append(reduced)
141 if not new_node.children:
143 new_node = Non
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_utils.py | 112 new_node = None
122 new_node = reduce_tree(node.children[0], parent)
125 new_node = MinNode(type=TYPE_ALTERNATIVES)
130 reduced = reduce_tree(child, new_node)
132 new_node.children.append(reduced)
136 new_node = MinNode(type=TYPE_GROUP)
138 reduced = reduce_tree(child, new_node)
140 new_node.children.append(reduced)
141 if not new_node.children:
143 new_node = Non
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_utils.py | 112 new_node = None
122 new_node = reduce_tree(node.children[0], parent)
125 new_node = MinNode(type=TYPE_ALTERNATIVES)
130 reduced = reduce_tree(child, new_node)
132 new_node.children.append(reduced)
136 new_node = MinNode(type=TYPE_GROUP)
138 reduced = reduce_tree(child, new_node)
140 new_node.children.append(reduced)
141 if not new_node.children:
143 new_node = Non
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| ipa-utils.h | 32 bool new_node; member in struct:ipa_dfs_info
|
| /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-trace/catapult/third_party/gsutil/third_party/boto/boto/ |
| handler.py | 36 new_node = self.nodes[-1][1].startElement(name, attrs, self.connection)
37 if new_node is not None:
38 self.nodes.append((name, new_node))
|
| /external/v8/src/compiler/ |
| instruction-scheduler.cc | 63 ScheduleGraphNode* new_node = new (zone()) ScheduleGraphNode(zone(), instr); local
69 node->AddSuccessor(new_node);
73 last_live_in_reg_marker_->AddSuccessor(new_node);
75 last_live_in_reg_marker_ = new_node;
78 last_live_in_reg_marker_->AddSuccessor(new_node);
85 last_side_effect_instr_->AddSuccessor(new_node);
88 load->AddSuccessor(new_node);
91 last_side_effect_instr_ = new_node;
96 last_side_effect_instr_->AddSuccessor(new_node);
98 pending_loads_.push_back(new_node);
[all...] |
| /external/compiler-rt/lib/profile/ |
| GCDAProfiling.c | 492 struct writeout_fn_node *new_node = malloc(sizeof(struct writeout_fn_node)); local
493 new_node->fn = fn;
494 new_node->next = NULL;
497 writeout_fn_head = writeout_fn_tail = new_node;
499 writeout_fn_tail->next = new_node;
500 writeout_fn_tail = new_node;
524 struct flush_fn_node *new_node = malloc(sizeof(struct flush_fn_node)); local
525 new_node->fn = fn;
526 new_node->next = NULL;
529 flush_fn_head = flush_fn_tail = new_node;
[all...] |
| /external/opencv3/3rdparty/jinja2/ |
| visitor.py | 73 new_node = self.visit(old_value, *args, **kwargs)
74 if new_node is None:
77 setattr(node, field, new_node)
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| 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/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| 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;
|
| /ndk/sources/third_party/googletest/googletest/samples/ |
| 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;
|
| /system/extras/simpleperf/ |
| callchain.cpp | 78 std::unique_ptr<CallChainNode> new_node = AllocateNode(callchain, 0, period, 0); local
79 children.push_back(std::move(new_node));
104 std::unique_ptr<CallChainNode> new_node = AllocateNode(callchain, callchain_pos, period, 0); local
105 p->children.push_back(std::move(new_node));
|
| /external/selinux/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...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| ast.py | 113 def copy_location(new_node, old_node):
116 *old_node* to *new_node* if possible, and return *new_node*.
119 if attr in old_node._attributes and attr in new_node._attributes \
121 setattr(new_node, attr, getattr(old_node, attr))
122 return new_node
306 new_node = self.visit(old_value)
307 if new_node is None:
310 setattr(node, field, new_node)
|
