Searched refs:hio (Results 1 - 2 of 2) sorted by relevance

/freebsd-9.3-release/sbin/hastd/
H A Dsecondary.c67 struct hio { struct
75 TAILQ_ENTRY(hio) hio_next;
84 static TAILQ_HEAD(, hio) hio_free_list;
91 static TAILQ_HEAD(, hio) hio_disk_list;
98 static TAILQ_HEAD(, hio) hio_send_list;
112 #define QUEUE_INSERT(name, hio) do { \
116 TAILQ_INSERT_TAIL(&hio_##name##_list, (hio), hio_next); \
120 #define QUEUE_TAKE(name, hio) do { \
122 while (((hio) = TAILQ_FIRST(&hio_##name##_list)) == NULL) { \
128 TAILQ_REMOVE(&hio_##name##_list, (hio), hio_nex
142 hio_clear(struct hio *hio) argument
171 struct hio *hio; local
512 reqlog(int loglevel, int debuglevel, int error, struct hio *hio, const char *fmt, ...) argument
555 requnpack(struct hast_resource *res, struct hio *hio, struct nv *nv) argument
656 struct hio *hio, *mshio; local
749 struct hio *hio; local
864 struct hio *hio; local
[all...]
H A Dprimary.c74 struct hio { struct
110 TAILQ_ENTRY(hio) *hio_next;
119 static TAILQ_HEAD(, hio) hio_free_list;
128 static TAILQ_HEAD(, hio) *hio_send_list;
138 static TAILQ_HEAD(, hio) *hio_recv_list;
147 static TAILQ_HEAD(, hio) hio_done_list;
182 #define QUEUE_INSERT1(hio, name, ncomp) do { \
186 TAILQ_INSERT_TAIL(&hio_##name##_list[(ncomp)], (hio), \
191 #define QUEUE_INSERT2(hio, name) do { \
195 TAILQ_INSERT_TAIL(&hio_##name##_list, (hio), hio
380 struct hio *hio; local
1180 write_complete(struct hast_resource *res, struct hio *hio) argument
1228 struct hio *hio; local
1388 struct hio *hio; local
1550 struct hio *hio; local
1706 struct hio *hio; local
1868 struct hio *hio; local
1959 struct hio *hio; local
[all...]

Completed in 31 milliseconds