Searched full:sufficient (Results 1 – 25 of 1631) sorted by relevance
12345678910>>...66
| /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-6.6/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.
257 * if the room in the socket buffer was not sufficient.
284 * if the room in the socket buffer was not sufficient.
305 * if the room in the socket buffer was not sufficient.
384 * if the room in the socket buffer was not sufficient.
423 * if the room in the socket buffer was not sufficient.
459 * if the room in the socket buffer was not sufficient.
|
| /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-6.6/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-6.6/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/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/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-6.6/arch/m68k/ifpsp060/src/ |
| D | README-SRC | 11 are sufficient and were generated from these source files by
|
| /kernel/linux/linux-6.6/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/arch/m68k/ifpsp060/src/ |
| D | README-SRC | 11 are sufficient and were generated from these source files by
|
| /kernel/linux/linux-6.6/Documentation/ABI/stable/ |
| D | o2cb | 9 Users: ocfs2-tools. It's sufficient to mail proposed changes to
|
| /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-6.6/tools/build/feature/ |
| D | test-libopencsd.c | 5 * Check OpenCSD library version is sufficient to provide required features
|
| /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-6.6/Documentation/ABI/obsolete/ |
| D | o2cb | 10 Users: ocfs2-tools. It's sufficient to mail proposed changes to
|
| /kernel/linux/linux-5.10/tools/memory-model/litmus-tests/ |
| 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+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
|
| /kernel/linux/linux-6.6/tools/memory-model/litmus-tests/ |
| D | README | 26 sufficient to cause two different reading processes to agree on
149 spin_lock() sufficient to make ordering apparent to accesses
157 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
|
| /kernel/linux/linux-6.6/Documentation/ABI/removed/ |
| D | o2cb | 9 Users: ocfs2-tools. It's sufficient to mail proposed changes to
|
| /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-6.6/fs/jfs/ |
| D | jfs_dmap.c | 780 * AG with sufficient free space. in dbAlloc()
1182 * check the next four contiguous leaves for sufficient free
1183 * space. if sufficient free space is found, we'll allocate
1223 /* examine the leaves for sufficient free space. in dbAllocNear()
1226 /* does the leaf describe sufficient free space ? in dbAllocNear()
1276 * sufficient free space. if sufficient free space is found,
1282 * sufficient free space and we allocate at this dmap.
1382 * the allocation group, looking for sufficient free space. to begin, in dbAllocAG()
1395 * subtrees for sufficient free space, starting with the leftmost in dbAllocAG()
1399 /* is there sufficient free space ? in dbAllocAG()
[all …]
|
| /kernel/linux/linux-5.10/fs/jfs/ |
| D | jfs_dmap.c | 791 * AG with sufficient free space. in dbAlloc()
1261 * check the next four contiguous leaves for sufficient free
1262 * space. if sufficient free space is found, we'll allocate
1302 /* examine the leaves for sufficient free space. in dbAllocNear()
1305 /* does the leaf describe sufficient free space ? in dbAllocNear()
1355 * sufficient free space. if sufficient free space is found,
1361 * sufficient free space and we allocate at this dmap.
1461 * the allocation group, looking for sufficient free space. to begin, in dbAllocAG()
1474 * subtrees for sufficient free space, starting with the leftmost in dbAllocAG()
1478 /* is there sufficient free space ? in dbAllocAG()
[all …]
|
12345678910>>...66