/external/mesa3d/src/gallium/drivers/freedreno/a2xx/ |
D | ir2.c | 101 insert(struct ir2_context *ctx, unsigned block_idx, unsigned reg_idx, in insert() argument 111 if (s->instr && s->instr->block_idx != block_idx) in insert() 113 if (s->instr_s && s->instr_s->block_idx != block_idx) in insert() 186 sched = insert(ctx, instr->block_idx, reg->idx, src1, &comp); in scalarize_case1() 203 ins->block_idx = instr->block_idx; in scalarize_case1() 219 int block_idx = -1; in sched_next() local 237 if (block_idx < 0) in sched_next() 238 block_idx = instr->block_idx; in sched_next() 239 else if (block_idx != instr->block_idx || /* must be same block */ in sched_next() 290 assert(block_idx == -1); in sched_next() [all …]
|
D | ir2_assemble.c | 371 unsigned block_idx = 0; in assemble() local 399 .address = instr->cf.block_idx, /* will be fixed later */ in assemble() 402 .direction = instr->cf.block_idx > instr->block_idx, in assemble() 423 block = ctx->instr_sched[j].instr->block_idx; in assemble() 425 block = ctx->instr_sched[j].instr_s->block_idx; in assemble() 427 assert(block_idx <= block); in assemble() 447 if (exec.count == 6 || (exec.count && (need_sync || block != block_idx))) { in assemble() 453 while (block_idx < block) in assemble() 454 block_addr[++block_idx] = num_cf; in assemble()
|
D | ir2_cp.c | 65 if (p->block_idx != instr->block_idx) in cp_src() 184 redirect &= (c[i]->block_idx == instr->block_idx); in cp_export()
|
D | ir2_private.h | 79 unsigned block_idx; member 137 uint8_t block_idx; member 150 unsigned block_idx, pred_idx; member
|
D | ir2_nir.c | 277 instr->block_idx = ctx->block_idx; in ir2_instr_create() 813 ctx->block_has_jump[ctx->block_idx] = true; in emit_instr() 893 ctx->block_idx = block->index; in emit_block() 912 instr->cf.block_idx = succs->index; in emit_block()
|
/external/mesa3d/src/amd/compiler/ |
D | aco_spill.cpp | 147 void next_uses_per_block(spill_ctx& ctx, unsigned block_idx, std::set<uint32_t>& worklist) in next_uses_per_block() argument 149 Block* block = &ctx.program->blocks[block_idx]; in next_uses_per_block() 150 std::map<Temp, std::pair<uint32_t, uint32_t>> next_uses = ctx.next_use_distances_end[block_idx]; in next_uses_per_block() 176 next_uses[op.getTemp()] = {block_idx, idx}; in next_uses_per_block() 181 assert(block_idx != 0 || next_uses.empty()); in next_uses_per_block() 182 ctx.next_use_distances_start[block_idx] = next_uses; in next_uses_per_block() 195 …stances_end[pred_idx][instr->operands[i].getTemp()] != std::pair<uint32_t, uint32_t>{block_idx, 0}) in next_uses_per_block() 197 ctx.next_use_distances_end[pred_idx][instr->operands[i].getTemp()] = {block_idx, 0}; in next_uses_per_block() 237 unsigned block_idx = *b_it; in compute_global_next_uses() local 238 worklist.erase(block_idx); in compute_global_next_uses() [all …]
|
D | aco_lower_phis.cpp | 51 Operand get_ssa(Program *program, unsigned block_idx, ssa_state *state, bool before_write) in get_ssa() argument 54 auto it = state->writes.find(block_idx); in get_ssa() 57 if (state->visited[block_idx]) in get_ssa() 58 return state->latest[block_idx]; in get_ssa() 61 state->visited[block_idx] = true; in get_ssa() 63 Block& block = program->blocks[block_idx]; in get_ssa() 68 Operand op = get_ssa(program, block_idx - 1, state, false); in get_ssa() 69 state->latest[block_idx] = op; in get_ssa() 73 state->latest[block_idx] = op; in get_ssa() 80 state->latest[block_idx] = Operand(res); in get_ssa() [all …]
|
D | aco_insert_exec_mask.cpp | 162 void mark_block_wqm(wqm_ctx &ctx, unsigned block_idx) in mark_block_wqm() argument 164 if (ctx.branch_wqm[block_idx]) in mark_block_wqm() 167 ctx.branch_wqm[block_idx] = true; in mark_block_wqm() 168 ctx.worklist.insert(block_idx); in mark_block_wqm() 170 Block& block = ctx.program->blocks[block_idx]; in mark_block_wqm() 189 unsigned block_idx = block->index + 1; in get_block_needs() local 190 while (!(ctx.program->blocks[block_idx].kind & block_kind_top_level)) { in get_block_needs() 193 if (ctx.program->blocks[block_idx].kind & block_kind_break) in get_block_needs() 194 mark_block_wqm(ctx, block_idx); in get_block_needs() 196 exec_ctx.info[block_idx].block_needs |= WQM; in get_block_needs() [all …]
|
D | aco_live_var_analysis.cpp | 394 unsigned block_idx = *b_it; in live_var_analysis() local 395 worklist.erase(block_idx); in live_var_analysis() 396 …process_live_temps_per_block(program, result, &program->blocks[block_idx], worklist, phi_sgpr_ops); in live_var_analysis() 397 new_demand.update(program->blocks[block_idx].register_demand); in live_var_analysis()
|
/external/perfetto/src/trace_processor/containers/ |
D | bit_vector.h | 71 return blocks_[a.block_idx].IsSet(a.block_offset); in IsSet() 88 uint32_t idx = addr.block_idx; in GetNumBitsSet() 110 uint32_t block_idx = in IndexOfNthSet() local 115 uint32_t set_in_block = n - counts_[block_idx]; in IndexOfNthSet() 119 BlockOffset block_offset = blocks_[block_idx].IndexOfNthSet(set_in_block); in IndexOfNthSet() 120 return AddressToIndex(Address{block_idx, block_offset}); in IndexOfNthSet() 128 bool old_value = blocks_[addr.block_idx].IsSet(addr.block_offset); in Set() 132 blocks_[addr.block_idx].Set(addr.block_offset); in Set() 135 for (uint32_t i = addr.block_idx + 1; i < size; ++i) { in Set() 146 bool old_value = blocks_[addr.block_idx].IsSet(addr.block_offset); in Clear() [all …]
|
D | bit_vector_iterators.cc | 33 uint32_t block_idx = index_ / BitVector::Block::kBits; in ~BaseIterator() local 39 OnBlockChange(std::min(block_idx, last_block_idx), last_block_idx); in ~BaseIterator() 97 addr.block_idx == bv().counts_.size() - 1 in ReadSetBitBatch() 99 : bv().counts_[addr.block_idx + 1]; in ReadSetBitBatch() 108 i = BitVector::AddressToIndex({addr.block_idx, kLastBlockOffset}); in ReadSetBitBatch() 113 const auto& block = bv().blocks_[addr.block_idx]; in ReadSetBitBatch()
|
/external/libaom/libaom/test/ |
D | av1_convolve_2d_test_util.cc | 45 const int block_idx = GET_PARAM(3); in RunCheckOutput() local 58 (block_size_wide[block_idx] == 4 || block_size_high[block_idx] == 4) ? 2 in RunCheckOutput() 61 const int out_w = block_size_wide[block_idx] >> shift; in RunCheckOutput() 62 const int out_h = block_size_high[block_idx] >> shift; in RunCheckOutput() 116 const int block_idx = GET_PARAM(3); in RunSpeedTest() local 133 (block_size_wide[block_idx] == 4 || block_size_high[block_idx] == 4) ? 2 in RunSpeedTest() 136 const int out_w = block_size_wide[block_idx] >> shift; in RunSpeedTest() 137 const int out_h = block_size_high[block_idx] >> shift; in RunSpeedTest() 172 const int block_idx = GET_PARAM(3); in RunCheckOutput() local 187 const int out_w = block_size_wide[block_idx]; in RunCheckOutput() [all …]
|
D | comp_avg_pred_test.h | 100 const int block_idx = GET_PARAM(1); in RunCheckOutput() local 112 const int in_w = block_size_wide[block_idx]; in RunCheckOutput() 113 const int in_h = block_size_high[block_idx]; in RunCheckOutput() 145 const int block_idx = GET_PARAM(1); in RunSpeedTest() local 157 const int in_w = block_size_wide[block_idx]; in RunSpeedTest() 158 const int in_h = block_size_high[block_idx]; in RunSpeedTest() 204 const int block_idx = GET_PARAM(1); in RunCheckOutput() local 216 const int in_w = block_size_wide[block_idx]; in RunCheckOutput() 217 const int in_h = block_size_high[block_idx]; in RunCheckOutput() 267 const int block_idx = GET_PARAM(1); in RunSpeedTest() local [all …]
|
D | reconinter_test.cc | 94 const int block_idx = GET_PARAM(2); in RunCheckOutput() local 96 const int width = block_size_wide[block_idx]; in RunCheckOutput() 97 const int height = block_size_high[block_idx]; in RunCheckOutput() 135 const int block_idx = GET_PARAM(2); in RunSpeedTest() local 137 const int width = block_size_wide[block_idx]; in RunSpeedTest() 138 const int height = block_size_high[block_idx]; in RunSpeedTest()
|
D | sad_test.cc | 155 virtual uint8_t *GetReference(int block_idx) { in GetReference() argument 158 block_idx * kDataBlockSize); in GetReference() 159 return reference_data_ + block_idx * kDataBlockSize; in GetReference() 164 unsigned int ReferenceSAD(int block_idx) { in ReferenceSAD() argument 166 const uint8_t *const reference8 = GetReference(block_idx); in ReferenceSAD() 169 CONVERT_TO_SHORTPTR(GetReference(block_idx)); in ReferenceSAD() 188 unsigned int ReferenceSADavg(int block_idx) { in ReferenceSADavg() argument 190 const uint8_t *const reference8 = GetReference(block_idx); in ReferenceSADavg() 194 CONVERT_TO_SHORTPTR(GetReference(block_idx)); in ReferenceSADavg() 215 void ReferenceDistWtdCompAvg(int block_idx) { in ReferenceDistWtdCompAvg() argument [all …]
|
/external/tensorflow/tensorflow/python/keras/applications/ |
D | inception_resnet_v2.py | 167 for block_idx in range(1, 11): 169 x, scale=0.17, block_type='block35', block_idx=block_idx) 181 for block_idx in range(1, 21): 183 x, scale=0.1, block_type='block17', block_idx=block_idx) 198 for block_idx in range(1, 10): 200 x, scale=0.2, block_type='block8', block_idx=block_idx) 202 x, scale=1., activation=None, block_type='block8', block_idx=10) 295 def inception_resnet_block(x, scale, block_type, block_idx, activation='relu'): argument 355 block_name = block_type + '_' + str(block_idx)
|
/external/mesa3d/src/gallium/drivers/zink/ |
D | nir_lower_dynamic_bo_access.c | 49 unsigned block_idx = instr->intrinsic == nir_intrinsic_store_ssbo; in recursive_generate_bo_ssa_def() local 51 new_instr->src[block_idx] = nir_src_for_ssa(nir_imm_int(b, start)); in recursive_generate_bo_ssa_def() 53 if (i != block_idx) in recursive_generate_bo_ssa_def() 88 unsigned block_idx = instr->intrinsic == nir_intrinsic_store_ssbo; in lower_dynamic_bo_access_instr() local 89 if (nir_src_is_const(instr->src[block_idx])) in lower_dynamic_bo_access_instr() 110 instr->src[block_idx].ssa, in lower_dynamic_bo_access_instr()
|
/external/brotli/c/enc/ |
D | block_splitter_inc.h | 232 size_t block_idx = 0; in FN() local 234 BROTLI_DCHECK(block_idx < num_blocks); in FN() 235 ++block_lengths[block_idx]; in FN() 237 ++block_idx; in FN() 240 BROTLI_DCHECK(block_idx == num_blocks); in FN() 342 size_t block_idx = 0; in FN() local 349 split->types[block_idx] = id; in FN() 350 split->lengths[block_idx] = cur_length; in FN() 353 ++block_idx; in FN() 356 split->num_blocks = block_idx; in FN()
|
/external/skqp/src/compute/skc/platforms/cl_12/ |
D | handle_pool_cl_12.c | 242 skc_uint const block_idx) in skc_handle_pool_block_writable_push() argument 244 handle_pool->block.indices[--handle_pool->block.bos] = block_idx; in skc_handle_pool_block_writable_push() 260 skc_uint const block_idx = skc_handle_pool_block_readable_pop(runtime,handle_pool); in skc_runtime_handle_device_acquire() local 262 handle_pool->acquire.block = block_idx; in skc_runtime_handle_device_acquire() 264 …handle_pool->acquire.handles = handle_pool->handle.indices + (block_idx + 1) * handle_pool->block.… in skc_runtime_handle_device_acquire() 388 skc_uint const block_idx = skc_handle_pool_block_writable_pop(runtime,handle_pool); in skc_runtime_device_reclaim() local 390 reclaim->bih.block = block_idx; in skc_runtime_device_reclaim() 392 … reclaim->bih.handles = handle_pool->handle.indices + (block_idx + 1) * handle_pool->block.width; in skc_runtime_device_reclaim()
|
/external/libvpx/libvpx/vp9/common/ |
D | vp9_scan.h | 43 PLANE_TYPE type, int block_idx) { in get_scan() argument 49 const PREDICTION_MODE mode = get_y_mode(mi, block_idx); in get_scan()
|
D | vp9_mvref_common.h | 225 int search_col, int block_idx) { in get_sub_block_mv() argument 226 return block_idx >= 0 && candidate->sb_type < BLOCK_8X8 in get_sub_block_mv() 228 ->bmi[idx_n_column_to_subblock[block_idx][search_col == 0]] in get_sub_block_mv()
|
/external/libvpx/libvpx/test/ |
D | sad_test.cc | 126 int GetBlockRefOffset(int block_idx) const { in GetBlockRefOffset() 127 return block_idx * kDataBlockSize; in GetBlockRefOffset() 143 uint8_t *GetReference(int block_idx) const { in GetReference() 144 return GetReferenceFromOffset(GetBlockRefOffset(block_idx)); in GetReference() 177 unsigned int ReferenceSADavg(int block_idx) const { in ReferenceSADavg() 179 const uint8_t *const reference8 = GetReference(block_idx); in ReferenceSADavg() 184 CONVERT_TO_SHORTPTR(GetReference(block_idx)); in ReferenceSADavg() 323 unsigned int SAD(int block_idx) const { in SAD() 325 const uint8_t *const reference = GetReference(block_idx); in SAD() 350 unsigned int SAD_avg(int block_idx) const { in SAD_avg() [all …]
|
/external/tensorflow/tensorflow/lite/tools/optimize/sparsity/ |
D | format_converter.cc | 273 const int block_idx = traversal_order_[i] - orig_rank; in Populate() local 274 const int orig_dim = block_map_[block_idx]; in Populate() 276 orig_idx[orig_dim] * block_size_[block_idx] + indices[i]; in Populate()
|
/external/mesa3d/src/intel/compiler/ |
D | brw_schedule_instructions.cpp | 559 this->block_idx = 0; in instruction_scheduler() 631 int block_idx; member in instruction_scheduler 832 if (!BITSET_TEST(livein[block_idx], inst->dst.nr) && in get_register_pressure_benefit() 842 !BITSET_TEST(liveout[block_idx], inst->src[i].nr) && in get_register_pressure_benefit() 850 if (!BITSET_TEST(hw_liveout[block_idx], reg) && in get_register_pressure_benefit() 1692 block_idx = block->num; in schedule_instructions()
|
/external/libvpx/libvpx/vp8/decoder/ |
D | error_concealment.c | 346 static void assign_neighbor(EC_BLOCK *neighbor, MODE_INFO *mi, int block_idx) { in assign_neighbor() argument 349 neighbor->mv = mi->bmi[block_idx].mv.as_mv; in assign_neighbor()
|