| /src/external/gpl3/binutils/dist/include/ |
| 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| gcc-interface.h | 177 /* Number of elements. */
181 /* The elements. */
183 gcc_type *elements; member in struct:gcc_type_array
|
| /src/external/gpl3/binutils.old/dist/include/ |
| 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| gcc-interface.h | 177 /* Number of elements. */
181 /* The elements. */
183 gcc_type *elements; member in struct:gcc_type_array
|
| /src/external/gpl3/gcc/dist/include/ |
| 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| /src/external/gpl3/gcc.old/dist/include/ |
| 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.python/ |
| 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;
|
| /src/external/gpl3/gdb.old/dist/include/ |
| 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.python/ |
| 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;
|
| /src/external/gpl3/gdb/dist/include/ |
| 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| /src/sys/external/bsd/drm2/include/linux/ |
| nbsd-namespace-acpi.h | 34 #define elements Elements macro
|
| /src/tests/include/sys/ |
| 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[2], &elements[1], entry)
[all...] |
| /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/src/ |
| csv_reporter.cc | 34 std::vector<std::string> elements = { member in namespace:benchmark::__anon3654
59 for (auto B = elements.begin(); B != elements.end();) {
61 if (B != elements.end()) Out << ",";
99 Out << std::string(elements.size() - 3, ',');
|
| /src/external/apache2/llvm/dist/llvm/utils/benchmark/src/ |
| csv_reporter.cc | 34 std::vector<std::string> elements = { member in namespace:benchmark::__anon5830
57 for (auto B = elements.begin(); B != elements.end();) {
59 if (B != elements.end()) Out << ",";
95 Out << std::string(elements.size() - 3, ',');
|
| /src/external/gpl3/binutils/dist/ld/ |
| ldctor.h | 38 size_t count; /* Number of elements. */
39 struct set_element *elements; /* Elements in set. */ member in struct:set_info
|
| /src/external/gpl3/binutils.old/dist/ld/ |
| ldctor.h | 38 size_t count; /* Number of elements. */
39 struct set_element *elements; /* Elements in set. */ member in struct:set_info
|
| /src/external/gpl3/binutils/dist/libiberty/ |
| 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[elem1].class_count < elements[elem2].class_count)
144 struct partition_elem *elements = part->elements; local
[all...] |
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| 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[elem1].class_count < elements[elem2].class_count)
144 struct partition_elem *elements = part->elements; local
[all...] |
| /src/external/gpl3/gcc/dist/libiberty/ |
| 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[elem1].class_count < elements[elem2].class_count)
144 struct partition_elem *elements = part->elements; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/d/ |
| d-compiler.cc | 56 Expressions *elements = expr->isArrayLiteralExp ()->elements; local
59 vec_safe_reserve (elms, elements->length);
60 for (size_t i = 0; i < elements->length; i++)
62 Expression *e = (*elements)[i];
|
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| 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[elem1].class_count < elements[elem2].class_count)
144 struct partition_elem *elements = part->elements; local
[all...] |
| /src/external/gpl3/gdb.old/dist/libiberty/ |
| 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[elem1].class_count < elements[elem2].class_count)
144 struct partition_elem *elements = part->elements; local
[all...] |
| /src/external/gpl3/gdb/dist/libiberty/ |
| 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[elem1].class_count < elements[elem2].class_count)
144 struct partition_elem *elements = part->elements; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| checker-path.cc | 291 auto_vec<chain_element> elements; local
299 elements.safe_push (ce);
304 if (elements.length () > 0)
307 for (unsigned element_idx = elements.length () - 1; element_idx > 0;
310 const chain_element &ce = elements[element_idx];
312 = (blocks_in_curr_event.elements () - element_idx) - 1;
316 elements[element_idx - 1].m_fndecl,
|
| /src/external/gpl3/gcc/dist/gcc/ |
| hash-set.h | 28 such as integers, pointers, and std::pair. Inserted elements are
30 default ctor. Removed elements are destroyed by invoking their dtor.
31 On hash_set destruction all elements are removed. Objects of
43 /* Create a hash_set in gc memory with space for at least n elements. */
98 /* Return the number of elements in the set. */
100 size_t elements () const { return m_table.elements (); } function in class:hash_set
106 /* Return true when there are no elements in this hash set. */
|
