projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| 4c872757 DS |
1 | Copyright (c) 1985 Regents of the University of California. |
| 2 | All rights reserved. The Berkeley software License Agreement | |
| 3 | specifies the terms and conditions for redistribution. | |
| 4 | ||
| 5 | @(#)DEBUGS 5.1 (Berkeley) %G% | |
| 6 | ||
| 7 | WHAT THE DEBUG FLAGS MEAN: | |
| 8 | ||
| 9 | Debug flags preceded with an X are first pass flags; the rest are | |
| 10 | second pass flags. | |
| 11 | ||
| 12 | -Xa: Print the actions taken for each operator as parse trees are | |
| 13 | assembled, from buildtree(). | |
| 14 | ||
| 15 | -Xb: Extra information from buildtree() on parse tree assembly. May | |
| 16 | be used to increase the information from -Xa. | |
| 17 | ||
| 18 | -Xd: Print information about declarations, from many places in pftn.c. | |
| 19 | May be repeated to get still more information. | |
| 20 | ||
| 21 | -Xi: Information about initializations, from several places in pftn.c. | |
| 22 | ||
| 23 | -a: From rallo(), print the address of the tree being worked on for | |
| 24 | the purpose of allocating registers, and indicate what this | |
| 25 | tree's requirements have been determined to be. | |
| 26 | ||
| 27 | -e: Print the expression tree at useful places, e.g. when an | |
| 28 | expression appears in the intermediate code file as a | |
| 29 | statement, or just before store() is called in codgen(). | |
| 30 | ||
| 31 | -l: Print line number and file name at the end of every statement. | |
| 32 | ||
| 33 | -o: Print the expression tree when order() is called, and whenever | |
| 34 | the loop in order() takes us to the top after a rewrite. Also | |
| 35 | prints the tree with extra info when a rewrite is forced due | |
| 36 | lack of a matching template. | |
| 37 | ||
| 38 | -r: Identify the register being worked on and what's in it and | |
| 39 | sometimes why it's being worked on, from rfree(), rbusy() and | |
| 40 | reclaim(). | |
| 41 | ||
| 42 | -s: From tshape(), print the address of the given node and the | |
| 43 | shape that it's being tested against. The opcode for the node | |
| 44 | is also printed. | |
| 45 | ||
| 46 | -t: From ttype(), print the node type and the type template which | |
| 47 | the node is being tested against. | |
| 48 | ||
| 49 | -u: Previously used to debug the Sethi-Ullman algorithm, currently | |
| 50 | defunct. | |
| 51 | ||
| 52 | -v: Report on multi-level tree matching. Very verbose. | |
| 53 | ||
| 54 | -x: Prints intermediate code instructions in mainp2(); also used to | |
| 55 | debug zzzcode(), the routine that does specialized template | |
| 56 | interpretation. |