HomeSort by relevance Sort by last modified time
    Searched refs:incx (Results 1 - 25 of 56) sorted by null

1 2 3

  /external/eigen/blas/
level1_real_impl.h 14 RealScalar EIGEN_BLAS_FUNC(asum)(int *n, RealScalar *px, int *incx)
16 // std::cerr << "_asum " << *n << " " << *incx << "\n";
22 if(*incx==1) return make_vector(x,*n).cwiseAbs().sum();
23 else return make_vector(x,*n,std::abs(*incx)).cwiseAbs().sum();
27 Scalar EIGEN_BLAS_FUNC(dot)(int *n, RealScalar *px, int *incx, RealScalar *py, int *incy)
29 // std::cerr << "_dot " << *n << " " << *incx << " " << *incy << "\n";
36 if(*incx==1 && *incy==1) return (make_vector(x,*n).cwiseProduct(make_vector(y,*n))).sum();
37 else if(*incx>0 && *incy>0) return (make_vector(x,*n,*incx).cwiseProduct(make_vector(y,*n,*incy))).sum();
38 else if(*incx<0 && *incy>0) return (make_vector(x,*n,-*incx).reverse().cwiseProduct(make_vector(y,*n,*incy))).su (…)
    [all...]
double.cpp 22 double BLASFUNC(dsdot)(int* n, float* x, int* incx, float* y, int* incy)
26 if(*incx==1 && *incy==1) return (make_vector(x,*n).cast<double>().cwiseProduct(make_vector(y,*n).cast<double>())).sum();
27 else if(*incx>0 && *incy>0) return (make_vector(x,*n,*incx).cast<double>().cwiseProduct(make_vector(y,*n,*incy).cast<double>())).sum();
28 else if(*incx<0 && *incy>0) return (make_vector(x,*n,-*incx).reverse().cast<double>().cwiseProduct(make_vector(y,*n,*incy).cast<double>())).sum();
29 else if(*incx>0 && *incy<0) return (make_vector(x,*n,*incx).cast<double>().cwiseProduct(make_vector(y,*n,-*incy).reverse().cast<double>())).sum();
30 else if(*incx<0 && *incy<0) return (make_vector(x,*n,-*incx).reverse().cast<double>().cwiseProduct(make_vector(y,*n,-*incy).reverse().cast<double>())).sum()
    [all...]
level1_impl.h 12 int EIGEN_BLAS_FUNC(axpy)(const int *n, const RealScalar *palpha, const RealScalar *px, const int *incx, RealScalar *py, const int *incy)
20 if(*incx==1 && *incy==1) make_vector(y,*n) += alpha * make_vector(x,*n);
21 else if(*incx>0 && *incy>0) make_vector(y,*n,*incy) += alpha * make_vector(x,*n,*incx);
22 else if(*incx>0 && *incy<0) make_vector(y,*n,-*incy).reverse() += alpha * make_vector(x,*n,*incx);
23 else if(*incx<0 && *incy>0) make_vector(y,*n,*incy) += alpha * make_vector(x,*n,-*incx).reverse();
24 else if(*incx<0 && *incy<0) make_vector(y,*n,-*incy).reverse() += alpha * make_vector(x,*n,-*incx).reverse()
    [all...]
level1_cplx_impl.h 28 RealScalar EIGEN_CAT(EIGEN_CAT(REAL_SCALAR_SUFFIX,SCALAR_SUFFIX),asum_)(int *n, RealScalar *px, int *incx)
30 // std::cerr << "__asum " << *n << " " << *incx << "\n";
35 if(*incx==1) return make_vector(x,*n).unaryExpr<scalar_norm1_op>().sum();
36 else return make_vector(x,*n,std::abs(*incx)).unaryExpr<scalar_norm1_op>().sum();
40 int EIGEN_BLAS_FUNC(dotcw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *incy, RealScalar* pres)
42 // std::cerr << "_dotc " << *n << " " << *incx << " " << *incy << "\n";
54 if(*incx==1 && *incy==1) *res = (make_vector(x,*n).dot(make_vector(y,*n)));
55 else if(*incx>0 && *incy>0) *res = (make_vector(x,*n,*incx).dot(make_vector(y,*n,*incy)));
56 else if(*incx<0 && *incy>0) *res = (make_vector(x,*n,-*incx).reverse().dot(make_vector(y,*n,*incy)))
    [all...]
single.cpp 21 float BLASFUNC(sdsdot)(int* n, float* alpha, float* x, int* incx, float* y, int* incy)
22 { return double(*alpha) + BLASFUNC(dsdot)(n, x, incx, y, incy); }
level2_real_impl.h 14 const RealScalar *px, const int *incx, const RealScalar *pbeta, RealScalar *py, const int *incy)
35 else if(*incx==0) info = 7;
43 const Scalar* actual_x = get_compact_vector(x,*n,*incx);
65 int EIGEN_BLAS_FUNC(syr)(const char *uplo, const int *n, const RealScalar *palpha, const RealScalar *px, const int *incx, RealScalar *pc, const int *ldc)
83 else if(*incx==0) info = 5;
91 const Scalar* x_cpy = get_compact_vector(x,*n,*incx);
105 int EIGEN_BLAS_FUNC(syr2)(const char *uplo, const int *n, const RealScalar *palpha, const RealScalar *px, const int *incx, const RealScalar *py, const int *incy, RealScalar *pc, const int *ldc)
123 else if(*incx==0) info = 5;
132 const Scalar* x_cpy = get_compact_vector(x,*n,*incx);
160 // RealScalar *x, int *incx, RealScalar *beta, RealScalar *y, int *incy
    [all...]
level2_cplx_impl.h 20 const RealScalar *px, const int *incx, const RealScalar *pbeta, RealScalar *py, const int *incy)
41 else if(*incx==0) info = 7;
49 const Scalar* actual_x = get_compact_vector(x,*n,*incx);
81 // RealScalar *x, int *incx, RealScalar *beta, RealScalar *y, int *incy)
93 // int EIGEN_BLAS_FUNC(hpmv)(char *uplo, int *n, RealScalar *alpha, RealScalar *ap, RealScalar *x, int *incx, RealScalar *beta, RealScalar *y, int *incy)
105 int EIGEN_BLAS_FUNC(hpr)(char *uplo, int *n, RealScalar *palpha, RealScalar *px, int *incx, RealScalar *pap)
122 else if(*incx==0) info = 5;
129 Scalar* x_cpy = get_compact_vector(x, *n, *incx);
149 int EIGEN_BLAS_FUNC(hpr2)(char *uplo, int *n, RealScalar *palpha, RealScalar *px, int *incx, RealScalar *py, int *incy, RealScalar *pap)
167 else if(*incx==0) info = 5
    [all...]
  /external/eigen/blas/f2c/
complexdots.c 22 *incx, complex *cy, integer *incy)
33 cdotcw_(n, &cx[1], incx, &cy[1], incy, &res);
38 *incx, complex *cy, integer *incy)
49 cdotuw_(n, &cx[1], incx, &cy[1], incy, &res);
53 doublecomplex zdotc_(integer *n, doublecomplex *cx, integer *incx,
65 zdotcw_(n, &cx[1], incx, &cy[1], incy, &res);
69 doublecomplex zdotu_(integer *n, doublecomplex *cx, integer *incx,
81 zdotuw_(n, &cx[1], incx, &cy[1], incy, &res);
dtbmv.c 16 integer *k, doublereal *a, integer *lda, doublereal *x, integer *incx,
143 /* ( 1 + ( n - 1 )*abs( INCX ) ). */
148 /* INCX - INTEGER. */
149 /* On entry, INCX specifies the increment for the elements of */
150 /* X. INCX must not be zero. */
203 } else if (*incx == 0) {
220 /* will be ( N - 1 )*INCX too small for descending loops. */
222 if (*incx <= 0) {
223 kx = 1 - (*n - 1) * *incx;
224 } else if (*incx != 1)
    [all...]
drotm.c 15 /* Subroutine */ int drotm_(integer *n, doublereal *dx, integer *incx,
46 /* DX(LX+I*INCX), I = 0 TO N-1, WHERE LX = 1 IF INCX .GE. 0, ELSE */
47 /* LX = (-INCX)*N, AND SIMILARLY FOR SY USING LY AND INCY. */
66 /* INCX (input) INTEGER */
99 if (! (*incx == *incy && *incx > 0)) {
103 nsteps = *n * *incx;
115 i__2 = *incx;
128 i__1 = *incx;
    [all...]
srotm.c 15 /* Subroutine */ int srotm_(integer *n, real *sx, integer *incx, real *sy,
46 /* SX(LX+I*INCX), I = 0 TO N-1, WHERE LX = 1 IF INCX .GE. 0, ELSE */
47 /* LX = (-INCX)*N, AND SIMILARLY FOR SY USING USING LY AND INCY. */
67 /* INCX (input) INTEGER */
100 if (! (*incx == *incy && *incx > 0)) {
104 nsteps = *n * *incx;
116 i__2 = *incx;
129 i__1 = *incx;
    [all...]
stbmv.c 16 integer *k, real *a, integer *lda, real *x, integer *incx, ftnlen
143 /* ( 1 + ( n - 1 )*abs( INCX ) ). */
148 /* INCX - INTEGER. */
149 /* On entry, INCX specifies the increment for the elements of */
150 /* X. INCX must not be zero. */
203 } else if (*incx == 0) {
220 /* will be ( N - 1 )*INCX too small for descending loops. */
222 if (*incx <= 0) {
223 kx = 1 - (*n - 1) * *incx;
224 } else if (*incx != 1)
    [all...]
dsbmv.c 16 alpha, doublereal *a, integer *lda, doublereal *x, integer *incx,
120 /* ( 1 + ( n - 1 )*abs( INCX ) ). */
125 /* INCX - INTEGER. */
126 /* On entry, INCX specifies the increment for the elements of */
127 /* X. INCX must not be zero. */
186 } else if (*incx == 0) {
204 if (*incx > 0) {
207 kx = 1 - (*n - 1) * *incx;
262 if (*incx == 1 && *incy == 1) {
295 ix += *incx;
    [all...]
ssbmv.c 16 real *a, integer *lda, real *x, integer *incx, real *beta, real *y,
120 /* ( 1 + ( n - 1 )*abs( INCX ) ). */
125 /* INCX - INTEGER. */
126 /* On entry, INCX specifies the increment for the elements of */
127 /* X. INCX must not be zero. */
188 } else if (*incx == 0) {
206 if (*incx > 0) {
209 kx = 1 - (*n - 1) * *incx;
264 if (*incx == 1 && *incy == 1) {
297 ix += *incx;
    [all...]
dspmv.c 16 doublereal *ap, doublereal *x, integer *incx, doublereal *beta,
83 /* ( 1 + ( n - 1 )*abs( INCX ) ). */
88 /* INCX - INTEGER. */
89 /* On entry, INCX specifies the increment for the elements of */
90 /* X. INCX must not be zero. */
145 } else if (*incx == 0) {
163 if (*incx > 0) {
166 kx = 1 - (*n - 1) * *incx;
221 if (*incx == 1 && *incy == 1) {
251 ix += *incx;
    [all...]
sspmv.c 16 real *x, integer *incx, real *beta, real *y, integer *incy, ftnlen
83 /* ( 1 + ( n - 1 )*abs( INCX ) ). */
88 /* INCX - INTEGER. */
89 /* On entry, INCX specifies the increment for the elements of */
90 /* X. INCX must not be zero. */
145 } else if (*incx == 0) {
163 if (*incx > 0) {
166 kx = 1 - (*n - 1) * *incx;
221 if (*incx == 1 && *incy == 1) {
251 ix += *incx;
    [all...]
  /external/cblas/testing/
c_dblas2.c 12 double *a, int *lda, double *x, int *incx, double *beta,
27 *m, *n, *alpha, A, LDA, x, *incx, *beta, y, *incy );
32 *m, *n, *alpha, a, *lda, x, *incx, *beta, y, *incy );
35 *m, *n, *alpha, a, *lda, x, *incx, *beta, y, *incy );
38 void F77_dger(int *order, int *m, int *n, double *alpha, double *x, int *incx,
53 cblas_dger(CblasRowMajor, *m, *n, *alpha, x, *incx, y, *incy, A, LDA );
60 cblas_dger( CblasColMajor, *m, *n, *alpha, x, *incx, y, *incy, a, *lda );
64 int *n, double *a, int *lda, double *x, int *incx) {
81 cblas_dtrmv(CblasRowMajor, uplo, trans, diag, *n, A, LDA, x, *incx);
85 cblas_dtrmv(CblasColMajor, uplo, trans, diag, *n, a, *lda, x, *incx);
    [all...]
c_sblas2.c 12 float *a, int *lda, float *x, int *incx, float *beta,
27 *m, *n, *alpha, A, LDA, x, *incx, *beta, y, *incy );
32 *m, *n, *alpha, a, *lda, x, *incx, *beta, y, *incy );
35 *m, *n, *alpha, a, *lda, x, *incx, *beta, y, *incy );
38 void F77_sger(int *order, int *m, int *n, float *alpha, float *x, int *incx,
53 cblas_sger(CblasRowMajor, *m, *n, *alpha, x, *incx, y, *incy, A, LDA );
60 cblas_sger( CblasColMajor, *m, *n, *alpha, x, *incx, y, *incy, a, *lda );
64 int *n, float *a, int *lda, float *x, int *incx) {
81 cblas_strmv(CblasRowMajor, uplo, trans, diag, *n, A, LDA, x, *incx);
85 cblas_strmv(CblasColMajor, uplo, trans, diag, *n, a, *lda, x, *incx);
    [all...]
c_cblas2.c 13 CBLAS_TEST_COMPLEX *a, int *lda, const void *x, int *incx,
29 cblas_cgemv( CblasRowMajor, trans, *m, *n, alpha, A, LDA, x, *incx,
35 *m, *n, alpha, a, *lda, x, *incx, beta, y, *incy );
38 *m, *n, alpha, a, *lda, x, *incx, beta, y, *incy );
43 CBLAS_TEST_COMPLEX *x, int *incx,
77 *incx, beta, y, *incy );
82 *incx, beta, y, *incy );
85 *incx, beta, y, *incy );
89 CBLAS_TEST_COMPLEX *x, int *incx, CBLAS_TEST_COMPLEX *y, int *incy,
103 cblas_cgeru( CblasRowMajor, *m, *n, alpha, x, *incx, y, *incy, A, LDA )
    [all...]
c_zblas2.c 13 CBLAS_TEST_ZOMPLEX *a, int *lda, const void *x, int *incx,
29 cblas_zgemv( CblasRowMajor, trans, *m, *n, alpha, A, LDA, x, *incx,
35 *m, *n, alpha, a, *lda, x, *incx, beta, y, *incy );
38 *m, *n, alpha, a, *lda, x, *incx, beta, y, *incy );
43 CBLAS_TEST_ZOMPLEX *x, int *incx,
77 *incx, beta, y, *incy );
82 *incx, beta, y, *incy );
85 *incx, beta, y, *incy );
89 CBLAS_TEST_ZOMPLEX *x, int *incx, CBLAS_TEST_ZOMPLEX *y, int *incy,
103 cblas_zgeru( CblasRowMajor, *m, *n, alpha, x, *incx, y, *incy, A, LDA )
    [all...]
  /external/cblas/examples/
cblas_example1.c 14 int m, n, lda, incx, incy, i; local
22 incx = 1;
60 cblas_dgemv( order, transa, m, n, alpha, a, lda, x, incx, beta,
  /external/cblas/src/
cblas_cher.c 13 const int N, const float alpha, const void *X, const int incX
24 F77_INT F77_N=N, F77_lda=lda, F77_incX=incX;
28 #define F77_incX incx
30 int n, i, tincx, incx=incX; local
75 if( incX > 0 ) {
76 i = incX << 1 ;
80 i = incX *(-2);
98 incx = 1;
cblas_chpr.c 14 const int incX, void *A)
24 F77_INT F77_N=N, F77_incX=incX;
27 #define F77_incX incx
29 int n, i, tincx, incx=incX; local
74 if( incX > 0 ) {
75 i = incX << 1;
79 i = incX *(-2);
96 incx = 1;
cblas_zher.c 13 const int N, const double alpha, const void *X, const int incX
24 F77_INT F77_N=N, F77_lda=lda, F77_incX=incX;
28 #define F77_incX incx
30 int n, i, tincx, incx=incX; local
75 if( incX > 0 ) {
76 i = incX << 1 ;
80 i = incX *(-2);
98 incx = 1;
cblas_zhpr.c 14 const int incX, void *A)
24 F77_INT F77_N=N, F77_incX=incX;
27 #define F77_incX incx
29 int n, i, tincx, incx=incX; local
74 if( incX > 0 ) {
75 i = incX << 1;
79 i = incX *(-2);
96 incx = 1;

Completed in 743 milliseconds

1 2 3