|Copyright||(c) The University of Glasgow 1998-2002|
|Portability||non-portable (GHC Extensions)|
A weak pointer object with a key and a value. The value has type
A weak pointer expresses a relationship between two objects, the key and the value: if the key is considered to be alive by the garbage collector, then the value is also alive. A reference from the value to the key does not keep the key alive.
A weak pointer may also have a finalizer of type
IO (); if it does, then the finalizer will be run at most once, at a time after the key has become unreachable by the program ("dead"). The storage manager attempts to run the finalizer(s) for an object soon after the object dies, but promptness is not guaranteed.
It is not guaranteed that a finalizer will eventually run, and no attempt is made to run outstanding finalizers when the program exits. Therefore finalizers should not be relied on to clean up resources - other methods (eg. exception handlers) should be employed, possibly in addition to finalizers.
References from the finalizer to the key are treated in the same way as references from the value to the key: they do not keep the key alive. A finalizer may therefore ressurrect the key, perhaps by storing it in the same data structure.
The finalizer, and the relationship between the key and the value, exist regardless of whether the program keeps a reference to the
Weak object or not.
There may be multiple weak pointers with the same key. In this case, the finalizers for each of these weak pointers will all be run in some arbitrary order, or perhaps concurrently, when the key dies. If the programmer specifies a finalizer that assumes it has the only reference to an object (for example, a file that it wishes to close), then the programmer must ensure that there is only one such finalizer.
If there are no other threads to run, the runtime system will check for runnable finalizers before declaring the system to be deadlocked.
WARNING: weak pointers to ordinary non-primitive Haskell types are particularly fragile, because the compiler is free to optimise away or duplicate the underlying data structure. Therefore attempting to place a finalizer on an ordinary Haskell type may well result in the finalizer running earlier than you expected. This is not a problem for caches and memo tables where early finalization is benign.
Finalizers can be used reliably for types that are created explicitly and have identity, such as
MVar. However, to place a finalizer on one of these types, you should use the specific operation provided for that type, e.g.
addMVarFinalizer respectively (the non-uniformity is accidental). These operations attach the finalizer to the primitive object inside the box (e.g.
MutVar# in the case of
IORef), because attaching the finalizer to the box itself fails when the outer box is optimised away by the compiler.
|-> Maybe (IO ())||
|-> IO (Weak v)||
returns: a weak pointer object
Establishes a weak pointer to
k, with value
v and a finalizer.
This is the most general interface for building a weak pointer.
deRefWeak :: Weak v -> IO (Maybe v) Source
Dereferences a weak pointer. If the key is still alive, then
Just v is returned (where
v is the value in the weak pointer), otherwise
Nothing is returned.
The return value of
deRefWeak depends on when the garbage collector runs, hence it is in the
finalize :: Weak v -> IO () Source
Causes a the finalizer associated with a weak pointer to be run immediately.
runFinalizerBatch :: Int -> Array# (State# RealWorld -> State# RealWorld) -> IO () Source
© The University of Glasgow and others
Licensed under a BSD-style license (see top of the page).