| /external/zlib/src/contrib/delphi/ |
| ZLib.pas | 20 TFree = procedure (AppData, Block: Pointer); cdecl;
112 compressed data is exhausted and the next block is read from the input stream.
223 procedure _free(Block: Pointer); cdecl;
225 FreeMem(Block);
260 procedure zlibFreeMem(AppData, Block: Pointer); cdecl;
262 FreeMem(Block);
|
| /external/v8/src/parsing/ |
| parser.cc | 813 // Notice that the stream is destroyed at the end of the branch block.
3278 auto block = local
3767 Block* block = local
3860 Block* block = local
4018 Block* block = ParseBlock(nullptr, false, CHECK_OK); local
[all...] |
| pattern-rewriter.cc | 15 Block* block, const DeclarationDescriptor* declaration_descriptor,
25 rewriter.block_ = block;
183 // block).
237 // and add it to the initialization statement block.
259 // and add it to the initialization statement block.
294 // Add an assignment node to the initialization statement block if we still
363 Block* old_block = block_;
582 NOT_A_PATTERN(Block)
|
| /prebuilts/go/darwin-x86/src/cmd/cover/ |
| cover.go | 142 // Block represents the information about a basic block to be recorded in the analysis.
143 // Note: Our definition of basic block is based on control structures; we don't break
145 type Block struct {
157 blocks []Block
165 // If it's a switch or select, the body is a list of case clauses; don't tag the block itself.
193 // so we add a hidden block:
201 block := &ast.BlockStmt{
202 Lbrace: n.Body.End(), // Start at end of the "if" block so the covered part looks like it starts at the "else".
206 n.Else = block
[all...] |
| /prebuilts/go/linux-x86/src/cmd/cover/ |
| cover.go | 142 // Block represents the information about a basic block to be recorded in the analysis.
143 // Note: Our definition of basic block is based on control structures; we don't break
145 type Block struct {
157 blocks []Block
165 // If it's a switch or select, the body is a list of case clauses; don't tag the block itself.
193 // so we add a hidden block:
201 block := &ast.BlockStmt{
202 Lbrace: n.Body.End(), // Start at end of the "if" block so the covered part looks like it starts at the "else".
206 n.Else = block
[all...] |
| /external/clang/lib/CodeGen/ |
| CGCleanup.cpp | 343 /// Transitions the terminator of the given exit-block of a cleanup to
346 llvm::BasicBlock *Block) {
349 llvm::TerminatorInst *Term = Block->getTerminator();
350 assert(Term && "can't transition block without terminator");
357 llvm::SwitchInst::Create(Load, Br->getSuccessor(0), 4, Block);
365 void CodeGenFunction::ResolveBranchFixups(llvm::BasicBlock *Block) {
366 assert(Block && "resolving a null target block");
378 if (Fixup.Destination != Block) continue;
383 // If it doesn't have an optimistic branch block, LatestBranch i
[all...] |
| CGException.cpp | 378 // Deactivate the cleanup block.
465 /// Emit the dispatch block for a filter scope if necessary.
580 // The dispatch block for the end of the scope chain is a block that
596 dispatchBlock = catchScope.getHandler(0).Block;
598 // Otherwise, make a dispatch block.
627 // Returning nullptr indicates that the previous dispatch block should unwind
662 llvm_unreachable("PadEnd dispatch block missing!");
899 CGF.Builder.SetInsertPoint(Handler.Block);
909 CatchSwitch->addHandler(Handler.Block);
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/third_party/libwebm/ |
| mkvparser.cpp | 1260 //status == 0 means "no block entries found"
1261 //status > 0 means "found at least one block entry"
1381 //status == 0 means "no block entries found"
[all...] |
| /external/clang/include/clang/AST/ |
| Stmt.h | [all...] |
| /external/pdfium/third_party/lcms2-2.6/src/ |
| cmsio0.c | 31 // memory block or any storage. Each IOhandler provides implementations for read,
135 // Those functions implements an iohandler which takes a block of memory as storage medium.
138 cmsUInt8Number* Block; // Points to allocated memory
155 cmsSignalError(iohandler ->ContextID, cmsERROR_READ, "Read from memory error. Got %d bytes, block should be of %d bytes", len, count * size);
159 Ptr = ResData -> Block;
208 memmove(ResData ->Block + ResData ->Pointer, Ptr, size);
225 if (ResData ->Block) _cmsFree(iohandler ->ContextID, ResData ->Block);
234 // Create a iohandler for memory block. AccessMode=='r' assumes the iohandler is going to read, and makes
235 // a copy of the memory block for letting user to free the memory after invoking open profile. In writ
[all...] |
| /external/v8/src/wasm/ |
| ast-decoder.cc | 79 struct Block {
179 ZoneVector<Block> blocks_;
340 SetEnv("block:start", Steal(break_env));
360 blocks_.back().stack_depth = -1; // no production for inner block.
672 Block* last = &blocks_.back();
676 SetEnv("block:end", last->ssa_env);
686 Block* last = &blocks_.back();
706 // True block done. Merge true and false environments.
783 Block* block = &blocks_[blocks_.size() - depth - 1] local
796 Block* block = &blocks_[blocks_.size() - depth - 1]; local
817 Block* block = &blocks_.back(); local
870 Block* block = &blocks_.back(); local
[all...] |
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 313 Block<MatrixType,Dynamic,1> A21(mat,k+1,k,rs,1);
314 Block<MatrixType,1,Dynamic> A10(mat,k,0,1,k);
315 Block<MatrixType,Dynamic,Dynamic> A20(mat,k+1,0,rs,k);
|
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 105 // EH block instructions are immobile.
195 // Check the current block, as a fast-path, before checking whether
197 // block they are defined in. Also, blocks not reachable from the
357 /// hasDedicatedExits - Return true if no exit block for the loop
360 // Each predecessor of each exit block of a normal loop is contained
390 // If block is inside the loop then it is not a exit block.
397 // If current basic block is this exit block's first predecessor
398 // then only insert exit block in to the output ExitBlocks vector
[all...] |
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 126 unsigned getUnprocPredCount(BasicBlock *Block) const {
128 for (pred_iterator I = pred_begin(Block), E = pred_end(Block); I != E; ++I)
203 // algorithm at the start of the block.
217 // Unify everything in the block, non-tentatively this time.
387 // Block addresses only match if we've already encountered the
388 // block. FIXME: tentative matches?
587 // Finishing unifying and complaining about the tails of the block,
|
| /external/skia/src/utils/ |
| SkTextureCompressor_Blitter.h | 18 // the rect rarely falls along block boundaries. The proper way to handle this is
19 // to update the compressed encoding of a block by resetting the proper parameters
20 // (and even recompressing the block) where a rect falls inbetween block boundaries.
45 // // The function used to compress an A8 block. The layout of the
46 // // block is also expected to be in column-major order.
47 // static void CompressA8Vertical(uint8_t* dst, const uint8_t block[]);
49 // // The function used to compress an A8 block. The layout of the
50 // // block is also expected to be in row-major order.
54 // // The function used to update an already compressed block. This wil
335 uint8_t block[BlockDim*BlockDim]; variable
511 Block block; local
[all...] |
| /external/valgrind/none/tests/amd64/ |
| avx-1.c | 16 typedef struct { YMM a1; YMM a2; YMM a3; YMM a4; ULong u64; } Block;
28 void showBlock ( char* msg, Block* block )
31 printf(" "); showYMM(&block->a1); printf("\n");
32 printf(" "); showYMM(&block->a2); printf("\n");
33 printf(" "); showYMM(&block->a3); printf("\n");
34 printf(" "); showYMM(&block->a4); printf("\n");
35 printf(" %016llx\n", block->u64);
45 void randBlock ( Block* b )
49 for (i = 0; i < sizeof(Block); i++
[all...] |
| /frameworks/av/media/libstagefright/matroska/ |
| MatroskaExtractor.cpp | 105 const mkvparser::Block *block() const;
370 } while (!eos() && block()->GetTrackNumber() != mTrackNum);
392 } while (!eos() && block()->GetTrackNumber() != mTrackNum);
488 if (isAudio || block()->IsKey()) {
490 int64_t frameTimeUs = (block()->GetTime(mCluster) + 500LL) / 1000LL;
501 const mkvparser::Block *BlockIterator::block() const { function in class:android::BlockIterator
603 const mkvparser::Block *block = mBlockIter.block() local
1039 const mkvparser::Block *block = iter.block(); local
[all...] |
| /external/ceres-solver/internal/ceres/ |
| linear_least_squares_problems.cc | 299 bs->cols.push_back(Block());
313 row.block.size = 1;
314 row.block.position = 0;
326 row.block.size = 1;
327 row.block.position = 1;
339 row.block.size = 1;
340 row.block.position = 2;
352 row.block.size = 1;
353 row.block.position = 3;
365 row.block.size = 1
[all...] |
| /external/clang/lib/Frontend/ |
| ASTConsumers.cpp | 258 case Decl::Block:
259 Out << "[block]";
397 case Decl::Block:
|
| /external/eigen/Eigen/src/Eigen2Support/Geometry/ |
| Quaternion.h | 87 inline const Block<const Coefficients,3,1> vec() const { return m_coeffs.template start<3>(); }
90 inline Block<Coefficients,3,1> vec() { return m_coeffs.template start<3>(); }
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 226 // warp any Map, Matrix, and Block expressions as a unique type, but since that's exactly
228 // and Block.
230 typedef Block<MapLU, Dynamic, Dynamic> MatrixType;
231 typedef Block<MatrixType,Dynamic,Dynamic> BlockType;
302 * 2 - avoid infinite recursion of the instanciations with Block<Block<Block<...> > >
330 Index bs = (std::min)(size-k,blockSize); // actual size of the block
|
| /external/llvm/unittests/DebugInfo/PDB/ |
| PDBApiTest.cpp | 306 InsertItemWithTag(PDB_SymType::Block);
368 VerifyDyncast<PDBSymbolBlock>(PDB_SymType::Block);
|
| /external/lzma/CS/7zip/ |
| ICoder.cs | 97 /// Specifies Block Size.
|
| /prebuilts/go/darwin-x86/src/crypto/cipher/ |
| cbc_aes_test.go | 8 // Special Publication 800-38A, ``Recommendation for Block Cipher
|
| ctr_aes_test.go | 8 // Special Publication 800-38A, ``Recommendation for Block Cipher
|
