head     56.3;
access   paws bayes jws quist brad dew jwh;
symbols  ;
locks    ; strict;
comment  @# @;


56.3
date     93.01.27.13.18.31;  author jwh;  state Exp;
branches ;
next     56.2;

56.2
date     93.01.27.11.59.38;  author jwh;  state Exp;
branches ;
next     56.1;

56.1
date     91.11.05.09.55.52;  author jwh;  state Exp;
branches ;
next     55.1;

55.1
date     91.08.25.10.31.17;  author jwh;  state Exp;
branches ;
next     54.3;

54.3
date     91.08.21.10.38.05;  author jwh;  state Exp;
branches ;
next     54.2;

54.2
date     91.08.21.09.42.04;  author jwh;  state Exp;
branches ;
next     54.1;

54.1
date     91.03.18.15.32.43;  author jwh;  state Exp;
branches ;
next     53.1;

53.1
date     91.03.11.19.32.40;  author jwh;  state Exp;
branches ;
next     52.1;

52.1
date     91.02.19.09.17.52;  author jwh;  state Exp;
branches ;
next     51.1;

51.1
date     91.01.30.16.17.12;  author jwh;  state Exp;
branches ;
next     50.1;

50.1
date     90.10.29.16.31.17;  author jwh;  state Exp;
branches ;
next     49.1;

49.1
date     90.08.14.14.15.02;  author jwh;  state Exp;
branches ;
next     48.1;

48.1
date     90.07.26.11.21.29;  author jwh;  state Exp;
branches ;
next     47.1;

47.1
date     90.05.14.11.06.19;  author dew;  state Exp;
branches ;
next     46.1;

46.1
date     90.05.07.08.53.19;  author jwh;  state Exp;
branches ;
next     45.1;

45.1
date     90.04.19.16.01.16;  author jwh;  state Exp;
branches ;
next     44.1;

44.1
date     90.04.01.22.18.25;  author jwh;  state Exp;
branches ;
next     43.1;

43.1
date     90.03.20.14.11.07;  author jwh;  state Exp;
branches ;
next     42.1;

42.1
date     90.01.23.17.55.20;  author jwh;  state Exp;
branches ;
next     41.1;

41.1
date     89.12.22.11.37.31;  author jwh;  state Exp;
branches ;
next     40.1;

40.1
date     89.09.29.11.58.36;  author jwh;  state Exp;
branches ;
next     39.1;

39.1
date     89.09.26.16.43.23;  author dew;  state Exp;
branches ;
next     38.1;

38.1
date     89.08.29.11.35.23;  author jwh;  state Exp;
branches ;
next     37.1;

37.1
date     89.05.12.11.49.11;  author dew;  state Exp;
branches ;
next     36.1;

36.1
date     89.02.06.10.26.49;  author dew;  state Exp;
branches ;
next     35.1;

35.1
date     89.02.02.13.42.23;  author dew;  state Exp;
branches ;
next     34.1;

34.1
date     89.01.23.16.17.36;  author jwh;  state Exp;
branches ;
next     33.1;

33.1
date     89.01.16.11.49.01;  author dew;  state Exp;
branches ;
next     32.1;

32.1
date     89.01.10.11.58.20;  author bayes;  state Exp;
branches ;
next     31.1;

31.1
date     88.12.14.18.19.10;  author bayes;  state Exp;
branches ;
next     30.1;

30.1
date     88.12.09.13.56.16;  author dew;  state Exp;
branches ;
next     29.1;

29.1
date     88.10.31.15.40.49;  author bayes;  state Exp;
branches ;
next     28.1;

28.1
date     88.10.06.11.07.03;  author dew;  state Exp;
branches ;
next     27.1;

27.1
date     88.09.29.11.49.49;  author bayes;  state Exp;
branches ;
next     26.1;

26.1
date     88.09.28.13.38.39;  author bayes;  state Exp;
branches ;
next     25.1;

25.1
date     88.03.02.09.44.16;  author bayes;  state Exp;
branches ;
next     24.1;

24.1
date     87.08.31.10.15.12;  author jws;  state Exp;
branches ;
next     23.1;

23.1
date     87.08.26.11.00.45;  author bayes;  state Exp;
branches ;
next     22.1;

22.1
date     87.08.17.11.40.23;  author bayes;  state Exp;
branches ;
next     21.1;

21.1
date     87.08.12.14.24.29;  author bayes;  state Exp;
branches ;
next     20.1;

20.1
date     87.07.30.11.36.07;  author bayes;  state Exp;
branches ;
next     19.1;

19.1
date     87.06.01.08.50.11;  author jws;  state Exp;
branches ;
next     18.1;

18.1
date     87.05.20.15.55.32;  author bayes;  state Exp;
branches ;
next     17.1;

17.1
date     87.04.30.10.59.26;  author jws;  state Exp;
branches ;
next     16.1;

16.1
date     87.04.26.16.09.41;  author jws;  state Exp;
branches ;
next     15.1;

15.1
date     87.04.13.09.50.15;  author jws;  state Exp;
branches ;
next     14.1;

14.1
date     87.04.01.15.59.50;  author jws;  state Exp;
branches ;
next     13.1;

13.1
date     87.02.28.18.52.57;  author jws;  state Exp;
branches ;
next     12.1;

12.1
date     87.02.02.13.46.37;  author jws;  state Exp;
branches ;
next     11.1;

11.1
date     87.01.19.10.12.39;  author jws;  state Exp;
branches ;
next     10.1;

10.1
date     86.12.24.11.27.53;  author jws;  state Exp;
branches ;
next     9.1;

9.1
date     86.12.12.15.11.28;  author bayes;  state Exp;
branches ;
next     8.1;

8.1
date     86.11.27.12.21.09;  author jws;  state Exp;
branches ;
next     7.1;

7.1
date     86.11.20.14.32.41;  author hal;  state Exp;
branches ;
next     6.1;

6.1
date     86.11.04.18.26.28;  author paws;  state Exp;
branches ;
next     5.1;

5.1
date     86.10.28.17.15.43;  author hal;  state Exp;
branches ;
next     4.1;

4.1
date     86.09.30.20.09.47;  author hal;  state Exp;
branches ;
next     3.1;

3.1
date     86.09.01.12.20.41;  author hal;  state Exp;
branches ;
next     2.1;

2.1
date     86.07.30.15.09.20;  author hal;  state Exp;
branches ;
next     1.1;

1.1
date     86.06.30.16.45.18;  author danm;  state tmp;
branches ;
next     ;


desc
@Base file for PWS 3.2 release.

@


56.3
log
@
pws2rcs automatic delta on Wed Jan 27 13:14:25 MST 1993
@
text
@*------------------------------------------
 DEF ASM_DIV
 DEF ASM_MOD
*------------------------------------------
*               register usage
*               d0 - return address
*               d1 - divisor
*               d2 - dividend and quotient
*               d3 - remainder
*               d4 - loop counter
*               d5 - sign of remainder
*               d6 - sign of quotent
*               d7 - mod/div flag
*
ovflow          trap            #4
valrange        trap            #7
asm_mod         moveq           #1,d7           set mod flag
		movem.l         (sp)+,d0/d1/d2  read return addr and operands
		tst.l           d1              divide by zero?
		bpl.s           d_start         for mod?
		bra.s           valrange
asm_div         moveq           #0,d7           clear mod flag
		movem.l         (sp)+,d0/d1/d2  read return addr and operands
		tst.l           d1              divide by zero?
d_start         beq.s           zerodiv
		movea.w         d1,a0           is divisor a
		cmp.l           a0,d1           16 bit integer?
		bne.s           do_full
		move.l          d2,d3           try signed divide
		divs            d1,d3
		bvs.s           do_full         did it work?
		tst.w           d7              mod or div?
		beq.s           div_1
		swap            d3
		tst.w           d3              if mod is negative
		bpl.s           div_1           teen
		add.w           d1,d3           add back divisor
div_1           ext.l           d3
dm_out          move.l          d3,-(sp)        push result
		movea.l         d0,a0
		jmp             (a0)            fake return
zerodiv         trap            #5
*
*               convert divisor and dividend to sign magnitude
*
do_full         moveq           #15,d4          loop count - 1
		moveq           #0,d6           sign of quotient
		moveq           #0,d5           sign of remainder
		tst.l           d1              divisor negative?
		bpl.s           divend
		neg.l           d1
		bvs.s           max_neg_dvsr
		not.w           d6              set sign flag
divend          tst.l           d2              dividend negative
		bpl.s           rmndr
		neg.l           d2              complement quotient sign
		bvc.s           not_special
		cmp.l           #1,d1           test for minint div -1
		bne.s           not_special
		tst.w           d6
		bne.s           ovflow
not_special     not             d6              flag
		not             d5              negative remainder
rmndr           moveq           #0,d3           clear remainder
		swap            d1              is divisor <= 16 bits
		tst.w           d1
		bne.s           big_div
		swap            d2
		swap            d1
		move.w          d2,d3           get high order dividend
		divu            d1,d3           high part of divide
		move.w          d3,d2           high quotient to d2
		swap            d2
		move.w          d2,d3           divide low order
		divu            d1,d3           dividend by divisor
		move.w          d3,d2           quotient in d2
		clr.w           d3
		swap            d3              remainder in d3
*               put in correct sign for quotient and remainder
dm_fixup        tst.w           d6
		bpl.s           chk_rem
		neg.l           d2
chk_rem         tst.w           d5
		bpl.s           dm_store
		neg.l           d3
dm_store        tst.w           d7              div or mod?
		bne.s           mod_out
		move.l          d2,d3
		bra.s           dm_out
mod_out         tst.l           d3              if negative mod
		bpl.s           dm_out          then
		add.l           d1,d3           then add back divisor
		bra.s           dm_out
*
*               handle maximum negative divisor
*
max_neg_dvsr    neg.l           d2
		bvs.s           max_max         test for max neg dividend
		move.l          d2,d3
		neg.l           d3
		moveq           #0,d2
		bra.s           dm_store
max_max         moveq           #1,d2
		moveq           #0,d3
		bra.s           dm_store
*
*               32 bit divisor
*
big_div         swap            d1              restore divisor
		swap            d2              move high order
		move.w          d2,d3           dividend to remainder
		clr.w           d2              shift dividend 16 bits left
		sub.l           d1,d3           subtract divisor from rem.
		movea.l         d1,a0           divisor in d1
		neg.l           d1              minus divisor in a0
		exg             d1,a0
*
*               co-routine for negative remainder
*
m_top           add.l           d2,d2           shift dividend and quotient
		addx.l          d3,d3           shift remainder
		add.l           d1,d3           add divisor
		bpl.s           p_bottom        remainder positive?
m_bottom        dbra            d4,m_top        loop 16 times
		add.l           d1,d3           restore remainder
		add.l           d2,d2           shift in last bit of quotient
		bra.s           dm_fixup
*
*               co-routine for positive remainder
*
p_top           addx.l          d2,d2           shift dividend and quotient
		addx.l          d3,d3           shift remainder
		add.l           a0,d3           subtract divisor
		bmi.s           m_bottom        remainder negative?
p_bottom        dbra            d4,p_top        loop 16 times
		addx.l          d2,d2           shift in last bit of quotient
		bra.s           dm_fixup
	end
@


56.2
log
@
pws2rcs automatic delta on Wed Jan 27 11:57:27 MST 1993
@
text
@d1 138
@


56.1
log
@Automatic bump of revision number for PWS version 3.25
@
text
@a0 138
*------------------------------------------
 DEF ASM_DIV
 DEF ASM_MOD
*------------------------------------------
*               register usage
*               d0 - return address
*               d1 - divisor
*               d2 - dividend and quotient
*               d3 - remainder
*               d4 - loop counter
*               d5 - sign of remainder
*               d6 - sign of quotent
*               d7 - mod/div flag
*
ovflow          trap            #4
valrange        trap            #7
asm_mod         moveq           #1,d7           set mod flag
		movem.l         (sp)+,d0/d1/d2  read return addr and operands
		tst.l           d1              divide by zero?
		bpl.s           d_start         for mod?
		bra.s           valrange
asm_div         moveq           #0,d7           clear mod flag
		movem.l         (sp)+,d0/d1/d2  read return addr and operands
		tst.l           d1              divide by zero?
d_start         beq.s           zerodiv
		movea.w         d1,a0           is divisor a
		cmp.l           a0,d1           16 bit integer?
		bne.s           do_full
		move.l          d2,d3           try signed divide
		divs            d1,d3
		bvs.s           do_full         did it work?
		tst.w           d7              mod or div?
		beq.s           div_1
		swap            d3
		tst.w           d3              if mod is negative
		bpl.s           div_1           teen
		add.w           d1,d3           add back divisor
div_1           ext.l           d3
dm_out          move.l          d3,-(sp)        push result
		movea.l         d0,a0
		jmp             (a0)            fake return
zerodiv         trap            #5
*
*               convert divisor and dividend to sign magnitude
*
do_full         moveq           #15,d4          loop count - 1
		moveq           #0,d6           sign of quotient
		moveq           #0,d5           sign of remainder
		tst.l           d1              divisor negative?
		bpl.s           divend
		neg.l           d1
		bvs.s           max_neg_dvsr
		not.w           d6              set sign flag
divend          tst.l           d2              dividend negative
		bpl.s           rmndr
		neg.l           d2              complement quotient sign
		bvc.s           not_special
		cmp.l           #1,d1           test for minint div -1
		bne.s           not_special
		tst.w           d6
		bne.s           ovflow
not_special     not             d6              flag
		not             d5              negative remainder
rmndr           moveq           #0,d3           clear remainder
		swap            d1              is divisor <= 16 bits
		tst.w           d1
		bne.s           big_div
		swap            d2
		swap            d1
		move.w          d2,d3           get high order dividend
		divu            d1,d3           high part of divide
		move.w          d3,d2           high quotient to d2
		swap            d2
		move.w          d2,d3           divide low order
		divu            d1,d3           dividend by divisor
		move.w          d3,d2           quotient in d2
		clr.w           d3
		swap            d3              remainder in d3
*               put in correct sign for quotient and remainder
dm_fixup        tst.w           d6
		bpl.s           chk_rem
		neg.l           d2
chk_rem         tst.w           d5
		bpl.s           dm_store
		neg.l           d3
dm_store        tst.w           d7              div or mod?
		bne.s           mod_out
		move.l          d2,d3
		bra.s           dm_out
mod_out         tst.l           d3              if negative mod
		bpl.s           dm_out          then
		add.l           d1,d3           then add back divisor
		bra.s           dm_out
*
*               handle maximum negative divisor
*
max_neg_dvsr    neg.l           d2
		bvs.s           max_max         test for max neg dividend
		move.l          d2,d3
		neg.l           d3
		moveq           #0,d2
		bra.s           dm_store
max_max         moveq           #1,d2
		moveq           #0,d3
		bra.s           dm_store
*
*               32 bit divisor
*
big_div         swap            d1              restore divisor
		swap            d2              move high order
		move.w          d2,d3           dividend to remainder
		clr.w           d2              shift dividend 16 bits left
		sub.l           d1,d3           subtract divisor from rem.
		movea.l         d1,a0           divisor in d1
		neg.l           d1              minus divisor in a0
		exg             d1,a0
*
*               co-routine for negative remainder
*
m_top           add.l           d2,d2           shift dividend and quotient
		addx.l          d3,d3           shift remainder
		add.l           d1,d3           add divisor
		bpl.s           p_bottom        remainder positive?
m_bottom        dbra            d4,m_top        loop 16 times
		add.l           d1,d3           restore remainder
		add.l           d2,d2           shift in last bit of quotient
		bra.s           dm_fixup
*
*               co-routine for positive remainder
*
p_top           addx.l          d2,d2           shift dividend and quotient
		addx.l          d3,d3           shift remainder
		add.l           a0,d3           subtract divisor
		bmi.s           m_bottom        remainder negative?
p_bottom        dbra            d4,p_top        loop 16 times
		addx.l          d2,d2           shift in last bit of quotient
		bra.s           dm_fixup
	end
@


55.1
log
@Automatic bump of revision number for PWS version 3.25A
@
text
@@


54.3
log
@
pws2rcs automatic delta on Wed Aug 21 10:27:27 MDT 1991
@
text
@@


54.2
log
@
pws2rcs automatic delta on Wed Aug 21 09:35:48 MDT 1991
@
text
@d1 138
@


54.1
log
@Automatic bump of revision number for PWS version 3.24
@
text
@a0 138
*------------------------------------------
 DEF ASM_DIV
 DEF ASM_MOD
*------------------------------------------
*               register usage
*               d0 - return address
*               d1 - divisor
*               d2 - dividend and quotient
*               d3 - remainder
*               d4 - loop counter
*               d5 - sign of remainder
*               d6 - sign of quotent
*               d7 - mod/div flag
*
ovflow          trap            #4
valrange        trap            #7
asm_mod         moveq           #1,d7           set mod flag
		movem.l         (sp)+,d0/d1/d2  read return addr and operands
		tst.l           d1              divide by zero?
		bpl.s           d_start         for mod?
		bra.s           valrange
asm_div         moveq           #0,d7           clear mod flag
		movem.l         (sp)+,d0/d1/d2  read return addr and operands
		tst.l           d1              divide by zero?
d_start         beq.s           zerodiv
		movea.w         d1,a0           is divisor a
		cmp.l           a0,d1           16 bit integer?
		bne.s           do_full
		move.l          d2,d3           try signed divide
		divs            d1,d3
		bvs.s           do_full         did it work?
		tst.w           d7              mod or div?
		beq.s           div_1
		swap            d3
		tst.w           d3              if mod is negative
		bpl.s           div_1           teen
		add.w           d1,d3           add back divisor
div_1           ext.l           d3
dm_out          move.l          d3,-(sp)        push result
		movea.l         d0,a0
		jmp             (a0)            fake return
zerodiv         trap            #5
*
*               convert divisor and dividend to sign magnitude
*
do_full         moveq           #15,d4          loop count - 1
		moveq           #0,d6           sign of quotient
		moveq           #0,d5           sign of remainder
		tst.l           d1              divisor negative?
		bpl.s           divend
		neg.l           d1
		bvs.s           max_neg_dvsr
		not.w           d6              set sign flag
divend          tst.l           d2              dividend negative
		bpl.s           rmndr
		neg.l           d2              complement quotient sign
		bvc.s           not_special
		cmp.l           #1,d1           test for minint div -1
		bne.s           not_special
		tst.w           d6
		bne.s           ovflow
not_special     not             d6              flag
		not             d5              negative remainder
rmndr           moveq           #0,d3           clear remainder
		swap            d1              is divisor <= 16 bits
		tst.w           d1
		bne.s           big_div
		swap            d2
		swap            d1
		move.w          d2,d3           get high order dividend
		divu            d1,d3           high part of divide
		move.w          d3,d2           high quotient to d2
		swap            d2
		move.w          d2,d3           divide low order
		divu            d1,d3           dividend by divisor
		move.w          d3,d2           quotient in d2
		clr.w           d3
		swap            d3              remainder in d3
*               put in correct sign for quotient and remainder
dm_fixup        tst.w           d6
		bpl.s           chk_rem
		neg.l           d2
chk_rem         tst.w           d5
		bpl.s           dm_store
		neg.l           d3
dm_store        tst.w           d7              div or mod?
		bne.s           mod_out
		move.l          d2,d3
		bra.s           dm_out
mod_out         tst.l           d3              if negative mod
		bpl.s           dm_out          then
		add.l           d1,d3           then add back divisor
		bra.s           dm_out
*
*               handle maximum negative divisor
*
max_neg_dvsr    neg.l           d2
		bvs.s           max_max         test for max neg dividend
		move.l          d2,d3
		neg.l           d3
		moveq           #0,d2
		bra.s           dm_store
max_max         moveq           #1,d2
		moveq           #0,d3
		bra.s           dm_store
*
*               32 bit divisor
*
big_div         swap            d1              restore divisor
		swap            d2              move high order
		move.w          d2,d3           dividend to remainder
		clr.w           d2              shift dividend 16 bits left
		sub.l           d1,d3           subtract divisor from rem.
		movea.l         d1,a0           divisor in d1
		neg.l           d1              minus divisor in a0
		exg             d1,a0
*
*               co-routine for negative remainder
*
m_top           add.l           d2,d2           shift dividend and quotient
		addx.l          d3,d3           shift remainder
		add.l           d1,d3           add divisor
		bpl.s           p_bottom        remainder positive?
m_bottom        dbra            d4,m_top        loop 16 times
		add.l           d1,d3           restore remainder
		add.l           d2,d2           shift in last bit of quotient
		bra.s           dm_fixup
*
*               co-routine for positive remainder
*
p_top           addx.l          d2,d2           shift dividend and quotient
		addx.l          d3,d3           shift remainder
		add.l           a0,d3           subtract divisor
		bmi.s           m_bottom        remainder negative?
p_bottom        dbra            d4,p_top        loop 16 times
		addx.l          d2,d2           shift in last bit of quotient
		bra.s           dm_fixup
	end
@


53.1
log
@Automatic bump of revision number for PWS version 3.24B
@
text
@@


52.1
log
@Automatic bump of revision number for PWS version 3.24A
@
text
@@


51.1
log
@Automatic bump of revision number for PWS version 3.24d
@
text
@@


50.1
log
@Automatic bump of revision number for PWS version 3.23c
@
text
@@


49.1
log
@Automatic bump of revision number for PWS version 3.24b
@
text
@@


48.1
log
@Automatic bump of revision number for PWS version 3.24a
@
text
@@


47.1
log
@Automatic bump of revision number for PWS version 3.23
@
text
@@


46.1
log
@Automatic bump of revision number for PWS version 3.23
@
text
@@


45.1
log
@Automatic bump of revision number for PWS version 3.23C
@
text
@@


44.1
log
@Automatic bump of revision number for PWS version 3.23B
@
text
@@


43.1
log
@Automatic bump of revision number for PWS version 3.23aA
@
text
@@


42.1
log
@Automatic bump of revision number for PWS version 3.23e
@
text
@@


41.1
log
@Automatic bump of revision number for PWS version 3.23d
@
text
@@


40.1
log
@Automatic bump of revision number for PWS version 3.23c
@
text
@@


39.1
log
@Automatic bump of revision number for PWS version 3.23b
@
text
@@


38.1
log
@Automatic bump of revision number for PWS version 3.23a
@
text
@@


37.1
log
@Automatic bump of revision number for PWS version 3.3a
@
text
@@


36.1
log
@Automatic bump of revision number for PWS version 3.22
@
text
@@


35.1
log
@Automatic bump of revision number for PWS version 3.22
@
text
@@


34.1
log
@Automatic bump of revision number for PWS version 3.22
@
text
@@


33.1
log
@Automatic bump of revision number for PWS version 3.22D
@
text
@@


32.1
log
@Automatic bump of revision number for PWS version 3.22C
@
text
@@


31.1
log
@Automatic bump of revision number for PWS version 3.22B
@
text
@@


30.1
log
@Automatic bump of revision number for PWS version 3.22A
@
text
@@


29.1
log
@Automatic bump of revision number for PWS version 3.22b
@
text
@@


28.1
log
@Automatic bump of revision number for PWS version 3.3b
@
text
@@


27.1
log
@Automatic bump of revision number for PWS version 3.3a
@
text
@@


26.1
log
@Automatic bump of revision number for PWS version 3.3 Synch
@
text
@@


25.1
log
@Automatic bump of revision number for PWS version 3.2Y
@
text
@@


24.1
log
@Automatic bump of revision number for PWS version 3.2
@
text
@@


23.1
log
@Automatic bump of revision number for PWS version 3.2P
@
text
@@


22.1
log
@Automatic bump of revision number for PWS version 3.2N
@
text
@@


21.1
log
@Automatic bump of revision number for PWS version 3.2M
@
text
@@


20.1
log
@Automatic bump of revision number for PWS version 3.2L
@
text
@@


19.1
log
@Automatic bump of revision number for PWS version 3.2K
@
text
@@


18.1
log
@Automatic bump of revision number for PWS version 3.2J
@
text
@@


17.1
log
@Automatic bump of revision number for PWS version 3.2I+
@
text
@@


16.1
log
@Automatic bump of revision number for PWS version 3.2I
@
text
@@


15.1
log
@Automatic bump of revision number for PWS version 3.2H
@
text
@@


14.1
log
@Automatic bump of revision number for PWS version 3.2G
@
text
@@


13.1
log
@Automatic bump of revision number for PWS version 3.2F
@
text
@@


12.1
log
@Automatic bump of revision number for PWS version 3.2E
@
text
@@


11.1
log
@Automatic bump of revision number for PWS version 3.2D
@
text
@@


10.1
log
@Automatic bump of revision number for PWS version 3.2C
@
text
@@


9.1
log
@Automatic bump of revision number for PWS version 3.2B
@
text
@@


8.1
log
@Automatic bump of revision number for PWS version 3.2A
@
text
@@


7.1
log
@Automatic bump of revision number for PWS version 3.2l
@
text
@@


6.1
log
@Automatic bump of revision number for PWS version 3.2k
@
text
@@


5.1
log
@Automatic bump of revision number for PWS version 3.2j
@
text
@@


4.1
log
@Automatic bump of revision number for PWS version 3.2i
@
text
@@


3.1
log
@Automatic bump of revision number for PWS version 3.2h
@
text
@@


2.1
log
@Auto bump rev number to 2.1 for sys 3.2e.
@
text
@@


1.1
log
@Initial revision
@
text
@@
