| /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/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/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/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/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/llvm/lib/Target/AMDGPU/ |
| AMDGPUUnifyDivergentExitNodes.cpp | 123 BasicBlock *Top = Stack.pop_back_val();
124 if (!DA.isUniform(Top->getTerminator()))
127 for (BasicBlock *Pred : predecessors(Top)) {
|
| GCNIterativeScheduler.cpp | 241 // scheduleRegions walks bottom to top, so its likely we just get next
364 auto Top = R.Begin;
367 if (MI != &*Top) {
369 BB->insert(Top, MI);
386 Top = std::next(MI->getIterator());
|
| R600ControlFlowFinalizer.cpp | 173 CFStack::StackItem Top = BranchStack.back();
174 if (Top == CFStack::ENTRY)
177 CurrentSubEntries-= getSubEntrySize(Top);
|
| SIISelLowering.cpp | 5156 SDValue Top = DAG.getNode(isSigned ? ISD::MULHS : ISD::MULHU,
5163 SDValue Overflow = DAG.getSetCC(SL, MVT::i1, Top, Sign, ISD::SETNE);
|
| /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/clang/lib/Basic/ |
| Module.cpp | 163 // FIXME: All missing headers are listed on the top-level module. Should we
273 auto *Top = getTopLevelModule();
275 // A top-level module implicitly uses itself.
276 if (Requested->isSubModuleOf(Top))
279 for (auto *Use : Top->DirectUses)
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| 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...] |
| 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() +
|
| HexagonConstPropagation.cpp | 111 enum { Normal, Top, Bottom };
127 LatticeCell() : Kind(Top), Size(0), IsSpecial(false) {
163 bool isTop() const { return Kind == Top; }
214 assert(Top.isTop());
234 return Top;
246 // To avoid creating "top" entries, return a const reference to
249 LatticeCell Top, Bottom;
465 // Corner case: converting a fresh (top) cell to "special".
466 // This can happen, when adding a property to a top cell.
506 os << "top";
[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/llvm/tools/llvm-xray/ |
| 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...] |
| 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...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
| ARMParallelDSP.cpp | 793 Value *Top = IRB.CreateLShr(WideLoad, ShiftVal);
794 Value *Trunc = IRB.CreateTrunc(Top, OffsetTy);
804 << *Top << "\n"
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| LegacyPassManager.cpp | 360 // Execute all the passes managed by this top level manager.
557 /// Initialize top level manager. Create first pass manager.
739 // top level manager. Set up analysis resolver to connect them.
820 // Print passes managed by this top level manager.
1333 // FPM is the top level manager.
1618 // FPP is the top level manager.
1666 // PM is the top level manager
1693 PMDataManager *Top = this->top();
1694 Top->initializeAnalysisInfo()
[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/external/apache2/llvm/dist/llvm/lib/Support/ |
| VirtualFileSystem.cpp | 1656 auto *Top = dyn_cast<yaml::MappingNode>(Root);
1657 if (!Top) {
1675 for (auto &I : *Top) {
1736 if (!checkMissingKeys(Top, Keys))
2349 assert(!State->Stack.top()->path().empty() && "non-canonical end iterator");
2355 if (State->Stack.top()->type() == sys::fs::file_type::directory_file) {
2356 vfs::directory_iterator I = FS->dir_begin(State->Stack.top()->path(), EC);
2364 while (!State->Stack.empty() && State->Stack.top().increment(EC) == End)
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AVR/ |
| AVRISelLowering.cpp | 566 // When doing lhs > -1 use a tst instruction on the top part of lhs
607 // When doing lhs < 0 use a tst instruction on the top part of lhs
652 SDValue Top = DAG.getNode(ISD::EXTRACT_ELEMENT, DL, MVT::i8, LHShi,
654 Cmp = DAG.getNode(AVRISD::TST, DL, MVT::Glue, Top);
690 SDValue Top = DAG.getNode(ISD::EXTRACT_ELEMENT, DL, MVT::i8, LHS3,
692 Cmp = DAG.getNode(AVRISD::TST, DL, MVT::Glue, Top);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/ |
| SystemZInstrInfo.cpp | 1676 uint64_t Top = (Mask >> First) + 1;
1677 if ((Top & -Top) == Top) {
1679 Length = findFirstSet(Top);
1705 assert(LSB + Length < BitSize && "Top bit must be set");
|
| /src/external/apache2/llvm/dist/llvm/tools/sancov/ |
| sancov.cpp | 378 yaml::MappingNode *Top = dyn_cast<yaml::MappingNode>(Root);
379 failIf(!Top, "expecting mapping node: " + InputFile);
381 for (auto &KVNode : *Top) {
|
| /src/external/apache2/llvm/dist/llvm/lib/Object/ |
| MachOObjectFile.cpp | 3029 NodeState &Top = Stack.back();
3030 CumulativeString.resize(Top.ParentStringLength);
3031 for (;*Top.Current != 0 && Top.Current < Trie.end(); Top.Current++) {
3032 char C = *Top.Current;
3035 if (Top.Current >= Trie.end()) {
3037 Twine::utohexstr(Top.Start - Trie.begin()) +
3038 " for child #" + Twine((int)Top.NextChildIndex) +
3043 Top.Current += 1
[all...] |
