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
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/sbefw/core/sbeSecurity.H $ */
/* */
/* OpenPOWER sbe Project */
/* */
/* Contributors Listed Below - COPYRIGHT 2017,2018 */
/* [+] International Business Machines Corp. */
/* */
/* */
/* 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. */
/* */
/* IBM_PROLOG_END_TAG */
#ifndef __SBE_SECURITY_H
#define __SBE_SECURITY_H
#include <stdint.h>
namespace SBE_SECURITY
{
typedef enum
{
READ = 0,
WRITE
} accessType;
// type to define a range
template <typename T>
struct range_t
{
T start;
T end;
};
// key-value map used for the tables
template <typename T, typename U>
struct map_t
{
T key;
U value;
};
// table data structure
template <typename T>
struct table
{
uint32_t size;
uint32_t mask;
T *table;
};
/* @brief isAllowed - Public function used for address verification
* for a given type of access
*
* @param[in] i_addr - given address to verify
* @param[in] i_mask - mask for data
* @param[in] i_type - access type - READ/WRITE
*
* @return - boolean to denote if the access on the address
* is allowed or not
*/
bool isAllowed(const uint32_t i_addr, const uint64_t i_mask,
accessType i_type);
/* @brief _is_present - Look up tables to find if the given
* address is present
* @param[in] table1 - table 1 - map with a range and running count
* @param[in] table2 - table 2 - map with value and running count
* @param[in] table3 - table 3 - array with values
* @param[in] i_addr - given address to look up
*
* @return - boolean to denote if the address in present
* in the list of tables
*/
template <typename M1_T, typename M1_U,
typename M2_T, typename M2_U,
typename T3>
bool _is_present(const table< map_t< range_t<M1_T>, M1_U > > &table1,
const table< map_t<M2_T, M2_U> > &table2,
const table< T3 > &table3,
const uint32_t i_addr);
/* @brief _is_present - Look up tables to find if the given
* address with mask is present
* @param[in] table1 - table 1 - map with a range and running count
* @param[in] i_addr - given address to look up
* @param[in] mask - mask to look up
*
* @return - boolean to denote if the address in present
*/
template <typename T1, typename T2 >
bool _is_present(const table< map_t< T1, T2 > > &table1,
const T1 i_addr,
const T2 i_mask);
}
#endif //__SBE_SECURITY_H
|
