| /external/protobuf/src/google/protobuf/ |
| 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
192 Message* New() const;
226 // default values where appropriate. We use placement new to call
227 // constructors. If you haven't heard of placement new, I suggest Googling
228 // it now. We use placement new even for primitive types that don't have
229 // constructors for consistency. (In theory, placement new should be used
236 new(OffsetToPointer(type_info_->unknown_fields_offset)) UnknownFieldSet
[all...] |
| repeated_field.h | 98 // Resize the RepeatedField to a new, smaller size. This is O(1).
164 // static Type* New();
271 static GenericType* New() { return new GenericType; }
297 static string* New();
574 // Avoid inlining of Reserve(): new, memcpy, and delete[] lead to a significant
582 elements_ = new Element[total_size_];
655 typename TypeHandler::Type* result = TypeHandler::New();
735 // Make room for the new pointer.
[all...] |
| /external/chromium_org/base/metrics/ |
| stats_table.cc | 51 // shared-memory table only, and is used when we create new counters (e.g.
52 // use rows) or when we register new threads (e.g. use columns). Reading
100 // Construct a new Internal based on expected size parameters, or
102 static Internal* New(const StatsTable::TableIdentifier& table,
136 // Constructor is private because you should use New() instead.
172 StatsTable::Internal* StatsTable::Internal::New(
184 scoped_ptr<Internal> internal(new Internal(shared_memory.release()));
205 return new SharedMemory(table, false);
208 scoped_ptr<SharedMemory> shared_memory(new SharedMemory());
213 scoped_ptr<SharedMemory> shared_memory(new SharedMemory())
[all...] |
| /external/chromium_org/v8/src/ |
| execution.cc | 153 MaybeHandle<Object> Execution::New(Handle<JSFunction> func,
601 ASSIGN_RETURN_ON_EXCEPTION(isolate, result, New(cons, 0, NULL), JSObject);
|
| types.h | 272 static TypeImpl* type() { return BitsetType::New(BitsetType::k##type); } \
274 return BitsetType::New(BitsetType::k##type, region); \
280 return ClassType::New(map, region);
283 return ConstantType::New(value, region);
286 return ContextType::New(outer, region);
289 return ArrayType::New(element, region);
293 return FunctionType::New(result, receiver, arity, region);
484 static TypeImpl* New(int bitset) {
487 static TypeHandle New(int bitset, Region* region) {
554 static TypeHandle New(Tag tag, int length, Region* region)
[all...] |
| /external/clang/lib/AST/ |
| DeclTemplate.cpp | 65 return new (Mem) TemplateParameterList(TemplateLoc, LAngleLoc, Params,
193 Expr *E = new (Context) DeclRefExpr(NTTP, /*enclosing*/ false,
199 E = new (Context) PackExpansionExpr(Context.DependentTy, E,
232 return new (C, DC) FunctionTemplateDecl(C, DC, L, Name, Params, Decl);
237 return new (C, ID) FunctionTemplateDecl(C, nullptr, SourceLocation(),
243 Common *CommonPtr = new (C) Common;
286 = new (getASTContext()) TemplateArgument[Params->size()];
310 ClassTemplateDecl *New = new (C, DC) ClassTemplateDecl(C, DC, L, Name,
312 New->setPreviousDecl(PrevDecl)
[all...] |
| /external/llvm/lib/Target/XCore/ |
| XCoreFrameLowering.cpp | 508 MachineInstr *New;
511 New=BuildMI(MF, Old->getDebugLoc(), TII.get(Opcode))
516 New=BuildMI(MF, Old->getDebugLoc(), TII.get(Opcode), XCore::SP)
520 // Replace the pseudo instruction with a new instruction...
521 MBB.insert(I, New);
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 183 AllocaInst *New = Builder->CreateAlloca(NewTy, nullptr, AI.getName());
184 New->setAlignment(AI.getAlignment());
189 BasicBlock::iterator It = New;
201 GetElementPtrInst::CreateInBounds(New, Idx, New->getName() + ".sub");
255 return new BitCastInst(EntryAI, AI.getType());
350 return new AddrSpaceCastInst(NewLoad, LI.getType());
353 return new BitCastInst(NewLoad, LI.getType());
398 // Insert a new store to null instruction before the load to indicate
402 new StoreInst(UndefValue::get(LI.getType())
[all...] |
| InstCombineSimplifyDemanded.cpp | 482 CastInst *NewCast = new ZExtInst(I->getOperand(0), VTy, I->getName());
650 // Compute the new bits that are at the top now.
692 // Compute the new bits that are at the top now.
711 } else if ((KnownOne & SignBit) != 0) { // New bits are known one.
[all...] |
| InstCombineVectorOps.cpp | 161 // Insert the new instruction into the predecessor basic block.
221 return new BitCastInst(Elt, EI.getType());
571 return new ShuffleVectorInst(LR.first, LR.second,
666 /// Rebuild a new instruction just like 'I' but with the new operands given.
692 BinaryOperator *New =
696 New->setHasNoUnsignedWrap(BO->hasNoUnsignedWrap());
697 New->setHasNoSignedWrap(BO->hasNoSignedWrap());
700 New->setIsExact(BO->isExact());
703 New->copyFastMathFlags(I)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LICM.cpp | 217 Pass *llvm::createLICMPass() { return new LICM(); }
240 CurAST = new AliasSetTracker(*AA);
545 Instruction *New = I.clone();
546 ExitBlock.getInstList().insert(ExitBlock.getFirstInsertionPt(), New);
547 if (!I.getName().empty()) New->setName(I.getName() + ".le");
556 for (User::op_iterator OI = New->op_begin(), OE = New->op_end(); OI != OE;
568 return New;
604 Instruction *New;
607 New = It->second
[all...] |
| Reassociate.cpp | 232 FunctionPass *llvm::createReassociatePass() { return new Reassociate(); }
439 /// you MUST either replace I with a new expression computed from the Ops array,
472 /// caller MUST either replace 'I' with a new expression or use something like
584 // exactly one such use, drop this new use of the leaf.
678 // new expression can usually be written reusing the existing binary operators
679 // from the original expression tree, without creating any new instructions,
681 // We take care to not change anything if the new expression will be the same
687 /// the new expression into.
692 /// NotRewritable - The operands being written will be the leaves of the new
734 // The new operation differs non-trivially from the original. Overwrit
[all...] |
| JumpThreading.cpp | 147 FunctionPass *llvm::createJumpThreadingPass() { return new JumpThreading(); }
[all...] |
| LoopUnswitch.cpp | 121 // Note, that new loop data is stored inside the VMap.
225 // New loop.
259 // Be careful. This links are good only before new loop addition.
295 // Note, that new loop data is stored inside the VMap.
313 // for new loop switches we clone info about values that was
336 return new LoopUnswitch(Os);
344 // We started analyze new instruction, increment scanned instructions counter.
548 /// code duplications (equivalently, it produces a simpler loop and a new empty
659 Loop *New = new Loop()
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 216 /// updated to point to the new instruction.
223 // Insert the new instruction into the basic block...
224 BasicBlock::iterator New = BIL.insert(BI, I);
230 BI = New;
270 /// to a new block. The two blocks are joined by an unconditional branch and
277 BasicBlock *New = Old->splitBasicBlock(SplitIt, Old->getName()+".split");
279 // The new block lives in whichever loop the old one did. This preserves
283 L->addBasicBlockToLoop(New, LI->getBase());
288 // Old dominates New. New node dominates all other nodes dominated by Old
[all...] |
| CodeExtractor.cpp | 1 //===- CodeExtractor.cpp - Pull code region into a new function -----------===//
11 // individual loop or a parallel section, into a new function, replacing it with
12 // a call to the new function.
218 // We only want to code extract the second block now, and it becomes the new
225 // Okay, update dominator sets. The blocks that dominate the new one are the
226 // blocks that dominate TIBB plus the new block itself.
231 // region to go to the new header block instead of the old header block.
246 // Create a new PHI node in the new region, which has an incoming value
269 BasicBlock *New = (*I)->splitBasicBlock(RI, (*I)->getName()+".ret")
[all...] |
| /external/llvm/tools/bugpoint/ |
| Miscompilation.cpp | 337 Module *New = TestMergedProgram(BD, ToOptimizeLoopExtracted, ToNotOptimize,
339 if (!New)
342 // Delete the original and set the new program.
343 Module *Old = BD.swapProgramIn(New);
536 if (Module *New = BD.ExtractMappedBlocksFromModule(BBsOnClone, ToOptimize)) {
540 bool Ret = TestFn(BD, New, ToNotOptimize, Error);
623 // Set the new program and delete the old one.
740 Module *New = TestMergedProgram(BD, Optimized, Safe, true, Error, Broken);
741 if (New) {
743 // Delete the original and set the new program
[all...] |
| /external/protobuf/src/google/protobuf/compiler/ |
| plugin.pb.cc | 45 new ::google::protobuf::internal::GeneratedMessageReflection(
61 new ::google::protobuf::internal::GeneratedMessageReflection(
78 new ::google::protobuf::internal::GeneratedMessageReflection(
139 CodeGeneratorRequest::default_instance_ = new CodeGeneratorRequest();
140 CodeGeneratorResponse::default_instance_ = new CodeGeneratorResponse();
141 CodeGeneratorResponse_File::default_instance_ = new CodeGeneratorResponse_File();
213 CodeGeneratorRequest* CodeGeneratorRequest::New() const {
214 return new CodeGeneratorRequest;
539 CodeGeneratorResponse_File* CodeGeneratorResponse_File::New() const {
540 return new CodeGeneratorResponse_File
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| regexp.cc | 84 ref_map = new map<Regexp*, int>;
163 runes_ = new Rune[8];
167 runes_ = new Rune[nrunes_ * 2];
177 Regexp* re = new Regexp(kRegexpHaveMatch, flags);
185 Regexp* re = new Regexp(kRegexpPlus, flags);
194 Regexp* re = new Regexp(kRegexpStar, flags);
203 Regexp* re = new Regexp(kRegexpQuest, flags);
217 subcopy = new Regexp*[nsub];
232 Regexp* re = new Regexp(op, flags);
244 Regexp* re = new Regexp(op, flags)
[all...] |
| /external/clang/unittests/ASTMatchers/ |
| ASTMatchersTest.cpp | 736 new VerifyIdIsBoundTo<Decl>("x", 3)));
751 new VerifyIdIsBoundTo<Type>("x", 2)));
762 new VerifyIdIsBoundTo<QualType>("x", 2)));
836 ClassX, new VerifyIdIsBoundTo<CXXRecordDecl>("x")));
839 ClassX, new VerifyIdIsBoundTo<CXXRecordDecl>("other-id")));
846 new VerifyIdIsBoundTo<Decl>("b")));
853 new VerifyIdIsBoundTo<CXXMemberCallExpr>("x")));
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocFast.cpp | 208 // Allocate a new stack object for this spill location...
294 // If this register is used by DBG_VALUE then insert new DBG_VALUE to
531 // That invalidates LRI, so run a new lookup for VirtReg.
568 // That invalidates LRI, so run a new lookup for VirtReg.
588 bool New;
589 std::tie(LRI, New) = LiveVirtRegs.insert(LiveReg(VirtReg));
590 if (New) {
621 bool New;
622 std::tie(LRI, New) = LiveVirtRegs.insert(LiveReg(VirtReg));
624 if (New) {
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| ArgumentPromotion.cpp | 102 return new ArgPromotion(maxElements);
188 // the new alloca we introduce.
493 /// arguments, and returns the new function. At this point, we know that it's
499 // Start by computing a new prototype for the function, which is the same as
517 // what the new GEP/Load instructions we are inserting look like.
533 // First, determine the new argument list
609 // Construct the new function type using the new arguments.
612 // Create the new function body and insert it into the module.
624 // Recompute the parameter attributes list based on the new arguments fo
[all...] |
| DeadArgumentElimination.cpp | 188 ModulePass *llvm::createDeadArgEliminationPass() { return new DAE(); }
189 ModulePass *llvm::createDeadArgHackingPass() { return new DAH(); }
215 // Start by computing a new prototype for the function, which is the same as
224 // Create the new function body and insert it into the module...
231 // to pass in a smaller number of arguments into the new function.
255 Instruction *New;
257 New = InvokeInst::Create(NF, II->getNormalDest(), II->getUnwindDest(),
259 cast<InvokeInst>(New)->setCallingConv(CS.getCallingConv());
260 cast<InvokeInst>(New)->setAttributes(PAL);
262 New = CallInst::Create(NF, Args, "", Call)
[all...] |
| /external/regex-re2/re2/ |
| regexp.cc | 84 ref_map = new map<Regexp*, int>;
163 runes_ = new Rune[8];
167 runes_ = new Rune[nrunes_ * 2];
177 Regexp* re = new Regexp(kRegexpHaveMatch, flags);
185 Regexp* re = new Regexp(kRegexpPlus, flags);
194 Regexp* re = new Regexp(kRegexpStar, flags);
203 Regexp* re = new Regexp(kRegexpQuest, flags);
217 subcopy = new Regexp*[nsub];
232 Regexp* re = new Regexp(op, flags);
244 Regexp* re = new Regexp(op, flags)
[all...] |
| /external/chromium_org/third_party/protobuf/src/google/protobuf/ |
| repeated_field.h | 117 // Resize the RepeatedField to a new, smaller size. This is O(1).
216 // static Type* New();
335 static GenericType* New() { return new GenericType; }
381 static string* New();
746 // Avoid inlining of Reserve(): new, copy, and delete[] lead to a significant
755 elements_ = new Element[total_size_];
843 typename TypeHandler::Type* result = TypeHandler::New();
929 // Make room for the new pointer.
[all...] |
