pub struct ProgramFacts {
pub name: String,
pub hash: Option<String>,
pub stage: Stage,
pub shader: Option<Entity>,
pub instruction_count: Option<InstructionCount>,
pub inputs: Vec<Varying>,
pub resources: Vec<ProgramResourceFacts>,
pub outputs: Vec<OutputBinding>,
pub surface: Surface,
pub not_lifted: Option<String>,
}Expand description
core.program_facts: a resolver’s measured facts about one program, what it reads and writes and how large it is,
also stored on the program entity for reuse across materials.
Fields§
§name: StringThe name the consumer knows the program by.
hash: Option<String>The sha256: hash of the program’s bytes, as Provenance::source_hash gives it; None when the program was not
read.
stage: StageThe stage the program runs in.
shader: Option<Entity>The consumer’s handle to the program; None until ProgramFacts::bound is called.
instruction_count: Option<InstructionCount>The program’s size, or None for a program that was not lifted or whose lifter does not count.
inputs: Vec<Varying>Used signature elements, including the original register/mask provenance. Not a guess from semantic names.
resources: Vec<ProgramResourceFacts>Resource declarations retain names/register/space, not layouts or bytecode. Not a resource liveness claim.
outputs: Vec<OutputBinding>The roles of the program’s outputs; empty until ProgramFacts::bound is called.
surface: SurfaceThe outputs read by their roles as a lit surface; the default surface until ProgramFacts::bound is called.
not_lifted: Option<String>A program that was not found/selected/lifted has a reason, never a zero instruction count.
Implementations§
Source§impl ProgramFacts
impl ProgramFacts
Sourcepub fn lifted(
name: impl Into<String>,
stage: Stage,
hash: Option<String>,
instruction_count: Option<InstructionCount>,
interface: &Interface,
) -> Self
pub fn lifted( name: impl Into<String>, stage: Stage, hash: Option<String>, instruction_count: Option<InstructionCount>, interface: &Interface, ) -> Self
The facts of a lifted program, named name, of its stage, the hash of its bytes, its instruction count and its
interface (the inputs it uses and the source address of each resource); no output roles until
ProgramFacts::bound. Nothing is parsed or lifted again.
The facts of a program that has none: no inputs, resources, outputs or instruction count, and reason in
not_lifted.
Sourcepub fn bound(self, shader: Entity, outputs: &[OutputBinding]) -> Self
pub fn bound(self, shader: Entity, outputs: &[OutputBinding]) -> Self
Output roles are resolved after the lift; the surface is always the shared reading (Surface::read).
Trait Implementations§
Source§impl Clone for ProgramFacts
impl Clone for ProgramFacts
Source§impl Component for ProgramFacts
impl Component for ProgramFacts
const NAME: &'static str = "core.program_facts"
Source§const GEOMETRY: Geometry = Geometry::None
const GEOMETRY: Geometry = Geometry::None
Geometry). Stated by every component,
with no default, so data that describes a mesh can’t be left behind by an edit of it unawares: the World’s edit
paths take it from there.Source§fn to_json(&self) -> Result<Option<Value>, JsonError>
fn to_json(&self) -> Result<Option<Value>, JsonError>
Ok(None) for components
that are not shown (bulk data, handles). The view must never lose a value: components that can be shown
derive serde::Serialize and return crate::json::to_value(self).map(Some), which refuses non-finite
floats instead of writing them as null.Source§fn references(&self, out: &mut Vec<Entity>)
fn references(&self, out: &mut Vec<Entity>)
out: the edges
World::closure follows. A component holding entity references must declare every one of them.Source§fn verify(&self, _e: Entity, _w: &World) -> Result<(), String>
fn verify(&self, _e: Entity, _w: &World) -> Result<(), String>
e (indices in range, stream lengths equal, …). The pass manager
runs it on every component after the reader, after every pass and before the writer, together with the
world’s own check that every entity of Component::references is alive. World-wide rules (one name -> one
payload) are pass::Validators instead.Source§fn apply_linear(&self, _l: &Linear) -> Linearity<Self>
fn apply_linear(&self, _l: &Linear) -> Linearity<Self>
l (a pass that bakes a placement’s mirror or
shear into a copy of its geometry, so transforms stay rigid). World::apply_linear calls it for every
component of the entity. The default is Linearity::Unsupported: a component that holds local-space
geometry and does not say how it follows is never silently left behind; one without geometry says
Linearity::Invariant.Source§const VERSION: u32 = 1
const VERSION: u32 = 1
Source§fn payload_bytes(&self) -> u64
fn payload_bytes(&self) -> u64
Source§fn remap_primitives(&self, _from: &[usize]) -> Option<Result<Self, String>>
fn remap_primitives(&self, _from: &[usize]) -> Option<Result<Self, String>>
Geometry::PerPrimitive, Geometry::PerVertex): new primitive i comes from old primitive
from[i] (a source may repeat, when a primitive is split, or be absent, when one is dropped). Such a component
always answers (a value holding nothing per primitive answers with itself); None, the default, is for
components of Geometry::None, and World::remap_primitives refuses a dependent component that gives it.
An index the component does not have is an error. remap_list does the work for a list with one entry per
primitive.Source§fn remap_vertices(
&self,
_primitive: usize,
_from: &[u32],
) -> Option<Result<Self, String>>
fn remap_vertices( &self, _primitive: usize, _from: &[u32], ) -> Option<Result<Self, String>>
primitive were compacted or reordered, for a
component that holds something per vertex (Geometry::PerVertex): new vertex i of that primitive is old
vertex from[i] (a source may repeat or be absent). Such a component always answers (with itself when it holds
nothing for that primitive); None, the default, is for the others, and World::remap_vertices refuses a
per-vertex component that gives it. An index the component does not have is an error. Every pass that compacts
or reorders a primitive’s vertices calls World::remap_vertices. After a rebuild of the primitive list
(World::rebuild_primitives, Component::remap_primitives) a primitive’s per-vertex data is its source
primitive’s, and the vertex map is relative to that source.Source§fn blend_vertices(
&self,
_primitive: usize,
_from: &[VertexBlend],
) -> Option<Result<Self, String>>
fn blend_vertices( &self, _primitive: usize, _from: &[VertexBlend], ) -> Option<Result<Self, String>>
primitive were rebuilt as blends of old ones
(VertexBlend), for a component that holds something per vertex (Geometry::PerVertex): new vertex i
is the combination from[i] of old vertices, in whatever way the component’s data combines (a morph target’s
delta is interpolated, the way the surface it moves is). It answers as Component::remap_vertices does: with
itself when it holds nothing for that primitive; None, the default, is for a component that does not know how
to combine its data, and World::blend_vertices refuses a per-vertex component that gives it. An index the
component does not have is an error. A vertex that is a copy of one old vertex (VertexBlend::copy) is the
case Component::remap_vertices states, and a component answering one answers the other alike.Source§fn restate(&self, _resolved: &Resolved<'_>) -> Restated<Self>
fn restate(&self, _resolved: &Resolved<'_>) -> Restated<Self>
resolve-state (crate::state::ResolveState) gave the axes in resolved their values: a
component that holds crate::state::Clauses of its own (a record of parts each present in some states) reduces
them as core.condition is reduced (crate::state::Resolved::reduce: a clause that fails is dropped, a clause
left with no literal holds whatever the other axes are). Restated::Absent says the entity is not present in
this state (every clause failed): it is despawned as one whose core.condition fails is. The default holds no
clause: Restated::Unchanged.