| /external/v8/src/compiler/ |
| 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 | 171 bool live = liveness->Contains(var) || permanently_live_.Contains(var); local
172 inputs_buffer_.push_back(live ? value_node : replacement_node_);
223 os << " Live set: ";
|
| register-allocator.cc | 539 // We cannot spill a live range that has a use requiring a register
641 // Partition original use intervals to the two live ranges.
672 // Partition original use positions to the two live ranges.
681 // to the use that no longer belongs to this live range.
726 // This implements an ordering on live ranges so that they are ordered by their
728 // allocation algorithm. If two live ranges start at the same offset then there
924 // Live ranges defined in deferred blocks stay in deferred blocks, so we
2383 BitVector* live = ComputeLiveOut(block, data()); local
3724 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/compiler/optimizing/ |
| register_allocation_resolver.cc | 152 // Instructions live at the top of catch blocks or irreducible loop header
155 BitVector* live = liveness_.GetLiveInSet(*block); local
156 for (uint32_t idx : live->Indexes()) {
160 // a lifetime hole in it. `CoversSlow` returns whether the interval is live at that
168 BitVector* live = liveness_.GetLiveInSet(*block); local
169 for (uint32_t idx : live->Indexes()) {
436 // Our live_in fixed point calculation has found that the instruction is live
438 // live interval computation however does not compute a fixed point, and
|
| /art/runtime/gc/accounting/ |
| space_bitmap.cc | 192 Atomic<uintptr_t>* live = live_bitmap.bitmap_begin_; local
195 uintptr_t garbage = live[i].LoadRelaxed() & ~mark[i].LoadRelaxed();
|
| /external/skia/tools/ |
| ok.cpp | 109 std::list<std::future<Status>> live; member in struct:ThreadEngine
112 live.push_back(std::async(std::launch::async, fn));
117 if (live.empty()) {
122 for (auto it = live.begin(); it != live.end(); it++) {
125 live.erase(it);
|
| /external/libchrome/base/strings/ |
| string_util_unittest.cc | 1121 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...] |
| /device/generic/goldfish/audio/ |
| audio_hw.c | 68 size_t live; member in struct:audio_vbuffer
85 audio_vbuffer->live = 0;
104 int live = audio_vbuffer->live; local
106 return live;
114 int dead = audio_vbuffer->frame_count - audio_vbuffer->live;
126 if (audio_vbuffer->live == 0 || audio_vbuffer->head > audio_vbuffer->tail) {
137 audio_vbuffer->live += frames;
153 if (audio_vbuffer->live == audio_vbuffer->frame_count ||
164 audio_vbuffer->live -= frames
[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 | 3227 Expr *live = lhsExpr, *dead = rhsExpr; local
[all...] |
| CGExpr.cpp | 3496 const Expr *live = expr->getTrueExpr(), *dead = expr->getFalseExpr(); local
[all...] |
| /external/v8/src/heap/ |
| mark-compact.cc | 688 // between live bytes and capacity of this page (= area).
692 // The algorithm sorts all pages by live bytes and then iterates through
854 // Clear the marking state of live large objects.
888 // Phase 1: tracing and marking live objects.
890 // after: a live object's map pointer is marked as '00'.
892 // Marking all live objects in the heap as part of mark-sweep or mark-compact
894 // marking, live objects' map pointers are marked indicating that the object
2253 std::stringstream live, dead; 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...] |
| /prebuilts/sdk/current/support/tv-provider/ |
| android-support-tv-provider.jar | |
| /packages/apps/TV/libs/ |
| exoplayer.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 | |
