HomeSort by relevance Sort by last modified time
    Searched full:successful (Results 276 - 300 of 2890) sorted by null

<<11121314151617181920>>

  /external/dropbear/libtomcrypt/src/modes/cfb/
cfb_start.c 29 @return CRYPT_OK if successful
  /external/dropbear/libtomcrypt/src/modes/ecb/
ecb_decrypt.c 26 @return CRYPT_OK if successful
ecb_encrypt.c 26 @return CRYPT_OK if successful
  /external/dropbear/libtomcrypt/src/modes/ofb/
ofb_encrypt.c 26 @return CRYPT_OK if successful
ofb_start.c 29 @return CRYPT_OK if successful
  /external/dropbear/libtomcrypt/src/pk/asn1/der/octet/
der_decode_octet_string.c 27 @return CRYPT_OK if successful
  /external/dropbear/libtomcrypt/src/pk/asn1/der/utctime/
der_encode_utctime.c 31 @return CRYPT_OK if successful
  /external/dropbear/libtomcrypt/src/pk/dsa/
dsa_export.c 26 @return CRYPT_OK if successful
dsa_shared_secret.c 27 @return CRYPT_OK if successful
  /external/dropbear/libtomcrypt/src/pk/katja/
katja_export.c 26 @return CRYPT_OK if successful
  /external/dropbear/libtomcrypt/src/pk/rsa/
rsa_export.c 26 @return CRYPT_OK if successful
  /external/dropbear/libtomcrypt/src/prngs/
rng_make_prng.c 24 @return CRYPT_OK if successful
  /external/e2fsprogs/intl/
vasnwprintf.h 35 If successful, return the address of the string (this may be = RESULTBUF
  /external/hyphenation/
README.compound 19 The algorithm is recursive: every word parts of a successful
  /external/icu4c/samples/datefmt/
util.cpp 11 // Verify that a UErrorCode is successful; exit(1) if not
  /external/icu4c/samples/msgfmt/
util.cpp 11 // Verify that a UErrorCode is successful; exit(1) if not
  /external/icu4c/samples/translit/
util.cpp 11 // Verify that a UErrorCode is successful; exit(1) if not
  /external/libogg/doc/libogg/
ogg_stream_init.html 45 0 if successful</li>
  /external/libsepol/include/sepol/
booleans.h 51 * 1 to signal successful exit
users.h 50 * 1 to signal successful exit
  /external/libvpx/libvpx/third_party/libyuv/include/libyuv/
scale.h 36 // Returns 0 if successful.
  /external/llvm/bindings/ocaml/bitwriter/
llvm_bitwriter.ml 16 (* Writes the bitcode for module the given path. Returns true if successful. *)
  /external/smack/src/org/jivesoftware/smackx/ping/
PingManager.java 262 * @return true if successful, otherwise false
282 * @return true if successful, otherwise false
306 * Returns the time of the last successful Ping Pong with the
307 * users server. If there was no successful Ping (e.g. because this
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
prune.h 52 // do not belong to a successful path whose weight is no more than
124 // 'fst' that do not belong to a successful path whose weight is no
136 // 'ofst' contains states and arcs that belong to a successful path in
234 // successful path in 'ifst' whose weight is no more than
  /external/valgrind/main/exp-sgcheck/tests/
preen_invars.c 30 successful or happened at all. The only way to see is from the

Completed in 993 milliseconds

<<11121314151617181920>>