| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| lp_bld_type.c | 401 LLVMBasicBlockRef block; local
403 block = LLVMGetFirstBasicBlock(function);
404 while (block) {
406 instr = LLVMGetFirstInstruction(block);
412 block = LLVMGetNextBasicBlock(block);
|
| /external/mesa3d/src/gallium/auxiliary/rbug/ |
| rbug_context.h | 67 rbug_block_t block; member in struct:rbug_proto_context_draw_block
92 rbug_block_t block; member in struct:rbug_proto_context_draw_rule
128 rbug_block_t block; member in struct:rbug_proto_context_draw_blocked
140 rbug_block_t block,
159 rbug_block_t block,
187 rbug_block_t block,
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_test_format.c | 96 LLVMBasicBlockRef block; local
121 block = LLVMAppendBasicBlockInContext(context, func, "entry");
122 LLVMPositionBuilderAtEnd(builder, block);
178 for (i = 0; i < desc->block.height; ++i) {
179 for (j = 0; j < desc->block.width; ++j) {
277 for (i = 0; i < desc->block.height; ++i) {
278 for (j = 0; j < desc->block.width; ++j) {
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| 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/mesa3d/src/mesa/main/ |
| texcompress_etc_tmp.h | 84 TAG(etc1_parse_block)(struct TAG(etc1_block) *block, const UINT8_TYPE *src)
88 block->base_colors[0][0] = (int) TAG(etc1_base_color_diff_hi)(src[0]);
89 block->base_colors[1][0] = (int) TAG(etc1_base_color_diff_lo)(src[0]);
90 block->base_colors[0][1] = (int) TAG(etc1_base_color_diff_hi)(src[1]);
91 block->base_colors[1][1] = (int) TAG(etc1_base_color_diff_lo)(src[1]);
92 block->base_colors[0][2] = (int) TAG(etc1_base_color_diff_hi)(src[2]);
93 block->base_colors[1][2] = (int) TAG(etc1_base_color_diff_lo)(src[2]);
97 block->base_colors[0][0] = (int) TAG(etc1_base_color_ind_hi)(src[0]);
98 block->base_colors[1][0] = (int) TAG(etc1_base_color_ind_lo)(src[0]);
99 block->base_colors[0][1] = (int) TAG(etc1_base_color_ind_hi)(src[1])
147 struct etc1_block block; local
[all...] |
| /external/protobuf/ruby/src/main/java/com/google/protobuf/jruby/ |
| RubyBuilder.java | 79 * Builder.add_message(name, &block)
81 * Creates a new, empty descriptor with the given name, and invokes the block in
82 * the context of a MessageBuilderContext on that descriptor. The block can then
89 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);
93 if (block.isGiven()) {
94 if (block.arity() == Arity.ONE_ARGUMENT) {
95 block.yield(context, ctx)
[all...] |
| RubyDescriptorPool.java | 58 descriptorPool = (RubyDescriptorPool) cDescriptorPool.newInstance(runtime.getCurrentContext(), Block.NULL_BLOCK);
74 public IRubyObject build(ThreadContext context, Block block) {
75 RubyBuilder ctx = (RubyBuilder) cBuilder.newInstance(context, Block.NULL_BLOCK);
76 if (block.arity() == Arity.ONE_ARGUMENT) {
77 block.yield(context, ctx);
79 Binding binding = block.getBinding();
81 block.yieldSpecific(context);
|
| /external/python/cpython2/Lib/plat-riscos/ |
| riscospath.py | 35 block= swi variable in class:_swi
258 b= swi.block(l)
281 b= swi.block(l)
313 b= swi.block(l)
|
| /external/python/cpython2/Python/ |
| pyarena.c | 4 /* A simple arena block structure.
8 block.
20 /* Total number of bytes owned by this block available to pass out.
37 /* Pointer to the first allocatable byte owned by this block. Read-
41 } block; typedef in typeref:struct:_block
49 /* Pointer to the first block allocated for the arena, never NULL.
50 It is used only to find the first block when the arena is
53 block *a_head;
55 /* Pointer to the block currently used for allocation. It's
57 call to block_alloc(), it means a new block has been allocate
[all...] |
| /external/python/cpython3/Python/ |
| pyarena.c | 3 /* A simple arena block structure.
7 block.
17 /* Total number of bytes owned by this block available to pass out.
34 /* Pointer to the first allocatable byte owned by this block. Read-
38 } block; typedef in typeref:struct:_block
46 /* Pointer to the first block allocated for the arena, never NULL.
47 It is used only to find the first block when the arena is
50 block *a_head;
52 /* Pointer to the block currently used for allocation. It's
54 call to block_alloc(), it means a new block has been allocate
[all...] |
| /external/squashfs-tools/kernel/fs/squashfs/ |
| file.c | 27 * compressed fragment block (tail-end packed block). The compressed size
28 * of each datablock is stored in a block list contained within the
33 * block index to datablock location on disk.
36 * retaining a simple and space-efficient block list on disk. The cache
171 * Read the next n blocks from the block list, starting from
172 * metadata block <start_block, offset>.
178 long long block = 0; local
192 ERROR("read_indexes: reading block [%llx:%x]\n",
199 block += SQUASHFS_COMPRESSED_SIZE_BLOCK(size)
402 u64 block = 0; local
[all...] |
| /external/squashfs-tools/kernel-2.4/include/linux/ |
| squashfs_fs_sb.h | 30 long long block; member in struct:squashfs_cache
37 long long block; member in struct:squashfs_fragment_cache
|
| /external/stressapptest/src/ |
| disk_blocks.cc | 81 void DiskBlockTable::InsertOnStructure(BlockData *block) {
82 int64 address = block->address();
84 sd->block = block;
86 // Creating new block ...
99 int DiskBlockTable::RemoveBlock(BlockData *block) {
102 int64 address = block->address();
112 // Everything is fine, removing block from table.
119 block->DecreaseReferenceCounter();
120 if (block->GetReferenceCounter() == 0
197 BlockData *block = new BlockData(); local
[all...] |
| disk_blocks.h | 33 // Data about a block written to disk so that it can be verified later.
44 // threads currently have a copy of this particular block.
49 // Controls whether the block was written on disk or not.
63 uint64 address_; // Address of first sector in block
64 uint64 size_; // Size of block
66 bool initialized_; // Flag indicating the block was written on disk
72 // A thread-safe table used to store block data and control access
93 // reads block content ONCE from disk and them removes
94 // the block from queue with RemoveBlock. After a removal a
95 // block is not available for read threads, but it i
131 BlockData *block; member in struct:DiskBlockTable::StorageData
[all...] |
| /external/syslinux/com32/libutil/ |
| sha1hash.c | 90 #define blk0(i) (block->l[i] = ntohl(block->l[i]))
91 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
92 ^block->l[(i+2)&15]^block->l[i&15],1))
113 /* Hash a single 512-bit block. This is the core of the algorithm. */
122 CHAR64LONG16 *block; local
125 block = (CHAR64LONG16 *) workspace
[all...] |
| /external/syslinux/core/fs/ext2/ |
| bmap.c | 2 * The logical block -> physical block routine.
17 block_t block)
31 if (block < index[i].ei_block)
43 /* handle the ext4 extents to get the phsical block number */
46 bmap_extent(struct inode *inode, uint32_t block, size_t *nblocks)
54 leaf = ext4_find_leaf(fs, &PVT(inode)->i_extent_hdr, block);
62 if (block < ext[i].ee_block)
66 printf("ERROR, not find the right block\n");
71 block -= ext[i].ee_block
215 block_t block; local
[all...] |
| /external/syslinux/gpxe/src/core/ |
| malloc.c | 36 /** A free block of memory */
40 /** Size of this block */
47 /** A block of allocated memory complete with size information */
49 /** Size of this block */
89 * Allocate a memory block
93 * @ret ptr Memory block, or NULL
95 * Allocates a memory block @b physically aligned as requested. No
101 struct memory_block *block; local
117 list_for_each_entry ( block, &free_blocks, list ) {
118 pre_size = ( - virt_to_phys ( block ) ) & align_mask
176 struct memory_block *block; local
[all...] |
| /external/syslinux/gpxe/src/include/gpxe/ |
| tftp.h | 15 #define TFTP_DEFAULT_BLKSIZE 512 /**< Default TFTP data block size */
20 #define TFTP_DATA 3 /**< Data block opcode */
21 #define TFTP_ACK 4 /**< Data block acknowledgement opcode */
45 uint16_t block; member in struct:tftp_data
52 uint16_t block; member in struct:tftp_ack
|
| /external/tensorflow/tensorflow/core/kernels/ |
| compare_and_bitpack_op.cc | 95 const T* block = input.data() + 8 * i; local
96 *out = ((((block[0] > thresh) << 7)) | (((block[1] > thresh) << 6)) |
97 (((block[2] > thresh) << 5)) | (((block[3] > thresh) << 4)) |
98 (((block[4] > thresh) << 3)) | (((block[5] > thresh) << 2)) |
99 (((block[6] > thresh) << 1)) | (((block[7] > thresh))));
116 const int64 block = *reinterpret_cast<const int64*>(input.data() + 8 * i) local
[all...] |
| /external/tensorflow/tensorflow/core/lib/io/ |
| table.cc | 20 #include "tensorflow/core/lib/io/block.h"
38 Block* index_block;
58 // Read the index block
60 Block* index_block = nullptr;
64 index_block = new Block(contents);
69 // We've successfully read the footer and the index block: we're
89 delete reinterpret_cast<Block*>(arg);
93 // into an iterator over the contents of the corresponding block.
97 Block* block = nullptr local
[all...] |
| /external/tensorflow/tensorflow/core/platform/cloud/ |
| file_block_cache.cc | 24 bool FileBlockCache::BlockNotStale(const std::shared_ptr<Block>& block) {
25 mutex_lock l(block->mu);
26 if (block->state != FetchState::FINISHED) {
30 return env_->NowSeconds() - block->timestamp <= max_staleness_;
33 std::shared_ptr<FileBlockCache::Block> FileBlockCache::Lookup(const Key& key) {
40 // Remove the stale block and continue.
45 // Insert a new empty block, setting the bookkeeping to sentinel values
47 auto new_entry = std::make_shared<Block>();
64 /// Move the block to the front of the LRU list if it isn't already there
180 std::shared_ptr<Block> block = Lookup(key); local
[all...] |
| /external/toybox/toys/posix/ |
| df.c | 100 unsigned long long size, used, avail, percent, block; local
126 block = mt->statvfs.f_bsize ? mt->statvfs.f_bsize : 1;
127 size = (block * mt->statvfs.f_blocks) / TT.units;
128 used = (block * (mt->statvfs.f_blocks-mt->statvfs.f_bfree)) / TT.units;
129 avail= (block*(getuid()?mt->statvfs.f_bavail:mt->statvfs.f_bfree))/TT.units;
|
| /external/v8/src/compiler/ |
| jump-threading.cc | 48 result[from.ToInt()] = to_to; // forward the block.
66 for (auto const block : code->instruction_blocks()) {
67 RpoNumber current = block->rpo_number();
72 InstructionBlock* block = code->InstructionBlockAt(state.stack.top()); local
73 // Process the instructions in a block up to a non-empty instruction.
75 block->rpo_number().ToInt());
77 RpoNumber fw = block->rpo_number();
78 for (int i = block->code_start(); i < block->code_end(); ++i) {
95 // if this block deconstructs the frame, we can't forward it
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-flow-engine.h | 52 // over a graph of basic blocks, either one block at a time (local analysis)
62 // each block at most twice; once for state, and optionally once for effects.
81 // Local analysis. Iterates over the instructions in the given block.
82 State* AnalyzeOneBlock(HBasicBlock* block, State* state) {
83 // Go through all instructions of the current block, updating the state.
84 for (HInstructionIterator it(block); !it.Done(); it.Advance()) {
91 // block, starting with the initial state. Computes effects for nested loops.
96 // Iterate all dominated blocks starting from the given start block.
98 HBasicBlock* block = graph_->blocks()->at(i); local
101 if (SkipNonDominatedBlock(root, block)) continue
[all...] |
| hydrogen-range-analysis.cc | 14 Pending(HBasicBlock* block, int last_changed_range)
15 : block_(block), last_changed_range_(last_changed_range) {}
17 HBasicBlock* block() const { return block_; } function in class:v8::internal::Pending
37 HBasicBlock* block(graph()->entry_block());
39 while (block != NULL) {
40 TraceRange("Analyzing block B%d\n", block->block_id());
43 if (block->predecessors()->length() == 1) {
44 HBasicBlock* pred = block->predecessors()->first();
47 block);
107 HBasicBlock* block = graph()->blocks()->at(i); local
[all...] |
