/linux/arch/x86/math-emu/ |
H A D | reg_constant.c | 23 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); 34 static FPU_REG const CONST_LN2 = MAKE_REG(POS, [all...] |
/linux/include/linux/ |
H A D | fortify-string.h | 152 #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 [all...] |
/linux/fs/bcachefs/ |
H A D | tests.c | 19 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() 354 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)))); in test_peek_end() 357 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS( in test_peek_end() [all...] |
H A D | subvolume_format.h | 5 #define SUBVOL_POS_MIN POS(0, 1) 6 #define SUBVOL_POS_MAX POS(0, S32_MAX)
|
H A D | logged_ops.c | 68 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 D | subvolume.c | 42 return POS(le32_to_cpu(s.v->fs_path_parent), s.k->p.offset); in subvolume_children_pos() 201 int ret = bch2_bkey_get_val_typed(trans, BTREE_ID_subvolumes, POS(0, child_k.k->p.offset), in check_subvol_child() 308 bch2_trans_iter_init(trans, &iter, BTREE_ID_subvolume_children, POS(subvol, 0), 0); in bch2_subvol_has_children() 322 int ret = bch2_bkey_get_val_typed(trans, BTREE_ID_subvolumes, POS(0, subvol), in bch2_subvolume_get_inlined() 371 BTREE_ID_subvolumes, POS(0, subvolid), in __bch2_subvolume_get_snapshot() 446 BTREE_ID_subvolumes, POS(0, subvolid), in __bch2_subvolume_delete() 459 BTREE_ID_snapshots, POS(0, snapid), in __bch2_subvolume_delete() 471 BTREE_ID_snapshot_trees, POS(0, treeid), in __bch2_subvolume_delete() 585 BTREE_ID_subvolumes, POS(0, subvolid), in bch2_subvolume_unlink() 614 BTREE_ID_subvolumes, POS( in bch2_subvolume_create() [all...] |
H A D | io_misc.c | 174 struct bpos end_pos = POS(inum.inum, end); in bch2_fpunch_at() 230 POS(inum.inum, start), in bch2_fpunch() 290 POS(inum.inum, round_up(new_i_size, block_bytes(c)) >> 9), in __bch2_resume_logged_op_truncate() 415 POS(inum.inum, 0), in __bch2_resume_logged_op_finsert() 429 bch2_btree_iter_set_pos(trans, &iter, POS(inum.inum, src_offset)); in __bch2_resume_logged_op_finsert() 446 struct bpos src_pos = POS(inum.inum, src_offset); in __bch2_resume_logged_op_finsert() 459 ? bch2_btree_iter_peek_prev_min(trans, &iter, POS(inum.inum, 0)) in __bch2_resume_logged_op_finsert() 460 : bch2_btree_iter_peek_max(trans, &iter, POS(inum.inum, U64_MAX)); in __bch2_resume_logged_op_finsert() 466 bkey_le(k.k->p, POS(inum.inum, src_offset))) in __bch2_resume_logged_op_finsert()
|
H A D | backpointers.h | 43 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() 67 return POS(bucket.inode, in bucket_pos_to_bp_noerror()
|
H A D | fs-io.c | 298 POS(inode->v.i_ino, (index << PAGE_SECTORS_SHIFT)), in __bch2_truncate_folio() 299 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(inod in bch2_seek_hole() [all...] |
H A D | snapshot.c | 42 bkey_fsck_err_on(bkey_gt(k.k->p, POS(0, U32_MAX)) || in bch2_snapshot_tree_validate() 43 bkey_lt(k.k->p, POS(0, 1)), in bch2_snapshot_tree_validate() 53 int ret = bch2_bkey_get_val_typed(trans, BTREE_ID_snapshot_trees, POS(0, id), in bch2_snapshot_tree_lookup() 66 BTREE_ID_snapshot_trees, POS(0, U32_MAX)); in __bch2_snapshot_tree_create() 237 bkey_fsck_err_on(bkey_gt(k.k->p, POS(0, U32_MAX)) || in bch2_snapshot_validate() 238 bkey_lt(k.k->p, POS(0, 1)), in bch2_snapshot_validate() 367 return bch2_bkey_get_val_typed(trans, BTREE_ID_snapshots, POS(0, id), in bch2_snapshot_lookup() 464 BTREE_ID_subvolumes, POS(0, *subvol_id), in bch2_snapshot_tree_master_subvol() 497 POS(0, root_id), 0, snapshot); in check_snapshot_tree() 658 BTREE_ID_snapshots, POS( in snapshot_tree_ptr_repair() [all...] |
H A D | extent_update.c | 75 BTREE_ID_reflink, POS(0, idx + offset), in count_iters_for_insert() 77 if (bkey_ge(bkey_start_pos(r_k.k), POS(0, idx + sectors))) in count_iters_for_insert()
|
H A D | quota.c | 631 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 D | str_hash.h | 164 POS(inum.inum, U64_MAX), in bch2_hash_lookup_in_snapshot() 214 POS(inum.inum, U64_MAX), in bch2_hash_hole() 272 POS(insert->k.p.inode, U64_MAX), in bch2_hash_set_or_get_in_snapshot()
|
H A D | migrate.c | 251 POS(dev_idx, 0), in bch2_dev_data_drop_by_backpointers() 252 POS(dev_idx, U64_MAX), 0, k, in bch2_dev_data_drop_by_backpointers()
|
H A D | fsck.c | 75 POS(inum, U64_MAX), in bch2_count_inode_sectors() 92 POS(inum, U64_MAX), in bch2_count_subdirs() 198 BTREE_ID_subvolumes, POS(0, subvolid), in lookup_lostfound() 380 BTREE_ID_subvolumes, POS(0, inode->bi_subvol), in reattach_inode() 614 BTREE_ID_snapshots, POS(0, snapshotid), in reconstruct_subvol() 628 BTREE_ID_snapshot_trees, POS(0, snapshot_tree), in reconstruct_subvol() 653 struct bkey_s_c k = bch2_btree_iter_peek_prev_min(trans, &iter, POS(inum, 0)); in reconstruct_inode() 858 BTREE_ID_inodes, POS(0, inum), SPOS(0, inum, U32_MAX), in get_inodes_all_snapshots() 1502 POS(k.k->p.inode, U64_MAX), in check_key_has_inode() 1698 k1 = bch2_btree_iter_peek_max(trans, &iter1, POS(pos in overlapping_extents_found() [all...] |
H A D | lru.h | 17 struct bpos pos = POS(((u64) lru_id << LRU_TIME_BITS)|time, dev_bucket); in lru_pos()
|
H A D | dirent.c | 411 POS(dst_dir.inum, bch2_dirent_hash(dst_hash, dst_name)); in bch2_dirent_rename() 640 POS(dir, U64_MAX), 0, k, ret) in bch2_empty_dir_snapshot() 690 POS(inum.inum, ctx->pos), in bch2_readdir() 691 POS(inum.inum, U64_MAX), in bch2_readdir() 726 for_each_btree_key_norestart(trans, iter, BTREE_ID_inodes, POS(0, inode_nr), in lookup_first_inode()
|
H A D | inode.c | 734 BTREE_ID_inodes, POS(0, pos.offset), bpos_predecessor(pos), in __bch2_inode_has_child_snapshots() 966 POS(LOGGED_OPS_INUM_inode_cursors, cursor_idx), in bch2_inode_alloc_cursor_get() 1022 bch2_trans_iter_init(trans, iter, BTREE_ID_inodes, POS(0, pos), in bch2_inode_create() 1029 bkey_lt(k.k->p, POS(0, max))) { in bch2_inode_create() 1038 bch2_btree_iter_set_pos(trans, iter, POS(0, pos)); in bch2_inode_create() 1054 bch2_btree_iter_set_pos(trans, iter, POS(0, pos)); in bch2_inode_create() 1078 struct bpos end = POS(inum.inum, U64_MAX); in bch2_inode_delete_keys() 1086 bch2_trans_iter_init(trans, &iter, id, POS(inum.inum, 0), in bch2_inode_delete_keys()
|
H A D | alloc_background.c | 641 bch2_btree_iter_set_pos(trans, &iter, POS(k.k->p.inode + 1, 0)); in bch2_alloc_read() 662 bch2_btree_iter_set_pos(trans, &iter, POS(k.k->p.inode + 1, 0)); in bch2_alloc_read() 667 bch2_btree_iter_set_pos(trans, &iter, POS(k.k->p.inode, ca->mi.first_bucket)); in bch2_alloc_read() 672 bch2_btree_iter_set_pos(trans, &iter, POS(k.k->p.inode + 1, 0)); in bch2_alloc_read() 1075 end = bkey_min(end, POS(iter->pos.inode, iter->pos.offset + U32_MAX - 1)); in bch2_get_key_or_hole() 1116 *bucket = POS((*ca)->dev_idx, (*ca)->mi.first_bucket); in next_bucket() 1950 POS(ca->dev_idx, 0), in bch2_do_discards_work() 1951 POS(ca->dev_idx, U64_MAX), 0, k, in bch2_do_discards_work() 1996 BTREE_ID_need_discard, POS(ca->dev_idx, bucket), 0); in bch2_do_discards_fast_one() 2308 struct bpos end = POS(c in bch2_dev_freespace_init() [all...] |
H A D | buckets.h | 100 return POS(ptr->dev, PTR_BUCKET_NR(ca, ptr)); in PTR_BUCKET_POS() 107 return POS(ptr->dev, sector_to_bucket_and_offset(ca, ptr->offset, bucket_offset)); in PTR_BUCKET_POS_OFFSET()
|
H A D | alloc_foreground.c | 268 if (!may_alloc_bucket(c, req, POS(req->ca->dev_idx, b))) in try_alloc_bucket() 310 for_each_btree_key_norestart(trans, iter, BTREE_ID_alloc, POS(ca->dev_idx, alloc_cursor), in bch2_bucket_alloc_early() 314 if (bkey_ge(k.k->p, POS(ca->dev_idx, ca->mi.nbuckets))) in bch2_bucket_alloc_early() 327 bch2_btree_iter_set_pos(trans, &iter, POS(ca->dev_idx, bucket)); in bch2_bucket_alloc_early() 390 POS(ca->dev_idx, alloc_cursor), in bch2_bucket_alloc_freelist() 391 POS(ca->dev_idx, U64_MAX), in bch2_bucket_alloc_freelist() 415 bch2_btree_iter_set_pos(trans, &iter, POS(ca->dev_idx, alloc_cursor)); in bch2_bucket_alloc_freelist()
|
H A D | ec.c | 123 bpos_gt(k.k->p, POS(0, U32_MAX)), in bch2_stripe_validate() 811 POS(0, idx), BTREE_ITER_slots); in get_stripe_key_trans() 984 BTREE_ID_stripes, POS(0, idx), in ec_stripe_delete() 1831 BTREE_ID_stripes, POS(0, idx), 0); in __get_existing_stripe() 1944 struct bpos min_pos = POS(0, 1); in __bch2_ec_stripe_head_reserve() 1945 struct bpos start_pos = bpos_max(min_pos, POS(0, c->ec_stripe_hint)); in __bch2_ec_stripe_head_reserve() 1963 if (bkey_gt(k.k->p, POS(0, U32_MAX))) { in __bch2_ec_stripe_head_reserve() 2189 bch2_bkey_get_iter_typed(trans, &iter, BTREE_ID_stripes, POS(0, a->stripe), in bch2_invalidate_stripe_to_dev_from_alloc() 2204 BTREE_ID_alloc, POS(dev_idx, 0), POS(dev_id in bch2_dev_remove_stripes() [all...] |
/linux/drivers/staging/sm750fb/ |
H A D | ddk750_mode.h | 8 POS = 0, /* positive */ enumerator
|
H A D | sm750_hw.c | 283 (var->sync & FB_SYNC_HOR_HIGH_ACT) ? POS : NEG; in hw_sm750_crtc_set_mode() 285 (var->sync & FB_SYNC_VERT_HIGH_ACT) ? POS : NEG; in hw_sm750_crtc_set_mode() 287 (var->sync & FB_SYNC_COMP_HIGH_ACT) ? POS : NEG; in hw_sm750_crtc_set_mode()
|
/linux/scripts/gcc-plugins/ |
H A D | gcc-common.h | 150 #define PASS_INFO(NAME, REF, ID, POS) \ argument 155 .pos_op = POS, \
|