|
3
|
1 #include <stdio.h>
|
|
5
|
2 #include <stdlib.h>
|
|
3
|
3 #include "MailManager.h"
|
|
|
4
|
|
19
|
5 MailManager::MailManager(void)
|
|
|
6 {
|
|
|
7 mailQueuePool = NULL;
|
|
|
8 freeMailQueue = NULL;
|
|
|
9 }
|
|
|
10
|
|
3
|
11 int
|
|
|
12 MailManager::init_pool_mailQueue(int num)
|
|
|
13 {
|
|
|
14 if (!mailQueuePool) {
|
|
|
15 return extend_pool_mailQueue(num);
|
|
|
16 }
|
|
|
17 return 0;
|
|
|
18 }
|
|
|
19
|
|
|
20 int
|
|
|
21 MailManager::extend_pool_mailQueue(int num)
|
|
|
22 {
|
|
|
23 MailQueuePtr q;
|
|
|
24
|
|
5
|
25 q = (MailQueuePtr)malloc(sizeof(MailQueue)*(num+1));
|
|
3
|
26
|
|
|
27 if (q == NULL) {
|
|
|
28 return -1;
|
|
|
29 }
|
|
|
30 q->next = mailQueuePool;
|
|
|
31 mailQueuePool = q;
|
|
|
32
|
|
|
33 /* Connect all free queue in the pool */
|
|
6
|
34 for (q = mailQueuePool + 1; --num > 0; q++) {
|
|
3
|
35 q->next = q + 1;
|
|
|
36 }
|
|
|
37 q->next = freeMailQueue;
|
|
|
38 freeMailQueue = mailQueuePool + 1;
|
|
|
39
|
|
|
40 return 0;
|
|
|
41 }
|
|
|
42
|
|
|
43 MailQueuePtr
|
|
|
44 MailManager::create_mail(unsigned int data)
|
|
|
45 {
|
|
|
46 return get_free_mailQueue(data);
|
|
|
47 }
|
|
|
48
|
|
|
49 MailQueuePtr
|
|
|
50 MailManager::get_free_mailQueue(unsigned int data)
|
|
|
51 {
|
|
|
52 MailQueuePtr q;
|
|
|
53
|
|
|
54 if (!freeMailQueue) {
|
|
|
55 extend_pool_mailQueue(30);
|
|
|
56 }
|
|
|
57 q = freeMailQueue;
|
|
|
58 freeMailQueue = freeMailQueue->next;
|
|
|
59
|
|
|
60 q->data = data;
|
|
|
61 q->next = NULL;
|
|
|
62
|
|
|
63 return q;
|
|
|
64 }
|
|
|
65
|
|
|
66 void
|
|
|
67 MailManager::free_mailQueue(MailQueuePtr q)
|
|
|
68 {
|
|
|
69 q->next = freeMailQueue;
|
|
|
70 freeMailQueue = q;
|
|
|
71 }
|
|
|
72
|
|
|
73
|
|
|
74 MailQueuePtr
|
|
|
75 append_mailQueue(MailQueuePtr list, MailQueuePtr q)
|
|
|
76 {
|
|
|
77 MailQueuePtr p = list;
|
|
|
78
|
|
|
79 if (p == NULL) {
|
|
|
80 return q;
|
|
|
81 } else {
|
|
|
82 while(p->next) p = p->next;
|
|
|
83 p->next = q;
|
|
|
84 return list;
|
|
|
85 }
|
|
|
86 }
|
