Searched refs:List (Results 26 - 50 of 143) sorted by relevance

123456

/freebsd-11-stable/sys/contrib/dev/acpica/compiler/
H A Ddttable.c222 * PARAMETERS: List - Current field list pointer
232 void **List)
237 DT_FIELD **PFieldList = (DT_FIELD **) List;
231 DtCompileFadt( void **List) argument
/freebsd-11-stable/contrib/bmake/
H A Dlst.h92 typedef struct List *Lst;
/freebsd-11-stable/contrib/bmake/lst.lib/
H A DlstAppend.c69 * A new ListNode is created and linked in to the List. The lastPtr
70 * field of the List will be altered if ln is the last node in the
79 List list;
H A DlstInsert.c80 List list = l;
H A DlstRemove.c73 List list = l;
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/src/
H A DTestProbeData.java85 final List <ProbeData> list = new ArrayList <ProbeData> ();
H A DTestBean.java146 List < AggregationRecord > list =
206 List < Distribution.Bucket > buckets =
248 List < Distribution.Bucket > buckets =
294 List < Aggregation > aggregations = new ArrayList < Aggregation > ();
303 List < Tuple > tuples = new ArrayList < Tuple > ();
317 List < ValueRecord > list = new ArrayList < ValueRecord > ();
330 List < Record > list = new ArrayList < Record > ();
345 List < Aggregation > list = new ArrayList < Aggregation > ();
348 List < AggregationRecord > reclist =
/freebsd-11-stable/contrib/llvm-project/clang/lib/ARCMigrate/
H A DInternals.h26 ListTy List; member in class:clang::arcmt::CapturedDiagList
29 void push_back(const StoredDiagnostic &diag) { List.push_back(diag); }
39 iterator begin() const { return List.begin(); }
40 iterator end() const { return List.end(); }
H A DARCMT.cpp34 ListTy::iterator I = List.begin();
35 while (I != List.end()) {
45 while (I != List.end() && I->getLevel() == DiagnosticsEngine::Note)
48 I = List.erase(eraseS, I);
63 ListTy::const_iterator I = List.begin();
64 while (I != List.end()) {
81 for (ListTy::const_iterator I = List.begin(), E = List.end(); I != E; ++I)
86 for (ListTy::const_iterator I = List.begin(), E = List
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dilist_node.h1 //===- llvm/ADT/ilist_node.h - Intrusive Linked List Helper -----*- C++ -*-===//
277 const auto &List = local
279 return List.getPrevNode(*static_cast<NodeTy *>(this));
291 const auto &List = local
293 return List.getNextNode(*static_cast<NodeTy *>(this));
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/MCTargetDesc/
H A DWebAssemblyInstPrinter.h61 std::string typeListToString(ArrayRef<wasm::ValType> List);
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/jdtrace/
H A DJDTrace.java246 List <Record> records = data.getRecords();
270 List <Tuple> tuples = printa.getTuples();
453 printAggregationRecords(List <AggregationRecord> list)
633 List <CompileRequest> compileRequests = new LinkedList
635 List <Program> programList = new LinkedList <Program> ();
663 List <Consumer.OpenFlag> openFlags =
849 List <String> argList = new LinkedList <String> ();
896 List <List <Probe>> lists =
897 new LinkedList <List <Prob
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/MC/
H A DMCRegisterInfo.h191 const MCPhysReg *List = nullptr; member in class:llvm::MCRegisterInfo::DiffListIterator
202 List = DiffList;
210 MCPhysReg D = *List++;
217 bool isValid() const { return List; }
226 List = nullptr;
258 End.Iter.List = nullptr;
263 return Iter.List == Arg.Iter.List;
270 assert(Iter.List && "Cannot increment the end iterator!");
579 // Register List Iterator
[all...]
/freebsd-11-stable/share/mk/
H A Dbsd.test.mk25 # List of subdirectories containing tests into which to recurse. This has the
39 # List of variables to pass to the tests at run-time via the environment.
60 # List of all tests being built. The various *.test.mk modules extend this
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Lex/
H A DMacroInfo.h164 void setParameterList(ArrayRef<IdentifierInfo *> List, argument
168 if (List.empty())
171 NumParameters = List.size();
172 ParameterList = PPAllocator.Allocate<IdentifierInfo *>(List.size());
173 std::copy(List.begin(), List.end(), ParameterList);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DScopedPrinter.h208 template <typename T> void printList(StringRef Label, const T &List) { argument
211 for (const auto &Item : List) {
221 void printList(StringRef Label, const T &List, const U &Printer) { argument
224 for (const auto &Item : List) {
233 template <typename T> void printHexList(StringRef Label, const T &List) { argument
236 for (const auto &Item : List) {
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/
H A DASTImporterLookupTable.cpp125 const DeclList& List = Entry.second; local
126 for (NamedDecl *ND : List) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DScopedNoAliasAA.cpp133 static void collectMDInDomain(const MDNode *List, const MDNode *Domain, argument
135 for (const MDOperand &MDOp : List->operands())
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86OptimizeLEAs.cpp266 /// Choose the best \p LEA instruction from the \p List to replace
270 bool chooseBestLEA(const SmallVectorImpl<MachineInstr *> &List,
332 // Find the best LEA instruction in the List to replace address recalculation in
342 const SmallVectorImpl<MachineInstr *> &List, const MachineInstr &MI,
352 for (auto DefMI : List) {
602 auto &List = E.second; local
605 auto I1 = List.begin();
606 while (I1 != List.end()) {
609 while (I2 != List.end()) {
673 I2 = List
341 chooseBestLEA( const SmallVectorImpl<MachineInstr *> &List, const MachineInstr &MI, MachineInstr *&BestLEA, int64_t &AddrDispShift, int &Dist) argument
[all...]
/freebsd-11-stable/sys/contrib/dev/acpica/components/resources/
H A Drsutils.c167 * List - Where the converted list is returned
178 UINT8 *List)
193 List[BitCount] = i;
208 * PARAMETERS: List - List of values to encode
219 UINT8 *List,
233 Mask |= (0x1 << List[i]);
176 AcpiRsDecodeBitmask( UINT16 Mask, UINT8 *List) argument
218 AcpiRsEncodeBitmask( UINT8 *List, UINT8 Count) argument
/freebsd-11-stable/usr.sbin/ctm/ctm/
H A Dctm_pass2.c74 for(i=0;(j = sp->List[i]);i++) {
75 if (sp->List[i+1] && (sp->List[i+1] & CTM_F_MASK) != CTM_F_Bytes)
/freebsd-11-stable/sys/contrib/dev/acpica/components/disassembler/
H A Ddmbuffer.c187 const char **List);
445 * PARAMETERS: Op - Byte List op containing a UUID
792 * List - Array to reference
794 * RETURN: String from List or empty string
797 * position in List.
804 const char **List)
812 NameString = List[0];
818 NameString = List[i];
828 return (List[Index]);
946 * PARAMETERS: Op - Byte List o
802 AcpiDmFindNameByIndex( UINT64 Index, const char **List) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/
H A DTemplateBase.h610 ASTTemplateArgumentListInfo(const TemplateArgumentListInfo &List);
640 Create(const ASTContext &C, const TemplateArgumentListInfo &List);
667 const TemplateArgumentListInfo &List,
670 const TemplateArgumentListInfo &List,
677 TemplateArgumentListInfo &List) const;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.cpp175 SmallVector<Entry, 64> List;
179 List.push_back(std::make_pair(&U, List.size()));
181 if (List.size() < 2)
186 llvm::sort(List, [&](const Entry &L, const Entry &R) {
227 List.begin(), List.end(),
233 Stack.emplace_back(V, F, List.size());
234 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size");
235 for (size_t I = 0, E = List
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/
H A DValue.cpp779 void ValueHandleBase::AddToExistingUseList(ValueHandleBase **List) { argument
780 assert(List && "Handle list is null?");
783 Next = *List;
784 *List = this;
785 setPrevPtr(List);
792 void ValueHandleBase::AddToExistingUseListAfter(ValueHandleBase *List) { argument
793 assert(List && "Must insert after existing node");
795 Next = List->Next;
796 setPrevPtr(&List->Next);
797 List
[all...]

Completed in 181 milliseconds

123456