【发布时间】:2019-10-31 15:22:54
【问题描述】:
AFAIK,有两种方法可以在 Haskell 中获取用于调试的调用堆栈:
- 在代码中添加
HasCallStack约束 - 用
ghc -prof -fprof-auto-top编译代码
我的测试代码:
import GHC.Stack
-- | a wrapper function to make "last" from base traceable
last' :: HasCallStack => [a] -> a
last' xs = case xs of [] -> error "abuse last"; _ -> last xs
-- | a untraceable partial function
foo :: [Int] -> Int
foo xs = last' xs + 1
-- | a untraceable partial function
-- , which looks like traceable, but it's call stack is cut off by "foo"
bar :: HasCallStack => [Int] -> Int
bar xs = foo xs
-- | an empty list
-- , which is also an improper input of "last'"
xs :: [Int]
xs = []
-- | the program is expected to print a call stack telling how "bar" is called
-- , but we can only know that "foo" called "last'" improperly from the printed call stack
main :: IO ()
main = print $ bar xs
以下是我通过this测试代码从以上两种方式得到的调用栈:
$ ghc -prof -fprof-auto call-stack-cut-off.hs
$ ./call-stack-cut-off
call-stack-cut-off: abuse last
CallStack (from HasCallStack):
error, called at call-stack-cut-off.hs:5:29 in main:Main
last', called at call-stack-cut-off.hs:9:10 in main:Main
CallStack (from -prof):
Main.last' (call-stack-cut-off.hs:5:1-60)
Main.foo (call-stack-cut-off.hs:9:1-21)
Main.bar (call-stack-cut-off.hs:14:1-15)
Main.main (call-stack-cut-off.hs:24:1-21)
Main.CAF (<entire-module>)
IMO,来自-prof 的调用堆栈已经足够好并且更易于使用。所以我想知道为什么还要添加HasCallStack 机制。这两种方式之间是否存在一些会显着影响调试体验的差异?
【问题讨论】: