/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | MachineModuleInfoImpls.cpp | 36 MachineModuleInfoImpl::SymbolListTy List(Map.begin(), Map.end()); 38 if (!List.empty()) 39 qsort(&List[0], List.size(), sizeof(List[0]), SortSymbolPair); 42 return List;
|
H A D | MachinePassRegistry.cpp | 37 Node->setNext(List); 38 List = Node; 48 for (MachinePassRegistryNode **I = &List; *I; I = (*I)->getNextAddress()) {
|
/freebsd-11.0-release/sys/contrib/dev/acpica/components/debugger/ |
H A D | dbstats.c | 74 ACPI_MEMORY_LIST *List); 107 * PARAMETERS: List - Memory list/cache to be displayed 117 ACPI_MEMORY_LIST *List) 123 AcpiOsPrintf ("\n%s\n", List->ListName); 127 if (List->MaxDepth > 0) 132 List->CurrentDepth, 133 List->MaxDepth, 134 List->MaxDepth - List->CurrentDepth, 135 (List 116 AcpiDbListInfo( ACPI_MEMORY_LIST *List) argument [all...] |
/freebsd-11.0-release/contrib/bmake/lst.lib/ |
H A D | lstInit.c | 74 List nList; 76 PAlloc (nList, List);
|
H A D | lstInt.h | 59 #define LN_DELETED 0x0001 /* List node should be removed when done */ 65 typedef struct List { struct 79 } *List; typedef in typeref:struct:List 103 #define LstIsEmpty(l) (((List)(l))->firstPtr == NULL)
|
H A D | lstClose.c | 79 List list = l;
|
H A D | lstIsAtEnd.c | 82 List list = l;
|
H A D | lstMember.c | 58 List list = l;
|
H A D | lstDupl.c | 78 List list = l;
|
H A D | lstForEachFrom.c | 77 List list = l;
|
H A D | lstNext.c | 79 List list = l;
|
H A D | lstConcat.c | 85 List list1 = l1; 86 List list2 = l2;
|
/freebsd-11.0-release/contrib/llvm/lib/IR/ |
H A D | FunctionInfo.cpp | 27 FunctionInfoList &List = OtherFuncInfoLists.second; local 31 assert(List.size() == 1); 32 std::unique_ptr<FunctionInfo> Info = std::move(List.front());
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Transforms/InstCombine/ |
H A D | InstCombineWorklist.h | 63 void AddInitialGroup(ArrayRef<Instruction *> List) { argument 65 Worklist.reserve(List.size()+16); 66 WorklistMap.resize(List.size()); 67 DEBUG(dbgs() << "IC: ADDING: " << List.size() << " instrs to worklist\n"); 69 for (Instruction *I : reverse(List)) {
|
/freebsd-11.0-release/contrib/llvm/include/llvm/ADT/ |
H A D | ilist_node.h | 1 //==-- llvm/ADT/ilist_node.h - Intrusive Linked List Helper ------*- C++ -*-==// 97 const auto &List = local 99 return List.getPrevNode(*static_cast<NodeTy *>(this)); 110 const auto &List = local 112 return List.getNextNode(*static_cast<NodeTy *>(this));
|
/freebsd-11.0-release/sys/contrib/dev/acpica/compiler/ |
H A D | dttable2.c | 57 * PARAMETERS: List - Current field list pointer 67 void **List) 72 DT_FIELD **PFieldList = (DT_FIELD **) List; 133 * PARAMETERS: List - Current field list pointer 143 void **List) 148 DT_FIELD **PFieldList = (DT_FIELD **) List; 287 * PARAMETERS: List - Current field list pointer 297 void **List) 302 Status = DtCompileTwoSubtables (List, 312 * PARAMETERS: List 66 DtCompileLpit( void **List) argument 142 DtCompileMadt( void **List) argument 296 DtCompileMcfg( void **List) argument 321 DtCompileMpst( void **List) argument 458 DtCompileMsct( void **List) argument 483 DtCompileMtmr( void **List) argument 508 DtCompileNfit( void **List) argument 707 DtCompilePcct( void **List) argument 800 DtCompilePmtt( void **List) argument 943 DtCompileRsdt( void **List) argument 1062 DtCompileSlic( void **List) argument 1103 DtCompileSlit( void **List) argument 1159 DtCompileSrat( void **List) argument 1253 DtCompileStao( void **List) argument 1306 DtCompileTcpa( void **List) argument 1423 DtCompileUefi( void **List) argument 1471 DtCompileVrtc( void **List) argument 1496 DtCompileWdat( void **List) argument 1521 DtCompileWpbt( void **List) argument 1578 DtCompileXsdt( void **List) argument 1617 DtCompileGeneric( void **List, char *Name, UINT32 *Length) argument [all...] |
H A D | dttable1.c | 70 * PARAMETERS: List - Current field list pointer 80 void **List) 90 DT_FIELD **PFieldList = (DT_FIELD **) List; 242 * PARAMETERS: List - Current field list pointer 252 void **List) 257 Status = DtCompileTwoSubtables (List, 267 * PARAMETERS: List - Current field list pointer 277 void **List) 282 DT_FIELD **PFieldList = (DT_FIELD **) List; 375 * PARAMETERS: List 79 DtCompileAsf( void **List) argument 251 DtCompileCpep( void **List) argument 276 DtCompileCsrt( void **List) argument 384 DtCompileDbg2( void **List) argument 534 DtCompileDmar( void **List) argument 694 DtCompileDrtm( void **List) argument 831 DtCompileEinj( void **List) argument 856 DtCompileErst( void **List) argument 881 DtCompileGtdt( void **List) argument 1002 DtCompileFpdt( void **List) argument 1077 DtCompileHest( void **List) argument 1214 DtCompileIort( void **List) argument 1549 DtCompileIvrs( void **List) argument [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/X86/ |
H A D | X86OptimizeLEAs.cpp | 62 /// \brief Choose the best \p LEA instruction from the \p List to replace 66 bool chooseBestLEA(const SmallVectorImpl<MachineInstr *> &List, 96 SmallVectorImpl<MachineInstr *> &List); 99 bool removeRedundantAddrCalc(const SmallVectorImpl<MachineInstr *> &List); 102 bool removeRedundantLEAs(SmallVectorImpl<MachineInstr *> &List); 130 // Find the best LEA instruction in the List to replace address recalculation in 139 bool OptimizeLEAPass::chooseBestLEA(const SmallVectorImpl<MachineInstr *> &List, argument 150 for (auto DefMI : List) { 302 SmallVectorImpl<MachineInstr *> &List) { 313 List 301 findLEAs(const MachineBasicBlock &MBB, SmallVectorImpl<MachineInstr *> &List) argument 320 removeRedundantAddrCalc( const SmallVectorImpl<MachineInstr *> &List) argument 397 removeRedundantLEAs(SmallVectorImpl<MachineInstr *> &List) argument [all...] |
/freebsd-11.0-release/contrib/llvm/tools/llvm-pdbdump/ |
H A D | LinePrinter.h | 41 void SetFilters(std::list<Regex> &List, Iter Begin, Iter End) { argument 42 List.clear(); 44 List.emplace_back(StringRef(*Begin));
|
/freebsd-11.0-release/contrib/llvm/include/llvm/IR/ |
H A D | Use.h | 139 void addToList(Use **List) { argument 140 Next = *List; 143 setPrev(List); 144 *List = this;
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DebugLocStream.h | 27 /// Stores a unified stream of .debug_loc entries. There's \a List for each 34 struct List { struct in class:llvm::DebugLocStream 38 List(DwarfCompileUnit *CU, size_t EntryOffset) function in struct:llvm::DebugLocStream::List 53 SmallVector<List, 4> Lists; 65 const List &getList(size_t LI) const { return Lists[LI]; } 66 ArrayRef<List> getLists() const { return Lists; } 108 ArrayRef<Entry> getEntries(const List &L) const { 126 size_t getIndex(const List &L) const { 180 EntryBuilder(ListBuilder &List, const MCSymbol *Begin, const MCSymbol *End) argument 181 : Locs(List [all...] |
/freebsd-11.0-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/src/ |
H A D | TestMultiAggPrinta.java | 31 import java.util.List; 74 List <Record> records = data.getRecords(); 115 List <Record> records = data.getRecords();
|
/freebsd-11.0-release/usr.sbin/ctm/ctm/ |
H A D | ctm_pass1.c | 98 for(i=0;(j = sp->List[i]);i++) { 99 if (sp->List[i+1] && (sp->List[i+1] & CTM_F_MASK) != CTM_F_Bytes) 105 fprintf(stderr," %x(%d)",sp->List[i],sep); 197 fprintf(stderr,"List = 0x%x\n",j); 213 fprintf(stderr,"List = 0x%x\n",j); 214 Fatal("List had garbage.");
|
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | ScopedNoAliasAA.cpp | 132 const MDNode *List, const MDNode *Domain, 134 for (unsigned i = 0, ie = List->getNumOperands(); i != ie; ++i) 135 if (const MDNode *MD = dyn_cast<MDNode>(List->getOperand(i))) 131 collectMDInDomain( const MDNode *List, const MDNode *Domain, SmallPtrSetImpl<const MDNode *> &Nodes) const argument
|
/freebsd-11.0-release/sys/contrib/ncsw/inc/etc/ |
H A D | list_ext.h | 56 @Group list_id List 58 @Description List module functions,definitions and enums. 64 @Description List structure. 66 typedef struct List struct 68 struct List *p_Next; /**< A pointer to the next list object */ 69 struct List *p_Prev; /**< A pointer to the previous list object */
|