blob: 843c8c9c764c0485bd18627d4e6b0fba1d81fb3d (
plain)
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
|
//
// Copyright 2018 Staysail Systems, Inc. <info@staysail.tech>
// Copyright 2018 Capitar IT Group BV <info@capitar.com>
//
// This software is supplied under the terms of the MIT License, a
// copy of which should be located in the distribution where this
// file was obtained (LICENSE.txt). A copy of the license may also be
// found online at https://opensource.org/licenses/MIT.
//
#ifndef CORE_REAP_H
#define CORE_REAP_H
#include "core/defs.h"
#include "core/list.h"
// nni_reap_item is defined here so that it can be inlined into
// structures. Callers must access its members directly.
typedef struct nni_reap_item {
nni_list_node r_link;
void * r_ptr;
nni_cb r_func;
} nni_reap_item;
// nni_reap performs an asynchronous reap of an item. This allows functions
// it calls to acquire locks or resources without worrying about deadlocks
// (such as from a completion callback.) The called function should avoid
// blocking for too long if possible, since only one reap thread is present
// in the system. The intended usage is for an nni_reap_item to be a member
// of the structure to be reaped, and and then this function is called to
// finalize it.
//
// Note that is is possible to re-queue an item to reap on the reap list.
// This is useful if, for example, a reference count indicates that the item
// is busy. These will be queued at the end of the reap list. This will
// allow a dependency to defer reaping until its dependents have first been
// reaped. HOWEVER, it is important that the item in question actually be
// part of a fully reapable graph; otherwise this can lead to an infinite
// loop in the reap thread.
extern void nni_reap(nni_reap_item *, nni_cb, void *);
extern int nni_reap_sys_init(void);
extern void nni_reap_sys_fini(void);
#endif // CORE_REAP_H
|
