minimum
if (subtree->minimum || subtree->maximum) {
if (subtree->minimum || subtree->maximum) {
.offset = offsetof(GENERAL_SUBTREE, minimum),
if (sub->minimum || sub->maximum)
if (sub->minimum || sub->maximum)
ASN1_INTEGER *minimum;
m = minimum(datlen, KEYSZ + IVSZ);
m = minimum(n, rs->rs_have);
softc->min_blk = scsi_2btoul(rblim->minimum);
u_int8_t minimum[2];
query->minimum = 0;
query->minimum = 0;
query->minimum = 0;
uint16_t *minimum, uint16_t *uv_minimum)
minimum[plane_id] = skl_ddb_min_alloc(pstate, 0);
minimum[PLANE_CURSOR] = skl_cursor_allocation(num_active);
uint16_t minimum[I915_MAX_PLANES] = {};
skl_ddb_calc_min(cstate, num_active, minimum, uv_minimum);
total_min_blocks += minimum[plane_id];
ddb->plane[pipe][PLANE_CURSOR].start = alloc->end - minimum[PLANE_CURSOR];
plane_blocks = minimum[plane_id];
evdev_support_abs(struct evdev_dev *evdev, uint16_t code, int32_t minimum,
.minimum = minimum,
ai->minimum,
evdev->ev_absinfo[evdev_mtstmap[i].mt].minimum,
int32_t minimum;
options[i].minimum, options[i].maximum); break
long long minimum; /* minimum for value */
.minimum = _min, \