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
|
#!/usr/bin/python
# takes templated file .xxx.src and produces .xxx file where .xxx is .pyf .f90 or .f
# using the following template rules
# <...> is the template All blocks in a source file with names that
# contain '<..>' will be replicated according to the
# rules in '<..>'.
# The number of comma-separeted words in '<..>' will determine the number of
# replicates.
# '<..>' may have two different forms, named and short. For example,
#named:
# <p=d,s,z,c> where anywhere inside a block '<p>' will be replaced with
# 'd', 's', 'z', and 'c' for each replicate of the block.
# <_c> is already defined: <_c=s,d,c,z>
# <_t> is already defined: <_t=real,double precision,complex,double complex>
#short:
# <d,s,z,c>, a short form of the named, useful when no <p> appears inside
# a block.
# Note that all <..> forms in a block must have the same number of
# comma-separated entries.
__all__ = ['process_str']
import string,os,sys
if sys.version[:3]>='2.3':
import re
else:
import pre as re
False = 0
True = 1
comment_block_exp = re.compile(r'/\*.*?\*/',re.DOTALL)
# These don't work with Python2.3 : maximum recursion limit exceeded.
#subroutine_exp = re.compile(r'subroutine (?:\s|.)*?end subroutine.*')
#function_exp = re.compile(r'function (?:\s|.)*?end function.*')
reg = re.compile(r"\ssubroutine\s(.+)\(.*\)")
def parse_structure(astr):
spanlist = []
# subroutines
ind = 0
while 1:
start = astr.find("subroutine", ind)
if start == -1:
break
fini1 = astr.find("end subroutine",start)
fini2 = astr.find("\n",fini1)
spanlist.append((start, fini2))
ind = fini2
# functions
ind = 0
while 1:
start = astr.find("function", ind)
if start == -1:
break
pre = astr.rfind("\n", ind, start)
presave = start
# look for "$" in previous lines
while '$' in astr[pre:presave]:
presave = pre
pre = astr.rfind("\n", ind, pre-1)
fini1 = astr.find("end function",start)
fini2 = astr.find("\n",fini1)
spanlist.append((pre+1, fini2))
ind = fini2
spanlist.sort()
return spanlist
# return n copies of substr with template replacement
_special_names = {'_c':'s,d,c,z',
'_t':'real,double precision,complex,double complex'
}
template_re = re.compile(r"<([\w]*)>")
named_re = re.compile(r"<([\w]*)=([, \w]*)>")
list_re = re.compile(r"<([\w ]+(,\s*[\w]+)+)>")
def conv(astr):
b = astr.split(',')
return ','.join([x.strip().lower() for x in b])
def unique_key(adict):
# this obtains a unique key given a dictionary
# currently it works by appending together n of the letters of the
# current keys and increasing n until a unique key is found
# -- not particularly quick
allkeys = adict.keys()
done = False
n = 1
while not done:
newkey = "".join([x[:n] for x in allkeys])
if newkey in allkeys:
n += 1
else:
done = True
return newkey
def listrepl(match):
global _names
thelist = conv(match.group(1))
name = None
for key in _names.keys(): # see if list is already in dictionary
if _names[key] == thelist:
name = key
if name is None: # this list is not in the dictionary yet
name = "%s" % unique_key(_names)
_names[name] = thelist
return "<%s>" % name
def namerepl(match):
global _names, _thissub
name = match.group(1)
return _names[name][_thissub]
def expand_sub(substr,extra=''):
global _names, _thissub
# find all named replacements
reps = named_re.findall(substr)
_names = {}
_names.update(_special_names)
numsubs = None
for rep in reps:
name = rep[0].strip().lower()
thelist = conv(rep[1])
_names[name] = thelist
substr = named_re.sub(r"<\1>",substr) # get rid of definition templates
substr = list_re.sub(listrepl, substr) # convert all lists to named templates
# newnames are constructed as needed
# make lists out of string entries in name dictionary
for name in _names.keys():
entry = _names[name]
entrylist = entry.split(',')
_names[name] = entrylist
num = len(entrylist)
if numsubs is None:
numsubs = num
elif (numsubs != num):
raise ValueError, "Mismatch in number to replace"
# now replace all keys for each of the lists
mystr = ''
for k in range(numsubs):
_thissub = k
mystr += template_re.sub(namerepl, substr)
mystr += "\n\n" + extra
return mystr
_head = \
"""C This file was autogenerated from a template DO NOT EDIT!!!!
C Changes should be made to the original source (.src) file
C
"""
def get_line_header(str,beg):
extra = []
ind = beg-1
char = str[ind]
while (ind > 0) and (char != '\n'):
extra.insert(0,char)
ind = ind - 1
char = str[ind]
return ''.join(extra)
maxre = re.compile(r"max[(](.+),(.+)[)]")
minre = re.compile(r"min[(](.+),(.+)[)]")
def fix_capitals(astr):
# Need to convert max(x,x) to MAX(x,x)
# and min(x,x) to MIN(x,x)
astr = maxre.sub(r"MAX(\g<1>,\g<2>)",astr)
astr = minre.sub(r"MIN(\g<1>,\g<2>)",astr)
return astr
def process_str(allstr):
newstr = allstr.lower()
writestr = _head
struct = parse_structure(newstr)
# return a (sorted) list of tuples for each function or subroutine
# each tuple is the start and end of a subroutine or function to be expanded
oldend = 0
for sub in struct:
writestr += fix_capitals(newstr[oldend:sub[0]])
expanded = expand_sub(newstr[sub[0]:sub[1]],get_line_header(newstr,sub[0]))
writestr += fix_capitals(expanded)
oldend = sub[1]
writestr += fix_capitals(newstr[oldend:])
return writestr
if __name__ == "__main__":
try:
file = sys.argv[1]
except IndexError:
fid = sys.stdin
outfile = sys.stdout
else:
fid = open(file,'r')
(base, ext) = os.path.splitext(file)
newname = base
outfile = open(newname,'w')
allstr = fid.read()
writestr = process_str(allstr)
outfile.write(writestr)
|
