| /external/one-true-awk/ |
| 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...] |
| awk.h | 76 /* Cell: all information about a variable or constant */
78 typedef struct Cell {
86 struct Cell *cnext; /* ptr to next if chained */
87 } Cell;
92 Cell **tab; /* hash table pointers */
98 extern Cell *nrloc; /* NR */
99 extern Cell *fnrloc; /* FNR */
100 extern Cell *fsloc; /* FS */
101 extern Cell *nfloc; /* NF */
102 extern Cell *ofsloc; /* OFS *
[all...] |
| tran.c | 54 Cell *fsloc; /* FS */
55 Cell *nrloc; /* NR */
56 Cell *nfloc; /* NF */
57 Cell *fnrloc; /* FNR */
58 Cell *ofsloc; /* OFS */
59 Cell *orsloc; /* ORS */
60 Cell *rsloc; /* RS */
63 Cell *rstartloc; /* RSTART */
64 Cell *rlengthloc; /* RLENGTH */
65 Cell *subseploc; /* SUBSEP *
[all...] |
| run.c | 44 void tempfree(Cell *p) {
46 WARNING("bad csub %d in Cell %d %s",
74 Cell *tmps; /* free temporary cells for execution */
76 static Cell truecell ={ OBOOL, BTRUE, 0, 0, 1.0, NUM, NULL };
77 Cell *True = &truecell;
78 static Cell falsecell ={ OBOOL, BFALSE, 0, 0, 0.0, NUM, NULL };
79 Cell *False = &falsecell;
80 static Cell breakcell ={ OJUMP, JBREAK, 0, 0, 0.0, NUM, NULL };
81 Cell *jbreak = &breakcell;
82 static Cell contcell ={ OJUMP, JCONT, 0, 0, 0.0, NUM, NULL }
[all...] |
| 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+2) * sizeof(Cell *))) == NULL
63 || (fldtab[0] = (Cell *) malloc(sizeof(Cell))) == NULL )
77 fldtab[i] = (Cell *) malloc(sizeof (struct Cell));
232 Cell *x
[all...] |
| parse.c | 168 Node *celltonode(Cell *a, int b)
181 extern Cell *literal0;
187 Cell *cp;
190 cp = (Cell *) (p->narg[0]);
233 void defn(Cell *v, Node *vl, Node *st) /* turn on FCN bit in definition, */
263 if (strcmp(((Cell *)(p->narg[0]))->nval, s) == 0)
|
| /external/libtextclassifier/lang_id/common/ |
| registry.h | 161 const Cell *old_cell = FindCell(key);
166 Cell *new_cell = new Cell(key, value, head_);
174 const Cell *cell = FindCell(key); local
175 if (cell == nullptr) {
178 return (cell == nullptr) ? nullptr : cell->value();
190 for (const Cell *c = head_; c!= nullptr; c = c->next()) {
196 // Cell for the singly-linked list underlying this ComponentRegistry. Eac
[all...] |
| /external/guava/guava/src/com/google/common/cache/ |
| Striped64.java | 31 * Table entries are of class Cell; a variant of AtomicLong padded
62 * available, a new Cell is created. Otherwise, if the slot
78 * It is possible for a Cell to become unused when threads that
95 static final class Cell {
101 Cell(long x) { value = x; }
107 private static final AtomicLongFieldUpdater<Cell> valueUpdater =
108 AtomicLongFieldUpdater.newUpdater(Cell.class, "value");
130 transient volatile Cell[] cells;
168 * @param currentValue the current value (of either base or a cell)
196 Cell[] as; Cell a; int n; long v
[all...] |
| LongAdder.java | 70 Cell[] as; long b, v; int[] hc; Cell a; int n;
106 Cell[] as = cells;
110 Cell a = as[i];
141 Cell[] as = cells;
146 Cell a = as[i];
|
| /external/gemmlowp/internal/ |
| kernel_reference.h | 40 Format::Lhs::kCells, Format::Lhs::Cell::kWidth,
41 Format::Lhs::Cell::kDepth,
42 CellOrderName(Format::Lhs::Cell::kOrder), Format::Rhs::kCells,
43 Format::Rhs::Cell::kDepth, Format::Rhs::Cell::kWidth,
44 CellOrderName(Format::Rhs::Cell::kOrder));
64 Format::Lhs::Cell::kWidth * Format::kDepth;
68 Format::Rhs::Cell::kWidth * Format::kDepth;
70 // Now we are inside one cell of the Lhs and inside one cell
[all...] |
| kernel.h | 95 // 3 cells, each cell having dimensions (width=3, depth=4), laid out in
122 // a cell (see explanation above).
126 // out in a cell. That is, a CellOrder together with actual dimensions.
144 typedef tCellFormat Cell;
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
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| RegularImmutableTable.java | 37 abstract Cell<R, C, V> getCell(int iterationIndex);
40 final ImmutableSet<Cell<R, C, V>> createCellSet() {
41 return isEmpty() ? ImmutableSet.<Cell<R, C, V>>of() : new CellSet();
44 private final class CellSet extends ImmutableSet<Cell<R, C, V>> {
51 public UnmodifiableIterator<Cell<R, C, V>> iterator() {
56 ImmutableList<Cell<R, C, V>> createAsList() {
57 return new ImmutableAsList<Cell<R, C, V>>() {
59 public Cell<R, C, V> get(int index) {
64 ImmutableCollection<Cell<R, C, V>> delegateCollection() {
72 if (object instanceof Cell) {
73 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) object; local
[all...] |
| AbstractTable.java | 101 for (Table.Cell<? extends R, ? extends C, ? extends V> cell : table.cellSet()) {
102 put(cell.getRowKey(), cell.getColumnKey(), cell.getValue());
106 private transient Set<Cell<R, C, V>> cellSet;
109 public Set<Cell<R, C, V>> cellSet() {
110 Set<Cell<R, C, V>> result = cellSet;
114 Set<Cell<R, C, V>> createCellSet() {
118 abstract Iterator<Table.Cell<R, C, V>> cellIterator()
124 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) o; local
135 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) o; local
[all...] |
| ImmutableTable.java | 51 ImmutableList.<Cell<Object, Object, Object>>of(),
60 /** Returns an immutable table containing a single cell. */
93 Cell<? extends R, ? extends C, ? extends V> onlyCell
98 ImmutableSet.Builder<Cell<R, C, V>> cellSetBuilder
100 for (Cell<? extends R, ? extends C, ? extends V> cell :
103 * Must cast to be able to create a Cell<R, C, V> rather than a
104 * Cell<? extends R, ? extends C, ? extends V>
106 cellSetBuilder.add(cellOf((R) cell.getRowKey(),
107 (C) cell.getColumnKey(), (V) cell.getValue()))
[all...] |
| Tables.java | 27 import com.google.common.collect.Table.Cell;
56 * Returns an immutable cell with the specified row key, column key, and
59 * <p>The returned cell is serializable.
61 * @param rowKey the row key to be associated with the returned cell
62 * @param columnKey the column key to be associated with the returned cell
63 * @param value the value to be associated with the returned cell
65 public static <R, C, V> Cell<R, C, V> immutableCell(
99 abstract static class AbstractCell<R, C, V> implements Cell<R, C, V> {
107 if (obj instanceof Cell) {
108 Cell<?, ?, ?> other = (Cell<?, ?, ?>) obj
[all...] |
| SingletonImmutableTable.java | 26 * An implementation of {@link ImmutableTable} that holds a single cell.
42 SingletonImmutableTable(Cell<R, C, V> cell) {
43 this(cell.getRowKey(), cell.getColumnKey(), cell.getValue());
68 ImmutableSet<Cell<R, C, V>> createCellSet() {
|
| Table.java | 115 * equal when their cell views, as returned by {@link #cellSet}, are equal.
122 * as the hash code of its cell view, as returned by {@link #cellSet}.
196 * returned set will update the underlying table, and vice versa. The cell set
202 Set<Cell<R, C, V>> cellSet();
264 interface Cell<R, C, V> {
266 * Returns the row key of this cell.
271 * Returns the column key of this cell.
276 * Returns the value of this cell.
281 * Compares the specified object with this cell for equality. Two cells are
288 * Returns the hash code of this cell
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| TablesTest.java | 20 import com.google.common.collect.Table.Cell;
34 Cell<String, Integer, Character> entry
38 Cell<String, Integer, Character> nullEntry
44 Cell<String, Integer, Character> entry
57 Cell<String, Integer, Character> entry
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| TablesTest.java | 21 import com.google.common.collect.Table.Cell;
37 Cell<String, Integer, Character> entry
43 Cell<String, Integer, Character> entry
47 Cell<String, Integer, Character> nullEntry
53 Cell<String, Integer, Character> entry
66 Cell<String, Integer, Character> entry
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/HiiDatabaseDxe/ |
| Font.c | 43 Insert a character cell information to the list specified by GlyphInfoList.
50 @param Cell Incoming character cell information.
52 @retval EFI_SUCCESS Cell information is added to the GlyphInfoList.
61 IN EFI_HII_GLYPH_INFO *Cell
66 ASSERT (Cell != NULL && GlyphInfoList != NULL);
74 // GlyphInfoList stores a list of default character cell information, each is
79 if (Cell->AdvanceX == 0) {
80 Cell->AdvanceX = Cell->Width;
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_addrhashmap.h | 46 struct Cell {
54 Cell cells[1]; // variable len
62 Cell cells[kBucketSize];
83 Cell *cell_;
175 Cell *c = &b->cells[i];
188 Cell *c = &add->cells[i];
204 Cell *c = &b->cells[i];
220 Cell *c = &add->cells[i];
242 // See if we have a free embed cell.
244 Cell *c = &b->cells[i]
[all...] |
| /external/emma/core/java12/com/vladium/emma/report/html/doc/ |
| HTMLTable.java | 87 private static class Cell extends IElement.Factory.ElementImpl
97 Cell (Tag tag)
110 final ICell cell = new Cell (m_th ? Tag.TH : Tag.TD); local
111 add (cell);
113 return cell;
|
| /external/autotest/frontend/client/src/autotest/common/ui/ |
| RightClickTable.java | 43 public HTMLTable.Cell getCellForDomEvent(DomEvent<?> event) {
52 return new HTMLTable.Cell(position.row, position.column) {
|
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| StateDictionaryBuilder.java | 19 import org.unicode.cldr.util.StateDictionary.Cell;
126 Cell cell = row.byteToCell.get(key); local
127 Row newRow = replacements.get(cell.nextRow);
129 cell.nextRow = newRow;
168 Cell matchingCell = buildingCurrentAddRow.byteToCell.get(key);
178 Cell cell = new Cell(); local
179 buildingCurrentAddRow.byteToCell.put(key, cell);
[all...] |
| StateDictionary.java | 105 * a Cell, where each cell has the {nextRow, delta result, returns flag}.
135 final TreeMap<Byte, Cell> byteToCell = new TreeMap<Byte, Cell>();
158 for (Cell cell : byteToCell.values()) {
159 if (cell.nextRow != null) {
160 int temp = cell.nextRow.maximumDepth() + 1;
190 Cell cell = byteToCell.get(key) local
397 Cell cell = matchCurrentRow.byteToCell.get((byte) chunk); local
549 Cell cell = row.byteToCell.get(key); local
581 Cell cell = row.byteToCell.get(key); local
[all...] |
