HomeSort by relevance Sort by last modified time
    Searched refs:HASH (Results 1 - 25 of 30) sorted by null

1 2

  /external/clang/test/Preprocessor/
hash_space.c 5 #define HASH #
6 HASH define foo bar
stringize_misc.c 37 #define HASH #
  /external/mesa3d/src/compiler/glsl/glcpp/
glcpp-lex.l 181 %x COMMENT DEFINE DONE HASH NEWLINE_CATCHUP UNREACHABLE
186 HASH #
266 <INITIAL,DEFINE,HASH>"//"[^\r\n]* {
270 <INITIAL,DEFINE,HASH>"/*" { yy_push_state(COMMENT, yyscanner); }
277 /* In the <HASH> start condition, we don't want any SPACE token. */
278 if (yyextra->space_tokens && YY_START != HASH)
282 {HASH} {
285 * line, then it introduces a directive, switch to the <HASH> start
291 BEGIN HASH;
297 <HASH>version{HSPACE}+
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/sym/
template.h 3 /* define some hash function */
4 #ifndef HASH
5 #define HASH(p, h) while ( *p != '\0' ) h = (h<<1) + *p++;
12 unsigned int hash; member in struct:_sym
sym.c 12 * unsigned int hash;
17 * 'head' is &(table[hash(itself)]).
18 * The hash table is not resizable at run-time.
27 * zzs_init(s1,s2) -- Create hash table with size s1, string table size s2.
28 * zzs_done() -- Free hash and string table created with zzs_init().
100 * Made HASH macro
106 * Made symbol table entry save its hash code for fast comparison
174 HASH(p, h);
175 rec->hash = h; /* save hash code for fast comp later */
    [all...]
  /external/v8/tools/
android-sync.sh 46 local HASH=$(md5sum $1)
47 echo ${HASH%% *}
51 local HASH=$(md5 $1)
52 echo ${HASH} | cut -f2 -d "=" | cut -f2 -d " "
  /external/mesa3d/src/compiler/nir/
nir_instr_set.c 27 #define HASH(hash, data) _mesa_fnv32_1a_accumulate((hash), (data))
30 hash_src(uint32_t hash, const nir_src *src)
33 hash = HASH(hash, src->ssa);
34 return hash;
38 hash_alu_src(uint32_t hash, const nir_alu_src *src, unsigned num_components)
40 hash = HASH(hash, src->abs)
179 uint32_t hash = _mesa_fnv32_1a_offset_bias; local
    [all...]
  /device/linaro/bootloader/arm-trusted-firmware/tools/cert_create/src/
ext.c 25 } HASH;
27 ASN1_SEQUENCE(HASH) = {
28 ASN1_SIMPLE(HASH, hashAlgorithm, X509_ALGOR),
29 ASN1_SIMPLE(HASH, dataHash, ASN1_OCTET_STRING),
30 } ASN1_SEQUENCE_END(HASH)
32 DECLARE_ASN1_FUNCTIONS(HASH)
33 IMPLEMENT_ASN1_FUNCTIONS(HASH)
136 * Creates a x509v3 extension containing a hash
151 * md: hash algorithm
152 * buf: pointer to the buffer that contains the hash
    [all...]
  /external/guava/guava-tests/test/com/google/common/base/
BenchmarkHelpers.java 59 HASH(CharMatcher.is('#'), "#"),
  /external/openssh/
deattack.c 65 /* Hash function (Input keys are cipher results) */
66 #define HASH(x) PEEK_U32(x)
151 for (i = HASH(c) & (dctx->n - 1); dctx->h[i] != HASH_UNUSED;
  /external/elfutils/libebl/
eblsectiontypename.c 53 KNOWNSTYPE (HASH),
  /external/deqp-deps/glslang/glslang/Include/
Common.h 132 // Repackage the std::hash for use by unordered map/set with a TString key.
135 template<> struct hash<glslang::TString> { struct in namespace:std
193 template <class K, class D, class HASH = std::hash<K>, class PRED = std::equal_to<K> >
194 class TUnorderedMap : public std::unordered_map<K, D, HASH, PRED, pool_allocator<std::pair<K const, D> > > {
  /external/elfutils/tests/
run-alldts.sh 34 HASH 0xdeadbeef
run-strip-remove-keep.sh 42 [ 3] .hash HASH 08048128 000128 000030 4 A 4 0 4
77 [ 3] .hash NOBITS 08048128 000114 000030 4 A 4 0 4
128 [ 3] .hash HASH 08048128 000128 000030 4 A 4 0 4
164 [ 3] .hash NOBITS 08048128 000114 000030 4 A 4 0 4
216 [ 2] .gnu.hash GNU_HASH 00000000000001b8 000001b8 0000003c 0 A 3 0 8
251 [ 2] .gnu.hash NOBITS 00000000000001b8 000001b8 0000003c 0 A 3 0 8
295 [ 2] .gnu.hash GNU_HASH 00000000000001b8 000001b8 0000003c 0 A 3 0 8
330 [ 2] .gnu.hash NOBITS 00000000000001b8 000001b8 0000003c 0 A 3 0
    [all...]
  /external/clang/lib/Basic/
IdentifierTable.cpp 1 //===--- IdentifierTable.cpp - Hash table for identifier lookup -----------===//
256 // We use a perfect hash function here involving the length of the keyword,
261 #define HASH(LEN, FIRST, THIRD) \
264 case HASH(LEN, FIRST, THIRD): \
270 switch (HASH(Len, Name[0], Name[2])) {
302 #undef HASH
331 fprintf(stderr, "Hash density (#identifiers per bucket): %f\n",
  /device/linaro/bootloader/edk2/BaseTools/Source/C/Common/
EfiCompress.c 38 #define HASH(p, c) ((p) + ((c) << (WNDBIT - 9)) + WNDSIZ * 2)
552 r = mNext[HASH(q, c)];
586 h = (NODE)HASH(q, c);
TianoCompress.c 37 #define HASH(p, c) ((p) + ((c) << (WNDBIT - 9)) + WNDSIZ * 2)
569 NodeR = mNext[HASH (NodeQ, CharC)];
607 Node1 = (NODE) HASH (Parent, CharC);
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Sample/Tools/Source/Common/
EfiCompress.c 48 #define HASH(p, c) ((p) + ((c) << (WNDBIT - 9)) + WNDSIZ * 2)
555 r = mNext[HASH(q, c)];
589 h = (NODE)HASH(q, c);
TianoCompress.c 47 #define HASH(p, c) ((p) + ((c) << (WNDBIT - 9)) + WNDSIZ * 2)
582 NodeR = mNext[HASH (NodeQ, CharC)];
620 Node1 = (NODE) HASH (Parent, CharC);
  /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/
Compress.c 42 #define HASH(LoopVar7, LoopVar5) ((LoopVar7) + ((LoopVar5) << (WNDBIT - 9)) + WNDSIZ * 2)
276 LoopVar4 = mNext[HASH (LoopVar6, LoopVar5)];
303 LoopVar12 = (NODE) HASH (LoopVar6, LoopVar5);
  /external/vboot_reference/utility/
eficompress.c 58 #define HASH(p, c) ((p) + ((c) << (WNDBIT - 9)) + WNDSIZ * 2)
565 r = mNext[HASH(q, c)];
599 h = (NODE)HASH(q, c);
  /external/llvm/tools/llvm-bcanalyzer/
llvm-bcanalyzer.cpp 179 STRINGIFY_CODE(MODULE_CODE, HASH)
298 STRINGIFY_CODE(MST_CODE, HASH)
607 // If we found a module hash, let's verify that it matches!
612 // Recompute the hash and compare it to the one in the bitcode
614 StringRef Hash;
619 Hash = Hasher.result();
631 if (Hash == RecordedHash)
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-bcanalyzer/
llvm-bcanalyzer.cpp 70 "check-hash",
71 cl::desc("Check module hash using the argument as a string table"));
183 STRINGIFY_CODE(MODULE_CODE, HASH)
302 STRINGIFY_CODE(MST_CODE, HASH)
658 // If we found a module hash, let's verify that it matches!
664 // Recompute the hash and compare it to the one in the bitcode
666 StringRef Hash;
672 Hash = Hasher.result();
684 if (Hash == RecordedHash)
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/TianoCompress/
TianoCompress.c 44 #define HASH(p, c) ((p) + ((c) << (WNDBIT - 9)) + WNDSIZ * 2)
394 NodeR = mNext[HASH (NodeQ, CharC)];
432 Node1 = (NODE) HASH (Parent, CharC);
    [all...]
  /external/bcc/src/lua/bpf/
cdef.lua 143 HASH = 1,

Completed in 5800 milliseconds

1 2