Home
last modified time | relevance | path

Searched refs:liveness (Results 1 – 25 of 83) sorted by relevance

1234

/external/tensorflow/tensorflow/compiler/xla/service/
Dbuffer_liveness_test.cc37 const LogicalBuffer& GetBuffer(const BufferLiveness& liveness, in GetBuffer() argument
40 const auto& pointed_to = liveness.points_to_analysis() in GetBuffer()
51 bool InstructionsMayInterfere(const BufferLiveness& liveness, in InstructionsMayInterfere() argument
55 return liveness.MayInterfere( in InstructionsMayInterfere()
56 GetBuffer(liveness, /*instruction=*/a, /*index=*/{}), in InstructionsMayInterfere()
57 GetBuffer(liveness, /*instruction=*/b, /*index=*/{})); in InstructionsMayInterfere()
63 bool TupleElementsMayInterfere(const BufferLiveness& liveness, in TupleElementsMayInterfere() argument
73 auto& points_to_analysis = liveness.points_to_analysis(); in TupleElementsMayInterfere()
82 return liveness.MayInterfere(*points_to_a[0], *points_to_b[0]); in TupleElementsMayInterfere()
88 bool InstructionMaybeLiveOut(const BufferLiveness& liveness, in InstructionMaybeLiveOut() argument
[all …]
Dbuffer_assignment.cc682 if (assignment->liveness().MayInterfere(assigned_buffer, buffer)) { in MaybeAssignBuffer()
703 if (assignment->liveness().MayInterfere(*param_buffer, buffer)) { in MaybeAssignBuffer()
714 if (assignment->liveness().MaybeLiveOut(buffer) && in MaybeAssignBuffer()
759 const BufferLiveness& liveness = assignment->liveness(); in AssignBuffersForComputation() local
761 liveness.hlo_ordering().SequentialOrder(*computation) != nullptr; in AssignBuffersForComputation()
788 [this, has_sequential_order, &liveness, &post_order_position, in AssignBuffersForComputation()
799 const bool a_live_out = liveness.MaybeLiveOut(*a); in AssignBuffersForComputation()
800 const bool b_live_out = liveness.MaybeLiveOut(*b); in AssignBuffersForComputation()
932 !liveness.MaybeLiveOut(*buffer)) { in AssignBuffersForComputation()
980 const HloOrdering& hlo_ordering = assignment->liveness().hlo_ordering(); in AssignBuffersWithSequentialOrdering()
[all …]
Dbuffer_liveness.cc41 std::unique_ptr<BufferLiveness> liveness( in Run() local
43 TF_RETURN_IF_ERROR(liveness->Analyze()); in Run()
44 return std::move(liveness); in Run()
Dbuffer_assignment.h355 const BufferLiveness& liveness() const { return *liveness_; } in liveness() function
384 std::unique_ptr<BufferLiveness> liveness, in BufferAssignment() argument
388 liveness_(std::move(liveness)), in BufferAssignment()
Dhlo_proto_util.cc23 assignment.liveness().hlo_ordering().ToProto(); in MakeHloProto()
/external/mesa3d/src/gallium/drivers/r600/sb/
Dsb_liveness.cpp40 bool liveness::visit(container_node& n, bool enter) { in visit()
51 bool liveness::visit(bb_node& n, bool enter) { in visit()
60 bool liveness::visit(alu_group_node& n, bool enter) { in visit()
67 bool liveness::visit(cf_node& n, bool enter) { in visit()
82 bool liveness::visit(alu_node& n, bool enter) { in visit()
91 bool liveness::visit(alu_packed_node& n, bool enter) { in visit()
101 bool liveness::visit(fetch_node& n, bool enter) { in visit()
110 bool liveness::visit(region_node& n, bool enter) { in visit()
151 bool liveness::visit(repeat_node& n, bool enter) { in visit()
160 bool liveness::visit(depart_node& n, bool enter) { in visit()
[all …]
Dsb_core.cpp184 SB_RUN_PASS(liveness, 0); in r600_sb_bytecode_process()
222 SB_RUN_PASS(liveness, 0); in r600_sb_bytecode_process()
/external/v8/src/compiler/
Dbytecode-analysis.cc304 BytecodeLiveness& liveness = liveness_map_.InitializeLiveness( in Analyze() local
307 UpdateOutLiveness(bytecode, *liveness.out, next_bytecode_in_liveness, in Analyze()
309 liveness.in->CopyFrom(*liveness.out); in Analyze()
310 UpdateInLiveness(bytecode, *liveness.in, iterator); in Analyze()
312 next_bytecode_in_liveness = liveness.in; in Analyze()
371 BytecodeLiveness& liveness = liveness_map_.GetLiveness(current_offset); in Analyze() local
373 UpdateOutLiveness(bytecode, *liveness.out, next_bytecode_in_liveness, in Analyze()
375 liveness.in->CopyFrom(*liveness.out); in Analyze()
376 UpdateInLiveness(bytecode, *liveness.in, iterator); in Analyze()
378 next_bytecode_in_liveness = liveness.in; in Analyze()
[all …]
Dstate-values-utils.cc140 Node** values, size_t count, const BitVector* liveness, in FillBufferWithValues() argument
152 if (liveness == nullptr || in FillBufferWithValues()
153 liveness->Contains(liveness_offset + static_cast<int>(*values_idx))) { in FillBufferWithValues()
172 size_t count, const BitVector* liveness, in BuildTree() argument
180 values, count, liveness, liveness_offset); in BuildTree()
194 count, liveness, liveness_offset); in BuildTree()
210 Node* subtree = BuildTree(values_idx, values, count, liveness, in BuildTree()
234 const BitVector* liveness, int liveness_offset) { in CheckTreeContainsValues() argument
242 if (liveness == nullptr || liveness->Contains(liveness_offset + i)) { in CheckTreeContainsValues()
255 const BitVector* liveness, in GetNodeForValues() argument
[all …]
Dliveness-analyzer.cc130 Node* frame_state, BitVector* liveness) { in ClearNonLiveFrameStateSlots() argument
131 DCHECK_EQ(liveness->length(), permanently_live_.length()); in ClearNonLiveFrameStateSlots()
136 int count = liveness->length() - (has_accumulator_ ? 1 : 0); in ClearNonLiveFrameStateSlots()
139 if (!liveness->Contains(i) && !permanently_live_.Contains(i)) { in ClearNonLiveFrameStateSlots()
140 Node* new_values = ClearNonLiveStateValues(locals_state, liveness); in ClearNonLiveFrameStateSlots()
150 int index = liveness->length() - 1; in ClearNonLiveFrameStateSlots()
151 if (!liveness->Contains(index) && !permanently_live_.Contains(index)) { in ClearNonLiveFrameStateSlots()
161 Node* values, BitVector* liveness) { in ClearNonLiveStateValues() argument
171 bool live = liveness->Contains(var) || permanently_live_.Contains(var); in ClearNonLiveStateValues()
Dstate-values-utils.h27 const BitVector* liveness = nullptr,
62 const BitVector* liveness,
66 const BitVector* liveness, int liveness_offset, size_t level);
Dliveness-analyzer.h23 void ClearNonLiveFrameStateSlots(Node* frame_state, BitVector* liveness);
40 Node* ClearNonLiveStateValues(Node* frame_state, BitVector* liveness);
/external/llvm/test/CodeGen/X86/
Dstackmap-liveness.ll1 ; RUN: llc < %s -mtriple=x86_64-apple-darwin -mcpu=corei7-avx -enable-patchpoint-liveness=false | F…
28 ; StackMap 1 (no liveness information available)
39 ; StackMap 1 (patchpoint liveness information enabled)
59 ; StackMap 2 (no liveness information available)
70 ; StackMap 2 (patchpoint liveness information enabled)
103 ; StackMap 3 (no liveness information available)
114 ; StackMap 3 (patchpoint liveness information enabled)
140 ; StackMap 4 (patchpoint liveness information enabled)
151 ; StackMap 5 (patchpoint liveness information enabled)
D2010-03-05-EFLAGS-Redef.ll4 ; branch folding pass. That makes a complete mess of the %EFLAGS liveness, but
5 ; we don't care about liveness this late anyway.
Deflags-copy-expansion.mir34 ; happens only when the heuristic for the liveness computation
35 ; failed. The liveness computation heuristic looks at 10 instructions
Di16lshr8pat.ll8 ; this doesn't make the register liveness information look like the whole
/external/swiftshader/third_party/subzero/tests_lit/llvm2ice_tests/
Dprune_unreachable.ll2 ; liveness analysis doesn't detect inconsistencies.
20 ; liveness analysis.
Dasm-verbose.ll1 ; Tests that -asm-verbose doesn't fail liveness validation because of
/external/llvm/test/CodeGen/MIR/X86/
Dliveout-register-mask.mir1 # RUN: llc -march=x86-64 -start-after stackmap-liveness -stop-after stackmap-liveness -o - %s | Fil…
/external/swiftshader/third_party/LLVM/test/CodeGen/X86/
D2010-03-05-EFLAGS-Redef.ll4 ; branch folding pass. That makes a complete mess of the %EFLAGS liveness, but
5 ; we don't care about liveness this late anyway.
/external/llvm/test/Transforms/RewriteStatepointsForGC/
Dliveness-basics.ll1 ; A collection of liveness test cases to ensure we're reporting the
35 ; A local kill should not effect liveness in predecessor block
56 ; should only propagate liveness from a phi to the appropriate predecessors.
117 ; Also, liveness after base pointer analysis can change based on new uses,
Dbasics.ll14 ; Two safepoints in a row (i.e. consistent liveness)
43 ; of merge. This was a bug in the dataflow liveness at one point.
/external/swiftshader/third_party/subzero/docs/
DREGALLOC.rst65 up. This means that the proportion of compilation time spent on liveness
94 merge complications, and keeps liveness analysis and register allocation fast
100 With respect to register allocation, the main purpose of liveness analysis is to
106 Basic liveness
140 multi-block liveness. Multi-block variables get lower-numbered bit vector
164 The basic liveness pass, described above, keeps track of when a variable's live
168 particular instruction. When the liveness pass finds a variable whose live
184 As a result of these data structures, performance of liveness analysis and live
187 the liveness passes.
392 an explosion in the running time of liveness analysis and register allocation?
[all …]
/external/volley/
Dconsumer-proguard-rules.pro2 # constrained liveness scope by the GC. This is needed to avoid keeping previous request references
/external/llvm/test/CodeGen/AMDGPU/
Dliveness.mir3 # We currently maintain a main liveness range which operates like a superset of

1234