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
|
#! /usr/bin/env python3
# Usage:
# techtree.py <depfile>
#
# Where input <depfile> is created in Easel directory by clang preprocessing:
# for cfile in esl_*.c easel.c; do clang -MM -c -I. -DeslENABLE_AVX -DeslENABLE_AVX512 -DeslENABLE_VMX -DeslENABLE_NEON -DeslENABLE_SSE -DHAVE_MPI ${cfile} >> easel.dep; done
#
# (Some harmless errors will come out on stderr about NEON and VMX instructions not being enabled; ignore them.)
#
# This input file consists of lists of dependencies, possibly wrapped to multiple lines,
# as in:
#
# esl_cpu.o: esl_cpu.c esl_config.h easel.h esl_cpu.h
# esl_dirichlet.o: esl_dirichlet.c esl_config.h easel.h esl_fileparser.h \
# esl_minimizer.h esl_random.h esl_stats.h esl_vectorops.h \
# esl_dirichlet.h
# esl_distance.o: esl_distance.c esl_config.h easel.h esl_alphabet.h \
# esl_dmatrix.h esl_random.h esl_distance.h
#
# For each module, we extract its name ("esl_distance.o" => "distance"). We
# ignore the dependency on a module's own .c and .h file, and on esl_config.h.
#
# Four global data structures describe the proposed layout of the tech tree,
# as shown in the tech tree figure:
# <easelgrps> specifies an order that the groups organize into:
# base, a layer of fundamental stuff, sequence handling,
# statistics, misc stuff off the base, and MPI over all.
# <easelmods> specifies how modules are assigned to groups;
# <easelmods[g]> is an ordered list of modules that belong to group <g>
# <easelparents> specifies dependencies at group level:
# <easelparents[g]> is a set of groups that group <g> depends on.
# <easeladd> specifies additional dependencies within a group:
# <easeladd[m]> is a set of modules that <m> depends on within m's own group.
#
# The script validates this proposed layout, and checks that the actual dependencies
# in Easel are consistent with it.
#
# The output is in two sections: the actual dependencies of each Easel module
# (so you can consider improved layouts), followed by a list of any actual
# dependencies that aren't satisfied by the current layout.
#
import sys
import re
easelgrps = [
'BASE',
'BIOLOGICAL_SEQUENCES', 'NUMERICAL_METHODS', 'ALGORITHMS', 'FILE_INPUT',
'ADVANCED_SEQUENCES', 'MULTIPLE_ALIGNMENTS', 'MULTIPLE_ALIGNMENT_FILES', 'SEQUENCE_FILES',
'STATISTICAL_DISTRIBUTIONS', 'MIXTURE_DISTRIBUTIONS',
'COMMANDLINE', 'BENCHMARKS', 'SIMD_VECTORS', 'MULTITHREADING',
'MPI'
]
easelmods = {
'BASE' : [ 'easel', 'mem', 'random', 'regexp', 'stack', 'vectorops' ],
'ALGORITHMS' : [ 'arr2', 'arr3', 'bitfield', 'cluster', 'dmatrix', 'heap', 'keyhash', 'matrixops', 'quicksort', 'red_black', 'varint', 'huffman', 'graph', 'tree' ],
'NUMERICAL_METHODS' : [ 'rootfinder', 'minimizer', 'rand64' ],
'BIOLOGICAL_SEQUENCES' : [ 'alphabet', 'composition', 'hmm' ],
'FILE_INPUT' : [ 'buffer', 'fileparser', 'recorder', 'ssi', 'json' ],
'COMMANDLINE' : [ 'getopts', 'subcmd' ],
'BENCHMARKS' : [ 'stopwatch' ],
'STATISTICAL_DISTRIBUTIONS' : [ 'stats', 'normal', 'histogram', 'exponential', 'gamma', 'gev', 'gumbel', 'stretchexp', 'weibull' ],
'MIXTURE_DISTRIBUTIONS': [ 'dirichlet', 'mixgev', 'hyperexp', 'mixdchlet' ],
'ADVANCED_SEQUENCES' : [ 'distance', 'wuss', 'paml', 'randomseq', 'ratematrix', 'scorematrix', 'swat' ],
'MULTIPLE_ALIGNMENTS' : [ 'msa', 'msacluster', 'msashuffle', 'msaweight' ],
'MULTIPLE_ALIGNMENT_FILES' : [ 'msafile', 'msafile2', 'msafile_a2m', 'msafile_afa', 'msafile_clustal', 'msafile_phylip', 'msafile_psiblast', 'msafile_selex', 'msafile_stockholm' ],
'SEQUENCE_FILES' : [ 'sq', 'sqio_ascii', 'sqio_ncbi', 'sqio', 'dsqdata', 'gencode' ],
'SIMD_VECTORS' : [ 'alloc', 'cpu', 'sse', 'avx', 'avx512', 'neon', 'vmx' ],
'MULTITHREADING' : [ 'threads', 'workqueue' ],
'MPI' : [ 'mpi' ],
}
easelparents = {
'BASE' : {},
'BIOLOGICAL_SEQUENCES' : { 'BASE' },
'NUMERICAL_METHODS' : { 'BASE' },
'ALGORITHMS': { 'BASE' },
'FILE_INPUT': { 'BASE' },
'COMMANDLINE': { 'BASE' },
'BENCHMARKS': { 'BASE' },
'SIMD_VECTORS': { 'BASE' },
'MULTITHREADING': { 'BASE' },
'ADVANCED_SEQUENCES': { 'BIOLOGICAL_SEQUENCES', 'NUMERICAL_METHODS', 'ALGORITHMS', 'FILE_INPUT' },
'STATISTICAL_DISTRIBUTIONS' : { 'NUMERICAL_METHODS' },
'MIXTURE_DISTRIBUTIONS' : { 'STATISTICAL_DISTRIBUTIONS', 'ALGORITHMS', 'FILE_INPUT' },
'MULTIPLE_ALIGNMENTS' : { 'ADVANCED_SEQUENCES' },
'MULTIPLE_ALIGNMENT_FILES' : { 'MULTIPLE_ALIGNMENTS' },
'SEQUENCE_FILES' : { 'MULTIPLE_ALIGNMENT_FILES' },
'MPI': { 'BENCHMARKS', 'SEQUENCE_FILES' }
}
easeladd = {
# BASE
'easel' : set(),
'mem' : { 'easel' },
'random' : { 'easel' },
'regexp' : { 'easel' },
'stack' : { 'easel', 'random' },
'vectorops' : { 'easel', 'random' },
# ALGORITHMS
'arr2' : set(),
'arr3' : set(),
'bitfield' : set(),
'cluster' : set(),
'dmatrix' : set(),
'heap' : set(),
'keyhash' : set(),
'matrixops' : set(),
'quicksort' : set(),
'red_black' : set(),
'varint' : set(),
'huffman' : { 'quicksort' },
'graph' : { 'matrixops' },
'tree' : { 'arr2', 'dmatrix', 'stack'},
# NUMERICAL_METHODS
'rootfinder' : set(),
'minimizer' : set(),
'rand64' : set(),
# BIOLOGICAL_SEQUENCES
'alphabet' : set(),
'composition' : set(),
'hmm' : { 'alphabet' },
# FILE_INPUT
'buffer' : set(),
'fileparser' : set(),
'recorder' : set(),
'ssi' : set(),
'json' : { 'buffer' },
# COMMANDLINE
'getopts' : set(),
'subcmd' : { 'getopts' },
# BENCHMARKS
'stopwatch' : set(),
# STATISTICAL_DISTRIBUTIONS
'stats' : set(),
'normal' : { 'stats' },
'histogram' : { 'stats' },
'exponential' : { 'stats', 'histogram' },
'gamma' : { 'stats', 'histogram' },
'gev' : { 'stats' },
'gumbel' : { 'stats' },
'stretchexp' : { 'stats', 'histogram' },
'weibull' : { 'stats', 'histogram' },
# MIXTURE_DISTRIBUTIONS
'dirichlet' : set(),
'hyperexp' : set(),
'mixdchlet' : { 'dirichlet' },
'mixgev' : { 'dirichlet' },
# ADVANCED_SEQUENCES
'distance' : set(),
'wuss' : set(),
'paml' : set(),
'randomseq' : set(),
'ratematrix' : set(),
'scorematrix' : { 'ratematrix' },
'swat' : { 'scorematrix' },
# MULTIPLE_ALIGNMENTS
'msa' : set(),
'msacluster' : { 'msa' },
'msashuffle' : { 'msa' },
'msaweight' : { 'msa', 'msacluster' },
# MULTIPLE_ALIGNMENT_FILES
'msafile' : set(),
'msafile2' : set(),
'msafile_a2m' : { 'msafile' },
'msafile_afa' : { 'msafile' },
'msafile_clustal' : { 'msafile' },
'msafile_phylip' : { 'msafile' },
'msafile_psiblast' : { 'msafile' },
'msafile_selex' : { 'msafile' },
'msafile_stockholm' : { 'msafile' },
# SEQUENCE_FILES
'sq' : set(),
'sqio' : { 'sq' },
'sqio_ascii' : { 'sq', 'sqio' },
'sqio_ncbi' : { 'sq', 'sqio' },
'dsqdata' : { 'sq', 'sqio', 'sqio_ascii' },
'gencode' : { 'sq', 'sqio', 'sqio_ascii', 'sqio_ncbi' },
# SIMD_VECTORS
'alloc' : set(),
'cpu' : set(),
'sse' : set(),
'avx' : set(),
'avx512' : set(),
'neon' : set(),
'vmx' : set(),
# MULTITHREADING
'threads' : set(),
'workqueue' : set(),
# MPI
'mpi' : set(),
}
def main():
if (len(sys.argv) != 2):
sys.exit("Usage: techtree.py <.dep file>");
validate_layout()
Ma = expand_layout() # Ma[m] is a set of allowable dependencies for module <m>, according to layout
# Get the actual dependencies from the input file.
# <D[m]> is a set of module dependencies for module <m>
# excluding esl_config.h and itself, as parsed out of input
# depfile.
#
D = {}
for line in open(sys.argv[1]):
mat = re.match(r'(\S+): (.+)', line) # First line in a list of dependencies?
if mat:
m = process_token(mat.group(1))
fields = mat.group(2).split()
D[m] = set();
else:
fields = line.split()
for s in fields:
if s != "\\" and s != 'esl_config.h': # ignore \ and esl_config.h...
s = process_token(s) # ... extract module name from filename
if s != m: # ... and ignore dependencies on itself
D[m].add(s) # ... otherwise, add dependencies to the set.
output_direct_deplines(D) # First section: actual dependencies, organized for study.
compare_layout(Ma, D) # Followed by any problems in them.
def process_token(tok):
"""
"""
tok = re.sub(r'^esl_', '', tok)
tok = re.sub(r'.[coh]$', '', tok)
return tok
####
# validate_layout()
#
# Checks the four global data structures that define the figure
# layout.
#
def validate_layout():
Gl = set(easelgrps) # <easelgrps> list is all the group names
Gm = set(easelmods.keys()) # <easelmods> keys are also all the group names
Gp = set(easelparents.keys()) # <easelparents> keys are also all the group names
if Gl != Gm: sys.exit("easelgrps and easelmods have different set of group names")
if Gl != Gp: sys.exit("easelgrps and easelparents have different set of group names")
Mm = [] # Get all the module names in <easelmods>'s sets.
for g in easelmods.keys():
for m in easelmods[g]:
Mm.append(m)
if len(Mm) != len(set(Mm)):
sys.exit("easelmods must have same module assigned to >1 group")
Mm = set(Mm)
Ma = set(easeladd.keys())
if Mm != Ma:
sys.exit("easelmods and easeladd have a different set of module names")
print("# {0} groups".format(len(Gm)))
print("# {0} modules".format(len(Mm)))
####
# expand_layout()
#
# Use the immediate group dependencies in <easelparents> to traverse
# upwards through the graph for each group <g>, to get the complete
# set of dependencies for it. Use that to obtain its complete set of
# module dependencies.
#
# Return a <Ma>, a dict of sets: Ma[m] is a set of modules that module
# <m> depends on.
#
def expand_layout():
# Use a pushdown automaton to recursively find all group dependencies
# for each group <g>; store this set in Ga[g].
Ga = {}
for g in easelparents.keys():
Ga[g] = set()
pda = list(easelparents[g])
while len(pda):
g2 = pda.pop()
Ga[g].add(g2)
pda.extend(list(easelparents[g2]))
# Using Ga, plus additional within-group module dependencies in <adds>,
# expand set of group dependencies to set of module dependencies for each module <m>.
Ma = {}
for g in easelmods.keys():
mdep = set()
for g2 in Ga[g]: # for each group that <g> depends on...
mdep = mdep | set(easelmods[g2]) # add the modules in that group
for m in easelmods[g]:
Ma[m] = mdep | easeladd[m]
return Ma
####
def compare_layout(Ma, D):
for m in Ma.keys():
if not Ma[m] >= D[m]:
print(m, D[m] - Ma[m])
def output_direct_deplines(D):
for g in easelgrps:
print('# {0}'.format(g))
for m in easelmods[g]:
print('{0:20s}: '.format(m), end='')
for g2 in easelgrps:
for m2 in easelmods[g2]:
if m2 in D[m]:
print('{0} '.format(m2), end='')
print('')
print('')
if __name__ == "__main__":
main()
|