| /src/external/gpl3/gcc.old/dist/gcc/d/dmd/root/ |
| array.h | 6 * https://github.com/dlang/dmd/blob/master/src/dmd/root/array.h
16 struct Array
25 Array(const Array&);
28 Array()
35 ~Array()
74 void append(Array *a)
81 //printf("Array::reserve: length = %d, data.length = %d, nentries = %d\n", (int)length, (int)data.length, (int)nentries);
124 void insert(d_size_t index, Array *a)
182 Array *copy(
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| LiveIntervalUnion.h | 171 // Array of LiveIntervalUnions.
172 class Array {
177 Array() = default;
178 ~Array() { clear(); }
180 // Initialize the array to have Size entries.
|
| /src/sys/external/bsd/acpica/dist/common/ |
| dmtbdump.c | 323 UINT32 *Array;
329 /* Point to start of table pointer array */
331 Array = ACPI_CAST_PTR (ACPI_TABLE_RSDT, Table)->TableOffsetEntry;
341 AcpiOsPrintf ("%8.8X\n", Array[i]);
363 UINT64 *Array;
369 /* Point to start of table pointer array */
371 Array = ACPI_CAST_PTR (ACPI_TABLE_XSDT, Table)->TableOffsetEntry;
381 AcpiOsPrintf ("%8.8X%8.8X\n", ACPI_FORMAT_UINT64 (Array[i]));
|
| dmtbdump1.c | 71 * 4) A list (array) of Interrupt Structures
318 /* Dump the entire interrupt structure array, if present */
1190 UINT8 *Array;
1214 /* Dump the BaseAddress array */
1221 Array = (UINT8 *) Subtable + ArrayOffset;
1223 Status = AcpiDmDumpTable (Length, AbsoluteOffset, Array,
1231 /* Dump the AddressSize array */
1238 Array = (UINT8 *) Subtable + ArrayOffset;
1240 Status = AcpiDmDumpTable (Length, AbsoluteOffset, Array,
1253 Array = (UINT8 *) Subtable + ArrayOffset
[all...] |
| /src/external/apache2/llvm/dist/clang/tools/scan-build/share/scan-build/ |
| sorttable.js | 140 // build an array to sort. This is a Schwartzian transform thing,
447 // array-like enumeration
448 if (!Array.forEach) { // mozilla already supports this
449 Array.forEach = function(array, block, context) {
450 for (var i = 0; i < array.length; i++) {
451 block.call(context, array[i], i, array);
467 Array.forEach(string.split(""), function(chr, index) {
487 // the object is array-lik
[all...] |
| /src/external/apache2/llvm/dist/clang/tools/scan-build-py/libscanbuild/resources/ |
| sorttable.js | 140 // build an array to sort. This is a Schwartzian transform thing,
447 // array-like enumeration
448 if (!Array.forEach) { // mozilla already supports this
449 Array.forEach = function(array, block, context) {
450 for (var i = 0; i < array.length; i++) {
451 block.call(context, array[i], i, array);
467 Array.forEach(string.split(""), function(chr, index) {
487 // the object is array-lik
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/BinaryFormat/ |
| MsgPackReader.h | 57 Array,
90 /// Value for \c Type::Array and \c Type::Map.
115 /// For the collection objects (Array and Map), only the length is read, and
116 /// the caller must make and additional \c N calls (in the case of Array) or
|
| MsgPackDocument.h | 60 ArrayTy *Array;
71 bool isArray() const { return getKind() == Type::Array; }
127 /// Get an ArrayDocNode for an array node. If Convert, convert the node to an
128 /// array node if necessary.
130 if (getKind() != Type::Array) {
248 /// A DocNode that is an array.
252 ArrayDocNode(DocNode &N) : DocNode(N) { assert(getKind() == Type::Array); }
254 // Array access methods.
255 size_t size() const { return Array->size(); }
257 DocNode &back() const { return Array->back();
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/BinaryFormat/ |
| MsgPackDocument.cpp | 23 // Convert this DocNode into an empty array.
65 /// Array element access. This extends the array if necessary.
69 Array->resize(Index + 1, getDocument()->getEmptyNode());
71 return (*Array)[Index];
122 // If Multi, then this sets root to an array and adds top-level objects to it.
134 // Create the array for multiple top-level objects.
173 case Type::Array:
184 else if (Stack.back().Node.getKind() == Type::Array) {
185 // Reading an array entry
[all...] |
| /src/sys/external/bsd/gnu-efi/dist/lib/ |
| misc.c | 399 // Insert in the tail of the array
540 UI_STRING_ENTRY *Array;
551 for (Index = UiDeviceString, Array = Ui->Entry; Index < StringType; Index++, Array++) {
552 while (Array->LangCode) {
553 Array++;
560 while (Array->LangCode) {
561 if (strcmpa (Array->LangCode, LangCode) == 0) {
562 return Array->UiString;
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| PointerArithChecker.cpp | 10 // pointer arithmetic on locations other than array elements.
28 Array,
30 Reinterpreted // Single object interpreted as an array.
99 return AllocKind::Array;
113 /// Checks whether a region is the part of an array.
114 /// In case there is a derived to base cast above the array element, the
133 if (*Kind == AllocKind::Array)
139 // assume that this is an array to avoid false positives.
196 "Pointer arithmetic on non-array "
236 State = State->set<RegionState>(Region, AllocKind::Array);
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/xray/ |
| xray_segmented_array.h | 12 // Defines the implementation of a segmented array, with fixed-size segments
28 /// The Array type provides an interface similar to std::vector<...> but does
32 /// is destroyed. When an Array is destroyed, it will destroy elements in the
34 template <class T> class Array {
42 // Each segment of the array will be laid out with the following assumptions:
297 explicit Array(AllocatorType &A) XRAY_NEVER_INSTRUMENT
304 Array() XRAY_NEVER_INSTRUMENT : Alloc(nullptr),
310 Array(const Array &) = delete;
311 Array &operator=(const Array &) = delete
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Serialization/ |
| ASTRecordReader.h | 75 auto Array = llvm::makeArrayRef(Record).slice(Idx, Len);
77 return Array;
247 /// Read a template argument array, advancing Idx.
257 /// Read a CXXCtorInitializer array, advancing Idx.
|
| /src/external/apache2/llvm/dist/clang/lib/Tooling/ |
| JSONCompilationDatabase.cpp | 343 auto *Array = dyn_cast<llvm::yaml::SequenceNode>(Root);
344 if (!Array) {
345 ErrorMessage = "Expected array.";
348 for (auto &NextObject : *Array) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| ValueTracking.h | 297 /// Returns true if the GEP is based on a pointer to a string (array of
306 const ConstantDataArray *Array;
323 return Array==nullptr ? 0 : Array->getElementAsInteger(I + Offset);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Bitstream/ |
| BitCodes.h | 104 Array = 3, // A sequence of fields, next field species elt encoding.
106 Blob = 5 // 32-bit aligned array of 8-bit characters.
132 case Array:
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| BinaryStreamArray.h | 1 //===- BinaryStreamArray.h - Array backed by an arbitrary stream *- C++ -*-===//
11 /// provides two different array implementations.
19 /// elements of the array need not be laid out in contiguous memory.
54 /// VarStreamArray represents an array of variable length records backed by a
128 /// given an offset into the array's underlying stream, return an
161 VarStreamArrayIterator(const ArrayType &Array, const Extractor &E,
163 : IterRef(Array.Stream.drop_front(Offset)), Extract(E),
164 Array(&Array), AbsOffset(Offset), HadError(HadError) {
181 if (Array && R.Array)
[all...] |
| JSON.h | 16 /// See json::Value, and the related types json::Object and json::Array.
83 class Array;
146 const json::Array *getArray(StringRef K) const;
147 json::Array *getArray(StringRef K);
154 /// An Array is a JSON array, which contains heterogeneous JSON values.
156 class Array {
164 Array() = default;
165 explicit Array(std::initializer_list<Value> Elements);
166 template <typename Collection> explicit Array(const Collection &C)
910 void array(Block Contents) { function in class:llvm::json::OStream
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/Symbolize/ |
| DIPrinter.cpp | 296 json::Array Array;
321 Array.push_back(std::move(Object));
324 Json["Symbol"] = std::move(Array);
346 json::Array Frame;
388 ObjectList = std::make_unique<json::Array>();
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-pdbutil/ |
| InputFile.cpp | 385 auto &Array = Stream.typeArray();
389 std::make_unique<LazyRandomTypeCollection>(Array, Count, Offsets);
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| JSON.cpp | 73 const json::Array *Object::getArray(StringRef K) const {
78 json::Array *Object::getArray(StringRef K) {
94 Array::Array(std::initializer_list<Value> Elements) {
103 : Value(json::Array(Elements)) {}
124 create<json::Array>(M.as<json::Array>());
150 create<json::Array>(std::move(M.as<json::Array>()));
173 as<json::Array>().~Array()
[all...] |
| /src/external/bsd/libevent/dist/ |
| event_rpcgen.py | 94 """Takes an array, add indentation to each entry and prints it."""
123 if entry.Array():
159 if entry.Array():
218 if entry.Array():
308 if not entry.Array():
455 def Array(self):
477 if self.Array() and not self._can_be_array:
479 'Entry "%s" cannot be created as an array '
489 'Entry "%s" has illegal combination of optional and array '
580 if self.Array()
[all...] |
| /src/external/bsd/ntp/dist/sntp/libevent/ |
| event_rpcgen.py | 94 """Takes an array, add indentation to each entry and prints it."""
123 if entry.Array():
159 if entry.Array():
218 if entry.Array():
308 if not entry.Array():
455 def Array(self):
477 if self.Array() and not self._can_be_array:
479 'Entry "%s" cannot be created as an array '
489 'Entry "%s" has illegal combination of optional and array '
580 if self.Array()
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| APValue.h | 121 /// [Vector: N * APValue], [Array: N * APValue]
139 Array,
207 /// A non-discriminated union of a base, field, or array index.
400 bool isArray() const { return Kind == Array; }
515 assert(hasArrayFiller() && "No array filler");
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfCompileUnit.cpp | 897 auto *Array = dyn_cast<DICompositeType>(Var->getType());
898 if (!Array || Array->getTag() != dwarf::DW_TAG_array_type)
900 if (auto *DLVar = Array->getDataLocation())
902 if (auto *AsVar = Array->getAssociated())
904 if (auto *AlVar = Array->getAllocated())
906 for (auto *El : Array->getElements()) {
|
