Julien Fischer cdf9ccf352 Use promise_equivalent_solutions scopes in place of ...

Estimated hours taken: 0.5
Branches: main

compiler/assertion.m:
compiler/magic.m:
compiler/mercury_compile.m:
compiler/ml_code_gen.m:
compiler/modes.m:
compiler/modules.m:
compiler/options_file.m:
compiler/recompilation.check.m:
compiler/recompiltaion.usage.m:
	Use promise_equivalent_solutions scopes in place of
	promise_only_solution and promise_only_solution_io in the compiler.

2005-09-26 05:48:10 +00:00

..

notes

Fix the problems with mutable declarations and sub-modules by making

2005-09-15 07:38:47 +00:00

.cvsignore

…

.mgnuc_copts

…

.mgnuc_opts

Reduce even further the clutter of boring command line arguments.

2005-09-19 08:07:15 +00:00

.nocopyright

Reduce even further the clutter of boring command line arguments.

2005-09-19 08:07:15 +00:00

abstract_mode_constraints.m

…

accumulator.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

add_aditi.m

…

add_class.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

add_clause.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

add_heap_ops.m

Convert these modules to four-space indentation.

2005-09-22 06:08:40 +00:00

add_mode.m

…

add_pragma.m

Enable more meaningful experimentation with inlining parameters.

2005-09-12 08:41:57 +00:00

add_pred.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

add_solver.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

add_special_pred.m

…

add_trail_ops.m

Convert these modules to four-space indentation.

2005-09-22 06:08:40 +00:00

add_type.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

aditi_backend.pp

…

aditi_builtin_ops.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

arg_info.m

…

assertion.m

Use promise_equivalent_solutions scopes in place of

2005-09-26 05:48:10 +00:00

atsort.m

…

backend_libs.m

…

base_typeclass_info.m

Fix overlong lines.

2005-09-19 04:29:01 +00:00

basic_block.m

Generate better code for base relations such as the ones in the transitive

2005-09-07 06:51:57 +00:00

build_mode_constraints.m

…

builtin_ops.m

Make int.plus, int.minus and int.times builtin operations, with

2005-09-13 08:48:36 +00:00

bytecode_backend.m

…

bytecode_data.m

…

bytecode_gen.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

bytecode.m

…

c_util.m

…

call_gen.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

call_graph.m

…

check_hlds.m

…

check_typeclass.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

clause_to_proc.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

closure_analysis.m

…

code_gen.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

code_info.m

Introduce a mechanism for extending the det and nondet stacks when needed.

2005-09-13 08:25:44 +00:00

code_model.m

…

code_util.m

…

commit_gen.m

…

common.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

COMP_FLAGS.in

…

compile_target_code.m

Introduce a mechanism for extending the det and nondet stacks when needed.

2005-09-13 08:25:44 +00:00

complexity.m

…

const_prop.m

…

constraint.m

…

context.m

…

continuation_info.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

cse_detection.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

dead_proc_elim.m

…

deep_profiling.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

deforest.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

delay_construct.m

…

delay_info.m

…

delay_slot.m

…

dense_switch.m

Generate better code for base relations such as the ones in the transitive

2005-09-07 06:51:57 +00:00

dependency_graph.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

det_analysis.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

det_report.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

det_util.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

disj_gen.m

…

dnf.m

…

dupelim.m

Fix an incomplete switch in dupelim.m.

2005-09-19 08:53:48 +00:00

dupproc.m

When returning from det and semidet predicates, load the return address into a

2005-09-14 01:29:21 +00:00

equiv_type_hlds.m

Minor style fixes.

2005-09-22 06:15:25 +00:00

equiv_type.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

error_util.m

…

exception_analysis.m

…

export.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

exprn_aux.m

When returning from det and semidet predicates, load the return address into a

2005-09-14 01:29:21 +00:00

fact_table.m

Some style fixes. Make some predicates into functions, and delete

2005-09-22 06:29:28 +00:00

field_access.m

…

follow_code.m

…

follow_vars.m

…

foreign.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

frameopt.m

By optimizing away frames in some frequently used predicates such as

2005-09-09 02:43:09 +00:00

gcc.m

…

global_data.m

…

globals.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

goal_form.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

goal_path.m

…

goal_store.m

…

goal_util.m

Fix overlong lines.

2005-09-19 04:29:01 +00:00

graph_colour.m

…

handle_options.m

Introduce a mechanism for extending the det and nondet stacks when needed.

2005-09-13 08:25:44 +00:00

hhf.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

higher_order.m

Minor style fixes.

2005-09-22 06:15:25 +00:00

hlds_code_util.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

hlds_data.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

hlds_error_util.m

…

hlds_goal.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

hlds_llds.m

…

hlds_module.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

hlds_out.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

hlds_pred.m

This is step 1 of eliminating the arguments of the type_ctor_info, type_info,

2005-09-19 07:26:38 +00:00

hlds.m

…

il_peephole.m

…

ilasm.m

…

ilds.m

…

implication.m

…

inlining.m

Enable more meaningful experimentation with inlining parameters.

2005-09-12 08:41:57 +00:00

inst_graph.m

…

inst_match.m

Bring this module into line with our current coding standards.

2005-09-26 05:00:49 +00:00

inst_util.m

…

inst.m

…

instmap.m

…

intermod.m

Enable more meaningful experimentation with inlining parameters.

2005-09-12 08:41:57 +00:00

interval.m

…

ite_gen.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

java_util.m

…

jumpopt.m

When returning from det and semidet predicates, load the return address into a

2005-09-14 01:29:21 +00:00

labelopt.m

…

lambda.m

Fix overlong lines.

2005-09-19 04:29:01 +00:00

layout_out.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

layout.m

…

lco.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

libs.m

…

live_vars.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

livemap.m

When returning from det and semidet predicates, load the return address into a

2005-09-14 01:29:21 +00:00

liveness.m

…

ll_backend.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

ll_pseudo_type_info.m

…

llds_out.m

We already have an optimization in llds_out.m which tries to turn

2005-09-23 07:10:50 +00:00

llds.m

When returning from det and semidet predicates, load the return address into a

2005-09-14 01:29:21 +00:00

lookup_switch.m

…

loop_inv.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

lp_rational.m

…

lp.m

…

magic_util.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

magic.m

Use promise_equivalent_solutions scopes in place of

2005-09-26 05:48:10 +00:00

make_hlds_error.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

make_hlds_passes.m

Fix the problems with mutable declarations and sub-modules by making

2005-09-15 07:38:47 +00:00

make_hlds_warn.m

…

make_hlds.m

…

make_tags.m

…

make.dependencies.m

…

make.m

…

make.module_dep_file.m

…

make.module_target.m

…

make.program_target.m

…

make.util.m

…

mark_static_terms.m

…

matching.m

…

maybe_mlds_to_gcc.pp

…

mercury_compile.m

Use promise_equivalent_solutions scopes in place of

2005-09-26 05:48:10 +00:00

mercury_to_mercury.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

Mercury.options

…

middle_rec.m

When returning from det and semidet predicates, load the return address into a

2005-09-14 01:29:21 +00:00

ml_backend.m

Convert these modules to four space indentation, and clean up

2005-09-13 01:19:57 +00:00

ml_call_gen.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

ml_closure_gen.m

Convert these modules to four space indentation, and clean up

2005-09-13 01:19:57 +00:00

ml_code_gen.m

Use promise_equivalent_solutions scopes in place of

2005-09-26 05:48:10 +00:00

ml_code_util.m

This is step 1 of eliminating the arguments of the type_ctor_info, type_info,

2005-09-19 07:26:38 +00:00

ml_dense_switch.m

…

ml_elim_nested.m

Convert these modules to four space indentation, and clean up

2005-09-13 01:19:57 +00:00

ml_optimize.m

Convert these modules to four space indentation, and clean up

2005-09-13 01:19:57 +00:00

ml_simplify_switch.m

Convert these modules to four space indentation, and clean up

2005-09-13 01:19:57 +00:00

ml_string_switch.m

Convert these modules to four space indentation, and clean up

2005-09-13 01:19:57 +00:00

ml_switch_gen.m

Convert these modules to four space indentation, and clean up

2005-09-13 01:19:57 +00:00

ml_tag_switch.m

Convert these modules to four space indentation, and clean up

2005-09-13 01:19:57 +00:00

ml_tailcall.m

Convert these modules to four space indentation, and clean up

2005-09-13 01:19:57 +00:00

ml_type_gen.m

Convert these modules to four space indentation, and clean up

2005-09-13 01:19:57 +00:00

ml_unify_gen.m

Convert these modules to four-space indentation.

2005-09-22 06:08:40 +00:00

ml_util.m

This is step 1 of eliminating the arguments of the type_ctor_info, type_info,

2005-09-19 07:26:38 +00:00

mlds_to_c.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

mlds_to_gcc.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

mlds_to_il.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

mlds_to_ilasm.m

…

mlds_to_java.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

mlds_to_managed.m

…

mlds.m

…

Mmakefile

…

mmc_analysis.m

…

mode_constraint_robdd.m

…

mode_constraints.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

mode_debug.m

…

mode_errors.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

mode_info.m

…

mode_ordering.m

…

mode_robdd.check.m

…

mode_robdd.equiv_vars.m

…

mode_robdd.implications.m

…

mode_robdd.m

…

mode_robdd.r.m

…

mode_robdd.tfeir.m

…

mode_robdd.tfeirn.m

…

mode_robdd.tfer.m

…

mode_robdd.tfern.m

…

mode_robdd.tfr.m

…

mode_util.m

Minor style fixes.

2005-09-22 06:15:25 +00:00

modecheck_call.m

…

modecheck_unify.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

modes.m

Use promise_equivalent_solutions scopes in place of

2005-09-26 05:48:10 +00:00

module_qual.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

modules.m

Use promise_equivalent_solutions scopes in place of

2005-09-26 05:48:10 +00:00

name_mangle.m

…

opt_debug.m

Some style fixes. Make some predicates into functions, and delete

2005-09-22 06:29:28 +00:00

opt_util.m

When returning from det and semidet predicates, load the return address into a

2005-09-14 01:29:21 +00:00

optimize.m

When returning from det and semidet predicates, load the return address into a

2005-09-14 01:29:21 +00:00

options_file.m

Use promise_equivalent_solutions scopes in place of

2005-09-26 05:48:10 +00:00

options.m

Introduce a mechanism for extending the det and nondet stacks when needed.

2005-09-13 08:25:44 +00:00

par_conj_gen.m

…

parse_tree.m

Fix the problems with mutable declarations and sub-modules by making

2005-09-15 07:38:47 +00:00

passes_aux.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

pd_cost.m

…

pd_debug.m

…

pd_info.m

…

pd_term.m

…

pd_util.m

…

peephole.m

When returning from det and semidet predicates, load the return address into a

2005-09-14 01:29:21 +00:00

polyhedron.m

…

polymorphism.m

This is step 2 of eliminating the arguments of the type_ctor_info, type_info,

2005-09-22 06:17:33 +00:00

post_term_analysis.m

…

post_typecheck.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

pragma_c_gen.m

Generate better code for base relations such as the ones in the transitive

2005-09-07 06:51:57 +00:00

proc_label.m

…

process_util.m

…

prog_data.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

prog_foreign.m

…

prog_io_dcg.m

Improve the error checking for mutable declarations.

2005-09-12 03:05:51 +00:00

prog_io_goal.m

Remove support for old-style lambda expressions.

2005-09-13 03:25:43 +00:00

prog_io_pragma.m

Remove supported for deprecated syntax. The syntax removed is:

2005-09-12 08:20:27 +00:00

prog_io_typeclass.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

prog_io_util.m

Remove supported for deprecated syntax. The syntax removed is:

2005-09-12 08:20:27 +00:00

prog_io.m

Remove supported for deprecated syntax. The syntax removed is:

2005-09-12 08:20:27 +00:00

prog_mode.m

…

prog_mutable.m

Fix the problems with mutable declarations and sub-modules by making

2005-09-15 07:38:47 +00:00

prog_out.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

prog_rep.m

Allow subterms to be tracked through partial unifications in the

2005-09-13 04:04:07 +00:00

prog_type.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

prog_util.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

prop_mode_constraints.m

…

pseudo_type_info.m

This is step 1 of eliminating the arguments of the type_ctor_info, type_info,

2005-09-19 07:26:38 +00:00

purity.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

qual_info.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

quantification.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

rat.m

…

reassign.m

When returning from det and semidet predicates, load the return address into a

2005-09-14 01:29:21 +00:00

recompilation.check.m

Use promise_equivalent_solutions scopes in place of

2005-09-26 05:48:10 +00:00

recompilation.m

Remove supported for deprecated syntax. The syntax removed is:

2005-09-12 08:20:27 +00:00

recompilation.usage.m

Use promise_equivalent_solutions scopes in place of

2005-09-26 05:48:10 +00:00

recompilation.version.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

rl_analyse.m

…

rl_block_opt.m

…

rl_block.m

…

rl_code.m

…

rl_dump.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

rl_exprn.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

rl_file.pp

…

rl_gen.m

…

rl_info.m

Remove supported for deprecated syntax. The syntax removed is:

2005-09-12 08:20:27 +00:00

rl_key.m

…

rl_liveness.m

…

rl_loop.m

…

rl_opt.m

…

rl_out.pp

…

rl_relops.m

…

rl_sort.m

…

rl_stream.m

…

rl.m

…

rtti_out.m

Some style fixes. Make some predicates into functions, and delete

2005-09-22 06:29:28 +00:00

rtti_to_mlds.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

rtti.m

…

saved_vars.m

…

simplify.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

size_prof.m

This is step 2 of eliminating the arguments of the type_ctor_info, type_info,

2005-09-22 06:17:33 +00:00

source_file_map.m

…

source_stats.awk

…

special_pred.m

…

stack_alloc.m

…

stack_layout.m

This is step 1 of eliminating the arguments of the type_ctor_info, type_info,

2005-09-19 07:26:38 +00:00

stack_opt.m

…

state_var.m

Improve the error checking for mutable declarations.

2005-09-12 03:05:51 +00:00

store_alloc.m

…

stratify.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

string_switch.m

…

superhomogeneous.m

Remove support for old-style lambda expressions.

2005-09-13 03:25:43 +00:00

switch_detection.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

switch_gen.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

switch_util.m

…

table_gen.m

Make the I/O tabling transformation respect :- pragma no_inline directives

2005-09-16 05:42:58 +00:00

tag_switch.m

…

term_constr_build.m

…

term_constr_data.m

…

term_constr_errors.m

…

term_constr_fixpoint.m

…

term_constr_initial.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

term_constr_main.m

…

term_constr_pass2.m

…

term_constr_util.m

…

term_errors.m

…

term_norm.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

term_pass1.m

…

term_pass2.m

…

term_traversal.m

…

term_util.m

…

termination.m

…

timestamp.m

…

top_level.m

…

trace_params.m

Make the I/O tabling transformation respect :- pragma no_inline directives

2005-09-16 05:42:58 +00:00

trace.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

trans_opt.m

…

transform_hlds.m

…

transform_llds.m

…

transform.m

…

tree.m

…

tupling.m

…

type_class_info.m

…

type_ctor_info.m

This is step 2 of eliminating the arguments of the type_ctor_info, type_info,

2005-09-22 06:17:33 +00:00

type_util.m

This is step 2 of eliminating the arguments of the type_ctor_info, type_info,

2005-09-22 06:17:33 +00:00

typecheck_errors.m

Do not display the For more information try recompiling with -E'' prompt

2005-09-14 05:27:11 +00:00

typecheck_info.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

typecheck.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

typeclasses.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

unify_gen.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

unify_proc.m

Change the representation of types in the compiler.

2005-09-12 05:25:01 +00:00

unique_modes.m

…

unneeded_code.m

…

untupling.m

…

unused_args.m

…

use_local_vars.m

When returning from det and semidet predicates, load the return address into a

2005-09-14 01:29:21 +00:00

var_locn.m

Optimize calls that would be tail calls in Prolog but are followed by

2005-09-13 04:56:20 +00:00

vn_livemap.m

…

wrap_blocks.m

…