Logo Search packages:      
Sourcecode: c-icap version File versions  Download package

proc_threads_queues.h

/*
 *  Copyright (C) 2004-2008 Christos Tsantilas
 *
 *  This program is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Lesser General Public
 *  License as published by the Free Software Foundation; either
 *  version 2.1 of the License, 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
 *  Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public
 *  License along with this library; if not, write to the Free Software
 *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 *  MA  02110-1301  USA.
 */


#ifndef _PROC_THREADS_QUEUES_H
#define _PROC_THREADS_QUEUES_H

#include "net_io.h"
#include "ci_threads.h"
#include "proc_mutex.h"
#include "shared_mem.h"
#include "stats.h"

enum KILL_MODE {NO_KILL=0,GRACEFULLY,IMMEDIATELY};

#ifdef _WIN32
#define process_pid_t HANDLE
#define ci_pipe_t     HANDLE
#else 
#define process_pid_t int
#define ci_pipe_t   int
#endif


00041 struct connections_queue{
     ci_connection_t *connections;
     int used;
     int size;
     ci_thread_mutex_t queue_mtx;
     ci_thread_mutex_t cond_mtx;
     ci_thread_cond_t queue_cond;
};


00051 typedef struct child_shared_data{
     int freeservers;
     int usedservers;
     int requests;
     int connections;
     process_pid_t pid;
     int idle;
     int to_be_killed;
     int father_said;
     ci_pipe_t pipe;
     struct stat_memblock *stats;
     int stats_size;
} child_shared_data_t;


00066 struct childs_queue{
     child_shared_data_t *childs;
     int size;
     int shared_mem_size;
     int stats_block_size;
     void  *stats_area;
     struct stat_memblock *stats_history;
     ci_shared_mem_id_t shmid;
     ci_proc_mutex_t queue_mtx;
};



struct connections_queue *init_queue(int size);
void destroy_queue(struct connections_queue *q);
int put_to_queue(struct connections_queue *q,ci_connection_t *con);
int get_from_queue(struct connections_queue *q, ci_connection_t *con);
int wait_for_queue(struct connections_queue *q);
#define connections_pending(q) (q->used)


int create_childs_queue(struct childs_queue *q, int size);
int destroy_childs_queue(struct childs_queue *q);
int attach_childs_queue(struct childs_queue *q);
int dettach_childs_queue(struct childs_queue *q);
int childs_queue_is_empty(struct childs_queue *q);
child_shared_data_t *get_child_data(struct childs_queue *q, process_pid_t pid);
child_shared_data_t *register_child(struct childs_queue *q, 
                            process_pid_t pid,
                            int maxservers,
                            ci_pipe_t pipe
);

int remove_child(struct childs_queue *q, process_pid_t pid);
int find_a_child_to_be_killed(struct childs_queue *q);
int find_a_child_nrequests(struct childs_queue *q,int max_requests);
int find_an_idle_child(struct childs_queue *q);
int childs_queue_stats(struct childs_queue *q, int *childs,
                   int *freeservers, int *used, int *maxrequests);
void dump_queue_statistics(struct childs_queue *q);

#endif

Generated by  Doxygen 1.6.0   Back to index