117 lines
2.9 KiB
C
117 lines
2.9 KiB
C
/**
|
|
* Copyright (C) 2008 Happy Fish / YuQing
|
|
*
|
|
* FastDFS may be copied only under the terms of the GNU General
|
|
* Public License V3, which may be found in the FastDFS source kit.
|
|
* Please visit the FastDFS Home Page http://www.fastken.com/ for more detail.
|
|
**/
|
|
|
|
//common_blocked_queue.h
|
|
|
|
#ifndef _COMMON_BLOCKED_QUEUE_H
|
|
#define _COMMON_BLOCKED_QUEUE_H
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <pthread.h>
|
|
#include "common_define.h"
|
|
#include "fast_mblock.h"
|
|
|
|
struct common_blocked_node
|
|
{
|
|
void *data;
|
|
struct common_blocked_node *next;
|
|
};
|
|
|
|
struct common_blocked_queue
|
|
{
|
|
struct common_blocked_node *head;
|
|
struct common_blocked_node *tail;
|
|
struct fast_mblock_man mblock;
|
|
pthread_lock_cond_pair_t lc_pair;
|
|
};
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
int common_blocked_queue_init_ex(struct common_blocked_queue *queue,
|
|
const int alloc_elements_once);
|
|
|
|
#define common_blocked_queue_init(queue) \
|
|
common_blocked_queue_init_ex(queue, 1024)
|
|
|
|
void common_blocked_queue_destroy(struct common_blocked_queue *queue);
|
|
|
|
static inline void common_blocked_queue_terminate(
|
|
struct common_blocked_queue *queue)
|
|
{
|
|
pthread_cond_signal(&(queue->lc_pair.cond));
|
|
}
|
|
|
|
static inline void common_blocked_queue_terminate_all(
|
|
struct common_blocked_queue *queue, const int count)
|
|
{
|
|
int i;
|
|
for (i=0; i<count; i++)
|
|
{
|
|
pthread_cond_signal(&(queue->lc_pair.cond));
|
|
}
|
|
}
|
|
|
|
//notify by the caller
|
|
int common_blocked_queue_push_ex(struct common_blocked_queue *queue,
|
|
void *data, bool *notify);
|
|
|
|
static inline int common_blocked_queue_push(struct common_blocked_queue
|
|
*queue, void *data)
|
|
{
|
|
bool notify;
|
|
int result;
|
|
|
|
if ((result=common_blocked_queue_push_ex(queue, data, ¬ify)) == 0)
|
|
{
|
|
if (notify)
|
|
{
|
|
pthread_cond_signal(&(queue->lc_pair.cond));
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
|
|
void common_blocked_queue_return_nodes(struct common_blocked_queue *queue,
|
|
struct common_blocked_node *node);
|
|
|
|
void *common_blocked_queue_pop_ex(struct common_blocked_queue *queue,
|
|
const bool blocked);
|
|
|
|
#define common_blocked_queue_pop(queue) \
|
|
common_blocked_queue_pop_ex(queue, true)
|
|
|
|
#define common_blocked_queue_try_pop(queue) \
|
|
common_blocked_queue_pop_ex(queue, false)
|
|
|
|
struct common_blocked_node *common_blocked_queue_pop_all_nodes_ex(
|
|
struct common_blocked_queue *queue, const bool blocked);
|
|
|
|
#define common_blocked_queue_pop_all_nodes(queue) \
|
|
common_blocked_queue_pop_all_nodes_ex(queue, true)
|
|
|
|
#define common_blocked_queue_try_pop_all_nodes(queue) \
|
|
common_blocked_queue_pop_all_nodes_ex(queue, false)
|
|
|
|
#define common_blocked_queue_free_one_node(queue, node) \
|
|
fast_mblock_free_object(&queue->mblock, node)
|
|
|
|
void common_blocked_queue_free_all_nodes(struct common_blocked_queue *queue,
|
|
struct common_blocked_node *node);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif
|