HomeSort by: relevance | last modified time | path
    Searched refs:blocks (Results 1 - 25 of 216) sorted by relevancy

1 2 3 4 5 6 7 8 9

  /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/xvmc/
block.c 38 Status XvMCCreateBlocks(Display *dpy, XvMCContext *context, unsigned int num_blocks, XvMCBlockArray *blocks)
47 assert(blocks);
49 blocks->context_id = context->context_id;
50 blocks->num_blocks = num_blocks;
51 blocks->blocks = MALLOC(BLOCK_SIZE_BYTES * num_blocks);
52 blocks->privData = NULL;
58 Status XvMCDestroyBlocks(Display *dpy, XvMCBlockArray *blocks)
61 assert(blocks);
62 FREE(blocks->blocks)
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/xvmc/
block.c 38 Status XvMCCreateBlocks(Display *dpy, XvMCContext *context, unsigned int num_blocks, XvMCBlockArray *blocks)
47 assert(blocks);
49 blocks->context_id = context->context_id;
50 blocks->num_blocks = num_blocks;
51 blocks->blocks = MALLOC(BLOCK_SIZE_BYTES * num_blocks);
52 blocks->privData = NULL;
58 Status XvMCDestroyBlocks(Display *dpy, XvMCBlockArray *blocks)
61 assert(blocks);
62 FREE(blocks->blocks)
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/amd/compiler/
aco_dominance.cpp 44 program->blocks[0].logical_idom = 0;
45 program->blocks[0].linear_idom = 0;
47 for (unsigned i = 1; i < program->blocks.size(); i++) {
48 Block& block = program->blocks[i];
52 if ((int)program->blocks[pred_idx].logical_idom == -1)
62 pred_idx = program->blocks[pred_idx].logical_idom;
64 new_logical_idom = program->blocks[new_logical_idom].logical_idom;
69 if ((int)program->blocks[pred_idx].linear_idom == -1)
79 pred_idx = program->blocks[pred_idx].linear_idom;
81 new_linear_idom = program->blocks[new_linear_idom].linear_idom
    [all...]
aco_dead_code_analysis.cpp 44 : current_block(program->blocks.size() - 1), uses(program->peekAllocationId())
46 live.reserve(program->blocks.size());
47 for (Block& block : program->blocks)
102 process_block(ctx, program->blocks[next_block]);
106 aco_ptr<Instruction>& startpgm = program->blocks[0].instructions[0];
aco_ssa_elimination.cpp 49 : logical_phi_info(program_->blocks.size()), linear_phi_info(program_->blocks.size()),
50 empty_blocks(program_->blocks.size(), true),
51 blocks_incoming_exec_used(program_->blocks.size(), true), program(program_)
58 for (Block& block : ctx.program->blocks) {
87 for (unsigned block_idx = 0; block_idx < ctx.program->blocks.size(); ++block_idx) {
92 Block& block = ctx.program->blocks[block_idx];
114 /* insert parallelcopies for the linear phis at the end of blocks just before the branch */
115 for (unsigned block_idx = 0; block_idx < ctx.program->blocks.size(); ++block_idx) {
120 Block& block = ctx.program->blocks[block_idx]
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r300/compiler/
memory_pool.c 46 while(pool->blocks) {
47 struct memory_block * block = pool->blocks;
48 pool->blocks = block->next;
62 newblock->next = pool->blocks;
63 pool->blocks = newblock;
90 block->next = pool->blocks;
91 pool->blocks = block;
memory_pool.h 30 * cost of being unable to explicitly free one of the allocated blocks.
41 struct memory_block * blocks; member in struct:memory_pool
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r300/compiler/
memory_pool.c 46 while(pool->blocks) {
47 struct memory_block * block = pool->blocks;
48 pool->blocks = block->next;
62 newblock->next = pool->blocks;
63 pool->blocks = newblock;
90 block->next = pool->blocks;
91 pool->blocks = block;
  /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/xvmc/tests/
test_blocks.c 48 XvMCBlockArray blocks = {0}; local
82 assert(XvMCCreateBlocks(display, NULL, 1, &blocks) == XvMCBadContext);
83 /* Test 0 blocks */
84 assert(XvMCCreateBlocks(display, &context, 0, &blocks) == BadValue);
86 assert(XvMCCreateBlocks(display, &context, min_required_blocks, &blocks) == Success);
88 assert(blocks.context_id == context.context_id);
89 /* Test number of blocks assigned and correct */
90 assert(blocks.num_blocks == min_required_blocks);
92 assert(blocks.blocks != NULL)
    [all...]
test_rendering.c 151 short *blocks; local
192 blocks = block_array.blocks;
223 blocks,
230 blocks += BLOCK_SIZE;
240 blocks,
247 blocks += BLOCK_SIZE;
251 blocks,
258 blocks += BLOCK_SIZE;
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/xvmc/tests/
test_blocks.c 48 XvMCBlockArray blocks = {0}; local
82 assert(XvMCCreateBlocks(display, NULL, 1, &blocks) == XvMCBadContext);
83 /* Test 0 blocks */
84 assert(XvMCCreateBlocks(display, &context, 0, &blocks) == BadValue);
86 assert(XvMCCreateBlocks(display, &context, min_required_blocks, &blocks) == Success);
88 assert(blocks.context_id == context.context_id);
89 /* Test number of blocks assigned and correct */
90 assert(blocks.num_blocks == min_required_blocks);
92 assert(blocks.blocks != NULL)
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/compiler/nir/
nir_worklist.c 40 w->blocks = rzalloc_array(mem_ctx, nir_block *, num_blocks);
47 ralloc_free(w->blocks);
74 w->blocks[w->start] = block;
83 return w->blocks[w->start];
96 BITSET_CLEAR(w->blocks_present, w->blocks[head]->index);
97 return w->blocks[head];
113 w->blocks[tail] = block;
124 return w->blocks[tail];
136 BITSET_CLEAR(w->blocks_present, w->blocks[tail]->index);
137 return w->blocks[tail]
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/
nir_worklist.c 40 w->blocks = rzalloc_array(mem_ctx, nir_block *, num_blocks);
47 ralloc_free(w->blocks);
74 w->blocks[w->start] = block;
83 return w->blocks[w->start];
96 BITSET_CLEAR(w->blocks_present, w->blocks[head]->index);
97 return w->blocks[head];
113 w->blocks[tail] = block;
124 return w->blocks[tail];
136 BITSET_CLEAR(w->blocks_present, w->blocks[tail]->index);
137 return w->blocks[tail]
    [all...]
  /xsrc/external/mit/libXdmcp/dist/
Unwrap.c 63 unsigned char blocks[2][8]; local
76 blocks[k][i] = input[j + i];
85 output[j + i] = tmp[i] ^ blocks[k][i];
  /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/
bi_test.h 44 list_inithead(&ctx->blocks);
52 list_addtail(&blk->link, &ctx->blocks);
89 if (list_length(&A->blocks) != list_length(&B->blocks))
93 &A->blocks, &B->blocks, link) {
bi_opt_push_ubo.c 60 struct bi_ubo_block *blocks; member in struct:bi_ubo_analysis
70 res.blocks = calloc(res.nr_blocks, sizeof(struct bi_ubo_block));
86 uint8_t *range = res.blocks[ubo].range;
101 struct bi_ubo_block *block = &analysis->blocks[ubo];
158 if (!BITSET_TEST(analysis.blocks[ubo].pushed, offset / 4)) {
185 free(analysis.blocks);
  /xsrc/external/mit/MesaLib/dist/src/amd/compiler/tests/
test_assembler.cpp 57 program->blocks[1].linear_preds.push_back(0u);
86 program->blocks[2].linear_preds.push_back(0u);
87 program->blocks[2].linear_preds.push_back(1u);
118 program->blocks[1].linear_preds.push_back(0u);
119 program->blocks[2].linear_preds.push_back(0u);
120 program->blocks[2].linear_preds.push_back(1u);
147 program->blocks[0].linear_preds.push_back(0u);
148 program->blocks[1].linear_preds.push_back(0u);
176 program->blocks[0].linear_preds.push_back(0u);
177 program->blocks[1].linear_preds.push_back(0u)
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/intel/vulkan/tests/
block_pool_no_free.c 37 int32_t blocks[BLOCKS_PER_THREAD]; member in struct:job
54 job->blocks[i] = block;
64 block = job->blocks[i];
76 static void validate_monotonic(int32_t **blocks)
91 if (thread_min > blocks[i][next[i]]) {
92 thread_min = blocks[i][next[i]];
104 ASSERT(blocks[min_thread_idx][next[min_thread_idx]] > highest);
106 highest = blocks[min_thread_idx][next[min_thread_idx]];
135 block_ptrs[i] = jobs[i].blocks;
  /xsrc/external/mit/MesaLib.old/dist/src/intel/vulkan/tests/
block_pool_no_free.c 38 int32_t blocks[BLOCKS_PER_THREAD]; member in struct:job
55 job->blocks[i] = block;
65 block = job->blocks[i];
77 static void validate_monotonic(int32_t **blocks)
92 if (thread_min > blocks[i][next[i]]) {
93 thread_min = blocks[i][next[i]];
105 assert(blocks[min_thread_idx][next[min_thread_idx]] > highest);
107 highest = blocks[min_thread_idx][next[min_thread_idx]];
135 block_ptrs[i] = jobs[i].blocks;
  /xsrc/external/mit/MesaLib/dist/src/panfrost/util/
pan_liveness.c 109 struct list_head *blocks,
125 pan_free_liveness(blocks);
127 list_for_each_entry(pan_block, block, blocks, link) {
135 cur = _mesa_set_add(work_list, pan_exit_block(blocks));
162 pan_free_liveness(struct list_head *blocks)
164 list_for_each_entry(pan_block, block, blocks, link) {
  /xsrc/external/mit/MesaLib/dist/src/compiler/glsl/
link_uniform_blocks.cpp 178 * For uniform blocks laid out according to [std140] rules, the
220 static void process_block_array_leaf(const char *name, gl_uniform_block *blocks,
237 size_t name_length, gl_uniform_block *blocks,
254 process_block_array(ub_array->array, name, new_length, blocks,
258 process_block_array_leaf(*name, blocks,
268 gl_uniform_block *blocks,
278 blocks[i].Name = ralloc_strdup(blocks, name);
279 blocks[i].Uniforms = &variables[(*parcel).index];
288 blocks[i].Binding = (b->has_binding) ? b->binding + binding_offset : 0
354 struct gl_uniform_block *blocks = local
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/compiler/glsl/
link_uniform_blocks.cpp 178 * For uniform blocks laid out according to [std140] rules, the
220 static void process_block_array_leaf(const char *name, gl_uniform_block *blocks,
237 size_t name_length, gl_uniform_block *blocks,
252 process_block_array(ub_array->array, name, new_length, blocks,
256 process_block_array_leaf(*name, blocks,
266 gl_uniform_block *blocks,
276 blocks[i].Name = ralloc_strdup(blocks, name);
277 blocks[i].Uniforms = &variables[(*parcel).index];
286 blocks[i].Binding = (b->has_binding) ? b->binding + *binding_offset : 0
353 struct gl_uniform_block *blocks = local
    [all...]
  /xsrc/external/mit/xf86-video-intel-old/dist/src/
i965_hwmc.h 22 struct drm_memory_block blocks; member in struct:i965_xvmc_context
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/freedreno/a2xx/
fd2_resource.c 41 uint32_t blocks; local
67 blocks = util_format_get_nblocks(format, width, height);
70 slice->size0 = align(blocks * rsc->cpp, 4096);
  /xsrc/external/mit/xf86-video-qxl/dist/src/
murmurhash3.c 105 const uint32_t * blocks; local
114 blocks = (const uint32_t *)(data + nblocks*4);
118 k1 = getblock_32(blocks,i);
177 const uint32_t * blocks; local
185 blocks = (const uint32_t *)(data + nblocks*16);
189 k1 = getblock_32(blocks,i*4+0);
190 k2 = getblock_32(blocks,i*4+1);
191 k3 = getblock_32(blocks,i*4+2);
192 k4 = getblock_32(blocks,i*4+3);
283 const uint64_t * blocks; local
    [all...]

Completed in 21 milliseconds

1 2 3 4 5 6 7 8 9