| /external/tensorflow/tensorflow/contrib/slim/python/slim/nets/ |
| resnet_utils.py | 32 each block, instead of subsampling the input activations in the first residual
33 unit of each block. The two implementations give identical results but our
56 class Block(collections.namedtuple('Block', ['scope', 'unit_fn', 'args'])):
57 """A named tuple describing a ResNet block.
60 scope: The scope of the `Block`.
63 args: A list of length equal to the number of units in the `Block`. The list
65 block to serve as argument to unit_fn.
175 element is a ResNet `Block` object describing the units in the `Block`
[all...] |
| /prebuilts/go/darwin-x86/src/crypto/cipher/ |
| cipher.go | 5 // Package cipher implements standard block cipher modes that can be wrapped
6 // around low-level block cipher implementations.
11 // A Block represents an implementation of block cipher
15 type Block interface {
16 // BlockSize returns the cipher's block size.
19 // Encrypt encrypts the first block in src into dst.
23 // Decrypt decrypts the first block in src into dst.
43 // A BlockMode represents a block cipher running in a block-based mode (CBC
[all...] |
| /prebuilts/go/linux-x86/src/crypto/cipher/ |
| cipher.go | 5 // Package cipher implements standard block cipher modes that can be wrapped
6 // around low-level block cipher implementations.
11 // A Block represents an implementation of block cipher
15 type Block interface {
16 // BlockSize returns the cipher's block size.
19 // Encrypt encrypts the first block in src into dst.
23 // Decrypt decrypts the first block in src into dst.
43 // A BlockMode represents a block cipher running in a block-based mode (CBC
[all...] |
| /external/skia/src/sksl/ir/ |
| SkSLBlock.h | 17 * A block of multiple statements functioning as a single statement.
19 struct Block : public Statement {
20 Block(int offset, std::vector<std::unique_ptr<Statement>> statements,
|
| /external/skqp/src/sksl/ir/ |
| SkSLBlock.h | 17 * A block of multiple statements functioning as a single statement.
19 struct Block : public Statement {
20 Block(int offset, std::vector<std::unique_ptr<Statement>> statements,
|
| /art/runtime/ |
| signal_set.h | 40 void Block() {
|
| /external/tensorflow/tensorflow/core/lib/io/ |
| block.h | 28 class Block {
30 // Initialize the block with the specified contents.
31 explicit Block(const BlockContents& contents);
33 ~Block();
44 bool owned_; // Block owns data_[]
47 Block(const Block&);
48 void operator=(const Block&);
|
| block.cc | 18 #include "tensorflow/core/lib/io/block.h"
29 inline uint32 Block::NumRestarts() const {
34 Block::Block(const BlockContents& contents)
51 Block::~Block() {
57 // Helper routine: decode the next block entry starting at "p",
88 class Block::Iter : public Iterator {
90 const char* const data_; // underlying block contents
96 uint32 restart_index_; // Index of restart block in which current_ fall
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/types/ |
| scope.go | 11 var blockgen int32 = 1 // max block number
12 var Block int32 // current block number
15 // restored once the block scope ends.
19 block int32
24 // Popdcl can restore their declarations when a block scope ends.
28 // it can be shadowed by a new declaration within a nested block scope.
33 block: s.Block,
38 // Popdcl pops the innermost block scope and restores all symbol declaration
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/vet/internal/cfg/ |
| cfg.go | 59 Blocks []*Block // block[0] is entry; order otherwise undefined
62 // A Block represents a basic block: a list of statements and
65 // A block may have 0-2 successors: zero for a return block or a block
67 // normal (jump) block; and two for a conditional (if) block.
68 type Block struct
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/types/ |
| scope.go | 11 var blockgen int32 = 1 // max block number
12 var Block int32 // current block number
15 // restored once the block scope ends.
19 block int32
24 // Popdcl can restore their declarations when a block scope ends.
28 // it can be shadowed by a new declaration within a nested block scope.
33 block: s.Block,
38 // Popdcl pops the innermost block scope and restores all symbol declaration
[all...] |
| /prebuilts/go/linux-x86/src/cmd/vet/internal/cfg/ |
| cfg.go | 59 Blocks []*Block // block[0] is entry; order otherwise undefined
62 // A Block represents a basic block: a list of statements and
65 // A block may have 0-2 successors: zero for a return block or a block
67 // normal (jump) block; and two for a conditional (if) block.
68 type Block struct
[all...] |
| /external/valgrind/none/tests/amd64/ |
| movbe.c | 13 typedef struct { UChar cs[40]; } Block;
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/valgrind/none/tests/x86/ |
| movbe.c | 13 typedef struct { UChar cs[40]; } Block;
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)); \
|
| /system/update_engine/payload_generator/ |
| inplace_generator.h | 54 // Represents a disk block on the install partition.
55 struct Block {
56 // During install, each block on the install partition will be written
60 // A Block object tells which vertex will read or write this block
62 // Generally, there will be a vector of Block objects whose length
64 Block() : reader(Vertex::kInvalidIndex), writer(Vertex::kInvalidIndex) {}
97 // Creates all the edges for the graph. Writers of a block point to
98 // readers of the same block. This is because for an edge A->B, B
101 const std::vector<Block>& blocks)
[all...] |
| /external/deqp/framework/delibs/decpp/ |
| deAppendList.hpp | 46 * current block runs out, allocation of next block will happen in a single
47 * thread and block others from inserting further elements until completed.
68 struct Block
72 Block* volatile next;
74 Block (size_t blockNdx_, size_t size)
82 ~Block (void)
90 Block* m_first;
91 Block* volatile m_last;
98 Iterator (Block* curBlock_, size_t blockSize_, size_t slotNdx_
[all...] |
| /frameworks/base/tools/aapt2/util/ |
| BigBuffer.h | 35 * block is allocated and appended to the end of the list.
40 * A contiguous block of allocated memory.
42 struct Block {
58 * The size of the memory block allocation.
63 typedef std::vector<Block>::const_iterator const_iterator;
66 * Create a BigBuffer with block allocation sizes
86 * Returns the next block available and puts the size in out_count.
106 * Pads the block with 'bytes' bytes of zero values.
111 * Pads the block so that it aligns on a 4 byte boundary.
133 std::vector<Block> blocks_
157 Block& block = blocks_.back(); local
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| block.go | 12 // Block represents a basic block in the control flow graph of a function.
13 type Block struct {
14 // A unique identifier for the block. The system will attempt to allocate
18 // Source position for block's control operation
21 // The kind of block this is.
31 // After flagalloc, records whether flags are live at the end of the block.
34 // Subsequent blocks, if any. The number and order depend on the block kind.
38 // The order is significant to Phi nodes in the block.
40 // arguments by block id and have this field computed explicitly when needed
[all...] |
| /prebuilts/go/darwin-x86/src/encoding/pem/ |
| pem.go | 19 // A Block represents a PEM encoded structure.
27 type Block struct {
74 // Decode will find the next PEM formatted block (certificate, private key
75 // etc) in the input. It returns that block and the remainder of the input. If
78 func Decode(data []byte) (p *Block, rest []byte) {
96 p = &Block{
167 // leading newline if the PEM block was empty.
173 func decodeError(data, rest []byte) (*Block, []byte) {
175 // ultimately invalid PEM block. We need to start over from a new
179 // the preamble line for the any subsequent block. Thus, we will alway
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| block.go | 12 // Block represents a basic block in the control flow graph of a function.
13 type Block struct {
14 // A unique identifier for the block. The system will attempt to allocate
18 // Source position for block's control operation
21 // The kind of block this is.
31 // After flagalloc, records whether flags are live at the end of the block.
34 // Subsequent blocks, if any. The number and order depend on the block kind.
38 // The order is significant to Phi nodes in the block.
40 // arguments by block id and have this field computed explicitly when needed
[all...] |
| /prebuilts/go/linux-x86/src/encoding/pem/ |
| pem.go | 19 // A Block represents a PEM encoded structure.
27 type Block struct {
74 // Decode will find the next PEM formatted block (certificate, private key
75 // etc) in the input. It returns that block and the remainder of the input. If
78 func Decode(data []byte) (p *Block, rest []byte) {
96 p = &Block{
167 // leading newline if the PEM block was empty.
173 func decodeError(data, rest []byte) (*Block, []byte) {
175 // ultimately invalid PEM block. We need to start over from a new
179 // the preamble line for the any subsequent block. Thus, we will alway
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Sd/EmmcBlockIoPei/ |
| EmmcHcMem.c | 19 Allocate a block of memory to be used by the buffer pool.
23 @return The allocated memory block or NULL if failed.
31 EMMC_PEIM_MEM_BLOCK *Block;
37 Block = NULL;
48 // bytes of memory in the memory block.
52 Block = (EMMC_PEIM_MEM_BLOCK*)(UINTN)TempPtr;
53 Block->BufLen = EFI_PAGES_TO_SIZE (Pages);
54 Block->BitsLen = Block->BufLen / (EMMC_PEIM_MEM_UNIT * 8);
56 Status = PeiServicesAllocatePool (Block->BitsLen, &TempPtr);
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Sd/SdBlockIoPei/ |
| SdHcMem.c | 19 Allocate a block of memory to be used by the buffer pool.
23 @return The allocated memory block or NULL if failed.
31 SD_PEIM_MEM_BLOCK *Block;
37 Block = NULL;
48 // bytes of memory in the memory block.
52 Block = (SD_PEIM_MEM_BLOCK*)(UINTN)TempPtr;
53 Block->BufLen = EFI_PAGES_TO_SIZE (Pages);
54 Block->BitsLen = Block->BufLen / (SD_PEIM_MEM_UNIT * 8);
56 Status = PeiServicesAllocatePool (Block->BitsLen, &TempPtr);
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Ufs/UfsBlockIoPei/ |
| UfsHcMem.c | 19 Allocate a block of memory to be used by the buffer pool.
23 @return The allocated memory block or NULL if failed.
31 UFS_PEIM_MEM_BLOCK *Block;
37 Block = NULL;
48 // bytes of memory in the memory block.
52 Block = (UFS_PEIM_MEM_BLOCK*)(UINTN)TempPtr;
53 Block->BufLen = EFI_PAGES_TO_SIZE (Pages);
54 Block->BitsLen = Block->BufLen / (UFS_PEIM_MEM_UNIT * 8);
56 Status = PeiServicesAllocatePool (Block->BitsLen, &TempPtr);
[all...] |
| /device/linaro/bootloader/edk2/NetworkPkg/HttpBootDxe/ |
| HttpBootClient.h | 28 // Record the data length and start address of a data block.
32 UINT8 *Block; // If NULL, the data is in previous data block.
33 UINT8 *DataStart; // Point to somewhere in the Block
59 UINT8 *Block;
|
