/system/media/wilhelm/tools/permute/ |
Makefile | 0 permute : permute.c 2 gcc -o $@ -Wall permute.c -lsndfile
|
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/chromium/chrome/browser/sync/util/ |
nigori_unittest.cc | 16 TEST(NigoriTest, Permute) { 21 EXPECT_TRUE(nigori.Permute(Nigori::Password, "test name", 35 EXPECT_TRUE(nigori1.Permute(Nigori::Password, 43 EXPECT_TRUE(nigori2.Permute(Nigori::Password, 164 EXPECT_TRUE(nigori1.Permute(Nigori::Password, original, &permuted1)); 165 EXPECT_TRUE(nigori2.Permute(Nigori::Password, original, &permuted2));
|
nigori.h | 20 // To store secrets securely, use the |Permute| method to derive a lookup name 49 bool Permute(Type type, const std::string& name, std::string* permuted) const;
|
cryptographer.cc | 14 // a username, and a password) by calling Permute on this string. Since the 15 // output of Permute is always the same for a given triplet, clients will always 124 if (!nigori->Permute(Nigori::Password, kNigoriKeyName, &name)) {
|
nigori.cc | 125 // Permute[Kenc,Kmac](type || name) 126 bool Nigori::Permute(Type type, const std::string& name,
|
/external/bison/lib/ |
getopt_int.h | 61 POSIXLY_CORRECT is defined, PERMUTE otherwise. 70 PERMUTE is the default. We permute the contents of ARGV as we 88 REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER
|
getopt_.h | 61 getopt_long_only can permute argv; this is required for backward
|
/ndk/sources/host-tools/sed-4.2.1/lib/ |
getopt_int.h | 60 POSIXLY_CORRECT is defined, PERMUTE otherwise. 69 PERMUTE is the default. We permute the contents of ARGV as we 87 REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER
|
getopt.in.h | 60 getopt_long_only can permute argv; this is required for backward 201 the environment, then do not permute arguments. */
|
/system/media/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/icu4c/common/ |
caniter.cpp | 264 void U_EXPORT2 CanonicalIterator::permute(UnicodeString &source, UBool skipZeros, Hashtable *result, UErrorCode &status) { function in class:CanonicalIterator 268 //if (PROGRESS) printf("Permute: %s\n", UToS(Tr(source))); 285 // otherwise iterate through the string, and recursively permute all the other characters 301 // don't permute it 310 //Hashtable *subpermute = permute(source.substring(0,i) + source.substring(i + UTF16.getCharCount(cp))); 311 permute(subPermuteString.replace(i, UTF16_CHAR_LENGTH(cp), NULL, 0), skipZeros, &subpermute, status); 370 permute(item, CANITER_SKIP_ZEROES, &permutations, status);
|
/bionic/libc/unistd/ |
getopt_long.c | 78 #define FLAG_PERMUTE 0x01 /* permute non-options to the end of argv */ 99 static int nonopt_start = -1; /* first non option argument (for permute) */ 100 static int nonopt_end = -1; /* first option after non options (for permute) */ 389 * non-options, we have to permute.
|
/external/dropbear/libtomcrypt/src/ciphers/ |
rc2.c | 43 static const unsigned char permute[256] = { variable 95 tmp[i] = permute[(tmp[i - 1] + tmp[i - keylen]) & 255]; 103 tmp[128 - T8] = permute[tmp[128 - T8] & TM]; 105 tmp[i] = permute[tmp[i + 1] ^ tmp[i + T8]];
|
/external/grub/lib/ |
getopt.c | 163 POSIXLY_CORRECT is defined, PERMUTE otherwise. 172 PERMUTE is the default. We permute the contents of ARGV as we scan, 190 REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER 426 ordering = PERMUTE; 504 The elements of ARGV aren't really const, because we permute them. 560 if (ordering == PERMUTE) 608 /* If we have come to a non-option and did not permute it,
|
/ndk/sources/host-tools/make-3.81/ |
getopt.c | 157 POSIXLY_CORRECT is defined, PERMUTE otherwise. 166 PERMUTE is the default. We permute the contents of ARGV as we scan, 184 REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER 413 ordering = PERMUTE; 491 The elements of ARGV aren't really const, because we permute them. 542 if (ordering == PERMUTE) 590 /* If we have come to a non-option and did not permute it,
|
/external/icu4c/test/intltest/ |
canittst.cpp | 129 // check permute 136 CanonicalIterator::permute(toPermute, FALSE, permutations, status);
|
/external/llvm/lib/Target/CellSPU/ |
SPUISelLowering.h | 39 SHUFB, ///< Vector shuffle (permute)
|
/external/llvm/lib/Target/PowerPC/ |
PPCInstrInfo.h | 61 PPC970_VPERM = 6 << PPC970_Shift, // Vector Permute Unit
|
/external/llvm/lib/Target/ARM/ |
ARMScheduleA8.td | [all...] |
/external/webkit/Source/JavaScriptCore/tests/mozilla/Getopt/ |
Mixed.pm | 43 $PERMUTE = 1; 106 $order = $PERMUTE; 369 $order = $PERMUTE if $order == $RETURN_IN_ORDER; 605 $order can be set to $REQUIRE_ORDER, $PERMUTE, or $RETURN_IN_ORDER. 607 POSIXLY_CORRECT has been set, $PERMUTE otherwise. 612 $PERMUTE means that all options are treated as if they preceded all
|
/bionic/libc/netbsd/resolv/ |
res_random.c | 84 #define RU_ROUNDS 11 /* Number of rounds for permute (odd) */
|
/external/icu4c/common/unicode/ |
caniter.h | 128 static void U_EXPORT2 permute(UnicodeString &source, UBool skipZeros, Hashtable *result, UErrorCode &status);
|
/external/libvpx/examples/includes/geshi/geshi/ |
matlab.php | 117 'pbaspect','pcg','pcolor','peaks','perms','permute','pi','pie',
|