Searched refs:elements (Results 226 - 250 of 553) sorted by relevance

1234567891011>>

/netbsd-current/external/gpl3/gdb.old/dist/binutils/
H A Dcoffdump.c166 dump_coff_scope (p->u.astructdef.elements);
180 dump_coff_scope (p->u.aenumdef.elements);
/netbsd-current/external/gpl3/gcc/dist/gcc/analyzer/
H A Danalyzer.h387 size_t elements () const { return m_inner_map.elements (); } function in class:consolidation_map
H A Dstore.cc538 gcc_assert (m_map.elements () == 0);
554 if (m_map.elements () != other.m_map.elements ())
690 if (int count_cmp = map1.elements () - map2.elements ())
693 auto_vec <const binding_key *> keys1 (map1.elements ());
699 auto_vec <const binding_key *> keys2 (map2.elements ());
814 /* Bind the value VAL into the range of elements within PARENT_REF
1546 && m_map.elements () > 0)
1694 if (result_map.elements ()
[all...]
H A Dstore.h92 accesses to other elements are "UNKNOWN" rather than
498 size_t elements () const { return m_map.elements (); } function in class:ana::binding_map
624 bool empty_p () const { return m_map.elements () == 0; }
/netbsd-current/external/apache2/llvm/dist/clang/utils/ABITest/
H A DABITestGen.py237 elements = [random.choice(fv) for fv in fieldValues]
238 elements[i] = v
239 yield '{ %s }'%(', '.join(elements))
250 elements = [random.choice(values) for i in range(t.numElements)]
251 elements[i] = v
252 yield '{ %s }'%(', '.join(elements))
/netbsd-current/external/gpl3/gcc/dist/gcc/d/dmd/
H A Ddstruct.d540 auto e = (*sle.elements)[i];
553 const dim = ale.elements ? ale.elements.dim : 0;
H A Dexpression.d2927 /** If !is null, elements[] can be sparse and basis is used for the
2928 * "default" element value. In other words, non-null elements[i] overrides
2933 Expressions* elements;
2937 extern (D) this(const ref Loc loc, Type type, Expressions* elements)
2941 this.elements = elements;
2948 elements = new Expressions();
2949 elements.push(e);
2952 extern (D) this(const ref Loc loc, Type type, Expression basis, Expressions* elements)
2957 this.elements
[all...]
H A Ddcast.d195 ? tb.nextOf().sarrayOf(ale.elements ? ale.elements.dim : 0)
555 foreach (i, el; (*e.elements)[])
713 if (e.elements.dim != tsa.dim.toInteger())
718 if (!e.elements.dim)
731 for (size_t i = 0; i < e.elements.dim; i++)
733 Expression el = (*e.elements)[i];
756 const edim = e.elements.dim;
771 foreach (el; (*e.elements)[])
2273 if (e.elements
[all...]
/netbsd-current/sys/external/bsd/vchiq/dist/interface/vchiq_arm/
H A Dvchiq_core.c772 int msgid, const VCHIQ_ELEMENT_T *elements,
903 pos += elements[i++].size)
904 if (elements[i].size) {
906 (header->data + pos, elements[i].data,
907 (size_t) elements[i].size) !=
963 WARN_ON(!((count == 1) && (size == elements[0].size)));
964 memcpy(header->data, elements[0].data,
965 elements[0].size);
1011 int msgid, const VCHIQ_ELEMENT_T *elements,
1049 pos += elements[
771 queue_message(VCHIQ_STATE_T *state, VCHIQ_SERVICE_T *service, int msgid, const VCHIQ_ELEMENT_T *elements, int count, int size, int flags) argument
1010 queue_message_sync(VCHIQ_STATE_T *state, VCHIQ_SERVICE_T *service, int msgid, const VCHIQ_ELEMENT_T *elements, int count, int size, int is_blocking) argument
3455 vchiq_queue_message(VCHIQ_SERVICE_HANDLE_T handle, const VCHIQ_ELEMENT_T *elements, unsigned int count) argument
[all...]
/netbsd-current/sys/dev/usb/
H A Dif_upgt.c1157 int i, elements, flags; local
1164 elements = freq3_header->elements;
1167 DPRINTF(2, "%s: elements=%d\n", device_xname(sc->sc_dev), elements);
1170 for (i = 0; i < elements; i++) {
1187 int i, j, elements, settings, flags; local
1194 elements = freq4_header->elements;
1201 DPRINTF(2, "%s: elements
1225 int i, elements; local
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/gcc/d/dmd/
H A Doptimize.c254 if (e->elements)
257 for (size_t i = 0; i < e->elements->dim; i++)
259 expOptimize((*e->elements)[i], result & WANTexpand);
279 if (e->elements)
281 for (size_t i = 0; i < e->elements->dim; i++)
283 expOptimize((*e->elements)[i], result & WANTexpand);
1021 len = ((ArrayLiteralExp *)arr)->elements->dim;
H A Descape.c822 for (size_t i = 0; i < e->elements->dim; i++)
824 Expression *el = (*e->elements)[i];
833 if (e->elements)
835 for (size_t i = 0; i < e->elements->dim; i++)
837 Expression *ex = (*e->elements)[i];
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/container/
H A Darray.d49 // set elements
240 * This means that pointers to elements of an `Array` will become
333 void reserve(size_t elements)
335 if (elements <= capacity) return;
338 const sz = mulu(elements, T.sizeof, overflow);
359 (elements - oldLength) * T.sizeof);
373 _capacity = elements;
469 * `ConstRange` is a variant with `const` elements.
470 * `ImmutableRange` is a variant with `immutable` elements.
481 * Duplicates the array. The elements themselve
[all...]
H A Drbtree.d730 * elements $(D a) and $(D b), $(D less(a, b) == !less(b, a)). $(D less(a, a)) should
734 * once continues to add more elements. If it is $(D false), duplicate elements are
735 * ignored on insertion. If duplicates are allowed, then new elements are
736 * inserted after all existing duplicate elements.
959 * Check if any elements exist in the container. Returns $(D false) if at least
968 Returns the number of elements in the container.
979 * copy of the elements.
1002 * Fetch a range that spans all the elements in the container.
1098 * Removes all elements fro
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dhash-table.h56 individual elements of the table need to be disposed of (e.g.,
57 when deleting a hash table, removing elements from the table, etc).
60 function is provided only for garbage-collected elements that
78 allocates the data elements in the table.
81 deallocates the data elements in the table.
114 uses 'keep_cache_entry' (described above) to keep elements that
134 If your elements are pointers, it is usually easiest to start with one
185 There are four descriptors for pointer elements, one for each of
193 These descriptors hash and compare elements by their pointer value,
361 The table stores elements o
406 size_t elements () const { return m_n_elements - m_n_deleted; } function in class:hash_table
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/gdb/compile/
H A Dcompile-cplus-types.c227 contain unequal number of elements or if any of the components are not
858 bases.elements = XNEWVEC (gcc_type, num_baseclasses);
870 bases.elements[i] = instance->convert_type (base_type);
877 xfree (bases.elements);
1000 array.elements[i - artificials]
1009 xfree (array.elements);
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dhash-table.h56 individual elements of the table need to be disposed of (e.g.,
57 when deleting a hash table, removing elements from the table, etc).
60 function is provided only for garbage-collected elements that
78 allocates the data elements in the table.
81 deallocates the data elements in the table.
114 uses 'keep_cache_entry' (described above) to keep elements that
134 If your elements are pointers, it is usually easiest to start with one
185 There are four descriptors for pointer elements, one for each of
193 These descriptors hash and compare elements by their pointer value,
361 The table stores elements o
406 size_t elements () const { return m_n_elements - m_n_deleted; } function in class:hash_table
[all...]
H A Dctfout.cc243 gcc_assert (index <= arg_ctfc->ctfc_types->elements ());
285 size_t num_ctf_types = ctfc->ctfc_types->elements ();
783 size_t num_ctf_types = ctfc->ctfc_types->elements ();
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/container/
H A Drbtree.d737 * elements `a` and `b`, $(D less(a, b) == !less(b, a)). $(D less(a, a)) should
741 * once continues to add more elements. If it is `false`, duplicate elements are
742 * ignored on insertion. If duplicates are allowed, then new elements are
743 * inserted after all existing duplicate elements.
970 * Check if any elements exist in the container. Returns `false` if at least
979 Returns the number of elements in the container.
990 * copy of the elements.
1013 * Fetch a range that spans all the elements in the container.
1237 * Removes all elements fro
[all...]
H A Darray.d104 // set elements
349 static if (display) writefln("@%*Xh: This is where the array elements are.", nDigitsForPointer, &a [0]);
374 * This means that pointers to elements of an `Array` will become
453 assert(0, "Cannot add elements to array because `" ~
464 void reserve(size_t elements)
466 if (elements <= capacity) return;
469 const sz = elements;
475 const sz = mulu(elements, T.sizeof, overflow);
496 (elements - oldLength) * T.sizeof);
509 _capacity = elements;
[all...]
/netbsd-current/crypto/external/bsd/heimdal/dist/lib/gssapi/gssapi/
H A Dgssapi.h104 void *elements; member in struct:gss_OID_desc_struct
110 gss_OID elements; member in struct:gss_OID_set_desc_struct
138 gss_buffer_desc *elements; member in struct:gss_buffer_set_desc_struct
/netbsd-current/crypto/external/bsd/heimdal/dist/lib/gssapi/spnego/
H A Dinit_sec_context.c456 GSS_SPNEGO_MECHANISM->elements,
467 ctx->preferred_mech_type->elements,
495 mech.elements = ctx->oidbuf + sizeof(ctx->oidbuf) - ctx->oidlen;
/netbsd-current/sys/external/bsd/drm2/dist/drm/qxl/
H A Dqxl_cmd.c44 uint8_t elements[0]; member in struct:ring
149 elt = ring->ring->elements + idx * ring->element_size;
180 ring_elt = ring->ring->elements + idx * ring->element_size;
/netbsd-current/external/gpl3/binutils/dist/gprofng/src/
H A DDataSpace.cc306 // for data layout, insert elements that have no metrics yet
315 Vector<DataObject*> *elements = dbeSession->get_dobj_elements (tmpParent); local
316 for (long eli = 0, sz = elements->size (); eli < sz; eli++)
318 DataObject* element = elements->fetch (eli);
/netbsd-current/external/gpl3/gcc.old/dist/gcc/brig/brigfrontend/
H A Dbrig-function.cc916 /* Call the scalar built-in for all elements in the vector. */
1293 /* Unpacks the elements of the vector in VALUE to scalars (bit field
1297 brig_function::unpack (tree value, tree_stl_vec &elements) argument
1317 elements.push_back (element);
1321 /* Pack the elements of the scalars in ELEMENTS to the returned vector. */
1324 brig_function::pack (tree_stl_vec &elements) argument
1326 size_t element_count = elements.size ();
1330 tree output_element_type = TREE_TYPE (elements.at (0));
1334 CONSTRUCTOR_APPEND_ELT (constructor_vals, NULL_TREE, elements.at (i));
1339 that requires compile time constant elements
[all...]

Completed in 369 milliseconds

1234567891011>>