1994-06-24 11:31:16 +00:00
|
|
|
/* $Id$ */
|
1987-03-09 19:15:41 +00:00
|
|
|
/*
|
|
|
|
* (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands.
|
|
|
|
* See the copyright notice in the ACK home directory, in the file "Copyright".
|
|
|
|
*/
|
1984-11-26 14:35:32 +00:00
|
|
|
|
|
|
|
/* R E G I S T E R A L L O C A T I O N
|
|
|
|
*
|
|
|
|
* R A _ I N T E R V A L . H
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
2019-10-31 22:05:22 +00:00
|
|
|
interv_p cons_interval(short t_start, short t_stop);
|
|
|
|
/*
|
1984-11-26 14:35:32 +00:00
|
|
|
* construct an interval
|
|
|
|
*/
|
2019-10-31 22:05:22 +00:00
|
|
|
void add_interval(short t1, short t2, interv_p *list);
|
|
|
|
/*
|
1984-11-26 14:35:32 +00:00
|
|
|
* Add interval (t1,t2) to the list of
|
|
|
|
* intervals (which is an in-out parameter!).
|
|
|
|
*/
|
2019-10-31 22:05:22 +00:00
|
|
|
interv_p loop_lifetime(loop_p lp);
|
|
|
|
/*
|
1984-11-26 14:35:32 +00:00
|
|
|
* Determine the timespan of the loop,
|
|
|
|
* expressed as a list of intervals.
|
|
|
|
*/
|
2019-10-31 22:05:22 +00:00
|
|
|
interv_p proc_lifetime(proc_p p);
|
|
|
|
/*
|
1984-11-26 14:35:32 +00:00
|
|
|
* Determine the timespan of a procedure,
|
|
|
|
* expressed as an interval.
|
|
|
|
*/
|
2019-10-31 22:05:22 +00:00
|
|
|
interv_p intersect(interv_p list1, interv_p list2);
|
|
|
|
/*
|
1984-11-26 14:35:32 +00:00
|
|
|
* Intersect two lifetimes, each denoted
|
|
|
|
* by a list of intervals.
|
|
|
|
*/
|
2019-10-31 22:05:22 +00:00
|
|
|
bool not_disjoint(interv_p list1, interv_p list2);
|
|
|
|
/*
|
1984-11-26 14:35:32 +00:00
|
|
|
* See if list1 and list2 do overlap somewhere.
|
|
|
|
*/
|
2019-10-31 22:05:22 +00:00
|
|
|
bool contains(short t, interv_p timespan);
|
|
|
|
/*
|
1984-11-26 14:35:32 +00:00
|
|
|
* See if t is part of the timespan.
|
|
|
|
*/
|
2019-10-31 22:05:22 +00:00
|
|
|
interv_p copy_timespan(interv_p list);
|
|
|
|
/*
|
1984-11-26 14:35:32 +00:00
|
|
|
* Make a copy of the timespan.
|
|
|
|
*/
|