| /openbsd-src/gnu/usr.bin/binutils/gdb/testsuite/gdb.cp/ |
| H A D | userdef.cc | 76 A1 A1::operator+(const A1& second) in operator +() argument 79 sum.x = x + second.x; in operator +() 80 sum.y = y + second.y; in operator +() 85 A1 A1::operator*(const A1& second) in operator *() argument 88 product.x = this->x * second.x; in operator *() 89 product.y = this->y * second.y; in operator *() 94 A1 A1::operator-(const A1& second) in operator -() argument 97 diff.x = x - second.x; in operator -() 98 diff.y = y - second.y; in operator -() 103 A1 A1::operator/(const A1& second) in operator /() argument [all …]
|
| /openbsd-src/gnu/llvm/lldb/source/Commands/ |
| H A D | CommandObjectSession.cpp | 155 if (start_idx.first && start_idx.second == UINT64_MAX) { in DoExecute() 157 start_idx.second = history.GetSize() - count.second; in DoExecute() 158 stop_idx.second = history.GetSize() - 1; in DoExecute() 160 start_idx.second = stop_idx.second; in DoExecute() 161 stop_idx.second = history.GetSize() - 1; in DoExecute() 163 start_idx.second = 0; in DoExecute() 164 stop_idx.second = history.GetSize() - 1; in DoExecute() 168 start_idx.second = 0; in DoExecute() 169 stop_idx.second = history.GetSize() - 1; in DoExecute() 172 stop_idx.second = start_idx.second + count.second - 1; in DoExecute() [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/ProfileData/ |
| H A D | SampleProf.cpp | 124 MergeResult(Result, addCalledTarget(I.first(), I.second, Weight)); in merge() 139 OS << " " << I.first << ":" << I.second; in print() 168 OS << SI->first << ": " << SI->second; in print() 182 for (const auto &FS : CS->second) { in print() 184 OS << CS->first << ": inlined callee: " << FS.second.getName() << ": "; in print() 185 FS.second.print(OS, Indent + 4); in print() 205 assert(I.first == I.second.getContext() && "Inconsistent profile map"); in sortFuncProfiles() 206 SortedProfiles.push_back(std::make_pair(I.second.getContext(), &I.second)); in sortFuncProfiles() 210 if (A.second->getTotalSamples() == B.second->getTotalSamples()) in sortFuncProfiles() 212 return A.second->getTotalSamples() > B.second->getTotalSamples(); in sortFuncProfiles() [all …]
|
| /openbsd-src/gnu/usr.bin/perl/dist/ExtUtils-ParseXS/t/ |
| H A D | 513-t-merge.t | 31 my $second = ExtUtils::Typemaps->new(file => $second_typemap_file); 32 isa_ok($second, 'ExtUtils::Typemaps'); 34 $first->merge(typemap => $second); 63 my $second = ExtUtils::Typemaps->new(file => $second_typemap_file); 64 isa_ok($second, 'ExtUtils::Typemaps'); 70 $second->merge(typemap => $conflict); 83 my $second = ExtUtils::Typemaps->new(file => $second_typemap_file); 84 isa_ok($second, 'ExtUtils::Typemaps'); 90 $second->merge(typemap => $conflict, replace => 1); 96 …is($second->as_string(), slurp($confl_replace_typemap_file), "merging (string) produces expected o… [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | ImportedFunctionsInliningStatistics.cpp | 121 assert(Node->second->NumberOfInlines >= Node->second->NumberOfRealInlines); in dump() 122 if (Node->second->NumberOfInlines == 0) in dump() 125 if (Node->second->Imported) { in dump() 128 int(Node->second->NumberOfRealInlines > 0); in dump() 132 int(Node->second->NumberOfRealInlines > 0); in dump() 137 << (Node->second->Imported ? "imported " : "not imported ") in dump() 139 << ": #inlines = " << Node->second->NumberOfInlines in dump() 141 << Node->second->NumberOfRealInlines << "\n"; in dump() 208 if (Lhs->second->NumberOfInlines != Rhs->second->NumberOfInlines) in getSortedNodes() 209 return Lhs->second->NumberOfInlines > Rhs->second->NumberOfInlines; in getSortedNodes() [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUArgumentUsageInfo.cpp | 66 << " PrivateSegmentBuffer: " << FI.second.PrivateSegmentBuffer in print() 67 << " DispatchPtr: " << FI.second.DispatchPtr in print() 68 << " QueuePtr: " << FI.second.QueuePtr in print() 69 << " KernargSegmentPtr: " << FI.second.KernargSegmentPtr in print() 70 << " DispatchID: " << FI.second.DispatchID in print() 71 << " FlatScratchInit: " << FI.second.FlatScratchInit in print() 72 << " PrivateSegmentSize: " << FI.second.PrivateSegmentSize in print() 73 << " WorkGroupIDX: " << FI.second.WorkGroupIDX in print() 74 << " WorkGroupIDY: " << FI.second.WorkGroupIDY in print() 75 << " WorkGroupIDZ: " << FI.second.WorkGroupIDZ in print() [all …]
|
| /openbsd-src/gnu/llvm/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | FunctionSummary.h | 74 I->second.InlineChecked = 1; in markMayInline() 75 I->second.MayInline = 1; in markMayInline() 80 I->second.InlineChecked = 1; in markShouldNotInline() 81 I->second.MayInline = 0; in markShouldNotInline() 90 if (I != Map.end() && I->second.InlineChecked) in mayInline() 91 return I->second.MayInline; in mayInline() 97 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks; in markVisitedBasicBlock() 101 I->second.TotalBasicBlocks = TotalIDs; in markVisitedBasicBlock() 109 return I->second.VisitedBasicBlocks.count(); in getNumVisitedBasicBlocks() 116 return I->second.TimesInlined; in getNumTimesInlined() [all …]
|
| /openbsd-src/gnu/llvm/clang/lib/Analysis/FlowSensitive/ |
| H A D | DataflowAnalysisContext.cpp | 84 if (Res.second) { in getOrCreateNullPointerValue() 86 Res.first->second = in getOrCreateNullPointerValue() 89 return *Res.first->second; in getOrCreateNullPointerValue() 96 std::swap(Res.first, Res.second); in makeCanonicalBoolValuePair() 107 if (Res.second) in getOrCreateConjunction() 108 Res.first->second = in getOrCreateConjunction() 110 return *Res.first->second; in getOrCreateConjunction() 120 if (Res.second) in getOrCreateDisjunction() 121 Res.first->second = in getOrCreateDisjunction() 123 return *Res.first->second; in getOrCreateDisjunction() [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/ExecutionEngine/Orc/ |
| H A D | Core.cpp | 178 assert(I->second.getAddress() == 0 && "Redundantly resolving symbol Name"); in notifySymbolMetRequiredState() 185 I->second = std::move(Sym); in notifySymbolMetRequiredState() 225 bool Added = QueryRegistrations[&JD].insert(std::move(Name)).second; in addQueryDependence() 235 assert(QRI->second.count(Name) && "No dependency on Name in JD"); in removeQueryDependence() 236 QRI->second.erase(Name); in removeQueryDependence() 237 if (QRI->second.empty()) in removeQueryDependence() 253 KV.first->detachQueryHelper(*this, KV.second); in detach() 294 Flags[KV.first] = KV.second.getFlags(); in extractFlags() 324 RequestedAliases[Name] = std::move(I->second); in materialize() 379 if (&SrcJD == &TgtJD && (QueryAliases.count(KV.second.Aliasee) || in materialize() [all …]
|
| /openbsd-src/gnu/llvm/libcxx/include/__utility/ |
| H A D | pair.h | 72 _T2 second; member 79 pair() : first(), second() {} in pair() 82 pair(_T1 const& __t1, _T2 const& __t2) : first(__t1), second(__t2) {} in pair() 86 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} in pair() 91 second = __p.second; 168 : first(), second() {} in pair() 176 : first(), second() {} in pair() 185 : first(__t1), second(__t2) {} in pair() 194 : first(__t1), second(__t2) {} in pair() 208 : first(_VSTD::forward<_U1>(__u1)), second(_VSTD::forward<_U2>(__u2)) {} in pair() [all …]
|
| /openbsd-src/gnu/llvm/lldb/source/Utility/ |
| H A D | SelectHelper.cpp | 64 return pos->second.read_is_set; in FDIsSetRead() 72 return pos->second.write_is_set; in FDIsSetWrite() 80 return pos->second.error_is_set; in FDIsSetError() 108 pair.second.PrepareForSelect(); in Select() 117 if (pair.second.read_set) in Select() 119 if (pair.second.write_set) in Select() 121 if (pair.second.error_set) in Select() 181 if (pair.second.read_set) in Select() 184 if (pair.second.write_set) in Select() 187 if (pair.second.error_set) in Select() [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/ObjCARC/ |
| H A D | BlotMapVector.h | 37 assert(I->second < Vector.size()); in ~BlotMapVector() 38 assert(Vector[I->second].first == I->first); in ~BlotMapVector() 58 if (Pair.second) { 60 Pair.first->second = Num; 62 return Vector[Num].second; 64 return Vector[Pair.first->second].second; 70 if (Pair.second) { in insert() 72 Pair.first->second = Num; in insert() 76 return std::make_pair(Vector.begin() + Pair.first->second, false); in insert() 83 return Vector.begin() + It->second; in find() [all …]
|
| /openbsd-src/gnu/llvm/llvm/utils/TableGen/ |
| H A D | WebAssemblyDisassemblerEmitter.cpp | 61 if (CGIP.second) { in emitWebAssemblyDisassemblerTables() 66 bool IsCanonicalExisting = CGIP.second->TheDef->getValueAsBit("IsCanonical"); in emitWebAssemblyDisassemblerTables() 77 if (CGIP.second->AsmString.size() <= CGI.AsmString.size()) in emitWebAssemblyDisassemblerTables() 100 if (PrefixPair.second.empty()) in emitWebAssemblyDisassemblerTables() 105 auto InstIt = PrefixPair.second.find(I); in emitWebAssemblyDisassemblerTables() 106 if (InstIt != PrefixPair.second.end()) { in emitWebAssemblyDisassemblerTables() 108 assert(InstIt->second.second); in emitWebAssemblyDisassemblerTables() 109 auto &CGI = *InstIt->second.second; in emitWebAssemblyDisassemblerTables() 113 OS << " { " << InstIt->second.first << ", ET_Instruction, "; in emitWebAssemblyDisassemblerTables() 165 if (PrefixPair.second.empty() || !PrefixPair.first) in emitWebAssemblyDisassemblerTables()
|
| H A D | InfoByHwMode.cpp | 34 auto I = Map.insert({P.first, MVT(llvm::getValueType(P.second))}); in ValueTypeByHwMode() 35 assert(I.second && "Duplicate entry?"); in ValueTypeByHwMode() 65 return F->second; in getOrCreateTypeForMode() 70 return Map.insert(std::make_pair(Mode, D->second)).first->second; in getOrCreateTypeForMode() 72 return Map.insert(std::make_pair(Mode, Type)).first->second; in getOrCreateTypeForMode() 96 << getMVTName(P->second).str() << ')'; in writeToStream() 144 auto I = Map.insert({P.first, RegSizeInfo(P.second, CGH)}); in RegSizeInfoByHwMode() 145 assert(I.second && "Duplicate entry?"); in RegSizeInfoByHwMode() 184 OS << LS << '(' << getModeName(P->first) << ':' << P->second << ')'; in writeToStream() 191 assert(P.second && P.second->isSubClassOf("InstructionEncoding") && in EncodingInfoByHwMode() [all …]
|
| /openbsd-src/gnu/llvm/lldb/tools/debugserver/source/ |
| H A D | DNBBreakpoint.cpp | 57 return &pos->second; in Add() 72 return &pos->second; in FindByAddress() 80 return &pos->second; in FindByAddress() 98 if (prev_pos->second.IntersectsRange(addr, size, NULL, NULL, NULL)) in FindBreakpointsThatOverlapRange() 99 bps.push_back(&pos->second); in FindBreakpointsThatOverlapRange() 107 if ((pos->second.Address() - addr) >= size) in FindBreakpointsThatOverlapRange() 111 if (pos->second.IntersectsRange(addr, size, NULL, NULL, NULL)) { in FindBreakpointsThatOverlapRange() 112 bps.push_back(&pos->second); in FindBreakpointsThatOverlapRange() 124 pos->second.Dump(); in Dump() 130 pos->second.SetEnabled(false); in DisableAll() [all …]
|
| /openbsd-src/regress/usr.bin/mandoc/roff/de/ |
| H A D | escname.out_ascii | 9 define second = val2 11 define first\second = val3 15 define first\.second = val_dot 21 second val2 22 first\second val3 23 first.second val_dot 24 first\.second val_dot 28 Remove all but second: val2
|
| /openbsd-src/gnu/lib/libstdc++/libstdc++/include/bits/ |
| H A D | stl_pair.h | 74 _T2 second; ///< @c second is a copy of the second object member 79 pair() : first(), second() {} in pair() 81 pair() : first(_T1()), second(_T2()) {} in pair() 84 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {} in pair() 88 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} in pair() 95 return __x.first == __y.first && __x.second == __y.second; 103 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-profgen/ |
| H A D | ProfileGenerator.cpp | 209 auto &FuncSamples = I.second; in calculateDensity() 318 assert(Item.first.first <= Item.first.second && in findDisjointRanges() 321 auto &EndPoint = Boundaries[Item.first.second]; in findDisjointRanges() 322 uint64_t Count = Item.second; in findDisjointRanges() 339 const BoundaryPoint &Point = Item.second; in findDisjointRanges() 392 FunctionSamples &FunctionProfile = Item.second; in updateTotalSamples() 399 FunctionSamples &FunctionProfile = Item.second; in updateCallsiteSamples() 436 for (auto Item : CI.second.RangeCounter) { in collectFunctionsFromRawProfile() 442 for (auto Item : CI.second.BranchCounter) { in collectFunctionsFromRawProfile() 444 uint64_t TargetAddress = Item.first.second; in collectFunctionsFromRawProfile() [all …]
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-opt-report/ |
| H A D | OptReport.cpp | 265 const auto &FileInfo = FI.second; in writeReport() 286 for (auto &FI : FLI.second) in writeReport() 287 for (auto &LI : FI.second) in writeReport() 288 MaxLI |= LI.second; in writeReport() 317 const auto &LineInfo = LII->second; in writeReport() 319 for (auto &CI : LineInfo.find(*FuncNameSet.begin())->second) { in writeReport() 321 ColsInfo[Col] = CI.second; in writeReport() 322 InlinedCols += CI.second.Inlined.Analyzed; in writeReport() 323 UnrolledCols += CI.second.Unrolled.Analyzed; in writeReport() 324 VectorizedCols += CI.second.Vectorized.Analyzed; in writeReport() [all …]
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/XRay/ |
| H A D | Graph.h | 216 return iterator(It->second.begin(), &M, A); in begin() 223 return const_iterator(It->second.begin(), &M, A); in cbegin() 232 return iterator(It->second.end(), &M, A); in end() 238 return const_iterator(It->second.end(), &M, A); in cend() 248 return I->second.size(); in size() 382 return Vertices.FindAndConstruct(I).second; 391 Vertices.FindAndConstruct(I.second); 392 InNeighbors[I.second].insert(I.first); 393 OutNeighbors[I.first].insert(I.second); 394 return P.second; [all …]
|
| /openbsd-src/gnu/llvm/llvm/utils/lit/tests/Inputs/shtest-shell/ |
| H A D | sequencing-0.txt | 3 # RUN: echo "first-line" > %t.out && echo "second-line" >> %t.out 7 # CHECK-AND: second-line 12 # RUN: echo "first-line" > %t.out || echo "second-line" >> %t.out 16 # CHECK-OR-1-NOT: second-line 18 # RUN: false || echo "second-line" > %t.out 21 # CHECK-OR-2: second-line 24 # RUN: echo "first-line" > %t.out; echo "second-line" >> %t.out 28 # CHECK-SEQ: second-line
|
| /openbsd-src/gnu/llvm/compiler-rt/lib/orc/ |
| H A D | interval_map.h | 66 K >= std::prev(end())->first.second) in find() 72 if (K < I->first.second) in find() 85 return I->second; 99 if (KS >= I->first.second) in erase() 103 assert(KE <= I->first.second); in erase() 109 if (KE < Tmp.first.second) { in erase() 111 J, std::make_pair(std::make_pair(KE, Tmp.first.second), Tmp.second)); in erase() 118 J, std::make_pair(std::make_pair(Tmp.first.first, KS), Tmp.second)); in erase() 138 if (J != this->end() && KE == J->first.first && J->second == V) { in insert() 139 KE = J->first.second; in insert() [all …]
|
| /openbsd-src/gnu/llvm/clang/lib/Frontend/ |
| H A D | TextDiagnosticBuffer.cpp | 60 Diag << Notes[I.second].second; in FlushDiagnostics() 63 Diag << Warnings[I.second].second; in FlushDiagnostics() 66 Diag << Remarks[I.second].second; in FlushDiagnostics() 70 Diag << Errors[I.second].second; in FlushDiagnostics()
|
| /openbsd-src/gnu/gcc/libstdc++-v3/include/bits/ |
| H A D | stl_pair.h | 74 _T2 second; ///< @c second is a copy of the second object member 81 : first(), second() { } in pair() 85 : first(__a), second(__b) { } in pair() 90 : first(__p.first), second(__p.second) { } in pair() 97 { return __x.first == __y.first && __x.second == __y.second; } 104 || (!(__y.first < __x.first) && __x.second < __y.second); }
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/GlobalISel/ |
| H A D | LegacyLegalizerInfo.cpp | 119 const LegacyLegalizeAction Action = LLT2Action.second; in computeTables() 147 llvm::sort(PointerSpecifiedActions.second); in computeTables() 148 checkPartialSizeAndActionsVector(PointerSpecifiedActions.second); in computeTables() 153 unsupportedForDifferentSizes(PointerSpecifiedActions.second)); in computeTables() 159 llvm::sort(VectorSpecifiedActions.second); in computeTables() 162 checkPartialSizeAndActionsVector(VectorSpecifiedActions.second); in computeTables() 168 for (SizeAndAction BitsizeAndAction : VectorSpecifiedActions.second) { in computeTables() 171 NumElementsActions.push_back({NumElements, BitsizeAndAction.second}); in computeTables() 254 LegacyLegalizeAction Action = Vec[VecIdx].second; in findAction() 277 if (!needsLegalizingToDifferentSize(Vec[i].second) && in findAction() [all …]
|