Home
last modified time | relevance | path

Searched refs:second (Results 1 – 25 of 2969) sorted by relevance

12345678910>>...119

/freebsd-13.1/contrib/llvm-project/lldb/source/Commands/
H A DCommandObjectSession.cpp158 start_idx.second = history.GetSize() - count.second; in DoExecute()
161 start_idx.second = stop_idx.second; in DoExecute()
164 start_idx.second = 0; in DoExecute()
169 start_idx.second = 0; in DoExecute()
173 stop_idx.second = start_idx.second + count.second - 1; in DoExecute()
179 if (stop_idx.second >= count.second) in DoExecute()
180 start_idx.second = stop_idx.second - count.second + 1; in DoExecute()
182 start_idx.second = 0; in DoExecute()
186 start_idx.second = 0; in DoExecute()
187 stop_idx.second = count.second - 1; in DoExecute()
[all …]
/freebsd-13.1/usr.sbin/etcupdate/tests/
H A Dalways_test.sh113 mkdir $NEW/second/second/difftype/dir
114 mkfifo $TEST/second/second/difftype/dir
399 C /second/second/difffiles/file
443 fifo /second/second/difftype/dir
449 file /second/second/difffiles/file "test"
535 U /second/second/difffiles/file
536 U /second/second/difflinks/link
537 D /second/second/difftype/dir
564 missing /second/second/difftype/dir
570 file /second/second/difffiles/file "new"
[all …]
H A Dtests_test.sh217 mkfifo $i/second/second/equal/fifo
219 mkdir $i/second/second/equal/dir
220 ln -s "bar" $i/second/second/equal/link
232 mkdir $NEW/second/second/difftype/dir
233 mkfifo $TEST/second/second/difftype/dir
806 fifo /second/second/equal/fifo
807 file /second/second/equal/file "foo"
808 dir /second/second/equal/dir
809 link /second/second/equal/link "bar"
812 fifo /second/second/difftype/dir
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/ProfileData/
H A DSampleProf.cpp182 for (const auto &FS : CS->second) { in print()
185 FS.second.print(OS, Indent + 4); in print()
273 if (FS != iter->second.end()) in findFunctionSamplesAt()
274 return &FS->second; in findFunctionSamplesAt()
278 if (FS != iter->second.end()) in findFunctionSamplesAt()
279 return &FS->second; in findFunctionSamplesAt()
289 for (const auto &NameFS : iter->second) in findFunctionSamplesAt()
292 R = &NameFS.second; in findFunctionSamplesAt()
347 MergedProfile.merge(*I.second); in trimAndMergeColdContextProfiles()
361 if (Ret.second) { in trimAndMergeColdContextProfiles()
[all …]
/freebsd-13.1/contrib/bmake/unit-tests/
H A Descape.exp49 VAR1BSNL0=:first line no space on second line:
50 VAR1BSNLs=:first line one space on second line:
52 VAR1BSNLt=:first line one tab on second line:
63 second line spaces should be retained':
65 second line spaces should be retained:
67 second line tab should be elided':
69 second line tab should be elided:
93 second line spaces should be retained':
95 second line spaces should be retained:
97 second line tab should be elided':
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DImportedFunctionsInliningStatistics.cpp119 assert(Node->second->NumberOfInlines >= Node->second->NumberOfRealInlines); in dump()
120 if (Node->second->NumberOfInlines == 0) in dump()
123 if (Node->second->Imported) { in dump()
126 int(Node->second->NumberOfRealInlines > 0); in dump()
130 int(Node->second->NumberOfRealInlines > 0); in dump()
139 << Node->second->NumberOfRealInlines << "\n"; in dump()
206 if (Lhs->second->NumberOfInlines != Rhs->second->NumberOfInlines) in getSortedNodes()
207 return Lhs->second->NumberOfInlines > Rhs->second->NumberOfInlines; in getSortedNodes()
208 if (Lhs->second->NumberOfRealInlines != Rhs->second->NumberOfRealInlines) in getSortedNodes()
209 return Lhs->second->NumberOfRealInlines > in getSortedNodes()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DCore.cpp220 QRI->second.erase(Name); in removeQueryDependence()
221 if (QRI->second.empty()) in removeQueryDependence()
424 (*Result)[KV.second.Aliasee].getAddress(), KV.second.AliasFlags); in materialize()
755 SymI->second.setAddress(SymI->second.getAddress()); in replace()
1185 auto &MI = MII->second; in failSymbols()
1375 OS << KV.second.getFlags() << " " << KV.second.getState(); in dump()
1382 OS << I->second->MU.get() << ", " << I->second->MU->getName() << ")\n"; in dump()
1456 return I->second; in getTracker()
1536 KV.second = &DstRT; in transferTracker()
2097 F = I->second; in runJITDispatchHandler()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUArgumentUsageInfo.cpp67 << " DispatchPtr: " << FI.second.DispatchPtr in print()
68 << " QueuePtr: " << FI.second.QueuePtr in print()
70 << " DispatchID: " << FI.second.DispatchID in print()
73 << " WorkGroupIDX: " << FI.second.WorkGroupIDX in print()
74 << " WorkGroupIDY: " << FI.second.WorkGroupIDY in print()
75 << " WorkGroupIDZ: " << FI.second.WorkGroupIDZ in print()
78 << FI.second.PrivateSegmentWaveByteOffset in print()
81 << " WorkItemIDX " << FI.second.WorkItemIDX in print()
82 << " WorkItemIDY " << FI.second.WorkItemIDY in print()
83 << " WorkItemIDZ " << FI.second.WorkItemIDZ in print()
[all …]
/freebsd-13.1/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DFunctionSummary.h75 I->second.InlineChecked = 1; in markMayInline()
76 I->second.MayInline = 1; in markMayInline()
81 I->second.InlineChecked = 1; in markShouldNotInline()
82 I->second.MayInline = 0; in markShouldNotInline()
91 if (I != Map.end() && I->second.InlineChecked) in mayInline()
92 return I->second.MayInline; in mayInline()
102 I->second.TotalBasicBlocks = TotalIDs; in markVisitedBasicBlock()
110 return I->second.VisitedBasicBlocks.count(); in getNumVisitedBasicBlocks()
117 return I->second.TimesInlined; in getNumTimesInlined()
123 I->second.TimesInlined++; in bumpNumTimesInlined()
[all …]
/freebsd-13.1/contrib/libevent/sample/
H A Dhostcheck.c123 static int Curl_raw_equal(const char *first, const char *second) in Curl_raw_equal() argument
125 while(*first && *second) { in Curl_raw_equal()
126 if(Curl_raw_toupper(*first) != Curl_raw_toupper(*second)) in Curl_raw_equal()
130 second++; in Curl_raw_equal()
135 return (Curl_raw_toupper(*first) == Curl_raw_toupper(*second)); in Curl_raw_equal()
138 static int Curl_raw_nequal(const char *first, const char *second, size_t max) in Curl_raw_nequal() argument
140 while(*first && *second && max) { in Curl_raw_nequal()
141 if(Curl_raw_toupper(*first) != Curl_raw_toupper(*second)) { in Curl_raw_nequal()
146 second++; in Curl_raw_nequal()
151 return Curl_raw_toupper(*first) == Curl_raw_toupper(*second); in Curl_raw_nequal()
/freebsd-13.1/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/types/
H A Dtst.relenum.d48 second enumerator
52 /zero >= one || second <= first || zero == second/
56 printf("null = %d; first = %d; second = %d", null, first, second);
61 /second < one || two > second || null == first/
65 printf("null = %d; first = %d; second = %d", null, first, second);
70 /first < two && second > one && one != two && zero != first/
/freebsd-13.1/contrib/llvm-project/lldb/source/Utility/
H A DSelectHelper.cpp64 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 …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h37 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()
83 return Vector.begin() + It->second; in find()
90 return Vector.begin() + It->second; in find()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/utils/TableGen/
H A DWebAssemblyDisassemblerEmitter.cpp61 if (CGIP.second) { in emitWebAssemblyDisassemblerTables()
66 auto IsCanonicalExisting = CGIP.second->TheDef->getValue("IsCanonical") in emitWebAssemblyDisassemblerTables()
80 if (CGIP.second->AsmString.size() <= CGI.AsmString.size()) in emitWebAssemblyDisassemblerTables()
103 if (PrefixPair.second.empty()) in emitWebAssemblyDisassemblerTables()
108 auto InstIt = PrefixPair.second.find(I); in emitWebAssemblyDisassemblerTables()
109 if (InstIt != PrefixPair.second.end()) { in emitWebAssemblyDisassemblerTables()
111 assert(InstIt->second.second); in emitWebAssemblyDisassemblerTables()
112 auto &CGI = *InstIt->second.second; in emitWebAssemblyDisassemblerTables()
116 OS << " { " << InstIt->second.first << ", ET_Instruction, "; in emitWebAssemblyDisassemblerTables()
168 if (PrefixPair.second.empty() || !PrefixPair.first) in emitWebAssemblyDisassemblerTables()
H A DInfoByHwMode.cpp35 auto I = Map.insert({P.first, MVT(llvm::getValueType(P.second))}); in ValueTypeByHwMode()
36 assert(I.second && "Duplicate entry?"); in ValueTypeByHwMode()
66 return F->second; in getOrCreateTypeForMode()
71 return Map.insert(std::make_pair(Mode, D->second)).first->second; in getOrCreateTypeForMode()
73 return Map.insert(std::make_pair(Mode, Type)).first->second; in getOrCreateTypeForMode()
97 << getMVTName(P->second).str() << ')'; in writeToStream()
145 auto I = Map.insert({P.first, RegSizeInfo(P.second, CGH)}); in RegSizeInfoByHwMode()
146 assert(I.second && "Duplicate entry?"); in RegSizeInfoByHwMode()
192 assert(P.second && P.second->isSubClassOf("InstructionEncoding") && in EncodingInfoByHwMode()
194 auto I = Map.insert({P.first, P.second}); in EncodingInfoByHwMode()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/XRay/
H A DGraph.h248 return I->second.size(); in size()
391 Vertices.FindAndConstruct(I.second);
392 InNeighbors[I.second].insert(I.first);
393 OutNeighbors[I.first].insert(I.second);
394 return P.second;
404 return It->second; in at()
413 return It->second; in at()
423 return It->second; in at()
432 return It->second; in at()
463 if (p.second) { in insert()
[all …]
/freebsd-13.1/contrib/llvm-project/libcxx/include/__utility/
H A Dpair.h51 _T2 second; member
69 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} in pair()
74 second = __p.second;
148 : first(), second() {} in pair()
156 : first(), second() {} in pair()
201 : first(__p.first), second(__p.second) {} in pair()
210 : first(__p.first), second(__p.second) {} in pair()
265 second = __p.second; in _NOEXCEPT_()
278 second = _VSTD::forward<second_type>(__p.second); in _NOEXCEPT_()
300 swap(second, __p.second); in swap()
[all …]
/freebsd-13.1/contrib/llvm-project/clang/lib/Frontend/
H A DTextDiagnosticBuffer.cpp60 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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h46 if (X.second > Y.second) return true; in operator()
47 if (X.second < Y.second) return false; in operator()
55 size_t XSizeB = getBlockSize(X.first.second); in operator()
56 size_t YSizeB = getBlockSize(Y.first.second); in operator()
81 Forest.insert(e.second); in MaximumSpanningTree()
89 if (Forest.findLeader(e.first) != Forest.findLeader(e.second)) { in MaximumSpanningTree()
90 Forest.unionSets(e.first, e.second); in MaximumSpanningTree()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLegacyLegalizerInfo.cpp147 llvm::sort(PointerSpecifiedActions.second); in computeTables()
159 llvm::sort(VectorSpecifiedActions.second); in computeTables()
254 LegacyLegalizeAction Action = Vec[VecIdx].second; in findAction()
277 if (!needsLegalizingToDifferentSize(Vec[i].second) && in findAction()
278 Vec[i].second != Unsupported) in findAction()
287 Vec[i].second != Unsupported) in findAction()
314 ->second in findScalarLegalAction()
322 return {SizeAndAction.second, in findScalarLegalAction()
347 if (ElementSizeAndAction.second != Legal) in findVectorLegalAction()
358 return {NumElementsAndAction.second, in findVectorLegalAction()
[all …]
/freebsd-13.1/usr.sbin/pmc/
H A Dcmd_pmc_summary.cc135 auto &teventmap = tideventmap[tidname->second]; in pmc_summary_handler()
139 auto &peventmap = pideventmap[pidname->second]; in pmc_summary_handler()
145 for (auto &ekv : pkv.second) { in pmc_summary_handler()
147 samplevec.emplace_back(ekv.second, pkv.first); in pmc_summary_handler()
150 std::sort(kv.second.begin(), kv.second.end(), [](auto &a, auto &b) {return (a.first < b.first);}); in pmc_summary_handler()
156 while (!kv.second.empty()) { in pmc_summary_handler()
157 auto val = kv.second.back(); in pmc_summary_handler()
158 kv.second.pop_back(); in pmc_summary_handler()
159 std::cout << val.second << ": " << val.first << std::endl; in pmc_summary_handler()
169 auto largest = kv.second.back(); in pmc_summary_handler()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DMapVector.h101 auto &I = Result.first->second;
102 if (Result.second) {
106 return Vector[I].second;
114 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup()
120 auto &I = Result.first->second; in insert()
121 if (Result.second) { in insert()
133 auto &I = Result.first->second; in insert()
134 if (Result.second) { in insert()
150 (Vector.begin() + Pos->second); in find()
183 if (I.second > Index) in erase()
[all …]
/freebsd-13.1/contrib/llvm-project/lldb/source/Target/
H A DSectionLoadList.cpp58 section_load_addr = pos->second; in GetSectionLoadAddress()
82 if (load_addr == sta_pos->second) in SetSectionLoadAddress()
85 sta_pos->second = load_addr; in SetSectionLoadAddress()
102 if (warn_multiple && section != ats_pos->second) { in SetSectionLoadAddress()
105 ModuleSP curr_module_sp(ats_pos->second->GetModule()); in SetSectionLoadAddress()
113 ats_pos->second->GetName().GetCString()); in SetSectionLoadAddress()
117 ats_pos->second = section; in SetSectionLoadAddress()
160 addr_t load_addr = sta_pos->second; in SetSectionUnloaded()
224 return pos->second->ResolveContainedAddress(offset, so_addr, in ResolveLoadAddress()
239 return rpos->second->ResolveContainedAddress(offset, so_addr, in ResolveLoadAddress()
[all …]
/freebsd-13.1/contrib/llvm-project/libcxx/include/__algorithm/
H A Dminmax_element.h41 __result.second = __first; in minmax_element()
49 else if (!__comp(*__i, *__result.second)) in minmax_element()
50 __result.second = __i; in minmax_element()
59 if (!__comp(*__i, *__result.second)) in minmax_element()
60 __result.second = __i; in minmax_element()
66 if (!__comp(*__first, *__result.second)) in minmax_element()
67 __result.second = __first; in minmax_element()
/freebsd-13.1/contrib/ntp/
H A DREADME.leapsmear19 Whenever a leap second is to be handled ntpd either:
21 - passes the leap second announcement down to the OS kernel (if the OS
24 - applies the leap second correction itself.
28 approaching leap second, and can handle the leap second appropriately.
35 second, so the last second of the UTC day is repeated and thus duplicate
49 if it is OK, if the current second is an in-progress leap second. But even
58 slewed by the client to compensate the leap second.
89 leap second.
108 certain interval, which is what we call smearing the leap second.
161 works around kernel bugs due to the leap second.
[all …]

12345678910>>...119