/external/skia/src/sksl/ir/ |
H A D | SkSLBlock.h | 19 struct Block : public Statement { struct in namespace:SkSL 20 Block(int offset, std::vector<std::unique_ptr<Statement>> statements, function in struct:SkSL::Block
|
/external/skqp/src/sksl/ir/ |
H A D | SkSLBlock.h | 19 struct Block : public Statement { struct in namespace:SkSL 20 Block(int offset, std::vector<std::unique_ptr<Statement>> statements, function in struct:SkSL::Block
|
/external/tensorflow/tensorflow/core/lib/io/ |
H A D | block.h | 28 class Block { class in namespace:tensorflow::table 31 explicit Block(const BlockContents& contents); 33 ~Block(); 44 bool owned_; // Block owns data_[] 47 Block(const Block&); 48 void operator=(const Block&);
|
H A D | block.cc | 29 inline uint32 Block::NumRestarts() const { 34 Block::Block(const BlockContents& contents) function in class:tensorflow::table::Block 51 Block::~Block() { 88 class Block::Iter : public Iterator { 235 Iterator* Block::NewIterator() {
|
/external/llvm/lib/Support/ |
H A D | ScopedPrinter.cpp | 24 ArrayRef<uint8_t> Data, bool Block) { 26 Block = true; 28 if (Block) { 23 printBinaryImpl(StringRef Label, StringRef Str, ArrayRef<uint8_t> Data, bool Block) argument
|
/external/valgrind/none/tests/amd64/ |
H A D | movbe.c | 13 typedef struct { UChar cs[40]; } Block; typedef in typeref:struct:__anon29673 15 void showBlock ( char* msg, Block* b ) 31 void randBlock ( Block* b ) 35 for (i = 0; i < sizeof(Block); i++) 46 Block* b = memalign32(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:__anon29664 28 void showBlock ( char* msg, Block* block ) 45 void randBlock ( Block* b ) 49 for (i = 0; i < sizeof(Block); i++) 66 Block* b = memalign32(sizeof(Block)); \
|
H A D | avx2-1.c | 22 typedef struct { YMM a1; YMM a2; YMM a3; YMM a4; ULong u64; } Block; typedef in typeref:struct:__anon29666 34 void showBlock ( char* msg, Block* block ) 51 void randBlock ( Block* b ) 55 for (i = 0; i < sizeof(Block); i++) 72 Block* b = memalign32(sizeof(Block)); \
|
/external/valgrind/none/tests/x86/ |
H A D | movbe.c | 13 typedef struct { UChar cs[40]; } Block; typedef in typeref:struct:__anon29829 15 void showBlock ( char* msg, Block* b ) 31 void randBlock ( Block* b ) 35 for (i = 0; i < sizeof(Block); i++) 46 Block* b = memalign32(sizeof(Block)); \
|
/external/tensorflow/tensorflow/contrib/slim/python/slim/nets/ |
H A D | resnet_utils.py | 56 class Block(collections.namedtuple('Block', ['scope', 'unit_fn', 'args'])): class in inherits:collections.namedtuple('Block', ['scope', 'unit_fn', 'args'] 60 scope: The scope of the `Block`. 63 args: A list of length equal to the number of units in the `Block`. The list 175 element is a ResNet `Block` object describing the units in the `Block`.
|
/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/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/python/cpython3/Lib/turtledemo/ |
H A D | sorting_animate.py | 22 class Block(Turtle): class in inherits:Turtle 39 return "Block size: {0}".format(self.size) 174 s.push(Block(i))
|
/external/deqp/framework/delibs/decpp/ |
H A D | deAppendList.hpp | 68 struct Block struct in class:de::AppendList 72 Block* volatile next; 74 Block (size_t blockNdx_, size_t size) function in struct:de::AppendList::Block 82 ~Block (void) 90 Block* m_first; 91 Block* volatile m_last; 98 Iterator (Block* curBlock_, size_t blockSize_, size_t slotNdx_) 148 Block* m_curBlock; 167 , m_first (new Block(0, blockSize)) 176 Block* curBloc [all...] |
/external/llvm/lib/IR/ |
H A D | GCOV.cpp | 154 errs() << "Block tag not found.\n"; 162 return false; // Block flags; 209 GCOVBlock &Block = *Blocks[BlockNo]; local 234 Block.addLine(Line); 317 GCOVBlock &Block = *Blocks[BlockNo]; local 318 for (size_t EdgeNo = 0, End = Block.getNumDstEdges(); EdgeNo < End; 327 Block.addCount(EdgeNo, ArcCount); 330 Block.sortDstEdges(); 351 for (const auto &Block : Blocks) 352 Block [all...] |
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | BranchFolding.h | 35 MachineBasicBlock *Block; member in class:llvm::BranchFolder::MergePotentialsElt 38 : Hash(h), Block(b) {} 41 MachineBasicBlock *getBlock() const { return Block; } 44 Block = MBB;
|
/external/tensorflow/tensorflow/core/platform/cloud/ |
H A D | file_block_cache.h | 145 /// be accessed while holding the Block's mu lock. The data vector should only 151 struct Block { struct in class:tensorflow::FileBlockCache 170 /// The block map is an ordered map from Key to Block. 171 typedef std::map<Key, std::shared_ptr<Block>> BlockMap; 176 bool BlockNotStale(const std::shared_ptr<Block>& block) 180 std::shared_ptr<Block> Lookup(const Key& key) LOCKS_EXCLUDED(mu_); 182 Status MaybeFetch(const Key& key, const std::shared_ptr<Block>& block) 189 Status UpdateLRU(const Key& key, const std::shared_ptr<Block>& block) 208 /// The block map (map from Key to Block).
|
/external/clang/lib/CodeGen/ |
H A D | CGCleanup.h | 161 llvm::BasicBlock *Block; member in struct:clang::CodeGen::EHCatchScope::Handler 193 void setCatchAllHandler(unsigned I, llvm::BasicBlock *Block) { argument 194 setHandler(I, CatchTypeInfo{nullptr, 0}, Block); 197 void setHandler(unsigned I, llvm::Constant *Type, llvm::BasicBlock *Block) { argument 200 getHandlers()[I].Block = Block; 203 void setHandler(unsigned I, CatchTypeInfo Type, llvm::BasicBlock *Block) { 206 getHandlers()[I].Block = Block; 220 delete getHandler(I).Block; [all...] |
/external/eigen/Eigen/src/Core/ |
H A D | Block.h | 18 struct traits<Block<XprType, BlockRows, BlockCols, InnerPanel> > : traits<XprType> 69 /** \class Block 103 template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block class in namespace:Eigen 110 EIGEN_GENERIC_PUBLIC_INTERFACE(Block) 111 EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Block) 118 inline Block(XprType& xpr, Index i) : Impl(xpr,i) function in class:Eigen::Block 128 inline Block(XprType& xpr, Index startRow, Index startCol) function in class:Eigen::Block 139 inline Block(XprType& xpr, function in class:Eigen::Block 173 : public internal::dense_xpr_base<Block<XprType, BlockRows, BlockCols, InnerPanel> >::type 175 typedef Block<XprTyp [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
|
H A D | ScalarEvolutionExpander.h | 93 AssertingVH<BasicBlock> Block; member in class:llvm::SCEVExpander::SCEVInsertPointGuard 103 : Builder(B), Block(B.GetInsertBlock()), Point(B.GetInsertPoint()), 114 Builder.restoreIP(IRBuilderBase::InsertPoint(Block, Point));
|
/external/llvm/lib/CodeGen/ |
H A D | BranchFolding.h | 44 MachineBasicBlock *Block; member in class:llvm::BranchFolder::MergePotentialsElt 47 : Hash(h), Block(b) {} 50 MachineBasicBlock *getBlock() const { return Block; } 53 Block = MBB;
|
H A D | ShrinkWrap.cpp | 259 MachineBasicBlock *FindIDom(MachineBasicBlock &Block, ListOfBBs BBs, argument 261 MachineBasicBlock *IDom = &Block; 267 if (IDom == &Block)
|
/external/llvm/lib/DebugInfo/PDB/Raw/ |
H A D | PDBFile.cpp | 157 for (uint32_t Block : Blocks) { 158 uint64_t BlockEndOffset = (uint64_t)(Block + 1) * SB->BlockSize; 296 Error PDBFile::setSuperBlock(const SuperBlock *Block) { argument 297 SB = Block; 307 "Block size is not multiple of 4.");
|