Home
last modified time | relevance | path

Searched refs:position (Results 1 – 25 of 42) sorted by relevance

12

/art/libartbase/base/
Ddchecked_vector.h150 iterator insert(const_iterator position, const value_type& value) { in insert() argument
151 DCHECK(cbegin() <= position && position <= cend()); in insert()
152 return Base::insert(position, value); in insert()
154 iterator insert(const_iterator position, size_type n, const value_type& value) { in insert() argument
155 DCHECK(cbegin() <= position && position <= cend()); in insert()
156 return Base::insert(position, n, value); in insert()
159 iterator insert(const_iterator position, InputIterator first, InputIterator last) { in insert() argument
160 DCHECK(cbegin() <= position && position <= cend()); in insert()
161 return Base::insert(position, first, last); in insert()
163 iterator insert(const_iterator position, value_type&& value) { in insert() argument
[all …]
Dbit_field.h34 static constexpr size_t position = kPosition; variable
37 static_assert(position < sizeof(uintptr_t) * kBitsPerByte, "Invalid position.");
40 static_assert(size + position <= sizeof(uintptr_t) * kBitsPerByte, "Invalid position + size.");
55 return ((kUintPtrTOne << size) - 1) << position; in MaskInPlace()
61 return position; in Shift()
72 return static_cast<uintptr_t>(value) << position; in Encode()
77 return static_cast<T>((value >> position) & ((kUintPtrTOne << size) - 1)); in Decode()
85 return (static_cast<uintptr_t>(value) << position) | in Update()
Dintrusive_forward_list.h200 iterator insert_after(const_iterator position, value_type& value) { in insert_after() argument
202 new_hook->next_hook = position.hook_->next_hook; in insert_after()
203 position.hook_->next_hook = new_hook; in insert_after()
207 iterator insert_after(const_iterator position, InputIterator first, InputIterator last) { in insert_after() argument
209 position = insert_after(position, *first++); in insert_after()
211 return iterator(position.hook_); in insert_after()
213 iterator erase_after(const_iterator position) { in erase_after() argument
214 const_iterator last = position; in erase_after()
216 return erase_after(position, last); in erase_after()
218 iterator erase_after(const_iterator position, const_iterator last) { in erase_after() argument
[all …]
Dbit_string.h152 static constexpr size_t GetBitLengthTotalAtPosition(size_t position) { in GetBitLengthTotalAtPosition()
155 while (idx < position && idx < kCapacity) { in GetBitLengthTotalAtPosition()
166 static constexpr size_t GetLsbForPosition(size_t position) { in GetLsbForPosition()
167 DCHECK_GE(kCapacity, position); in GetLsbForPosition()
168 return GetBitLengthTotalAtPosition(position); in GetLsbForPosition()
173 static constexpr size_t MaybeGetBitLengthAtPosition(size_t position) { in MaybeGetBitLengthAtPosition()
174 if (position >= kCapacity) { in MaybeGetBitLengthAtPosition()
177 return kBitSizeAtPosition[position]; in MaybeGetBitLengthAtPosition()
/art/compiler/optimizing/
Dssa_liveness_analysis.h110 UsePosition(HInstruction* user, size_t input_index, size_t position) in UsePosition() argument
113 position_(position) { in UsePosition()
116 explicit UsePosition(size_t position) in UsePosition() argument
119 position_(dchecked_integral_cast<uint32_t>(position)) { in UsePosition()
167 size_t position) in EnvUsePosition() argument
170 position_(position) { in EnvUsePosition()
197 inline Iterator FindUseAtOrAfterPosition(Iterator first, Iterator last, size_t position) { in FindUseAtOrAfterPosition() argument
203 first, last, [position](const value_type& use) { return use.GetPosition() >= position; }); in FindUseAtOrAfterPosition()
302 size_t position = instruction->GetLifetimePosition(); in AddTempUse() local
303 UsePosition* new_use = new (allocator_) UsePosition(instruction, temp_index, position); in AddTempUse()
[all …]
Dregister_allocator_linear_scan.cc130 size_t position, in BlockRegister() argument
158 interval->AddRange(position, position + 1u); in BlockRegister()
178 size_t position = block->GetLifetimeStart(); in AllocateRegistersInternal() local
179 DCHECK_EQ(liveness_.GetInstructionFromPosition(position / 2u), nullptr); in AllocateRegistersInternal()
180 block_registers_special_interval_->AddRange(position, position + 1u); in AllocateRegistersInternal()
254 const size_t position = instruction->GetLifetimePosition(); in ProcessInstruction() local
255 DCHECK_NE(liveness_.GetInstructionFromPosition(position / 2u), nullptr); in ProcessInstruction()
256 block_registers_for_call_interval_->AddRange(position, position + 1u); in ProcessInstruction()
320 size_t position = instruction->GetLifetimePosition(); in CheckForTempLiveIntervals() local
326 BlockRegister(temp, position, will_call); in CheckForTempLiveIntervals()
[all …]
Dregister_allocation_resolver.cc547 static bool IsInstructionStart(size_t position) { in IsInstructionStart() argument
548 return (position & 1) == 0; in IsInstructionStart()
551 static bool IsInstructionEnd(size_t position) { in IsInstructionEnd() argument
552 return (position & 1) == 1; in IsInstructionEnd()
555 void RegisterAllocationResolver::InsertParallelMoveAt(size_t position, in InsertParallelMoveAt() argument
562 HInstruction* at = liveness_.GetInstructionFromPosition(position / 2); in InsertParallelMoveAt()
565 if (IsInstructionStart(position)) { in InsertParallelMoveAt()
570 at = liveness_.GetInstructionFromPosition((position + 1) / 2); in InsertParallelMoveAt()
576 if (at->GetLifetimePosition() < position) { in InsertParallelMoveAt()
583 if (at->GetLifetimePosition() != position) { in InsertParallelMoveAt()
[all …]
Dregister_allocator.cc280 LiveInterval* RegisterAllocator::Split(LiveInterval* interval, size_t position) { in Split() argument
281 DCHECK_GE(position, interval->GetStart()); in Split()
282 DCHECK(!interval->IsDeadAt(position)); in Split()
283 if (position == interval->GetStart()) { in Split()
293 LiveInterval* new_interval = interval->SplitAt(position); in Split()
295 LiveInterval* high = interval->GetHighInterval()->SplitAt(position); in Split()
299 LiveInterval* low = interval->GetLowInterval()->SplitAt(position); in Split()
341 size_t position = dominated->GetLifetimeStart(); in SplitBetween() local
342 if ((position > from) && (block_to->GetLifetimeStart() > position)) { in SplitBetween()
Dssa_liveness_analysis.cc362 size_t position = predecessor->GetLifetimeEnd() - 1; in FindFirstRegisterHint() local
364 if (position < GetStart()) { in FindFirstRegisterHint()
365 LiveInterval* existing = GetParent()->GetSiblingAt(position); in FindFirstRegisterHint()
421 size_t position = user->GetLifetimePosition() - 1; in FindFirstRegisterHint() local
425 if (free_until[reg] >= position) { in FindFirstRegisterHint()
534 Location LiveInterval::GetLocationAt(size_t position) { in GetLocationAt() argument
535 LiveInterval* sibling = GetSiblingAt(position); in GetLocationAt()
540 LiveInterval* LiveInterval::GetSiblingAt(size_t position) { in GetSiblingAt() argument
542 while (current != nullptr && !current->IsDefinedAt(position)) { in GetSiblingAt()
Dcode_sinking.cc543 HInstruction* position = nullptr; in SinkCodeToUncommonBranch() local
556 position = FindIdealPosition(instruction->InputAt(0), post_dominated, /* filter= */ true); in SinkCodeToUncommonBranch()
559 if (position == nullptr || !instruction->GetBlock()->Dominates(position->GetBlock())) { in SinkCodeToUncommonBranch()
564 position = FindIdealPosition(instruction, post_dominated); in SinkCodeToUncommonBranch()
565 if (position == nullptr) { in SinkCodeToUncommonBranch()
572 if (!post_dominated.IsBitSet(position->GetBlock()->GetBlockId())) { in SinkCodeToUncommonBranch()
576 instruction->MoveBefore(position, /* do_checks= */ false); in SinkCodeToUncommonBranch()
Dregister_allocator_linear_scan.h79 void BlockRegister(Location location, size_t position, bool will_call);
125 bool TrySplitNonPairOrUnalignedPairIntervalAt(size_t position,
Dregister_allocator.h79 static LiveInterval* Split(LiveInterval* interval, size_t position);
Dregister_allocation_resolver.h81 void InsertParallelMoveAt(size_t position,
/art/test/070-nio-buffer/src/
DMain.java53 shortBuf.position(0); in basicShortTest()
55 shortBuf.position(0); in basicShortTest()
67 shortBuf.position(0); in basicShortTest()
75 shortBuf.position(16); in basicShortTest()
98 int1.position (0); in intFloatTest()
102 int1.position (0); in intFloatTest()
122 directBuf.position(0); in storeValues()
160 directBuf.position(0); in storeValues()
/art/runtime/mirror/
Dfield.cc37 auto position = std::find_if( in VisitTarget() local
39 DCHECK(position != new_range.end()); in VisitTarget()
40 SetArtFieldIndex<false>(std::distance(new_range.begin(), position)); in VisitTarget()
91 auto position = std::find_if( in CreateFromArtField() local
93 DCHECK(position != iter_range.end()); in CreateFromArtField()
95 std::distance(iter_range.begin(), position)); in CreateFromArtField()
/art/compiler/utils/
Dlabel.h103 void BindTo(int position) { in BindTo() argument
105 position_ = -position - sizeof(void*); in BindTo()
109 void LinkTo(int position) { in LinkTo() argument
111 position_ = position + sizeof(void*); in LinkTo()
Dassembler.h50 virtual void Process(const MemoryRegion& region, int position) = 0;
60 int position() const { return position_; } in position() function
106 template<typename T> T Load(size_t position) { in Load() argument
107 CHECK_LE(position, Size() - static_cast<int>(sizeof(T))); in Load()
108 return *reinterpret_cast<T*>(contents_ + position); in Load()
111 template<typename T> void Store(size_t position, T value) { in Store() argument
112 CHECK_LE(position, Size() - static_cast<int>(sizeof(T))); in Store()
113 *reinterpret_cast<T*>(contents_ + position) = value; in Store()
Dassembler.cc57 fixup->Process(region, fixup->position()); in ProcessFixups()
/art/tools/ahat/src/main/com/android/ahat/heapdump/
DParser.java637 hprof.seek(data.position); in parseInternal()
663 hprof.seek(data.position); in parseInternal()
690 public int position; field in Parser.ClassInstData
692 public ClassInstData(int position) { in ClassInstData() argument
693 this.position = position; in ClassInstData()
699 public int position; // Position in hprof file containing element data. field in Parser.ObjArrayData
701 public ObjArrayData(int length, int position) { in ObjArrayData() argument
703 this.position = position; in ObjArrayData()
940 return mBuffer.position(); in tell()
946 public void seek(int position) { in seek() argument
[all …]
/art/test/646-checker-arraycopy-large-cst-pos/
Dinfo.txt3 constant destination position, on ARM64, with read barriers
/art/runtime/gc/space/
Dbump_pointer_space-inl.h94 const uintptr_t position = reinterpret_cast<uintptr_t>(obj) + obj->SizeOf(); in GetNextObject() local
95 return reinterpret_cast<mirror::Object*>(RoundUp(position, kAlignment)); in GetNextObject()
/art/test/530-regression-lse/src/
DMain.java34 assertEquals(1, b.position()); in testRelativePositions()
/art/test/580-crc32/src/
DMain.java349 buf.position(off); in CRC32ByteBuffer()
417 buf.position(off); in CRC32DirectByteBuffer()
425 buf.position(0); in CRC32ByteAndDirectByteBuffer()
434 buf.position(0); in CRC32DirectByteBufferAndByte()
/art/tools/bisection_search/
DREADME.md26 Extra dalvikvm arguments will be placed on second position in the command
27 by default. {ARGS} tag can be used to specify a custom position.
/art/test/712-varhandle-invocations/src/
DVarHandleArrayTests.java232 ((ByteBuffer) heapBuffer.duplicate().position(1)).slice(), in testByteBufferVarHandle()
234 ((ByteBuffer) directBuffer.duplicate().position(1)).slice(), in testByteBufferVarHandle()
236 ((ByteBuffer) arrayBuffer.duplicate().position(1)).slice(), in testByteBufferVarHandle()
238 ((ByteBuffer) anotherArrayBuffer.duplicate().position(1)).slice() in testByteBufferVarHandle()

12