Home
last modified time | relevance | path

Searched full:rank (Results 1 – 25 of 155) sorted by relevance

1234567

/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.h11 * Witnesses with rank WITNESS_RANK_OMIT are completely ignored by the witness
36 * depth excluding non-core locks with lower ranks. Since the rank argument to
69 # define WITNESS_INITIALIZER(name, rank) {name, rank, NULL, NULL, {NULL, NULL}} argument
71 # define WITNESS_INITIALIZER(name, rank) argument
85 * Witness rank, where 0 is lowest and UINT_MAX is highest. Witnesses
86 * must be acquired in order of increasing rank.
88 witness_rank_t rank; member
91 * If two witnesses are of equal rank and they have the samp comp
93 * between witnesses of equal rank.
143 void witness_init(witness_t *witness, const char *name, witness_rank_t rank,
[all …]
/freebsd/contrib/jemalloc/src/
H A Dwitness.c9 witness_init(witness_t *witness, const char *name, witness_rank_t rank, in witness_init() argument
12 witness->rank = rank; in witness_init()
22 malloc_printf("<jemalloc>: Lock rank order reversal:"); in witness_lock_error_impl()
24 malloc_printf(" %s(%u)", w->name, w->rank); in witness_lock_error_impl()
26 malloc_printf(" %s(%u)\n", witness->name, witness->rank); in witness_lock_error_impl()
34 witness->rank); in witness_owner_error_impl()
43 witness->rank); in witness_not_owner_error_impl()
54 malloc_printf("<jemalloc>: Should own %u lock%s of rank >= %u:", depth, in witness_depth_error_impl()
57 malloc_printf(" %s(%u)", w->name, w->rank); in witness_depth_error_impl()
/freebsd/sys/contrib/device-tree/Bindings/memory-controllers/ddr/
H A Djedec,lpddr-channel.yaml7 title: LPDDR channel with chip/rank topology description
34 channel is equal to the sum of the densities of each rank on the
51 "^rank@[0-9]+$":
56 transaction on the channel targets exactly one rank, based on the
70 "^rank@[0-9]+$":
79 "^rank@[0-9]+$":
88 "^rank@[0-9]+$":
97 "^rank@[0-9]+$":
116 rank@0 {
131 rank@0 {
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__mdspan/
H A Dlayout_left.h58 if constexpr (extents_type::rank() == 0) in __required_span_size_is_representable()
62 for (rank_type __r = 1; __r < extents_type::rank(); __r++) { in __required_span_size_is_representable()
98 requires(is_constructible_v<extents_type, _OtherExtents> && _OtherExtents::rank() <= 1)
103 …// Note: since this is constraint to rank 1, extents itself would catch the invalid conversion fir… in mapping()
115 _LIBCPP_HIDE_FROM_ABI constexpr explicit(extents_type::rank() > 0) in requires()
118 if constexpr (extents_type::rank() > 0) { in requires()
122 for (rank_type __r = 0; __r < extents_type::rank(); __r++) in requires()
142 for (size_t __r = 0; __r < extents_type::rank(); __r++) in required_span_size()
148 …requires((sizeof...(_Indices) == extents_type::rank()) && (is_convertible_v<_Indices, index_type> …
157 array<index_type, extents_type::rank()> __idx_a{static_cast<index_type>(__idx)...}; 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)
102 …// Note: since this is constraint to rank 1, extents itself would catch the invalid conversion fir… in mapping()
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()
[all …]
H A Dmdspan.h33 #include <__type_traits/rank.h>
91 _LIBCPP_HIDE_FROM_ABI static constexpr rank_type rank() noexcept { return extents_type::rank(); } in rank() function
114 … ((sizeof...(_OtherIndexTypes) == rank()) || (sizeof...(_OtherIndexTypes) == rank_dynamic())) &&
122 …((_Size == rank()) || (_Size == rank_dynamic())) && is_constructible_v<mapping_type, extents_type>…
131 …((_Size == rank()) || (_Size == rank_dynamic())) && is_constructible_v<mapping_type, extents_type>…
166 if constexpr (rank() > 0) { in requires()
167 for (size_t __r = 0; __r < rank(); __r++) { in requires()
188 (sizeof...(_OtherIndexTypes) == rank()))
200 …_LIBCPP_HIDE_FROM_ABI constexpr reference operator[](const array< _OtherIndexType, rank()>& __indi… in requires()
203 }(make_index_sequence<rank()>())); in requires()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__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>…
41 inline constexpr size_t rank_v = rank<_Tp>::value;
/freebsd/contrib/ofed/opensm/opensm/
H A Dosm_ucast_dnup.c78 unsigned rank; member
82 /* This function returns direction based on rank and guid info of current &
156 next_dir = dnup_get_dir(u->rank, rem_u->rank); in dnup_bfs_by_node()
219 /* rank is a SWITCH for BFS purpose */
240 if (u->rank == 0) in dnup_subn_rank()
247 /* Go over all remote nodes and rank them (if not already visited) */ 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()
280 "Rank of port GUID 0x%" PRIx64 in dnup_subn_rank()
[all …]
H A Dosm_ucast_updn.c78 unsigned rank; member
82 /* This function returns direction based on rank and guid info of current &
99 /* Equal rank, decide by id number, bigger == UP direction */ in updn_get_dir()
161 next_dir = updn_get_dir(u->rank, rem_u->rank, in updn_bfs_by_node()
208 /* rank is a SWITCH for BFS purpose */
229 if (!u->rank) in updn_subn_rank()
236 /* Go over all remote nodes and rank them (if not already visited) */ 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()
[all …]
H A Dosm_ucast_ftree.c60 * 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
561 p_sw->rank = 0xFFFFFFFF; in sw_create()
684 return (p_sw->rank != 0xFFFFFFFF); in sw_ranked()
1192 "-- Rank %u switches\n", i); in fabric_dump()
1196 if (p_sw->rank == i) in fabric_dump()
1220 " - FatTree rank (roots to leaf switches): %u\n", in fabric_dump_general_info()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DRISCVISAUtils.cpp19 // We rank extensions in the following order:
29 // single letter extension rank for single letter and multi-letter extensions
38 // Get the rank for single-letter extension, lower value meaning higher
58 // Get the rank for multi-letter extension, lower value meaning higher
68 // e.g. zmx has higher rank than zax. in getExtensionRank()
86 // If the ranks differ, pick the lower rank. in compareExtension()
90 // If the rank is same, it must be sorted by lexicographic order. in compareExtension()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DReassociate.h14 // In the implementation of this algorithm, constants are assigned rank = 0,
15 // function arguments are rank = 1, and other values are assigned ranks
17 // (starting at 2), which effectively gives values in deep loops higher rank
48 unsigned Rank; member
51 ValueEntry(unsigned R, Value *O) : Rank(R), Op(O) {} in ValueEntry()
55 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start.
/freebsd/share/man/man3/
H A Dtree.3105 .Nd "implementations of splay and rank-balanced (wavl) trees"
211 splay trees and rank-balanced (wavl) trees.
380 .Sh RANK-BALANCED TREES
381 Rank-balanced (RB) trees are a framework for defining height-balanced
383 Each tree node has an associated rank.
385 rank between any node and its children.
386 Rank differences are stored in each tree node.
400 A rank-balanced tree is headed by a structure defined by the
505 The rank-balanced tree can also be initialized statically by using the
611 macro should be used to check whether a rank-balanced tree is empty.
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dmdspan20 template<class IndexType, size_t Rank>
24 template<size_t Rank, class IndexType = size_t>
53 static constexpr rank_type rank() noexcept { return sizeof...(_Extents); }
54 static constexpr rank_type rank_dynamic() noexcept { return dynamic-index(rank()); }
112 constexpr explicit(extents_type::rank() > 0)
166 constexpr explicit(extents_type::rank() > 0)
210 static constexpr rank_type rank_ = extents_type::rank(); // exposition only
291 static constexpr rank_type rank() noexcept { return extents_type::rank(); }
327 constexpr reference operator[](span<OtherIndexType, rank()> indices) const;
329 constexpr reference operator[](const array<OtherIndexType, rank()>& indices) const;
/freebsd/sys/sys/
H A Dtree.h38 * splay trees and rank-balanced trees.
52 * A rank-balanced tree is a binary search tree with an integer
53 * rank-difference as an attribute of each pointer from parent to child.
54 * The sum of the rank-differences on any path from a node down to null is
55 * the same, and defines the rank of that node. The rank of the null node
61 * "Rank Balanced Trees", ACM Transactions on Algorithms Volume 11 Issue 4 June
63 * - every rank-difference is 1 or 2.
64 * - the rank of any leaf is 1.
66 * For historical reasons, rank differences that are even are associated
67 * with the color red (Rank-Even-Difference), and the child that a red edge
[all …]
/freebsd/sys/contrib/zstd/lib/compress/
H A Dhuf_compress.c239 /* Prepare base value per rank */ in HUF_readCTable()
257 /* determine stating value per rank */ in HUF_readCTable()
261 valPerRank[n] = min; /* get starting value within each rank */ in HUF_readCTable()
265 /* assign value within rank, symbol order */ in HUF_readCTable()
343 /* Get pos of last (smallest = lowest cum. count) symbol per rank */ in HUF_setMaxHeight()
355 * gain back half the rank. in HUF_setMaxHeight()
370 …/* only triggered when no more rank 1 symbol left => find closest one (note : there is necessarily… in HUF_setMaxHeight()
376 /* Increase the number of bits to gain back half the rank cost. */ in HUF_setMaxHeight()
380 /* Fix up the new rank. in HUF_setMaxHeight()
381 * If the new rank was empty, this symbol is now its smallest. in HUF_setMaxHeight()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Instrumentation/
H A DCFGMST.h75 // Make the smaller rank tree a direct child or the root of high rank tree. in unionGroups()
76 if (BB1G->Rank < BB2G->Rank) in unionGroups()
81 if (BB1G->Rank == BB2G->Rank)
82 BB1G->Rank++;
/freebsd/share/man/man4/
H A Dgeom.4181 All geoms have a rank-number assigned, which is used to detect and
183 This rank number is
187 A geom with no attached consumers has rank=1.
189 A geom with attached consumers has a rank one higher than the
190 highest rank of the geoms of the providers its consumers are
224 Examine the rank number of the provider's geom.
439 Allow writing to Rank 1 providers.
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h261 uint32_t Rank = 0; member
284 // Make the smaller rank tree a direct child of high rank tree. in unionGroups()
285 if (G1->Rank < G2->Rank) in unionGroups()
290 if (G1->Rank == G2->Rank) in unionGroups()
291 G1->Rank++; in unionGroups()
/freebsd/sys/geom/
H A Dgeom_subr.c387 gp->rank = 1; in g_new_geomf()
818 * numerical rank) at all times.
819 * When an attach is done, the attaching geoms rank is invalidated
822 * sequence. If we cannot assign rank to a geom because it's
823 * prerequisites do not have rank, we move that element to the tail
824 * of the sequence with invalid rank as well.
826 * to assign it a rank, there must be a loop and we fail back to
843 /* Invalidate this geoms rank and move it to the tail */ in redo_rank()
846 gp->rank = 0; in redo_rank()
853 /* re-rank the rest of the sequence */ in redo_rank()
[all …]

1234567