Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
T
timeout.c
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Kirill Smelkov
timeout.c
Commits
cc8d1f97
Commit
cc8d1f97
authored
Jan 31, 2014
by
william
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
build Lua module
parent
cde9df2c
Changes
5
Hide whitespace changes
Inline
Side-by-side
Showing
5 changed files
with
221 additions
and
214 deletions
+221
-214
Makefile
Makefile
+3
-0
bench-heap.c
bench-heap.c
+46
-25
bench-wheel.c
bench-wheel.c
+38
-22
bench.c
bench.c
+124
-112
bench.h
bench.h
+10
-55
No files found.
Makefile
View file @
cc8d1f97
...
...
@@ -34,6 +34,9 @@ else
SOFLAGS
=
-shared
endif
bench.so
:
bench.c
$(CC)
-o
$@
$<
$(CPPFLAGS)
-DLUA_COMPAT_ALL
$(CFLAGS)
-Wno-unused-function
$(SOFLAGS)
bench-wheel8.so
:
CPPFLAGS+=-DWHEEL_BIT=3 -DWHEEL_NUM=$(WHEEL_NUM)
bench-wheel8.so
:
timeout.c
...
...
bench-heap.c
View file @
cc8d1f97
...
...
@@ -40,6 +40,7 @@ typedef struct min_heap
{
struct
timeout
**
p
;
unsigned
n
,
a
;
timeout_t
curtime
;
}
min_heap_t
;
static
inline
void
min_heap_ctor
(
min_heap_t
*
s
);
...
...
@@ -155,61 +156,81 @@ void min_heap_shift_down_(min_heap_t* s, unsigned hole_index, struct timeout* e)
#endif
/* _MIN_HEAP_H_ */
static
timeout_t
curtime
;
static
min_heap_t
timeouts
;
static
void
init
(
struct
timeout
*
timeout
,
size_t
count
,
int
verbose
)
{
static
void
*
init
(
struct
timeout
*
timeout
,
size_t
count
,
int
verbose
)
{
min_heap_t
*
H
;
size_t
i
;
min_heap_ctor
(
&
timeouts
);
if
(
0
!=
min_heap_reserve
(
&
timeouts
,
count
))
H
=
calloc
(
1
,
sizeof
*
H
);
min_heap_ctor
(
H
);
if
(
0
!=
min_heap_reserve
(
H
,
count
))
err
(
1
,
"realloc"
);
for
(
i
=
0
;
i
<
count
;
i
++
)
{
min_heap_elem_init
(
&
timeout
[
i
]);
}
return
H
;
}
/* init() */
static
void
add
(
struct
timeout
*
to
,
timeout_t
expires
)
{
min_heap_erase
(
&
timeouts
,
to
);
to
->
expires
=
curtime
+
expires
;
if
(
0
!=
min_heap_push
(
&
timeouts
,
to
))
static
void
add
(
void
*
ctx
,
struct
timeout
*
to
,
timeout_t
expires
)
{
min_heap_t
*
H
=
ctx
;
min_heap_erase
(
H
,
to
);
to
->
expires
=
H
->
curtime
+
expires
;
if
(
0
!=
min_heap_push
(
H
,
to
))
err
(
1
,
"realloc"
);
}
/* add() */
static
void
del
(
struct
timeout
*
to
)
{
min_heap_erase
(
&
timeouts
,
to
);
static
void
del
(
void
*
ctx
,
struct
timeout
*
to
)
{
min_heap_erase
(
ctx
,
to
);
}
/* del() */
static
struct
timeout
*
get
(
void
)
{
static
struct
timeout
*
get
(
void
*
ctx
)
{
min_heap_t
*
H
=
ctx
;
struct
timeout
*
to
;
if
((
to
=
min_heap_top
(
&
timeouts
))
&&
to
->
expires
<=
curtime
)
return
min_heap_pop
(
&
timeouts
);
if
((
to
=
min_heap_top
(
H
))
&&
to
->
expires
<=
H
->
curtime
)
return
min_heap_pop
(
H
);
return
NULL
;
}
/* get() */
static
void
update
(
timeout_t
ts
)
{
curtime
=
ts
;
static
void
update
(
void
*
ctx
,
timeout_t
ts
)
{
min_heap_t
*
H
=
ctx
;
H
->
curtime
=
ts
;
}
/* update() */
static
void
check
(
void
)
{
static
void
check
(
void
*
ctx
)
{
return
;
}
/* check() */
const
struct
vops
VOPS
=
{
.
init
=
&
init
,
.
add
=
&
add
,
.
del
=
&
del
,
.
get
=
&
get
,
.
update
=
&
update
,
.
check
=
&
check
,
static
int
empty
(
void
*
ctx
)
{
min_heap_t
*
H
=
ctx
;
return
(
NULL
==
min_heap_top
(
H
));
}
/* empty() */
static
void
destroy
(
void
*
H
)
{
free
(
H
);
return
;
}
/* destroy() */
const
struct
benchops
benchops
=
{
.
init
=
&
init
,
.
add
=
&
add
,
.
del
=
&
del
,
.
get
=
&
get
,
.
update
=
&
update
,
.
check
=
&
check
,
.
empty
=
&
empty
,
.
destroy
=
&
destroy
,
};
bench-wheel.c
View file @
cc8d1f97
#include <stdlib.h>
#include "timeout.h"
#include "timeout.c"
#include "bench.h"
static
struct
timeouts
timeouts
;
static
void
init
(
struct
timeout
*
timeout
,
size_t
count
,
int
verbose
)
{
static
void
*
init
(
struct
timeout
*
timeout
,
size_t
count
,
int
verbose
)
{
struct
timeouts
*
T
;
size_t
i
;
int
error
;
timeouts_init
(
&
timeouts
,
TIMEOUT_mHZ
);
T
=
timeouts_open
(
TIMEOUT_mHZ
,
&
error
);
for
(
i
=
0
;
i
<
count
;
i
++
)
{
timeout_init
(
&
timeout
[
i
],
0
);
...
...
@@ -17,41 +19,55 @@ static void init(struct timeout *timeout, size_t count, int verbose) {
#if TIMEOUT_DEBUG - 0
timeout_debug
=
verbose
;
#endif
return
T
;
}
/* init() */
static
void
add
(
struct
timeout
*
to
,
timeout_t
expires
)
{
timeouts_add
(
&
timeouts
,
to
,
expires
);
static
void
add
(
void
*
T
,
struct
timeout
*
to
,
timeout_t
expires
)
{
timeouts_add
(
T
,
to
,
expires
);
}
/* add() */
static
void
del
(
struct
timeout
*
to
)
{
timeouts_del
(
&
timeouts
,
to
);
static
void
del
(
void
*
T
,
struct
timeout
*
to
)
{
timeouts_del
(
T
,
to
);
}
/* del() */
static
struct
timeout
*
get
(
void
)
{
return
timeouts_get
(
&
timeouts
);
static
struct
timeout
*
get
(
void
*
T
)
{
return
timeouts_get
(
T
);
}
/* get() */
static
void
update
(
timeout_t
ts
)
{
timeouts_update
(
&
timeouts
,
ts
);
static
void
update
(
void
*
T
,
timeout_t
ts
)
{
timeouts_update
(
T
,
ts
);
}
/* update() */
static
void
(
check
)(
void
)
{
if
(
!
timeouts_check
(
&
timeouts
,
stderr
))
_Exit
(
1
);
static
void
(
check
)(
void
*
T
)
{
if
(
!
timeouts_check
(
T
,
stderr
))
_Exit
(
1
);
}
/* check() */
const
struct
vops
VOPS
=
{
.
init
=
&
init
,
.
add
=
&
add
,
.
del
=
&
del
,
.
get
=
&
get
,
.
update
=
&
update
,
.
check
=
&
check
,
static
int
empty
(
void
*
T
)
{
return
!
(
timeouts_pending
(
T
)
||
timeouts_expired
(
T
));
}
/* empty() */
static
void
destroy
(
void
*
T
)
{
timeouts_close
(
T
);
}
/* destroy() */
const
struct
benchops
benchops
=
{
.
init
=
&
init
,
.
add
=
&
add
,
.
del
=
&
del
,
.
get
=
&
get
,
.
update
=
&
update
,
.
check
=
&
check
,
.
empty
=
&
empty
,
.
destroy
=
&
destroy
};
bench.c
View file @
cc8d1f97
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <locale.h>
#include <time.h>
#include <errno.h>
#include <unistd.h>
#include <dlfcn.h>
#include <err.h>
#include <lua.h>
#include <lualib.h>
#include <lauxlib.h>
#include "timeout.h"
#include "bench.h"
#ifndef countof
#define countof(a) (sizeof (a) / sizeof *(a))
#endif
struct
{
struct
bench
{
const
char
*
path
;
void
*
solib
;
size_t
count
;
timeout_t
maximum
;
int
verbose
;
void
*
state
;
struct
timeout
*
timeout
;
struct
vops
v
ops
;
struct
benchops
ops
;
timeout_t
curtime
;
}
MAIN
=
{
.
path
=
"bench-wheel.so"
,
.
count
=
32678
,
.
maximum
=
60000
,
// 60 seconds in milliseconds
};
};
/* struct bench */
static
int
split
(
char
**
argv
,
int
max
,
char
*
src
)
{
char
**
ap
=
argv
,
**
pe
=
argv
+
max
;
static
int
bench_new
(
lua_State
*
L
)
{
const
char
*
path
=
luaL_checkstring
(
L
,
1
);
size_t
count
=
luaL_optlong
(
L
,
2
,
1000000
);
timeout_t
tmax
=
luaL_optlong
(
L
,
3
,
60
*
1000
);
int
verbose
=
(
lua_isnone
(
L
,
4
))
?
0
:
lua_toboolean
(
L
,
4
);
struct
bench
*
B
;
struct
benchops
*
ops
;
while
(
ap
<
pe
&&
(
*
ap
=
strsep
(
&
src
,
"
\t\n
"
)))
{
if
(
**
ap
)
++
ap
;
}
B
=
lua_newuserdata
(
L
,
sizeof
*
B
);
memset
(
B
,
0
,
sizeof
*
B
);
luaL_getmetatable
(
L
,
"BENCH*"
);
lua_setmetatable
(
L
,
-
2
);
B
->
count
=
count
;
B
->
maximum
=
tmax
;
B
->
verbose
=
verbose
;
if
(
!
(
B
->
timeout
=
calloc
(
count
,
sizeof
*
B
->
timeout
)))
return
luaL_error
(
L
,
"%s"
,
strerror
(
errno
));
if
(
!
(
B
->
solib
=
dlopen
(
path
,
RTLD_NOW
|
RTLD_LOCAL
)))
return
luaL_error
(
L
,
"%s: %s"
,
path
,
dlerror
());
if
(
!
(
ops
=
dlsym
(
B
->
solib
,
"benchops"
)))
return
luaL_error
(
L
,
"%s: %s"
,
path
,
dlerror
());
B
->
ops
=
*
ops
;
B
->
state
=
B
->
ops
.
init
(
B
->
timeout
,
B
->
count
,
B
->
verbose
);
return
1
;
}
/* bench_new() */
static
int
bench_add
(
lua_State
*
L
)
{
struct
bench
*
B
=
lua_touserdata
(
L
,
1
);
unsigned
i
;
timeout_t
t
;
i
=
(
lua_isnoneornil
(
L
,
2
))
?
random
()
%
B
->
count
:
(
unsigned
)
luaL_checklong
(
L
,
2
);
t
=
(
lua_isnoneornil
(
L
,
3
))
?
random
()
%
B
->
maximum
:
(
unsigned
)
luaL_checklong
(
L
,
3
);
B
->
ops
.
add
(
B
->
state
,
&
B
->
timeout
[
i
],
t
);
return
ap
-
argv
;
}
/* split() */
struct
op
*
parseop
(
struct
op
*
op
,
char
*
ln
)
{
char
*
arg
[
8
];
int
argc
;
if
(
!
(
argc
=
split
(
arg
,
countof
(
arg
),
ln
)))
return
NULL
;
return
0
;
}
/* bench_add() */
static
int
bench_del
(
lua_State
*
L
)
{
struct
bench
*
B
=
lua_touserdata
(
L
,
1
);
unsigned
i
;
i
=
(
lua_isnoneornil
(
L
,
2
))
?
random
()
%
B
->
count
:
(
unsigned
)
luaL_checklong
(
L
,
2
);
B
->
ops
.
del
(
B
->
state
,
&
B
->
timeout
[
i
]);
return
0
;
}
/* bench_del() */
switch
(
**
arg
)
{
case
'q'
:
/* quit */
op
->
type
=
OP_QUIT
;
break
;
case
'h'
:
/* help */
op
->
type
=
OP_HELP
;
static
int
bench_fill
(
lua_State
*
L
)
{
struct
bench
*
B
=
lua_touserdata
(
L
,
1
);
size_t
i
;
break
;
case
'a'
:
/* add */
if
(
argc
!=
3
)
goto
badargc
;
for
(
i
=
0
;
i
<
B
->
count
;
i
++
)
{
B
->
ops
.
add
(
B
->
state
,
&
B
->
timeout
[
i
],
random
()
%
B
->
maximum
);
}
return
0
;
}
/* bench_fill() */
op
->
type
=
OP_ADD
;
op
->
add
.
id
=
strtoul
(
arg
[
1
],
NULL
,
0
)
%
MAIN
.
count
;
op
->
add
.
timeout
=
strtoul
(
arg
[
2
],
NULL
,
0
);
break
;
case
'd'
:
/* del */
if
(
argc
!=
2
)
goto
badargc
;
static
int
bench_expire
(
lua_State
*
L
)
{
struct
bench
*
B
=
lua_touserdata
(
L
,
1
);
unsigned
count
=
luaL_optlong
(
L
,
2
,
B
->
count
);
unsigned
step
=
luaL_optlong
(
L
,
3
,
300
);
size_t
i
=
0
;
op
->
type
=
OP_DEL
;
op
->
del
.
id
=
strtoul
(
arg
[
1
],
NULL
,
0
)
%
MAIN
.
count
;
while
(
i
<
count
&&
!
B
->
ops
.
empty
(
B
->
state
))
{
B
->
curtime
+=
step
;
B
->
ops
.
update
(
B
->
state
,
B
->
curtime
);
break
;
case
'g'
:
/* get */
op
->
type
=
OP_GET
;
op
->
get
.
verbose
=
(
argc
>
1
)
?
strtol
(
arg
[
1
],
NULL
,
0
)
:
0
;
while
(
B
->
ops
.
get
(
B
->
state
))
i
++
;
}
break
;
case
's'
:
/* step */
if
(
argc
!=
2
)
goto
badargc
;
return
0
;
}
/* bench_expire() */
op
->
type
=
OP_STEP
;
op
->
step
.
time
=
strtoul
(
arg
[
1
],
NULL
,
0
);
break
;
case
'u'
:
/* update */
if
(
argc
!=
2
)
goto
badargc
;
static
int
bench__gc
(
lua_State
*
L
)
{
struct
bench
*
B
=
lua_touserdata
(
L
,
1
);
op
->
type
=
OP_UPDATE
;
op
->
update
.
time
=
strtoul
(
arg
[
1
],
NULL
,
0
);
if
(
B
->
state
)
{
B
->
ops
.
destroy
(
B
->
state
);
B
->
state
=
NULL
;
}
break
;
case
'c'
:
/* check */
op
->
type
=
OP_CHECK
;
return
0
;
}
/* bench_expire() */
break
;
case
'f'
:
/* fill */
op
->
type
=
OP_FILL
;
break
;
case
'#'
:
/* FALL THROUGH */
case
'n'
:
op
->
type
=
OP_NONE
;
static
const
luaL_Reg
bench_methods
[]
=
{
{
"add"
,
&
bench_add
},
{
"del"
,
&
bench_del
},
{
"fill"
,
&
bench_fill
},
{
"expire"
,
&
bench_expire
},
{
NULL
,
NULL
}
};
break
;
case
't'
:
op
->
type
=
OP_TIME
;
static
const
luaL_Reg
bench_metatable
[]
=
{
{
"__gc"
,
&
bench__gc
},
{
NULL
,
NULL
}
};
break
;
default:
op
->
type
=
OP_OOPS
;
snprintf
(
op
->
oops
.
why
,
sizeof
op
->
oops
.
why
,
"%.8s: illegal op"
,
*
arg
)
;
static
const
luaL_Reg
bench_globals
[]
=
{
{
"new"
,
&
bench_new
},
{
NULL
,
NULL
}
}
;
break
;
}
/* switch() */
int
luaopen_bench
(
lua_State
*
L
)
{
if
(
luaL_newmetatable
(
L
,
"BENCH*"
))
{
luaL_register
(
L
,
NULL
,
bench_metatable
);
lua_newtable
(
L
);
luaL_register
(
L
,
NULL
,
bench_methods
);
lua_setfield
(
L
,
-
2
,
"__index"
);
}
return
op
;
badargc:
op
->
type
=
OP_OOPS
;
snprintf
(
op
->
oops
.
why
,
sizeof
op
->
oops
.
why
,
"wrong number of arguments"
);
lua_pop
(
L
,
1
);
return
op
;
}
/* parseop() */
lua_newtable
(
L
)
;
luaL_register
(
L
,
NULL
,
bench_globals
);
return
1
;
}
/* luaopen_bench() */
#define SHORT_OPTS "n:t:vh"
static
void
usage
(
FILE
*
fp
)
{
fprintf
(
fp
,
"bench [-%s] LIBRARY
\n
"
\
" -n MAX maximum number of timeouts
\n
"
\
" -t MAX maximum timeout
\n
"
\
" -v increase log level
\n
"
\
" -h print usage message
\n
"
\
"
\n
"
\
"[commands]
\n
"
\
" help print usage message
\n
"
\
" quit exit program
\n
"
\
"
\n
"
\
"Report bugs to <william@25thandClement.com>
\n
"
,
SHORT_OPTS
);
}
/* usage() */
#if 0
int main(int argc, char **argv) {
extern char *optarg;
extern int optind;
...
...
@@ -285,3 +295,5 @@ int main(int argc, char **argv) {
quit:
return 0;
} /* main() */
#endif
bench.h
View file @
cc8d1f97
struct
op
{
enum
{
OP_OOPS
,
OP_QUIT
,
OP_HELP
,
OP_ADD
,
OP_DEL
,
OP_GET
,
OP_STEP
,
OP_UPDATE
,
OP_CHECK
,
OP_FILL
,
OP_NONE
,
OP_TIME
,
}
type
;
union
{
struct
{
char
why
[
32
];
}
oops
;
struct
{
unsigned
id
;
timeout_t
timeout
;
}
add
;
struct
{
unsigned
id
;
}
del
;
struct
{
int
verbose
;
}
get
;
struct
{
timeout_t
time
;
}
step
,
update
;
};
};
/* struct op */
struct
op
*
parseop
(
struct
op
*
,
char
*
ln
);
struct
vops
{
void
(
*
init
)(
struct
timeout
*
,
size_t
,
int
);
void
(
*
add
)(
struct
timeout
*
,
timeout_t
);
void
(
*
del
)(
struct
timeout
*
);
struct
timeout
*
(
*
get
)(
void
);
void
(
*
update
)(
timeout_t
);
void
(
*
check
)(
void
);
};
/* struct vops() */
struct
benchops
{
void
*
(
*
init
)(
struct
timeout
*
,
size_t
,
int
);
void
(
*
add
)(
void
*
,
struct
timeout
*
,
timeout_t
);
void
(
*
del
)(
void
*
,
struct
timeout
*
);
struct
timeout
*
(
*
get
)(
void
*
);
void
(
*
update
)(
void
*
,
timeout_t
);
void
(
*
check
)(
void
*
);
int
(
*
empty
)(
void
*
);
void
(
*
destroy
)(
void
*
);
};
/* struct benchops() */
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment