|
definition:
|
getAllFunctions :: Options -> IORef ProgInfo -> [QName] -> IO [FuncDecl]
getAllFunctions opts pistore newfuns = do
mods <- fmap (map (miProg . snd) . progInfos) $ readIORef pistore
getAllFuncs mods preloadedFuncDecls newfuns
where
getAllFuncs _ currfuncs [] = return (reverse currfuncs)
getAllFuncs allmods currfuncs (newfun:newfuncs)
| newfun `elem` excludedCurryOperations ||
newfun `elem` map (pre . fst) primNames ||
newfun `elem` map funcName currfuncs || isPrimOp newfun
= getAllFuncs allmods currfuncs newfuncs
| fst newfun `elem` map progName allmods -- module already loaded:
= maybe (error $ "getAllFunctions: " ++ show newfun ++ " not found!")
(\fdecl -> --print fdecl >>
getAllFuncs allmods (fdecl : currfuncs)
(newfuncs ++
filter (`notElem` excludedCurryOperations)
(funcsOfFuncDecl fdecl)))
(find (\fd -> funcName fd == newfun)
(maybe []
progFuncs
(find (\m -> progName m == fst newfun) allmods)))
| otherwise -- we must load a new module
= do let mname = fst newfun
printWhenStatus opts $
"Loading module '" ++ mname ++ "' for '"++ snd newfun ++"'"
addModInfoFor pistore mname
newmod <- fmap miProg $ getModInfoFor pistore mname
getAllFuncs (newmod : allmods) currfuncs (newfun:newfuncs)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
------------------------------------------------------------------------------
--- Extract all user-defined FlatCurry functions that might be called
--- by a given list of function names provided as the last argument.
--- The second argument is an `IORef` to the currently loaded modules.
--- Its contents will be extended when necessary.
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_) |-> _}
|
|
name:
|
getAllFunctions
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Verify.Options.Options -> Data.IORef.IORef Verify.ProgInfo.ProgInfo
-> [(String, String)] -> Prelude.IO [FlatCurry.Types.FuncDecl]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|