Home
last modified time | relevance | path

Searched refs:POS (Results 1 – 25 of 46) sorted by relevance

12

/linux-6.15/arch/x86/math-emu/
H A Dreg_constant.c23 FPU_REG const CONST_1 = MAKE_REG(POS, 0, 0x00000000, 0x80000000);
25 FPU_REG const CONST_2 = MAKE_REG(POS, 1, 0x00000000, 0x80000000);
26 FPU_REG const CONST_HALF = MAKE_REG(POS, -1, 0x00000000, 0x80000000);
28 static FPU_REG const CONST_L2T = MAKE_REG(POS, 1, 0xcd1b8afe, 0xd49a784b);
29 static FPU_REG const CONST_L2E = MAKE_REG(POS, 0, 0x5c17f0bc, 0xb8aa3b29);
30 FPU_REG const CONST_PI = MAKE_REG(POS, 1, 0x2168c235, 0xc90fdaa2);
31 FPU_REG const CONST_PI2 = MAKE_REG(POS, 0, 0x2168c235, 0xc90fdaa2);
32 FPU_REG const CONST_PI4 = MAKE_REG(POS, -1, 0x2168c235, 0xc90fdaa2);
33 static FPU_REG const CONST_LG2 = MAKE_REG(POS, -2, 0xfbcff799, 0x9a209a84);
41 FPU_REG const CONST_Z = MAKE_REG(POS, EXP_UNDER, 0x0, 0x0);
[all …]
/linux-6.15/include/linux/
H A Dfortify-string.h152 #define POS __pass_dynamic_object_size(1) macro
155 #define POS __pass_object_size(1) macro
197 char *strncpy(char * const POS p, const char *q, __kernel_size_t size) in strncpy()
219 __FORTIFY_INLINE __kernel_size_t strnlen(const char * const POS p, __kernel_size_t maxlen) in strnlen()
261 __kernel_size_t __fortify_strlen(const char * const POS p) in __fortify_strlen()
277 __FORTIFY_INLINE ssize_t sized_strscpy(char * const POS p, const char * const POS q, size_t size) in sized_strscpy()
359 size_t strlcat(char * const POS p, const char * const POS q, size_t avail) in strlcat()
413 char *strcat(char * const POS p, const char *q) in strcat()
444 char *strncat(char * const POS p, const char * const POS q, __kernel_size_t count) in strncat()
785 char *strcpy(char * const POS p, const char * const POS q) in strcpy()
[all …]
/linux-6.15/fs/bcachefs/
H A Dtests.c19 POS(0, U64_MAX), in delete_test_keys()
25 POS(0, U64_MAX), in delete_test_keys()
135 SPOS(0, 0, U32_MAX), POS(0, U64_MAX), in test_iterate()
190 SPOS(0, 0, U32_MAX), POS(0, U64_MAX), in test_iterate_extents()
246 SPOS(0, 0, U32_MAX), POS(0, U64_MAX), in test_iterate_slots()
263 SPOS(0, 0, U32_MAX), POS(0, U64_MAX), in test_iterate_slots()
306 SPOS(0, 0, U32_MAX), POS(0, U64_MAX), in test_iterate_slots_extents()
324 SPOS(0, 0, U32_MAX), POS(0, U64_MAX), in test_iterate_slots_extents()
679 k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)); in __do_delete()
734 SPOS(0, 0, U32_MAX), POS(0, U64_MAX), in seq_lookup()
[all …]
H A Dsubvolume_format.h5 #define SUBVOL_POS_MIN POS(0, 1)
6 #define SUBVOL_POS_MAX POS(0, S32_MAX)
H A Dio_misc.c147 struct bpos end_pos = POS(inum.inum, end); in bch2_fpunch_at()
203 POS(inum.inum, start), in bch2_fpunch()
263 POS(inum.inum, round_up(new_i_size, block_bytes(c)) >> 9), in __bch2_resume_logged_op_truncate()
388 POS(inum.inum, 0), in __bch2_resume_logged_op_finsert()
402 bch2_btree_iter_set_pos(trans, &iter, POS(inum.inum, src_offset)); in __bch2_resume_logged_op_finsert()
419 struct bpos src_pos = POS(inum.inum, src_offset); in __bch2_resume_logged_op_finsert()
432 ? bch2_btree_iter_peek_prev_min(trans, &iter, POS(inum.inum, 0)) in __bch2_resume_logged_op_finsert()
433 : bch2_btree_iter_peek_max(trans, &iter, POS(inum.inum, U64_MAX)); in __bch2_resume_logged_op_finsert()
439 bkey_le(k.k->p, POS(inum.inum, src_offset))) in __bch2_resume_logged_op_finsert()
H A Dlogged_ops.c68 POS(LOGGED_OPS_INUM_logged_ops, 0), in bch2_resume_logged_ops()
69 POS(LOGGED_OPS_INUM_logged_ops, U64_MAX), in bch2_resume_logged_ops()
80 BTREE_ID_logged_ops, POS(LOGGED_OPS_INUM_logged_ops, U64_MAX)); in __bch2_logged_op_start()
H A Dsubvolume.c25 return POS(le32_to_cpu(s.v->fs_path_parent), s.k->p.offset); in subvolume_children_pos()
178 int ret = bch2_bkey_get_val_typed(trans, BTREE_ID_subvolumes, POS(0, child_k.k->p.offset), in check_subvol_child()
278 bch2_trans_iter_init(trans, &iter, BTREE_ID_subvolume_children, POS(subvol, 0), 0); in bch2_subvol_has_children()
292 int ret = bch2_bkey_get_val_typed(trans, BTREE_ID_subvolumes, POS(0, subvol), in bch2_subvolume_get_inlined()
342 BTREE_ID_subvolumes, POS(0, subvolid), in __bch2_subvolume_get_snapshot()
417 BTREE_ID_subvolumes, POS(0, subvolid), in __bch2_subvolume_delete()
430 BTREE_ID_snapshots, POS(0, snapid), in __bch2_subvolume_delete()
442 BTREE_ID_snapshot_trees, POS(0, treeid), in __bch2_subvolume_delete()
555 BTREE_ID_subvolumes, POS(0, subvolid), in bch2_subvolume_unlink()
585 BTREE_ID_subvolumes, POS(0, U32_MAX)); in bch2_subvolume_create()
[all …]
H A Dbackpointers.h43 return POS(bp_pos.inode, sector_to_bucket(ca, bucket_sector)); in bp_pos_to_bucket()
51 return POS(bp_pos.inode, sector_to_bucket_and_offset(ca, bucket_sector, bucket_offset)); in bp_pos_to_bucket_and_offset()
68 return POS(bucket.inode, in bucket_pos_to_bp_noerror()
H A Dfs-io.c296 POS(inode->v.i_ino, (index << PAGE_SECTORS_SHIFT)), in __bch2_truncate_folio()
297 POS(inode->v.i_ino, (index << PAGE_SECTORS_SHIFT) + PAGE_SECTORS)); in __bch2_truncate_folio()
636 struct bpos end_pos = POS(inode->v.i_ino, end_sector); in __bchfs_fallocate()
643 POS(inode->v.i_ino, start_sector), in __bchfs_fallocate()
705 bch2_btree_iter_set_pos(trans, &iter, POS(iter.pos.inode, hole_start)); in __bchfs_fallocate()
867 POS(inode->v.i_ino, start), in quota_reserve_range()
868 POS(inode->v.i_ino, end - 1), in quota_reserve_range()
989 POS(inode->v.i_ino, offset >> 9), in bch2_seek_data()
990 POS(inode->v.i_ino, U64_MAX), in bch2_seek_data()
1025 POS(inode->v.i_ino, offset >> 9), in bch2_seek_hole()
[all …]
H A Dsnapshot.c40 bkey_fsck_err_on(bkey_gt(k.k->p, POS(0, U32_MAX)) || in bch2_snapshot_tree_validate()
41 bkey_lt(k.k->p, POS(0, 1)), in bch2_snapshot_tree_validate()
64 BTREE_ID_snapshot_trees, POS(0, U32_MAX)); in __bch2_snapshot_tree_create()
237 bkey_lt(k.k->p, POS(0, 1)), in bch2_snapshot_validate()
476 POS(0, root_id), 0, snapshot); in check_snapshot_tree()
641 BTREE_ID_snapshots, POS(0, root_id), in snapshot_tree_ptr_repair()
876 snapshot->k.p = POS(0, id); in check_snapshot_exists()
1044 BTREE_ID_snapshots, POS(0, id), in bch2_snapshot_node_set_deleted()
1100 BTREE_ID_snapshots, POS(0, parent_id), in bch2_snapshot_node_delete()
1127 BTREE_ID_snapshots, POS(0, child_id), in bch2_snapshot_node_delete()
[all …]
H A Dextent_update.c74 BTREE_ID_reflink, POS(0, idx + offset), in count_iters_for_insert()
76 if (bkey_ge(bkey_start_pos(r_k.k), POS(0, idx + sectors))) in count_iters_for_insert()
H A Dquota.c631 POS(QTYP_USR, 0), in bch2_quota_remove()
632 POS(QTYP_USR, U64_MAX), in bch2_quota_remove()
643 POS(QTYP_GRP, 0), in bch2_quota_remove()
644 POS(QTYP_GRP, U64_MAX), in bch2_quota_remove()
655 POS(QTYP_PRJ, 0), in bch2_quota_remove()
656 POS(QTYP_PRJ, U64_MAX), in bch2_quota_remove()
870 new_quota.k.p = POS(qid.type, from_kqid(&init_user_ns, qid)); in bch2_set_quota()
H A Dstr_hash.h164 POS(inum.inum, U64_MAX), in bch2_hash_lookup_in_snapshot()
214 POS(inum.inum, U64_MAX), in bch2_hash_hole()
271 POS(insert->k.p.inode, U64_MAX), in bch2_hash_set_or_get_in_snapshot()
H A Dreflink.c96 bkey_fsck_err_on(bkey_gt(k.k->p, POS(0, REFLINK_P_IDX_MAX)), in bch2_reflink_v_validate()
266 POS(0, reflink_offset), iter_flags); in bch2_lookup_indirect_extent()
520 if (bkey_ge(reflink_iter.pos, POS(0, REFLINK_P_IDX_MAX - orig->k.size))) in bch2_make_extent_indirect()
602 struct bpos dst_start = POS(dst_inum.inum, dst_offset); in bch2_remap_range()
603 struct bpos src_start = POS(src_inum.inum, src_offset); in bch2_remap_range()
668 src_want = POS(src_start.inode, src_start.offset + dst_done); in bch2_remap_range()
H A Dalloc_background.c613 bch2_btree_iter_set_pos(trans, &iter, POS(k.k->p.inode + 1, 0)); in bch2_alloc_read()
634 bch2_btree_iter_set_pos(trans, &iter, POS(k.k->p.inode + 1, 0)); in bch2_alloc_read()
644 bch2_btree_iter_set_pos(trans, &iter, POS(k.k->p.inode + 1, 0)); in bch2_alloc_read()
1103 *bucket = POS((*ca)->dev_idx, (*ca)->mi.first_bucket); in next_bucket()
1945 POS(ca->dev_idx, 0), in bch2_do_discards_work()
1946 POS(ca->dev_idx, U64_MAX), 0, k, in bch2_do_discards_work()
1991 BTREE_ID_need_discard, POS(ca->dev_idx, bucket), 0); in bch2_do_discards_fast_one()
2300 struct bpos end = POS(ca->dev_idx, bucket_end); in bch2_dev_freespace_init()
2309 POS(ca->dev_idx, max_t(u64, ca->mi.first_bucket, bucket_start)), in bch2_dev_freespace_init()
2434 struct bpos start = POS(ca->dev_idx, 0); in bch2_dev_remove_alloc()
[all …]
H A Dinode.c658 BTREE_ID_inodes, POS(0, pos.offset), bpos_predecessor(pos), in __bch2_inode_has_child_snapshots()
883 POS(LOGGED_OPS_INUM_inode_cursors, cursor_idx), in bch2_inode_alloc_cursor_get()
939 bch2_trans_iter_init(trans, iter, BTREE_ID_inodes, POS(0, pos), in bch2_inode_create()
946 bkey_lt(k.k->p, POS(0, max))) { in bch2_inode_create()
955 bch2_btree_iter_set_pos(trans, iter, POS(0, pos)); in bch2_inode_create()
971 bch2_btree_iter_set_pos(trans, iter, POS(0, pos)); in bch2_inode_create()
995 struct bpos end = POS(inum.inum, U64_MAX); in bch2_inode_delete_keys()
1003 bch2_trans_iter_init(trans, &iter, id, POS(inum.inum, 0), in bch2_inode_delete_keys()
H A Dlru.h17 struct bpos pos = POS(((u64) lru_id << LRU_TIME_BITS)|time, dev_bucket); in lru_pos()
H A Ddirent.c410 POS(dst_dir.inum, bch2_dirent_hash(dst_hash, dst_name)); in bch2_dirent_rename()
647 POS(dir, U64_MAX), 0, k, ret) in bch2_empty_dir_snapshot()
695 POS(inum.inum, ctx->pos), in bch2_readdir()
696 POS(inum.inum, U64_MAX), in bch2_readdir()
727 for_each_btree_key_norestart(trans, iter, BTREE_ID_inodes, POS(0, inode_nr), in lookup_first_inode()
H A Dfsck.c73 POS(inum, U64_MAX), in bch2_count_inode_sectors()
90 POS(inum, U64_MAX), in bch2_count_subdirs()
217 BTREE_ID_subvolumes, POS(0, subvolid), in lookup_lostfound()
600 BTREE_ID_snapshots, POS(0, snapshotid), in reconstruct_subvol()
614 BTREE_ID_snapshot_trees, POS(0, snapshot_tree), in reconstruct_subvol()
1898 POS(BCACHEFS_ROOT_INO, 0), in bch2_check_extents()
2067 BTREE_ID_subvolumes, POS(0, target_subvol), in check_dirent_to_subvol()
2311 POS(BCACHEFS_ROOT_INO, 0), in bch2_check_dirents()
2370 POS(BCACHEFS_ROOT_INO, 0), in bch2_check_xattrs()
2801 POS(0, start), in check_nlinks_find_hardlinks()
[all …]
H A Dbuckets.h102 return POS(ptr->dev, PTR_BUCKET_NR(ca, ptr)); in PTR_BUCKET_POS()
109 return POS(ptr->dev, sector_to_bucket_and_offset(ca, ptr->offset, bucket_offset)); in PTR_BUCKET_POS_OFFSET()
H A Dalloc_foreground.c270 if (!may_alloc_bucket(c, POS(ca->dev_idx, b), s)) in try_alloc_bucket()
313 for_each_btree_key_norestart(trans, iter, BTREE_ID_alloc, POS(ca->dev_idx, alloc_cursor), in bch2_bucket_alloc_early()
317 if (bkey_ge(k.k->p, POS(ca->dev_idx, ca->mi.nbuckets))) in bch2_bucket_alloc_early()
330 bch2_btree_iter_set_pos(trans, &iter, POS(ca->dev_idx, bucket)); in bch2_bucket_alloc_early()
395 POS(ca->dev_idx, alloc_cursor), in bch2_bucket_alloc_freelist()
396 POS(ca->dev_idx, U64_MAX), in bch2_bucket_alloc_freelist()
420 bch2_btree_iter_set_pos(trans, &iter, POS(ca->dev_idx, alloc_cursor)); in bch2_bucket_alloc_freelist()
H A Dec.c122 bpos_gt(k.k->p, POS(0, U32_MAX)), in bch2_stripe_validate()
803 POS(0, idx), BTREE_ITER_slots); in get_stripe_key_trans()
976 BTREE_ID_stripes, POS(0, idx), in ec_stripe_delete()
1815 BTREE_ID_stripes, POS(0, idx), 0); in __get_existing_stripe()
1928 struct bpos min_pos = POS(0, 1); in __bch2_ec_stripe_head_reserve()
1929 struct bpos start_pos = bpos_max(min_pos, POS(0, c->ec_stripe_hint)); in __bch2_ec_stripe_head_reserve()
1947 if (bkey_gt(k.k->p, POS(0, U32_MAX))) { in __bch2_ec_stripe_head_reserve()
2105 bch2_bkey_get_mut_typed(trans, &iter, BTREE_ID_stripes, POS(0, a->stripe), in bch2_invalidate_stripe_to_dev()
2148 BTREE_ID_alloc, POS(dev_idx, 0), POS(dev_idx, U64_MAX), in bch2_dev_remove_stripes()
/linux-6.15/drivers/staging/sm750fb/
H A Dddk750_mode.h8 POS = 0, /* positive */ enumerator
H A Dsm750_hw.c285 (var->sync & FB_SYNC_HOR_HIGH_ACT) ? POS : NEG; in hw_sm750_crtc_setMode()
287 (var->sync & FB_SYNC_VERT_HIGH_ACT) ? POS : NEG; in hw_sm750_crtc_setMode()
289 (var->sync & FB_SYNC_COMP_HIGH_ACT) ? POS : NEG; in hw_sm750_crtc_setMode()
/linux-6.15/scripts/gcc-plugins/
H A Dgcc-common.h126 #define PASS_INFO(NAME, REF, ID, POS) \ argument
131 .pos_op = POS, \

12