CodeQL library for C/C++
Search

Predicate accessPathCostLimits

The cost limits for the AccessPathApprox to AccessPath expansion.

apLimit bounds the acceptable fan-out, and tupleLimit bounds the estimated per-AccessPathApprox tuple cost. Access paths exceeding both of these limits are represented with lower precision.

Import path

import semmle.code.cpp.ir.dataflow.internal.DataFlowImplCommon
predicate accessPathCostLimits(int apLimit, int tupleLimit)