| @@ -641,6 +641,12 @@ enum cmask_op2 { · 640 unmodified lines |
| 641 | 641 | /* predicates - short-circuit when the per-word result is true */ |
| 642 | 642 | CMASK_OP2_SUBSET, |
| 643 | 643 | CMASK_OP2_INTERSECTS, |
| 644 | + /* |
| 645 | + * @a is a BPF-arena cmask. Words on @a use READ_ONCE/WRITE_ONCE since |
| 646 | + * BPF may read/write concurrently. See scx_cmask_ref_or() / _copy(). |
| 647 | + */ |
| 648 | + CMASK_OP2_REF_OR, |
| 649 | + CMASK_OP2_REF_COPY, |
| 644 | 650 | }; |
| 645 | 651 | |
| 646 | 652 | static __always_inline bool cmask_op2_is_pred(const enum cmask_op2 op) |
| @@ -669,6 +675,12 @@ static __always_inline bool cmask_word_op2(u64 *av, const u64 *bp, u64 mask, · 22 unmodified lines |
| 669 | 675 | return (READ_ONCE(*bp) & ~READ_ONCE(*av)) & mask; |
| 670 | 676 | case CMASK_OP2_INTERSECTS: |
| 671 | 677 | return (READ_ONCE(*av) & READ_ONCE(*bp)) & mask; |
| 678 | + case CMASK_OP2_REF_OR: |
| 679 | + WRITE_ONCE(*av, READ_ONCE(*av) | (READ_ONCE(*bp) & mask)); |
| 680 | + return false; |
| 681 | + case CMASK_OP2_REF_COPY: |
| 682 | + WRITE_ONCE(*av, (READ_ONCE(*av) & ~mask) | (READ_ONCE(*bp) & mask)); |
| 683 | + return false; |
| 672 | 684 | } |
| 673 | 685 | unreachable(); |
| 674 | 686 | } |
| @@ -899,6 +911,127 @@ static const struct btf_kfunc_id_set scx_kfunc_set_cid = { · 224 unmodified lines |
| 899 | 911 | .set = &scx_kfunc_ids_cid, |
| 900 | 912 | }; |
| 901 | 913 | |
| 914 | +/** |
| 915 | + * scx_cmask_ref_init - Bind a scx_cmask_ref to a BPF-arena cmask |
| 916 | + * @sch: scheduler whose arena hosts @src |
| 917 | + * @src: BPF-supplied cmask pointer |
| 918 | + * @ref: output ref |
| 919 | + * |
| 920 | + * Snapshot @src's @base, @nr_cids and @alloc_words. The snapshot is necessary |
| 921 | + * because BPF may mutate the live header asynchronously. |
| 922 | + * |
| 923 | + * Return 0 on success, -EINVAL if the range is out of bounds or @alloc_words |
| 924 | + * doesn't cover it. |
| 925 | + */ |
| 926 | +int scx_cmask_ref_init(struct scx_sched *sch, const struct scx_cmask *src, |
| 927 | + struct scx_cmask_ref *ref) |
| 928 | +{ |
| 929 | + struct scx_cmask *kern_src = scx_arena_to_kaddr(sch, src); |
| 930 | + u32 base, nr_cids, alloc_words, npossible = num_possible_cpus(); |
| 931 | + |
| 932 | + base = READ_ONCE(kern_src->base); |
| 933 | + nr_cids = READ_ONCE(kern_src->nr_cids); |
| 934 | + alloc_words = READ_ONCE(kern_src->alloc_words); |
| 935 | + |
| 936 | + if (unlikely(base >= npossible || nr_cids > npossible - base || |
| 937 | + SCX_CMASK_NR_WORDS(nr_cids) > alloc_words)) |
| 938 | + return -EINVAL; |
| 939 | + |
| 940 | + ref->sch = sch; |
| 941 | + ref->src = kern_src; |
| 942 | + ref->base = base; |
| 943 | + ref->nr_cids = nr_cids; |
| 944 | + |
| 945 | + ref->shard_first = scx_cid_to_shard[base]; |
| 946 | + if (likely(nr_cids)) |
| 947 | + ref->shard_end = scx_cid_to_shard[base + nr_cids - 1] + 1; |
| 948 | + else |
| 949 | + ref->shard_end = ref->shard_first; |
| 950 | + |
| 951 | + return 0; |
| 952 | +} |
| 953 | + |
| 954 | +/** |
| 955 | + * scx_cmask_ref_shard - Read one shard from @ref into @out |
| 956 | + * @ref: validated ref |
| 957 | + * @shard_idx: target shard, in [@ref->shard_first, @ref->shard_end) |
| 958 | + * @out: output cmask whose @out->alloc_words must hold the shard |
| 959 | + * |
| 960 | + * Set @out to the intersection of @ref's range with @shard_idx's cid range, |
| 961 | + * with bits[] read from @ref->src via READ_ONCE. Empty intersection sets |
| 962 | + * @out->nr_cids to 0. scx_error()s on @ref's sched if @out can't hold the |
| 963 | + * shard. |
| 964 | + */ |
| 965 | +void scx_cmask_ref_shard(const struct scx_cmask_ref *ref, s32 shard_idx, |
| 966 | + struct scx_cmask *out) |
| 967 | +{ |
| 968 | + const struct scx_cid_shard *shard = &scx_cid_shard_ranges[shard_idx]; |
| 969 | + u32 shard_base = shard->base_cid; |
| 970 | + u32 shard_end = shard_base + shard->nr_cids; |
| 971 | + u32 isect_base, isect_end, nr_words, src_off, wi; |
| 972 | + u64 head_mask, tail_mask; |
| 973 | + |
| 974 | + isect_base = max(ref->base, shard_base); |
| 975 | + isect_end = min(ref->base + ref->nr_cids, shard_end); |
| 976 | + |
| 977 | + if (isect_base >= isect_end) { |
| 978 | + out->base = shard_base; |
| 979 | + out->nr_cids = 0; |
| 980 | + return; |
| 981 | + } |
| 982 | + |
| 983 | + nr_words = ((isect_end - 1) / 64) - (isect_base / 64) + 1; |
| 984 | + if (nr_words > out->alloc_words) { |
| 985 | + scx_error(ref->sch, "scx_cmask_ref_shard: out alloc_words=%u < %u for shard %d", |
| 986 | + out->alloc_words, nr_words, shard_idx); |
| 987 | + out->base = shard_base; |
| 988 | + out->nr_cids = 0; |
| 989 | + return; |
| 990 | + } |
| 991 | + |
| 992 | + out->base = isect_base; |
| 993 | + out->nr_cids = isect_end - isect_base; |
| 994 | + src_off = (isect_base / 64) - (ref->base / 64); |
| 995 | + |
| 996 | + for (wi = 0; wi < nr_words; wi++) |
| 997 | + out->bits[wi] = READ_ONCE(ref->src->bits[src_off + wi]); |
| 998 | + |
| 999 | + head_mask = GENMASK_U64(63, isect_base & 63); |
| 1000 | + out->bits[0] &= head_mask; |
| 1001 | + tail_mask = GENMASK_U64((isect_end - 1) & 63, 0); |
| 1002 | + out->bits[nr_words - 1] &= tail_mask; |
| 1003 | +} |
| 1004 | + |
| 1005 | +/** |
| 1006 | + * scx_cmask_ref_or - OR @src into the arena cmask referenced by @ref |
| 1007 | + * @ref: validated ref |
| 1008 | + * @src: stable kernel cmask |
| 1009 | + * |
| 1010 | + * Bits inside the intersection of @ref's snapshotted range with @src's range |
| 1011 | + * are OR'd into @ref->src and bits outside are left unchanged. Stores on |
| 1012 | + * @ref->src use WRITE_ONCE since BPF may read/write concurrently. |
| 1013 | + */ |
| 1014 | +void scx_cmask_ref_or(const struct scx_cmask_ref *ref, const struct scx_cmask *src) |
| 1015 | +{ |
| 1016 | + cmask_walk_op2(ref->src->bits, ref->base, ref->nr_cids, |
| 1017 | + src->bits, src->base, src->nr_cids, CMASK_OP2_REF_OR); |
| 1018 | +} |
| 1019 | + |
| 1020 | +/** |
| 1021 | + * scx_cmask_ref_copy - Copy @src into the arena cmask referenced by @ref |
| 1022 | + * @ref: validated ref |
| 1023 | + * @src: stable kernel cmask |
| 1024 | + * |
| 1025 | + * Bits inside the intersection of @ref's snapshotted range with @src's range |
| 1026 | + * take @src's values and bits outside are left unchanged. Stores on @ref->src |
| 1027 | + * use WRITE_ONCE since BPF may read/write concurrently. |
| 1028 | + */ |
| 1029 | +void scx_cmask_ref_copy(const struct scx_cmask_ref *ref, const struct scx_cmask *src) |
| 1030 | +{ |
| 1031 | + cmask_walk_op2(ref->src->bits, ref->base, ref->nr_cids, |
| 1032 | + src->bits, src->base, src->nr_cids, CMASK_OP2_REF_COPY); |
| 1033 | +} |
| 1034 | + |
| 902 | 1035 | int scx_cid_kfunc_init(void) |
| 903 | 1036 | { |
| 904 | 1037 | return register_btf_kfunc_id_set(BPF_PROG_TYPE_STRUCT_OPS, &scx_kfunc_set_init_cids) ?: |