Home
last modified time | relevance | path

Searched full:elements (Results 1 – 25 of 2069) sorted by relevance

12345678910>>...83

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSparseBitVector.h30 /// storing the elements that have non-zero bits set. In order to make this
264 ElementList Elements; variable
280 const_cast<SparseBitVector<ElementSize> *>(this)->Elements.begin(); in FindLowerBoundImpl()
282 const_cast<SparseBitVector<ElementSize> *>(this)->Elements.end(); in FindLowerBoundImpl()
284 if (Elements.empty()) { in FindLowerBoundImpl()
341 if (BitVector->Elements.empty()) { in AdvanceToFirstNonZero()
345 Iter = BitVector->Elements.begin(); in AdvanceToFirstNonZero()
372 // We may run out of elements in the bitmap. in AdvanceToNextNonZero()
373 if (Iter == BitVector->Elements.end()) { in AdvanceToNextNonZero()
399 Iter = BitVector->Elements in BitVector()
[all...]
H A DArrayRef.h29 /// ArrayRef - Represent a constant reference to an array (0 or more elements
31 /// various APIs to take consecutive elements easily and conveniently.
59 /// The number of elements.
193 /// slice(n, m) - Chop off the first N elements of the array, and keep M
194 /// elements in the array.
200 /// slice(n) - Chop off the first N elements of the array.
203 /// Drop the first \p N elements of the array.
205 assert(size() >= N && "Dropping more elements than exist");
209 /// Drop the last \p N elements of the array.
211 assert(size() >= N && "Dropping more elements than exist");
[all …]
H A DSmallVector.h84 /// elements to the new allocation - used if realloca fails to increase
101 /// This does not construct or destroy any elements in the vector.
109 /// This does not construct or destroy any elements in the vector.
360 /// constructing elements as needed.
367 /// constructing elements as needed.
373 /// Grow the allocated memory (without initializing new elements), doubling
375 /// element, or MinSize more elements if specified.
382 /// Move existing elements over to the new allocation \p NewElts, the middle
466 // Move the elements over. in moveElementsForGrow()
469 // Destroy the original elements. in moveElementsForGrow()
[all …]
/freebsd/contrib/netbsd-tests/include/sys/
H A Dt_pslist.c53 } elements[] = { in ATF_TC_BODY() local
71 PSLIST_ENTRY_DESTROY(&elements[0], entry); in ATF_TC_BODY()
73 for (i = 0; i < __arraycount(elements); i++) in ATF_TC_BODY()
74 PSLIST_ENTRY_INIT(&elements[i], entry); in ATF_TC_BODY()
76 PSLIST_WRITER_INSERT_HEAD(&h, &elements[4], entry); in ATF_TC_BODY()
77 PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[2], entry); in ATF_TC_BODY()
78 PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[3], entry); in ATF_TC_BODY()
79 PSLIST_WRITER_INSERT_BEFORE(&elements[2], &elements[1], entry); in ATF_TC_BODY()
80 PSLIST_WRITER_INSERT_HEAD(&h, &elements[0], entry); in ATF_TC_BODY()
81 PSLIST_WRITER_INSERT_AFTER(&elements[4], &elements[5], entry); in ATF_TC_BODY()
[all …]
/freebsd/sys/contrib/dev/acpica/components/namespace/
H A Dnsprepkg.c168 ACPI_OPERAND_OBJECT **Elements,
174 ACPI_OPERAND_OBJECT **Elements,
184 ACPI_OPERAND_OBJECT **Elements,
210 ACPI_OPERAND_OBJECT **Elements; in AcpiNsCheckPackage() local
231 * and trailing NULL package elements in AcpiNsCheckPackage()
235 /* Extract package count and elements array */ in AcpiNsCheckPackage()
237 Elements = ReturnObject->Package.Elements; in AcpiNsCheckPackage()
252 "Return Package has no elements (empty)")); in AcpiNsCheckPackage()
267 Status = AcpiNsCustomPackage (Info, Elements, Count); in AcpiNsCheckPackage()
290 /* Validate all elements of the returned package */ in AcpiNsCheckPackage()
[all …]
/freebsd/sys/contrib/device-tree/Bindings/net/can/
H A Dbosch,m_can.yaml65 the following elements start from. This is usually set to
67 are used to specify how many elements are used for each FIFO/Buffer.
69 M_CAN includes the following elements according to user manual:
70 11-bit Filter 0-128 elements / 0-128 words
71 29-bit Filter 0-64 elements / 0-128 words
72 Rx FIFO 0 0-64 elements / 0-1152 words
73 Rx FIFO 1 0-64 elements / 0-1152 words
74 Rx Buffers 0-64 elements / 0-1152 words
75 Tx Event FIFO 0-32 elements / 0-64 words
76 Tx Buffers 0-32 elements / 0-576 words
[all …]
/freebsd/tests/sys/cddl/zfs/tests/cli_root/zfs_get/
H A Dzfs_get_common.kshlib30 # According to $elements, $prefix and $separator, the function random produce
33 # $1 elements which is used to get the combination.
38 function gen_option_str # $elements $prefix $separator $counter
40 typeset elements=""
48 elements[i]="$e"
51 (( ${#elements[@]} == 0 )) && log_fail "The elements can't be empty."
65 (( numb_item = ($RANDOM % ${#elements[@]}) + 1 ))
68 # Random select elements from the array
69 (( item = $RANDOM % ${#elements[@]} ))
72 comb_str=${elements[item]}
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_get/
H A Dzfs_get_common.kshlib35 # According to $elements, $prefix and $separator, the function random produce
38 # $1 elements which is used to get the combination.
43 function gen_option_str # $elements $prefix $separator $counter
45 typeset elements=""
53 elements[i]="$e"
56 (( ${#elements[@]} == 0 )) && log_fail "The elements can't be empty."
70 (( numb_item = ($RANDOM % ${#elements[@]}) + 1 ))
73 # Random select elements from the array
74 (( item = $RANDOM % ${#elements[@]} ))
77 comb_str=${elements[item]}
[all …]
/freebsd/sys/dev/isci/scil/
H A Dsci_simple_list.h66 * of the 2 link elements used in the SCI_FAST_LIST and
70 * @note Do not use the SCI_SIMPLE_LIST if you need to remove elements from
103 * See if there are any list elements on this list.
120 * Return the count of the number of elements in this list.
169 * @note Pushing new elements onto a list is more efficient than inserting
196 * @note Pushing new elements onto a list is more efficient than inserting
252 * Move all the list elements from source anchor to the dest anchor.
253 * The source anchor will have all of its elements removed making it
255 * and dest list elements.
257 * @param[in, out] dest_anchor this is the list into which all elements from
[all …]
H A Dsci_abstract_list.h135 * elements added and removed from it.
150 * This field depicts the number of elements in this list.
163 * @brief This structure provides the pool of free abstract elements to be
169 * Pointer to an array of elements to be managed by this pool. This
170 * array acts as the memory store for the elements in the free pool or
173 SCI_ABSTRACT_ELEMENT_T * elements; member
176 * This field contains the maximum number of free elements for the pool.
182 * Pointer to the list of free elements that can be allocated from
194 * an element pool from which to draw free elements.
199 * This represents the elements currently managed by the list.
[all …]
H A Dsci_abstract_list.c96 * utilized as the repository of free elements for list usage.
113 * the free pool from which the elements will be extracted
115 * the array of list elements to be added to the free list
117 * the count of the elements to be added to the free list these should be
118 * the same as the array size of list elements
133 pool->elements = list_elements; in sci_abstract_element_pool_construct()
136 // Loop through all of the elements in the array and push them onto the in sci_abstract_element_pool_construct()
161 return (list_p)->elements.front_p; in sci_abstract_list_get_front()
173 ( ( (list_p)->elements.front_p ) ? ((list_p)->elements.front_p->object_p) : NULL ); in sci_abstract_list_front()
185 ( ( (list_p)->elements.back_p ) ? ((list_p)->elements.back_p->object_p) : NULL ); in sci_abstract_list_back()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A Dshaintrin.h22 /// vector of [4 x i32] in \a V1 and the next four 32-bit elements of the
44 /// A 128-bit vector of [4 x i32] containing the next four elements of
55 /// four message elements in the 128-bit vector of [4 x i32] in \a __Y, and
65 /// A 128-bit vector of [4 x i32] containing the next four elements of the
76 /// message elements using previous message elements from the 128-bit
84 /// A 128-bit vector of [4 x i32] containing previous message elements.
86 /// A 128-bit vector of [4 x i32] containing previous message elements.
88 /// elements.
96 /// elements using previous message elements from the 128-bit vectors of
119 /// next two message elements (unsigned 32-bit integers) and corresponding
[all …]
H A Davxneconvertintrin.h31 /// single-precision (32-bit) floating-point elements, and store the results in
64 /// single-precision (32-bit) floating-point elements, and store the results in
97 /// single-precision (32-bit) floating-point elements, and store the results in
130 /// single-precision (32-bit) floating-point elements, and store the results in
160 /// Convert packed BF16 (16-bit) floating-point even-indexed elements
162 /// single-precision (32-bit) floating-point elements, and store the results in
193 /// Convert packed BF16 (16-bit) floating-point even-indexed elements
195 /// single-precision (32-bit) floating-point elements, and store the results in
226 /// Convert packed half-precision (16-bit) floating-point even-indexed elements
228 /// single-precision (32-bit) floating-point elements, and store the results in
[all …]
/freebsd/contrib/opencsd/decoder/include/opencsd/etmv4/
H A Dtrc_pkt_decode_etmv4i.h71 …ocsd_err_t decodePacket(); // decode packet into trace elements. return true to indicate decode…
72 …ocsd_datapath_resp_t resolveElements(); // commit/cancel trace elements generated from latest / …
73 …ocsd_err_t commitElements(); // commit elements - process element stack to generate output packets.
75 ocsd_err_t cancelElements(); // cancel elements. These not output
77 ocsd_err_t discardElements(); // discard elements and flush
82 // process atom will create instruction trace, or no memory access trace output elements.
97 // process marker elements
177 int m_unseen_spec_elem; // speculative elements at decode start
179 /** Remove elements that are associated with data trace */
181 // data trace associative elements (unsupported at present in the decoder).
[all …]
/freebsd/sys/kern/
H A Dsubr_hash.c52 hashinit_flags(int elements, struct malloc_type *type, u_long *hashmask, in hashinit_flags() argument
58 KASSERT(elements > 0, ("%s: bad elements", __func__)); in hashinit_flags()
63 for (hashsize = 1; hashsize <= elements; hashsize <<= 1) in hashinit_flags()
81 hashinit(int elements, struct malloc_type *type, u_long *hashmask) in hashinit() argument
84 return (hashinit_flags(elements, type, hashmask, HASH_WAITOK)); in hashinit()
109 phashinit_flags(int elements, struct malloc_type *type, u_long *nentries, int flags) in phashinit_flags() argument
114 KASSERT(elements > 0, ("%s: bad elements", __func__)); in phashinit_flags()
119 for (i = 1, hashsize = primes[1]; hashsize <= elements;) { in phashinit_flags()
143 phashinit(int elements, struct malloc_type *type, u_long *nentries) in phashinit() argument
146 return (phashinit_flags(elements, type, nentries, HASH_WAITOK)); in phashinit()
/freebsd/contrib/ofed/opensm/include/complib/
H A Dcl_vector.h63 * allows efficient constant time access to elements with a specified index.
64 * A vector grows transparently as the user adds elements to the array.
66 * As the vector grows in size, it does not relocate existing elements in
67 * memory. This allows using pointers to elements stored in a Vector.
111 * used as initializer for elements being allocated by a vector.
150 * used as destructor for elements being deallocated from a vector.
182 * used to iterate elements in a vector.
218 * used to find elements in a vector.
257 * used to copy elements in a vector.
310 * Number of elements successfully initialized in the vector.
[all …]
/freebsd/lib/libgssapi/
H A Dgss_utils.c46 if (memcmp(oid1->elements, oid2->elements, oid1->length)) in gss_oid_equal()
58 to_oid->elements = malloc(len); in _gss_copy_oid()
59 if (!to_oid->elements) { in _gss_copy_oid()
65 memcpy(to_oid->elements, from_oid->elements, len); in _gss_copy_oid()
74 if (oid->elements) { in _gss_free_oid()
75 free(oid->elements); in _gss_free_oid()
76 oid->elements = NULL; in _gss_free_oid()
H A Dgss_buffer_set.c55 set->elements = NULL; in gss_create_empty_buffer_set()
80 set->elements = reallocarray(set->elements, set->count + 1, in gss_add_buffer_set_member()
81 sizeof(set->elements[0])); in gss_add_buffer_set_member()
82 if (set->elements == NULL) { in gss_add_buffer_set_member()
87 p = &set->elements[set->count]; in gss_add_buffer_set_member()
115 gss_release_buffer(&minor, &((*buffer_set)->elements[i])); in gss_release_buffer_set()
117 free((*buffer_set)->elements); in gss_release_buffer_set()
119 (*buffer_set)->elements = NULL; in gss_release_buffer_set()
H A Dgss_add_oid_set_member.c61 new_oid->elements = malloc(member_oid->length); in gss_add_oid_set_member()
62 if (!new_oid->elements) { in gss_add_oid_set_member()
67 memcpy(new_oid->elements, member_oid->elements, member_oid->length); in gss_add_oid_set_member()
69 if (set->elements) { in gss_add_oid_set_member()
70 memcpy(new_elements, set->elements, in gss_add_oid_set_member()
72 free(set->elements); in gss_add_oid_set_member()
74 set->elements = new_elements; in gss_add_oid_set_member()
/freebsd/contrib/opencsd/decoder/include/common/
H A Docsd_gen_elem_list.h42 * @brief Maintain a list of elements to be output
44 * Each incoming packet can result in multiple output elements.
53 * The "list" is actually a ring buffer - maintaining pointers to indicate current valid elements.
68 …t; //!< return the total number of elements on the stack (inl…
73 void commitAllPendElem(); //!< commit all pended elements.
75 const int numPendElem() const; //!< return the number of pended elements.
77 /*! Send all of the none pended elements
81 const bool elemToSend() const; //!< true if any none-pending elements left to send.
95 elemPtr_t *m_pElemArray; //!< an array of pointers to elements.
99 int m_numUsed; //!< number of elements in use
[all …]
/freebsd/crypto/heimdal/lib/gssapi/mech/
H A Dgss_buffer_set.c49 set->elements = NULL; in gss_create_empty_buffer_set()
76 set->elements = realloc(set->elements, in gss_add_buffer_set_member()
77 (set->count + 1) * sizeof(set->elements[0])); in gss_add_buffer_set_member()
78 if (set->elements == NULL) { in gss_add_buffer_set_member()
83 p = &set->elements[set->count]; in gss_add_buffer_set_member()
112 gss_release_buffer(&minor, &((*buffer_set)->elements[i])); in gss_release_buffer_set()
114 free((*buffer_set)->elements); in gss_release_buffer_set()
116 (*buffer_set)->elements = NULL; in gss_release_buffer_set()
/freebsd/sys/arm64/coresight/
H A Dcoresight_acpi.c72 rev = &graph->Package.Elements[0]; in cs_acpi_validate_dsd_graph()
73 nr_graphs = &graph->Package.Elements[1]; in cs_acpi_validate_dsd_graph()
88 /* Check the number of elements. */ in cs_acpi_validate_dsd_graph()
93 obj = &graph->Package.Elements[i]; in cs_acpi_validate_dsd_graph()
152 graphid = &obj->Package.Elements[0]; in cs_is_acpi_coresight_graph()
153 guid = &obj->Package.Elements[1]; in cs_is_acpi_coresight_graph()
154 links = &obj->Package.Elements[2]; in cs_is_acpi_coresight_graph()
193 guid = &dsd->Package.Elements[i]; in cs_get_dsd_graph()
194 package = &dsd->Package.Elements[i + 1]; in cs_get_dsd_graph()
215 nlinks = cs_graph->Package.Elements[2].Integer.Value; in cs_acpi_validate_coresight_graph()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVCompare.cpp120 // In the case of added elements, the 'Reference' reader will be modified; in execute()
121 // those elements will be added to it. Update the current reader instance. in execute()
167 // details are just a list of elements. in execute()
186 // Display a summary with the elements missing and/or added. in execute()
189 // Perform logical elements comparison. An equal test is apply to each in execute()
193 // having both missing and added elements. in execute()
200 LVElements Elements; in execute() local
202 // Report elements that can be printed; ignore logical elements that in execute()
214 // If the elements bein in execute()
[all...]
/freebsd/sys/contrib/dev/acpica/components/dispatcher/
H A Ddspkginit.c178 * ElementCount - Number of elements in the package - this is
187 * NOTE: The number of elements in the package will be always be the NumElements
188 * count, regardless of the number of elements in the package list. If
189 * NumElements is smaller, only that many package list elements are used.
266 if (!ObjDesc->Package.Elements) in AcpiDsBuildInternalPackageObj()
268 ObjDesc->Package.Elements = ACPI_ALLOCATE_ZEROED ( in AcpiDsBuildInternalPackageObj()
271 if (!ObjDesc->Package.Elements) in AcpiDsBuildInternalPackageObj()
287 * full resolution of the package elements in order to support in AcpiDsBuildInternalPackageObj()
288 * forward references from the elements. This provides in AcpiDsBuildInternalPackageObj()
297 "%s: Deferring resolution of Package elements\n", in AcpiDsBuildInternalPackageObj()
[all …]
/freebsd/contrib/googletest/googlemock/src/
H A Dgmock-matchers.cc72 // a vector<int> called 'left_' whose elements are initialized to the
116 // . elements matchers vvv .
170 // right vector elements corresponding each segment of the path.
172 // flow was added to the network. The 'seen' vector elements correspond
219 // Elements of left_ and right_ are either kUnused or mutually
291 *os << "has " << Elements(1) << " and that element "; in DescribeToImpl()
295 *os << "has " << Elements(matcher_describers_.size()) in DescribeToImpl()
296 << " and there exists some permutation of elements such that:\n"; in DescribeToImpl()
299 *os << "a surjection from elements to requirements exists such that:\n"; in DescribeToImpl()
302 *os << "an injection from elements to requirements exists such that:\n"; in DescribeToImpl()
[all …]

12345678910>>...83