Package com.helix.core.bytecode


package com.helix.core.bytecode
  • Class
    Description
    Adaptive AST Optimizer dynamically reordering commutative boolean clauses based on live cost-to-failure ratios (C_i / F_i) or pluggable ReorderingPolicy SPI, and executing zero-downtime bytecode hot-swapping into tiered rule caches.
    Low-level ASM bytecode generator for high-performance rule compilation with direct ONNX inference invocations.
    Low-level ASM class builder for generating JVM bytecode structures.
    Low-level ASM bytecode generator for high-performance rule compilation.
    Low-level ASM helper for emitting stack bytecode instructions.
    AST Visitor that evaluates expressions dynamically against an ExecutionContext.
    Deterministic node identifier resolver ensuring consistent naming across AST profiling hooks and adaptive AST optimizers.
    ByteBuddy-based bytecode generator that dynamically generates Java classes implementing CompiledRule.
    Runtime delegation handler for generated CompiledRule instances.
    ASM Bytecode Compiler capable of standard zero-overhead compilation and dynamic debug instrumentation injecting probe hooks before condition branch jumps.
    Exception thrown when dynamic bytecode generation fails.
    Strategy interface for compiling AST expression trees into executable CompiledRule instances.
    Bytecode & AST Optimizer engine orchestrating constant folding and dead code elimination passes.
    AST Optimization pass that performs constant folding on literal expressions.
    AST Optimization pass that eliminates unreachable branches and redundant constant logical terms.
    Contract for evaluating AST nodes or executing rule logic dynamically during runtime interception.
    Immutable snapshot of an adaptive AST optimization and hot-swap operation.