HomeSort by relevance Sort by last modified time
    Searched defs:Block (Results 51 - 75 of 107) sorted by null

1 23 4 5

  /packages/apps/UnifiedEmail/src/com/android/mail/lib/html/parser/
HtmlTree.java 317 * A Block represents a region of a html tree that
318 * 1) is well-formed, i.e. for each node in the block, all its descendants
319 * are also contained in the block. So it's safe to wrap the region
323 public static class Block {
327 /* The ending node (non-inclusive to the block) */
333 * We may create multiple blocks if one single well-formed Block cannot be
340 * @return a list of 0 or more Block objects, never null
342 public ArrayList<Block> createBlocks(int textStart, int textEnd, int minNode, int maxNode) {
344 ArrayList<Block> blocks = new ArrayList<Block>();
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/
pyassem.py 13 self.current = self.entry = Block()
14 self.exit = Block("exit")
19 def startBlock(self, block):
26 print repr(block)
27 self.current = block
29 def nextBlock(self, block=None):
31 # from one block to the next. might be better to represent this
35 # I think this strategy works: each block has a child
38 # reverse post order, the "next" block will always be emitted
41 if block is None
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/
pyassem.py 13 self.current = self.entry = Block()
14 self.exit = Block("exit")
19 def startBlock(self, block):
26 print repr(block)
27 self.current = block
29 def nextBlock(self, block=None):
31 # from one block to the next. might be better to represent this
35 # I think this strategy works: each block has a child
38 # reverse post order, the "next" block will always be emitted
41 if block is None
    [all...]
  /external/chromium_org/v8/tools/gcmole/
gcmole.cc 928 class Block {
930 Block(const Environment& in,
939 ~Block() {
998 Block* parent_;
1024 Block block (env, this);
1026 block.Loop(stmt->getCond(), stmt->getBody());
1027 } while (block.changed());
1028 return block.out();
1032 Block block (env, this)
    [all...]
  /external/v8/tools/gcmole/
gcmole.cc 930 class Block {
932 Block(const Environment& in,
941 ~Block() {
1000 Block* parent_;
1026 Block block (env, this);
1028 block.Loop(stmt->getCond(), stmt->getBody());
1029 } while (block.changed());
1030 return block.out();
1034 Block block (env, this)
    [all...]
  /external/chromium_org/third_party/WebKit/Source/bindings/scripts/
deprecated_code_generator_v8.pm 29 package Block;
32 # my $outer = new Block("Free Name 1", "namespace Foo {", "} // namespace Foo");
34 # my $inner = new Block("Free Name 2", "namespace Bar {", "} // namespace Bar");
50 my $name = shift || "Anonymous block";
98 if (ref($content) eq "Block") {
335 $header{root} = new Block("ROOT", "", "");
336 # FIXME: newlines should be generated by Block::toString().
337 $header{conditional} = new Block("Conditional", "$conditionalIf", $conditionalEndif ? "$conditionalEndif\n" : "");
338 $header{includes} = new Block("Includes", "", "");
339 $header{nameSpaceWebCore} = new Block("Namespace WebCore", "\nnamespace WebCore {\n", "}\n")
    [all...]
  /external/clang/lib/Analysis/
UninitializedValues.cpp 117 ValueVector &getValueVector(const CFGBlock *block) {
118 return vals[block->getBlockID()];
123 bool updateValueVectorWithScratch(const CFGBlock *block);
133 Value getValue(const CFGBlock *block, const CFGBlock *dstBlock,
137 return getValueVector(block)[idx.getValue()];
157 static void printVector(const CFGBlock *block, ValueVector &bv,
159 llvm::errs() << block->getBlockID() << " :";
180 bool CFGBlockValues::updateValueVectorWithScratch(const CFGBlock *block) {
181 ValueVector &dst = getValueVector(block);
186 printVector(block, scratch, 0)
436 const CFGBlock *block; member in class:__anon17565::TransferFunctions
842 const CFGBlock *block = *BI; local
    [all...]
CFG.cpp 45 /// subexpressions as block-level expressions. For example:
50 /// need to be added as block-level expressions, even though they
54 /// block-level expression.
209 BlockScopePosPair() : block(0) {}
211 : block(b), scopePosition(scopePos) {}
213 CFGBlock *block; member in struct:__anon17551::BlockScopePosPair
284 /// the AST in reverse order so that the successor of a basic block is
295 CFGBlock *Block;
338 Block(NULL), Succ(NULL),
424 return Block;
    [all...]
  /external/clang/lib/StaticAnalyzer/Core/
PathDiagnostic.cpp 546 const CFGBlock &Block = *SFC->getCallSiteBlock();
547 CFGElement Source = Block[SFC->getIndex()];
911 Out << Prefix << "anonymous block";
    [all...]
  /external/libvpx/libwebm/
mkvparser.hpp 77 class Block
79 Block(const Block&);
80 Block& operator=(const Block&);
86 Block(long long start, long long size);
87 ~Block();
138 virtual const Block* GetBlock() const = 0;
160 const Block* GetBlock() const;
163 Block m_block;
    [all...]
  /external/llvm/lib/CodeGen/AsmPrinter/
DwarfCompileUnit.cpp 234 /// addBlock - Add block data.
237 DIEBlock *Block) {
238 Block->ComputeSize(Asm);
239 DIEBlocks.push_back(Block); // Memoize so we can call the destructor later on.
240 Die->addValue(Attribute, Block->BestForm(), Block);
398 DIEBlock *Block = new (DIEValueAllocator) DIEBlock();
401 addRegisterOp(Block, Location.getReg());
403 addRegisterOffset(Block, Location.getReg(), Location.getOffset());
405 addUInt(Block, 0, dwarf::DW_FORM_data1, dwarf::DW_OP_deref)
    [all...]
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 111 // pred block number for certain non-trivial edges.
115 // block number.
204 // to the block.
242 // Represent a basic block in GCOV. Each block has a unique number in the
243 // function, number of lines belonging to each block, and a set of edges to
357 GCOVBlock &Block = *Blocks[I];
358 if (Block.OutEdges.empty()) continue;
361 write(Block.OutEdges.size() * 2 + 1);
362 write(Block.Number)
    [all...]
  /external/valgrind/main/drd/tests/
tsan_thread_wrappers_pthread.h 558 void Block() {
  /external/valgrind/main/exp-dhat/
dh_main.c 80 therefore at 0xFFFF. Can be NULL if the block is resized or if
81 the block is larger than HISTOGRAM_SIZE_LIMIT. */
84 Block;
88 static WordFM* interval_tree = NULL; /* WordFM* Block* void */
95 Block* b1 = (Block*)k1;
96 Block* b2 = (Block*)k2;
105 static Block* fbc_cache0 = NULL;
106 static Block* fbc_cache1 = NULL
    [all...]
  /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/
HtmlTree.java 350 * A Block represents a region of a html tree that
351 * 1) is well-formed, i.e. for each node in the block, all its descendants
352 * are also contained in the block. So it's safe to wrap the region
356 public static class Block {
360 /* The ending node (non-inclusive to the block) */
366 * We may create multiple blocks if one single well-formed Block cannot be
373 * @return a list of 0 or more Block objects, never null
375 public ArrayList<Block> createBlocks(int textStart, int textEnd, int minNode, int maxNode) {
377 ArrayList<Block> blocks = new ArrayList<Block>();
    [all...]
  /external/dropbear/libtomcrypt/
crypt.tex 125 block cipher and hash function to ensure that they compile and execute to the published design specifications. The library
165 The LibTomCrypt package has also been written to be very modular. The block ciphers, one--way hashes,
179 unlike libraries like OpenSSL is not tied to direct routines. For instance, in OpenSSL there are CBC block
193 of the authors knowledge the only patent related issues within the library are the RC5 and RC6 symmetric block ciphers.
401 \chapter{Symmetric Block Ciphers}
403 LibTomCrypt provides several block ciphers with an ECB block mode interface. It is important to first note that you
432 To encrypt or decrypt a block in ECB mode there are these two functions per cipher:
443 These two functions will encrypt or decrypt (respectively) a single block of text\footnote{The size of which depends on
496 An example snippet that encodes a block with Blowfish in ECB mode
    [all...]
  /bionic/libc/kernel/tools/
cpp.py     [all...]
  /external/clang/lib/CodeGen/
CGStmt.cpp 65 // Otherwise, make a new block to hold the code.
98 // Remember the block we came in on.
105 assert(outgoing && "expression emission cleared block!");
109 // for noreturn functions has to enter a new block with no
110 // predecessors. We want to kill that block and mark the current
115 // block, because *statement* emission does sometimes create
252 // simplify this block (we would need to remove it from the scope map
273 // Fall out of the current block (if necessary).
281 // Place the block after the current block, if possible, or else a
    [all...]
CodeGenModule.h 405 } Block;
673 /// getUniqueBlockCount - Fetches the global unique block count.
674 int getUniqueBlockCount() { return ++Block.GlobalUniqueCount; }
676 /// getBlockDescriptorType - Fetches the type of a generic block
680 /// getGenericBlockLiteralType - The type of a generic block literal.
683 /// GetAddrOfGlobalBlock - Gets the address of a block which
    [all...]
  /external/clang/lib/Sema/
AnalysisBasedWarnings.cpp 128 // Now we know what is live, we check the live precessors of the exit block
148 // represent actually viable edges into the exit block, so mark them as
164 // No more CFGElements in the block?
170 // A labeled empty statement, or the entry block...
228 enum { Function, Block, Lambda } funMode;
276 D.funMode = Block;
356 // FIXME: Function try block
782 // // <<<< This place is represented by a 'hanging' CFG block.
794 if (!LastStmt) { // This block contains no executable statements.
1545 const CFGBlock *block = AC.getBlockForRegisteredExpression(stmt); local
    [all...]
  /external/emma/core/java12/com/vladium/emma/instr/
InstrVisitor.java 365 // create block count map: TODO: is the extra slot really needed?
451 if ($assert.ENABLED) $assert.ASSERT (m_classBlockCounts [m_methodID] > 0, "invalid block count for method " + m_methodID + ": " + m_classBlockCounts [m_methodID]);
452 if ($assert.ENABLED) $assert.ASSERT (m_methodBlockSizes != null && m_methodBlockSizes.length == m_classBlockCounts [m_methodID], "invalid block sizes map for method " + m_methodID);
556 final int instrMethodCount = m_classInstrMethodCount; // actual number of methods to instrument may be less than the size of the block map
559 "invalid block count map");
675 if ($assert.ENABLED) $assert.ASSERT (m_classBlockCounts [m_methodID] > 0, "invalid block count for method " + m_methodID + " (" + IClassDefConstants.CLINIT_NAME + "): " + m_classBlockCounts [m_methodID]);
676 if ($assert.ENABLED) $assert.ASSERT (m_methodBlockSizes != null && m_methodBlockSizes.length == m_classBlockCounts [m_methodID], "invalid block sizes map for method " + m_methodID);
735 // determine block leaders [an O(code length) loop]:
978 final Block block = new Block (); local
1038 final Block block = _blocks [l]; local
1087 final Block block = _blocks [l]; local
1137 final Block block = _blocks [l]; local
    [all...]
  /external/llvm/include/llvm/IR/
IRBuilder.h 67 /// inserted into a block.
78 /// end of the specified block.
134 BasicBlock *Block;
139 InsertPoint() : Block(0) {}
143 : Block(InsertBlock), Point(InsertPoint) {}
146 bool isSet() const { return (Block != 0); }
148 llvm::BasicBlock *getBlock() const { return Block; }
338 /// them into a basic block: either at the end of a BasicBlock, or at a specific
339 /// iterator location in a block.
    [all...]
  /external/tinyxml2/
tinyxml2.h 263 // Need a new block.
264 Block* block = new Block(); local
265 blockPtrs.Push( block );
268 block->chunk[i].next = &block->chunk[i+1];
270 block->chunk[COUNT-1].next = 0;
271 root = block->chunk;
300 struct Block {
    [all...]
  /external/valgrind/main/coregrind/
m_mallocfree.c 75 /* Layout of an in-use block:
78 this block total szB (sizeof(SizeT) bytes)
82 this block total szB (sizeof(SizeT) bytes)
84 Layout of a block on the free list:
87 this block total szB (sizeof(SizeT) bytes)
93 this block total szB (sizeof(SizeT) bytes)
105 block for arenas used by the core is:
118 Furthermore, both size fields in the block have their least-significant
119 bit set if the block is not in use, and unset if it is in use.
121 A block size of zero is not possible, because a block always has a
    [all...]
  /external/valgrind/main/memcheck/
mc_errors.c 75 Addr_Block, // in malloc'd/free'd block
102 Char* block_desc; // "block", "mempool" or user-defined
106 } Block;
224 // Program tried to free() something that's not a heap block (this
230 // Program allocates heap block with one function
238 Addr src; // Source block
239 Addr dst; // Destination block
322 SizeT block_szB = ai->Addr.Block.block_szB;
323 PtrdiffT rwoffset = ai->Addr.Block.rwoffset;
340 a, delta, relative, ai->Addr.Block.block_desc
    [all...]

Completed in 3442 milliseconds

1 23 4 5