| /external/v8/src/ |
| 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/chromium/base/memory/ |
| singleton_unittest.cc | 38 static Init5Singleton* New() {
39 Init5Singleton* instance = new Init5Singleton();
|
| /external/chromium_org/base/memory/ |
| singleton_unittest.cc | 37 static Init5Singleton* New() {
38 Init5Singleton* instance = new Init5Singleton();
|
| /external/chromium_org/content/test/plugin/ |
| plugin_geturl_test.cc | 56 NPError PluginGetURLTest::New(uint16 mode, int16 argc, const char* argn[],
81 return PluginTest::New(mode, argc, argn, argv, saved);
|
| plugin_windowless_test.cc | 80 NPError WindowlessPluginTest::New(uint16 mode, int16 argc,
83 NPError error = PluginTest::New(mode, argc, argn, argv, saved);
|
| /external/chromium_org/third_party/protobuf/src/google/protobuf/compiler/ |
| plugin.pb.cc | 51 new ::google::protobuf::internal::GeneratedMessageReflection(
67 new ::google::protobuf::internal::GeneratedMessageReflection(
84 new ::google::protobuf::internal::GeneratedMessageReflection(
145 CodeGeneratorRequest::default_instance_ = new CodeGeneratorRequest();
146 CodeGeneratorResponse::default_instance_ = new CodeGeneratorResponse();
147 CodeGeneratorResponse_File::default_instance_ = new CodeGeneratorResponse_File();
218 CodeGeneratorRequest* CodeGeneratorRequest::New() const {
219 return new CodeGeneratorRequest;
543 CodeGeneratorResponse_File* CodeGeneratorResponse_File::New() const {
544 return new CodeGeneratorResponse_File
[all...] |
| /external/chromium_org/third_party/protobuf/src/google/protobuf/ |
| descriptor_database_unittest.cc | 95 static DescriptorDatabaseTestCase* New() {
96 return new SimpleDescriptorDatabaseTestCase;
115 static DescriptorDatabaseTestCase* New() {
116 return new EncodedDescriptorDatabaseTestCase;
137 static DescriptorDatabaseTestCase* New() {
138 return new EncodedDescriptorDatabaseTestCase;
475 testing::Values(&SimpleDescriptorDatabaseTestCase::New));
477 testing::Values(&EncodedDescriptorDatabaseTestCase::New));
479 testing::Values(&DescriptorPoolDatabaseTestCase::New));
|
| dynamic_message.cc | 56 // Note on memory allocation: This module often calls "operator new()"
58 // "new uint8[]". This is because "operator new()" means "Give me some
59 // space which I can use as I please." while "new uint8[]" means "Give
204 Message* New() const;
212 // class's memory is allocated via the global operator new. Thus, we need to
246 // default values where appropriate. We use placement new to call
247 // constructors. If you haven't heard of placement new, I suggest Googling
248 // it now. We use placement new even for primitive types that don't have
249 // constructors for consistency. (In theory, placement new should be use
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| addressmap-inl.h | 225 Cluster* c = New<Cluster>(1);
257 template <class T> T* New(int num) {
275 hashtable_ = New<Cluster*>(kHashSize);
323 // Allocate a new batch of entries and add to free-list
324 Entry* array = New<Entry>(ALLOC_COUNT);
|
| page_heap.cc | 93 Span* PageHeap::New(Length n) {
459 StackTrace* t = Static::stacktrace_allocator()->New();
498 // Make sure pagemap_ has entries for all of the new pages.
502 // Pretend the new area is allocated and then Delete() it to cause
512 // TODO: Once we can return memory to the system, return the new span
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| addressmap-inl.h | 225 Cluster* c = New<Cluster>(1);
257 template <class T> T* New(int num) {
275 hashtable_ = New<Cluster*>(kHashSize);
323 // Allocate a new batch of entries and add to free-list
324 Entry* array = New<Entry>(ALLOC_COUNT);
|
| page_heap.cc | 93 Span* PageHeap::New(Length n) {
398 StackTrace* t = Static::stacktrace_allocator()->New();
436 // Make sure pagemap_ has entries for all of the new pages.
440 // Pretend the new area is allocated and then Delete() it to cause
449 // TODO: Once we can return memory to the system, return the new span
|
| /external/chromium_org/ui/base/l10n/ |
| l10n_util.cc | 73 "en-NZ", // English (New Zealand)
287 // Map Australian, Canadian, New Zealand and South African English
353 static std::vector<std::string>* New(void* instance) {
355 base::DefaultLazyInstanceTraits<std::vector<std::string> >::New(
|
| /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 | 77 // Allocate a new module.
78 ModuleFile *New = new ModuleFile(Type, Generation);
79 New->Index = Chain.size();
80 New->FileName = FileName.str();
81 New->File = Entry;
82 New->ImportLoc = ImportLoc;
83 Chain.push_back(New);
85 ModuleEntry = New;
91 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.getSValBuilder());
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...] |
| /external/llvm/include/llvm/ADT/ |
| ScopedHashTable.h | 65 ScopedHashTableVal *New = Allocator.template Allocate<ScopedHashTableVal>();
67 new (New) ScopedHashTableVal(key, val);
68 New->NextInScope = nextInScope;
69 New->NextForKey = nextForKey;
70 return New;
|
| /external/llvm/lib/IR/ |
| BasicBlock.cpp | 290 /// the new BB, and the rest of the instructions in the BB are moved to the new
305 BasicBlock *New = BasicBlock::Create(getContext(), BBName,
309 // the new basic block.
310 New->getInstList().splice(New->end(), this->getInstList(), I, end());
313 BranchInst::Create(New, this);
315 // Now we must loop through all of the successors of the New block (which
318 // know that incoming branches will be from New, not from Old.
320 for (succ_iterator I = succ_begin(New), E = succ_end(New); I != E; ++I)
[all...] |
| Instruction.cpp | 541 Instruction *New = clone_impl();
542 New->SubclassOptionalData = SubclassOptionalData;
544 return New;
547 // new one.
551 New->setMetadata(TheMDs[i].first, TheMDs[i].second);
553 New->setDebugLoc(getDebugLoc());
554 return New;
|
| Module.cpp | 47 ValSymTab = new ValueSymbolTable();
48 NamedMDSymTab = new StringMap<NamedMDNode *>();
145 Function *New = Function::Create(Ty, GlobalVariable::ExternalLinkage, Name);
146 if (!New->isIntrinsic()) // Intrinsics get attrs set on construction
147 New->setAttributes(AttributeList);
148 FunctionList.push_back(New);
149 return New; // Return the new prototype.
255 GlobalVariable *New =
256 new GlobalVariable(*this, Ty, false, GlobalVariable::ExternalLinkage
[all...] |
| /external/llvm/lib/Support/ |
| FoldingSet.cpp | 176 unsigned *New = Allocator.Allocate<unsigned>(Bits.size());
177 std::uninitialized_copy(Bits.begin(), Bits.end(), New);
178 return FoldingSetNodeIDRef(New, Bits.size());
253 // Clear out new buckets.
257 // Walk the old buckets, rehashing nodes into their new place.
267 // Insert the node into the new bucket, after recomputing the hash.
|
| /external/llvm/lib/Target/XCore/ |
| XCoreFrameLowering.cpp | 334 MachineInstr *New;
337 New=BuildMI(MF, Old->getDebugLoc(), TII.get(Opcode))
342 New=BuildMI(MF, Old->getDebugLoc(), TII.get(Opcode), XCore::SP)
346 // Replace the pseudo instruction with a new instruction...
347 MBB.insert(I, New);
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 171 AllocaInst *New = Builder->CreateAlloca(NewTy, 0, AI.getName());
172 New->setAlignment(AI.getAlignment());
177 BasicBlock::iterator It = New;
188 GetElementPtrInst::CreateInBounds(New, Idx, New->getName()+".sub");
242 return new BitCastInst(EntryAI, AI.getType());
330 return new BitCastInst(NewLoad, LI.getType());
375 // Insert a new store to null instruction before the load to indicate
379 new StoreInst(UndefValue::get(LI.getType()),
389 // Insert a new store to null instruction before the load to indicate tha
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCContract.cpp | 103 return new ObjCARCContract();
144 DEBUG(dbgs() << "New: " << *Retain << "\n");
197 DEBUG(dbgs() << " New Retain: "
253 Value *New = StripPointerCastsAndObjCCalls(Store->getValueOperand());
262 if (GetObjCArg(Retain) != New) return;
271 Value *Args[] = { Load->getPointerOperand(), New };
273 Args[0] = new BitCastInst(Args[0], I8XX, "", Store);
275 Args[1] = new BitCastInst(Args[1], I8X, "", Store);
411 new StoreInst(Null, CI->getArgOperand(0), CI);
414 << " New = " << *Null << "\n")
[all...] |
| /external/llvm/tools/bugpoint/ |
| CrashDebugger.cpp | 305 new UnreachableInst(BB->getContext(), BB);
324 Module *New = BD.runPassesOn(M, Passes);
326 if (!New) {
330 M = New;
|
