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

  /external/v8/src/compiler/
representation-change.h 237 Type* output_type, Node* use_node,
267 Type* output_type, Node* use_node,
271 Type* output_type, Node* use_node,
280 Type* output_type, Node* use_node,
283 Type* output_type, Node* use_node,
301 Node* InsertConversion(Node* node, const Operator* op, Node* use_node);
representation-change.cc 116 Node* use_node, UseInfo use_info) {
145 use_node, use_info);
150 use_node, use_info);
161 use_node, use_info);
168 return GetWord32RepresentationFor(node, output_rep, output_type, use_node,
186 Node* use_node, UseInfo use_info) {
248 node = InsertConversion(node, op, use_node);
261 node = InsertConversion(node, op, use_node);
266 node = InsertConversion(node, op, use_node);
295 return InsertConversion(node, op, use_node);
    [all...]
scheduler.cc 1491 auto& use_node = dominators[use_block]; local
    [all...]
simplified-lowering.cc 616 // Enqueue {use_node}'s {index} input if the {use} contains new information
619 void EnqueueInput(Node* use_node, int index,
621 Node* node = use_node->InputAt(index);
626 node_input_use_infos_[use_node->id()].SetAndCheckInput(use_node, index,
    [all...]
  /art/compiler/optimizing/
superblock_cloner.cc 43 for (auto use_node = uses.begin(), e = uses.end(); use_node != e; ++use_node) {
44 HInstruction* user = use_node->GetUser();
51 for (auto use_node = env_uses.begin(), e = env_uses.end(); use_node != e; ++use_node) {
52 HInstruction* user = use_node->GetUser()->GetHolder();
nodes.cc 1363 const HUseListNode<HInstruction*>& use_node = *it; local
    [all...]
nodes.h     [all...]
  /frameworks/minikin/tools/
mk_hyb_file.py 195 def pack(self, node_list, ch_map, use_node=False):
200 edge_start = 1 if use_node else 0
210 ((not use_node) or edges.is_free(ix))):
212 elif use_node:
214 nodes.is_free(ix) # actually don't need nodes at all when use_node,
222 if use_node:

Completed in 159 milliseconds