outfile_set_simd.write(make_set_simd(filearchs, machines));
outfile_set_simd.close();
outfile_config_fixed.write(make_config_fixed(filearchs));
outfile_config_fixed.close();
outfile_typedefs.write(make_typedefs(functions, retlist, my_argtypelist));
outfile_typedefs.close();
outfile_makefile_am.write(make_makefile_am(filearchs, machines, archflags_dict))
outfile_makefile_am.close()
outfile_machines_h.write(make_machines_h(functions, machines, archs))
outfile_machines_h.close()
outfile_machines_c.write(make_machines_c(machines))
outfile_machines_c.close()
outfile_c.write(make_c(machines, archs, functions, arched_arglist, my_arglist))
outfile_c.close()
outfile_h.write(make_h(functions, arched_arglist))
outfile_h.close()
for machine in machines:
machine_c_filename = os.path.join(gendir, "lib/volk_machine_" + machine + ".c")
outfile_machine_c = open(machine_c_filename, "w")
outfile_machine_c.write(make_each_machine_c(machine, machines[machine], functions, fcountlist, taglist))
outfile_machine_c.close()
outfile_config_in.close()
outfile_reg.write(make_registry(filearchs, functions, fcountlist))
outfile_reg.close()
outfile_h.write(make_h(functions, arched_arglist, retlist))
outfile_h.close()
outfile_init_h.write(make_init_h(functions, arched_arglist, retlist))
outfile_init_h.close()
outfile_config_fixed.write(make_config_fixed(filearchs))
outfile_config_fixed.close()
outfile_c.write(
make_c(functions, taglist, arched_arglist, retlist, my_arglist,
fcountlist))
outfile_c.close()
outfile_runtime_c.write(
make_runtime_c(functions, taglist, arched_arglist, retlist, my_arglist,
fcountlist))
outfile_runtime_c.close()
outfile_init_c.write(make_init_c(functions, filearchs))
outfile_init_c.close()
outfile_runtime.write(make_runtime(functions))
outfile_runtime.close()
outfile_typedefs.write(make_typedefs(functions, retlist, my_argtypelist))
outfile_typedefs.close()
def ewt():
#class operator defined
string2 = []
string1 = []
#class operator(object):
#def __init__(self, kind, dag, pos, name, st, pair, spin):
#self.kind = kind
#self.dag = dag
#self.pos = pos
#self.name = name
#self.string = st
#self.pair = pair
#self.spin = spin
#def __repr__(self):
#return self.name
#...........input for spin free wicks therem
print "\n Spin Free GWT\n"
#input menu and strings
print "\n----------------------------------------------------------------\n Hello, this is Spin Free GWT expression generator. \n Currently it is designed to only work with 2 normal ordered strings. So Ignore the menu \n-------------------------------------------------------\n"
menu = raw_input(
" MENU \n1 - Single string EWT generator\n2 - Two normal ordered strings EWT generator\n3 - Commutator type two string EWT generator\n"
)
if menu == '1' or menu == '2' or menu == '3':
pass
else:
print "Did you enter a number in (1, 2, 3) ? If no, kindly co-operate, I am a computer and do not understand much :(. Run Again !"
sys.exit()
commutator = 0
#only menu 2 is allowed right now
menu = '2'
if menu == '1':
string1_upper = list(
raw_input(
"Enter Operator :\nInput the upper indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited; )\nExample : uv\nOperator string: "
))
string1_lower = list(
raw_input(
"input the lower indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited; 1-daggered; 0-undaggered)\nExample : uv\nOperator string: "
))
elif menu == '2':
string1_upper = list(
raw_input(
"Enter Operator 1 : Input the upper indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited;)\nExample : uv\nOperator string: "
))
string1_lower = list(
raw_input(
"input the lower indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited; )\nExample : uv\nOperator string: "
))
string2_upper = list(
raw_input(
"Enter Operator 2 : Input the upper indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited;)\nExample : uv\nOperator string: "
))
string2_lower = list(
raw_input(
"input the lower indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited;)\nExample : uv\nOperator string: "
))
elif menu == '3':
commutator = 1
string1 = list(
raw_input(
"input the strings \n(i,j..-holes; u,v...-active; a,b...-excited; 1-daggered; 0-undaggered)\nExample : u1v0\nOperator 1: "
))
string2 = list(raw_input("Operator 2: "))
for index in range(0, len(string1_upper)):
string1.append(string1_upper[index])
string1.append('1')
for index in range(len(string1_lower) - 1, -1, -1):
string1.append(string1_lower[index])
string1.append('0')
#print string1
if menu == '2' or menu == '3':
for index in range(0, len(string2_upper)):
string2.append(string2_upper[index])
string2.append('1')
for index in range(len(string2_lower) - 1, -1, -1):
string2.append(string2_lower[index])
string2.append('0')
#print string2
#print "operators", string1_upper+string2_lower
op1 = func_ewt.make_operators_single(string1_upper, string1_lower, 1, 0)
op2 = func_ewt.make_operators_single(string2_upper, string2_lower, 2,
len(op1))
#!!!!!!!! I am fixing the commutator to 0 by force here. Remember to remove this line when incorporating the menu !!!!
commutator = 0
menu = '2'
a = deque([])
i = deque([])
u = deque([])
full = []
full1 = [] #first string
full2 = [] #second string
full_pos = [] #positions of full
p = 0
spin = 0
#make all the arrays with the op1 and op2 in the perturbation theory case :
full1 = op1
full2 = op2
# full.append(full1)
# full.append(full2)
for item in op1:
if item.kind == 'ac':
u.append(item)
if item.kind == 'ho':
i.append(item)
if item.kind == 'pa':
a.append(item)
for item in op2:
if item.kind == 'ac':
u.append(item)
if item.kind == 'ho':
i.append(item)
if item.kind == 'pa':
a.append(item)
'''
#this portion goes to the make_operator function called in the main mbpt2.py file :
#make 3 lists : a-particle operators, i-hole operators, u-active state operators
for index in range(0, len(string1), 2):
if (string1[index] == 'o' or string1[index] == 't'):
x = operator('ac', string1[index+1], p+1, string1[index], 1, -1, 1)
u.append(x)
full1.append(x)
full.append(x)
p=p+1
elif (string1[index] >= 'a') and (string1[index] < 'h') :
x = operator('pa', string1[index+1], p+1, string1[index], 1, -1, 1)
a.append(x)
full1.append(x)
full.append(x)
p=p+1
elif (string1[index] >= 'i') and (string1[index] < 'u') :
x = operator('ho', string1[index+1], p+1, string1[index],1, -1, 1)
i.append(x)
full1.append(x)
full.append(x)
p=p+1
elif (string1[index] >='u' and string1[index]<='z'):
x = operator('ac', string1[index+1], p+1, string1[index], 1, -1, 1)
u.append(x)
full1.append(x)
full.append(x)
p=p+1
if string2:
for index in range(0, len(string2), 2):
if (string2[index] == 'o' or string2[index] == 't'):
x = operator('ac', string2[index+1], p+1, string2[index], 2, -1, 1)
u.append(x)
full2.append(x)
p=p+1
elif (string2[index] >= 'a') and (string2[index] < 'h') :
x = operator('pa', string2[index+1], p+1, string2[index], 2, -1, 1)
a.append(x)
full2.append(x)
p=p+1
elif (string2[index] >= 'i') and (string2[index] < 'u') :
x = operator('ho', string2[index+1], p+1, string2[index], 2, -1, 1)
i.append(x)
full2.append(x)
p=p+1
elif (string2[index] >='u' and string2[index]<='z'):
x = operator('ac', string2[index+1], p+1, string2[index], 2, -1, 1)
u.append(x)
full2.append(x)
p=p+1
'''
#make list for all possible contractions for any operator
#The commutator here is 1 when menu=3, so 2 set of terms wille be needed (commutator +1)
for i_c in range(commutator + 1):
full = []
full_pos = []
store_for_repeat = []
poss = deque([])
y = deque([])
if not i_c:
full.extend(full1)
full.extend(full2)
else:
for item in full1:
item.string = 2
for item in full2:
item.string = 1
full.extend(full2)
full.extend(full1)
for item in full:
full_pos.append(item.pos)
#----------------------------------------Pairing of the operators
#---------------------------------------Storing the spin of the operators
is_pair = 1
spin_tracker = 1
#for item in full:
#print item.pos, 'here is the spin of the operator before '
if is_pair:
for index in range(len(full1) / 2):
full1[index].pair = full1[len(full1) - index - 1]
full1[len(full1) - index - 1].pair = full1[index]
#if the spin is not predefined
if full1[index].spin == 0:
full1[index].pos2 = spin_tracker
full1[len(full1) - index - 1].pos2 = spin_tracker
full1[index].spin = spin_tracker
full1[len(full1) - index - 1].spin = spin_tracker
spin_tracker = spin_tracker + 1
'''
if full1[index].spin==0:
full1[index].spin=spin_tracker
full1[len(full1)/2+index].spin=spin_tracker
#print full1[index].spin
#print full1[len(full1)/2+index].spin
spin_tracker=spin_tracker+1
'''
for index in range(len(full2) / 2):
full2[index].pair = full2[len(full2) - index - 1]
full2[len(full2) - index - 1].pair = full2[index]
if full2[index].spin == 0:
full2[index].pos2 = spin_tracker
full2[len(full2) - index - 1].pos2 = spin_tracker
full2[index].spin = spin_tracker
full2[len(full2) - index - 1].spin = spin_tracker
spin_tracker = spin_tracker + 1
'''
if full2[index].spin==0:
full2[index].spin=spin_tracker
full2[len(full2)/2+index].spin=spin_tracker
#print full2[index].spin
#print full2[len(full2)/2+index].spin
spin_tracker=spin_tracker+1
'''
#print len(full), len(full1)/2
'''
for item in full1:
print item.pos, 'here is the position of the operator'
for item in full2:
print item.pos, 'here is the position of the operator'
'''
#-------------------------all the possible contracting operators of each operator is being sored in poss here
#poss is a matrix
if menu == '1': #self normal ordering
for operator in full:
y = deque([])
if operator.kind == 'pa' and operator.dag == '0':
for item in a:
if operator.pos < item.pos and item.dag == '1':
y.append(item)
elif operator.kind == 'ho' and operator.dag == '1':
for item in i:
if operator.pos < item.pos and item.dag == '0':
y.append(item)
elif operator.kind == 'ac': #because active states will have eta and gamma
for item in u:
if operator.pos < item.pos and int(item.dag) != int(
operator.dag):
y.append(item)
poss.append(
y
) #list of list in dictionary order i.e 1st annhilation -> possible creation then 2nd ...
else:
for operator in full:
y = deque([])
if operator.kind == 'pa' and operator.dag == '0':
for item in a:
if operator.pos < item.pos and item.dag == '1' and operator.string != item.string:
y.append(item)
elif operator.kind == 'ho' and operator.dag == '1':
for item in i:
if operator.pos < item.pos and item.dag == '0' and operator.string != item.string:
y.append(item)
elif operator.kind == 'ac': #because active states will have eta and gamma
for item in u:
if operator.pos < item.pos and int(item.dag) != int(
operator.dag
) and operator.string != item.string:
y.append(item)
#if (y): remember that empty strings are also included
poss.append(
y
) #list of list in dictionary order i.e 1st annhilation -> possible creation then 2nd ...
no = len(full) / 2
contracted = []
tmp_l = []
#---------------------The first term of the PDF file is being printed here (not important)
tmp_l = []
tmp_lower = []
tmp_upper = []
if not i_c:
if menu == '1' or menu == '2':
tmp_l.append("Doing : Normal ordering of String\\\\")
else:
tmp_l.append("Doing : Commutator expression Generation\\\\")
tmp_l.append('Here are the operator strings : \[E^{')
for item in full1:
if item.dag == '1':
tmp_upper = item.name
tmp_l.append(tmp_upper)
tmp_l.append('}_{')
for item in full1:
if item.dag == '0':
tmp_lower.append(item.name)
tmp_lower = tmp_lower[::-1]
tmp_l = tmp_l + tmp_lower
tmp_lower = []
tmp_l.append('} , ')
if menu == '2' or menu == '3':
tmp_l.append(' E^{')
for item in full2:
if item.dag == '1':
tmp_upper = item.name
tmp_l.append(tmp_upper)
tmp_l.append('}_{')
for item in full2:
if item.dag == '0':
tmp_lower.append(item.name)
tmp_lower = tmp_lower[::-1]
tmp_l = tmp_l + tmp_lower
tmp_lower = []
tmp_l.append('}')
tmp_l.append('\]')
tmp_6 = "Equation : " + ''.join(
tmp_l) + '\\\\' + '\n' + "Answer :\n"
f.write(tmp_6)
if not i_c and commutator:
f.write("\nThis is where the first terms start\\\\\n")
elif commutator:
f.write("\nThis is where the second terms start\\\\\n")
full_con = []
const_con = []
make_c.make_c(len(full), contracted, a, i, u, full, poss, f,
store_for_repeat, full_pos, i_c, menu, full_con,
const_con)
print full_con, const_con
def ewt(op1, op2):
#class operator defined
'''
string2 = []
string1 = []
class operator(object):
def __init__(self, kind, dag, pos, name, st, pair, spin):
self.kind = kind
self.dag = dag
self.pos = pos
self.name = name
self.string = st
self.pair = pair
self.spin = spin
def __repr__(self):
return self.name
#...........input for spin free wicks therem
print "\n Spin Free GWT\n"
#input menu and strings
print "\n----------------------------------------------------------------\n Hello, this is EWT expression generator. \n Chose what you want to do by entering the number across the option. \n-------------------------------------------------------\n"
menu = raw_input(" MENU \n1 - Single string EWT generator\n2 - Two normal ordered strings EWT generator\n3 - Commutator type two string EWT generator\n")
if menu=='1' or menu=='2' or menu=='3':
pass
else:
print "Did you enter a number in (1, 2, 3) ? If no, kindly co-operate, I am a computer and do not understand much :(. Run Again !"
sys.exit()
commutator=0
if menu == '1':
string1_upper = list(raw_input("Enter Operator :\nInput the upper indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited; 1-daggered; 0-undaggered)\nExample : uv\nOperator string: "))
string1_lower = list(raw_input("input the lower indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited; 1-daggered; 0-undaggered)\nExample : uv\nOperator string: "))
elif menu=='2':
string1_upper = list(raw_input("Enter Operator 1 : Input the upper indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited; 1-daggered; 0-undaggered)\nExample : uv\nOperator string: "))
string1_lower = list(raw_input("input the lower indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited; 1-daggered; 0-undaggered)\nExample : uv\nOperator string: "))
string2_upper = list(raw_input("Enter Operator 2 : Input the upper indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited; 1-daggered; 0-undaggered)\nExample : uv\nOperator string: "))
string2_lower = list(raw_input("input the lower indices of E E(a,b,c)_(e,f,g) \n(i,j..-holes; u,v...-active; a,b...-excited; 1-daggered; 0-undaggered)\nExample : uv\nOperator string: "))
elif menu == '3':
commutator = 1
string1 = list(raw_input("input the strings \n(i,j..-holes; u,v...-active; a,b...-excited; 1-daggered; 0-undaggered)\nExample : u1v0\nOperator 1: "))
string2 = list(raw_input("Operator 2: "))
for index in range(0, len(string1_upper)):
string1.append(string1_upper[index])
string1.append('1')
for index in range(len(string1_lower)-1, -1, -1):
string1.append(string1_lower[index])
string1.append('0')
print string1
if menu=='2' or menu=='3' :
for index in range(0, len(string2_upper)):
string2.append(string2_upper[index])
string2.append('1')
for index in range(len(string2_lower)-1, -1, -1):
string2.append(string2_lower[index])
string2.append('0')
print string2
'''
#!!!!!!!! I am fixing the commutator to 0 by force here. Remember to remove this line when incorporating the menu !!!!
commutator=0
menu = '2'
a = deque([])
i = deque([])
u = deque([])
full = []
full1 = [] #first string
full2 = [] #second string
full_pos = [] #positions of full
p = 0
spin=0
#make all the arrays with the op1 and op2 in the perturbation theory case :
full1 = op1
full2 = op2
# full.append(full1)
# full.append(full2)
for item in op1 :
if item.kind == 'ac':
u.append(item)
if item.kind == 'ho':
i.append(item)
if item.kind == 'pa':
a.append(item)
for item in op2 :
if item.kind == 'ac':
u.append(item)
if item.kind == 'ho':
i.append(item)
if item.kind == 'pa':
a.append(item)
'''
#this portion goes to the make_operator function called in the main mbpt2.py file :
#make 3 lists : a-particle operators, i-hole operators, u-active state operators
for index in range(0, len(string1), 2):
if (string1[index] == 'o' or string1[index] == 't'):
x = operator('ac', string1[index+1], p+1, string1[index], 1, -1, 1)
u.append(x)
full1.append(x)
full.append(x)
p=p+1
elif (string1[index] >= 'a') and (string1[index] < 'h') :
x = operator('pa', string1[index+1], p+1, string1[index], 1, -1, 1)
a.append(x)
full1.append(x)
full.append(x)
p=p+1
elif (string1[index] >= 'i') and (string1[index] < 'u') :
x = operator('ho', string1[index+1], p+1, string1[index],1, -1, 1)
i.append(x)
full1.append(x)
full.append(x)
p=p+1
elif (string1[index] >='u' and string1[index]<='z'):
x = operator('ac', string1[index+1], p+1, string1[index], 1, -1, 1)
u.append(x)
full1.append(x)
full.append(x)
p=p+1
if string2:
for index in range(0, len(string2), 2):
if (string2[index] == 'o' or string2[index] == 't'):
x = operator('ac', string2[index+1], p+1, string2[index], 2, -1, 1)
u.append(x)
full2.append(x)
p=p+1
elif (string2[index] >= 'a') and (string2[index] < 'h') :
x = operator('pa', string2[index+1], p+1, string2[index], 2, -1, 1)
a.append(x)
full2.append(x)
p=p+1
elif (string2[index] >= 'i') and (string2[index] < 'u') :
x = operator('ho', string2[index+1], p+1, string2[index], 2, -1, 1)
i.append(x)
full2.append(x)
p=p+1
elif (string2[index] >='u' and string2[index]<='z'):
x = operator('ac', string2[index+1], p+1, string2[index], 2, -1, 1)
u.append(x)
full2.append(x)
p=p+1
'''
#make list for all possible contractions for any operator
#The commutator here is 1 when menu=3, so 2 set of terms wille be needed (commutator +1)
for i_c in range(commutator+1):
full = []
full_pos = []
store_for_repeat = []
poss= deque([])
y = deque([])
if not i_c:
full.extend(full1)
full.extend(full2)
else :
for item in full1:
item.string=2
for item in full2:
item.string=1
full.extend(full2)
full.extend(full1)
for item in full:
full_pos.append(item.pos)
#----------------------------------------Pairing of the operators
#---------------------------------------Storing the spin of the operators
is_pair=1
spin_tracker=1
#for item in full:
#print item.pos, 'here is the spin of the operator before '
if is_pair:
for index in range(len(full1)/2):
full1[index].pair=full1[len(full1)-index-1]
full1[len(full1)-index-1].pair=full1[index]
#if the spin is not predefined
if full1[index].spin==0:
full1[index].pos2=spin_tracker
full1[len(full1)-index-1].pos2=spin_tracker
full1[index].spin=spin_tracker
full1[len(full1)-index-1].spin=spin_tracker
spin_tracker=spin_tracker+1
'''
if full1[index].spin==0:
full1[index].spin=spin_tracker
full1[len(full1)/2+index].spin=spin_tracker
#print full1[index].spin
#print full1[len(full1)/2+index].spin
spin_tracker=spin_tracker+1
'''
for index in range(len(full2)/2):
full2[index].pair=full2[len(full2)-index-1]
full2[len(full2)-index-1].pair=full2[index]
if full2[index].spin==0:
full2[index].pos2=spin_tracker
full2[len(full2)-index-1].pos2=spin_tracker
full2[index].spin=spin_tracker
full2[len(full2)-index-1].spin=spin_tracker
spin_tracker=spin_tracker+1
'''
if full2[index].spin==0:
full2[index].spin=spin_tracker
full2[len(full2)/2+index].spin=spin_tracker
#print full2[index].spin
#print full2[len(full2)/2+index].spin
spin_tracker=spin_tracker+1
'''
#print len(full), len(full1)/2
#for item in full1:
#print item.pos, 'here is the spin of the operator'
#for item in full2:
#print item.pos, 'here is the spin of the operator'
#-------------------------all the possible contracting operators of each operator is being sored in poss here
#poss is a matrix
if menu=='1':#self normal ordering
for operator in full:
y = deque([])
if operator.kind == 'pa' and operator.dag=='0':
for item in a:
if operator.pos<item.pos and item.dag=='1':
y.append(item)
elif operator.kind == 'ho' and operator.dag=='1':
for item in i:
if operator.pos<item.pos and item.dag=='0':
y.append(item)
elif operator.kind == 'ac': #because active states will have eta and gamma
for item in u:
if operator.pos<item.pos and int(item.dag)!=int(operator.dag):
y.append(item)
poss.append(y) #list of list in dictionary order i.e 1st annhilation -> possible creation then 2nd ...
else:
for operator in full:
y = deque([])
if operator.kind == 'pa' and operator.dag=='0':
for item in a:
if operator.pos<item.pos and item.dag=='1' and operator.string!=item.string:
y.append(item)
elif operator.kind == 'ho' and operator.dag=='1':
for item in i:
if operator.pos<item.pos and item.dag=='0' and operator.string!=item.string:
y.append(item)
elif operator.kind == 'ac': #because active states will have eta and gamma
for item in u:
if operator.pos<item.pos and int(item.dag)!=int(operator.dag) and operator.string!=item.string:
y.append(item)
#if (y): remember that empty strings are also included
poss.append(y) #list of list in dictionary order i.e 1st annhilation -> possible creation then 2nd ...
no = len(full)/2
contracted = []
tmp_l = []
#---------------------The first term of the PDF file is being printed here (not important)
tmp_l=[]
tmp_lower=[]
tmp_upper=[]
if not i_c:
if menu == '1' or menu =='2':
tmp_l.append("Doing : Normal ordering of String\\\\")
else :
tmp_l.append("Doing : Commutator expression Generation\\\\")
tmp_l.append('Here are the operator strings : \[E^{')
for item in full1:
if item.dag=='1':
tmp_upper=item.name
tmp_l.append(tmp_upper)
tmp_l.append('}_{')
for item in full1:
if item.dag=='0':
tmp_lower.append(item.name)
tmp_lower=tmp_lower[::-1]
tmp_l=tmp_l+tmp_lower
tmp_lower=[]
tmp_l.append('} , ')
if menu=='2' or menu=='3':
tmp_l.append(' E^{')
for item in full2:
if item.dag=='1':
tmp_upper=item.name
tmp_l.append(tmp_upper)
tmp_l.append('}_{')
for item in full2:
if item.dag=='0':
tmp_lower.append(item.name)
tmp_lower=tmp_lower[::-1]
tmp_l=tmp_l+tmp_lower
tmp_lower=[]
tmp_l.append('}')
tmp_l.append('\]')
tmp_6 = "Equation : "+''.join(tmp_l)+'\\\\'+'\n'+"Answer :\n"
f.write(tmp_6)
if not i_c and commutator:
f.write("\nThis is where the first terms start\\\\\n")
elif commutator :
f.write("\nThis is where the second terms start\\\\\n")
full_con = []
const_con = []
make_c.make_c(len(full), contracted, a, i, u, full, poss, f, store_for_repeat, full_pos, i_c, menu, full_con, const_con)
return full_con, const_con
tmp_lower=[]
tmp_l.append('} , ')
if menu=='2' or menu=='3':
tmp_l.append(' E^{')
for item in full2:
if item.dag=='1':
tmp_upper=item.name
tmp_l.append(tmp_upper)
tmp_l.append('}_{')
for item in full2:
if item.dag=='0':
tmp_lower.append(item.name)
tmp_lower=tmp_lower[::-1]
tmp_l=tmp_l+tmp_lower
tmp_lower=[]
tmp_l.append('}')
tmp_l.append('\]')
tmp_6 = "Equation : "+'$$'+''.join(tmp_l)+'\\\\'+'$$'+'\n'+"Answer :\n"
f.write(tmp_6)
if not i_c and commutator:
f.write("\nThis is where the first terms start\\\\\n")
elif commutator :
f.write("\nThis is where the second terms start\\\\\n")
make_c.make_c(len(full), contracted, a, i, u, full, poss, f, store_for_repeat, full_pos, i_c, menu)
print "\n-------------------------------------------------------------------------------------\n ITS DONE :D Have a look at the tec.txt file !\n !!CHEERS !!"
outfile_config_fixed.write(make_config_fixed(filearchs))
outfile_config_fixed.close()
outfile_typedefs.write(make_typedefs(functions, retlist, my_argtypelist))
outfile_typedefs.close()
outfile_makefile_am.write(make_makefile_am(filearchs, machines,
archflags_dict))
outfile_makefile_am.close()
outfile_machines_h.write(make_machines_h(functions, machines, archs))
outfile_machines_h.close()
outfile_machines_c.write(make_machines_c(machines))
outfile_machines_c.close()
outfile_c.write(make_c(machines, archs, functions, arched_arglist, my_arglist))
outfile_c.close()
outfile_h.write(make_h(functions, arched_arglist))
outfile_h.close()
for machine in machines:
machine_c_filename = os.path.join(gendir,
"lib/volk_machine_" + machine + ".c")
outfile_machine_c = open(machine_c_filename, "w")
outfile_machine_c.write(
make_each_machine_c(machine, machines[machine], functions, fcountlist,
taglist, machine_alignment_dict[machine]))
outfile_machine_c.close()
tmp_l = tmp_l + tmp_lower
tmp_lower = []
tmp_l.append('} , ')
if menu == '2' or menu == '3':
tmp_l.append(' E^{')
for item in full2:
if item.dag == '1':
tmp_upper = item.name
tmp_l.append(tmp_upper)
tmp_l.append('}_{')
for item in full2:
if item.dag == '0':
tmp_lower.append(item.name)
tmp_lower = tmp_lower[::-1]
tmp_l = tmp_l + tmp_lower
tmp_lower = []
tmp_l.append('}')
tmp_l.append('\]')
tmp_6 = "Equation : " + '$$' + ''.join(
tmp_l) + '\\\\' + '$$' + '\n' + "Answer :\n"
f.write(tmp_6)
if not i_c and commutator:
f.write("\nThis is where the first terms start\\\\\n")
elif commutator:
f.write("\nThis is where the second terms start\\\\\n")
make_c.make_c(len(full), contracted, a, i, u, full, poss, f,
store_for_repeat, full_pos, i_c, menu)
print "\n-------------------------------------------------------------------------------------\n ITS DONE :D Have a look at the tec.txt file !\n !!CHEERS !!"
outfile_config_in.write(make_config_in(filearchs));
outfile_config_in.close();
outfile_reg.write(make_registry(filearchs, functions, fcountlist));
outfile_reg.close();
outfile_h.write(make_h(functions, arched_arglist, retlist));
outfile_h.close();
outfile_init_h.write(make_init_h(functions, arched_arglist, retlist));
outfile_init_h.close();
outfile_config_fixed.write(make_config_fixed(filearchs));
outfile_config_fixed.close();
outfile_c.write( make_c(functions, taglist, arched_arglist, retlist, my_arglist, fcountlist));
outfile_c.close();
outfile_runtime_c.write(make_runtime_c(functions, taglist, arched_arglist, retlist, my_arglist, fcountlist));
outfile_runtime_c.close();
outfile_init_c.write(make_init_c(functions, filearchs));
outfile_init_c.close();
outfile_runtime.write(make_runtime(functions));
outfile_runtime.close();
outfile_typedefs.write(make_typedefs(functions, retlist, my_argtypelist));
outfile_typedefs.close();
outfile_environment_c.write(make_environment_init_c(filearchs));
