Searched refs:dep (Results 1 - 25 of 1000) sorted by relevance

1234567891011>>

/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/ir/gp/
H A Dnode.c309 /* don't add dep for two nodes from different block */
313 /* don't add self loop dep */
317 /* don't add duplicated dep */
318 gpir_node_foreach_pred(succ, dep) {
319 if (dep->pred == pred) {
321 if (dep->type > type)
322 dep->type = type;
323 return dep;
327 gpir_dep *dep = ralloc(succ, gpir_dep); local in function:gpir_node_add_dep
328 dep
365 gpir_node_replace_pred(gpir_dep * dep,gpir_node * new_pred) argument
[all...]
H A Dscheduler.c44 * write-after-read dep. But this is not really write-after-read
45 * dep because there's no r1 really, because it's a value register.
46 * We need this fake dep in the schedule phase to make sure in any
49 * 5. build DAG according to all the real and fake dep
73 * fake dep added before schedule). The worst case for step 5 is that all of
82 static int gpir_min_dist_alu(gpir_dep *dep) argument
84 switch (dep->pred->op) {
99 static int gpir_get_min_dist(gpir_dep *dep) argument
101 switch (dep->type) {
103 switch (dep
165 gpir_max_dist_alu(gpir_dep * dep) argument
197 gpir_get_max_dist(gpir_dep * dep) argument
[all...]
H A Dvalue_regalloc.c59 gpir_node_foreach_succ_safe(spill, dep) {
60 gpir_node *succ = dep->succ;
62 gpir_node_replace_pred(dep, &load->node);
93 gpir_node_foreach_succ(node, dep) {
94 gpir_node *succ = dep->succ;
105 gpir_node_foreach_pred(node, dep) {
106 gpir_node *pred = dep->pred;
120 /* round robin reg select to reduce false dep when schedule */
152 gpir_node_foreach_pred(node, dep) {
153 gpir_node *pred = dep
[all...]
H A Dreduce_scheduler.c40 gpir_node_foreach_pred(node, dep) {
41 gpir_node *pred = dep->pred;
65 gpir_node_foreach_pred(node, dep) {
66 gpir_node *pred = dep->pred;
137 gpir_node_foreach_pred(node, dep) {
138 gpir_node *pred = dep->pred;
142 gpir_node_foreach_succ(pred, dep) {
143 gpir_node *succ = dep->succ;
H A Dgpir.h344 void gpir_node_replace_pred(gpir_dep *dep, gpir_node *new_pred);
351 #define gpir_node_foreach_succ(node, dep) \
352 list_for_each_entry(gpir_dep, dep, &node->succ_list, succ_link)
353 #define gpir_node_foreach_succ_safe(node, dep) \
354 list_for_each_entry_safe(gpir_dep, dep, &node->succ_list, succ_link)
355 #define gpir_node_foreach_pred(node, dep) \
356 list_for_each_entry(gpir_dep, dep, &node->pred_list, pred_link)
357 #define gpir_node_foreach_pred_safe(node, dep) \
358 list_for_each_entry_safe(gpir_dep, dep, &node->pred_list, pred_link)
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/gp/
H A Dnode.c332 /* don't add dep for two nodes from different block */
336 /* don't add self loop dep */
340 /* don't add duplicated dep */
341 gpir_node_foreach_pred(succ, dep) {
342 if (dep->pred == pred) {
344 if (dep->type > type)
345 dep->type = type;
346 return dep;
350 gpir_dep *dep = ralloc(succ, gpir_dep); local in function:gpir_node_add_dep
351 dep
392 gpir_node_replace_pred(gpir_dep * dep,gpir_node * new_pred) argument
[all...]
H A Dscheduler.c228 static int gpir_min_dist_alu(gpir_dep *dep) argument
230 switch (dep->pred->op) {
245 static int gpir_get_min_dist(gpir_dep *dep) argument
247 switch (dep->type) {
249 switch (dep->succ->op) {
258 if (dep->pred->type == gpir_node_type_load ||
259 dep->pred->op == gpir_op_complex1)
265 return gpir_min_dist_alu(dep);
269 assert(dep->succ->op == gpir_op_store_temp);
270 return gpir_min_dist_alu(dep);
296 gpir_max_dist_alu(gpir_dep * dep) argument
328 gpir_get_max_dist(gpir_dep * dep) argument
701 pred_almost_ready(gpir_dep * dep) argument
[all...]
H A Dgpir.h439 void gpir_node_replace_pred(gpir_dep *dep, gpir_node *new_pred);
446 #define gpir_node_foreach_succ(node, dep) \
447 list_for_each_entry(gpir_dep, dep, &node->succ_list, succ_link)
448 #define gpir_node_foreach_succ_safe(node, dep) \
449 list_for_each_entry_safe(gpir_dep, dep, &node->succ_list, succ_link)
450 #define gpir_node_foreach_pred(node, dep) \
451 list_for_each_entry(gpir_dep, dep, &node->pred_list, pred_link)
452 #define gpir_node_foreach_pred_safe(node, dep) \
453 list_for_each_entry_safe(gpir_dep, dep, &node->pred_list, pred_link)
H A Dreduce_scheduler.c40 gpir_node_foreach_pred(node, dep) {
41 gpir_node *pred = dep->pred;
65 gpir_node_foreach_pred(node, dep) {
66 gpir_node *pred = dep->pred;
144 gpir_node_foreach_pred(node, dep) {
145 gpir_node *pred = dep->pred;
149 gpir_node_foreach_succ(pred, dep) {
150 gpir_node *succ = dep->succ;
/xsrc/external/mit/xorg-server.old/dist/hw/xfree86/loader/
H A DMakefile.am27 CLEANFILES = sdksyms.c sdksyms.dep
29 sdksyms.dep sdksyms.c: sdksyms.sh $(top_builddir)/include/do-not-use-config.h
32 SDKSYMS_DEP = sdksyms.dep
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/ir/pp/
H A Dnode.c330 /* don't add dep for two nodes from different block */
334 /* don't add duplicated dep */
335 ppir_node_foreach_pred(succ, dep) {
336 if (dep->pred == pred)
340 ppir_dep *dep = ralloc(succ, ppir_dep); local in function:ppir_node_add_dep
341 dep->pred = pred;
342 dep->succ = succ;
343 list_addtail(&dep->pred_link, &succ->pred_list);
344 list_addtail(&dep->succ_link, &pred->succ_list);
347 void ppir_node_remove_dep(ppir_dep *dep) argument
376 ppir_node_replace_pred(ppir_dep * dep,ppir_node * new_pred) argument
[all...]
H A Dppir.h329 void ppir_node_remove_dep(ppir_dep *dep);
334 void ppir_node_replace_pred(ppir_dep *dep, ppir_node *new_pred);
366 #define ppir_node_foreach_succ(node, dep) \
367 list_for_each_entry(ppir_dep, dep, &node->succ_list, succ_link)
368 #define ppir_node_foreach_succ_safe(node, dep) \
369 list_for_each_entry_safe(ppir_dep, dep, &node->succ_list, succ_link)
370 #define ppir_node_foreach_pred(node, dep) \
371 list_for_each_entry(ppir_dep, dep, &node->pred_list, pred_link)
372 #define ppir_node_foreach_pred_safe(node, dep) \
373 list_for_each_entry_safe(ppir_dep, dep,
[all...]
H A Dscheduler.c36 ppir_instr_foreach_pred(instr, dep) {
37 ppir_instr *pred = dep->pred;
59 ppir_instr_foreach_pred(instr, dep) {
60 ppir_instr *pred = dep->pred;
133 ppir_instr_foreach_pred(instr, dep) {
134 ppir_instr *pred = dep->pred;
138 ppir_instr_foreach_succ(pred, dep) {
139 ppir_instr *succ = dep->succ;
H A Dnode_to_instr.c94 ppir_node_foreach_succ_safe(node, dep) {
95 ppir_node *succ = dep->succ;
116 ppir_node_replace_pred(dep, move);
139 ppir_node_foreach_succ_safe(node, dep) {
140 ppir_node *succ = dep->succ;
153 ppir_node_replace_pred(dep, dup);
169 ppir_node_replace_pred(dep, dup);
291 ppir_node_foreach_pred_safe(node, dep) {
292 ppir_node *pred = dep->pred;
295 ppir_node_remove_dep(dep);
[all...]
H A Dlower.c42 ppir_node_foreach_succ_safe(node, dep) {
43 ppir_node *succ = dep->succ;
62 ppir_node_replace_pred(dep, move);
96 ppir_node_foreach_pred_safe(node, dep) {
97 ppir_node *pred = dep->pred;
98 ppir_node_remove_dep(dep);
172 ppir_node_foreach_succ(node, dep) {
173 ppir_node *succ = dep->succ;
213 ppir_node_foreach_succ(node, dep) {
214 ppir_node_add_dep(dep
[all...]
H A Dinstr.c48 ppir_instr_foreach_pred(succ, dep) {
49 if (pred == dep->pred)
53 ppir_dep *dep = ralloc(succ, ppir_dep); local in function:ppir_instr_add_dep
54 dep->pred = pred;
55 dep->succ = succ;
56 list_addtail(&dep->pred_link, &succ->pred_list);
57 list_addtail(&dep->succ_link, &pred->succ_list);
280 ppir_instr_foreach_pred(instr, dep) {
281 ppir_instr_print_sub(dep->pred);
/xsrc/external/mit/MesaLib/dist/src/intel/compiler/
H A Dbrw_fs_scoreboard.cpp500 * Return whether \p dep contains any dependency information.
503 is_valid(const dependency &dep) argument
505 return dep.ordered || dep.unordered;
519 dependency dep; local in function:__anon19a82a480110::merge
522 dep.ordered = dep0.ordered | dep1.ordered;
524 dep.jp.jp[p] = MAX2(dep0.jp.jp[p], dep1.jp.jp[p]);
528 dep.unordered = dep0.unordered | dep1.unordered;
529 dep.id = eq.link(dep0.unordered ? dep0.id : dep1.id,
533 dep
558 transport(dependency dep,int delta[IDX (TGL_PIPE_ALL)]) argument
575 dependency_for_read(dependency dep) argument
589 dependency_for_write(const struct intel_device_info * devinfo,const fs_inst * inst,dependency dep) argument
712 dep(const fs_reg &r) function in class:__anon19a82a480110::scoreboard
740 push_back(const dependency & dep) argument
780 add_dependency(const unsigned * ids,dependency_list & deps,dependency dep) argument
1115 const dependency dep = sb.get(brw_acc_reg(8)); local in function:__anon19a82a480110::gather_inst_dependencies
1147 const dependency dep = sb.get(brw_acc_reg(8)); local in function:__anon19a82a480110::gather_inst_dependencies
1197 const dependency &dep = deps0[ip][i]; local in function:__anon19a82a480110::allocate_inst_dependencies
1234 const dependency &dep = deps[ip][i]; local in function:__anon19a82a480110::emit_inst_dependencies
1263 const dependency &dep = deps[ip][i]; local in function:__anon19a82a480110::emit_inst_dependencies
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/pp/
H A Dnode.c390 /* don't add dep for two nodes from different block */
396 /* don't add duplicated dep */
397 ppir_node_foreach_pred(succ, dep) {
398 if (dep->pred == pred)
402 ppir_dep *dep = ralloc(succ, ppir_dep); local in function:ppir_node_add_dep
403 dep->pred = pred;
404 dep->succ = succ;
405 dep->type = type;
406 list_addtail(&dep->pred_link, &succ->pred_list);
407 list_addtail(&dep
410 ppir_node_remove_dep(ppir_dep * dep) argument
467 ppir_node_replace_pred(ppir_dep * dep,ppir_node * new_pred) argument
[all...]
H A Dscheduler.c36 ppir_instr_foreach_pred(instr, dep) {
37 ppir_instr *pred = dep->pred;
59 ppir_instr_foreach_pred(instr, dep) {
60 ppir_instr *pred = dep->pred;
133 ppir_instr_foreach_pred(instr, dep) {
134 ppir_instr *pred = dep->pred;
138 ppir_instr_foreach_succ(pred, dep) {
139 ppir_instr *succ = dep->succ;
H A Dppir.h396 void ppir_node_remove_dep(ppir_dep *dep);
401 void ppir_node_replace_pred(ppir_dep *dep, ppir_node *new_pred);
439 #define ppir_node_foreach_succ(node, dep) \
440 list_for_each_entry(ppir_dep, dep, &node->succ_list, succ_link)
441 #define ppir_node_foreach_succ_safe(node, dep) \
442 list_for_each_entry_safe(ppir_dep, dep, &node->succ_list, succ_link)
443 #define ppir_node_foreach_pred(node, dep) \
444 list_for_each_entry(ppir_dep, dep, &node->pred_list, pred_link)
445 #define ppir_node_foreach_pred_safe(node, dep) \
446 list_for_each_entry_safe(ppir_dep, dep,
[all...]
H A Dinstr.c48 ppir_instr_foreach_pred(succ, dep) {
49 if (pred == dep->pred)
53 ppir_dep *dep = ralloc(succ, ppir_dep); local in function:ppir_instr_add_dep
54 dep->pred = pred;
55 dep->succ = succ;
56 list_addtail(&dep->pred_link, &succ->pred_list);
57 list_addtail(&dep->succ_link, &pred->succ_list);
315 ppir_instr_foreach_pred(instr, dep) {
316 ppir_instr_print_sub(dep->pred);
/xsrc/external/mit/MesaLib/dist/src/compiler/nir/
H A Dnir_schedule.h68 * true then a dependency should be added and dep is filled in to describe
72 nir_schedule_dependency *dep,
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/freedreno/
H A Dfreedreno_batch.c234 struct fd_batch *dep; local in function:batch_flush_dependencies
236 foreach_batch (dep, cache, batch->dependents_mask) {
237 fd_batch_flush(dep);
238 fd_batch_reference(&dep, NULL);
248 struct fd_batch *dep; local in function:batch_reset_dependencies
250 foreach_batch (dep, cache, batch->dependents_mask) {
251 fd_batch_reference(&dep, NULL);
403 struct fd_batch *dep; local in function:recursive_dependents_mask
406 foreach_batch (dep, cache, batch->dependents_mask)
407 dependents_mask |= recursive_dependents_mask(dep);
413 fd_batch_add_dep(struct fd_batch * batch,struct fd_batch * dep) argument
483 struct fd_batch *dep; local in function:fd_batch_resource_write
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/freedreno/
H A Dfreedreno_batch.c197 struct fd_batch *dep; local in function:batch_flush_reset_dependencies
199 foreach_batch(dep, cache, batch->dependents_mask) {
201 fd_batch_flush(dep, false, false);
202 fd_batch_reference(&dep, NULL);
407 struct fd_batch *dep; local in function:batch_depends_on
412 foreach_batch(dep, cache, batch->dependents_mask)
413 if (batch_depends_on(batch, dep))
420 fd_batch_add_dep(struct fd_batch *batch, struct fd_batch *dep) argument
422 if (batch->dependents_mask & (1 << dep->idx))
426 debug_assert(!batch_depends_on(dep, batc
469 struct fd_batch *dep; local in function:fd_batch_resource_used
[all...]
/xsrc/external/mit/MesaLib/dist/src/amd/vulkan/
H A Dradv_pass.c32 radv_render_pass_add_subpass_dep(struct radv_render_pass *pass, const VkSubpassDependency2 *dep) argument
34 uint32_t src = dep->srcSubpass;
35 uint32_t dst = dep->dstSubpass;
49 if (dep->dstStageMask != VK_PIPELINE_STAGE_BOTTOM_OF_PIPE_BIT)
50 pass->end_barrier.src_stage_mask |= dep->srcStageMask;
51 pass->end_barrier.src_access_mask |= dep->srcAccessMask;
52 pass->end_barrier.dst_access_mask |= dep->dstAccessMask;
54 if (dep->dstStageMask != VK_PIPELINE_STAGE_BOTTOM_OF_PIPE_BIT)
55 pass->subpasses[dst].start_barrier.src_stage_mask |= dep->srcStageMask;
56 pass->subpasses[dst].start_barrier.src_access_mask |= dep
525 const VkSubpassDependency2 *dep = &pCreateInfo->pDependencies[i]; local in function:radv_CreateRenderPass2
[all...]

Completed in 21 milliseconds

1234567891011>>