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

1234567

/freebsd-12-stable/contrib/bmake/lst.lib/
H A DlstConcat.c85 List list1 = l1;
86 List list2 = l2;
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-12-stable/contrib/llvm-project/llvm/tools/llvm-pdbutil/
H A DLinePrinter.h75 void SetFilters(std::list<Regex> &List, Iter Begin, Iter End) { argument
76 List.clear();
78 List.emplace_back(StringRef(*Begin));
/freebsd-12-stable/sys/contrib/ncsw/inc/etc/
H A Dlist_ext.h57 @Group list_id List
59 @Description List module functions,definitions and enums.
65 @Description List structure.
67 typedef struct List struct
69 struct List *p_Next; /**< A pointer to the next list object */
70 struct List *p_Prev; /**< A pointer to the previous list object */
/freebsd-12-stable/usr.sbin/ctm/ctm/
H A Dctm_passb.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-12-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-12-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-12-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-12-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/MCTargetDesc/
H A DWebAssemblyInstPrinter.h61 std::string typeListToString(ArrayRef<wasm::ValType> List);
/freebsd-12-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-12-stable/contrib/bmake/
H A Dlst.h92 typedef struct List *Lst;
/freebsd-12-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-12-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-12-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-12-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-12-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-12-stable/contrib/googletest/googletest/test/
H A Dgoogletest-port-test.cc1170 static std::vector<DestructorCall*>& List() { return *list_; } function in class:testing::internal::DestructorCall
1200 // We never access DestructorCall::List() concurrently, so we don't need
1202 DestructorCall::List()[index_]->ReportDestroyed();
1207 DestructorCall::List().push_back(new DestructorCall);
1208 return DestructorCall::List().size() - 1;
1228 ASSERT_EQ(0U, DestructorCall::List().size());
1232 ASSERT_EQ(1U, DestructorCall::List().size());
1233 ASSERT_FALSE(DestructorCall::List()[0]->CheckDestroyed());
1237 ASSERT_EQ(1U, DestructorCall::List().size());
1238 EXPECT_TRUE(DestructorCall::List()[
[all...]
/freebsd-12-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-12-stable/contrib/llvm-project/clang/lib/AST/
H A DASTImporterLookupTable.cpp125 const DeclList& List = Entry.second; local
126 for (NamedDecl *ND : List) {
/freebsd-12-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-12-stable/contrib/googletest/googletest/include/gtest/
H A Dgtest-typed-test.h50 typedef std::list<T> List;
79 typename TestFixture::List values;

Completed in 365 milliseconds

1234567