Searched refs:Block (Results 26 - 50 of 418) sorted by relevance

1234567891011>>

/external/compiler-rt/test/BlocksRuntime/
H A Dcopynull.c16 #import <Block.h>
H A Ddispatch_call_Block_with_release.c8 #include <Block.h>
H A Drdar6414583.c11 #include <Block.h>
H A Drecursiveassign.c21 #include <Block.h>
26 __block void (^recursive_copy_block)(int) = ^(int arg) { printf("got wrong Block\n"); exit(1); };
H A Dblockimport.c21 #include <Block.h>
38 //printf("Block dump %s\n", _Block_dump(vv));
H A Dglobalexpression.c10 #import <Block.h>
H A Dbyrefcopycopy.c12 #include <Block.h>
/external/skia/src/core/
H A DSkDeque.cpp11 struct SkDeque::Block { struct in class:SkDeque
12 Block* fNext;
13 Block* fPrev;
46 if (storageSize >= sizeof(Block) + elemSize) {
47 fFrontBlock = (Block*)storage;
57 Block* head = fFrontBlock;
58 Block* initialHead = (Block*)fInitialStorage;
61 Block* next = head->fNext;
77 Block* firs
[all...]
/external/skqp/src/core/
H A DSkDeque.cpp11 struct SkDeque::Block { struct in class:SkDeque
12 Block* fNext;
13 Block* fPrev;
46 if (storageSize >= sizeof(Block) + elemSize) {
47 fFrontBlock = (Block*)storage;
57 Block* head = fFrontBlock;
58 Block* initialHead = (Block*)fInitialStorage;
61 Block* next = head->fNext;
77 Block* firs
[all...]
/external/llvm/lib/Target/SystemZ/
H A DSystemZLongBranch.cpp147 void skipNonTerminators(BlockPosition &Position, MBBInfo &Block);
176 // Position describes the state immediately before Block. Update Block
180 MBBInfo &Block) {
181 if (Block.Alignment > Position.KnownBits) {
182 // When calculating the address of Block, we need to conservatively
183 // assume that Block had the worst possible misalignment.
184 Position.Address += ((uint64_t(1) << Block.Alignment) -
186 Position.KnownBits = Block.Alignment;
190 uint64_t AlignMask = (uint64_t(1) << Block
179 skipNonTerminators(BlockPosition &Position, MBBInfo &Block) argument
277 MBBInfo &Block = MBBs[I]; local
[all...]
/external/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp171 for (auto *Block : successors())
172 ID = Block->topologicalSort(Blocks, ID);
264 for (auto *Block : Blocks)
265 InstrID = Block->renumberInstrs(InstrID);
309 for (auto *Block : Blocks)
310 Block->computeDominator();
322 for (auto *Block : Blocks.reverse()) {
323 Block->computePostDominator();
324 computeNodeSize(Block, &BasicBlock::DominatorNode);
328 for (auto *Block
[all...]
H A DCFG.cpp373 CFGBlock *Block; member in class:__anon1507::CFGBuilder
416 Block(nullptr), Succ(nullptr),
569 return Block;
572 void autoCreateBlock() { if (!Block) Block = createBlock(); }
1032 Block = nullptr; // the EXIT block is empty. Create all other blocks lazily.
1118 return Block;
1137 appendInitializer(Block, I);
1151 appendStmt(Block, Default);
1154 Block
[all...]
/external/swiftshader/third_party/subzero/pnacl-llvm/include/llvm/Bitcode/NaCl/
H A DNaClBitcodeParser.h31 // Blocks are identified using Block IDs. Each kind of block has a
265 explicit NaClBitcodeRecord(const NaClBitcodeBlock &Block) argument
266 : NaClBitcodeData(Block.GetCursor()),
267 Block(Block)
275 return Block;
280 return Block.GetBlockID();
332 const NaClBitcodeBlock &Block; member in class:llvm::NaClBitcodeRecord
432 Block(ILLEGAL_BLOCK_ID, Cursor),
433 Record(Block),
589 NaClBitcodeBlock Block; member in class:llvm::NaClBitcodeParser
[all...]
/external/valgrind/coregrind/
H A Dm_addrinfo.c190 ai->Addr.Block.block_kind
193 ai->Addr.Block.block_kind
196 ai->Addr.Block.block_desc = aai.name;
197 ai->Addr.Block.block_szB = aai.block_szB;
198 ai->Addr.Block.rwoffset = aai.rwoffset;
199 ai->Addr.Block.allocated_at = VG_(null_ExeContext)();
200 VG_(initThreadInfo) (&ai->Addr.Block.alloc_tinfo);
201 ai->Addr.Block.freed_at = VG_(null_ExeContext)();
493 SizeT block_szB = ai->Addr.Block.block_szB;
494 PtrdiffT rwoffset = ai->Addr.Block
[all...]
/external/llvm/lib/IR/
H A DGCOV.cpp154 errs() << "Block tag not found.\n";
162 return false; // Block flags;
209 GCOVBlock &Block = *Blocks[BlockNo]; local
234 Block.addLine(Line);
317 GCOVBlock &Block = *Blocks[BlockNo]; local
318 for (size_t EdgeNo = 0, End = Block.getNumDstEdges(); EdgeNo < End;
327 Block.addCount(EdgeNo, ArcCount);
330 Block.sortDstEdges();
351 for (const auto &Block : Blocks)
352 Block
[all...]
/external/skia/src/sksl/ir/
H A DSkSLBlock.h19 struct Block : public Statement { struct in namespace:SkSL
20 Block(int offset, std::vector<std::unique_ptr<Statement>> statements, function in struct:SkSL::Block
/external/skqp/src/sksl/ir/
H A DSkSLBlock.h19 struct Block : public Statement { struct in namespace:SkSL
20 Block(int offset, std::vector<std::unique_ptr<Statement>> statements, function in struct:SkSL::Block
/external/llvm/include/llvm/DebugInfo/CodeView/
H A DSymbolDumpDelegate.h32 ArrayRef<uint8_t> Block) = 0;
/external/eigen/Eigen/src/Core/
H A DVectorBlock.h19 : public traits<Block<VectorType,
54 * \sa class Block, DenseBase::segment(Index,Index,Index,Index), DenseBase::segment(Index,Index)
57 : public Block<VectorType,
61 typedef Block<VectorType,
/external/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp71 // right away, to be contained in a block. Block inputs and outputs would
527 "Loop in the Block Graph!");
543 "Loop in the Block Graph!");
548 dbgs() << "Block (" << ID << ")\n";
1090 SIScheduleBlock *Block = CurrentBlocks[i]; local
1091 Block->finalizeUnits();
1096 SIScheduleBlock *Block = CurrentBlocks[i]; local
1097 Block->printDebug(true);
1140 SIScheduleBlock *Block = CurrentBlocks[i]; local
1141 unsigned Degree = Block
1151 SIScheduleBlock *Block = CurrentBlocks[i]; local
1164 SIScheduleBlock *Block = CurrentBlocks[i]; local
1185 SIScheduleBlock *Block = CurrentBlocks[i]; local
1201 SIScheduleBlock *Block = CurrentBlocks[BlockIndice]; local
1232 SIScheduleBlock *Block = CurrentBlocks[i]; local
1264 SIScheduleBlock *Block = CurrentBlocks[BlockIndice]; local
1279 SIScheduleBlock *Block = CurrentBlocks[BlockIndice]; local
1314 SIScheduleBlock *Block = Blocks[i]; local
1349 SIScheduleBlock *Block = Blocks[i]; local
1356 SIScheduleBlock *Block = Blocks[i]; local
1367 SIScheduleBlock *Block = Blocks[i]; local
1390 SIScheduleBlock *Block = Blocks[i]; local
1459 SIScheduleBlock *Block; local
1544 decreaseLiveRegs(SIScheduleBlock *Block, std::set<unsigned> &Regs) argument
1573 blockScheduled(SIScheduleBlock *Block) argument
1639 SIScheduleBlock *Block = ScheduledBlocks[b]; local
[all...]
/external/clang/include/clang/Analysis/Analyses/
H A DConsumed.h222 void addInfo(const CFGBlock *Block, ConsumedStateMap *StateMap,
224 void addInfo(const CFGBlock *Block,
227 ConsumedStateMap* borrowInfo(const CFGBlock *Block);
229 void discardInfo(const CFGBlock *Block);
231 std::unique_ptr<ConsumedStateMap> getInfo(const CFGBlock *Block);
234 bool isBackEdgeTarget(const CFGBlock *Block);
/external/protobuf/ruby/src/main/java/com/google/protobuf/jruby/
H A DRubyBuilder.java89 public IRubyObject addMessage(ThreadContext context, IRubyObject name, Block block) {
90 RubyDescriptor msgdef = (RubyDescriptor) cDescriptor.newInstance(context, Block.NULL_BLOCK);
91 IRubyObject ctx = cMessageBuilderContext.newInstance(context, msgdef, this, Block.NULL_BLOCK);
117 public IRubyObject addEnum(ThreadContext context, IRubyObject name, Block block) {
118 RubyEnumDescriptor enumDef = (RubyEnumDescriptor) cEnumDescriptor.newInstance(context, Block.NULL_BLOCK);
119 IRubyObject ctx = cEnumBuilderContext.newInstance(context, enumDef, Block.NULL_BLOCK);
/external/tensorflow/tensorflow/core/lib/io/
H A Dtable.cc38 Block* index_block;
60 Block* index_block = nullptr;
64 index_block = new Block(contents);
89 delete reinterpret_cast<Block*>(arg);
97 Block* block = nullptr;
110 block = new Block(contents);
/external/tensorflow/tensorflow/core/platform/cloud/
H A Dfile_block_cache.h145 /// be accessed while holding the Block's mu lock. The data vector should only
151 struct Block { struct in class:tensorflow::FileBlockCache
170 /// The block map is an ordered map from Key to Block.
171 typedef std::map<Key, std::shared_ptr<Block>> BlockMap;
176 bool BlockNotStale(const std::shared_ptr<Block>& block)
180 std::shared_ptr<Block> Lookup(const Key& key) LOCKS_EXCLUDED(mu_);
182 Status MaybeFetch(const Key& key, const std::shared_ptr<Block>& block)
189 Status UpdateLRU(const Key& key, const std::shared_ptr<Block>& block)
208 /// The block map (map from Key to Block).
/external/llvm/lib/Support/
H A DScopedPrinter.cpp24 ArrayRef<uint8_t> Data, bool Block) {
26 Block = true;
28 if (Block) {
23 printBinaryImpl(StringRef Label, StringRef Str, ArrayRef<uint8_t> Data, bool Block) argument

Completed in 646 milliseconds

1234567891011>>