| /third_party/skia/third_party/externals/freetype/src/sfnt/ |
| H A D | ttkern.c | 51 FT_UInt32 avail = 0, ordered = 0; in FT_LOCAL_DEF() local
|
| /kernel/linux/linux-5.10/fs/xfs/libxfs/ |
| H A D | xfs_defer.c | 246 unsigned int ordered = 0; /* bitmap */ in xfs_defer_trans_roll() local
|
| /third_party/mesa3d/src/nouveau/codegen/ |
| H A D | nv50_ir_bb.cpp | 453 Pass::run(Program *prog, bool ordered, bool skipPhi) in run() argument
461 Pass::doRun(Program *prog, bool ordered, bool skipPhi) in doRun() argument
473 Pass::run(Function *func, bool ordered, bool skipPhi) in run() argument
481 Pass::doRun(Function *func, bool ordered, bool skipPhi) in doRun() argument
|
| /base/notification/common_event_service/frameworks/native/test/unittest/ |
| H A D | common_event_subscribe_test.cpp | 88 virtual void NotifyEvent(const CommonEventData &commonEventData, const bool &ordered, const bool &sticky) in NotifyEvent() argument
|
| /base/notification/common_event_service/services/test/unittest/ |
| H A D | common_event_subscribe_unit_test.cpp | 600 virtual void NotifyEvent(const CommonEventData &commonEventData, const bool &ordered, const bool &sticky) in NotifyEvent() argument
|
| /kernel/linux/linux-5.10/tools/lib/subcmd/ |
| H A D | parse-options.c | 811 struct option *ordered; in options__order() local
862 struct option *ordered; in usage_with_options_internal() local
[all...] |
| /kernel/linux/linux-5.10/fs/xfs/ |
| H A D | xfs_log_cil.c | 135 bool ordered = false; in xlog_cil_alloc_shadow_bufs() local
317 bool ordered = false; in xlog_cil_insert_format_items() local
[all...] |
| H A D | xfs_buf_item.c | 584 bool ordered = bip->bli_flags & XFS_BLI_ORDERED; in xfs_buf_item_release() local
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | subpage.c | 579 IMPLEMENT_BTRFS_SUBPAGE_TEST_OP(ordered); variable
|
| H A D | bio.c | 115 struct btrfs_ordered_extent *ordered = bbio->ordered; in __btrfs_bio_end_io() local
[all...] |
| H A D | ordered-data.c | 307 static bool can_finish_ordered_extent(struct btrfs_ordered_extent *ordered, in can_finish_ordered_extent() argument
361 btrfs_queue_ordered_fn(struct btrfs_ordered_extent *ordered) btrfs_queue_ordered_fn() argument
372 btrfs_finish_ordered_extent(struct btrfs_ordered_extent *ordered, struct page *page, u64 file_offset, u64 len, bool uptodate) btrfs_finish_ordered_extent() argument
675 struct btrfs_ordered_extent *ordered; btrfs_run_ordered_extent_work() local
693 struct btrfs_ordered_extent *ordered, *next; btrfs_wait_ordered_extents() local
818 struct btrfs_ordered_extent *ordered; btrfs_wait_ordered_range() local
960 struct btrfs_ordered_extent *ordered; btrfs_get_ordered_extents_for_logging() local
1096 struct btrfs_ordered_extent *ordered; btrfs_lock_and_flush_ordered_range() local
1133 struct btrfs_ordered_extent *ordered; btrfs_try_lock_ordered_range() local
1149 btrfs_split_ordered_extent( struct btrfs_ordered_extent *ordered, u64 len) btrfs_split_ordered_extent() argument
[all...] |
| H A D | defrag.c | 758 struct btrfs_ordered_extent *ordered; in defrag_prepare_one_page() local
[all...] |
| H A D | space-info.c | 841 u64 ordered, delalloc; in need_preemptive_reclaim() local
1561 u64 ordered = percpu_counter_sum_positive(&fs_info->ordered_bytes); maybe_clamp_preempt() local
[all...] |
| H A D | file-item.c | 734 struct btrfs_ordered_extent *ordered = bbio->ordered; in btrfs_csum_one_bio() local
|
| /kernel/linux/linux-6.6/fs/xfs/ |
| H A D | xfs_buf_item.c | 708 bool ordered = bip->bli_flags & XFS_BLI_ORDERED; in xfs_buf_item_release() local
|
| H A D | xfs_log_cil.c | 285 bool ordered = false; in xlog_cil_alloc_shadow_bufs() local
466 bool ordered = false; in xlog_cil_insert_format_items() local
[all...] |
| /third_party/mesa3d/src/amd/compiler/ |
| H A D | aco_ir.cpp | 605 aco_opcode ordered; member
|
| /third_party/mesa3d/src/intel/compiler/ |
| H A D | brw_fs_scoreboard.cpp | 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/src/pathops/ |
| H A D | SkOpSpan.cpp | 407 bool SkOpSpan::insertCoincidence(const SkOpSegment* segment, bool flipped, bool ordered) { in insertCoincidence() argument
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | file-item.c | 531 struct btrfs_ordered_extent *ordered = NULL; in btrfs_csum_one_bio() local
[all...] |
| H A D | ordered-data.c | 543 struct btrfs_ordered_extent *ordered; btrfs_run_ordered_extent_work() local
561 struct btrfs_ordered_extent *ordered, *next; btrfs_wait_ordered_extents() local
682 struct btrfs_ordered_extent *ordered; btrfs_wait_ordered_range() local
819 struct btrfs_ordered_extent *ordered; btrfs_get_ordered_extents_for_logging() local
867 struct btrfs_ordered_extent *ordered; btrfs_find_ordered_sum() local
919 struct btrfs_ordered_extent *ordered; btrfs_lock_and_flush_ordered_range() local
[all...] |
| H A D | file.c | 1421 struct btrfs_ordered_extent *ordered; in lock_and_cleanup_extent_if_need() local
1491 struct btrfs_ordered_extent *ordered; check_can_nocow() local
2481 struct btrfs_ordered_extent *ordered; btrfs_punch_hole_lock_range() local
3375 struct btrfs_ordered_extent *ordered; btrfs_fallocate() local
[all...] |
| /kernel/linux/linux-6.6/tools/lib/subcmd/ |
| H A D | parse-options.c | 811 struct option *opt, *ordered, *group; in options__order() local
873 struct option *ordered; in usage_with_options_internal() local
[all...] |
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | workqueue.h | 203 bool ordered; member
|
| /third_party/vk-gl-cts/external/vulkancts/modules/vulkan/spirv_assembly/ |
| H A D | vktSpvAsm64bitCompareTests.cpp | 84 DoubleCompareOperation(bool ordered, const BasicImplementation& impl) in DoubleCompareOperation() argument
|