• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
    • Theories
    • Rule-classes
    • Proof-builder
    • Recursion-and-induction
    • Hons-and-memoization
    • Events
    • Parallelism
    • History
    • Programming
      • Defun
      • Declare
      • System-utilities
      • Stobj
      • State
      • Mutual-recursion
      • Memoize
      • Mbe
      • Io
      • Defpkg
      • Apply$
      • Loop$
      • Programming-with-state
      • Arrays
      • Characters
      • Time$
      • Loop$-primer
      • Fast-alists
      • Defconst
      • Defmacro
      • Evaluation
      • Guard
      • Equality-variants
      • Compilation
      • Hons
      • ACL2-built-ins
      • Developers-guide
      • System-attachments
      • Advanced-features
      • Set-check-invariant-risk
      • Numbers
      • Irrelevant-formals
      • Efficiency
      • Introduction-to-programming-in-ACL2-for-those-who-know-lisp
      • Redefining-programs
      • Lists
      • Invariant-risk
      • Errors
      • Defabbrev
      • Conses
      • Alists
      • Set-register-invariant-risk
      • Strings
      • Program-wrapper
      • Get-internal-time
      • Basics
        • Let
        • Return-last
        • Mv-let
        • Flet
        • Or
        • Mv
        • And
        • Booleanp
        • If
        • Not
        • Equal
        • Implies
        • Iff
        • Macrolet
        • Quote
          • Opcode
          • Select-insts
          • Inst
          • Op/en-p
          • Operands
          • Inst-list-p
          • Operand-type-p
          • Strict-opcode-p
          • Opcode-extension-group-p
          • Superscripts-p
          • Maybe-operands-p
          • Exception-desc-p
          • Count-avx-pfx-cases
          • Mnemonic-p
          • Maybe-3bits-p
          • Op-pfx-p
          • Maybe-vex-p
          • Maybe-evex-p
          • Fn-desc-p
          • Chk-exc-fn
          • Remove-insts-with-feat
          • Op-mode-p
          • Keep-insts-with-feat
          • Rex-p
          • Mod-p
          • Avx-pfx-well-formed-p
          • Unquote
          • Any-present-in
          • Eval-pre-map
          • Superscripts-fix
          • Strict-opcode-fix
          • Operand-type-fix
          • Opcode-extension-group-fix
          • Maybe-operands-fix
          • Maybe-evex-fix
          • Maybe-3bits-fix
          • Keyword-list-fix
          • Exception-desc-fix
          • Rex-fix
          • Op-pfx-fix
          • Op-mode-fix
          • Mod-fix
          • Mnemonic-fix
          • Maybe-vex-fix
          • Fn-desc-fix
          • Vex-p
          • Evex-p
        • Let*
        • Case-match
        • ACL2-count
        • Case
        • Good-bye
        • Cond
        • Null
        • Progn$
        • Identity
        • Xor
      • Packages
      • Oracle-eval
      • Defmacro-untouchable
      • Primitive
      • <<
      • Revert-world
      • Unmemoize
      • Set-duplicate-keys-action
      • Symbols
      • Def-list-constructor
      • Easy-simplify-term
      • Defiteration
      • Fake-oracle-eval
      • Defopen
      • Sleep
    • Operational-semantics
    • Real
    • Start-here
    • Debugging
    • Miscellaneous
    • Output-controls
    • Macros
    • Interfacing-tools
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Quote
• Opcode-maps-structures

Count-avx-pfx-cases

Signature

(count-avx-pfx-cases lst alst vex?) → count-alst

Arguments

lst — Guard (true-listp lst).

alst — Guard (alistp alst).

vex? — Guard (booleanp vex?).

Returns

count-alst — Type (alistp count-alst), given (and (alistp alst) (true-listp lst)).

Definitions and Theorems

Function: count-avx-pfx-cases

(defun count-avx-pfx-cases (lst alst vex?)
  (declare (xargs :guard (and (true-listp lst)
                              (alistp alst)
                              (booleanp vex?))))
  (let ((__function__ 'count-avx-pfx-cases))
    (declare (ignorable __function__))
    (if (endp lst)
        alst
      (b* ((e (car lst)) (rest (cdr lst)))
        (cond ((member e *vvvv-pfx*)
               (b* ((vvvv (nfix (cdr (assoc-equal :vvvv alst))))
                    (alst (put-assoc :vvvv (1+ vvvv) alst)))
                 (count-avx-pfx-cases rest alst vex?)))
              ((member e
                       (if vex? *l-pfx* (cons :|512| *l-pfx*)))
               (b* ((l (nfix (cdr (assoc-equal :l alst))))
                    (alst (put-assoc :l (1+ l) alst)))
                 (count-avx-pfx-cases rest alst vex?)))
              ((member e *pp-pfx*)
               (b* ((pp (nfix (cdr (assoc-equal :pp alst))))
                    (alst (put-assoc :pp (1+ pp) alst)))
                 (count-avx-pfx-cases rest alst vex?)))
              ((member e *mm-pfx*)
               (b* ((mm (nfix (cdr (assoc-equal :mm alst))))
                    (alst (put-assoc :mm (1+ mm) alst)))
                 (count-avx-pfx-cases rest alst vex?)))
              ((member e *w-pfx*)
               (b* ((w (nfix (cdr (assoc-equal :w alst))))
                    (alst (put-assoc :w (1+ w) alst)))
                 (count-avx-pfx-cases rest alst vex?))))))))

Theorem: alistp-of-count-avx-pfx-cases

(defthm alistp-of-count-avx-pfx-cases
  (implies (and (alistp alst) (true-listp lst))
           (b* ((count-alst (count-avx-pfx-cases lst alst vex?)))
             (alistp count-alst)))
  :rule-classes :rewrite)