| /external/aac/libFDK/include/arm/ |
| H A D | scramble.h | 100 inline void scramble(FIXP_DBL x [], INT n) { function
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/ |
| H A D | genperf.c | 78 ub4 smax, /* range of scramble[] */
80 ub4 *scramble) /* used in final hash */
87 fprintf(f, " static const unsigned long scramble[] = {\n");
90 scramble[i+0], scramble[i+1], scramble[i+2], scramble[i+3]);
92 fprintf(f, " static const unsigned short scramble[] = {\n");
96 scramble[i+0], scramble[
75 make_c_tab( FILE *f, bstuff *tab, ub4 smax, ub4 blen, ub4 *scramble) argument
165 ub4 scramble[SCRAMBLE_LEN]; /* used in final hash function */ local
[all...] |
| H A D | perfect.c | 16 keys, then it computes a^scramble[tab[b]] to get the final perfect hash.
17 tab[] is an array of 1-byte values and scramble[] is a 256-term array of
32 The final hash is (a XOR scramble[tab[b]]). *scramble* is a
46 *scramble* is used because (a^tab[i]) clusters keys around *a*.
96 /* initialize scramble[] with distinct random values in 0..smax-1 */
98 ub4 *scramble, /* hash is a^scramble[tab[b]] */
99 ub4 smax) /* scramble values should be in 0..smax-1 */
103 /* fill scramble[] wit
97 scrambleinit( ub4 *scramble, ub4 smax) argument
375 apply( bstuff *tabb, hstuff *tabh, qstuff *tabq, ub4 blen, ub4 *scramble, ub4 tail, int rollback) argument
452 augment( bstuff *tabb, hstuff *tabh, qstuff *tabq, ub4 blen, ub4 *scramble, ub4 smax, bstuff *item, ub4 nkeys, ub4 highwater, hashform *form) argument
536 perfect( bstuff *tabb, hstuff *tabh, qstuff *tabq, ub4 blen, ub4 smax, ub4 *scramble, ub4 nkeys, hashform *form) argument
579 hash_ab( bstuff **tabb, ub4 *alen, ub4 *blen, ub4 *salt, gencode *final, ub4 *scramble, ub4 *smax, key *keys, ub4 nkeys, hashform *form) argument
813 findhash( bstuff **tabb, hstuff **tabh, ub4 *alen, ub4 *blen, ub4 *salt, gencode *final, ub4 *scramble, ub4 *smax, key *keys, ub4 nkeys, hashform *form) argument
[all...] |
| H A D | perfect.h | 19 #define USE_SCRAMBLE 4096 /* use scramble if blen >= USE_SCRAMBLE */
20 #define SCRAMBLE_LEN ((ub4)1<<16) /* length of *scramble* */
123 /* Given the keys, scramble[], and hash mode, find the perfect hash */
125 gencode *final, ub4 *scramble, ub4 *smax, key *keys, ub4 nkeys,
|
| /external/aac/libFDK/include/mips/ |
| H A D | scramble.h | 97 inline void scramble(FIXP_DBL *x, INT n) { function
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| H A D | boundary1.tcl | 58 proc scramble {inlist} { procedure
107 set nums1 [scramble [array names boundarynum]]
108 set nums2 [scramble [array names boundarynum]]
|
| H A D | boundary3.tcl | 58 proc scramble {inlist} { procedure
107 set nums1 [scramble [array names boundarynum]]
108 set nums2 [scramble [array names boundarynum]]
|
| H A D | boundary2.tcl | 58 proc scramble {inlist} { procedure
107 set nums1 [scramble [array names boundarynum]]
108 set nums2 [scramble [array names boundarynum]]
|
| H A D | boundary4.tcl | 57 proc scramble {inlist} { procedure
106 set nums1 [scramble [array names boundarynum]]
107 set nums2 [scramble [array names boundarynum]]
|
| /external/aac/libFDK/include/ |
| H A D | scramble.h | 97 #include "arm/scramble.h"
100 #include "mips/scramble.h"
106 functionname: scramble
140 /* default scramble functionality */
141 inline void scramble(FIXP_DBL *x, INT n) function
|
| /external/aac/libFDK/src/arm/ |
| H A D | fft_rad2_arm.cpp | 117 scramble(x,n);
|
| /external/aac/libFDK/src/ |
| H A D | fft_rad2.cpp | 93 #include "scramble.h"
126 scramble(x,n);
331 scramble(x,n);
|