Lines Matching refs:s_inv
355 long s_inv; /* Inverse: i_inv(i) = */
356 /* {pc00, pc00+1, ... pc00+s_inv-1}. */
565 * Also, the N-to-one value, s_inv, such that
567 * i(pc_l + K * s_inv + d) = K, for 0 <= d < s_inv
576 * NB s_inv, as actually computed, is not sufficiently accurate
580 * the code when 's_inv' is mentioned. dween
608 s_inv = pc_m/n_pc; /* Range of PCs mapped into one index. */
615 "sf = %d, s_inv = %d bias = %d\n",
616 (long)sf, s_inv, bias);
752 * ticks for values of pc in the range pc, pc+1, ..., pc+s_inv-1
758 * any given address in the range is pcounts[i]/s_inv.
771 * that 0 < k < s_inv-1, the addresses pc, pc+1, ..., pc+k-1 are in
772 * the lower partition, and the addresses pc+k, pc+k+1, ..., pc+s_inv-1
773 * are in the next partition, then k*pcounts[i]/s_inv time is charged
774 * to the lower partition, and (s_inv-k) * pcounts[i]/s_inv time to the