Files
mercury/extras/references/reference.m
Julien Fischer 778134ff1e Avoid purity mismatches between predicate delcarations and
Estimated hours taken: 0.1
Branches: main, release

extras/references/nb_references.m:
extras/references/reference.m:
extras/references/scoped_update.m:
	Avoid purity mismatches between predicate delcarations and
	foreign clauses.
2006-07-28 05:23:17 +00:00

153 lines
4.9 KiB
Mathematica

%-----------------------------------------------------------------------------%
% Copyright (C) 1998-2000,2002-2004, 2006 The University of Melbourne.
% This file may only be copied under the terms of the GNU Library General
% Public License - see the file COPYING.LIB in the Mercury distribution.
%-----------------------------------------------------------------------------%
%
% File : reference.m
% Authors : pets (Peter Schachte)
% Stability : low
% Purpose : A backtrackably modifiable storage type
%
% This module defines a type which is, in essence, a ``box'' into which you
% can put any term, and later destructively replace the contents with
% something else. The store module in the standard library provides a clean
% way to do exactly the same thing; the difference is that the reference
% module allows you to do it without threading a store through your code. The
% price for this convenience is that you must mark all predicates that create
% or modify a reference, and all the predicates that call them, and so on, as
% impure. This is probably more inconvenient than just threading the store
% through your code, so this module should probably only be used in
% exceptional circumstances.
%
% This module is implemented using the trailing features described in the
% "Trailing" section of the "C interface" chapter of the Mercury Language
% Reference Manual. This means that in order to use this module, you *must*
% compile with the --use-trail switch. The easiest way to do this is to
% include the line
%
% GRADEFLAGS=--use-trail
%
% in your Mmakefile.
:- module reference.
:- interface.
% A backtrackably destructively modifiable reference type.
:- type reference(T).
% Create a new reference given a term for it to (initially) refer to.
:- impure pred new_reference(T::in, reference(T)::out) is det.
% Get the value currently referred to by a reference.
:- semipure pred value(reference(T)::in, T::out) is det.
% (backtrackably) modify a reference to refer to a new object.
:- impure pred update(reference(T)::in, T::in) is det.
:- implementation.
% This type is implemented in C.
:- type reference(T) ---> reference(c_pointer).
:- pragma foreign_decl("C", "#include ""c_reference.h""").
:- pragma inline(new_reference/2).
new_reference(X, reference(Ref)) :-
impure new_reference_2(X, Ref).
:- impure pred new_reference_2(T::in, c_pointer::out) is det.
:- pragma inline(new_reference_2/2).
:- pragma foreign_proc("C",
new_reference_2(X::in, Ref::out),
[will_not_call_mercury],
"
MR_incr_hp(Ref, (sizeof(ME_Reference) + sizeof(MR_Word) - 1) /
sizeof(MR_Word));
((ME_Reference *) Ref)->value = (void *) X;
/*
** Use MR_null_choicepoint_id here instead of
** MR_current_choicepoint_id, in case this is called from
** a tabled pred/func -- even if it isn't, this will only
** result in one additional (redundant) entry on the trail.
*/
((ME_Reference *) Ref)->id = MR_null_choicepoint_id();
").
:- pragma inline(value/2).
value(reference(Ref), X) :-
semipure value_2(Ref, X).
:- semipure pred value_2(c_pointer::in, T::out) is det.
:- pragma inline(value_2/2).
:- pragma foreign_proc("C",
value_2(Ref::in, X::out),
[promise_semipure, will_not_call_mercury],
"
X = (MR_Word) ((ME_Reference *) Ref)->value;
").
:- pragma inline(update/2).
update(reference(Ref), X) :-
impure update_2(Ref, X).
:- impure pred update_2(c_pointer::in, T::in) is det.
:- pragma inline(update_2/2).
:- pragma foreign_proc("C",
update_2(Ref::in, X::in),
[will_not_call_mercury],
"
ME_Reference *ref = (ME_Reference *) Ref;
if (ref->id != MR_current_choicepoint_id()) {
MR_trail_current_value((MR_Word *) (&ref->value));
MR_trail_current_value((MR_Word *) (&ref->id));
ref->id = MR_current_choicepoint_id();
}
ref->value = (void *) X;
").
:- interface.
% init(Ref, Value)
% Initialise a reference Ref to have value Value.
% This is for use with user-declared ME_References (see
% c_reference.h), and must be called before using such a reference.
% Attempting to access the reference before it is initialised or
% after the init call is backtracked is undefined.
:- impure pred init(reference(T)::in, T::in) is det.
% from_c_pointer(CPointer) = Ref
% Convert a c_pointer to a reference.
:- func reference__from_c_pointer(c_pointer) = reference(T).
% to_c_pointer(Ref) = CPointer
% Convert a reference to a c_pointer.
:- func reference__to_c_pointer(reference(T)) = c_pointer.
:- implementation.
:- pragma inline(init/2).
init(reference(Ref), X) :-
impure init_2(Ref, X).
:- impure pred init_2(c_pointer::in, T::in) is det.
:- pragma inline(init_2/2).
:- pragma foreign_proc("C",
init_2(Ref::in, X::in),
[will_not_call_mercury],
"
((ME_Reference *) Ref)->value = (void *) X;
((ME_Reference *) Ref)->id = MR_current_choicepoint_id();
").
:- pragma inline(reference__from_c_pointer/1).
reference__from_c_pointer(CPointer) = reference(CPointer).
:- pragma inline(reference__to_c_pointer/1).
reference__to_c_pointer(reference(CPointer)) = CPointer.