| /external/libvpx/libvpx/ |
| webmdec.cc | 40 webm_ctx->block = NULL;
132 const mkvparser::Block *block = local
133 reinterpret_cast<const mkvparser::Block *>(webm_ctx->block);
153 } else if (block == NULL ||
154 webm_ctx->block_frame_index == block->GetFrameCount() ||
155 block->GetTrackNumber() != webm_ctx->video_track_index) {
167 block = block_entry->GetBlock();
168 if (block == NULL) return -1
[all...] |
| /external/mdnsresponder/mDNSShared/ |
| dnsextd_parser.y | 356 block: label
366 block
|
| /external/mesa3d/src/compiler/nir/ |
| nir_liveness.c | 35 * blocks so that the destinations of a phi are in the livein of the block
37 * corresponding block. By formulating the liveness information in this
42 * block but not in the live-in of the block containing the phi node.
65 /* Initialize the liveness data to zero and add the given block to the
69 init_liveness_block(nir_block *block,
72 block->live_in = reralloc(block, block->live_in, BITSET_WORD,
74 memset(block->live_in, 0, state->bitset_words * sizeof(BITSET_WORD))
195 nir_block *block = nir_block_worklist_pop_head(&state.worklist); local
[all...] |
| nir_lower_io_to_temporaries.c | 83 nir_foreach_block(block, impl) {
84 nir_foreach_instr(instr, block) {
102 * the jumps to the end block.
106 struct nir_block *block = (void *)block_entry->key; local
107 nir_cursor cursor = nir_after_block_before_jump(block);
|
| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| lp_bld_flow.h | 48 * Early exit. Useful to skip to the end of a function or block when
55 /** Block to skip to */
56 LLVMBasicBlockRef block; member in struct:lp_build_skip_context
113 LLVMBasicBlockRef block; member in struct:lp_build_loop_state
|
| /external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
| pb_bufmgr_mm.c | 82 struct mem_block *block; member in struct:mm_buffer
103 u_mmFreeMem(mm_buf->block);
119 return (unsigned char *) mm->map + mm_buf->block->ofs;
159 *offset += mm_buf->block->ofs;
204 mm_buf->block = u_mmAllocMem(mm->heap, (int)size, (int)mm->align2, 0);
205 if(!mm_buf->block) {
216 assert(0 <= (pb_size)mm_buf->block->ofs && (pb_size)mm_buf->block->ofs < mm->size);
217 assert(size <= (pb_size)mm_buf->block->size && (pb_size)mm_buf->block->ofs + (pb_size)mm_buf->block->size <= mm->size)
[all...] |
| /external/mesa3d/src/gallium/drivers/freedreno/ir3/ |
| ir3_group.c | 53 ir3_MOV(instr->block, instr, TYPE_F32);
66 in = ir3_instr_create(instr->block, OPC_META_INPUT);
67 in->inout.block = instr->block;
89 ir3_MOV(instr->block, instr, TYPE_F32);
204 struct ir3_block *block = NULL; local
209 block = instr->block;
210 } else if (block) {
211 instr = ir3_NOP(block);
[all...] |
| /external/mesa3d/src/intel/vulkan/tests/ |
| block_pool_no_free.c | 44 int32_t block, *data; local
47 block = anv_block_pool_alloc(job->pool);
48 data = job->pool->map + block;
49 *data = block;
50 assert(block >= 0);
51 job->blocks[i] = block;
53 block = anv_block_pool_alloc_back(job->pool);
54 data = job->pool->map + block;
55 *data = block;
56 assert(block < 0)
[all...] |
| /external/mesa3d/src/mesa/main/ |
| program_resource.c | 151 struct gl_uniform_block *block = local
154 *params = MAX2(*params, block->NumUniforms);
161 struct gl_uniform_block *block = local
165 for (unsigned j = 0; j < block->NumUniforms; j++) {
166 const char *iname = block->Uniforms[j].IndexName;
|
| /external/mesa3d/src/util/sha1/ |
| sha1.c | 28 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
29 |(rol(block->l[i],8)&0x00FF00FF))
31 # define blk0(i) block->l[i]
33 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
34 ^block->l[(i+2)&15]^block->l[i&15],1))
51 * Hash a single 512-bit block. This is the core of the algorithm
58 CHAR64LONG16 *block = (CHAR64LONG16 *)workspace; local
[all...] |
| /external/mmc-utils/3rdparty/hmac_sha/ |
| sha2.h | 65 unsigned char block[2 * SHA256_BLOCK_SIZE]; member in struct:__anon30710
72 unsigned char block[2 * SHA512_BLOCK_SIZE]; member in struct:__anon30711
|
| /external/pdfium/core/fdrm/crypto/ |
| fx_crypt.h | 22 void (*encrypt)(CRYPT_aes_context* ctx, unsigned int* block);
23 void (*decrypt)(CRYPT_aes_context* ctx, unsigned int* block);
39 unsigned char block[64]; member in struct:CRYPT_sha1_context
|
| /external/ppp/pppd/ |
| sha1.c | 31 #define blk0(i) (block->l[i] = htonl(block->l[i]))
32 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
33 ^block->l[(i+2)&15]^block->l[i&15],1))
43 /* Hash a single 512-bit block. This is the core of the algorithm. */
53 CHAR64LONG16 *block; local
57 block = (CHAR64LONG16 *) workspace
[all...] |
| /external/protobuf/ruby/src/main/java/com/google/protobuf/jruby/ |
| RubyOneofDescriptor.java | 11 import org.jruby.runtime.Block;
93 * OneofDescriptor.each(&block) => nil
95 * Iterates through fields in this oneof, yielding to the block on each one.
98 public IRubyObject each(ThreadContext context, Block block) {
100 block.yieldSpecific(context, field);
|
| /external/python/cpython3/Modules/_blake2/ |
| blake2b_impl.c | 110 /* Zero parameter block. */
224 /* Process key block if any. */
226 uint8_t block[BLAKE2B_BLOCKBYTES]; local
227 memset(block, 0, sizeof(block));
228 memcpy(block, key->buf, key->len);
229 blake2b_update(&self->state, block, sizeof(block));
230 secure_zero_memory(block, sizeof(block));
[all...] |
| blake2s_impl.c | 110 /* Zero parameter block. */
224 /* Process key block if any. */
226 uint8_t block[BLAKE2S_BLOCKBYTES]; local
227 memset(block, 0, sizeof(block));
228 memcpy(block, key->buf, key->len);
229 blake2s_update(&self->state, block, sizeof(block));
230 secure_zero_memory(block, sizeof(block));
[all...] |
| /external/selinux/libselinux/src/ |
| sha1.c | 17 // CHAR64LONG16* block = (CHAR64LONG16*) workspace;
46 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
47 |(rol(block->l[i],8)&0x00FF00FF))
49 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
50 ^block->l[(i+2)&15]^block->l[i&15],1))
63 // Hash a single 512-bit block. This is the core of the algorith
79 CHAR64LONG16* block = &workspace; local
[all...] |
| /external/selinux/libsepol/src/ |
| avrule_block.c | 3 * Functions that manipulate a logical block (conditional, optional,
31 * block than the global policy. Thus the symbol table sizes are
46 avrule_block_t *block; local
47 if ((block = calloc(1, sizeof(*block))) == NULL) {
50 return block;
152 * marked as SCOPE_DECL, and any of its declaring block has been enabled,
|
| /external/skia/src/gpu/ |
| GrMemoryPool.cpp | 67 BlockHeader* block = CreateBlock(blockSize); local
69 block->fPrev = fTail;
70 block->fNext = nullptr;
72 fTail->fNext = block;
73 fTail = block;
74 fSize += block->fSize;
80 // We stash a pointer to the block header, just before the allocated space,
105 BlockHeader* block = allocData->fHeader; local
106 SkASSERT(kAssignedMarker == block->fBlockSentinal);
107 if (1 == block->fLiveCount)
142 BlockHeader* block = local
163 BlockHeader* block = fHead; local
[all...] |
| /external/skqp/src/gpu/ |
| GrMemoryPool.cpp | 67 BlockHeader* block = CreateBlock(blockSize); local
69 block->fPrev = fTail;
70 block->fNext = nullptr;
72 fTail->fNext = block;
73 fTail = block;
74 fSize += block->fSize;
80 // We stash a pointer to the block header, just before the allocated space,
105 BlockHeader* block = allocData->fHeader; local
106 SkASSERT(kAssignedMarker == block->fBlockSentinal);
107 if (1 == block->fLiveCount)
142 BlockHeader* block = local
163 BlockHeader* block = fHead; local
[all...] |
| /external/squashfs-tools/kernel/fs/squashfs/ |
| dir.c | 46 * metadata block containing it.
108 u64 block = squashfs_i(inode)->start + msblk->directory_table; local
115 TRACE("Entered squashfs_readdir [%llx:%x]\n", block, offset);
158 length = get_dir_index_using_offset(inode->i_sb, &block, &offset,
168 err = squashfs_read_metadata(inode->i_sb, &dirh, &block,
180 err = squashfs_read_metadata(inode->i_sb, dire, &block,
188 &block, &offset, size);
226 ERROR("Unable to read directory block [%llx:%x]\n", block, offset);
|
| namei.c | 30 * decompressed block (<block, offset>).
35 * compressed metadata block, and therefore, can share the start block.
37 * header containing the shared start block value, and a sequence of directory
38 * entries, each of which share the shared start block. A new directory header
39 * is written once/if the inode start block changes. The directory
45 * in each metadata block. Directories are sorted in alphabetical order,
48 * location of the metadata block the filename is in has been found.
49 * The general idea of the index is ensure only one metadata block needs to b
144 u64 block = squashfs_i(dir)->start + msblk->directory_table; local
[all...] |
| /external/syslinux/core/fs/ufs/ |
| bmap.c | 46 * Block spans 8 fragments, then address is interleaved by 8.
83 * The actual indirect block map handling - the block passed in should
84 * be relative to the beginning of the particular block hierarchy.
86 * @shft_per_blk: shift to get nr. of addresses in a block.
87 * @mask_per_blk: mask to limit the max nr. of addresses in a block.
88 * @addr_count: nr. of addresses in a block.
91 bmap_indirect(struct fs_info *fs, uint64_t start, uint32_t block,
108 index = (block >> (levels * shft_per_blk)) & mask_per_blk;
117 * Handle the traditional block map, like indirect, double indirec
178 block_t block; local
[all...] |
| /external/syslinux/gpxe/src/crypto/axtls/ |
| rsa.c | 133 uint8_t *block; local
148 /* convert to a normal block */
149 block = (uint8_t *)malloc(byte_size);
150 bi_export(ctx->bi_ctx, decrypted_bi, block, byte_size);
157 while (block[i++] == 0xff && i < byte_size);
159 if (block[i-2] != 0xff)
165 while (block[i++] && i < byte_size);
171 memcpy(out_data, &block[i], size);
173 free(block);
263 out_data[0] = 0; /* ensure encryption block is < modulus *
[all...] |
| /external/v8/src/compiler/ |
| basic-block-instrumentor.cc | 5 #include "src/compiler/basic-block-instrumentor.h"
22 // Find the first place to insert new nodes in a block that's already been
24 static NodeVector::iterator FindInsertionPoint(BasicBlock* block) {
25 NodeVector::iterator i = block->begin();
26 for (; i != block->end(); ++i) {
53 // Skip the exit block in profiles, since the register allocator can't handle
70 // Add the increment instructions to the start of every block.
79 BasicBlock* block = (*it); local
80 data->SetBlockId(block_number, block->id().ToSize());
96 NodeVector::iterator insertion_point = FindInsertionPoint(block);
[all...] |
