| 1 |
adcroft |
1.1 |
BEGIN{MATCH_ROUTINE=0; |
| 2 |
|
|
i=0;nVals=0; |
| 3 |
|
|
while ( getline < "varkey" ) { |
| 4 |
|
|
var[i]=$1; |
| 5 |
|
|
val[i]=$2; |
| 6 |
|
|
++i; |
| 7 |
|
|
nVals=i-1; |
| 8 |
|
|
} |
| 9 |
|
|
print "<HTML>" |
| 10 |
|
|
print "<HEAD>" |
| 11 |
|
|
print "<TITLE>MITgcm Call Tree</TITLE>" |
| 12 |
|
|
print "</HEAD>" |
| 13 |
|
|
print "<BODY leftmargin=0 topmargin=0 marginheight=0 marginwidth=0 bgcolor=#FFFFFF>" |
| 14 |
|
|
while ( getline < "callTree.header" ) { |
| 15 |
|
|
print $0; |
| 16 |
|
|
} |
| 17 |
|
|
print "<PRE>" |
| 18 |
|
|
} |
| 19 |
|
|
/\|-[A-Z,0-9,_]*.*/{ |
| 20 |
|
|
match($0,/\|-[A-Z0-9_]*/); |
| 21 |
|
|
theString=substr($0,RSTART+2,RLENGTH-2); |
| 22 |
|
|
rsString=RSTART; rlString=RLENGTH; |
| 23 |
|
|
nMatch=-1; |
| 24 |
|
|
for ( i=0;i<nVals;++i) { |
| 25 |
|
|
if ( match(var[i],theString) == 1 && length(var[i]) == length(theString) && length(theString) != 0 ) { |
| 26 |
|
|
nMatch=i; |
| 27 |
|
|
break; |
| 28 |
|
|
} |
| 29 |
|
|
} |
| 30 |
|
|
if ( nMatch >= 0 ) { |
| 31 |
|
|
print substr($0,0,rsString)"<A HREF=vdb/names/"val[nMatch]".htm target=codeBrowserWindow>" theString "</A>" substr($0,rsString+rlString,length()); |
| 32 |
|
|
MATCH_ROUTINE=1; |
| 33 |
|
|
} |
| 34 |
|
|
} |
| 35 |
|
|
{ |
| 36 |
|
|
if (MATCH_ROUTINE ==0 ){ print}; |
| 37 |
|
|
MATCH_ROUTINE=0; |
| 38 |
|
|
} |
| 39 |
|
|
END{ |
| 40 |
|
|
print "</PRE>" |
| 41 |
|
|
print "</BODY>" |
| 42 |
|
|
print "</HTML>" |
| 43 |
|
|
} |