/external/one-true-awk/ |
D | proto.h | 26 extern void setfname(Cell *); 84 extern Node *celltonode(Cell *, int); 89 extern void defn(Cell *, Node *, Node *); 92 extern Cell *(*proctab[])(Node **, int); 100 extern void freesymtab(Cell *); 101 extern void freeelem(Cell *, const char *); 102 extern Cell *setsymtab(const char *, const char *, double, unsigned int, Array *); 105 extern Cell *lookup(const char *, Array *); 106 extern double setfval(Cell *, double); 107 extern void funnyvar(Cell *, const char *); [all …]
|
D | tran.c | 54 Cell *fsloc; /* FS */ 55 Cell *nrloc; /* NR */ 56 Cell *nfloc; /* NF */ 57 Cell *fnrloc; /* FNR */ 60 Cell *rstartloc; /* RSTART */ 61 Cell *rlengthloc; /* RLENGTH */ 62 Cell *symtabloc; /* SYMTAB */ 64 Cell *nullloc; /* a guaranteed empty cell */ 66 Cell *literal0; 68 extern Cell **fldtab; [all …]
|
D | run.c | 72 Cell *tmps; /* free temporary cells for execution */ 74 static Cell truecell ={ OBOOL, BTRUE, 0, 0, 1.0, NUM }; 75 Cell *True = &truecell; 76 static Cell falsecell ={ OBOOL, BFALSE, 0, 0, 0.0, NUM }; 77 Cell *False = &falsecell; 78 static Cell breakcell ={ OJUMP, JBREAK, 0, 0, 0.0, NUM }; 79 Cell *jbreak = &breakcell; 80 static Cell contcell ={ OJUMP, JCONT, 0, 0, 0.0, NUM }; 81 Cell *jcont = &contcell; 82 static Cell nextcell ={ OJUMP, JNEXT, 0, 0, 0.0, NUM }; [all …]
|
D | awk.h | 78 typedef struct Cell { struct 85 struct Cell *cnext; /* ptr to next if chained */ argument 86 } Cell; typedef 91 Cell **tab; /* hash table pointers */ 97 extern Cell *nrloc; /* NR */ 98 extern Cell *fnrloc; /* FNR */ 99 extern Cell *nfloc; /* NF */ 100 extern Cell *rstartloc; /* RSTART */ 101 extern Cell *rlengthloc; /* RLENGTH */
|
D | lib.c | 42 Cell **fldtab; /* pointers to Cells */ 55 static Cell dollar0 = { OCELL, CFLD, NULL, "", 0.0, REC|STR|DONTFREE }; 56 static Cell dollar1 = { OCELL, CFLD, NULL, "", 0.0, FLD|STR|DONTFREE }; 62 || (fldtab = (Cell **) malloc((nfields+1) * sizeof(Cell *))) == NULL in recinit() 63 || (fldtab[0] = (Cell *) malloc(sizeof(Cell))) == NULL ) in recinit() 77 fldtab[i] = (Cell *) malloc(sizeof (struct Cell)); in makefields() 231 Cell *x; in getargv() 247 Cell *q; in setclvar() 269 Cell *p; in fldbld() 369 Cell *p; in cleanfld() [all …]
|
D | parse.c | 168 Node *celltonode(Cell *a, int b) in celltonode() 181 extern Cell *literal0; in rectonode() 187 Cell *cp; in makearr() 190 cp = (Cell *) (p->narg[0]); in makearr() 233 void defn(Cell *v, Node *vl, Node *st) /* turn on FCN bit in definition, */ in defn() 263 if (strcmp(((Cell *)(p->narg[0]))->nval, s) == 0) in isarg()
|
/external/guava/guava/src/com/google/common/collect/ |
D | RegularImmutableTable.java | 37 abstract Cell<R, C, V> getCell(int iterationIndex); in getCell() 40 final ImmutableSet<Cell<R, C, V>> createCellSet() { in createCellSet() 41 return isEmpty() ? ImmutableSet.<Cell<R, C, V>>of() : new CellSet(); in createCellSet() 44 private final class CellSet extends ImmutableSet<Cell<R, C, V>> { 51 public UnmodifiableIterator<Cell<R, C, V>> iterator() { in iterator() 56 ImmutableList<Cell<R, C, V>> createAsList() { in createAsList() 57 return new ImmutableAsList<Cell<R, C, V>>() { in createAsList() 59 public Cell<R, C, V> get(int index) { in createAsList() 64 ImmutableCollection<Cell<R, C, V>> delegateCollection() { in createAsList() 72 if (object instanceof Cell) { in contains() [all …]
|
D | AbstractTable.java | 101 for (Table.Cell<? extends R, ? extends C, ? extends V> cell : table.cellSet()) { in putAll() 106 private transient Set<Cell<R, C, V>> cellSet; 109 public Set<Cell<R, C, V>> cellSet() { in cellSet() 110 Set<Cell<R, C, V>> result = cellSet; in cellSet() 114 Set<Cell<R, C, V>> createCellSet() { in createCellSet() 118 abstract Iterator<Table.Cell<R, C, V>> cellIterator(); in cellIterator() 120 class CellSet extends AbstractSet<Cell<R, C, V>> { 123 if (o instanceof Cell) { in contains() 124 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) o; in contains() 134 if (o instanceof Cell) { in remove() [all …]
|
D | ImmutableTable.java | 51 ImmutableList.<Cell<Object, Object, Object>>of(), 93 Cell<? extends R, ? extends C, ? extends V> onlyCell in copyOf() 98 ImmutableSet.Builder<Cell<R, C, V>> cellSetBuilder in copyOf() 100 for (Cell<? extends R, ? extends C, ? extends V> cell : in copyOf() 126 static <R, C, V> Cell<R, C, V> cellOf(R rowKey, C columnKey, V value) { in cellOf() 158 private final List<Cell<R, C, V>> cells = Lists.newArrayList(); 201 Cell<? extends R, ? extends C, ? extends V> cell) { in put() 207 Cell<R, C, V> immutableCell = (Cell<R, C, V>) cell; in put() 224 for (Cell<? extends R, ? extends C, ? extends V> cell : table.cellSet()) { in putAll() 252 @Override public ImmutableSet<Cell<R, C, V>> cellSet() { in cellSet() [all …]
|
D | Tables.java | 27 import com.google.common.collect.Table.Cell; 65 public static <R, C, V> Cell<R, C, V> immutableCell( in immutableCell() 99 abstract static class AbstractCell<R, C, V> implements Cell<R, C, V> { 107 if (obj instanceof Cell) { in equals() 108 Cell<?, ?, ?> other = (Cell<?, ?, ?>) obj; in equals() 239 private static final Function<Cell<?, ?, ?>, Cell<?, ?, ?>> TRANSPOSE_CELL = 240 new Function<Cell<?, ?, ?>, Cell<?, ?, ?>>() { 242 public Cell<?, ?, ?> apply(Cell<?, ?, ?> cell) { 250 Iterator<Cell<C, R, V>> cellIterator() { in cellIterator() 389 Function<Cell<R, C, V1>, Cell<R, C, V2>> cellFunction() { in cellFunction() [all …]
|
/external/guava/guava/src/com/google/common/cache/ |
D | Striped64.java | 95 static final class Cell { class in Striped64 101 Cell(long x) { value = x; } in Cell() method in Striped64.Cell 107 private static final AtomicLongFieldUpdater<Cell> valueUpdater = 108 AtomicLongFieldUpdater.newUpdater(Cell.class, "value"); 130 transient volatile Cell[] cells; 196 Cell[] as; Cell a; int n; long v; in retryUpdate() 200 Cell r = new Cell(x); // Optimistically create in retryUpdate() 204 Cell[] rs; int m, j; in retryUpdate() 232 Cell[] rs = new Cell[n << 1]; in retryUpdate() 251 Cell[] rs = new Cell[2]; in retryUpdate() [all …]
|
D | LongAdder.java | 70 Cell[] as; long b, v; int[] hc; Cell a; int n; in add() 106 Cell[] as = cells; in sum() 110 Cell a = as[i]; in sum() 141 Cell[] as = cells; in sumThenReset() 146 Cell a = as[i]; in sumThenReset()
|
/external/gemmlowp/internal/ |
D | kernel_reference.h | 40 Format::Lhs::kCells, Format::Lhs::Cell::kWidth, in Name() 41 Format::Lhs::Cell::kDepth, in Name() 42 CellOrderName(Format::Lhs::Cell::kOrder), Format::Rhs::kCells, in Name() 43 Format::Rhs::Cell::kDepth, Format::Rhs::Cell::kWidth, in Name() 44 CellOrderName(Format::Rhs::Cell::kOrder)); in Name() 64 Format::Lhs::Cell::kWidth * Format::kDepth; in Run() 68 Format::Rhs::Cell::kWidth * Format::kDepth; in Run() 74 for (int ri = 0; ri < Format::Lhs::Cell::kWidth; ri++) { in Run() 75 for (int ci = 0; ci < Format::Rhs::Cell::kWidth; ci++) { in Run() 78 OffsetIntoCell<typename Format::Lhs::Cell>(ri, di); in Run() [all …]
|
D | kernel.h | 144 typedef tCellFormat Cell; typedef 146 static const int kWidth = kCells * Cell::kWidth; 147 static const int kDepth = Cell::kDepth; 163 static_assert(Lhs::Cell::kDepth == Rhs::Cell::kDepth, ""); 164 static const int kDepth = Lhs::Cell::kDepth; 165 static const int kRows = Lhs::Cell::kWidth * Lhs::kCells; 166 static const int kCols = Rhs::Cell::kWidth * Rhs::kCells;
|
/external/libchrome/base/trace_event/ |
D | heap_profiler_allocation_register.h | 58 cells_(static_cast<Cell*>( in FixedHashMap() 59 AllocateGuardedVirtualMemory(num_cells_ * sizeof(Cell)))), in FixedHashMap() 66 FreeGuardedVirtualMemory(cells_, num_cells_ * sizeof(Cell)); in ~FixedHashMap() 72 Cell** p_cell = Lookup(key); in Insert() 73 Cell* cell = *p_cell; in Insert() 101 Cell* cell = &cells_[index]; in Remove() 116 Cell* cell = *Lookup(key); in Find() 146 return bits::Align(sizeof(Cell) * next_unused_cell_, page_size) + in EstimateUsedMemory() 155 struct Cell { struct 157 Cell* next; argument [all …]
|
/external/markdown/tests/extensions-x-tables/ |
D | tables.txt | 6 Content Cell | Content Cell 7 Content Cell | Content Cell 11 | Content Cell | Content Cell | 12 | Content Cell | Content Cell |
|
/external/markdown/docs/extensions/ |
D | Tables.txt | 22 Content Cell | Content Cell 23 Content Cell | Content Cell 36 <td>Content Cell</td> 37 <td>Content Cell</td> 41 <td>Content Cell</td> 42 <td>Content Cell</td>
|
/external/clang/test/Analysis/inlining/ |
D | retain-count-self-init.m | 27 @interface Cell : ParentOfCell{ interface 34 @implementation Cell implementation 59 Cell *sharedCell1 = [[Cell alloc] init]; 61 Cell *sharedCell2 = [[Cell alloc] initWithInt: 3]; 63 Cell *sharedCell3 = [[Cell alloc] initWithIntGood: 3];
|
D | assume-super-init-does-not-return-nil.m | 17 @interface Cell : NSObject { interface 24 @implementation Cell implementation 37 Cell *newCell = [[Cell alloc] init];
|
D | RetainCountExamples.m | 42 @interface Cell : ParentOfCell{ interface 50 @implementation Cell implementation 58 Cell *sharedCell3 = [[Cell alloc] initWithInt: 3]; 63 Cell *sharedCell4 = [[Cell alloc] initWithInt: 3]; // expected-warning {{leak}}
|
/external/guava/guava-tests/test/com/google/common/collect/ |
D | TablesTest.java | 21 import com.google.common.collect.Table.Cell; 37 Cell<String, Integer, Character> entry in testImmutableEntrySerialization() 43 Cell<String, Integer, Character> entry in testImmutableEntryToString() 47 Cell<String, Integer, Character> nullEntry in testImmutableEntryToString() 53 Cell<String, Integer, Character> entry in testEntryEquals() 66 Cell<String, Integer, Character> entry in testEntryEqualsNull()
|
D | TableCollectionTest.java | 25 import com.google.common.collect.Table.Cell; 363 @Override public SampleElements<Cell<String, Integer, Character>> in suite() 365 return new SampleElements<Cell<String, Integer, Character>>( in suite() 372 @Override public Set<Cell<String, Integer, Character>> create( in suite() 377 Cell<String, Integer, Character> cell in suite() 378 = (Cell<String, Integer, Character>) element; in suite() 385 Cell<String, Integer, Character> cell in suite() 386 = (Cell<String, Integer, Character>) element; in suite() 439 public Set<Cell<String, Integer, Character>> create( in suite() 444 Cell<String, Integer, Character> cell in suite() [all …]
|
/external/compiler-rt/lib/sanitizer_common/ |
D | sanitizer_addrhashmap.h | 46 struct Cell { struct 54 Cell cells[1]; // variable len argument 62 Cell cells[kBucketSize]; 83 Cell *cell_; 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() 277 Cell *c = &add->cells[i]; in acquire() [all …]
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
D | TablesTest.java | 20 import com.google.common.collect.Table.Cell; 34 Cell<String, Integer, Character> entry in testImmutableEntryToString() 38 Cell<String, Integer, Character> nullEntry in testImmutableEntryToString() 44 Cell<String, Integer, Character> entry in testEntryEquals() 57 Cell<String, Integer, Character> entry in testEntryEqualsNull()
|
/external/v8/tools/ |
D | consarray.js | 40 this.tail_ = new ConsArray.Cell(null, null); 56 this.tail_ = this.tail_.next = new ConsArray.Cell(null, null); 89 ConsArray.Cell = function(data, next) { class in ConsArray
|