HomeSort by: relevance | last modified time | path
    Searched defs:unroll (Results 1 - 25 of 42) sorted by relevancy

1 2

  /src/sys/crypto/des/
des_ecb.c 74 const char *ptr,*unroll,*risc,*size; local
92 unroll="16";
94 unroll="4";
102 ptr, risc, unroll, size);
des_ecb.c 74 const char *ptr,*unroll,*risc,*size; local
92 unroll="16";
94 unroll="4";
102 ptr, risc, unroll, size);
  /src/crypto/external/apache2/openssl/lib/libdes/
oecb_enc.c 72 const char *ptr,*unroll,*risc,*size; local
90 unroll="16";
92 unroll="4";
98 sprintf(buf,"des(%s,%s,%s,%s)",ptr,risc,unroll,size);
oecb_enc.c 72 const char *ptr,*unroll,*risc,*size; local
90 unroll="16";
92 unroll="4";
98 sprintf(buf,"des(%s,%s,%s,%s)",ptr,risc,unroll,size);
  /src/crypto/external/bsd/openssl/lib/libdes/
oecb_enc.c 72 const char *ptr,*unroll,*risc,*size; local
90 unroll="16";
92 unroll="4";
98 sprintf(buf,"des(%s,%s,%s,%s)",ptr,risc,unroll,size);
oecb_enc.c 72 const char *ptr,*unroll,*risc,*size; local
90 unroll="16";
92 unroll="4";
98 sprintf(buf,"des(%s,%s,%s,%s)",ptr,risc,unroll,size);
  /src/crypto/external/bsd/openssl.old/lib/libdes/
oecb_enc.c 72 const char *ptr,*unroll,*risc,*size; local
90 unroll="16";
92 unroll="4";
98 sprintf(buf,"des(%s,%s,%s,%s)",ptr,risc,unroll,size);
oecb_enc.c 72 const char *ptr,*unroll,*risc,*size; local
90 unroll="16";
92 unroll="4";
98 sprintf(buf,"des(%s,%s,%s,%s)",ptr,risc,unroll,size);
  /src/external/gpl3/gcc/dist/gcc/
gimple-loop-jam.cc 1 /* Loop unroll-and-jam.
44 /* Unroll and Jam transformation
58 first unroll:
156 /* BB is part of the outer loop of an unroll-and-jam situation.
395 the unroll factor in *UNROLL to make unrolling valid for that distance.
399 *REMOVED and adjust *PROFIT_UNROLL to be the necessary unroll factor
404 unsigned *unroll, unsigned *profit_unroll,
418 a >= N, or b > 0, or b is zero and a > 0. Otherwise the unroll
424 else if (dist >= (lambda_int)*unroll)
526 bool unroll = false; local
    [all...]
gimple-loop-jam.cc 1 /* Loop unroll-and-jam.
44 /* Unroll and Jam transformation
58 first unroll:
156 /* BB is part of the outer loop of an unroll-and-jam situation.
395 the unroll factor in *UNROLL to make unrolling valid for that distance.
399 *REMOVED and adjust *PROFIT_UNROLL to be the necessary unroll factor
404 unsigned *unroll, unsigned *profit_unroll,
418 a >= N, or b > 0, or b is zero and a > 0. Otherwise the unroll
424 else if (dist >= (lambda_int)*unroll)
526 bool unroll = false; local
    [all...]
cfgloop.h 236 /* The number of times to unroll the loop. 0 means no information given,
237 just do what we always do. A value of 1 means do not unroll the loop.
238 A value of USHRT_MAX means unroll with no specific unrolling factor.
239 Other values means unroll with the given unrolling factor. */
240 unsigned short unroll; variable
cfgloop.h 236 /* The number of times to unroll the loop. 0 means no information given,
237 just do what we always do. A value of 1 means do not unroll the loop.
238 A value of USHRT_MAX means unroll with no specific unrolling factor.
239 Other values means unroll with the given unrolling factor. */
240 unsigned short unroll; variable
  /src/external/gpl3/gcc.old/dist/gcc/
gimple-loop-jam.cc 1 /* Loop unroll-and-jam.
43 /* Unroll and Jam transformation
57 first unroll:
155 /* BB is part of the outer loop of an unroll-and-jam situation.
395 the unroll factor in *UNROLL to make unrolling valid for that distance.
399 *REMOVED and adjust *PROFIT_UNROLL to be the necessary unroll factor
404 unsigned *unroll, unsigned *profit_unroll,
418 a >= N, or b > 0, or b is zero and a > 0. Otherwise the unroll
424 else if (dist >= (lambda_int)*unroll)
526 bool unroll = false; local
    [all...]
gimple-loop-jam.cc 1 /* Loop unroll-and-jam.
43 /* Unroll and Jam transformation
57 first unroll:
155 /* BB is part of the outer loop of an unroll-and-jam situation.
395 the unroll factor in *UNROLL to make unrolling valid for that distance.
399 *REMOVED and adjust *PROFIT_UNROLL to be the necessary unroll factor
404 unsigned *unroll, unsigned *profit_unroll,
418 a >= N, or b > 0, or b is zero and a > 0. Otherwise the unroll
424 else if (dist >= (lambda_int)*unroll)
526 bool unroll = false; local
    [all...]
cfgloop.h 233 /* The number of times to unroll the loop. 0 means no information given,
234 just do what we always do. A value of 1 means do not unroll the loop.
235 A value of USHRT_MAX means unroll with no specific unrolling factor.
236 Other values means unroll with the given unrolling factor. */
237 unsigned short unroll; variable
cfgloop.h 233 /* The number of times to unroll the loop. 0 means no information given,
234 just do what we always do. A value of 1 means do not unroll the loop.
235 A value of USHRT_MAX means unroll with no specific unrolling factor.
236 Other values means unroll with the given unrolling factor. */
237 unsigned short unroll; variable
  /src/external/bsd/zstd/dist/lib/common/
fse_decompress.c 118 * We unroll the loop twice, since that is what empirically worked best.
123 size_t const unroll = 2; local
124 assert(tableSize % unroll == 0); /* FSE_MIN_TABLELOG is 5 */
125 for (s = 0; s < (size_t)tableSize; s += unroll) {
127 for (u = 0; u < unroll; ++u) {
131 position = (position + (unroll * step)) & tableMask;
fse_decompress.c 118 * We unroll the loop twice, since that is what empirically worked best.
123 size_t const unroll = 2; local
124 assert(tableSize % unroll == 0); /* FSE_MIN_TABLELOG is 5 */
125 for (s = 0; s < (size_t)tableSize; s += unroll) {
127 for (u = 0; u < unroll; ++u) {
131 position = (position + (unroll * step)) & tableMask;
  /src/external/bsd/zstd/dist/lib/compress/
fse_compress.c 137 * we don't need variable sized inner loop, so we can unroll the loop and
142 size_t const unroll = 2; /* Experimentally determined optimal unroll */ local
143 assert(tableSize % unroll == 0); /* FSE_MIN_TABLELOG is 5 */
144 for (s = 0; s < (size_t)tableSize; s += unroll) {
146 for (u = 0; u < unroll; ++u) {
150 position = (position + (unroll * step)) & tableMask;
fse_compress.c 137 * we don't need variable sized inner loop, so we can unroll the loop and
142 size_t const unroll = 2; /* Experimentally determined optimal unroll */ local
143 assert(tableSize % unroll == 0); /* FSE_MIN_TABLELOG is 5 */
144 for (s = 0; s < (size_t)tableSize; s += unroll) {
146 for (u = 0; u < unroll; ++u) {
150 position = (position + (unroll * step)) & tableMask;
  /src/external/mit/lua/dist/src/
ldo.c 671 ** 'unroll' which calls ''finishCcall' and we are back here again, to
740 static void unroll (lua_State *L, void *ud) { function
811 unroll(L, NULL); /* run continuation */
819 ** interrupts 'unroll', and this loop protects it again so it can
829 status = luaD_rawrunprotected(L, unroll, NULL);
ldo.c 671 ** 'unroll' which calls ''finishCcall' and we are back here again, to
740 static void unroll (lua_State *L, void *ud) { function
811 unroll(L, NULL); /* run continuation */
819 ** interrupts 'unroll', and this loop protects it again so it can
829 status = luaD_rawrunprotected(L, unroll, NULL);
  /src/external/bsd/zstd/dist/lib/decompress/
huf_decompress.c 429 int const unroll = 4; local
430 int const nLimit = (int)nbSymbols - unroll + 1;
436 for (n=0; n < nLimit; n += unroll) {
438 for (u=0; u < unroll; ++u) {
806 /* Manually unroll the loop because compilers don't consistently
807 * unroll the inner loops, which destroys performance.
1629 /* Manually unroll the loop because compilers don't consistently
1630 * unroll the inner loops, which destroys performance.
zstd_decompress_block.c 558 * We unroll the loop twice, since that is what empirically worked best.
563 size_t const unroll = 2; local
564 assert(tableSize % unroll == 0); /* FSE_MIN_TABLELOG is 5 */
565 for (s = 0; s < (size_t)tableSize; s += unroll) {
567 for (u = 0; u < unroll; ++u) {
571 position = (position + (unroll * step)) & tableMask;
huf_decompress.c 429 int const unroll = 4; local
430 int const nLimit = (int)nbSymbols - unroll + 1;
436 for (n=0; n < nLimit; n += unroll) {
438 for (u=0; u < unroll; ++u) {
806 /* Manually unroll the loop because compilers don't consistently
807 * unroll the inner loops, which destroys performance.
1629 /* Manually unroll the loop because compilers don't consistently
1630 * unroll the inner loops, which destroys performance.

Completed in 115 milliseconds

1 2