| /frameworks/base/libs/hwui/ |
| PatchCache.cpp | 80 BufferBlock* block = mFreeBlocks; local
81 while (block) {
82 BufferBlock* next = block->next;
83 delete block;
84 block = next;
138 BufferBlock* block = new BufferBlock(patch->positionOffset, patch->getSize()); local
139 block->next = mFreeBlocks;
140 mFreeBlocks = block;
179 // Find a block where we can fit the mesh
181 BufferBlock* block = mFreeBlocks local
254 BufferBlock* block = mFreeBlocks; 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/e2fsprogs/lib/ext2fs/ |
| ext2_io.h | 45 unsigned long block,
52 unsigned long block,
79 errcode_t (*read_blk)(io_channel channel, unsigned long block,
81 errcode_t (*write_blk)(io_channel channel, unsigned long block,
89 errcode_t (*read_blk64)(io_channel channel, unsigned long long block,
91 errcode_t (*write_blk64)(io_channel channel, unsigned long long block,
93 errcode_t (*discard)(io_channel channel, unsigned long long block,
96 unsigned long long block,
98 errcode_t (*zeroout)(io_channel channel, unsigned long long block,
124 unsigned long long block,
[all...] |
| /external/ltp/testcases/kernel/io/writetest/ |
| writetest.c | 80 off_t block; local
89 for (block = 0; block < num_blocks; block++) {
92 tst_resm(TINFO, "Block: %lld/%lld (%3lld%%)\r",
93 (long long int)block,
95 (long long int)(block * 100 / num_blocks));
104 tst_resm(TINFO, "Block: %lld/%lld (%3lld%%)\r",
105 (long long int)block, (long long int)num_blocks,
106 (long long int)(block * 100 / num_blocks))
115 off_t block; local
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| compare_and_bitpack_op_gpu.cu.cc | 46 const T* block = input + 8 * i; local
48 ((((ldg(block) > thresh) << 7)) | (((ldg(block + 1) > thresh) << 6)) |
49 (((ldg(block + 2) > thresh) << 5)) |
50 (((ldg(block + 3) > thresh) << 4)) |
51 (((ldg(block + 4) > thresh) << 3)) |
52 (((ldg(block + 5) > thresh) << 2)) |
53 (((ldg(block + 6) > thresh) << 1)) | (((ldg(block + 7) > thresh))));
63 // threads work on one block and use the ballot instruction to th
66 const int64 block = ldg(reinterpret_cast<const int64*>(input + 8 * i)); local
[all...] |
| 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...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Lua/src/ |
| lmem.c | 29 ** * frealloc(ud, NULL, x, s) creates a new block of size `s' (no
32 ** * frealloc(ud, p, x, 0) frees the block `p'
46 void *luaM_growaux_ (lua_State *L, void *block, int *size, size_t size_elems,
60 newblock = luaM_reallocv(L, block, *size, newsize, size_elems);
67 luaG_runerror(L, "memory allocation error: block too big");
75 void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) {
78 size_t realosize = (block) ? osize : 0;
79 lua_assert((realosize == 0) == (block == NULL));
84 newblock = (*g->frealloc)(g->ud, block, osize, nsize);
87 "realloc cannot fail when shrinking a block");
[all...] |
| /external/mesa3d/src/compiler/nir/ |
| nir_liveness.c | 35 * blocks so that the destinations of a phi are in the livein of the block
37 * corresponding block. By formulating the liveness information in this
42 * block but not in the live-in of the block containing the phi node.
65 /* Initialize the liveness data to zero and add the given block to the
69 init_liveness_block(nir_block *block,
72 block->live_in = reralloc(block, block->live_in, BITSET_WORD,
74 memset(block->live_in, 0, state->bitset_words * sizeof(BITSET_WORD))
195 nir_block *block = nir_block_worklist_pop_head(&state.worklist); local
[all...] |
| /external/mesa3d/src/gallium/auxiliary/rtasm/ |
| rtasm_execmem.c | 56 * Allocate a large block of memory which can hold code then dole it out
90 struct mem_block *block = NULL; local
100 block = u_mmAllocMem( exec_heap, size, 5, 0 ); /* 5 -> 32-byte alignment */
103 if (block)
104 addr = exec_mem + block->ofs;
121 struct mem_block *block = u_mmFindBlock(exec_heap, (unsigned char *)addr - exec_mem); local
123 if (block)
124 u_mmFreeMem(block);
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| memory_pool.c | 47 struct memory_block * block = pool->blocks; local
48 pool->blocks = block->next;
49 free(block);
88 struct memory_block * block = malloc(bytes + sizeof(struct memory_block)); local
90 block->next = pool->blocks;
91 pool->blocks = block;
93 return (block + 1);
|
| /external/mesa3d/src/mesa/main/ |
| execmem.c | 42 * Allocate a large block of memory which can hold code then dole it out
93 struct mem_block *block = NULL; local
103 block = mmAllocMem( exec_heap, size, 32, 0 );
106 if (block)
107 addr = exec_mem + block->ofs;
124 struct mem_block *block = mmFindBlock(exec_heap, (unsigned char *)addr - exec_mem); local
126 if (block)
127 mmFreeMem(block);
|
| /external/syslinux/com32/lua/src/ |
| lmem.c | 29 ** * frealloc(ud, NULL, x, s) creates a new block of size `s' (no
32 ** * frealloc(ud, p, x, 0) frees the block `p'
46 void *luaM_growaux_ (lua_State *L, void *block, int *size, size_t size_elems,
60 newblock = luaM_reallocv(L, block, *size, newsize, size_elems);
67 luaG_runerror(L, "memory allocation error: block too big");
75 void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) {
78 size_t realosize = (block) ? osize : 0;
79 lua_assert((realosize == 0) == (block == NULL));
84 newblock = (*g->frealloc)(g->ud, block, osize, nsize);
87 "realloc cannot fail when shrinking a block");
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-infer-types.cc | 13 HBasicBlock* block = graph()->blocks()->at(i); local
15 const ZoneList<HPhi*>* phis = block->phis();
20 for (HInstructionIterator it(block); !it.Done(); it.Advance()) {
24 if (block->IsLoopHeader()) {
26 block->loop_information()->GetLastBackEdge();
32 for (int j = 0; j < block->phis()->length(); ++j) {
33 HPhi* phi = block->phis()->at(j);
|
| /system/update_engine/scripts/update_payload/ |
| block_tracer.py | 5 """Tracing block data source through a Chrome OS update payload.
7 This module is used internally by the main Payload class for tracing block
23 # Payload block tracing.
26 """Tracing the origin of block data through update instructions.
38 def _TraceBlock(block, skip, trace_out_file, operations, base_name):
39 """Trace the origin of a given block through a sequence of operations.
41 This method tries to map the given dest block to the corresponding source
42 block from which its content originates in the course of an update. It
46 source blocks responsible for the data in the given dest block to the
50 block: the block number to trac
[all...] |
| /external/ImageMagick/MagickCore/ |
| memory.c | 73 #define BlockFooter(block,size) \
74 ((size_t *) ((char *) (block)+(size)-2*sizeof(size_t)))
75 #define BlockHeader(block) ((size_t *) (block)-1)
82 #define NextBlock(block) ((char *) (block)+SizeOfBlock(block))
83 #define NextBlockInList(block) (*(void **) (block))
84 #define PreviousBlock(block) ((char *) (block)-(*((size_t *) (block)-2))
384 *block; local
787 *block; local
1184 *block; local
[all...] |
| /art/compiler/optimizing/ |
| linear_order.cc | 41 HBasicBlock* block) {
42 HLoopInformation* block_loop = block->GetLoopInformation();
50 // The block can be processed immediately.
54 worklist->insert(insert_pos.base(), block);
66 for (HBasicBlock* block : linear_order) {
67 if (loop->Contains(*block)) {
69 if (found_blocks == 1u && block != header) {
70 // First block is not the header.
72 } else if (found_blocks == num_blocks && !loop->IsBackEdge(*block)) {
73 // Last block is not a back edge
[all...] |
| /external/deqp/framework/delibs/depool/ |
| dePoolStringBuilder.c | 60 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 = builder->blockListHead local
[all...] |
| /external/e2fsprogs/e2fsck/ |
| ehandler.c | 2 * ehandler.c --- handle bad block errors which come up during the
24 unsigned long block,
40 * If more than one block was read, try reading each block
46 for (i=0; i < count; i++, p += channel->block_size, block++) {
47 error = io_channel_read_blk64(channel, block,
55 printf(_("Error reading block %lu (%s) while %s. "), block,
58 printf(_("Error reading block %lu (%s). "), block,
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_lower_pack.cpp | 35 foreach_block_and_inst_safe(block, fs_inst, inst, cfg) {
43 const fs_builder ibld(this, block, inst);
47 inst->remove(block);
|
| /frameworks/base/core/java/android/os/ |
| ConditionVariable.java | 25 * open(), close() and block() are sticky. If open() is called before block(),
26 * block() will not block, and instead return immediately.
59 * Any threads that later approach block() will not block unless close()
77 * Any threads that call block() will block until someone calls open.
87 * Block the current thread until the condition is opened.
92 public void block() method in class:ConditionVariable
117 public boolean block(long timeout) method in class:ConditionVariable
[all...] |
| /system/libhidl/libhidlcache/include/hidlcache/ |
| mapping.h | 20 #include <android/hidl/memory/block/1.0/types.h>
36 const ::android::hidl::memory::block::V1_0::MemoryBlock& block);
|
| /external/compiler-rt/lib/tsan/tests/unit/ |
| tsan_sync_test.cc | 22 u64 block[1] = {}; // fake malloc block local
23 m->AllocBlock(thr, 0, (uptr)&block[0], 1 * sizeof(u64));
24 MBlock *mb = m->GetBlock((uptr)&block[0]);
28 uptr sz = m->FreeBlock(thr->proc(), (uptr)&block[0]);
30 mb = m->GetBlock((uptr)&block[0]);
37 u64 block[4] = {}; // fake malloc block local
38 m->AllocBlock(thr, 0, (uptr)&block[0], 1 * sizeof(u64));
39 m->AllocBlock(thr, 0, (uptr)&block[1], 3 * sizeof(u64))
54 u64 block[4] = {}; \/\/ fake malloc block local
114 u64 block[1] = {}; \/\/ fake malloc block local
[all...] |
| /external/mesa3d/src/gallium/drivers/freedreno/ir3/ |
| ir3_legalize.c | 49 /* We want to evaluate each block from the position of any other
50 * predecessor block, in order that the flags set are the union
52 * want to stop when the pair of <pred-block, current-block> has
56 * flags set depending on path leading to pred-block.. we could
60 * For now we just set ss/sy flag on first instruction on block,
61 * and handle everything within the block as before.
65 legalize_block(struct ir3_legalize_ctx *ctx, struct ir3_block *block)
81 list_replace(&block->instr_list, &instr_list);
82 list_inithead(&block->instr_list)
[all...] |
| /external/tensorflow/tensorflow/contrib/kfac/python/kernel_tests/ |
| fisher_blocks_test.py | 65 block = fb.FullFB(lc.LayerCollection(), params)
66 block.register_additional_minibatch(32)
68 self.assertAllEqual(params, block.tensors_to_compute_grads())
74 block = fb.FullFB(lc.LayerCollection(), params)
75 block.register_additional_minibatch(32)
77 self.assertAllEqual(params, block.tensors_to_compute_grads())
83 block = fb.FullFB(lc.LayerCollection(), params)
84 block.register_additional_minibatch(32)
87 block.instantiate_factors(grads, 0.5)
93 block = fb.FullFB(lc.LayerCollection(), params
[all...] |
| /external/mesa3d/src/gallium/drivers/vc4/ |
| vc4_qpu_emit.c | 47 queue(struct qblock *block, uint64_t inst)
49 struct queued_qpu_inst *q = rzalloc(block, struct queued_qpu_inst);
51 list_addtail(&q->link, &block->qpu_inst_list);
55 last_inst(struct qblock *block)
58 (struct queued_qpu_inst *)block->qpu_inst_list.prev;
63 set_last_cond_add(struct qblock *block, uint32_t cond)
65 *last_inst(block) = qpu_set_cond_add(*last_inst(block), cond);
69 set_last_cond_mul(struct qblock *block, uint32_t cond)
71 *last_inst(block) = qpu_set_cond_mul(*last_inst(block), cond)
[all...] |
