1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
/*
* Copyright (c) 2003 Matteo Frigo
* Copyright (c) 2003 Massachusetts Institute of Technology
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "api.h"
tensor *X(mktensor_iodims)(int rank, const X(iodim) *dims, int is, int os)
{
int i;
tensor *x = X(mktensor)(rank);
if (FINITE_RNK(rank)) {
for (i = 0; i < rank; ++i) {
x->dims[i].n = dims[i].n;
x->dims[i].is = dims[i].is * is;
x->dims[i].os = dims[i].os * os;
}
}
return x;
}
static int iodims_kosherp(int rank, const X(iodim) *dims, int allow_minfty)
{
int i;
if (rank < 0) return 0;
if (allow_minfty) {
if (!FINITE_RNK(rank)) return 1;
for (i = 0; i < rank; ++i)
if (dims[i].n < 0) return 0;
} else {
if (!FINITE_RNK(rank)) return 0;
for (i = 0; i < rank; ++i)
if (dims[i].n <= 0) return 0;
}
return 1;
}
int X(guru_kosherp)(int rank, const X(iodim) *dims,
int howmany_rank, const X(iodim) *howmany_dims)
{
return (iodims_kosherp(rank, dims, 0) &&
iodims_kosherp(howmany_rank, howmany_dims, 1));
}
|
