This repository has been archived by the owner on Jan 26, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathdnf_convertor.cc
70 lines (64 loc) · 2.29 KB
/
dnf_convertor.cc
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
// Copyright 2015-2018 RWTH Aachen University
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "dnf_convertor.hh"
void DNFConvertor::doConvert(){
uint64_t nextRelationCounter = 0;
StackOperation stackOp;
while(! m_rpn.empty()){
stackOp = m_rpn.top();
m_rpn.pop();
if (stackOp.type == PolicyStackOperationType::AND){
DNFConverterNode latestSet;
DNFConverterNode secondLatestSet;
DNFConverterNode newSet;
set<uint64_t> Set;
uint64_t i,j;
latestSet = m_dnfConvertorStack.top();
m_dnfConvertorStack.pop();
secondLatestSet = m_dnfConvertorStack.top();
m_dnfConvertorStack.pop();
for (i = 0; i < latestSet.size(); ++i)
for (j = 0; j < secondLatestSet.size(); ++j){
Set = latestSet[i];
Set.insert(std::begin(secondLatestSet[j]), std::end(secondLatestSet[j]));
newSet.push_back(Set);
}
m_dnfConvertorStack.push(newSet);
}
else if (stackOp.type == PolicyStackOperationType::OR){
DNFConverterNode latestSet;
DNFConverterNode secondLatestSet;
latestSet = m_dnfConvertorStack.top();
m_dnfConvertorStack.pop();
secondLatestSet = m_dnfConvertorStack.top();
m_dnfConvertorStack.pop();
latestSet.insert(std::end(latestSet), std::begin(secondLatestSet), std::end(secondLatestSet));
m_dnfConvertorStack.push(latestSet);
}
else if (stackOp.type == PolicyStackOperationType::NEXT_RELATION){
DNFConverterNode converterNode;
set<uint64_t> relationSet;
relationSet.insert(nextRelationCounter++);
converterNode.push_back(relationSet);
m_dnfConvertorStack.push(converterNode);
}
else if (stackOp.type == PolicyStackOperationType::SPECIFIC_RELATION){
DNFConverterNode converterNode;
set<uint64_t> relationSet;
relationSet.insert(stackOp.relationId);
converterNode.push_back(relationSet);
m_dnfConvertorStack.push(converterNode);
}
}
}