/freebsd-11-stable/contrib/groff/src/devices/grops/ |
H A D | ps.h | 89 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 D | psrm.cpp | 133 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-11-stable/tools/regression/geom/ConfCmp/ |
H A D | a2.conf | 8 <rank>4</rank> 18 <rank>4</rank> 28 <rank>4</rank> 38 <rank>4</rank> 48 <rank>4</rank> [all...] |
H A D | a2a.conf | 8 <rank>4</rank> 18 <rank>4</rank> 28 <rank>4</rank> 38 <rank>4</rank> 48 <rank>4</rank> [all...] |
H A D | a2b.conf | 8 <rank>4</rank> 18 <rank>4</rank> 28 <rank>4</rank> 38 <rank>4</rank> 48 <rank>4</rank> [all...] |
H A D | a2c.conf | 8 <rank>4</rank> 18 <rank>4</rank> 28 <rank>4</rank> 38 <rank>4</rank> 47 <rank>4</rank> [all...] |
H A D | a2d.conf | 8 <rank>4</rank> 18 <rank>4</rank> 28 <rank>4</rank> 38 <rank>4</rank> 48 <rank>4</rank> [all...] |
H A D | a1.conf | 10 <rank>4</rank> 22 <rank>4</rank> 34 <rank>4</rank> 46 <rank>4</rank> 58 <rank>4</rank> [all...] |
H A D | a1a.conf | 10 <rank>4</rank> 22 <rank>4</rank> 34 <rank>4</rank> 46 <rank>4</rank> 58 <rank>4</rank> [all...] |
H A D | a1b.conf | 10 <rank>4</rank> 22 <rank>4</rank> 34 <rank>4</rank> 46 <rank>4</rank> 58 <rank>4</rank> [all...] |
H A D | a1c.conf | 10 <rank>4</rank> 22 <rank>4</rank> 34 <rank>4</rank> 46 <rank>4</rank> 58 <rank>4</rank> [all...] |
H A D | a1d.conf | 10 <rank>4</rank> 22 <rank>4</rank> 34 <rank>4</rank> 46 <rank>4</rank> 58 <rank>4</rank> [all...] |
/freebsd-11-stable/contrib/jemalloc/src/ |
H A D | witness.c | 5 witness_init(witness_t *witness, const char *name, witness_rank_t rank, argument 10 witness->rank = rank; 23 malloc_printf("<jemalloc>: Lock rank order reversal:"); 25 malloc_printf(" %s(%u)", w->name, w->rank); 27 malloc_printf(" %s(%u)\n", witness->name, witness->rank); 45 witness->rank); 63 witness->rank); 84 malloc_printf(" %s(%u)", w->name, w->rank);
|
H A D | mutex.c | 83 malloc_mutex_init(malloc_mutex_t *mutex, const char *name, witness_rank_t rank) argument 118 witness_init(&mutex->witness, name, rank, NULL); 144 mutex->witness.rank)) {
|
/freebsd-11-stable/contrib/jemalloc/include/jemalloc/internal/ |
H A D | witness.h | 10 * Lock ranks. Witnesses with rank WITNESS_RANK_OMIT are completely ignored by 41 #define WITNESS_INITIALIZER(rank) {"initializer", rank, NULL, {NULL, NULL}} 52 * Witness rank, where 0 is lowest and UINT_MAX is highest. Witnesses 53 * must be acquired in order of increasing rank. 55 witness_rank_t rank; member in struct:witness_s 58 * If two witnesses are of equal rank and they have the samp comp 60 * between witnesses of equal rank. 72 void witness_init(witness_t *witness, const char *name, witness_rank_t rank, 132 if (witness->rank [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | tree-ssa-reassoc.c | 60 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...] |
/freebsd-11-stable/contrib/ofed/opensm/opensm/ |
H A D | osm_ucast_dnup.c | 78 unsigned rank; member in struct:dnup_node 82 /* This function returns direction based on rank and guid info of current & 156 next_dir = dnup_get_dir(u->rank, rem_u->rank); 219 /* rank is a SWITCH for BFS purpose */ 240 if (u->rank == 0) 247 /* Go over all remote nodes and rank them (if not already visited) */ 274 if (remote_u->rank > u->rank + 1) { 275 remote_u->rank [all...] |
H A D | osm_ucast_updn.c | 78 unsigned rank; member in struct:updn_node 82 /* This function returns direction based on rank and guid info of current & 99 /* Equal rank, decide by id number, bigger == UP direction */ 161 next_dir = updn_get_dir(u->rank, rem_u->rank, 208 /* rank is a SWITCH for BFS purpose */ 229 if (!u->rank) 236 /* Go over all remote nodes and rank them (if not already visited) */ 263 if (remote_u->rank > u->rank [all...] |
H A D | osm_ucast_ftree.c | 60 * FatTree rank is bounded between 2 and 8: 61 * - Tree of rank 1 has only trivial routing paths, 63 * - Why maximum rank is 8: 69 * which means that maximal tree rank is 8. 170 uint32_t rank; member in struct:ftree_sw_t_ 561 p_sw->rank = 0xFFFFFFFF; 684 return (p_sw->rank != 0xFFFFFFFF); 1196 if (p_sw->rank == i) 1220 " - FatTree rank (roots to leaf switches): %u\n", 1223 " - FatTree max switch rank [all...] |
H A D | osm_mesh.c | 280 * free a square matrix of rank l 298 * allocate a square matrix of rank l 330 * free a square matrix of rank l of polynomials 353 * allocate a square matrix of rank l of polynomials of degree n 389 static int determinant(lash_t *p_lash, int n, int rank, int ***m, int *p); 394 * compute the determinant of a submatrix of matrix of rank l of polynomials of degree n 404 int rank = l - 1; local 411 if (rank <= 0) { 417 if (!(m = pm_alloc(p_lash, rank, n))) { 441 if (determinant(p_lash, n, rank, 461 determinant(lash_t *p_lash, int deg, int rank, int ***m, int *p) argument 539 char_poly(lash_t *p_lash, int rank, int **matrix, int **poly) argument [all...] |
/freebsd-11-stable/usr.sbin/lpr/common_source/ |
H A D | displayq.c | 84 static int rank; /* order to be printed (-1=none, 0=active) */ variable 110 rank = -1; 398 if (rank < 0) 399 rank = 0; 401 rank++; 428 prank(rank); 433 prank(rank); 607 * Print the job's rank in the queue,
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | PassManagerInternal.h | 129 check(rank<2>); 139 static decltype(NonceFunction(&Checker<T>::invalidate)) check(rank<1>); 144 static EnabledType check(rank<0>); 147 enum { Value = sizeof(check<ResultT>(rank<2>())) == sizeof(EnabledType) };
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Symbol/ |
H A D | Symtab.h | 150 return rank(a_data) > rank(b_data); 155 int rank(const uint32_t data) const { function in class:lldb_private::Symtab::FileRangeToIndexMapCompare
|
/freebsd-11-stable/contrib/llvm-project/lld/ELF/ |
H A D | Writer.cpp | 817 // We compute a rank for each section. The rank indicates where the 849 unsigned rank = sec->partition * RF_PARTITION; local 854 return rank; 855 rank |= RF_NOT_ADDR_SET; 860 return rank | RF_NOT_ALLOC; 863 return rank; 864 rank |= RF_NOT_PART_EHDR; 867 return rank; 868 rank | 1490 unsigned rank = orphan->sortRank; local [all...] |
/freebsd-11-stable/contrib/libdivsufsort/lib/ |
H A D | trsort.c | 294 saidx_t rank, lastrank, newrank = -1; local 301 rank = ISA[s + depth]; 302 if(lastrank != rank) { lastrank = rank; newrank = d - SA; } 309 rank = ISA[*e]; 310 if(lastrank != rank) { lastrank = rank; newrank = e - SA; } 311 if(newrank != rank) { ISA[*e] = newrank; } 318 rank = ISA[s + depth]; 319 if(lastrank != rank) { lastran [all...] |