Searched refs:kNumCases (Results 1 – 9 of 9) sorted by relevance
192 const int kNumCases = 512; in TEST() local193 int values[kNumCases]; in TEST()195 Label labels[kNumCases]; in TEST()214 __ BlockTrampolinePoolFor(kNumCases + 6); in TEST()216 masm, (kNumCases + 6) * Assembler::kInstrSize); in TEST()226 for (int i = 0; i < kNumCases; ++i) { in TEST()231 for (int i = 0; i < kNumCases; ++i) { in TEST()255 for (int i = 0; i < kNumCases; ++i) { in TEST()276 const int kNumCases = 512; in TEST() local277 int values[kNumCases]; in TEST()[all …]
235 const int kNumCases = 512; in TEST() local236 int values[kNumCases]; in TEST()238 Label labels[kNumCases]; in TEST()258 __ BlockTrampolinePoolFor(kNumCases * 2 + 6); in TEST()260 masm, (kNumCases * 2 + 6) * Assembler::kInstrSize); in TEST()270 for (int i = 0; i < kNumCases; ++i) { in TEST()275 for (int i = 0; i < kNumCases; ++i) { in TEST()299 for (int i = 0; i < kNumCases; ++i) { in TEST()320 const int kNumCases = 512; in TEST() local321 int values[kNumCases]; in TEST()[all …]
323 const int kNumCases = 512; in TEST() local324 int values[kNumCases]; in TEST()326 Label labels[kNumCases]; in TEST()333 for (int i = 0; i < kNumCases; ++i) { in TEST()337 for (int i = 0; i < kNumCases; ++i) { in TEST()355 for (int i = 0; i < kNumCases; ++i) { in TEST()370 const int kNumCases = 512; in TEST() local371 int values[kNumCases]; in TEST()373 Label labels[kNumCases]; in TEST()380 for (int i = 0; i < kNumCases; ++i) { in TEST()[all …]
1413 const int kNumCases = 512; in TEST() local1414 int values[kNumCases]; in TEST()1416 Label labels[kNumCases]; in TEST()1423 for (int i = 0; i < kNumCases; ++i) { in TEST()1427 for (int i = 0; i < kNumCases; ++i) { in TEST()1445 for (int i = 0; i < kNumCases; ++i) { in TEST()1460 const int kNumCases = 512; in TEST() local1461 int values[kNumCases]; in TEST()1463 Label labels[kNumCases]; in TEST()1470 for (int i = 0; i < kNumCases; ++i) { in TEST()[all …]
2185 const int kNumCases = 512; in TEST() local2186 int values[kNumCases]; in TEST()2188 Label labels[kNumCases]; in TEST()2195 for (int i = 0; i < kNumCases; ++i) { in TEST()2199 for (int i = 0; i < kNumCases; ++i) { in TEST()2217 for (int i = 0; i < kNumCases; ++i) { in TEST()2233 const int kNumCases = 512; in TEST() local2234 int values[kNumCases]; in TEST()2236 Label labels[kNumCases]; in TEST()2243 for (int i = 0; i < kNumCases; ++i) { in TEST()[all …]
3148 const int kNumCases = 512; in TEST() local3149 int values[kNumCases]; in TEST()3151 Label labels[kNumCases]; in TEST()3158 __ BlockTrampolinePoolFor(kNumCases + 7); in TEST()3160 &assm, (kNumCases + 7) * Assembler::kInstrSize); in TEST()3171 for (int i = 0; i < kNumCases; ++i) { in TEST()3176 for (int i = 0; i < kNumCases; ++i) { in TEST()3198 for (int i = 0; i < kNumCases; ++i) { in TEST()3214 const int kNumCases = 512; in TEST() local3215 int values[kNumCases]; in TEST()[all …]
3218 const int kNumCases = 512; in TEST() local3219 int values[kNumCases]; in TEST()3221 Label labels[kNumCases]; in TEST()3229 __ BlockTrampolinePoolFor(kNumCases * 2 + 6); in TEST()3231 &assm, (kNumCases * 2 + 6) * Assembler::kInstrSize); in TEST()3241 for (int i = 0; i < kNumCases; ++i) { in TEST()3246 for (int i = 0; i < kNumCases; ++i) { in TEST()3268 for (int i = 0; i < kNumCases; ++i) { in TEST()3284 const int kNumCases = 512; in TEST() local3285 int values[kNumCases]; in TEST()[all …]
11116 const int kNumCases = 512; in TEST() local11119 SETUP_SIZE(kNumCases * 5 * kInstructionSize + 8192); in TEST()11122 int32_t values[kNumCases]; in TEST()11124 int32_t results[kNumCases]; in TEST()11129 Label labels[kNumCases]; in TEST()11149 for (int i = 0; i < kNumCases; ++i) { in TEST()11154 for (int i = 0; i < kNumCases; ++i) { in TEST()11163 __ Cmp(index, kNumCases); in TEST()11170 for (int i = 0; i < kNumCases; ++i) { in TEST()11180 const int kNumCases = 512; in TEST() local[all …]
1071 const size_t kNumCases = 512; in TEST() local1072 const size_t kNumValues = kNumCases + 1; in TEST()1077 int32_t case_values[kNumCases]; in TEST()1078 RawMachineLabel* case_labels[kNumCases]; in TEST()1080 for (size_t i = 0; i < kNumCases; ++i) { in TEST()1087 for (size_t i = 0; i < kNumCases; ++i) { in TEST()1093 results[kNumCases] = m.Int32Constant(values[kNumCases]); in TEST()