Home
last modified time | relevance | path

Searched refs:Top (Results 1 – 25 of 141) sorted by relevance

123456

/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp257 Top.init(DAG, SchedModel); in initialize()
265 delete Top.HazardRec; in initialize()
270 delete Top.ResourceModel; in initialize()
296 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency); in releaseTopNode()
598 if (Top.isLatencyBound(SU)) { in SchedulingCost()
645 if (Top.isLatencyBound(SU)) in SchedulingCost()
947 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode()
953 SU = Top.pickOnlyChoice(); in pickNode()
978 Top.removeReady(SU); in pickNode()
996 Top.bumpNode(SU); in schedNode()
[all …]
H A DHexagonMachineScheduler.h221 VLIWSchedBoundary Top; variable
235 ConvergingVLIWScheduler() : Top(TopQID, "TopQ"), Bot(BotQID, "BotQ") {} in ConvergingVLIWScheduler()
248 return Top.ResourceModel->getTotalPackets() + in reportPackets()
H A DBitTracker.h157 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()
/freebsd-13.1/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-stacks.cpp384 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()
391 Top.first->Callees.emplace_back(N); in accountRecord()
454 for (auto *F = Top; F != nullptr; F = F->Parent) in printStack()
570 auto *Top = S.pop_back_val(); in printAll() local
572 for (const auto *C : Top->Callees) in printAll()
623 auto *Top = S.pop_back_val(); in print() local
633 auto E = std::make_pair(Top, TopSum); in print()
641 std::make_pair(Top, Top->ExtraData.TerminalDurations.size()); in print()
[all …]
H A Dxray-account.cpp189 const auto &Top = ThreadStack.Stack.back(); in accountRecord() local
191 (*ThreadStack.RecursionDepth)[Top.first].isRecursive()) in accountRecord()
192 recordLatency(Top.first, diff(Top.second, Record.TSC)); in accountRecord()
194 --(*ThreadStack.RecursionDepth)[Top.first]; in accountRecord()
245 for (auto &Top : reverse(R)) { in accountRecord() local
247 --(*ThreadStack.RecursionDepth)[Top.first]; in accountRecord()
/freebsd-13.1/contrib/ntp/ntpsnmpd/
H A Dntpsnmpd.texi29 @node Top, ntpsnmpd Description, (dir), (dir)
43 @node ntpsnmpd Description, Usage, Top, Top
49 @node Usage, , ntpsnmpd Description, Top
/freebsd-13.1/contrib/ncurses/ncurses/win32con/
H A Dwin_driver.c214 save_region.Top = CON.SBI.srWindow.Top;
242 save_region.Top,
305 rec.Bottom = rec.Top; in con_write16()
342 rec.Top = (short) y; in con_write8()
344 rec.Bottom = rec.Top; in con_write8()
461 save_region.Top, in restore_original_screen()
686 this_region.Top = CON.SBI.srWindow.Top; in wcon_dobeepflash()
973 rect.Top = 0; in set_scrollback()
992 rect.Top, rect.Left, in set_scrollback()
1171 CON.save_region.Top, in read_screen_data()
[all …]
/freebsd-13.1/contrib/ntp/ntpd/
H A Dntp.conf.texi27 @node Top, ntp.conf Description, (dir), (dir)
42 @node ntp.conf Description, , Top, Top
H A Dntp.keys.texi27 @node Top, ntp.keys Description, (dir), (dir)
42 @node ntp.keys Description, , Top, Top
/freebsd-13.1/contrib/llvm-project/llvm/lib/MC/
H A DMCPseudoProbe.cpp106 InlineSite Top; in addPseudoProbe() local
108 Top = InlineSite(Probe.getGuid(), 0); in addPseudoProbe()
110 Top = InlineSite(std::get<0>(InlineStack.front()), 0); in addPseudoProbe()
113 auto *Cur = getOrAddNode(Top); in addPseudoProbe()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNSchedStrategy.cpp178 if (SUnit *SU = Top.pickOnlyChoice()) { in pickNodeBidirectional()
185 setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top); in pickNodeBidirectional()
189 setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot); in pickNodeBidirectional()
216 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand); in pickNodeBidirectional()
224 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand); in pickNodeBidirectional()
250 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode()
257 SU = Top.pickOnlyChoice(); in pickNode()
261 pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand); in pickNode()
282 Top.removeReady(SU); in pickNode()
H A DAMDGPUUnifyDivergentExitNodes.cpp123 BasicBlock *Top = Stack.pop_back_val(); in isUniformlyReached() local
124 if (!DA.isUniform(Top->getTerminator())) in isUniformlyReached()
127 for (BasicBlock *Pred : predecessors(Top)) { in isUniformlyReached()
/freebsd-13.1/crypto/heimdal/doc/
H A Dintro.texi3 @node Introduction, What is Kerberos?, Top, Top
4 @c @node Introduction, What is Kerberos?, Top, Top
H A Dprogramming.texi3 @node Programming with Kerberos, Migration, Windows compatibility, Top
/freebsd-13.1/contrib/less/
H A Dscreen.c1487 cpos.Y = csbi.srWindow.Top + (row - 1); in _settextposition()
1585 size.Y = scr.srWindow.Bottom - scr.srWindow.Top + 1; in win32_init_term()
1855 rcClip.Top = csbi.srWindow.Top; in add_line()
1865 new_org.Y = rcSrc.Top + 1; in add_line()
1909 rcSrc.Top = csbi.srWindow.Top + n;
1915 rcClip.Top = csbi.srWindow.Top;
1921 new_org.Y = rcSrc.Top - n;
1960 topleft.Y = csbi.srWindow.Top; in win32_clear()
1996 rcSrc.Top = csbi.srWindow.Top + n;
2002 rcClip.Top = csbi.srWindow.Top;
[all …]
/freebsd-13.1/sys/contrib/openzfs/
H A D.gitignore36 # Top level generated files specific to this top level dir
52 # Top level generic files
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DCFG.cpp48 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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineScheduler.cpp2917 if (!Top.HazardRec) { in initialize()
2918 Top.HazardRec = in initialize()
3399 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode()
3433 Top.removeReady(SU); in pickNode()
3476 Top.bumpNode(SU); in schedNode()
3525 if (!Top.HazardRec) { in initialize()
3526 Top.HazardRec = in initialize()
3610 assert(Top.Available.empty() && Top.Pending.empty() && "ReadyQ garbage"); in pickNode()
3615 SU = Top.pickOnlyChoice(); in pickNode()
3632 Top.removeReady(SU); in pickNode()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCMachineScheduler.cpp188 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()
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h433 const auto &Top = ShadowStack.back(); in exitFunction() local
434 auto TopNode = Top.NodePtr; in exitFunction()
451 Top.EntryTSC > TSC in exitFunction()
452 ? (std::numeric_limits<uint64_t>::max() - Top.EntryTSC) + TSC in exitFunction()
453 : TSC - Top.EntryTSC; in exitFunction()
/freebsd-13.1/contrib/llvm-project/lldb/source/Core/
H A DDebugger.cpp325 if (auto handler_sp = m_io_handler_stack.Top()) in SetTerminalWidth()
848 IOHandlerSP reader_sp(m_io_handler_stack.Top()); in DispatchInputInterrupt()
855 IOHandlerSP reader_sp(m_io_handler_stack.Top()); in DispatchInputEndOfFile()
865 IOHandlerSP reader_sp(m_io_handler_stack.Top()); in ClearIOHandlers()
872 IOHandlerSP reader_sp = m_io_handler_stack.Top(); in RunIOHandlers()
890 reader_sp = m_io_handler_stack.Top(); in RunIOHandlers()
917 top_reader_sp = m_io_handler_stack.Top(); in RunIOHandlerSync()
974 IOHandlerSP top_reader_sp(m_io_handler_stack.Top()); in AdoptTopIOHandlerFilesIfInvalid()
1015 IOHandlerSP top_reader_sp(m_io_handler_stack.Top()); in PushIOHandler()
1045 IOHandlerSP reader_sp(m_io_handler_stack.Top()); in PopIOHandler()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h954 GenericSchedulerBase(C), Top(SchedBoundary::TopQID, "TopQ"), in GenericScheduler()
981 Top.releaseNode(SU, SU->TopReadyCycle, false); in releaseTopNode()
1001 SchedBoundary Top; variable
1036 SchedBoundary Top; variable
1041 GenericSchedulerBase(C), Top(SchedBoundary::TopQID, "TopQ") {} in PostGenericScheduler()
1069 Top.releaseNode(SU, SU->TopReadyCycle, false); in releaseTopNode()
/freebsd-13.1/contrib/llvm-project/clang/lib/Parse/
H A DParseAST.cpp40 ResetStackCleanup(llvm::CrashRecoveryContext *Context, const void *Top) in ResetStackCleanup() argument
42 Context, Top) {} in ResetStackCleanup()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Support/
H A DPrettyStackTrace.cpp315 void llvm::RestorePrettyStackState(const void *Top) { in RestorePrettyStackState() argument
318 static_cast<PrettyStackTraceEntry *>(const_cast<void *>(Top)); in RestorePrettyStackState()
/freebsd-13.1/contrib/llvm-project/clang/lib/AST/Interp/
H A DState.cpp128 Frame *Top = getCurrentFrame(); in addCallStack() local
130 for (Frame *F = Top; F != Bottom; F = F->getCaller(), ++CallIdx) { in addCallStack()

123456