Home
last modified time | relevance | path

Searched refs:rank (Results 1 – 25 of 58) sorted by relevance

123

/trueos/contrib/groff/src/devices/grops/
HDps.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, FILE *fp, FILE *outfp);
[all …]
HDpsrm.cpp133 int rank; member
140 : next(0), type(t), flags(0), revision(r), filename(0), rank(-1) in resource()
240 if (r->rank >= nranks) in document_setup()
241 nranks = r->rank + 1; in document_setup()
252 i = r->rank < 0 ? 0 : r->rank + 1; in document_setup()
267 assert(r->rank >= r->next->rank); in document_setup()
269 if (r->type == RESOURCE_FONT && r->rank >= 0) in document_setup()
338 void resource_manager::supply_resource(resource *r, int rank, FILE *outfp, in supply_resource() argument
348 if (rank > r->rank) in supply_resource()
349 r->rank = rank; in supply_resource()
[all …]
/trueos/tools/regression/geom/ConfCmp/
HDa1b.conf10 <rank>4</rank>
22 <rank>4</rank>
34 <rank>4</rank>
46 <rank>4</rank>
58 <rank>4</rank>
70 <rank>4</rank>
82 <rank>4</rank>
94 <rank>4</rank>
106 <rank>4</rank>
118 <rank>3</rank>
[all …]
HDa1.conf10 <rank>4</rank>
22 <rank>4</rank>
34 <rank>4</rank>
46 <rank>4</rank>
58 <rank>4</rank>
70 <rank>4</rank>
82 <rank>4</rank>
94 <rank>4</rank>
106 <rank>4</rank>
118 <rank>3</rank>
[all …]
HDa1c.conf10 <rank>4</rank>
22 <rank>4</rank>
34 <rank>4</rank>
46 <rank>4</rank>
58 <rank>4</rank>
70 <rank>4</rank>
82 <rank>4</rank>
94 <rank>4</rank>
106 <rank>4</rank>
118 <rank>3</rank>
[all …]
HDa1a.conf10 <rank>4</rank>
22 <rank>4</rank>
34 <rank>4</rank>
46 <rank>4</rank>
58 <rank>4</rank>
70 <rank>4</rank>
82 <rank>4</rank>
94 <rank>4</rank>
106 <rank>4</rank>
118 <rank>3</rank>
[all …]
HDa1d.conf10 <rank>4</rank>
22 <rank>4</rank>
34 <rank>4</rank>
46 <rank>4</rank>
58 <rank>4</rank>
70 <rank>4</rank>
82 <rank>4</rank>
94 <rank>4</rank>
106 <rank>4</rank>
118 <rank>3</rank>
[all …]
HDa2a.conf8 <rank>4</rank>
18 <rank>4</rank>
28 <rank>4</rank>
38 <rank>4</rank>
48 <rank>4</rank>
58 <rank>3</rank>
68 <rank>2</rank>
81 <rank>2</rank>
120 <rank>3</rank>
199 <rank>1</rank>
HDa2.conf8 <rank>4</rank>
18 <rank>4</rank>
28 <rank>4</rank>
38 <rank>4</rank>
48 <rank>4</rank>
58 <rank>3</rank>
68 <rank>2</rank>
81 <rank>2</rank>
120 <rank>3</rank>
199 <rank>1</rank>
HDa2c.conf8 <rank>4</rank>
18 <rank>4</rank>
28 <rank>4</rank>
38 <rank>4</rank>
47 <rank>4</rank>
57 <rank>3</rank>
67 <rank>2</rank>
80 <rank>2</rank>
119 <rank>3</rank>
198 <rank>1</rank>
HDa2b.conf8 <rank>4</rank>
18 <rank>4</rank>
28 <rank>4</rank>
38 <rank>4</rank>
48 <rank>4</rank>
58 <rank>3</rank>
68 <rank>2</rank>
81 <rank>2</rank>
120 <rank>3</rank>
199 <rank>1</rank>
HDa2d.conf8 <rank>4</rank>
18 <rank>4</rank>
28 <rank>4</rank>
38 <rank>4</rank>
48 <rank>4</rank>
62 <rank>3</rank>
72 <rank>2</rank>
85 <rank>2</rank>
124 <rank>3</rank>
203 <rank>1</rank>
/trueos/contrib/gcc/
HDtree-ssa-reassoc.c172 unsigned int rank; member
206 insert_operand_rank (tree e, unsigned int rank) in insert_operand_rank() argument
212 new_pair->rank = rank; in insert_operand_rank()
263 unsigned int rank, maxrank; in get_rank() local
268 return find_operand_rank (e)->rank; in get_rank()
281 return vr->rank; in get_rank()
285 rank = 0; in get_rank()
289 rank = MAX (rank, get_rank (rhs)); in get_rank()
295 && rank != maxrank; in get_rank()
297 rank = MAX(rank, get_rank (TREE_OPERAND (rhs, i))); in get_rank()
[all …]
HDsched-ebb.c65 static int rank (rtx, rtx);
203 rank (rtx insn1, rtx insn2) in rank() function
262 rank,
/trueos/contrib/ofed/management/opensm/opensm/
HDosm_ucast_ftree.c170 uint32_t rank; member
552 p_sw->rank = 0xFFFFFFFF; in __osm_ftree_sw_create()
649 return (p_sw->rank != 0xFFFFFFFF); in __osm_ftree_sw_ranked()
1112 if (p_sw->rank == i) in __osm_ftree_fabric_dump()
1152 if (p_sw->rank == i) in __osm_ftree_fabric_dump_general_info()
1175 if (p_sw->rank == 0) in __osm_ftree_fabric_dump_general_info()
1286 new_tuple[0] = (uint8_t) p_sw->rank; in __osm_ftree_fabric_assign_first_tuple()
1287 for (i = 1; i <= p_sw->rank; i++) in __osm_ftree_fabric_assign_first_tuple()
1389 if (p_sw->rank != p_ftree->leaf_switch_rank) { in __osm_ftree_fabric_mark_leaf_switches()
1398 p_sw->rank, p_ftree->leaf_switch_rank); in __osm_ftree_fabric_mark_leaf_switches()
[all …]
HDosm_ucast_updn.c75 unsigned rank; member
160 next_dir = updn_get_dir(u->rank, rem_u->rank, in updn_bfs_by_node()
230 if (!u->rank) in updn_subn_rank()
264 if (remote_u->rank > u->rank + 1) { in updn_subn_rank()
265 remote_u->rank = u->rank + 1; in updn_subn_rank()
266 max_rank = remote_u->rank; in updn_subn_rank()
272 remote_u->rank); in updn_subn_rank()
300 rank != 0) in updn_clear_root_hops()
403 u->rank = 0xffffffff; in create_updn_node()
507 ((struct updn_node *)p_sw->priv)->rank = 0; in updn_find_root_nodes_by_min_hop()
[all …]
/trueos/usr.sbin/lpr/common_source/
HDdisplayq.c84 static int rank; /* order to be printed (-1=none, 0=active) */ variable
110 rank = -1; in displayq()
398 if (rank < 0) in inform()
399 rank = 0; in inform()
401 rank++; in inform()
428 prank(rank); in inform()
433 prank(rank); in inform()
/trueos/contrib/ofed/management/opensm/doc/
HDcurrent-routing.txt145 a rank of 0. Using the BFS algorithm, the rest of the switch nodes in the
203 - Tree rank should be between two and eight (inclusively)
204 - Switches of the same rank should have the same number
207 - Switches of the same rank should have the same number
209 - Switches of the same rank should have the same number
211 - Switches of the same rank should have the same number
213 - All the CAs have to be at the same tree level (rank).
217 - Tree rank should be between two and eight (inclusively)
218 - All the Compute Nodes** have to be at the same tree level (rank).
/trueos/crypto/openssl/crypto/bf/
HDbf_opts.c221 int rank[16]; in main() local
230 rank[i] = 0; in main()
/trueos/crypto/openssl/crypto/cast/
HDcastopts.c231 int rank[16]; in main() local
240 rank[i] = 0; in main()
/trueos/sys/geom/
HDgeom_subr.c349 gp->rank = 1; in g_new_geomf()
767 gp->rank = 0; in redo_rank()
776 gp1->rank = 0; in redo_rank()
781 n = cp->provider->geom->rank; in redo_rank()
788 gp1->rank = m; in redo_rank()
905 if ((g_debugflags & 16) && pp->geom->rank == 1) in g_access()
1382 gprintln(" rank: %d", gp->rank); in db_show_geom_geom()
1388 gprintf("geom: %s (%p), rank=%d", gp->name, gp, gp->rank); in db_show_geom_geom()
HDgeom_dump.c75 gp, gp->class->name, gp->name, gp->rank); in g_confdot_geom()
242 sbuf_printf(sb, " <rank>%d</rank>\n", gp->rank); in g_conf_geom()
/trueos/lib/libz/
HDtrees.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);
/trueos/sys/cddl/contrib/opensolaris/uts/common/zmod/
HDtrees.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);
/trueos/contrib/gcc/cp/
HDcall.c82 conversion_rank rank; member
119 : (NODE)->rank)
509 conversion_rank rank = CONVERSION_RANK (from); in build_conv() local
524 if (rank < cr_std) in build_conv()
525 rank = cr_std; in build_conv()
529 if (rank < cr_exact) in build_conv()
530 rank = cr_exact; in build_conv()
536 t->rank = rank; in build_conv()
650 conv->rank = part_conv->rank; in standard_conversion()
823 && conv->rank < cr_pbool)) in standard_conversion()
[all …]

123