/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp1y/ |
H A D | var-templ15.C | 4 template <class T> T elements; variable 5 int i = elements <>; // { dg-error "arguments" }
|
/haiku-buildtools/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...] |
/haiku-buildtools/gcc/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...] |
/haiku-buildtools/legacy/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...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | pr42927.c | 14 scsires_extent_elem_t *elements; member in struct:scsires_extent 23 buf[(i * 8)] = new_extent->elements[i].mode; 24 buf[(i * 8) + 1] = ((new_extent->elements[i].length >> 16) & 0xff); 25 buf[(i * 8) + 2] = ((new_extent->elements[i].length >> 8) & 0xff); 26 buf[(i * 8) + 3] = (new_extent->elements[i].length & 0xff); 27 buf[(i * 8) + 4] = ((new_extent->elements[i].first_block >> 24) & 0xff); 28 buf[(i * 8) + 5] = ((new_extent->elements[i].first_block >> 16) & 0xff); 29 buf[(i * 8) + 6] = ((new_extent->elements[i].first_block >> 8) & 0xff); 30 buf[(i * 8) + 7] = (new_extent->elements[i].first_block & 0xff);
|
/haiku-buildtools/legacy/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)
|
/haiku-buildtools/gcc/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)
|
/haiku-buildtools/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)
|
/haiku-buildtools/binutils/gas/testsuite/gas/ia64/ |
H A D | rotX.l | 2 .*.s:[[:digit:]]+: Error: [Nn]umber of elements must be positive 3 .*.s:[[:digit:]]+: Error: [Nn]umber of elements must be positive
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/ia64/ |
H A D | rotX.l | 2 .*.s:[[:digit:]]+: Error: [Nn]umber of elements must be positive 3 .*.s:[[:digit:]]+: Error: [Nn]umber of elements must be positive
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/20_util/hash/ |
H A D | chi2_quality.h | 59 double elements = 0; local 63 ++elements; 66 const double z = elements / buckets;
|
/haiku-buildtools/binutils/ld/ |
H A D | ldctor.c | 77 p->elements = NULL; 95 if (p->elements != NULL 97 && p->elements->section->owner != NULL 99 bfd_get_target (p->elements->section->owner)) != 0) 113 for (epp = &p->elements; *epp != NULL; epp = &(*epp)->next) 148 /* 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 D | ldctor.h | 38 size_t count; /* Number of elements. */ 39 struct set_element *elements; /* Elements in set. */ member in struct:set_info
|
/haiku-buildtools/legacy/binutils/ld/ |
H A D | ldctor.c | 78 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 D | ldctor.h | 39 size_t count; /* Number of elements. */ 40 struct set_element *elements; /* Elements in set. */ member in struct:set_info
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | attr-alloc_size.c | 12 extern char *calloc1(int size, int elements) __attribute__((alloc_size(1,2))); 13 extern char *calloc2(int size, int empty, int elements) __attribute__((alloc_size(1,3)));
|
/haiku-buildtools/gcc/libcc1/ |
H A D | marshall.cc | 140 return conn->send (a->elements, r * sizeof (a->elements[0])); 156 (*result)->elements = new gcc_type[len]; 158 if (!conn->get ((*result)->elements, len * sizeof ((*result)->elements[0]))) 160 delete[] (*result)->elements;
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | spec_expr_4.f90 | 7 module elements module 15 end module elements 17 use elements
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/ |
H A D | bug427.go | 17 // array with four elements 20 // array with five elements
|
H A D | bug457.go | 7 // Issue 4197: growing a slice of zero-width elements
|
H A D | issue4620.go | 7 // Issue 4620: map indexes are not evaluated before assignment of other elements
|
/haiku-buildtools/legacy/gcc/gcc/ch/ |
H A D | convert.c | 330 tree elements = CONSTRUCTOR_ELTS (inits); 342 tree value = remove_tree_element (DECL_NAME (field), &elements); 346 else if (elements && TREE_PURPOSE (elements) == NULL_TREE) 348 value = elements; 349 elements = TREE_CHAIN (elements); 458 &elements); 463 && elements && TREE_PURPOSE (elements) 327 tree elements = CONSTRUCTOR_ELTS (inits); local [all...] |
/haiku-buildtools/legacy/binutils/binutils/ |
H A D | coffgrok.h | 109 struct coff_scope *elements; member in struct:coff_type::__anon2456::__anon2458 120 struct coff_scope *elements; member in struct:coff_type::__anon2456::__anon2460
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/ |
H A D | char_lit1.go | 13 // check that surrogate pair elements are invalid
|
/haiku-buildtools/binutils/binutils/ |
H A D | coffgrok.h | 110 struct coff_scope *elements; member in struct:coff_type::__anon208::__anon210 121 struct coff_scope *elements; member in struct:coff_type::__anon208::__anon212
|