Home
last modified time | relevance | path

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

12

/art/runtime/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.h33 static constexpr size_t position = kPosition; variable
36 static_assert(position < sizeof(uintptr_t) * kBitsPerByte, "Invalid position.");
39 static_assert(size + position <= sizeof(uintptr_t) * kBitsPerByte, "Invalid position + size.");
54 return ((kUintPtrTOne << size) - 1) << position; in MaskInPlace()
60 return position; in Shift()
71 return static_cast<uintptr_t>(value) << position; in Encode()
76 return static_cast<T>((value >> position) & ((kUintPtrTOne << size) - 1)); in Decode()
84 return (static_cast<uintptr_t>(value) << position) | in Update()
/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()
287 size_t position = instruction->GetLifetimePosition(); in AddTempUse() local
288 UsePosition* new_use = new (allocator_) UsePosition(instruction, temp_index, position); in AddTempUse()
[all …]
Dregister_allocator_linear_scan.cc180 size_t position = block->GetLifetimeStart(); in AllocateRegistersInternal() local
181 BlockRegisters(position, position + 1); in AllocateRegistersInternal()
224 size_t position = instruction->GetLifetimePosition(); in ProcessInstruction() local
232 BlockRegister(temp, position, position + 1); in ProcessInstruction()
285 BlockRegisters(position, position + 1, /* caller_save_only */ true); in ProcessInstruction()
291 BlockRegister(input, position, position + 1); in ProcessInstruction()
293 BlockRegister(input.ToLow(), position, position + 1); in ProcessInstruction()
294 BlockRegister(input.ToHigh(), position, position + 1); in ProcessInstruction()
346 current->SetFrom(position + 1); in ProcessInstruction()
349 current->SetFrom(position + 1); in ProcessInstruction()
[all …]
Dregister_allocator.cc196 LiveInterval* RegisterAllocator::Split(LiveInterval* interval, size_t position) { in Split() argument
197 DCHECK_GE(position, interval->GetStart()); in Split()
198 DCHECK(!interval->IsDeadAt(position)); in Split()
199 if (position == interval->GetStart()) { in Split()
209 LiveInterval* new_interval = interval->SplitAt(position); in Split()
211 LiveInterval* high = interval->GetHighInterval()->SplitAt(position); in Split()
215 LiveInterval* low = interval->GetLowInterval()->SplitAt(position); in Split()
257 size_t position = dominated->GetLifetimeStart(); in SplitBetween() local
258 if ((position > from) && (block_to->GetLifetimeStart() > position)) { in SplitBetween()
Dregister_allocation_resolver.cc545 static bool IsInstructionStart(size_t position) { in IsInstructionStart() argument
546 return (position & 1) == 0; in IsInstructionStart()
549 static bool IsInstructionEnd(size_t position) { in IsInstructionEnd() argument
550 return (position & 1) == 1; in IsInstructionEnd()
553 void RegisterAllocationResolver::InsertParallelMoveAt(size_t position, in InsertParallelMoveAt() argument
560 HInstruction* at = liveness_.GetInstructionFromPosition(position / 2); in InsertParallelMoveAt()
563 if (IsInstructionStart(position)) { in InsertParallelMoveAt()
568 at = liveness_.GetInstructionFromPosition((position + 1) / 2); in InsertParallelMoveAt()
574 if (at->GetLifetimePosition() < position) { in InsertParallelMoveAt()
581 if (at->GetLifetimePosition() != position) { in InsertParallelMoveAt()
[all …]
Dregister_allocator_graph_color.cc76 static size_t CostForMoveAt(size_t position, const SsaLivenessAnalysis& liveness) { in CostForMoveAt() argument
77 HBasicBlock* block = liveness.GetBlockFromPosition(position / 2); in CostForMoveAt()
95 size_t position, in ComputeCoalescePriority() argument
102 return CostForMoveAt(position, liveness); in ComputeCoalescePriority()
122 size_t position, in CoalesceOpportunity()
127 priority(ComputeCoalescePriority(kind, position, liveness)) {} in CoalesceOpportunity()
468 size_t position);
778 size_t position = block->GetLifetimeStart(); in ProcessInstructions() local
779 BlockRegisters(position, position + 1); in ProcessInstructions()
855 size_t position = instruction->GetLifetimePosition(); in CheckForFixedInputs() local
[all …]
Dcode_sinking.cc385 HInstruction* position = nullptr; in SinkCodeToUncommonBranch() local
398 position = FindIdealPosition(instruction->InputAt(0), post_dominated, /* filter */ true); in SinkCodeToUncommonBranch()
401 if (position == nullptr || !instruction->GetBlock()->Dominates(position->GetBlock())) { in SinkCodeToUncommonBranch()
406 position = FindIdealPosition(instruction, post_dominated); in SinkCodeToUncommonBranch()
407 if (position == nullptr) { in SinkCodeToUncommonBranch()
414 if (!post_dominated.IsBitSet(position->GetBlock()->GetBlockId())) { in SinkCodeToUncommonBranch()
418 instruction->MoveBefore(position, /* ensure_safety */ false); in SinkCodeToUncommonBranch()
Dssa_liveness_analysis.cc344 size_t position = predecessor->GetLifetimeEnd() - 1; in FindFirstRegisterHint() local
346 if (position < GetStart()) { in FindFirstRegisterHint()
347 LiveInterval* existing = GetParent()->GetSiblingAt(position); in FindFirstRegisterHint()
403 size_t position = user->GetLifetimePosition() - 1; in FindFirstRegisterHint() local
407 if (free_until[reg] >= position) { in FindFirstRegisterHint()
517 Location LiveInterval::GetLocationAt(size_t position) { in GetLocationAt() argument
518 LiveInterval* sibling = GetSiblingAt(position); in GetLocationAt()
523 LiveInterval* LiveInterval::GetSiblingAt(size_t position) { in GetSiblingAt() argument
525 while (current != nullptr && !current->IsDefinedAt(position)) { in GetSiblingAt()
Dregister_allocator.h86 static LiveInterval* Split(LiveInterval* interval, size_t position);
Dloop_optimization_test.cc63 HBasicBlock* AddLoop(HBasicBlock* position, HBasicBlock* successor) { in AddLoop() argument
69 position->ReplaceSuccessor(successor, header); in AddLoop()
Dregister_allocation_resolver.h83 void InsertParallelMoveAt(size_t position,
Dregister_allocator_graph_color.h126 static LiveInterval* TrySplit(LiveInterval* interval, size_t position);
Dregister_allocator_linear_scan.h104 bool TrySplitNonPairOrUnalignedPairIntervalAt(size_t position,
/art/compiler/utils/
Dintrusive_forward_list.h194 iterator insert_after(const_iterator position, value_type& value) { in insert_after() argument
196 new_hook->next_hook = position.hook_->next_hook; in insert_after()
197 position.hook_->next_hook = new_hook; in insert_after()
201 iterator insert_after(const_iterator position, InputIterator first, InputIterator last) { in insert_after() argument
203 position = insert_after(position, *first++); in insert_after()
205 return iterator(position.hook_); in insert_after()
207 iterator erase_after(const_iterator position) { in erase_after() argument
208 const_iterator last = position; in erase_after()
210 return erase_after(position, last); in erase_after()
212 iterator erase_after(const_iterator position, const_iterator last) { in erase_after() argument
[all …]
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/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/test/646-checker-arraycopy-large-cst-pos/
Dinfo.txt3 constant destination position, on ARM64, with read barriers
/art/runtime/interpreter/mterp/mips64/
Dop_const_4.S5 sra a0, a0, 12 # shift B into its final position
/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/runtime/gc/space/
Dbump_pointer_space.cc92 const uintptr_t position = reinterpret_cast<uintptr_t>(obj) + obj->SizeOf(); in GetNextObject() local
93 return reinterpret_cast<mirror::Object*>(RoundUp(position, kAlignment)); in GetNextObject()
Dregion_space-inl.h235 const uintptr_t position = reinterpret_cast<uintptr_t>(obj) + obj->SizeOf(); in GetNextObject() local
236 return reinterpret_cast<mirror::Object*>(RoundUp(position, kAlignment)); in GetNextObject()
/art/test/547-regression-trycatch-critic-edge/smali/
DTestCase.smali19 # the outer loop would have a smaller liveness position than the two back edges

12