/netbsd-current/tests/include/sys/ |
H A D | t_pslist.c | 60 } elements[] = { local 78 PSLIST_ENTRY_DESTROY(&elements[0], entry); 80 for (i = 0; i < __arraycount(elements); i++) 81 PSLIST_ENTRY_INIT(&elements[i], entry); 83 PSLIST_WRITER_INSERT_HEAD(&h, &elements[4], entry); 84 PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[2], entry); 85 PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[3], entry); 86 PSLIST_WRITER_INSERT_BEFORE(&elements[ [all...] |
/netbsd-current/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.python/ |
H A D | py-bad-printers.c | 25 int *elements; member in struct:container 35 result.elements = 0; 44 c->elements = array; 45 c->elements[c->len] = val;
|
/netbsd-current/external/gpl3/gdb/dist/gdb/testsuite/gdb.python/ |
H A D | py-bad-printers.c | 25 int *elements; member in struct:container 35 result.elements = 0; 44 c->elements = array; 45 c->elements[c->len] = val;
|
/netbsd-current/external/gpl3/binutils/dist/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...] |
/netbsd-current/external/gpl3/binutils.old/dist/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...] |
/netbsd-current/external/gpl3/gcc.old/dist/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...] |
/netbsd-current/external/gpl3/gdb.old/dist/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...] |
/netbsd-current/external/gpl3/gcc/dist/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...] |
/netbsd-current/external/gpl3/gdb/dist/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...] |
/netbsd-current/crypto/external/bsd/heimdal/dist/lib/gssapi/mech/ |
H A D | gss_release_oid.c | 52 if (o->elements != NULL) { 53 free(o->elements); 54 o->elements = NULL;
|
H A D | gss_duplicate_oid.c | 58 (*dest_oid)->elements = malloc(src_oid->length); 59 if ((*dest_oid)->elements == NULL) { 65 memcpy((*dest_oid)->elements, src_oid->elements, src_oid->length);
|
H A D | gss_release_oid_set.c | 40 if ((*set)->elements) 41 free((*set)->elements);
|
H A D | gss_oid_equal.c | 59 return memcmp(a->elements, b->elements, a->length) == 0;
|
H A D | gss_utils.c | 40 to_oid->elements = malloc(len); 41 if (!to_oid->elements) { 47 memcpy(to_oid->elements, from_oid->elements, len); 55 if (oid->elements) { 56 free(oid->elements); 57 oid->elements = NULL;
|
H A D | gss_buffer_set.c | 51 set->elements = NULL; 78 set->elements = realloc(set->elements, 79 (set->count + 1) * sizeof(set->elements[0])); 80 if (set->elements == NULL) { 85 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_add_oid_set_member.c | 76 tmp = realloc ((*oid_set)->elements, n * sizeof(gss_OID_desc)); 81 (*oid_set)->elements = tmp; 83 (*oid_set)->elements[n-1] = *member_oid;
|
/netbsd-current/external/mit/expat/dist/examples/ |
H A D | Makefile.am | 34 noinst_PROGRAMS = elements outline 36 elements_SOURCES = elements.c
|
/netbsd-current/external/gpl3/binutils.old/dist/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)
|
/netbsd-current/external/gpl3/binutils/dist/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)
|
/netbsd-current/external/gpl3/gcc.old/dist/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)
|
/netbsd-current/external/gpl3/gdb.old/dist/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)
|
/netbsd-current/external/gpl3/gcc/dist/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)
|
/netbsd-current/external/gpl3/gdb/dist/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)
|
/netbsd-current/external/gpl3/gcc.old/dist/libcc1/ |
H A D | marshall-cp.hh | 85 if (!marshall_array_elmts (conn, len * sizeof (a->elements[0]), 86 a->elements)) 95 // elements and virtualp, and 'delete' on the array object itself. 113 gva->elements = new gcc_type[len]; 116 len * sizeof (gva->elements[0]), 117 gva->elements)) 119 delete[] gva->elements; 131 delete[] gva->elements; 161 return marshall_array_elmts (conn, len * sizeof (a->elements[0]), 162 a->elements); [all...] |
/netbsd-current/external/gpl3/gcc/dist/libcc1/ |
H A D | marshall-cp.hh | 35 delete[] p->elements; 45 delete[] p->elements; 56 delete[] p->elements; 78 if (!marshall_array_elmts (conn, len * sizeof (a->elements[0]), 79 a->elements)) 88 // elements and virtualp, and 'delete' on the array object itself. 106 gva->elements = new gcc_type[len]; 109 len * sizeof (gva->elements[0]), 110 gva->elements)) 145 return marshall_array_elmts (conn, len * sizeof (a->elements[ [all...] |