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

<<21222324252627282930>>

  /external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/
ll-star.rb 26 * either the ';' or the '{' of the block and then it picks
36 | functionHeader block
64 block
73 | block
79 : 'for' '(' assignStat ';' expr ';' assignStat ')' block
  /external/clang/lib/ARCMigrate/
TransBlockObjCVariable.cpp 14 // This transformation checks whether a reference of the variable for the block
78 bool VisitBlockDecl(BlockDecl *block) {
81 for (const auto &I : block->captures()) {
94 bool onlyValueOfVarIsNeeded = checker.TraverseStmt(block->getBody());
119 bool TraverseBlockDecl(BlockDecl *block) {
120 RootBlockObjCVarRewriter(VarsToChange).TraverseDecl(block);
  /external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixSquareRoot.h 17 // pre: T.block(i,i,2,2) has complex conjugate eigenvalues
18 // post: sqrtT.block(i,i,2,2) is square root of T.block(i,i,2,2)
25 Matrix<Scalar,2,2> block = T.template block<2,2>(i,i); local
26 EigenSolver<Matrix<Scalar,2,2> > es(block);
27 sqrtT.template block<2,2>(i,i)
31 // pre: block structure of T is such that (i,j) is a 1x1 block,
47 Matrix<Scalar,1,2> rhs = T.template block<1,2>(i,j)
    [all...]
  /external/freetype/src/tools/docmaker/
tohtml.py 179 # Block header and footer.
310 def make_block_url( self, block, name = None ):
312 name = block.name
315 section_url = self.make_section_url( block.section )
318 section_url = self.make_section_url( block )
330 block = self.identifiers[name]
331 url = self.make_block_url( block )
341 + block.title + '</a>&rsquo;'
432 # this is the current block name, if any
440 block = self.identifiers[name
    [all...]
  /external/google-styleguide/include/
styleguide.css 189 display:inline-block;
205 display: block;
212 display: block;
217 display: block;
224 display: block;
231 display: block;
238 display: block;
245 display: block;
252 display: block;
259 display: block;
    [all...]
  /external/markdown/markdown/extensions/
tables.py 24 def test(self, parent, block):
25 rows = block.split('\n')
31 """ Parse a table block and build table. """
32 block = blocks.pop(0).split('\n')
33 header = block[:2]
34 rows = block[2:]
  /external/mesa3d/src/mesa/drivers/dri/i965/
brw_fs_dead_code_eliminate.cpp 34 * yet in the tail end of this block.
84 foreach_block_reverse_safe(block, cfg) {
85 memcpy(live, live_intervals->block_data[block->num].liveout,
87 memcpy(flag_live, live_intervals->block_data[block->num].flag_liveout,
90 foreach_inst_in_block_reverse_safe(fs_inst, inst, block) {
123 inst->remove(block);
brw_nir_analyze_boolean_resolves.c 87 analyze_boolean_resolves_block(nir_block *block)
89 nir_foreach_instr(instr, block) {
247 nir_if *following_if = nir_block_get_following_if(block);
257 nir_foreach_block(block, impl) {
258 analyze_boolean_resolves_block(block);
  /external/v8/src/crankshaft/
hydrogen-escape-analysis.cc 45 HBasicBlock* block = graph()->blocks()->at(i); local
46 for (HInstructionIterator it(block); !it.Done(); it.Advance()) {
89 HBasicBlock* block = previous->block(); local
93 HPhi* phi = NewPhiAndInsert(block, operand, index);
113 // Insert a newly created phi into the given block and fill all incoming
115 HPhi* HEscapeAnalysisPhase::NewPhiAndInsert(HBasicBlock* block,
120 for (int i = 0; i < block->predecessors()->length(); i++) {
123 block->AddPhi(phi);
164 HBasicBlock* allocate_block = allocate->block();
171 HBasicBlock* block = graph()->blocks()->at(i); local
    [all...]
  /frameworks/av/media/libnbaio/
AudioBufferProviderSource.cpp 82 ssize_t AudioBufferProviderSource::readVia(readVia_t via, size_t total, void *user, size_t block)
87 if (CC_UNLIKELY(block == 0)) {
88 block = ~0;
96 if (CC_LIKELY(count > block)) {
97 count = block;
99 // 1 <= count <= block
108 // FIXME simplify logic - does the initial count and block checks again for no reason;
  /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/v8/src/compiler/
instruction.cc 648 static RpoNumber GetRpo(const BasicBlock* block) {
649 if (block == nullptr) return RpoNumber::Invalid();
650 return RpoNumber::FromInt(block->rpo_number());
654 static RpoNumber GetLoopEndRpo(const BasicBlock* block) {
655 if (!block->IsLoopHeader()) return RpoNumber::Invalid();
656 return RpoNumber::FromInt(block->loop_end()->rpo_number());
661 const BasicBlock* block) {
663 !block->empty() && block->front()->opcode() == IrOpcode::kIfException;
665 InstructionBlock(zone, GetRpo(block), GetRpo(block->loop_header())
681 const InstructionBlock* block = printable_block.block_; local
842 const InstructionBlock* block = InstructionBlockAt(rpo); local
995 const InstructionBlock* block = InstructionBlockAt(rpo); local
    [all...]
  /external/mesa3d/src/compiler/nir/
nir_phi_builder.c 34 /* Array of all blocks indexed by block->index. */
58 * added directly. Instead, they are created, the instr->block pointer
65 /* Array of SSA defs, indexed by block. For each block, this array has has
68 * - NULL. Indicates that there is no known definition in this block. If
69 * you need to find one, look at the block's immediate dominator.
71 * - NEEDS_PHI. Indicates that the block may need a phi node but none has
72 * been created yet. If a def is requested for a block, a phi will need
94 nir_foreach_block(block, impl) {
95 pb->blocks[block->index] = block
    [all...]
  /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_print.c 196 printf(", target=block%u", block_id(instr->cat0.target));
208 print_block(struct ir3_block *block, int lvl)
210 tab(lvl); printf("block%u {\n", block_id(block));
211 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) {
214 if (block->successors[1]) {
218 print_instr_name(block->condition);
219 printf("] block%u; else block%u; */\n",
220 block_id(block->successors[0])
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/impl/
Trie2_16.java 186 int block = 0; local
190 // - a partial data block
191 // - a reference to the null (default) data block.
192 // - a reference to the index2 null block
204 block = index[cp >> UTRIE2_SHIFT_2] << UTRIE2_INDEX_SHIFT;
208 block = index[index2Block + ((cp - 0xd800) >> UTRIE2_SHIFT_2)] << UTRIE2_INDEX_SHIFT;
213 block = index[index2Block + ((cp >> UTRIE2_SHIFT_2) & UTRIE2_INDEX_2_MASK)] << UTRIE2_INDEX_SHIFT;
227 } else if (block == dataNullOffset) {
228 // The block at dataNullOffset has all values == initialValue.
230 // encounter a null block at its beginning, and can skip ove
    [all...]
Trie2_32.java 183 int block = 0; local
187 // - a partial data block
188 // - a reference to the null (default) data block.
189 // - a reference to the index2 null block
201 block = index[cp >> UTRIE2_SHIFT_2] << UTRIE2_INDEX_SHIFT;
205 block = index[index2Block + ((cp - 0xd800) >> UTRIE2_SHIFT_2)] << UTRIE2_INDEX_SHIFT;
210 block = index[index2Block + ((cp >> UTRIE2_SHIFT_2) & UTRIE2_INDEX_2_MASK)] << UTRIE2_INDEX_SHIFT;
224 } else if (block == dataNullOffset) {
225 // The block at dataNullOffset has all values == initialValue.
227 // encounter a null block at its beginning, and can skip ove
    [all...]
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
Trie2_16.java 184 int block = 0; local
188 // - a partial data block
189 // - a reference to the null (default) data block.
190 // - a reference to the index2 null block
202 block = index[cp >> UTRIE2_SHIFT_2] << UTRIE2_INDEX_SHIFT;
206 block = index[index2Block + ((cp - 0xd800) >> UTRIE2_SHIFT_2)] << UTRIE2_INDEX_SHIFT;
211 block = index[index2Block + ((cp >> UTRIE2_SHIFT_2) & UTRIE2_INDEX_2_MASK)] << UTRIE2_INDEX_SHIFT;
225 } else if (block == dataNullOffset) {
226 // The block at dataNullOffset has all values == initialValue.
228 // encounter a null block at its beginning, and can skip ove
    [all...]
Trie2_32.java 181 int block = 0; local
185 // - a partial data block
186 // - a reference to the null (default) data block.
187 // - a reference to the index2 null block
199 block = index[cp >> UTRIE2_SHIFT_2] << UTRIE2_INDEX_SHIFT;
203 block = index[index2Block + ((cp - 0xd800) >> UTRIE2_SHIFT_2)] << UTRIE2_INDEX_SHIFT;
208 block = index[index2Block + ((cp >> UTRIE2_SHIFT_2) & UTRIE2_INDEX_2_MASK)] << UTRIE2_INDEX_SHIFT;
222 } else if (block == dataNullOffset) {
223 // The block at dataNullOffset has all values == initialValue.
225 // encounter a null block at its beginning, and can skip ove
    [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);
  /external/xz-embedded/linux/lib/xz/
xz_dec_stream.c 52 /* CRC32 or CRC64 value in Block or CRC32 value in Index */
55 /* CRC32 value in Block or Index */
71 /* Information stored in Block Header */
85 /* Size of the Block Header field */
91 /* Observed compressed size of the current Block */
94 /* Observed uncompressed size of the current Block */
101 * Hash calculated from the Block sizes. This is used to
105 } block; member in struct:xz_dec
119 /* Number of Records (matches block.count in valid files) */
123 * Hash calculated from the Records (matches block.hash i
    [all...]
  /external/libvpx/libvpx/vp8/common/
reconinter.c 184 temp = x->block[yoffset].bmi.mv.as_mv.row +
185 x->block[yoffset + 1].bmi.mv.as_mv.row +
186 x->block[yoffset + 4].bmi.mv.as_mv.row +
187 x->block[yoffset + 5].bmi.mv.as_mv.row;
191 x->block[uoffset].bmi.mv.as_mv.row = (temp / 8) & x->fullpixel_mask;
193 temp = x->block[yoffset].bmi.mv.as_mv.col +
194 x->block[yoffset + 1].bmi.mv.as_mv.col +
195 x->block[yoffset + 4].bmi.mv.as_mv.col +
196 x->block[yoffset + 5].bmi.mv.as_mv.col;
200 x->block[uoffset].bmi.mv.as_mv.col = (temp / 8) & x->fullpixel_mask
    [all...]
  /external/mesa3d/src/gallium/auxiliary/util/
u_format.c 233 desc->block.width == 2 &&
234 desc->block.height == 1 &&
235 desc->block.bits == 32;
307 assert(x % format_desc->block.width == 0);
308 assert(y % format_desc->block.height == 0);
310 src_row = (const uint8_t *)src + y*src_stride + x*(format_desc->block.bits/8);
329 assert(x % format_desc->block.width == 0);
330 assert(y % format_desc->block.height == 0);
332 dst_row = (uint8_t *)dst + y*dst_stride + x*(format_desc->block.bits/8);
348 assert(x % format_desc->block.width == 0)
    [all...]
  /art/compiler/optimizing/
code_sinking.cc 143 static void AddInputs(HBasicBlock* block,
147 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) {
150 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) {
181 // Find the target block.
186 HBasicBlock* block = user->GetBlock(); local
188 // Special case phis by taking the incoming block for regular ones,
190 block = user->AsPhi()->IsCatchPhi()
191 ? block->GetDominator()
192 : block->GetPredecessors()[use.GetIndex()];
194 finder.Update(block);
    [all...]

Completed in 630 milliseconds

<<21222324252627282930>>