-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue.c
146 lines (124 loc) · 3.23 KB
/
queue.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
// Fireclaw Copyright (C) 2003 Ian Packer <snazbaz at onetel.net.uk>
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
// $Id: queue.c,v 1.6 2003/06/17 00:32:48 snazbaz Exp $
//
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <time.h>
#include <malloc.h>
#include "main.h"
#define Q_LOWSIZE 256
#define Q_HIGHSIZE 128
struct nodeQ {
char *message;
int ts;
};
struct _sendQ {
struct nodeQ high[Q_HIGHSIZE];
struct nodeQ low[Q_LOWSIZE];
int highSize;
int lowSize;
};
static int bytets;
static struct _sendQ sendQ;
void setup_queue()
{
sendQ.highSize = sendQ.lowSize = 0;
bytets = bper = 0;
return;
}
void reset_queue()
{
int i;
for(i = 0; i < sendQ.highSize; i++)
free(sendQ.high[i].message);
for(i = 0; i < sendQ.lowSize; i++)
free(sendQ.low[i].message);
setup_queue();
}
void highMsg(char *message)
{
int size;
int pos = sendQ.highSize++;
if(pos >= Q_HIGHSIZE)
{
/* max sendQ exceeded. */
sendQ.highSize--;
fprintf(out, "Max sendQ exceeded (high).\n");
return;
}
size = strlen(message) + 1;
sendQ.high[pos].ts = (int)time(0);
sendQ.high[pos].message = myalloc(size * sizeof(char));
memcpy(sendQ.high[pos].message, message, size);
return;
}
void lowMsg(char *message)
{
int size;
int pos = sendQ.lowSize++;
if(pos >= Q_LOWSIZE)
{
/* max sendQ exceeded. */
sendQ.lowSize--;
fprintf(out, "Max sendQ exceeded (low).\n");
return;
}
size = strlen(message) + 1;
sendQ.low[pos].ts = (int)time(0);
sendQ.low[pos].message = myalloc(size * sizeof(char));
memcpy(sendQ.low[pos].message, message, size);
return;
}
void popMsg()
{
if(bytets < time(NULL) - 1)
{
bytets = time(NULL);
if(bper >= 75)
bper -= 75;
}
// printf("Debug: %d bytes\n", bper);
if(bper > CLIENT_FLOOD_AUX)
return;
if(sendQ.highSize == 0)
{
if((sendQ.lowSize > 0) && (lastMsg < time(0) - LOWMSG_DELAY))
{
bper += strlen(sendQ.low[0].message);
irc_write(sendQ.low[0].message);
free(sendQ.low[0].message);
memcpy(sendQ.low, &sendQ.low[1], --sendQ.lowSize * sizeof(struct nodeQ) );
}
} else if( (lastMsg < time(0) - HIGHMSG_DELAY) || (bper < CLIENT_FLOOD_LOW) ) {
bper += strlen(sendQ.high[0].message);
irc_write(sendQ.high[0].message);
free(sendQ.high[0].message);
memcpy(sendQ.high, &sendQ.high[1], --sendQ.highSize * sizeof(struct nodeQ) );
}
return;
}
void quickMsg(char *message)
{
if(bper > CLIENT_FLOOD)
highMsg(message);
else
irc_write(message);
return;
}