| /linux/Documentation/fb/ |
| H A D | udlfb.rst | 23 setting is very flexible - able to set nearly arbitrary modes from any timing.
27 * Ability to add a nearly arbitrary number of displays to any USB 2.0
34 * The actual hardware functionality of DisplayLink chips matches nearly
|
| /linux/fs/xfs/libxfs/ |
| H A D | xfs_zones.h | 10 * making sure that we have enough space to relocate a nearly-full zone.
|
| H A D | xfs_log_recover.h | 151 * to avoid livelocks if the log grant space is nearly exhausted due to the
|
| /linux/drivers/crypto/intel/qat/qat_common/ |
| H A D | qat_algs_send.c | 53 /* Check if ring is nearly full */ in qat_alg_try_enqueue()
|
| /linux/Documentation/maintainer/ |
| H A D | rebasing-and-merging.rst | 18 merges would be nearly impossible. Some problems encountered by
98 development cycle included 1,126 merge commits - nearly 9% of the total.
|
| /linux/include/linux/soc/ixp4xx/ |
| H A D | qmgr.h | 48 u32 statne_h; /* 0x418 - queue nearly empty */
|
| /linux/Documentation/devicetree/bindings/i2c/ |
| H A D | i2c-rk3x.yaml | 106 value since they are the same in nearly all cases.
|
| /linux/arch/powerpc/sysdev/ |
| H A D | ipic.c | 551 * for nearly all cases. */ in ipic_mask_irq()
570 * for nearly all cases. */ in ipic_ack_irq()
593 * for nearly all cases. */ in ipic_mask_irq_and_ack()
|
| /linux/Documentation/userspace-api/media/v4l/ |
| H A D | dev-capture.rst | 11 digitized images in memory. Today nearly all devices can capture at full
|
| /linux/drivers/mtd/ubi/ |
| H A D | Kconfig | 68 in nearly constant time. Instead of scanning the whole MTD device it
|
| /linux/arch/nios2/mm/ |
| H A D | ioremap.c | 172 * iounmap unmaps nearly everything, so be careful
|
| /linux/Documentation/devicetree/bindings/clock/ |
| H A D | baikal,bt1-ccu-pll.yaml | 50 biggest system interfaces in fact include nearly all of the rest SoC
|
| /linux/drivers/net/ethernet/8390/ |
| H A D | Kconfig | 26 nearly NE2000 compatible but need a separate driver due to a few
|
| /linux/drivers/mfd/ |
| H A D | tps65090.c | 134 /* Nearly all registers have status bits mixed in, except a few */ in is_volatile_reg()
|
| /linux/fs/ceph/ |
| H A D | file.c | 2551 loff_t nearly = round_up(offset, PAGE_SIZE); in ceph_zero_pagecache_range() local
2552 if (offset < nearly) { in ceph_zero_pagecache_range()
2553 loff_t size = nearly - offset; in ceph_zero_pagecache_range()
2620 u64 nearly, t; in ceph_zero_objects() local
2623 nearly = offset + object_set_size - 1; in ceph_zero_objects()
2624 t = nearly; in ceph_zero_objects()
2625 nearly -= do_div(t, object_set_size); in ceph_zero_objects()
2627 while (length && offset < nearly) { in ceph_zero_objects()
|
| /linux/Documentation/admin-guide/ |
| H A D | ldm.rst | 15 nearly 2000.
|
| /linux/Documentation/scsi/ |
| H A D | scsi-changer.rst | 30 changers. But it allows to handle nearly all possible cases. It knows
|
| /linux/sound/firewire/fireworks/ |
| H A D | fireworks_hwdep.c | 84 * All of tasks can read from the buffer nearly simultaneously, but the in hwdep_read_resp_buf()
|
| /linux/Documentation/arch/x86/ |
| H A D | pti.rst | 74 entry. This consumes nearly 2MB of RAM once the kernel
|
| /linux/tools/perf/pmu-events/arch/x86/silvermont/ |
| H A D | cache.json | 7 …nearly full w condition which likely indicates back pressure from L2Q. It also counts requests th…
|
| /linux/arch/m68k/mm/ |
| H A D | kmap.c | 55 * __free_io_area unmaps nearly everything, so be careful
|
| /linux/Documentation/driver-api/ |
| H A D | edac.rst | 118 are nearly indistinguishable from on-chip integrated RAM.
|
| /linux/arch/xtensa/lib/ |
| H A D | checksum.S | 189 alignments work, but not nearly as efficiently.
|
| /linux/Documentation/admin-guide/laptops/ |
| H A D | thinkpad-acpi.rst | 567 the battery is nearly empty
569 the battery is nearly empty
589 Battery nearly empty alarms are a last resort attempt to get the
791 buses are still active), or mask an important alarm (such as a nearly
|
| /linux/drivers/md/dm-vdo/ |
| H A D | memory-alloc.c | 60 * error if we have not freed all the memory that we allocated. Nearly all memory allocation and
|