| /external/llvm/test/CodeGen/ARM/ |
| D | 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* nocaptur…
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 2
53 %3 = load %struct.cells*, %struct.cells** %next, align 4, !tbaa !11
54 %f_free13 = getelementptr inbounds %struct.cells, %struct.cells* %3, i32 0, i32 0
66 %5 = load %struct.cells*, %struct.cells** %next, align 4, !tbaa !11
[all …]
|
| /external/v8/src/heap/ |
| D | marking.h | 89 INLINE(MarkBit::CellType* cells()) { in INLINE() argument
101 MarkBit::CellType* cell = this->cells() + (index >> kBitsPerCellLog2); in MarkBitFromIndex()
106 for (int i = 0; i < CellsCount(); i++) cells()[i] = 0; in Clear()
120 cells()[start_cell_index] |= ~(start_index_mask - 1); in SetRange()
123 cells()[i] = ~0u; in SetRange()
126 cells()[end_cell_index] |= (end_index_mask - 1); in SetRange()
128 cells()[start_cell_index] |= end_index_mask - start_index_mask; in SetRange()
143 cells()[start_cell_index] &= (start_index_mask - 1); in ClearRange()
146 cells()[i] = 0; in ClearRange()
149 cells()[end_cell_index] &= ~(end_index_mask - 1); in ClearRange()
[all …]
|
| /external/guava/guava/src/com/google/common/cache/ |
| D | Striped64.java | 130 transient volatile Cell[] cells; field in Striped64
197 if ((as = cells) != null && (n = as.length) > 0) { in retryUpdate()
205 if ((rs = cells) != null && in retryUpdate()
225 else if (n >= NCPU || cells != as) in retryUpdate()
231 if (cells == as) { // Expand table unless stale in retryUpdate()
234 cells = rs; in retryUpdate()
247 else if (busy == 0 && cells == as && casBusy()) { in retryUpdate()
250 if (cells == as) { in retryUpdate()
253 cells = rs; in retryUpdate()
271 Cell[] as = cells; in internalReset()
|
| /external/dtc/tests/ |
| D | sized_cells.dts | 4 cells-8b = /bits/ 8 <'\r' 'b' '\0' '\'' '\xff' 0xde>;
5 cells-16b = /bits/ 16 <'\r' 'b' '\0' '\'' '\xff' 0xdead>;
6 cells-32b = /bits/ 32 <'\r' 'b' '\0' '\'' '\xff' 0xdeadbeef>;
7 cells-64b = /bits/ 64 <'\r' 'b' '\0' '\'' '\xff' 0xdeadbeef00000000>;
9 cells-one-16b = /bits/ 16 <0x1234 0x5678 0x0 0xffff>;
10 cells-one-32b = <0x12345678 0x0000ffff>;
|
| D | bad-empty-ranges.dts | 4 #address-cells = <2>;
5 #size-cells = <2>;
7 #address-cells = <1>;
8 #size-cells = <1>;
|
| D | bad-reg-ranges.dts | 4 #address-cells = <2>;
5 #size-cells = <2>;
8 #address-cells = <1>;
9 #size-cells = <1>;
|
| D | addresses.dts | 5 #address-cells = <2>;
6 #size-cells = <2>;
12 #address-cells = <2>;
13 #size-cells = <1>;
|
| D | property_iterate.dts | 4 #address-cells = <1>;
5 #size-cells = <0>;
12 #address-cells = <1>;
13 #size-cells = <0>;
|
| D | test_tree1_wrong1.dts | 9 #address-cells = <1>;
10 #size-cells = <0>;
30 #address-cells = <1>;
31 #size-cells = <0>;
|
| D | test_tree1_wrong2.dts | 9 #address-cells = <1>;
10 #size-cells = <0>;
30 #address-cells = <1>;
31 #size-cells = <0>;
|
| D | test_tree1_wrong3.dts | 10 #address-cells = <1>;
11 #size-cells = <0>;
30 #address-cells = <1>;
31 #size-cells = <0>;
|
| D | include1.dts | 11 #address-cells = <1>;
12 #size-cells = <0>;
20 #address-cells = <1>;
21 #size-cells = <0>;
|
| D | test_tree1_wrong5.dts | 10 #address-cells = <1>;
11 #size-cells = <0>;
31 #address-cells = <1>;
32 #size-cells = <0>;
|
| D | test_tree1_wrong8.dts | 10 #address-cells = <1>;
11 #size-cells = <0>;
30 #address-cells = <1>;
31 #size-cells = <0>;
|
| D | base01.dts | 6 #address-cells = <2>;
7 #size-cells = <2>;
15 #address-cells = <1>;
16 #size-cells = <0>;
|
| D | test_tree1_wrong4.dts | 10 #address-cells = <1>;
11 #size-cells = <0>;
31 #address-cells = <1>;
32 #size-cells = <0>;
|
| D | test_tree1_wrong9.dts | 11 #address-cells = <1>;
12 #size-cells = <0>;
32 #address-cells = <1>;
33 #size-cells = <0>;
|
| /external/tensorflow/tensorflow/contrib/learn/python/learn/estimators/ |
| D | rnn_common.py | 97 cells = [_get_single_cell(cell_type, n) for n in num_units]
99 cells = apply_dropout(cells, dropout_keep_probabilities)
100 if len(cells) == 1:
101 return cells[0]
102 return contrib_rnn.MultiRNNCell(cells)
105 def apply_dropout(cells, dropout_keep_probabilities, random_seed=None): argument
120 if len(dropout_keep_probabilities) != len(cells) + 1:
124 len(cells), len(dropout_keep_probabilities)))
127 for cell, prob in zip(cells[:-1], dropout_keep_probabilities[:-2])
130 contrib_rnn.DropoutWrapper(cells[-1], dropout_keep_probabilities[-2],
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_addrhashmap.h | 54 Cell cells[1]; // variable len member
62 Cell cells[kBucketSize]; member
175 Cell *c = &b->cells[i]; in acquire()
188 Cell *c = &add->cells[i]; in acquire()
204 Cell *c = &b->cells[i]; in acquire()
220 Cell *c = &add->cells[i]; in acquire()
244 Cell *c = &b->cells[i]; in acquire()
258 add->cap = (kInitSize - sizeof(*add)) / sizeof(add->cells[0]) + 1; in acquire()
264 uptr oldsize = sizeof(*add) + (add->cap - 1) * sizeof(add->cells[0]); in acquire()
268 add1->cap = (newsize - sizeof(*add)) / sizeof(add->cells[0]) + 1; in acquire()
[all …]
|
| /external/autotest/frontend/client/src/autotest/common/spreadsheet/ |
| D | SpreadsheetSelectionManager.java | 20 public void onCellsSelected(List<CellInfo> cells); in onCellsSelected() argument
21 public void onCellsDeselected(List<CellInfo> cells); in onCellsDeselected() argument
59 List<CellInfo> cells = getSelectedCells(); in clearSelection() local
60 for (CellInfo cell : cells) { in clearSelection()
63 notifyDeselected(cells); in clearSelection()
80 private void notifyDeselected(List<CellInfo> cells) { in notifyDeselected() argument
82 listener.onCellsDeselected(cells); in notifyDeselected()
|
| /external/tensorflow/tensorflow/python/keras/_impl/keras/layers/ |
| D | recurrent_test.py | 58 cells = [MinimalRNNCell(8, 5),
61 layer = keras.layers.RNN(cells)
96 cells = [MinimalRNNCell(8, 5),
99 layer = keras.layers.RNN(cells)
160 cells = [MinimalRNNCell(8),
163 layer = keras.layers.RNN(cells)
267 cells = [keras.layers.recurrent.GRUCell(8),
270 layer = keras.layers.recurrent.RNN(cells)
385 cells = [keras.layers.LSTMCell(1),
387 layer = keras.layers.RNN(cells)
[all …]
|
| /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_cond_wait/ |
| D | stress2.c | 205 } cells[NSCENAR * SCALABILITY_FACTOR]; variable
550 cells[i + j * NSCENAR].cid = cid; in main()
554 pthread_cond_init(&(cells[i + j * NSCENAR].cnd), in main()
562 pthread_mutex_init(&(cells[i + j * NSCENAR].mtx), in main()
570 pthread_barrier_init(&(cells[i + j * NSCENAR].bar), in main()
617 ret = pthread_create(&mngrs[i], &ta, cellmanager, &(cells[i])); in main()
641 canceled += cells[i].canceled; in main()
642 cancelfailed += cells[i].cancelfailed; in main()
643 cnttotal += cells[i].cnttotal; in main()
645 ret = pthread_barrier_destroy(&(cells[i].bar)); in main()
[all …]
|
| D | stress.c | 205 } cells[NSCENAR * SCALABILITY_FACTOR]; variable
550 cells[i + j * NSCENAR].cid = cid; in main()
554 pthread_cond_init(&(cells[i + j * NSCENAR].cnd), in main()
562 pthread_mutex_init(&(cells[i + j * NSCENAR].mtx), in main()
570 pthread_barrier_init(&(cells[i + j * NSCENAR].bar), in main()
617 ret = pthread_create(&mngrs[i], &ta, cellmanager, &(cells[i])); in main()
641 canceled += cells[i].canceled; in main()
642 cancelfailed += cells[i].cancelfailed; in main()
643 cnttotal += cells[i].cnttotal; in main()
645 ret = pthread_barrier_destroy(&(cells[i].bar)); in main()
[all …]
|
| /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_cond_timedwait/ |
| D | stress2.c | 205 } cells[NSCENAR * SCALABILITY_FACTOR]; variable
550 cells[i + j * NSCENAR].cid = cid; in main()
554 pthread_cond_init(&(cells[i + j * NSCENAR].cnd), in main()
562 pthread_mutex_init(&(cells[i + j * NSCENAR].mtx), in main()
570 pthread_barrier_init(&(cells[i + j * NSCENAR].bar), in main()
617 ret = pthread_create(&mngrs[i], &ta, cellmanager, &(cells[i])); in main()
641 canceled += cells[i].canceled; in main()
642 cancelfailed += cells[i].cancelfailed; in main()
643 cnttotal += cells[i].cnttotal; in main()
645 ret = pthread_barrier_destroy(&(cells[i].bar)); in main()
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | RegularImmutableTable.java | 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);
|