本文整理汇总了C++中LIST_ISEMPTY函数的典型用法代码示例。如果您正苦于以下问题:C++ LIST_ISEMPTY函数的具体用法?C++ LIST_ISEMPTY怎么用?C++ LIST_ISEMPTY使用的例子?那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。
在下文中一共展示了LIST_ISEMPTY函数的15个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: applet_run_active
void applet_run_active()
{
struct appctx *curr;
struct stream_interface *si;
if (LIST_ISEMPTY(&applet_active_queue))
return;
/* move active queue to run queue */
applet_active_queue.n->p = &applet_cur_queue;
applet_active_queue.p->n = &applet_cur_queue;
applet_cur_queue = applet_active_queue;
LIST_INIT(&applet_active_queue);
/* The list is only scanned from the head. This guarantees that if any
* applet removes another one, there is no side effect while walking
* through the list.
*/
while (!LIST_ISEMPTY(&applet_cur_queue)) {
curr = LIST_ELEM(applet_cur_queue.n, typeof(curr), runq);
si = curr->owner;
/* Now we'll try to allocate the input buffer. We wake up the
* applet in all cases. So this is the applet responsibility to
* check if this buffer was allocated or not. This let a chance
* for applets to do some other processing if needed. */
if (!channel_alloc_buffer(si_ic(si), &curr->buffer_wait))
si_applet_cant_put(si);
/* We always pretend the applet can't get and doesn't want to
* put, it's up to it to change this if needed. This ensures
* that one applet which ignores any event will not spin.
*/
si_applet_cant_get(si);
si_applet_stop_put(si);
curr->applet->fct(curr);
si_applet_wake_cb(si);
channel_release_buffer(si_ic(si), &curr->buffer_wait);
if (applet_cur_queue.n == &curr->runq) {
/* curr was left in the list, move it back to the active list */
LIST_DEL(&curr->runq);
LIST_ADDQ(&applet_active_queue, &curr->runq);
}
}
}
示例2: free_interface_queue
/* Interface queue helpers*/
void
free_interface_queue(void)
{
if (!LIST_ISEMPTY(if_queue))
free_list(if_queue);
if_queue = NULL;
}
示例3: find_rttables_table
bool
find_rttables_table(const char *name, unsigned int *id)
{
element e;
char *endptr;
*id = strtoul(name, &endptr, 0);
if (endptr != name && *endptr == '\0')
return true;
if (!rt_list && !read_rttables())
return false;
if (LIST_ISEMPTY(rt_list))
return false;
for (e = LIST_HEAD(rt_list); e; ELEMENT_NEXT(e)) {
rt_entry_t *rte = ELEMENT_DATA(e);
if (!strcmp(rte->name, name)) {
*id = rte->id;
return true;
}
}
return false;
}
示例4: vrrp_sync_group_handler
/* VRRP handlers */
static void
vrrp_sync_group_handler(vector_t *strvec)
{
list l;
element e;
vrrp_sgroup_t *sg;
char* gname;
if (vector_count(strvec) != 2) {
log_message(LOG_INFO, "vrrp_sync_group must have a name - skipping");
skip_block();
return;
}
gname = vector_slot(strvec, 1);
/* check group doesn't already exist */
if (!LIST_ISEMPTY(vrrp_data->vrrp_sync_group)) {
l = vrrp_data->vrrp_sync_group;
for (e = LIST_HEAD(l); e; ELEMENT_NEXT(e)) {
sg = ELEMENT_DATA(e);
if (!strcmp(gname,sg->gname)) {
log_message(LOG_INFO, "vrrp sync group %s already defined", gname);
skip_block();
return;
}
}
}
alloc_vrrp_sync_group(gname);
}
示例5: init_service_vs
/* Set a virtualserver IPVS rules */
static int
init_service_vs(virtual_server_t * vs)
{
/* Init the VS root */
if (!ISALIVE(vs) || vs->vsgname) {
if (!ipvs_cmd(LVS_CMD_ADD, check_data->vs_group, vs, NULL))
return 0;
else
SET_ALIVE(vs);
}
/* Processing real server queue */
if (!LIST_ISEMPTY(vs->rs)) {
if (vs->alpha && ! vs->reloaded)
vs->quorum_state = DOWN;
if (!init_service_rs(vs))
return 0;
}
/* if the service was reloaded, we may have got/lost quorum due to quorum setting changed */
if (vs->reloaded)
update_quorum_state(vs);
return 1;
}
示例6: netlink_rulelist
void
netlink_rulelist(list rule_list, int cmd, bool force)
{
ip_rule_t *iprule;
element e;
/* No rules to add */
if (LIST_ISEMPTY(rule_list))
return;
/* If force is set, we try to remove all the rules, but the
* rule might not exist. That's not an error, so indicate not
* to report such a situation */
if (force && cmd == IPRULE_DEL)
netlink_error_ignore = ENOENT;
for (e = LIST_HEAD(rule_list); e; ELEMENT_NEXT(e)) {
iprule = ELEMENT_DATA(e);
if (force ||
(cmd && !iprule->set) ||
(!cmd && iprule->set)) {
if (netlink_rule(iprule, cmd) > 0)
iprule->set = (cmd) ? 1 : 0;
else
iprule->set = 0;
}
}
netlink_error_ignore = 0;
}
示例7: vrrp_handler
static void
vrrp_handler(vector_t *strvec)
{
list l;
element e;
vrrp_t *vrrp;
char *iname;
if (vector_count(strvec) != 2) {
log_message(LOG_INFO, "vrrp_instance must have a name");
skip_block();
return;
}
iname = vector_slot(strvec,1);
/* Make sure the vrrp instance doesn't already exist */
if (!LIST_ISEMPTY(vrrp_data->vrrp)) {
l = vrrp_data->vrrp;
for (e = LIST_HEAD(l); e; ELEMENT_NEXT(e)) {
vrrp = ELEMENT_DATA(e);
if (!strcmp(iname,vrrp->iname)) {
log_message(LOG_INFO, "vrrp instance %s already defined", iname );
skip_block();
return;
}
}
}
alloc_vrrp(iname);
}
示例8: update_checker_activity
/* Sync checkers activity with netlink kernel reflection */
void
update_checker_activity(uint32_t address, int enable)
{
checker *checker_obj;
element e;
/* Display netlink operation */
if (debug & 32)
log_message(LOG_INFO, "Netlink reflector reports IP %s %s",
inet_ntop2(address), (enable) ? "added" : "removed");
/* Processing Healthcheckers queue */
if (!LIST_ISEMPTY(checkers_queue))
for (e = LIST_HEAD(checkers_queue); e; ELEMENT_NEXT(e)) {
checker_obj = ELEMENT_DATA(e);
if (CHECKER_VIP(checker_obj) == address && CHECKER_HA_SUSPEND(checker_obj)) {
if (!CHECKER_ENABLED(checker_obj) && enable)
log_message(LOG_INFO,
"Activating healtchecker for service [%s:%d]",
inet_ntop2(CHECKER_RIP(checker_obj)),
ntohs(CHECKER_RPORT(checker_obj)));
if (CHECKER_ENABLED(checker_obj) && !enable)
log_message(LOG_INFO,
"Suspending healtchecker for service [%s:%d]",
inet_ntop2(CHECKER_RIP(checker_obj)),
ntohs(CHECKER_RPORT(checker_obj)));
checker_obj->enabled = enable;
}
}
}
示例9: netlink_iplist
/* Add/Delete a list of IP addresses */
void
netlink_iplist(list ip_list, int cmd)
{
ip_address_t *ipaddr;
element e;
/* No addresses in this list */
if (LIST_ISEMPTY(ip_list))
return;
/*
* If "--dont-release-vrrp" is set then try to release addresses
* that may be there, even if we didn't set them.
*/
for (e = LIST_HEAD(ip_list); e; ELEMENT_NEXT(e)) {
ipaddr = ELEMENT_DATA(e);
if ((cmd == IPADDRESS_ADD && !ipaddr->set) ||
(cmd == IPADDRESS_DEL &&
(ipaddr->set || __test_bit(DONT_RELEASE_VRRP_BIT, &debug)))) {
if (netlink_ipaddress(ipaddr, cmd) > 0)
ipaddr->set = !(cmd == IPADDRESS_DEL);
else
ipaddr->set = false;
}
}
}
示例10: find_entry
static bool
find_entry(const char *name, unsigned int *id, list *l, const char* file_name, const struct rt_entry* default_list, uint32_t max)
{
element e;
char *endptr;
unsigned long l_id;
l_id = strtoul(name, &endptr, 0);
*id = (unsigned int)l_id;
if (endptr != name && *endptr == '\0')
return (*id <= max);
if (!(*l))
initialise_list(l, file_name, default_list, max);
if (LIST_ISEMPTY(*l))
return false;
for (e = LIST_HEAD(*l); e; ELEMENT_NEXT(e)) {
rt_entry_t *rte = ELEMENT_DATA(e);
if (!strcmp(rte->name, name)) {
*id = rte->id;
return true;
}
}
return false;
}
示例11: init_service_rs
/* Set a realserver IPVS rules */
static int
init_service_rs(virtual_server_t * vs)
{
element e;
real_server_t *rs;
if (LIST_ISEMPTY(vs->rs)) {
log_message(LOG_WARNING, "VS [%s] has no configured RS! Skipping RS activation."
, FMT_VS(vs));
return 1;
}
for (e = LIST_HEAD(vs->rs); e; ELEMENT_NEXT(e)) {
rs = ELEMENT_DATA(e);
if (rs->reloaded) {
if (rs->iweight != rs->pweight)
update_svr_wgt(rs->iweight, vs, rs, 0);
/* Do not re-add failed RS instantly on reload */
continue;
}
/* In alpha mode, be pessimistic (or realistic?) and don't
* add real servers into the VS pool. They will get there
* later upon healthchecks recovery (if ever).
*/
if (!vs->alpha && !ISALIVE(rs)) {
ipvs_cmd(LVS_CMD_ADD_DEST, vs, rs);
SET_ALIVE(rs);
}
}
return 1;
}
示例12: vrrp_index_lookup
vrrp_rt *
vrrp_index_lookup(const int vrid, const int fd)
{
vrrp_rt *vrrp;
element e;
list l = &vrrp_data->vrrp_index[vrid];
/* return if list is empty */
if (LIST_ISEMPTY(l))
return NULL;
/*
* If list size's is 1 then no collisions. So
* Test and return the singleton.
*/
if (LIST_SIZE(l) == 1) {
vrrp = ELEMENT_DATA(LIST_HEAD(l));
return (vrrp->fd_in == fd) ? vrrp : NULL;
}
/*
* List collision on the vrid bucket. The same
* vrid is used on a different interface. We perform
* a fd lookup as collisions solver.
*/
for (e = LIST_HEAD(l); e; ELEMENT_NEXT(e)) {
vrrp = ELEMENT_DATA(e);
if (vrrp->fd_in == fd)
return vrrp;
}
/* No match */
return NULL;
}
示例13: vrrp_log_int_down
/* Log interface message */
static void vrrp_log_int_down(vrrp_t *vrrp)
{
if (!IF_ISUP(vrrp->ifp))
log_message(LOG_INFO, "Kernel is reporting: interface %s DOWN",
IF_NAME(vrrp->ifp));
if (!LIST_ISEMPTY(vrrp->track_ifp))
vrrp_log_tracked_down(vrrp->track_ifp);
}
示例14: free_interface_queue
/* Interface queue helpers*/
void
free_interface_queue(void)
{
if (!LIST_ISEMPTY(if_queue))
free_list(if_queue);
if_queue = NULL;
kernel_netlink_close();
}
示例15: vrrp_log_int_up
static void vrrp_log_int_up(vrrp_t *vrrp)
{
if (IF_ISUP(vrrp->ifp))
log_message(LOG_INFO, "Kernel is reporting: interface %s UP",
IF_NAME(vrrp->ifp));
if (!LIST_ISEMPTY(vrrp->track_ifp))
log_message(LOG_INFO, "Kernel is reporting: tracked interface are UP");
}