cannam@167: /*
cannam@167:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@167:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@167:  *
cannam@167:  * This program is free software; you can redistribute it and/or modify
cannam@167:  * it under the terms of the GNU General Public License as published by
cannam@167:  * the Free Software Foundation; either version 2 of the License, or
cannam@167:  * (at your option) any later version.
cannam@167:  *
cannam@167:  * This program is distributed in the hope that it will be useful,
cannam@167:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@167:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@167:  * GNU General Public License for more details.
cannam@167:  *
cannam@167:  * You should have received a copy of the GNU General Public License
cannam@167:  * along with this program; if not, write to the Free Software
cannam@167:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@167:  *
cannam@167:  */
cannam@167: 
cannam@167: #include "api/api.h"
cannam@167: 
cannam@167: tensor *X(mktensor_rowmajor)(int rnk, const int *n,
cannam@167: 			     const int *niphys, const int *nophys,
cannam@167: 			     int is, int os)
cannam@167: {
cannam@167:      tensor *x = X(mktensor)(rnk);
cannam@167: 
cannam@167:      if (FINITE_RNK(rnk) && rnk > 0) {
cannam@167:           int i;
cannam@167: 
cannam@167:           A(n && niphys && nophys);
cannam@167:           x->dims[rnk - 1].is = is;
cannam@167:           x->dims[rnk - 1].os = os;
cannam@167:           x->dims[rnk - 1].n = n[rnk - 1];
cannam@167:           for (i = rnk - 1; i > 0; --i) {
cannam@167:                x->dims[i - 1].is = x->dims[i].is * niphys[i];
cannam@167:                x->dims[i - 1].os = x->dims[i].os * nophys[i];
cannam@167:                x->dims[i - 1].n = n[i - 1];
cannam@167:           }
cannam@167:      }
cannam@167:      return x;
cannam@167: }
cannam@167: 
cannam@167: static int rowmajor_kosherp(int rnk, const int *n)
cannam@167: {
cannam@167:      int i;
cannam@167: 
cannam@167:      if (!FINITE_RNK(rnk)) return 0;
cannam@167:      if (rnk < 0) return 0;
cannam@167: 
cannam@167:      for (i = 0; i < rnk; ++i)
cannam@167: 	  if (n[i] <= 0) return 0;
cannam@167: 
cannam@167:      return 1;
cannam@167: }
cannam@167: 
cannam@167: int X(many_kosherp)(int rnk, const int *n, int howmany)
cannam@167: {
cannam@167:      return (howmany >= 0) && rowmajor_kosherp(rnk, n);
cannam@167: }