• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Debugging
  • Projects
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
    • Sv
    • Fgl
    • Vl
      • Syntax
      • Loader
      • Warnings
        • Lint-warning-suppression
        • Warning-basics
        • Vl-warning
        • Vl-warninglist-add-ctx
        • Vl-warninglist->types
        • Propagating-errors
          • Vl-design-propagate-errors
          • Vl-blamealist
          • Vl-design-zombies
          • Vl-blame-alist-to-reportcard
          • Vl-blame-alist
            • Vl-blame-alist-aux2
            • Vl-blame-alist-aux1
          • Vl-blamealist-count
        • Vl-reportcard
        • Vl-some-warning-fatalp
        • Clean-warnings
        • Lint-whole-file-suppression
        • Vl-keep-warnings
        • Warn
        • Vl-warninglist
        • Vl-remove-warnings
        • Flat-warnings
        • Vl-some-warning-of-type-p
        • Vl-msg
        • Vl-warning-add-ctx
        • Vl-print-warning
        • Vmsg-binary-concat
        • Ok
        • Vl-trace-warnings
        • Fatal
        • Vmsg
      • Getting-started
      • Utilities
      • Printer
      • Kit
      • Mlib
      • Transforms
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Testing-utilities
  • Math

• Propagating-errors

Vl-blame-alist

Build an alist describing which modules are really to blame for their dependents being thrown away.

Signature

(vl-blame-alist bads design) → blame-alist

Arguments

bads — Names of bad modules.
    Guard (string-listp bads).

design — The design we are processing.
    Guard (vl-design-p design).

Returns

blame-alist — Fast alist.
    Type (vl-blamealist-p blame-alist).

Definitions and Theorems

Function: vl-blame-alist

(defun
 vl-blame-alist (bads design)
 (declare (xargs :guard (and (string-listp bads)
                             (vl-design-p design))))
 (let
     ((__function__ 'vl-blame-alist))
     (declare (ignorable __function__))
     (b* ((bads (mergesort (string-list-fix bads)))
          (design (vl-design-fix design)))
         (fast-alist-clean (vl-blame-alist-aux2 bads design nil)))))

Theorem: vl-blamealist-p-of-vl-blame-alist

(defthm vl-blamealist-p-of-vl-blame-alist
        (b* ((blame-alist (vl-blame-alist bads design)))
            (vl-blamealist-p blame-alist))
        :rule-classes :rewrite)

Theorem: vl-blame-alist-of-string-list-fix-bads

(defthm vl-blame-alist-of-string-list-fix-bads
        (equal (vl-blame-alist (string-list-fix bads)
                               design)
               (vl-blame-alist bads design)))

Theorem: vl-blame-alist-string-list-equiv-congruence-on-bads

(defthm vl-blame-alist-string-list-equiv-congruence-on-bads
        (implies (str::string-list-equiv bads bads-equiv)
                 (equal (vl-blame-alist bads design)
                        (vl-blame-alist bads-equiv design)))
        :rule-classes :congruence)

Theorem: vl-blame-alist-of-vl-design-fix-design

(defthm vl-blame-alist-of-vl-design-fix-design
        (equal (vl-blame-alist bads (vl-design-fix design))
               (vl-blame-alist bads design)))

Theorem: vl-blame-alist-vl-design-equiv-congruence-on-design

(defthm vl-blame-alist-vl-design-equiv-congruence-on-design
        (implies (vl-design-equiv design design-equiv)
                 (equal (vl-blame-alist bads design)
                        (vl-blame-alist bads design-equiv)))
        :rule-classes :congruence)

Subtopics

Vl-blame-alist-aux2

For each Bi in BADS, we compute the transitive dependencies of Bi, and then blame Bi for ruining them all.

Vl-blame-alist-aux1

For each module M in DEPS, additionally blame BAD.