qf/quakeforge
0
0
Fork 0
mirror of https://git.code.sf.net/p/quake/quakeforge synced 2024-11-27 14:42:07 +00:00
Code Issues Projects Releases Packages Wiki Activity
9050 commits 17 branches 20 tags 29 MiB
Commit graph

514 commits

Author SHA1 Message Date
Bill Currie
2b2ea5c9b3 Compute dags as part of data flow analysis. 
I want to use the live variable information when building the dags.
 2012-11-15 13:44:08 +09:00
Bill Currie
c358a0e77e Create a function to generalize dot dumping. 
Now, any time a graph is wanted, the file can be consistently named without
a lot of messy code.
 2012-11-15 13:44:08 +09:00
Bill Currie
9f409b1ac4 Rename make_dag to dag_create. 2012-11-15 13:44:08 +09:00
Bill Currie
cd224c00d4 Add live variable info to flow graph dumps. 
Things are a little bogus, but at least the bogosity is visible :)
 2012-11-15 13:44:08 +09:00
Bill Currie
4b64912793 Begin doing some data flow analysis. 
In te beginning, live variables.
 2012-11-15 13:44:08 +09:00
Bill Currie
c00e666668 Expose find_operands. 
It has proven to be a generally useful function, not just for dags.
 2012-11-15 13:44:08 +09:00
Bill Currie
0a2ce6d381 Fix some doxygen comments. 2012-11-15 13:44:08 +09:00
Bill Currie
0b49bd343c Collect information on statements that set or use vars. 
First, it turns out using daglabels wasn't such a workable plan (due to
labels being flushed every sblock). Instead, flowvars are used. Each actual
variable (whether normal or temp) has a pointer to the flowvar attached to
that variable.

For each variable, the statements that use or define the variable are
recorded in the appropriate set attached to each (flow)variable.
 2012-11-15 13:44:08 +09:00
Bill Currie
acedc65de1 Make an array of statements for the function. 
With this, sets can be used to represent statements.
 2012-11-15 13:44:07 +09:00
Bill Currie
98245f6d00 Bury a dead field. 2012-11-15 13:44:07 +09:00
Bill Currie
8844ac61a2 Rename dump_flow to dump_sblock and move to dot_sblock.c 2012-11-15 13:44:07 +09:00
Bill Currie
acde6ca0a0 Handle jumpb statements in dot_sblock and flow graphs. 2012-11-15 13:44:07 +09:00
Bill Currie
ffa08a99c2 Store the initializer expression in the def. 
Initially, this will be used for collecting the targets of a jumpb
instruction.
 2012-11-15 13:44:07 +09:00
Bill Currie
d7177a78e9 Rewrite the flow graph code. 
The flow graph nodes are now properly separated from the graph, and edge
information is stored in the graph struct. This actually made for much
cleaner code (partly thanks to the use of sets and set iterators).

Flow graph reduction has been (temporarily) ripped out as the entire
approach was wrong. There was also a bug in that I didn't really understand
the dragon book about selecting nodes and thus messed things up. The
depth-first search tree "fixed" the problem, but was really the wrong
solution (sledge hammer :P).

Also, now that I understand that dot's directed graphs must be acyclic, I
now have much better control over the graphs (back edges need to be
flipped).
 2012-11-15 13:44:07 +09:00
Bill Currie
b9599a7119 Better set memory management. 
At the cost of one pointer per set, sets can now be allocated and freed
more efficiently (especially since malloc might round things up).
 2012-11-15 13:44:07 +09:00
Bill Currie
2385cf65c2 Rename setstate_t to set_iter_t. 
After all, it is an iterator :).
 2012-11-15 13:44:07 +09:00
Bill Currie
8c5a2b3d11 Implement depth-first searching for flow graphs. 
This fixes the bogusly irreducible graphs.
 2012-11-15 13:44:07 +09:00
Bill Currie
53622dbb99 Perform graph reduction on the function's flow graph. 
The reduction is performed itteratively until the graph is irreducible, but
such that each reduction wraps the previous graph. Unfortunately, due
depth-first searching not being implemented, graphs that should be reduced
(ie, those with natural loops).
 2012-11-15 13:44:07 +09:00
Bill Currie
388b6e6e8f Add set_size (). 
Return the number of members in the set.
 2012-11-15 13:44:07 +09:00
Bill Currie
8567508963 Rewrite set_first() and add set_next(). 
set_first() now returns a pointer to a setstate_t struct that holds the
state necessary for scanning a set. set_next() will automatically delete
the state block when the end of the set is reached. set_delstate() is also
provided to allow early termination of the scan.
 2012-11-15 13:44:07 +09:00
Bill Currie
2da038ce0f Bring back dot_flow.c. 
However, it produces simplified flow graphs (ie, just nodes and edges, no
statements, though later on data flow information will be added).
 2012-11-15 13:44:07 +09:00
Bill Currie
8b374305d2 Rename dot_flow.c and print_flow. 
They're now dot_sblock.c and print_sblock. The new names both better
reflect their purpose and free up "flow" for outputting the real flow
analysis graphs.
 2012-11-15 13:44:07 +09:00
Bill Currie
c483770121 Rework flow.c with the aim of graph reduction. 
Much of the data recently added to sblock_t has been moved to flownode_t.
No graph reduction is carried out yet, but the initial (innermost level)
graph has been built.
 2012-11-15 13:44:07 +09:00
Bill Currie
da446fd343 Detect natural loops. 
Non-nested loops that have the same head-node are merged into one loop.
However, loop nesting is not currently detected (next step).
 2012-11-15 13:44:07 +09:00
Bill Currie
8fb958603c Add set_first. 
It returns the first element of a set. If the set is empty, -1 (unsigned)
is returned.
 2012-11-15 13:44:07 +09:00
Bill Currie
1fead50f4e Calculate the dominators of each node in the flow graph. 
The dominators are represented by sets using the node numbers.
 2012-11-15 13:44:07 +09:00
Bill Currie
964ea7f9fe Add set_as_string for debug output. 2012-11-15 13:44:07 +09:00
Bill Currie
7853bf1859 Calculate a node's successors and predecessors. 
The dot graphs are a little odd (arrow heads on the wrong end of the
predecessor edges), but things seem to be correct.
 2012-11-15 13:44:06 +09:00
Bill Currie
739ebc522c Begin working on flow analysis. 
For now, variable and flow graph node maps are built.
 2012-11-15 13:44:06 +09:00
Bill Currie
f30010b367 Add some docs to function.h 2012-11-15 13:44:06 +09:00
Bill Currie
cdc790d0c8 Add a set type and support code. 2012-11-15 13:44:06 +09:00
Bill Currie
dc9d2a982e Make the returned dag a linked list of root-nodes. 
A dag can have mulitple "root" nodes (ie, nodes with no parents).
 2012-11-15 13:44:06 +09:00
Bill Currie
a22260030a Use value for pointer operands. 
This allows daglabels on pointer operands without a redundant daglabel
pointer.
 2012-11-15 13:44:06 +09:00
Bill Currie
0c58cd9067 Generate only one daglabel for value operands. 
As each value is now unique, their labels can also be unique, which will
improve CSE.
 2012-11-15 13:44:06 +09:00
Bill Currie
0ccf4093e4 Handle attached identifier labels correctly. 
I'd forgotten I had the prev field. Makes for much cleaner code.
 2012-11-15 13:44:06 +09:00
Bill Currie
28ce35f1c1 Make values independent objects. 
values are now uniquely allocated (for the current object file). With
this, constants in dags will work.
 2012-11-15 13:44:06 +09:00
Bill Currie
dbf1aa8f72 Attach dags to statement blocks. 
Now, if a dag is attached to a statement block, it will be included in the
flowgraph with that statement block.
 2012-11-15 13:44:06 +09:00
Bill Currie
d9354255a3 Avoid double-printing dag nodes. 2012-11-15 13:44:05 +09:00
Bill Currie
7b2e426545 Support temp operands in dags. 2012-11-15 13:44:05 +09:00
Bill Currie
8015e1b1e9 Put the dags stuff into a qfcc sub-section. 
Not much point writting docs if they can't be found.
 2012-11-15 13:44:05 +09:00
Bill Currie
aa2943709e Start work on building dags from basic blocks. 
Doesn't compile and the design is in flux anyway, but I want to get back to
iqm.
 2012-11-15 13:44:05 +09:00
Bill Currie
60108c688c Change dags from binary to trinary. 
I'd forgotten some instructions take three inputs that can benefit from
CSE.
 2012-11-15 13:44:05 +09:00
Bill Currie
0fefeb73fe Initial support for basic block dags. 
Currently, only dumping to dot, but that seems to be a very sensible place
to start: debug support.
 2012-11-15 13:44:05 +09:00
Bill Currie
d5c831b6da Add a little test case for accessing types. 
Using ruamoko to access ruamoko type encodings is actually quite pleasant
:)
 2012-11-15 13:40:11 +09:00
Bill Currie
552142497e Support progs.dat when dumping type encodings. 
Knock up a quick and dirty progs-to-qfo "converter" (strings and types
only) to re-use the qfo types dumper.
 2012-11-15 11:58:13 +09:00
Bill Currie
9691b50f0f Make .type_encodings more useful. 
Rather than just a pointer, it is now a struct with a pointer and size
indicating the extent of the type encodings block.
 2012-11-15 11:57:16 +09:00
Bill Currie
453ac11bc3 Correct some comments. 2012-11-14 17:13:14 +09:00
Bill Currie
e05c12e16d Make linker_add_def take a pointer for the value. 
While it looks like I might not use it for the type encodings, it should be
useful in the future.
 2012-11-14 13:12:58 +09:00
Bill Currie
5b7b49b100 Add a QFO_TYPE macro to get a qfot_type_t pointer. 
In the end, it wasn't used, but it could be handy in the future.
 2012-11-13 21:45:54 +09:00
Bill Currie
93b007b1f8 Take care of relocs when defining external defs. 
For most of the cases, some relocs may have been lost, but they were
certainly lost for type encodings. Now that all seems to be fixed.
 2012-11-12 16:14:09 +09:00