Searched full:sufficient (Results 1 – 25 of 1380) sorted by relevance
12345678910>>...56
| /kernel/linux/linux-5.10/net/core/ |
| D | gen_stats.c | 56 * Returns 0 on success or -1 if the room in the socket buffer was not sufficient.
107 * Returns 0 on success or -1 if the room in the socket buffer was not sufficient.
204 * if the room in the socket buffer was not sufficient.
228 * if the room in the socket buffer was not sufficient.
250 * if the room in the socket buffer was not sufficient.
333 * if the room in the socket buffer was not sufficient.
371 * if the room in the socket buffer was not sufficient.
407 * if the room in the socket buffer was not sufficient.
|
| /kernel/linux/linux-4.19/net/core/ |
| D | gen_stats.c | 60 * Returns 0 on success or -1 if the room in the socket buffer was not sufficient.
111 * Returns 0 on success or -1 if the room in the socket buffer was not sufficient.
176 * if the room in the socket buffer was not sufficient.
215 * if the room in the socket buffer was not sufficient.
296 * if the room in the socket buffer was not sufficient.
334 * if the room in the socket buffer was not sufficient.
370 * if the room in the socket buffer was not sufficient.
|
| /kernel/linux/linux-4.19/tools/memory-model/litmus-tests/ |
| D | README | 24 sufficient to cause two different reading processes to agree on
139 spin_lock() sufficient to make ordering apparent to accesses
147 Is the ordering provided by a release-acquire chain sufficient
|
| D | MP+pooncerelease+poacquireonce.litmus | 7 * smp_load_acquire() provide sufficient ordering for the message-passing
|
| D | MP+fencewmbonceonce+fencermbonceonce.litmus | 7 * sufficient ordering for the message-passing pattern. However, it
|
| D | IRIW+fencembonceonces+OnceOnce.litmus | 7 * between each pairs of reads. In other words, is smp_mb() sufficient to
|
| /kernel/linux/linux-5.10/tools/include/linux/ |
| D | ring_buffer.h | 34 * For B a WMB is sufficient since it separates two WRITEs,
35 * and for C an RMB is sufficient since it separates two READs.
|
| /kernel/linux/linux-4.19/sound/pci/ctxfi/ |
| D | ctresource.c | 32 /* Check whether there are sufficient resources to meet request. */ in get_resource()
41 break; /* found sufficient contiguous resources */ in get_resource()
45 /* Can not find sufficient contiguous resources */ in get_resource()
|
| /kernel/linux/linux-5.10/sound/pci/ctxfi/ |
| D | ctresource.c | 28 /* Check whether there are sufficient resources to meet request. */ in get_resource()
37 break; /* found sufficient contiguous resources */ in get_resource()
41 /* Can not find sufficient contiguous resources */ in get_resource()
|
| /kernel/linux/linux-5.10/fs/jfs/ |
| D | jfs_dmap.c | 753 * AG with sufficient free space. in dbAlloc()
1223 * check the next four contiguous leaves for sufficient free
1224 * space. if sufficient free space is found, we'll allocate
1264 /* examine the leaves for sufficient free space. in dbAllocNear()
1267 /* does the leaf describe sufficient free space ? in dbAllocNear()
1317 * sufficient free space. if sufficient free space is found,
1323 * sufficient free space and we allocate at this dmap.
1423 * the allocation group, looking for sufficient free space. to begin, in dbAllocAG()
1436 * subtrees for sufficient free space, starting with the leftmost in dbAllocAG()
1440 /* is there sufficient free space ? in dbAllocAG()
[all …]
|
| /kernel/linux/linux-5.10/tools/build/feature/ |
| D | test-libopencsd.c | 5 * Check OpenCSD library version is sufficient to provide required features
|
| /kernel/linux/linux-4.19/arch/m68k/ifpsp060/src/ |
| D | README-SRC | 11 are sufficient and were generated from these source files by
|
| /kernel/linux/linux-5.10/arch/m68k/ifpsp060/src/ |
| D | README-SRC | 11 are sufficient and were generated from these source files by
|
| /kernel/linux/linux-5.10/arch/riscv/include/asm/ |
| D | mmiowb.h | 7 * "o,w" is sufficient to ensure that all writes to the device have completed
|
| /kernel/linux/linux-5.10/Documentation/ABI/stable/ |
| D | o2cb | 9 Users: ocfs2-tools. It's sufficient to mail proposed changes to
|
| /kernel/linux/linux-4.19/Documentation/ABI/stable/ |
| D | o2cb | 9 Users: ocfs2-tools. It's sufficient to mail proposed changes to
|
| /kernel/linux/linux-4.19/Documentation/ABI/removed/ |
| D | o2cb | 9 Users: ocfs2-tools. It's sufficient to mail proposed changes to
|
| /kernel/linux/linux-5.10/tools/memory-model/litmus-tests/ |
| D | MP+pooncerelease+poacquireonce.litmus | 7 * smp_load_acquire() provide sufficient ordering for the message-passing
|
| D | README | 26 sufficient to cause two different reading processes to agree on
141 spin_lock() sufficient to make ordering apparent to accesses
149 Is the ordering provided by a release-acquire chain sufficient
|
| D | MP+fencewmbonceonce+fencermbonceonce.litmus | 7 * sufficient ordering for the message-passing pattern. However, it
|
| /kernel/linux/linux-5.10/Documentation/ABI/removed/ |
| D | o2cb | 9 Users: ocfs2-tools. It's sufficient to mail proposed changes to
|
| /kernel/linux/linux-4.19/fs/jfs/ |
| D | jfs_dmap.c | 766 * AG with sufficient free space. in dbAlloc()
1236 * check the next four contiguous leaves for sufficient free
1237 * space. if sufficient free space is found, we'll allocate
1277 /* examine the leaves for sufficient free space. in dbAllocNear()
1280 /* does the leaf describe sufficient free space ? in dbAllocNear()
1330 * sufficient free space. if sufficient free space is found,
1336 * sufficient free space and we allocate at this dmap.
1436 * the allocation group, looking for sufficient free space. to begin, in dbAllocAG()
1449 * subtrees for sufficient free space, starting with the leftmost in dbAllocAG()
1453 /* is there sufficient free space ? in dbAllocAG()
[all …]
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/sound/ |
| D | max98357a.txt | 16 It's observed that 5ms is sufficient.
|
| /kernel/linux/linux-4.19/drivers/target/iscsi/ |
| D | iscsi_target_auth.h | 13 #define MAX_RESPONSE_LENGTH 64 /* sufficient for MD5 */
|
| /kernel/linux/linux-4.19/Documentation/admin-guide/mm/ |
| D | hugetlbpage.rst | 127 allocating extra pages on other nodes with sufficient available contiguous
226 However, if a node in the policy does not contain sufficient contiguous
228 neighbor node with sufficient contiguous memory. To do this would cause
281 pages on the parent node will be adjusted to the specified value, if sufficient
|
12345678910>>...56