| /src/games/robots/ |
| score.c | 57 static SCORE Top[MAXSCORES];
74 read(inf, Top, sizeof Top) == sizeof Top) {
76 for (scp = Top; scp < &Top[MAXSCORES]; scp++) {
84 for (scp = Top; scp < &Top[MAXSCORES]; scp++)
104 for (scp = Top; scp < &Top[MAXSCORES]; scp++)
[all...] |
| /src/external/gpl2/texinfo/dist/makeinfo/tests/ |
| menu-whitespace | 18 $ cat top.texi
19 @setfilename top.info
21 @node Top
22 @top Top
37 $ makeinfo top.texi
38 Making info file `top.info' from `top.texi'.
39 ./top.texi:3: Next field of node `Top' not pointed to
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| xray-stacks.cpp | 59 cl::desc("Report top stacks within each thread id"),
374 // that entry, and the function id. Before doing so we check the top of
384 auto &Top = TS.back();
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,
452 // in reverse order (callers at top, callees down bottom)
[all...] |
| xray-account.cpp | 104 static cl::opt<int> AccountTop("top", cl::desc("only show the top N results"),
107 static cl::alias AccountTop2("p", cl::desc("Alias for -top"),
189 const auto &Top = ThreadStack.Stack.back();
191 (*ThreadStack.RecursionDepth)[Top.first].isRecursive())
192 recordLatency(Top.first, diff(Top.second, Record.TSC));
194 --(*ThreadStack.RecursionDepth)[Top.first];
229 // already bailed out, because `<- f()` doesn't match the current "top" of
245 for (auto &Top : reverse(R))
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/MC/ |
| MCPseudoProbe.cpp | 100 // added. Note that the edge [0, A] means A is the top-level function we are
105 // is a top-level function.
106 InlineSite Top;
108 Top = InlineSite(Probe.getGuid(), 0);
110 Top = InlineSite(std::get<0>(InlineStack.front()), 0);
113 auto *Cur = getOrAddNode(Top);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 257 Top.init(DAG, SchedModel);
265 delete Top.HazardRec;
267 Top.HazardRec = TII->CreateTargetMIHazardRecognizer(Itin, DAG);
270 delete Top.ResourceModel;
272 Top.ResourceModel = new VLIWResourceModel(STI, DAG->getSchedModel());
296 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency);
301 Top.releaseNode(SU, SU->TopReadyCycle);
560 // top-down direction.
588 << ((Q.getID() == TopQID) ? "(top|" : "(bot|"))
[all...] |
| HexagonMachineScheduler.h | 88 /// top-level schedule() driver.
220 // State of the top and bottom scheduled instruction boundaries.
221 VLIWSchedBoundary Top;
228 /// SUnit::NodeQueueId: 0 (none), 1 (top), 2 (bot), 3 (both)
235 ConvergingVLIWScheduler() : Top(TopQID, "TopQ"), Bot(BotQID, "BotQ") {}
248 return Top.ResourceModel->getTotalPackets() +
|
| BitTracker.h | 84 return Uses.top();
157 Top, // Bit not yet defined.
166 // x <= Top,
194 BitValue(ValueType T = Top) : Type(T) {}
219 // (4) x.T = x (i.e. T = "top")
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) {
337 // Generate a "top" cell of given size
[all...] |
| /src/crypto/external/bsd/heimdal/dist/lib/roken/ |
| get_window_size.c | 113 *lines = 1 + sb_info.srWindow.Bottom - sb_info.srWindow.Top;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNSchedStrategy.cpp | 178 if (SUnit *SU = Top.pickOnlyChoice()) {
183 // the instructions outside the zone, including the top zone.
185 setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top);
186 // Set the top-down policy based on the state of the current top zone and
189 setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot);
191 // See if BotCand is still valid (because we previously scheduled from Top).
211 // Check if the top Q has a better candidate.
212 LLVM_DEBUG(dbgs() << "Picking from Top:\n");
216 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand)
[all...] |
| AMDGPUUnifyDivergentExitNodes.cpp | 123 BasicBlock *Top = Stack.pop_back_val();
124 if (!DA.isUniform(Top->getTerminator()))
127 for (BasicBlock *Pred : predecessors(Top)) {
|
| /src/sys/external/bsd/compiler_rt/dist/lib/xray/tests/unit/ |
| segmented_array_test.cc | 218 const auto &Top = Data.back();
219 uint64_t *TopNode = Top.NodePtr;
255 const auto &Top = Data->back();
256 uint64_t *TopNode = Top.NodePtr;
294 const auto &Top = Data->back();
295 uint64_t *TopNode = Top.NodePtr;
|
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| State.cpp | 128 Frame *Top = getCurrentFrame();
130 for (Frame *F = Top; F != Bottom; F = F->getCaller(), ++CallIdx) {
|
| /src/external/apache2/llvm/dist/clang/lib/Parse/ |
| ParseAST.cpp | 40 ResetStackCleanup(llvm::CrashRecoveryContext *Context, const void *Top)
42 Context, Top) {}
160 // is due to a top-level semicolon, an action override, or a parse error
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| PrettyStackTrace.cpp | 315 void llvm::RestorePrettyStackState(const void *Top) {
318 static_cast<PrettyStackTraceEntry *>(const_cast<void *>(Top));
|
| /src/external/gpl2/texinfo/dist/util/ |
| gen-dir-node | 3 # Generate the top-level Info node, given a directory of Info files
5 # top-level dir file. The skeleton file contains info topic names in the
57 looking at that node, which is (dir)Top.
59 File: dir Node: Top This is the top of the INFO tree
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| CFG.cpp | 48 std::pair<const BasicBlock *, const_succ_iterator> &Top = VisitStack.back();
49 const BasicBlock *ParentBB = Top.first;
50 const_succ_iterator &I = Top.second;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCMachineScheduler.cpp | 78 // Top and Bottom boundary. Some properties are simply incomparable, in many
186 if (tryLess(Top.getLatencyStallCycles(TryCand.SU),
187 Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall))
205 if (Cand.Policy.ReduceLatency && tryLatency(TryCand, Cand, Top)) {
|
| /src/external/bsd/less/dist/ |
| screen.c | 832 sys_height = scr.srWindow.Bottom - scr.srWindow.Top + 1;
1437 * to add a line at the top of the screen.
1549 cpos.Y = csbi.srWindow.Top + (row - 1);
1643 size.Y = scr.srWindow.Bottom - scr.srWindow.Top + 1;
1786 * but with saved scrolled-off-the-top lines. This way,
1921 rcClip.Top = csbi.srWindow.Top;
1929 /* Move the top left corner of the source window down one row. */
1931 new_org.Y = rcSrc.Top + 1;
1973 rcSrc.Top = csbi.srWindow.Top + n
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 181 // Allow the scheduler to force top-down or bottom-up scheduling. If neither
242 /// schedule the node at the top of the unscheduled region. Otherwise it will
254 /// top-down scheduling.
275 /// The top of the unscheduled zone.
323 MachineBasicBlock::iterator top() const { return CurrentTop; } function in class:llvm::ScheduleDAGMI
353 // Top-Level entry points for the schedule() driver...
400 // liveness during bottom-up scheduling. Top-down scheduling may proceed but
415 /// The top of the unscheduled zone.
442 /// Get current register pressure for the top scheduled instructions.
491 // Top-Level entry points for the schedule() driver..
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/xray/ |
| xray_function_call_trie.h | 396 // on the top of the stack.
434 const auto &Top = ShadowStack.back();
435 auto TopNode = Top.NodePtr;
442 // we've overflowed (TSC < Top.EntryTSC) and then account the difference
446 // a TSC of 0 and a Top.EntryTSC of 1 is (numeric_limits<uint64_t>::max()
452 Top.EntryTSC > TSC
453 ? (std::numeric_limits<uint64_t>::max() - Top.EntryTSC) + TSC
454 : TSC - Top.EntryTSC;
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachineScheduler.cpp | 82 cl::desc("Force top-down list scheduling"));
294 /// Decrement this iterator until reaching the top or a non-debug instr.
298 assert(I != Beg && "reached the top of the region, cannot decrement");
363 /// Top-level MachineScheduler pass driver.
555 // will be processed (MBB) top-down if initialized with true.
854 // A SUnit is ready to top schedule if it has no predecessors.
873 // Release top roots in forward order.
1010 // Setup the register pressure trackers for the top scheduled and bottom
1056 LLVM_DEBUG(dbgs() << "Top Pressure:\n";
1295 // Initialize top/bottom trackers after computing region pressure
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/XRay/ |
| Profile.cpp | 356 auto Top = TSD.back();
357 auto FunctionLocalTime = AbsoluteDifference(Top.Timestamp, E.TSC);
369 if (Top.FuncId == E.FuncId)
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| RegionStore.cpp | 405 /// the beginning of the analysis of the given top-level stack frame.
848 /// \p Top.
854 /// default bindings that may extend beyond \p Top itself, e.g. if \p Top is
859 const SubRegion *Top, BindingKey TopKey,
864 Top = TopKey.getConcreteOffsetRegion();
865 TopKey = BindingKey::Make(Top, BindingKey::Default);
870 SVal Extent = Top->getMemRegionManager().getStaticSize(Top, SVB);
877 } else if (const FieldRegion *FR = dyn_cast<FieldRegion>(Top)) {
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/util/ |
| process_docs.pl | 234 Top directory where the source files are found.
238 Top directory where the resulting files should end up
|
