Home
last modified time | relevance | path

Searched refs:NUM_ALGORITHMS (Results 1 – 11 of 11) sorted by relevance

/dports/security/md5deep/hashdeep-cd2ed74/src/
H A Dmultihash.cpp5 for (int i = 0 ; i < NUM_ALGORITHMS ; ++i) { in multihash_initialize()
20 for (int i = 0 ; i < NUM_ALGORITHMS ; ++i) { in multihash_update()
37 for (int i = 0 ; i < NUM_ALGORITHMS ; ++i) { in multihash_finalize()
H A Dmain.h88 #define NUM_ALGORITHMS alg_unknown macro
151 extern algorithm_t hashes[NUM_ALGORITHMS]; // which hash algorithms are available and in use
255 std::string hash_hex[NUM_ALGORITHMS]; // the hash in hex of the entire file
256 std::string hash512_hex[NUM_ALGORITHMS]; // hash of the first 512 bytes, for triage mode
273 uint8_t hash_context[NUM_ALGORITHMS][MAX_ALGORITHM_CONTEXT_SIZE];
395 static const int MAX_KNOWN_COLUMNS= NUM_ALGORITHMS+ 6;
439 hashmap hashmaps[NUM_ALGORITHMS];
473 hashid_t hash_column[NUM_ALGORITHMS]; // maps a column number to a hashid;
H A Dmain.cpp140 for (int i = 0 ; i < NUM_ALGORITHMS ; i++) in hashdeep_usage()
142 fprintf(stdout,"%s%s",hashes[i].name.c_str(),(i+1<NUM_ALGORITHMS) ? "," : NEWLINE); in hashdeep_usage()
286 algorithm_t hashes[NUM_ALGORITHMS]; // which hash algorithms are available and in use
471 for(int i=0;i<NUM_ALGORITHMS;i++){ in get_hashid_for_name()
479 for (int i = 0 ; i < NUM_ALGORITHMS ; ++i) { in clear_algorithms_inuse()
506 for (int i = 0 ; i < NUM_ALGORITHMS ; ++i) { in algorithms_in_use_count()
556 for (int j=0 ; j<NUM_ALGORITHMS ; j++) in enable_hashing_algorithms()
1157 for (int i = 0 ; i < NUM_ALGORITHMS ; ++i) { in make_banner()
1304 for (int i=0;i<NUM_ALGORITHMS;++i) in main()
H A Dhashlist.cpp41 for(int i=0;i<NUM_ALGORITHMS;i++){ // and add for each algorithm in add_fdt()
100 for (int alg = 0 ; alg < NUM_ALGORITHMS ; ++alg) in search()
126 for (int j=0 ; j<NUM_ALGORITHMS ; j++) in search()
H A Dhash.cpp300 for (int i = 0 ; i < NUM_ALGORITHMS ; ++i) in hash()
438 std::string file_hashes[NUM_ALGORITHMS]; in hash()
H A Ddisplay.cpp337 for(int i=0;i<NUM_ALGORITHMS;i++){ in dfxml_write_hashes()
771 for (int i = 0 ; i < NUM_ALGORITHMS ; ++i) in display_hash_simple()
823 for(int i=0;i<NUM_ALGORITHMS;i++){ in dfxml_startup()
/dports/misc/dartsim/dart-6.11.1/dart/optimizer/nlopt/
H A DNloptSolver.hpp108 NUM_ALGORITHMS ///< Not an algorithm, just the number of them enumerator
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/coremark/
H A Dcoremark.h88 #define NUM_ALGORITHMS 3 macro
H A Dcore_main.c165 for (i=0; i<NUM_ALGORITHMS; i++) { in main()
172 for (i=0; i<NUM_ALGORITHMS; i++) { in main()
/dports/math/R-cran-nloptr/nloptr/src/nlopt_src/api/
H A Dnlopt.hpp93 NUM_ALGORITHMS /* not an algorithm, just the number of them */ enumerator
/dports/math/R-cran-nloptr/nloptr/inst/include/
H A Dnlopt.hpp93 NUM_ALGORITHMS /* not an algorithm, just the number of them */ enumerator