Searched defs:block (Results 126 - 150 of 805) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/
H A Dlp_bld_flow.h45 * Early exit. Useful to skip to the end of a function or block when
53 LLVMBasicBlockRef block; member in struct:lp_build_skip_context
110 LLVMBasicBlockRef block; member in struct:lp_build_loop_state
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_format_etc.c29 struct etc1_block block; local
36 etc1_parse_block(&block, src);
43 etc1_fetch_texel(&block, i, j, tmp);
69 struct etc1_block block; local
74 etc1_parse_block(&block, src);
75 etc1_fetch_texel(&block, i, j, tmp);
H A Du_mm.c72 struct mem_block *heap, *block; local
81 block = CALLOC_STRUCT(mem_block);
82 if (!block) {
87 heap->next = block;
88 heap->prev = block;
89 heap->next_free = block;
90 heap->prev_free = block;
92 block->heap = heap;
93 block->next = heap;
94 block
[all...]
H A Du_network.c172 u_socket_block(int s, boolean block) argument
180 /* TODO obey block */
181 if (block)
186 u_long iMode = block ? 0 : 1;
H A Du_slab.c33 /* The block is either allocated memory or free space. */
36 /* The first next free block. */
41 /* Memory after the last member is dedicated to the block itself.
57 struct util_slab_block *block; local
65 block = util_slab_get_block(pool, page, i);
66 block->next_free = util_slab_get_block(pool, page, i+1);
67 block->magic = UTIL_SLAB_MAGIC;
70 block = util_slab_get_block(pool, page, pool->num_blocks-1);
71 block->next_free = pool->first_free;
72 block
83 struct util_slab_block *block; local
97 struct util_slab_block *block = local
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
H A Dlp_test_printf.c67 LLVMBasicBlockRef block = LLVMAppendBasicBlockInContext(gallivm->context, func, "entry"); local
71 LLVMPositionBuilderAtEnd(builder, block);
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/
H A Dbrw_fs_cfg.h32 fs_bblock_link(fs_bblock *block) argument
33 : block(block)
37 fs_bblock *block; member in class:fs_bblock_link
84 void set_next_block(fs_bblock *block);
89 * Used while generating the block list.
H A Dbrw_fs_live_variables.cpp35 * Support for computing at the basic block level which variables
45 * The basic-block-level live variable analysis needs to know which
55 fs_bblock *block = cfg->blocks[b]; local
57 assert(ip == block->start_ip);
61 for (fs_inst *inst = block->start;
62 inst != block->end->next;
122 fs_bblock *block = link->block; local
125 if (bd[block->block_num].livein[i] && !bd[b].liveout[i]) {
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dmm.c63 struct mem_block *heap, *block; local
72 block = (struct mem_block *) calloc(1, sizeof(struct mem_block));
73 if (!block) {
78 heap->next = block;
79 heap->prev = block;
80 heap->next_free = block;
81 heap->prev_free = block;
83 block->heap = heap;
84 block->next = heap;
85 block
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkChunkAlloc.cpp30 static void FreeChain(Block* block) { argument
31 while (block) {
32 Block* next = block->fNext;
33 sk_free(block);
34 block = next;
78 Block* block = (Block*)sk_malloc_flags(sizeof(Block) + size, local
81 if (block) {
82 // block->fNext = fBlock;
83 block->fFreeSize = size;
84 block
99 Block* block = fBlock; local
120 Block* block = fBlock; local
134 const Block* block = fBlock; local
[all...]
/external/chromium_org/third_party/skia/src/gpu/
H A DGrAllocPool.cpp23 Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size); local
24 block->fNext = next;
25 block->fPtr = (char*)block + sizeof(Block);
26 block->fBytesFree = size;
27 block->fBytesTotal = size;
28 return block;
69 Block* block = fBlock; local
70 while (block) {
71 Block* next = block
107 Block* block = fBlock; local
[all...]
H A DGrMemoryPool.cpp46 BlockHeader* block = CreateBlock(blockSize); local
48 block->fPrev = fTail;
49 block->fNext = NULL;
51 fTail->fNext = block;
52 fTail = block;
56 // We stash a pointer to the block header, just before the allocated space,
72 BlockHeader* block = *reinterpret_cast<BlockHeader**>(ptr); local
73 if (1 == block->fLiveCount) {
74 // the head block is special, it is reset rather than deleted
75 if (fHead == block) {
106 BlockHeader* block = local
117 DeleteBlock(BlockHeader* block) argument
123 BlockHeader* block = fHead; local
[all...]
/external/chromium_org/third_party/skia/src/pipe/utils/
H A DSamplePipeControllers.h75 PipeBlock(void* block, size_t bytes) { fBlock = block, fBytes = bytes; } argument
/external/chromium_org/third_party/usrsctp/usrsctplib/netinet/
H A Dsctp_sha1.c131 sctp_sha1_process_a_block(struct sctp_sha1_context *ctx, unsigned int *block) argument
135 /* init the W0-W15 to the block of words being hashed. */
138 ctx->words[i] = ntohl(block[i]);
211 /* block is now full, process it */
228 * if any left in block fill with padding and process. Then transfer
229 * the digest to the pointer. At the last block some special rules
236 * and run this block through by itself. Also the 64 bit int must
253 /* init last block, a bit different than the rest */
262 /* init last block */
273 /* init last block */
[all...]
/external/chromium_org/v8/src/compiler/
H A Dscheduler.h68 int GetRPONumber(BasicBlock* block) { argument
69 DCHECK(block->rpo_number_ >= 0 &&
70 block->rpo_number_ < static_cast<int>(schedule_->rpo_order_.size()));
71 DCHECK(schedule_->rpo_order_[block->rpo_number_] == block);
72 return block->rpo_number_;
91 void ConnectFloatingControlSubgraph(BasicBlock* block, Node* node);
/external/chromium_org/v8/src/
H A Dhydrogen-environment-liveness.cc48 HBasicBlock* block, BitVector* live) {
51 for (HSuccessorIterator it(block->end()); !it.Done(); it.Advance()) {
65 block->last_environment()->closure()));
84 HBasicBlock* block,
86 // Liveness at the end of each block: union of liveness in successors.
88 for (HSuccessorIterator it(block->end()); !it.Done(); it.Advance()) {
135 // target block. Here we make use of the fact that the end of an
137 // HGoto (to return_target block), with no environment lookups in
162 // for each block until it doesn't change any more. For efficiency, visit
163 // blocks in reverse order and walk backwards through each block
47 ZapEnvironmentSlotsInSuccessors( HBasicBlock* block, BitVector* live) argument
83 UpdateLivenessAtBlockEnd( HBasicBlock* block, BitVector* live) argument
178 HBasicBlock* block = graph()->blocks()->at(block_id); local
210 HBasicBlock* block = graph()->blocks()->at(block_id); local
[all...]
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DWorkList.h31 const CFGBlock *block; member in class:clang::ento::WorkListUnit
39 block(B),
45 block(nullptr),
51 /// Returns the block counter map associated with the worklist unit.
55 const CFGBlock *getBlock() const { return block; }
/external/clang/lib/ARCMigrate/
H A DTransBlockObjCVariable.cpp14 // This transformation checks whether a reference of the variable for the block
78 bool VisitBlockDecl(BlockDecl *block) { argument
81 for (const auto &I : block->captures()) {
94 bool onlyValueOfVarIsNeeded = checker.TraverseStmt(block->getBody());
119 bool TraverseBlockDecl(BlockDecl *block) { argument
120 RootBlockObjCVarRewriter(VarsToChange).TraverseDecl(block);
/external/clang/test/CodeGenCXX/
H A Dmangle-ms-template-callback.cpp51 void block(C<void(^)(void)>) {} function
52 // CHECK: "\01?block@@YAXV?$C@P_EAXXZ@@@Z"
/external/deqp/framework/delibs/depool/
H A DdePoolStringBuilder.c60 StringBlock* block = DE_POOL_NEW(builder->pool, StringBlock); local
64 if (!block || !blockStr)
67 /* Initialize block. */
75 block->str = blockStr;
76 block->next = DE_NULL;
79 /* Add block to list. */
81 builder->blockListTail->next = block;
83 builder->blockListHead = block;
85 builder->blockListTail = block;
124 StringBlock* block local
[all...]
/external/dexmaker/src/dx/java/com/android/dx/rop/code/
H A DLocalVariableInfo.java34 * {@code non-null;} {@link RegisterSpecSet} to use when indicating a block
42 * sets of variables already assigned upon entry to each block,
43 * where array indices correspond to block labels
73 * Sets the register set associated with the start of the block with
76 * @param label {@code >= 0;} the block label
77 * @param specs {@code non-null;} the register set to associate with the block
95 * Merges the given register set into the set for the block with the
101 * @param label {@code >= 0;} the block label
103 * for the block
135 * Gets the register set associated with the start of the block
156 getStarts(BasicBlock block) argument
[all...]
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DLocalVariableInfo.java36 * {@code non-null;} {@link com.android.dx.rop.code.RegisterSpecSet} to use when indicating a block
44 * sets of variables already assigned upon entry to each block,
45 * where array indices correspond to block indices
74 * Sets the register set associated with the start of the block with
77 * @param index {@code >= 0;} the block index
78 * @param specs {@code non-null;} the register set to associate with the block
96 * Merges the given register set into the set for the block with the
102 * @param index {@code >= 0;} the block index
104 * for the block
132 * Gets the register set associated with the start of the block
153 getStarts(SsaBasicBlock block) argument
[all...]
H A DSsaConverter.java56 * The exit block, added here, is not considered for edge splitting
127 * requiring each block with a final instruction that returns a
150 * New blocks are added to the end of the block list during
154 SsaBasicBlock block = blocks.get(i);
155 if (nodeNeedsUniquePredecessor(block)) {
156 block.insertNewPredecessor();
162 * @param block {@code non-null;} block in question
166 private static boolean nodeNeedsUniquePredecessor(SsaBasicBlock block) { argument
168 * Any block wit
266 needsNewSuccessor(SsaBasicBlock block, SsaBasicBlock succ) argument
[all...]
/external/dexmaker/src/dx/java/com/android/dx/ssa/back/
H A DIdenticalBlockCombiner.java34 * block and the now-unused blocks are deleted. These identical blocks
55 * a hash. In particular, hash the contents of each block and only
65 // For each non-deleted block...
70 // doomed block
124 * @param a {@code non-null;} a block to compare
125 * @param b {@code non-null;} another block to compare
133 * Combines blocks proven identical into one alpha block, re-writing
135 * to the alpha block instead.
137 * @param alphaLabel block that will replace all the beta block
164 replaceSucc(BasicBlock block, int oldLabel, int newLabel) argument
[all...]
H A DSsaToRop.java135 * there. Furthermore, any no-op block between the exit block and
164 * predecessor block.
169 for (SsaBasicBlock block : blocks) {
171 block.forEachPhiInsn(new PhiVisitor(blocks));
174 block.removeAllPhiInsns();
181 for (SsaBasicBlock block : blocks) {
182 block.scheduleMovesFromPhis();
240 * @return rop-form basic block list
245 // Exit block ma
298 convertBasicBlock(SsaBasicBlock block) argument
[all...]

Completed in 322 milliseconds

1234567891011>>