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
|
--- isoqlog/Data.c.orig 2004-04-10 09:00:30 UTC
+++ isoqlog/Data.c
@@ -173,34 +173,35 @@ void freeSortDomainTab()
int addUserToSortTab(user *usr)
{
- int *u;
+ user* *u;
if (SortDomain.allusers == NULL) { /* first time */
- SortDomain.allusers = (int *)malloc(NVINIT * sizeof(int *));
+ SortDomain.allusers = malloc(NVINIT * sizeof(user**));
if (SortDomain.allusers == NULL)
return -1;
SortDomain.max = NVINIT;
SortDomain.nval = 0;
} else
if (SortDomain.nval >= SortDomain.max) { /* growing....*/
- u = (int *)realloc(SortDomain.allusers,
- (NVGROW * SortDomain.max) * sizeof(int *));
+ u = realloc(SortDomain.allusers,
+ (NVGROW * SortDomain.max) * sizeof(user**));
if (u == NULL)
return -1;
SortDomain.max *= NVGROW;
SortDomain.allusers = u;
}
- SortDomain.allusers[SortDomain.nval] = (int)usr;
+ SortDomain.allusers[SortDomain.nval] = usr;
return SortDomain.nval++;
}
void sortDomainUsersFrom(char *domain)
{
- int tmpnval, i, j, max, tmp;
+ int tmpnval, i, j, max;
struct domain *domainptr;
struct user *sym;
struct user *tmp1, *tmp2;
+ user* tmp;
tmpnval = -1;
for (i = 0; i < DomainsTab.nval; i++)
@@ -233,10 +234,11 @@ void sortDomainUsersFrom(char *domain)
void sortDomainUsersTo(char *domain)
{
- int tmpnval, i, j, max, tmp;
+ int tmpnval, i, j, max;
struct domain *domainptr;
struct user *sym;
struct user *tmp1, *tmp2;
+ user* tmp;
tmpnval = -1;
for (i = 0; i < DomainsTab.nval; i++)
@@ -268,10 +270,11 @@ void sortDomainUsersTo(char *domain)
void sortDomainUsersTotal(char *domain)
{
- int tmpnval, i, j, max, tmp;
+ int tmpnval, i, j, max;
struct domain *domainptr;
struct user *sym;
struct user *tmp1, *tmp2;
+ user * tmp;
tmpnval = -1;
for (i = 0; i < DomainsTab.nval; i++)
@@ -307,10 +310,11 @@ void sortDomainUsersTotal(char *domain)
void sortDomainUsersByte(char *domain)
{
- int tmpnval, i, j, max, tmp;
+ int tmpnval, i, j, max;
struct domain *domainptr;
struct user *sym;
struct user *tmp1, *tmp2;
+ user *tmp;
tmpnval = -1;
for (i = 0; i < DomainsTab.nval; i++)
@@ -345,7 +349,7 @@ void sortUsersFrom()
{
int i, j, max;
globuser *sym;
- int tmp;
+ user *tmp;
user *tmp1;
user *tmp2;
@@ -373,7 +377,7 @@ void sortUsersTo()
{
int i, j, max;
globuser *sym;
- int tmp;
+ user *tmp;
user *tmp1;
user *tmp2;
@@ -402,7 +406,7 @@ void sortUsersTotal()
{
int i, j, max;
globuser *sym;
- int tmp;
+ user *tmp;
user *tmp1;
user *tmp2;
@@ -430,7 +434,7 @@ void sortUsersByte()
{
int i, j, max;
globuser *sym;
- int tmp;
+ user *tmp;
user *tmp1;
user *tmp2;
|
