Home
last modified time | relevance | path

Searched refs:clause (Results 1 - 25 of 40) sorted by relevance

12

/third_party/mesa3d/src/panfrost/bifrost/
H A Dbi_scoreboard.c29 /* Assign dependency slots to each clause and calculate dependencies, This pass
32 * 1. A clause that does not produce a message must use the sentinel slot #0
33 * 2a. A clause that depends on the results of a previous message-passing
43 * 8. If a clause writes to a read staging register of an unresolved
90 /* Given a scoreboard model, choose a slot for a clause wrapping a given
171 bi_push_clause(struct bi_scoreboard_state *st, bi_clause *clause) in bi_push_clause() argument
173 bi_instr *I = clause->message; in bi_push_clause()
174 unsigned slot = clause->scoreboard_id; in bi_push_clause()
188 bi_depend_on_writers(bi_clause *clause, struct bi_scoreboard_state *st, uint64_t regmask) in bi_depend_on_writers() argument
197 clause in bi_depend_on_writers()
202 bi_set_staging_barrier(bi_clause *clause, struct bi_scoreboard_state *st, uint64_t regmask) bi_set_staging_barrier() argument
216 bi_set_dependencies(bi_block *block, bi_clause *clause, struct bi_scoreboard_state *st) bi_set_dependencies() argument
[all...]
H A Dbi_layout.c26 /* The scheduler packs multiple instructions into a clause (grouped as tuple),
27 * and the packing code takes in a clause and emits it to the wire. During
29 * within the clause so constraints can be resolved during scheduling instead
32 * manipulating clause layouts.
35 /* Is embedded constant 0 packed for free in a clause with this many tuples? */
46 /* Helper to calculate the number of quadwords in a clause. This is a function
73 bi_clause_quadwords(bi_clause *clause) in bi_clause_quadwords() argument
75 unsigned X = clause->tuple_count; in bi_clause_quadwords()
78 unsigned constants = clause->constant_count; in bi_clause_quadwords()
87 * are from the beginning of a clause s
[all...]
H A Dbi_pack.c32 bi_pack_header(bi_clause *clause, bi_clause *next_1, bi_clause *next_2) in bi_pack_header() argument
43 if (clause->message_type == BIFROST_MESSAGE_BARRIER) in bi_pack_header()
52 BIFROST_FLOW_END : clause->flow_control, in bi_pack_header()
53 .terminate_discarded_threads = clause->td, in bi_pack_header()
54 .next_clause_prefetch = clause->next_clause_prefetch && next_1, in bi_pack_header()
56 .staging_register = clause->staging_register, in bi_pack_header()
58 .dependency_slot = clause->scoreboard_id, in bi_pack_header()
59 .message_type = clause->message_type, in bi_pack_header()
61 .flush_to_zero = clause->ftz ? BIFROST_FTZ_ALWAYS : BIFROST_FTZ_DISABLE in bi_pack_header()
321 bi_pack_tuple(bi_clause *clause, bi_tupl argument
638 bi_pack_clause(bi_context *ctx, bi_clause *clause, bi_clause *next_1, bi_clause *next_2, struct util_dynarray *emission, gl_shader_stage stage) bi_pack_clause() argument
712 bi_collect_blend_ret_addr(bi_context *ctx, struct util_dynarray *emission, const bi_clause *clause) bi_collect_blend_ret_addr() argument
[all...]
H A Dbi_print.c83 bi_print_clause(bi_clause *clause, FILE *fp) in bi_print_clause() argument
85 fprintf(fp, "id(%u)", clause->scoreboard_id); in bi_print_clause()
87 if (clause->dependencies) { in bi_print_clause()
91 if (clause->dependencies & (1 << i)) in bi_print_clause()
98 fprintf(fp, " %s", bi_flow_control_name(clause->flow_control)); in bi_print_clause()
100 if (!clause->next_clause_prefetch) in bi_print_clause()
103 if (clause->staging_barrier) in bi_print_clause()
106 if (clause->td) in bi_print_clause()
109 if (clause->pcrel_idx != ~0) in bi_print_clause()
110 fprintf(fp, " pcrel(%u)", clause in bi_print_clause()
[all...]
H A Dbi_schedule.c50 /* State of a single tuple and clause under construction */
72 /* Is this the last tuple in the clause */
106 /* Index of the constant into the clause */
133 /* Numerical state of the clause */
322 struct bi_clause_state *clause, struct bi_tuple_state *tuple) in bi_lower_cubeface()
344 bi_lower_atom_c(bi_context *ctx, struct bi_clause_state *clause, struct in bi_lower_atom_c() argument
363 bi_lower_atom_c1(bi_context *ctx, struct bi_clause_state *clause, struct in bi_lower_atom_c1() argument
385 struct bi_clause_state *clause, struct bi_tuple_state *tuple) in bi_lower_seg_add()
405 struct bi_clause_state *clause, struct bi_tuple_state *tuple) in bi_lower_dtsel()
570 * paired instructions) can run afoul of the "no two writes on the last clause"
321 bi_lower_cubeface(bi_context *ctx, struct bi_clause_state *clause, struct bi_tuple_state *tuple) bi_lower_cubeface() argument
384 bi_lower_seg_add(bi_context *ctx, struct bi_clause_state *clause, struct bi_tuple_state *tuple) bi_lower_seg_add() argument
404 bi_lower_dtsel(bi_context *ctx, struct bi_clause_state *clause, struct bi_tuple_state *tuple) bi_lower_dtsel() argument
762 bi_nconstants(struct bi_clause_state *clause) bi_nconstants() argument
775 bi_space_for_more_constants(struct bi_clause_state *clause) bi_space_for_more_constants() argument
786 bi_update_fau(struct bi_clause_state *clause, struct bi_tuple_state *tuple, bi_instr *instr, bool fma, bool destructive) bi_update_fau() argument
1021 bi_numerically_incompatible(struct bi_clause_state *clause, bi_instr *instr) bi_numerically_incompatible() argument
1035 bi_instr_schedulable(bi_instr *instr, struct bi_clause_state *clause, struct bi_tuple_state *tuple, uint64_t live_after_temp, bool fma) bi_instr_schedulable() argument
1175 bi_choose_index(struct bi_worklist st, struct bi_clause_state *clause, struct bi_tuple_state *tuple, uint64_t live_after_temp, bool fma) bi_choose_index() argument
1207 bi_pop_instr(struct bi_clause_state *clause, struct bi_tuple_state *tuple, bi_instr *instr, uint64_t live_after_temp, bool fma) bi_pop_instr() argument
1237 bi_take_instr(bi_context *ctx, struct bi_worklist st, struct bi_clause_state *clause, struct bi_tuple_state *tuple, uint64_t live_after_temp, bool fma) bi_take_instr() argument
1667 bi_clause *clause = rzalloc(ctx, bi_clause); bi_schedule_clause() local
2050 bi_clause *clause = bi_next_clause(ctx, block, NULL); bi_add_nop_for_atest() local
[all...]
H A Dbir.c152 bi_next_clause(bi_context *ctx, bi_block *block, bi_clause *clause) in bi_next_clause() argument
154 if (!block && !clause) in bi_next_clause()
157 /* Try the first clause in this block if we're starting from scratch */ in bi_next_clause()
158 if (!clause && !list_is_empty(&block->clauses)) in bi_next_clause()
161 /* Try the next clause in this block */ in bi_next_clause()
162 if (clause && clause->link.next != &block->clauses) in bi_next_clause()
163 return list_first_entry(&(clause->link), bi_clause, link); in bi_next_clause()
224 * branches and for the last instruction (clause) in a block whose
H A Dcompiler.h589 /* Architectural limit of 8 tuples/clause */
593 /* For scoreboarding -- the clause ID (this is not globally unique!)
596 * bitfield matching the hardware, except shifted by a clause (the
605 /* Can we prefetch the next clause? Usually it makes sense, except for
612 /* Corresponds to the usual bit but shifted by a clause */
615 /* Constants read by this clause. ISA limit. Must satisfy:
634 /* Unique in a clause */
641 /* Should flush-to-zero mode be enabled for this clause? */
1069 bi_clause * bi_next_clause(bi_context *ctx, bi_block *block, bi_clause *clause);
1079 void bi_print_clause(bi_clause *clause, FIL
1279 bi_first_instr_in_clause(bi_clause *clause) bi_first_instr_in_clause() argument
1285 bi_last_instr_in_clause(bi_clause *clause) bi_last_instr_in_clause() argument
1316 bi_before_clause(bi_clause *clause) bi_before_clause() argument
1328 bi_after_clause(bi_clause *clause) bi_after_clause() argument
[all...]
H A Dbi_helper_invocations.c30 * to skip execution. Each clause has a `terminate_discarded_threads` bit,
33 * The terminate bit should be set on the last clause requiring helper
49 * set, and the clause containing the derivative has the terminate bit set.
185 bi_foreach_clause_in_block_rev(block, clause) { in bi_mark_clauses_td()
186 bi_foreach_instr_in_clause_rev(block, clause, I) { in bi_mark_clauses_td()
190 clause->td = !helpers; in bi_mark_clauses_td()
/third_party/eudev/test/
H A Drule-syntax-check.py53 for clause in line.split(','):
54 clause = clause.strip() variable
55 if not (no_args_tests.match(clause) or args_tests.match(clause) or
56 no_args_assign.match(clause) or args_assign.match(clause)):
59 print(' clause:', clause)
/third_party/vk-gl-cts/external/vulkan-docs/src/config/chunkindex/
H A Dlunr.js1406 * Creates a token set from a query clause.
1409 * @param {Object} clause - A single clause from lunr.Query.
1410 * @param {string} clause.term - The query clause term.
1411 * @param {number} [clause.editDistance] - The optional edit distance for the term.
1414 lunr.TokenSet.fromClause = function (clause) {
1415 if ('editDistance' in clause) {
1416 return lunr.TokenSet.fromFuzzyString(clause.term, clause
[all...]
/third_party/node/deps/v8/src/interpreter/
H A Dcontrol-flow-builders.h168 void BindCaseTargetForJumpTable(int case_value, CaseClause* clause);
170 void BindCaseTargetForCompareJump(int index, CaseClause* clause);
180 void BindDefault(CaseClause* clause);
193 void BuildBlockCoverage(CaseClause* clause) { in BuildBlockCoverage() argument
194 if (block_coverage_builder_ && clause != nullptr) { in BuildBlockCoverage()
195 block_coverage_builder_->IncrementBlockCounter(clause, in BuildBlockCoverage()
H A Dcontrol-flow-builders.cc105 CaseClause* clause) { in BindCaseTargetForJumpTable()
107 BuildBlockCoverage(clause); in BindCaseTargetForJumpTable()
111 CaseClause* clause) { in BindCaseTargetForCompareJump()
113 BuildBlockCoverage(clause); in BindCaseTargetForCompareJump()
133 void SwitchBuilder::BindDefault(CaseClause* clause) { in BindDefault() argument
135 BuildBlockCoverage(clause); in BindDefault()
104 BindCaseTargetForJumpTable(int case_value, CaseClause* clause) BindCaseTargetForJumpTable() argument
110 BindCaseTargetForCompareJump(int index, CaseClause* clause) BindCaseTargetForCompareJump() argument
/third_party/node/deps/v8/src/ast/
H A Dsource-range-ast-visitor.cc31 for (CaseClause* clause : *clauses) { in VisitSwitchStatement()
32 MaybeRemoveLastContinuationRange(clause->statements()); in VisitSwitchStatement()
H A Dast-traversal-visitor.h202 CaseClause* clause = clauses->at(i); in VisitSwitchStatement() local
203 if (!clause->is_default()) { in VisitSwitchStatement()
204 Expression* label = clause->label(); in VisitSwitchStatement()
207 const ZonePtrList<Statement>* stmts = clause->statements(); in VisitSwitchStatement()
H A Dprettyprinter.cc147 for (CaseClause* clause : *node->cases()) { in VisitSwitchStatement()
148 if (!clause->is_default()) Find(clause->label()); in VisitSwitchStatement()
149 FindStatements(clause->statements()); in VisitSwitchStatement()
967 for (CaseClause* clause : *node->cases()) { in VisitSwitchStatement()
968 if (clause->is_default()) { in VisitSwitchStatement()
970 PrintStatements(clause->statements()); in VisitSwitchStatement()
973 Visit(clause->label()); in VisitSwitchStatement()
974 PrintStatements(clause->statements()); in VisitSwitchStatement()
H A Dprettyprinter.h125 void PrintCaseClause(CaseClause* clause);
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_gcm.cpp332 container_node *clause = NULL; in bu_sched_bb() local
388 clause = NULL; in bu_sched_bb()
416 sampler_indexing = true; // Give sampler indexed ops get their own clause in bu_sched_bb()
438 if (!clause || sampler_indexing) { in bu_sched_bb()
454 clause = sh.create_clause(nst); in bu_sched_bb()
455 bb->push_front(clause); in bu_sched_bb()
458 clause = bb; in bu_sched_bb()
461 bu_schedule(clause, n); in bu_sched_bb()
H A Dsb_sched.cpp882 // Can't happen since clause only contains MOVA/CF_SET_IDX0/1 in load_index_register()
899 // Can't happen since clause only contains MOVA/CF_SET_IDX0/1 in load_index_register()
1141 // Can't happen since clause only contains MOVA/CF_SET_IDX0/1 in emit_clause()
1646 // Cannot schedule in same clause as instructions using this index value in try_add_instruction()
1874 // can lead to breaking clause slot count limit - we don't want mova to in prepare_alu_group()
1875 // end up in the end of the new clause instead of beginning of the in prepare_alu_group()
1876 // current clause. in prepare_alu_group()
1984 group(), clause(), in alu_clause_tracker()
2001 if (!clause) { in emit_group()
2002 clause in emit_group()
[all...]
/third_party/rust/crates/cxx/gen/cmd/src/syntax/
H A Dtrivial.rs223 for (i, clause) in clauses.iter().enumerate() { in fmt()
225 write!(f, "{} ", clause.article())?; in fmt()
231 clause.fmt(f)?; in fmt()
/third_party/rust/crates/cxx/gen/lib/src/syntax/
H A Dtrivial.rs223 for (i, clause) in clauses.iter().enumerate() { in fmt()
225 write!(f, "{} ", clause.article())?; in fmt()
231 clause.fmt(f)?; in fmt()
/third_party/rust/crates/cxx/gen/build/src/syntax/
H A Dtrivial.rs223 for (i, clause) in clauses.iter().enumerate() { in fmt()
225 write!(f, "{} ", clause.article())?; in fmt()
231 clause.fmt(f)?; in fmt()
/third_party/rust/crates/cxx/syntax/
H A Dtrivial.rs223 for (i, clause) in clauses.iter().enumerate() { in fmt()
225 write!(f, "{} ", clause.article())?; in fmt()
231 clause.fmt(f)?; in fmt()
/third_party/rust/crates/cxx/macro/src/syntax/
H A Dtrivial.rs223 for (i, clause) in clauses.iter().enumerate() { in fmt()
225 write!(f, "{} ", clause.article())?; in fmt()
231 clause.fmt(f)?; in fmt()
/third_party/mesa3d/src/amd/compiler/tests/
H A Dtest_isel.cpp139 BEGIN_TEST(isel.sparse.clause)
/third_party/node/deps/v8/src/parsing/
H A Drewriter.cc306 CaseClause* clause = clauses->at(i); in VisitSwitchStatement() local
307 Process(clause->statements()); in VisitSwitchStatement()

Completed in 22 milliseconds

12