You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
|
<!DOCTYPE html>
|
|
|
|
|
|
<html xmlns="http://www.w3.org/1999/xhtml"><head><title>BoundMap (infer.Costlib.BoundMap)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="generator" content="odoc 1.5.1"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><div class="content"><header><nav><a href="../index.html">Up</a> – <a href="../../index.html">infer</a> » <a href="../index.html">Costlib</a> » BoundMap</nav><h1>Module <code>Costlib.BoundMap</code></h1></header><div class="spec module" id="module-BasicCost"><a href="#module-BasicCost" class="anchor"></a><code><span class="keyword">module</span> BasicCost = <a href="../CostDomain/index.html#module-BasicCost">CostDomain.BasicCost</a></code></div><div class="spec module" id="module-Node"><a href="#module-Node" class="anchor"></a><code><span class="keyword">module</span> Node = <a href="../../Absint/ProcCfg/index.html#module-DefaultNode">Absint.ProcCfg.DefaultNode</a></code></div><dl><dt class="spec value" id="val-lookup_upperbound"><a href="#val-lookup_upperbound" class="anchor"></a><code><span class="keyword">val</span> lookup_upperbound : <span><a href="../../Costlib__CostDomain/BasicCost/index.html#type-t">BasicCost.t</a> <a href="../../Absint__ProcCfg/DefaultNode/index.html#module-IdMap">Node.IdMap</a>.t</span> <span>-></span> <a href="../../Absint__ProcCfg/DefaultNode/index.html#type-id">Node.id</a> <span>-></span> <a href="../../Costlib__CostDomain/BasicCost/index.html#type-t">BasicCost.t</a></code></dt><dd><p>given a bound map and a node, lookup the number of times it can be executed</p></dd></dl><dl><dt class="spec value" id="val-compute_upperbound_map"><a href="#val-compute_upperbound_map" class="anchor"></a><code><span class="keyword">val</span> compute_upperbound_map : <a href="../../IR/Procdesc/index.html#type-t">IR.Procdesc.t</a> <span>-></span> <a href="../../BO/BufferOverrunAnalysis/index.html#type-invariant_map">BO.BufferOverrunAnalysis.invariant_map</a> <span>-></span> <a href="../../Checkers/Control/index.html#type-invariant_map">Checkers.Control.invariant_map</a> <span>-></span> <span><a href="../../Checkers/LoopInvariant/VarsInLoop/index.html#type-t">Checkers.LoopInvariant.VarsInLoop.t</a> <a href="../../IR__Procdesc/index.html#module-NodeMap">IR.Procdesc.NodeMap</a>.t</span> <span>-></span> <span><a href="../../Costlib__CostDomain/BasicCost/index.html#type-t">BasicCost.t</a> <a href="../../Absint__ProcCfg/DefaultNode/index.html#module-IdMap">Node.IdMap</a>.t</span></code></dt><dd><p>compute a map from each node to an upper bound on the number of times it can be executed.</p></dd></dl></div></body></html>
|
