Searched refs:new_node (Results 1 - 25 of 84) sorted by relevance

1234

/external/tensorflow/tensorflow/tools/graph_transforms/
H A Dremove_control_dependencies.cc31 NodeDef* new_node = output_graph_def->mutable_node()->Add(); local
32 *new_node = node;
33 new_node->clear_input();
36 new_node->add_input(input);
H A Dremove_device.cc36 NodeDef* new_node = output_graph_def->mutable_node()->Add(); local
37 *new_node = node;
38 new_node->set_device("");
H A Dset_device.cc34 NodeDef* new_node = output_graph_def->mutable_node()->Add(); local
35 *new_node = node;
37 new_node->set_device(new_device);
H A Dremove_attribute.cc56 NodeDef* new_node = output_graph_def->mutable_node()->Add(); local
57 *new_node = node;
60 new_node->mutable_attr()->erase(attribute_name);
H A Drename_op.cc47 NodeDef* new_node = output_graph_def->mutable_node()->Add(); local
48 *new_node = node;
50 new_node->set_op(new_op_name);
H A Drename_attribute.cc54 NodeDef* new_node = output_graph_def->mutable_node()->Add(); local
55 *new_node = node;
59 new_node->mutable_attr()->erase(old_attribute_name);
60 new_node->mutable_attr()->insert({new_attribute_name, attribute_value});
/external/toolchain-utils/binary_search_tool/full_bisect_test/
H A Dstack.c21 struct stack_struct *new_node = (struct stack_struct *) malloc (sizeof (struct stack_struct *)); local
22 new_node->data = value;
23 new_node->next = *stack;
24 *stack = new_node;
H A Dbuild.c5 new_node (int value) function
18 *root = new_node (value);
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
H A Dtest-trees.rb163 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/python/cpython2/Lib/lib2to3/
H A Dbtm_utils.py112 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
[all...]
/external/python/cpython3/Lib/lib2to3/
H A Dbtm_utils.py111 new_node = None
121 new_node = reduce_tree(node.children[0], parent)
124 new_node = MinNode(type=TYPE_ALTERNATIVES)
129 reduced = reduce_tree(child, new_node)
131 new_node.children.append(reduced)
135 new_node = MinNode(type=TYPE_GROUP)
137 reduced = reduce_tree(child, new_node)
139 new_node.children.append(reduced)
140 if not new_node.children:
142 new_node
[all...]
/external/libvpx/libvpx/
H A Dwarnings.c42 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;
52 *node = new_node;
/external/tensorflow/tensorflow/contrib/framework/python/framework/
H A Dgraph_util.py107 new_node = node_def_pb2.NodeDef()
109 new_node.input.append(node)
110 new_node.attr["_output_types"].list.type[:] = output_dtypes
111 new_node.attr["_output_quantized"].b = output_quantized
112 new_node.op = op_type
113 new_node.name = op_name
114 out.node.extend([new_node])
119 new_node = copy.deepcopy(name_to_node[n])
120 del new_node.input[:]
121 new_node
[all...]
/external/v8/src/compiler/
H A Dinstruction-scheduler.cc121 ScheduleGraphNode* new_node = new (zone()) ScheduleGraphNode(zone(), instr); local
127 node->AddSuccessor(new_node);
131 last_live_in_reg_marker_->AddSuccessor(new_node);
133 last_live_in_reg_marker_ = new_node;
136 last_live_in_reg_marker_->AddSuccessor(new_node);
142 last_deopt_->AddSuccessor(new_node);
149 last_side_effect_instr_->AddSuccessor(new_node);
152 load->AddSuccessor(new_node);
155 last_side_effect_instr_ = new_node;
160 last_side_effect_instr_->AddSuccessor(new_node);
[all...]
/external/ltp/utils/ffsb-6.0-rc2/
H A Drbt.c285 rb_node *new_node; local
292 new_node = rbnode_construct(object, black);
293 if (!new_node)
295 tree->root = new_node;
297 return new_node;
305 new_node = rbnode_construct(object, red);
306 if (!new_node)
317 free(new_node);
325 cur_node->left = new_node;
326 new_node
363 rb_node *new_node; local
423 rb_node *new_node; local
[all...]
/external/tensorflow/tensorflow/core/grappler/optimizers/
H A Dgraph_rewriter.cc64 NodeDef* new_node) {
65 ForwardInputsInternal(original_node, nodes_to_delete, false, new_node);
66 if (!new_node->name().empty()) {
67 optimized_nodes_[new_node->name()] = new_node;
71 for (int i = 0; i < new_node->input_size(); ++i) {
72 if (!IsControlInput(new_node->input(i))) {
73 new_node->mutable_input()->SwapElements(pos, i);
77 DedupControlInputs(new_node);
182 bool add_as_control, NodeDef* new_node) {
61 ForwardInputs( const NodeDef& original_node, const std::unordered_set<const NodeDef*>& nodes_to_delete, NodeDef* new_node) argument
179 ForwardInputsInternal( const NodeDef& node, const std::unordered_set<const NodeDef*>& nodes_to_delete, bool add_as_control, NodeDef* new_node) argument
[all...]
H A Dauto_parallel.cc207 auto new_node = graph->add_node(); local
208 *new_node = *all_nodes_[node];
209 for (int i = 0; i < new_node->input_size(); i++) {
210 if (NotSharedNode(NodeName(new_node->input(i)))) {
211 string new_name = AddPrefixToNodeName(new_node->input(i), prefix);
212 *new_node->mutable_input(i) = new_name;
221 auto new_node = graph->add_node(); local
222 *new_node = *all_nodes_[node];
223 if (NotSharedNode(new_node->name())) {
224 new_node
[all...]
/external/libmojo/third_party/jinja2/
H A Dvisitor.py73 new_node = self.visit(old_value, *args, **kwargs)
74 if new_node is None:
77 setattr(node, field, new_node)
/external/tensorflow/tensorflow/contrib/lite/toco/tensorflow_graph_matching/
H A Dresolve_cluster.cc37 NodeDef* new_node = graph->add_node(); local
38 new_node->set_op(node.op());
39 new_node->set_name(node.name());
40 new_node->set_device(node.device());
49 new_node->add_input(cluster_name);
55 new_node->add_input(node_input);
59 (*new_node->mutable_attr())[attr.first] = attr.second;
/external/tensorflow/tensorflow/python/framework/
H A Dgraph_util_impl.py313 new_node = node_def_pb2.NodeDef()
314 new_node.CopyFrom(node)
316 del new_node.input[:]
321 new_node.input.append(full_input_name)
322 nodes_after_removal.append(new_node)
342 new_node = node_def_pb2.NodeDef()
343 new_node.CopyFrom(node)
345 del new_node.input[:]
351 new_node.input.append(full_input_name)
352 nodes_after_splicing.append(new_node)
[all...]
/external/compiler-rt/lib/profile/
H A DGCDAProfiling.c502 struct writeout_fn_node *new_node = malloc(sizeof(struct writeout_fn_node)); local
503 new_node->fn = fn;
504 new_node->next = NULL;
507 writeout_fn_head = writeout_fn_tail = new_node;
509 writeout_fn_tail->next = new_node;
510 writeout_fn_tail = new_node;
534 struct flush_fn_node *new_node = malloc(sizeof(struct flush_fn_node)); local
535 new_node->fn = fn;
536 new_node->next = NULL;
539 flush_fn_head = flush_fn_tail = new_node;
[all...]
/external/google-breakpad/src/testing/gtest/samples/
H A Dsample3-inl.h117 QueueNode<E>* new_node = new QueueNode<E>(element); local
120 head_ = last_ = new_node;
123 last_->next_ = new_node;
124 last_ = new_node;
/external/googletest/googletest/samples/
H A Dsample3-inl.h117 QueueNode<E>* new_node = new QueueNode<E>(element); local
120 head_ = last_ = new_node;
123 last_->next_ = new_node;
124 last_ = new_node;
/external/protobuf/gtest/samples/
H A Dsample3-inl.h118 QueueNode<E>* new_node = new QueueNode<E>(element); local
121 head_ = last_ = new_node;
124 last_->next_ = new_node;
125 last_ = new_node;
/external/tensorflow/tensorflow/contrib/py2tf/pyct/
H A Dast_util_test.py72 new_node = ast_util.copy_clean(node)
73 self.assertFalse(node is new_node)
74 self.assertFalse(ret is new_node.body[0])
75 self.assertFalse(hasattr(new_node.body[0], '__foo'))

Completed in 1659 milliseconds

1234