Searched refs:rank (Results 1 - 25 of 43) sorted by relevance

12

/freebsd-9.3-release/contrib/groff/src/devices/grops/
H A Dps.h89 void supply_resource(resource *r, int rank, FILE *outfp,
91 void process_file(int rank, FILE *fp, const char *filename, FILE *outfp);
99 int do_begin_resource(const char *ptr, int rank, FILE *fp, FILE *outfp);
100 int do_include_resource(const char *ptr, int rank, FILE *fp, FILE *outfp);
101 int do_begin_document(const char *ptr, int rank, FILE *fp, FILE *outfp);
102 int do_include_document(const char *ptr, int rank, FILE *fp, FILE *outfp);
103 int do_begin_procset(const char *ptr, int rank, FILE *fp, FILE *outfp);
104 int do_include_procset(const char *ptr, int rank, FILE *fp, FILE *outfp);
105 int do_begin_font(const char *ptr, int rank, FILE *fp, FILE *outfp);
106 int do_include_font(const char *ptr, int rank, FIL
[all...]
H A Dpsrm.cpp133 int rank; member in struct:resource
140 : next(0), type(t), flags(0), revision(r), filename(0), rank(-1)
240 if (r->rank >= nranks)
241 nranks = r->rank + 1;
243 // Sort resource_list in reverse order of rank.
252 i = r->rank < 0 ? 0 : r->rank + 1;
267 assert(r->rank >= r->next->rank);
269 if (r->type == RESOURCE_FONT && r->rank >
338 supply_resource(resource *r, int rank, FILE *outfp, int is_document) argument
611 do_include_resource(const char *ptr, int rank, FILE *, FILE *outfp) argument
637 do_include_document(const char *ptr, int rank, FILE *, FILE *outfp) argument
661 do_include_procset(const char *ptr, int rank, FILE *, FILE *outfp) argument
685 do_include_file(const char *ptr, int rank, FILE *, FILE *outfp) argument
709 do_include_font(const char *ptr, int rank, FILE *, FILE *outfp) argument
944 process_file(int rank, FILE *fp, const char *filename, FILE *outfp) argument
[all...]
/freebsd-9.3-release/tools/regression/geom/ConfCmp/
H A Da2.conf8 <rank>4</rank>
18 <rank>4</rank>
28 <rank>4</rank>
38 <rank>4</rank>
48 <rank>4</rank>
[all...]
H A Da2a.conf8 <rank>4</rank>
18 <rank>4</rank>
28 <rank>4</rank>
38 <rank>4</rank>
48 <rank>4</rank>
[all...]
H A Da2b.conf8 <rank>4</rank>
18 <rank>4</rank>
28 <rank>4</rank>
38 <rank>4</rank>
48 <rank>4</rank>
[all...]
H A Da2c.conf8 <rank>4</rank>
18 <rank>4</rank>
28 <rank>4</rank>
38 <rank>4</rank>
47 <rank>4</rank>
[all...]
H A Da2d.conf8 <rank>4</rank>
18 <rank>4</rank>
28 <rank>4</rank>
38 <rank>4</rank>
48 <rank>4</rank>
[all...]
H A Da1.conf10 <rank>4</rank>
22 <rank>4</rank>
34 <rank>4</rank>
46 <rank>4</rank>
58 <rank>4</rank>
[all...]
H A Da1a.conf10 <rank>4</rank>
22 <rank>4</rank>
34 <rank>4</rank>
46 <rank>4</rank>
58 <rank>4</rank>
[all...]
H A Da1b.conf10 <rank>4</rank>
22 <rank>4</rank>
34 <rank>4</rank>
46 <rank>4</rank>
58 <rank>4</rank>
[all...]
H A Da1c.conf10 <rank>4</rank>
22 <rank>4</rank>
34 <rank>4</rank>
46 <rank>4</rank>
58 <rank>4</rank>
[all...]
H A Da1d.conf10 <rank>4</rank>
22 <rank>4</rank>
34 <rank>4</rank>
46 <rank>4</rank>
58 <rank>4</rank>
[all...]
/freebsd-9.3-release/contrib/gcc/
H A Dtree-ssa-reassoc.c60 they are in proper rank order.
71 binary expressions whose operands are the same rank (or
81 rank in parentheses), with opcode PLUS_EXPR:
89 You want to first merge all leaves of the same rank, as much as
97 be exposed to redundancy elimination as a rank 1 operand.
100 consider it to now be a rank two operand, and merge it with d and e,
140 same rank. If so, you know to order it
149 If all three are of the same rank, you can't expose them all in a
169 /* Operator, rank pair. */
172 unsigned int rank; member in struct:operand_entry
206 insert_operand_rank(tree e, unsigned int rank) argument
263 unsigned int rank, maxrank; local
1418 unsigned int rank = 2; local
[all...]
H A Dsched-ebb.c67 static int rank (rtx, rtx);
205 rank (rtx insn1, rtx insn2)
264 rank,
399 rank. */
203 rank (rtx insn1, rtx insn2) function
/freebsd-9.3-release/contrib/ofed/management/opensm/opensm/
H A Dosm_ucast_ftree.c56 * FatTree rank is bounded between 2 and 8:
57 * - Tree of rank 1 has only trivial routing paths,
59 * - Why maximum rank is 8:
65 * which means that maximal tree rank is 8.
170 uint32_t rank; member in struct:ftree_sw_t_
552 p_sw->rank = 0xFFFFFFFF;
649 return (p_sw->rank != 0xFFFFFFFF);
1112 if (p_sw->rank == i)
1136 " - FatTree rank (roots to leaf switches): %u\n",
1139 " - FatTree max switch rank
[all...]
H A Dosm_ucast_updn.c75 unsigned rank; member in struct:updn_node
81 /* This function returns direction based on rank and guid info of current &
98 /* Equal rank, decide by id number, bigger == UP direction */
160 next_dir = updn_get_dir(u->rank, rem_u->rank,
209 /* rank is a SWITCH for BFS purpose */
230 if (!u->rank)
237 /* Go over all remote nodes and rank them (if not already visited) */
264 if (remote_u->rank > u->rank
[all...]
/freebsd-9.3-release/usr.sbin/lpr/common_source/
H A Ddisplayq.c85 static int rank; /* order to be printed (-1=none, 0=active) */ variable
111 rank = -1;
399 if (rank < 0)
400 rank = 0;
402 rank++;
429 prank(rank);
434 prank(rank);
608 * Print the job's rank in the queue,
/freebsd-9.3-release/crypto/openssl/crypto/bf/
H A Dbf_opts.c221 int rank[16]; local
230 rank[i] = 0;
/freebsd-9.3-release/crypto/openssl/crypto/cast/
H A Dcastopts.c231 int rank[16]; local
240 rank[i] = 0;
/freebsd-9.3-release/contrib/bind9/bin/named/
H A Dlwdgabn.c109 int rank; member in struct:__anon117
116 return (a->rank - b->rank);
151 addrs[i].rank = (*order)(&addrs[i].address, arg);
/freebsd-9.3-release/contrib/libstdc++/include/tr1/
H A Dtype_traits_fwd.h164 struct rank;
/freebsd-9.3-release/sys/geom/
H A Dgeom_dump.c74 gp, gp->class->name, gp->name, gp->rank);
239 sbuf_printf(sb, " <rank>%d</rank>\n", gp->rank);
H A Dgeom_subr.c347 gp->rank = 1;
656 * numerical rank) at all times.
657 * When an attach is done, the attaching geoms rank is invalidated
660 * sequence. If we cannot assign rank to a geom because it's
661 * prerequisites do not have rank, we move that element to the tail
662 * of the sequence with invalid rank as well.
664 * to assign it a rank, there must be a loop and we fail back to
681 /* Invalidate this geoms rank and move it to the tail */
684 gp->rank = 0;
691 /* re-rank th
[all...]
/freebsd-9.3-release/lib/libz/
H A Dtrees.c840 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);
/freebsd-9.3-release/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A Dtrees.c842 int rank; /* index in bl_order */ local
851 for (rank = 0; rank < blcodes; rank++) {
852 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
853 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);

Completed in 289 milliseconds

12