diff options
author | Trịnh Tuấn Phương <lolo_vn@yahoo.co.uk> | 2019-04-26 05:43:35 -0400 |
---|---|---|
committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2019-05-30 16:43:31 -0400 |
commit | 4212918096ab1a9eb5d7c9c35fa2441978fcd4b8 (patch) | |
tree | ffe30106ee7e5068d45a1c553ac1058485609f21 | |
parent | f81f3964b718eab21f0cfe65067c195f2f2a84bd (diff) | |
download | haskell-4212918096ab1a9eb5d7c9c35fa2441978fcd4b8.tar.gz |
Apply suggestion to rts/CheckUnload.c
-rw-r--r-- | rts/CheckUnload.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/rts/CheckUnload.c b/rts/CheckUnload.c index de8180526b..084e85b728 100644 --- a/rts/CheckUnload.c +++ b/rts/CheckUnload.c @@ -42,7 +42,7 @@ // In certain circumstances, there may be a lot of unloaded ObjectCode structs // chained in `unloaded_objects` (such as when users `:load` a module in a very // big repo in GHCi). To speed up checking whether an address lies within any of -// these objects, we populate the addresses of the their mapped sections in +// these objects, we populate the addresses of their mapped sections in // an array sorted by their `start` address and do binary search for our address // on that array. Note that this works because the sections are mapped to mutual // exclusive memory regions, so we can simply find the largest lower bound among |