/frameworks/wilhelm/tools/permute/ |
Makefile | 0 permute : permute.c 2 gcc -o $@ -Wall -Werror permute.c -lsndfile 5 $(RM) permute
|
readme.txt | 1 See comments at top of permute.c for information on how to build and use.
|
permute.c | 17 /** Permute is a host tool to randomly permute an audio file. 119 /** Permute the specified input file */ 121 void permute(char *path_in) function 228 // now permute the segments randomly using a bad algorithm 337 // Permute the file 338 permute(arg);
|
/external/llvm/test/CodeGen/SystemZ/ |
vec-perm-08.ll | 5 ; Test a high1/low2 permute for v16i8. 18 ; Test a low2/high1 permute for v16i8. 31 ; Test a low1/high2 permute for v16i8. 44 ; Test a high2/low1 permute for v16i8. 70 ; Test a high1/low2 permute for v8i16. 81 ; Test a low2/high1 permute for v8i16. 92 ; Test a high1/low2 permute for v4i32. 102 ; Test a low2/high1 permute for v4i32. 112 ; Test a high1/low2 permute for v2i64. 122 ; Test low2/high1 permute for v2i64 [all...] |
vec-perm-10.ll | 1 ; Test general vector permute of a v8i16.
|
vec-perm-11.ll | 1 ; Test general vector permute of a v4i32.
|
vec-perm-09.ll | 1 ; Test general vector permute of a v16i8.
|
/external/vulkan-validation-layers/libs/glm/detail/ |
_noise.hpp | 42 GLM_FUNC_QUALIFIER T permute(T const & x) function in namespace:glm::detail 48 GLM_FUNC_QUALIFIER tvec2<T, P> permute(tvec2<T, P> const & x) function in namespace:glm::detail 54 GLM_FUNC_QUALIFIER tvec3<T, P> permute(tvec3<T, P> const & x) function in namespace:glm::detail 60 GLM_FUNC_QUALIFIER tvec4<T, P> permute(tvec4<T, P> const & x) function in namespace:glm::detail 66 GLM_FUNC_QUALIFIER vecType<T, P> permute(vecType<T, P> const & x)
|
func_noise.inl | 105 detail::tvec3<T, P> p = detail::permute( 106 detail::permute(i.y + detail::tvec3<T, P>(T(0), i1.y, T(1))) + i.x + detail::tvec3<T, P>(T(0), i1.x, T(1))); 163 detail::tvec4<T, P> p(detail::permute(detail::permute(detail::permute( 266 T j0 = detail::permute(detail::permute(detail::permute(detail::permute(i.w) + i.z) + i.y) + i.x); 267 detail::tvec4<T, P> j1 = detail::permute(detail::permute(detail::permute(detail::permute [all...] |
/external/vulkan-validation-layers/libs/glm/gtc/ |
noise.inl | 65 detail::tvec4<T, P> i = detail::permute(detail::permute(ix) + iy); 109 detail::tvec4<T, P> ixy = detail::permute(detail::permute(ix) + iy); 110 detail::tvec4<T, P> ixy0 = detail::permute(ixy + iz0); 111 detail::tvec4<T, P> ixy1 = detail::permute(ixy + iz1); 180 detail::tvec4<T, P> ixy = permute(permute(ix) + iy); 181 detail::tvec4<T, P> ixy0 = permute(ixy + iz0); 182 detail::tvec4<T, P> ixy1 = permute(ixy + iz1) [all...] |
/external/bison/lib/ |
getopt_int.h | 38 POSIXLY_CORRECT is defined, PERMUTE otherwise. 47 PERMUTE is the default. We permute the contents of ARGV as we 65 REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER
|
/frameworks/wilhelm/tests/listening/ |
seekTorture.c | 18 // It needs as input a permuted .wav and .map produced by the permute tool. 32 fprintf(stderr, " where file.wav and file.map are created by the permute tool\n");
|
/external/icu/icu4c/source/common/ |
caniter.cpp | 265 void U_EXPORT2 CanonicalIterator::permute(UnicodeString &source, UBool skipZeros, Hashtable *result, UErrorCode &status) { function in class:CanonicalIterator 269 //if (PROGRESS) printf("Permute: %s\n", UToS(Tr(source))); 286 // otherwise iterate through the string, and recursively permute all the other characters 302 // don't permute it 311 //Hashtable *subpermute = permute(source.substring(0,i) + source.substring(i + UTF16.getCharCount(cp))); 312 permute(subPermuteString.replace(i, U16_LENGTH(cp), NULL, 0), skipZeros, &subpermute, status); 371 permute(item, CANITER_SKIP_ZEROES, &permutations, status);
|
/external/eigen/doc/ |
SparseQuickReference.dox | 155 sm1.twistedBy(perm); // Permute rows and columns 156 sm2 = sm1 * perm; //Permute the columns 157 sm2 = perm * sm1; // Permute the columns
|
/external/toybox/toys/other/ |
bzcat.c | 65 int limit[MAX_HUFCODE_BITS+1], base[MAX_HUFCODE_BITS], permute[MAX_SYMBOLS]; member in struct:group_data 257 /* Calculate permute[], base[], and limit[] tables from length[]. 259 * permute[] is the lookup table for converting huffman coded symbols 263 * of a given length when using permute[]. 270 * equals permute[hufcode_value - base[hufcode_bitcount]]. 282 // zero temp[] and limit[], and calculate permute[] 287 if (length[hh] == ii) hufGroup->permute[pp++] = hh; 376 nextSym = hufGroup->permute[jj];
|
/prebuilts/go/darwin-x86/test/bench/shootout/ |
fannkuch-parallel.go | 75 func (k *Kucher) permute(n int) bool { func 130 if !k.permute(job.n) {
|
/prebuilts/go/linux-x86/test/bench/shootout/ |
fannkuch-parallel.go | 75 func (k *Kucher) permute(n int) bool { func 130 if !k.permute(job.n) {
|
/bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
getopt_long.c | 82 #define FLAG_PERMUTE 0x01 /* permute non-options to the end of argv */ 110 static int nonopt_start = -1; /* first non option argument (for permute) */ 111 static int nonopt_end = -1; /* first option after non options (for permute) */ 458 * non-options, we have to permute.
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
qrsolv.h | 85 /* permute the components of z back to components of x. */
|
/external/mesa3d/src/getopt/ |
getopt_long.c | 66 #define FLAG_PERMUTE 0x01 /* permute non-options to the end of argv */ 87 static int nonopt_start = -1; /* first non option argument (for permute) */ 88 static int nonopt_end = -1; /* first option after non options (for permute) */ 374 * non-options, we have to permute.
|
/external/tcpdump/missing/ |
getopt_long.c | 64 #define FLAG_PERMUTE 0x01 /* permute non-options to the end of argv */ 94 static int nonopt_start = -1; /* first non option argument (for permute) */ 95 static int nonopt_end = -1; /* first option after non options (for permute) */ 458 * non-options, we have to permute.
|
/external/eigen/Eigen/src/Core/arch/AltiVec/ |
Complex.h | 77 // Permute and multiply the real parts of a and b 86 // permute back to a proper order
|
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
LMqrsolv.h | 98 /* permute the components of z back to components of x. */ 182 // Permute the components of z back to components of x
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/normalizer/ |
TestCanonicalIterator.java | 134 // check permute 138 CanonicalIterator.permute("ABC", false, results);
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/normalizer/ |
TestCanonicalIterator.java | 130 // check permute 134 CanonicalIterator.permute("ABC", false, results);
|