| /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/ |
| Mode.c | 38 UINTN Row;
89 Status = gST->ConOut->QueryMode(gST->ConOut, LoopVar, &Col, &Row);
93 if (Col == NewCol && Row == NewRow) {
117 Status = gST->ConOut->QueryMode(gST->ConOut, LoopVar, &Col, &Row);
121 ShellPrintHiiEx(-1, -1, NULL, STRING_TOKEN (STR_MODE_LIST_ITEM), gShellDebug1HiiHandle, Col, Row, LoopVar == gST->ConOut->Mode->Mode?L'*':L' ');
|
| EditMenuBar.c | 77 @param[in] LastRow The last printable row.
90 UINTN Row;
99 Row = (LastRow - 2);
120 Row++;
126 ShellPrintEx ((INT32)(Col) - 1, (INT32)(Row) - 1, L"%E%s%N %H%s%N ", FunctionKeyString, NameString);
|
| /external/llvm/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /external/llvm/lib/DebugInfo/DWARF/ |
| DWARFUnitIndex.cpp | 134 auto &Row = Rows[i];
135 if (auto *Contribs = Row.Contributions.get()) {
136 OS << format("%5u 0x%016" PRIx64 " ", i + 1, Row.Signature);
|
| /external/skia/src/gpu/ |
| GrRectanizer_pow2.h | 17 // of two can have, at most, one active row/shelf. Once a row/shelf for
19 // to a new row.
45 struct Row {
48 // but it is used to signal if there exists an open row of this height
56 Row fRows[kMaxExponent]; // 0-th entry will be unused
72 void initRow(Row* row, int rowHeight) {
73 row->fLoc.set(0, fNextStripY);
74 row->fRowHeight = rowHeight
[all...] |
| /external/skqp/src/gpu/ |
| GrRectanizer_pow2.h | 17 // of two can have, at most, one active row/shelf. Once a row/shelf for
19 // to a new row.
45 struct Row {
48 // but it is used to signal if there exists an open row of this height
56 Row fRows[kMaxExponent]; // 0-th entry will be unused
72 void initRow(Row* row, int rowHeight) {
73 row->fLoc.set(0, fNextStripY);
74 row->fRowHeight = rowHeight
[all...] |
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /external/webrtc/webrtc/system_wrappers/include/ |
| aligned_array.h | 19 // Wrapper class for aligned arrays. Every row (and the first dimension) are
50 T* Row(size_t row) {
51 RTC_CHECK_LE(row, rows_);
52 return head_row_[row];
55 const T* Row(size_t row) const {
56 RTC_CHECK_LE(row, rows_);
57 return head_row_[row];
60 T& At(size_t row, size_t col)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| edit_distance.h | 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
[all...] |
| /device/linaro/bootloader/edk2/StdLib/Include/sys/ |
| EfiSysCall.h | 342 UINT32 Row;
|
| /frameworks/support/leanback/src/main/java/androidx/leanback/widget/ |
| Row.java | 22 public class Row {
33 * Constructor for a Row.
35 * @param id The id of the row.
36 * @param headerItem The {@link HeaderItem} for this Row, or null if there
39 public Row(long id, HeaderItem headerItem) {
45 * Constructor for a Row.
47 * @param headerItem The {@link HeaderItem} for this Row, or null if there
50 public Row(HeaderItem headerItem) {
55 * Constructor for a Row.
57 public Row() {
[all...] |
| /device/linaro/bootloader/edk2/IntelFrameworkPkg/Library/FrameworkUefiLib/ |
| Console.c | 324 UINTN Row;
387 // Compute the starting row and starting column for the popup
389 Row = (Rows - (NumberOfLines + 3)) / 2;
405 ConOut->SetCursorPosition (ConOut, Column, Row++);
429 ConOut->SetCursorPosition (ConOut, Column, Row++);
442 ConOut->SetCursorPosition (ConOut, Column, Row++);
|
