/external/llvm/include/llvm/ADT/ |
DepthFirstIterator.h | 75 // VisitStack - Used to maintain the ordering. Top = current block 103 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back(); 104 NodeType *Node = Top.first.getPointer(); 105 ChildItTy &It = Top.second; 106 if (!Top.first.getInt()) { 109 Top.first.setInt(1);
|
/external/openfst/src/include/fst/extensions/pdt/ |
pdt.h | 45 // 'nodes_'. Each node represents the top of some stack and is 47 // the stack with the top 'popped' and its children are stored in 80 // label is a close parenthesis that matches the top of the stack, 110 // Returns the stack ID obtained by "popping" the label at the top 116 // Returns the paren ID at the top of the stack for 'stack_id' 117 ssize_t Top(StackId stack_id) const {
|
/external/openfst/src/include/fst/ |
heap.h | 48 // \param whether heap top should be max or min element w.r.t. Compare 96 T top = A_[0]; local 101 return top; 106 T Top() const {
|
replace.h | 704 const PrefixTuple& top = stack.Top(); local 706 StateTuple(prefix_id, top.fst_id, top.nextstate)); 818 const PrefixTuple& Top() const { [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
heap.h | 98 T Top() const {
|
replace.h | 309 const PrefixTuple& top = stack.Top(); local 312 FindState(StateTuple(prefix_id, top.fst_id, top.nextstate)); 413 const PrefixTuple& Top() const {
|
/external/jmonkeyengine/engine/src/core/com/jme3/font/ |
BitmapFont.java | 75 * Align text on the top of the text block
77 Top,
|
/external/llvm/lib/Transforms/Utils/ |
BasicBlockUtils.cpp | 268 // If the successor only has a single pred, split the top of the successor 620 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back(); 621 const BasicBlock *ParentBB = Top.first; 622 succ_const_iterator &I = Top.second;
|
/external/v8/src/ |
store-buffer.h | 98 Object*** Top() { return reinterpret_cast<Object***>(old_top_); } 99 void SetTop(Object*** top) { 100 ASSERT(top >= Start()); 101 ASSERT(top <= Limit()); 102 old_top_ = reinterpret_cast<Address*>(top);
|
hydrogen.h | 476 HValue* Top() const { return ExpressionStackAt(0); } 493 // environment is the outer environment but the top expression stack 940 HValue* Top() const { return environment()->Top(); } [all...] |
/external/valgrind/tsan/ |
ts_util.h | 321 const char *Top() {
|
ts_pin.cc | 129 // and if the top contains the current SP. If yes -- this is the function return 152 Top()->callback = callback; 153 Top()->pc = pc; 154 Top()->sp = sp; 155 Top()->arg[0] = a0; 156 Top()->arg[1] = a1; 164 InstrumentedCallFrame *Top() { [all...] |
/external/giflib/ |
gif_lib.h | 79 GifWord Left, Top, Width, Height, /* Current image dimensions. */
|
/external/llvm/lib/Target/Hexagon/ |
HexagonMachineScheduler.h | 55 /// schedule the node at the top of the unscheduled region. Otherwise it will 64 /// top-down scheduling. 210 /// The top of the unscheduled zone. 246 MachineBasicBlock::iterator top() const { return CurrentTop; } function in class:llvm::VLIWMachineScheduler 263 /// Get current register pressure for the top scheduled instructions. 393 // State of the top and bottom scheduled instruction boundaries. 394 SchedBoundary Top; 398 /// SUnit::NodeQueueId: 0 (none), 1 (top), 2 (bot), 3 (both) 406 DAG(0), TRI(0), Top(TopQID, "TopQ"), Bot(BotQID, "BotQ") {}
|
/external/llvm/lib/CodeGen/ |
MachineScheduler.cpp | 39 cl::desc("Force top-down list scheduling")); 139 /// Decrement this iterator until reaching the top or a non-debug instr. 142 assert(I != Beg && "reached the top of the region, cannot decrement"); 161 /// Top-level MachineScheduler pass driver. 269 // scheduler for the top of it's scheduled region. 304 /// schedule the node at the top of the unscheduled region. Otherwise it will 312 /// top-down scheduling. 344 /// The top of the unscheduled zone. 374 MachineBasicBlock::iterator top() const { return CurrentTop; } function in class:__anon10230::ScheduleDAGMI 389 /// Get current register pressure for the top scheduled instructions [all...] |
/external/llvm/lib/VMCore/ |
PassManager.cpp | 472 /// 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. [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/parse-only/ |
prototype-1.6.0.3.js | [all...] |
/external/clang/lib/Sema/ |
SemaInit.cpp | [all...] |