package goblint-cil

You can search for identifiers within the package.

in-package search v0.2.0

package goblint-cil

goblint-cil
- Alpha
- Bitmap
- Cabs
- Cabs2cil
- Cabshelper
- Cabsvisit
  - cabsVisitor
  - nopCabsVisitor
- Cfg
- Check
- Cil
- Cilint
- Cillower
- Ciloptions
- Ciltools
- Cilutil
- Cilversion
- Clexer
- Clist
- Cparser
- Cprint
- Dataflow
- Dominators
- Errormsg
- Escape
- Expcompare
  - volatileFinderClass
- Feature
- Formatcil
- Formatlex
- Formatparse
- Frontc
- GrowArray
- Inthash
- Lexerhack
- Libmaincil
  - unrollVisitorClass
- Longarray
- Machdep
- Machdepenv
- Mergecil
- Patch
- Pretty
  - MakeMapPrinter
    
    Map
  - MakeSetPrinter
    
    Set
- Rmtmps
- Stats
- Trace
- Util
- Whitetrack
goblint-cil.dataslicing
- Dataslicing
goblint-cil.liveness
- Liveness
- Usedef
  - VS
  - useDefVisitorClass
goblint-cil.makecfg
- MakeCFG
  - callBBVisitor
  - vidVisitor
goblint-cil.pta
- Golf
- Olf
- Ptranal
- Setp
  - Make
    
    Ord
  - PolyOrderedType
  - S
- Steensgaard
- Uref
goblint-cil.syntacticsearch
goblint-cil.zrapp

Legend:
Library
Module
Module type
Parameter
Class
Class type

A bunch of generally useful functions

val list_append : 'a list -> 'a list -> 'a list

tail-recursive append

val list_map : ('a -> 'b) -> 'a list -> 'b list

More efficient map

val memoize : ('a, 'b) Stdlib.Hashtbl.t -> 'a -> ('a -> 'b) -> 'b

val valOf : 'a option -> 'a

Get the value of an option. Raises Failure if None

val list_map_opt : ('a -> 'b) -> 'a list option -> 'b list option

val equals : 'a -> 'a -> bool

This has the semantics of (=) on OCaml 3.07 and earlier. It can handle cyclic values as long as a structure in the cycle has a unique name or id in some field that occurs before any fields that have cyclic pointers.