blob: 7863a8f66c306bf8e34b6b3656d2f3b312399cfa (
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
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
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2004-2006 Sage Weil <sage@newdream.net>
* Portions Copyright (C) 2013 CohortFS, LLC
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software
* Foundation. See file COPYING.
*
*/
#ifndef XIO_IN_SEQ_H
#define XIO_IN_SEQ_H
#include <boost/intrusive/list.hpp>
#include "msg/SimplePolicyMessenger.h"
extern "C" {
#include "libxio.h"
}
/* For inbound messages (Accelio-owned) ONLY, use the message's
* user_context as an SLIST */
class XioInSeq {
private:
int cnt;
int sz;
struct xio_msg* head;
struct xio_msg* tail;
public:
XioInSeq() : cnt(0), sz(0), head(NULL), tail(NULL) {}
XioInSeq(const XioInSeq& seq) {
cnt = seq.cnt;
sz = seq.sz;
head = seq.head;
tail = seq.tail;
}
int count() { return cnt; }
int size() { return sz; }
bool p() { return !!head; }
void set_count(int _cnt) { cnt = _cnt; }
void append(struct xio_msg* msg) {
msg->user_context = NULL;
if (!head) {
head = tail = msg;
} else {
tail->user_context = msg;
tail = msg;
}
++sz;
--cnt;
}
struct xio_msg* begin() { return head; }
struct xio_msg* end() { return NULL; }
void next(struct xio_msg** msg) {
*msg = static_cast<struct xio_msg *>((*msg)->user_context);
}
struct xio_msg* dequeue() {
struct xio_msg* msgs = head;
clear();
return msgs;
}
void clear() {
head = tail = NULL;
cnt = 0;
sz = 0;
}
};
#endif /* XIO_IN_SEQ_H */
|
