| /linux/scripts/gdb/linux/ |
| H A D | slab.py | 111 def loc_exist(loc_track, addr, handle, waste): argument
113 if loc['addr'] == addr and loc['handle'] == handle and loc['waste'] == waste:
121 waste = cache['object_size'] - int(orig_size)
128 loc = loc_exist(loc_track, addr, handle, waste)
148 'waste' : waste,
|
| /linux/fs/jffs2/ |
| H A D | nodemgmt.c | 412 uint32_t waste; in jffs2_do_reserve_space() local
440 waste = jeb->free_size; in jffs2_do_reserve_space()
442 (jeb->offset + c->sector_size - waste) | REF_OBSOLETE, in jffs2_do_reserve_space()
443 waste, NULL); in jffs2_do_reserve_space()
445 jeb->dirty_size -= waste; in jffs2_do_reserve_space()
446 c->dirty_size -= waste; in jffs2_do_reserve_space()
447 jeb->wasted_size += waste; in jffs2_do_reserve_space()
448 c->wasted_size += waste; in jffs2_do_reserve_space()
|
| /linux/drivers/net/ethernet/qlogic/qed/ |
| H A D | qed_cxt.h | 26 u32 waste; member
|
| /linux/Documentation/maintainer/ |
| H A D | modifying-patches.rst | 10 to rediff, but this is a totally counter-productive waste of time and energy.
|
| /linux/Documentation/usb/ |
| H A D | ehci.rst | 24 high speed "split transactions" that don't waste transfer bandwidth.
207 going to waste more than half the USB 2.0 bandwidth. Delays between the
210 sequence of 128 KB chunks would waste a lot less.
|
| /linux/Documentation/block/ |
| H A D | deadline-iosched.rst | 65 may even know that it is a waste of time to spend any time attempting to
|
| /linux/Documentation/sound/soc/ |
| H A D | overview.rst | 22 recording) audio. This is fine for a PC, but tends to waste a lot of
|
| /linux/arch/sparc/kernel/ |
| H A D | wof.S | 123 WRITE_PAUSE ! waste some time
|
| /linux/Documentation/process/ |
| H A D | coding-assistants.rst | 72 waste too much time analyzing unverified reports and untested fixes.
|
| H A D | 3.Early-stage.rst | 46 to communicate user requirements to these people is a waste of
|
| H A D | management-style.rst | 77 fairly easy to backtrack. Since you're not going to be able to waste
|
| /linux/mm/ |
| H A D | zsmalloc.c | 2118 int waste; in zs_compact()
2120 waste = (i * PAGE_SIZE) % class_size; in zs_compact()
2121 if (waste < min_waste) { in zs_compact()
2122 min_waste = waste; in zs_compact()
2207 int waste; calculate_zspage_chain_size() local
|
| H A D | slub.c | 7709 * we try to keep the page order as low as possible. So we accept more waste in init_percpu_sheaves()
7774 * We start with accepting at most 1/16 waste and try to find the in early_kmem_cache_node_alloc()
7777 * the order can only result in same or less fractional waste, not more. in early_kmem_cache_node_alloc()
7779 * If that fails, we increase the acceptable fraction of waste and try in early_kmem_cache_node_alloc()
7781 * accept any waste and give us the order determined by min_objects, as in early_kmem_cache_node_alloc()
9045 unsigned long waste; in add_location()
9100 unsigned int waste = s->object_size - orig_size; in show_slab_objects()
9121 cwaste = l->waste; in show_slab_objects()
9123 (waste == cwaste)) { in show_slab_objects()
9150 waste < cwast in show_slab_objects()
8923 unsigned long waste; global() member
8978 unsigned int waste = s->object_size - orig_size; add_location() local
[all...] |
| /linux/Documentation/staging/ |
| H A D | xz.rst | 63 Double checking the integrity would probably be waste of CPU cycles.
|
| /linux/Documentation/accounting/ |
| H A D | psi.rst | 50 actual CPU cycles are going to waste, and a workload that spends
|
| /linux/kernel/dma/ |
| H A D | Kconfig | 268 for larger buffers it just a memory waste. With this parameter you can
|
| /linux/drivers/mtd/chips/ |
| H A D | Kconfig | 178 in the programming of OTP bits will waste them.
|
| /linux/Documentation/fb/ |
| H A D | modedb.rst | 7 which is a mess and a waste of resources. The main idea of modedb is to have
|
| /linux/Documentation/admin-guide/ |
| H A D | bug-bisect.rst | 16 situations early where a bisection would be a waste of time, as nobody would
|
| H A D | sysfs-rules.rst | 32 Parsing ``/proc/mounts`` is a waste of time. Other mount points are a
|
| /linux/Documentation/arch/sh/ |
| H A D | new-machine.rst | 234 list. The method for doing this is self explanatory, and so we won't waste
|
| /linux/Documentation/admin-guide/media/ |
| H A D | philips.rst | 83 something more than 4 is an absolute waste. This memory is only
|
| /linux/Documentation/arch/x86/ |
| H A D | cpuinfo.rst | 105 has only one feature and would waste 31 bits of space in the x86_capability[]
|
| /linux/Documentation/trace/ |
| H A D | eprobetrace.rst | 107 of the tasks are of interest, why waste the ring buffer with all the other
|
| /linux/Documentation/admin-guide/device-mapper/ |
| H A D | cache.rst | 74 So large block sizes are bad because they waste cache space. And small
|