| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Interval.h | 80 T *Top; variable
84 Interval() : Top(nullptr), Bottom(nullptr) {} in Interval()
85 Interval(T *Top, T *Bottom) : Top(Top), Bottom(Bottom) { in Interval() argument
86 assert((Top == Bottom || Top->comesBefore(Bottom)) && in Interval()
91 Top = Elems[0]; in Interval()
94 if (I->comesBefore(Top)) in Interval()
95 Top = I; in Interval()
101 assert(((Top == nullptr && Bottom == nullptr) || in empty()
102 (Top != nullptr && Bottom != nullptr)) && in empty()
104 return Top == nullptr; in empty()
[all …]
|
| H A D | Scheduler.h | 70 DGNode *Top = ListCopy.top(); in insert() local
72 assert(Top != N && "Node already exists in ready list!"); in insert()
91 auto *Top = List.top(); in remove() local
93 if (Top == N) in remove()
95 Keep.push_back(Top); in remove()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Interval.cpp | 22 return Other.Bottom->comesBefore(Top) || Bottom->comesBefore(Other.Top); in disjoint()
27 auto *Top = top(); in print() local
30 if (Top != nullptr) in print()
31 OS << *Top; in print()
|
| /freebsd/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()
312 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency); in releaseTopNode()
319 Top.releaseNode(SU, SU->TopReadyCycle); in releaseTopNode()
615 if (Top.isLatencyBound(SU)) { in SchedulingCost()
628 if (Top.ResourceModel->isResourceAvailable(SU, true)) { in SchedulingCost()
662 if (Top.isLatencyBound(SU)) in SchedulingCost()
[all …]
|
| H A D | MachineScheduler.cpp | 3680 Top.init(DAG, SchedModel, &Rem); in initialize()
3688 if (!Top.HazardRec) { in initialize()
3689 Top.HazardRec = DAG->TII->CreateTargetMIHazardRecognizer(Itin, DAG); in initialize()
4096 if (SUnit *SU = Top.pickOnlyChoice()) { in pickNodeBidirectional()
4104 setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top); in pickNodeBidirectional()
4108 setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot); in pickNodeBidirectional()
4135 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand); in pickNodeBidirectional()
4143 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand); in pickNodeBidirectional()
4168 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode()
4175 SU = Top.pickOnlyChoice(); in pickNode()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-xray/ |
| H A D | xray-stacks.cpp | 380 auto &Top = TS.back(); in accountRecord() local
381 auto I = find_if(Top.first->Callees, in accountRecord()
383 if (I == Top.first->Callees.end()) { in accountRecord()
386 auto N = createTrieNode(R.TId, R.FuncId, Top.first); in accountRecord()
387 Top.first->Callees.emplace_back(N); in accountRecord()
445 void printStack(raw_ostream &OS, const StackTrieNode *Top, in printStack() argument
450 for (auto *F = Top; F != nullptr; F = F->Parent) in printStack()
554 auto *Top = S.pop_back_val(); in printAll() local
555 printSingleStack<AggType>(OS, FN, ReportThread, ThreadId, Top); in printAll()
556 llvm::append_range(S, 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()
|
| /freebsd/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
|
| /freebsd/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 …]
|
| /freebsd/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 …]
|
| /freebsd/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
|
| /freebsd/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
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | VLIWMachineScheduler.h | 215 VLIWSchedBoundary Top;
225 ConvergingVLIWScheduler() : Top(TopQID, "TopQ"), Bot(BotQID, "BotQ") {}
239 return Top.ResourceModel->getTotalPackets() + in reportPackets()
214 VLIWSchedBoundary Top; global() variable
|
| /freebsd/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 …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | BitTracker.h | 154 Top, // Bit not yet defined. enumerator
191 BitValue(ValueType T = Top) : Type(T) {} in Type()
230 if (V.Type == Top) // This.meet(Top) = This in meet()
238 if (Type == Top) { in meet()
372 RC.Bits[i] = BitValue(BitValue::Top); in top()
|
| /freebsd/crypto/krb5/src/util/ |
| H A D | def-check.pl | 51 Top: label
116 goto Top;
|
| /freebsd/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()
|
| /freebsd/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",
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCMachineScheduler.cpp | 187 if (tryLess(Top.getLatencyStallCycles(TryCand.SU), in tryCandidate()
188 Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall)) in tryCandidate()
209 if (Cand.Policy.ReduceLatency && tryLatency(TryCand, Cand, Top)) { in tryCandidate()
|
| /freebsd/contrib/llvm-project/clang/lib/Parse/ |
| H A D | ParseAST.cpp | 40 ResetStackCleanup(llvm::CrashRecoveryContext *Context, const void *Top) in ResetStackCleanup() argument
42 Context, Top) {} in ResetStackCleanup()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | PredicateInfo.cpp | 264 const ValueDFS &Top = *Stack.back().V; in stackIsInScope() local
265 if (Top.LocalNum == LN_Last && Top.PInfo) { in stackIsInScope()
273 if (EdgePred != getBranchBlock(Top.PInfo)) in stackIsInScope()
277 return DT.dominates(getBlockEdge(Top.PInfo), *VDUse.U); in stackIsInScope()
280 return VDUse.DFSIn >= Top.DFSIn && VDUse.DFSOut <= Top.DFSOut; in stackIsInScope()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUUnifyDivergentExitNodes.cpp | 123 BasicBlock *Top = Stack.pop_back_val(); in isUniformlyReached() local
124 if (!UA.isUniform(Top->getTerminator())) in isUniformlyReached()
127 for (BasicBlock *Pred : predecessors(Top)) { in isUniformlyReached()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CFG.cpp | 49 std::pair<const BasicBlock *, const_succ_iterator> &Top = VisitStack.back(); in FindFunctionBackedges() local
50 const BasicBlock *ParentBB = Top.first; in FindFunctionBackedges()
51 const_succ_iterator &I = Top.second; in FindFunctionBackedges()
|
| /freebsd/contrib/llvm-project/clang/lib/AST/ByteCode/ |
| H A D | State.cpp | 130 const Frame *Top = getCurrentFrame(); in addCallStack() local
132 for (const Frame *F = Top; F != Bottom; F = F->getCaller(), ++CallIdx) { in addCallStack()
|