Struct AstGraph 

pub struct AstGraph {
    pub dialect: SourceDialect,
    pub grammar_version: u32,
    pub root_id: NodeId,
    pub nodes: Vec<AstNodeForm>,
    pub canonical_hash: AstGraphHash,
}

The AST graph proper. nodes[0] is always the root expression.

Fields

dialect: SourceDialect

Which surface dialect this graph was lowered from. Today only Nix is implemented; Tlisp is reserved so the typed IR is stable across the future dialect-lowering work. The IR downstream of this field is dialect-agnostic — every consumer (eval cache, module-graph compiler, derivation builder) reads AstGraph without knowing which dialect produced it. Bidirectional rendering (back to .nix / .tlisp source text) hangs off this discriminator.

grammar_version: u32

rnix grammar version the source was parsed against. Today this is locked to the bundled rnix major (0.14). Bumping is a migration boundary.

root_id: NodeId

Index of the root expression in Self::nodes. Today, this is always (nodes.len() - 1) as u32 because the builder is post-order — children are pushed before their parent.

nodes: Vec<AstNodeForm>

Dense node table.

canonical_hash: AstGraphHash

BLAKE3 of the rkyv archive bytes. Populated by AstGraph::archive_and_hash.

Implementations

impl AstGraph

pub fn from_source(source: &str) -> Result<Self, AstGraphError>

Parse + canonicalize source text into a typed AST graph.

Errors

• AstGraphError::Parse if rnix can’t parse the source.
• AstGraphError::NoRoot if the parse succeeds but produces an empty root (e.g. comments-only input).

pub fn from_tlisp_source(source: &str) -> Result<Self, AstGraphError>

Parse + lower a tatara-lisp source into the universal IR.

Status: typed seam only. Today this returns an Unknown- kinded root with the source preserved verbatim so callers can already exercise the dialect-aware downstream pipeline. The real lowering — mapping each defast-node Lisp form to the matching AstNodeKind variant — lands in the focused .tlisp dialect ship.

Errors

Always succeeds today (every input is captured as Unknown). Future versions will return AstGraphError::Parse when the tatara-lisp reader rejects the input.

pub fn to_nix_source(&self) -> Result<String, AstGraphError>

Render this graph back into Nix source text.

Status: API seam only. The renderer that emits canonical .nix syntax for every AstNodeKind variant lands in the dialect-rendering ship.

Errors

Always returns AstGraphError::Unimplemented today.

pub fn to_tlisp_source(&self) -> Result<String, AstGraphError>

Render this graph as tatara-lisp source text.

Status: API seam only. See Self::to_nix_source.

Errors

Always returns AstGraphError::Unimplemented today.

pub fn archive_and_hash(self) -> Result<(Self, Vec<u8>), AstGraphError>

Same two-pass shape as LockfileGraph::archive_and_hash — the hash is part of the archive, so it can’t be computed before the archive exists.

Errors

AstGraphError::Archive if rkyv refuses the graph shape.

Trait Implementations

impl Archive for AstGraph

where SourceDialect: Archive, u32: Archive, NodeId: Archive, Vec<AstNodeForm>: Archive, AstGraphHash: Archive,

const COPY_OPTIMIZATION: CopyOptimization<Self>

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

type Archived = ArchivedAstGraph

The archived representation of this type.

type Resolver = AstGraphResolver

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output.

impl Clone for AstGraph

fn clone(&self) -> AstGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AstGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for AstGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<__D: Fallible + ?Sized> Deserialize<AstGraph, __D> for Archived<AstGraph>

where SourceDialect: Archive, <SourceDialect as Archive>::Archived: Deserialize<SourceDialect, __D>, u32: Archive, <u32 as Archive>::Archived: Deserialize<u32, __D>, NodeId: Archive, <NodeId as Archive>::Archived: Deserialize<NodeId, __D>, Vec<AstNodeForm>: Archive, <Vec<AstNodeForm> as Archive>::Archived: Deserialize<Vec<AstNodeForm>, __D>, AstGraphHash: Archive, <AstGraphHash as Archive>::Archived: Deserialize<AstGraphHash, __D>,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<AstGraph, <__D as Fallible>::Error>

Deserializes using the given deserializer

impl PartialEq for AstGraph

fn eq(&self, other: &AstGraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for AstGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<__S: Fallible + ?Sized> Serialize<__S> for AstGraph

where SourceDialect: Serialize<__S>, u32: Serialize<__S>, NodeId: Serialize<__S>, Vec<AstNodeForm>: Serialize<__S>, AstGraphHash: Serialize<__S>,

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl StructuralPartialEq for AstGraph

impl TataraDomain for AstGraph

const KEYWORD: &'static str = "defast-graph"

The Lisp keyword (e.g., "defmonitor").

fn compile_from_args(args: &[Sexp]) -> Result<Self>

Parse the argument list (everything after the keyword) into Self.

fn compile_from_sexp(form: &Sexp) -> Result<Self, LispError>

Parse a complete form; validates the head symbol matches KEYWORD.