Lines Matching defs:pass
32 * Two-pass algorithm: in the first pass, we determine whether the
33 * value fits; in the second pass, we do the actual write.
35 * During the first pass, 'r' contains the comparison result so
45 * During the second pass, 'r' is either 0xFFFFFFFF (value fits)
56 int pass;
67 for (pass = 0; pass < 2; pass ++) {
92 if (pass) {
101 if (!pass) {
110 * When we reach this point at the end of the first pass:
114 * When we reach this point at the end of the second pass: