HomeSort by relevance Sort by last modified time
    Searched defs:Block (Results 26 - 50 of 65) sorted by null

12 3

  /external/clang/lib/CodeGen/
CGStmt.cpp 64 // Otherwise, make a new block to hold the code.
96 // Remember the block we came in on.
103 assert(outgoing && "expression emission cleared block!");
107 // for noreturn functions has to enter a new block with no
108 // predecessors. We want to kill that block and mark the current
113 // block, because *statement* emission does sometimes create
231 // simplify this block (we would need to remove it from the scope map
248 // Fall out of the current block (if necessary).
256 // Place the block after the current block, if possible, or else a
    [all...]
CodeGenModule.h 353 } Block;
594 /// getUniqueBlockCount - Fetches the global unique block count.
595 int getUniqueBlockCount() { return ++Block.GlobalUniqueCount; }
597 /// getBlockDescriptorType - Fetches the type of a generic block
601 /// getGenericBlockLiteralType - The type of a generic block literal.
604 /// GetAddrOfGlobalBlock - Gets the address of a block which
    [all...]
CGExpr.cpp 50 /// block.
61 llvm::BasicBlock *Block = AllocaInsertPt->getParent();
62 Block->getInstList().insertAfter(&*AllocaInsertPt, Store);
    [all...]
  /external/clang/lib/Sema/
AnalysisBasedWarnings.cpp 124 // Now we know what is live, we check the live precessors of the exit block
144 // represent actually viable edges into the exit block, so mark them as
160 // No more CFGElements in the block?
166 // A labeled empty statement, or the entry block...
224 enum { Function, Block, Lambda } funMode;
272 D.funMode = Block;
353 // FIXME: Function try block
723 if (P->pred_begin() == P->pred_end()) { // The block is unreachable.
743 // // <<<< This place is represented by a 'hanging' CFG block.
755 if (!LastStmt) { // This block contains no executable statements
1271 const CFGBlock *block = AC.getBlockForRegisteredExpression(stmt); local
    [all...]
SemaCodeComplete.cpp 672 // Dig through references, function pointers, and block pointers to
690 if (const BlockPointerType *Block = T->getAs<BlockPointerType>()) {
691 T = Block->getPointeeType();
    [all...]
TreeTransform.h 590 /// \brief Build a new block pointer type given its pointee type.
592 /// By default, performs semantic analysis when building the block pointer
    [all...]
  /external/clang/lib/StaticAnalyzer/Core/
PathDiagnostic.cpp 473 const CFGBlock &Block = *SFC->getCallSiteBlock();
474 CFGElement Source = Block[SFC->getIndex()];
778 Out << "Calling anonymous block";
    [all...]
  /external/libvpx/mkvparser/
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 120 /// addBlock - Add block data.
123 DIEBlock *Block) {
124 Block->ComputeSize(Asm);
125 DIEBlocks.push_back(Block); // Memoize so we can call the destructor later on.
126 Die->addValue(Attribute, Block->BestForm(), Block);
280 DIEBlock *Block = new (DIEValueAllocator) DIEBlock();
283 addRegisterOp(Block, Location.getReg());
285 addRegisterOffset(Block, Location.getReg(), Location.getOffset());
288 addBlock(Die, Attribute, 0, Block);
    [all...]
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 79 // pred block number for certain non-trivial edges.
83 // block number.
166 // to the block.
195 // Represent a basic block in GCOV. Each block has a unique number in the
196 // function, number of lines belonging to each block, and a set of edges to
304 GCOVBlock &Block = *I->second;
305 if (Block.OutEdges.empty()) continue;
308 write(Block.OutEdges.size() * 2 + 1);
309 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...]
  /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/dbus/test/
decode-gcov.c 295 printf ("End of block\n");
387 printf (" Block has %ld arcs\n", n_arcs_in_block);
405 printf (" Arc has destination block %ld flags 0x%lx\n",
608 typedef struct Block Block;
626 struct Block
643 Block *block_graph;
807 func->block_graph = dbus_new0 (Block, n_blocks_in_func);
1120 Block *block_graph;
1130 /* For every block in the file
1385 int block; 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/
IRBuilder.h 63 /// not be inserted into a block.
73 /// appended to the end of the specified block.
130 BasicBlock *Block;
135 InsertPoint() : Block(0) {}
139 : Block(InsertBlock), Point(InsertPoint) {}
142 bool isSet() const { return (Block != 0); }
144 llvm::BasicBlock *getBlock() const { return Block; }
319 /// inserting them into a basic block: either at the end of a BasicBlock, or
320 /// at a specific 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 74 /* Layout of an in-use block:
77 this block total szB (sizeof(SizeT) bytes)
81 this block total szB (sizeof(SizeT) bytes)
83 Layout of a block on the free list:
86 this block total szB (sizeof(SizeT) bytes)
92 this block total szB (sizeof(SizeT) bytes)
104 block for arenas used by the core is:
117 Furthermore, both size fields in the block have their least-significant
118 bit set if the block is not in use, and unset if it is in use.
120 A block size of zero is not possible, because a block always has a
    [all...]
  /external/valgrind/main/memcheck/
mc_errors.c 76 Addr_Block, // in malloc'd/free'd block
103 Char* block_desc; // "block", "mempool" or user-defined
107 } Block;
225 // Program tried to free() something that's not a heap block (this
231 // Program allocates heap block with one function
239 Addr src; // Source block
240 Addr dst; // Destination block
323 SizeT block_szB = ai->Addr.Block.block_szB;
324 PtrdiffT rwoffset = ai->Addr.Block.rwoffset;
341 a, delta, relative, ai->Addr.Block.block_desc
    [all...]
  /external/clang/include/clang/AST/
Stmt.h     [all...]
  /external/clang/lib/Analysis/
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:__anon5092::BlockScopePosPair
246 /// the AST in reverse order so that the successor of a basic block is
257 CFGBlock *Block;
300 Block(NULL), Succ(NULL),
386 return Block;
    [all...]
  /external/clang/lib/Serialization/
ASTReader.cpp 740 Error("Expected lexical block");
758 Error("Expected visible lookup table block");
797 /// \brief Read the line table in the source manager block.
942 /// \brief Read a source manager block
950 // source manager block initially, and then lazily read
954 // The stream itself is going to skip over the source manager block.
956 Error("malformed block record in AST file");
960 // Enter the source manager block.
    [all...]
  /external/llvm/lib/VMCore/
Core.cpp     [all...]
  /sdk/traceview/src/com/android/traceview/
TimeLineView.java 113 public static interface Block {
127 public Block getParentBlock();
137 Block block; field in class:TimeLineView.Record
139 public Record(Row row, Block block) {
141 this.block = block;
387 System.out.printf("row '%s' block '%s' [%d, %d]\n", r.row //$NON-NLS-1$
388 .getName(), r.block.getName(), r.block.getStartTime()
433 Block block = rec.block; local
1129 Block block = strip.mSegment.mBlock; local
1390 Block block = segment.mBlock; local
    [all...]

Completed in 1211 milliseconds

12 3