| /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 | 156 uword* live = live_bitmap.bitmap_begin_; local
159 uword garbage = live[i] & ~mark[i];
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| heap-profile-table.h | 79 bool live; member in struct:HeapProfileTable::AllocInfo
131 // If "ptr" points to a recorded allocation and it's not marked as live
132 // mark it as live and return true. Else return false.
133 // All allocations start as non-live.
184 // Return a snapshot of every non-live, non-ignored object in *this.
186 // As a side-effect, clears the "live" bit on every live object in *this.
224 bool live() const { return bucket_rep & kLive; } function in struct:HeapProfileTable::AllocValue
298 info.live = v->live();
[all...] |
| /external/chromium_org/base/strings/ |
| string_util_unittest.cc | 1185 const std::string live = kLive; local
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| heap-profile-table.h | 82 bool live; member in struct:HeapProfileTable::AllocInfo
134 // If "ptr" points to a recorded allocation and it's not marked as live
135 // mark it as live and return true. Else return false.
136 // All allocations start as non-live.
201 // Return a snapshot of every non-live, non-ignored object in *this.
203 // As a side-effect, clears the "live" bit on every live object in *this.
207 // Dump a list of allocations marked as "live" along with their creation
218 // "live" where created during step 2.
250 bool live() const { return bucket_rep & kLive; function in struct:HeapProfileTable::AllocValue
[all...] |
| /art/compiler/optimizing/ |
| register_allocator.cc | 238 // Allocate a bit vector per register. A live interval that has a register
239 // allocated will populate the associated bit vector based on its live ranges.
411 // If the register is only available for a subset of live ranges
954 BitVector* live = liveness_.GetLiveInSet(*block); local
[all...] |
| /external/chromium_org/content/browser/accessibility/ |
| browser_accessibility_android.cc | 512 std::string live = GetStringAttribute( local
514 if (live == "polite")
516 else if (live == "assertive")
625 base::string16 live; local
627 ui::AX_ATTR_CONTAINER_LIVE_STATUS, &live)) {
628 NotifyLiveRegionUpdate(live);
|
| /external/chromium_org/third_party/WebKit/Source/platform/graphics/gpu/ |
| DrawingBufferTest.cpp | 281 bool live = true; local
282 m_drawingBuffer->m_live = &live;
302 EXPECT_EQ(live, true);
306 EXPECT_EQ(live, true);
310 EXPECT_EQ(live, true);
314 EXPECT_EQ(live, false);
319 bool live = true; local
320 m_drawingBuffer->m_live = &live;
334 EXPECT_EQ(live, true);
337 EXPECT_EQ(live, true)
[all...] |
| /external/chromium_org/third_party/mesa/src/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...] |
| /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/dex/ |
| local_value_numbering.cc | 509 bool live = live_in_v->IsBitSet(gvn_->GetMirGraph()->SRegToVReg(entry.first)); local
510 if (live) {
[all...] |
| /external/chromium_org/third_party/WebKit/Source/platform/heap/ |
| Handle.h | 296 size_t live = 0; local
299 for (int i = 0; i < wrapperPersistentsPerRegion && live < m_count; ++i) {
302 // live entries.
307 live++;
310 ASSERT(live == m_count);
726 // During the mark phase of the GC all live objects are marked as live and
727 // all Member fields of a live object will be traced marked as live as well.
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| db_impl.cc | 225 // Make a set of all of the live files
226 std::set<uint64_t> live = pending_outputs_; local
227 versions_->AddLiveFiles(&live);
247 keep = (live.find(number) != live.end());
251 // be recorded in pending_outputs_, which is inserted into "live"
252 keep = (live.find(number) != live.end());
[all...] |
| /external/chromium_org/v8/src/compiler/ |
| register-allocator.cc | 184 // We cannot spill a live range that has a use requiring a register
276 // Partition original use intervals to the two live ranges.
305 // Partition original use positions to the two live ranges.
314 // to the use that no longer belongs to this live range.
318 // Link the new live range in the chain before any of the other
332 // This implements an ordering on live ranges so that they are ordered by their
334 // allocation algorithm. If two live ranges start at the same offset then there
352 RegisterAllocator::TraceAlloc("Shorten live range %d to [%d\n", id_,
363 RegisterAllocator::TraceAlloc("Ensure live range %d in interval [%d %d[\n",
385 RegisterAllocator::TraceAlloc("Add to live range %d interval [%d %d[\n", id_
1264 BitVector* live = live_in_sets_[block->rpo_number_]; local
1288 BitVector* live = ComputeLiveOut(block); local
[all...] |
| /external/chromium_org/v8/src/ |
| lithium-allocator.cc | 188 // We cannot spill a live range that has a use requiring a register
280 // Partition original use intervals to the two live ranges.
308 // Partition original use positions to the two live ranges.
317 // to the use that no longer belongs to this live range.
321 // Link the new live range in the chain before any of the other
335 // This implements an ordering on live ranges so that they are ordered by their
337 // allocation algorithm. If two live ranges start at the same offset then there
355 LAllocator::TraceAlloc("Shorten live range %d to [%d\n", id_, start.Value());
366 LAllocator::TraceAlloc("Ensure live range %d in interval [%d %d[\n",
391 LAllocator::TraceAlloc("Add to live range %d interval [%d %d[\n"
1245 BitVector* live = live_in_sets_[block->block_id()]; local
1267 BitVector* live = ComputeLiveOut(block); local
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/ |
| builtin-kvm.c | 118 bool live; member in struct:perf_kvm_stat
513 /* seems to happen once in a while during live mode */
704 if (kvm->live) {
741 if (kvm->live) {
836 if (kvm->live) {
1070 /* live flag must be set first */
1071 kvm->live = true;
[all...] |
| /external/clang/lib/CodeGen/ |
| CGExpr.cpp | 2720 const Expr *live = expr->getTrueExpr(), *dead = expr->getFalseExpr(); local
[all...] |
| CGExprScalar.cpp | 3080 Expr *live = lhsExpr, *dead = rhsExpr; local
[all...] |
