Searched refs:ptrs (Results 1 - 25 of 103) sorted by last modified time

12345

/linux-master/net/core/
H A Dfilter.c4904 cgrp = READ_ONCE(array->ptrs[idx]);
/linux-master/kernel/bpf/
H A Dcore.c2022 prog = READ_ONCE(array->ptrs[index]);
/linux-master/arch/x86/net/
H A Dbpf_jit_comp.c600 * prog = array->ptrs[index];
644 /* prog = array->ptrs[index]; */
646 offsetof(struct bpf_array, ptrs));
758 target = array->ptrs[poke->tail_call.key];
/linux-master/arch/riscv/net/
H A Dbpf_jit_comp64.c373 /* prog = array->ptrs[index];
379 off = offsetof(struct bpf_array, ptrs);
/linux-master/arch/arm64/net/
H A Dbpf_jit_comp.c452 /* prog = array->ptrs[index];
456 off = offsetof(struct bpf_array, ptrs);
/linux-master/arch/arm/net/
H A Dbpf_jit_32.c1442 /* prog = array->ptrs[index]
1446 BUILD_BUG_ON(imm8m(offsetof(struct bpf_array, ptrs)) < 0);
1447 off = imm8m(offsetof(struct bpf_array, ptrs));
/linux-master/fs/bcachefs/
H A Dbuckets.c966 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
980 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
H A Dbtree_node_scan.c37 bch2_extent_ptr_to_text(out, c, n->ptrs + i);
63 memcpy(bp->v.start, f->ptrs, sizeof(struct bch_extent_ptr) * f->nr_ptrs);
161 .ptrs[0].type = 1 << BCH_EXTENT_ENTRY_ptr,
162 .ptrs[0].offset = offset,
163 .ptrs[0].dev = ca->dev_idx,
164 .ptrs[0].gen = *bucket_gen(ca, sector_to_bucket(ca, offset)),
363 if (prev->nr_ptrs == ARRAY_SIZE(prev->ptrs)) {
368 prev->ptrs[prev->nr_ptrs++] = i->ptrs[0];
H A Dbtree_node_scan_types.h20 struct bch_extent_ptr ptrs[BCH_REPLICAS_MAX]; member in struct:found_btree_node
H A Djournal_io.c23 darray_for_each(j->ptrs, i) {
29 if (i != j->ptrs.data)
175 darray_for_each(dup->ptrs, ptr)
179 ret = darray_push(&dup->ptrs, entry_ptr);
205 darray_init(&i->ptrs);
213 darray_for_each(dup->ptrs, ptr)
214 darray_push(&i->ptrs, *ptr);
217 darray_push(&i->ptrs, entry_ptr);
1158 darray_for_each(r->ptrs, i)
1392 darray_for_each(i->ptrs, pt
[all...]
H A Dfs.c907 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
915 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
H A Dbtree_update_interior.c349 open_bucket_for_each(c, &wp->ptrs, ob, i)
H A Dbtree_io.c128 struct bkey_packed **ptrs, unsigned nr)
140 swap(ptrs[0], ptrs[n]);
146 ptrs[c],
147 ptrs[d]) >= 0 ? c : d;
153 ptrs[a],
154 ptrs[b]) >= 0)
159 swap(ptrs[b], ptrs[c]);
166 struct bkey_packed *new_whiteouts, **ptrs, **ptrs_en local
127 sort_bkey_ptrs(const struct btree *bt, struct bkey_packed **ptrs, unsigned nr) argument
1579 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
[all...]
H A Dbtree_gc.c737 struct bkey_ptrs ptrs = bch2_bkey_ptrs(bkey_i_to_s(new)); local
738 bkey_for_each_ptr(ptrs, ptr) {
745 struct bkey_ptrs ptrs; local
748 ptrs = bch2_bkey_ptrs(bkey_i_to_s(new));
749 bkey_for_each_ptr_decode(bkey_i_to_s(new).k, ptrs, p, entry) {
766 ptrs = bch2_bkey_ptrs(bkey_i_to_s(new));
767 bkey_extent_entry_for_each(ptrs, entry) {
773 bkey_extent_entry_for_each_from(ptrs, next_ptr, entry)
784 !__bch2_ptr_matches_stripe(&m->ptrs[entry->stripe_ptr.block],
1851 struct bkey_ptrs_c ptrs local
[all...]
H A Dbackpointers.c22 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
26 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
441 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(extent); local
453 bkey_for_each_ptr_decode(extent.k, ptrs, p, entry)
657 struct bkey_ptrs_c ptrs; local
662 ptrs = bch2_bkey_ptrs_c(k);
663 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
H A Dsysfs.c282 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
287 bkey_for_each_crc(k.k, ptrs, crc, entry) {
H A Dec.c150 const struct bch_extent_ptr *ptr = sp->ptrs + i;
171 const struct bch_extent_ptr *ptr = &s.v->ptrs[idx];
255 const struct bch_extent_ptr *ptr = s->ptrs + ptr_idx;
322 !memcmp(old_s->ptrs, new_s->ptrs,
353 !memcmp(&new_s->ptrs[i],
354 &old_s->ptrs[i],
355 sizeof(new_s->ptrs[i])))
432 m->ptrs[i] = new_s->ptrs[
468 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
[all...]
H A Dextents.c108 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
118 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
453 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
460 bkey_for_each_crc(k.k, ptrs, crc, i)
478 struct bkey_ptrs ptrs = bch2_bkey_ptrs(bkey_i_to_s(k)); local
486 bkey_for_each_crc(&k->k, ptrs, u, i)
501 ptrs = bch2_bkey_ptrs(bkey_i_to_s(k));
503 bkey_for_each_ptr_decode(&k->k, ptrs, p, i)
553 struct bkey_ptrs ptrs = bch2_bkey_ptrs(bkey_i_to_s(k)); local
554 union bch_extent_crc *crc = (void *) ptrs
600 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
613 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
627 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
639 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
687 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
700 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
724 struct bkey_ptrs ptrs = bch2_bkey_ptrs(bkey_i_to_s(k)); local
752 extent_entry_prev(struct bkey_ptrs ptrs, union bch_extent_entry *entry) argument
771 struct bkey_ptrs ptrs = bch2_bkey_ptrs(k); local
851 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
862 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
876 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
941 struct bkey_ptrs ptrs = bch2_bkey_ptrs(k); local
1011 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
1078 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
1123 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
1246 struct bkey_ptrs ptrs = bch2_bkey_ptrs(k); local
1284 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
1297 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
1428 struct bkey_ptrs ptrs = bch2_bkey_ptrs(k); local
[all...]
H A Dec.h116 return __bch2_ptr_matches_stripe(&s->ptrs[p.ec.block], &p.ptr,
130 return __bch2_ptr_matches_stripe(&m->ptrs[p.ec.block], &p.ptr,
H A Dbackpointers.h105 BUG_ON(ptr < s.v->ptrs ||
106 ptr >= s.v->ptrs + s.v->nr_blocks);
108 return ptr >= s.v->ptrs + s.v->nr_blocks - s.v->nr_redundant
H A Ddebug.c126 struct bkey_ptrs_c ptrs; local
166 ptrs = bch2_bkey_ptrs_c(bkey_i_to_s_c(&b->key));
167 bkey_for_each_ptr_decode(&b->key.k, ptrs, p, entry)
H A Ddata_update.c62 prt_printf(&buf, "\nrewrite ptrs: %u%u%u%u",
356 struct bkey_ptrs_c ptrs = local
359 bkey_for_each_ptr(ptrs, ptr) {
506 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
542 bkey_for_each_ptr(ptrs, ptr)
548 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
651 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
669 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); local
672 bkey_for_each_ptr(ptrs, ptr) {
/linux-master/drivers/gpu/drm/nouveau/nvkm/subdev/instmem/
H A Dnv50.c211 iobj->base.memory.ptrs = NULL;
253 iobj->base.memory.ptrs = &nv50_instobj_fast;
255 iobj->base.memory.ptrs = &nv50_instobj_slow;
256 /* barrier to ensure the ptrs are written before refcount is set */
/linux-master/net/xdp/
H A Dxsk.c1446 ring->producer = offsetof(struct xdp_rxtx_ring, ptrs.producer);
1447 ring->consumer = offsetof(struct xdp_rxtx_ring, ptrs.consumer);
1453 ring->producer = offsetof(struct xdp_umem_ring, ptrs.producer);
1454 ring->consumer = offsetof(struct xdp_umem_ring, ptrs.consumer);
1541 ptrs.flags);
1543 ptrs.flags);
1545 ptrs.flags);
1547 ptrs.flags);
/linux-master/kernel/trace/
H A Dbpf_trace.c564 ee = READ_ONCE(array->ptrs[index]);
636 ee = READ_ONCE(array->ptrs[index]);
809 cgrp = READ_ONCE(array->ptrs[idx]);

Completed in 661 milliseconds

12345