Hash :
38aec9ec
Author :
Date :
2009-10-23T22:38:35
Tweaks to IOCP interface. svn:r1461
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 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250
/*
* Copyright (c) 2009 Niels Provos and Nick Mathewson
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdlib.h>
#include <string.h>
#include <event2/event.h>
#include <event2/thread.h>
#include <event2/buffer.h>
#include <event2/bufferevent.h>
#include "regress.h"
#include "tinytest.h"
#include "tinytest_macros.h"
#include "iocp-internal.h"
#include "evthread-internal.h"
/* FIXME remove these ones */
#include <sys/queue.h>
#include "event2/event_struct.h"
#include "event-internal.h"
#define MAX_CALLS 16
struct dummy_overlapped {
struct event_overlapped eo;
void *lock;
int call_count;
uintptr_t keys[MAX_CALLS];
ev_ssize_t sizes[MAX_CALLS];
};
static void
dummy_cb(struct event_overlapped *o, uintptr_t key, ev_ssize_t n)
{
struct dummy_overlapped *d_o =
EVUTIL_UPCAST(o, struct dummy_overlapped, eo);
EVLOCK_LOCK(d_o->lock, EVTHREAD_WRITE);
if (d_o->call_count < MAX_CALLS) {
d_o->keys[d_o->call_count] = key;
d_o->sizes[d_o->call_count] = n;
}
d_o->call_count++;
EVLOCK_UNLOCK(d_o->lock, EVTHREAD_WRITE);
}
static int
pair_is_in(struct dummy_overlapped *o, uintptr_t key, ev_ssize_t n)
{
int i;
int result = 0;
EVLOCK_LOCK(o->lock, EVTHREAD_WRITE);
for (i=0; i < o->call_count; ++i) {
if (o->keys[i] == key && o->sizes[i] == n) {
result = 1;
break;
}
}
EVLOCK_UNLOCK(o->lock, EVTHREAD_WRITE);
return result;
}
static void
test_iocp_port(void *ptr)
{
struct event_iocp_port *port = NULL;
struct dummy_overlapped o1, o2;
#ifdef WIN32
evthread_use_windows_threads();
#endif
memset(&o1, 0, sizeof(o1));
memset(&o2, 0, sizeof(o2));
EVTHREAD_ALLOC_LOCK(o1.lock);
EVTHREAD_ALLOC_LOCK(o2.lock);
tt_assert(o1.lock);
tt_assert(o2.lock);
event_overlapped_init(&o1.eo, dummy_cb);
event_overlapped_init(&o2.eo, dummy_cb);
port = event_iocp_port_launch();
tt_assert(port);
tt_assert(!event_iocp_activate_overlapped(port, &o1.eo, 10, 100));
tt_assert(!event_iocp_activate_overlapped(port, &o2.eo, 20, 200));
tt_assert(!event_iocp_activate_overlapped(port, &o1.eo, 11, 101));
tt_assert(!event_iocp_activate_overlapped(port, &o2.eo, 21, 201));
tt_assert(!event_iocp_activate_overlapped(port, &o1.eo, 12, 102));
tt_assert(!event_iocp_activate_overlapped(port, &o2.eo, 22, 202));
tt_assert(!event_iocp_activate_overlapped(port, &o1.eo, 13, 103));
tt_assert(!event_iocp_activate_overlapped(port, &o2.eo, 23, 203));
#ifdef WIN32
/* FIXME Be smarter. */
Sleep(1000);
#endif
tt_want(!event_iocp_shutdown(port, 2000));
tt_int_op(o1.call_count, ==, 4);
tt_int_op(o2.call_count, ==, 4);
tt_want(pair_is_in(&o1, 10, 100));
tt_want(pair_is_in(&o1, 11, 101));
tt_want(pair_is_in(&o1, 12, 102));
tt_want(pair_is_in(&o1, 13, 103));
tt_want(pair_is_in(&o2, 20, 200));
tt_want(pair_is_in(&o2, 21, 201));
tt_want(pair_is_in(&o2, 22, 202));
tt_want(pair_is_in(&o2, 23, 203));
end:
/* FIXME free the locks. */
;
}
static void
test_iocp_evbuffer(void *ptr)
{
struct basic_test_data *data = ptr;
struct event_iocp_port *port = NULL;
struct evbuffer *rbuf = NULL, *wbuf = NULL;
char junk[1024];
int i;
#ifdef WIN32
evthread_use_windows_threads();
#endif
for (i = 0; i < sizeof(junk); ++i)
junk[i] = (char)(i);
rbuf = evbuffer_overlapped_new(data->pair[0]);
wbuf = evbuffer_overlapped_new(data->pair[1]);
evbuffer_enable_locking(rbuf, NULL);
evbuffer_enable_locking(wbuf, NULL);
port = event_iocp_port_launch();
tt_assert(port);
tt_assert(rbuf);
tt_assert(wbuf);
tt_assert(!event_iocp_port_associate(port, data->pair[0], 100));
tt_assert(!event_iocp_port_associate(port, data->pair[1], 100));
for (i=0;i<10;++i)
evbuffer_add(wbuf, junk, sizeof(junk));
tt_assert(!evbuffer_get_length(rbuf));
tt_assert(!evbuffer_launch_write(wbuf, 512));
tt_assert(!evbuffer_launch_read(rbuf, 2048));
#ifdef WIN32
/* FIXME this is stupid. */
Sleep(1000);
#endif
tt_int_op(evbuffer_get_length(rbuf),==,512);
/* FIXME Actually test some stuff here. */
tt_want(!event_iocp_shutdown(port, 2000));
end:
evbuffer_free(rbuf);
evbuffer_free(wbuf);
}
static void
test_iocp_bufferevent_async(void *ptr)
{
struct basic_test_data *data = ptr;
struct event_iocp_port *port = NULL;
struct bufferevent *bea1=NULL, *bea2=NULL;
char buf[128];
size_t n;
struct timeval one_sec = {1,0};
#ifdef WIN32
evthread_use_windows_threads();
#endif
event_base_start_iocp(data->base);
port = event_base_get_iocp(data->base);
tt_assert(port);
bea1 = bufferevent_async_new(data->base, data->pair[0],
BEV_OPT_DEFER_CALLBACKS);
bea2 = bufferevent_async_new(data->base, data->pair[1],
BEV_OPT_DEFER_CALLBACKS);
tt_assert(bea1);
tt_assert(bea2);
/*FIXME set some callbacks */
bufferevent_enable(bea1, EV_WRITE);
bufferevent_enable(bea2, EV_READ);
bufferevent_write(bea1, "Hello world", strlen("Hello world")+1);
event_base_loopexit(data->base, &one_sec);
event_base_dispatch(data->base);
n = bufferevent_read(bea2, buf, sizeof(buf)-1);
buf[n]='\0';
tt_str_op(buf, ==, "Hello world");
tt_want(!event_iocp_shutdown(port, 2000));
end:
/* FIXME: free stuff. */;
}
struct testcase_t iocp_testcases[] = {
{ "port", test_iocp_port, TT_FORK, NULL, NULL },
{ "evbuffer", test_iocp_evbuffer, TT_FORK|TT_NEED_SOCKETPAIR,
&basic_setup, NULL },
{ "bufferevent_async", test_iocp_bufferevent_async,
TT_FORK|TT_NEED_SOCKETPAIR|TT_NEED_BASE, &basic_setup, NULL },
END_OF_TESTCASES
};