| /art/compiler/optimizing/ |
| ssa_liveness_analysis.cc | 39 // Each instruction gets a lifetime position, and a block gets a lifetime
41 // the block they are in. Phi instructions have the lifetime start of their block as
48 for (HBasicBlock* block : graph_->GetLinearOrder()) {
49 block->SetLifetimeStart(lifetime_position);
51 for (HInstructionIterator inst_it(block->GetPhis()); !inst_it.Done(); inst_it.Advance()) {
65 // Add a null marker to notify we are starting a block.
68 for (HInstructionIterator inst_it(block->GetInstructions()); !inst_it.Done();
84 block->SetLifetimeEnd(lifetime_position);
90 for (HBasicBlock* block : graph_->GetLinearOrder())
341 HBasicBlock* block = liveness.GetBlockFromPosition(GetStart() \/ 2); local
[all...] |
| ssa_liveness_analysis_test.cc | 44 // Create entry block.
51 HBasicBlock* CreateSuccessor(HBasicBlock* block) {
52 HGraph* graph = block->GetGraph();
55 block->AddSuccessor(successor);
72 HBasicBlock* block = CreateSuccessor(entry_); local
74 block->AddInstruction(ret);
75 block->AddInstruction(new (GetAllocator()) HExit());
103 HBasicBlock* block = CreateSuccessor(entry_); local
105 block->AddInstruction(null_check);
114 block->AddInstruction(length)
172 HBasicBlock* block = CreateSuccessor(entry_); local
[all...] |
| side_effects_analysis.h | 36 SideEffects GetLoopEffects(HBasicBlock* block) const;
37 SideEffects GetBlockEffects(HBasicBlock* block) const;
56 // of the instructions in the block.
|
| superblock_cloner.h | 55 // Returns whether an edge represents a valid edge in CF graph: whether the from_ block
56 // has to_ block as a successor.
60 // Predecessor block id.
62 // Successor block id.
102 // Defining a set of basic block to copy (orig_bb_set) partitions all of the edges in the original
162 // Returns a clone of a basic block (orig_block).
164 // - The copy block will have no successors/predecessors; they should be set up manually.
165 // - For each instruction in the orig_block a copy is created and inserted into the copy block;
168 // same, as in the original block, PHIs do not reflect a correct correspondence between the
169 // value and predecessors (as the copy block has no predecessors by now), etc
183 HBasicBlock* block = bb_map_->Get(orig_block); local
278 HBasicBlock* block = graph_->GetBlocks()[block_id]; local
[all...] |
| /external/jemalloc/src/ |
| tsd.c | 168 tsd_init_check_recursion(tsd_init_head_t *head, tsd_init_block_t *block)
181 /* Insert block into list. */
182 ql_elm_new(block, link);
183 block->thread = self;
184 ql_tail_insert(&head->blocks, block, link);
190 tsd_init_finish(tsd_init_head_t *head, tsd_init_block_t *block)
194 ql_remove(&head->blocks, block, link);
|
| /external/protobuf/ruby/lib/google/protobuf/ |
| repeated_field.rb | 115 define_method(method_name) do |*args, &block|
120 return block ? block.call : result
127 define_method(method_name) do |*args, &block|
129 # Enumerator can sometimes be returned if a block is an optional argument and it is not passed in
131 result = self.to_a.send(method_name, *args, &block)
171 def each(*args, &block)
|
| /external/valgrind/memcheck/tests/ |
| realloc3.stderr.exp | 3 Address 0x........ is 15 bytes after a block of size 5 alloc'd
9 Address 0x........ is 15 bytes after a block of size 5 alloc'd
15 Address 0x........ is 15 bytes after a block of size 5 alloc'd
|
| /external/eigen/test/ |
| sparse_block.cpp | 50 // test InnerIterators and Block expressions
58 VERIFY_IS_APPROX(m.block(i,j,h,w), refMat.block(i,j,h,w));
61 VERIFY_IS_APPROX(m.block(i,j,h,w).col(c), refMat.block(i,j,h,w).col(c));
64 VERIFY_IS_APPROX(m.block(i,j,h,w).col(c).coeff(r), refMat.block(i,j,h,w).col(c).coeff(r));
65 VERIFY_IS_APPROX(m.block(i,j,h,w).coeff(r,c), refMat.block(i,j,h,w).coeff(r,c));
70 VERIFY_IS_APPROX(m.block(i,j,h,w).row(r), refMat.block(i,j,h,w).row(r))
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_copy_propagation.cpp | 27 * intra-block copy (and constant) propagation, and a global pass that uses
28 * dataflow analysis on the copies available at the end of each block to re-do
55 * start of this block. This is the useful output of the analysis, since
63 * of this block. This is done in initial setup from the per-block acps
70 * instructions in this block which reach the end of the block without
77 * course of this block.
111 foreach_block (block, cfg) {
113 num_acp += out_acp[block->num][i].length()
[all...] |
| brw_vec4_live_variables.cpp | 35 * Support for computing at the basic block level which variables
45 * The basic-block-level live variable analysis needs to know which
60 * doesn't get tmp marked a deffed in this block will tend to result in
68 foreach_block (block, cfg) {
69 assert(ip == block->start_ip);
70 if (block->num > 0)
71 assert(cfg->blocks[block->num - 1]->end_ip == ip - 1);
73 foreach_inst_in_block(vec4_instruction, inst, block) {
74 struct block_data *bd = &block_data[block->num];
139 foreach_block_reverse (block, cfg)
[all...] |
| brw_fs_combine_constants.cpp | 103 bblock_t *block; member in struct:imm
107 * within a single basic block. Otherwise, NULL.
171 * We sort by basic block number, then last use IP, then first use IP (least
182 int block_diff = a->block->num - b->block->num;
210 foreach_block_and_inst(block, fs_inst, inst, cfg) {
226 bblock_t *intersection = cfg_t::intersect(block, imm->block);
227 if (intersection != imm->block)
229 imm->block = intersection
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-gvn.cc | 538 // Compute side effects for the block.
539 HBasicBlock* block = graph()->blocks()->at(i); local
541 if (block->IsReachable() && !block->IsDeoptimizing()) {
542 int id = block->block_id();
543 for (HInstructionIterator it(block); !it.Done(); it.Advance()) {
550 if (block->IsLoopHeader()) {
555 if (block->HasParentLoopHeader()) {
556 HBasicBlock* with_parent = block;
557 if (block->IsLoopHeader()) side_effects = loop_side_effects_[id]
573 HBasicBlock* block = graph()->blocks()->at(i); local
583 ProcessLoopBlock(graph()->blocks()->at(j), block, side_effects); local
655 HBasicBlock* block = dominated->predecessors()->at(i); local
687 HBasicBlock* block() { return block_; } function in class:v8::internal::BASE_EMBEDDED::GvnBasicBlockState
797 HBasicBlock* block = current->block(); local
[all...] |
| /external/squashfs-tools/kernel/fs/squashfs/ |
| inode.c | 28 * location of the compressed metadata block containing the inode, and the byte
29 * offset into that block where the inode is placed (<block, offset>).
111 u64 block = SQUASHFS_INODE_BLK(ino) + msblk->inode_table; local
121 err = squashfs_read_metadata(sb, sqshb_ino, &block,
130 block = SQUASHFS_INODE_BLK(ino) + msblk->inode_table;
140 err = squashfs_read_metadata(sb, sqsh_ino, &block, &offset,
168 squashfs_i(inode)->block_list_start = block;
174 offset, squashfs_i(inode)->start, block, offset);
182 err = squashfs_read_metadata(sb, sqsh_ino, &block, &offset
[all...] |
| /external/boringssl/src/crypto/fipsmodule/modes/ |
| cfb.c | 61 int enc, block128_f block) {
79 (*block)(ivec, ivec, key);
90 (*block)(ivec, ivec, key);
102 (*block)(ivec, ivec, key);
124 (*block)(ivec, ivec, key);
135 (*block)(ivec, ivec, key);
147 (*block)(ivec, ivec, key);
161 /* This expects a single block of size nbits for both in and out. Note that
165 block128_f block) {
177 (*block)(ivec, ivec, key)
[all...] |
| /prebuilts/go/darwin-x86/src/runtime/ |
| mgcsweepbuf.go | 20 // can be accessed without locks, but adding a block or
60 // Do we need to add a block?
62 var block *gcSweepBlock
67 block = (*gcSweepBlock)(atomic.Loadp(blockp))
69 // Add a new block to the spine, potentially growing
104 // Allocate a new block and add it to the spine.
105 block = (*gcSweepBlock)(persistentalloc(unsafe.Sizeof(gcSweepBlock{}), sys.CacheLineSize, &memstats.gc_sys))
108 atomic.StorepNoWB(blockp, unsafe.Pointer(block))
113 // We have a block. Insert the span.
114 block.spans[bottom] =
150 func (b *gcSweepBuf) block(i int) []*mspan { func
[all...] |
| /prebuilts/go/linux-x86/src/runtime/ |
| mgcsweepbuf.go | 20 // can be accessed without locks, but adding a block or
60 // Do we need to add a block?
62 var block *gcSweepBlock
67 block = (*gcSweepBlock)(atomic.Loadp(blockp))
69 // Add a new block to the spine, potentially growing
104 // Allocate a new block and add it to the spine.
105 block = (*gcSweepBlock)(persistentalloc(unsafe.Sizeof(gcSweepBlock{}), sys.CacheLineSize, &memstats.gc_sys))
108 atomic.StorepNoWB(blockp, unsafe.Pointer(block))
113 // We have a block. Insert the span.
114 block.spans[bottom] =
150 func (b *gcSweepBuf) block(i int) []*mspan { func
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| tst_bitmaps.c | 175 retval = ext2fs_allocate_block_bitmap(test_fs, "block bitmap",
178 com_err(name, retval, "while allocating block bitmap");
286 printf("block bitmap: ");
293 unsigned int block, num; local
301 com_err(argv[0], 0, "Usage: setb <block> [num]");
305 block = parse_ulong(argv[1], argv[0], "block", &err);
315 block, num);
316 printf("Marking blocks %u to %u\n", block, block + num - 1)
331 unsigned int block, num; local
369 unsigned int block, num; local
[all...] |
| unix_io.c | 5 * Implements a one-block write-through cache.
84 unsigned long long block; member in struct:unix_cache
130 unsigned long long block,
141 location = ((ext2_loff_t) block * channel->block_size) + data->offset;
207 retval = (channel->read_error)(channel, block, count, buf,
214 unsigned long long block,
233 location = ((ext2_loff_t) block * channel->block_size) + data->offset;
308 retval = (channel->write_error)(channel, block, count, buf,
328 cache->block = 0;
354 cache->block = 0
[all...] |
| /external/gemmlowp/meta/generators/ |
| neon_emitter_64.py | [all...] |
| /bootable/recovery/minadbd/ |
| fuse_adb_provider.cpp | 30 int read_block_adb(const adb_data& ad, uint32_t block, uint8_t* buffer, uint32_t fetch_size) {
31 if (!WriteFdFmt(ad.sfd, "%08u", block)) {
|
| /external/abi-compliance-checker/modules/Internals/Scripts/ |
| Sections.js | 6 e.style.display = 'block';
|
| /external/avb/libavb/ |
| avb_sha.h | 43 /* Block size in bytes of a SHA-256 digest. */
47 /* Block size in bytes of a SHA-512 digest. */
55 uint8_t block[2 * AVB_SHA256_BLOCK_SIZE]; member in struct:__anon14246
64 uint8_t block[2 * AVB_SHA512_BLOCK_SIZE]; member in struct:__anon14247
|
| /external/clang/test/CodeGenCXX/ |
| instantiate-blocks.cpp | 6 void (^block)(int);
23 T1 (^block)(char, T, T1, double) =
|
| /external/clang/test/Sema/ |
| block-args.c | 20 ^{return 2;}(arg); // expected-error {{too many arguments to block call}}
21 ^(void){return 3;}(1); // expected-error {{too many arguments to block call}}
22 ^(){return 4;}(arg); // expected-error {{too many arguments to block call}}
55 void (^block)(array_ty) = ^(array_ty arr) { };
57 block(arr);
|
| /external/freetype/include/freetype/ |
| ftsystem.h | 85 * Address of new memory block. 0~in case of failure.
99 * A function used to release a given block of memory.
105 * block ::
106 * The address of the target memory block.
111 void* block );
120 * A function used to re-allocate a given block of memory.
127 * The block's current size in bytes.
130 * The block's requested new size.
132 * block ::
133 * The block's current address
[all...] |
