.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.49.3.
.TH BARVINOK_COUNT "1" "July 2026" "barvinok_count 0.41.9" "User Commands"
.SH NAME
barvinok_count \- enumerate a non-parametric polytope
.SH SYNOPSIS
.B barvinok_count
[\fI\,OPTION\/\fR...]
.SH DESCRIPTION
.TP
\fB\-\-lll\-reduction\-num\fR=\fI\,long\/\fR
LLL reduction parameter numerator
.TP
\fB\-\-lll\-reduction\-den\fR=\fI\,long\/\fR
LLL reduction parameter denominator
.TP
\fB\-\-specialization\fR=\fI\,bf\/\fR|df|random|todd
[default: random]
.TP
\fB\-\-index\fR=\fI\,ulong\/\fR
maximal index of simple cones in
decomposition
.TP
\fB\-\-primal\fR
[default: no]
.TP
\fB\-\-table\fR
[default: no]
.TP
\fB\-\-gbr\fR=\fI\,glpk\/\fR|cdd|isl
lp solver to use for basis reduction
[default: isl]
.TP
\fB\-\-lp\fR=\fI\,glpk\/\fR|cdd|cddf|polylib|isl
lp solver to use [default: isl]
.TP
\fB\-\-summation\fR=\fI\,box\/\fR|euler|bernoulli|laurent|laurent_old
[default: laurent]
.TP
\fB\-\-chamber\-decomposition\fR=\fI\,polylib\/\fR|topcom|isl
tool to use for chamber decomposition
[default: polylib]
.TP
\fB\-\-integer\-hull\fR=\fI\,gbr\/\fR|hilbert
[default: gbr]
.TP
\fB\-\-print\-stats\fR
[default: no]
.TP
\fB\-\-verbose\fR
[default: no]
.IP
isl options
.TP
\fB\-\-isl\-context\fR=\fI\,gbr\/\fR|lexmin
how to handle the pip context tableau
[default: gbr]
.TP
\fB\-\-isl\-gbr\fR=\fI\,never\/\fR|once|always
how often to use generalized basis reduction
[default: always]
.TP
\fB\-\-isl\-closure\fR=\fI\,isl\/\fR|box
closure operation to use [default: isl]
.TP
\fB\-\-isl\-gbr\-only\-first\fR
only perform basis reduction in first
direction [default: no]
.TP
\fB\-\-isl\-bound\fR=\fI\,bernstein\/\fR|range
algorithm to use for computing bounds
[default: bernstein]
.TP
\fB\-\-isl\-on\-error\fR=\fI\,warn\/\fR|continue|abort
how to react if an error is detected
[default: warn]
.TP
\fB\-\-isl\-bernstein\-recurse\fR=\fI\,none\/\fR|factors|intervals|full
[default: factors]
.TP
\fB\-\-no\-isl\-bernstein\-triangulate\fR
triangulate domains during Bernstein
expansion [default: yes]
.TP
\fB\-\-no\-isl\-pip\-symmetry\fR
detect simple symmetries in PIP input
[default: yes]
.TP
\fB\-\-isl\-convex\-hull\fR=\fI\,wrap\/\fR|fm
convex hull algorithm to use [default: wrap]
.TP
\fB\-\-no\-isl\-coalesce\-bounded\-wrapping\fR
bound wrapping during coalescing [default: yes]
.TP
\fB\-\-isl\-coalesce\-preserve\-locals\fR
preserve local variables during coalescing
[default: no]
.TP
\fB\-\-isl\-schedule\-max\-coefficient=\fR<limit>
Only consider schedules where the
coefficients of the variable and parameter
dimensions do not exceed <limit>. A value of
\fB\-1\fR allows arbitrary coefficients. [default: \fB\-1]\fR
.TP
\fB\-\-isl\-schedule\-max\-constant\-term=\fR<limit>
Only consider schedules where the
coefficients of the constant dimension do
not exceed <limit>. A value of \fB\-1\fR allows
arbitrary coefficients. [default: \fB\-1]\fR
.TP
\fB\-\-no\-isl\-schedule\-parametric\fR
construct possibly parametric schedules
[default: yes]
.TP
\fB\-\-isl\-schedule\-outer\-coincidence\fR
try to construct schedules where the outer
member of each band satisfies the
coincidence constraints [default: no]
.TP
\fB\-\-isl\-schedule\-maximize\-band\-depth\fR
maximize the number of scheduling dimensions
in a band [default: no]
.TP
\fB\-\-isl\-schedule\-maximize\-coincidence\fR
maximize the number of coincident dimensions
in a band [default: no]
.TP
\fB\-\-no\-isl\-schedule\-split\-scaled\fR
split non\-tilable bands with scaled schedules
[default: yes]
.TP
\fB\-\-no\-isl\-schedule\-treat\-coalescing\fR
try and prevent or adjust schedules that
perform loop coalescing [default: yes]
.TP
\fB\-\-no\-isl\-schedule\-separate\-components\fR
separate components in dependence graph
[default: yes]
.TP
\fB\-\-isl\-schedule\-whole\-component\fR
try and compute schedule for entire
component first [default: no]
.TP
\fB\-\-isl\-schedule\-algorithm\fR=\fI\,isl\/\fR|feautrier
scheduling algorithm to use [default: isl]
.TP
\fB\-\-no\-isl\-schedule\-carry\-self\-first\fR
try and carry self\-dependences first
[default: yes]
.TP
\fB\-\-isl\-schedule\-serialize\-sccs\fR
serialize strongly connected components in
dependence graph [default: no]
.TP
\fB\-\-no\-isl\-tile\-scale\-tile\-loops\fR
scale tile loops [default: yes]
.TP
\fB\-\-no\-isl\-tile\-shift\-point\-loops\fR
shift point loops to start at zero
[default: yes]
.TP
\fB\-\-isl\-ast\-iterator\-type=\fR<type>
type used for iterators during printing of
AST [default: int]
.TP
\fB\-\-isl\-ast\-always\-print\-block\fR
print for and if bodies as a block
regardless of the number of statements in
the body [default: no]
.TP
\fB\-\-no\-isl\-ast\-print\-outermost\-block\fR
print outermost block node as a block
[default: yes]
.TP
\fB\-\-isl\-ast\-print\-macro\-once\fR
only print macro definitions once [default: no]
.TP
\fB\-\-no\-isl\-ast\-build\-atomic\-upper\-bound\fR
generate atomic upper bounds [default: yes]
.TP
\fB\-\-no\-isl\-ast\-build\-prefer\-pdiv\fR
prefer pdiv operation over fdiv [default: yes]
.TP
\fB\-\-isl\-ast\-build\-detect\-min\-max\fR
detect min/max expressions [default: no]
.TP
\fB\-\-no\-isl\-ast\-build\-exploit\-nested\-bounds\fR
simplify conditions based on bounds of
nested for loops [default: yes]
.TP
\fB\-\-isl\-ast\-build\-group\-coscheduled\fR
keep coscheduled domain elements together
[default: no]
.TP
\fB\-\-isl\-ast\-build\-separation\-bounds\fR=\fI\,explicit\/\fR|implicit
bounds to use during separation
[default: explicit]
.TP
\fB\-\-no\-isl\-ast\-build\-scale\-strides\fR
allow iterators of strided loops to be
scaled down [default: yes]
.TP
\fB\-\-no\-isl\-ast\-build\-allow\-else\fR
generate if statements with else branches
[default: yes]
.TP
\fB\-\-no\-isl\-ast\-build\-allow\-or\fR
generate if conditions with disjunctions
[default: yes]
.TP
\fB\-\-isl\-print\-stats\fR
print statistics for every isl_ctx [default: no]
.TP
\fB\-\-isl\-max\-operations\fR=\fI\,ulong\/\fR
default number of maximal operations per
isl_ctx
.IP
polynomial approximation
.TP
\fB\-\-polynomial\-approximation\fR=\fI\,lower\/\fR|upper
[default: none]
.TP
\fB\-\-approximation\-method\fR=\fI\,drop\/\fR|scale|volume|bernoulli
method to use in polynomial approximation
[default: none]
.TP
\fB\-\-scale\-options\fR=\fI\,fast\/\fR|slow,narrow|narrow2,chamber
[default: slow]
.TP
\fB\-\-volume\-triangulation\fR=\fI\,lift\/\fR|vertex|barycenter
type of triangulation to perform in volume
computation [default: vertex]
.HP
\fB\-V\fR, \fB\-\-version\fR
.TP
\fB\-h\fR, \fB\-\-help\fR
print this help, then exit