/external/llvm/tools/llvm-readobj/ |
H A D | StreamWriter.cpp | 31 ArrayRef<uint8_t> Data, bool Block) { 33 Block = true; 35 if (Block) { 30 printBinaryImpl(StringRef Label, StringRef Str, ArrayRef<uint8_t> Data, bool Block) argument
|
/external/mockito/cglib-and-asm/src/org/mockito/cglib/core/ |
H A D | Block.java | 20 public class Block class 26 public Block(CodeEmitter e) { method in class:Block
|
/external/skia/src/core/ |
H A D | SkVarAlloc.cpp | 17 struct SkVarAlloc::Block { struct in class:SkVarAlloc 18 Block* prev; 21 static Block* Alloc(Block* prev, size_t size, unsigned flags) { 22 SkASSERT(size >= sizeof(Block)); 23 Block* b = (Block*)sk_malloc_flags(size, flags); 44 Block* b = fBlock; 46 Block* prev = b->prev; 56 while (alloc < bytes + sizeof(Block)) { [all...] |
H A D | SkChunkAlloc.cpp | 20 struct SkChunkAlloc::Block { struct in class:SkChunkAlloc 21 Block* fNext; 42 static void FreeChain(Block* block) { 44 Block* next = block->fNext; 77 Block::FreeChain(fBlock); 89 Block* largest = fBlock; 92 Block* next; 93 for (Block* cur = largest->fNext; cur; cur = next) { 118 SkChunkAlloc::Block* SkChunkAlloc::newBlock(size_t bytes, AllocFailType ftype) { 124 Block* bloc [all...] |
H A D | SkDeque.cpp | 12 struct SkDeque::Block { struct in class:SkDeque 13 Block* fNext; 14 Block* fPrev; 47 if (storageSize >= sizeof(Block) + elemSize) { 48 fFrontBlock = (Block*)storage; 58 Block* head = fFrontBlock; 59 Block* initialHead = (Block*)fInitialStorage; 62 Block* next = head->fNext; 78 Block* firs [all...] |
/external/valgrind/none/tests/amd64/ |
H A D | movbe.c | 13 typedef struct { UChar cs[40]; } Block; typedef in typeref:struct:__anon16629 15 void showBlock ( char* msg, Block* b ) 31 void randBlock ( Block* b ) 35 for (i = 0; i < sizeof(Block); i++) 46 Block* b = memalign(32, sizeof(Block)); \
|
H A D | avx-1.c | 16 typedef struct { YMM a1; YMM a2; YMM a3; YMM a4; ULong u64; } Block; typedef in typeref:struct:__anon16625 28 void showBlock ( char* msg, Block* block ) 45 void randBlock ( Block* b ) 49 for (i = 0; i < sizeof(Block); i++) 66 Block* b = memalign(32, sizeof(Block)); \
|
H A D | avx2-1.c | 18 typedef struct { YMM a1; YMM a2; YMM a3; YMM a4; ULong u64; } Block; typedef in typeref:struct:__anon16627 30 void showBlock ( char* msg, Block* block ) 47 void randBlock ( Block* b ) 51 for (i = 0; i < sizeof(Block); i++) 68 Block* b = memalign(32, sizeof(Block)); \
|
/external/valgrind/none/tests/x86/ |
H A D | movbe.c | 13 typedef struct { UChar cs[40]; } Block; typedef in typeref:struct:__anon16780 15 void showBlock ( char* msg, Block* b ) 31 void randBlock ( Block* b ) 35 for (i = 0; i < sizeof(Block); i++) 46 Block* b = memalign(32, sizeof(Block)); \
|
/external/lldb/include/lldb/Symbol/ |
H A D | Block.h | 1 //===-- Block.h -------------------------------------------------*- C++ -*-===// 24 /// @class Block Block.h "lldb/Symbol/Block.h" 28 /// Block objects. The BlockList object contains a section offset 29 /// address range, and Block objects contain one or more ranges 41 class Block : class in namespace:lldb_private 73 Block (lldb::user_id_t uid); 78 virtual ~Block (); 124 virtual Block * [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | SerializedGrammar.java | 49 Block block; 50 public Rule(String name, Block block) { 59 class Block { class in class:SerializedGrammar 61 public Block(List[] alts) { method in class:SerializedGrammar.Block 127 Block b = readBlock(in); 133 protected Block readBlock(DataInputStream in) throws IOException { 142 return new Block(alts); 172 Block b = readBlock(in);
|
/external/ceres-solver/internal/ceres/ |
H A D | block_structure.h | 31 // Block structure objects are used to carry information about the 50 struct Block { struct in namespace:ceres::internal 51 Block() : size(-1), position(-1) {} function in struct:ceres::internal::Block 52 Block(int size_, int position_) : size(size_), position(position_) {} function in struct:ceres::internal::Block 73 Block block; 81 vector<Block> cols; 86 vector<Block> rows;
|
/external/clang/include/clang/Analysis/Analyses/ |
H A D | PostOrderCFGView.h | 50 std::pair<llvm::NoneType, bool> insert(const CFGBlock *Block) { argument 52 // make sure that Block is non-null. Moreover, the CFGBlock iterator will 55 if (!Block) 57 if (VisitedBlockIDs.test(Block->getBlockID())) 59 VisitedBlockIDs.set(Block->getBlockID()); 65 /// loop. Block must not be null. 66 bool alreadySet(const CFGBlock *Block) { argument 67 return VisitedBlockIDs.test(Block->getBlockID());
|
/external/llvm/tools/lli/ |
H A D | RemoteMemoryManager.cpp | 39 sys::MemoryBlock Block = allocateSection(Size); local 41 AllocatedSections.push_back( Allocation(Block, Alignment, true) ); 43 UnmappedSections.push_back( Allocation(Block, Alignment, true) ); 44 return (uint8_t*)Block.base(); 55 sys::MemoryBlock Block = allocateSection(Size); local 57 AllocatedSections.push_back( Allocation(Block, Alignment, false) ); 59 UnmappedSections.push_back( Allocation(Block, Alignment, false) ); 60 return (uint8_t*)Block.base();
|
/external/llvm/lib/CodeGen/ |
H A D | BranchFolding.h | 40 MachineBasicBlock *Block; member in class:llvm::BranchFolder::MergePotentialsElt 43 : Hash(h), Block(b) {} 46 MachineBasicBlock *getBlock() const { return Block; } 49 Block = MBB;
|
/external/llvm/lib/IR/ |
H A D | GCOV.cpp | 153 errs() << "Block tag not found.\n"; 161 return false; // Block flags; 208 GCOVBlock &Block = *Blocks[BlockNo]; local 233 Block.addLine(Line); 312 GCOVBlock &Block = *Blocks[BlockNo]; local 313 for (size_t EdgeNo = 0, End = Block.getNumDstEdges(); EdgeNo < End; 322 Block.addCount(EdgeNo, ArcCount); 325 Block.sortDstEdges(); 346 for (const auto &Block : Blocks) 347 Block [all...] |
/external/v8/test/cctest/ |
H A D | test-alloc.cc | 187 class Block { class 189 Block(Address base_arg, int size_arg) function in class:Block 204 List< ::Block> blocks(1000); 221 blocks.Add(::Block(base, static_cast<int>(allocated)));
|
/external/lldb/source/Symbol/ |
H A D | Block.cpp | 1 //===-- Block.cpp -----------------------------------------------*- C++ -*-===// 10 #include "lldb/Symbol/Block.h" 25 Block::Block(lldb::user_id_t uid) : function in class:Block 38 Block::~Block () 43 Block::GetDescription(Stream *s, Function *function, lldb::DescriptionLevel level, Target *target) const 73 Block::Dump(Stream *s, addr_t base_addr, int32_t depth, bool show_context) const 77 Block *parent = GetParent(); 88 *s << "Block" << ((cons [all...] |
/external/clang/lib/Analysis/ |
H A D | BodyFarm.cpp | 190 const ParmVarDecl *Block = D->getParamDecl(1); local 191 QualType Ty = Block->getType(); 208 DeclRefExpr *DR = M.makeDeclRefExpr(Block);
|
/external/clang/lib/CodeGen/ |
H A D | CGCleanup.h | 151 llvm::BasicBlock *Block; member in struct:clang::CodeGen::EHCatchScope::Handler 182 void setCatchAllHandler(unsigned I, llvm::BasicBlock *Block) { argument 183 setHandler(I, /*catchall*/ nullptr, Block); 186 void setHandler(unsigned I, llvm::Constant *Type, llvm::BasicBlock *Block) { argument 189 getHandlers()[I].Block = Block; 203 delete getHandler(I).Block; 342 llvm::BasicBlock *Block) { 344 if (ExtInfo.Branches.insert(Block).second) 345 ExtInfo.BranchAfters.push_back(std::make_pair(Block, Inde [all...] |
/external/google-breakpad/src/common/dwarf/ |
H A D | cfi_assembler.h | 166 CFISection &Block(const string &block) { function in class:google_breakpad::CFISection
|
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfoImpl.h | 419 void insertIntoLoop(BlockT *Block); 429 /// Add a single Block to its ancestor loops in PostOrder. If the block is a 431 /// Block and Subloop vectors of the now complete subloop to achieve RPO. 433 void PopulateLoopsDFS<BlockT, LoopT>::insertIntoLoop(BlockT *Block) { argument 434 LoopT *Subloop = LI->getLoopFor(Block); 435 if (Subloop && Block == Subloop->getHeader()) { 452 Subloop->addBlockEntry(Block); 459 /// Block vectors are then populated during a single forward CFG traversal 467 /// The Block vectors are inclusive, so step 3 requires loop-depth number of
|
/external/llvm/lib/Target/SystemZ/ |
H A D | SystemZLongBranch.cpp | 144 void skipNonTerminators(BlockPosition &Position, MBBInfo &Block); 173 // Position describes the state immediately before Block. Update Block 177 MBBInfo &Block) { 178 if (Block.Alignment > Position.KnownBits) { 179 // When calculating the address of Block, we need to conservatively 180 // assume that Block had the worst possible misalignment. 181 Position.Address += ((uint64_t(1) << Block.Alignment) - 183 Position.KnownBits = Block.Alignment; 187 uint64_t AlignMask = (uint64_t(1) << Block 176 skipNonTerminators(BlockPosition &Position, MBBInfo &Block) argument 274 MBBInfo &Block = MBBs[I]; local [all...] |
/external/llvm/unittests/DebugInfo/PDB/ |
H A D | PDBApiTest.cpp | 296 InsertItemWithTag(PDB_SymType::Block); variable 358 VerifyDyncast<PDBSymbolBlock>(PDB_SymType::Block);
|
/external/valgrind/memcheck/tests/ |
H A D | unit_oset.c | 437 Block; typedef in typeref:struct:__anon16596 443 Block* b = (Block*)p; 451 const Block* elem = (const Block*)velem; 463 Block* vs[NN]; 464 Block v, prev; 465 Block *pv; 469 OSet* oset = VG_(OSetGen_Create)(offsetof(Block, first), 483 vs[i] = VG_(OSetGen_AllocNode)(oset, sizeof(Block)); [all...] |