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

  /external/v8/src/
locked-queue-inl.h 33 Node* old_node = nullptr; local
36 old_node = cur_node;
38 delete old_node;
  /external/v8/src/debug/
liveedit.js 94 function HarvestTodo(old_node) {
111 if (old_node.status == FunctionStatus.DAMAGED) {
112 CollectDamaged(old_node);
115 if (old_node.status == FunctionStatus.UNCHANGED) {
116 update_positions_list.push(old_node);
117 } else if (old_node.status == FunctionStatus.SOURCE_CHANGED) {
118 update_positions_list.push(old_node);
119 } else if (old_node.status == FunctionStatus.CHANGED) {
120 replace_code_list.push(old_node);
121 CollectNew(old_node.unmatched_new_nodes)
    [all...]
  /external/tensorflow/tensorflow/core/grappler/optimizers/
arithmetic_optimizer.h 73 void AddFrameControlDeps(const NodeDef* old_node,
arithmetic_optimizer.cc 540 const NodeDef* old_node, const std::vector<NodeDef*>& new_nodes,
543 const auto frame_it = frame_map_.find(old_node);
    [all...]
  /external/mesa3d/src/compiler/nir/
nir_lower_io_to_temporaries.c 48 foreach_two_lists(new_node, new_vars, old_node, old_vars) {
50 nir_variable *temp = exec_node_data(nir_variable, old_node, node);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/
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 \
120 and hasattr(old_node, attr):
121 setattr(new_node, attr, getattr(old_node, attr))
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
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 \
120 and hasattr(old_node, attr):
121 setattr(new_node, attr, getattr(old_node, attr))
  /external/python/cpython2/Lib/
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 \
120 and hasattr(old_node, attr):
121 setattr(new_node, attr, getattr(old_node, attr))
  /external/python/cpython3/Lib/
ast.py 118 def copy_location(new_node, old_node):
121 *old_node* to *new_node* if possible, and return *new_node*.
124 if attr in old_node._attributes and attr in new_node._attributes \
125 and hasattr(old_node, attr):
126 setattr(new_node, attr, getattr(old_node, attr))
  /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 \
120 and hasattr(old_node, attr):
121 setattr(new_node, attr, getattr(old_node, attr))
  /prebuilts/gdb/linux-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 \
120 and hasattr(old_node, attr):
121 setattr(new_node, attr, getattr(old_node, attr))
  /prebuilts/python/darwin-x86/2.7.5/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 \
120 and hasattr(old_node, attr):
121 setattr(new_node, attr, getattr(old_node, attr))
  /prebuilts/python/linux-x86/2.7.5/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 \
120 and hasattr(old_node, attr):
121 setattr(new_node, attr, getattr(old_node, attr))
  /external/dtc/
livetree.c 137 struct node *merge_nodes(struct node *old_node, struct node *new_node)
143 old_node->deleted = 0;
147 add_label(&old_node->labels, l->label);
158 delete_property_by_name(old_node, new_prop->name);
164 for_each_property_withdel(old_node, old_prop) {
180 add_property(old_node, new_prop);
193 delete_node_by_name(old_node, new_child->name);
199 for_each_child_withdel(old_node, old_child) {
209 add_child(old_node, new_child);
216 return old_node;
    [all...]
dtc.h 205 struct node *merge_nodes(struct node *old_node, struct node *new_node);
206 void add_orphan_node(struct node *old_node, struct node *new_node, char *ref);
  /external/tensorflow/tensorflow/core/graph/
mkl_layout_pass.cc     [all...]
  /external/mesa3d/src/gallium/drivers/swr/rasterizer/scripts/mako/
_ast_util.py 125 def copy_location(new_node, old_node):
131 if attr in old_node._attributes and attr in new_node._attributes \
132 and hasattr(old_node, attr):
133 setattr(new_node, attr, getattr(old_node, attr))
  /external/tensorflow/tensorflow/tools/graph_transforms/
transform_utils.cc 446 for (const NodeDef& old_node : old_nodes) {
448 *added_node = old_node;
539 for (const NodeDef& old_node : old_nodes) {
540 new_nodes->push_back(old_node);
  /external/selinux/libsemanage/src/
pywrap-test.py     [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
cgraph.h 678 struct cgraph_node * cgraph_create_virtual_clone (struct cgraph_node *old_node,
    [all...]

Completed in 1141 milliseconds