Lines Matching defs:SPE
153 * the "8"-valued bit, and so on.) In fact, a combined "SPE"-box lookup is
156 * iteration. Two 32-bit wide tables, SPE[0] and SPE[1], are used for this
158 * lookup of SPE[0] and SPE[1] is simple and fast. The key schedule and
159 * "salt" are also converted to this 8*(6+2) format. The SPE table size is
176 * also inhibits grouping the SPE table to look up 12 bits at a time. (The
178 * high-order zero, providing fast indexing into a 64-bit wide SPE.) On the
179 * other hand, 64-bit datatypes are currently rare, and a 12-bit SPE lookup
192 * the SPE transformation is iterated many times. The small tables total 9K
237 * It is possible, but ugly, to warp the SPE table to account for the salt
469 static long SPE[2][8][64];
610 * SPE table
634 TO_SIX_BIT(SPE[0][tableno][j], k);
638 TO_SIX_BIT(SPE[1][tableno][j], k);
741 #define DOXOR(x,y,i) x^=SPTAB(SPE[0][i],B.b[i]); y^=SPTAB(SPE[1][i],B.b[i]);
745 #define DOXOR(x,y,i) j=B.b[i]; x^=SPTAB(SPE[0][i],j); y^=SPTAB(SPE[1][i],j);
748 #define DOXOR(x,y,i) k=B.b[i]; x^=SPTAB(SPE[0][i],k); y^=SPTAB(SPE[1][i],k);