| /fs/smb/common/ |
| A D | cifs_md4.c | 51 #define ROUND1(a,b,c,d,k,s) (a = lshift(a + F(b,c,d) + k, s)) argument 52 #define ROUND2(a,b,c,d,k,s) (a = lshift(a + G(b,c,d) + k + (u32)0x5A827999,s)) argument 53 #define ROUND3(a,b,c,d,k,s) (a = lshift(a + H(b,c,d) + k + (u32)0x6ED9EBA1,s)) argument 57 u32 a, b, c, d; in md4_transform() local 59 a = hash[0]; in md4_transform() 64 ROUND1(a, b, c, d, in[0], 3); in md4_transform() 65 ROUND1(d, a, b, c, in[1], 7); in md4_transform() 68 ROUND1(a, b, c, d, in[4], 3); in md4_transform() 69 ROUND1(d, a, b, c, in[5], 7); in md4_transform() 72 ROUND1(a, b, c, d, in[8], 3); in md4_transform() [all …]
|
| A D | cifs_arc4.c | 27 u32 a = ctx->S[i]; in cifs_arc4_setkey() local 29 j = (j + in_key[k] + a) & 0xff; in cifs_arc4_setkey() 31 ctx->S[j] = a; in cifs_arc4_setkey() 43 u32 x, y, a, b; in cifs_arc4_crypt() local 52 a = S[x]; in cifs_arc4_crypt() 53 y = (y + a) & 0xff; in cifs_arc4_crypt() 57 S[y] = a; in cifs_arc4_crypt() 58 a = (a + b) & 0xff; in cifs_arc4_crypt() 64 *out++ = *in++ ^ S[a]; in cifs_arc4_crypt() 68 a = ta; in cifs_arc4_crypt()
|
| /fs/bcachefs/ |
| A D | alloc_background.h | 33 return a.gen - a.oldest_gen; in alloc_gc_gen() 91 return a.stripe_sectors + a.dirty_sectors + a.cached_sectors; in bch2_bucket_sectors_total() 96 return a.stripe_sectors + a.dirty_sectors; in bch2_bucket_sectors_dirty() 102 ? a.cached_sectors in bch2_bucket_sectors() 116 int d = a.stripe_sectors + a.dirty_sectors; in bch2_gc_bucket_sectors_fragmented() 123 return a.data_type == BCH_DATA_stripe ? a.dirty_sectors : 0; in bch2_bucket_sectors_unstriped() 129 if (a.stripe) in alloc_data_type() 133 if (a.cached_sectors) in alloc_data_type() 144 a->data_type = alloc_data_type(*a, data_type); in alloc_data_type_set() 212 set_bkey_val_u64s(&a->k, alloc_v4_u64s(&a->v)); in set_alloc_v4_u64s() [all …]
|
| A D | mean_and_variance.h | 33 return a.v; in u128_lo() 43 a.v += b.v; in u128_add() 44 return a; in u128_add() 49 a.v -= b.v; in u128_sub() 50 return a; in u128_sub() 55 a.v <<= shift; in u128_shl() 56 return a; in u128_shl() 82 return a.lo; in u128_lo() 87 return a.hi; in u128_hi() 97 c.hi = a.hi + b.hi + (c.lo < a.lo); in u128_add() [all …]
|
| A D | disk_accounting.h | 22 bch2_u64s_neg(a.v->d, bch2_accounting_counters(a.k)); in bch2_accounting_neg() 28 if (a.v->d[i]) in bch2_accounting_key_is_zero() 153 struct bkey_s_c_accounting a, in bch2_accounting_mem_mod_locked() argument 160 bpos_to_disk_accounting_pos(&acc_k, a.k->p); in bch2_accounting_mem_mod_locked() 198 ret = bch2_accounting_mem_insert(c, a, mode); in bch2_accounting_mem_mod_locked() 208 this_cpu_add(e->v[gc][i], a.v->d[i]); in bch2_accounting_mem_mod_locked() 259 struct bkey_i_accounting *a, in bch2_accounting_trans_commit_hook() argument 263 a->k.bversion = journal_pos_to_bversion(&trans->journal_res, (u64 *) a - base); in bch2_accounting_trans_commit_hook() 265 EBUG_ON(bversion_zero(a->k.bversion)); in bch2_accounting_trans_commit_hook() 279 bch2_accounting_neg(a); in bch2_accounting_trans_commit_revert() [all …]
|
| A D | alloc_background.c | 210 bkey_val_u64s(a.k), bch_alloc_v1_val_u64s(a.v)); in bch2_alloc_v1_validate() 259 bkey_fsck_err_on(alloc_data_type(a, a.data_type) != a.data_type, in bch2_alloc_v4_validate() 262 a.data_type, alloc_data_type(a, a.data_type)); in bch2_alloc_v4_validate() 329 a->flags = swab32(a->flags); in bch2_alloc_v4_swab() 330 a->dirty_sectors = swab32(a->dirty_sectors); in bch2_alloc_v4_swab() 331 a->cached_sectors = swab32(a->cached_sectors); in bch2_alloc_v4_swab() 332 a->io_time[0] = swab64(a->io_time[0]); in bch2_alloc_v4_swab() 333 a->io_time[1] = swab64(a->io_time[1]); in bch2_alloc_v4_swab() 334 a->stripe = swab32(a->stripe); in bch2_alloc_v4_swab() 336 a->stripe_sectors = swab32(a->stripe_sectors); in bch2_alloc_v4_swab() [all …]
|
| A D | eytzinger.c | 47 u32 t = *(u32 *)(a + (n -= 4)); in swap_words_32() 73 u64 t = *(u64 *)(a + (n -= 8)); in swap_words_64() 78 u32 t = *(u32 *)(a + (n -= 4)); in swap_words_64() 82 t = *(u32 *)(a + (n -= 4)); in swap_words_64() 100 char t = ((char *)a)[--n]; in swap_bytes() 101 ((char *)a)[n] = ((char *)b)[n]; in swap_bytes() 133 swap_words_64(a, b, size); in do_swap() 135 swap_words_32(a, b, size); in do_swap() 137 swap_bytes(a, b, size); in do_swap() 148 return cmp(a, b, priv); in do_cmp() [all …]
|
| A D | fs.h | 86 struct bch_inode_info *a[] = { NULL, __VA_ARGS__ }; \ 89 bubble_sort(&a[1], ARRAY_SIZE(a) - 1, ptrcmp); \ 91 for (i = 1; i < ARRAY_SIZE(a); i++) \ 92 if (a[i] != a[i - 1]) { \ 94 bch2_pagecache_block_get(a[i]);\ 96 mutex_lock_nested(&a[i]->ei_update_lock, i);\ 105 bubble_sort(&a[1], ARRAY_SIZE(a) - 1, ptrcmp); \ 107 for (i = 1; i < ARRAY_SIZE(a); i++) \ 108 if (a[i] != a[i - 1]) { \ 110 bch2_pagecache_block_put(a[i]);\ [all …]
|
| A D | disk_accounting.c | 106 struct bkey_i_accounting *a; in bch2_disk_accounting_mod() local 110 a = (void *) bkey_next(&a->k_i)) in bch2_disk_accounting_mod() 111 if (bpos_eq(a->k.p, pos)) { in bch2_disk_accounting_mod() 113 acc_u64s(a->v.d, d, nr); in bch2_disk_accounting_mod() 116 unsigned offset = (u64 *) a - in bch2_disk_accounting_mod() 119 trans->accounting.u64s -= a->k.u64s; in bch2_disk_accounting_mod() 120 memmove_u64s_down(a, in bch2_disk_accounting_mod() 121 bkey_next(&a->k_i), in bch2_disk_accounting_mod() 129 int ret = PTR_ERR_OR_ZERO(a); in bch2_disk_accounting_mod() 359 .pos = a.k->p, in __bch2_accounting_mem_insert() [all …]
|
| /fs/f2fs/ |
| A D | sysfs.c | 412 ui = (unsigned int *)(ptr + a->offset); in f2fs_sbi_show() 880 a->struct_type == GC_THREAD); in f2fs_sbi_store() 886 ret = __sbi_store(a, sbi, buf, count); in f2fs_sbi_store() 900 return a->show ? a->show(a, sbi, buf) : 0; in f2fs_attr_show() 910 return a->store ? a->store(a, sbi, buf, len) : 0; in f2fs_attr_store() 926 return a->show ? a->show(a, buf) : 0; in f2fs_base_attr_show() 936 return a->store ? a->store(a, buf, len) : 0; in f2fs_base_attr_store() 1004 if (F2FS_HAS_FEATURE(sbi, a->id)) in f2fs_sb_feature_show() 1531 return a->show ? a->show(a, sbi, buf) : 0; in f2fs_stat_attr_show() 1541 return a->store ? a->store(a, sbi, buf, len) : 0; in f2fs_stat_attr_store() [all …]
|
| /fs/hpfs/ |
| A D | name.c | 23 static inline unsigned char upcase(unsigned char *dir, unsigned char a) in upcase() argument 25 if (a<128 || a==255) return a>='a' && a<='z' ? a - 0x20 : a; in upcase() 26 if (!dir) return a; in upcase() 27 return dir[a-128]; in upcase() 30 unsigned char hpfs_upcase(unsigned char *dir, unsigned char a) in hpfs_upcase() argument 32 return upcase(dir, a); in hpfs_upcase() 35 static inline unsigned char locase(unsigned char *dir, unsigned char a) in locase() argument 37 if (a<128 || a==255) return a>='A' && a<='Z' ? a + 0x20 : a; in locase() 38 if (!dir) return a; in locase() 39 return dir[a]; in locase()
|
| A D | ea.c | 23 ano ? "anode" : "sectors", a, len); in hpfs_ea_ext_remove() 30 ano ? "anode" : "sectors", a, pos); in hpfs_ea_ext_remove() 46 hpfs_free_sectors(s, a, 1); in hpfs_ea_ext_remove() 69 hpfs_ea_write(s, a, ano, 0, size, data); in set_indirect_ea() 79 secno a; in hpfs_read_ea() local 93 a = le32_to_cpu(fnode->ea_secno); in hpfs_read_ea() 101 ano ? "anode" : "sectors", a, len); in hpfs_read_ea() 135 secno a; in hpfs_get_ea() local 150 a = le32_to_cpu(fnode->ea_secno); in hpfs_get_ea() 197 secno a; in hpfs_set_ea() local [all …]
|
| A D | anode.c | 18 anode_secno a = -1; in hpfs_bplus_lookup() local 27 a = le32_to_cpu(btree->u.internal[i].down); in hpfs_bplus_lookup() 52 return a; in hpfs_bplus_lookup() 66 anode_secno a, na = -1, ra, up = -1; in hpfs_add_sector_to_btree() local 79 a = node; in hpfs_add_sector_to_btree() 131 if (a == node && fnod) { in hpfs_add_sector_to_btree() 201 a = na; in hpfs_add_sector_to_btree() 218 } else na = a; in hpfs_add_sector_to_btree() 349 } else sec = a + (pos >> 9); in hpfs_ea_read() 372 } else sec = a + (pos >> 9); in hpfs_ea_write() [all …]
|
| /fs/ext4/ |
| A D | hash.c | 44 #define ROUND(f, a, b, c, d, x, s) \ argument 45 (a += f(b, c, d) + x, a = rol32(a, s)) 58 ROUND(F, a, b, c, d, in[0] + K1, 3); in half_md4_transform() 59 ROUND(F, d, a, b, c, in[1] + K1, 7); in half_md4_transform() 60 ROUND(F, c, d, a, b, in[2] + K1, 11); in half_md4_transform() 61 ROUND(F, b, c, d, a, in[3] + K1, 19); in half_md4_transform() 62 ROUND(F, a, b, c, d, in[4] + K1, 3); in half_md4_transform() 63 ROUND(F, d, a, b, c, in[5] + K1, 7); in half_md4_transform() 64 ROUND(F, c, d, a, b, in[6] + K1, 11); in half_md4_transform() 65 ROUND(F, b, c, d, a, in[7] + K1, 19); in half_md4_transform() [all …]
|
| A D | sysfs.c | 361 switch (a->attr_ptr) { in calc_ptr() 363 return a->u.explicit_ptr; in calc_ptr() 365 return (void *) (((char *) sbi) + a->u.offset); in calc_ptr() 384 void *ptr = calc_ptr(a, sbi); in ext4_generic_attr_show() 389 switch (a->attr_id) { in ext4_generic_attr_show() 395 if (a->attr_ptr == ptr_ext4_super_block_offset) in ext4_generic_attr_show() 421 switch (a->attr_id) { in ext4_attr_show() 447 return ext4_generic_attr_show(a, sbi, buf); in ext4_attr_show() 458 void *ptr = calc_ptr(a, sbi); in ext4_generic_attr_store() 463 switch (a->attr_id) { in ext4_generic_attr_store() [all …]
|
| /fs/jfs/ |
| A D | jfs_extent.c | 21 #define DPD(a) (printk("(a): %d\n",(a))) argument 22 #define DPC(a) (printk("(a): %c\n",(a))) argument 25 if ((a) >> 32) \ 30 #define DPL(a) \ argument 38 #define DPD1(a) (printk("(a): %d ",(a))) argument 39 #define DPX(a) (printk("(a): %08x\n",(a))) argument 40 #define DPX1(a) (printk("(a): %08x ",(a))) argument 41 #define DPS(a) (printk("%s\n",(a))) argument 42 #define DPE(a) (printk("\nENTERING: %s\n",(a))) argument 43 #define DPE1(a) (printk("\nENTERING: %s",(a))) argument [all …]
|
| /fs/jffs2/ |
| A D | summary.h | 196 #define jffs2_sum_init(a) (0) argument 197 #define jffs2_sum_exit(a) do { } while (0) argument 198 #define jffs2_sum_disable_collecting(a) argument 199 #define jffs2_sum_is_disabled(a) (0) argument 200 #define jffs2_sum_reset_collected(a) do { } while (0) argument 201 #define jffs2_sum_add_kvec(a,b,c,d) (0) argument 202 #define jffs2_sum_move_collected(a,b) do { } while (0) argument 203 #define jffs2_sum_write_sumnode(a) (0) argument 204 #define jffs2_sum_add_padding_mem(a,b) do { } while (0) argument 208 #define jffs2_sum_add_xref_mem(a,b,c) do { } while (0) argument [all …]
|
| /fs/pstore/ |
| A D | Kconfig | 9 a platform level driver that registers with pstore to 11 (or "M") to a platform specific persistent store driver 13 If you don't have a platform persistent store driver, 49 When the option is enabled, pstore will export a character 64 was last called before a reset or panic. 69 tristate "Log panic/oops to a RAM buffer" 92 tristate "Log panic/oops to a block device" 127 to a partition with a known unique id. 129 a colon. 164 in KB and must be a multiple of 4. [all …]
|
| /fs/cramfs/ |
| A D | Kconfig | 7 System). CramFs is designed to be a simple, small, and compressed 15 To compile this as a module, choose M here: the module will be called 17 directory /) cannot be compiled as a module. 22 consider a more capable compressed filesystem such as SquashFS 28 bool "Support CramFs image over a regular block device" if EXPERT 32 This option allows the CramFs driver to load data from a regular 33 block device such a disk partition or a ramdisk. 41 a linear addressed memory range (usually non-volatile memory 46 The location of the CramFs image is determined by a 48 the 'physmap' map driver or a resulting MTD partition.
|
| /fs/proc/ |
| A D | consoles.c | 31 unsigned int a; in show_console_dev() local 53 for (a = 0; a < ARRAY_SIZE(con_flags); a++) in show_console_dev() 54 flags[a] = (con->flags & con_flags[a].flag) ? in show_console_dev() 55 con_flags[a].name : ' '; in show_console_dev() 56 flags[a] = 0; in show_console_dev()
|
| /fs/btrfs/ |
| A D | sysfs.c | 192 struct kobj_attribute *a, in btrfs_feature_attr_store() argument 408 struct kobj_attribute *a, in supported_sectorsizes_show() argument 946 struct kobj_attribute *a, in btrfs_sinfo_dynamic_reclaim_show() argument 955 struct kobj_attribute *a, in btrfs_sinfo_dynamic_reclaim_store() argument 979 struct kobj_attribute *a, in btrfs_sinfo_periodic_reclaim_show() argument 988 struct kobj_attribute *a, in btrfs_sinfo_periodic_reclaim_store() argument 1080 struct kobj_attribute *a, in btrfs_label_store() argument 1161 struct kobj_attribute *a, in btrfs_commit_stats_store() argument 1512 struct kobj_attribute *a, in btrfs_bg_reclaim_threshold_store() argument 2408 struct kobj_attribute *a, in qgroup_mode_show() argument [all …]
|
| /fs/xfs/ |
| A D | Kconfig | 9 XFS is a high performance journaling filesystem which originated 38 xfs_info against a filesystem mountpoint and checking for a string 65 xfs_info against a filesystem mountpoint and checking for a string 83 a per user and/or a per group basis under XFS. XFS considers quota 110 which contain a realtime subvolume. The realtime subvolume is a 146 If you say Y here you will be able to check metadata on a 150 they can be dealt with in a controlled manner. 181 If you say Y here you will be able to repair metadata on a 205 are debugging a particular problem. 216 not useful unless you are debugging a particular problem. [all …]
|
| /fs/xfs/libxfs/ |
| A D | xfs_btree.h | 242 struct xfs_alloc_rec_incore a; member 451 #define XFS_EXTLEN_MIN(a,b) min_t(xfs_extlen_t, (a), (b)) argument 452 #define XFS_EXTLEN_MAX(a,b) max_t(xfs_extlen_t, (a), (b)) argument 453 #define XFS_AGBLOCK_MIN(a,b) min_t(xfs_agblock_t, (a), (b)) argument 454 #define XFS_AGBLOCK_MAX(a,b) max_t(xfs_agblock_t, (a), (b)) argument 455 #define XFS_FILEOFF_MIN(a,b) min_t(xfs_fileoff_t, (a), (b)) argument 456 #define XFS_FILEOFF_MAX(a,b) max_t(xfs_fileoff_t, (a), (b)) argument 457 #define XFS_FILBLKS_MIN(a,b) min_t(xfs_filblks_t, (a), (b)) argument 458 #define XFS_FILBLKS_MAX(a,b) max_t(xfs_filblks_t, (a), (b)) argument 523 const union xfs_btree_ptr *a,
|
| /fs/overlayfs/ |
| A D | Kconfig | 8 and a 'lower' filesystem. When a name exists in both filesystems, the 22 "redirect_dir=off" module option or on a filesystem instance basis 26 an overlay which has redirects on a kernel that doesn't support this 36 Disable this to get a possibly more secure configuration, but that 60 That is, mounting an overlay which has an inodes index on a kernel 85 That is, mounting an overlay which has a full index on a kernel 88 Most users should say N here and enable this feature on a case-by- 101 inodes to a unified address space. The mapped 64bit inode numbers 118 happen when a file is opened for WRITE operation. It is still 120 module option or on a filesystem instance basis with the [all …]
|
| /fs/affs/ |
| A D | Changes | 21 might leave a trashed file system with the 24 - When a file is truncated to a size that is not 25 a multiple of the blocksize, the rest of the 34 - fix for a possible bitmap corruption 112 - truncate() zeroes the unused remainder of a 118 - Added a few comments, fixed some typos (and 148 when it allocated a new block. 181 - Fixed a few typos. 193 causing a solid lock-up. 250 cache. If a file was extended by means of [all …]
|