Home
last modified time | relevance | path

Searched refs:NewSet (Results 1 – 20 of 20) sorted by relevance

/external/llvm-project/llvm/lib/DebugInfo/DWARF/
DDWARFDebugPubTable.cpp31 Set &NewSet = Sets.back(); in extract() local
34 std::tie(NewSet.Length, NewSet.Format) = Data.getInitialLength(C); in extract()
46 Offset = C.tell() + NewSet.Length; in extract()
48 const unsigned OffsetSize = dwarf::getDwarfOffsetByteSize(NewSet.Format); in extract()
50 NewSet.Version = SetData.getU16(C); in extract()
51 NewSet.Offset = SetData.getRelocatedValue(C, OffsetSize); in extract()
52 NewSet.Size = SetData.getUnsigned(C, OffsetSize); in extract()
72 NewSet.Entries.push_back( in extract()
/external/libcap/cap/
Dcap.go285 func NewSet() *Set { func
301 n := NewSet()
312 v := NewSet()
Dfile.go86 c := NewSet()
327 c := NewSet()
Dconvenience.go101 e := NewSet()
Dtext.go197 c := NewSet()
Dcap_test.go118 c := NewSet()
/external/llvm/include/llvm/Analysis/
DAliasSetTracker.h428 bool &NewSet) {
429 NewSet = false;
430 AliasSet &AS = getAliasSetForPointer(P, Size, AAInfo, &NewSet);
/external/llvm-project/llvm/lib/CodeGen/
DMachinePipeliner.cpp1792 NodeSet NewSet; in groupRemainingNodes() local
1796 addConnectedNodes(I, NewSet, NodesAdded); in groupRemainingNodes()
1797 if (!NewSet.empty()) in groupRemainingNodes()
1798 NodeSets.push_back(NewSet); in groupRemainingNodes()
1802 NewSet.clear(); in groupRemainingNodes()
1805 addConnectedNodes(I, NewSet, NodesAdded); in groupRemainingNodes()
1806 if (!NewSet.empty()) in groupRemainingNodes()
1807 NodeSets.push_back(NewSet); in groupRemainingNodes()
1814 NewSet.clear(); in groupRemainingNodes()
1815 addConnectedNodes(SU, NewSet, NodesAdded); in groupRemainingNodes()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DMachinePipeliner.cpp1708 NodeSet NewSet; in groupRemainingNodes() local
1712 addConnectedNodes(I, NewSet, NodesAdded); in groupRemainingNodes()
1713 if (!NewSet.empty()) in groupRemainingNodes()
1714 NodeSets.push_back(NewSet); in groupRemainingNodes()
1718 NewSet.clear(); in groupRemainingNodes()
1721 addConnectedNodes(I, NewSet, NodesAdded); in groupRemainingNodes()
1722 if (!NewSet.empty()) in groupRemainingNodes()
1723 NodeSets.push_back(NewSet); in groupRemainingNodes()
1730 NewSet.clear(); in groupRemainingNodes()
1731 addConnectedNodes(SU, NewSet, NodesAdded); in groupRemainingNodes()
[all …]
/external/llvm-project/clang/lib/StaticAnalyzer/Core/
DRangeConstraintManager.cpp1603 ClassSet NewSet = CF.remove(OriginalSetLinkedToOther, Other); in mergeImpl() local
1604 NewSet = CF.add(NewSet, *this); in mergeImpl()
1606 DisequalityInfo = DF.add(DisequalityInfo, DisequalClass, NewSet); in mergeImpl()
1698 ClassSet NewSet = CurrentSet ? *CurrentSet : CF.getEmptySet(); in addToDisequalityInfo() local
1699 NewSet = CF.add(NewSet, Second); in addToDisequalityInfo()
1701 Info = F.add(Info, First, NewSet); in addToDisequalityInfo()
1927 ClassSet NewSet = ClassSetFactory.remove(DisequalToDisequalSet, Class); in removeDeadBindings() local
1930 if (NewSet.isEmpty()) { in removeDeadBindings()
1935 DisequalityFactory.add(Disequalities, DisequalClass, NewSet); in removeDeadBindings()
/external/llvm-project/polly/unittests/DeLICM/
DDeLICMTest.cpp122 auto NewSet = isl::set::universe(NewSpace); in checkIsConflictingNonsymmetricCommon() local
123 Universe = Universe.add_set(NewSet); in checkIsConflictingNonsymmetricCommon()
/external/libcap/goapps/setid/
Dsetid.go78 if err := cap.NewSet().SetProc(); err != nil {
/external/llvm/lib/CodeGen/
DMachinePipeliner.cpp362 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
1854 NodeSet NewSet; in groupRemainingNodes() local
1858 addConnectedNodes(I, NewSet, NodesAdded); in groupRemainingNodes()
1859 if (NewSet.size() > 0) in groupRemainingNodes()
1860 NodeSets.push_back(NewSet); in groupRemainingNodes()
1864 NewSet.clear(); in groupRemainingNodes()
1867 addConnectedNodes(I, NewSet, NodesAdded); in groupRemainingNodes()
1868 if (NewSet.size() > 0) in groupRemainingNodes()
1869 NodeSets.push_back(NewSet); in groupRemainingNodes()
1876 NewSet.clear(); in groupRemainingNodes()
[all …]
/external/libcap/go/
Dcompare-cap.go26 want := cap.NewSet()
287 sample := cap.NewSet()
/external/libcap/goapps/gowns/
Dgowns.go233 if err := cap.NewSet().SetProc(); err != nil {
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DMachinePipeliner.h298 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
/external/llvm-project/llvm/include/llvm/CodeGen/
DMachinePipeliner.h292 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
DLowerTypeTests.cpp2034 GlobalClassesTy::member_iterator NewSet = in lower() local
2037 CurSet = NewSet; in lower()
2039 CurSet = GlobalClasses.unionSets(CurSet, NewSet); in lower()
/external/llvm-project/llvm/lib/Transforms/IPO/
DLowerTypeTests.cpp2093 GlobalClassesTy::member_iterator NewSet = in lower() local
2096 CurSet = NewSet; in lower()
2098 CurSet = GlobalClasses.unionSets(CurSet, NewSet); in lower()
/external/starlark-go/starlark/
Dvalue.go1045 func NewSet(size int) *Set { func