1993-08-02 21:18:41 +04:00
|
|
|
/*
|
|
|
|
* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef lint
|
|
|
|
static char rcsid[] = "$Id: hack.rumors.c,v 1.2 1993/08/02 17:19:20 mycroft Exp $";
|
|
|
|
#endif /* not lint */
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include "hack.h" /* for RUMORFILE and BSD (index) */
|
|
|
|
#define CHARSZ 8 /* number of bits in a char */
|
|
|
|
extern long *alloc();
|
|
|
|
extern char *index();
|
|
|
|
int n_rumors = 0;
|
|
|
|
int n_used_rumors = -1;
|
|
|
|
char *usedbits;
|
|
|
|
|
|
|
|
init_rumors(rumf) register FILE *rumf; {
|
|
|
|
register int i;
|
|
|
|
n_used_rumors = 0;
|
|
|
|
while(skipline(rumf)) n_rumors++;
|
|
|
|
rewind(rumf);
|
|
|
|
i = n_rumors/CHARSZ;
|
|
|
|
usedbits = (char *) alloc((unsigned)(i+1));
|
|
|
|
for( ; i>=0; i--) usedbits[i] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
skipline(rumf) register FILE *rumf; {
|
|
|
|
char line[COLNO];
|
|
|
|
while(1) {
|
|
|
|
if(!fgets(line, sizeof(line), rumf)) return(0);
|
|
|
|
if(index(line, '\n')) return(1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
outline(rumf) register FILE *rumf; {
|
|
|
|
char line[COLNO];
|
|
|
|
register char *ep;
|
|
|
|
if(!fgets(line, sizeof(line), rumf)) return;
|
|
|
|
if((ep = index(line, '\n')) != 0) *ep = 0;
|
|
|
|
pline("This cookie has a scrap of paper inside! It reads: ");
|
|
|
|
pline(line);
|
|
|
|
}
|
|
|
|
|
|
|
|
outrumor(){
|
|
|
|
register int rn,i;
|
|
|
|
register FILE *rumf;
|
|
|
|
if(n_rumors <= n_used_rumors ||
|
|
|
|
(rumf = fopen(RUMORFILE, "r")) == (FILE *) 0) return;
|
|
|
|
if(n_used_rumors < 0) init_rumors(rumf);
|
|
|
|
if(!n_rumors) goto none;
|
|
|
|
rn = rn2(n_rumors - n_used_rumors);
|
|
|
|
i = 0;
|
|
|
|
while(rn || used(i)) {
|
|
|
|
(void) skipline(rumf);
|
|
|
|
if(!used(i)) rn--;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
usedbits[i/CHARSZ] |= (1 << (i % CHARSZ));
|
|
|
|
n_used_rumors++;
|
|
|
|
outline(rumf);
|
|
|
|
none:
|
|
|
|
(void) fclose(rumf);
|
|
|
|
}
|
|
|
|
|
|
|
|
used(i) register int i; {
|
|
|
|
return(usedbits[i/CHARSZ] & (1 << (i % CHARSZ)));
|
|
|
|
}
|