| /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_cond_timedwait/ |
| do-plot | 32 if ! cols=$(grep "#[ ]*COLUMNS" $FILE)
38 cols=$(echo $cols | sed 's/#//')
39 columns=$(echo $cols | awk '{print $2;}')
43 column[$count]=$(echo $cols | awk -vcount=$count '{print $(2 + count);}')
|
| /external/syslinux/com32/rosh/ |
| rosh.h | 140 static inline int getscreensize(int fd, int *rows, int *cols)
147 if (cols)
148 *cols = 0;
154 if (cols)
155 *cols = ws.ws_col;
161 if (cols && !*cols) {
164 *cols = atoi(str);
167 if (!rows || !cols)
169 else if (!*rows || !*cols)
[all...] |
| /external/eigen/unsupported/test/ |
| cxx11_tensor_generator.cpp | 60 int cols = 48; local
63 means[1] = cols / 2.0f;
69 Tensor<float, 2> matrix(rows, cols);
73 for (int j = 0; j < cols; ++j) {
75 float g_cols = powf(cols/2.0f - j, 2) / (2.7f * 2.7f) * 0.5f;
|
| /external/ltp/testcases/open_posix_testsuite/stress/threads/fork/ |
| do-plot | 32 if ! cols=$(grep "#[ ]*COLUMNS" $FILE)
38 cols=$(echo $cols | sed 's/#//')
39 columns=$(echo $cols | awk '{print $2;}')
43 column[$count]=$(echo $cols | awk -vcount=$count '{print $(2 + count);}')
|
| /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_create/ |
| do-plot | 32 if ! cols=$(grep "#[ ]*COLUMNS" $FILE)
38 cols=$(echo $cols | sed 's/#//')
39 columns=$(echo $cols | awk '{print $2;}')
43 column[$count]=$(echo $cols | awk -vcount=$count '{print $(2 + count);}')
|
| /external/ltp/testcases/open_posix_testsuite/stress/threads/sem_init/ |
| do-plot | 32 if ! cols=$(grep "#[ ]*COLUMNS" $FILE)
38 cols=$(echo $cols | sed 's/#//')
39 columns=$(echo $cols | awk '{print $2;}')
43 column[$count]=$(echo $cols | awk -vcount=$count '{print $(2 + count);}')
|
| /external/ltp/testcases/open_posix_testsuite/stress/threads/sem_open/ |
| do-plot | 32 if ! cols=$(grep "#[ ]*COLUMNS" $FILE)
38 cols=$(echo $cols | sed 's/#//')
39 columns=$(echo $cols | awk '{print $2;}')
43 column[$count]=$(echo $cols | awk -vcount=$count '{print $(2 + count);}')
|
| /external/gemmlowp/meta/generators/ |
| gemm_NxMxK_neon.py | 101 def GenerateZipRhs(emitter, aligned, cols, leftovers):
111 if cols is not 0:
113 ZipName(cols, leftovers, aligned),
118 def MulName(result_type, lhs_add, rhs_add, rows, cols):
119 return mul_Nx8_Mx8_neon.BuildName(result_type, lhs_add, rhs_add, rows, cols)
131 rows, cols, leftovers):
149 if cols is not 0:
151 MulName(result_type, lhs_add, rhs_add, rows, cols),
155 def GenerateQuantized8BitMul(emitter, aligned, rows, cols, leftovers):
159 cols, leftovers
[all...] |
| /art/tools/ahat/src/ |
| HtmlDoc.java | 102 public void table(DocString description, List<Column> subcols, List<Column> cols) {
103 mCurrentTableColumns = new Column[subcols.size() + cols.size()];
113 for (Column col : cols) {
120 for (int i = 0; i < cols.size() - 1; i++) {
121 if (cols.get(i).visible) {
122 ps.format("<th rowspan=\"2\">%s</th>", cols.get(i).heading.html());
125 if (!cols.isEmpty()) {
128 Column col = cols.get(cols.size() - 1);
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixVector_BLAS.h | 56 Index rows, Index cols, \
63 rows, cols, lhs, rhs, res, resIncr, alpha); \
66 rows, cols, lhs.data(), lhs.stride(), rhs.data(), rhs.stride(), res, resIncr, alpha); \
73 Index rows, Index cols, \
79 rows, cols, lhs.data(), lhs.stride(), rhs.data(), rhs.stride(), res, resIncr, alpha); \
95 Index rows, Index cols, \
100 BlasIndex m=convert_index<BlasIndex>(rows), n=convert_index<BlasIndex>(cols), \
106 m = convert_index<BlasIndex>(cols); \
111 Map<const GEMVVector, 0, InnerStride<> > map_x(rhs,cols,1,InnerStride<>(incx)); \
|
| GeneralMatrixMatrix.h | 30 Index rows, Index cols, Index depth,
43 ::run(cols,rows,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking,info);
59 static void run(Index rows, Index cols, Index depth,
76 Index nc = (std::min)(cols,blocking.nc()); // cache block size along the N direction
98 const Index actual_kc = (std::min)(k+kc,depth)-k; // => rows of B', and cols of the A'
135 for(Index j=nc; j<cols; j+=nc)
137 const Index actual_nc = (std::min)(j+nc,cols)-j;
165 const bool pack_rhs_once = mc!=rows && kc==depth && nc==cols;
183 for(Index j2=0; j2<cols; j2+=nc)
185 const Index actual_nc = (std::min)(j2+nc,cols)-j2
[all...] |
| /external/eigen/test/ |
| inplace_decomposition.cpp | 24 Index cols = MatrixType::ColsAtCompileTime==Dynamic ? (square?rows:internal::random<Index>(2,rows)) : Index(MatrixType::ColsAtCompileTime); local
26 MatrixType A = MatrixType::Random(rows,cols);
28 ResType x(cols);
33 A.topRows(cols) = A.topRows(cols).adjoint() * A.topRows(cols);
46 if(rows==cols)
57 if(rows==cols)
71 if(rows==cols)
|
| product_selfadjoint.cpp | 22 Index cols = m.cols(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
56 m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(cols-1));
58 m3.block(1,1,rows-1,cols-1) += v1.tail(rows-1) * v2.head(cols-1).adjoint()+ v2.head(cols-1) * v1.tail(rows-1).adjoint();
|
| sparse_basic.cpp | 23 const Index cols = ref.cols(); local
31 double density = (std::max)(8./(rows*cols), 0.01);
38 SparseMatrixType m(rows, cols);
39 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
64 VERIFY_RAISES_ASSERT( m.coeffRef(0,m.cols()) = 0 );
69 DenseMatrix m1(rows,cols);
71 SparseMatrixType m2(rows,cols);
82 for (Index j=0; j<cols; ++j)
103 DenseMatrix m1(rows,cols);
[all...] |
| eigen2support.cpp | 20 Index cols = m.cols(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m3(rows, cols);
30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
|
| integer_types.cpp | 28 Index cols = m.cols(); local
30 MatrixType m1(rows, cols),
31 m2 = MatrixType::Random(rows, cols),
32 mzero = MatrixType::Zero(rows, cols);
35 m1 = MatrixType::Random(rows, cols);
62 Index cols = m.cols(); local
66 MatrixType m1(rows, cols),
67 m2 = MatrixType::Random(rows, cols),
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
| AbstractLeastSquaresOptimizer.java | 63 protected int cols; field in class:AbstractLeastSquaresOptimizer
200 for (int j = 0; j < cols; ++j) {
232 index += cols;
277 double[][] jTj = new double[cols][cols];
278 for (int i = 0; i < cols; ++i) {
279 for (int j = i; j < cols; ++j) {
311 if (rows <= cols) {
314 rows, cols);
316 double[] errors = new double[cols];
[all...] |
| /external/dng_sdk/source/ |
| dng_pixel_buffer.cpp | 549 uint32 cols = area.W (); local
562 cols,
574 if (rows == 1 && cols == 1 && dPlaneStep == 1 && value == 0)
587 cols,
602 if (rows == 1 && cols == 1 && dPlaneStep == 1 && value == 0)
615 cols,
630 if (rows == 1 && cols == 1 && dPlaneStep == 1 && value == 0)
643 cols,
718 uint32 cols = area.W (); local
741 cols,
1295 uint32 cols = dstArea.W (); local
1433 uint32 cols = fArea.W (); local
1518 uint32 cols = area.W (); local
1746 uint32 cols = area.W (); local
[all...] |
| /external/eigen/bench/ |
| sparse_cholesky.cpp | 44 void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatrix& dst)
46 dst.startFill(rows*cols*density);
47 for(int j = 0; j < cols; j++)
80 int cols = SIZE; local
84 VectorXf b = VectorXf::Random(cols);
85 VectorXf x = VectorXf::Random(cols);
92 EigenSparseSelfAdjointMatrix sm1(rows, cols);
94 fillSpdMatrix(density, rows, cols, sm1);
103 DenseMatrix m1(rows,cols);
117 for (int j=0; j<cols; ++j
[all...] |
| sparse_lu.cpp | 75 int cols = SIZE; local
79 VectorX b = VectorX::Random(cols);
80 VectorX x = VectorX::Random(cols);
87 EigenSparseMatrix sm1(rows, cols);
88 fillMatrix(density, rows, cols, sm1);
96 DenseMatrix m1(rows,cols);
|
| BenchSparseUtil.h | 27 void fillMatrix(float density, int rows, int cols, EigenSparseMatrix& dst)
29 dst.reserve(double(rows)*cols*density);
30 for(int j = 0; j < cols; j++)
42 void fillMatrix2(int nnzPerCol, int rows, int cols, EigenSparseMatrix& dst)
44 // std::cout << "alloc " << nnzPerCol*cols << "\n";
45 dst.reserve(nnzPerCol*cols);
46 for(int j = 0; j < cols; j++)
65 for (int j=0; j<src.cols(); ++j)
76 GmmDynSparse tmp(src.rows(), src.cols());
77 for (int j=0; j<src.cols(); ++j
[all...] |
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR_LAPACKE.h | 52 Index cols = matrix.cols();\
58 m_colsTranspositions.resize(cols);\
63 m_colsPermutation.resize(cols); \
68 LAPACKE_##LAPACKE_PREFIX##geqp3( matrix_order, internal::convert_index<lapack_int,Index>(rows), internal::convert_index<lapack_int,Index>(cols), \
78 for(Index i=0;i<cols;i++) perm[i]--;\
|
| /external/libvpx/libvpx/vpx_dsp/arm/ |
| subtract_neon.c | 16 void vpx_subtract_block_neon(int rows, int cols, int16_t *diff,
22 if (cols > 16) {
24 for (c = 0; c < cols; c += 32) {
46 } else if (cols > 8) {
60 } else if (cols > 4) {
72 for (c = 0; c < cols; ++c) diff[c] = src[c] - pred[c];
|
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD.h | 78 if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols())
81 ::new (&m_qr) QRType(svd.rows(), svd.cols());
88 if(matrix.rows() > matrix.cols())
91 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>();
124 if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols())
127 ::new (&m_qr) QRType(svd.cols(), svd.rows());
129 m_adjoint.resize(svd.cols(), svd.rows())
[all...] |
| /external/libvpx/libvpx/vpx_dsp/ |
| deblock.c | 44 int dst_pixels_per_line, int cols,
53 assert(cols >= 8);
60 for (col = 0; col < cols; col++) {
85 p_src[cols] = p_src[cols + 1] = p_src[cols - 1];
87 for (col = 0; col < cols; col++) {
117 int cols, int flimit) {
132 for (i = 0; i < 17; i++) s[i + cols] = s[cols - 1]
[all...] |
