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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
// -*- 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-2008 Sage Weil <sage@newdream.net>
*
* 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 CEPH_CRUSH_GRAMMAR_H
#define CEPH_CRUSH_GRAMMAR_H
//#define BOOST_SPIRIT_DEBUG
#ifdef USE_BOOST_SPIRIT_OLD_HDR
#include <boost/spirit/core.hpp>
#include <boost/spirit/tree/ast.hpp>
#include <boost/spirit/tree/tree_to_xml.hpp>
#else
#define BOOST_SPIRIT_USE_OLD_NAMESPACE
#include <boost/spirit/include/classic_core.hpp>
#include <boost/spirit/include/classic_ast.hpp>
#include <boost/spirit/include/classic_tree_to_xml.hpp>
#endif
using namespace boost::spirit;
struct crush_grammar : public grammar<crush_grammar>
{
enum {
_int = 1,
_posint,
_negint,
_name,
_device,
_bucket_type,
_bucket_id,
_bucket_alg,
_bucket_hash,
_bucket_item,
_bucket,
_step_take,
_step_choose,
_step_chooseleaf,
_step_emit,
_step,
_crushrule,
_crushmap,
_tunable,
};
template <typename ScannerT>
struct definition
{
rule<ScannerT, parser_context<>, parser_tag<_int> > integer;
rule<ScannerT, parser_context<>, parser_tag<_posint> > posint;
rule<ScannerT, parser_context<>, parser_tag<_negint> > negint;
rule<ScannerT, parser_context<>, parser_tag<_name> > name;
rule<ScannerT, parser_context<>, parser_tag<_tunable> > tunable;
rule<ScannerT, parser_context<>, parser_tag<_device> > device;
rule<ScannerT, parser_context<>, parser_tag<_bucket_type> > bucket_type;
rule<ScannerT, parser_context<>, parser_tag<_bucket_id> > bucket_id;
rule<ScannerT, parser_context<>, parser_tag<_bucket_alg> > bucket_alg;
rule<ScannerT, parser_context<>, parser_tag<_bucket_hash> > bucket_hash;
rule<ScannerT, parser_context<>, parser_tag<_bucket_item> > bucket_item;
rule<ScannerT, parser_context<>, parser_tag<_bucket> > bucket;
rule<ScannerT, parser_context<>, parser_tag<_step_take> > step_take;
rule<ScannerT, parser_context<>, parser_tag<_step_choose> > step_choose;
rule<ScannerT, parser_context<>, parser_tag<_step_chooseleaf> > step_chooseleaf;
rule<ScannerT, parser_context<>, parser_tag<_step_emit> > step_emit;
rule<ScannerT, parser_context<>, parser_tag<_step> > step;
rule<ScannerT, parser_context<>, parser_tag<_crushrule> > crushrule;
rule<ScannerT, parser_context<>, parser_tag<_crushmap> > crushmap;
definition(crush_grammar const& /*self*/)
{
// base types
integer = leaf_node_d[ lexeme_d[
(!ch_p('-') >> +digit_p)
] ];
posint = leaf_node_d[ lexeme_d[ +digit_p ] ];
negint = leaf_node_d[ lexeme_d[ ch_p('-') >> +digit_p ] ];
name = leaf_node_d[ lexeme_d[ +( alnum_p || ch_p('-') || ch_p('_') || ch_p('.')) ] ];
// tunables
tunable = str_p("tunable") >> name >> posint;
// devices
device = str_p("device") >> posint >> name;
// bucket types
bucket_type = str_p("type") >> posint >> name;
// buckets
bucket_id = str_p("id") >> negint;
bucket_alg = str_p("alg") >> ( str_p("uniform") |
str_p("list") |
str_p("tree") |
str_p("straw") );
bucket_hash = str_p("hash") >> ( integer |
str_p("rjenkins1") );
bucket_item = str_p("item") >> name
>> !( str_p("weight") >> real_p )
>> !( str_p("pos") >> posint );
bucket = name >> name >> '{' >> !bucket_id >> bucket_alg >> *bucket_hash >> *bucket_item >> '}';
// rules
step_take = str_p("take") >> name;
step_choose = str_p("choose")
>> ( str_p("indep") | str_p("firstn") )
>> integer
>> str_p("type") >> name;
step_chooseleaf = str_p("chooseleaf")
>> ( str_p("indep") | str_p("firstn") )
>> integer
>> str_p("type") >> name;
step_emit = str_p("emit");
step = str_p("step") >> ( step_take |
step_choose |
step_chooseleaf |
step_emit );
crushrule = str_p("rule") >> !name >> '{'
>> str_p("ruleset") >> posint
>> str_p("type") >> ( str_p("replicated") | str_p("raid4") )
>> str_p("min_size") >> posint
>> str_p("max_size") >> posint
>> +step
>> '}';
// the whole crush map
crushmap = *(tunable | device | bucket_type) >> *(bucket | crushrule);
}
rule<ScannerT, parser_context<>, parser_tag<_crushmap> > const&
start() const { return crushmap; }
};
};
#endif
|
