| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| HD | HexagonMachineScheduler.cpp | 257 Top.init(DAG, SchedModel); in initialize() 265 delete Top.HazardRec; in initialize() 267 Top.HazardRec = TII->CreateTargetMIHazardRecognizer(Itin, DAG); in initialize() 270 delete Top.ResourceModel; in initialize() 272 Top.ResourceModel = new VLIWResourceModel(STI, DAG->getSchedModel()); in initialize() 296 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency); in releaseTopNode() 301 Top.releaseNode(SU, SU->TopReadyCycle); in releaseTopNode() 598 if (Top.isLatencyBound(SU)) { in SchedulingCost() 611 if (Top.ResourceModel->isResourceAvailable(SU, true)) { in SchedulingCost() 645 if (Top.isLatencyBound(SU)) in SchedulingCost() [all …]
|
| HD | HexagonMachineScheduler.h | 221 VLIWSchedBoundary Top; variable 235 ConvergingVLIWScheduler() : Top(TopQID, "TopQ"), Bot(BotQID, "BotQ") {} in ConvergingVLIWScheduler() 248 return Top.ResourceModel->getTotalPackets() + in reportPackets()
|
| HD | BitTracker.h | 156 Top, // Bit not yet defined. enumerator 193 BitValue(ValueType T = Top) : Type(T) {} in Type() 232 if (V.Type == Top) // This.meet(Top) = This in meet() 240 if (Type == Top) { in meet() 374 RC.Bits[i] = BitValue(BitValue::Top); in top()
|
| /freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/ |
| HD | xray-stacks.cpp | 382 auto &Top = TS.back(); in accountRecord() local 383 auto I = find_if(Top.first->Callees, in accountRecord() 385 if (I == Top.first->Callees.end()) { in accountRecord() 388 auto N = createTrieNode(R.TId, R.FuncId, Top.first); in accountRecord() 389 Top.first->Callees.emplace_back(N); in accountRecord() 447 void printStack(raw_ostream &OS, const StackTrieNode *Top, in printStack() argument 452 for (auto *F = Top; F != nullptr; F = F->Parent) in printStack() 569 auto *Top = S.pop_back_val(); in printAll() local 570 printSingleStack<AggType>(OS, FN, ReportThread, ThreadId, Top); in printAll() 571 for (const auto *C : Top->Callees) in printAll() [all …]
|
| /freebsd-11-stable/contrib/ntp/ntpsnmpd/ |
| HD | ntpsnmpd.texi | 29 @node Top, ntpsnmpd Description, (dir), (dir) 43 @node ntpsnmpd Description, Usage, Top, Top 49 @node Usage, , ntpsnmpd Description, Top
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| HD | GCNSchedStrategy.cpp | 178 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() 272 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode() 279 SU = Top.pickOnlyChoice(); in pickNode() 283 pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand); in pickNode() 304 Top.removeReady(SU); in pickNode()
|
| HD | AMDGPUUnifyDivergentExitNodes.cpp | 108 BasicBlock *Top = Stack.pop_back_val(); in isUniformlyReached() local 109 if (!DA.isUniform(Top->getTerminator())) in isUniformlyReached() 112 for (BasicBlock *Pred : predecessors(Top)) { in isUniformlyReached()
|
| /freebsd-11-stable/contrib/ntp/ntpd/ |
| HD | ntp.conf.texi | 27 @node Top, ntp.conf Description, (dir), (dir) 42 @node ntp.conf Description, , Top, Top
|
| HD | ntp.keys.texi | 27 @node Top, ntp.keys Description, (dir), (dir) 42 @node ntp.keys Description, , Top, Top
|
| /freebsd-11-stable/contrib/top/ |
| HD | Y2K | 1 Top and the Year 2000 12 Top and the Year 2038 16 way Unix represents time. Top will only work on systems whose kernel
|
| HD | README | 24 Top now includes a configuration script called "Configure". It helps 28 Top requires read access to the memory files "/dev/kmem" and "/dev/mem" 83 <A HREF="ftp://ftp.groupsys.com/pub/top">Top archive (groupsys.com)</A> 84 <A HREF="ftp://eecs.nwu.edu/pub/top">Top archive (eecs.nwu.edu)</A> 85 <A HREF="ftp://pharos.dgim.doc.ca/packages/top"> Top mirror (dgim.doc.ca)</A> 86 <A HREF="ftp://uiarchive.uiuc.edu/pub/packages/top/">Top mirror (uiuc.edu)</A> 112 files in "sys". Top is very sensitive to these changes. If you are 140 earlier versions). Top compiled using DEC's compiler with optimization
|
| /freebsd-11-stable/contrib/less/ |
| HD | screen.c | 783 sys_height = scr.srWindow.Bottom - scr.srWindow.Top + 1; in scrsize() 1487 cpos.Y = csbi.srWindow.Top + (row - 1); in _settextposition() 1585 size.Y = scr.srWindow.Bottom - scr.srWindow.Top + 1; in win32_init_term() 1854 rcClip.Top = csbi.srWindow.Top; in add_line() 1864 new_org.Y = rcSrc.Top + 1; in add_line() 1908 rcSrc.Top = csbi.srWindow.Top + n; 1914 rcClip.Top = csbi.srWindow.Top; 1920 new_org.Y = rcSrc.Top - n; 1957 winsz = csbi.dwSize.X * (csbi.srWindow.Bottom - csbi.srWindow.Top + 1); in win32_clear() 1959 topleft.Y = csbi.srWindow.Top; in win32_clear() [all …]
|
| /freebsd-11-stable/crypto/heimdal/doc/ |
| HD | intro.texi | 3 @node Introduction, What is Kerberos?, Top, Top 4 @c @node Introduction, What is Kerberos?, Top, Top
|
| HD | 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 …]
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| HD | MachineScheduler.cpp | 2724 Top.init(DAG, SchedModel, &Rem); in initialize() 2732 if (!Top.HazardRec) { in initialize() 2733 Top.HazardRec = in initialize() 3139 if (SUnit *SU = Top.pickOnlyChoice()) { in pickNodeBidirectional() 3147 setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top); in pickNodeBidirectional() 3151 setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot); in pickNodeBidirectional() 3178 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand); in pickNodeBidirectional() 3186 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand); in pickNodeBidirectional() 3212 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode() 3219 SU = Top.pickOnlyChoice(); in pickNode() [all …]
|
| /freebsd-11-stable/contrib/ncurses/ncurses/win32con/ |
| HD | win_driver.c | 55 #define AdjustY(p) ((p)->buffered ? 0 : (int) (p)->SBI.srWindow.Top) 201 rec.Top = (SHORT) (y + AdjustY(p)); in con_write16() 203 rec.Bottom = rec.Top; in con_write16() 242 rec.Top = (short) y; in con_write8() 244 rec.Bottom = rec.Top; in con_write8() 566 p->SBI.srWindow.Top, in get_SBI() 575 p->origin.Y = p->SBI.srWindow.Top; in get_SBI() 646 PropOf(TCB)->SBI.srWindow.Top); in drv_size() 869 readRegion.Top = 0; in save_original_screen() 876 readRegion.Top, in save_original_screen() [all …]
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| HD | CFG.cpp | 41 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back(); in FindFunctionBackedges() local 42 const BasicBlock *ParentBB = Top.first; in FindFunctionBackedges() 43 succ_const_iterator &I = Top.second; in FindFunctionBackedges()
|
| /freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/xray/ |
| HD | xray_function_call_trie.h | 433 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-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| HD | MachineScheduler.h | 940 GenericSchedulerBase(C), Top(SchedBoundary::TopQID, "TopQ"), in GenericScheduler() 967 Top.releaseNode(SU, SU->TopReadyCycle, false); in releaseTopNode() 987 SchedBoundary Top; variable 1022 SchedBoundary Top; variable 1027 GenericSchedulerBase(C), Top(SchedBoundary::TopQID, "TopQ") {} in PostGenericScheduler() 1055 Top.releaseNode(SU, SU->TopReadyCycle, false); in releaseTopNode()
|
| /freebsd-11-stable/contrib/llvm-project/lldb/source/Core/ |
| HD | Debugger.cpp | 874 IOHandlerSP reader_sp(m_input_reader_stack.Top()); in DispatchInputInterrupt() 881 IOHandlerSP reader_sp(m_input_reader_stack.Top()); in DispatchInputEndOfFile() 891 IOHandlerSP reader_sp(m_input_reader_stack.Top()); in ClearIOHandlers() 899 IOHandlerSP reader_sp(m_input_reader_stack.Top()); in ExecuteIOHandlers() 907 IOHandlerSP top_reader_sp = m_input_reader_stack.Top(); in ExecuteIOHandlers() 957 top_reader_sp = m_input_reader_stack.Top(); in RunIOHandler() 974 IOHandlerSP top_reader_sp(m_input_reader_stack.Top()); in AdoptTopIOHandlerFilesIfInvalid() 1015 IOHandlerSP top_reader_sp(m_input_reader_stack.Top()); in PushIOHandler() 1045 IOHandlerSP reader_sp(m_input_reader_stack.Top()); in PopIOHandler() 1054 reader_sp = m_input_reader_stack.Top(); in PopIOHandler()
|
| /freebsd-11-stable/contrib/binutils/bfd/doc/ |
| HD | bfd.texinfo | 81 @node Top, Overview, (dir), (dir) 94 @node Overview, BFD front end, Top, Top 198 @node BFD front end, BFD back ends, Overview, Top 286 @node BFD back ends, GNU Free Documentation License, BFD front end, Top 318 @node GNU Free Documentation License, BFD Index, BFD back ends, Top 321 @node BFD Index, , GNU Free Documentation License, Top
|
| /freebsd-11-stable/contrib/llvm-project/clang/lib/Parse/ |
| HD | ParseAST.cpp | 40 ResetStackCleanup(llvm::CrashRecoveryContext *Context, const void *Top) in ResetStackCleanup() argument 42 Context, Top) {} in ResetStackCleanup()
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
| HD | PrettyStackTrace.cpp | 291 void llvm::RestorePrettyStackState(const void *Top) { in RestorePrettyStackState() argument 294 static_cast<PrettyStackTraceEntry *>(const_cast<void *>(Top)); in RestorePrettyStackState()
|
| /freebsd-11-stable/contrib/llvm-project/clang/lib/AST/Interp/ |
| HD | State.cpp | 128 Frame *Top = getCurrentFrame(); in addCallStack() local 130 for (Frame *F = Top; F != Bottom; F = F->getCaller(), ++CallIdx) { in addCallStack()
|
| /freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| HD | RegionStore.cpp | 868 const SubRegion *Top, BindingKey TopKey, in collectSubRegionBindings() argument 873 Top = TopKey.getConcreteOffsetRegion(); in collectSubRegionBindings() 874 TopKey = BindingKey::Make(Top, BindingKey::Default); in collectSubRegionBindings() 879 SVal Extent = Top->getExtent(SVB); in collectSubRegionBindings() 886 } else if (const FieldRegion *FR = dyn_cast<FieldRegion>(Top)) { in collectSubRegionBindings() 919 if (Top->isSubRegionOf(Base) && Top != Base) { in collectSubRegionBindings() 929 if (BaseSR->isSubRegionOf(Top)) in collectSubRegionBindings() 940 const SubRegion *Top, bool IncludeAllDefaultBindings) { in collectSubRegionBindings() argument 941 collectSubRegionBindings(Bindings, SVB, Cluster, Top, in collectSubRegionBindings() 942 BindingKey::Make(Top, BindingKey::Default), in collectSubRegionBindings() [all …]
|