HomeSort by relevance Sort by last modified time
    Searched refs:block (Results 501 - 525 of 4734) sorted by null

<<21222324252627282930>>

  /external/kotlinc/lib/
kotlin-stdlib-jdk7.jar 
kotlin-stdlib-jre7.jar 
  /external/libvpx/libvpx/vp8/common/
invtrans.h 40 /* do 2nd order transform on the dc block */
42 vp8_short_inv_walsh4x4(&xd->block[24].dqcoeff[0], xd->qcoeff);
44 vp8_short_inv_walsh4x4_1(&xd->block[24].dqcoeff[0], xd->qcoeff);
  /external/mesa3d/src/compiler/nir/
nir_gs_count_vertices.c 63 * end block. So we don't need to walk all of them.
67 nir_block *block = (nir_block *) entry->key; local
69 nir_foreach_instr_reverse(instr, block) {
nir_worklist.h 41 * The worklist datastructure guarantees that eacy block is in the queue at
42 * most once. Pushing a block onto either end of the queue is a no-op if
43 * the block is already in the queue. In order for this to work, the
75 void nir_block_worklist_push_head(nir_block_worklist *w, nir_block *block);
81 void nir_block_worklist_push_tail(nir_block_worklist *w, nir_block *block);
  /external/mesa3d/src/mesa/drivers/dri/i965/
brw_fs_sel_peephole.cpp 129 foreach_block (block, cfg) {
133 fs_inst *if_inst = (fs_inst *)block->end();
140 bblock_t *then_block = block->next();
142 foreach_list_typed(bblock_link, child, link, &block->children) {
143 if (child->block != then_block) {
144 if (child->block->prev()->end()->opcode == BRW_OPCODE_ELSE) {
145 else_block = child->block;
190 .at(block, if_inst);
  /external/squashfs-tools/kernel/fs/squashfs/
Makefile 6 squashfs-y += block.o cache.o dir.o export.o file.o fragment.o id.o inode.o
  /external/squashfs-tools/kernel-2.4/include/linux/
squashfs_fs_sb.h 30 long long block; member in struct:squashfs_cache
37 long long block; member in struct:squashfs_fragment_cache
  /external/syslinux/core/fs/
diskio.c 14 void getoneblk(struct disk *disk, char *buf, block_t block, int block_size)
18 disk->rdwr_sectors(disk, buf, block * sec_per_block, sec_per_block, 0);
  /external/syslinux/gpxe/src/include/gpxe/
tftp.h 15 #define TFTP_DEFAULT_BLKSIZE 512 /**< Default TFTP data block size */
20 #define TFTP_DATA 3 /**< Data block opcode */
21 #define TFTP_ACK 4 /**< Data block acknowledgement opcode */
45 uint16_t block; member in struct:tftp_data
52 uint16_t block; member in struct:tftp_ack
  /external/v8/src/compiler/arm/
unwinding-info-writer-arm.h 31 void BeginInstructionBlock(int pc_offset, const InstructionBlock* block);
32 void EndInstructionBlock(const InstructionBlock* block);
  /external/v8/src/compiler/arm64/
unwinding-info-writer-arm64.h 31 void BeginInstructionBlock(int pc_offset, const InstructionBlock* block);
32 void EndInstructionBlock(const InstructionBlock* block);
  /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...]
  /external/v8/src/crankshaft/
hydrogen-environment-liveness.h 30 void ZapEnvironmentSlotsInSuccessors(HBasicBlock* block, BitVector* live);
32 void UpdateLivenessAtBlockEnd(HBasicBlock* block, BitVector* live);
44 // Per-block data. All these lists are indexed by block_id.
  /external/valgrind/memcheck/tests/
exitprog.stderr.exp 3 Address 0x........ is 0 bytes after a block of size 1,000,000 alloc'd
fwrite.stderr.exp 4 Address 0x........ is 0 bytes inside a block of size 10 alloc'd
inline.stderr.exp 4 Address 0x........ is 0 bytes after a block of size 40 alloc'd
  /external/wpa_supplicant_8/src/utils/
base64.c 87 unsigned char dtable[256], *out, *pos, block[4], tmp; local
126 block[count] = tmp;
129 *pos++ = (block[0] << 2) | (block[1] >> 4);
130 *pos++ = (block[1] << 4) | (block[2] >> 2);
131 *pos++ = (block[2] << 6) | block[3];
  /frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/
fastcodemb.h 32 Int(*DCT)(Int block[ ], Int coeff[ ], approxDCT *);
55 Int getBlockSAV(Int block[]);
60 Int AppVCA1_dct(Int block[], Int out[ ], approxDCT *function);
61 Int AppVCA2_dct(Int block[], Int out[ ], approxDCT *function);
62 Int AppVCA3_dct(Int block[], Int out[ ], approxDCT *function);
63 Int AppVCA4_dct(Int block[], Int out[ ], approxDCT *function);
64 Int AppVCA5_dct(Int block[], Int out[ ], approxDCT *function);
97 void BlockIDCTMotionComp(Int *block, UChar *bitmapcol, UChar bitmaprow,
  /frameworks/base/libs/androidfw/tests/
Idmap_test.cpp 64 ssize_t block = target_table_.getResource(R::string::test2, &val, false); local
65 ASSERT_GE(block, 0);
67 const ResStringPool* pool = target_table_.getTableStringBlock(block);
81 ASSERT_NE(block, new_block);
117 ssize_t block = table.getResource(kNonOverlaidResourceId, &val, false /*mayBeBag*/); local
118 ASSERT_GE(block, 0);
123 block = target_table_.getResource(kNonOverlaidResourceId, &val, false /*mayBeBag*/);
124 ASSERT_LT(block, 0);
  /frameworks/support/navigation/common/ktx/src/main/java/androidx/navigation/
NavDestinationBuilder.kt 71 fun action(actionId: Int, block: NavActionBuilder.() -> Unit) {
72 actions[actionId] = NavActionBuilder().apply(block).build()
108 fun navOptions(block: NavOptionsBuilder.() -> Unit) {
109 navOptions = NavOptionsBuilder().apply(block).build()
  /hardware/interfaces/tests/memory/1.0/
IMemoryTest.hal 20 import android.hidl.memory.block@1.0::MemoryBlock;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/include/cloog/
block.h 5 ** block.h **
48 * this structure contains the informations of a statement block. It may happen
52 * to save time and memory by trying to find these blocks itself. The block
63 CloogStatement * statement ; /**< The list of statements in the block. */
66 int depth ; /**< Original block depth (outer loop number).*/
81 { CloogBlock * block ; /**< An element of the list. */ member in struct:cloogblocklist
110 CloogBlock * cloog_block_copy(CloogBlock * block) ;
  /prebuilts/go/darwin-x86/src/crypto/md5/
md5block_generic.go 9 var block = blockGeneric var
  /prebuilts/go/darwin-x86/src/crypto/sha1/
sha1block_decl.go 11 func block(dig *digest, p []byte) func

Completed in 520 milliseconds

<<21222324252627282930>>