powerof2
if (!powerof2(newlen)) {
if (phdp->p_align > 1 && !powerof2(phdp->p_align)) {
if (phdp->p_align > 1 && !powerof2(phdp->p_align)) {
if (boot->SecPerClust == 0 || !powerof2(boot->SecPerClust)) {
if (val == 0 || !powerof2(val))
if (!powerof2(bsize)) {
if (!powerof2(fsize)) {
if (!powerof2(sectorsize))
if (!powerof2(bpb.bps))
if (!powerof2(opt_b))
if (!powerof2(opt_c))
powerof2((len)) && /* ... and power of two */ \
int powerof2;
powerof2 = ((x - 1) & x) == 0;
mask = (x << (1 - powerof2)) - 1;
KASSERT(powerof2(num));
powerof2((len)) && /* ... and power of two */ \
if (desc->mr_len < 131072 || !powerof2(desc->mr_len))
while (powerof2(sg_prefetch_align) == 0)
return (powerof2(i) ? i : (1 << (fls(i) - 1)));
return (powerof2(i) ? i : (1 << (fls(i) - 1)));
KASSERT(powerof2(sc->sc_nqueues));
KASSERT(powerof2(sc->sc_nqueues));
KASSERT(powerof2(nqueues));
return powerof2(n);
KASSERT(powerof2(nqueues));
KASSERT(powerof2(nqueues));
if (!powerof2(sc->sc_xr_size))
if (!powerof2(sc->sc_xr_ndesc))
if (!powerof2(sc->sc_align) || sc->sc_align == 0 ||
if (!powerof2(sc->sc_ndp_div) || sc->sc_ndp_div == 0 ||
if ((ph[i].p_align > 1) && !powerof2(ph[i].p_align)) {
if ((pp->p_align > 1) && !powerof2(pp->p_align)) {
!powerof2(stackgap) || stackgap >= MAXSSIZ)
KASSERT(powerof2(align));
KASSERT(boundary == 0 || powerof2(boundary));
if (!powerof2(bpb.bps)) {
if (!powerof2(o.block_size)) {
if (!powerof2(o.sectors_per_cluster)) {