Home
last modified time | relevance | path

Searched refs:enough (Results 1 - 25 of 37) sorted by relevance

12

/kernel/linux/linux-5.10/drivers/mtd/ubi/
H A Dfastmap-wl.c101 * has_enough_free_count - whether ubi has enough free pebs to fill fm pools
105 * This helper function checks whether there are enough free pebs (deducted
109 * handling, because there maybe no enough free pebs for user volumes after
136 int enough; in ubi_refill_pools() local
160 enough = 0; in ubi_refill_pools()
172 enough++; in ubi_refill_pools()
186 enough++; in ubi_refill_pools()
188 if (enough == 2) in ubi_refill_pools()
/kernel/linux/linux-6.6/drivers/mtd/ubi/
H A Dfastmap-wl.c101 * has_enough_free_count - whether ubi has enough free pebs to fill fm pools
105 * This helper function checks whether there are enough free pebs (deducted
109 * handling, because there maybe no enough free pebs for user volumes after
136 int enough; in ubi_refill_pools() local
160 enough = 0; in ubi_refill_pools()
172 enough++; in ubi_refill_pools()
186 enough++; in ubi_refill_pools()
188 if (enough == 2) in ubi_refill_pools()
/kernel/linux/linux-5.10/arch/arm/boot/compressed/
H A Dhead-xscale.S23 add r3, r2, #0x10000 @ 64 kb is quite enough...
/kernel/linux/linux-6.6/arch/arm/boot/compressed/
H A Dhead-sa1100.S33 add r3, r2, #0x4000 @ 16 kb is quite enough...
H A Dhead-xscale.S23 add r3, r2, #0x10000 @ 64 kb is quite enough...
/kernel/linux/linux-5.10/drivers/md/bcache/
H A Dwriteback.h40 atomic_t enough; member
H A Dwriteback.c883 atomic_set(&state->enough, 1); in bch_dirty_init_thread()
884 /* Update state->enough earlier */ in bch_dirty_init_thread()
963 atomic_set(&state.enough, 0); in bch_sectors_dirty_init()
967 /* Fetch latest state.enough earlier */ in bch_sectors_dirty_init()
969 if (atomic_read(&state.enough)) in bch_sectors_dirty_init()
H A Dbtree.h236 atomic_t enough; member
H A Dbtree.c1963 * current checking threads are enough, in bch_btree_check_thread()
1966 atomic_set(&check_state->enough, 1); in bch_btree_check_thread()
1967 /* Update check_state->enough earlier */ in bch_btree_check_thread()
2046 atomic_set(&check_state.enough, 0); in bch_btree_check()
2052 * if check_state.enough is non-zero, it means current in bch_btree_check()
2053 * running check threads are enough, unncessary to create in bch_btree_check()
2057 /* fetch latest check_state.enough earlier */ in bch_btree_check()
2059 if (atomic_read(&check_state.enough)) in bch_btree_check()
/kernel/linux/linux-6.6/drivers/md/bcache/
H A Dwriteback.h44 atomic_t enough; member
H A Dwriteback.c939 atomic_set(&state->enough, 1); in bch_dirty_init_thread()
940 /* Update state->enough earlier */ in bch_dirty_init_thread()
1019 atomic_set(&state.enough, 0); in bch_sectors_dirty_init()
1023 /* Fetch latest state.enough earlier */ in bch_sectors_dirty_init()
1025 if (atomic_read(&state.enough)) in bch_sectors_dirty_init()
H A Dbtree.h236 atomic_t enough; member
H A Dbtree.c1984 * current checking threads are enough, in bch_btree_check_thread()
1987 atomic_set(&check_state->enough, 1); in bch_btree_check_thread()
1988 /* Update check_state->enough earlier */ in bch_btree_check_thread()
2067 atomic_set(&check_state.enough, 0); in bch_btree_check()
2073 * if check_state.enough is non-zero, it means current in bch_btree_check()
2074 * running check threads are enough, unncessary to create in bch_btree_check()
2078 /* fetch latest check_state.enough earlier */ in bch_btree_check()
2080 if (atomic_read(&check_state.enough)) in bch_btree_check()
/kernel/linux/linux-5.10/arch/sparc/lib/
H A DM7memset.S182 cmp %o4, %g1 ! check there are enough bytes to set
252 cmp %o4, MIN_ZERO ! check if enough bytes to set
/kernel/linux/linux-6.6/arch/sparc/lib/
H A DM7memset.S182 cmp %o4, %g1 ! check there are enough bytes to set
252 cmp %o4, MIN_ZERO ! check if enough bytes to set
/kernel/linux/linux-5.10/arch/alpha/lib/
H A Dev6-copy_user.S159 subq $4, 32, $3 # E .. .. .. : U U L L : is there enough for another trip?
/kernel/linux/linux-6.6/arch/alpha/lib/
H A Dev6-copy_user.S159 subq $4, 32, $3 # E .. .. .. : U U L L : is there enough for another trip?
/kernel/linux/linux-5.10/arch/arm/lib/
H A Ddiv64.S187 @ eq -> division by 1: obvious enough...
/kernel/linux/linux-6.6/arch/arm/lib/
H A Ddiv64.S187 @ eq -> division by 1: obvious enough...
/kernel/linux/linux-5.10/security/smack/
H A Dsmack_access.c632 * even having CAP_MAC_OVERRIDE isn't enough to grant
/kernel/linux/linux-6.6/security/smack/
H A Dsmack_access.c632 * even having CAP_MAC_OVERRIDE isn't enough to grant
/kernel/linux/linux-5.10/drivers/md/
H A Draid10.c70 static int enough(struct r10conf *conf, int ignore);
1259 && enough(conf, devnum)) in raid10_write_one_disk()
1582 /* check if there are enough drives for
1623 static int enough(struct r10conf *conf, int ignore) in enough() function
1625 /* when calling 'enough', both 'prev' and 'geo' must in enough()
1648 && !enough(conf, rdev->raid_disk)) { in raid10_error()
1853 enough(conf, -1)) { in raid10_remove_disk()
3434 * won't fail because the vec table is big enough in raid10_sync_request()
3839 if (!enough(conf, -1)) { in raid10_run()
3840 pr_err("md/raid10:%s: not enough operationa in raid10_run()
[all...]
/kernel/linux/linux-6.6/drivers/md/
H A Draid10.c70 static int enough(struct r10conf *conf, int ignore);
1304 && enough(conf, devnum)) in raid10_write_one_disk()
1965 /* check if there are enough drives for
2006 static int enough(struct r10conf *conf, int ignore) in enough() function
2008 /* when calling 'enough', both 'prev' and 'geo' must in enough()
2039 if (test_bit(In_sync, &rdev->flags) && !enough(conf, rdev->raid_disk)) { in raid10_error()
2245 enough(conf, -1)) { in raid10_remove_disk()
4228 if (!enough(conf, -1)) { in raid10_run()
4229 pr_err("md/raid10:%s: not enough operational mirrors.\n", in raid10_run()
4305 pr_warn("md/raid10: offset difference not enough t in raid10_run()
[all...]
/kernel/linux/linux-5.10/arch/x86/boot/
H A Dheader.S514 # All of which is enough to compute an amount of extra data that is required
/kernel/linux/linux-6.6/arch/x86/boot/
H A Dheader.S456 # All of which is enough to compute an amount of extra data that is required

Completed in 38 milliseconds

12