| /art/compiler/optimizing/ |
| H A D | nodes_x86.h | 82 int32_t num_entries,
88 num_entries_(num_entries) {
81 HX86PackedSwitch(int32_t start_value, int32_t num_entries, HInstruction* input, HX86ComputeBaseMethodAddress* method_base, uint32_t dex_pc) argument
|
| H A D | code_generator_x86.h | 200 // The compare/jump sequence will generate about (1.5 * num_entries) instructions. A jump
201 // table version generates 7 instructions and num_entries literals. Compare/jump sequence will
202 // generates less code/data with a small num_entries.
293 uint32_t num_entries,
|
| H A D | code_generator.cc | 673 uint16_t num_entries = table.GetNumEntries(); local
677 for (size_t i = 0; i < num_entries; ++i) {
|
| H A D | code_generator_x86.cc | 7022 uint32_t num_entries,
7028 DCHECK_GT(num_entries, 2u);
7046 for (; index + 1 < num_entries; index += 2) {
7055 if (index != num_entries) {
7057 DCHECK_EQ(index + 1, num_entries);
7070 uint32_t num_entries = switch_instr->GetNumEntries(); local
7076 num_entries,
7095 uint32_t num_entries = switch_instr->GetNumEntries(); local
7100 if (num_entries <= kPackedSwitchJumpTableThreshold) {
7103 num_entries,
7020 GenPackedSwitchWithCompares(Register value_reg, int32_t lower_bound, uint32_t num_entries, HBasicBlock* switch_block, HBasicBlock* default_block) argument
7269 int32_t num_entries = switch_instr_->GetNumEntries(); local
[all...] |
| H A D | code_generator_arm64.cc | 74 // The compare/jump sequence will generate about (1.5 * num_entries + 3) instructions. While jump
75 // table version generates 7 instructions and num_entries literals. Compare/jump sequence will
76 // generates less code/data with a small num_entries.
555 uint32_t num_entries = switch_instr_->GetNumEntries(); local
556 DCHECK_GE(num_entries, kPackedSwitchCompareJumpThreshold);
560 CodeBufferCheckScope scope(codegen->GetVIXLAssembler(), num_entries * sizeof(int32_t),
565 for (uint32_t i = 0; i < num_entries; i++) {
4747 uint32_t num_entries = switch_instr->GetNumEntries();
4759 if (num_entries <= kPackedSwitchCompareJumpThreshold ||
4771 for (; num_entries
[all...] |
| H A D | code_generator_x86_64.cc | 44 // The compare/jump sequence will generate about (1.5 * num_entries) instructions. A jump
45 // table version generates 7 instructions and num_entries literals. Compare/jump sequence will
46 // generates less code/data with a small num_entries.
6488 uint32_t num_entries = switch_instr->GetNumEntries(); local
6496 if (num_entries <= kPackedSwitchJumpTableThreshold) {
6500 DCHECK_GT(num_entries, 2u);
6518 for (; index + 1 < num_entries; index += 2) {
6527 if (index != num_entries) {
6529 DCHECK_EQ(index + 1, num_entries);
6550 __ cmpl(value_reg, Immediate(num_entries
6692 int32_t num_entries = switch_instr_->GetNumEntries(); local
[all...] |
| H A D | code_generator_arm.cc | 6648 uint32_t num_entries = switch_instr->GetNumEntries();
6653 if (num_entries <= kPackedSwitchCompareJumpThreshold || !codegen_->GetAssembler()->IsThumb()) {
6666 for (; num_entries - last_index > 2; last_index += 2) {
6673 if (num_entries - last_index == 2) {
6688 std::vector<Label*> labels(num_entries);
6690 for (uint32_t i = 0; i < num_entries; i++) {
6705 __ CmpConstant(key_reg, num_entries - 1);
|
| H A D | code_generator_mips64.cc | 4141 int32_t num_entries = switch_instr->GetNumEntries(); local
4156 // this case, index >= num_entries must be true. So that we can save one branch instruction.
4163 for (; num_entries - last_index > 2; last_index += 2) {
4170 if (num_entries - last_index == 2) {
|
| H A D | code_generator_mips.cc | 5136 int32_t num_entries = switch_instr->GetNumEntries(); local
5146 // this case, index >= num_entries must be true. So that we can save one branch instruction.
5153 for (; num_entries - last_index > 2; last_index += 2) {
5160 if (num_entries - last_index == 2) {
|
| H A D | nodes.h | 2875 uint32_t num_entries,
2880 num_entries_(num_entries) {
2874 HPackedSwitch(int32_t start_value, uint32_t num_entries, HInstruction* input, uint32_t dex_pc = kNoDexPc) argument
|
| /art/runtime/ |
| H A D | art_method.h | 79 // num_entries excludes the header.
80 ImtConflictTable(size_t num_entries, size_t pointer_size) { argument
81 SetInterfaceMethod(num_entries, pointer_size, nullptr);
82 SetImplementationMethod(num_entries, pointer_size, nullptr);
181 static size_t ComputeSize(size_t num_entries, size_t pointer_size) { argument
182 return (num_entries + 1) * EntrySize(pointer_size); // Add one for null terminator.
|
| H A D | class_linker.cc | 6332 const size_t num_entries = table->NumEntries(image_pointer_size_); local
6333 table->SetInterfaceMethod(num_entries, image_pointer_size_, interface_method);
6334 table->SetImplementationMethod(num_entries, image_pointer_size_, implementation_method);
6598 int32_t num_entries = vtable->GetLength(); local
6599 for (int32_t i = 0; i < num_entries; i++) {
6608 for (int32_t j = i+1; j < num_entries; j++) {
|
| /art/tools/dmtracedump/ |
| H A D | tracedump.cc | 1220 int32_t num_entries = 0; local
1221 for (pTimed = list; pTimed; pTimed = pTimed->next) num_entries += 1;
1222 *num = num_entries;
1223 if (num_entries == 0) return nullptr;
1227 TimedMethod* sorted = new TimedMethod[num_entries];
1230 qsort(sorted, num_entries, sizeof(TimedMethod), compareTimedMethod);
1233 for (ii = 0; ii < num_entries - 1; ++ii) sorted[ii].next = &sorted[ii + 1];
1234 sorted[num_entries - 1].next = nullptr;
|