| /external/clang/include/clang/Basic/ |
| AddressSpaces.h | 32 Last,
33 Count = Last-Offset
|
| /external/clang/utils/TableGen/ |
| ClangASTNodesEmitter.cpp | 22 // Returns the first and last non-abstract subrecords
32 Record *First = 0, *Last = 0;
36 First = Last = Base;
61 Last = Result.second;
64 Last = R;
75 assert (Last && "Got a first node but not a last node for a range!");
81 << Last->getName() << ")\n\n";
84 return std::make_pair(First, Last);
95 << macroName(Root.getName()) << "_RANGE(Base, First, Last)\n"
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionAliasAnalysis.cpp | 97 const SCEV *Last = A->getOperand(A->getNumOperands()-1);
98 if (Last->getType()->isPointerTy())
99 return GetBaseValue(Last);
|
| /external/webrtc/src/system_wrappers/source/ |
| map.cc | 84 MapItem* MapWrapper::Last() const
|
| list_no_stl.cc | 126 ListItem* ListWrapper::Last() const
|
| list_stl.cc | 131 ListItem* ListWrapper::Last() const
137 // std::list::end() addresses the last item + 1. Decrement so that the
138 // actual last is accessed.
|
| map_no_stl.cc | 92 // 3. Item should be inserted last
122 MapNoStlItem* MapNoStl::Last() const
|
| list_unittest.cc | 56 ListItem* Last() const {
57 return list_.Last();
212 return Erase(list_.Last());
356 for (ListItem* item = ascending_list->Last(); item != NULL;
383 ascending_list->Last()));
409 ListItem* item = descending_list->Last();
455 ListItem* item = ascending_list->Last();
|
| /external/chromium/testing/gtest/samples/ |
| sample3-inl.h | 109 // Gets the last element of the queue, or NULL if the queue is empty.
110 QueueNode<E>* Last() { return last_; }
111 const QueueNode<E>* Last() const { return last_; }
165 QueueNode<E>* last_; // The last node of the queue.
|
| /external/clang/lib/AST/ |
| TypeLoc.cpp | 121 TypeLoc Last;
125 if (!Last)
126 Last = Cur;
127 return Last.getLocalSourceRange().getEnd();
135 Last = Cur;
143 if (!Last)
144 Last = Cur;
|
| /external/gtest/samples/ |
| sample3-inl.h | 109 // Gets the last element of the queue, or NULL if the queue is empty.
110 QueueNode<E>* Last() { return last_; }
111 const QueueNode<E>* Last() const { return last_; }
165 QueueNode<E>* last_; // The last node of the queue.
|
| /external/protobuf/gtest/samples/ |
| sample3-inl.h | 109 // Gets the last element of the queue, or NULL if the queue is empty.
110 QueueNode<E> * Last() { return last_; }
111 const QueueNode<E> * Last() const { return last_; }
165 QueueNode<E> * last_; // The last node of the queue.
|
| /external/clang/test/SemaTemplate/ |
| example-dynarray.cpp | 16 dynarray() { Start = Last = End = 0; }
20 Last = End = Start + other.size();
44 Last = End = NewStart + other.size();
48 unsigned size() const { return Last - Start; }
54 --Last;
55 Last->~T();
72 iterator end() { return Last; }
73 const_iterator end() const { return Last; }
91 T* Start, *Last, *End;
96 if (Last == End)
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/ |
| armVCM4P2_DecodeVLCZigzag_AC_unsafe_s.s | 75 Last RN 7
111 MOV Last,#0
118 STM pDst!,{temp2,temp1,Last,LR}
120 STM pDst!,{temp2,temp1,Last,LR}
122 STM pDst!,{temp2,temp1,Last,LR}
124 STM pDst!,{temp2,temp1,Last,LR}
126 STM pDst!,{temp2,temp1,Last,LR}
128 STM pDst!,{temp2,temp1,Last,LR}
130 STM pDst!,{temp2,temp1,Last,LR}
131 STM pDst!,{temp2,temp1,Last,LR
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/ |
| armVCM4P2_DecodeVLCZigzag_AC_unsafe_s.s | 75 Last RN 7
111 MOV Last,#0
118 STM pDst!,{temp2,temp1,Last,LR}
120 STM pDst!,{temp2,temp1,Last,LR}
122 STM pDst!,{temp2,temp1,Last,LR}
124 STM pDst!,{temp2,temp1,Last,LR}
126 STM pDst!,{temp2,temp1,Last,LR}
128 STM pDst!,{temp2,temp1,Last,LR}
130 STM pDst!,{temp2,temp1,Last,LR}
131 STM pDst!,{temp2,temp1,Last,LR
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporterVisitors.cpp | 122 const ExplodedNode *Node = N, *Last = NULL;
130 // Record the last seen initialization point.
131 Last = Node;
142 if (!Node || !Last) {
147 StoreSite = Last;
400 // Registers every VarDecl inside a Stmt with a last store visitor.
|
| BugReporter.cpp | 400 // The last message on the path to final bug is the most important
[all...] |
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.h | 34 SlotIndex Last;
198 /// last - Return the ending index of the last interfering range in the
200 SlotIndex last() { function in class:llvm::InterferenceCache::Cursor
201 return Current->Last;
|
| SplitKit.cpp | 91 // If CurLI is live into a landing pad successor, move the last split point
204 // This block has uses. Find the first and last uses in the block.
512 SlotIndex Last = End.getPrevSlot();
513 DEBUG(dbgs() << " enterIntvAtEnd BB#" << MBB.getNumber() << ", " << Last);
514 VNInfo *ParentVNI = Edit->getParent().getVNInfoAt(Last);
520 VNInfo *VNI = defFromParent(OpenIdx, ParentVNI, Last, MBB,
801 SlotIndex Last = LIS.getMBBEndIdx(Dom.first).getPrevSlot();
803 defFromParent(0, ParentVNI, Last, *Dom.first,
909 // This block needs a live-in value. The last block covered may not
[all...] |
| /external/llvm/lib/ExecutionEngine/Interpreter/ |
| ExternalFunctions.cpp | 357 char Last = *FB++ = *FmtStr++;
359 while (Last != 'c' && Last != 'd' && Last != 'i' && Last != 'u' &&
360 Last != 'o' && Last != 'x' && Last != 'X' && Last != 'e' &&
361 Last != 'E' && Last != 'g' && Last != 'G' && Last != 'f' &
[all...] |
| /external/clang/test/SemaCXX/ |
| enum-scoped.cpp | 180 Enum() : m_e(E::Last) {}
184 enum eCOLORS { Last };
|
| /external/llvm/include/llvm/ADT/ |
| ilist.h | 118 ilist_iterator<NodeTy> /*last*/) {}
307 /// of the first node in the list always points to the last node in the list,
470 // [first, last) into position.
472 void transfer(iterator position, iplist &L2, iterator first, iterator last) {
473 assert(first != last && "Should be checked by callers");
475 if (position != last) {
483 // Remove [first, last) from its old position.
485 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next);
492 // Splice [first, last) into its new position
557 iterator last = first; ++last; local
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.h | 251 First(F), Last(L), SValue(SV), HeaderBB(H), Emitted(E) {}
253 APInt Last;
423 /// references that ned to refer to the last resulting block.
424 void UpdateSplitBlock(MachineBasicBlock *First, MachineBasicBlock *Last);
|
| /external/chromium/sdch/open-vcdiff/src/gtest/src/ |
| gtest-internal-inl.h | 154 // element and a pointer to the next node. The last node in the list
230 // Gets the last element of the list, or NULL if the list is empty.
231 ListNode<E> * Last() { return last_; }
232 const ListNode<E> * Last() const { return last_; }
371 ListNode<E>* last_; // The last node of the list.
[all...] |
| /external/tinyxml/ |
| tinyxml.h | 260 a pointer just past the last character of the name,
491 const TiXmlNode* LastChild() const { return lastChild; } /// The last child of this node. Will be null if there are no children.
493 const TiXmlNode* LastChild( const char * value ) const; /// The last child of this node matching 'value'. Will be null if there are no children.
824 const TiXmlAttribute* Last() const { return ( sentinel.prev == &sentinel ) ? 0 : sentinel.prev; }
825 TiXmlAttribute* Last() { return ( sentinel.prev == &sentinel ) ? 0 : sentinel.prev; }
[all...] |
