Chisel

Node

abstract class Node extends nameable

*Node* defines the root class of the class hierarchy for a [Composite Pattern](http://en.wikipedia.org/wiki/Composite_pattern).

A digital logic graph is encoded as adjacency graph where instances of *Node* describe vertices and *inputs*, *consumers* member fields are used to traverse the directed graph respectively backward (from output to input) and forward (from input to output).

Linear Supertypes
nameable, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Node
  2. nameable
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Node()

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. def ##(b: Node): Node

  4. final def ##(): Int

    Definition Classes
    AnyRef → Any
  5. def <>(src: Node): Unit

  6. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  7. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  8. var CppVertex: CppVertex

  9. def ^^(src: Node): Unit

  10. val _id: Int

  11. def _isComplementOf(x: Node): Boolean

  12. def addConsumers(): Unit

  13. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  14. def assign(src: Node): Unit

  15. def canCSE: Boolean

  16. lazy val chiselName: String

  17. var clock: Clock

  18. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. var cntrIdx: Int

  20. var component: Module

  21. def componentOf: Module

  22. val consumers: ArrayBuffer[Node]

  23. var counter: Bits

  24. def dblLitValue: Double

  25. var depth: Int

  26. var driveRand: Boolean

  27. lazy val emitIndex: Int

  28. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  29. def equals(that: Any): Boolean

    Definition Classes
    Node → AnyRef → Any
  30. def equalsForCSE(x: Node): Boolean

  31. def extract(b: Bundle): List[Node]

  32. def extract(widths: Array[Int]): List[UInt]

  33. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  34. def floLitValue: Float

  35. def forceMatchingWidths: Unit

  36. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  37. def getLit: Literal

  38. def getNode: Node

  39. def getWidth(): Int

  40. def hashCode(): Int

    Definition Classes
    Node → AnyRef → Any
  41. def hashCodeForCSE: Int

  42. def infer: Boolean

  43. var inferWidth: (Node) ⇒ Int

  44. def init(n: String, w: Int, ins: Node*): Node

  45. def init(n: String, width: (Node) ⇒ Int, ins: Node*): Node

  46. def initOf(n: String, width: (Node) ⇒ Int, ins: Iterable[Node]): Node

  47. val inputs: ArrayBuffer[Node]

  48. def isByValue: Boolean

  49. lazy val isInObject: Boolean

  50. lazy val isInVCD: Boolean

  51. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  52. def isIo: Boolean

  53. def isIo_=(isIo: Boolean): Unit

  54. final def isLit: Boolean

  55. def isReg: Boolean

  56. var isTypeNode: Boolean

  57. def isUsedByClockHi: Boolean

  58. var isWidthWalked: Boolean

  59. val line: StackTraceElement

  60. def litOf: Literal

  61. def litValue(default: BigInt = BigInt(-1)): BigInt

  62. def matchWidth(w: Int): Node

  63. def maxNum: BigInt

  64. def maybeFlatten: Seq[Node]

  65. def minNum: BigInt

  66. var name: String

    Definition Classes
    nameable
  67. var nameHolder: nameable

  68. def nameIt(path: String, isNamingIo: Boolean): Unit

  69. var named: Boolean

    _named_ is used to indicates name was set explicitely and should not be overriden by a _nameIt_ generator.

    _named_ is used to indicates name was set explicitely and should not be overriden by a _nameIt_ generator.

    Definition Classes
    nameable
  70. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  71. final def notify(): Unit

    Definition Classes
    AnyRef
  72. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  73. var pName: String

    Definition Classes
    nameable
  74. def printTree(writer: PrintStream, depth: Int = 4, indent: String = ""): Unit

    Prints all members of a node and recursively its inputs up to a certain depth level.

    Prints all members of a node and recursively its inputs up to a certain depth level. This method is purely used for debugging.

  75. var prune: Boolean

  76. def removeTypeNodes(): Unit

  77. var sccIndex: Int

  78. var sccLowlink: Int

  79. def setName(n: String): Unit

  80. def setPseudoName(path: String, isNamingIo: Boolean): Unit

  81. var shadow: Bits

  82. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  83. def toBits(): UInt

  84. def toNode: Node

  85. def toString(): String

    Definition Classes
    AnyRef → Any
  86. def traceNode(c: Module, stack: Stack[() ⇒ Any]): Any

  87. def traceableNodes: Array[Node]

  88. def usesInClockHi(i: Node): Boolean

  89. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  90. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  91. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  92. def width: Int

  93. var width_: Int

  94. def width_=(w: Int): Unit

    Sets the width of a Node.

Inherited from nameable

Inherited from AnyRef

Inherited from Any

Ungrouped