clients
int clients;
handlew(&con[i], clients + 5 < maxcon);
handlew(&con[i], clients + 5 < maxcon);
con[i].addr, clients, blackcount,
clients++;
clients--;
TAILQ_FOREACH(c, &clients, entry) {
struct client *c = TAILQ_FIRST(&clients);
cfg_client = c = TAILQ_FIRST(&clients);
TAILQ_FOREACH(c_loop, &clients, entry) {
TAILQ_FOREACH(c_loop, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(c_loop, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry)
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH (loop, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
c == TAILQ_FIRST(&clients))
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_INSERT_TAIL(&clients, c, entry);
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_REMOVE(&clients, c, entry);
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_INIT(&clients);
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
if (!TAILQ_EMPTY(&clients))
TAILQ_FOREACH_SAFE(c, &clients, entry, c1) {
struct clients clients;
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry)
extern struct clients clients;
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_FOREACH(loop, &clients, entry) {
TAILQ_FOREACH(c, &clients, entry) {
TAILQ_HEAD(, tftp_client) clients;
TAILQ_INIT(&rwmap->clients);
TAILQ_INSERT_TAIL(&rwmap->clients, client, entry);
client = TAILQ_FIRST(&rwmap->clients);
TAILQ_REMOVE(&rwmap->clients, client, entry);