Home
last modified time | relevance | path

Searched refs:unordered (Results 1 - 25 of 35) sorted by relevance

12

/third_party/mesa3d/src/intel/compiler/
H A Dbrw_fs_scoreboard.cpp413 unordered(TGL_SBID_NULL), id(0),
422 ordered(mode), jp(jp), unordered(TGL_SBID_NULL), id(0),
430 ordered(TGL_REGDIST_NULL), jp(), unordered(mode), id(id),
455 * Synchronization mode of unordered dependency, or zero if no unordered
458 tgl_sbid_mode unordered;
486 dep0.unordered == dep1.unordered &&
507 return dep.ordered || dep.unordered;
529 if (dep0.unordered || dep
390 assert(from < n); if (is[from] != from) assign(is[from], to); is[from] = to; } } unsigned *is; unsigned n; }; struct dependency { dependency() : ordered(TGL_REGDIST_NULL), jp(), unordered(TGL_SBID_NULL), id(0), exec_all(false) {} dependency(tgl_regdist_mode mode, const ordered_address &jp, bool exec_all) : ordered(mode), jp(jp), unordered(TGL_SBID_NULL), id(0), exec_all(exec_all) {} dependency(tgl_sbid_mode mode, unsigned id, bool exec_all) : ordered(TGL_REGDIST_NULL), jp(), unordered(mode), id(id), exec_all(exec_all) {} tgl_regdist_mode ordered; ordered_address jp; tgl_sbid_mode unordered; unsigned id; bool exec_all; static const dependency done; friend bool operator==(const dependency &dep0, const dependency &dep1) { return dep0.ordered == dep1.ordered && dep0.jp == dep1.jp && dep0.unordered == dep1.unordered && dep0.id == dep1.id && dep0.exec_all == dep1.exec_all; } friend bool operator!=(const dependency &dep0, const dependency &dep1) { return !(dep0 == dep1); } }; const dependency dependency::done = dependency(TGL_REGDIST_DST, ordered_address(), false); bool is_valid(const dependency &dep) { return dep.ordered || dep.unordered; } dependency merge(equivalence_relation &eq, const dependency &dep0, const dependency &dep1) { dependency dep; if (dep0.ordered || dep1.ordered) { dep.ordered = dep0.ordered | dep1.ordered; for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) dep.jp.jp[p] = MAX2(dep0.jp.jp[p], dep1.jp.jp[p]); } if (dep0.unordered || dep1.unordered) { dep.unordered = dep0.unordered | dep1.unordered; dep.id = eq.link(dep0.unordered ? dep0.id : dep1.id, dep1.unordered ? dep1.id : dep0.id); } dep.exec_all = dep0.exec_all || dep1.exec_all; return dep; } dependency shadow(const dependency &dep0, const dependency &dep1) { if (dep0.ordered == TGL_REGDIST_SRC && is_valid(dep1) && !(dep1.unordered & TGL_SBID_DST) && !(dep1.ordered & TGL_REGDIST_DST)) { dependency dep = dep1; dep.ordered |= dep0.ordered; for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) dep.jp.jp[p] = MAX2(dep.jp.jp[p], dep0.jp.jp[p]); return dep; } else { return is_valid(dep1) ? dep1 : dep0; } } dependency transport(dependency dep, int delta[IDX(TGL_PIPE_ALL)]) { if (dep.ordered) { for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) { if (dep.jp.jp[p] > INT_MIN) dep.jp.jp[p] += delta[p]; } } return dep; } dependency dependency_for_read(dependency dep) { dep.ordered &= TGL_REGDIST_DST; return dep; } dependency dependency_for_write(const struct intel_device_info *devinfo, const fs_inst *inst, dependency dep) { if (!is_unordered(inst) && is_single_pipe(dep.jp, inferred_exec_pipe(devinfo, inst))) dep.ordered &= TGL_REGDIST_DST; return dep; } class scoreboard { public: dependency get(const fs_reg &r) const { if (const dependency *p = const_cast<scoreboard *>(this)->dep(r)) return *p; else return dependency(); } void set(const fs_reg &r, const dependency &d) { if (dependency *p = dep(r)) *p = d; } friend scoreboard merge(equivalence_relation &eq, const scoreboard &sb0, const scoreboard &sb1) { scoreboard sb; for (unsigned i = 0; i < ARRAY_SIZE(sb.grf_deps); i++) sb.grf_deps[i] = merge(eq, sb0.grf_deps[i], sb1.grf_deps[i]); sb.addr_dep = merge(eq, sb0.addr_dep, sb1.addr_dep); sb.accum_dep = merge(eq, sb0.accum_dep, sb1.accum_dep); return sb; } friend scoreboard shadow(const scoreboard &sb0, const scoreboard &sb1) { scoreboard sb; for (unsigned i = 0; i < ARRAY_SIZE(sb.grf_deps); i++) sb.grf_deps[i] = shadow(sb0.grf_deps[i], sb1.grf_deps[i]); sb.addr_dep = shadow(sb0.addr_dep, sb1.addr_dep); sb.accum_dep = shadow(sb0.accum_dep, sb1.accum_dep); return sb; } friend scoreboard transport(const scoreboard &sb0, int delta[IDX(TGL_PIPE_ALL)]) { scoreboard sb; for (unsigned i = 0; i < ARRAY_SIZE(sb.grf_deps); i++) sb.grf_deps[i] = transport(sb0.grf_deps[i], delta); sb.addr_dep = transport(sb0.addr_dep, delta); sb.accum_dep = transport(sb0.accum_dep, delta); return sb; } friend bool operator==(const scoreboard &sb0, const scoreboard &sb1) { for (unsigned i = 0; i < ARRAY_SIZE(sb0.grf_deps); i++) { if (sb0.grf_deps[i] != sb1.grf_deps[i]) return false; } if (sb0.addr_dep != sb1.addr_dep) return false; if (sb0.accum_dep != sb1.accum_dep) return false; return true; } friend bool operator!=(const scoreboard &sb0, const scoreboard &sb1) { return !(sb0 == sb1); } private: dependency grf_deps[BRW_MAX_GRF]; dependency addr_dep; dependency accum_dep; dependency * dep(const fs_reg &r) { const unsigned reg = (r.file == VGRF ? r.nr + r.offset / REG_SIZE : reg_offset(r) / REG_SIZE); return (r.file == VGRF || r.file == FIXED_GRF ? &grf_deps[reg] : r.file == MRF ? &grf_deps[GFX7_MRF_HACK_START + reg] : r.file == ARF && reg >= BRW_ARF_ADDRESS && reg < BRW_ARF_ACCUMULATOR ? &addr_dep : r.file == ARF && reg >= BRW_ARF_ACCUMULATOR && reg < BRW_ARF_FLAG ? &accum_dep : NULL); } }; struct dependency_list { dependency_list() : deps(NULL), n(0) {} ~dependency_list() { free(deps); } void push_back(const dependency &dep) { deps = (dependency *)realloc(deps, (n + 1) * sizeof(*deps)); deps[n++] = dep; } unsigned size() const { return n; } const dependency & operator[](unsigned i) const { assert(i < n); return deps[i]; } dependency & operator[](unsigned i) { assert(i < n); return deps[i]; } private: dependency_list(const dependency_list &); dependency_list & operator=(const dependency_list &); dependency *deps; unsigned n; }; void add_dependency(const unsigned *ids, dependency_list &deps, dependency dep) { if (is_valid(dep)) { if (dep.unordered) dep.id = ids[dep.id]; for (unsigned i = 0; i < deps.size(); i++) { if (deps[i].exec_all != dep.exec_all && (!deps[i].exec_all || (dep.unordered & TGL_SBID_SET)) && (!dep.exec_all || (deps[i].unordered & TGL_SBID_SET))) continue; if (dep.ordered && deps[i].ordered) { for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) deps[i].jp.jp[p] = MAX2(deps[i].jp.jp[p], dep.jp.jp[p]); deps[i].ordered |= dep.ordered; deps[i].exec_all |= dep.exec_all; dep.ordered = TGL_REGDIST_NULL; } if (dep.unordered && deps[i].unordered && deps[i].id == dep.id) { deps[i].unordered |= dep.unordered; deps[i].exec_all |= dep.exec_all; dep.unordered = TGL_SBID_NULL; } } if (is_valid(dep)) deps.push_back(dep); } } tgl_swsb ordered_dependency_swsb(const dependency_list &deps, const ordered_address &jp, bool exec_all) { tgl_pipe p = TGL_PIPE_NONE; unsigned min_dist = ~0u; for (unsigned i = 0; i < deps.size(); i++) { if (deps[i].ordered && exec_all >= deps[i].exec_all) { for (unsigned q = 0; q < IDX(TGL_PIPE_ALL); q++) { const unsigned dist = jp.jp[q] - int64_t(deps[i].jp.jp[q]); const unsigned max_dist = (q == IDX(TGL_PIPE_LONG) ? 14 : 10); assert(jp.jp[q] > deps[i].jp.jp[q]); if (dist <= max_dist) { p = (p && IDX(p) != q ? TGL_PIPE_ALL : tgl_pipe(TGL_PIPE_FLOAT + q)); min_dist = MIN3(min_dist, dist, 7); } } } } return { p ? min_dist : 0, p }; } bool find_ordered_dependency(const dependency_list &deps, const ordered_address &jp, bool exec_all) { return ordered_dependency_swsb(deps, jp, exec_all).regdist; } tgl_sbid_mode find_unordered_dependency(const dependency_list &deps, tgl_sbid_mode unordered, bool exec_all) { if (unordered) { for (unsigned i = 0; i < deps.size(); i++) { if ((unordered & deps[i].unordered) && exec_all >= deps[i].exec_all) return deps[i].unordered; } } return TGL_SBID_NULL; } tgl_sbid_mode baked_unordered_dependency_mode(const struct intel_device_info *devinfo, const fs_inst *inst, const dependency_list &deps, const ordered_address &jp) { const bool exec_all = inst->force_writemask_all; const bool has_ordered = find_ordered_dependency(deps, jp, exec_all); const tgl_pipe ordered_pipe = ordered_dependency_swsb(deps, jp, exec_all).pipe; if (find_unordered_dependency(deps, TGL_SBID_SET, exec_all)) return find_unordered_dependency(deps, TGL_SBID_SET, exec_all); else if (has_ordered && is_unordered(inst)) return TGL_SBID_NULL; else if (find_unordered_dependency(deps, TGL_SBID_DST, exec_all) && (!has_ordered || ordered_pipe == inferred_sync_pipe(devinfo, inst))) return find_unordered_dependency(deps, TGL_SBID_DST, exec_all); else if (!has_ordered) return find_unordered_dependency(deps, TGL_SBID_SRC, exec_all); else return TGL_SBID_NULL; } bool baked_ordered_dependency_mode(const struct intel_device_info *devinfo, const fs_inst *inst, const dependency_list &deps, const ordered_address &jp) { const bool exec_all = inst->force_writemask_all; const bool has_ordered = find_ordered_dependency(deps, jp, exec_all); const tgl_pipe ordered_pipe = ordered_dependency_swsb(deps, jp, exec_all).pipe; const tgl_sbid_mode unordered_mode = baked_unordered_dependency_mode(devinfo, inst, deps, jp); if (!has_ordered) return false; else if (!unordered_mode) return true; else return ordered_pipe == inferred_sync_pipe(devinfo, inst) && unordered_mode == (is_unordered(inst) ? TGL_SBID_SET : TGL_SBID_DST); } void update_inst_scoreboard(const fs_visitor *shader, const ordered_address *jps, const fs_inst *inst, unsigned ip, scoreboard &sb) { const bool exec_all = inst->force_writemask_all; const struct intel_device_info *devinfo = shader->devinfo; const tgl_pipe p = inferred_exec_pipe(devinfo, inst); const ordered_address jp = p ? ordered_address(p, jps[ip].jp[IDX(p)]) : ordered_address(); const bool is_ordered = ordered_unit(devinfo, inst, IDX(TGL_PIPE_ALL)); for (unsigned i = 0; i < inst->sources; i++) { const dependency rd_dep = (inst->is_payload(i) || inst->is_math()) ? dependency(TGL_SBID_SRC, ip, exec_all) : is_ordered ? dependency(TGL_REGDIST_SRC, jp, exec_all) : dependency::done; for (unsigned j = 0; j < regs_read(inst, i); j++) { const fs_reg r = byte_offset(inst->src[i], REG_SIZE * j); sb.set(r, shadow(sb.get(r), rd_dep)); } } if (inst->reads_accumulator_implicitly()) sb.set(brw_acc_reg(8), dependency(TGL_REGDIST_SRC, jp, exec_all)); if (is_send(inst) && inst->base_mrf != -1) { const dependency rd_dep = dependency(TGL_SBID_SRC, ip, exec_all); for (unsigned j = 0; j < inst->mlen; j++) sb.set(brw_uvec_mrf(8, inst->base_mrf + j, 0), rd_dep); } const dependency wr_dep = is_unordered(inst) ? dependency(TGL_SBID_DST, ip, exec_all) : is_ordered ? dependency(TGL_REGDIST_DST, jp, exec_all) : dependency(); if (inst->writes_accumulator_implicitly(devinfo)) sb.set(brw_acc_reg(8), wr_dep); if (is_valid(wr_dep) && inst->dst.file != BAD_FILE && !inst->dst.is_null()) assign() argument
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/types/
H A Dcompare_test.cc79 EXPECT_TRUE(Identity(partial_ordering::unordered != 0)); in TEST()
80 EXPECT_TRUE(Identity(0 != partial_ordering::unordered)); in TEST()
81 EXPECT_FALSE(Identity(partial_ordering::unordered < 0)); in TEST()
82 EXPECT_FALSE(Identity(0 < partial_ordering::unordered)); in TEST()
83 EXPECT_FALSE(Identity(partial_ordering::unordered <= 0)); in TEST()
84 EXPECT_FALSE(Identity(0 <= partial_ordering::unordered)); in TEST()
85 EXPECT_FALSE(Identity(partial_ordering::unordered > 0)); in TEST()
86 EXPECT_FALSE(Identity(0 > partial_ordering::unordered)); in TEST()
87 EXPECT_FALSE(Identity(partial_ordering::unordered >= 0)); in TEST()
88 EXPECT_FALSE(Identity(0 >= partial_ordering::unordered)); in TEST()
[all...]
H A Dcompare.h81 enum class ncmp : value_type { unordered = -127 }; member in absl::compare_internal::ord::ncmp
134 ABSL_COMPARE_INLINE_BASECLASS_DECL(unordered);
264 compare_internal::value_type(compare_internal::ncmp::unordered);
271 ABSL_COMPARE_INLINE_SUBCLASS_DECL(partial_ordering, unordered);
344 ABSL_COMPARE_INLINE_INIT(partial_ordering, unordered,
345 compare_internal::ncmp::unordered);
/third_party/json/include/nlohmann/detail/
H A Dvalue_t.hpp56 object, ///< object (unordered set of name/value pairs)
100 return std::partial_ordering::unordered;
/third_party/rust/crates/cxx/gen/cmd/src/syntax/
H A Dset.rs5 pub use self::unordered::UnorderedSet;
72 mod unordered { modules
H A Dmap.rs7 pub use self::unordered::UnorderedMap;
83 mod unordered { modules
/third_party/rust/crates/cxx/gen/lib/src/syntax/
H A Dset.rs5 pub use self::unordered::UnorderedSet;
72 mod unordered { modules
H A Dmap.rs7 pub use self::unordered::UnorderedMap;
83 mod unordered { modules
/third_party/rust/crates/cxx/gen/build/src/syntax/
H A Dset.rs5 pub use self::unordered::UnorderedSet;
72 mod unordered { modules
H A Dmap.rs7 pub use self::unordered::UnorderedMap;
83 mod unordered { modules
/third_party/rust/crates/cxx/macro/src/syntax/
H A Dset.rs5 pub use self::unordered::UnorderedSet;
72 mod unordered { modules
H A Dmap.rs7 pub use self::unordered::UnorderedMap;
83 mod unordered { modules
/third_party/rust/crates/cxx/syntax/
H A Dset.rs5 pub use self::unordered::UnorderedSet;
72 mod unordered { modules
H A Dmap.rs7 pub use self::unordered::UnorderedMap;
83 mod unordered { modules
/third_party/mesa3d/src/amd/compiler/
H A Daco_ir.cpp606 aco_opcode unordered; member
618 info->unordered = aco_opcode::num_opcodes; in get_cmp_info()
628 info->unordered = aco_opcode::v_cmp_n##unord##_f##sz; \ in get_cmp_info()
717 return get_cmp_info(op, &info) ? info.unordered : aco_opcode::num_opcodes; in get_unordered()
/third_party/node/deps/v8/src/codegen/ppc/
H A Dassembler-ppc.h715 case unordered: in bc_short()
757 case unordered: in bclr()
801 case unordered: in isel()
855 b(unordered, L, cr, lk); in bunordered()
/third_party/selinux/libsepol/cil/src/
H A Dcil_resolve_ast.c1386 static int insert_unordered(struct cil_list *merged, struct cil_list *unordered) in insert_unordered() argument
1394 cil_list_for_each(curr, unordered) { in insert_unordered()
1400 * all unordered statements */ in insert_unordered()
1488 int unordered = CIL_FALSE; in cil_resolve_classorder() local
1494 unordered = CIL_TRUE; in cil_resolve_classorder()
1515 if (unordered) { in cil_resolve_classorder()
/third_party/json/tests/src/
H A Dunit-comparison.cpp42 if (order == std::partial_ordering::unordered) in convert()
44 return "std::partial_ordering::unordered"; in convert()
72 constexpr auto un = std::partial_ordering::unordered;
257 SECTION("compares unordered")
286 // check if two values compare unordered as expected
301 SECTION("compares unordered (inverse)")
330 // check that two values compare unordered as expected (with legacy-mode enabled)
380 // if two values compare unordered,
428 // if two values compare unordered,
453 // if two values compare unordered,
[all...]
/third_party/node/deps/v8/src/codegen/s390/
H A Dassembler-s390.h973 b(unordered, l, dist); in bunordered()
989 void bunordered(Register r) { b(unordered, r); } in bunordered()
/third_party/mesa3d/src/nouveau/codegen/lib/
H A Dgm107.asm132 // A number is NaN if its abs value is greater than or unordered with inf
H A Dgk110.asm117 // A number is NaN if its abs value is greater than or unordered with inf
H A Dgk104.asm575 // A number is NaN if its abs value is greater than or unordered with inf
/third_party/node/deps/v8/src/execution/s390/
H A Dsimulator-s390.h315 // comparisons and the values are unordered in SetS390ConditionCode()
317 if (condition_reg_ == 0) condition_reg_ = unordered; in SetS390ConditionCode()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/AsmParser/
H A DLLLexer.cpp549 KEYWORD(unordered); in LexIdentifier()
/third_party/mesa3d/src/amd/addrlib/inc/
H A Daddrinterface.h2405 UINT_32 unordered : 1; ///< This resource can be used with UAV member

Completed in 33 milliseconds

12