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
|
% make-c-code.red
%**************************************************************************
%* Copyright (C) 2010, Codemist Ltd. A C Norman *
%* *
%* Redistribution and use in source and binary forms, with or without *
%* modification, are permitted provided that the following conditions are *
%* met: *
%* *
%* * Redistributions of source code must retain the relevant *
%* copyright notice, this list of conditions and the following *
%* disclaimer. *
%* * Redistributions in binary form must reproduce the above *
%* copyright notice, this list of conditions and the following *
%* disclaimer in the documentation and/or other materials provided *
%* with the distribution. *
%* *
%* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS *
%* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT *
%* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS *
%* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE *
%* COPYRIGHT OWNERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, *
%* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, *
%* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS *
%* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND *
%* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR *
%* TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF *
%* THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH *
%* DAMAGE. *
%*************************************************************************/
on echo;
% This file can be run to turn bits of the REDUCE source code
% into C so that this C can be compiled and linked in to make a
% customised CSL executable that will red REDUCE faster.
%
% Run this using bootstrapreduce.img to select code to compile into C.
% The functions to be compiled are extracted from a file "profile.dat"
% that was created by "profile.red".
%
% I will also allow for a file "unprofile.dat" that can be used to provide
% extra help with modules where the module maintainer is unable to provide
% test cases that generate reliable profile date.
%
% If full_c_code is defined then rather than paying much attention
% to profile.dat it attempts to compile everything into C! Note that
% this capability causes BUGS to surface at present (I will remove this
% comment when I believe I have got past that state!) so it is just
% for hackers and experimenters.
symbolic;
% Three major parameters are available:
%
% fnames a list of files to create. Making the list longer (or
% shorter) changes the amount of C that can be created.
% The CSL source code has to know how many there are, and
% its current default is for 12 files.
%
% size_per_file
% this guides the compiler about how much to put in each
% generated file, where the value 7000 results in each
% file of generated C being in the range 120 to 150 Kbytes.
%
% force_count indicates how many functions from alg.tst statistics should
% be included before anything else. The idea for this is
% rooted in old days when alg.tst was *THE* Reduce test and
% overall performance was often judged solely on how well
% it ran. I will now make the value of force_count rather
% small so as not to perturb more globally rational profile-
% based judgements! But in fact most of the things that are
% heavily used in alg.tst are used elswehere. I suspect that
% these days the only exceptions will be the high energy
% physics stuff.
%
%
% Also if "how_many" is set then this will limit the total number of
% functions that are compiled into C. Since I expect to pass that via a
% command line "-dhow_many=362" etc I allow for it being a string
% not a number to start with. In ordinary circumstances this will not be
% used, however it has proved INVALUABLE when tracking down cases where
% compilation into C causes changes in behaviour... how_many can be used
% with a binary-chop selection process to discover exactly which function
% causes upset when compiled into C. Of course in release quality code I
% hope there are no such cases!
global '(fnames size_per_file force_count how_many everything);
if boundp 'full_c_code then everything := t
else everything := nil;
fnames := '( "u01" "u02" "u03" "u04"
"u05" "u06" "u07" "u08" "u09"
"u10" "u11" "u12" "u13" "u14"
"u15" "u16" "u17" "u18" "u19"
"u20" "u21" "u22" "u23" "u24"
"u25" "u26" "u27" "u28" "u29"
"u30" "u31" "u32" "u33" "u34"
"u35" "u36" "u37" "u38" "u39"
"u40" "u41" "u42" "u43" "u44"
"u45" "u46" "u47" "u48" "u49"
"u50" "u51" "u52" "u53" "u54"
"u55" "u56" "u57" "u58" "u59"
"u60"
);
if boundp 'size_per_file and
numberp (cx := compress explodec size_per_file) and
cx > 100 and cx < 200000 then size_per_file := cx
else if everything then size_per_file := 60000
else size_per_file := 7000;
<< terpri(); princ "size_per_file = "; print size_per_file; nil >>;
% At the time of writing these are the top 5 functions used by alg.tst
%
% (noncomp 363494365036146324 11 285540)
% (simpcar 1247942846384282646 7 167232)
% (reval 607148151428708743 8 186615)
% (terminalp 570814658694331872 12 229779)
% (delcp 2216652391477548477 8 131682)
force_count := 5;
% You may well ask "what is it with the number 3500 here". Well that sets
% a default number of functions to be compiled into C that matches the
% number I used historically, and hence it provides a safe level of
% continuity. You may experiment with
% make c-code how_many=nnnn
% and do so either to see how the speed/space tradeoff goes or because you
% are ocncerned about a possible bug in the Lisp to C compilation step. My
% current measurements suggest that 3500 gives reasonable trade off for
% build of the executable vs. performance. However for use with an embedded
% system with limited memort I might suggest say 500.
if not boundp 'how_many then how_many := 3500
else << how_many := compress explodec how_many;
if not numberp how_many then how_many := 3500 >>;
<< terpri(); princ "how_many = "; print how_many; nil >>;
global '(omitted at_start at_end);
% At any stage there may be some things that I must not even try to compile
% into C because of bugs or limitations. I can list them here.
omitted := '(
s!:prinl0 % uses unwind-protect
prinl % Ha ha - this being turned into C makes it seem
% available before it really is!
compile!-file!* % &optional
s!:compile!-file!* % &optional
fetch!-url % &optional
begin % bootstrapping issue
module2!-to!-file % ditto
olderfaslp % ditto (some time I will investigate and
% maybe fix these "bootstrapping" issues...
package!-remake2 % ditto
update!-fasl2 % ditto
upd!-fasl1 % ditto
update_prompt % ditto
linelength % horrid use of copyd etc in tmprint.red
setpchar % horrid use of copyd.. also in tmprint.red
ordp % redefined in helphy/noncom2 and spde/spde
unit % name conflict.
pasf_bapprox % Unknown issue!
divdm %
gck2 %
!:recip %
cr!:minus %
typerr % typerr and symerr are defined in makereduce.lsp
symerr % but there are slightly versions elsewhere.
fluid % the env cells of these get out of step during..
global % a bootstrap build if they are compiled here.
);
% There is a bit of a mess-up if something that has been given an autoload
% stub gets compiled into C so I will try to identify any such and mark
% them as unsuitable for compilation.
for each x in oblist() do
if eqcar(d := getd(x), 'expr) and
consp cdr d and consp cddr d and consp cdddr d then <<
d := cadddr d;
if eqcar(d, 'progn) and cdr d and eqcar(cadr d, 'load!-package) then <<
princ "+++ "; prin x; printc " looks like an autoload stub. Omit here";
omitted := x . omitted >> >>;
at_start := '(
);
at_end := '(
);
on comp;
load!-module 'remake;
% Here I need to consider the issue of patches. First consider patches that
% had been in force when "profile.red" was run. In such cases a patched
% function f1 has an associated replacement f1_123456789 (the numeric suffix
% is a checksum on the new definition) and when the profile job was run
% this replacement will have had its definition copied to f1. The way in
% which CSL's mapstore function extracts counts will mean that the
% thing in profile.dat relate to f1_123456789.
% Usually things in profile.dat are in the form
% (function_name . checksum_of_definition)
% but for these patched things I will instead record
% (original_function_name package_involved)
% This can be distinguished because it has a symbol not a number as
% the second component. To make this possible each patch function
% f1_123456789 would have to have this information attached to it
% when the profiling job was run.
%
% But I suppose have now obtained a newer version of the patches file. So
% now the correct patch for f1 will be f1_abcdef. If f1 was in one of the
% REDUCE core packages (eg "alg") then both the functions f1_123456789 and
% f1_abcdef will be in memory now, but it will be the latter that will
% have been copied to plain old f1. In other cases f1_123456789 will now
% have been totally lost and the definition of f1_abcdef will be in the
% patches module. Furthermore the new patches file may patch another
% function f2 that had not previously been subject to patching, but
% that had been selected for compilation into C. And in a truly bad
% case the complete REDUCE sources will contain several functions named
% f2 and of course the patches file identifies which one it is interested
% in by the name of the package it is in.
%
% The response to all this I will use here is intended to make life
% reasonably SIMPLE for me in a complicated situation. So I first
% collect the set of names that I think need compiling into C. Then I
% grab a list of the names of things defined in the current patches file.
% If a function in the paches file has a name similar enough (!) to one that
% I have already decided to compile into C then I will schedule it for
% compilation into C too. Because of the hash suffix added to names in the
% patches file defining a C version having those things present in the Lisp
% kernel should never be a problem - after all the patches file itself is
% intended to be loaded all the time. So the main down-side of this is
% that I will sometimes find that I have compiled into C either patch
% versions of a function when it was another version of that code that was
% time-critical or that I have compiled into C two generations of
% patch function. These waste opportunity and space by having some
% things compiled into C that might not really justify that, but this
% seems a modest cost.
% Note that parts of the above may apply if the sources of REDUCE are
% changed in ANY manner (not just a special patches file) but the C code
% is not re-created.
fluid '(w_reduce requests);
w_reduce := requests := nil;
% I make a list of all the functions that profile data suggests that
% I should compile into C. The master copy of the profile data is
% usually expected to be in "$destdir".
symbolic procedure read_profile_data file;
begin
scalar w0, w1;
if not errorp(w0 := errorset(list('open, file, ''input), nil, nil)) then <<
w0 := rds car w0;
while not errorp (w1 := errorset('(read), nil, nil)) and
not eqcar(w1, !$eof!$) do <<
requests := car w1 . requests;
princ "Use data for "; print caar w1 >>;
% The data structure read in here will be of the form
% ((module-name f-name1 f_name2 ...) (module-name ...) ...)
% where within each module the requested functions have been listed in
% order of priority.
close rds w0 >>
end;
off echo;
read_profile_data "$destdir/profile.dat";
read_profile_data "$destdir/unprofile.dat";
on echo;
if not everything then <<
% As a fairly shameless hack I am going to insist on compiling ALL the
% things that the "alg" test uses. That is because this one test
% file has been used for many years to give a single performance
% figure for REDUCE. In fact it is not too bad to pay lots of
% attention to it since it exercises the basic core algebra and so what is
% good for it is good for quite a lot of everybody else. However by
% tuning this selection process you can adjust the way REDUCE balances
% its speed in different application areas.
w_reduce := assoc('alg, requests)$
requests := for each x in delete(w_reduce, requests) collect cdr x$
w_reduce := reverse cdr w_reduce$
d := length w_reduce - force_count;
if d > 0 then for i := 1:d do w_reduce := cdr w_reduce;
length w_reduce;
% Now I will merge in suggestions from all other modules in
% breadth-first order of priority
% Ie if I have modules A, B, C and D (with A=alg) and each has in it
% functions a1, a2, a3 ... (in priority odder) then I will make up a list
% here that goes
%
% a1 a2 a3 ... an b1 c1 d2 b2 c2 d2 b3 c3 d3 b4 c4 d4 ...
%
% so that the first n items from A get priority and after that B, C and D
% will get about balanced treatment if I have to truncate the list at
% some stage.
symbolic procedure membercar(a, l);
if null l then nil
else if a = caar l then t
else membercar(a, cdr l);
fg := t;
while fg do <<
fg := nil;
for each x on requests do
if car x then <<
if k := assoc(caaar x, w_reduce) then <<
if not (cadr k = cadaar x) then <<
prin caaar x; printc " has multiple definition";
princ " keep version with checksum: "; print cadr k;
princ " ignore: "; print cadaar x;
terpri() >> >>
% ORDP is a special case because I have put a version of it into the
% CSL kernel by hand, and any redefinition here would be unfriendly and
% might clash with that.
else if caaar x = 'ordp then printc "Ignoring ORDP (!)"
else w_reduce := caar x . w_reduce;
fg := t;
rplaca(x, cdar x) >> >>;
% Now I scan all pre-compiled modules to recover source versions of the
% selected REDUCE functions. The values put as load!-source properties
% are checksums of the recovered definitions that I would be prepared
% to accept.
for each n in w_reduce do put(car n, 'load!-source, cdr n);
w_reduce := for each n in w_reduce collect car n$
% Discard things that give trouble...
for each x in omitted do w_reduce := delete(x, w_reduce);
% Compile some specific things first and others last. The ability to
% override the normal priority order may be useful when I want to
% force-compile some functions for testing purposes.
for each x in append(at_start, at_end) do <<
prin x; princ " "; print get(x, '!*savedef) >>;
w_reduce := append(at_start, append(nreverse w_reduce, at_end))$
for each m in library!-members() do load!-source m;
% Up through Reduce 3.8 there was a mechanism for distributing patches
% that could be installed to correct or upgrade a base version. In the
% Open Source model it seems way easiest for people to fetch or build
% a full new image, and so I am not going to deal with patches any more.
>>;
if everything then <<
% load!-source being true causes a !*savedef to be loaded for every function
% in the module. Without it a definition only gets picked up if a load!-source
% property has been set on the name.
load!-source := t;
for each m in library!-members() do load!-source m;
% Hah but I really want the core versions of anything that might get redefined
% to be the one left - so I will re-load all the core modules!
for each m in loaded!-modules!* do load!-source m;
w_reduce := nil;
for each x in oblist() do
if get(x, '!*savedef) and not memq(x, omitted) then
w_reduce := x . w_reduce;
w_reduce := nreverse w_reduce$ % Now in alphabetic order, which seems neat.
for each x in at_start do w_reduce := delete(x, w_reduce);
for each x in at_end do w_reduce := delete(x, w_reduce);
w_reduce := append(at_start, append(w_reduce, at_end));
>>;
<<
printc "Top 20 things to compile are...";
p := w_reduce;
for i := 1:20 do if p then <<
print car p;
p := cdr p >>
>>;
verbos nil;
global '(rprifn!*);
on fastfor, fastvector, unsafecar;
symbolic procedure listsize(x, n);
if null x then n
else if atom x then n+1
else listsize(cdr x, listsize(car x, n+1));
<<
count := 0;
while fnames do begin
scalar name, bulk;
name := car fnames;
princ "About to create "; printc name;
c!:ccompilestart(name, name, "$destdir", nil);
bulk := 0;
while bulk < size_per_file and w_reduce and how_many > 0 do begin
scalar name, defn;
name := car w_reduce;
if null (defn := get(name, '!*savedef)) then <<
princ "+++ "; prin name;
printc ": no saved definition found";
w_reduce := cdr w_reduce >>
else <<
bulk := listsize(defn, bulk);
if bulk < size_per_file then <<
count := count+1;
princ count;
princ ": ";
c!:ccmpout1 ('de . name . cdr defn);
how_many := how_many - 1;
w_reduce := cdr w_reduce >> >> end;
eval '(c!-end);
fnames := cdr fnames
end;
terpri();
printc "*** End of compilation from REDUCE into C ***";
terpri();
total := count;
bulk := 0;
% I list the next 50 functions that WOULD get selected - just for interest.
if null w_reduce then printc "No more functions need compiling into C"
else while bulk < 50 and w_reduce do
begin
name := car w_reduce;
if null (defn := get(name, '!*savedef)) then <<
princ "+++ "; prin name; printc ": no saved definition found";
w_reduce := cdr w_reduce >>
else <<
bulk := bulk+1;
princ (count := count+1);
princ ": ";
print name;
w_reduce := cdr w_reduce >> end;
terpri();
prin total; printc " functions compiled into C";
nil >>;
quit;
|