Move up buffer
Pentium44
parent
4cd4c8a27e
commit
4d8cc7e846
|
|
@ -1,95 +0,0 @@
|
|||
/* Copyright (C) 1999 Lucent Technologies */
|
||||
/* Excerpted from 'The Practice of Programming' */
|
||||
/* by Brian W. Kernighan and Rob Pike */
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include "eprintf.h"
|
||||
#include <stdarg.h>
|
||||
#include <string.h>
|
||||
#include <errno.h>
|
||||
|
||||
static char *name = NULL; /* program name for messages */
|
||||
|
||||
/* eprintf: print error message and exit */
|
||||
void eprintf(char *fmt, ...)
|
||||
{
|
||||
va_list args;
|
||||
|
||||
fflush(stdout);
|
||||
if (progname() != NULL)
|
||||
fprintf(stderr, "%s: ", progname());
|
||||
|
||||
va_start(args, fmt);
|
||||
vfprintf(stderr, fmt, args);
|
||||
va_end(args);
|
||||
|
||||
if (fmt[0] != '\0' && fmt[strlen(fmt)-1] == ':')
|
||||
fprintf(stderr, " %s", strerror(errno));
|
||||
fprintf(stderr, "\n");
|
||||
exit(2); /* conventional value for failed execution */
|
||||
}
|
||||
|
||||
/* weprintf: print warning message */
|
||||
void weprintf(char *fmt, ...)
|
||||
{
|
||||
va_list args;
|
||||
|
||||
fflush(stdout);
|
||||
fprintf(stderr, "warning: ");
|
||||
if (progname() != NULL)
|
||||
fprintf(stderr, "%s: ", progname());
|
||||
va_start(args, fmt);
|
||||
vfprintf(stderr, fmt, args);
|
||||
va_end(args);
|
||||
if (fmt[0] != '\0' && fmt[strlen(fmt)-1] == ':')
|
||||
fprintf(stderr, " %s\n", strerror(errno));
|
||||
else
|
||||
fprintf(stderr, "\n");
|
||||
}
|
||||
|
||||
/* emalloc: malloc and report if error */
|
||||
void *emalloc(size_t n)
|
||||
{
|
||||
void *p;
|
||||
|
||||
p = malloc(n);
|
||||
if (p == NULL)
|
||||
eprintf("malloc of %u bytes failed:", n);
|
||||
return p;
|
||||
}
|
||||
|
||||
/* erealloc: realloc and report if error */
|
||||
void *erealloc(void *vp, size_t n)
|
||||
{
|
||||
void *p;
|
||||
|
||||
p = realloc(vp, n);
|
||||
if (p == NULL)
|
||||
eprintf("realloc of %u bytes failed:", n);
|
||||
return p;
|
||||
}
|
||||
|
||||
/* estrdup: duplicate a string, report if error */
|
||||
char *estrdup(char *s)
|
||||
{
|
||||
char *t;
|
||||
|
||||
t = (char *) malloc(strlen(s)+1);
|
||||
if (t == NULL)
|
||||
eprintf("estrdup(\"%.20s\") failed:", s);
|
||||
strcpy(t, s);
|
||||
return t;
|
||||
}
|
||||
|
||||
/* progname: return stored name of program */
|
||||
char *progname(void)
|
||||
{
|
||||
return name;
|
||||
}
|
||||
|
||||
/* setprogname: set stored name of program */
|
||||
void setprogname(char *str)
|
||||
{
|
||||
name = estrdup(str);
|
||||
}
|
||||
|
|
@ -335,7 +335,7 @@ char *process_string(char *in, int n) {
|
|||
|
||||
int main(int argc, char **argv) {
|
||||
int socketfd, n;
|
||||
char in[BUF+1], out[BUF+1], c[512];
|
||||
char in[BUF+1], out[BUF+1], c[8128];
|
||||
char *pos, *action;
|
||||
|
||||
if(argc != 6) {
|
||||
|
|
|
|||
170
src/markov.c
170
src/markov.c
|
|
@ -1,170 +0,0 @@
|
|||
/* Copyright (C) 1999 Lucent Technologies */
|
||||
/* Excerpted from 'The Practice of Programming' */
|
||||
/* by Brian W. Kernighan and Rob Pike */
|
||||
|
||||
/*
|
||||
* Markov chain random text generator.
|
||||
*/
|
||||
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <time.h>
|
||||
#include "eprintf.h"
|
||||
|
||||
enum {
|
||||
NPREF = 2, /* number of prefix words */
|
||||
NHASH = 4093, /* size of state hash table array */
|
||||
MAXGEN = 10000 /* maximum words generated */
|
||||
};
|
||||
|
||||
typedef struct State State;
|
||||
typedef struct Suffix Suffix;
|
||||
|
||||
struct State { /* prefix + suffix list */
|
||||
char *pref[NPREF]; /* prefix words */
|
||||
Suffix *suf; /* list of suffixes */
|
||||
State *next; /* next in hash table */
|
||||
};
|
||||
|
||||
struct Suffix { /* list of suffixes */
|
||||
char *word; /* suffix */
|
||||
Suffix *next; /* next in list of suffixes */
|
||||
};
|
||||
|
||||
State *lookup(char *prefix[], int create);
|
||||
void build(char *prefix[], FILE*);
|
||||
void generate(int nwords);
|
||||
void add(char *prefix[], char *word);
|
||||
|
||||
State *statetab[NHASH]; /* hash table of states */
|
||||
|
||||
char NONWORD[] = "\n"; /* cannot appear as real word */
|
||||
|
||||
/* markov main: markov-chain random text generation */
|
||||
int main(void)
|
||||
{
|
||||
int i, nwords = MAXGEN;
|
||||
char *prefix[NPREF]; /* current input prefix */
|
||||
|
||||
int c;
|
||||
long seed;
|
||||
|
||||
setprogname("markov");
|
||||
seed = time(NULL);
|
||||
|
||||
srand(seed);
|
||||
for (i = 0; i < NPREF; i++) /* set up initial prefix */
|
||||
prefix[i] = NONWORD;
|
||||
build(prefix, stdin);
|
||||
add(prefix, NONWORD);
|
||||
generate(nwords);
|
||||
return 0;
|
||||
}
|
||||
|
||||
const int MULTIPLIER = 31; /* for hash() */
|
||||
|
||||
/* hash: compute hash value for array of NPREF strings */
|
||||
unsigned int hash(char *s[NPREF])
|
||||
{
|
||||
unsigned int h;
|
||||
unsigned char *p;
|
||||
int i;
|
||||
|
||||
h = 0;
|
||||
for (i = 0; i < NPREF; i++)
|
||||
for (p = (unsigned char *) s[i]; *p != '\0'; p++)
|
||||
h = MULTIPLIER * h + *p;
|
||||
return h % NHASH;
|
||||
}
|
||||
|
||||
/* lookup: search for prefix; create if requested. */
|
||||
/* returns pointer if present or created; NULL if not. */
|
||||
/* creation doesn't strdup so strings mustn't change later. */
|
||||
State* lookup(char *prefix[NPREF], int create)
|
||||
{
|
||||
int i, h;
|
||||
State *sp;
|
||||
|
||||
h = hash(prefix);
|
||||
for (sp = statetab[h]; sp != NULL; sp = sp->next) {
|
||||
for (i = 0; i < NPREF; i++)
|
||||
if (strcmp(prefix[i], sp->pref[i]) != 0)
|
||||
break;
|
||||
if (i == NPREF) /* found it */
|
||||
return sp;
|
||||
}
|
||||
if (create) {
|
||||
sp = (State *) emalloc(sizeof(State));
|
||||
for (i = 0; i < NPREF; i++)
|
||||
sp->pref[i] = prefix[i];
|
||||
sp->suf = NULL;
|
||||
sp->next = statetab[h];
|
||||
statetab[h] = sp;
|
||||
}
|
||||
return sp;
|
||||
}
|
||||
|
||||
/* addsuffix: add to state. suffix must not change later */
|
||||
void addsuffix(State *sp, char *suffix)
|
||||
{
|
||||
Suffix *suf;
|
||||
|
||||
suf = (Suffix *) emalloc(sizeof(Suffix));
|
||||
suf->word = suffix;
|
||||
suf->next = sp->suf;
|
||||
sp->suf = suf;
|
||||
}
|
||||
|
||||
/* add: add word to suffix list, update prefix */
|
||||
void add(char *prefix[NPREF], char *suffix)
|
||||
{
|
||||
State *sp;
|
||||
|
||||
sp = lookup(prefix, 1); /* create if not found */
|
||||
addsuffix(sp, suffix);
|
||||
/* move the words down the prefix */
|
||||
memmove(prefix, prefix+1, (NPREF-1)*sizeof(prefix[0]));
|
||||
prefix[NPREF-1] = suffix;
|
||||
}
|
||||
|
||||
/* build: read input, build prefix table */
|
||||
void build(char *prefix[NPREF], FILE *f)
|
||||
{
|
||||
char buf[100], fmt[10];
|
||||
|
||||
/* create a format string; %s could overflow buf */
|
||||
sprintf(fmt, "%%%ds", sizeof(buf)-1);
|
||||
while (fscanf(f, fmt, buf) != EOF)
|
||||
add(prefix, estrdup(buf));
|
||||
}
|
||||
|
||||
/* generate: produce output, one word per line */
|
||||
void generate(int nwords)
|
||||
{
|
||||
State *sp;
|
||||
Suffix *suf;
|
||||
char *prefix[NPREF], *w;
|
||||
int i, nmatch;
|
||||
|
||||
for (i = 0; i < NPREF; i++) /* reset initial prefix */
|
||||
prefix[i] = NONWORD;
|
||||
|
||||
for (i = 0; i < nwords; i++) {
|
||||
sp = lookup(prefix, 0);
|
||||
if (sp == NULL)
|
||||
eprintf("internal error: lookup failed");
|
||||
nmatch = 0;
|
||||
for (suf = sp->suf; suf != NULL; suf = suf->next)
|
||||
if (rand() % ++nmatch == 0) /* prob = 1/nmatch */
|
||||
w = suf->word;
|
||||
if (nmatch == 0)
|
||||
eprintf("internal error: no suffix %d %s", i, prefix[0]);
|
||||
if (strcmp(w, NONWORD) == 0)
|
||||
break;
|
||||
printf("%s\n", w);
|
||||
memmove(prefix, prefix+1, (NPREF-1)*sizeof(prefix[0]));
|
||||
prefix[NPREF-1] = w;
|
||||
}
|
||||
}
|
||||
Loading…
Reference in New Issue