| /external/clang/test/PCH/ |
| cxx-exprs.cpp | 14 class New {
15 New(const New&);
18 New *clone() {
19 return new New(*this);
25 New<int> *clone_new(New<int> *n) {
|
| /external/chromium/base/memory/ |
| singleton_objc.h | 23 // static Foo* New() {
43 static Type* New() {
|
| singleton.h | 15 // Default traits for Singleton<Type>. Calls operator new and operator delete on
21 static Type* New() {
24 return new Type();
78 static Type* New() {
84 new(ptr) Type();
220 Type* newval = Traits::New();
|
| singleton_unittest.cc | 38 static Init5Singleton* New() {
39 Init5Singleton* instance = new Init5Singleton();
|
| /external/clang/test/CXX/temp/temp.type/ |
| p1-0x.cpp | 14 namespace New {
|
| /external/v8/src/ |
| allocation-inl.h | 37 void* PreallocatedStorage::New(size_t size) {
|
| zone-inl.h | 42 inline void* Zone::New(int size) {
73 return static_cast<T*>(New(length * sizeof(T)));
97 // TODO(isolates): for performance reasons, this should be replaced with a new
100 void* ZoneObject::operator new(size_t size) {
101 return ZONE->New(static_cast<int>(size));
104 void* ZoneObject::operator new(size_t size, Zone* zone) {
105 return zone->New(static_cast<int>(size));
109 inline void* ZoneListAllocationPolicy::New(int size) {
110 return ZONE->New(size);
115 void* ZoneList<T>::operator new(size_t size)
[all...] |
| allocation.cc | 38 void* Malloced::New(size_t size) {
41 v8::internal::FatalProcessOutOfMemory("Malloced operator new");
61 void* Embedded::operator new(size_t size) {
72 void* AllStatic::operator new(size_t size) {
|
| global-handles.h | 49 static ObjectGroup* New(Object*** handles,
71 void* operator new(size_t size);
83 static ImplicitRefGroup* New(HeapObject** parent,
104 void* operator new(size_t size);
117 // Creates a new global handle that is alive until Destroy is called.
189 // guaranteed to contain all handles holding new space objects (but
268 // Contains all nodes holding new space objects. Note: when the list
|
| /external/qemu/distrib/sdl-1.2.15/src/main/symbian/EKA2/ |
| vectorbuffer.cpp | 41 TNodeBuffer::TNode* TNodeBuffer::TNode::New(TNode* aPred, const TDesC8& aData)
|
| /external/v8/test/cctest/ |
| test-list.cc | 38 static void* New(size_t size) {
145 List<int>* list = new List<int>(0);
|
| /external/llvm/lib/Transforms/Utils/ |
| CloneModule.cpp | 28 // Create the value map that maps things from the old module over to the new
35 // First off, we need to create the new module.
36 Module *New = new Module(M->getModuleIdentifier(), M->getContext());
37 New->setDataLayout(M->getDataLayout());
38 New->setTargetTriple(M->getTargetTriple());
39 New->setModuleInlineAsm(M->getModuleInlineAsm());
42 // new module. Here we add them to the VMap and to the new Module. We
47 GlobalVariable *GV = new GlobalVariable(*New,
[all...] |
| ValueMapper.cpp | 138 // Okay, we need to create a new constant. We've already processed some or
207 MDNode *New = MapValue(Old, VMap, Flags, TypeMapper);
208 if (New != Old)
209 I->setMetadata(MI->first, New);
|
| LoopUnroll.cpp | 62 /// Returns the new combined block.
275 BasicBlock *New = CloneBasicBlock(*BB, VMap, "." + Twine(It));
276 Header->getParent()->getBasicBlockList().push_back(New);
288 New->getInstList().erase(NewPHI);
292 LastValueMap[*BB] = New;
297 L->addBasicBlockToLoop(New, LI->getBase());
310 phi->addIncoming(Incoming, New);
313 // Keep track of new headers and latches as we create them, so that
316 Headers.push_back(New);
318 Latches.push_back(New);
[all...] |
| /external/protobuf/src/google/protobuf/ |
| repeated_field.cc | 47 elements_ = new void*[total_size_];
84 string* StringTypeHandlerBase::New() {
85 return new string;
|
| /external/chromium/base/ |
| lazy_instance.h | 39 #include <new> // For placement new.
53 static Type* New(void* instance) {
54 // Use placement new to initialize our instance in our preallocated space.
56 return new (instance) Type();
68 static Type* New(void* instance) {
69 return DefaultLazyInstanceTraits<Type>::New(instance);
138 instance_ = Traits::New(buf_);
146 // We suggest dynamic race detection tool that "Traits::New" above
|
| /external/ceres-solver/docs/ |
| changes.tex | 6 The new ordering API breaks existing code. Here the common case fixes.
31 options.ordering = new ceres::ParameterBlockOrdering;
39 \subsection{New Features}
41 \item A new richer, more expressive and consistent API for ordering
88 \subsection{New Features}
92 \item New subspace Dogleg Solver. (Markus Moll)
94 \item New loss functions \texttt{ArcTanLossFunction,
96 \item New \texttt{DENSE\_NORMAL\_CHOLESKY} linear solver, which uses Eigen's
100 \item New example \texttt{nist.cc} and data from the NIST non-linear
186 \subsection{New Features
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| IPConstantPropagation.cpp | 53 ModulePass *llvm::createIPConstantPropagationPass() { return new IPCP(); }
239 Value* New = RetVals[0];
240 if (Argument *A = dyn_cast<Argument>(New))
243 New = CS.getArgument(A->getArgNo());
244 Call->replaceAllUsesWith(New);
264 Value *New = RetVals[index];
265 if (New) {
266 if (Argument *A = dyn_cast<Argument>(New))
269 New = CS.getArgument(A->getArgNo());
270 Ins->replaceAllUsesWith(New);
[all...] |
| PruneEH.cpp | 58 Pass *llvm::createPruneEHPass() { return new PruneEH(); }
205 DeleteBasicBlock(UnwindBlock); // Delete the new BB.
217 // new BB.
218 BasicBlock *New = BB->splitBasicBlock(I);
222 new UnreachableInst(BB->getContext(), BB);
224 DeleteBasicBlock(New); // Delete the new BB.
|
| /external/llvm/lib/Target/MSP430/ |
| MSP430FrameLowering.cpp | 69 // Update FPW with the new base value...
245 MachineInstr *New = 0;
247 New = BuildMI(MF, Old->getDebugLoc(),
256 New = BuildMI(MF, Old->getDebugLoc(),
261 if (New) {
263 New->getOperand(3).setIsDead();
265 // Replace the pseudo instruction with a new instruction...
266 MBB.insert(I, New);
274 MachineInstr *New =
278 New->getOperand(3).setIsDead()
[all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelMatcherOpt.cpp | 44 Matcher *New = 0;
47 New = new RecordChildMatcher(MC->getChildNo(), RM->getWhatFor(),
53 New = new CheckChildTypeMatcher(MC->getChildNo(), CT->getType());
55 if (New) {
56 // Insert the new node.
57 New->setNext(MatcherPtr.take());
58 MatcherPtr.reset(New);
134 MatcherPtr.reset(new MorphNodeToMatcher(EN->getOpcodeName()
[all...] |
| /external/webkit/Source/WebCore/platform/network/cf/ |
| SocketStreamHandle.h | 49 static PassRefPtr<SocketStreamHandle> create(const KURL& url, SocketStreamHandleClient* client) { return adoptRef(new SocketStreamHandle(url, client)); }
101 enum ConnectingSubstate { New, ExecutingPACFile, WaitingForCredentials, WaitingForConnect, Connected };
|
| /external/clang/lib/Rewrite/Core/ |
| DeltaTree.cpp | 230 // Okay, this split the subtree, producing a new value and two children to
233 // Now that we have two nodes and a new element, insert the perclated value
235 // the new one.
301 // Create the new child node.
305 // into the new node.
306 DeltaTreeInteriorNode *New = new DeltaTreeInteriorNode();
307 memcpy(&New->Children[0], &IN->Children[WidthFactor],
309 NewNode = New;
311 // Just create the new leaf node
[all...] |
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 54 // Allocate a new module.
55 ModuleFile *New = new ModuleFile(Type, Generation);
56 New->Index = Chain.size();
57 New->FileName = FileName.str();
58 New->File = Entry;
59 New->ImportLoc = ImportLoc;
60 Chain.push_back(New);
62 ModuleEntry = New;
68 New->Buffer.reset(Buffer)
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 89 /// Construct a new RangeSet representing '{ [from, to] }'.
331 return new RangeConstraintManager(Eng, StMgr.getBasicVals());
387 // Lazily generate a new RangeSet representing all possible values for the
432 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Upper, Lower);
433 return New.isEmpty() ? NULL : St->set<ConstraintRange>(Sym, New);
447 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, AdjInt, AdjInt);
448 return New.isEmpty() ? NULL : St->set<ConstraintRange>(Sym, New);
476 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper)
[all...] |
