package cil

You can search for identifiers within the package.

in-package search v0.2.0

cil
- Alpha
- Availexps
- Availexpslv
- Bitmap
- Cabs
- Cabs2cil
- Cabshelper
- Cabsvisit
  - cabsVisitor
  - nopCabsVisitor
- Callgraph
- Canonicalize
- Cfg
- Check
- Cil
- Cilint
- Cillower
- Ciloptions
- Ciltools
- Cilutil
- Cilversion
- Clexer
- Clist
- Cparser
- Cprint
- Dataflow
- Dataslicing
- Deadcodeelim
- Dominators
- Epicenter
- Errormsg
- Escape
- Expcompare
  - volatileFinderClass
- Feature_config
- Formatcil
- Formatlex
- Formatparse
- Frontc
- GrowArray
- Heap
- Heapify
- Inthash
- Lexerhack
- Liveness
- Llvm
- Llvmgen
  - llvmGenerator
  - llvmGeneratorClass
- Llvmssa
- Llvmutils
- Logcalls
- Logwrites
  - logWriteVisitor
- Longarray
- Machdep
- Machdepenv
- Mergecil
- Olf
- Oneret
- Partial
  - AliasInfo
  - CallGraph
  - CallGraph'
  - EasyAlias
  - EasyCallGraph
    
    A
    
    callGraphVisitor
  - MakePartial
    
    A
    
    C
    
    LabelSet
    
    S
  - NeculaFolding
    
    A
    
    IntMap
    
    findLval
    
    rewriteExpClass
  - PartialAlgorithm
  - PtranalAlias
  - Symex
  - callBBVisitor
  - globalConstVisitor
  - vidVisitor
- Patch
- Predabst
  - ExpIntHash
  - NullSolver
  - NullTranslator
  - PredAbst
    
    PA
    
    PredFlow
    
    S
    
    aliasFinderClass
    
    derefFinderClass
    
    funcSigMakerClass
    
    globalFinderClass
    
    paVisitorClass
    
    returnFinderClass
    
    viFinderClass
  - SOLVER
  - Solver
    
    T
  - TRANSLATOR
- Pretty
  - MakeMapPrinter
    
    Map
  - MakeSetPrinter
    
    Set
- Ptranal
- Reachingdefs
  - IOS
  - RD
  - ReachingDef
  - rdVisitorClass
- Rmtmps
- Setp
  - Make
    
    Ord
  - PolyOrderedType
  - S
- Sfi
  - sfiVisitorClass
- Simplemem
  - simpleVisitor
- Simplify
- Ssa
- Stats
- Trace
- Uref
- Usedef
  - VS
  - useDefVisitorClass
- Util
- Whitetrack

Legend:
Library
Module
Module type
Parameter
Class
Class type

val computeIDom : ?doCFG:bool -> Cil.fundec -> Cil.stmt option Inthash.t

type tree

val computeDomTree : 
  ?doCFG:bool ->
  Cil.fundec ->
  Cil.stmt option Inthash.t * tree

val getIdom : Cil.stmt option Inthash.t -> Cil.stmt -> Cil.stmt option

val dominates : Cil.stmt option Inthash.t -> Cil.stmt -> Cil.stmt -> bool

val children : tree -> Cil.stmt -> Cil.stmt list

type order =

| PreOrder
| PostOrder

val domTreeIter : (Cil.stmt -> unit) -> order -> tree -> unit

val findNaturalLoops : 
  Cil.fundec ->
  Cil.stmt option Inthash.t ->
  (Cil.stmt * Cil.stmt list) list