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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1.1
date     86.06.30.16.43.16;  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
@*       procedure matchdefext
*               var resolved, matched: boolean          return flags
*                   matchmask: 0..255;                  to be or'd when matched
*               var def_table, ext_table:
*                       array[0.. ] of char;            symbol tables
*               var ext_list:  array[0.. ] of 0..65535  index list
*                   N:  shortint                        number of EXT records
*                   DEF_length: integer                 size of DEF table

	rorg    0

	def     matchdefext

offset          equ     1               offset field of a GVR
gvr_flag        equ     2               bit in a GVR indicating absence

ext_str         equ     a0              pointer to EXT symbol
return          equ     a0              storage for return address
ext_base        equ     a1              address of EXT table
list            equ     a2              address of index list
def_str         equ     a3              pointer to string in DEF table
gvr_ptr         equ     a4              pointer to GVR in DEF table
*global         equ     a5              reserved for PASCAL
*local          equ     a6              base of local workspace
*sp             equ     a7              stack pointer

cond            equ     d0              temporary save for condition codes
len             equ     d1              length of string or GVR
ext_count       equ     d2              number of EXT symbols to process
def_count       equ     d3              bytes of DEF table left
def_addr        equ     d4              address of symbol part of DEF record
match_resolve   equ     d5              two booleans packed in a word
ext_offset      equ     d6              relative pointer to an EXT symbol
mask            equ     d7              match mask

matchdefext   equ *
	movea.l (sp)+,return            return address
	move.l  (sp)+,def_count         length of DEF table
	move.w  (sp)+,ext_count         length of index list, pointer table
	movea.l (sp)+,list              address of EXT index list
	movea.l (sp)+,ext_base          address of EXT table
	movea.l (sp)+,gvr_ptr           address of DEF symbol
	move.w  (sp)+,mask              flag pattern for matched GVR
	move.l  return,-(sp)            replace return address

	moveq   #$0001,match_resolve    matched := false ; resolved := true

	subq.w  #1,ext_count            number of EXT symbols to process
	bcs     done                    all done if no EXT table

L1      move.w  (list)+,ext_offset      get relative address of an EXT symbol
	dbne    ext_count,L1            scan till non-zero, meaning unresolved
	beq.s   done                    done if none

	tst.l   def_count               length of DEF symbol table
	beq.s   no_defs                 done if none

get_def move.l  gvr_ptr,def_addr        save address of DEF record
	clr.l   len                     find GVR of DEF record
	move.b  (gvr_ptr),len           length of string
	addq.w  #2,len                  compute length of string part
	bclr    #0,len
	adda.w  len,gvr_ptr             skip over string
	sub.l   len,def_count
	btst    #gvr_flag,(gvr_ptr)     check for exported symbol
	bne.s   next_def                ignore if not present

compare lea     0(ext_base,ext_offset.w),ext_str  get addresses of two strings
	movea.l def_addr,def_str

	MOVEQ   #0,COND                 standard string compare         (rdq)
	move.b  (ext_str)+,COND         get EXT symbol length           (rdq)
	MOVE.W  COND,LEN                                                (rdq)
	SWAP    LEN                                                     (rdq)
	MOVE.W  COND,LEN                                                (rdq)
	MOVE.B  (DEF_STR)+,COND                                         (rdq)
	cmp.b   COND,len                compare two lengths             (rdq)
	bls.s   str_comp
	move.b  COND,len                get minimum of two string lengths(rdq)
str_comp subq.b #1,len                  loop if at least one character
	bcs.s   cmp_end
cmp_lp  cmpm.b  (def_str)+,(ext_str)+   compare string bodies
	dbne    len,cmp_lp              loop till not equal or end of string
	bne.s   nomatch                 if string bodies are equal
cmp_end SWAP    LEN                             then compare lengths    (rdq)
	CMP.B   COND,LEN                                                (rdq)
	beq.s   match                   three way branch on comparison
nomatch bls.s   ext_low

next_def clr.l  len                     DEF does not match an EXT
	move.b  offset(gvr_ptr),len     get length of GVR
	adda.w  len,gvr_ptr
	sub.l   len,def_count           decrease size of DEF table to search
	bhi.s   get_def                 loop back if there is any left

no_defs clr.b   match_resolve           resolved := false
	bra.s   done                    no more DEF records

match   ori.w   #$0100,match_resolve    matched := true
	move.l  def_addr,0(ext_base,ext_offset.w)   copy address of DEF to EXT
	or.b    mask,(gvr_ptr)          mark DEF record as having been matched
	clr.w   -2(list)                index := 0 to flag it as resolved
	bra.s   nxtext2                 find next unresolved EXT
L2      move.w  (list)+,ext_offset      get relative address
nxtext2 dbne    ext_count,L2            scan till non zero or end of list
	bne.s   next_def                find next DEF record
	bra.s   done                    done if none

ext_low clr.b   match_resolve           resolved := false
	bra.s   nxtext3                 find next unresolved EXT
L3      move.w  (list)+,ext_offset      get relative address
nxtext3 dbne    ext_count,L3            scan till non zero or end of list
	bne.s   compare                 compare to same DEF record

done    movea.l (sp)+,return            return address
	movea.l (sp)+,a1                address of matched
	movea.l (sp)+,a2                address of resolved
	move.b  match_resolve,(a2)      return boolean results
	lsr.w   #8,match_resolve
	or.b    match_resolve,(a1)      matched := matched or match
	jmp     (return)

	end

@


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


56.1
log
@Automatic bump of revision number for PWS version 3.25
@
text
@a0 124
*       procedure matchdefext
*               var resolved, matched: boolean          return flags
*                   matchmask: 0..255;                  to be or'd when matched
*               var def_table, ext_table:
*                       array[0.. ] of char;            symbol tables
*               var ext_list:  array[0.. ] of 0..65535  index list
*                   N:  shortint                        number of EXT records
*                   DEF_length: integer                 size of DEF table

	rorg    0

	def     matchdefext

offset          equ     1               offset field of a GVR
gvr_flag        equ     2               bit in a GVR indicating absence

ext_str         equ     a0              pointer to EXT symbol
return          equ     a0              storage for return address
ext_base        equ     a1              address of EXT table
list            equ     a2              address of index list
def_str         equ     a3              pointer to string in DEF table
gvr_ptr         equ     a4              pointer to GVR in DEF table
*global         equ     a5              reserved for PASCAL
*local          equ     a6              base of local workspace
*sp             equ     a7              stack pointer

cond            equ     d0              temporary save for condition codes
len             equ     d1              length of string or GVR
ext_count       equ     d2              number of EXT symbols to process
def_count       equ     d3              bytes of DEF table left
def_addr        equ     d4              address of symbol part of DEF record
match_resolve   equ     d5              two booleans packed in a word
ext_offset      equ     d6              relative pointer to an EXT symbol
mask            equ     d7              match mask

matchdefext   equ *
	movea.l (sp)+,return            return address
	move.l  (sp)+,def_count         length of DEF table
	move.w  (sp)+,ext_count         length of index list, pointer table
	movea.l (sp)+,list              address of EXT index list
	movea.l (sp)+,ext_base          address of EXT table
	movea.l (sp)+,gvr_ptr           address of DEF symbol
	move.w  (sp)+,mask              flag pattern for matched GVR
	move.l  return,-(sp)            replace return address

	moveq   #$0001,match_resolve    matched := false ; resolved := true

	subq.w  #1,ext_count            number of EXT symbols to process
	bcs     done                    all done if no EXT table

L1      move.w  (list)+,ext_offset      get relative address of an EXT symbol
	dbne    ext_count,L1            scan till non-zero, meaning unresolved
	beq.s   done                    done if none

	tst.l   def_count               length of DEF symbol table
	beq.s   no_defs                 done if none

get_def move.l  gvr_ptr,def_addr        save address of DEF record
	clr.l   len                     find GVR of DEF record
	move.b  (gvr_ptr),len           length of string
	addq.w  #2,len                  compute length of string part
	bclr    #0,len
	adda.w  len,gvr_ptr             skip over string
	sub.l   len,def_count
	btst    #gvr_flag,(gvr_ptr)     check for exported symbol
	bne.s   next_def                ignore if not present

compare lea     0(ext_base,ext_offset.w),ext_str  get addresses of two strings
	movea.l def_addr,def_str

	MOVEQ   #0,COND                 standard string compare         (rdq)
	move.b  (ext_str)+,COND         get EXT symbol length           (rdq)
	MOVE.W  COND,LEN                                                (rdq)
	SWAP    LEN                                                     (rdq)
	MOVE.W  COND,LEN                                                (rdq)
	MOVE.B  (DEF_STR)+,COND                                         (rdq)
	cmp.b   COND,len                compare two lengths             (rdq)
	bls.s   str_comp
	move.b  COND,len                get minimum of two string lengths(rdq)
str_comp subq.b #1,len                  loop if at least one character
	bcs.s   cmp_end
cmp_lp  cmpm.b  (def_str)+,(ext_str)+   compare string bodies
	dbne    len,cmp_lp              loop till not equal or end of string
	bne.s   nomatch                 if string bodies are equal
cmp_end SWAP    LEN                             then compare lengths    (rdq)
	CMP.B   COND,LEN                                                (rdq)
	beq.s   match                   three way branch on comparison
nomatch bls.s   ext_low

next_def clr.l  len                     DEF does not match an EXT
	move.b  offset(gvr_ptr),len     get length of GVR
	adda.w  len,gvr_ptr
	sub.l   len,def_count           decrease size of DEF table to search
	bhi.s   get_def                 loop back if there is any left

no_defs clr.b   match_resolve           resolved := false
	bra.s   done                    no more DEF records

match   ori.w   #$0100,match_resolve    matched := true
	move.l  def_addr,0(ext_base,ext_offset.w)   copy address of DEF to EXT
	or.b    mask,(gvr_ptr)          mark DEF record as having been matched
	clr.w   -2(list)                index := 0 to flag it as resolved
	bra.s   nxtext2                 find next unresolved EXT
L2      move.w  (list)+,ext_offset      get relative address
nxtext2 dbne    ext_count,L2            scan till non zero or end of list
	bne.s   next_def                find next DEF record
	bra.s   done                    done if none

ext_low clr.b   match_resolve           resolved := false
	bra.s   nxtext3                 find next unresolved EXT
L3      move.w  (list)+,ext_offset      get relative address
nxtext3 dbne    ext_count,L3            scan till non zero or end of list
	bne.s   compare                 compare to same DEF record

done    movea.l (sp)+,return            return address
	movea.l (sp)+,a1                address of matched
	movea.l (sp)+,a2                address of resolved
	move.b  match_resolve,(a2)      return boolean results
	lsr.w   #8,match_resolve
	or.b    match_resolve,(a1)      matched := matched or match
	jmp     (return)

	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 124
@


54.1
log
@Automatic bump of revision number for PWS version 3.24
@
text
@a0 124
*       procedure matchdefext
*               var resolved, matched: boolean          return flags
*                   matchmask: 0..255;                  to be or'd when matched
*               var def_table, ext_table:
*                       array[0.. ] of char;            symbol tables
*               var ext_list:  array[0.. ] of 0..65535  index list
*                   N:  shortint                        number of EXT records
*                   DEF_length: integer                 size of DEF table

	rorg    0

	def     matchdefext

offset          equ     1               offset field of a GVR
gvr_flag        equ     2               bit in a GVR indicating absence

ext_str         equ     a0              pointer to EXT symbol
return          equ     a0              storage for return address
ext_base        equ     a1              address of EXT table
list            equ     a2              address of index list
def_str         equ     a3              pointer to string in DEF table
gvr_ptr         equ     a4              pointer to GVR in DEF table
*global         equ     a5              reserved for PASCAL
*local          equ     a6              base of local workspace
*sp             equ     a7              stack pointer

cond            equ     d0              temporary save for condition codes
len             equ     d1              length of string or GVR
ext_count       equ     d2              number of EXT symbols to process
def_count       equ     d3              bytes of DEF table left
def_addr        equ     d4              address of symbol part of DEF record
match_resolve   equ     d5              two booleans packed in a word
ext_offset      equ     d6              relative pointer to an EXT symbol
mask            equ     d7              match mask

matchdefext   equ *
	movea.l (sp)+,return            return address
	move.l  (sp)+,def_count         length of DEF table
	move.w  (sp)+,ext_count         length of index list, pointer table
	movea.l (sp)+,list              address of EXT index list
	movea.l (sp)+,ext_base          address of EXT table
	movea.l (sp)+,gvr_ptr           address of DEF symbol
	move.w  (sp)+,mask              flag pattern for matched GVR
	move.l  return,-(sp)            replace return address

	moveq   #$0001,match_resolve    matched := false ; resolved := true

	subq.w  #1,ext_count            number of EXT symbols to process
	bcs     done                    all done if no EXT table

L1      move.w  (list)+,ext_offset      get relative address of an EXT symbol
	dbne    ext_count,L1            scan till non-zero, meaning unresolved
	beq.s   done                    done if none

	tst.l   def_count               length of DEF symbol table
	beq.s   no_defs                 done if none

get_def move.l  gvr_ptr,def_addr        save address of DEF record
	clr.l   len                     find GVR of DEF record
	move.b  (gvr_ptr),len           length of string
	addq.w  #2,len                  compute length of string part
	bclr    #0,len
	adda.w  len,gvr_ptr             skip over string
	sub.l   len,def_count
	btst    #gvr_flag,(gvr_ptr)     check for exported symbol
	bne.s   next_def                ignore if not present

compare lea     0(ext_base,ext_offset.w),ext_str  get addresses of two strings
	movea.l def_addr,def_str

	MOVEQ   #0,COND                 standard string compare         (rdq)
	move.b  (ext_str)+,COND         get EXT symbol length           (rdq)
	MOVE.W  COND,LEN                                                (rdq)
	SWAP    LEN                                                     (rdq)
	MOVE.W  COND,LEN                                                (rdq)
	MOVE.B  (DEF_STR)+,COND                                         (rdq)
	cmp.b   COND,len                compare two lengths             (rdq)
	bls.s   str_comp
	move.b  COND,len                get minimum of two string lengths(rdq)
str_comp subq.b #1,len                  loop if at least one character
	bcs.s   cmp_end
cmp_lp  cmpm.b  (def_str)+,(ext_str)+   compare string bodies
	dbne    len,cmp_lp              loop till not equal or end of string
	bne.s   nomatch                 if string bodies are equal
cmp_end SWAP    LEN                             then compare lengths    (rdq)
	CMP.B   COND,LEN                                                (rdq)
	beq.s   match                   three way branch on comparison
nomatch bls.s   ext_low

next_def clr.l  len                     DEF does not match an EXT
	move.b  offset(gvr_ptr),len     get length of GVR
	adda.w  len,gvr_ptr
	sub.l   len,def_count           decrease size of DEF table to search
	bhi.s   get_def                 loop back if there is any left

no_defs clr.b   match_resolve           resolved := false
	bra.s   done                    no more DEF records

match   ori.w   #$0100,match_resolve    matched := true
	move.l  def_addr,0(ext_base,ext_offset.w)   copy address of DEF to EXT
	or.b    mask,(gvr_ptr)          mark DEF record as having been matched
	clr.w   -2(list)                index := 0 to flag it as resolved
	bra.s   nxtext2                 find next unresolved EXT
L2      move.w  (list)+,ext_offset      get relative address
nxtext2 dbne    ext_count,L2            scan till non zero or end of list
	bne.s   next_def                find next DEF record
	bra.s   done                    done if none

ext_low clr.b   match_resolve           resolved := false
	bra.s   nxtext3                 find next unresolved EXT
L3      move.w  (list)+,ext_offset      get relative address
nxtext3 dbne    ext_count,L3            scan till non zero or end of list
	bne.s   compare                 compare to same DEF record

done    movea.l (sp)+,return            return address
	movea.l (sp)+,a1                address of matched
	movea.l (sp)+,a2                address of resolved
	move.b  match_resolve,(a2)      return boolean results
	lsr.w   #8,match_resolve
	or.b    match_resolve,(a1)      matched := matched or match
	jmp     (return)

	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
@@
