Refactor: fold-constant without recursive function call

[hikettei]

• optimize: optimize-aasm
  • no recursive function calling in fold-constant
• bugfix on defsimplifier
  • node-class
  • recurisve node creation
  • <node>
  • ids appeared in the outputs should be simplified
  • optimize pattern matcher, constant folding < 1e-5 sec
  • Full optimization on %tensor->aasm (make it zero cost for smaller graph)
  • !view < 1e-4sec without using fixnum

[hikettei]

CATEN> (let ((g (%tensor->aasm (!add (iconst 0) (iconst 'x))))) (time (caten/aasm::apply-fold-constant g)))
Evaluation took:
  0.000 seconds of real time
  0.000016 seconds of total run time (0.000014 user, 0.000002 system)
  100.00% CPU
  0 bytes consed
  

Graph[seen=NIL, outputs=NIL] {
    <Node[BUFFER] ALLOCATE(NID744) : SID739 <- () where :nrank=0 :dtype=INT32>
    <Node[BUFFER] LOAD(NID746) : BID747 <- (SID739) where :value=X>
}