| /external/chromium_org/third_party/freetype/src/base/ |
| ftutil.c | 55 FT_Pointer block = ft_mem_qalloc( memory, size, &error ); local
58 FT_MEM_ZERO( block, size );
61 return block;
71 FT_Pointer block = NULL; local
76 block = memory->alloc( memory, size );
77 if ( block == NULL )
87 return block;
96 void* block,
101 block = ft_mem_qrealloc( memory, item_size,
102 cur_count, new_count, block, &error )
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-escape-analysis.cc | 55 HBasicBlock* block = graph()->blocks()->at(i); local
56 for (HInstructionIterator it(block); !it.Done(); it.Advance()) {
89 HBasicBlock* block = previous->block(); local
93 HPhi* phi = NewPhiAndInsert(block, operand, index);
112 // Insert a newly created phi into the given block and fill all incoming
115 HBasicBlock* block, HValue* incoming_value, int index) {
118 for (int i = 0; i < block->predecessors()->length(); i++) {
121 block->AddPhi(phi);
131 HBasicBlock* allocate_block = allocate->block();
138 HBasicBlock* block = graph()->blocks()->at(i); local
[all...] |
| hydrogen-environment-liveness.cc | 71 HBasicBlock* block, BitVector* live) {
74 for (HSuccessorIterator it(block->end()); !it.Done(); it.Advance()) {
88 block->last_environment()->closure()));
107 HBasicBlock* block,
109 // Liveness at the end of each block: union of liveness in successors.
111 for (HSuccessorIterator it(block->end()); !it.Done(); it.Advance()) {
158 // target block. Here we make use of the fact that the end of an
160 // HGoto (to return_target block), with no environment lookups in
185 // for each block until it doesn't change any more. For efficiency, visit
186 // blocks in reverse order and walk backwards through each block. W
201 HBasicBlock* block = graph()->blocks()->at(block_id); local
233 HBasicBlock* block = graph()->blocks()->at(block_id); local
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| mkdir.c | 41 char *block = 0; local
56 * Allocate a data block for the directory
65 retval = ext2fs_new_dir_block(fs, ino, parent, &block);
91 * Write out the inode and inode data block
93 retval = ext2fs_write_dir_block(fs, blk, block);
135 if (block)
136 ext2fs_free_mem(&block);
|
| /external/eigen/doc/ |
| tutorial.cpp | 19 // demo fixed-size block() expression as lvalue and as rvalue
20 m4.block<3,3>(0,1) = m3;
21 m3.row(2) = m4.block<1,3>(2,0);
25 // demo dynamic-size block()
28 m4.block(0,1,3,3).setIdentity();
33 m4.diagonal().block(1,2).setOnes();
55 m3 = m3 * m4.block<3,3>(1,1); // here Eigen chooses NOT to evaluate block() into a temporary
56 // because accessing coefficients of that block expression is not more costly than accessing
|
| /external/valgrind/main/memcheck/tests/amd64/ |
| bt_everything.c | 409 UChar* block; local
416 block = calloc(200,1);
417 block += 100;
425 case 0: c = btsl_mem(block, bitoff); break;
426 case 1: c = btrl_mem(block, bitoff); break;
427 case 2: c = btcl_mem(block, bitoff); break;
428 case 3: c = btl_mem(block, bitoff); break;
429 case 4: c = btsq_mem(block, bitoff); break;
430 case 5: c = btrq_mem(block, bitoff); break;
431 case 6: c = btcq_mem(block, bitoff); break
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_mm.c | 72 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->prev = heap
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| mm.c | 63 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->prev = heap
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_submatrices.cpp | 25 VERIFY_IS_APPROX(mi, m1.block(1,1,rows-1,cols-1));
42 Row.h Column.h Block.h Minor.h DiagonalCoeffs.h
79 //check block()
81 RowVectorType br1(m1.block(r1,0,1,cols));
82 VectorType bc1(m1.block(0,c1,rows,1));
83 VERIFY_IS_APPROX(b1, m1.block(r1,c1,1,1));
86 //check operator(), both constant and non-constant, on block()
87 m1.block(r1,c1,r2-r1+1,c2-c1+1) = s1 * m2.block(0, 0, r2-r1+1,c2-c1+1);
88 m1.block(r1,c1,r2-r1+1,c2-c1+1)(r2-r1,c2-c1) = m2.block(0, 0, r2-r1+1,c2-c1+1)(0,0)
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_mm.c | 72 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->prev = heap
[all...] |
| /external/mesa3d/src/mesa/main/ |
| mm.c | 63 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->prev = heap
[all...] |
| /external/ceres-solver/internal/ceres/ |
| partitioned_matrix_view.cc | 75 const Block& block = bs->cols[c]; local
77 num_cols_e_ += block.size;
79 num_cols_f_ += block.size;
98 // by the first cell in each row block.
102 const int row_block_pos = bs->rows[r].block.position;
103 const int row_block_size = bs->rows[r].block.size;
117 // Iterate over row blocks, and if the row block is in E, then
119 // E. If the row block is not in E (i.e its in the bottom
124 const int row_block_pos = bs->rows[r].block.position
201 const Block& block = bs->cols[c]; local
[all...] |
| /external/eigen/test/ |
| product_notemporary.cpp | 71 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block(r0,c0,r1,c1)).adjoint() ), 0);
72 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() -= s1 * m1.block(r0,c0,r1,c1) * m2.block(c0,r0,c1,r1) ), 0);
74 // NOTE this is because the Block expression is not handled yet by our expression analyser
75 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() = s1 * m1.block(r0,c0,r1,c1) * (s1*m2).block(c0,r0,c1,r1) ), 1)
[all...] |
| /external/chromium_org/chrome/browser/extensions/api/web_request/ |
| form_data_parser_unittest.cc | 40 for (size_t block = 0; block < bytes.size(); ++block) {
41 if (!parser->SetSource(*(bytes[block])))
61 for (size_t block = 0; block < bytes.size(); ++block) {
62 if (!parser->SetSource(*(bytes[block])))
121 #define BYTES_FROM_BLOCK(bytes, block) \
122 const base::StringPiece bytes(block, sizeof(block) - 1
[all...] |
| /external/chromium_org/third_party/openssl/openssl/include/openssl/ |
| modes.h | 28 unsigned char ivec[16], block128_f block);
31 unsigned char ivec[16], block128_f block);
36 unsigned int *num, block128_f block);
46 block128_f block);
51 int enc, block128_f block);
55 int enc, block128_f block);
59 int enc, block128_f block);
63 unsigned char ivec[16], block128_f block);
69 unsigned char ivec[16], block128_f block);
76 unsigned char ivec[16], block128_f block);
[all...] |
| /external/chromium_org/tools/gn/ |
| functions.h | 29 // This type of function invocation takes a block node that it will execute.
33 BlockNode* block,
36 // This type of function takes a block, but does not need to control execution
37 // of it. The dispatch function will pre-execute the block and pass the
44 // This type of function does not take a block. It just has arguments.
62 BlockNode* block,
84 BlockNode* block,
106 BlockNode* block,
114 BlockNode* block,
150 BlockNode* block,
[all...] |
| /external/openssl/include/openssl/ |
| modes.h | 28 unsigned char ivec[16], block128_f block);
31 unsigned char ivec[16], block128_f block);
36 unsigned int *num, block128_f block);
46 block128_f block);
51 int enc, block128_f block);
55 int enc, block128_f block);
59 int enc, block128_f block);
63 unsigned char ivec[16], block128_f block);
69 unsigned char ivec[16], block128_f block);
76 unsigned char ivec[16], block128_f block);
[all...] |
| /external/valgrind/main/helgrind/tests/ |
| annotate_hbefore.c | 95 UWord block[4] = { (UWord)addr, expected, nyu, 2 }; local
105 : /*in*/ "S"(&block[0])
108 assert(block[3] == 0 || block[3] == 1);
109 return block[3] & 1;
118 UWord block[4] = { (UWord)addr, expected, nyu, 2 }; local
130 : /*in*/ "S"(&block[0])
133 assert(block[3] == 0 || block[3] == 1);
134 return block[3] & 1
144 UWord block[2] = { (UWord)addr, nyu }; local
196 UWord block[3] = { (UWord)addr, nyu, expected}; local
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/ |
| h264bsd_image.c | 47 /* x- and y-coordinates for each block, defined in h264bsd_intra_prediction.c */
183 u32 block; local
209 for (block = 0; block < 16; block++)
211 x = h264bsdBlockX[block];
212 y = h264bsdBlockY[block];
214 pRes = residual[block];
230 /* Residual is zero => copy prediction block to output */
274 for (block = 16; block <= 23; block++
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/port/ |
| driver.py | 109 # stderr reading is scoped on a per-test (not per-block) basis, so we store the accumulated
155 text, audio = self._read_first_block(deadline) # First block is either text or audio
156 image, actual_image_hash = self._read_optional_image_block(deadline) # The second (optional) block is image data.
362 block = self._read_block(deadline)
363 if block.malloc:
364 self._measurements['Malloc'] = float(block.malloc)
365 if block.js_heap:
366 self._measurements['JSHeap'] = float(block.js_heap)
367 if block.content_type == 'audio/wav':
368 return (None, block.decoded_content
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/modes/ |
| ccm128.c | 64 unsigned int M,unsigned int L,void *key,block128_f block)
69 ctx->block = block;
107 block128_f block = ctx->block; local
112 (*block)(ctx->nonce.c,ctx->cmac.c,ctx->key),
146 (*block)(ctx->cmac.c,ctx->cmac.c,ctx->key),
177 block128_f block = ctx->block; local
182 (*block)(ctx->nonce.c,ctx->cmac.c,key)
252 block128_f block = ctx->block; local
331 block128_f block = ctx->block; local
388 block128_f block = ctx->block; local
[all...] |
| /external/openssl/crypto/modes/ |
| ccm128.c | 64 unsigned int M,unsigned int L,void *key,block128_f block)
69 ctx->block = block;
107 block128_f block = ctx->block; local
112 (*block)(ctx->nonce.c,ctx->cmac.c,ctx->key),
146 (*block)(ctx->cmac.c,ctx->cmac.c,ctx->key),
177 block128_f block = ctx->block; local
182 (*block)(ctx->nonce.c,ctx->cmac.c,key)
252 block128_f block = ctx->block; local
331 block128_f block = ctx->block; local
388 block128_f block = ctx->block; local
[all...] |
| /external/valgrind/main/coregrind/ |
| m_debuglog.c | 109 volatile Long block[2]; local
110 block[0] = (Long)buf;
111 block[1] = n;
115 "movq %0, %%r15\n" /* r15 = &block */
116 "pushq %%r15\n" /* save &block */
122 "popq %%r15\n" /* reestablish &block */
123 "movq %%rax, 0(%%r15)\n" /* block[0] = result */
127 : /*rd*/ "r" (block)
130 if (block[0] < 0)
131 block[0] = -1
152 volatile Int block[2]; local
195 volatile Long block[2]; local
238 volatile Int block[2]; local
396 volatile Int block[2]; local
[all...] |
| /external/chromium-trace/trace-viewer/src/tcmalloc/ |
| tcmalloc_snapshot_view.css | 42 display: inline-block;
50 display: inline-block;
58 display: inline-block;
|
| /external/clang/lib/ARCMigrate/ |
| TransBlockObjCVariable.cpp | 14 // This transformation checks whether a reference of the variable for the block
78 bool VisitBlockDecl(BlockDecl *block) {
82 I = block->capture_begin(), E = block->capture_end(); I != E; ++I) {
95 bool onlyValueOfVarIsNeeded = checker.TraverseStmt(block->getBody());
120 bool TraverseBlockDecl(BlockDecl *block) {
121 RootBlockObjCVarRewriter(VarsToChange).TraverseDecl(block);
|
