Searched refs:elements (Results 1 - 25 of 144) sorted by relevance

123456

/freebsd-9.3-release/sys/mips/cavium/octe/
H A Dethernet-mem.h31 int cvm_oct_mem_fill_fpa(int pool, int size, int elements);
32 void cvm_oct_mem_empty_fpa(int pool, int size, int elements);
H A Dethernet-mem.c52 * @param elements Number of buffers to allocate
54 int cvm_oct_mem_fill_fpa(int pool, int size, int elements) argument
56 int freed = elements;
71 return (elements - freed);
80 * @param elements Number of buffers to allocate
82 void cvm_oct_mem_empty_fpa(int pool, int size, int elements) argument
90 elements--;
95 if (elements < 0)
96 printf("Warning: Freeing of pool %u had too many mbufs (%d)\n", pool, elements);
97 else if (elements >
[all...]
/freebsd-9.3-release/contrib/binutils/libiberty/
H A Dpartition.c39 /* Creates a partition of NUM_ELEMENTS elements. Initially each
53 part->elements[e].class_element = e;
54 part->elements[e].next = &(part->elements[e]);
55 part->elements[e].class_count = 1;
77 struct partition_elem *elements = part->elements; local
83 int class_element = elements[elem1].class_element;
86 if (class_element == elements[elem2].class_element)
91 if (elements[elem
144 struct partition_elem *elements = part->elements; local
[all...]
/freebsd-9.3-release/contrib/gcclibs/libiberty/
H A Dpartition.c39 /* Creates a partition of NUM_ELEMENTS elements. Initially each
53 part->elements[e].class_element = e;
54 part->elements[e].next = &(part->elements[e]);
55 part->elements[e].class_count = 1;
77 struct partition_elem *elements = part->elements; local
83 int class_element = elements[elem1].class_element;
86 if (class_element == elements[elem2].class_element)
91 if (elements[elem
144 struct partition_elem *elements = part->elements; local
[all...]
/freebsd-9.3-release/lib/libgssapi/
H A Dgss_release_oid.c53 if (o->elements != NULL) {
54 free(o->elements);
55 o->elements = NULL;
H A Dgss_utils.c46 if (memcmp(oid1->elements, oid2->elements, oid1->length))
58 to_oid->elements = malloc(len);
59 if (!to_oid->elements) {
65 memcpy(to_oid->elements, from_oid->elements, len);
74 if (oid->elements) {
75 free(oid->elements);
76 oid->elements = NULL;
H A Dgss_add_oid_set_member.c61 new_oid->elements = malloc(member_oid->length);
62 if (!new_oid->elements) {
67 memcpy(new_oid->elements, member_oid->elements, member_oid->length);
69 if (set->elements) {
70 memcpy(new_elements, set->elements,
72 free(set->elements);
74 set->elements = new_elements;
H A Dgss_release_oid_set.c40 if ((*set)->elements)
41 free((*set)->elements);
H A Dgss_buffer_set.c54 set->elements = NULL;
79 set->elements = realloc(set->elements,
80 (set->count + 1) * sizeof(set->elements[0]));
81 if (set->elements == NULL) {
86 p = &set->elements[set->count];
114 gss_release_buffer(&minor, &((*buffer_set)->elements[i]));
116 free((*buffer_set)->elements);
118 (*buffer_set)->elements = NULL;
H A Dgss_duplicate_oid.c52 dest_oid->elements = malloc(src_oid->length);
53 if (!dest_oid->elements) {
59 memcpy(dest_oid->elements, src_oid->elements, src_oid->length);
H A Dgss_release_name.c44 if (name->gn_type.elements)
45 free(name->gn_type.elements);
H A Dgss_create_empty_oid_set.c49 set->elements = 0;
H A Dgss_test_oid_set_member.c43 if (gss_oid_equal(member, &set->elements[i]))
/freebsd-9.3-release/contrib/binutils/include/
H A Dpartition.h23 elements are partitioned into classes. Each class is represented
24 by one of its elements, the canonical element, which is chosen
25 arbitrarily from elements in the class. The principal operations
28 which unites the two classes that contain two given elements into a
54 /* The number of elements in this class. Valid only if this is the
61 /* The number of elements in this partition. */
63 /* The elements in the partition. */
64 struct partition_elem elements[1]; member in struct:partition_def
76 ((partition__)->elements[(element__)].class_element)
/freebsd-9.3-release/contrib/gcclibs/include/
H A Dpartition.h23 elements are partitioned into classes. Each class is represented
24 by one of its elements, the canonical element, which is chosen
25 arbitrarily from elements in the class. The principal operations
28 which unites the two classes that contain two given elements into a
54 /* The number of elements in this class. Valid only if this is the
61 /* The number of elements in this partition. */
63 /* The elements in the partition. */
64 struct partition_elem elements[1]; member in struct:partition_def
76 ((partition__)->elements[(element__)].class_element)
/freebsd-9.3-release/sys/kgssapi/
H A Dgss_add_oid_set_member.c63 new_oid->elements = malloc(member_oid->length, M_GSSAPI, M_WAITOK);
65 memcpy(new_oid->elements, member_oid->elements, member_oid->length);
67 if (set->elements) {
68 memcpy(new_elements, set->elements,
70 free(set->elements, M_GSSAPI);
72 set->elements = new_elements;
H A Dgss_release_oid_set.c46 if ((*set)->elements)
47 free((*set)->elements, M_GSSAPI);
/freebsd-9.3-release/contrib/gdb/include/
H A Dpartition.h23 elements are partitioned into classes. Each class is represented
24 by one of its elements, the canonical element, which is chosen
25 arbitrarily from elements in the class. The principal operations
28 which unites the two classes that contain two given elements into a
54 /* The number of elements in this class. Valid only if this is the
61 /* The number of elements in this partition. */
63 /* The elements in the partition. */
64 struct partition_elem elements[1]; member in struct:partition_def
79 ((partition__)->elements[(element__)].class_element)
/freebsd-9.3-release/sys/kern/
H A Dsubr_hash.c48 hashinit_flags(int elements, struct malloc_type *type, u_long *hashmask, argument
55 KASSERT(elements > 0, ("%s: bad elements", __func__));
60 for (hashsize = 1; hashsize <= elements; hashsize <<= 1)
83 hashinit(int elements, struct malloc_type *type, u_long *hashmask) argument
86 return (hashinit_flags(elements, type, hashmask, HASH_WAITOK));
109 phashinit(int elements, struct malloc_type *type, u_long *nentries) argument
115 KASSERT(elements > 0, ("%s: bad elements", __func__));
116 for (i = 1, hashsize = primes[1]; hashsize <= elements;) {
[all...]
/freebsd-9.3-release/sys/dev/isci/scil/
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;
136 // Loop through all of the elements in the array and push them onto the
161 return (list_p)->elements.front_p;
173 ( ( (list_p)->elements.front_p ) ? ((list_p)->elements
[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 in struct:SCI_ABSTRACT_ELEMENT_POOL
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 currentl
201 SCI_ABSTRACT_ELEMENT_LIST_T elements; member in struct:SCI_ABSTRACT_LIST
[all...]
/freebsd-9.3-release/contrib/binutils/ld/
H A Dldctor.c78 p->elements = NULL;
96 if (p->elements != NULL
98 && p->elements->section->owner != NULL
100 bfd_get_target (p->elements->section->owner)) != 0)
114 for (epp = &p->elements; *epp != NULL; epp = &(*epp)->next)
149 /* This function is used to sort constructor elements by priority. It
219 if (p->elements == NULL)
223 for (e = p->elements; e != NULL; e = e->next)
229 for (e = p->elements; e != NULL; e = e->next)
238 p->elements
[all...]
H A Dldctor.h39 size_t count; /* Number of elements. */
40 struct set_element *elements; /* Elements in set. */ member in struct:set_info
/freebsd-9.3-release/sys/security/mac/
H A Dmac_syscalls.c82 char *elements, *buffer; local
108 elements = malloc(mac.m_buflen, M_MACTEMP, M_WAITOK);
109 error = copyinstr(mac.m_string, elements, mac.m_buflen, NULL);
111 free(elements, M_MACTEMP);
117 error = mac_cred_externalize_label(tcred->cr_label, elements,
123 free(elements, M_MACTEMP);
131 char *elements, *buffer; local
143 elements = malloc(mac.m_buflen, M_MACTEMP, M_WAITOK);
144 error = copyinstr(mac.m_string, elements, mac.m_buflen, NULL);
146 free(elements, M_MACTEM
225 char *elements, *buffer; local
321 char *elements, *buffer; local
374 char *elements, *buffer; local
[all...]
/freebsd-9.3-release/contrib/bind9/lib/dns/
H A Dacl.c34 * for 'n' ACL elements. The elements are uninitialized and the
69 acl->elements = NULL;
80 acl->elements = isc_mem_get(mctx, n * sizeof(dns_aclelement_t));
81 if (acl->elements == NULL) {
86 memset(acl->elements, 0, n * sizeof(dns_aclelement_t));
237 /* Now search non-radix elements for a match with a lower node_num. */
239 dns_aclelement_t *e = &acl->elements[i];
293 /* Copy in the original elements */
294 memmove(newmem, dest->elements,
[all...]

Completed in 200 milliseconds

123456