sim/ucsim/relay.cc


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

#include <stdio.h>

#include "fiocl.h"

class cl_f *single_in, *single_out;
class cl_f *srv;

struct multi_size_r {
  class cl_f *i, *o;
};

struct multi_size_r multies[2];
int nuof_multies= 0;

void
proc_single_input()
{
  if (!single_in->eof())
    {
      char c;
      int i;
      c= single_in->get_c();
      for (i= 0; i < nuof_multies; i++)
	{
	  multies[i].o->write(&c, 1);
	}
    }
}

void
check_multies()
{
  int i;
  for (i= 0; i < nuof_multies; i++)
    {
      if (multies[i].i->input_avail())
	{
	  if (!multies[i].i->eof())
	    {
	      char c= multies[i].i->get_c();
	      single_out->write(&c, 1);
	    }
	}
    }
}

int
main(int argc, char *argv[])
{
  single_in= cp_io(0, "r");
  single_out= cp_io(1, "w");
  single_in->raw();
  single_out->raw();
  
  srv= mk_srv(5678);

  while (1)
    {
      if (single_in->input_avail())
	proc_single_input();
      if (nuof_multies < 2)
	{
	  if (srv->input_avail())
	    {
	      class cl_f *si, *so;
	      srv_accept(srv, &si, &so);
	      si->raw();
	      multies[nuof_multies].i= si;
	      multies[nuof_multies].o= so;
	      nuof_multies++;
	    }
	}
      check_multies();
    }
  return 0;
}