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
|
# Copyright(c) 1986 Association of Universities for Research in Astronomy Inc.
include <mach.h>
include <ctype.h>
include "../qpex.h"
# QPEX_ATTRL -- Get the good-value range list for the named attribute, as a
# binary range list of the indicated type. This range list is a simplified
# version of the original filter expression, which may have contained
# multiple fields, some negated or overlapping, in any order, subsequently
# modified or deleted with qpex_modfilter, etc. The final resultant range
# list is ordered and consists of discreet nonoverlapping ranges.
#
# Upon input the variables XS and XE should either point to a pair of
# preallocated buffers of length XLEN, or they should be set to NULL.
# The routine will reallocate the buffers as necessary to allow for long
# range lists, updating XLEN so that it always contains the actual length
# of the arrays (which may not be completely full). Each list element
# consists of a pair of values (xs[i],xe[i]) defining the start and end
# points of the range. If xs[1] is INDEF the range is open to the left,
# if xe[nranges] is INDEF the range is open to the right. The number of
# ranges output is returned as the function value.
int procedure qpex_attrli (ex, attribute, xs, xe, xlen)
pointer ex #I QPEX descriptor
char attribute[ARB] #I attribute name
pointer xs #U pointer to array of start values
pointer xe #U pointer to array of end values
int xlen #U length of xs/xe arrays
pointer ps, pe, qs, qe
pointer sp, expr, ip, ep
int plen, qlen, np, nq, nx
int neterms, nchars, maxch
int qpex_getattribute(), qpex_parsei(), qp_rlmergei()
begin
call smark (sp)
# Get attribute filter expression. In the unlikely event that the
# expression is too large to fit in our buffer, repeat with a buffer
# twice as large until it fits.
maxch = DEF_SZEXPRBUF
nchars = 0
repeat {
maxch = maxch * 2
call salloc (expr, maxch, TY_CHAR)
nchars = qpex_getattribute (ex, attribute, Memc[expr], maxch)
if (nchars <= 0)
break
} until (nchars < maxch)
# Parse expression to produce a range list. If the expression
# contains multiple eterms each is parsed separately and merged
# into the final output range list.
nx = 0
neterms = 0
if (nchars > 0) {
# Get range list storage.
plen = DEF_XLEN
call malloc (ps, plen, TY_INT)
call malloc (pe, plen, TY_INT)
qlen = DEF_XLEN
call malloc (qs, qlen, TY_INT)
call malloc (qe, qlen, TY_INT)
# Parse each subexpression and merge into output range list.
for (ip=expr; Memc[ip] != EOS; ) {
# Get next subexpression.
while (IS_WHITE (Memc[ip]))
ip = ip + 1
for (ep=ip; Memc[ip] != EOS; ip=ip+1)
if (Memc[ip] == ';') {
Memc[ip] = EOS
ip = ip + 1
break
}
if (Memc[ep] == EOS)
break
# Copy output range list to X list temporary.
if (max(nx,1) > plen) {
plen = max(xlen,1)
call realloc (ps, plen, TY_INT)
call realloc (pe, plen, TY_INT)
}
if (neterms <= 0) {
Memi[ps] = LEFTI
Memi[pe] = RIGHTI
np = 1
} else {
call amovi (Memi[xs], Memi[ps], nx)
call amovi (Memi[xe], Memi[pe], nx)
np = nx
}
# Parse next eterm into Y list temporary.
nq = qpex_parsei (Memc[ep], qs, qe, qlen)
# Merge the X and Y lists, leaving result in output list.
nx = qp_rlmergei (xs,xe,xlen,
Memi[ps], Memi[pe], np, Memi[qs], Memi[qe], nq)
neterms = neterms + 1
}
# Free temporary range list storage.
call mfree (ps, TY_INT); call mfree (pe, TY_INT)
call mfree (qs, TY_INT); call mfree (qe, TY_INT)
# Convert LEFT/RIGHT magic values to INDEF.
if (nx > 0) {
if (IS_LEFTI (Memi[xs]))
Memi[xs] = INDEFI
if (IS_RIGHTI (Memi[xe+nx-1]))
Memi[xe+nx-1] = INDEFI
}
}
call sfree (sp)
return (nx)
end
|
