HomeSort by: relevance | last modified time | path
    Searched defs:min_x (Results 1 - 6 of 6) sorted by relevancy

  /src/common/lib/libc/gen/
rpst.c 376 rpst_iterate_first(struct rpst_tree *t, uint64_t max_y, uint64_t min_x,
381 KASSERT(min_x <= max_x);
386 if (rpst_height2max(t->t_height) < min_x) {
391 it->it_idx = (min_x & rpst_startmask(t)) != 0;
394 it->it_min_x = min_x;
418 rpst_minidx(const struct rpst_node *n, uint64_t min_x, uint64_t mask)
421 if (rpst_node_on_edge_p(n, min_x, mask)) {
422 return (min_x & mask) != 0;
435 const uint64_t min_x = it->it_min_x; local
451 KASSERT(idx >= rpst_minidx(n, min_x, mask))
614 uint64_t min_x = UINT64_MAX; local
    [all...]
  /src/external/lgpl3/mpfr/dist/tune/
bidimensional_sample.c 43 /* x-window: [min_x, max_x] or [2^min_x, 2^max_x] */
44 /* or [-2^(max_x), -2^(min_x)] U [2^min_x, 2^max_x] */
46 double min_x; member in struct:speed_params2D
144 /* nb_points_x points are equally distributed between min_x and max_x */
146 /* nb_points_x points are sampled from 2^(min_x) to 2^(max_x). At */
149 /* nb_points_x/2 points are sampled from -2^(max_x) to -2^(min_x) */
151 /* nb_points_x/2 points are sampled from 2^(min_x) to 2^(max_x) */
157 (param.max_x - param.min_x)/(double)param.nb_points_x
    [all...]
tuneup.c 318 double x, min_x; local
326 min_x = x;
331 if (x < min_x)
333 min_x = x;
  /src/external/bsd/openldap/dist/libraries/libldap/
tpool.c 381 int min_x = 0, cnt; local
385 min_x = i;
391 min_x = i;
394 i = min_x;
  /src/external/lgpl3/gmp/dist/tune/
tuneup.c 348 double x, min_x; local
365 min_x = x;
377 if (x < min_x)
379 min_x = x;
  /src/external/mit/xorg/lib/libxcb/files/
xinput.h 1743 int32_t min_x; member in struct:xcb_input_device_abs_calib_state_t
1835 int32_t min_x; member in struct:xcb_input_device_state_data_t::__anon23906
1943 int32_t min_x; member in struct:xcb_input_device_abs_calib_ctl_t
2034 int32_t min_x; member in struct:xcb_input_device_ctl_data_t::__anon23911

Completed in 36 milliseconds