package cil

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

package cil

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

Parameters

module A : AliasInfo

Signature

val cgCreateNode : (Cil.varinfo, callGraphNode) Hashtbl.t -> Cil.fundec -> unit

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

val cgAddEdge : ('a, callGraphNode) Hashtbl.t -> 'a -> 'a -> unit

class callGraphVisitor : (Cil.varinfo, callGraphNode) Hashtbl.t -> object ... end

val compute : Cil.file -> (Cil.varinfo, callGraphNode) Hashtbl.t

val can_call : 
  (Cil.varinfo, callGraphNode) Hashtbl.t ->
  Cil.fundec ->
  Cil.fundec list

val can_be_called_by : 
  (Cil.varinfo, callGraphNode) Hashtbl.t ->
  Cil.fundec ->
  Cil.fundec list

val fundec_of_varinfo : ('a, callGraphNode) Hashtbl.t -> 'a -> Cil.fundec