Searched refs:top (Results 1 - 25 of 1627) sorted by last modified time

1234567891011>>

/macosx-10.10/xnu-2782.1.97/
H A DMakefile22 export MakeInc_top=${VERSDIR}/makedefs/MakeInc.top
/macosx-10.10/xnu-2782.1.97/osfmk/vm/
H A Dvm_map.c203 vm_region_top_info_t top);
407 * are now "top level" maps (either task map, kernel map or submap
8437 * top object:
8447 * were in the top-level object.
9066 * Start over with this top-level entry.
9109 /* back to the top */
10119 /* ultimately be clipped in the top map will only need */
10536 * "curr_address" is the equivalent of the top map's "user_address"
10546 * we've traversed from the top map to the current map.
10763 * space (i.e. the top
11088 vm_region_top_info_t top; local
11135 vm_map_region_top_walk( vm_map_entry_t entry, vm_region_top_info_t top) argument
[all...]
/macosx-10.10/xnu-2782.1.97/osfmk/console/
H A Dvideo_console.c134 void (*clear_screen)(unsigned int xx, unsigned int yy, unsigned int top,
136 void (*scroll_down)(int num, unsigned int top, unsigned int bottom);
137 void (*scroll_up)(int num, unsigned int top, unsigned int bottom);
266 static void gc_clear_screen(unsigned int xx, unsigned int yy, int top,
286 static void gc_scroll_down(int num, unsigned int top, unsigned int bottom);
287 static void gc_scroll_up(int num, unsigned int top, unsigned int bottom);
327 gc_clear_screen(unsigned int xx, unsigned int yy, int top, unsigned int bottom, argument
342 start = (top * gc_buffer_columns);
346 start = (top * gc_buffer_columns);
360 gc_ops.clear_screen(xx, yy, top, botto
1032 gc_scroll_down(int num, unsigned int top, unsigned int bottom) argument
1141 gc_scroll_up(int num, unsigned int top, unsigned int bottom) argument
[all...]
/macosx-10.10/xnu-2782.1.97/bsd/sys/
H A Dsocketvar.h696 struct mbuf *top, struct mbuf *control, int flags);
698 u_int uiocnt, struct mbuf *top, struct mbuf *control, int flags);
/macosx-10.10/xnu-2782.1.97/bsd/kern/
H A Duipc_mbuf.c526 * Number of top leakers recorded.
3136 mcache_obj_t *top = NULL; local
3137 mcache_obj_t **list = ⊤
3159 if (top != NULL)
3160 (void) cslab_free(class, top, 1);
3772 struct mbuf **np, *top; local
3791 top = NULL;
3792 np = ⊤
3861 if (top != NULL)
3862 m_freem_list(top);
3892 struct mbuf **np, *top, *first = NULL; local
4253 struct mbuf **np, *top; local
4537 struct mbuf *top; local
4659 struct mbuf *top = NULL; local
5112 struct mbuf *top = NULL, **mp = ⊤ local
5631 struct mbuf *top; local
5727 struct mbuf *top = NULL; local
5782 struct mbuf *top = NULL; local
[all...]
H A Duipc_socket2.c1792 * the top of the tree from the body by keeping track
1796 * top of the tree and the pruned area is released via
2148 struct mbuf *top, struct mbuf *control, int flags)
2150 #pragma unused(so, addr, uio, top, control, flags)
2156 u_int uiocnt, struct mbuf *top, struct mbuf *control, int flags)
2158 #pragma unused(so, addr, uio, uiocnt, top, control, flags)
2147 pru_sosend_notsupp(struct socket *so, struct sockaddr *addr, struct uio *uio, struct mbuf *top, struct mbuf *control, int flags) argument
2155 pru_sosend_list_notsupp(struct socket *so, struct sockaddr *addr, struct uio **uio, u_int uiocnt, struct mbuf *top, struct mbuf *control, int flags) argument
/macosx-10.10/xnu-2782.1.97/bsd/dev/dtrace/
H A Ddtrace.c1723 top:
1765 * send us back to top.
1814 goto top;
1860 goto top;
1872 goto top;
2204 * power of one plus the high magnitude -- return the top bucket.
7021 top:
7081 goto top;
7098 goto top;
10779 * We're going to be storing at the top o
[all...]
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Utils/
H A DPromoteMemoryToRegister.cpp773 DomTreeNodePair RootPair = PQ.top();
/macosx-10.10/llvmCore-3425.0.34/lib/VMCore/
H A DPassManager.cpp472 /// Initialize top level manager. Create first pass manager.
641 // top level manager. Set up analysis resolver to connect them.
709 // Print passes managed by this top level manager.
1349 // FPM is the top level manager.
1441 // Execute all the passes managed by this top level manager.
1613 // FPP is the top level manager.
1665 // PM is the top level manager
1724 PMDataManager *Top = this->top();
1730 // Push PM on the stack and set its top level manager.
1736 assert(PM->getPassManagerType() > this->top()
[all...]
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Instrumentation/
H A DPathProfiling.cpp589 BallLarusNode* node = dfsStack.top();
1126 BLInstrumentationEdge* top = local
1131 assert( top->isInitialization() && " Top phony edge did not"
1160 instrumentNode->setStartingPathNumber(createIncrementConstant(top));
1162 instrumentNode->setEndingPathNumber(createIncrementConstant(top));
1165 if( top->isCounterIncrement() ) {
/macosx-10.10/llvmCore-3425.0.34/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp516 /// Pick the best candidate from the top queue.
520 /// maintain the number of vreg uses remaining to be top-scheduled.
529 // BestSU remains NULL if no top candidates beat the best existing candidate.
566 /// Pick the best candidate node from either the top or bottom queue.
595 // Check if the top Q has a better candidate.
626 if (DAG->top() == DAG->bottom()) {
/macosx-10.10/llvmCore-3425.0.34/lib/Support/
H A Dregcomp.c254 - p_ere - ERE parser top level, concatenation and alternation
455 - p_bre - BRE parser top level, anchoring and concatenation
1092 cset *top = &p->g->sets[p->g->ncsets]; local
1097 if (cs == top-1) /* recover only the easy case */
1115 cset *top = &p->g->sets[p->g->ncsets]; local
1120 for (cs2 = &p->g->sets[0]; cs2 < top; cs2++)
1130 if (cs2 < top) { /* found one */
H A Dregengine.inc680 - fast - step through the string at top speed
/macosx-10.10/llvmCore-3425.0.34/lib/CodeGen/
H A DMachineScheduler.cpp37 cl::desc("Force top-down list scheduling"));
138 /// Decrement this iterator until reaching the top or a non-debug instr.
141 assert(I != Beg && "reached the top of the region, cannot decrement");
268 // scheduler for the top of it's scheduled region.
397 // Setup the register pressure trackers for the top scheduled top and bottom
505 // Initialize top/bottom trackers after computing region pressure.
522 // A SUnit is ready to top schedule if it has no predecessors.
569 // Update top scheduled pressure.
714 // State of the top an
[all...]
H A DRegAllocBasic.cpp100 LiveInterval *LI = Queue.top();
H A DRegAllocGreedy.cpp427 LiveInterval *LI = &LIS->getInterval(~Queue.top().second);
/macosx-10.10/llvmCore-3425.0.34/lib/Analysis/IPA/
H A DCallGraphSCCPass.cpp438 // At the top level, we run all the passes in this pass manager on the
534 PMS.top()->getPassManagerType() > PMT_CallGraphPassManager)
540 if (PMS.top()->getPassManagerType() == PMT_CallGraphPassManager)
541 CGP = (CGPassManager*)PMS.top();
545 PMDataManager *PMD = PMS.top();
550 // [2] Set up new manager's top level manager
/macosx-10.10/llvmCore-3425.0.34/lib/Analysis/
H A DLazyValueInfo.cpp459 std::pair<BasicBlock*, Value*> &e = BlockValueStack.top();
461 assert(BlockValueStack.top() == e);
H A DLoopPass.cpp112 // This is top level loop.
318 PMS.top()->getPassManagerType() > PMT_LoopPassManager)
324 if (PMS.top()->getPassManagerType() == PMT_LoopPassManager &&
325 !PMS.top()->preserveHigherLevelAnalysis(this))
334 PMS.top()->getPassManagerType() > PMT_LoopPassManager)
338 if (PMS.top()->getPassManagerType() == PMT_LoopPassManager)
339 LPPM = (LPPassManager*)PMS.top();
343 PMDataManager *PMD = PMS.top();
349 // [2] Set up new manager's top level manager
H A DPathNumbering.cpp366 BallLarusNode* currentNode = dfsStack.top();
H A DRegionPass.cpp222 PMS.top()->getPassManagerType() > PMT_RegionPassManager)
229 if (PMS.top()->getPassManagerType() == PMT_RegionPassManager &&
230 !PMS.top()->preserveHigherLevelAnalysis(this))
239 PMS.top()->getPassManagerType() > PMT_RegionPassManager)
245 if (PMS.top()->getPassManagerType() == PMT_RegionPassManager)
246 RGPM = (RGPassManager*)PMS.top();
250 PMDataManager *PMD = PMS.top();
256 // [2] Set up new manager's top level manager
/macosx-10.10/llvmCore-3425.0.34/include/llvm/
H A DPassManagers.h40 // PassManager and FunctionPassManager are two top-level pass manager that
47 // Two top level managers, PassManager and FunctionPassManager, derive from
48 // PMTopLevelManager. PMTopLevelManager manages information used by top level
70 // FunctionPassManagerImpl is a top level manager. It manages FPPassManagers
88 // PassManagerImpl is a top level pass manager responsible for managing
151 PMDataManager *top() const { return S.back(); } function in class:llvm::PMStack
166 /// top level pass managers.
218 // maintained by this top level pass manager
223 // Print passes managed by this top level manager.
250 /// Immutable passes are managed by top leve
[all...]
/macosx-10.10/llvmCore-3425.0.34/include/llvm/Support/
H A DFileSystem.h807 if (State->Stack.top() == directory_iterator())
818 if ((ec = State->Stack.top()->status(st))) return *this;
820 State->Stack.push(directory_iterator(*State->Stack.top(), ec));
822 if (State->Stack.top() != end_itr) {
831 && State->Stack.top().increment(ec) == end_itr) {
843 const directory_entry &operator*() const { return *State->Stack.top(); }
844 const directory_entry *operator->() const { return &*State->Stack.top(); }
867 && State->Stack.top().increment(ec) == end_itr);
/macosx-10.10/llvmCore-3425.0.34/include/llvm/CodeGen/
H A DMachineScheduler.h118 /// schedule the node at the top of the unscheduled region. Otherwise it will
127 /// top-down scheduling.
215 /// The top of the unscheduled zone.
253 MachineBasicBlock::iterator top() const { return CurrentTop; } function in class:llvm::ScheduleDAGMI
269 /// Get current register pressure for the top scheduled instructions.
289 /// region, TopTracker and BottomTracker will be initialized to the top and
/macosx-10.10/llvmCore-3425.0.34/examples/OCaml-Kaleidoscope/Chapter4/
H A Dtoplevel.ml8 (* top ::= definition | external | expression | ';' *)
13 (* ignore top-level semicolons. *)
30 (* Evaluate a top-level expression into an anonymous function. *)
32 print_endline "parsed a top-level expr";

Completed in 502 milliseconds

1234567891011>>