/freebsd-11-stable/sys/mips/cavium/octe/ |
H A D | ethernet-mem.h | 31 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 D | ethernet-mem.c | 53 * @param elements Number of buffers to allocate 55 int cvm_oct_mem_fill_fpa(int pool, int size, int elements) argument 57 int freed = elements; 72 return (elements - freed); 81 * @param elements Number of buffers to allocate 83 void cvm_oct_mem_empty_fpa(int pool, int size, int elements) argument 91 elements--; 96 if (elements < 0) 97 printf("Warning: Freeing of pool %u had too many mbufs (%d)\n", pool, elements); 98 else if (elements > [all...] |
/freebsd-11-stable/contrib/netbsd-tests/include/sys/ |
H A D | t_pslist.c | 53 } elements[] = { local 71 PSLIST_ENTRY_DESTROY(&elements[0], entry); 73 for (i = 0; i < __arraycount(elements); i++) 74 PSLIST_ENTRY_INIT(&elements[i], entry); 76 PSLIST_WRITER_INSERT_HEAD(&h, &elements[4], entry); 77 PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[2], entry); 78 PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[3], entry); 79 PSLIST_WRITER_INSERT_BEFORE(&elements[ [all...] |
/freebsd-11-stable/contrib/gcclibs/libiberty/ |
H A D | partition.c | 39 /* 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-11-stable/contrib/binutils/libiberty/ |
H A D | partition.c | 39 /* 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-11-stable/lib/libgssapi/ |
H A D | gss_release_oid.c | 53 if (o->elements != NULL) { 54 free(o->elements); 55 o->elements = NULL;
|
H A D | gss_release_oid_set.c | 46 o = &set->elements[i]; 47 if (o->elements) 48 free(o->elements); 50 free(set->elements);
|
H A D | gss_utils.c | 46 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 D | gss_add_oid_set_member.c | 61 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 D | gss_buffer_set.c | 54 set->elements = NULL; 79 set->elements = reallocarray(set->elements, set->count + 1, 80 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 D | gss_duplicate_oid.c | 52 dest_oid->elements = malloc(src_oid->length); 53 if (!dest_oid->elements) { 59 memcpy(dest_oid->elements, src_oid->elements, src_oid->length);
|
/freebsd-11-stable/crypto/heimdal/lib/gssapi/mech/ |
H A D | gss_release_oid.c | 50 if (o->elements != NULL) { 51 free(o->elements); 52 o->elements = NULL;
|
H A D | gss_duplicate_oid.c | 56 (*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 D | gss_oid_equal.c | 57 return memcmp(a->elements, b->elements, a->length) == 0;
|
H A D | gss_release_oid_set.c | 38 if ((*set)->elements) 39 free((*set)->elements);
|
H A D | gss_utils.c | 38 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 D | gss_buffer_set.c | 49 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 D | gss_add_oid_set_member.c | 74 tmp = realloc ((*oid_set)->elements, n * sizeof(gss_OID_desc)); 79 (*oid_set)->elements = tmp; 81 (*oid_set)->elements[n-1] = *member_oid;
|
/freebsd-11-stable/contrib/expat/examples/ |
H A D | Makefile.am | 33 noinst_PROGRAMS = elements outline 35 elements_SOURCES = elements.c
|
/freebsd-11-stable/contrib/gcclibs/include/ |
H A D | partition.h | 23 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-11-stable/contrib/binutils/include/ |
H A D | partition.h | 23 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-11-stable/sys/kgssapi/ |
H A D | gss_add_oid_set_member.c | 63 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-11-stable/contrib/gdb/include/ |
H A D | partition.h | 23 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-11-stable/sys/kern/ |
H A D | subr_hash.c | 55 hashinit_flags(int elements, struct malloc_type *type, u_long *hashmask, argument 62 KASSERT(elements > 0, ("%s: bad elements", __func__)); 67 for (hashsize = 1; hashsize <= elements; hashsize <<= 1) 85 hashinit(int elements, struct malloc_type *type, u_long *hashmask) argument 88 return (hashinit_flags(elements, type, hashmask, HASH_WAITOK)); 113 phashinit_flags(int elements, struct malloc_type *type, u_long *nentries, int flags) argument 119 KASSERT(elements > 0, ("%s: bad elements", __func__)); 124 for (i = 1, hashsize = primes[1]; hashsize <= elements;) { 148 phashinit(int elements, struct malloc_type *type, u_long *nentries) argument [all...] |
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | sorts.c | 160 /* allocate an array with enough elements to hold all the keys. */ 194 the array at BASE which has NELTS elements of size ELT_SIZE bytes each, 326 /* Move the elements after INSERT_INDEX along. (When elements_to_move == 0, 348 "at index %d, %d elements, in array length %d"), 351 /* If we are deleting a block of elements that does not extend to the end 352 of the array, then we need to move the remaining elements to keep 360 /* Delete the last ELEMENTS_TO_DELETE elements. */ 406 /* the queue elements, ordered as a heap according to COMPARE_FUNC */ 407 apr_array_header_t *elements; 421 char *lhs_value = queue->elements 405 apr_array_header_t *elements; member in struct:svn_priority_queue__t 487 svn_priority_queue__create(apr_array_header_t *elements, int (*compare_func)(const void *, const void *)) argument [all...] |