Searched full:elements (Results 1 – 25 of 2643) sorted by relevance
12345678910>>...106
53 } elements[] = { in ATF_TC_BODY() local71 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 …]
30 /// storing the elements that have non-zero bits set. In order to make this264 ElementList Elements; variable280 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.begin(); in BitVector()[all …]
29 /// As a side effect the elements are initialised later than in a normal vector.30 /// On the first access to one of the elements of a given page, all the elements31 /// of the page are initialised. This also means that the elements of the page34 /// Similarly on destruction the elements are destroyed only when the page is35 /// not needed anymore, delaying invoking the destructor of the elements.37 /// Notice that this has iterators only on materialized elements. This38 /// is deliberately done under the assumption you would dereference the elements45 /// The actual number of elements in the vector which can be accessed.51 /// Actual page data. All the page elements are allocated on the52 /// first access of any of the elements of the page. Elements are default[all …]
168 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, Coun in AcpiNsCheckPackage() 539 AcpiNsCheckPackageList(ACPI_EVALUATE_INFO * Info,const ACPI_PREDEFINED_INFO * Package,ACPI_OPERAND_OBJECT ** Elements,UINT32 Count) AcpiNsCheckPackageList() argument 769 AcpiNsCustomPackage(ACPI_EVALUATE_INFO * Info,ACPI_OPERAND_OBJECT ** Elements,UINT32 Count) AcpiNsCustomPackage() argument 856 AcpiNsCheckPackageElements(ACPI_EVALUATE_INFO * Info,ACPI_OPERAND_OBJECT ** Elements,UINT8 Type1,UINT32 Count1,UINT8 Type2,UINT32 Count2,UINT32 StartIndex) AcpiNsCheckPackageElements() argument [all...]
65 the following elements start from. This is usually set to67 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 words71 29-bit Filter 0-64 elements / 0-128 words72 Rx FIFO 0 0-64 elements / 0-1152 words73 Rx FIFO 1 0-64 elements / 0-1152 words74 Rx Buffers 0-64 elements / 0-1152 words75 Tx Event FIFO 0-32 elements / 0-64 words76 Tx Buffers 0-32 elements / [all...]
30 # 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 $counter40 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 array69 (( item = $RANDOM % ${#elements[@]} ))72 comb_str=${elements[item]}[all …]
35 # According to $elements, $prefix and $separator, the function random produce38 # $1 elements which is used to get the combination.43 function gen_option_str # $elements $prefix $separator $counter45 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 array74 (( item = $RANDOM % ${#elements[@]} ))77 comb_str=${elements[item]}[all …]
66 * of the 2 link elements used in the SCI_FAST_LIST and70 * @note Do not use the SCI_SIMPLE_LIST if you need to remove elements from103 * 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 inserting196 * @note Pushing new elements onto a list is more efficient than inserting252 * Move all the list elements from source anchor to the dest anchor.253 * The source anchor will have all of its elements removed making it255 * and dest list elements.257 * @param[in, out] dest_anchor this is the list into which all elements from[all …]
135 * 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 be169 * Pointer to an array of elements to be managed by this pool. This170 * array acts as the memory store for the elements in the free pool or173 SCI_ABSTRACT_ELEMENT_T * elements; member176 * This field contains the maximum number of free elements for the pool.182 * Pointer to the list of free elements that can be allocated from194 * an element pool from which to draw free elements.199 * This represents the elements currently managed by the list.[all …]
96 * utilized as the repository of free elements for list usage.113 * the free pool from which the elements will be extracted115 * the array of list elements to be added to the free list117 * the count of the elements to be added to the free list these should be118 * the same as the array size of list elements133 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 …]
22 /// vector of [4 x i32] in \a V1 and the next four 32-bit elements of the44 /// A 128-bit vector of [4 x i32] containing the next four elements of55 /// four message elements in the 128-bit vector of [4 x i32] in \a __Y, and65 /// A 128-bit vector of [4 x i32] containing the next four elements of the76 /// message elements using previous message elements from the 128-bit84 /// 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 of119 /// next two message elements (unsigned 32-bit integers) and corresponding[all …]
31 /// single-precision (32-bit) floating-point elements, and store the results in64 /// single-precision (32-bit) floating-point elements, and store the results in97 /// single-precision (32-bit) floating-point elements, and store the results in130 /// single-precision (32-bit) floating-point elements, and store the results in160 /// Convert packed BF16 (16-bit) floating-point even-indexed elements162 /// single-precision (32-bit) floating-point elements, and store the results in193 /// Convert packed BF16 (16-bit) floating-point even-indexed elements195 /// single-precision (32-bit) floating-point elements, and store the results in226 /// Convert packed half-precision (16-bit) floating-point even-indexed elements228 /// single-precision (32-bit) floating-point elements, and store the results in[all …]
71 …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 flush82 // process atom will create instruction trace, or no memory access trace output elements. 97 // process marker elements177 int m_unseen_spec_elem; // speculative elements at decode start179 /** Remove elements that are associated with data trace */181 // data trace associative elements (unsupported at present in the decoder).[all …]
52 hashinit_flags(int elements, struct malloc_type *type, u_long *hashmask, in hashinit_flags() argument58 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() argument84 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() argument114 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() argument146 return (phashinit_flags(elements, type, nentries, HASH_WAITOK)); in phashinit()
46 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()
61 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()
55 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()
84 char *elements, *buffer; sys___mac_get_pid() local 133 char *elements, *buffer; sys___mac_get_proc() local 227 char *elements, *buffer; sys___mac_get_fd() local 336 char *elements, *buffer; kern___mac_get_path() local
63 * 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 in67 * 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 …]
49 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()
38 to_oid->elements = malloc(len); in _gss_copy_oid()39 if (!to_oid->elements) { in _gss_copy_oid()45 memcpy(to_oid->elements, from_oid->elements, len); in _gss_copy_oid()53 if (oid->elements) { in _gss_free_oid()54 free(oid->elements); in _gss_free_oid()55 oid->elements = NULL; in _gss_free_oid()
42 * @brief Maintain a list of elements to be output44 * 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 elements81 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 …]
72 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 …]
120 // 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() local202 // Report elements that can be printed; ignore logical elements that in execute()214 // If the elements being compared are scopes and are a match, in execute()224 Elements.push_back(Reference); in execute()[all …]
178 * ElementCount - Number of elements in the package - this is187 * NOTE: The number of elements in the package will be always be the NumElements188 * count, regardless of the number of elements in the package list. If189 * 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\ in AcpiDsBuildInternalPackageObj() [all...]