Home
last modified time | relevance | path

Searched refs:Workspace (Results 1 – 5 of 5) sorted by relevance

/freebsd-14.2/contrib/file/magic/Magdir/
H A Ddyadic25 # *.DWS Dyalog APL Workspace
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp2082 SmallVectorImpl<const Formula *> &Workspace,
5152 const LSRUse &LU = Uses[Workspace.size()]; in SolveRecurse()
5195 Workspace.push_back(&F); in SolveRecurse()
5196 if (Workspace.size() != Uses.size()) { in SolveRecurse()
5197 SolveRecurse(Solution, SolutionCost, Workspace, NewCost, in SolveRecurse()
5199 if (F.getNumRegs() == 1 && Workspace.size() == 1) in SolveRecurse()
5209 Solution = Workspace; in SolveRecurse()
5211 Workspace.pop_back(); in SolveRecurse()
5219 SmallVector<const Formula *, 8> Workspace; in Solve() local
5225 Workspace.reserve(Uses.size()); in Solve()
[all …]
/freebsd-14.2/contrib/one-true-awk/testdir/
H A Dfunstack.ok1730 Workspace . . . . . . . . . . . . . . . 198--202
2127 Time Using Bounded Workspace . . . . . . 251--252
2434 constant Workspace . . . . . . . . . . . 352--354 (or 353--354??)
H A Dfunstack.in12971 title = "Copying List Structures Using Bounded Workspace",
16052 title = "Copying Cyclic List Structures in Linear Time Using Bounded Workspace",
18484 title = "An Efficient List Moving Algorithm Using constant Workspace",
/freebsd-14.2/contrib/ncurses/misc/
H A Dterminfo.src8990 # Use `glasstty' for the Workspace application