Searched refs:NN (Results 1 - 5 of 5) sorted by relevance

/illumos-gate/usr/src/common/crypto/skein/
H A Dskein_block.c155 #define R256_Unroll_R(NN) \
156 ((SKEIN_UNROLL_256 == 0 && SKEIN_256_ROUNDS_TOTAL / 8 > (NN)) || \
157 (SKEIN_UNROLL_256 > (NN)))
382 #define R512_Unroll_R(NN) \
383 ((SKEIN_UNROLL_512 == 0 && SKEIN_512_ROUNDS_TOTAL / 8 > (NN)) || \
384 (SKEIN_UNROLL_512 > (NN)))
673 #define R1024_Unroll_R(NN) \
674 ((SKEIN_UNROLL_1024 == 0 && SKEIN1024_ROUNDS_TOTAL/8 > (NN)) || \
675 (SKEIN_UNROLL_1024 > (NN)))
/illumos-gate/usr/src/cmd/troff/
H A Dn4.c162 i = NN - regcnt;
235 for (p=numtab; p < &numtab[NN]; p++)
237 for (p=numtab; p < &numtab[NN]; p++) {
283 for (p = numtab; p < &numtab[NN]; p++) {
292 errprint(gettext("too many number registers (%d)."), NN);
H A Dtdef.h153 #define NN 400 /* number registers */ macro
428 } numtab[NN];
H A Dni.c62 struct numtab numtab[NN] = {
/illumos-gate/usr/src/lib/libsqlite/src/
H A Dbtree.c2133 ** in a balancing operation. NN is the number of neighbors on either side
2136 ** NN neighbors on either side.
2138 ** The minimum value of NN is 1 (of course). Increasing NN above 1
2141 ** The value of NN appears to give the best results overall.
2143 #define NN 1 /* Number of neighbors on either side of pPage */ macro
2144 #define NB (NN*2+1) /* Total pages involved in the balance */
2328 ** the siblings. An attempt is made to find NN siblings on either
2330 ** pPage there are fewer than NN siblings on the other side. If pParent
2333 nxDiv = idx - NN;
[all...]

Completed in 64 milliseconds