• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
      • Ipasir
      • Aignet
        • Base-api
          • Aignet-case
          • Aignet-init
          • Aignet-add-xor
          • Aignet-add-and
          • Gate-id->fanin1
          • Gate-id->fanin0
          • Ci-id->ionum
          • Literal
          • Aignet-set-nxst
          • Aignet-clear
          • Aignet-add-out
          • Regnum->nxst
          • Id->slot1
          • Id->phase
          • Num-regs
          • Num-ins
          • Num-fanins
          • Id->slot0
          • Regnum->id
          • Id->type
          • Id->regp
          • Outnum->fanin
          • Innum->id
            • Id-existsp
            • Aignet-add-reg
            • Aignet-add-in
            • Num-gates
            • Aignet-rollback
            • Num-outs
            • Num-nxsts
            • Fanin-litp
          • Aignet-construction
          • Representation
          • Aignet-copy-init
          • Aignet-simplify-marked-with-tracking
          • Aignet-cnf
          • Aignet-simplify-with-tracking
          • Aignet-complete-copy
          • Aignet-eval
          • Semantics
          • Aignet-transforms
          • Aignet-simplify-marked
          • Aignet-read-aiger
          • Aignet-write-aiger
          • Aignet-abc-interface
          • Utilities
        • Aig
        • Satlink
        • Truth
        • Ubdds
        • Bdd
        • Faig
        • Bed
        • 4v
      • Projects
      • Debugging
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Testing-utilities
      • Math
    • Base-api

    Innum->id

    (innum->id n aignet) gets the ID of the node with primary input number n.

    Logically this is (fanin-count (lookup-stype n :pi aignet)).

    In the execution this is a stobj array lookup in the inputs array.

    Function: innum->id

    (defun
       aignet$a::innum->id (n aignet)
       (declare
            (xargs :guard (and (natp n)
                               (aignet$a::aignet-well-formedp aignet))))
       (declare (xargs :guard (< n (aignet$a::num-ins aignet))))
       (let ((__function__ 'aignet$a::innum->id))
            (declare (ignorable __function__))
            (fanin-count (lookup-stype n (pi-stype) aignet))))