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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
/*
* File: sidlArray.c
* Copyright: (c) 2004 The Regents of the University of California
* Revision: @(#) $Revision: 4434 $
* Date: $Date: 2005-03-17 09:05:29 -0800 (Thu, 17 Mar 2005) $
* Description: Generic array data type functions
*
* Copyright (c) 2004, The Regents of the University of Calfornia.
* Produced at the Lawrence Livermore National Laboratory.
* Written by the Components Team <components@llnl.gov>
* UCRL-CODE-2002-054
* All rights reserved.
*
* This file is part of Babel. For more information, see
* http://www.llnl.gov/CASC/components/. Please read the COPYRIGHT file
* for Our Notice and the LICENSE file for the GNU Lesser General Public
* License.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License (as published by
* the Free Software Foundation) version 2.1 dated February 1999.
*
* 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 terms and
* conditions of the GNU Lesser General Public License for more details.
*
* You should have recieved a copy of the GNU Lesser 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 "sidlArray.h"
#include <stddef.h>
#ifdef SIDL_DEBUG_REFCOUNT
#include <stdio.h>
const char *safeArrayType(struct sidl__array *array) {
const static char * const s_array_types[] = {
"illegal",
"bool",
"char",
"dcomplex",
"double",
"fcomplex",
"float",
"int",
"long",
"opaque",
"string",
"interface"
};
int32_t arrayType = array ? sidl__array_type(array) : 0;
if ((arrayType < 0) ||
(arrayType >= sizeof(s_array_types)/sizeof(char*))) {
arrayType = 0;
}
return s_array_types[arrayType];
}
#endif /* SIDL_DEBUG_REFCOUNT */
void
sidl__array_addRef(struct sidl__array* array)
{
if (array) ++(array->d_refcount);
#ifdef SIDL_DEBUG_REFCOUNT
fprintf(stderr, "babel: array addRef %p new count %d (type %s)\n",
array, array ? array->d_refcount : -1, safeArrayType(array));
#endif
}
void
sidl__array_deleteRef(struct sidl__array *array)
{
register const int selfDestruct = array && !(--(array->d_refcount));
#ifdef SIDL_DEBUG_REFCOUNT
fprintf(stderr, "babel: array deleteRef %p new count %d (type %s)\n",
array, array ? array->d_refcount : -1, safeArrayType(array));
#endif
if (selfDestruct) {
(*(array->d_vtable->d_destroy))(array);
}
}
struct sidl__array *
sidl__array_smartCopy(struct sidl__array *array)
{
return array ? (array->d_vtable->d_smartcopy)(array) : NULL;
}
int32_t
sidl__array_dimen(const struct sidl__array *array)
{
return array ? sidlArrayDim(array) : 0;
}
int32_t
sidl__array_lower(const struct sidl__array *array, int32_t ind)
{
return (array && (ind >= 0) && (ind < sidlArrayDim(array)))
? sidlLower(array, ind) : 0;
}
int32_t
sidl__array_upper(const struct sidl__array *array, int32_t ind)
{
return (array && (ind >= 0) && (ind < sidlArrayDim(array)))
? sidlUpper(array, ind) : -1;
}
int32_t
sidl__array_length(const struct sidl__array *array, int32_t ind)
{
return (array && (ind >= 0) && (ind < sidlArrayDim(array)))
? sidlLength(array, ind) : 0;
}
int32_t
sidl__array_stride(const struct sidl__array *array, int32_t ind)
{
return (array && (ind >= 0) && (ind < sidlArrayDim(array)))
? sidlStride(array, ind) : -1;
}
int32_t
sidl__array_type(const struct sidl__array*array)
{
return (array)
? (array->d_vtable->d_arraytype)() : 0;
}
/**
* Return a true value iff the array is a contiguous column-major ordered
* array. A NULL array argument causes 0 to be returned.
*/
sidl_bool
sidl__array_isColumnOrder(const struct sidl__array* array)
{
if (!array) return FALSE;
else {
register int32_t i;
register int32_t size;
register const int32_t dimen = sidlArrayDim(array);
for(i = 0, size = 1; i < dimen ; ++i) {
if (array->d_stride[i] != size) return FALSE;
size *= (1 + array->d_upper[i] - array->d_lower[i]);
}
return TRUE;
}
}
/**
* Return a true value iff the array is a contiguous row-major ordered
* array. A NULL array argument causes 0 to be returned.
*/
sidl_bool
sidl__array_isRowOrder(const struct sidl__array* array)
{
if (!array) return FALSE;
else {
register int32_t i = sidlArrayDim(array) - 1;
register int32_t size;
for(size = 1; i >= 0 ; --i) {
if (array->d_stride[i] != size) return FALSE;
size *= (1 + array->d_upper[i] - array->d_lower[i]);
}
return TRUE;
}
}
|
