Add a small missed optimization: turn X == C ? X : Y into X == C ? C : Y. This
[llvm/stm8.git] / utils / parseNLT.pl
blob95afca73a1322dfda1ce5add735784ce145028fd
1 #!/usr/bin/perl
2 # a first attempt to parse the nightly tester pages into something
3 # one can reason about, namely import into a database
4 # USE: perl parseNLT.pl <2005-03-31.html
5 # for example
7 while(<>)
9 if (/LLVM Test Results for (\w+) (\d+), (\d+)</)
11 $mon = $1;
12 $day = $2;
13 $year = $3;
15 if (/<td>([^<]+)<\/td>/)
17 if ($prefix)
18 { $output .= "$1 "; $count++; }
20 if (/<tr/)
22 if ($output and $count > 3)
23 { print "\n$day $mon $year $prefix/$output"; }
24 $output = "";
25 $count = 0;
27 if (/<h2>(Programs.+)<\/h2>/)
29 $prefix = $1;
33 if ($output)
34 { print "\n$day $mon $year $prefix/$output"; $output = ""; }