Home
last modified time | relevance | path

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

123

/freebsd/tools/regression/geom/ConfCmp/
H A Da1.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 …]
H A Da1a.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 …]
H A Da1d.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 …]
H A Da1b.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 …]
H A Da1c.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 …]
/freebsd/contrib/jemalloc/include/jemalloc/internal/
H A Dwitness.h18 * Witnesses with rank WITNESS_RANK_OMIT are completely ignored by the
39 * rank argument to witness_assert_depth_to_rank() is inclusive rather
85 # define WITNESS_INITIALIZER(name, rank) {name, rank, NULL, NULL, {NULL, NULL}}
87 # define WITNESS_INITIALIZER(name, rank)
100 * Witness rank, where 0 is lowest and WITNESS_RANK_LEAF is highest.
101 * Witnesses must be acquired in order of increasing rank.
103 witness_rank_t rank;
106 * If two witnesses are of equal rank and they have the samp comp
108 * between witnesses of equal rank
69 WITNESS_INITIALIZER(name,rank) global() argument
71 WITNESS_INITIALIZER(name,rank) global() argument
88 witness_rank_t rank; global() member
[all...]
/freebsd/contrib/llvm-project/libcxx/include/__mdspan/
H A Dlayout_left.h57 if constexpr (extents_type::rank() == 0) in __required_span_size_is_representable()
61 for (rank_type __r = 1; __r < extents_type::rank(); __r++) { in __required_span_size_is_representable()
97 requires(is_constructible_v<extents_type, _OtherExtents> && _OtherExtents::rank() <= 1)
114 _LIBCPP_HIDE_FROM_ABI constexpr explicit(extents_type::rank() > 0) in requires()
117 if constexpr (extents_type::rank() > 0) { in requires()
121 for (rank_type __r = 0; __r < extents_type::rank(); __r++) in requires()
141 for (size_t __r = 0; __r < extents_type::rank(); __r++) in required_span_size()
147 …requires((sizeof...(_Indices) == extents_type::rank()) && (is_convertible_v<_Indices, index_type> …
156 array<index_type, extents_type::rank()> __idx_a{static_cast<index_type>(__idx)...}; in operator()
159 …((__res = __idx_a[extents_type::rank() - 1 - _Pos] + __extents_.extent(extents_type::rank() - 1 - … in operator()
[all …]
H A Dlayout_right.h57 if constexpr (extents_type::rank() == 0) in __required_span_size_is_representable()
61 for (rank_type __r = 1; __r < extents_type::rank(); __r++) { in __required_span_size_is_representable()
97 requires(is_constructible_v<extents_type, _OtherExtents> && _OtherExtents::rank() <= 1)
114 _LIBCPP_HIDE_FROM_ABI constexpr explicit(extents_type::rank() > 0) in requires()
117 if constexpr (extents_type::rank() > 0) { in requires()
121 for (rank_type __r = 0; __r < extents_type::rank(); __r++) in requires()
141 for (size_t __r = 0; __r < extents_type::rank(); __r++) in required_span_size()
147 …requires((sizeof...(_Indices) == extents_type::rank()) && (is_convertible_v<_Indices, index_type> …
172 requires(extents_type::rank() > 0) in stride()
177 __r < extents_type::rank(), "layout_right::mapping::stride(): invalid rank index"); in stride()
[all …]
H A Dmdspan.h90 _LIBCPP_HIDE_FROM_ABI static constexpr rank_type rank() noexcept { return extents_type::rank(); } in rank() function
113 … ((sizeof...(_OtherIndexTypes) == rank()) || (sizeof...(_OtherIndexTypes) == rank_dynamic())) &&
121 …((_Size == rank()) || (_Size == rank_dynamic())) && is_constructible_v<mapping_type, extents_type>…
130 …((_Size == rank()) || (_Size == rank_dynamic())) && is_constructible_v<mapping_type, extents_type>…
165 if constexpr (rank() > 0) { in requires()
166 for (size_t __r = 0; __r < rank(); __r++) { in requires()
187 (sizeof...(_OtherIndexTypes) == rank()))
199 …_LIBCPP_HIDE_FROM_ABI constexpr reference operator[](const array< _OtherIndexType, rank()>& __indi… in requires()
202 }(make_index_sequence<rank()>())); in requires()
208 …_LIBCPP_HIDE_FROM_ABI constexpr reference operator[](span<_OtherIndexType, rank()> __indices) cons… in requires()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__type_traits/
H A Drank.h26 struct _LIBCPP_NO_SPECIALIZATIONS rank : integral_constant<size_t, __array_rank(_Tp)> {}; struct
31 struct _LIBCPP_NO_SPECIALIZATIONS rank : public integral_constant<size_t, 0> {};
38 struct rank<_Tp[]> : public integral_constant<size_t, rank<_Tp>::value + 1> {};
40 struct rank<_Tp[_Np]> : public integral_constant<size_t, rank<_Tp>::value + 1> {};
47 _LIBCPP_NO_SPECIALIZATIONS inline constexpr size_t rank_v = rank<_Tp>::value;
/freebsd/contrib/jemalloc/src/
H A Dwitness.c8 witness_init(witness_t *witness, const char *name, witness_rank_t rank,
11 witness->rank = rank; in witness_init()
20 malloc_printf(" %s(%u)", w->name, w->rank); in witness_lock_error_impl()
22 malloc_printf(" %s(%u)X%u", w->name, w->rank, n); in witness_lock_error_impl()
31 if (last != NULL && w->rank > last->rank) {
36 assert(w->rank == last->rank); in witness_owner_error_impl()
50 malloc_printf("<jemalloc>: Lock rank orde
9 witness_init(witness_t * witness,const char * name,witness_rank_t rank,witness_comp_t * comp,void * opaque) witness_init() argument
[all...]
H A Dmutex_pool.c
H A Dmutex.c164 witness_rank_t rank, malloc_mutex_lock_order_t lock_order) { in malloc_mutex_init()
203 witness_init(&mutex->witness, name, rank, in malloc_mutex_init()
206 witness_init(&mutex->witness, name, rank, NULL, NULL); in malloc_mutex_prefork()
228 mutex->witness.rank, mutex->lock_order)) { in malloc_mutex_postfork_child()
157 malloc_mutex_init(malloc_mutex_t * mutex,const char * name,witness_rank_t rank,malloc_mutex_lock_order_t lock_order) malloc_mutex_init() argument
/freebsd/crypto/openssl/crypto/ml_kem/
H A Dml_kem.c97 #define DECLARE_ML_KEM_KEYDATA(name, rank, private_sz) \ argument
100 scalar tbuf[(rank)]; \
102 scalar mbuf[(rank) * (rank)] /* optional private key data */ \
701 const scalar *t = key->t, *end = t + vinfo->rank; in hash_h_pubkey()
1198 static void vector_add(scalar *lhs, const scalar *rhs, int rank) in vector_add() argument
1202 } while (--rank > 0); in vector_add()
1210 static void vector_encode(uint8_t *out, const scalar *a, int bits, int rank) in vector_encode() argument
1214 for (; rank-- > 0; out += stride) in vector_encode()
1228 vector_decode_decompress_ntt(scalar *out, const uint8_t *in, int bits, int rank) in vector_decode_decompress_ntt() argument
1232 for (; rank-- > 0; in += stride, ++out) { in vector_decode_decompress_ntt()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__type_traits/
H A Drank.h26 struct rank : integral_constant<size_t, __array_rank(_Tp)> {}; struct
31 struct _LIBCPP_TEMPLATE_VIS rank : public integral_constant<size_t, 0> {};
33 struct _LIBCPP_TEMPLATE_VIS rank<_Tp[]> : public integral_constant<size_t, rank<_Tp>::value + 1> {};
35 struct _LIBCPP_TEMPLATE_VIS rank<_Tp[_Np]> : public integral_constant<size_t, rank<_Tp>::value + 1>…
/freebsd/contrib/ofed/opensm/opensm/
H A Dosm_ucast_dnup.c78 unsigned rank; member
156 next_dir = dnup_get_dir(u->rank, rem_u->rank); in dnup_bfs_by_node()
240 if (u->rank == 0) in dnup_subn_rank()
274 if (remote_u->rank > u->rank + 1) { in dnup_subn_rank()
275 remote_u->rank = u->rank + 1; in dnup_subn_rank()
276 max_rank = remote_u->rank; in dnup_subn_rank()
282 remote_u->rank); in dnup_subn_rank()
398 u->rank = 0xffffffff; in create_dnup_node()
445 u->rank = 0; in dnup_lid_matrices()
H A Dosm_ucast_updn.c78 unsigned rank; member
161 next_dir = updn_get_dir(u->rank, rem_u->rank, in updn_bfs_by_node()
229 if (!u->rank) in updn_subn_rank()
263 if (remote_u->rank > u->rank + 1) { in updn_subn_rank()
264 remote_u->rank = u->rank + 1; in updn_subn_rank()
265 max_rank = remote_u->rank; in updn_subn_rank()
271 remote_u->rank); in updn_subn_rank()
295 rank != 0) in updn_clear_non_root_hops()
397 u->rank = 0xffffffff; in create_updn_node()
500 ((struct updn_node *)p_sw->priv)->rank = 0; in updn_find_root_nodes_by_min_hop()
[all …]
H A Dosm_ucast_ftree.c170 uint32_t rank; member
561 p_sw->rank = 0xFFFFFFFF; in sw_create()
684 return (p_sw->rank != 0xFFFFFFFF); in sw_ranked()
1196 if (p_sw->rank == i) in fabric_dump()
1236 if (p_sw->rank == i) in fabric_dump_general_info()
1259 if (p_sw->rank == 0) in fabric_dump_general_info()
1381 new_tuple[0] = (uint8_t) p_sw->rank; in fabric_assign_first_tuple()
1386 if (p_sw->rank == 0) { in fabric_assign_first_tuple()
1503 if (p_sw->rank != p_ftree->leaf_switch_rank) { in fabric_mark_leaf_switches()
1511 sw_get_guid_ho(p_sw), p_sw->rank, in fabric_mark_leaf_switches()
[all …]
H A Dosm_mesh.c389 static int determinant(lash_t *p_lash, int n, int rank, int ***m, int *p);
404 int rank = l - 1; in sub_determinant() local
411 if (rank <= 0) { in sub_determinant()
417 if (!(m = pm_alloc(p_lash, rank, n))) { in sub_determinant()
441 if (determinant(p_lash, n, rank, m, p)) { in sub_determinant()
450 pm_free(m, rank); in sub_determinant()
461 static int determinant(lash_t *p_lash, int deg, int rank, int ***m, int *p) in determinant() argument
470 if (rank == 1) { in determinant()
478 else if (rank == 2) { in determinant()
508 for (i = 0; i < rank; i++) { in determinant()
[all …]
/freebsd/usr.sbin/lpr/common_source/
H A Ddisplayq.c78 static int rank; /* order to be printed (-1=none, 0=active) */ variable
104 rank = -1; in displayq()
392 if (rank < 0) in inform()
393 rank = 0; in inform()
395 rank++; in inform()
422 prank(rank); in inform()
427 prank(rank); in inform()
/freebsd/contrib/libdivsufsort/lib/
H A Dtrsort.c294 saidx_t rank, lastrank, newrank = -1; in tr_partialcopy() local
301 rank = ISA[s + depth]; in tr_partialcopy()
302 if(lastrank != rank) { lastrank = rank; newrank = d - SA; } in tr_partialcopy()
309 rank = ISA[*e]; in tr_partialcopy()
310 if(lastrank != rank) { lastrank = rank; newrank = e - SA; } in tr_partialcopy()
311 if(newrank != rank) { ISA[*e] = newrank; } in tr_partialcopy()
318 rank = ISA[s + depth]; in tr_partialcopy()
319 if(lastrank != rank) { lastrank = rank; newrank = d - SA; } in tr_partialcopy()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DPassManagerInternal.h158 check(rank<2>);
168 static decltype(NonceFunction(&Checker<T>::invalidate)) check(rank<1>);
173 static EnabledType check(rank<0>);
176 enum { Value = sizeof(check<ResultT>(rank<2>())) == sizeof(EnabledType) };
/freebsd/contrib/llvm-project/libcxx/include/
H A Dmdspan57 static constexpr rank_type rank() noexcept { return sizeof...(_Extents); }
58 static constexpr rank_type rank_dynamic() noexcept { return dynamic-index(rank()); }
116 constexpr explicit(extents_type::rank() > 0)
170 constexpr explicit(extents_type::rank() > 0)
214 static constexpr rank_type rank_ = extents_type::rank(); // exposition only
327 static constexpr rank_type rank() noexcept { return extents_type::rank(); }
363 constexpr reference operator[](span<OtherIndexType, rank()> indices) const;
365 constexpr reference operator[](const array<OtherIndexType, rank()>& indices) const;
/freebsd/contrib/llvm-project/lld/ELF/
H A DWriter.cpp668 unsigned rank = osec.partition * RF_PARTITION; in getSectionRank() local
673 return rank; in getSectionRank()
674 rank |= RF_NOT_ADDR_SET; in getSectionRank()
679 return rank | RF_NOT_ALLOC; in getSectionRank()
703 rank |= ctx.arg.zLrodataAfterBss ? RF_LARGE_ALT : 0; in getSectionRank()
705 rank |= ctx.arg.zLrodataAfterBss ? 0 : RF_LARGE; in getSectionRank()
710 rank |= 1; in getSectionRank()
712 rank |= 2; in getSectionRank()
717 rank |= 3; in getSectionRank()
722 rank |= 4; in getSectionRank()
[all …]
/freebsd/contrib/llvm-project/lldb/include/lldb/Symbol/
H A DSymtab.h250 return rank(a_data) > rank(b_data); in operator()
255 int rank(const uint32_t data) const { in rank() function

123