Home
last modified time | relevance | path

Searched refs:warps (Results 1 – 12 of 12) sorted by relevance

/external/skqp/src/compute/hs/gen/
Dtarget_cuda.c150 uint32_t const bc_max = msb_idx_u32(pow2_rd_u32(merge->warps)); in hsg_target_cuda()
185 merge->warps, in hsg_target_cuda()
186 msb_idx_u32(pow2_ru_u32(merge->warps)), in hsg_target_cuda()
188 config->merge.flip.warps, in hsg_target_cuda()
191 config->merge.half.warps, in hsg_target_cuda()
310 uint32_t const bs = pow2_ru_u32(m->warps); in hsg_target_cuda()
317 m->warps,msb); in hsg_target_cuda()
323 m->warps,msb); in hsg_target_cuda()
332 if (m->warps > 1) in hsg_target_cuda()
336 m->warps * config->warp.lanes, in hsg_target_cuda()
[all …]
Dtarget_opencl.c153 uint32_t const bc_max = msb_idx_u32(pow2_rd_u32(merge->warps)); in hsg_target_opencl()
186 merge->warps, in hsg_target_opencl()
187 msb_idx_u32(pow2_ru_u32(merge->warps)), in hsg_target_opencl()
189 config->merge.flip.warps, in hsg_target_opencl()
192 config->merge.half.warps, in hsg_target_opencl()
288 uint32_t const bs = pow2_ru_u32(m->warps); in hsg_target_opencl()
293 m->warps,msb); in hsg_target_opencl()
301 if (m->warps > 1) in hsg_target_opencl()
305 m->warps * config->warp.lanes, in hsg_target_opencl()
318 uint32_t const msb = msb_idx_u32(m->warps); in hsg_target_opencl()
[all …]
Dmain.c126 .warps = 1,
131 .warps = 1,
227 hsg_config.warp.skpw_bs = bs_keys / hsg_merge[0].warps; in hsg_config_init_shared()
240 uint32_t const bs_threads = merge->warps << hsg_config.warp.lanes_log2; in hsg_merge_levels_init_shared()
269 uint32_t const bc_warps_min = MAX_MACRO(merge->warps,hsg_config.block.warps_min); in hsg_merge_levels_init_shared()
292 hsg_merge_levels_init_1(struct hsg_merge * const merge, uint32_t const warps, uint32_t const level,… in hsg_merge_levels_init_1() argument
294 uint32_t const even_odd = warps & 1; in hsg_merge_levels_init_1()
297 merge->levels[level].networks[even_odd] = warps; in hsg_merge_levels_init_1()
299 if (warps == 1) in hsg_merge_levels_init_1()
302 merge->levels[level].active.b64 |= BITS_TO_MASK_AT_64(warps,offset); in hsg_merge_levels_init_1()
[all …]
Dtarget_glsl.c166 uint32_t const bc_max = msb_idx_u32(pow2_rd_u32(merge->warps)); in hsg_target_glsl()
197 merge->warps, in hsg_target_glsl()
198 msb_idx_u32(pow2_ru_u32(merge->warps)), in hsg_target_glsl()
200 config->merge.flip.warps, in hsg_target_glsl()
203 config->merge.half.warps, in hsg_target_glsl()
302 uint32_t const bs = pow2_ru_u32(m->warps); in hsg_target_glsl()
320 if (m->warps > 1) in hsg_target_glsl()
324 m->warps * config->warp.lanes, in hsg_target_glsl()
330 m->warps,msb); in hsg_target_glsl()
348 uint32_t const msb = msb_idx_u32(m->warps); in hsg_target_glsl()
[all …]
Dgen.h33 uint32_t warps; member
39 uint32_t warps; member
116 uint32_t warps; member
/external/autotest/client/tests/monotonic_time/src/
Dtime_test.c143 long warps; /* # of backward time jumps */ member
173 ++test->warps; \
214 test->warps, in show_progress()
293 errs = (test->warps != 0); in run_test()
/external/llvm-project/openmp/libomptarget/deviceRTLs/nvptx/docs/
DReductionDesign.txt27 * efficiently reduces within warps, threads, blocks and the device.
81 across warps. Its function is to tunnel all the thread private
289 ReduceData equal to the number of warps present in this thread
377 warps, and threadblocks. The challenge is to do so efficiently in a fashion
473 // done reducing to one value per warp, now reduce across warps
/external/skqp/src/compute/hs/cuda/
Dhs_cuda.inl426 // bx_ru is number of rounded up warps in vin
689 // kernel in order to get more warps in flight (increased
/external/jline/src/src/test/resources/jline/example/
Denglish.gz
/external/kotlinx.coroutines/benchmarks/src/jmh/resources/
Dospd.txt.gz
/external/cldr/tools/java/org/unicode/cldr/util/data/transforms/
Dinternal_raw_IPA-old.txt210615 warps %15933 wɔrps
Dinternal_raw_IPA.txt175983 warps %26554 wɔrps