| /xsrc/external/mit/MesaLib/dist/src/amd/compiler/ |
| aco_dominance.cpp | 36 * are processed before the current block.
48 Block& block = program->blocks[i]; local
51 for (unsigned pred_idx : block.logical_preds) {
68 for (unsigned pred_idx : block.linear_preds) {
85 block.logical_idom = new_logical_idom;
86 block.linear_idom = new_linear_idom;
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/vc4/ |
| vc4_opt_coalesce_ff_writes.c | 37 struct qblock *block = qir_entry_block(c); local
38 if (block != qir_exit_block(c))
|
| vc4_opt_vpm.c | 40 struct qblock *block = qir_entry_block(c); local
41 if (block != qir_exit_block(c))
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/vc4/ |
| vc4_opt_coalesce_ff_writes.c | 37 struct qblock *block = qir_entry_block(c); local
38 if (block != qir_exit_block(c))
|
| vc4_opt_vpm.c | 40 struct qblock *block = qir_entry_block(c); local
41 if (block != qir_exit_block(c))
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| nir_lower_discard_or_demote.c | 83 nir_cf_node *node = &instr->block->cf_node;
86 nir_block *block = nir_cf_node_as_block(node); local
87 if (block == instr->block) {
90 b->cursor = nir_after_block_before_jump(block);
|
| nir_gs_count_vertices.c | 72 * end block. So we don't need to walk all of them.
75 nir_block *block = (nir_block *) entry->key; local
77 nir_foreach_instr_reverse(instr, block) {
|
| nir_lower_memory_model.c | 200 nir_block *block = nir_cf_node_as_block(cf_node); local
201 nir_foreach_instr(instr, block)
239 nir_block *block = nir_cf_node_as_block(cf_node); local
240 nir_foreach_instr_reverse(instr, block)
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/etnaviv/ |
| etnaviv_nir_lower_ubo_to_uniform.c | 30 * Pass to lower the load_ubo intrinsics for block 0 back to load_uniform intrinsics.
46 const uint32_t block = nir_src_as_uint(intr->src[0]); local
47 if (block > 0)
|
| /xsrc/external/mit/MesaLib/dist/src/mesa/main/ |
| execmem.c | 43 * Allocate a large block of memory which can hold code then dole it out
94 struct mem_block *block = NULL; local
104 block = u_mmAllocMem(exec_heap, size, 5, 0);
107 if (block)
108 addr = exec_mem + block->ofs;
125 struct mem_block *block = u_mmFindBlock(exec_heap, (unsigned char *)addr - exec_mem); local
127 if (block)
128 u_mmFreeMem(block);
|
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/ |
| nir_gs_count_vertices.c | 63 * end block. So we don't need to walk all of them.
66 nir_block *block = (nir_block *) entry->key; local
68 nir_foreach_instr_reverse(instr, block) {
|
| /xsrc/external/mit/MesaLib.old/dist/src/mesa/main/ |
| execmem.c | 43 * Allocate a large block of memory which can hold code then dole it out
94 struct mem_block *block = NULL; local
104 block = mmAllocMem( exec_heap, size, 32, 0 );
107 if (block)
108 addr = exec_mem + block->ofs;
125 struct mem_block *block = mmFindBlock(exec_heap, (unsigned char *)addr - exec_mem); local
127 if (block)
128 mmFreeMem(block);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/rtasm/ |
| rtasm_execmem.c | 56 * Allocate a large block of memory which can hold code then dole it out
90 struct mem_block *block = NULL; local
100 block = u_mmAllocMem( exec_heap, size, 5, 0 ); /* 5 -> 32-byte alignment */
103 if (block)
104 addr = exec_mem + block->ofs;
121 struct mem_block *block = u_mmFindBlock(exec_heap, (unsigned char *)addr - exec_mem); local
123 if (block)
124 u_mmFreeMem(block);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/util/ |
| u_linear.h | 41 /** Block size in bytes */
44 /** Block width in pixels */
47 /** Block height in pixels */
68 /* Describe each block within the tile */
69 struct u_linear_format_block block; member in struct:pipe_tile_info
81 * @block block info about pixel layout
88 const struct u_linear_format_block *block,
94 if (t->tile.size != t->block.size * t->cols * t->rows)
97 if (t->stride != t->block.size * t->cols * t->tiles_x
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/llvmpipe/ |
| lp_rast_linear.c | 250 const struct cmd_block *block; local
257 for (block = bin->head; block; block = block->next) {
258 for (k = 0; k < block->count; k++) {
259 assert(dispatch_linear[block->cmd[k]]);
260 dispatch_linear[block->cmd[k]]( task, block->arg[k] );
|
| lp_test_printf.c | 67 LLVMBasicBlockRef block = LLVMAppendBasicBlockInContext(gallivm->context, func, "entry"); local
71 LLVMPositionBuilderAtEnd(builder, block);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r300/compiler/ |
| memory_pool.c | 47 struct memory_block * block = pool->blocks; local
48 pool->blocks = block->next;
49 free(block);
88 struct memory_block * block = malloc(bytes + sizeof(struct memory_block)); local
90 block->next = pool->blocks;
91 pool->blocks = block;
93 return (block + 1);
|
| /xsrc/external/mit/MesaLib/dist/src/panfrost/midgard/ |
| midgard_ra_pipeline.c | 44 midgard_block *block,
109 if (mir_is_live_after(ctx, block, end, ins->dest))
133 midgard_block *block = (midgard_block *) _block; local
135 mir_foreach_bundle_in_block(block, bundle) {
140 bool succ = mir_pipeline_ins(ctx, block, bundle, 0, 0);
141 mir_pipeline_ins(ctx, block, bundle, 1, succ);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/rtasm/ |
| rtasm_execmem.c | 56 * Allocate a large block of memory which can hold code then dole it out
90 struct mem_block *block = NULL; local
100 block = u_mmAllocMem( exec_heap, size, 5, 0 ); /* 5 -> 32-byte alignment */
103 if (block)
104 addr = exec_mem + block->ofs;
121 struct mem_block *block = u_mmFindBlock(exec_heap, (unsigned char *)addr - exec_mem); local
123 if (block)
124 u_mmFreeMem(block);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/util/ |
| u_linear.h | 41 /** Block size in bytes */
44 /** Block width in pixels */
47 /** Block height in pixels */
68 /* Describe each block within the tile */
69 struct u_linear_format_block block; member in struct:pipe_tile_info
81 * @block block info about pixel layout
88 const struct u_linear_format_block *block,
94 if (t->tile.size != t->block.size * t->cols * t->rows)
97 if (t->stride != t->block.size * t->cols * t->tiles_x
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r300/compiler/ |
| memory_pool.c | 47 struct memory_block * block = pool->blocks; local
48 pool->blocks = block->next;
49 free(block);
88 struct memory_block * block = malloc(bytes + sizeof(struct memory_block)); local
90 block->next = pool->blocks;
91 pool->blocks = block;
93 return (block + 1);
|
| /xsrc/external/mit/freetype/dist/src/base/ |
| md5.h | 38 MD5_u32plus block[16]; member in struct:__anon5421
|
| /xsrc/external/mit/libdrm/dist/intel/ |
| mm.c | 60 struct mem_block *heap, *block; local
69 block = (struct mem_block *)calloc(1, sizeof(struct mem_block));
70 if (!block) {
75 heap->next = block;
76 heap->prev = block;
77 heap->next_free = block;
78 heap->prev_free = block;
80 block->heap = heap;
81 block->next = heap;
82 block->prev = heap
[all...] |
| /xsrc/external/mit/xterm/dist/ |
| scrollback.c | 72 Char *block; local
85 * data block.
98 block = allocScrnData(screen, 1, ncols, False);
101 setupLineData(screen, where, (Char *) block, 1, ncols, False);
104 which, (void *) where, block));
119 * data block.
|
| /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/tests/ |
| delay.c | 127 struct ir3_block *block = ir3_start_block(ir); local
129 foreach_instr_safe (instr, &block->instr_list) {
164 struct ir3_block *block = local
168 foreach_instr_rev (instr, &block->instr_list) {
176 * block, so remove it from the block so that it doesn't get counted
181 unsigned n = ir3_delay_calc_exact(block, last, true);
|
