Home
last modified time | relevance | path

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

12345678910>>...24

/Linux-v4.19/fs/xfs/libxfs/
Dxfs_btree.c61 struct xfs_btree_cur *cur, in __xfs_btree_check_lblock() argument
66 struct xfs_mount *mp = cur->bc_mp; in __xfs_btree_check_lblock()
67 xfs_btnum_t btnum = cur->bc_btnum; in __xfs_btree_check_lblock()
85 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
88 !xfs_btree_check_lptr(cur, be64_to_cpu(block->bb_u.l.bb_leftsib), in __xfs_btree_check_lblock()
92 !xfs_btree_check_lptr(cur, be64_to_cpu(block->bb_u.l.bb_rightsib), in __xfs_btree_check_lblock()
102 struct xfs_btree_cur *cur, in xfs_btree_check_lblock() argument
107 struct xfs_mount *mp = cur->bc_mp; in xfs_btree_check_lblock()
110 fa = __xfs_btree_check_lblock(cur, block, level, bp); in xfs_btree_check_lblock()
127 struct xfs_btree_cur *cur, in __xfs_btree_check_sblock() argument
[all …]
Dxfs_refcount.c47 struct xfs_btree_cur *cur, in xfs_refcount_lookup_le() argument
51 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_private.a.agno, bno, in xfs_refcount_lookup_le()
53 cur->bc_rec.rc.rc_startblock = bno; in xfs_refcount_lookup_le()
54 cur->bc_rec.rc.rc_blockcount = 0; in xfs_refcount_lookup_le()
55 return xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat); in xfs_refcount_lookup_le()
64 struct xfs_btree_cur *cur, in xfs_refcount_lookup_ge() argument
68 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_private.a.agno, bno, in xfs_refcount_lookup_ge()
70 cur->bc_rec.rc.rc_startblock = bno; in xfs_refcount_lookup_ge()
71 cur->bc_rec.rc.rc_blockcount = 0; in xfs_refcount_lookup_ge()
72 return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat); in xfs_refcount_lookup_ge()
[all …]
Dxfs_ialloc_btree.c28 struct xfs_btree_cur *cur, in xfs_inobt_get_minrecs() argument
31 return cur->bc_mp->m_inobt_mnr[level != 0]; in xfs_inobt_get_minrecs()
36 struct xfs_btree_cur *cur) in xfs_inobt_dup_cursor() argument
38 return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_inobt_dup_cursor()
39 cur->bc_private.a.agbp, cur->bc_private.a.agno, in xfs_inobt_dup_cursor()
40 cur->bc_btnum); in xfs_inobt_dup_cursor()
45 struct xfs_btree_cur *cur, in xfs_inobt_set_root() argument
49 struct xfs_buf *agbp = cur->bc_private.a.agbp; in xfs_inobt_set_root()
54 xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL); in xfs_inobt_set_root()
59 struct xfs_btree_cur *cur, in xfs_finobt_set_root() argument
[all …]
Dxfs_iext_tree.c144 static inline struct xfs_iext_rec *cur_rec(struct xfs_iext_cursor *cur) in cur_rec() argument
146 return &cur->leaf->recs[cur->pos]; in cur_rec()
150 struct xfs_iext_cursor *cur) in xfs_iext_valid() argument
152 if (!cur->leaf) in xfs_iext_valid()
154 if (cur->pos < 0 || cur->pos >= xfs_iext_max_recs(ifp)) in xfs_iext_valid()
156 if (xfs_iext_rec_is_empty(cur_rec(cur))) in xfs_iext_valid()
203 struct xfs_iext_cursor *cur) in xfs_iext_first() argument
205 cur->pos = 0; in xfs_iext_first()
206 cur->leaf = xfs_iext_find_first_leaf(ifp); in xfs_iext_first()
212 struct xfs_iext_cursor *cur) in xfs_iext_last() argument
[all …]
Dxfs_alloc_btree.c26 struct xfs_btree_cur *cur) in xfs_allocbt_dup_cursor() argument
28 return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_allocbt_dup_cursor()
29 cur->bc_private.a.agbp, cur->bc_private.a.agno, in xfs_allocbt_dup_cursor()
30 cur->bc_btnum); in xfs_allocbt_dup_cursor()
35 struct xfs_btree_cur *cur, in xfs_allocbt_set_root() argument
39 struct xfs_buf *agbp = cur->bc_private.a.agbp; in xfs_allocbt_set_root()
42 int btnum = cur->bc_btnum; in xfs_allocbt_set_root()
43 struct xfs_perag *pag = xfs_perag_get(cur->bc_mp, seqno); in xfs_allocbt_set_root()
52 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS); in xfs_allocbt_set_root()
57 struct xfs_btree_cur *cur, in xfs_allocbt_alloc_block() argument
[all …]
Dxfs_refcount_btree.c27 struct xfs_btree_cur *cur) in xfs_refcountbt_dup_cursor() argument
29 return xfs_refcountbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_refcountbt_dup_cursor()
30 cur->bc_private.a.agbp, cur->bc_private.a.agno); in xfs_refcountbt_dup_cursor()
35 struct xfs_btree_cur *cur, in xfs_refcountbt_set_root() argument
39 struct xfs_buf *agbp = cur->bc_private.a.agbp; in xfs_refcountbt_set_root()
42 struct xfs_perag *pag = xfs_perag_get(cur->bc_mp, seqno); in xfs_refcountbt_set_root()
51 xfs_alloc_log_agf(cur->bc_tp, agbp, in xfs_refcountbt_set_root()
57 struct xfs_btree_cur *cur, in xfs_refcountbt_alloc_block() argument
62 struct xfs_buf *agbp = cur->bc_private.a.agbp; in xfs_refcountbt_alloc_block()
68 args.tp = cur->bc_tp; in xfs_refcountbt_alloc_block()
[all …]
Dxfs_rmap.c38 struct xfs_btree_cur *cur, in xfs_rmap_lookup_le() argument
46 cur->bc_rec.r.rm_startblock = bno; in xfs_rmap_lookup_le()
47 cur->bc_rec.r.rm_blockcount = len; in xfs_rmap_lookup_le()
48 cur->bc_rec.r.rm_owner = owner; in xfs_rmap_lookup_le()
49 cur->bc_rec.r.rm_offset = offset; in xfs_rmap_lookup_le()
50 cur->bc_rec.r.rm_flags = flags; in xfs_rmap_lookup_le()
51 return xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat); in xfs_rmap_lookup_le()
60 struct xfs_btree_cur *cur, in xfs_rmap_lookup_eq() argument
68 cur->bc_rec.r.rm_startblock = bno; in xfs_rmap_lookup_eq()
69 cur->bc_rec.r.rm_blockcount = len; in xfs_rmap_lookup_eq()
[all …]
Dxfs_rmap_btree.c55 struct xfs_btree_cur *cur) in xfs_rmapbt_dup_cursor() argument
57 return xfs_rmapbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_rmapbt_dup_cursor()
58 cur->bc_private.a.agbp, cur->bc_private.a.agno); in xfs_rmapbt_dup_cursor()
63 struct xfs_btree_cur *cur, in xfs_rmapbt_set_root() argument
67 struct xfs_buf *agbp = cur->bc_private.a.agbp; in xfs_rmapbt_set_root()
70 int btnum = cur->bc_btnum; in xfs_rmapbt_set_root()
71 struct xfs_perag *pag = xfs_perag_get(cur->bc_mp, seqno); in xfs_rmapbt_set_root()
80 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS); in xfs_rmapbt_set_root()
85 struct xfs_btree_cur *cur, in xfs_rmapbt_alloc_block() argument
90 struct xfs_buf *agbp = cur->bc_private.a.agbp; in xfs_rmapbt_alloc_block()
[all …]
Dxfs_bmap_btree.c167 struct xfs_btree_cur *cur) in xfs_bmbt_dup_cursor() argument
171 new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_bmbt_dup_cursor()
172 cur->bc_private.b.ip, cur->bc_private.b.whichfork); in xfs_bmbt_dup_cursor()
178 new->bc_private.b.flags = cur->bc_private.b.flags; in xfs_bmbt_dup_cursor()
199 struct xfs_btree_cur *cur, in xfs_bmbt_alloc_block() argument
208 args.tp = cur->bc_tp; in xfs_bmbt_alloc_block()
209 args.mp = cur->bc_mp; in xfs_bmbt_alloc_block()
210 args.fsbno = cur->bc_tp->t_firstblock; in xfs_bmbt_alloc_block()
211 xfs_rmap_ino_bmbt_owner(&args.oinfo, cur->bc_private.b.ip->i_ino, in xfs_bmbt_alloc_block()
212 cur->bc_private.b.whichfork); in xfs_bmbt_alloc_block()
[all …]
Dxfs_btree.h88 #define XFS_BTREE_STATS_INC(cur, stat) \ argument
89 XFS_STATS_INC_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat)
90 #define XFS_BTREE_STATS_ADD(cur, stat, val) \ argument
91 XFS_STATS_ADD_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat, val)
106 void (*set_root)(struct xfs_btree_cur *cur,
110 int (*alloc_block)(struct xfs_btree_cur *cur,
114 int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp);
117 void (*update_lastrec)(struct xfs_btree_cur *cur,
123 int (*get_minrecs)(struct xfs_btree_cur *cur, int level);
124 int (*get_maxrecs)(struct xfs_btree_cur *cur, int level);
[all …]
/Linux-v4.19/fs/xfs/scrub/
Dbtree.c34 struct xfs_btree_cur *cur, in __xchk_btree_process_error() argument
55 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) in __xchk_btree_process_error()
56 trace_xchk_ifork_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
59 trace_xchk_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
69 struct xfs_btree_cur *cur, in xchk_btree_process_error() argument
73 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_process_error()
80 struct xfs_btree_cur *cur, in xchk_btree_xref_process_error() argument
84 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_xref_process_error()
92 struct xfs_btree_cur *cur, in __xchk_btree_set_corrupt() argument
99 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) in __xchk_btree_set_corrupt()
[all …]
Dtrace.c26 struct xfs_btree_cur *cur, in xchk_btree_cur_fsbno() argument
29 if (level < cur->bc_nlevels && cur->bc_bufs[level]) in xchk_btree_cur_fsbno()
30 return XFS_DADDR_TO_FSB(cur->bc_mp, cur->bc_bufs[level]->b_bn); in xchk_btree_cur_fsbno()
31 else if (level == cur->bc_nlevels - 1 && in xchk_btree_cur_fsbno()
32 cur->bc_flags & XFS_BTREE_LONG_PTRS) in xchk_btree_cur_fsbno()
33 return XFS_INO_TO_FSB(cur->bc_mp, cur->bc_private.b.ip->i_ino); in xchk_btree_cur_fsbno()
34 else if (!(cur->bc_flags & XFS_BTREE_LONG_PTRS)) in xchk_btree_cur_fsbno()
35 return XFS_AGB_TO_FSB(cur->bc_mp, cur->bc_private.a.agno, 0); in xchk_btree_cur_fsbno()
/Linux-v4.19/security/selinux/ss/
Dsidtab.c37 struct sidtab_node *prev, *cur, *newnode; in sidtab_insert() local
44 cur = s->htable[hvalue]; in sidtab_insert()
45 while (cur && sid > cur->sid) { in sidtab_insert()
46 prev = cur; in sidtab_insert()
47 cur = cur->next; in sidtab_insert()
50 if (cur && sid == cur->sid) in sidtab_insert()
82 struct sidtab_node *cur; in sidtab_search_core() local
88 cur = s->htable[hvalue]; in sidtab_search_core()
89 while (cur && sid > cur->sid) in sidtab_search_core()
90 cur = cur->next; in sidtab_search_core()
[all …]
Dhashtab.c45 struct hashtab_node *prev, *cur, *newnode; in hashtab_insert() local
54 cur = h->htable[hvalue]; in hashtab_insert()
55 while (cur && h->keycmp(h, key, cur->key) > 0) { in hashtab_insert()
56 prev = cur; in hashtab_insert()
57 cur = cur->next; in hashtab_insert()
60 if (cur && (h->keycmp(h, key, cur->key) == 0)) in hashtab_insert()
83 struct hashtab_node *cur; in hashtab_search() local
89 cur = h->htable[hvalue]; in hashtab_search()
90 while (cur && h->keycmp(h, key, cur->key) > 0) in hashtab_search()
91 cur = cur->next; in hashtab_search()
[all …]
Davtab.c70 struct avtab_node *prev, struct avtab_node *cur, in avtab_insert_node() argument
111 struct avtab_node *prev, *cur, *newnode; in avtab_insert() local
118 for (prev = NULL, cur = flex_array_get_ptr(h->htable, hvalue); in avtab_insert()
119 cur; in avtab_insert()
120 prev = cur, cur = cur->next) { in avtab_insert()
121 if (key->source_type == cur->key.source_type && in avtab_insert()
122 key->target_type == cur->key.target_type && in avtab_insert()
123 key->target_class == cur->key.target_class && in avtab_insert()
124 (specified & cur->key.specified)) { in avtab_insert()
130 if (key->source_type < cur->key.source_type) in avtab_insert()
[all …]
/Linux-v4.19/drivers/mtd/nand/raw/
Dnand_ecc.c143 uint32_t cur; /* current value in buffer */ in __nand_calculate_ecc() local
173 cur = *bp++; in __nand_calculate_ecc()
174 tmppar = cur; in __nand_calculate_ecc()
175 rp4 ^= cur; in __nand_calculate_ecc()
176 cur = *bp++; in __nand_calculate_ecc()
177 tmppar ^= cur; in __nand_calculate_ecc()
179 cur = *bp++; in __nand_calculate_ecc()
180 tmppar ^= cur; in __nand_calculate_ecc()
181 rp4 ^= cur; in __nand_calculate_ecc()
182 cur = *bp++; in __nand_calculate_ecc()
[all …]
/Linux-v4.19/drivers/char/
Dbsr.c168 struct bsr_dev *cur, *n; in bsr_cleanup_devs() local
170 list_for_each_entry_safe(cur, n, &bsr_devs, bsr_list) { in bsr_cleanup_devs()
171 if (cur->bsr_device) { in bsr_cleanup_devs()
172 cdev_del(&cur->bsr_cdev); in bsr_cleanup_devs()
173 device_del(cur->bsr_device); in bsr_cleanup_devs()
175 list_del(&cur->bsr_list); in bsr_cleanup_devs()
176 kfree(cur); in bsr_cleanup_devs()
200 struct bsr_dev *cur = kzalloc(sizeof(struct bsr_dev), in bsr_add_node() local
205 if (!cur) { in bsr_add_node()
214 kfree(cur); in bsr_add_node()
[all …]
/Linux-v4.19/Documentation/devicetree/bindings/leds/
Dleds-lp55xx.txt15 - led-cur: Current setting at each led channel (mA x10, 0 if led is not connected)
16 - max-cur: Maximun current at each led channel.
44 led-cur = /bits/ 8 <0x2f>;
45 max-cur = /bits/ 8 <0x5f>;
50 led-cur = /bits/ 8 <0x2f>;
51 max-cur = /bits/ 8 <0x5f>;
55 led-cur = /bits/ 8 <0x2f>;
56 max-cur = /bits/ 8 <0x5f>;
79 led-cur = /bits/ 8 <0x14>;
80 max-cur = /bits/ 8 <0x20>;
[all …]
/Linux-v4.19/kernel/
Dcrash_core.c43 char *cur = cmdline, *tmp; in parse_crashkernel_mem() local
50 start = memparse(cur, &tmp); in parse_crashkernel_mem()
51 if (cur == tmp) { in parse_crashkernel_mem()
55 cur = tmp; in parse_crashkernel_mem()
56 if (*cur != '-') { in parse_crashkernel_mem()
60 cur++; in parse_crashkernel_mem()
63 if (*cur != ':') { in parse_crashkernel_mem()
64 end = memparse(cur, &tmp); in parse_crashkernel_mem()
65 if (cur == tmp) { in parse_crashkernel_mem()
69 cur = tmp; in parse_crashkernel_mem()
[all …]
/Linux-v4.19/drivers/block/drbd/
Ddrbd_vli.h211 static inline void bitstream_cursor_reset(struct bitstream_cursor *cur, void *s) in bitstream_cursor_reset() argument
213 cur->b = s; in bitstream_cursor_reset()
214 cur->bit = 0; in bitstream_cursor_reset()
219 static inline void bitstream_cursor_advance(struct bitstream_cursor *cur, unsigned int bits) in bitstream_cursor_advance() argument
221 bits += cur->bit; in bitstream_cursor_advance()
222 cur->b = cur->b + (bits >> 3); in bitstream_cursor_advance()
223 cur->bit = bits & 7; in bitstream_cursor_advance()
228 struct bitstream_cursor cur; member
243 bitstream_cursor_reset(&bs->cur, bs->buf); in bitstream_init()
248 bitstream_cursor_reset(&bs->cur, bs->buf); in bitstream_rewind()
[all …]
/Linux-v4.19/lib/zstd/
Dzstd_opt.h440 U32 cur, match_num, last_pos, litlen, price; in ZSTD_compressBlock_opt_generic() local
457 cur = 0; in ZSTD_compressBlock_opt_generic()
482 cur = 0; in ZSTD_compressBlock_opt_generic()
515 for (cur = 1; cur <= last_pos; cur++) { in ZSTD_compressBlock_opt_generic()
516 inr = ip + cur; in ZSTD_compressBlock_opt_generic()
518 if (opt[cur - 1].mlen == 1) { in ZSTD_compressBlock_opt_generic()
519 litlen = opt[cur - 1].litlen + 1; in ZSTD_compressBlock_opt_generic()
520 if (cur > litlen) { in ZSTD_compressBlock_opt_generic()
521 price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - litlen); in ZSTD_compressBlock_opt_generic()
526 price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - 1); in ZSTD_compressBlock_opt_generic()
[all …]
/Linux-v4.19/arch/mips/cavium-octeon/
Dcsrc-octeon.c145 u64 cur, end, inc; in __udelay() local
147 cur = read_c0_cvmcount(); in __udelay()
150 end = cur + inc; in __udelay()
152 while (end > cur) in __udelay()
153 cur = read_c0_cvmcount(); in __udelay()
159 u64 cur, end, inc; in __ndelay() local
161 cur = read_c0_cvmcount(); in __ndelay()
164 end = cur + inc; in __ndelay()
166 while (end > cur) in __ndelay()
167 cur = read_c0_cvmcount(); in __ndelay()
[all …]
/Linux-v4.19/drivers/char/agp/
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
138 cur = list_entry(pos, struct agp_3_5_dev, list); in agp_3_5_isochronous_node_enable()
[all …]
/Linux-v4.19/include/linux/
Diversion.h176 u64 cur, old, new; in inode_maybe_inc_iversion() local
189 cur = inode_peek_iversion_raw(inode); in inode_maybe_inc_iversion()
192 if (!force && !(cur & I_VERSION_QUERIED)) in inode_maybe_inc_iversion()
196 new = (cur & ~I_VERSION_QUERIED) + I_VERSION_INCREMENT; in inode_maybe_inc_iversion()
198 old = atomic64_cmpxchg(&inode->i_version, cur, new); in inode_maybe_inc_iversion()
199 if (likely(old == cur)) in inode_maybe_inc_iversion()
201 cur = old; in inode_maybe_inc_iversion()
283 u64 cur, old, new; in inode_query_iversion() local
285 cur = inode_peek_iversion_raw(inode); in inode_query_iversion()
288 if (cur & I_VERSION_QUERIED) { in inode_query_iversion()
[all …]
/Linux-v4.19/Documentation/mtd/
Dnand_ecc.txt193 unsigned char cur;
206 cur = *bp++;
207 par ^= cur;
208 if (i & 0x01) rp1 ^= cur; else rp0 ^= cur;
209 if (i & 0x02) rp3 ^= cur; else rp2 ^= cur;
210 if (i & 0x04) rp5 ^= cur; else rp4 ^= cur;
211 if (i & 0x08) rp7 ^= cur; else rp6 ^= cur;
212 if (i & 0x10) rp9 ^= cur; else rp8 ^= cur;
213 if (i & 0x20) rp11 ^= cur; else rp10 ^= cur;
214 if (i & 0x40) rp13 ^= cur; else rp12 ^= cur;
[all …]

12345678910>>...24