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
150
151
152
153
|
/*
* Copyright (c) 2021 SUSE LLC
*
* All Rights Reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of version 2 of the GNU General Public License as published
* by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, contact Novell, Inc.
*
* To contact Novell about this file by physical or electronic mail, you may
* find current contact information at www.novell.com.
*/
#include <locale>
#include <boost/algorithm/string.hpp>
#include <snapper/Exception.h>
#include <snapper/SnapperTmpl.h>
#include "Limit.h"
#include "HumanString.h"
namespace snapper
{
using namespace std;
void
Limit::parse(const string& s)
{
// try plain float
double v;
istringstream a(boost::trim_copy(s, locale::classic()));
classic(a);
a >> v;
if (!a.fail() && a.eof())
{
fraction = v;
type = FRACTION;
return;
}
// try size
try
{
absolute = humanstring_to_byte(s, true);
type = ABSOLUTE;
return;
}
catch (const Exception& e)
{
SN_CAUGHT(e);
}
SN_THROW(Exception("failed to parse limit"));
}
ostream&
operator<<(ostream& str, const Limit& smart_size)
{
switch (smart_size.type)
{
case Limit::FRACTION:
str << smart_size.fraction;
break;
case Limit::ABSOLUTE:
str << byte_to_humanstring(smart_size.absolute, false, 2);
break;
}
return str;
}
bool
MaxUsedLimit::is_enabled() const
{
switch (type)
{
case FRACTION:
return fraction < 1.0;
case ABSOLUTE:
return true;
}
return false;
}
bool
MaxUsedLimit::is_satisfied(unsigned long long size, unsigned long long used) const
{
switch (type)
{
case FRACTION:
return (double)(used) / (double)(size) < fraction;
case ABSOLUTE:
return used < absolute;
}
return false;
}
bool
MinFreeLimit::is_enabled() const
{
switch (type)
{
case FRACTION:
return fraction > 0.0;
case ABSOLUTE:
return absolute > 0;
}
return false;
}
bool
MinFreeLimit::is_satisfied(unsigned long long size, unsigned long long free) const
{
switch (type)
{
case FRACTION:
return (double)(free) / (double)(size) > fraction;
case ABSOLUTE:
return free > absolute;
}
return false;
}
}
|
