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
|
/*
* Copyright (C) 2013 Red Hat Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above
* copyright notice, this list of conditions and the
* following disclaimer.
* * Redistributions in binary form must reproduce the
* above copyright notice, this list of conditions and
* the following disclaimer in the documentation and/or
* other materials provided with the distribution.
* * The names of contributors to this software may not be
* used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
* THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
* DAMAGE.
*
* Author: Stef Walter <stefw@redhat.com>
*/
#ifndef P11_INDEX_H_
#define P11_INDEX_H_
#include "array.h"
#include "compat.h"
#include "pkcs11.h"
#include "types.h"
typedef struct _p11_index p11_index;
typedef CK_RV (* p11_index_build_cb) (void *data,
p11_index *index,
CK_ATTRIBUTE *attrs,
CK_ATTRIBUTE *merge,
CK_ATTRIBUTE **populate);
typedef CK_RV (* p11_index_store_cb) (void *data,
p11_index *index,
CK_OBJECT_HANDLE handle,
CK_ATTRIBUTE **attrs);
typedef CK_RV (* p11_index_remove_cb) (void *data,
p11_index *index,
CK_ATTRIBUTE *attrs);
typedef void (* p11_index_notify_cb) (void *data,
p11_index *index,
CK_OBJECT_HANDLE handle,
CK_ATTRIBUTE *attrs);
p11_index * p11_index_new (p11_index_build_cb build,
p11_index_store_cb store,
p11_index_remove_cb remove,
p11_index_notify_cb notify,
void *data);
void p11_index_free (p11_index *index);
int p11_index_size (p11_index *index);
void p11_index_load (p11_index *index);
void p11_index_finish (p11_index *index);
bool p11_index_loading (p11_index *index);
CK_RV p11_index_take (p11_index *index,
CK_ATTRIBUTE *attrs,
CK_OBJECT_HANDLE *handle);
CK_RV p11_index_add (p11_index *index,
CK_ATTRIBUTE *attrs,
CK_ULONG count,
CK_OBJECT_HANDLE *handle);
CK_RV p11_index_set (p11_index *index,
CK_OBJECT_HANDLE handle,
CK_ATTRIBUTE *attrs,
CK_ULONG count);
CK_RV p11_index_update (p11_index *index,
CK_OBJECT_HANDLE handle,
CK_ATTRIBUTE *attrs);
CK_RV p11_index_replace (p11_index *index,
CK_OBJECT_HANDLE handle,
CK_ATTRIBUTE *replace);
CK_RV p11_index_replace_all (p11_index *index,
CK_ATTRIBUTE *match,
CK_ATTRIBUTE_TYPE key,
p11_array *replace);
CK_RV p11_index_remove (p11_index *index,
CK_OBJECT_HANDLE handle);
CK_ATTRIBUTE * p11_index_lookup (p11_index *index,
CK_OBJECT_HANDLE handle);
CK_OBJECT_HANDLE p11_index_find (p11_index *index,
CK_ATTRIBUTE *match,
int count);
CK_OBJECT_HANDLE * p11_index_find_all (p11_index *index,
CK_ATTRIBUTE *match,
int count);
CK_OBJECT_HANDLE * p11_index_snapshot (p11_index *index,
p11_index *base,
CK_ATTRIBUTE *attrs,
CK_ULONG count);
#endif /* P11_INDEX_H_ */
|
