Searched refs:Top (Results 1 - 25 of 72) sorted by relevance

123

/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.law/
H A Dvisibility6.C8 class Top { class
10 Top() {} function in class:Top
14 class Derived : private Top {
/openbsd-current/gnu/usr.bin/perl/lib/unicore/To/
H A DInPC.pl20 900 902 Top
22 93A Top
29 945 948 Top
34 951 Top
36 955 Top
39 981 Top
51 9FE Top
52 A01 A02 Top
59 A47 A48 Top
60 A4B A4C Top
[all...]
/openbsd-current/games/robots/
H A Dscore.c48 static SCORE Top[MAXSCORES]; variable
69 read(inf, Top, sizeof Top);
71 for (scp = Top; scp < &Top[MAXSCORES]; scp++)
77 if (Top[MAXSCORES-1].s_score <= Score) {
79 for (scp = Top; scp < &Top[MAXSCORES]; scp++)
90 if (scp == &Top[MAXSCORES]) {
91 Top[MAXSCORE
[all...]
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/compile/
H A D980816-1.c28 Widget AddButtons(Widget Parent, Widget Top, argument
42 "fromVert" , Top,
/openbsd-current/gnu/usr.bin/texinfo/makeinfo/tests/
H A Dmenu-whitespace21 @node Top
22 @top Top
39 ./top.texi:3: Next field of node `Top' not pointed to.
/openbsd-current/gnu/llvm/compiler-rt/lib/scudo/standalone/tests/
H A Dmemtag_test.cpp77 for (u64 Top = 0; Top < 0x100; ++Top)
78 Tags = Tags | (1u << extractTag(Addr | (Top << 56)));
93 for (u64 Top = 0; Top < 0x100; ++Top) {
94 uptr Ptr = (Addr | (Top << 56)) & UnTagMask;
/openbsd-current/gnu/llvm/llvm/tools/llvm-xray/
H A Dxray-stacks.cpp384 auto &Top = TS.back(); local
385 auto I = find_if(Top.first->Callees,
387 if (I == Top.first->Callees.end()) {
390 auto N = createTrieNode(R.TId, R.FuncId, Top.first);
391 Top.first->Callees.emplace_back(N);
393 // Top may be invalidated after this statement.
449 void printStack(raw_ostream &OS, const StackTrieNode *Top, argument
454 for (auto *F = Top; F != nullptr; F = F->Parent)
570 auto *Top = S.pop_back_val(); local
571 printSingleStack<AggType>(OS, FN, ReportThread, ThreadId, Top);
623 auto *Top = S.pop_back_val(); local
[all...]
H A Dxray-account.cpp191 const auto &Top = ThreadStack.Stack.back(); local
193 (*ThreadStack.RecursionDepth)[Top.first].isRecursive())
194 recordLatency(Top.first, diff(Top.second, Record.TSC));
196 --(*ThreadStack.RecursionDepth)[Top.first];
247 for (auto &Top : reverse(R)) {
249 --(*ThreadStack.RecursionDepth)[Top.first];
/openbsd-current/gnu/llvm/llvm/lib/CodeGen/
H A DVLIWMachineScheduler.cpp274 Top.init(DAG, SchedModel);
282 delete Top.HazardRec;
284 Top.HazardRec = TII->CreateTargetMIHazardRecognizer(Itin, DAG);
287 delete Top.ResourceModel;
289 Top.ResourceModel = createVLIWResourceModel(STI, DAG->getSchedModel());
315 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency);
322 Top.releaseNode(SU, SU->TopReadyCycle);
618 if (Top.isLatencyBound(SU)) {
631 if (Top
[all...]
H A DMachineScheduler.cpp371 /// Top-level MachineScheduler pass driver.
1061 LLVM_DEBUG(dbgs() << "Top Pressure:\n";
1400 /// the Top RP tracker in case the region beginning has changed.
1405 assert(TopRPTracker.getPos() == RegionBegin && "bad initial Top tracker");
1439 LLVM_DEBUG(dbgs() << "Top Pressure:\n"; dumpRegSetPressure(
2919 LLVM_DEBUG(dbgs() << "Pick " << (IsTop ? "Top " : "Bot ")
2938 Top.init(DAG, SchedModel, &Rem);
2946 if (!Top.HazardRec) {
2947 Top.HazardRec =
3241 // Top an
[all...]
/openbsd-current/lib/libcurses/tinfo/
H A Dlib_win32con.c148 WINCONSOLE.SBI.srWindow.Top);
382 WINCONSOLE.save_region.Top = 0;
391 WINCONSOLE.save_region.Top = WINCONSOLE.SBI.srWindow.Top;
421 WINCONSOLE.SBI.srWindow.Top : 0);
433 save_region.Top,
454 - WINCONSOLE.save_region.Top + 1);
462 WINCONSOLE.SBI.srWindow.Top : 0);
467 WINCONSOLE.save_region.Top,
504 T(("... display(Top
[all...]
/openbsd-current/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp59 Top.ResourceModel->isResourceAvailable(SU, true)) {
H A DBitTracker.h157 Top, // Bit not yet defined. enumerator in enum:llvm::BitTracker::BitValue::ValueType
166 // x <= Top,
194 BitValue(ValueType T = Top) : Type(T) {} argument
233 if (V.Type == Top) // This.meet(Top) = This
239 // If it is Top, it will become the same as V, otherwise it will
241 if (Type == Top) {
375 RC.Bits[i] = BitValue(BitValue::Top);
/openbsd-current/gnu/llvm/compiler-rt/lib/xray/tests/unit/
H A Dsegmented_array_test.cpp218 const auto &Top = Data.back(); local
219 uint64_t *TopNode = Top.NodePtr;
255 const auto &Top = Data->back(); local
256 uint64_t *TopNode = Top.NodePtr;
294 const auto &Top = Data->back(); local
295 uint64_t *TopNode = Top.NodePtr;
/openbsd-current/gnu/usr.bin/perl/pod/
H A Dbuildtoc15 my $Top = File::Spec->catdir($FindBin::Bin, File::Spec->updir);
16 chdir $Top or die "Can't chdir to $Top: $!";
/openbsd-current/gnu/llvm/clang/lib/AST/Interp/
H A DState.cpp128 Frame *Top = getCurrentFrame(); local
130 for (Frame *F = Top; F != Bottom; F = F->getCaller(), ++CallIdx) {
/openbsd-current/gnu/llvm/llvm/lib/Support/
H A DPrettyStackTrace.cpp318 void llvm::RestorePrettyStackState(const void *Top) { argument
321 static_cast<PrettyStackTraceEntry *>(const_cast<void *>(Top));
/openbsd-current/gnu/llvm/clang/lib/Parse/
H A DParseAST.cpp40 ResetStackCleanup(llvm::CrashRecoveryContext *Context, const void *Top) argument
42 Context, Top) {}
/openbsd-current/gnu/usr.bin/texinfo/util/
H A Dgen-dir-node55 looking at that node, which is (dir)Top.
57 File: dir Node: Top This is the top of the INFO tree
/openbsd-current/gnu/llvm/llvm/lib/Target/PowerPC/
H A DPPCMachineScheduler.cpp78 // Top and Bottom boundary. Some properties are simply incomparable, in many
188 if (tryLess(Top.getLatencyStallCycles(TryCand.SU),
189 Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall))
207 if (Cand.Policy.ReduceLatency && tryLatency(TryCand, Cand, Top)) {
/openbsd-current/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DAMDGPUUnifyDivergentExitNodes.cpp123 BasicBlock *Top = Stack.pop_back_val(); local
124 if (!DA.isUniform(Top->getTerminator()))
127 for (BasicBlock *Pred : predecessors(Top)) {
/openbsd-current/gnu/llvm/llvm/lib/Analysis/
H A DCFG.cpp48 std::pair<const BasicBlock *, const_succ_iterator> &Top = VisitStack.back(); local
49 const BasicBlock *ParentBB = Top.first;
50 const_succ_iterator &I = Top.second;
/openbsd-current/gnu/llvm/llvm/include/llvm/CodeGen/
H A DVLIWMachineScheduler.h211 VLIWSchedBoundary Top; member in class:llvm::ConvergingVLIWScheduler
221 ConvergingVLIWScheduler() : Top(TopQID, "TopQ"), Bot(BotQID, "BotQ") {}
235 return Top.ResourceModel->getTotalPackets() +
H A DMachineScheduler.h360 // Top-Level entry points for the schedule() driver...
407 // liveness during bottom-up scheduling. Top-down scheduling may proceed but
494 // Top-Level entry points for the schedule() driver...
503 /// the Top RP tracker in case the region beginning has changed.
984 GenericSchedulerBase(C), Top(SchedBoundary::TopQID, "TopQ"),
1011 Top.releaseNode(SU, SU->TopReadyCycle, false);
1031 SchedBoundary Top; member in class:llvm::GenericScheduler
1034 /// Candidate last picked from Top boundary.
1066 SchedBoundary Top; member in class:llvm::PostGenericScheduler
1071 GenericSchedulerBase(C), Top(SchedBoundar
[all...]
/openbsd-current/gnu/llvm/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h433 const auto &Top = ShadowStack.back(); variable
434 auto TopNode = Top.NodePtr;
441 // we've overflowed (TSC < Top.EntryTSC) and then account the difference
445 // a TSC of 0 and a Top.EntryTSC of 1 is (numeric_limits<uint64_t>::max()
451 Top.EntryTSC > TSC
452 ? (std::numeric_limits<uint64_t>::max() - Top.EntryTSC) + TSC
453 : TSC - Top.EntryTSC;

Completed in 423 milliseconds

123