mirror of
https://github.com/open-goal/jak-project
synced 2026-07-31 08:16:02 -04:00
Tyler Wilding
d1ece445d4
Relates to #1353 This adds no new functionality or overhead to the compiler, yet. This is the preliminary work that has: - added code to the compiler in several spots to flag when something is used without being properly required/imported/whatever (disabled by default) - that was used to generate project wide file dependencies (some circulars were manually fixed) - then that graph underwent a transitive reduction and the result was written to all `jak1` source files. The next step will be making this actually produce and use a dependency graph. Some of the reasons why I'm working on this: - eliminates more `game.gp` boilerplate. This includes the `.gd` files to some extent (`*-ag` files and `tpage` files will still need to be handled) this is the point of the new `bundles` form. This should make it even easier to add a new file into the source tree. - a build order that is actually informed from something real and compiler warnings that tell you when you are using something that won't be available at build time. - narrows the search space for doing LSP actions -- like searching for references. Since it would be way too much work to store in the compiler every location where every symbol/function/etc is used, I have to do ad-hoc searches. By having a dependency graph i can significantly reduce that search space. - opens the doors for common shared code with a legitimate pattern. Right now jak 2 shares code from the jak 1 folder. This is basically a hack -- but by having an explicit require syntax, it would be possible to reference arbitrary file paths, such as a `common` folder. Some stats: - Jak 1 has about 2500 edges between files, including transitives - With transitives reduced at the source code level, each file seems to have a modest amount of explicit requirements. Known issues: - Tracking the location for where `defmacro`s and virtual state definitions were defined (and therefore the file) is still problematic. Because those forms are in a macro environment, the reader does not track them. I'm wondering if a workaround could be to search the reader's text_db by not just the `goos::Object` but by the text position. But for the purposes of finishing this work, I just statically analyzed and searched the code with throwaway python code.
47 lines
1.4 KiB
Common Lisp
47 lines
1.4 KiB
Common Lisp
;;-*-Lisp-*-
|
|
(in-package goal)
|
|
(bundles "ENGINE.CGO" "GAME.CGO")
|
|
|
|
(require "engine/draw/drawable-inline-array-h.gc")
|
|
|
|
;; name: draw-node-h.gc
|
|
;; name in dgo: draw-node-h
|
|
;; dgos: GAME, ENGINE
|
|
|
|
;; DECOMP BEGINS
|
|
|
|
;; A "draw-node" is a way to group together a bunch of drawables (possibly other draw-nodes) in a BVH
|
|
;; This BVH is used for sphere-in-view culling and the broad phase collision detection.
|
|
;; _most_ uses of draw-node are in a special tree with these properties:
|
|
;; - between 1 and 8 roots.
|
|
;; - each child has between 1 and 8 children
|
|
;; - all leaves are stored at the same depth
|
|
;; - all nodes and leaves have visibility IDs
|
|
|
|
;; shrub does not have these properties - it supports arbitrary children counts, leaves
|
|
;; may occur at any depth, and nothing has visibility ids.
|
|
|
|
(deftype draw-node (drawable)
|
|
((child-count uint8 :offset 6)
|
|
(flags uint8 :offset 7)
|
|
(child drawable :offset 8)
|
|
(distance float :offset 12)
|
|
)
|
|
)
|
|
|
|
|
|
;; for non-shrub uses of draw-node, this is used to store all the draw-nodes at a given depth.
|
|
(deftype drawable-inline-array-node (drawable-inline-array)
|
|
((data draw-node 1 :inline)
|
|
(pad uint32)
|
|
)
|
|
)
|
|
|
|
;; the types of these fields are a guess for now.
|
|
;; used for draw-node-cull function
|
|
(deftype draw-node-dma (structure)
|
|
((banka draw-node 32 :inline)
|
|
(bankb draw-node 32 :inline)
|
|
)
|
|
)
|