| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaRenamer.java | 57 * a mapping table for the current block being processed. Once the
58 * current block has been processed, this mapping table is then copied
78 * indexed by block index; register version state for each block start.
141 // Initial state for entry block
163 // Rename each block in dom-tree DFS order.
166 public void visitBlock (SsaBasicBlock block,
168 new BlockRenamer(block).process();
275 * Processes all insns in a block and renames their registers
279 /** {@code non-null;} block we're processing. *
280 private final SsaBasicBlock block; field in class:SsaRenamer.BlockRenamer
[all...] |
| DeadCodeRemover.java | 29 * block to entry block.
123 * Removes all instructions from every unreachable block.
133 SsaBasicBlock block = blocks.get(blockIndex); local
137 for (int i = 0; i < block.getInsns().size(); i++) {
138 SsaInsn insn = block.getInsns().get(i);
210 * if the insn is null for reasons stated in the code block.
|
| NormalSsaInsn.java | 37 * @param block block that contains this insn
39 NormalSsaInsn(final Insn insn, final SsaBasicBlock block) {
40 super(insn.getResult(), block); local
|
| PhiInsn.java | 57 * @param block block containing this insn.
59 public PhiInsn(RegisterSpec resultReg, SsaBasicBlock block) {
60 super(resultReg, block);
68 * @param block block containing this insn.
70 public PhiInsn(final int resultReg, final SsaBasicBlock block) {
75 super(RegisterSpec.make(resultReg, Type.VOID), block); local
130 * @param predBlock predecessor block to be associated with this operand
161 * Gets the index of the pred block associated with the RegisterSpe
[all...] |
| /art/compiler/optimizing/ |
| codegen_test.cc | 458 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0];
460 block->InsertInstructionBefore(move, block->GetLastInstruction());
504 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0];
507 block->InsertInstructionBefore(move, block->GetLastInstruction());
571 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0];
574 block->InsertInstructionBefore(move, block->GetLastInstruction());
613 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph) local
842 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); local
[all...] |
| dead_code_elimination.cc | 39 HBasicBlock* block = worklist.back(); local
41 int block_id = block->GetBlockId();
44 ArrayRef<HBasicBlock* const> live_successors(block->GetSuccessors());
45 HInstruction* last_instruction = block->GetLastInstruction();
72 DCHECK_EQ(live_successors[0], block->GetSuccessors()[switch_index]);
90 void HDeadCodeElimination::MaybeRecordDeadBlock(HBasicBlock* block) {
93 block->GetPhis().CountSize() + block->GetInstructions().CountSize());
149 static bool RemoveNonNullControlDependences(HBasicBlock* block, HBasicBlock* throws) {
151 if (!block->EndsWithIf())
430 HBasicBlock* block = graph_->GetReversePostOrder()[i]; local
[all...] |
| scheduler_arm64.cc | 189 HBasicBlock* block = instruction->GetBlock(); local
190 DCHECK((block->GetLoopInformation() != nullptr) ||
191 (block->IsEntryBlock() && instruction->GetNext()->IsGoto()));
|
| ssa_liveness_analysis.cc | 39 // Each instruction gets a lifetime position, and a block gets a lifetime
41 // the block they are in. Phi instructions have the lifetime start of their block as
48 for (HBasicBlock* block : graph_->GetLinearOrder()) {
49 block->SetLifetimeStart(lifetime_position);
51 for (HInstructionIterator inst_it(block->GetPhis()); !inst_it.Done(); inst_it.Advance()) {
65 // Add a null marker to notify we are starting a block.
68 for (HInstructionIterator inst_it(block->GetInstructions()); !inst_it.Done();
84 block->SetLifetimeEnd(lifetime_position);
90 for (HBasicBlock* block : graph_->GetLinearOrder())
341 HBasicBlock* block = liveness.GetBlockFromPosition(GetStart() \/ 2); local
[all...] |
| /bionic/libc/kernel/uapi/linux/ |
| i2c.h | 66 __u8 block[I2C_SMBUS_BLOCK_MAX + 2]; member in union:i2c_smbus_data
|
| /bootable/recovery/ |
| fuse_sideload.cpp | 83 uint32_t block_size; // block size that the adb host is using to send the file to us
89 uint32_t curr_block; // cache the block most recently read from the host
92 uint8_t* extra_block; // another block of storage for reads that span two blocks
95 hashes; // SHA-256 hash of each block (all zeros if block hasn't been read yet)
226 // Fetch a block from the host into fd->curr_block and fd->block_data.
228 static int fetch_block(fuse_data* fd, uint32_t block) {
229 if (block == fd->curr_block) {
233 if (block >= fd->file_blocks) {
235 fd->curr_block = block;
302 uint32_t block = offset \/ fd->block_size; local
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| StdCatchBuilder.java | 41 /** {@code non-null;} block output order */
44 /** {@code non-null;} address objects for each block */
52 * @param order {@code non-null;} block output order
53 * @param addresses {@code non-null;} address objects for each block
85 BasicBlock block = blocks.get(i); local
86 TypeList catches = block.getLastInsn().getCatches();
102 BasicBlock block = blocks.get(i); local
103 TypeList catches = block.getLastInsn().getCatches();
118 * @param order {@code non-null;} block output order
119 * @param addresses {@code non-null;} address objects for each block
133 BasicBlock block = blocks.labelToBlock(order[i]); local
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| LocalVariableExtractor.java | 30 /** {@code non-null;} block list for the method */
87 * Processes a single block.
89 * @param label {@code >= 0;} label of the block to process
93 BasicBlock block = blocks.labelToBlock(label); local
94 InsnList insns = block.getInsns();
104 boolean canThrowDuringLastInsn = block.hasExceptionHandlers() &&
174 * where the start state for a block changes).
177 IntList successors = block.getSuccessors();
179 int primarySuccessor = block.getPrimarySuccessor();
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| StdCatchBuilder.java | 40 /** {@code non-null;} block output order */
43 /** {@code non-null;} address objects for each block */
51 * @param order {@code non-null;} block output order
52 * @param addresses {@code non-null;} address objects for each block
86 BasicBlock block = blocks.get(i); local
87 TypeList catches = block.getLastInsn().getCatches();
104 BasicBlock block = blocks.get(i); local
105 TypeList catches = block.getLastInsn().getCatches();
120 * @param order {@code non-null;} block output order
121 * @param addresses {@code non-null;} address objects for each block
135 BasicBlock block = blocks.labelToBlock(order[i]); local
[all...] |
| /dalvik/dx/src/com/android/dx/rop/code/ |
| LocalVariableExtractor.java | 30 /** {@code non-null;} block list for the method */
87 * Processes a single block.
89 * @param label {@code >= 0;} label of the block to process
93 BasicBlock block = blocks.labelToBlock(label); local
94 InsnList insns = block.getInsns();
104 boolean canThrowDuringLastInsn = block.hasExceptionHandlers() &&
174 * where the start state for a block changes).
177 IntList successors = block.getSuccessors();
179 int primarySuccessor = block.getPrimarySuccessor();
|
| /dalvik/libdex/ |
| sha1.cpp | 114 #define blk0(i) (block->l[i]=(rol(block->l[i],24)&0xFF00FF00) \
115 |(rol(block->l[i],8)&0x00FF00FF))
117 #define blk0(i) block->l[i]
119 #define blk(i) (block->l[(i)&15] = rol(block->l[((i)+13)&15]^block->l[((i)+8)&15] \
120 ^block->l[((i)+2)&15]^block->l[(i)&15],1))
130 /* Hash a single 512-bit block. This is the core of the algorithm. *
140 CHAR64LONG16* block; local
[all...] |
| /device/google/contexthub/firmware/os/platform/stm32/ |
| gpio.c | 98 struct StmGpio *block = (struct StmGpio*)mGpioBases[gpioNum >> GPIO_PORT_SHIFT]; local
108 block->OSPEEDR = (block->OSPEEDR & ~mask_2b) | (((uint32_t)gpioSpeedFromRequestedSpeed(gpioSpeed)) << shift_2b);
111 block->PUPDR = (block->PUPDR & ~mask_2b) | (((uint32_t)pull) << shift_2b);
114 block->OTYPER &= ~mask_1b;
116 block->OTYPER |= mask_1b;
121 struct StmGpio *block = (struct StmGpio*)mGpioBases[gpioNum >> GPIO_PORT_SHIFT]; local
128 block->MODER = (block->MODER & ~mask_2b) | (((uint32_t)GPIO_MODE_IN) << shift_2b)
139 struct StmGpio *block = (struct StmGpio*)mGpioBases[gpioNum >> GPIO_PORT_SHIFT]; local
160 struct StmGpio *block = (struct StmGpio*)mGpioBases[gpioNum >> GPIO_PORT_SHIFT]; local
186 struct StmGpio *block = (struct StmGpio*)mGpioBases[gpioNum >> GPIO_PORT_SHIFT]; local
205 struct StmGpio *block = (struct StmGpio*)mGpioBases[gpioNum >> GPIO_PORT_SHIFT]; local
221 struct StmGpio *block = (struct StmGpio*)mGpioBases[gpioNum >> GPIO_PORT_SHIFT]; local
240 struct StmGpio *block = (struct StmGpio*)mGpioBases[DEBUG_UART_PIN >> GPIO_PORT_SHIFT]; local
[all...] |
| /device/google/contexthub/util/nanoapp_sign/ |
| nanoapp_sign.c | 236 int block = 0; local
265 for (block = 0; block < nSig; ++block) {
267 fprintf(stderr, "Signature verification failed: signature block #%d\n", block);
271 fprintf(stderr, "Key in block %d is trusted\n", block);
348 fprintf(stderr, "Invalid signature block(s) detected\n");
|
| /device/linaro/bootloader/arm-trusted-firmware/plat/socionext/uniphier/ |
| uniphier_nand.c | 74 static int uniphier_nand_block_isbad(struct uniphier_nand *nand, int block)
76 int page = nand->pages_per_block * block;
83 if (block < ARRAY_SIZE(nand->bbt) &&
84 nand->bbt[block] != UNIPHIER_NAND_BBT_UNKNOWN)
85 return nand->bbt[block];
110 if (block < ARRAY_SIZE(nand->bbt))
111 nand->bbt[block] = is_bad;
114 WARN("found bad block at %d. skip.\n", block);
169 int block = 0 local
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| SerializedGrammar.java | 49 Block block; field in class:SerializedGrammar.Rule
50 public Rule(String name, Block block) {
52 this.block = block;
55 return name+":"+block;
59 class Block {
61 public Block(List[] alts) {
127 Block b = readBlock(in)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| SuballocatedIntVector.java | 76 * block size is currently 2K, which may be overkill for
85 * Construct a IntVector, using the given block size and number
89 * @param blocksize Size of block to allocate
108 /** Construct a IntVector, using the given block size and
111 * @param blocksize Size of block to allocate
171 int[] block=m_map[index]; local
172 if(null==block)
173 block=m_map[index]=new int[m_blocksize];
174 block[offset]=value;
178 m_buildCache = block;
211 int[] block=m_map[index]; local
269 int[] block=m_map[index]; local
288 int[] block=m_map[index]; local
357 int[] block=m_map[index]; local
404 int[] block=m_map[index]; local
476 int[] block; local
529 int[] block=m_map[index]; local
[all...] |
| /external/autotest/client/tests/disktest/src/ |
| disktest.c | 51 * Fill a block with it's own sector number
54 void write_block(int fd, unsigned int block, struct pattern *buffer)
61 sector = (block * sectors_per_block) + sec_offset;
70 offset = block; offset *= blocksize; // careful of overflow
73 fprintf(stderr, "Write failed : file %s : block %d\n", filename, block);
79 * Verify a block contains the correct signature and sector numbers for
80 * each sector within that block. We check every copy within the sector
85 int verify_block(int fd, unsigned int block, struct pattern *buffer, char *err)
92 offset = block; offset *= blocksize; // careful of overflo
138 unsigned int block; local
181 unsigned int block; local
232 unsigned int block, errors = 0; local
246 unsigned int block; local
[all...] |
| /external/boringssl/src/crypto/cipher_extra/ |
| tls_cbc.c | 69 // MAX_HASH_BLOCK_SIZE is the maximum hash block size that we'll support.
70 // Currently SHA-384/512 has a 128-byte block size and that's the largest
113 // Always treat |padding_length| as zero on error. If, assuming block size of
215 static void tls1_sha1_transform(HASH_CTX *ctx, const uint8_t *block) {
216 SHA1_Transform(&ctx->sha1, block);
219 static void tls1_sha256_transform(HASH_CTX *ctx, const uint8_t *block) {
220 SHA256_Transform(&ctx->sha256, block);
223 static void tls1_sha512_transform(HASH_CTX *ctx, const uint8_t *block) {
224 SHA512_Transform(&ctx->sha512, block);
273 void (*md_transform)(HASH_CTX *ctx, const uint8_t *block);
416 uint8_t block[MAX_HASH_BLOCK_SIZE]; local
[all...] |
| /external/boringssl/src/crypto/fipsmodule/modes/ |
| gcm.c | 421 block128_f block, int is_aesni_encrypt) {
423 ctx->block = block;
427 (*block)(gcm_key, gcm_key, aes_key);
480 (*ctx->block)(ctx->Yi.c, ctx->EK0.c, key);
556 block128_f block = ctx->block; local
598 (*block)(ctx->Yi.c, ctx->EKi.c, key);
617 (*block)(ctx->Yi.c, ctx->EKi.c, key);
634 (*block)(ctx->Yi.c, ctx->EKi.c, key)
682 block128_f block = ctx->block; local
[all...] |
| /external/bzip2/ |
| compress.c | 3 /*--- Compression machinery (not incl block sorting) ---*/
9 lossless, block-sorting data compression.
133 holds the original block data.
139 than block values, ptr values in this area are overwritten
151 UChar* block = s->block; local
167 ll_i = s->unseqToSeq[block[j]];
262 VPrintf3( " %d in block, %d after MTF & 1-2 coding, "
544 /*--- And finally, the block data proper ---*/
612 VPrintf4( " block %d: crc = 0x%08x,
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| DeadStoresChecker.cpp | 76 bool isReachable(const CFGBlock *block) const {
77 return reachable[block->getBlockID()];
90 const CFGBlock *block = worklist.pop_back_val(); local
91 llvm::BitVector::reference isReachable = reachable[block->getBlockID()];
95 for (CFGBlock::const_succ_iterator i = block->succ_begin(),
96 e = block->succ_end(); i != e; ++i)
258 void observeStmt(const Stmt *S, const CFGBlock *block,
261 currentBlock = block;
|
