1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
|
ccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc
c
c HTCd - Copyright (C) 1998-2006 Henrik Rydberg
c
c This program is free software; you can redistribute it and/or modify
c it under the terms of the GNU General Public License as published by
c the Free Software Foundation; either version 2 of the License, or
c (at your option) any later version.
c
c This program is distributed in the hope that it will be useful,
c but WITHOUT ANY WARRANTY; without even the implied warranty of
c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
c GNU General Public License for more details.
c
c You should have received a copy of the GNU General Public License
c along with this program; if not, write to the Free Software
c Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
c
integer function scomptab(s,c,n,tab)
byte s(0:1),c(0:1),tab(0:1)
integer i,m,n
m=mod(n,4)
do 10 i=0,m-1
if(tab(s(i)).ne.tab(c(i)))go to 100
10 continue
do 20 i=m,n-1,4
if(tab(s(i)).ne.tab(c(i)))go to 100
if(tab(s(i+1)).ne.tab(c(i+1)))go to 101
if(tab(s(i+2)).ne.tab(c(i+2)))go to 102
if(tab(s(i+3)).ne.tab(c(i+3)))go to 103
20 continue
scomptab=0
return
100 scomptab=tab(s(i))-tab(c(i))
return
101 scomptab=tab(s(i+1))-tab(c(i+1))
return
102 scomptab=tab(s(i+2))-tab(c(i+2))
return
103 scomptab=tab(s(i+3))-tab(c(i+3))
return
end
|
