| /external/v8/src/compiler/ |
| all-nodes.h | 19 // Constructor. Traverses the graph and builds the {live} sets.
28 NodeVector live; // Nodes reachable from end. member in class:v8::internal::compiler::AllNodes
|
| graph-trimmer.cc | 23 // 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
|
| liveness-analyzer.cc | 132 bool live = liveness->Contains(i) || permanently_live_.Contains(i); local
133 if (!live || locals_state->InputAt(i) != replacement_node_) {
149 bool live = liveness->Contains(var) || permanently_live_.Contains(var); local
150 inputs_buffer_.push_back(live ? node.node : replacement_node_);
190 os << " Live set: ";
|
| register-allocator.cc | 552 // We cannot spill a live range that has a use requiring a register
652 // Partition original use intervals to the two live ranges.
683 // Partition original use positions to the two live ranges.
692 // to the use that no longer belongs to this live range.
733 // This implements an ordering on live ranges so that they are ordered by their
735 // allocation algorithm. If two live ranges start at the same offset then there
931 // Live ranges defined in deferred blocks stay in deferred blocks, so we
2272 BitVector* live = ComputeLiveOut(block, data()); local
3513 BitVector* live = live_in_sets[block->rpo_number().ToInt()]; local
[all...] |
| /dalvik/libdex/ |
| DexDebugInfo.cpp | 117 bool live; member in struct:LocalInfo
123 if (localCb != NULL && localInReg[reg].live) {
170 localInReg[argReg].live = true;
207 localInReg[reg].live = true;
248 localInReg[reg].live = true;
259 localInReg[reg].live = false;
276 * If the register is live, the "restart" is superfluous,
279 if (!localInReg[reg].live) {
281 localInReg[reg].live = true;
|
| /art/runtime/gc/accounting/ |
| space_bitmap.cc | 163 uintptr_t* live = live_bitmap.bitmap_begin_; local
166 uintptr_t garbage = live[i] & ~mark[i];
|
| /external/libchrome/base/strings/ |
| string_util_unittest.cc | 1131 const std::string live = kLive; local
[all...] |
| /external/mesa3d/src/mesa/program/ |
| prog_optimize.c | 839 /** A live register interval */
966 /* Variables that are live at the end of a loop will also be live at the
967 * beginning, so an instruction inside of a loop should have its live
1044 * Find the live intervals for each temporary register in the program.
1073 /* Build live intervals list from intermediate arrays */
1092 printf("Reg[%d] live [%d, %d]:",
1163 const struct interval *live = liveIntervals.Intervals + i; local
[all...] |
| /art/compiler/optimizing/ |
| register_allocator.cc | 184 // intervals belonging to the live-in set of the catch/header block to be spilled.
281 // create live registers. We should find another place, but this is currently the
289 // We add a synthesized range at this position to record the live registers
293 // And knowing the full stack size requires to know the maximum number of live
496 // Allocate a bit vector per register. A live interval that has a register
497 // allocated will populate the associated bit vector based on its live ranges.
667 // Synthesized interval to record the maximum number of live registers
765 // The input must be live until the end of `defined_by`, to comply to
1929 BitVector* live = liveness_.GetLiveInSet(*block); local
1942 BitVector* live = liveness_.GetLiveInSet(*block); local
[all...] |
| /external/v8/src/crankshaft/ |
| lithium-allocator.cc | 191 // We cannot spill a live range that has a use requiring a register
283 // Partition original use intervals to the two live ranges.
311 // Partition original use positions to the two live ranges.
320 // to the use that no longer belongs to this live range.
324 // Link the new live range in the chain before any of the other
338 // This implements an ordering on live ranges so that they are ordered by their
340 // allocation algorithm. If two live ranges start at the same offset then there
358 LAllocator::TraceAlloc("Shorten live range %d to [%d\n", id_, start.Value());
369 LAllocator::TraceAlloc("Ensure live range %d in interval [%d %d[\n",
394 LAllocator::TraceAlloc("Add to live range %d interval [%d %d[\n"
1246 BitVector* live = live_in_sets_[block->block_id()]; local
1268 BitVector* live = ComputeLiveOut(block); local
[all...] |
| /external/clang/lib/CodeGen/ |
| CGExprScalar.cpp | 3238 Expr *live = lhsExpr, *dead = rhsExpr; local
[all...] |
| CGExpr.cpp | 3287 const Expr *live = expr->getTrueExpr(), *dead = expr->getFalseExpr(); local
[all...] |
| /external/valgrind/helgrind/ |
| libhb_core.c | 595 static UWord stats__secmaps_in_map_shmem = 0; // # SecMaps 'live'
6428 UInt live = 0; local
[all...] |
| /packages/apps/TV/usbtuner/libs/ |
| exoplayer_1.5.6.jar | |
| /developers/build/prebuilts/androidtv/sample-inputs/app/libs/ |
| exoplayer_dev-hls_20150123.jar | |
| /prebuilts/tools/common/m2/repository/net/sourceforge/htmlunit/htmlunit-core-js/2.14/ |
| htmlunit-core-js-2.14.jar | |
| /prebuilts/tools/common/m2/repository/org/mozilla/rhino/1.7R3/ |
| rhino-1.7R3.jar | |
| /external/owasp/sanitizer/tools/findbugs/lib/ |
| findbugs.jar | |
| /prebuilts/tools/common/m2/repository/com/google/code/findbugs/findbugs/2.0.1/ |
| findbugs-2.0.1.jar | |
| /prebuilts/tools/common/m2/repository/com/google/code/findbugs/findbugs/2.0.3/ |
| findbugs-2.0.3.jar | |
| /prebuilts/tools/common/m2/repository/com/google/code/findbugs/findbugs/3.0.0/ |
| findbugs-3.0.0.jar | |
