/dports/emulators/py-unicorn/unicorn-1.0.2/qemu/include/qemu/ |
H A D | queue.h | 107 #define QLIST_INSERT_AFTER(listelm, elm, field) do { \ argument 115 #define QLIST_INSERT_BEFORE(listelm, elm, field) do { \ argument 122 #define QLIST_INSERT_HEAD(head, elm, field) do { \ argument 129 #define QLIST_INSERT_HEAD_RCU(head, elm, field) do { \ argument 140 #define QLIST_REMOVE(elm, field) do { \ argument 147 #define QLIST_FOREACH(var, head, field) \ argument 162 #define QLIST_NEXT(elm, field) ((elm)->field.le_next) argument 220 #define QSLIST_NEXT(elm, field) ((elm)->field.sle_next) argument 313 #define QSIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument 407 #define QTAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument [all …]
|
/dports/emulators/bochs/bochs-2.7/ |
H A D | qemu-queue.h | 107 #define QLIST_INSERT_AFTER(listelm, elm, field) do { \ argument 115 #define QLIST_INSERT_BEFORE(listelm, elm, field) do { \ argument 122 #define QLIST_INSERT_HEAD(head, elm, field) do { \ argument 129 #define QLIST_INSERT_HEAD_RCU(head, elm, field) do { \ argument 140 #define QLIST_REMOVE(elm, field) do { \ argument 147 #define QLIST_FOREACH(var, head, field) \ argument 162 #define QLIST_NEXT(elm, field) ((elm)->field.le_next) argument 220 #define QSLIST_NEXT(elm, field) ((elm)->field.sle_next) argument 313 #define QSIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument 407 #define QTAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument [all …]
|
/dports/emulators/fs-uae/fs-uae-3.1.35/src/qemuvga/ |
H A D | queue.h | 107 #define QLIST_INSERT_AFTER(listelm, elm, field) do { \ argument 115 #define QLIST_INSERT_BEFORE(listelm, elm, field) do { \ argument 122 #define QLIST_INSERT_HEAD(head, elm, field) do { \ argument 129 #define QLIST_INSERT_HEAD_RCU(head, elm, field) do { \ argument 140 #define QLIST_REMOVE(elm, field) do { \ argument 147 #define QLIST_FOREACH(var, head, field) \ argument 162 #define QLIST_NEXT(elm, field) ((elm)->field.le_next) argument 220 #define QSLIST_NEXT(elm, field) ((elm)->field.sle_next) argument 313 #define QSIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument 407 #define QTAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument [all …]
|
/dports/net-mgmt/ettercap/ettercap-0.8.3.1/include/ |
H A D | ec_queue.h | 119 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument 121 #define SLIST_FOREACH(var, head, field) \ argument 127 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument 139 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument 144 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument 149 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 153 #define SLIST_REMOVE(head, elm, type, field) do { \ argument 189 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument 191 #define LIST_FOREACH(var, head, field) \ argument 270 #define STAILQ_NEXT(elm, field) ((elm)->field.sqe_next) argument [all …]
|
/dports/emulators/unicorn/unicorn-1.0.2/qemu/include/qemu/ |
H A D | queue.h | 107 #define QLIST_INSERT_AFTER(listelm, elm, field) do { \ argument 115 #define QLIST_INSERT_BEFORE(listelm, elm, field) do { \ argument 122 #define QLIST_INSERT_HEAD(head, elm, field) do { \ argument 129 #define QLIST_INSERT_HEAD_RCU(head, elm, field) do { \ argument 140 #define QLIST_REMOVE(elm, field) do { \ argument 147 #define QLIST_FOREACH(var, head, field) \ argument 162 #define QLIST_NEXT(elm, field) ((elm)->field.le_next) argument 220 #define QSLIST_NEXT(elm, field) ((elm)->field.sle_next) argument 313 #define QSIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument 407 #define QTAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument [all …]
|
/dports/net/ladvd/ladvd-1.1.2/src/compat/ |
H A D | sys-queue.h | 200 #define SLIST_FOREACH(var, head, field) \ argument 231 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 274 #define LIST_FOREACH(var, head, field) \ argument 308 #define LIST_REMOVE(elm, field) do { \ argument 317 #define LIST_REPLACE(elm, elm2, field) do { \ argument 352 #define SIMPLEQ_FOREACH(var, head, field) \ argument 383 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 415 #define TAILQ_PREV(elm, headname, field) \ argument 420 #define TAILQ_FOREACH(var, head, field) \ argument 472 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/net/freeswitch/freeswitch-1.10.3.-release/libs/miniupnpc/ |
H A D | bsdqueue.h | 119 #define SLIST_FOREACH(var, head, field) \ argument 150 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 193 #define LIST_FOREACH(var, head, field) \ argument 227 #define LIST_REMOVE(elm, field) do { \ argument 236 #define LIST_REPLACE(elm, elm2, field) do { \ argument 271 #define SIMPLEQ_FOREACH(var, head, field) \ argument 302 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 334 #define TAILQ_PREV(elm, headname, field) \ argument 339 #define TAILQ_FOREACH(var, head, field) \ argument 391 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/devel/libublio/libublio-20070103/ |
H A D | queue.h | 115 #define SLIST_FOREACH(var, head, field) \ argument 146 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 189 #define LIST_FOREACH(var, head, field) \ argument 223 #define LIST_REMOVE(elm, field) do { \ argument 232 #define LIST_REPLACE(elm, elm2, field) do { \ argument 267 #define SIMPLEQ_FOREACH(var, head, field) \ argument 298 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 330 #define TAILQ_PREV(elm, headname, field) \ argument 335 #define TAILQ_FOREACH(var, head, field) \ argument 387 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/games/SRB2/SRB2-SRB2_release_2.2.9/libs/miniupnpc/ |
H A D | bsdqueue.h | 119 #define SLIST_FOREACH(var, head, field) \ argument 150 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 193 #define LIST_FOREACH(var, head, field) \ argument 227 #define LIST_REMOVE(elm, field) do { \ argument 236 #define LIST_REPLACE(elm, elm2, field) do { \ argument 271 #define SIMPLEQ_FOREACH(var, head, field) \ argument 302 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 334 #define TAILQ_PREV(elm, headname, field) \ argument 339 #define TAILQ_FOREACH(var, head, field) \ argument 391 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/games/megaglest/megaglest-source-3.13.0/source/shared_lib/include/platform/miniupnpc/ |
H A D | bsdqueue.h | 119 #define SLIST_FOREACH(var, head, field) \ argument 150 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 193 #define LIST_FOREACH(var, head, field) \ argument 227 #define LIST_REMOVE(elm, field) do { \ argument 236 #define LIST_REPLACE(elm, elm2, field) do { \ argument 271 #define SIMPLEQ_FOREACH(var, head, field) \ argument 302 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 334 #define TAILQ_PREV(elm, headname, field) \ argument 339 #define TAILQ_FOREACH(var, head, field) \ argument 391 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/games/oldrunner/oldrunner/compat/ |
H A D | queue.h | 115 #define SLIST_FOREACH(var, head, field) \ argument 146 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 189 #define LIST_FOREACH(var, head, field) \ argument 223 #define LIST_REMOVE(elm, field) do { \ argument 232 #define LIST_REPLACE(elm, elm2, field) do { \ argument 267 #define SIMPLEQ_FOREACH(var, head, field) \ argument 298 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 330 #define TAILQ_PREV(elm, headname, field) \ argument 335 #define TAILQ_FOREACH(var, head, field) \ argument 387 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/games/odamex/odamex-src-0.7.0/libraries/libminiupnpc/ |
H A D | bsdqueue.h | 119 #define SLIST_FOREACH(var, head, field) \ argument 150 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 193 #define LIST_FOREACH(var, head, field) \ argument 227 #define LIST_REMOVE(elm, field) do { \ argument 236 #define LIST_REPLACE(elm, elm2, field) do { \ argument 271 #define SIMPLEQ_FOREACH(var, head, field) \ argument 302 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 334 #define TAILQ_PREV(elm, headname, field) \ argument 339 #define TAILQ_FOREACH(var, head, field) \ argument 391 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/net/vino/vino-3.22.0/server/miniupnp/ |
H A D | bsdqueue.h | 119 #define SLIST_FOREACH(var, head, field) \ argument 150 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 193 #define LIST_FOREACH(var, head, field) \ argument 227 #define LIST_REMOVE(elm, field) do { \ argument 236 #define LIST_REPLACE(elm, elm2, field) do { \ argument 271 #define SIMPLEQ_FOREACH(var, head, field) \ argument 302 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 334 #define TAILQ_PREV(elm, headname, field) \ argument 339 #define TAILQ_FOREACH(var, head, field) \ argument 391 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/devel/z88dk/z88dk/src/z80asm/lib/ |
H A D | queue.h | 113 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument 115 #define SLIST_FOREACH(var, head, field) \ argument 146 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 187 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument 189 #define LIST_FOREACH(var, head, field) \ argument 223 #define LIST_REMOVE(elm, field) do { \ argument 232 #define LIST_REPLACE(elm, elm2, field) do { \ argument 267 #define SIMPLEQ_FOREACH(var, head, field) \ argument 298 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 330 #define TAILQ_PREV(elm, headname, field) \ argument [all …]
|
/dports/x11/i3status/i3status-2.14/include/ |
H A D | queue.h | 113 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument 115 #define SLIST_FOREACH(var, head, field) \ argument 139 #define SLIST_INSERT_HEAD(head, elm, field) \ argument 192 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument 194 #define LIST_FOREACH(var, head, field) \ argument 275 #define SIMPLEQ_FOREACH(var, head, field) \ argument 296 #define SIMPLEQ_INSERT_TAIL(head, elm, field) \ argument 343 #define TAILQ_PREV(elm, headname, field) \ argument 348 #define TAILQ_FOREACH(var, head, field) \ argument 458 #define CIRCLEQ_FOREACH(var, head, field) \ argument [all …]
|
/dports/net-p2p/eiskaltdcpp-gtk/eiskaltdcpp-2.2.10/upnp/miniupnpc/ |
H A D | bsdqueue.h | 119 #define SLIST_FOREACH(var, head, field) \ argument 150 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 193 #define LIST_FOREACH(var, head, field) \ argument 227 #define LIST_REMOVE(elm, field) do { \ argument 236 #define LIST_REPLACE(elm, elm2, field) do { \ argument 271 #define SIMPLEQ_FOREACH(var, head, field) \ argument 302 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 334 #define TAILQ_PREV(elm, headname, field) \ argument 339 #define TAILQ_FOREACH(var, head, field) \ argument 391 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/net-p2p/eiskaltdcpp-data/eiskaltdcpp-2.2.10/upnp/miniupnpc/ |
H A D | bsdqueue.h | 119 #define SLIST_FOREACH(var, head, field) \ argument 150 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 193 #define LIST_FOREACH(var, head, field) \ argument 227 #define LIST_REMOVE(elm, field) do { \ argument 236 #define LIST_REPLACE(elm, elm2, field) do { \ argument 271 #define SIMPLEQ_FOREACH(var, head, field) \ argument 302 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 334 #define TAILQ_PREV(elm, headname, field) \ argument 339 #define TAILQ_FOREACH(var, head, field) \ argument 391 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/net-p2p/eiskaltdcpp-lib/eiskaltdcpp-2.2.10/upnp/miniupnpc/ |
H A D | bsdqueue.h | 119 #define SLIST_FOREACH(var, head, field) \ argument 150 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 193 #define LIST_FOREACH(var, head, field) \ argument 227 #define LIST_REMOVE(elm, field) do { \ argument 236 #define LIST_REPLACE(elm, elm2, field) do { \ argument 271 #define SIMPLEQ_FOREACH(var, head, field) \ argument 302 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 334 #define TAILQ_PREV(elm, headname, field) \ argument 339 #define TAILQ_FOREACH(var, head, field) \ argument 391 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/net-p2p/eiskaltdcpp-daemon/eiskaltdcpp-2.2.10/upnp/miniupnpc/ |
H A D | bsdqueue.h | 119 #define SLIST_FOREACH(var, head, field) \ argument 150 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 193 #define LIST_FOREACH(var, head, field) \ argument 227 #define LIST_REMOVE(elm, field) do { \ argument 236 #define LIST_REPLACE(elm, elm2, field) do { \ argument 271 #define SIMPLEQ_FOREACH(var, head, field) \ argument 302 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 334 #define TAILQ_PREV(elm, headname, field) \ argument 339 #define TAILQ_FOREACH(var, head, field) \ argument 391 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/net-p2p/eiskaltdcpp-cli/eiskaltdcpp-2.2.10/upnp/miniupnpc/ |
H A D | bsdqueue.h | 119 #define SLIST_FOREACH(var, head, field) \ argument 150 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 193 #define LIST_FOREACH(var, head, field) \ argument 227 #define LIST_REMOVE(elm, field) do { \ argument 236 #define LIST_REPLACE(elm, elm2, field) do { \ argument 271 #define SIMPLEQ_FOREACH(var, head, field) \ argument 302 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 334 #define TAILQ_PREV(elm, headname, field) \ argument 339 #define TAILQ_FOREACH(var, head, field) \ argument 391 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/benchmarks/iperf3/iperf-3.10.1/src/ |
H A D | queue.h | 115 #define SLIST_FOREACH(var, head, field) \ argument 146 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 189 #define LIST_FOREACH(var, head, field) \ argument 223 #define LIST_REMOVE(elm, field) do { \ argument 232 #define LIST_REPLACE(elm, elm2, field) do { \ argument 267 #define SIMPLEQ_FOREACH(var, head, field) \ argument 298 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 330 #define TAILQ_PREV(elm, headname, field) \ argument 335 #define TAILQ_FOREACH(var, head, field) \ argument 387 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/sysutils/fusefs-hfsfuse/hfsfuse-0.132/lib/ublio/ |
H A D | queue.h | 115 #define SLIST_FOREACH(var, head, field) \ argument 146 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 189 #define LIST_FOREACH(var, head, field) \ argument 223 #define LIST_REMOVE(elm, field) do { \ argument 232 #define LIST_REPLACE(elm, elm2, field) do { \ argument 267 #define SIMPLEQ_FOREACH(var, head, field) \ argument 298 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 330 #define TAILQ_PREV(elm, headname, field) \ argument 335 #define TAILQ_FOREACH(var, head, field) \ argument 387 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/mail/fdm/fdm-2.0/compat/ |
H A D | queue.h | 116 #define SLIST_FOREACH(var, head, field) \ argument 147 #define SLIST_REMOVE_HEAD(head, field) do { \ argument 190 #define LIST_FOREACH(var, head, field) \ argument 224 #define LIST_REMOVE(elm, field) do { \ argument 233 #define LIST_REPLACE(elm, elm2, field) do { \ argument 268 #define SIMPLEQ_FOREACH(var, head, field) \ argument 299 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument 331 #define TAILQ_PREV(elm, headname, field) \ argument 336 #define TAILQ_FOREACH(var, head, field) \ argument 388 #define TAILQ_REMOVE(head, elm, field) do { \ argument [all …]
|
/dports/devel/concurrencykit/ck-0.6.0/include/ |
H A D | ck_queue.h | 148 #define CK_SLIST_NEXT(elm, field) \ argument 151 #define CK_SLIST_FOREACH(var, head, field) \ argument 171 #define CK_SLIST_INSERT_AFTER(a, b, field) do { \ argument 183 #define CK_SLIST_REMOVE_AFTER(elm, field) do { \ argument 199 #define CK_SLIST_REMOVE_HEAD(head, field) do { \ argument 204 #define CK_SLIST_MOVE(head1, head2, field) do { \ argument 250 #define CK_STAILQ_FOREACH(var, head, field) \ argument 290 #define CK_STAILQ_NEXT(elm, field) \ argument 362 #define CK_LIST_FOREACH(var, head, field) \ argument 403 #define CK_LIST_REMOVE(elm, field) do { \ argument [all …]
|
/dports/benchmarks/sysbench/sysbench-1.0.20/third_party/concurrency_kit/ck/include/ |
H A D | ck_queue.h | 148 #define CK_SLIST_NEXT(elm, field) \ argument 151 #define CK_SLIST_FOREACH(var, head, field) \ argument 171 #define CK_SLIST_INSERT_AFTER(a, b, field) do { \ argument 183 #define CK_SLIST_REMOVE_AFTER(elm, field) do { \ argument 199 #define CK_SLIST_REMOVE_HEAD(head, field) do { \ argument 204 #define CK_SLIST_MOVE(head1, head2, field) do { \ argument 250 #define CK_STAILQ_FOREACH(var, head, field) \ argument 290 #define CK_STAILQ_NEXT(elm, field) \ argument 362 #define CK_LIST_FOREACH(var, head, field) \ argument 403 #define CK_LIST_REMOVE(elm, field) do { \ argument [all …]
|