Searched defs:live (Results 1 - 21 of 21) sorted by relevance

/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dbrw_fs_dead_code_eliminate.cpp81 BITSET_WORD *live = rzalloc_array(NULL, BITSET_WORD, BITSET_WORDS(num_vars)); local
85 memcpy(live, live_intervals->block_data[block->num].liveout,
96 result_live |= BITSET_TEST(live, var + i);
114 BITSET_CLEAR(live, var + i);
132 BITSET_SET(live, var + j);
141 ralloc_free(live);
H A Dbrw_vec4_dead_code_eliminate.cpp47 BITSET_WORD *live = rzalloc_array(NULL, BITSET_WORD, BITSET_WORDS(num_vars)); local
51 memcpy(live, live_intervals->block_data[block->num].liveout,
64 result_live[c] |= BITSET_TEST(live, v);
118 BITSET_CLEAR(live, v);
139 BITSET_SET(live, v);
153 ralloc_free(live);
/external/v8/src/compiler/
H A Dgraph-trimmer.cc23 // Mark end node as live.
25 // Compute transitive closure of live nodes.
27 Node* const live = live_[i]; local
28 for (Node* const input : live->inputs()) MarkAsLive(input);
30 // Remove dead->live edges.
31 for (Node* const live : live_) {
32 DCHECK(IsLive(live));
33 for (Edge edge : live->use_edges()) {
38 os << "DeadLink: " << *user << "(" << edge.index() << ") -> " << *live
H A Dliveness-analyzer.cc171 bool live = liveness->Contains(var) || permanently_live_.Contains(var); local
172 inputs_buffer_.push_back(live ? value_node : replacement_node_);
H A Dregister-allocator.cc543 // We cannot spill a live range that has a use requiring a register
645 // Partition original use intervals to the two live ranges.
676 // Partition original use positions to the two live ranges.
685 // to the use that no longer belongs to this live range.
730 // This implements an ordering on live ranges so that they are ordered by their
732 // allocation algorithm. If two live ranges start at the same offset then there
1096 TRACE("Shorten live range %d to [%d\n", vreg(), start.value());
1106 TRACE("Ensure live range %d in interval [%d %d[\n", vreg(), start.value(),
1127 TRACE("Add to live range %d interval [%d %d[\n", vreg(), start.value(),
1154 TRACE("Add to live rang
2029 ProcessInstructions(const InstructionBlock* block, BitVector* live) argument
2234 ProcessPhis(const InstructionBlock* block, BitVector* live) argument
2356 ProcessLoopHeader(const InstructionBlock* block, BitVector* live) argument
2387 BitVector* live = ComputeLiveOut(block, data()); local
3756 BitVector* live = live_in_sets[block->rpo_number().ToInt()]; local
[all...]
/external/mesa3d/src/compiler/nir/
H A Dnir_remove_dead_variables.c31 add_var_use_intrinsic(nir_intrinsic_instr *instr, struct set *live) argument
37 _mesa_set_add(live, instr->variables[1]->var);
42 * don't mark it as live for just a store.
46 _mesa_set_add(live, instr->variables[0]->var);
52 _mesa_set_add(live, instr->variables[i]->var);
59 add_var_use_call(nir_call_instr *instr, struct set *live) argument
63 _mesa_set_add(live, var);
68 _mesa_set_add(live, var);
73 add_var_use_tex(nir_tex_instr *instr, struct set *live) argument
77 _mesa_set_add(live, va
87 add_var_use_shader(nir_shader *shader, struct set *live) argument
95 add_var_use_intrinsic(nir_instr_as_intrinsic(instr), live); local
99 add_var_use_call(nir_instr_as_call(instr), live); local
103 add_var_use_tex(nir_instr_as_tex(instr), live); local
116 remove_dead_var_writes(nir_shader *shader, struct set *live) argument
141 remove_dead_vars(struct exec_list *var_list, struct set *live) argument
162 struct set *live = local
[all...]
H A Dnir_liveness.c39 * live range. This is true because the only way that the definition of an
41 * uses in phi no are in the live-out of the corresponding predecessor
42 * block but not in the live-in of the block containing the phi node.
88 BITSET_WORD *live = void_live; local
94 return true; /* undefined variables are never live */
96 BITSET_SET(live, src->ssa->live_index);
104 BITSET_WORD *live = void_live; local
106 BITSET_CLEAR(live, def->live_index);
111 /** Propagates the live in of succ across the edge to the live ou
[all...]
/external/v8/src/crankshaft/
H A Dhydrogen-environment-liveness.cc48 HBasicBlock* block, BitVector* live) {
49 // When a value is live in successor A but dead in B, we must
55 if (live_in_successor->Equals(*live)) continue;
56 for (int i = 0; i < live->length(); ++i) {
57 if (!live->Contains(i)) continue;
85 BitVector* live) {
87 live->Clear();
89 live->Union(*live_at_block_start_[it.Current()->block_id()]);
96 BitVector* live) {
101 if (!live
47 ZapEnvironmentSlotsInSuccessors( HBasicBlock* block, BitVector* live) argument
83 UpdateLivenessAtBlockEnd( HBasicBlock* block, BitVector* live) argument
94 UpdateLivenessAtInstruction( HInstruction* instr, BitVector* live) argument
[all...]
H A Dlithium-allocator.cc192 // We cannot spill a live range that has a use requiring a register
284 // Partition original use intervals to the two live ranges.
312 // Partition original use positions to the two live ranges.
321 // to the use that no longer belongs to this live range.
325 // Link the new live range in the chain before any of the other
339 // This implements an ordering on live ranges so that they are ordered by their
341 // allocation algorithm. If two live ranges start at the same offset then there
359 LAllocator::TraceAlloc("Shorten live range %d to [%d\n", id_, start.Value());
370 LAllocator::TraceAlloc("Ensure live range %d in interval [%d %d[\n",
395 LAllocator::TraceAlloc("Add to live rang
884 ProcessInstructions(HBasicBlock* block, BitVector* live) argument
1247 BitVector* live = live_in_sets_[block->block_id()]; local
1269 BitVector* live = ComputeLiveOut(block); local
[all...]
/external/tensorflow/tensorflow/core/grappler/costs/
H A Dgraph_memory.cc125 GraphMemory::LiveTensor* live; local
134 live = &device_tensors->front();
135 (*live_tensors)[name] = live;
137 live = it->second;
139 return live;
175 LiveTensor* live = FindOrCreateLiveTensor( local
177 live->memory_used = output.tensor_description()
183 live->allocation_time =
187 live->deallocation_time = std::max<Costs::Duration>(
188 live
224 LiveTensor* live = FindOrCreateLiveTensor( local
[all...]
/external/libchrome/base/strings/
H A Dstring_util_unittest.cc1229 const char kLive[] = "live";
1231 const std::string live = kLive; local
1232 std::string dead = live;
1236 EXPECT_EQ(kLive, live);
1237 EXPECT_EQ(4u, live.size());
/external/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_sched.h253 val_set live; // values live at the end of the alu clause member in class:r600_sb::post_scheduler
267 live(), ucm(), alu(sh), regmap(), cleared_interf() {}
H A Dsb_pass.h255 val_set live; member in class:r600_sb::gcm
268 live(), live_count(), pending_exec_mask_update() {}
361 val_set live;
/external/mesa3d/src/mesa/program/
H A Dprog_optimize.c807 /** A live register interval */
934 /* Variables that are live at the end of a loop will also be live at the
935 * beginning, so an instruction inside of a loop should have its live
1012 * Find the live intervals for each temporary register in the program.
1042 /* Build live intervals list from intermediate arrays */
1061 printf("Reg[%d] live [%d, %d]:",
1097 * We compute the "live interval" for all temporary registers then
1111 printf("Optimize: Begin live-interval register reallocation\n");
1130 /* loop over live interval
1132 const struct interval *live = liveIntervals.Intervals + i; local
[all...]
/external/tensorflow/tensorflow/compiler/xla/service/
H A Dhlo_rematerialization.cc300 // placed sequentially. Memory usage is the sum of the sizes of live values
340 // Returns the current memory usage. This is the sum of sizes of all live
366 // Whether this buffer is live-out of the computation.
450 // Returns whether the given instruction is live at the current program
516 // Mark buffer as has indirect use and live out.
560 << " is now live.";
622 // an earlier point in the program if rematerialization extends the live range
623 // of the operand of the instruction being rematerialized across the live
629 // be live at this program point, so initially set memory_reduced to the
646 // Account for any logical buffers whose live rang
743 string live = IsCurrentlyLive(buffer_id) ? " live" : ""; local
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DRewriteStatepointsForGC.cpp70 static cl::opt<bool, true> ClobberNonLiveOverride("rs4gc-clobber-non-live",
142 /// Values used in this block (and thus live); does not included values
146 /// Values live into this basic block (i.e. used by any
150 /// Values live out of this basic block (i.e. live into
171 /// The set of values known to be live across this safepoint
174 /// Mapping from live pointers to a base-defining-value
185 /// Record live values we are rematerialized instead of relocating.
205 /// Compute the live-in set for every basic block in the function
209 /// Given results from the dataflow liveness computation, find the set of live
1023 findBasePointers(const StatepointLiveSetTy &live, MapVector<Value *, Value *> &PointerToBase, DominatorTree *DT, DefiningValueMapTy &DVCache) argument
[all...]
/external/clang/lib/CodeGen/
H A DCGExprScalar.cpp3227 Expr *live = lhsExpr, *dead = rhsExpr; local
3228 if (!CondExprBool) std::swap(live, dead);
3234 Value *Result = Visit(live);
3236 // If the live part is a throw expression, it acts like it has a void
H A DCGExpr.cpp3496 const Expr *live = expr->getTrueExpr(), *dead = expr->getFalseExpr(); local
3497 if (!CondExprBool) std::swap(live, dead);
3500 // If the true case is live, we need to track its region.
3503 return EmitLValue(live);
/external/v8/src/heap/
H A Dmark-compact.cc682 // between live bytes and capacity of this page (= area).
686 // The algorithm sorts all pages by live bytes and then iterates through
838 // Clear the marking state of live large objects.
865 // Phase 1: tracing and marking live objects.
867 // after: a live object's map pointer is marked as '00'.
869 // Marking all live objects in the heap as part of mark-sweep or mark-compact
871 // marking, live objects' map pointers are marked indicating that the object
1460 // "dead" AllocationSites need to live long enough for a traversal of new
2237 // Global objects are roots and thus recorded as live.
2276 std::stringstream live, dea local
[all...]
/external/valgrind/helgrind/
H A Dlibhb_core.c595 static UWord stats__secmaps_in_map_shmem = 0; // # SecMaps 'live'
2913 VG_(printf)(" vts_tab live %4lu\n", nLive);
3034 "libhb: VTS GC: #%lu old size %lu live %lu (%2llu%%)\n",
3303 compacted all of the live entries at the low end of the
3309 /* Because all the live entries got slid down to the bottom of vts_tab: */
6428 UInt live = 0; local
6445 live++;
6448 VG_(printf)(" libhb: threads live: %u exit_and_joinedwith %u"
6450 live, llexit_and_joinedwith_done,
7078 and (2) the current nr of live secmap
[all...]
/external/owasp/sanitizer/tools/findbugs/lib/
H A Dfindbugs.jarMETA-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd/ edu/umd/cs/ edu/ ...

Completed in 700 milliseconds