158 lines
4.2 KiB
C
158 lines
4.2 KiB
C
#include "../lib/pubsubd.h"
|
|
#include <stdlib.h>
|
|
#include <pthread.h>
|
|
|
|
#define NB_CLIENTS 3
|
|
|
|
void
|
|
ohshit(int rvalue, const char* str) {
|
|
fprintf(stderr, "%s\n", str);
|
|
exit(rvalue);
|
|
}
|
|
|
|
// give this structure to the thread worker function
|
|
struct worker_params {
|
|
struct channels *chans;
|
|
struct channel *chan;
|
|
struct app_list_elm *ale;
|
|
};
|
|
|
|
void * pubsubd_worker_thread (void *params)
|
|
{
|
|
int s = 0;
|
|
|
|
s = pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, NULL);
|
|
if (s != 0)
|
|
printf ("pthread_setcancelstate: %d\n", s);
|
|
|
|
struct worker_params *wp = (struct worker_params *) params;
|
|
if (wp == NULL) {
|
|
fprintf (stderr, "error pubsubd_worker_thread : params NULL\n");
|
|
return NULL;
|
|
}
|
|
|
|
struct channels *chans = wp->chans;
|
|
struct channel *chan = wp->chan;
|
|
struct app_list_elm *ale = wp->ale;
|
|
|
|
free (wp);
|
|
|
|
// main loop
|
|
while (1) {
|
|
struct pubsub_msg m;
|
|
memset (&m, 0, sizeof (struct pubsub_msg));
|
|
|
|
sleep (2); // TODO DEBUG
|
|
pubsubd_msg_recv (ale->p, &m);
|
|
|
|
if (m.type == PUBSUB_TYPE_DISCONNECT) {
|
|
printf ("process %d disconnecting...\n", ale->p->pid);
|
|
if ( 0 != pubsubd_subscriber_del (chan->alh, ale)) {
|
|
fprintf (stderr, "err : subscriber not registered\n");
|
|
}
|
|
break;
|
|
}
|
|
else {
|
|
struct channel *ch = pubsubd_channel_search (chans, chan->chan);
|
|
if (ch == NULL) {
|
|
printf ("CHAN NOT FOUND\n");
|
|
}
|
|
else {
|
|
printf ("what should be sent: ");
|
|
pubsubd_msg_print (&m);
|
|
printf ("send the message to:\t");
|
|
pubsubd_channel_print (ch);
|
|
pubsubd_msg_send (ch->alh, &m);
|
|
}
|
|
}
|
|
pubsubd_msg_free (&m);
|
|
}
|
|
|
|
pubsubd_app_list_elm_free (ale);
|
|
|
|
pthread_exit (NULL);
|
|
}
|
|
|
|
int
|
|
main(int argc, char **argv, char **env)
|
|
{
|
|
struct service srv;
|
|
memset (&srv, 0, sizeof (struct service));
|
|
srv_init (argc, argv, env, &srv, PUBSUB_SERVICE_NAME, NULL);
|
|
printf ("Listening on %s.\n", srv.spath);
|
|
|
|
// creates the service named pipe, that listens to client applications
|
|
if (srv_create (&srv))
|
|
ohshit(1, "service_create error");
|
|
|
|
// init chans list
|
|
struct channels chans;
|
|
memset (&chans, 0, sizeof (struct channels));
|
|
pubsubd_channels_init (&chans);
|
|
|
|
pthread_t *thr = NULL;
|
|
thr = malloc (sizeof (pthread_t));
|
|
memset (thr, 0, sizeof (pthread_t));
|
|
|
|
int i = 0;
|
|
// for (i = 0; i < NB_CLIENTS; i++)
|
|
for (i = 0; ; i++) {
|
|
// for each new process
|
|
struct app_list_elm ale;
|
|
memset (&ale, 0, sizeof (struct app_list_elm));
|
|
struct channel *chan = NULL;
|
|
pubsubd_get_new_process (srv.spath, &ale, &chans, &chan);
|
|
pubsubd_channels_print (&chans);
|
|
|
|
// end the application
|
|
if (ale.action == PUBSUB_QUIT) {
|
|
pubsubd_app_list_elm_free (&ale);
|
|
break;
|
|
}
|
|
|
|
// TODO thread to handle multiple clients at a time
|
|
struct worker_params *wp = NULL;
|
|
wp = malloc (sizeof (struct worker_params));
|
|
wp->ale = pubsubd_app_list_elm_copy (&ale);
|
|
wp->chans = &chans;
|
|
wp->chan = chan;
|
|
|
|
// realloc memory for further workers
|
|
pthread_t * tmpthr = realloc (thr, sizeof (pthread_t) * (i+1));
|
|
if (tmpthr == NULL) {
|
|
fprintf (stderr, "err: can't allocate more thread contexts\n");
|
|
pubsubd_app_list_elm_free (&ale);
|
|
break;
|
|
}
|
|
else {
|
|
thr = tmpthr;
|
|
}
|
|
memset (thr + i, 0, sizeof (pthread_t));
|
|
|
|
pthread_create (thr + i, NULL, pubsubd_worker_thread, wp);
|
|
pthread_detach (thr[i]);
|
|
|
|
pubsubd_app_list_elm_free (&ale);
|
|
}
|
|
|
|
printf ("Quitting ...\n");
|
|
// stop threads
|
|
for (int j = 0 ; j < i ; j++) {
|
|
pthread_cancel (thr[j]);
|
|
void *ret = NULL;
|
|
pthread_join (thr[j], &ret);
|
|
if (ret != NULL) {
|
|
free (ret);
|
|
}
|
|
}
|
|
free (thr);
|
|
|
|
pubsubd_channels_del_all (&chans);
|
|
|
|
// the application will shut down, and remove the service named pipe
|
|
if (srv_close (&srv))
|
|
ohshit (1, "service_close error");
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|