/external/valgrind/main/none/tests/amd64/ |
H A D | avx2-1.c | 18 typedef struct { YMM a1; YMM a2; YMM a3; YMM a4; ULong u64; } Block; typedef in typeref:struct:__anon33100 30 void showBlock ( char* msg, Block* block ) 47 void randBlock ( Block* b ) 51 for (i = 0; i < sizeof(Block); i++) 67 Block* b = memalign(32, sizeof(Block)); \
|
/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/chromium_org/gpu/command_buffer/client/ |
H A D | fenced_allocator.h | 102 struct Block { struct in class:gpu::FencedAllocator 112 bool operator() (const Block &left, const Block &right) { 117 typedef std::vector<Block> Container;
|
/external/chromium_org/mojo/shell/ |
H A D | app_child_process.cc | 64 void Block() { function in class:mojo::shell::__anon8832::Blocker 286 blocker.Block();
|
/external/chromium_org/net/proxy/ |
H A D | multi_threaded_proxy_resolver_unittest.cc | 121 void Block() { function in class:net::__anon9355::BlockableProxyResolver 331 // Block the proxy resolver, so no request can complete. 332 mock->Block(); 425 // Block the proxy resolver, so no request can complete. 426 mock->Block(); 502 // Block the proxy resolver, so no request can complete. 503 mock->Block(); 725 factory->resolvers()[0]->Block();
|
/external/chromium_org/third_party/skia/src/core/ |
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...] |
H A D | SkTLList.h | 33 struct Block; 37 Block* fBlock; // owning block. 58 Block* block = node->fBlock; 237 struct Block { struct in class:SkTLList 242 size_t blockSize() const { return sizeof(Block) + sizeof(Node) * (fAllocCnt-1); } 250 Block* block = reinterpret_cast<Block*>(sk_malloc_flags(this->blockSize(), 0)); 270 Block* block = node->fBlock; 296 Block* block = freeNode->fBlock; 317 Block* bloc [all...] |
/external/chromium_org/tools/gn/ |
H A D | command_format.cc | 43 void Block(const ParseNode* file); 147 void Printer::Block(const ParseNode* root) { function in class:commands::__anon16438::Printer 220 Block(condition->if_true()); 236 Block(condition->if_false()); 249 Block(func_call->block()); 359 pr.Block(parse_node);
|
/external/clang/lib/Analysis/ |
H A D | BodyFarm.cpp | 189 const ParmVarDecl *Block = D->getParamDecl(1); local 190 QualType Ty = Block->getType(); 207 DeclRefExpr *DR = M.makeDeclRefExpr(Block);
|
H A D | ReachableCode.cpp | 365 bool isDeadCodeRoot(const CFGBlock *Block); 367 const Stmt *findDeadCode(const CFGBlock *Block); 383 bool DeadCodeScan::isDeadCodeRoot(const clang::CFGBlock *Block) { argument 386 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), 387 E = Block->pred_end(); I != E; ++I) { 414 const Stmt *DeadCodeScan::findDeadCode(const clang::CFGBlock *Block) { argument 415 for (CFGBlock::const_iterator I = Block->begin(), E = Block->end(); I!=E; ++I) 422 if (CFGTerminator T = Block->getTerminator()) { 449 const CFGBlock *Block local 493 const CFGBlock *Block = I->first; local [all...] |
/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)) 345 ExtInfo.BranchAfters.push_back(std::make_pair(Block, Inde [all...] |
H A D | CGBlocks.h | 210 const BlockDecl *Block; member in class:clang::CodeGen::CGBlockInfo 243 const BlockDecl *getBlockDecl() const { return Block; } 246 assert(BlockExpression->getBlockDecl() == Block);
|
H A D | CGObjCRuntime.cpp | 151 llvm::BasicBlock *Block; member in struct:__anon17849::CatchHandler 200 Handler.Block = CGF.createBasicBlock("catch"); 214 Catch->setHandler(I, Handlers[I].TypeInfo, Handlers[I].Block); 231 CGF.EmitBlock(Handler.Block);
|
/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/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/skia/src/core/ |
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/stlport/test/eh/ |
H A D | nc_alloc.cpp | 118 if (s <= sizeof(Block)) { 131 Block* b = (Block*)p; 139 struct Block; 140 friend struct Block; 151 struct Block { struct in class:FastAllocator 153 Block *next; 159 static Block* mBlocks; 160 static Block *mFree; 164 FastAllocator::Block *FastAllocato [all...] |
/external/valgrind/main/include/ |
H A D | pub_tool_addrinfo.h | 102 } Block; member in union:_AddrInfo::__anon32865
|
/external/valgrind/main/memcheck/tests/ |
H A D | unit_oset.c | 437 Block; typedef in typeref:struct:__anon33069 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...] |
/external/zlib/src/contrib/dotzlib/DotZLib/ |
H A D | DotZLib.cs | 24 None, Partial, Sync, Full, Finish, Block
enumerator in enum:DotZLib.FlushTypes
|
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkTextureCompressor_Blitter.h | 420 // Returns the block index for the block containing pixel (x, y). Block 440 typedef uint32_t Block[BlockDim][BlockDim/4]; typedef in class:SkTextureCompressor::SkTCompressedAlphaBlitter 441 inline void updateBlockColumns(Block block, const int col, 510 Block block;
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | CoreEngine.cpp | 511 const CFGBlock *Block, unsigned Idx) { 512 assert(Block); 519 WList->enqueue(N, Block, Idx); 526 WList->enqueue(N, Block, Idx+1); 531 WList->enqueue(N, Block, Idx); 535 if ((*Block)[Idx].getKind() == CFGElement::NewAllocator) { 536 WList->enqueue(N, Block, Idx+1); 541 CFGStmt CS = (*Block)[Idx].castAs<CFGStmt>(); 547 WList->enqueue(N, Block, Idx+1); 556 WList->enqueue(Succ, Block, Id 510 enqueueStmtNode(ExplodedNode *N, const CFGBlock *Block, unsigned Idx) argument 581 enqueue(ExplodedNodeSet &Set, const CFGBlock *Block, unsigned Idx) argument [all...] |
/external/eigen/Eigen/src/Core/ |
H A D | Block.h | 16 /** \class Block 50 struct traits<Block<XprType, BlockRows, BlockCols, InnerPanel> > : traits<XprType> 102 template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block class in namespace:Eigen 109 EIGEN_GENERIC_PUBLIC_INTERFACE(Block) 110 EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Block) 114 inline Block(XprType& xpr, Index i) : Impl(xpr,i) function in class:Eigen::Block 123 inline Block(XprType& xpr, Index a_startRow, Index a_startCol) function in class:Eigen::Block 133 inline Block(XprType& xpr, function in class:Eigen::Block 166 : public internal::dense_xpr_base<Block<XprType, BlockRows, BlockCols, InnerPanel> >::type 168 typedef Block<XprTyp [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfoImpl.h | 423 void insertIntoLoop(BlockT *Block); 429 void pushBlock(BlockT *Block) { argument 430 DFSStack.push_back(std::make_pair(Block, BlockTraits::child_begin(Block))); 457 /// Add a single Block to its ancestor loops in PostOrder. If the block is a 459 /// Block and Subloop vectors of the now complete subloop to achieve RPO. 461 void PopulateLoopsDFS<BlockT, LoopT>::insertIntoLoop(BlockT *Block) { argument 462 LoopT *Subloop = LI->getLoopFor(Block); 463 if (Subloop && Block == Subloop->getHeader()) { 480 Subloop->addBlockEntry(Block); [all...] |
/external/llvm/include/llvm/Bitcode/ |
H A D | BitstreamWriter.h | 45 struct Block { struct in class:llvm::BitstreamWriter 49 Block(unsigned PCS, unsigned SSW) : PrevCodeSize(PCS), StartSizeWord(SSW) {} function in struct:llvm::BitstreamWriter::Block 53 std::vector<Block> BlockScope; 101 assert(BlockScope.empty() && CurAbbrevs.empty() && "Block imbalance"); 193 // Block Manipulation 211 // Block header: 228 BlockScope.push_back(Block(OldCodeSize, BlockSizeWordIndex)); 243 assert(!BlockScope.empty() && "Block scope imbalance!"); 250 const Block &B = BlockScope.back(); 252 // Block tai [all...] |