| /mirbsd/src/gnu/usr.bin/perl/Porting/ |
| D | checkAUTHORS.pl | 8 my ($rank, $ta, @authors, %authors, %untraced, %patchers, %committers);
9 my $result = GetOptions ("rank" => \$rank, # rank authors
13 if (!$result or (($rank||0) + ($ta||0) + (@authors ? 1 : 0) != 1) or !@ARGV) {
249 if ($rank) {
|
| /mirbsd/src/usr.sbin/lpr/common_source/ |
| D | displayq.c | 97 int i, rank, nitems, fd, ret, len; in displayq() local
234 for (i = 0, rank = 1; i < nitems; i++) { in displayq()
237 inform(q->q_name, rank++); in displayq()
340 inform(char *cf, int rank) in inform() argument
369 prank(rank); in inform()
374 prank(rank); in inform()
|
| /mirbsd/src/gnu/usr.bin/perl/lib/base/t/ |
| D | fields.t | 70 eval { $phash = fields::phash(name => "Joe", rank => "Captain") };
72 is( $phash->{rank}, "Captain" );
|
| /mirbsd/src/lib/libssl/src/crypto/bf/ |
| D | bf_opts.c | 231 int rank[16]; in main() local
241 rank[i]=0; in main()
|
| /mirbsd/src/lib/libssl/src/crypto/cast/ |
| D | castopts.c | 241 int rank[16]; in main() local
251 rank[i]=0; in main()
|
| /mirbsd/src/kern/z/ |
| D | trees.c | 840 int rank; /* index in bl_order */ local
849 for (rank = 0; rank < blcodes; rank++) {
850 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
851 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
|
| /mirbsd/src/gnu/usr.bin/binutils/gas/ |
| D | expr.h | 163 extern segT expr (int rank, expressionS * resultP);
|
| D | expr.c | 1624 operator_rankT rank = (operator_rankT) rankarg; in expr() local
1631 know (rank >= 0); in expr()
1634 if (rank == 0) in expr()
1643 while (op_left != O_illegal && op_rank[(int) op_left] > rank) in expr()
|
| /mirbsd/src/usr.bin/xlint/lint1/ |
| D | lint.h | 100 #define rank(t) (ttab[t].tt_rank) macro
|
| D | tree.c | 1741 if (rank(nt) < rank(ot)) { in iiconv()
1757 } else if (isutyp(ot) && !isutyp(nt) && rank(nt) == rank(ot)) { in iiconv()
|
| /mirbsd/src/lib/libdes/ |
| D | des_opts.c | 435 int rank[16]; local
445 rank[i]=0;
|
| /mirbsd/src/lib/libssl/src/crypto/des/ |
| D | des_opts.c | 423 int rank[16]; in main() local
433 rank[i]=0; in main()
|
| /mirbsd/src/gnu/usr.bin/perl/pod/ |
| D | perldsc.pod | 674 # establish a sort order (rank) for each role
676 for ( qw(lead wife son daughter pal pet) ) { $rank{$_} = ++$i }
681 # and print these according to rank order
682 for $role ( sort { $rank{$a} <=> $rank{$b} } keys %{ $HoH{$family} } ) {
|
| /mirbsd/src/share/doc/psd/23.Cknr/ |
| D | cman3 | 207 yields a 1-dimensional array with rank \fIi\fR of objects
211 with rank
217 array with rank
287 with rank 3\(mu5\(mu7.
|
| D | cman5 | 515 of rank
519 array with rank
|
| /mirbsd/src/gnu/usr.bin/perl/lib/Locale/Maketext/ |
| D | ChangeLog | 62 * Release 1.04: Implementing proper HTTP "tag;q=rank" parsing for
|
| /mirbsd/src/gnu/usr.bin/binutils/gdb/ |
| D | gdbtypes.h | 776 int *rank; member
1312 #define LENGTH_MATCH(bv) ((bv)->rank[0])
|
| D | gdbtypes.c | 2209 tmp = a->rank[i] - b->rank[i]; in compare_badness()
2246 bv->rank = xmalloc ((nargs + 1) * sizeof (int)); in rank_function()
2259 bv->rank[i] = rank_one_type (parms[i-1], args[i-1]); in rank_function()
2263 bv->rank[i] = TOO_FEW_PARAMS_BADNESS; in rank_function()
|
| D | valops.c | 2161 fprintf_filtered (gdb_stderr,"...Badness @ %d : %d\n", jj, bv->rank[jj]); in find_oload_champ()
2192 if (oload_champ_bv->rank[ix] >= 100) in classify_oload_match()
2194 else if (oload_champ_bv->rank[ix] >= 10) in classify_oload_match()
|
| /mirbsd/src/gnu/usr.bin/perl/lib/Math/ |
| D | Complex.t | 194 print 'not ' unless (\$@ =~ /root rank must be/);
|
| /mirbsd/src/gnu/usr.bin/perl/lib/unicore/ |
| D | Index.txt | 1923 higher rank than 227B
2415 lower rank than 227A
|
| D | NamesList.txt | 10978 = lower rank than
10981 = higher rank than
|
| /mirbsd/src/share/dict/ |
| D | web2a | 21925 flag rank
33238 lineal rank
45937 rank-brained
45938 rank-feeding
45939 rank-growing
45940 rank-grown
45943 rank-minded
45944 rank-scented
45945 rank-scenting
45946 rank-smelling
[all …]
|
| D | words | 18918 rank
|
| /mirbsd/src/gnu/usr.bin/perl/ |
| D | Changes | 318 checkAUTHORS.pl --rank would loop infinitely on an empty results array.
|