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 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703
|
import re, os, sys, operator
"""
This script parses a log produced by rstrategies_logger.py into a graph and converts it to various outputs.
The most useful outputs are the dot* commands producing a visualization of the log using the dot-command of graphviz.
Every strategy is a node in the graph, and the edges are collections or objects that transition between
two strategies at some point during the log.
Artificial nodes are created for log entries without an explicit source node. These are the events when a
collection is created.
The input to this script is a logfile, a command and optional flags.
If the name of the logfile includes one of the AVAILABLE_VMS as a substring, the first three global variables
are automatically configured.
The script should work without these configurations, but the output will probably not be that pretty.
To avoid errors, the -a flag is implied when running without proper configuration.
"""
# This should contain a full list of storage nodes (strategies).
# All strategies not included here will be combined into a single "Other"-node, if the -a flag is not given.
STORAGE_NODES = []
# This allows arbitrary renamings of storage strategy nodes
NODE_RENAMINGS = {}
# Artificial storage-source nodes are automatically named like the associated operation.
# This dict allows customizing the names of these nodes.
STORAGE_SOURCES = {}
def SET_VM(vm_name):
global STORAGE_NODES
global NODE_RENAMINGS
global STORAGE_SOURCES
if vm_name == 'RSqueak':
STORAGE_NODES = ['List', 'WeakList', 'SmallIntegerOrNil', 'FloatOrNil', 'AllNil']
NODE_RENAMINGS = dict((x+'Strategy', x) for x in STORAGE_NODES)
STORAGE_SOURCES = {'Filledin': 'Image Loading', 'Initialized': 'Object Creation'}
elif vm_name == 'Pycket':
STORAGE_SOURCES = {'Created': 'Array Creation'}
# TODO
elif vm_name == 'Topaz':
# TODO
pass
else:
raise Exception("Unhandled vm name %s" % vm_name)
AVAILABLE_VMS = ['RSqueak', 'Pycket', 'Topaz']
def configure_vm(logfile, flags):
vm_config_name = None
for vm_name in AVAILABLE_VMS:
if vm_name in logfile:
vm_config_name = vm_name
break
if vm_config_name is not None:
print "Using VM configuration %s" % vm_name
SET_VM(vm_name)
else:
print "No VM configuration found in filename '%s'. Available configurations: %s" % \
(logfile, AVAILABLE_VMS)
print "Please add new VM configuration or rename logfile. Turning on -a flag to avoid errors."
flags.allstorage = True
# ====================================================================
# ======== Logfile parsing
# ====================================================================
def percent(part, total):
if total == 0:
return 0
return float(part)*100 / total
def parse(filename, flags, callback):
parsed_entries = 0
if filename == "-":
opener = lambda: sys.stdin
else:
opener = lambda: open(filename, 'r', 1)
with opener() as file:
while True:
line = file.readline()
if len(line) == 0:
break
entry = parse_line(line, flags)
if entry:
parsed_entries += 1
callback(entry)
return parsed_entries
line_pattern = re.compile("^(?P<operation>\w+) \(((?P<old>\w+) -> )?(?P<new>\w+)\)( of (?P<classname>.+))? size (?P<size>[0-9]+)( objects (?P<objects>[0-9]+))?( elements: (?P<classnames>.+( .+)*))?$")
def parse_line(line, flags):
result = line_pattern.match(line)
if result is None:
if flags.verbose:
print "Could not parse line: %s" % line[:-1]
return None
operation = str(result.group('operation'))
old_storage = result.group('old')
new_storage = str(result.group('new'))
classname = str(result.group('classname'))
size = int(result.group('size'))
objects = result.group('objects')
objects = int(objects) if objects else 1
classnames = result.group('classnames')
if classnames is not None:
classnames = classnames.split(' ')
classnames = set(classnames)
else:
classnames = set()
is_storage_source = old_storage is None
if is_storage_source:
if operation in STORAGE_SOURCES:
old_storage = STORAGE_SOURCES[operation]
else:
print "Using operation %s as storage source." % operation
old_storage = str(old_storage)
if new_storage in NODE_RENAMINGS:
new_storage = NODE_RENAMINGS[new_storage]
if old_storage in NODE_RENAMINGS:
old_storage = NODE_RENAMINGS[old_storage]
return LogEntry(operation, old_storage, new_storage, classname, size, objects, classnames, is_storage_source)
class LogEntry(object):
def __init__(self, operation, old_storage, new_storage, classname, size, objects, classnames, is_storage_source):
self.operation = operation
self.old_storage = old_storage
self.new_storage = new_storage
self.classname = classname
self.size = size
self.objects = objects
self.classnames = classnames
self.is_storage_source = is_storage_source
assert old_storage != new_storage, "old and new storage identical in log entry: %s" % self
def full_key(self):
return (self.operation, self.old_storage, self.new_storage)
def __lt__(self, other):
return self.classname < other.classname
def __repr__(self):
return "%s(%s)" % (self.__str__(), object.__repr__(self))
def __str__(self):
old_storage_string = "%s -> " % self.old_storage if self.old_storage else ""
classname_string = " of %s" % self.classname if self.classname else ""
objects_string = " objects %d" % self.objects if self.objects > 1 else ""
return "%s (%s%s)%s size %d%s" % (self.operation, old_storage_string, self.new_storage, classname_string, self.size, objects_string)
# ====================================================================
# ======== Graph parsing
# ====================================================================
class Operations(object):
def __init__(self, objects=0, slots=0, element_classnames=[]):
self.objects = objects
self.slots = slots
self.element_classnames = set(element_classnames)
def __str__(self, total=None):
if self.objects == 0:
avg_slots = 0
else:
avg_slots = float(self.slots) / self.objects
if total is not None and total.slots != 0:
percent_slots = " (%.1f%%)" % percent(self.slots, total.slots)
else:
percent_slots = ""
if total is not None and total.objects != 0:
if percent(self.objects, total.objects) < 0.1:
percent_objects = " (< 0.1%)"
else:
percent_objects = " (%.1f%%)" % percent(self.objects, total.objects)
else:
percent_objects = ""
slots = format(self.slots, ",d")
objects = format(self.objects, ",d")
classnames = (" [ elements: %s ]" % ' '.join([str(x) for x in self.element_classnames])) \
if len(self.element_classnames) else ""
return "%s%s slots in %s%s objects (avg size: %.1f)%s" % (slots, percent_slots, objects, percent_objects, avg_slots, classnames)
def __repr__(self):
return "%s(%s)" % (self.__str__(), object.__repr__(self))
def add_log_entry(self, entry):
self.slots = self.slots + entry.size
self.objects = self.objects + entry.objects
self.element_classnames |= entry.classnames
def __sub__(self, other):
return Operations(self.objects - other.objects, self.slots - other.slots)
def __add__(self, other):
return Operations(self.objects + other.objects, self.slots + other.slots)
def __lt__(self, other):
return self.slots < other.slots
def empty(self):
return self.objects == 0 and self.slots == 0
def prefixprint(self, key="", total=None):
if not self.empty():
print "%s%s" % (key, self.__str__(total))
class ClassOperations(object):
def __init__(self):
self.classes = {}
def cls(self, name):
if name not in self.classes:
self.classes[name] = Operations()
return self.classes[name]
def total(self):
return reduce(operator.add, self.classes.values(), Operations())
def __str__(self):
return "ClassOperations(%s)" % self.classes
def __repr__(self):
return "%s(%s)" % (self.__str__(), object.__repr__(self))
def __add__(self, other):
result = ClassOperations()
result.classes = dict(self.classes)
for classname, other_class in other.classes.items():
result.cls(classname) # Make sure exists.
result.classes[classname] += other_class
return result
def __sub__(self, other):
result = ClassOperations()
result.classes = dict(self.classes)
for classname, other_class in other.classes.items():
result.cls(classname) # Make sure exists.
result.classes[classname] -= other_class
return result
class StorageEdge(object):
def __init__(self, operation="None", origin=None, target=None):
self.operation = operation
self.classes = ClassOperations()
self.origin = origin
self.target = target
self.is_storage_source = False
def full_key(self):
return (self.operation, self.origin.name, self.target.name)
def cls(self, classname):
return self.classes.cls(classname)
def total(self):
return self.classes.total()
def notify_nodes(self):
self.origin.note_outgoing(self)
self.target.note_incoming(self)
def add_log_entry(self, entry):
self.cls(entry.classname).add_log_entry(entry)
if entry.is_storage_source:
self.is_storage_source = True
def as_log_entries(self):
entries = []
for classname, ops in self.classes.classes.items():
origin = None if self.is_storage_source else self.origin.name
entry = LogEntry(self.operation, origin, self.target.name, classname,
ops.slots, ops.objects, ops.element_classnames, self.is_storage_source)
entries.append(entry)
return entries
def __lt__(self, other):
return self.full_key() < other.full_key()
def __str__(self):
return "[%s %s -> %s]" % (self.operation, self.origin, self.target)
def __repr__(self):
return "%s(%s)" % (self.__str__(), object.__repr__(self))
def __add__(self, other):
origin = self.origin if self.origin is not None else other.origin
target = self.target if self.target is not None else other.target
result = StorageEdge(self.operation, origin, target)
result.classes += self.classes + other.classes
return result
def __sub__(self, other):
origin = self.origin if self.origin is not None else other.origin
target = self.target if self.target is not None else other.target
result = StorageEdge(self.operation, origin, target)
result.classes += self.classes - other.classes
return result
class StorageNode(object):
def __init__(self, name):
self.name = name
self.incoming = set()
self.outgoing = set()
def note_incoming(self, edge):
assert edge.target is self
if edge not in self.incoming:
self.incoming.add(edge)
def note_outgoing(self, edge):
assert edge.origin is self
if edge not in self.outgoing:
self.outgoing.add(edge)
def incoming_edges(self, operation):
return filter(lambda x: x.operation == operation, self.incoming)
def outgoing_edges(self, operation):
return filter(lambda x: x.operation == operation, self.outgoing)
def sum_incoming(self, operation):
return reduce(operator.add, self.incoming_edges(operation), StorageEdge(operation))
def sum_outgoing(self, operation):
return reduce(operator.add, self.outgoing_edges(operation), StorageEdge(operation))
def sum_all_incoming(self):
return reduce(operator.add, self.incoming, StorageEdge())
def sum_all_outgoing(self):
return reduce(operator.add, self.outgoing, StorageEdge())
def __str__(self):
return self.name
def __repr__(self):
return "%s(%s)" % (self.__str__(), object.__repr__(self))
def merge_edge_sets(self, set1, set2, key_slot):
getter = lambda edge: edge.__dict__[key_slot]
set_dict = dict([(getter(edge), edge) for edge in set1])
for edge in set2:
key = getter(edge)
if key not in set_dict:
set_dict[key] = edge
else:
set_dict[key] += edge
return set(set_dict.values())
def __add__(self, other):
result = StorageNode("%s %s" % (self.name, other.name))
result.incoming = self.merge_edge_sets(self.incoming, other.incoming, "origin")
# TODO bad code
for edge in result.incoming:
edge.target = result
result.outgoing = self.merge_edge_sets(self.outgoing, other.outgoing, "target")
for edge in result.outgoing:
edge.origin = result
return result
def __lt__(self, other):
return self.name < other.name
def is_artificial(self):
for outgoing in self.outgoing:
if outgoing.is_storage_source:
return True
return False
def is_storage_node(self):
return self.is_artificial() or self.name in STORAGE_NODES
def dot_name(self):
return self.name.replace(" ", "_")
class StorageGraph(object):
def __init__(self):
self.nodes = {}
self.edges = {}
self.operations = set()
def node(self, name):
if name not in self.nodes:
self.nodes[name] = StorageNode(name)
return self.nodes[name]
def assert_sanity(self):
visited_edges = set()
for node in self.nodes.values():
for edge in node.incoming:
assert edge in self.edges.values(), "Edge not in graph's edges: %s" % edge
visited_edges.add(edge)
if not edge.target is node:
print "Wrong edge target: %s\nIncoming edge: %s\nIn node: %s" % (edge.target, edge, node)
assert False
if not edge in edge.origin.outgoing:
print "Edge not in origin's outgoing: %s\nIncoming edge: %s\nIn node: %s" % (edge.origin.outgoing, edge, node)
assert False
for edge in node.outgoing:
assert edge in self.edges.values(), "Edge not in graph's edges: %s" % edge
visited_edges.add(edge)
if not edge.origin is node:
print "Wrong edge origin: %s\nOutgoing edge: %s\nIn node: %s" % (edge.origin, edge, node)
assert False
if not edge in edge.target.incoming:
print "Edge not in origin's incoming: %s\nOutgoing edge: %s\nIn node: %s" % (edge.target.incoming, edge, node)
assert False
assert len(visited_edges) == len(self.edges.values()), "Not all of graph's edges visited."
def add_log_entry(self, log_entry):
self.operations.add(log_entry.operation)
key = log_entry.full_key()
if key not in self.edges:
edge = StorageEdge(log_entry.operation, self.node(log_entry.old_storage), self.node(log_entry.new_storage))
self.edges[key] = edge
edge.notify_nodes()
self.edges[key].add_log_entry(log_entry)
def collapse_nodes(self, collapsed_nodes, new_name=None):
if len(collapsed_nodes) == 0:
return
for node in collapsed_nodes:
del self.nodes[node.name]
for edge in node.incoming:
del self.edges[edge.full_key()]
for edge in node.outgoing:
del self.edges[edge.full_key()]
new_node = reduce(operator.add, collapsed_nodes)
if new_name is not None:
new_node.name = new_name
self.nodes[new_node.name] = new_node
# TODO bad code
for node in collapsed_nodes:
for edge in node.incoming:
edge.origin.outgoing.remove(edge)
new_edges = filter(lambda filtered: filtered.origin == edge.origin, new_node.incoming)
assert len(new_edges) == 1
edge.origin.outgoing.add(new_edges[0])
for edge in node.outgoing:
edge.target.incoming.remove(edge)
new_edges = filter(lambda filtered: filtered.target == edge.target, new_node.outgoing)
assert len(new_edges) == 1
edge.target.incoming.add(new_edges[0])
for edge in new_node.incoming:
self.edges[edge.full_key()] = edge
for edge in new_node.outgoing:
self.edges[edge.full_key()] = edge
self.assert_sanity()
def collapse_nonstorage_nodes(self, new_name=None):
nodes = filter(lambda x: not x.is_storage_node(), self.nodes.values())
self.collapse_nodes(nodes, new_name)
def sorted_nodes(self):
nodes = self.nodes.values()
nodes.sort()
return nodes
def make_graph(logfile, flags):
graph = StorageGraph()
def callback(entry):
graph.add_log_entry(entry)
parse(logfile, flags, callback)
graph.assert_sanity()
return graph
# ====================================================================
# ======== Command - Summarize log content
# ====================================================================
def command_summarize(logfile, flags):
graph = make_graph(logfile, flags)
if not flags.allstorage:
graph.collapse_nonstorage_nodes()
for node in graph.sorted_nodes():
node.print_summary(flags, graph.operations)
def StorageNode_print_summary(self, flags, all_operations):
print "\n%s:" % self.name
sum = StorageEdge()
total_incoming = self.sum_all_incoming().total() if flags.percent else None
print "\tIncoming:"
for operation in all_operations:
if flags.detailed:
edges = [ (edge.origin.name, edge) for edge in self.incoming_edges(operation) ]
else:
edges = [ (operation, self.sum_incoming(operation)) ]
for edgename, edge in edges:
edge.print_with_name("\t\t\t", edgename, total_incoming, flags)
sum += edge
print "\tOutgoing:"
for operation in all_operations:
if flags.detailed:
edges = [ (edge.target.name, edge) for edge in self.outgoing_edges(operation) ]
else:
edges = [ (operation, self.sum_outgoing(operation)) ]
for edgename, edge in edges:
edge.print_with_name("\t\t\t", edgename, total_incoming, flags)
sum -= edge
sum.print_with_name("\t", "Remaining", total_incoming, flags)
StorageNode.print_summary = StorageNode_print_summary
def StorageEdge_print_with_name(self, prefix, edgename, total_reference, flags):
if flags.classes:
print "%s%s:" % (prefix, edgename)
prefix += "\t\t"
operations = self.classes.classes.items()
operations.sort(reverse=True, key=operator.itemgetter(1))
else:
operations = [ (edgename, self.total()) ]
for classname, classops in operations:
classops.prefixprint("%s%s: " % (prefix, classname), total_reference)
StorageEdge.print_with_name = StorageEdge_print_with_name
# ====================================================================
# ======== Command - DOT output
# ====================================================================
# Output is valid dot code and can be parsed by the graphviz dot utility.
def command_print_dot(logfile, flags):
graph = make_graph(logfile, flags)
print "/*"
print "Storage Statistics (dot format):"
print "================================"
print "*/"
print dot_string(graph, flags)
def run_dot(logfile, flags, output_type):
import subprocess
dot = dot_string(make_graph(logfile, flags), flags)
command = ["dot", "-T%s" % output_type, "-o%s.%s" % (flags.logfile, output_type)]
print "Running:\n%s" % " ".join(command)
p = subprocess.Popen(command, stdin=subprocess.PIPE, stdout=subprocess.PIPE, stderr=subprocess.STDOUT)
output = p.communicate(input=dot)[0]
print output
def command_dot(logfile, flags):
run_dot(logfile, flags, "jpg")
def command_dot_ps(logfile, flags):
run_dot(logfile, flags, "ps")
def command_dot_pdf(logfile, flags):
run_dot(logfile, flags, "pdf")
def command_dot_svg(logfile, flags):
run_dot(logfile, flags, "svg")
def dot_string(graph, flags):
result = "digraph G {"
incoming_cache = {}
if not flags.allstorage:
graph.collapse_nonstorage_nodes("Other")
def make_label(edge, prefix="", total_edge=None, slots_per_object=False):
object_suffix = " objects"
slots_suffix = " slots"
if not flags.objects or not flags.slots:
object_suffix = slots_suffix = ""
if total_edge and flags.percent and total_edge.objects != 0:
if percent(edge.objects, total_edge.objects) < 0.1:
percent_objects = " (< 0.1%)"
else:
percent_objects = " (%.1f%%)" % percent(edge.objects, total_edge.objects)
if percent(edge.slots, total_edge.slots) < 0.1:
percent_slots = " (< 0.1%)"
else:
percent_slots = " (%.1f%%)" % percent(edge.slots, total_edge.slots)
else:
percent_objects = percent_slots = ""
label = ""
if flags.objects:
label += "%s%s%s%s<BR/>" % (prefix, format(edge.objects, ",.0f"), object_suffix, percent_objects)
if flags.slots:
label += "%s%s%s%s<BR/>" % (prefix, format(edge.slots, ",.0f"), slots_suffix, percent_slots)
if slots_per_object and flags.slotsPerObject:
label += "%.1f slots/object<BR/>" % (float(total.slots) / total.objects)
return label
for node in graph.nodes.values():
incoming = node.sum_all_incoming().total()
outgoing = node.sum_all_outgoing().total()
remaining = incoming - outgoing
if node.is_artificial():
incoming_cache[node.name] = outgoing
shape = ",shape=box"
label = make_label(outgoing)
else:
incoming_cache[node.name] = incoming
shape = ""
label = make_label(incoming, "Incoming: ")
if remaining.objects != incoming.objects:
label += make_label(remaining, "Remaining: ", incoming)
result += "%s [label=<<B><U>%s</U></B><BR/>%s>%s];" % (node.dot_name(), node.name, label, shape)
for edge in graph.edges.values():
total = edge.total()
incoming = incoming_cache[edge.origin.name]
label = make_label(total, "", incoming, slots_per_object=True)
target_node = edge.target.dot_name()
source_node = edge.origin.dot_name()
result += "%s -> %s [label=<%s>];" % (source_node, target_node, label)
result += "}"
return result
# ====================================================================
# ======== Other commands
# ====================================================================
def command_aggregate(logfile, flags):
graph = make_graph(logfile, flags)
edges = graph.edges.values()
edges.sort()
for edge in edges:
logentries = edge.as_log_entries()
logentries.sort()
for entry in logentries:
print entry
def command_print_entries(logfile, flags):
def callback(entry):
print entry
parse(logfile, flags, callback)
# ====================================================================
# ======== Main
# ====================================================================
class Flags(object):
def __init__(self, flags):
self.flags = {}
for name, short in flags:
self.__dict__[name] = False
self.flags[short] = name
def handle(self, arg):
if arg in self.flags:
self.__dict__[self.flags[arg]] = True
return True
else:
return False
def __str__(self):
descriptions = [ ("%s (%s)" % description) for description in self.flags.items() ]
return "[%s]" % " | ".join(descriptions)
def usage(flags, commands):
print "Arguments: logfile command %s" % flags
print "Available commands: %s" % commands
exit(1)
def main(argv):
flags = Flags([
# General
('verbose', '-v'),
# All outputs
('percent', '-p'),
('allstorage', '-a'),
# Text outputs
('detailed', '-d'),
('classes', '-c'),
# dot outputs
('slots', '-s'),
('objects', '-o'),
('slotsPerObject', '-S'),
])
command_prefix = "command_"
module = sys.modules[__name__].__dict__
commands = [ a[len(command_prefix):] for a in module.keys() if a.startswith(command_prefix) ]
if len(argv) < 2:
usage(flags, commands)
logfile = argv[0]
flags.logfile = logfile
configure_vm(logfile, flags)
command = argv[1]
for flag in argv[2:]:
if not flags.handle(flag):
usage(flags, commands)
if command not in commands:
usage(flags, commands)
func = module[command_prefix + command]
func(logfile, flags)
if __name__ == "__main__":
main(sys.argv[1:])
|