/linux/fs/xfs/libxfs/ |
A D | xfs_btree.c | 84 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock() 147 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_sblock() 240 cur->bc_ino.whichfork, cur->bc_btnum, in xfs_btree_check_ptr() 248 cur->bc_ag.pag->pag_agno, cur->bc_btnum, in xfs_btree_check_ptr() 344 error = cur->bc_ops->free_block(cur, bp); in xfs_btree_free_block() 382 kmem_cache_free(cur->bc_cache, cur); in xfs_btree_del_cursor() 407 new = cur->bc_ops->dup_cursor(cur); in xfs_btree_dup_cursor() 582 cur->bc_ops->get_maxrecs(cur, level) * cur->bc_ops->key_len + in xfs_btree_ptr_offset() 2334 ASSERT(cur->bc_ops->keys_inorder(cur, in xfs_btree_lshift() 2860 args.cur = cur; in xfs_btree_split() [all …]
|
A D | xfs_btree_staging.c | 454 cur->bc_ops->init_rec_from_cur(cur, block_rec); in xfs_btree_bload_leaf() 522 return cur->bc_ops->get_dmaxrecs(cur, level); in xfs_btree_bload_max_npb() 524 ret = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_max_npb() 573 maxnr = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_level_geometry() 623 maxr = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_ensure_slack() 624 minr = cur->bc_ops->get_minrecs(cur, level); in xfs_btree_bload_ensure_slack() 660 cur->bc_nlevels = cur->bc_maxlevels - 1; in xfs_btree_bload_compute_geometry() 665 for (cur->bc_nlevels = 1; cur->bc_nlevels <= cur->bc_maxlevels;) { in xfs_btree_bload_compute_geometry() 706 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels); in xfs_btree_bload_compute_geometry() 722 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels); in xfs_btree_bload_compute_geometry() [all …]
|
A D | xfs_refcount.c | 52 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, bno, in xfs_refcount_lookup_le() 69 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, bno, in xfs_refcount_lookup_ge() 86 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, bno, in xfs_refcount_lookup_eq() 150 trace_xfs_refcount_get(cur->bc_mp, cur->bc_ag.pag->pag_agno, irec); in xfs_refcount_get_rec() 175 trace_xfs_refcount_update(cur->bc_mp, cur->bc_ag.pag->pag_agno, irec); in xfs_refcount_update() 199 trace_xfs_refcount_insert(cur->bc_mp, cur->bc_ag.pag->pag_agno, irec); in xfs_refcount_insert() 240 trace_xfs_refcount_delete(cur->bc_mp, cur->bc_ag.pag->pag_agno, &irec); in xfs_refcount_delete() 372 trace_xfs_refcount_split_extent(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_split_extent() 1061 trace_xfs_refcount_increase(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_adjust() 1064 trace_xfs_refcount_decrease(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_adjust() [all …]
|
A D | xfs_ialloc_btree.c | 29 struct xfs_btree_cur *cur, in xfs_inobt_get_minrecs() argument 37 struct xfs_btree_cur *cur) in xfs_inobt_dup_cursor() argument 39 return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_inobt_dup_cursor() 40 cur->bc_ag.agbp, cur->bc_ag.pag, cur->bc_btnum); in xfs_inobt_dup_cursor() 104 args.tp = cur->bc_tp; in __xfs_inobt_alloc_block() 105 args.mp = cur->bc_mp; in __xfs_inobt_alloc_block() 452 cur->bc_ag.pag = pag; in xfs_inobt_init_common() 453 return cur; in xfs_inobt_init_common() 474 return cur; in xfs_inobt_init_cursor() 489 return cur; in xfs_inobt_stage_cursor() [all …]
|
A D | xfs_iext_tree.c | 142 return &cur->leaf->recs[cur->pos]; in cur_rec() 150 if (cur->pos < 0 || cur->pos >= xfs_iext_max_recs(ifp)) in xfs_iext_valid() 231 ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF); in xfs_iext_next() 239 cur->pos++; in xfs_iext_next() 242 cur->leaf = cur->leaf->next; in xfs_iext_next() 253 ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF); in xfs_iext_prev() 263 cur->pos--; in xfs_iext_prev() 269 cur->leaf = cur->leaf->prev; in xfs_iext_prev() 661 cur->leaf->recs[i] = cur->leaf->recs[i - 1]; in xfs_iext_insert() 934 for (cur->pos = 0; cur->pos < xfs_iext_max_recs(ifp); cur->pos++) { in xfs_iext_lookup_extent() [all …]
|
A D | xfs_alloc_btree.c | 27 struct xfs_btree_cur *cur) in xfs_allocbt_dup_cursor() argument 29 return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_allocbt_dup_cursor() 30 cur->bc_ag.agbp, cur->bc_ag.pag, cur->bc_btnum); in xfs_allocbt_dup_cursor() 35 struct xfs_btree_cur *cur, in xfs_allocbt_set_root() argument 63 error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_ag.agbp, in xfs_allocbt_alloc_block() 74 xfs_extent_busy_reuse(cur->bc_mp, cur->bc_ag.agbp->b_pag, bno, 1, false); in xfs_allocbt_alloc_block() 160 xfs_alloc_log_agf(cur->bc_tp, cur->bc_ag.agbp, XFS_AGF_LONGEST); in xfs_allocbt_update_lastrec() 496 cur->bc_ag.pag = pag; in xfs_allocbt_init_common() 501 return cur; in xfs_allocbt_init_common() 526 return cur; in xfs_allocbt_init_cursor() [all …]
|
A D | xfs_btree.h | 88 #define XFS_BTREE_STATS_INC(cur, stat) \ argument 89 XFS_STATS_INC_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat) 91 XFS_STATS_ADD_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat, val) 552 struct xfs_btree_cur *cur, in xfs_btree_islastblock() argument 591 struct xfs_btree_cur *cur; in xfs_btree_alloc_cursor() local 594 cur->bc_tp = tp; in xfs_btree_alloc_cursor() 595 cur->bc_mp = mp; in xfs_btree_alloc_cursor() 596 cur->bc_btnum = btnum; in xfs_btree_alloc_cursor() 597 cur->bc_maxlevels = maxlevels; in xfs_btree_alloc_cursor() 598 cur->bc_cache = cache; in xfs_btree_alloc_cursor() [all …]
|
A D | xfs_refcount_btree.c | 28 struct xfs_btree_cur *cur) in xfs_refcountbt_dup_cursor() argument 30 return xfs_refcountbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_refcountbt_dup_cursor() 31 cur->bc_ag.agbp, cur->bc_ag.pag); in xfs_refcountbt_dup_cursor() 67 args.tp = cur->bc_tp; in xfs_refcountbt_alloc_block() 68 args.mp = cur->bc_mp; in xfs_refcountbt_alloc_block() 70 args.fsbno = XFS_AGB_TO_FSB(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcountbt_alloc_block() 79 trace_xfs_refcountbt_alloc_block(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcountbt_alloc_block() 110 trace_xfs_refcountbt_free_block(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcountbt_free_block() 340 return cur; in xfs_refcountbt_init_common() 357 return cur; in xfs_refcountbt_init_cursor() [all …]
|
A D | xfs_rmap.c | 35 struct xfs_btree_cur *cur, in xfs_rmap_lookup_le() argument 45 cur->bc_rec.r.rm_owner = owner; in xfs_rmap_lookup_le() 57 struct xfs_btree_cur *cur, in xfs_rmap_lookup_eq() argument 80 struct xfs_btree_cur *cur, in xfs_rmap_update() argument 86 trace_xfs_rmap_update(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_rmap_update() 199 struct xfs_btree_cur *cur, in xfs_rmap_get_rec() argument 290 struct xfs_btree_cur *cur, in xfs_rmap_find_left_neighbor() argument 368 struct xfs_btree_cur *cur, in xfs_rmap_lookup_le_range() argument 1332 cur->bc_rec.r = NEW; in xfs_rmap_convert() 1389 cur->bc_rec.r = NEW; in xfs_rmap_convert() [all …]
|
A D | xfs_rmap_btree.c | 54 struct xfs_btree_cur *cur) in xfs_rmapbt_dup_cursor() argument 56 return xfs_rmapbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_rmapbt_dup_cursor() 57 cur->bc_ag.agbp, cur->bc_ag.pag); in xfs_rmapbt_dup_cursor() 62 struct xfs_btree_cur *cur, in xfs_rmapbt_set_root() argument 93 error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_ag.agbp, in xfs_rmapbt_alloc_block() 118 struct xfs_btree_cur *cur, in xfs_rmapbt_free_block() argument 465 cur->bc_ag.pag = pag; in xfs_rmapbt_init_common() 467 return cur; in xfs_rmapbt_init_common() 483 cur->bc_ag.agbp = agbp; in xfs_rmapbt_init_cursor() 484 return cur; in xfs_rmapbt_init_cursor() [all …]
|
A D | xfs_bmap_btree.c | 166 struct xfs_btree_cur *cur) in xfs_bmbt_dup_cursor() argument 170 new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_bmbt_dup_cursor() 171 cur->bc_ino.ip, cur->bc_ino.whichfork); in xfs_bmbt_dup_cursor() 207 args.tp = cur->bc_tp; in xfs_bmbt_alloc_block() 208 args.mp = cur->bc_mp; in xfs_bmbt_alloc_block() 211 cur->bc_ino.whichfork); in xfs_bmbt_alloc_block() 264 cur->bc_ino.allocated++; in xfs_bmbt_alloc_block() 281 struct xfs_btree_cur *cur, in xfs_bmbt_free_block() argument 568 cur->bc_ino.ip = ip; in xfs_bmbt_init_cursor() 570 cur->bc_ino.flags = 0; in xfs_bmbt_init_cursor() [all …]
|
/linux/fs/xfs/scrub/ |
A D | btree.c | 129 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_rec() local 156 if (cur->bc_ops->diff_two_keys(cur, &key, keyp) < 0) in xchk_btree_rec() 178 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_key() local 202 if (cur->bc_ops->diff_two_keys(cur, key, keyp) < 0) in xchk_btree_key() 252 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_sibling() local 313 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_siblings() local 410 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_owner() local 481 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_minrecs() local 584 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_keys() local 655 bs->cur = cur; in xchk_btree() [all …]
|
/linux/security/selinux/ss/ |
A D | avtab.c | 119 prev = cur, cur = cur->next) { in avtab_insert() 164 prev = cur, cur = cur->next) { in avtab_insert_nonunique() 193 for (cur = h->htable[hvalue]; cur; in avtab_search() 194 cur = cur->next) { in avtab_search() 229 for (cur = h->htable[hvalue]; cur; in avtab_search_node() 230 cur = cur->next) { in avtab_search_node() 259 for (cur = node->next; cur; cur = cur->next) { in avtab_search_node_next() 291 cur = cur->next; in avtab_destroy() 373 cur = cur->next; in avtab_hash_eval() 660 for (cur = a->htable[i]; cur; in avtab_write() [all …]
|
A D | hashtab.c | 74 while (cur) { in hashtab_destroy() 75 temp = cur; in hashtab_destroy() 76 cur = cur->next; in hashtab_destroy() 96 while (cur) { in hashtab_map() 97 ret = apply(cur->key, cur->datum, args); in hashtab_map() 100 cur = cur->next; in hashtab_map() 116 if (cur) { in hashtab_stat() 121 cur = cur->next; in hashtab_stat() 152 for (cur = orig->htable[i]; cur; cur = cur->next) { in hashtab_duplicate() 176 for (cur = new->htable[i]; cur; cur = tmp) { in hashtab_duplicate() [all …]
|
/linux/drivers/char/ |
A D | bsr.c | 162 kfree(cur); in bsr_cleanup_devs() 191 if (!cur) { in bsr_add_node() 200 kfree(cur); in bsr_add_node() 213 if (cur->bsr_len > 4096 && cur->bsr_len < PAGE_SIZE) in bsr_add_node() 236 cur->bsr_num = bsr_types[cur->bsr_type]; in bsr_add_node() 238 cur->bsr_bytes, cur->bsr_num); in bsr_add_node() 241 result = cdev_add(&cur->bsr_cdev, cur->bsr_dev, 1); in bsr_add_node() 243 kfree(cur); in bsr_add_node() 248 cur, "%s", cur->bsr_name); in bsr_add_node() 253 kfree(cur); in bsr_add_node() [all …]
|
/linux/drivers/gpu/drm/amd/amdgpu/ |
A D | amdgpu_res_cursor.h | 58 cur->start = start; in amdgpu_res_first() 59 cur->size = size; in amdgpu_res_first() 61 cur->node = NULL; in amdgpu_res_first() 74 cur->remaining = size; in amdgpu_res_first() 75 cur->node = node; in amdgpu_res_first() 93 if (!cur->remaining) in amdgpu_res_next() 96 cur->size -= size; in amdgpu_res_next() 97 if (cur->size) { in amdgpu_res_next() 98 cur->start += size; in amdgpu_res_next() 102 cur->node = ++node; in amdgpu_res_next() [all …]
|
/linux/drivers/block/drbd/ |
A D | drbd_vli.h | 201 cur->b = s; in bitstream_cursor_reset() 202 cur->bit = 0; in bitstream_cursor_reset() 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 250 unsigned char *b = bs->cur.b; in bitstream_put_bits() 256 if ((bs->cur.b + ((bs->cur.bit + bits -1) >> 3)) - bs->buf >= bs->buf_len) in bitstream_put_bits() 289 if (bs->cur.b + ((bs->cur.bit + bs->pad_bits + bits -1) >> 3) - bs->buf >= bs->buf_len) in bitstream_get_bits() 291 - bs->cur.bit - bs->pad_bits; in bitstream_get_bits() [all …]
|
/linux/kernel/ |
A D | crash_core.c | 57 cur = tmp; in parse_crashkernel_mem() 62 cur++; in parse_crashkernel_mem() 71 cur = tmp; in parse_crashkernel_mem() 82 cur++; in parse_crashkernel_mem() 89 cur = tmp; in parse_crashkernel_mem() 103 while (*cur && *cur != ' ' && *cur != '@') in parse_crashkernel_mem() 104 cur++; in parse_crashkernel_mem() 106 cur++; in parse_crashkernel_mem() 139 *crash_base = memparse(cur+1, &cur); in parse_crashkernel_simple() 140 else if (*cur != ' ' && *cur != '\0') { in parse_crashkernel_simple() [all …]
|
/linux/include/linux/ |
A D | iversion.h | 126 u64 cur, old; in inode_set_max_iversion_raw() local 130 if (cur > val) in inode_set_max_iversion_raw() 133 if (likely(old == cur)) in inode_set_max_iversion_raw() 135 cur = old; in inode_set_max_iversion_raw() 200 u64 cur, old, new; in inode_maybe_inc_iversion() local 223 if (likely(old == cur)) in inode_maybe_inc_iversion() 225 cur = old; in inode_maybe_inc_iversion() 307 u64 cur, old, new; in inode_query_iversion() local 312 if (cur & I_VERSION_QUERIED) { in inode_query_iversion() 324 if (likely(old == cur)) in inode_query_iversion() [all …]
|
/linux/arch/arm/boot/dts/ |
A D | omap3-echo.dts | 158 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/ |
A D | ecc-sw-hamming.c | 121 u32 cur; in ecc_sw_hamming_calculate() local 154 rp4 ^= cur; in ecc_sw_hamming_calculate() 160 rp4 ^= cur; in ecc_sw_hamming_calculate() 167 rp4 ^= cur; in ecc_sw_hamming_calculate() 168 rp6 ^= cur; in ecc_sw_hamming_calculate() 171 rp6 ^= cur; in ecc_sw_hamming_calculate() 174 rp4 ^= cur; in ecc_sw_hamming_calculate() 181 rp4 ^= cur; in ecc_sw_hamming_calculate() 182 rp6 ^= cur; in ecc_sw_hamming_calculate() 183 rp8 ^= cur; in ecc_sw_hamming_calculate() [all …]
|
/linux/Documentation/driver-api/mtd/ |
A D | nand_ecc.rst | 554 cur = *bp++; tmppar = cur; rp4 ^= cur; 556 cur = *bp++; tmppar ^= cur; rp4 ^= cur; 559 cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp6 ^= cur; 560 cur = *bp++; tmppar ^= cur; rp6 ^= cur; 561 cur = *bp++; tmppar ^= cur; rp4 ^= cur; 564 cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp6 ^= cur; rp8 ^= cur; 565 cur = *bp++; tmppar ^= cur; rp6 ^= cur; rp8 ^= cur; 566 cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp8 ^= cur; 567 cur = *bp++; tmppar ^= cur; rp8 ^= cur; 569 cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp6 ^= cur; [all …]
|
/linux/arch/mips/cavium-octeon/ |
A D | csrc-octeon.c | 146 u64 cur, end, inc; in __udelay() local 151 end = cur + inc; in __udelay() 153 while (end > cur) in __udelay() 160 u64 cur, end, inc; in __ndelay() local 165 end = cur + inc; in __ndelay() 167 while (end > cur) in __ndelay() 174 u64 cur, end; in __delay() local 179 while (end > cur) in __delay() 195 u64 cur, end; in octeon_io_clk_delay() local 207 end = cur + end; in octeon_io_clk_delay() [all …]
|
/linux/drivers/clk/rockchip/ |
A D | clk-pll.c | 205 cur.rate = 0; in rockchip_rk3036_pll_set_params() 318 cur.fbdiv, cur.postdiv1, cur.refdiv, cur.postdiv2, in rockchip_rk3036_pll_init() 319 cur.dsmpd, cur.frac); in rockchip_rk3036_pll_init() 327 (!cur.dsmpd && (rate->frac != cur.frac))) { in rockchip_rk3036_pll_init() 438 cur.rate = 0; in rockchip_rk3066_pll_set_params() 552 rate->no, cur.no, rate->nf, cur.nf, rate->nb, cur.nb); in rockchip_rk3066_pll_init() 553 if (rate->nr != cur.nr || rate->no != cur.no || rate->nf != cur.nf in rockchip_rk3066_pll_init() 687 cur.rate = 0; in rockchip_rk3399_pll_set_params() 802 cur.fbdiv, cur.postdiv1, cur.refdiv, cur.postdiv2, in rockchip_rk3399_pll_init() 803 cur.dsmpd, cur.frac); in rockchip_rk3399_pll_init() [all …]
|
/linux/tools/perf/util/ |
A D | hashmap.h | 157 for (cur = map->buckets[bkt]; cur; cur = cur->next) 169 for (cur = map->buckets[bkt]; \ 170 cur && ({tmp = cur->next; true; }); \ 171 cur = tmp) 180 for (cur = map->buckets \ 183 cur; \ 184 cur = cur->next) \ 185 if (map->equal_fn(cur->key, (_key), map->ctx)) 188 for (cur = map->buckets \ 191 cur && ({ tmp = cur->next; true; }); \ [all …]
|