| /src/external/gpl2/groff/dist/src/utils/addftinfo/ |
| guess.cpp | 37 #define HASH(c1, c2) (((unsigned char)(c1) << 8) | (unsigned char)(c2))
38 switch (HASH(s[0], s[1])) {
48 case HASH('\\', '|'):
49 case HASH('\\', '^'):
50 case HASH('\\', '&'):
53 case HASH('f', 0):
58 case HASH('a', 0):
59 case HASH('c', 0):
60 case HASH('e', 0):
61 case HASH('m', 0)
[all...] |
| /src/usr.bin/make/unit-tests/ |
| varmod-select-words.mk | 20 HASH= \#
30 mod-squarebrackets-hash \
76 mod-squarebrackets-hash:
168 @echo 'HASH="${HASH}" == "#" ?'
169 @echo 'LIST:[$${HASH}]="${LIST:[${HASH}]}"'
182 @echo 'LIST:[$${LIST:[$${HASH}]}]="${LIST:[${LIST:[${HASH}]}]}"'
|
| /src/external/bsd/unbound/dist/winrc/ |
| unbound-control-setup.cmd | 53 rem hash algorithm
54 set HASH=sha256
98 echo default_md=%HASH%>>request.cfg
105 echo subjectKeyIdentifier=hash>>request.cfg
124 echo default_md=%HASH%>>request.cfg
140 "%SSL_PROGRAM%" req -key %CTL_BASE%.key -config request.cfg -new | "%SSL_PROGRAM%" x509 -req -days %DAYS% -CA %SVR_BASE%_trust.pem -CAkey %SVR_BASE%.key -CAcreateserial -%HASH% -extfile request.cfg -extensions v3_req -out %CTL_BASE%.pem
|
| /src/sys/net/agr/ |
| if_agrether_hash.c | 34 #include <sys/hash.h>
48 #define HASH(p, l, h) hash32_buf((p), (l), (h))
76 uint32_t hash = HASH32_BUF_INIT; local
83 return hash;
86 hash = HASH(&eh->ether_dhost, sizeof(eh->ether_dhost), hash);
87 hash = HASH(&eh->ether_shost, sizeof(eh->ether_shost), hash);
[all...] |
| /src/common/lib/libc/atomic/ |
| atomic_init_testset.c | 62 #define HASH(PTR) (((uintptr_t)(PTR) >> 3) & 127)
180 lock = &atomic_locks[HASH(ptr)];
198 lock = &atomic_locks[HASH(ptr)];
216 lock = &atomic_locks[HASH(ptr)];
233 lock = &atomic_locks[HASH(ptr)];
|
| /src/external/mpl/bind/dist/tests/dns/ |
| nsec3param_test.c | 40 #define HASH 1
50 dns_hash_t hash; member in struct:__anon24210
77 to->hash = from.hash;
92 rdata_fromparams(uint8_t hash, uint8_t flags, uint16_t iter, uint8_t saltlen,
95 nsec3param.hash = hash;
142 assert_int_equal(param.hash, expect.hash);
180 { rdata_fromparams(HASH, FLAGS, ITER, SALTLEN, NULL)
[all...] |
| /src/external/bsd/zstd/dist/lib/ |
| libzstd.mk | 214 HASH ?= md5
217 HASH ?= gmd5sum
219 HASH ?= md5 -n
221 HASH ?= md5
223 HASH ?= md5sum
225 HASH_DIR = conf_$(shell echo $(CC) $(CPPFLAGS) $(CFLAGS) $(LDFLAGS) $(ZSTD_FILES) | $(HASH) | cut -f 1 -d " " )
226 HAVE_HASH :=$(shell echo 1 | $(HASH) > /dev/null && echo 1 || echo 0)
228 $(info warning : could not find HASH ($(HASH)), needed to differentiate builds using different flags)
|
| /src/external/gpl2/diffutils/dist/src/ |
| io.c | 34 /* Given a hash value and a new character, return a new hash value. */
35 #define HASH(h, c) ((c) + ROL (h, 7))
38 /* The type of a hash value. */
49 hash_value hash; /* Hash of lines in this class. */
54 /* Hash-table: array of buckets, each being a chain of equivalence classes.
58 /* Number of buckets in the hash table array, not counting buckets[-1]. */
253 /* Hash this line until we find a newline. */
260 h = HASH (h, TOLOWER (c))
48 hash_value hash; \/* Hash of lines in this class. *\/ member in struct:equivclass
[all...] |
| /src/external/gpl2/xcvs/dist/diff/ |
| io.c | 24 /* Given a hash value and a new character, return a new hash value. */
25 #define HASH(h, c) ((c) + ROL (h, 7))
44 unsigned hash; /* Hash of lines in this class. */
49 /* Hash-table: array of buckets, each being a chain of equivalence classes.
53 /* Number of buckets in the hash table array, not counting buckets[-1]. */
221 /* Hash this line until we find a newline. */
228 h = HASH (h, ISUPPER (c) ? tolower (c) : c);
243 h = HASH (h, ' ')
43 unsigned hash; \/* Hash of lines in this class. *\/ member in struct:equivclass
[all...] |
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| vec.h | 50 HASH
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| vec.h | 50 HASH
|
| /src/external/apache2/llvm/dist/clang/lib/Basic/ |
| IdentifierTable.cpp | 1 //===- IdentifierTable.cpp - Hash table for identifier lookup -------------===//
310 // We use a perfect hash function here involving the length of the keyword,
315 #define HASH(LEN, FIRST, THIRD) \
318 case HASH(LEN, FIRST, THIRD): \
324 switch (HASH(Len, Name[0], Name[2])) {
356 #undef HASH
385 fprintf(stderr, "Hash density (#identifiers per bucket): %f\n",
|
| /src/external/bsd/top/dist/machine/ |
| m_irix5.c | 198 * the program. We keep these things in a hash table, which is
209 #define HASH(x) ((x << 1) % oldprocs)
686 op = oldbase + HASH (currproc->pr_pid);
702 op++; /* try next entry in hash table */
734 * For the moment recreate the hash table each time, as the code
746 op = oldbase + HASH (currproc->pr_pid);
|
| m_irixsgi.c | 99 * the program. We keep these things in a hash table, which is
109 #define HASH(x) ((x << 1) % oldprocs)
1020 op = oldbase + HASH (currproc->pr_pid);
1037 op++; /* try next entry in hash table */
1083 * For the moment recreate the hash table each time, as the code
1095 op = oldbase + HASH (currproc->pr_pid);
|
| m_linux.c | 80 #include "hash.h"
234 #define HASH(x) (((x) * 1686629713U) % HASH_SIZE)
863 /* mark all hash table entries as not seen */
870 /* mark all hash table entries as not seen */
912 /* look up hash table entry */
|
| m_linuxthr.c | 207 #define HASH(x) (((x) * 1686629713U) % HASH_SIZE)
364 /* make sure the hash table is empty */
700 /* mark all hash table entries as not seen */
730 /* look up hash table entry */
731 proc = pp = ptable[HASH(pid)];
743 ptable[HASH(pid)] = proc;
817 /* look up hash table entry for parent */
821 parent = ptable[HASH(pid)];
|
| /src/external/cddl/osnet/dist/tools/ctf/cvt/ |
| st_parse.c | 46 #define HASH(NUM) ((int)(NUM & (BUCKETS - 1)))
464 * Check if we have this node in the hash table already
469 int bucket = HASH(h);
923 * find the tdesc struct in the hash table for this type
927 if (tdp == NULL) { /* not in hash list */
1057 lookup_name(tdesc_t **hash, const char *name1)
1062 for (tdp = hash[bucket]; tdp != NULL; tdp = tdp->t_next) {
1081 * Add a node to the hash queues.
1086 int hash = HASH(num) local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| cse.cc | 65 a hash table for most expressions, and a vector of "quantity
75 is to keep it in a hash table.
104 REG expressions with qty_table `mode' must be in the hash table for both
108 any mode, two REG expressions might be equivalent in the hash table
116 putting the constant in the hash table as is usual for non-regs.
129 is recorded in the hash table along with the actual RTL
135 we use a hash table called `table'. It has a fixed number of buckets
138 hash codes.
145 The hash code of a register reference is computed using the quantity
149 hash table not just that expression but all expressions whose value
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| cse.cc | 65 a hash table for most expressions, and a vector of "quantity
75 is to keep it in a hash table.
104 REG expressions with qty_table `mode' must be in the hash table for both
108 any mode, two REG expressions might be equivalent in the hash table
116 putting the constant in the hash table as is usual for non-regs.
129 is recorded in the hash table along with the actual RTL
135 we use a hash table called `table'. It has a fixed number of buckets
138 hash codes.
145 The hash code of a register reference is computed using the quantity
149 hash table not just that expression but all expressions whose value
[all...] |
| /src/usr.sbin/lockstat/ |
| main.c | 136 #define HASH(a) (&bucket[((a) >> 6) & (__arraycount(bucket) - 1)])
637 bp = HASH(lb->lb_lock);
|
| /src/external/mpl/bind/dist/lib/dns/ |
| gen.c | 158 uint8_t hash; member in struct:ttnam
184 HASH(char *string) {
429 ttn->hash = HASH(ttn->typebuf);
833 * Spit out a quick and dirty hash function. Here,
835 * a hash. This isn't perfect, but it will generate "pretty
840 * the hash (mod 256) for each name.
866 printf("\t\tcase %u: \\\n", ttn->hash);
870 * this hash.
873 if (ttn2->todo && ttn2->hash == ttn->hash)
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| gen.c | 524 HASH(char *string) {
548 unsigned int hash; local
798 * Spit out a quick and dirty hash function. Here,
800 * a hash. This isn't perfect, but it will generate "pretty
805 * the hash (mod 256) for each name.
837 hash = HASH(ttn->typebuf);
838 fprintf(stdout, "\t\tcase %u: \\\n", hash);
842 * this hash.
849 if (hash == HASH(ttn2->typebuf))
[all...] |
| /src/sys/dev/usb/ |
| ohci.c | 1575 /* remove xfer's TDs from the hash */
1888 * To make the translation possible (and fast) we use a hash table of
1890 * hash value.
1893 #define HASH(a) (((a) >> 4) % OHCI_HASH_SIZE)
1898 int h = HASH(std->physaddr);
1918 int h = HASH(a);
1933 int h = HASH(sitd->physaddr);
1963 int h = HASH(a);
|
| /src/external/mpl/dhcp/dist/includes/ |
| dhctoken.h | 323 HASH = 621,
|
| /src/external/mpl/dhcp/dist/keama/ |
| dhctoken.h | 327 HASH = 621,
|
