/openbmc/linux/fs/xfs/libxfs/ |
H A D | xfs_btree.c | 150 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock() 216 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_sblock() 309 cur->bc_ino.whichfork, cur->bc_btnum, in xfs_btree_check_ptr() 413 error = cur->bc_ops->free_block(cur, bp); in xfs_btree_free_block() 457 kmem_cache_free(cur->bc_cache, cur); in xfs_btree_del_cursor() 482 new = cur->bc_ops->dup_cursor(cur); in xfs_btree_dup_cursor() 657 cur->bc_ops->get_maxrecs(cur, level) * cur->bc_ops->key_len + in xfs_btree_ptr_offset() 2408 ASSERT(cur->bc_ops->keys_inorder(cur, in xfs_btree_lshift() 2420 ASSERT(cur->bc_ops->recs_inorder(cur, in xfs_btree_lshift() 2948 args.cur = cur; in xfs_btree_split() [all …]
|
H A D | xfs_btree_staging.c | 452 cur->bc_ops->init_rec_from_cur(cur, block_rec); in xfs_btree_bload_leaf() 520 return cur->bc_ops->get_dmaxrecs(cur, level); in xfs_btree_bload_max_npb() 522 ret = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_max_npb() 571 maxnr = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_level_geometry() 621 maxr = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_ensure_slack() 622 minr = cur->bc_ops->get_minrecs(cur, level); in xfs_btree_bload_ensure_slack() 658 cur->bc_nlevels = cur->bc_maxlevels - 1; in xfs_btree_bload_compute_geometry() 663 for (cur->bc_nlevels = 1; cur->bc_nlevels <= cur->bc_maxlevels;) { in xfs_btree_bload_compute_geometry() 704 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels); in xfs_btree_bload_compute_geometry() 720 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels); in xfs_btree_bload_compute_geometry() [all …]
|
H A D | xfs_refcount.c | 48 struct xfs_btree_cur *cur, in xfs_refcount_lookup_le() argument 53 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_lookup_le() 73 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_lookup_ge() 93 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_lookup_eq() 186 trace_xfs_refcount_get(cur->bc_mp, cur->bc_ag.pag->pag_agno, irec); in xfs_refcount_get_rec() 204 trace_xfs_refcount_update(cur->bc_mp, cur->bc_ag.pag->pag_agno, irec); in xfs_refcount_update() 232 trace_xfs_refcount_insert(cur->bc_mp, cur->bc_ag.pag->pag_agno, irec); in xfs_refcount_insert() 276 trace_xfs_refcount_delete(cur->bc_mp, cur->bc_ag.pag->pag_agno, &irec); in xfs_refcount_delete() 412 trace_xfs_refcount_split_extent(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_split_extent() 1296 trace_xfs_refcount_adjust_error(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_adjust() [all …]
|
H A D | xfs_btree.h | 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) 603 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) < 0; in xfs_btree_keycmp_lt() 612 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) > 0; in xfs_btree_keycmp_gt() 621 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) == 0; in xfs_btree_keycmp_eq() 659 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) < 0; in xfs_btree_masked_keycmp_lt() 669 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) > 0; in xfs_btree_masked_keycmp_gt() 726 cur->bc_tp = tp; in xfs_btree_alloc_cursor() 727 cur->bc_mp = mp; in xfs_btree_alloc_cursor() 728 cur->bc_btnum = btnum; in xfs_btree_alloc_cursor() [all …]
|
H 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_ag.pag, cur->bc_tp, in xfs_inobt_dup_cursor() 40 cur->bc_ag.agbp, cur->bc_btnum); in xfs_inobt_dup_cursor() 45 struct xfs_btree_cur *cur, in xfs_inobt_set_root() argument 104 args.tp = cur->bc_tp; in __xfs_inobt_alloc_block() 105 args.mp = cur->bc_mp; in __xfs_inobt_alloc_block() 471 return cur; in xfs_inobt_init_common() 491 return cur; in xfs_inobt_init_cursor() 505 return cur; in xfs_inobt_stage_cursor() [all …]
|
H 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 …]
|
H 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_ag.pag, cur->bc_tp, in xfs_allocbt_alloc_block() 74 xfs_extent_busy_reuse(cur->bc_mp, cur->bc_ag.pag, bno, 1, false); in xfs_allocbt_alloc_block() 92 error = xfs_alloc_put_freelist(cur->bc_ag.pag, cur->bc_tp, agbp, NULL, in xfs_allocbt_free_block() 161 xfs_alloc_log_agf(cur->bc_tp, cur->bc_ag.agbp, XFS_AGF_LONGEST); in xfs_allocbt_update_lastrec() 522 return cur; in xfs_allocbt_init_common() 547 return cur; in xfs_allocbt_init_cursor() [all …]
|
H A D | xfs_refcount_btree.c | 29 struct xfs_btree_cur *cur) in xfs_refcountbt_dup_cursor() argument 31 return xfs_refcountbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_refcountbt_dup_cursor() 32 cur->bc_ag.agbp, cur->bc_ag.pag); in xfs_refcountbt_dup_cursor() 37 struct xfs_btree_cur *cur, in xfs_refcountbt_set_root() argument 68 args.tp = cur->bc_tp; in xfs_refcountbt_alloc_block() 69 args.mp = cur->bc_mp; in xfs_refcountbt_alloc_block() 80 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() 358 return cur; in xfs_refcountbt_init_common() 375 return cur; in xfs_refcountbt_init_cursor() [all …]
|
H A D | xfs_bmap_btree.c | 167 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_ino.ip, cur->bc_ino.whichfork); in xfs_bmbt_dup_cursor() 208 args.tp = cur->bc_tp; in xfs_bmbt_alloc_block() 209 args.mp = cur->bc_mp; in xfs_bmbt_alloc_block() 211 cur->bc_ino.whichfork); in xfs_bmbt_alloc_block() 224 args.minleft = xfs_bmapi_minleft(cur->bc_tp, cur->bc_ino.ip, in xfs_bmbt_alloc_block() 249 cur->bc_ino.allocated++; in xfs_bmbt_alloc_block() 571 cur->bc_ino.ip = ip; in xfs_bmbt_init_cursor() 573 cur->bc_ino.flags = 0; in xfs_bmbt_init_cursor() [all …]
|
H A D | xfs_rmap.c | 35 struct xfs_btree_cur *cur, in xfs_rmap_lookup_le() argument 71 struct xfs_btree_cur *cur, in xfs_rmap_lookup_eq() argument 94 struct xfs_btree_cur *cur, in xfs_rmap_update() argument 100 trace_xfs_rmap_update(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_rmap_update() 211 struct xfs_btree_cur *cur, in xfs_rmap_check_irec() argument 288 struct xfs_btree_cur *cur, in xfs_rmap_get_rec() argument 346 struct xfs_btree_cur *cur, in xfs_rmap_find_left_neighbor() argument 470 trace_xfs_rmap_lookup_le_range(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_rmap_lookup_le_range() 1415 cur->bc_rec.r = NEW; in xfs_rmap_convert() 1472 cur->bc_rec.r = NEW; in xfs_rmap_convert() [all …]
|
H 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(pag, cur->bc_tp, cur->bc_ag.agbp, in xfs_rmapbt_alloc_block() 118 struct xfs_btree_cur *cur, in xfs_rmapbt_free_block() argument 145 struct xfs_btree_cur *cur, in xfs_rmapbt_get_minrecs() argument 517 return cur; in xfs_rmapbt_init_common() 533 cur->bc_ag.agbp = agbp; in xfs_rmapbt_init_cursor() 534 return cur; in xfs_rmapbt_init_cursor() [all …]
|
/openbmc/linux/fs/xfs/scrub/ |
H A D | btree.c | 140 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_rec() local 156 !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec)) in xchk_btree_rec() 190 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_key() local 265 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_sibling() local 326 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_siblings() local 428 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_owner() local 501 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_minrecs() local 552 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_keys() local 651 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_keys() local 722 bs->cur = cur; in xchk_btree() [all …]
|
/openbmc/linux/drivers/gpu/drm/amd/amdgpu/ |
H A D | amdgpu_res_cursor.h | 90 cur->node = block; in amdgpu_res_first() 101 cur->node = node; in amdgpu_res_first() 110 cur->start = start; in amdgpu_res_first() 111 cur->size = size; in amdgpu_res_first() 113 cur->node = NULL; in amdgpu_res_first() 138 cur->size -= size; in amdgpu_res_next() 139 if (cur->size) { in amdgpu_res_next() 146 block = cur->node; in amdgpu_res_next() 153 cur->size = min(amdgpu_vram_mgr_block_size(block), cur->remaining); in amdgpu_res_next() 157 node = cur->node; in amdgpu_res_next() [all …]
|
/openbmc/linux/drivers/char/ |
H A D | bsr.c | 165 kfree(cur); in bsr_cleanup_devs() 194 if (!cur) { in bsr_add_node() 203 kfree(cur); in bsr_add_node() 216 if (cur->bsr_len > 4096 && cur->bsr_len < PAGE_SIZE) in bsr_add_node() 239 cur->bsr_num = bsr_types[cur->bsr_type]; in bsr_add_node() 241 cur->bsr_bytes, cur->bsr_num); in bsr_add_node() 244 result = cdev_add(&cur->bsr_cdev, cur->bsr_dev, 1); in bsr_add_node() 246 kfree(cur); in bsr_add_node() 251 cur, "%s", cur->bsr_name); in bsr_add_node() 256 kfree(cur); in bsr_add_node() [all …]
|
/openbmc/linux/security/selinux/ss/ |
H A D | avtab.c | 118 cur; in avtab_insert() 119 prev = cur, cur = cur->next) { in avtab_insert() 163 cur; in avtab_insert_nonunique() 164 prev = cur, cur = cur->next) { in avtab_insert_nonunique() 197 for (cur = h->htable[hvalue]; cur; in avtab_search_node() 198 cur = cur->next) { in avtab_search_node() 227 for (cur = node->next; cur; cur = cur->next) { in avtab_search_node_next() 259 cur = cur->next; in avtab_destroy() 342 cur = cur->next; in avtab_hash_eval() 630 for (cur = a->htable[i]; cur; in avtab_write() [all …]
|
H 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() 154 for (cur = orig->htable[i]; cur; cur = cur->next) { in hashtab_duplicate() 178 for (cur = new->htable[i]; cur; cur = tmp) { in hashtab_duplicate() [all …]
|
/openbmc/linux/drivers/block/drbd/ |
H 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 …]
|
/openbmc/phosphor-mboxd/ |
H A D | mboxd_windows.c | 347 cur->dirty_bmap = calloc((cur->size >> in alloc_window_dirty_bytemap() 463 oldest = cur; in find_oldest_window() 487 largest = cur; in find_largest_window() 521 return cur; in search_windows() 526 (offset < (cur->flash_offset + cur->size))) { in search_windows() 532 return cur; in search_windows() 568 if (!cur) { in create_map_window() 622 rc = copy_flash(context, offset, cur->mem, cur->size); in create_map_window() 636 memset(cur->mem + rc, 0xFF, cur->size - rc); in create_map_window() 651 for (i = offset; i < (offset + cur->size); i += (cur->size - 1)) { in create_map_window() [all …]
|
/openbmc/hiomapd/ |
H A D | windows.c | 468 min_age = cur->age; in windows_find_oldest() 469 oldest = cur; in windows_find_oldest() 493 largest = cur; in windows_find_largest() 527 return cur; in windows_search() 532 (offset < (cur->flash_offset + cur->size))) { in windows_search() 538 return cur; in windows_search() 574 if (!cur) { in windows_create_map() 616 rc = backend_copy(&context->backend, offset, cur->mem, cur->size); in windows_create_map() 630 memset(cur->mem + rc, 0xFF, cur->size - rc); in windows_create_map() 645 for (i = offset; i < (offset + cur->size); i += (cur->size - 1)) { in windows_create_map() [all …]
|
/openbmc/linux/arch/mips/cavium-octeon/ |
H 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 …]
|
/openbmc/linux/drivers/mtd/nand/ |
H 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 …]
|
/openbmc/linux/arch/arm/boot/dts/ti/omap/ |
H 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 …]
|
/openbmc/linux/tools/power/cpupower/ |
H A D | cpupower-completion.sh | 11 local cur="${COMP_WORDS[COMP_CWORD]}" 21 local cur="${COMP_WORDS[COMP_CWORD]}" 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")) ;; 59 local cur="${COMP_WORDS[COMP_CWORD]}" 61 set) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;; 69 local cur="${COMP_WORDS[COMP_CWORD]}" 71 monitor) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;; [all …]
|
/openbmc/linux/tools/lib/bpf/ |
H A D | hashmap.h | 170 for (cur = map->buckets[bkt]; cur; cur = cur->next) 182 for (cur = map->buckets[bkt]; \ 183 cur && ({tmp = cur->next; true; }); \ 184 cur = tmp) 193 for (cur = map->buckets \ 196 cur; \ 197 cur = cur->next) \ 198 if (map->equal_fn(cur->key, (_key), map->ctx)) 201 for (cur = map->buckets \ 204 cur && ({ tmp = cur->next; true; }); \ [all …]
|
/openbmc/linux/tools/perf/util/ |
H A D | hashmap.h | 170 for (cur = map->buckets[bkt]; cur; cur = cur->next) 182 for (cur = map->buckets[bkt]; \ 183 cur && ({tmp = cur->next; true; }); \ 184 cur = tmp) 193 for (cur = map->buckets \ 196 cur; \ 197 cur = cur->next) \ 198 if (map->equal_fn(cur->key, (_key), map->ctx)) 201 for (cur = map->buckets \ 204 cur && ({ tmp = cur->next; true; }); \ [all …]
|