| /src/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | VLIWMachineScheduler.cpp | 274 Top.init(DAG, SchedModel); in initialize() 282 delete Top.HazardRec; in initialize() 284 Top.HazardRec = TII->CreateTargetMIHazardRecognizer(Itin, DAG); in initialize() 287 delete Top.ResourceModel; in initialize() 289 Top.ResourceModel = createVLIWResourceModel(STI, DAG->getSchedModel()); in initialize() 315 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency); in releaseTopNode() 322 Top.releaseNode(SU, SU->TopReadyCycle); in releaseTopNode() 618 if (Top.isLatencyBound(SU)) { in SchedulingCost() 631 if (Top.ResourceModel->isResourceAvailable(SU, true)) { in SchedulingCost() 665 if (Top.isLatencyBound(SU)) in SchedulingCost() [all …]
|
| H A D | MachineScheduler.cpp | 3259 Top.init(DAG, SchedModel, &Rem); in initialize() 3267 if (!Top.HazardRec) { in initialize() 3268 Top.HazardRec = DAG->TII->CreateTargetMIHazardRecognizer(Itin, DAG); in initialize() 3675 if (SUnit *SU = Top.pickOnlyChoice()) { in pickNodeBidirectional() 3683 setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top); in pickNodeBidirectional() 3687 setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot); in pickNodeBidirectional() 3714 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand); in pickNodeBidirectional() 3722 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand); in pickNodeBidirectional() 3747 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode() 3754 SU = Top.pickOnlyChoice(); in pickNode() [all …]
|
| /src/contrib/llvm-project/llvm/tools/llvm-xray/ |
| H A D | xray-stacks.cpp | 384 auto &Top = TS.back(); in accountRecord() local 385 auto I = find_if(Top.first->Callees, in accountRecord() 387 if (I == Top.first->Callees.end()) { in accountRecord() 390 auto N = createTrieNode(R.TId, R.FuncId, Top.first); in accountRecord() 391 Top.first->Callees.emplace_back(N); in accountRecord() 449 void printStack(raw_ostream &OS, const StackTrieNode *Top, in printStack() argument 454 for (auto *F = Top; F != nullptr; F = F->Parent) in printStack() 566 auto *Top = S.pop_back_val(); in printAll() local 567 printSingleStack<AggType>(OS, FN, ReportThread, ThreadId, Top); in printAll() 568 for (const auto *C : Top->Callees) in printAll() [all …]
|
| H A D | xray-account.cpp | 191 const auto &Top = ThreadStack.Stack.back(); in accountRecord() local 193 (*ThreadStack.RecursionDepth)[Top.first].isRecursive()) in accountRecord() 194 recordLatency(Top.first, diff(Top.second, Record.TSC)); in accountRecord() 196 --(*ThreadStack.RecursionDepth)[Top.first]; in accountRecord() 247 for (auto &Top : reverse(R)) { in accountRecord() local 249 --(*ThreadStack.RecursionDepth)[Top.first]; in accountRecord()
|
| /src/contrib/ntp/ntpsnmpd/ |
| H A D | ntpsnmpd.texi | 29 @node Top, ntpsnmpd Description, (dir), (dir) 43 @node ntpsnmpd Description, Usage, Top, Top 49 @node Usage, , ntpsnmpd Description, Top
|
| /src/contrib/ncurses/ncurses/tinfo/ |
| H A D | lib_win32con.c | 143 WINCONSOLE.SBI.srWindow.Top); in _nc_console_size() 365 WINCONSOLE.save_region.Top = 0; in save_original_screen() 374 WINCONSOLE.save_region.Top = WINCONSOLE.SBI.srWindow.Top; in save_original_screen() 404 WINCONSOLE.SBI.srWindow.Top : 0); in restore_original_screen() 416 save_region.Top, in restore_original_screen() 437 - WINCONSOLE.save_region.Top + 1); in read_screen_data() 446 ? WINCONSOLE.SBI.srWindow.Top in read_screen_data() 452 WINCONSOLE.save_region.Top, in read_screen_data() 490 WINCONSOLE.SBI.srWindow.Top, in _nc_console_get_SBI() 499 WINCONSOLE.origin.Y = WINCONSOLE.SBI.srWindow.Top; in _nc_console_get_SBI() [all …]
|
| /src/contrib/ncurses/ncurses/win32con/ |
| H A D | win32_driver.c | 57 : (int) WINCONSOLE.SBI.srWindow.Top) 110 save_region.Top = WINCONSOLE.SBI.srWindow.Top; 116 save_size.Y = (SHORT) (save_region.Bottom - save_region.Top + 1); 129 for (i = save_region.Top; i <= save_region.Bottom; ++i) { 138 save_region.Top, 200 rec.Top = (SHORT) (y + AdjustY()); in con_write16() 202 rec.Bottom = rec.Top; in con_write16() 239 rec.Top = (short) y; in con_write8() 241 rec.Bottom = rec.Top; in con_write8() 342 WINCONSOLE.SBI.srWindow.Top : 0); in restore_original_screen() [all …]
|
| /src/contrib/ntp/ntpd/ |
| H A D | ntp.conf.texi | 27 @node Top, ntp.conf Description, (dir), (dir) 42 @node ntp.conf Description, , Top, Top
|
| H A D | ntp.keys.texi | 27 @node Top, ntp.keys Description, (dir), (dir) 42 @node ntp.keys Description, , Top, Top
|
| /src/crypto/heimdal/doc/ |
| H A D | intro.texi | 3 @node Introduction, What is Kerberos?, Top, Top 4 @c @node Introduction, What is Kerberos?, Top, Top
|
| H A D | hx509.texi | 173 @node Top, Introduction, (dir), (dir) 217 @node Introduction, What is X.509 ?, Top, Top 250 @node What is X.509 ?, Setting up a CA, Introduction, Top 335 @node Setting up a CA, Creating a CA certificate, What is X.509 ?, Top 364 @node Creating a CA certificate, Issuing certificates, Setting up a CA, Top 432 @node Issuing certificates, Issuing CRLs, Creating a CA certificate, Top 507 @node Issuing CRLs, Application requirements, Issuing certificates, Top 531 @node Application requirements, CMS signing and encryption, Issuing CRLs, Top 687 @node CMS signing and encryption, CMS background, Application requirements, Top 694 @node CMS background, Certificate matching, CMS signing and encryption, Top [all …]
|
| H A D | programming.texi | 3 @node Programming with Kerberos, Migration, Windows compatibility, Top
|
| /src/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | VLIWMachineScheduler.h | 215 VLIWSchedBoundary Top; variable 225 ConvergingVLIWScheduler() : Top(TopQID, "TopQ"), Bot(BotQID, "BotQ") {} in ConvergingVLIWScheduler() 239 return Top.ResourceModel->getTotalPackets() + in reportPackets()
|
| H A D | MachineScheduler.h | 1213 GenericSchedulerBase(C), Top(SchedBoundary::TopQID, "TopQ"), in GenericScheduler() 1240 Top.releaseNode(SU, SU->TopReadyCycle, false); in releaseTopNode() 1260 SchedBoundary Top; variable 1295 SchedBoundary Top; variable 1306 : GenericSchedulerBase(C), Top(SchedBoundary::TopQID, "TopQ"), in PostGenericScheduler() 1335 Top.releaseNode(SU, SU->TopReadyCycle, false); in releaseTopNode()
|
| /src/contrib/less/ |
| H A D | screen.c | 873 sys_height = scr.srWindow.Bottom - scr.srWindow.Top + 1; in scrsize() 1747 cpos.Y = csbi.srWindow.Top + (row - 1); in _settextposition() 1848 size.Y = scr.srWindow.Bottom - scr.srWindow.Top + 1; in win32_init_term() 2146 rcClip.Top = csbi.srWindow.Top; in add_line() 2156 new_org.Y = rcSrc.Top + 1; in add_line() 2198 rcSrc.Top = csbi.srWindow.Top + n; 2204 rcClip.Top = csbi.srWindow.Top; 2210 new_org.Y = rcSrc.Top - n; 2246 winsz = csbi.dwSize.X * (csbi.srWindow.Bottom - csbi.srWindow.Top + 1); in win32_clear() 2248 topleft.Y = csbi.srWindow.Top; in win32_clear() [all …]
|
| /src/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | BitTracker.h | 157 Top, // Bit not yet defined. enumerator 194 BitValue(ValueType T = Top) : Type(T) {} in Type() 233 if (V.Type == Top) // This.meet(Top) = This in meet() 241 if (Type == Top) { in meet() 375 RC.Bits[i] = BitValue(BitValue::Top); in top()
|
| /src/crypto/krb5/src/util/ |
| H A D | def-check.pl | 51 Top: label 116 goto Top;
|
| /src/sys/contrib/device-tree/src/arm64/qcom/ |
| H A D | msm8916-alcatel-idol347.dts | 108 sound-name-prefix = "Speaker Top"; 279 "Speaker", "Speaker Top", 281 pin-switches = "Speaker Top", "Speaker Bottom"; 283 "Speaker Top", "Speaker Top OUT",
|
| /src/contrib/llvm-project/compiler-rt/lib/xray/ |
| H A D | xray_function_call_trie.h | 429 const auto &Top = ShadowStack.back(); in exitFunction() local 430 auto TopNode = Top.NodePtr; in exitFunction() 447 Top.EntryTSC > TSC in exitFunction() 448 ? (std::numeric_limits<uint64_t>::max() - Top.EntryTSC) + TSC in exitFunction() 449 : TSC - Top.EntryTSC; in exitFunction()
|
| /src/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCMachineScheduler.cpp | 188 if (tryLess(Top.getLatencyStallCycles(TryCand.SU), in tryCandidate() 189 Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall)) in tryCandidate() 207 if (Cand.Policy.ReduceLatency && tryLatency(TryCand, Cand, Top)) { in tryCandidate()
|
| /src/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CFG.cpp | 48 std::pair<const BasicBlock *, const_succ_iterator> &Top = VisitStack.back(); in FindFunctionBackedges() local 49 const BasicBlock *ParentBB = Top.first; in FindFunctionBackedges() 50 const_succ_iterator &I = Top.second; in FindFunctionBackedges()
|
| /src/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUUnifyDivergentExitNodes.cpp | 127 BasicBlock *Top = Stack.pop_back_val(); in isUniformlyReached() local 128 if (!UA.isUniform(Top->getTerminator())) in isUniformlyReached() 131 for (BasicBlock *Pred : predecessors(Top)) { in isUniformlyReached()
|
| /src/contrib/llvm-project/llvm/lib/Support/ |
| H A D | PrettyStackTrace.cpp | 316 void llvm::RestorePrettyStackState(const void *Top) { in RestorePrettyStackState() argument 319 static_cast<PrettyStackTraceEntry *>(const_cast<void *>(Top)); in RestorePrettyStackState()
|
| /src/contrib/llvm-project/clang/lib/Parse/ |
| H A D | ParseAST.cpp | 41 ResetStackCleanup(llvm::CrashRecoveryContext *Context, const void *Top) in ResetStackCleanup() argument 43 Context, Top) {} in ResetStackCleanup()
|
| /src/contrib/llvm-project/clang/lib/AST/Interp/ |
| H A D | State.cpp | 129 const Frame *Top = getCurrentFrame(); in addCallStack() local 131 for (const Frame *F = Top; F != Bottom; F = F->getCaller(), ++CallIdx) { in addCallStack()
|