зеркало из https://github.com/mozilla/pjs.git
489 строки
12 KiB
Perl
489 строки
12 KiB
Perl
|
# -*- Mode: perl; indent-tabs-mode: nil -*-
|
||
|
|
#
|
||
|
|
# The contents of this file are subject to the Netscape Public License
|
||
|
|
# Version 1.0 (the "License"); you may not use this file except in
|
||
|
|
# compliance with the License. You may obtain a copy of the License at
|
||
|
|
# http://www.mozilla.org/NPL/
|
||
|
|
#
|
||
|
|
# Software distributed under the License is distributed on an "AS IS"
|
||
|
|
# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
|
||
|
|
# License for the specific language governing rights and limitations
|
||
|
|
# under the License.
|
||
|
|
#
|
||
|
|
# The Original Code is the Tinderbox build tool.
|
||
|
|
#
|
||
|
|
# The Initial Developer of the Original Code is Netscape Communications
|
||
|
|
# Corporation. Portions created by Netscape are Copyright (C) 1998
|
||
|
|
# Netscape Communications Corporation. All Rights Reserved.
|
||
|
|
|
||
|
|
#
|
||
|
|
# Global variabls and functions for tinderbox
|
||
|
|
#
|
||
|
|
|
||
|
|
#
|
||
|
|
# Global variables
|
||
|
|
#
|
||
|
|
|
||
|
|
$td1 = {};
|
||
|
|
$td2 = {};
|
||
|
|
|
||
|
|
$build_list = []; # array of all build records
|
||
|
|
$build_name_index = {};
|
||
|
|
$build_name_names = [];
|
||
|
|
$name_count = 0;
|
||
|
|
|
||
|
|
$build_time_index = {};
|
||
|
|
$build_time_times = [];
|
||
|
|
$time_count = 0;
|
||
|
|
|
||
|
|
$build_table = [];
|
||
|
|
$who_list = [];
|
||
|
|
$who_list2 = [];
|
||
|
|
@note_array = ();
|
||
|
|
|
||
|
|
|
||
|
|
#$body_tag = "<BODY TEXT=#000000 BGCOLOR=#8080C0 LINK=#FFFFFF VLINK=#800080 ALINK=#FFFF00>";
|
||
|
|
#$body_tag = "<BODY TEXT=#000000 BGCOLOR=#FFFFC0 LINK=#0000FF VLINK=#800080 ALINK=#FF00FF>";
|
||
|
|
if( $ENV{'USERNAME'} eq 'ltabb' ){
|
||
|
|
$gzip = 'gzip';
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
$gzip = '/usr/local/bin/gzip';
|
||
|
|
}
|
||
|
|
|
||
|
|
$data_dir='data';
|
||
|
|
|
||
|
|
$lock_count = 0;
|
||
|
|
|
||
|
|
1;
|
||
|
|
|
||
|
|
sub lock{
|
||
|
|
#if( $lock_count == 0 ){
|
||
|
|
# print "locking $tree/LOCKFILE.lck\n";
|
||
|
|
# open( LOCKFILE_LOCK, ">$tree/LOCKFILE.lck" );
|
||
|
|
# flock( LOCKFILE_LOCK, 2 );
|
||
|
|
#}
|
||
|
|
#$lock_count++;
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
sub unlock{
|
||
|
|
#$lock_count--;
|
||
|
|
#if( $lock_count == 0 ){
|
||
|
|
# flock( LOCKFILE_LOCK, 8 );
|
||
|
|
# close( LOCKFILE_LOCK );
|
||
|
|
#}
|
||
|
|
}
|
||
|
|
|
||
|
|
sub print_time {
|
||
|
|
local($t) = @_;
|
||
|
|
local($sec,$minute,$hour,$mday,$mon,$year);
|
||
|
|
($sec,$minute,$hour,$mday,$mon,$year) = localtime( $t );
|
||
|
|
sprintf("%02d/%02d %02d:%02d",$mon+1,$mday,$hour,$minute);
|
||
|
|
}
|
||
|
|
|
||
|
|
sub url_encode {
|
||
|
|
local( $s ) = @_;
|
||
|
|
|
||
|
|
$s =~ s/\%/\%25/g;
|
||
|
|
$s =~ s/\=/\%3d/g;
|
||
|
|
$s =~ s/\?/\%3f/g;
|
||
|
|
$s =~ s/ /\%20/g;
|
||
|
|
$s =~ s/\n/\%0a/g;
|
||
|
|
$s =~ s/\r//g;
|
||
|
|
$s =~ s/\"/\%22/g;
|
||
|
|
$s =~ s/\'/\%27/g;
|
||
|
|
$s =~ s/\|/\%7c/g;
|
||
|
|
$s =~ s/\&/\%26/g;
|
||
|
|
return $s;
|
||
|
|
}
|
||
|
|
|
||
|
|
sub url_decode {
|
||
|
|
local($value) = @_;
|
||
|
|
$value =~ tr/+/ /;
|
||
|
|
$value =~ s/%([a-fA-F0-9][a-fA-F0-9])/pack("C", hex($1))/eg;
|
||
|
|
return $value;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
sub value_encode {
|
||
|
|
my($s) = @_;
|
||
|
|
$s =~ s@&@&@g;
|
||
|
|
$s =~ s@<@<@g;
|
||
|
|
$s =~ s@>@>@g;
|
||
|
|
$s =~ s@\"@"@g;
|
||
|
|
return $s;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
sub load_data {
|
||
|
|
$tree2 = $form{'tree2'};
|
||
|
|
if( $tree2 ne '' ){
|
||
|
|
require "$tree2/treedata.pl";
|
||
|
|
$td2 = {};
|
||
|
|
$td2->{name} = $tree2;
|
||
|
|
$td2->{cvs_module} = $cvs_module;
|
||
|
|
$td2->{cvs_branch} = $cvs_branch;
|
||
|
|
$td2->{num} = 1;
|
||
|
|
if( $cvs_root eq '' ){
|
||
|
|
$cvs_root = '/m/src';
|
||
|
|
}
|
||
|
|
$td2->{cvs_root} = $cvs_root;
|
||
|
|
|
||
|
|
$tree = $form{'tree'};
|
||
|
|
require "$tree/treedata.pl";
|
||
|
|
if( $cvs_root eq '' ){
|
||
|
|
$cvs_root = '/m/src';
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
$tree = $form{'tree'};
|
||
|
|
|
||
|
|
die "the \"tree\" parameter must be provided\n" unless $tree;
|
||
|
|
|
||
|
|
require "$tree/treedata.pl";
|
||
|
|
$td1 = {};
|
||
|
|
$td1->{name} = $tree;
|
||
|
|
$td1->{num} = 0;
|
||
|
|
$td1->{cvs_module} = $cvs_module;
|
||
|
|
$td1->{cvs_branch} = $cvs_branch;
|
||
|
|
if( $cvs_root eq '' ){
|
||
|
|
$cvs_root = '/m/src';
|
||
|
|
}
|
||
|
|
$td1->{cvs_root} = $cvs_root;
|
||
|
|
|
||
|
|
&lock;
|
||
|
|
&load_buildlog;
|
||
|
|
&unlock;
|
||
|
|
|
||
|
|
&get_build_name_index;
|
||
|
|
&get_build_time_index;
|
||
|
|
|
||
|
|
&load_who($who_list, $td1);
|
||
|
|
if( $tree2 ne "" ){
|
||
|
|
&load_who($who_list2, $td2);
|
||
|
|
}
|
||
|
|
|
||
|
|
&make_build_table;
|
||
|
|
}
|
||
|
|
|
||
|
|
sub load_buildlog {
|
||
|
|
local($mailtime, $buildtime, $buildname, $errorparser, $buildstatus, $logfile,$binaryname);
|
||
|
|
local($buildrec, @treelist, $t);
|
||
|
|
|
||
|
|
if( $tree2 ne '' ){
|
||
|
|
@treelist = ($td1, $td2);
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
@treelist = ($td1);
|
||
|
|
}
|
||
|
|
|
||
|
|
for $t (@treelist) {
|
||
|
|
open(BUILDLOG, "<$t->{name}/build.dat" );
|
||
|
|
while( <BUILDLOG> ){
|
||
|
|
chop;
|
||
|
|
($mailtime, $buildtime, $buildname, $errorparser, $buildstatus, $logfile, $binaryname) =
|
||
|
|
split( /\|/ );
|
||
|
|
|
||
|
|
|
||
|
|
$buildrec = {
|
||
|
|
mailtime => $mailtime,
|
||
|
|
buildtime => $buildtime,
|
||
|
|
buildname => ($tree2 ne "" ? $t->{name} . " " : "" ) . $buildname,
|
||
|
|
errorparser => $errorparser,
|
||
|
|
buildstatus => $buildstatus,
|
||
|
|
logfile => $logfile,
|
||
|
|
binaryname => $binaryname,
|
||
|
|
td => $t
|
||
|
|
};
|
||
|
|
if( $mailtime > 0 && $buildtime > $mindate ){
|
||
|
|
push @{$build_list}, $buildrec;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
close( BUILDLOG );
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
sub load_who {
|
||
|
|
local( $who_list, $td ) = @_;
|
||
|
|
local($d,$w,$i,$bfound);
|
||
|
|
|
||
|
|
open(WHOLOG, "<$td->{name}/who.dat" );
|
||
|
|
while( <WHOLOG> ){
|
||
|
|
$i = $time_count;
|
||
|
|
chop;
|
||
|
|
($d,$w) = split(/\|/);
|
||
|
|
$bfound = 0;
|
||
|
|
while( $i > 0 && !$bfound ){
|
||
|
|
if( $d <= $build_time_times->[$i] ){
|
||
|
|
|
||
|
|
$who_list->[$i+1]->{$w} = 1;
|
||
|
|
$bfound = 1;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
$i--;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
#
|
||
|
|
# Ignore the last one
|
||
|
|
#
|
||
|
|
if( $time_count > 0 ){
|
||
|
|
$who_list->[$time_count] = {};
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
sub get_build_name_index {
|
||
|
|
local($i,$br);
|
||
|
|
|
||
|
|
#
|
||
|
|
# Get all the unique build names.
|
||
|
|
#
|
||
|
|
for $br (@{$build_list}) {
|
||
|
|
$build_name_index->{$br->{buildname}} = 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
$i = 1;
|
||
|
|
for $n (sort keys (%{$build_name_index})) {
|
||
|
|
$build_name_names->[$i] = $n;
|
||
|
|
$i++;
|
||
|
|
}
|
||
|
|
|
||
|
|
$name_count = @{$build_name_names}-1;
|
||
|
|
|
||
|
|
|
||
|
|
#
|
||
|
|
# update the map so it points to the right index
|
||
|
|
#
|
||
|
|
$i = 1;
|
||
|
|
while( $i < $name_count+1 ){
|
||
|
|
$build_name_index->{$build_name_names->[$i]} = $i;
|
||
|
|
#print "$name_count $build_name_names->[$i] $i <br>\n";
|
||
|
|
$i++;
|
||
|
|
}
|
||
|
|
|
||
|
|
#for $i (@{$build_name_names}) {
|
||
|
|
# print "$build_name_names->[$i] $i <br>\n";
|
||
|
|
#&}
|
||
|
|
}
|
||
|
|
|
||
|
|
sub get_build_time_index {
|
||
|
|
local($i,$br);
|
||
|
|
|
||
|
|
#
|
||
|
|
# Get all the unique build names.
|
||
|
|
#
|
||
|
|
for $br (@{$build_list}) {
|
||
|
|
$build_time_index->{$br->{buildtime}} = 1;
|
||
|
|
#$build_time_index->{$br->{mailtime}} = 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
$i = 1;
|
||
|
|
for $n (sort {$b <=> $a} keys (%{$build_time_index})) {
|
||
|
|
$build_time_times->[$i] = $n;
|
||
|
|
$i++;
|
||
|
|
}
|
||
|
|
|
||
|
|
$time_count = @{$build_time_times}-1;
|
||
|
|
|
||
|
|
|
||
|
|
#
|
||
|
|
# update the map so it points to the right index
|
||
|
|
#
|
||
|
|
$i = 1;
|
||
|
|
while( $i < $time_count+1 ){
|
||
|
|
$build_time_index->{$build_time_times->[$i]} = $i;
|
||
|
|
$i++;
|
||
|
|
}
|
||
|
|
|
||
|
|
#for $i (@{$build_time_times}) {
|
||
|
|
# print $i . "\n";
|
||
|
|
#}
|
||
|
|
|
||
|
|
#while( ($k,$v) = each(%{$build_time_index})) {
|
||
|
|
# print "$k=$v\n";
|
||
|
|
#}
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
sub make_build_table {
|
||
|
|
local($i,$ti,$bi,$ti1,$br);
|
||
|
|
$i = 1;
|
||
|
|
|
||
|
|
#
|
||
|
|
# Create the build table
|
||
|
|
#
|
||
|
|
while( $i <= $time_count ){
|
||
|
|
$build_table->[$i] = [];
|
||
|
|
$i++;
|
||
|
|
}
|
||
|
|
|
||
|
|
#
|
||
|
|
# Populate the build table with build data
|
||
|
|
#
|
||
|
|
for $br (@{$build_list}) {
|
||
|
|
$ti = $build_time_index->{$br->{buildtime}};
|
||
|
|
$bi = $build_name_index->{$br->{buildname}};
|
||
|
|
$build_table->[$ti][$bi] = $br;
|
||
|
|
}
|
||
|
|
|
||
|
|
&load_notes;
|
||
|
|
|
||
|
|
$bi = $name_count;
|
||
|
|
while( $bi > 0 ){
|
||
|
|
$ti = $time_count;
|
||
|
|
while( $ti > 0 ){
|
||
|
|
if( defined( $br = $build_table->[$ti][$bi] )
|
||
|
|
&& !defined( $br->{rowspan} )
|
||
|
|
){
|
||
|
|
#
|
||
|
|
# If the cell immediatley after us is defined, then we
|
||
|
|
# can have a previousbuildtime.
|
||
|
|
#
|
||
|
|
if( defined( $br1 = $build_table->[$ti+1][$bi] )){
|
||
|
|
$br->{previousbuildtime} = $br1->{buildtime};
|
||
|
|
}
|
||
|
|
|
||
|
|
$ti1 = $ti-1;
|
||
|
|
while( $ti1 > 0
|
||
|
|
&& !defined( $build_table->[$ti1][$bi] )
|
||
|
|
#&& $build_time_times->[$ti1] < $br->{mailtime}
|
||
|
|
){
|
||
|
|
$build_table->[$ti1][$bi] = -1;
|
||
|
|
$ti1--;
|
||
|
|
}
|
||
|
|
$br->{rowspan} = $ti - $ti1;
|
||
|
|
if( $br->{rowspan} != 1 ){
|
||
|
|
$build_table->[$ti1+1][$bi] = $br;
|
||
|
|
$build_table->[$ti][$bi] = -1;
|
||
|
|
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
$ti--;
|
||
|
|
}
|
||
|
|
$bi--;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
sub load_notes {
|
||
|
|
if( $tree2 ne '' ){
|
||
|
|
@treelist = ($td1, $td2);
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
@treelist = ($td1);
|
||
|
|
}
|
||
|
|
|
||
|
|
for $t (@treelist) {
|
||
|
|
open(NOTES,"<$t->{name}/notes.txt") || print "<h2>warning: Couldn't open $t->{name}/notes.txt </h2>\n";
|
||
|
|
while(<NOTES>){
|
||
|
|
chop;
|
||
|
|
($nbuildtime,$nbuildname,$nwho,$nnow,$nenc_note) = split(/\|/);
|
||
|
|
if( $tree2 ne "" ) { $nbuildname = $t->{name} . " " . $nbuildname; }
|
||
|
|
$ti = $build_time_index->{$nbuildtime};
|
||
|
|
$bi = $build_name_index->{$nbuildname};
|
||
|
|
#print "[ti = $ti][bi=$bi][buildname='$nbuildname' $_<br>";
|
||
|
|
if( $ti != 0 && $bi != 0 ){
|
||
|
|
$build_table->[$ti][$bi]->{hasnote} = 1;
|
||
|
|
if( ! defined($build_table->[$ti][$bi]->{noteid}) ){
|
||
|
|
$build_table->[$ti][$bi]->{noteid} = (0+@note_array);
|
||
|
|
}
|
||
|
|
$noteid = $build_table->[$ti][$bi]->{noteid};
|
||
|
|
$now_str = &print_time($nnow);
|
||
|
|
$note = &url_decode($nenc_note);
|
||
|
|
$note_array[$noteid] .=
|
||
|
|
"<pre>\n[<b><a href=mailto:$nwho>$nwho</a> - $now_str</b>]\n$note\n</pre>";
|
||
|
|
}
|
||
|
|
}
|
||
|
|
close(NOTES);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
sub last_good_time {
|
||
|
|
local($row) = @_;
|
||
|
|
local($t,$currently_busted);
|
||
|
|
|
||
|
|
$t = 1;
|
||
|
|
$isbusted = 0;
|
||
|
|
while( $t <= $time_count ){
|
||
|
|
if( defined( $build_table->[$t][$row] )){
|
||
|
|
if( $build_table->[$t][$row]->{buildstatus} eq 'success' ){
|
||
|
|
return {
|
||
|
|
buildtime =>
|
||
|
|
$build_time_times->[ $t +
|
||
|
|
$build_table->[$t][$row]->{rowspan} ],
|
||
|
|
isbusted => $isbusted };
|
||
|
|
}
|
||
|
|
elsif( $build_table->[$t][$row]->{buildstatus} eq 'busted' ){
|
||
|
|
$isbusted = 1;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
}
|
||
|
|
}
|
||
|
|
$t++;
|
||
|
|
}
|
||
|
|
return {buildtime => 0, isbusted => 1};
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
sub check_password {
|
||
|
|
if ($form{'password'} eq "") {
|
||
|
|
if (defined $cookie_jar{'tinderbox_password'}) {
|
||
|
|
$form{'password'} = $cookie_jar{'tinderbox_password'};
|
||
|
|
}
|
||
|
|
}
|
||
|
|
my $correct = "";
|
||
|
|
if (open(REAL, "<data/passwd")) {
|
||
|
|
$correct = <REAL>;
|
||
|
|
close REAL;
|
||
|
|
$correct =~ s/\s+$//; # Strip trailing whitespace.
|
||
|
|
}
|
||
|
|
if ($correct eq "") {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
$form{'password'} =~ s/\s+$//; # Strip trailing whitespace.
|
||
|
|
if ($form{'password'} ne "") {
|
||
|
|
open(TRAPDOOR, "../bonsai/data/trapdoor $form{'password'} |") || die "Can't run trapdoor func!";
|
||
|
|
my $encoded = <TRAPDOOR>;
|
||
|
|
close TRAPDOOR;
|
||
|
|
$encoded =~ s/\s+$//; # Strip trailing whitespace.
|
||
|
|
if ($encoded eq $correct) {
|
||
|
|
if ($form{'rememberpassword'} ne "") {
|
||
|
|
print "Set-Cookie: tinderbox_password=$form{'password'} ; path=/ ; expires = Sun, 1-Mar-2020 00:00:00 GMT\n";
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
require 'header.pl';
|
||
|
|
|
||
|
|
print "Content-type: text/html\n";
|
||
|
|
print "Set-Cookie: tinderbox_password= ; path=/ ; expires = Sun, 1-Mar-2020 00:00:00 GMT\n";
|
||
|
|
print "\n";
|
||
|
|
|
||
|
|
EmitHtmlHeader("What's the magic word?",
|
||
|
|
"You need to know the magic word to use this page.");
|
||
|
|
|
||
|
|
if ($form{'password'} ne "") {
|
||
|
|
print "<B>Invalid password; try again.<BR></B>";
|
||
|
|
}
|
||
|
|
print "
|
||
|
|
<FORM method=post>
|
||
|
|
<B>Password:</B>
|
||
|
|
<INPUT NAME=password TYPE=password><BR>
|
||
|
|
<INPUT NAME=rememberpassword TYPE=checkbox> If correct, remember password as a cookie<BR>
|
||
|
|
";
|
||
|
|
|
||
|
|
while (my ($key,$value) = each %form) {
|
||
|
|
if ($key eq "password" || $key eq "rememberpassword") {
|
||
|
|
next;
|
||
|
|
}
|
||
|
|
my $enc = value_encode($value);
|
||
|
|
print "<INPUT TYPE=HIDDEN NAME=$key VALUE=\"$enc\">\n";
|
||
|
|
}
|
||
|
|
print "<INPUT TYPE=SUBMIT value=Submit></FORM>\n";
|
||
|
|
exit;
|
||
|
|
}
|