Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Openssl
提交
42b2b6a2
T
Third Party Openssl
项目概览
OpenHarmony
/
Third Party Openssl
接近 2 年 前同步成功
通知
12
Star
18
Fork
1
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
T
Third Party Openssl
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
42b2b6a2
编写于
5月 01, 2003
作者:
R
Richard Levitte
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Provide some extra comments about the STORE_Memory STORE method.
上级
d1465bac
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
25 addition
and
2 deletion
+25
-2
crypto/store/str_mem.c
crypto/store/str_mem.c
+25
-2
未找到文件。
crypto/store/str_mem.c
浏览文件 @
42b2b6a2
...
...
@@ -60,6 +60,22 @@
#include <openssl/err.h>
#include "str_locl.h"
/* The memory store is currently highly experimental. It's meant to become
a base store used by other stores for internal caching (for full caching
support, aging needs to be added).
The database use is meant to support as much attribute association as
possible, while providing for as small search ranges as possible.
This is currently provided for by sorting the entries by numbers that
are composed of bits set at the positions indicated by attribute type
codes. This provides for ranges determined by the highest attribute
type code value. A better idea might be to sort by values computed
from the range of attributes associated with the object (basically,
the difference between the highest and lowest attribute type code)
and it's distance from a base (basically, the lowest associated
attribute type code).
*/
struct
mem_object_data_st
{
STORE_OBJECT
*
object
;
...
...
@@ -70,8 +86,7 @@ struct mem_object_data_st
struct
mem_data_st
{
STACK
*
data
;
/* A stack of mem_object_data_st,
potentially sorted with a wrapper
around STORE_ATTR_INFO_cmp(). */
sorted with STORE_ATTR_INFO_compare(). */
unsigned
int
compute_components
:
1
;
/* Currently unused, but can
be used to add attributes
from parts of the data. */
...
...
@@ -184,6 +199,14 @@ static int mem_delete(STORE *s, STORE_OBJECT_TYPES type,
STOREerr
(
STORE_F_MEM_DELETE
,
STORE_R_NOT_IMPLEMENTED
);
return
0
;
}
/* The list functions may be the hardest to nuderstand. Basically,
mem_list_start compiles a stack of attribute info elements, and
puts that stack into the context to be returned. mem_list_next
will then find the first matching element in the store, and then
walk all the way to the end of the store (since any combination
of attribute bits above the starting point may match the searched
for bit pattern...). */
static
void
*
mem_list_start
(
STORE
*
s
,
STORE_OBJECT_TYPES
type
,
OPENSSL_ITEM
attributes
[])
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录