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
|
#!/usr/bin/env python
from __future__ import print_function
"""
draw_specified_dependency_tree.py
"""
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
# options
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
from optparse import OptionParser
import sys, os
import os.path
try:
import StringIO as io
except:
import io as io
# add self to search path for testing
exe_path = os.path.split(os.path.abspath(sys.argv[0]))[0]
if __name__ == '__main__':
module_name = os.path.split(sys.argv[0])[1]
module_name = os.path.splitext(module_name)[0];
else:
module_name = __name__
parser = OptionParser(version="%prog 1.0")
parser.add_option("-d", "--dot_file", dest="dot_file",
metavar="FILE",
default = os.path.join(exe_path, "test_data/dag.dependency"),
type="string",
help="name and path of tree file in DOT format")
parser.add_option("-u", "--uptodate_job_names", dest="uptodate_job_names",
action="append",
metavar="JOBNAME",
default = list(),
type="string",
help="nodes to terminate on.")
parser.add_option("-t", "--target_job_names", dest="target_job_names",
action="append",
default = list(),
metavar="JOBNAME",
type="string",
help="nodes to start on.")
parser.add_option("-f", "--forced_job_names", dest="forced_job_names",
action="append",
default = list(),
metavar="JOBNAME",
type="string",
help="nodes to start on.")
parser.add_option("-v", "--verbose", dest = "verbose",
action="count", default=0,
help="Print more verbose messages for each additional verbose level.")
parser.add_option("-z", "--horizontal_graph", dest="horizontal_graph",
action="store_true", default=False,
help="Draw dependency graph horizontally")
parser.add_option("--skip_upstream", dest="skip_upstream",
action="store_true", default=False,
help="Only draw from targets")
parser.add_option("--skip_up_to_date", dest="skip_up_to_date",
action="store_true", default=False,
help="Only draw tasks which need to be rerun")
parameters = [
"uptodate_job_names"
]
mandatory_parameters = ["dot_file"]
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
# imports
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
import re
import operator
import sys
from collections import defaultdict
sys.path.append(os.path.abspath(os.path.join(exe_path,"..", "..")))
from ruffus import *
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
# Functions
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
#_________________________________________________________________________________________
# make_tree_from_dotfile
#_________________________________________________________________________________________
from adjacent_pairs_iterate import adjacent_pairs_iterate
def make_tree_from_dotfile (stream):
attributes = re.compile("\[.+\]")
#
# remember node
#
for linenum, line in enumerate(stream):
line = line.strip()
if "digraph" in line:
continue;
if not len(line) or line[0] in '#{}/':
continue;
line = line.strip(';')
line = attributes.sub("", line)
if "=" in line:
continue;
nodes = [x.strip() for x in line.split('->')]
for name1, name2 in adjacent_pairs_iterate(nodes):
if not node._is_node(name1):
node(name1)
if not node._is_node(name2):
node(name2)
node._lookup_node_from_name(name2).add_child(node._lookup_node_from_name(name1))
#
# task hack
node._lookup_node_from_name(name2)._action = 1
node._lookup_node_from_name(name1)._action = 1
def die_error(Msg):
"""
Standard way of dying after a fatal error
"""
print_error (Msg)
sys.exit()
def print_error (Msg):
"""
Standard way of printing error
"""
sys.stderr.write("\nError:\n" + wrap_text(Msg, "\t", "") + "\n")
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
# Main logic
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
if __name__ == '__main__':
# get help string
f =io.StringIO()
parser.print_help(f)
helpstr = f.getvalue()
(options, remaining_args) = parser.parse_args()
# mandatory options
for parameter in mandatory_parameters:
if options.__dict__[parameter] is None:
die_error("Please specify a file in --%s.\n\n" % parameter + helpstr)
make_tree_from_dotfile(open(options.dot_file))
#
# set up_to_date jobs
#
uptodate_jobs = task_names_to_tasks ("Up to date", options.uptodate_job_names)
for n in uptodate_jobs:
n._signal = True
graph_printout_in_dot_format (sys.stdout,
options.target_job_names,
options.forced_job_names,
not options.horizontal_graph,
options.skip_upstream,
options.skip_up_to_date)
|
