Home
last modified time | relevance | path

Searched refs:cur (Results 1 – 25 of 566) sorted by relevance

12345678910>>...23

/linux/fs/xfs/scrub/
H A Dbtree.c28 struct xfs_btree_cur *cur, in __xchk_btree_process_error() argument
52 if (cur->bc_ops->type == XFS_BTREE_TYPE_INODE) in __xchk_btree_process_error()
53 trace_xchk_ifork_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
56 trace_xchk_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
66 struct xfs_btree_cur *cur, in xchk_btree_process_error() argument
70 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_process_error()
77 struct xfs_btree_cur *cur, in xchk_btree_xref_process_error() argument
81 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_xref_process_error()
89 struct xfs_btree_cur *cur, in __xchk_btree_set_corrupt() argument
96 if (cur->bc_ops->type == XFS_BTREE_TYPE_INODE) in __xchk_btree_set_corrupt()
[all …]
H A Drcbag.c78 struct xfs_btree_cur *cur; in rcbag_add() local
82 cur = rcbagbt_mem_cursor(mp, tp, &bag->xfbtree); in rcbag_add()
83 error = rcbagbt_lookup_eq(cur, rmap, &has); in rcbag_add()
88 error = rcbagbt_get_rec(cur, &bagrec, &has); in rcbag_add()
97 error = rcbagbt_update(cur, &bagrec); in rcbag_add()
105 error = rcbagbt_insert(cur, &bagrec, &has); in rcbag_add()
114 xfs_btree_del_cursor(cur, 0); in rcbag_add()
124 xfs_btree_del_cursor(cur, error); in rcbag_add()
156 struct xfs_btree_cur *cur; in rcbag_next_edge() local
164 cur = rcbagbt_mem_cursor(mp, tp, &bag->xfbtree); in rcbag_next_edge()
[all …]
H A Drmap.c150 struct xfs_btree_cur *cur = bs->cur; in xchk_rmapbt_check_unwritten_in_keyflags() local
159 for (level = 1; level < cur->bc_nlevels; level++) { in xchk_rmapbt_check_unwritten_in_keyflags()
164 if (cur->bc_levels[level].ptr > 1) in xchk_rmapbt_check_unwritten_in_keyflags()
167 keyblock = xfs_btree_get_block(cur, level, &bp); in xchk_rmapbt_check_unwritten_in_keyflags()
169 lkey = xfs_btree_key_addr(cur, ptr, keyblock); in xchk_rmapbt_check_unwritten_in_keyflags()
172 xchk_btree_set_preen(sc, cur, level); in xchk_rmapbt_check_unwritten_in_keyflags()
176 hkey = xfs_btree_high_key_addr(cur, ptr, keyblock); in xchk_rmapbt_check_unwritten_in_keyflags()
178 xchk_btree_set_preen(sc, cur, level); in xchk_rmapbt_check_unwritten_in_keyflags()
224 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_rmapbt_check_overlapping()
275 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_rmapbt_check_mergeable()
[all …]
/linux/fs/xfs/libxfs/
H A Dxfs_btree_staging.c60 struct xfs_btree_cur *cur, in xfs_btree_stage_afakeroot() argument
63 ASSERT(!(cur->bc_flags & XFS_BTREE_STAGING)); in xfs_btree_stage_afakeroot()
64 ASSERT(cur->bc_ops->type != XFS_BTREE_TYPE_INODE); in xfs_btree_stage_afakeroot()
65 ASSERT(cur->bc_tp == NULL); in xfs_btree_stage_afakeroot()
67 cur->bc_ag.afake = afake; in xfs_btree_stage_afakeroot()
68 cur->bc_nlevels = afake->af_levels; in xfs_btree_stage_afakeroot()
69 cur->bc_flags |= XFS_BTREE_STAGING; in xfs_btree_stage_afakeroot()
80 struct xfs_btree_cur *cur, in xfs_btree_commit_afakeroot() argument
84 ASSERT(cur->bc_flags & XFS_BTREE_STAGING); in xfs_btree_commit_afakeroot()
85 ASSERT(cur->bc_tp == NULL); in xfs_btree_commit_afakeroot()
[all …]
H A Dxfs_refcount.c53 struct xfs_btree_cur *cur, in xfs_refcount_lookup_le() argument
58 trace_xfs_refcount_lookup(cur, in xfs_refcount_lookup_le()
61 cur->bc_rec.rc.rc_startblock = bno; in xfs_refcount_lookup_le()
62 cur->bc_rec.rc.rc_blockcount = 0; in xfs_refcount_lookup_le()
63 cur->bc_rec.rc.rc_domain = domain; in xfs_refcount_lookup_le()
64 return xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat); in xfs_refcount_lookup_le()
73 struct xfs_btree_cur *cur, in xfs_refcount_lookup_ge() argument
78 trace_xfs_refcount_lookup(cur, in xfs_refcount_lookup_ge()
81 cur->bc_rec.rc.rc_startblock = bno; in xfs_refcount_lookup_ge()
82 cur->bc_rec.rc.rc_blockcount = 0; in xfs_refcount_lookup_ge()
[all …]
H A Dxfs_btree.h81 #define XFS_BTREE_STATS_INC(cur, stat) \ argument
82 XFS_STATS_INC_OFF((cur)->bc_mp, \
83 (cur)->bc_ops->statoff + __XBTS_ ## stat)
84 #define XFS_BTREE_STATS_ADD(cur, stat, val) \ argument
85 XFS_STATS_ADD_OFF((cur)->bc_mp, \
86 (cur)->bc_ops->statoff + __XBTS_ ## stat, val)
147 void (*set_root)(struct xfs_btree_cur *cur,
151 int (*alloc_block)(struct xfs_btree_cur *cur,
155 int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp);
158 int (*get_minrecs)(struct xfs_btree_cur *cur, int level);
[all …]
H A Dxfs_btree_mem.c26 struct xfs_btree_cur *cur, in xfbtree_set_root() argument
30 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); in xfbtree_set_root()
32 cur->bc_mem.xfbtree->root = *ptr; in xfbtree_set_root()
33 cur->bc_mem.xfbtree->nlevels += inc; in xfbtree_set_root()
39 struct xfs_btree_cur *cur, in xfbtree_init_ptr_from_cur() argument
42 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); in xfbtree_init_ptr_from_cur()
44 *ptr = cur->bc_mem.xfbtree->root; in xfbtree_init_ptr_from_cur()
50 struct xfs_btree_cur *cur) in xfbtree_dup_cursor() argument
54 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); in xfbtree_dup_cursor()
56 ncur = xfs_btree_alloc_cursor(cur->bc_mp, cur->bc_tp, cur->bc_ops, in xfbtree_dup_cursor()
[all …]
H A Dxfs_rtrefcount_btree.c46 struct xfs_btree_cur *cur) in xfs_rtrefcountbt_dup_cursor() argument
48 return xfs_rtrefcountbt_init_cursor(cur->bc_tp, to_rtg(cur->bc_group)); in xfs_rtrefcountbt_dup_cursor()
53 struct xfs_btree_cur *cur, in xfs_rtrefcountbt_get_minrecs() argument
56 if (level == cur->bc_nlevels - 1) { in xfs_rtrefcountbt_get_minrecs()
57 struct xfs_ifork *ifp = xfs_btree_ifork_ptr(cur); in xfs_rtrefcountbt_get_minrecs()
59 return xfs_rtrefcountbt_maxrecs(cur->bc_mp, ifp->if_broot_bytes, in xfs_rtrefcountbt_get_minrecs()
63 return cur->bc_mp->m_rtrefc_mnr[level != 0]; in xfs_rtrefcountbt_get_minrecs()
68 struct xfs_btree_cur *cur, in xfs_rtrefcountbt_get_maxrecs() argument
71 if (level == cur->bc_nlevels - 1) { in xfs_rtrefcountbt_get_maxrecs()
72 struct xfs_ifork *ifp = xfs_btree_ifork_ptr(cur); in xfs_rtrefcountbt_get_maxrecs()
[all …]
H A Dxfs_rtrmap_btree.c48 struct xfs_btree_cur *cur) in xfs_rtrmapbt_dup_cursor() argument
50 return xfs_rtrmapbt_init_cursor(cur->bc_tp, to_rtg(cur->bc_group)); in xfs_rtrmapbt_dup_cursor()
55 struct xfs_btree_cur *cur, in xfs_rtrmapbt_get_minrecs() argument
58 if (level == cur->bc_nlevels - 1) { in xfs_rtrmapbt_get_minrecs()
59 struct xfs_ifork *ifp = xfs_btree_ifork_ptr(cur); in xfs_rtrmapbt_get_minrecs()
61 return xfs_rtrmapbt_maxrecs(cur->bc_mp, ifp->if_broot_bytes, in xfs_rtrmapbt_get_minrecs()
65 return cur->bc_mp->m_rtrmap_mnr[level != 0]; in xfs_rtrmapbt_get_minrecs()
70 struct xfs_btree_cur *cur, in xfs_rtrmapbt_get_maxrecs() argument
73 if (level == cur->bc_nlevels - 1) { in xfs_rtrmapbt_get_maxrecs()
74 struct xfs_ifork *ifp = xfs_btree_ifork_ptr(cur); in xfs_rtrmapbt_get_maxrecs()
[all …]
/linux/drivers/char/
H A Dbsr.c157 struct bsr_dev *cur, *n; in bsr_cleanup_devs() local
159 list_for_each_entry_safe(cur, n, &bsr_devs, bsr_list) { in bsr_cleanup_devs()
160 if (cur->bsr_device) { in bsr_cleanup_devs()
161 cdev_del(&cur->bsr_cdev); in bsr_cleanup_devs()
162 device_del(cur->bsr_device); in bsr_cleanup_devs()
164 list_del(&cur->bsr_list); in bsr_cleanup_devs()
165 kfree(cur); in bsr_cleanup_devs()
189 struct bsr_dev *cur = kzalloc_obj(struct bsr_dev); in bsr_add_node() local
193 if (!cur) { in bsr_add_node()
202 kfree(cur); in bsr_add_node()
[all …]
/linux/kernel/printk/
H A Dnbcon.c151 * @cur: Old/expected state
154 * Return: True on success. False on fail and @cur is updated.
156 static inline bool nbcon_state_try_cmpxchg(struct console *con, struct nbcon_state *cur, in nbcon_state_try_cmpxchg() argument
159 return atomic_try_cmpxchg(&ACCESS_PRIVATE(con, nbcon_state), &cur->atom, new->atom); in nbcon_state_try_cmpxchg()
223 * @cur: The current console state
229 * Return: 0 on success. Otherwise, an error code on failure. Also @cur
244 struct nbcon_state *cur, bool is_reacquire) in nbcon_context_try_acquire_direct() argument
266 (!is_reacquire || cur->unsafe_takeover)) { in nbcon_context_try_acquire_direct()
270 if (ctxt->prio <= cur->prio || ctxt->prio <= cur in nbcon_context_try_acquire_direct()
293 nbcon_waiter_matches(struct nbcon_state * cur,int expected_prio) nbcon_waiter_matches() argument
352 nbcon_context_try_acquire_requested(struct nbcon_context * ctxt,struct nbcon_state * cur) nbcon_context_try_acquire_requested() argument
435 nbcon_context_try_acquire_handover(struct nbcon_context * ctxt,struct nbcon_state * cur) nbcon_context_try_acquire_handover() argument
551 nbcon_context_try_acquire_hostile(struct nbcon_context * ctxt,struct nbcon_state * cur) nbcon_context_try_acquire_hostile() argument
601 struct nbcon_state cur; nbcon_context_try_acquire() local
635 nbcon_owner_matches(struct nbcon_state * cur,int expected_cpu,int expected_prio) nbcon_owner_matches() argument
681 struct nbcon_state cur; nbcon_context_release() local
730 nbcon_context_can_proceed(struct nbcon_context * ctxt,struct nbcon_state * cur) nbcon_context_can_proceed() argument
802 struct nbcon_state cur; nbcon_can_proceed() local
835 struct nbcon_state cur; __nbcon_context_update_unsafe() local
865 struct nbcon_state cur; nbcon_write_context_set_buf() local
989 struct nbcon_state cur; nbcon_emit_next_record() local
[all...]
/linux/drivers/block/drbd/
H A Ddrbd_vli.h199 static inline void bitstream_cursor_reset(struct bitstream_cursor *cur, void *s) in bitstream_cursor_reset() argument
201 cur->b = s; in bitstream_cursor_reset()
202 cur->bit = 0; in bitstream_cursor_reset()
207 static inline void bitstream_cursor_advance(struct bitstream_cursor *cur, unsigned int bits) in bitstream_cursor_advance() argument
209 bits += cur->bit; in bitstream_cursor_advance()
210 cur->b = cur->b + (bits >> 3); in bitstream_cursor_advance()
211 cur->bit = bits & 7; in bitstream_cursor_advance()
216 struct bitstream_cursor cur; member
231 bitstream_cursor_reset(&bs->cur, bs->buf); in bitstream_init()
236 bitstream_cursor_reset(&bs->cur, bs->buf); in bitstream_rewind()
[all …]
/linux/security/selinux/ss/
H A Dhashtab.c72 struct hashtab_node *cur, *temp; in hashtab_destroy() local
75 cur = h->htable[i]; in hashtab_destroy()
76 while (cur) { in hashtab_destroy()
77 temp = cur; in hashtab_destroy()
78 cur = cur->next; in hashtab_destroy()
93 struct hashtab_node *cur; in hashtab_map() local
96 cur = h->htable[i]; in hashtab_map()
97 while (cur) { in hashtab_map()
98 ret = apply(cur->key, cur->datum, args); in hashtab_map()
101 cur = cur->next; in hashtab_map()
[all …]
H A Davtab.c91 struct avtab_node *prev, *cur, *newnode; in avtab_insert() local
98 for (prev = NULL, cur = h->htable[hvalue]; cur; in avtab_insert()
99 prev = cur, cur = cur->next) { in avtab_insert()
100 cmp = avtab_node_cmp(key, &cur->key); in avtab_insert()
125 struct avtab_node *prev, *cur; in avtab_insert_nonunique() local
131 for (prev = NULL, cur = h->htable[hvalue]; cur; in avtab_insert_nonunique()
148 struct avtab_node *cur; avtab_search_node() local
169 struct avtab_node *cur; avtab_search_node_next() local
189 struct avtab_node *cur, *temp; avtab_destroy() local
263 struct avtab_node *cur; avtab_hash_eval() local
520 avtab_write_item(struct policydb * p,const struct avtab_node * cur,struct policy_file * fp) avtab_write_item() argument
560 struct avtab_node *cur; avtab_write() local
[all...]
/linux/arch/arm/boot/dts/ti/omap/
H A Domap3-echo.dts158 led-cur = /bits/ 8 <12>;
159 max-cur = /bits/ 8 <15>;
165 led-cur = /bits/ 8 <12>;
166 max-cur = /bits/ 8 <15>;
172 led-cur = /bits/ 8 <12>;
173 max-cur = /bits/ 8 <15>;
185 led-cur = /bits/ 8 <12>;
186 max-cur = /bits/ 8 <15>;
192 led-cur = /bits/ 8 <12>;
193 max-cur = /bits/ 8 <15>;
[all …]
/linux/drivers/mtd/nand/
H A Decc-sw-hamming.c121 u32 cur; in ecc_sw_hamming_calculate() local
152 cur = *bp++; in ecc_sw_hamming_calculate()
153 tmppar = cur; in ecc_sw_hamming_calculate()
154 rp4 ^= cur; in ecc_sw_hamming_calculate()
155 cur = *bp++; in ecc_sw_hamming_calculate()
156 tmppar ^= cur; in ecc_sw_hamming_calculate()
158 cur = *bp++; in ecc_sw_hamming_calculate()
159 tmppar ^= cur; in ecc_sw_hamming_calculate()
160 rp4 ^= cur; in ecc_sw_hamming_calculate()
161 cur = *bp++; in ecc_sw_hamming_calculate()
[all …]
/linux/arch/mips/cavium-octeon/
H A Dcsrc-octeon.c146 u64 cur, end, inc; in __udelay() local
148 cur = read_c0_cvmcount(); in __udelay()
151 end = cur + inc; in __udelay()
153 while (end > cur) in __udelay()
154 cur = read_c0_cvmcount(); in __udelay()
160 u64 cur, end, inc; in __ndelay() local
162 cur = read_c0_cvmcount(); in __ndelay()
165 end = cur + inc; in __ndelay()
167 while (end > cur) in __ndelay()
168 cur = read_c0_cvmcount(); in __ndelay()
[all …]
/linux/tools/testing/selftests/filesystems/statmount/
H A Dlistmount_test.c36 for (size_t cur = 0; cur < nr_mounts; cur++) { in TEST() local
37 if (cur < nr_mounts - 1) in TEST()
38 ASSERT_LT(list[cur], list[cur + 1]); in TEST()
39 last_mnt_id = list[cur]; in TEST()
58 for (size_t cur = 0; cur < nr_mounts; cur++) { in TEST() local
59 if (cur < nr_mounts - 1) in TEST()
60 ASSERT_GT(list[cur], list[cur + 1]); in TEST()
61 last_mnt_id = list[cur]; in TEST()
/linux/Documentation/driver-api/mtd/
H A Dnand_ecc.rst216 unsigned char cur;
229 cur = *bp++;
230 par ^= cur;
231 if (i & 0x01) rp1 ^= cur; else rp0 ^= cur;
232 if (i & 0x02) rp3 ^= cur; else rp2 ^= cur;
233 if (i & 0x04) rp5 ^= cur; else rp4 ^= cur;
234 if (i & 0x08) rp7 ^= cur; else rp6 ^= cur;
235 if (i & 0x10) rp9 ^= cur; else rp8 ^= cur;
236 if (i & 0x20) rp11 ^= cur; else rp10 ^= cur;
237 if (i & 0x40) rp13 ^= cur; else rp12 ^= cur;
[all …]
/linux/tools/power/cpupower/
H A Dcpupower-completion.sh11 local cur="${COMP_WORDS[COMP_CWORD]}"
13 frequency-info) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
21 local cur="${COMP_WORDS[COMP_CWORD]}"
25 …s -d /sys/devices/system/cpu/cpufreq/policy* | head -1)/scaling_available_frequencies)' -- "$cur"))
29 …(ls -d /sys/devices/system/cpu/cpufreq/policy* | head -1)/scaling_available_governors)' -- "$cur"))
31 frequency-set) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
39 local cur="${COMP_WORDS[COMP_CWORD]}"
41 idle-info) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
49 local cur="${COMP_WORDS[COMP_CWORD]}"
51 idle-set) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
[all …]
/linux/drivers/clk/rockchip/
H A Dclk-pll.c173 struct rockchip_pll_rate_table cur; in rockchip_rk3036_pll_recalc_rate() local
176 rockchip_rk3036_pll_get_params(pll, &cur); in rockchip_rk3036_pll_recalc_rate()
178 rate64 *= cur.fbdiv; in rockchip_rk3036_pll_recalc_rate()
179 do_div(rate64, cur.refdiv); in rockchip_rk3036_pll_recalc_rate()
181 if (cur.dsmpd == 0) { in rockchip_rk3036_pll_recalc_rate()
183 u64 frac_rate64 = prate * cur.frac; in rockchip_rk3036_pll_recalc_rate()
185 do_div(frac_rate64, cur.refdiv); in rockchip_rk3036_pll_recalc_rate()
189 do_div(rate64, cur.postdiv1); in rockchip_rk3036_pll_recalc_rate()
190 do_div(rate64, cur.postdiv2); in rockchip_rk3036_pll_recalc_rate()
200 struct rockchip_pll_rate_table cur; in rockchip_rk3036_pll_set_params() local
[all …]
/linux/drivers/char/agp/
H A Disoch.c25 struct agp_3_5_dev *cur, *n = list_entry(new, struct agp_3_5_dev, list); in agp_3_5_dev_list_insert() local
29 cur = list_entry(pos, struct agp_3_5_dev, list); in agp_3_5_dev_list_insert()
30 if (cur->maxbw > n->maxbw) in agp_3_5_dev_list_insert()
38 struct agp_3_5_dev *cur; in agp_3_5_dev_list_sort() local
46 cur = list_entry(pos, struct agp_3_5_dev, list); in agp_3_5_dev_list_sort()
47 dev = cur->dev; in agp_3_5_dev_list_sort()
49 pci_read_config_dword(dev, cur->capndx+AGPNISTAT, &nistat); in agp_3_5_dev_list_sort()
50 cur->maxbw = (nistat >> 16) & 0xff; in agp_3_5_dev_list_sort()
82 struct agp_3_5_dev *cur; in agp_3_5_isochronous_node_enable() local
137 cur = list_entry(pos, struct agp_3_5_dev, list); in agp_3_5_isochronous_node_enable()
[all …]
/linux/tools/perf/util/
H A Dstrfilter.c84 struct strfilter_node root, *cur, *last_op; in strfilter_node__new() local
91 last_op = cur = &root; in strfilter_node__new()
97 if (!cur->r || !last_op->r) in strfilter_node__new()
99 cur = strfilter_node__alloc(OP_and, last_op->r, NULL); in strfilter_node__new()
100 if (!cur) in strfilter_node__new()
102 last_op->r = cur; in strfilter_node__new()
103 last_op = cur; in strfilter_node__new()
106 if (!cur->r || !root.r) in strfilter_node__new()
108 cur = strfilter_node__alloc(OP_or, root.r, NULL); in strfilter_node__new()
109 if (!cur) in strfilter_node__new()
[all …]
/linux/kernel/bpf/
H A Dstates.c303 const struct bpf_reg_state *cur) in range_within() argument
305 return cnum64_is_subset(old->r64, cur->r64) && in range_within()
306 cnum32_is_subset(old->r32, cur->r32); in range_within()
333 return map[i].cur == cur_id; in check_ids()
334 if (map[i].cur == cur_id) in check_ids()
341 map[idmap->cnt].cur = cur_id; in check_ids()
702 struct bpf_func_state *cur, struct bpf_idmap *idmap, in stacksafe() argument
719 u8 cur_type = i < cur->allocated_stack ? in stacksafe()
720 cur->stack[spi].slot_type[i % BPF_REG_SIZE] : STACK_INVALID; in stacksafe()
727 if (i >= cur->allocated_stack || old_type != cur_type) in stacksafe()
[all …]
/linux/drivers/misc/ocxl/
H A Dpasid.c15 struct id_range *cur; in dump_list() local
18 list_for_each_entry(cur, head, list) { in dump_list()
19 pr_debug("Range %d->%d\n", cur->start, cur->end); in dump_list()
28 struct id_range *cur, *new; in range_alloc() local
37 list_for_each_entry(cur, head, list) { in range_alloc()
38 if ((cur->start - last_end) > size) in range_alloc()
40 last_end = cur->end; in range_alloc()
41 pos = &cur->list; in range_alloc()
65 struct id_range *cur, *tmp; in range_free() local
67 list_for_each_entry_safe(cur, tmp, head, list) { in range_free()
[all …]

12345678910>>...23