| /netbsd-src/games/robots/ |
| H A D | score.c | 56 static SCORE Top[MAXSCORES]; variable 73 read(inf, Top, sizeof Top) == sizeof Top) { in read_score() 75 for (scp = Top; scp < &Top[MAXSCORES]; scp++) { in read_score() 83 for (scp = Top; scp < &Top[MAXSCORES]; scp++) in read_score() 103 for (scp = Top; scp < &Top[MAXSCORES]; scp++) { in write_score() 110 write(inf, Top, sizeof Top); in write_score() 134 if (Top[MAXSCORES-1].s_score <= Score) { in score() 136 for (scp = Top; scp < &Top[MAXSCORES]; scp++) in score() 148 if (scp == &Top[MAXSCORES]) { in score() 149 Top[MAXSCORES-1].s_score = Score; in score() [all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| H A D | 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 …]
|
| /netbsd-src/external/apache2/llvm/dist/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() 570 auto *Top = S.pop_back_val(); in printAll() local 571 printSingleStack<AggType>(OS, FN, ReportThread, ThreadId, Top); in printAll() 572 for (const auto *C : Top->Callees) in printAll() [all …]
|
| /netbsd-src/external/gpl2/texinfo/dist/makeinfo/tests/ |
| H A D | node-expand.txi | 16 @node Top, (dir), (dir), (dir) 29 @node @value{node1}, @@node `2', Top, Top 48 @node @@node `2', ``node'' with---tricks, @value{node1}, Top 57 @node ``node'' with---tricks, , @@node `2', Top
|
| H A D | html-min.txi | 5 @node Top 6 @top Top of HTML min test 8 Top.
|
| H A D | html-title.txi | 5 @node Top 6 @top Top of @@title @sc{html} @code{test} 8 Top.
|
| H A D | menu-whitespace | 21 @node Top 22 @top Top 39 ./top.texi:3: Next field of node `Top' not pointed to.
|
| H A D | macro-at.txi | 13 @node Top, , AUTHORS -- who did what on GNU LilyPond, (dir) 19 @node AUTHORS -- who did what on GNU LilyPond, Top, , Top
|
| H A D | menu-whitespace.txi | 3 @node Top 4 @top Top
|
| H A D | html-docdesc.txi | 9 @node Top 10 @top Top of HTML docdesc test
|
| /netbsd-src/external/cddl/dtracetoolkit/dist/Examples/ |
| H A D | tcl_calltime_example.txt | 11 Top 10 counts, 24 Top 10 exclusive elapsed times (us), 37 Top 10 inclusive elapsed times (us), 53 The second (Top 10 exclusive elapsed times) shows us the top ten slowest 57 The third (Top 10 inclusive elapsed times) shows us the top ten slowest
|
| H A D | j_calltime_example.txt | 13 Top 10 counts, 26 Top 10 elapsed times (us), 29 Top 10 exclusive method elapsed times (us), 42 Top 10 inclusive method elapsed times (us),
|
| H A D | j_cputime_example.txt | 10 Top 10 counts, 23 Top 10 on-CPU times (us), 26 Top 10 exclusive method on-CPU times (us), 39 Top 10 inclusive method on-CPU times (us),
|
| /netbsd-src/external/cddl/dtracetoolkit/dist/Docs/Examples/ |
| H A D | tcl_calltime_example.txt | 11 Top 10 counts, 24 Top 10 exclusive elapsed times (us), 37 Top 10 inclusive elapsed times (us), 53 The second (Top 10 exclusive elapsed times) shows us the top ten slowest 57 The third (Top 10 inclusive elapsed times) shows us the top ten slowest
|
| H A D | j_calltime_example.txt | 13 Top 10 counts, 26 Top 10 elapsed times (us), 29 Top 10 exclusive method elapsed times (us), 42 Top 10 inclusive method elapsed times (us),
|
| H A D | j_cputime_example.txt | 10 Top 10 counts, 23 Top 10 on-CPU times (us), 26 Top 10 exclusive method on-CPU times (us), 39 Top 10 inclusive method on-CPU times (us),
|
| /netbsd-src/external/gpl3/gdb/dist/sim/testsuite/arm/xscale/ |
| H A D | miaxy.cgs | 35 # Test Bottom Top Multilply Accumulate 53 # Test Top Bottom Multilply Accumulate 71 # Test Top Top Multilply Accumulate
|
| /netbsd-src/external/bsd/ntp/dist/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
|
| /netbsd-src/external/gpl3/gdb/dist/sim/testsuite/arm/iwmmxt/ |
| H A D | tmiaxy.cgs | 35 # Test Bottom Top Multilply Accumulate 53 # Test Top Bottom Multilply Accumulate 71 # Test Top Top Multilply Accumulate
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| H A D | 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() 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()
|
| /netbsd-src/external/gpl2/gettext/dist/gettext-runtime/libasprintf/ |
| H A D | autosprintf.info | 32 File: autosprintf.info, Node: Top, Next: Introduction, Prev: (dir), Up: (dir) 46 File: autosprintf.info, Node: Introduction, Next: Class autosprintf, Prev: Top, Up: Top 81 …autosprintf.info, Node: Class autosprintf, Next: Using autosprintf, Prev: Introduction, Up: Top 103 File: autosprintf.info, Node: Using autosprintf, Prev: Class autosprintf, Up: Top 126 Node: Top1336
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/MC/ |
| H A D | MCPseudoProbe.cpp | 106 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()
|
| /netbsd-src/external/bsd/ntp/dist/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
|
| /netbsd-src/external/bsd/top/dist/ |
| H A D | 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
|