blob: 774e8b2caf6922fc55a7907441cf5f1bb8a5f957 (
plain)
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
|
/*
Copyright (C) 2006 Renaissance Technologies Corp.
main developer: HP Wei <hp@rentec.com>
Copyright (C) 2005 Renaissance Technologies Corp.
Copyright (C) 2001 Renaissance Technologies Corp.
main developer: HP Wei <hp@rentec.com>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; see the file COPYING.
If not, write to the Free Software Foundation,
59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include "rttmain.h"
char * missingPages = NULL; /* array of flags */
int nPages;
int init_missingPages(int n)
{
int i;
nPages = n;
/* init missingPages flags */
if (missingPages != NULL) free(missingPages); /* for second round */
missingPages = malloc(sizeof(char) * nPages);
for(i=0; i < nPages; ++i)
missingPages[i] = MISSING;
return 0;
}
int get_total_pages()
{
return nPages;
}
int missing_pages()
{
int result;
int i;
result = 0;
for(i=0; i < nPages; ++i)
if ((missingPages[i]) == MISSING) ++result;
return result;
}
int is_missing(int page)
{
return (missingPages[page] == MISSING) ? 1 : 0;
}
void page_received(int page)
{
missingPages[page] = RECEIVED;
}
int ask_for_missing_page()
{
int i;
int n, count;
n = missing_pages();
if (n == 0) {
/* send_complaint(EOF_OK, machineID, 0); */
return 0; /* nothing is missing */
}
count = 0;
for(i=0; i < nPages; ++i) {
if ( missingPages[i] == MISSING ) {
++count;
send_complaint((count==n) ? LAST_MISSING : MISSING_PAGE, i+1);
usleep(DT_PERPAGE);
}
}
return 1; /* there is something missing */
}
|
