Home
last modified time | relevance | path

Searched refs:HASH (Results 1 – 25 of 85) sorted by relevance

1234

/mirbsd/src/gnu/usr.bin/perl/ext/Data/Dumper/t/
Dpair.t27 my $HASH = { alpha => 'beta', gamma => 'vlissides' };
43 is (Data::Dumper::DumperX($HASH), $WANT,
46 is (Data::Dumper::DumperX($HASH), $want_colon, 'XS: $Data::Dumper::Pair = " : "');
47 my $dd = Data::Dumper->new([ $HASH ])->Pair(',');
56 is (Data::Dumper::Dumper($HASH), $WANT,
59 is (Data::Dumper::Dumper($HASH), $want_colon, 'Perl: $Data::Dumper::Pair = " : "');
60 my $dd = Data::Dumper->new([ $HASH ])->Pair(',');
/mirbsd/src/gnu/usr.bin/perl/lib/Switch/t/
Dgiven.t40 # POSSIBLE ARGS: NUMERIC, STRING, ARRAY, HASH, REGEX, CODE
71 # HASH
80 when {0} { ok (0) } else { ok (1) } # ; -> SUB, NOT HASH
81 when {1} { ok (1) } else { ok (0) } # ; -> SUB, NOT HASH
111 # HASH
120 when {0} { ok (0) } else { ok (1) } # ; -> SUB, NOT HASH
121 when {1} { ok (1) } else { ok (0) } # ; -> SUB, NOT HASH
151 # HASH
161 when {0} { ok (0) } else { ok (1) } # ; -> SUB, NOT HASH
162 when {1} { ok (1) } else { ok (0) } # ; -> SUB, NOT HASH
[all …]
Dswitch.t40 # POSSIBLE ARGS: NUMERIC, STRING, ARRAY, HASH, REGEX, CODE
71 # HASH
80 case {0} { ok (0) } else { ok (1) } # ; -> SUB, NOT HASH
81 case {1} { ok (1) } else { ok (0) } # ; -> SUB, NOT HASH
111 # HASH
120 case {0} { ok (0) } else { ok (1) } # ; -> SUB, NOT HASH
121 case {1} { ok (1) } else { ok (0) } # ; -> SUB, NOT HASH
151 # HASH
161 case {0} { ok (0) } else { ok (1) } # ; -> SUB, NOT HASH
162 case {1} { ok (1) } else { ok (0) } # ; -> SUB, NOT HASH
[all …]
/mirbsd/src/gnu/usr.bin/perl/x2p/
Dhash.c20 hfetch(register HASH *tb, char *key) in hfetch()
46 hstore(register HASH *tb, char *key, STR *val) in hstore()
94 hsplit(HASH *tb) in hsplit()
130 HASH *
133 register HASH *tb = (HASH*)safemalloc(sizeof(HASH)); in hnew()
144 hiterinit(register HASH *tb) in hiterinit()
Dhash.h43 STR * hfetch ( HASH *tb, char *key );
44 int hiterinit ( HASH *tb );
45 HASH * hnew ( void );
46 void hsplit ( HASH *tb );
47 bool hstore ( HASH *tb, char *key, STR *val );
Da2p.h353 typedef struct htbl HASH; typedef
449 EXT HASH *symtab;
450 EXT HASH *curarghash;
/mirbsd/src/gnu/usr.bin/perl/t/comp/
Dterm.t51 if (ref($a) eq 'HASH') {print "ok 18\n";} else {print "not ok 18\n";}
59 if (ref($a) eq 'HASH') {print "ok 20\n";} else {print "not ok 20\n";}
64 if (ref($a) eq 'HASH') {print "ok 21\n";} else {print "not ok 21\n";}
68 if (ref($a) eq 'HASH') {print "ok 22\n";} else {print "not ok 22\n";}
/mirbsd/src/lib/libssl/src/doc/crypto/
DEVP_BytesToKey.pod47 D_i = HASH^count(D_(i-1) || data || salt)
49 where || denotes concatentaion, D_0 is empty, HASH is the digest
50 algorithm in use, HASH^1(data) is simply HASH(data), HASH^2(data)
51 is HASH(HASH(data)) and so on.
/mirbsd/src/gnu/usr.bin/cvs/diff/
Dio.c25 #define HASH(h, c) ((c) + ROL (h, 7)) macro
225 h = HASH (h, ISUPPER (c) ? tolower (c) : c);
240 h = HASH (h, ' ');
243 h = HASH (h, ISUPPER (c) ? tolower (c) : c);
247 h = HASH (h, ISUPPER (c) ? tolower (c) : c);
255 h = HASH (h, c);
270 h = HASH (h, ' ');
273 h = HASH (h, c);
277 h = HASH (h, c);
/mirbsd/src/gnu/usr.bin/perl/lib/Tie/
DFile.pm1455 sub HASH () { 1 } subroutine
1492 $self->[HASH]{$k} = $n;
1494 delete $self->[HASH]{$k};
1513 my $oldnode = $self->[HASH]{$key};
1544 next unless exists $self->[HASH]{$key};
1545 my $old_data = $self->[HEAP]->remove($self->[HASH]{$key});
1565 if (exists $self->[HASH]{$key}) {
1566 $self->[HEAP]->lookup($self->[HASH]{$key});
1575 my $loc = $self->[HASH]{$key};
1583 $self->[HEAP]->promote($self->[HASH]{$key});
[all …]
/mirbsd/src/lib/libssl/src/crypto/dsa/
Ddsa_gen.c64 #define HASH EVP_sha() macro
69 #define HASH EVP_sha1() macro
164 EVP_Digest(seed,SHA_DIGEST_LENGTH,md,NULL,HASH, NULL); in DSA_generate_parameters()
165 EVP_Digest(buf,SHA_DIGEST_LENGTH,buf2,NULL,HASH, NULL); in DSA_generate_parameters()
212 EVP_Digest(buf,SHA_DIGEST_LENGTH,md,NULL,HASH, NULL); in DSA_generate_parameters()
/mirbsd/src/gnu/usr.bin/perl/lib/Memoize/t/
Dtiefeatures.t41 memoize 'nul', SCALAR_CACHE => [HASH => \%s], LIST_CACHE => [HASH => \%l];
Dtie_storable.t55 SCALAR_CACHE => [HASH => \%cache],
71 SCALAR_CACHE => [HASH => \%cache],
Dtie_gdbm.t48 SCALAR_CACHE => [HASH => \%cache],
62 SCALAR_CACHE => [HASH => \%cache],
Dtie_ndbm.t51 SCALAR_CACHE => [HASH => \%cache],
65 SCALAR_CACHE => [HASH => \%cache],
Dtie_sdbm.t50 SCALAR_CACHE => [HASH => \%cache],
64 SCALAR_CACHE => [HASH => \%cache],
/mirbsd/src/gnu/usr.bin/perl/lib/
DSymbol.pm153 my $stem_symtab = *{$stem}{HASH};
159 my $leaf_symtab = *{$stem_symtab->{$leaf}}{HASH};
/mirbsd/src/usr.sbin/ppp/ppp/
Dpred.c58 #define HASH(state, x) state->hash = (state->hash << 4) ^ (x) macro
83 HASH(state, *source++); in compress()
96 HASH(state, *source++); in SyncTable()
120 HASH(state, *dest++); in decompress()
/mirbsd/src/usr.sbin/cron/
Ddatabase.c33 #define HASH(a,b) ((a)+(b)) macro
70 if (old_db->mtime == HASH(statbuf.st_mtime, syscron_stat.st_mtime)) { in load_database()
81 new_db.mtime = HASH(statbuf.st_mtime, syscron_stat.st_mtime); in load_database()
/mirbsd/src/gnu/usr.bin/perl/t/op/
Davhv.t141 is (ref($avhv->[0]), 'HASH');
169 is (ref $avhv->[0], 'HASH');
/mirbsd/src/usr.bin/ssh/
Ddeattack.c70 #define HASH(x) get_u32(x) macro
147 for (i = HASH(c) & (n - 1); h[i] != HASH_UNUSED; in detect_attack()
/mirbsd/src/gnu/usr.bin/perl/lib/Attribute/
DHandlers.pm26 HASH => [qw[HASH]],
33 my %sigil = (SCALAR=>'$', ARRAY=>'@', HASH=>'%');
/mirbsd/src/gnu/usr.bin/perl/ext/Opcode/
DSafe.pm91 my $stem_symtab = *{$stem}{HASH};
100 my $leaf_symtab = *{$leaf_glob}{HASH};
/mirbsd/src/gnu/usr.bin/perl/lib/Attribute/Handlers/demo/
Ddemo_range.pl5 sub Ranged : ATTR(HASH) {
/mirbsd/src/gnu/usr.bin/perl/lib/Memoize/
DREADME55 ** Please convert all extant software to use HASH instead. **
69 duplicate the logic for handling TIE. HASH is much simpler to use,

1234