| /external/v8/test/unittests/heap/ |
| bitmap-unittest.cc | 48 TEST_F(BitmapTest, Cells) {
50 bm->cells()[1] = kBlackCell;
61 bitmap()->cells()[last_cell_index] = kBlackCell;
78 bm->cells()[0] = kBlackCell;
85 bm->cells()[0] = kBlackCell;
86 bm->cells()[1] = kBlackCell;
87 bm->cells()[2] = kBlackCell;
89 EXPECT_EQ(bm->cells()[0], kWhiteCell);
90 EXPECT_EQ(bm->cells()[1], 0xAAAA0000);
91 EXPECT_EQ(bm->cells()[2], kBlackCell)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| block_sparse_matrix.cc | 67 const vector<Cell>& cells = block_structure_->rows[i].cells; local
68 for (int j = 0; j < cells.size(); ++j) {
69 int col_block_id = cells[j].block_id;
95 const vector<Cell>& cells = block_structure_->rows[i].cells; local
96 for (int j = 0; j < cells.size(); ++j) {
97 int col_block_id = cells[j].block_id;
101 values_.get() + cells[j].position, row_block_size, col_block_size,
115 const vector<Cell>& cells = block_structure_->rows[i].cells local
133 const vector<Cell>& cells = block_structure_->rows[i].cells; local
150 const vector<Cell>& cells = block_structure_->rows[i].cells; local
172 const vector<Cell>& cells = block_structure_->rows[i].cells; local
195 const vector<Cell>& cells = block_structure_->rows[i].cells; local
225 const vector<Cell>& cells = block_structure_->rows[i].cells; local
[all...] |
| partitioned_matrix_view_impl.h | 64 const vector<Cell>& cells = bs->rows[r].cells; local
65 if (cells[0].block_id < num_col_blocks_e_) {
106 const Cell& cell = bs->rows[r].cells[0];
126 // multiply by all the cells except the first one which is of type
128 // num_row_blocks - num_row_blocks_e row blocks), then all the cells
134 const vector<Cell>& cells = bs->rows[r].cells; local
135 for (int c = 1; c < cells.size(); ++c) {
136 const int col_block_id = cells[c].block_id
149 const vector<Cell>& cells = bs->rows[r].cells; local
200 const vector<Cell>& cells = bs->rows[r].cells; local
215 const vector<Cell>& cells = bs->rows[r].cells; local
342 const vector<Cell>& cells = bs->rows[r].cells; local
361 const vector<Cell>& cells = bs->rows[r].cells; local
[all...] |
| schur_eliminator_impl.h | 112 const int chunk_block_id = bs->rows[r].cells.front().block_id;
128 if (row.cells.front().block_id != chunk_block_id) {
134 for (int c = 1; c < row.cells.size(); ++c) {
135 const Cell& cell = row.cells[c];
231 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
313 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
332 const Cell& e_cell = row.cells.front();
341 for (int c = 1; c < row.cells.size(); ++c) {
342 const int f_block_id = row.cells[c].block_id;
347 values + row.cells[c].position, row.block.size, f_block_size
[all...] |
| visibility_test.cc | 69 row.cells.push_back(Cell(0, 0));
70 row.cells.push_back(Cell(5, 0));
79 row.cells.push_back(Cell(0, 1));
80 row.cells.push_back(Cell(3, 1));
89 row.cells.push_back(Cell(1, 2));
90 row.cells.push_back(Cell(2, 2));
99 row.cells.push_back(Cell(1, 3));
100 row.cells.push_back(Cell(4, 3));
149 row.cells.push_back(Cell(0, 0));
158 row.cells.push_back(Cell(0, 1))
[all...] |
| block_random_access_dense_matrix.h | 46 // column block structure. All cells are stored in the same single
50 // This class is NOT thread safe. Since all n^2 cells are stored,
58 // blocks.size() * blocks.size() cells.
62 // modifying any cells when the matrix is being destroyed.
82 // The underlying matrix storing the cells.
|
| /external/autotest/frontend/client/src/autotest/common/spreadsheet/ |
| SpreadsheetSelectionManager.java | 20 public void onCellsSelected(List<CellInfo> cells);
21 public void onCellsDeselected(List<CellInfo> cells);
59 List<CellInfo> cells = getSelectedCells(); local
60 for (CellInfo cell : cells) {
63 notifyDeselected(cells);
80 private void notifyDeselected(List<CellInfo> cells) {
82 listener.onCellsDeselected(cells);
|
| /external/llvm/test/CodeGen/ARM/ |
| thumb2-size-reduction-internal-flags.ll | 6 %struct.cells = type { i32, i32, %struct.cells* }
16 define i32 @simulate(i32 %iterations, %struct.cells* nocapture %present, double %prob, i8* nocapture readonly %structure) {
35 %temp.1195 = phi %struct.cells* [ %5, %for.inc30 ], [ %present, %for.cond3.preheader ]
43 %temp.2188 = phi %struct.cells* [ %temp.1195, %for.cond6.preheader ], [ %5, %for.body8 ]
46 %f_free = getelementptr inbounds %struct.cells, %struct.cells* %temp.2188, i32 0, i32 0
49 %faulty = getelementptr inbounds %struct.cells, %struct.cells* %temp.2188, i32 0, i32 1
52 %next = getelementptr inbounds %struct.cells, %struct.cells* %temp.2188, i32 0, i32
[all...] |
| /external/clang/test/CodeGenOpenCL/ |
| addr-space-struct-arg.cl | 4 int cells[9];
8 int cells[16];
|
| /external/kernel-headers/original/uapi/linux/ |
| atm_idt77105.h | 20 __u32 tx_cells; /* cells transmitted */
21 __u32 rx_cells; /* cells received */
|
| atm_zatm.h | 38 #define ZATM_OAM_POOL 0 /* free buffer pool for OAM cells */
39 #define ZATM_AAL0_POOL 1 /* free buffer pool for AAL0 cells */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/ |
| atm_idt77105.h | 20 __u32 tx_cells; /* cells transmitted */
21 __u32 rx_cells; /* cells received */
|
| atm_zatm.h | 44 #define ZATM_OAM_POOL 0 /* free buffer pool for OAM cells */
45 #define ZATM_AAL0_POOL 1 /* free buffer pool for AAL0 cells */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/ |
| atm_idt77105.h | 20 __u32 tx_cells; /* cells transmitted */
21 __u32 rx_cells; /* cells received */
|
| atm_zatm.h | 44 #define ZATM_OAM_POOL 0 /* free buffer pool for OAM cells */
45 #define ZATM_AAL0_POOL 1 /* free buffer pool for AAL0 cells */
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_addrhashmap.h | 54 Cell cells[1]; // variable len member in struct:__sanitizer::AddrHashMap::AddBucket
62 Cell cells[kBucketSize]; member in struct:__sanitizer::AddrHashMap::Bucket
173 // Check the embed cells.
175 Cell *c = &b->cells[i];
183 // Check the add cells with read lock.
188 Cell *c = &add->cells[i];
201 // Embed cells.
204 Cell *c = &b->cells[i];
216 // Add cells.
220 Cell *c = &add->cells[i]
[all...] |
| /external/guava/guava/src/com/google/common/cache/ |
| Striped64.java | 40 * In part because Cells are relatively large, we avoid creating
50 * resizing the table, as well as populating slots with new Cells.
81 * expanded mask. We do not try to detect or remove such cells,
83 * contention levels will recur, so the cells will eventually be
128 * Table of cells. When non-null, size is a power of 2.
130 transient volatile Cell[] cells; field in class:Striped64
139 * Spinlock (locked via CAS) used when resizing and/or creating Cells.
176 * creating new Cells, and/or contention. See above for
197 if ((as = cells) != null && (n = as.length) > 0) {
205 if ((rs = cells) != null &
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| RegularImmutableTable.java | 29 * cells.
111 List<Cell<R, C, V>> cells,
114 checkNotNull(cells);
134 Collections.sort(cells, comparator);
136 return forCellsInternal(cells, rowComparator, columnComparator);
140 Iterable<Cell<R, C, V>> cells) {
141 return forCellsInternal(cells, null, null);
149 forCellsInternal(Iterable<Cell<R, C, V>> cells,
154 ImmutableList<Cell<R, C, V>> cellList = ImmutableList.copyOf(cells);
173 // use a dense table if more than half of the cells have value
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/atomic/ |
| Striped64.java | 37 * In part because Cells are relatively large, we avoid creating
47 * resizing the table, as well as populating slots with new Cells.
81 * expanded mask. We do not try to detect or remove such cells,
83 * contention levels will recur, so the cells will eventually be
124 * Table of cells. When non-null, size is a power of 2.
126 transient volatile Cell[] cells; field in class:Striped64
135 * Spinlock (locked via CAS) used when resizing and/or creating Cells.
182 * creating new Cells, and/or contention. See above for
203 if ((as = cells) != null && (n = as.length) > 0) {
210 if ((rs = cells) != null &
[all...] |
| /external/opencv3/modules/viz/src/vtk/ |
| vtkOBJWriter.cpp | 131 vtkCellArray *cells = input->GetVerts(); local
132 for (cells->InitTraversal(); cells->GetNextCell(npts, index); )
145 vtkCellArray *cells = input->GetLines(); local
146 for (cells->InitTraversal(); cells->GetNextCell(npts, index); )
166 vtkCellArray *cells = input->GetPolys(); local
167 for (cells->InitTraversal(); cells->GetNextCell(npts, index); )
195 vtkCellArray *cells = input->GetStrips() local
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/scenes/scene2d/ui/ |
| Table.java | 55 private final Array<Cell> cells = new Array(4);
field in class:Table
202 cells.peek().endRow = false;
205 Array<Cell> cells = this.cells;
local
206 int cellCount = cells.size;
209 Cell lastCell = cells.peek();
221 Cell other = cells.get(i);
234 cells.add(cell);
304 /** Removes all actors and cells from the table. */
306 Array<Cell> cells = this.cells; local
355 Array<Cell> cells = this.cells; local
386 Array<Cell> cells = this.cells; local
678 Array<Cell> cells = this.cells; local
732 Array<Cell> cells = this.cells; local
765 Array<Cell> cells = this.cells; local
932 Array<Cell> cells = this.cells; local
[all...] |
| /frameworks/rs/java/tests/RsTest/src/com/android/rs/test/ |
| check_dims.rs | 7 // This test checks to see that we only work on the cells specified for the
|
| /external/autotest/frontend/client/src/autotest/public/ |
| tkoclient.css | 26 /* don't wrap cells automatically */
36 /* allow empty cells to override the clickable cursor */
|
| /external/markdown/markdown/extensions/ |
| tables.py | 59 """ Given a row of text, build table cells. """
64 cells = self._split_row(row, border)
65 # We use align here rather than cells to ensure every row
70 c.text = cells[i].strip()
77 """ split a row of text into list of cells. """
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| btSparseSDF.h | 68 btAlignedObjectArray<Cell*> cells; member in struct:btSparseSdf
83 //avoid a crash due to running out of memory, so clamp the maximum number of cells allocated
86 cells.resize(hashsize,0);
92 for(int i=0,ni=cells.size();i<ni;++i)
94 Cell* pc=cells[i];
95 cells[i]=0;
113 for(int i=0;i<cells.size();++i)
115 Cell*& root=cells[i];
129 //printf("GC[%d]: %d cells, PpQ: %f\r\n",puid,ncells,nprobes/(btScalar)nqueries);
139 for(int i=0;i<cells.size();++i
[all...] |
