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

1234567

/freebsd-10.2-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-10.2-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-10.2-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-10.2-release/crypto/heimdal/lib/gssapi/mech/
H A Dgss_release_oid.c50 if (o->elements != NULL) {
51 free(o->elements);
52 o->elements = NULL;
H A Dgss_duplicate_oid.c56 (*dest_oid)->elements = malloc(src_oid->length);
57 if ((*dest_oid)->elements == NULL) {
63 memcpy((*dest_oid)->elements, src_oid->elements, src_oid->length);
H A Dgss_oid_equal.c57 return memcmp(a->elements, b->elements, a->length) == 0;
H A Dgss_release_oid_set.c38 if ((*set)->elements)
39 free((*set)->elements);
H A Dgss_utils.c38 to_oid->elements = malloc(len);
39 if (!to_oid->elements) {
45 memcpy(to_oid->elements, from_oid->elements, len);
53 if (oid->elements) {
54 free(oid->elements);
55 oid->elements = NULL;
H A Dgss_buffer_set.c49 set->elements = NULL;
76 set->elements = realloc(set->elements,
77 (set->count + 1) * sizeof(set->elements[0]));
78 if (set->elements == NULL) {
83 p = &set->elements[set->count];
112 gss_release_buffer(&minor, &((*buffer_set)->elements[i]));
114 free((*buffer_set)->elements);
116 (*buffer_set)->elements = NULL;
H A Dgss_add_oid_set_member.c74 tmp = realloc ((*oid_set)->elements, n * sizeof(gss_OID_desc));
79 (*oid_set)->elements = tmp;
81 (*oid_set)->elements[n-1] = *member_oid;
H A Dgss_release_name.c59 if (name->gn_type.elements)
60 free(name->gn_type.elements);
/freebsd-10.2-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);
/freebsd-10.2-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-10.2-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-10.2-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;
/freebsd-10.2-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-10.2-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-10.2-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...]

Completed in 178 milliseconds

1234567