/external/chromium_org/content/test/plugin/ |
plugin_windowless_test.cc | 74 NPError WindowlessPluginTest::New(uint16 mode, int16 argc, 77 NPError error = PluginTest::New(mode, argc, argn, argv, saved);
|
/external/chromium_org/mojo/public/cpp/bindings/lib/ |
array_internal.h | 8 #include <new> 224 static Array_Data<T>* New(size_t num_elements, Buffer* buf) { 227 return new (buf->Allocate(num_bytes)) Array_Data<T>(num_bytes, 338 new (vec->at(i).buf) T(); 357 new (vec->at(i).buf) T(); 362 new (vec->at(old_size).buf) T(value.Pass()); 371 new (new_storage.at(i).buf) T(at(vec, i).Pass());
|
/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( 147 CodeGeneratorRequest::default_instance_ = new CodeGeneratorRequest(); 148 CodeGeneratorResponse::default_instance_ = new CodeGeneratorResponse(); 149 CodeGeneratorResponse_File::default_instance_ = new CodeGeneratorResponse_File(); 220 CodeGeneratorRequest* CodeGeneratorRequest::New() const { 221 return new CodeGeneratorRequest; 545 CodeGeneratorResponse_File* CodeGeneratorResponse_File::New() const { 546 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; 238 // default values where appropriate. We use placement new to call 239 // constructors. If you haven't heard of placement new, I suggest Googling 240 // it now. We use placement new even for primitive types that don't have 241 // constructors for consistency. (In theory, placement new should be used 248 new(OffsetToPointer(type_info_->unknown_fields_offset)) UnknownFieldSet [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 | 74 "en-NZ", // English (New Zealand) 268 static std::vector<std::string>* New(void* instance) { 270 base::DefaultLazyInstanceTraits<std::vector<std::string> >::New( 356 // Map Australian, Canadian, New Zealand and South African English
|
/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 | 80 // Allocate a new module. 81 ModuleFile *New = new ModuleFile(Type, Generation); 82 New->Index = Chain.size(); 83 New->FileName = FileName.str(); 84 New->File = Entry; 85 New->ImportLoc = ImportLoc; 86 Chain.push_back(New); 88 ModuleEntry = New; 90 New->InputFilesValidationTimestamp = 0 [all...] |
/external/clang/lib/StaticAnalyzer/Core/ |
RangeConstraintManager.cpp | 89 /// Construct a new RangeSet representing '{ [from, to] }'. 333 return new RangeConstraintManager(Eng, StMgr.getSValBuilder()); 389 // Lazily generate a new RangeSet representing all possible values for the 434 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Upper, Lower); 435 return New.isEmpty() ? nullptr : St->set<ConstraintRange>(Sym, New); 449 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, AdjInt, AdjInt); 450 return New.isEmpty() ? nullptr : St->set<ConstraintRange>(Sym, New); 478 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper) [all...] |
/external/clang/test/Parser/ |
DelayedTemplateParsing.cpp | 138 BitsetType::New(); 144 static void New() {
|
/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/Analysis/ |
BlockFrequencyInfoImpl.cpp | 174 // Fill in the new weights. 469 Scaled64 New = Loop.Scale * F; 470 DEBUG(dbgs() << " - " << BFI.getBlockName(N) << ": " << F << " => " << New 472 F = New;
|
/external/llvm/lib/IR/ |
BasicBlock.cpp | 294 /// the new BB, and the rest of the instructions in the BB are moved to the new 309 BasicBlock *New = BasicBlock::Create(getContext(), BBName, 313 // the new basic block. 314 New->getInstList().splice(New->end(), this->getInstList(), I, end()); 317 BranchInst::Create(New, this); 319 // Now we must loop through all of the successors of the New block (which 322 // know that incoming branches will be from New, not from Old. 324 for (succ_iterator I = succ_begin(New), E = succ_end(New); I != E; ++I) [all...] |
Instruction.cpp | 524 Instruction *New = clone_impl(); 525 New->SubclassOptionalData = SubclassOptionalData; 527 return New; 530 // new one. 534 New->setMetadata(MD.first, MD.second); 536 New->setDebugLoc(getDebugLoc()); 537 return New;
|
Module.cpp | 50 ValSymTab = new ValueSymbolTable(); 51 NamedMDSymTab = new StringMap<NamedMDNode *>(); 104 Function *New = Function::Create(Ty, GlobalVariable::ExternalLinkage, Name); 105 if (!New->isIntrinsic()) // Intrinsics get attrs set on construction 106 New->setAttributes(AttributeList); 107 FunctionList.push_back(New); 108 return New; // Return the new prototype. 204 GlobalVariable *New = 205 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/Transforms/ObjCARC/ |
ObjCARCContract.cpp | 104 return new ObjCARCContract(); 145 DEBUG(dbgs() << "New: " << *Retain << "\n"); 198 DEBUG(dbgs() << " New Retain: " 254 Value *New = StripPointerCastsAndObjCCalls(Store->getValueOperand()); 263 if (GetObjCArg(Retain) != New) return; 272 Value *Args[] = { Load->getPointerOperand(), New }; 274 Args[0] = new BitCastInst(Args[0], I8XX, "", Store); 276 Args[1] = new BitCastInst(Args[1], I8X, "", Store); 412 new StoreInst(Null, CI->getArgOperand(0), CI); 415 << " New = " << *Null << "\n") [all...] |
/external/llvm/lib/Transforms/Utils/ |
LoopUnroll.cpp | 68 /// Returns the new combined block. 298 BasicBlock *New = CloneBasicBlock(*BB, VMap, "." + Twine(It)); 299 Header->getParent()->getBasicBlockList().push_back(New); 311 New->getInstList().erase(NewPHI); 315 LastValueMap[*BB] = New; 320 L->addBasicBlockToLoop(New, LI->getBase()); 333 phi->addIncoming(Incoming, New); 336 // Keep track of new headers and latches as we create them, so that 339 Headers.push_back(New); 341 Latches.push_back(New); [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;
|
ExtractFunction.cpp | 126 Module *New = runPassesOn(Clone, Passes); 128 if (!New) { 132 return New; 152 Module *New = runPassesOn(M, CleanupPasses); 153 if (!New) { 158 return New; 162 /// ExtractLoop - Given a module, extract up to one loop from it into a new 177 // Check to see if we created any new functions. If not, no loops were 268 new GlobalVariable(*M1, M1Init->getType(), false, 280 new GlobalVariable(*M2, M2Init->getType(), false [all...] |
/external/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));
|