/
arrayfuncs.c
1429 lines (1307 loc) · 39.8 KB
/
arrayfuncs.c
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
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*-------------------------------------------------------------------------
*
* arrayfuncs.c--
* Special functions for arrays.
*
* Copyright (c) 1994, Regents of the University of California
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/utils/adt/arrayfuncs.c,v 1.10 1996/11/08 05:59:38 momjian Exp $
*
*-------------------------------------------------------------------------
*/
#include <ctype.h>
#include <stdio.h>
#include <string.h>
#include "postgres.h"
#include "catalog/catalog.h"
#include "catalog/pg_type.h"
#include "utils/syscache.h"
#include "utils/memutils.h"
#include "storage/fd.h" /* for SEEK_ */
#include "fmgr.h"
#include "utils/array.h"
#include "libpq/libpq-fs.h"
#include "libpq/be-fsstubs.h"
#define ASSGN "="
/* An array has the following internal structure:
* <nbytes> - total number of bytes
* <ndim> - number of dimensions of the array
* <flags> - bit mask of flags
* <dim> - size of each array axis
* <dim_lower> - lower boundary of each dimension
* <actual data> - whatever is the stored data
*/
/*-=-=--=-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=--=-=-=-=-=-=-=-*/
static int _ArrayCount(char *str, int dim[], int typdelim);
static char *_ReadArrayStr(char *arrayStr, int nitems, int ndim, int dim[],
func_ptr inputproc, Oid typelem, char typdelim,
int typlen, bool typbyval, char typalign,
int *nbytes);
#ifdef LOARRAY
static char *_ReadLOArray(char *str, int *nbytes, int *fd, bool *chunkFlag,
int ndim, int dim[], int baseSize);
#endif
static void _CopyArrayEls(char **values, char *p, int nitems, int typlen,
char typalign, bool typbyval);
static void system_cache_lookup(Oid element_type, bool input, int *typlen,
bool *typbyval, char *typdelim, Oid *typelem, Oid *proc,
char *typalign);
static Datum _ArrayCast(char *value, bool byval, int len);
#ifdef LOARRAY
static char *_AdvanceBy1word(char *str, char **word);
#endif
static void _ArrayRange(int st[], int endp[], int bsize, char *destPtr,
ArrayType *array, int from);
static int _ArrayClipCount(int stI[], int endpI[], ArrayType *array);
static void _LOArrayRange(int st[], int endp[], int bsize, int srcfd,
int destfd, ArrayType *array, int isSrcLO, bool *isNull);
static void _ReadArray (int st[], int endp[], int bsize, int srcfd, int destfd,
ArrayType *array, int isDestLO, bool *isNull);
static ArrayCastAndSet(char *src, bool typbyval, int typlen, char *dest);
/*---------------------------------------------------------------------
* array_in :
* converts an array from the external format in "string" to
* it internal format.
* return value :
* the internal representation of the input array
*--------------------------------------------------------------------
*/
char *
array_in(char *string, /* input array in external form */
Oid element_type) /* type OID of an array element */
{
int typlen;
bool typbyval, done;
char typdelim;
Oid typinput;
Oid typelem;
char *string_save, *p, *q, *r;
func_ptr inputproc;
int i, nitems, dummy;
int32 nbytes;
char *dataPtr;
ArrayType *retval = NULL;
int ndim, dim[MAXDIM], lBound[MAXDIM];
char typalign;
system_cache_lookup(element_type, true, &typlen, &typbyval, &typdelim,
&typelem, &typinput, &typalign);
fmgr_info(typinput, &inputproc, &dummy);
string_save = (char *) palloc(strlen(string) + 3);
strcpy(string_save, string);
/* --- read array dimensions ---------- */
p = q = string_save; done = false;
for ( ndim = 0; !done; ) {
while (isspace(*p)) p++;
if (*p == '[' ) {
p++;
if ((r = (char *)strchr(p, ':')) == (char *)NULL)
lBound[ndim] = 1;
else {
*r = '\0';
lBound[ndim] = atoi(p);
p = r + 1;
}
for (q = p; isdigit(*q); q++);
if (*q != ']')
elog(WARN, "array_in: missing ']' in array declaration");
*q = '\0';
dim[ndim] = atoi(p);
if ((dim[ndim] < 0) || (lBound[ndim] < 0))
elog(WARN,"array_in: array dimensions need to be positive");
dim[ndim] = dim[ndim] - lBound[ndim] + 1;
if (dim[ndim] < 0)
elog(WARN, "array_in: upper_bound cannot be < lower_bound");
p = q + 1; ndim++;
} else {
done = true;
}
}
if (ndim == 0) {
if (*p == '{') {
ndim = _ArrayCount(p, dim, typdelim);
for (i = 0; i < ndim; lBound[i++] = 1);
} else {
elog(WARN,"array_in: Need to specify dimension");
}
} else {
while (isspace(*p)) p++;
if (strncmp(p, ASSGN, strlen(ASSGN)))
elog(WARN, "array_in: missing assignment operator");
p+= strlen(ASSGN);
while (isspace(*p)) p++;
}
nitems = getNitems( ndim, dim);
if (nitems == 0) {
char *emptyArray = palloc(sizeof(ArrayType));
memset(emptyArray, 0, sizeof(ArrayType));
* (int32 *) emptyArray = sizeof(ArrayType);
return emptyArray;
}
if (*p == '{') {
/* array not a large object */
dataPtr =
(char *) _ReadArrayStr(p, nitems, ndim, dim, inputproc, typelem,
typdelim, typlen, typbyval, typalign,
&nbytes );
nbytes += ARR_OVERHEAD(ndim);
retval = (ArrayType *) palloc(nbytes);
memset(retval,0, nbytes);
memmove(retval, (char *)&nbytes, sizeof(int));
memmove((char*)ARR_NDIM_PTR(retval), (char *)&ndim, sizeof(int));
SET_LO_FLAG (false, retval);
memmove((char *)ARR_DIMS(retval), (char *)dim, ndim*sizeof(int));
memmove((char *)ARR_LBOUND(retval), (char *)lBound,
ndim*sizeof(int));
/* dataPtr is an array of arbitraystuff even though its type is char*
cast to char** to pass to _CopyArrayEls for now - jolly */
_CopyArrayEls((char**)dataPtr,
ARR_DATA_PTR(retval), nitems,
typlen, typalign, typbyval);
} else {
#ifdef LOARRAY
int dummy, bytes;
bool chunked = false;
dataPtr = _ReadLOArray(p, &bytes, &dummy, &chunked, ndim,
dim, typlen );
nbytes = bytes + ARR_OVERHEAD(ndim);
retval = (ArrayType *) palloc(nbytes);
memset(retval, 0,nbytes);
memmove(retval, (char *)&nbytes, sizeof(int));
memmove((char *)ARR_NDIM_PTR(retval), (char *)&ndim, sizeof(int));
SET_LO_FLAG (true, retval);
SET_CHUNK_FLAG (chunked, retval);
memmove((char *)ARR_DIMS(retval), (char *)dim, ndim*sizeof(int));
memmove((char *)ARR_LBOUND(retval),(char *)lBound, ndim*sizeof(int));
memmove(ARR_DATA_PTR(retval), dataPtr, bytes);
#endif
elog(WARN, "large object arrays not supported");
}
pfree(string_save);
return((char *)retval);
}
/*-----------------------------------------------------------------------------
* _ArrayCount --
* Counts the number of dimensions and the dim[] array for an array string.
* The syntax for array input is C-like nested curly braces
*-----------------------------------------------------------------------------
*/
static int
_ArrayCount(char *str, int dim[], int typdelim)
{
int nest_level = 0, i;
int ndim = 0, temp[MAXDIM];
bool scanning_string = false;
bool eoArray = false;
char *q;
for (i = 0; i < MAXDIM; ++i) {
temp[i] = dim[i] = 0;
}
if (strncmp (str, "{}", 2) == 0) return(0);
q = str;
while (eoArray != true) {
bool done = false;
while (!done) {
switch (*q) {
case '\\':
/* skip escaped characters (\ and ") inside strings */
if (scanning_string && *(q+1)) {
q++;
}
break;
case '\0':
/* Signal a premature end of the string. DZ - 2-9-1996 */
elog(WARN, "malformed array constant: %s", str);
break;
case '\"':
scanning_string = ! scanning_string;
break;
case '{':
if (!scanning_string) {
temp[nest_level] = 0;
nest_level++;
}
break;
case '}':
if (!scanning_string) {
if (!ndim) ndim = nest_level;
nest_level--;
if (nest_level) temp[nest_level-1]++;
if (nest_level == 0) eoArray = done = true;
}
break;
default:
if (!ndim) ndim = nest_level;
if (*q == typdelim && !scanning_string )
done = true;
break;
}
if (!done) q++;
}
temp[ndim-1]++;
q++;
if (!eoArray)
while (isspace(*q)) q++;
}
for (i = 0; i < ndim; ++i) {
dim[i] = temp[i];
}
return(ndim);
}
/*---------------------------------------------------------------------------
* _ReadArrayStr :
* parses the array string pointed by "arrayStr" and converts it in the
* internal format. The external format expected is like C array
* declaration. Unspecified elements are initialized to zero for fixed length
* base types and to empty varlena structures for variable length base
* types.
* result :
* returns the internal representation of the array elements
* nbytes is set to the size of the array in its internal representation.
*---------------------------------------------------------------------------
*/
static char *
_ReadArrayStr(char *arrayStr,
int nitems,
int ndim,
int dim[],
func_ptr inputproc, /* function used for the conversion */
Oid typelem,
char typdelim,
int typlen,
bool typbyval,
char typalign,
int *nbytes)
{
int i, nest_level = 0;
char *p, *q, *r, **values;
bool scanning_string = false;
int indx[MAXDIM], prod[MAXDIM];
bool eoArray = false;
mda_get_prod(ndim, dim, prod);
for (i = 0; i < ndim; indx[i++] = 0);
/* read array enclosed within {} */
values = (char **) palloc(nitems * sizeof(char *));
memset(values, 0, nitems * sizeof(char *));
q = p = arrayStr;
while ( ! eoArray ) {
bool done = false;
int i = -1;
while (!done) {
switch (*q) {
case '\\':
/* Crunch the string on top of the backslash. */
for (r = q; *r != '\0'; r++) *r = *(r+1);
break;
case '\"':
if (!scanning_string ) {
while (p != q) p++;
p++; /* get p past first doublequote */
} else
*q = '\0';
scanning_string = ! scanning_string;
break;
case '{':
if (!scanning_string) {
p++;
nest_level++;
if (nest_level > ndim)
elog(WARN, "array_in: illformed array constant");
indx[nest_level - 1] = 0;
indx[ndim - 1] = 0;
}
break;
case '}':
if (!scanning_string) {
if (i == -1)
i = tuple2linear(ndim, indx, prod);
nest_level--;
if (nest_level == 0)
eoArray = done = true;
else {
*q = '\0';
indx[nest_level - 1]++;
}
}
break;
default:
if (*q == typdelim && !scanning_string ) {
if (i == -1)
i = tuple2linear(ndim, indx, prod);
done = true;
indx[ndim - 1]++;
}
break;
}
if (!done)
q++;
}
*q = '\0';
if (i >= nitems)
elog(WARN, "array_in: illformed array constant");
values[i] = (*inputproc) (p, typelem);
p = ++q;
if (!eoArray)
/*
* if not at the end of the array skip white space
*/
while (isspace(*q)) {
p++;
q++;
}
}
if (typlen > 0) {
*nbytes = nitems * typlen;
if (!typbyval)
for (i = 0; i < nitems; i++)
if (!values[i]) {
values[i] = palloc(typlen);
memset(values[i], 0, typlen);
}
} else {
for (i = 0, *nbytes = 0; i < nitems; i++) {
if (values[i]) {
if (typalign=='d') {
*nbytes += DOUBLEALIGN(* (int32 *) values[i]);
} else {
*nbytes += INTALIGN(* (int32 *) values[i]);
}
} else {
*nbytes += sizeof(int32);
values[i] = palloc(sizeof(int32));
*(int32 *)values[i] = sizeof(int32);
}
}
}
return((char *)values);
}
/*----------------------------------------------------------------------------
* Read data about an array to be stored as a large object
*----------------------------------------------------------------------------
*/
#ifdef LOARRAY
static char *
_ReadLOArray(char *str,
int *nbytes,
int *fd,
bool *chunkFlag,
int ndim,
int dim[],
int baseSize)
{
char *inputfile, *accessfile = NULL, *chunkfile = NULL;
char *retStr, *_AdvanceBy1word();
Oid lobjId;
str = _AdvanceBy1word(str, &inputfile);
while (str != NULL) {
char *word;
str = _AdvanceBy1word(str, &word);
if (!strcmp (word, "-chunk")) {
if (str == NULL)
elog(WARN, "array_in: access pattern file required");
str = _AdvanceBy1word(str, &accessfile);
}
else if (!strcmp (word, "-noreorg")) {
if (str == NULL)
elog(WARN, "array_in: chunk file required");
str = _AdvanceBy1word(str, &chunkfile);
} else {
elog(WARN, "usage: <input file> -chunk DEFAULT/<access pattern file> -invert/-native [-noreorg <chunk file>]");
}
}
if (inputfile == NULL)
elog(WARN, "array_in: missing file name");
lobjId = lo_creat(0);
*fd = lo_open(lobjId, INV_READ);
if ( *fd < 0 )
elog(WARN, "Large object create failed");
retStr = inputfile;
*nbytes = strlen(retStr) + 2;
if ( accessfile ) {
FILE *afd;
if ((afd = fopen (accessfile, "r")) == NULL)
elog(WARN, "unable to open access pattern file");
*chunkFlag = true;
retStr = _ChunkArray(*fd, afd, ndim, dim, baseSize, nbytes,
chunkfile);
}
return(retStr);
}
#endif
static void
_CopyArrayEls(char **values,
char *p,
int nitems,
int typlen,
char typalign,
bool typbyval)
{
int i;
for (i = 0; i < nitems; i++) {
int inc;
inc = ArrayCastAndSet(values[i], typbyval, typlen, p);
p += inc;
if (!typbyval)
pfree(values[i]);
}
pfree(values);
}
/*-------------------------------------------------------------------------
* array_out :
* takes the internal representation of an array and returns a string
* containing the array in its external format.
*-------------------------------------------------------------------------
*/
char *
array_out(ArrayType *v, Oid element_type)
{
int typlen;
bool typbyval;
char typdelim;
Oid typoutput, typelem;
func_ptr outputproc;
char typalign;
char *p, *retval, **values, delim[2];
int nitems, overall_length, i, j, k, indx[MAXDIM];
bool dummy_bool;
int dummy_int;
int ndim, *dim;
if (v == (ArrayType *) NULL)
return ((char *) NULL);
if (ARR_IS_LO(v) == true) {
char *p, *save_p;
int nbytes;
/* get a wide string to print to */
p = array_dims(v, &dummy_bool);
nbytes = strlen(ARR_DATA_PTR(v)) + 4 + *(int *)p;
save_p = (char *) palloc(nbytes);
strcpy(save_p, p + sizeof(int));
strcat(save_p, ASSGN);
strcat(save_p, ARR_DATA_PTR(v));
pfree(p);
return (save_p);
}
system_cache_lookup(element_type, false, &typlen, &typbyval,
&typdelim, &typelem, &typoutput, &typalign);
fmgr_info(typoutput, & outputproc, &dummy_int);
sprintf(delim, "%c", typdelim);
ndim = ARR_NDIM(v);
dim = ARR_DIMS(v);
nitems = getNitems(ndim, dim);
if (nitems == 0) {
char *emptyArray = palloc(3);
emptyArray[0] = '{';
emptyArray[1] = '}';
emptyArray[2] = '\0';
return emptyArray;
}
p = ARR_DATA_PTR(v);
overall_length = 1; /* [TRH] don't forget to count \0 at end. */
values = (char **) palloc(nitems * sizeof (char *));
for (i = 0; i < nitems; i++) {
if (typbyval) {
switch(typlen) {
case 1:
values[i] = (*outputproc) (*p, typelem);
break;
case 2:
values[i] = (*outputproc) (* (int16 *) p, typelem);
break;
case 3:
case 4:
values[i] = (*outputproc) (* (int32 *) p, typelem);
break;
}
p += typlen;
} else {
values[i] = (*outputproc) (p, typelem);
if (typlen > 0)
p += typlen;
else
p += INTALIGN(* (int32 *) p);
/*
* For the pair of double quotes
*/
overall_length += 2;
}
overall_length += (strlen(values[i]) + 1);
}
/*
* count total number of curly braces in output string
*/
for (i = j = 0, k = 1; i < ndim; k *= dim[i++], j += k);
p = (char *) palloc(overall_length + 2*j);
retval = p;
strcpy(p, "{");
for (i = 0; i < ndim; indx[i++] = 0);
j = 0; k = 0;
do {
for (i = j; i < ndim - 1; i++)
strcat(p, "{");
/*
* Surround anything that is not passed by value in double quotes.
* See above for more details.
*/
if (!typbyval) {
strcat(p, "\"");
strcat(p, values[k]);
strcat(p, "\"");
} else
strcat(p, values[k]);
pfree(values[k++]);
for (i = ndim - 1; i >= 0; i--) {
indx[i] = (indx[i] + 1)%dim[i];
if (indx[i]) {
strcat (p, delim);
break;
} else
strcat (p, "}");
}
j = i;
} while (j != -1);
pfree(values);
return(retval);
}
/*-----------------------------------------------------------------------------
* array_dims :
* returns the dimension of the array pointed to by "v"
*----------------------------------------------------------------------------
*/
char *
array_dims(ArrayType *v, bool *isNull)
{
char *p, *save_p;
int nbytes, i;
int *dimv, *lb;
if (v == (ArrayType *) NULL) RETURN_NULL;
nbytes = ARR_NDIM(v)*33;
/*
* 33 since we assume 15 digits per number + ':' +'[]'
*/
save_p = p = (char *) palloc(nbytes + 4);
memset(save_p, 0, nbytes + 4);
dimv = ARR_DIMS(v); lb = ARR_LBOUND(v);
p += 4;
for (i = 0; i < ARR_NDIM(v); i++) {
sprintf(p, "[%d:%d]", lb[i], dimv[i]+lb[i]-1);
p += strlen(p);
}
nbytes = strlen(save_p + 4) + 4;
memmove(save_p, &nbytes,4);
return (save_p);
}
/*---------------------------------------------------------------------------
* array_ref :
* This routing takes an array pointer and an index array and returns
* a pointer to the referred element if element is passed by
* reference otherwise returns the value of the referred element.
*---------------------------------------------------------------------------
*/
Datum
array_ref(ArrayType *array,
int n,
int indx[],
int reftype,
int elmlen,
int arraylen,
bool *isNull)
{
int i, ndim, *dim, *lb, offset, nbytes;
struct varlena *v = NULL;
char *retval = NULL;
if (array == (ArrayType *) NULL) RETURN_NULL;
if (arraylen > 0) {
/*
* fixed length arrays -- these are assumed to be 1-d
*/
if (indx[0]*elmlen > arraylen)
elog(WARN, "array_ref: array bound exceeded");
retval = (char *)array + indx[0]*elmlen;
return _ArrayCast(retval, reftype, elmlen);
}
dim = ARR_DIMS(array);
lb = ARR_LBOUND(array);
ndim = ARR_NDIM(array);
nbytes = (* (int32 *) array) - ARR_OVERHEAD(ndim);
if (!SanityCheckInput(ndim, n, dim, lb, indx))
RETURN_NULL;
offset = GetOffset(n, dim, lb, indx);
if (ARR_IS_LO(array)) {
char * lo_name;
int fd = 0;
/* We are assuming fixed element lengths here */
offset *= elmlen;
lo_name = (char *)ARR_DATA_PTR(array);
#ifdef LOARRAY
if ((fd = LOopen(lo_name, ARR_IS_INV(array)?INV_READ:O_RDONLY)) < 0)
RETURN_NULL;
#endif
if (ARR_IS_CHUNKED(array))
v = _ReadChunkArray1El(indx, elmlen, fd, array, isNull);
else {
if (lo_lseek(fd, offset, SEEK_SET) < 0)
RETURN_NULL;
#ifdef LOARRAY
v = (struct varlena *) LOread(fd, elmlen);
#endif
}
if (*isNull) RETURN_NULL;
if (VARSIZE(v) - 4 < elmlen)
RETURN_NULL;
(void) lo_close(fd);
retval = (char *)_ArrayCast((char *)VARDATA(v), reftype, elmlen);
if ( reftype == 0) { /* not by value */
char * tempdata = palloc (elmlen);
memmove(tempdata, retval, elmlen);
retval = tempdata;
}
pfree(v);
return (Datum) retval;
}
if (elmlen > 0) {
offset = offset * elmlen;
/* off the end of the array */
if (nbytes - offset < 1) RETURN_NULL;
retval = ARR_DATA_PTR (array) + offset;
return _ArrayCast(retval, reftype, elmlen);
} else {
bool done = false;
char *temp;
int bytes = nbytes;
temp = ARR_DATA_PTR (array);
i = 0;
while (bytes > 0 && !done) {
if (i == offset) {
retval = temp;
done = true;
}
bytes -= INTALIGN(* (int32 *) temp);
temp += INTALIGN(* (int32 *) temp);
i++;
}
if (! done)
RETURN_NULL;
return (Datum) retval;
}
}
/*-----------------------------------------------------------------------------
* array_clip :
* This routine takes an array and a range of indices (upperIndex and
* lowerIndx), creates a new array structure for the referred elements
* and returns a pointer to it.
*-----------------------------------------------------------------------------
*/
Datum
array_clip(ArrayType *array,
int n,
int upperIndx[],
int lowerIndx[],
int reftype,
int len,
bool *isNull)
{
int i, ndim, *dim, *lb, nbytes;
ArrayType *newArr;
int bytes, span[MAXDIM];
/* timer_start(); */
if (array == (ArrayType *) NULL)
RETURN_NULL;
dim = ARR_DIMS(array);
lb = ARR_LBOUND(array);
ndim = ARR_NDIM(array);
nbytes = (* (int32 *) array) - ARR_OVERHEAD(ndim);
if (!SanityCheckInput(ndim, n, dim, lb, upperIndx))
RETURN_NULL;
if (!SanityCheckInput(ndim, n, dim, lb, lowerIndx))
RETURN_NULL;
for (i = 0; i < n; i++)
if (lowerIndx[i] > upperIndx[i])
elog(WARN, "lowerIndex cannot be larger than upperIndx");
mda_get_range(n, span, lowerIndx, upperIndx);
if (ARR_IS_LO(array)) {
#ifdef LOARRAY
char * lo_name;
#endif
char *newname = NULL;
int fd = 0, newfd = 0, isDestLO = true, rsize;
if (len < 0)
elog(WARN, "array_clip: array of variable length objects not supported");
#ifdef LOARRAY
lo_name = (char *)ARR_DATA_PTR(array);
if ((fd = LOopen(lo_name, ARR_IS_INV(array)?INV_READ:O_RDONLY)) < 0)
RETURN_NULL;
newname = _array_newLO( &newfd, Unix );
#endif
bytes = strlen(newname) + 1 + ARR_OVERHEAD(n);
newArr = (ArrayType *) palloc(bytes);
memmove(newArr, array, sizeof(ArrayType));
memmove(newArr, &bytes, sizeof(int));
memmove(ARR_DIMS(newArr), span, n*sizeof(int));
memmove(ARR_LBOUND(newArr), lowerIndx, n*sizeof(int));
strcpy(ARR_DATA_PTR(newArr), newname);
rsize = compute_size (lowerIndx, upperIndx, n, len);
if (rsize < MAX_BUFF_SIZE) {
char *buff;
rsize += 4;
buff = palloc(rsize);
if ( buff )
isDestLO = false;
if (ARR_IS_CHUNKED(array)) {
_ReadChunkArray(lowerIndx, upperIndx, len, fd, &(buff[4]),
array,0,isNull);
} else {
_ReadArray(lowerIndx, upperIndx, len, fd, (int)&(buff[4]),
array,
0,isNull);
}
memmove(buff, &rsize, 4);
#ifdef LOARRAY
if (! *isNull)
bytes = LOwrite(newfd, (struct varlena *)buff);
#endif
pfree (buff);
}
if (isDestLO)
if (ARR_IS_CHUNKED(array)) {
_ReadChunkArray(lowerIndx, upperIndx, len, fd, (char*)newfd, array,
1,isNull);
} else {
_ReadArray(lowerIndx, upperIndx, len, fd, newfd, array, 1,isNull);
}
#ifdef LOARRAY
(void) LOclose(fd);
(void) LOclose(newfd);
#endif
if (*isNull) {
pfree(newArr);
newArr = NULL;
}
/* timer_end(); */
return ((Datum) newArr);
}
if (len > 0) {
bytes = getNitems(n, span);
bytes = bytes*len + ARR_OVERHEAD(n);
} else {
bytes = _ArrayClipCount(lowerIndx, upperIndx, array);
bytes += ARR_OVERHEAD(n);
}
newArr = (ArrayType *) palloc(bytes);
memmove(newArr, array, sizeof(ArrayType));
memmove(newArr, &bytes, sizeof(int));
memmove(ARR_DIMS(newArr), span, n*sizeof(int));
memmove(ARR_LBOUND(newArr), lowerIndx, n*sizeof(int));
_ArrayRange(lowerIndx, upperIndx, len, ARR_DATA_PTR(newArr), array, 1);
return (Datum) newArr;
}
/*-----------------------------------------------------------------------------
* array_set :
* This routine sets the value of an array location (specified by an index array)
* to a new value specified by "dataPtr".
* result :
* returns a pointer to the modified array.
*-----------------------------------------------------------------------------
*/
char *
array_set(ArrayType *array,
int n,
int indx[],
char *dataPtr,
int reftype,
int elmlen,
int arraylen,
bool *isNull)
{
int ndim, *dim, *lb, offset, nbytes;
char *pos;
if (array == (ArrayType *) NULL)
RETURN_NULL;
if (arraylen > 0) {
/*
* fixed length arrays -- these are assumed to be 1-d
*/
if (indx[0]*elmlen > arraylen)
elog(WARN, "array_ref: array bound exceeded");
pos = (char *)array + indx[0]*elmlen;
ArrayCastAndSet(dataPtr, (bool) reftype, elmlen, pos);
return((char *)array);
}
dim = ARR_DIMS(array);
lb = ARR_LBOUND(array);
ndim = ARR_NDIM(array);
nbytes = (* (int32 *) array) - ARR_OVERHEAD(ndim);
if (!SanityCheckInput(ndim, n, dim, lb, indx))
{
elog(WARN, "array_set: array bound exceeded");
return((char *)array);
}
offset = GetOffset( n, dim, lb, indx);
if (ARR_IS_LO(array)) {
int fd = 0;
struct varlena *v;
/* We are assuming fixed element lengths here */
offset *= elmlen;
#ifdef LOARRAY
char * lo_name;
lo_name = ARR_DATA_PTR(array);
if ((fd = LOopen(lo_name, ARR_IS_INV(array)?INV_WRITE:O_WRONLY)) < 0)
return((char *)array);
#endif
if (lo_lseek(fd, offset, SEEK_SET) < 0)
return((char *)array);
v = (struct varlena *) palloc(elmlen + 4);
VARSIZE (v) = elmlen + 4;
ArrayCastAndSet(dataPtr, (bool) reftype, elmlen, VARDATA(v));
#ifdef LOARRAY
n = LOwrite(fd, v);
#endif
/* if (n < VARSIZE(v) - 4)
RETURN_NULL;
*/
pfree(v);
(void) lo_close(fd);
return((char *)array);
}
if (elmlen > 0) {
offset = offset * elmlen;
/* off the end of the array */
if (nbytes - offset < 1) return((char *)array);
pos = ARR_DATA_PTR (array) + offset;
} else {
ArrayType *newarray;
char *elt_ptr;
int oldsize, newsize, oldlen, newlen, lth0, lth1, lth2;
elt_ptr = array_seek(ARR_DATA_PTR(array), -1, offset);
oldlen = INTALIGN(*(int32 *)elt_ptr);
newlen = INTALIGN(*(int32 *)dataPtr);
if (oldlen == newlen) {
/* new element with same size, overwrite old data */
ArrayCastAndSet(dataPtr, (bool)reftype, elmlen, elt_ptr);
return((char *)array);
}
/* new element with different size, reallocate the array */
oldsize = array->size;
lth0 = ARR_OVERHEAD(n);
lth1 = (int)(elt_ptr - ARR_DATA_PTR(array));
lth2 = (int)(oldsize - lth0 - lth1 - oldlen);
newsize = lth0 + lth1 + newlen + lth2;
newarray = (ArrayType *)palloc(newsize);
memmove((char *)newarray, (char *)array, lth0+lth1);
newarray->size = newsize;
newlen = ArrayCastAndSet(dataPtr, (bool)reftype, elmlen,
(char *)newarray+lth0+lth1);
memmove((char *)newarray+lth0+lth1+newlen,
(char *)array+lth0+lth1+oldlen, lth2);
/* ??? who should free this storage ??? */
return((char *)newarray);
}
ArrayCastAndSet(dataPtr, (bool) reftype, elmlen, pos);
return((char *)array);
}
/*----------------------------------------------------------------------------
* array_assgn :
* This routine sets the value of a range of array locations (specified
* by upper and lower index values ) to new values passed as
* another array
* result :
* returns a pointer to the modified array.
*----------------------------------------------------------------------------
*/
char *
array_assgn(ArrayType *array,
int n,
int upperIndx[],
int lowerIndx[],
ArrayType *newArr,
int reftype,
int len,