| /linux/include/linux/ |
| H A D | util_macros.h | 26 * find_closest - locate the closest element in a sorted array
28 * @a: The array in which to look for the closest element. Must be sorted
32 * Returns the index of the element closest to 'x'.
56 * find_closest_descending - locate the closest element in a sorted array
58 * @a: The array in which to look for the closest element. Must be sorted
|
| H A D | async.h | 84 * CPUs closest to the device.
105 * CPUs closest to the device.
|
| H A D | math64.h | 376 * and round to closest integer.
389 * and round to closest integer.
402 * and round to closest integer.
|
| /linux/drivers/input/keyboard/ |
| H A D | adc-keys.c | 36 u32 diff, closest = 0xffffffff; in adc_keys_poll() local
46 if (diff < closest) { in adc_keys_poll()
47 closest = diff; in adc_keys_poll()
53 if (abs(st->keyup_voltage - value) < closest) in adc_keys_poll()
|
| H A D | sun4i-lradc-keys.c | 111 u32 i, ints, val, voltage, diff, keycode = 0, closest = 0xffffffff; in sun4i_lradc_irq() local
131 if (diff < closest) { in sun4i_lradc_irq()
132 closest = diff; in sun4i_lradc_irq()
|
| /linux/drivers/staging/media/atomisp/pci/ |
| H A D | sh_css_param_shading.c | 119 /* calculate closest source points in shading table and in crop_and_interpolate()
131 /* calculate closest source points for distance computation */ in crop_and_interpolate()
150 /* calculate closest source points. */ in crop_and_interpolate()
158 /* if src points fall in padding, select closest ones.*/ in crop_and_interpolate()
164 * calculate closest source points for distance in crop_and_interpolate()
176 /* if we're at the edge, we just use the closest in crop_and_interpolate()
|
| /linux/drivers/cpuidle/governors/ |
| H A D | menu.c | 245 /* Determine the time till the closest timer. */ in menu_select()
267 * the known time till the closest timer event for the idle in menu_select()
275 * in this case, assume that without the tick the closest timer in menu_select()
276 * will be in distant future and that the closest tick will occur in menu_select()
350 * target residency matches the time till the closest timer in menu_select()
|
| H A D | teo.c | 23 * length in what follows, because the closest timer will ultimately wake up the
114 * the time till the closest expected timer event.
137 * @sleep_length_ns: Time till the closest timer event (at the selection time).
509 * If the closest expected timer is before the target residency of the in teo_select()
536 * the state to be returned is not within the time till the closest in teo_select()
|
| H A D | gov.h | 10 * check the time till the closest expected timer event.
|
| /linux/Documentation/userspace-api/media/v4l/ |
| H A D | vidioc-g-crop.rst | 51 rounds to the closest possible values of horizontal and vertical offset,
58 the closest size possible while maintaining the current horizontal and
|
| H A D | crop.rst | 138 The driver sets the image size to the closest possible values 304 × 224,
139 then chooses the cropping rectangle closest to the requested size, that
149 and adjusts the image size to closest possible 304 × 192.
|
| H A D | v4l2-selection-flags.rst | 35 closest possible rectangle.
|
| /linux/lib/ |
| H A D | linear_ranges.c | 131 * Return selector for which range value is closest match for given
212 * Return selector for which range value is closest match for given
250 * Return selector for which range value is closest match for given
|
| /linux/net/netfilter/ |
| H A D | nft_set_rbtree.c | 247 /* this element is closest to where the new element is to be inserted: in nft_rbtree_update_first()
325 /* Closest start element differs from last element added. */ in nft_rbtree_insert_same_interval()
487 /* - new start element with existing closest, less or equal key value in __nft_rbtree_insert()
504 /* - new end element with existing closest, less or equal key value in __nft_rbtree_insert()
511 /* - new end element with existing closest, greater or equal key value in __nft_rbtree_insert()
763 /* Closest start element differs from last element added. */ in nft_rbtree_deactivate()
|
| H A D | xt_time.c | 110 * Find the year that is closest to said days. in localtime_3()
127 * number of days-since-New Year have passed, and find the closest in localtime_3()
|
| /linux/arch/arm/boot/dts/intel/ixp/ |
| H A D | intel-ixp42x-freecom-fsg-3.dts | 40 /* Closest approximation of what the key should do */
53 /* Unplug USB, closest approximation of what the key should do */
|
| /linux/drivers/gpu/drm/ |
| H A D | drm_suballoc.c | 35 * If it's not the case we skip over the bo after last to the closest
244 /* go over all fence list and try to find the closest sa in drm_suballoc_next_hole()
274 /* this sa bo is the closest one */ in drm_suballoc_next_hole()
|
| /linux/Documentation/mm/ |
| H A D | numa.rst | 42 to the closest cell with memory.
123 closest available memory. This is a consequence of the same mechanism that
|
| /linux/Documentation/crypto/ |
| H A D | asymmetric-keys.rst | 373 certificate in order (starting closest to the root) to a keyring. For
388 # certificate closest to the root.
409 # certificate closest to the root.
|
| /linux/Documentation/ABI/testing/ |
| H A D | sysfs-bus-cxl | 596 the number to the closest initiator and access1 provides the
597 number to the closest CPU.
613 the number to the closest initiator and access1 provides the
614 number to the closest CPU.
|
| /linux/Documentation/hwmon/ |
| H A D | adc128d818.rst | 33 or maximum limit. Note that minimum in this case always means 'closest to
|
| H A D | lm80.rst | 61 or maximum limit. Note that minimum in this case always means 'closest to
|
| /linux/drivers/clk/at91/ |
| H A D | clk-pll.c | 171 * divider/multiplier pair (the one that generates the closest in clk_pll_get_best_div_mul()
181 * divider that provide the closest rate to the requested one. in clk_pll_get_best_div_mul()
|
| /linux/drivers/clk/versatile/ |
| H A D | clk-icst.c | 250 /* Slam to closest megahertz */ in icst_determine_rate()
263 /* Slam to closest 0.5 megahertz */ in icst_determine_rate()
277 /* Slam to closest 0.25 MHz */ in icst_determine_rate()
|
| /linux/Documentation/networking/ |
| H A D | vxlan.rst | 22 The management of vxlan is done in a manner similar to its two closest
|