Home
last modified time | relevance | path

Searched refs:rows (Results 1 – 25 of 89) sorted by relevance

1234

/llvm-project-15.0.7/llvm/lib/Support/BLAKE3/
H A Dblake3_sse41.c102 g1(&rows[0], &rows[1], &rows[2], &rows[3], t0); in compress_pre()
104 g2(&rows[0], &rows[1], &rows[2], &rows[3], t1); in compress_pre()
108 g1(&rows[0], &rows[1], &rows[2], &rows[3], t2); in compress_pre()
111 g2(&rows[0], &rows[1], &rows[2], &rows[3], t3); in compress_pre()
122 g1(&rows[0], &rows[1], &rows[2], &rows[3], t0); in compress_pre()
126 g2(&rows[0], &rows[1], &rows[2], &rows[3], t1); in compress_pre()
131 g1(&rows[0], &rows[1], &rows[2], &rows[3], t2); in compress_pre()
135 g2(&rows[0], &rows[1], &rows[2], &rows[3], t3); in compress_pre()
145 g1(&rows[0], &rows[1], &rows[2], &rows[3], t0); in compress_pre()
149 g2(&rows[0], &rows[1], &rows[2], &rows[3], t1); in compress_pre()
[all …]
H A Dblake3_sse2.c108 g1(&rows[0], &rows[1], &rows[2], &rows[3], t0); in compress_pre()
110 g2(&rows[0], &rows[1], &rows[2], &rows[3], t1); in compress_pre()
114 g1(&rows[0], &rows[1], &rows[2], &rows[3], t2); in compress_pre()
117 g2(&rows[0], &rows[1], &rows[2], &rows[3], t3); in compress_pre()
128 g1(&rows[0], &rows[1], &rows[2], &rows[3], t0); in compress_pre()
132 g2(&rows[0], &rows[1], &rows[2], &rows[3], t1); in compress_pre()
137 g1(&rows[0], &rows[1], &rows[2], &rows[3], t2); in compress_pre()
141 g2(&rows[0], &rows[1], &rows[2], &rows[3], t3); in compress_pre()
151 g1(&rows[0], &rows[1], &rows[2], &rows[3], t0); in compress_pre()
155 g2(&rows[0], &rows[1], &rows[2], &rows[3], t1); in compress_pre()
[all …]
H A Dblake3_avx512.c135 g1(&rows[0], &rows[1], &rows[2], &rows[3], t0); in compress_pre()
137 g2(&rows[0], &rows[1], &rows[2], &rows[3], t1); in compress_pre()
141 g1(&rows[0], &rows[1], &rows[2], &rows[3], t2); in compress_pre()
144 g2(&rows[0], &rows[1], &rows[2], &rows[3], t3); in compress_pre()
155 g1(&rows[0], &rows[1], &rows[2], &rows[3], t0); in compress_pre()
159 g2(&rows[0], &rows[1], &rows[2], &rows[3], t1); in compress_pre()
164 g1(&rows[0], &rows[1], &rows[2], &rows[3], t2); in compress_pre()
168 g2(&rows[0], &rows[1], &rows[2], &rows[3], t3); in compress_pre()
178 g1(&rows[0], &rows[1], &rows[2], &rows[3], t0); in compress_pre()
182 g2(&rows[0], &rows[1], &rows[2], &rows[3], t1); in compress_pre()
[all …]
/llvm-project-15.0.7/polly/test/DeLICM/
H A Dconfused_order___%for.end103---%for.inc116.jscop.transformed9 …"context" : "[cols, rows] -> { : -2147483648 <= cols <= 2147483647 and -2147483648 <= rows <= 214…
16 … "relation" : "[cols, rows] -> { Stmt_for_end103[] -> MemRef_a_dot_b_domain_0_lcssa__phi[] }"
20 "relation" : "[cols, rows] -> { Stmt_for_end103[] -> MemRef_C[0] }"
24 … "relation" : "[cols, rows] -> { Stmt_for_end103[] -> MemRef_a_dot_b_domain_0_lcssa[] }"
27 "domain" : "[cols, rows] -> { Stmt_for_end103[] }",
29 "schedule" : "[cols, rows] -> { Stmt_for_end103[] -> [0] }"
35 "relation" : "[cols, rows] -> { Stmt_if_then110[] -> MemRef_C[0] }"
39 "relation" : "[cols, rows] -> { Stmt_if_then110[] -> MemRef_C[0] }"
42 "domain" : "[cols, rows] -> { Stmt_if_then110[] : cols > 0 and rows > 0 }",
44 "schedule" : "[cols, rows] -> { Stmt_if_then110[] -> [1] }"
H A Dconfused_order___%for.end103---%for.inc116.jscop9 …"context" : "[cols, rows] -> { : -2147483648 <= cols <= 2147483647 and -2147483648 <= rows <= 214…
16 … "relation" : "[cols, rows] -> { Stmt_for_end103[] -> MemRef_a_dot_b_domain_0_lcssa__phi[] }"
20 "relation" : "[cols, rows] -> { Stmt_for_end103[] -> MemRef_C[0] }"
24 … "relation" : "[cols, rows] -> { Stmt_for_end103[] -> MemRef_a_dot_b_domain_0_lcssa[] }"
27 "domain" : "[cols, rows] -> { Stmt_for_end103[] }",
29 "schedule" : "[cols, rows] -> { Stmt_for_end103[] -> [0] }"
35 "relation" : "[cols, rows] -> { Stmt_if_then110[] -> MemRef_C[0] }"
39 … "relation" : "[cols, rows] -> { Stmt_if_then110[] -> MemRef_a_dot_b_domain_0_lcssa[] }"
42 "domain" : "[cols, rows] -> { Stmt_if_then110[] : cols > 0 and rows > 0 }",
44 "schedule" : "[cols, rows] -> { Stmt_if_then110[] -> [1] }"
/llvm-project-15.0.7/libc/src/__support/FPUtil/
H A DXFloat.h92 UInt<row_precision> rows[WordCount]; in mul() local
97 rows[r][i] = man[i]; in mul()
99 rows[r][i] = 0; in mul()
101 rows[r].mul(other.man[r]); in mul()
102 rows[r].shift_left(r * 64); in mul()
106 rows[0].add(rows[r]); in mul()
112 rows[0].shift_right(carry_width); in mul()
113 rows[0][row_words - 2] = in mul()
118 if (rows[0][row_words - 2] & OneMask) { in mul()
121 rows[0].shift_left(1); in mul()
[all …]
/llvm-project-15.0.7/lldb/third_party/Python/module/pexpect-4.6/pexpect/
H A Dscreen.py88 self.rows = r
101 self.scroll_row_end = self.rows
158 rs = constrain (rs, 1, self.rows)
159 re = constrain (re, 1, self.rows)
203 r = constrain (r, 1, self.rows)
229 r = constrain (r, 1, self.rows)
244 r = constrain (r, 1, self.rows)
256 rs = constrain (rs, 1, self.rows)
257 re = constrain (re, 1, self.rows)
344 if self.scroll_row_end > self.rows:
[all …]
/llvm-project-15.0.7/clang/tools/scan-build-py/libscanbuild/resources/
H A Dsorttable.js47 the.appendChild(table.rows[0]);
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells;
146 rows = this.sorttable_tbody.rows;
147 for (var j=0; j<rows.length; j++) {
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
169 for (var i=0; i<table.tBodies[0].rows.length; i++) {
247 for (var i=0; i<tbody.rows.length; i++) {
[all …]
/llvm-project-15.0.7/clang/tools/scan-build-py/lib/libscanbuild/resources/
H A Dsorttable.js48 the.appendChild(table.rows[0]);
55 if (table.tHead.rows.length != 1)
63 for (var i = 0; i < table.rows.length; i++) {
65 sortbottomrows[sortbottomrows.length] = table.rows[i];
81 headrow = table.tHead.rows[0].cells;
161 rows = this.sorttable_tbody.rows;
162 for (var j = 0; j < rows.length; j++) {
164 [ sorttable.getInnerText(rows[j].cells[col]), rows[j] ];
185 for (var i = 0; i < table.tBodies[0].rows.length; i++) {
259 for (var i = 0; i < tbody.rows.length; i++) {
[all …]
/llvm-project-15.0.7/clang/tools/scan-build/share/scan-build/
H A Dsorttable.js47 the.appendChild(table.rows[0]);
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells;
146 rows = this.sorttable_tbody.rows;
147 for (var j=0; j<rows.length; j++) {
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
169 for (var i=0; i<table.tBodies[0].rows.length; i++) {
247 for (var i=0; i<tbody.rows.length; i++) {
[all …]
/llvm-project-15.0.7/clang/docs/
H A DMatrixTypes.rst25 element type, rows, and columns are the same type. A value of a matrix type
26 includes storage for ``rows * columns`` values of the *element type*. The
29 The maximum of the product of the number of rows and columns is
56 same element type, number of rows, and number of columns.
142 columns and row is the number of rows in the matrix type:
155 rows. The element types of ``M1`` and ``M2`` shall be the same type.
157 the number of rows of ``M1`` and the number of columns of ``M2``.
212 the same number of columns as ``M1`` has rows.
215 number of columns of ``M``, and ``row`` to the number of rows of ``M``.
256 omitted, the number of rows of ``M`` is used as ``columnStride``.
[all …]
/llvm-project-15.0.7/llvm/test/Analysis/Delinearization/
H A Dhimeno_2.ll38 %p.rows.ptr = getelementptr inbounds %struct.Mat, %struct.Mat* %p, i64 0, i32 2
39 %p.rows = load i32, i32* %p.rows.ptr
40 %p.rows.sub = add i32 %p.rows, -1
41 %p.rows.sext = sext i32 %p.rows.sub to i64
87 %i.exitcond = icmp eq i64 %i.inc, %p.rows.sext
H A Dhimeno_1.ll38 %p.rows.ptr = getelementptr inbounds %struct.Mat, %struct.Mat* %p, i64 0, i32 2
39 %p.rows = load i32, i32* %p.rows.ptr
40 %p.rows.sub = add i32 %p.rows, -1
41 %p.rows.sext = sext i32 %p.rows.sub to i64
87 %i.exitcond = icmp eq i64 %i.inc, %p.rows.sext
/llvm-project-15.0.7/llvm/test/CodeGen/X86/AMX/
H A Damx-low-intrinsics-no-amx-bitcast.ll8 ; CHECK: tileload.scalarize.rows.header:
12 ; CHECK: tileload.scalarize.rows.body:
33 ; CHECK: tileload.scalarize.rows.latch:
40 ; CHECK: tileload.scalarize.rows.header2:
44 ; CHECK: tileload.scalarize.rows.body3:
65 ; CHECK: tileload.scalarize.rows.latch4:
76 ; CHECK: tileload.scalarize.rows.body18:
97 ; CHECK: tileload.scalarize.rows.latch19:
109 ; CHECK: tiledpbssd.scalarize.rows.body:
161 ; CHECK: tilestore.scalarize.rows.body:
[all …]
H A Damx-low-intrinsics.ll10 ; CHECK: tileload.scalarize.rows.header:
14 ; CHECK: tileload.scalarize.rows.body:
35 ; CHECK: tileload.scalarize.rows.latch:
57 ; CHECK: tileload.scalarize.rows.header:
61 ; CHECK: tileload.scalarize.rows.body:
82 ; CHECK: tileload.scalarize.rows.latch:
112 ; CHECK: tiledpbssd.scalarize.rows.body:
154 ; CHECK: tiledpbssd.scalarize.rows.latch:
187 ; CHECK: tiledpbsud.scalarize.rows.body:
262 ; CHECK: tiledpbusd.scalarize.rows.body:
[all …]
/llvm-project-15.0.7/mlir/test/Integration/Dialect/Vector/CPU/
H A Dtest-flat-transpose-col.mlir60 %d = vector.flat_transpose %a { rows = 2: i32, columns = 2: i32 } : vector<4xf64> -> vector<4xf64>
61 %e = vector.flat_transpose %b { rows = 2: i32, columns = 2: i32 } : vector<4xf64> -> vector<4xf64>
62 %f = vector.flat_transpose %c { rows = 2: i32, columns = 3: i32 } : vector<6xf64> -> vector<6xf64>
63 %g = vector.flat_transpose %c { rows = 3: i32, columns = 2: i32 } : vector<6xf64> -> vector<6xf64>
H A Dtest-flat-transpose-row.mlir60 %d = vector.flat_transpose %a { rows = 2: i32, columns = 2: i32 } : vector<4xf64> -> vector<4xf64>
61 %e = vector.flat_transpose %b { rows = 2: i32, columns = 2: i32 } : vector<4xf64> -> vector<4xf64>
62 %f = vector.flat_transpose %c { rows = 2: i32, columns = 3: i32 } : vector<6xf64> -> vector<6xf64>
63 %g = vector.flat_transpose %c { rows = 3: i32, columns = 2: i32 } : vector<6xf64> -> vector<6xf64>
/llvm-project-15.0.7/libcxx/docs/Status/
H A DRanges.rst31 :header-rows: 1
36 :header-rows: 1
55 :header-rows: 1
H A DCxx14.rst38 :header-rows: 1
49 :header-rows: 1
H A DCxx2b.rst37 :header-rows: 1
47 :header-rows: 1
H A DFormat.rst32 :header-rows: 1
48 :header-rows: 1
H A DSpaceship.rst32 :header-rows: 1
52 :header-rows: 1
/llvm-project-15.0.7/flang/runtime/
H A Dmatmul.cpp74 SubscriptValue rows, SubscriptValue cols, const XT *RESTRICT x, in MatrixTimesMatrix() argument
77 std::memset(product, 0, rows * cols * sizeof *product); in MatrixTimesMatrix()
84 for (SubscriptValue i{0}; i < rows; ++i) { in MatrixTimesMatrix()
88 xp0 += rows; in MatrixTimesMatrix()
108 SubscriptValue rows, SubscriptValue n, const XT *RESTRICT x, in MatrixTimesVector() argument
111 std::memset(product, 0, rows * sizeof *product); in MatrixTimesVector()
115 for (SubscriptValue j{0}; j < rows; ++j) { in MatrixTimesVector()
/llvm-project-15.0.7/clang/www/analyzer/scripts/
H A Dexpandcollapse.js38 var rows = document.body.getElementsByTagName("tr");
39 for (var i=0; i<rows.length; i+=1) {
44 var divs = rows[i].getElementsByTagName("div");
/llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/
H A DMatrix.h44 Matrix(unsigned rows, unsigned columns, unsigned reservedRows = 0,
86 void reserveRows(unsigned rows);

1234