Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Openssl
提交
18edda0f
T
Third Party Openssl
项目概览
OpenHarmony
/
Third Party Openssl
大约 1 年 前同步成功
通知
9
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看板
提交
18edda0f
编写于
9月 20, 2000
作者:
U
Ulf Möller
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Malloc() -> OPENSSL_malloc() etc.
上级
89681b18
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
5 addition
and
5 deletion
+5
-5
doc/crypto/BN_bn2bin.pod
doc/crypto/BN_bn2bin.pod
+1
-1
doc/crypto/ERR_get_error.pod
doc/crypto/ERR_get_error.pod
+1
-1
doc/crypto/buffer.pod
doc/crypto/buffer.pod
+2
-2
doc/crypto/lhash.pod
doc/crypto/lhash.pod
+1
-1
未找到文件。
doc/crypto/BN_bn2bin.pod
浏览文件 @
18edda0f
...
@@ -36,7 +36,7 @@ NULL, a new B<BIGNUM> is created.
...
@@ -36,7 +36,7 @@ NULL, a new B<BIGNUM> is created.
BN_bn2hex() and BN_bn2dec() return printable strings containing the
BN_bn2hex() and BN_bn2dec() return printable strings containing the
hexadecimal and decimal encoding of B<a> respectively. For negative
hexadecimal and decimal encoding of B<a> respectively. For negative
numbers, the string is prefaced with a leading '-'. The string must be
numbers, the string is prefaced with a leading '-'. The string must be
Free()d later
.
freed later using OPENSSL_free()
.
BN_hex2bn() converts the string B<str> containing a hexadecimal number
BN_hex2bn() converts the string B<str> containing a hexadecimal number
to a B<BIGNUM> and stores it in **B<bn>. If *B<bn> is NULL, a new
to a B<BIGNUM> and stores it in **B<bn>. If *B<bn> is NULL, a new
...
...
doc/crypto/ERR_get_error.pod
浏览文件 @
18edda0f
...
@@ -41,7 +41,7 @@ the error occurred in *B<file> and *B<line>, unless these are B<NULL>.
...
@@ -41,7 +41,7 @@ the error occurred in *B<file> and *B<line>, unless these are B<NULL>.
ERR_get_error_line_data() and ERR_peek_error_line_data() store
ERR_get_error_line_data() and ERR_peek_error_line_data() store
additional data and flags associated with the error code in *B<data>
additional data and flags associated with the error code in *B<data>
and *B<flags>, unless these are B<NULL>. *B<data> contains a string
and *B<flags>, unless these are B<NULL>. *B<data> contains a string
if *B<flags>&B<ERR_TXT_STRING>. If it has been allocated by
M
alloc(),
if *B<flags>&B<ERR_TXT_STRING>. If it has been allocated by
OPENSSL_m
alloc(),
*B<flags>&B<ERR_TXT_MALLOCED> is true.
*B<flags>&B<ERR_TXT_MALLOCED> is true.
=head1 RETURN VALUES
=head1 RETURN VALUES
...
...
doc/crypto/buffer.pod
浏览文件 @
18edda0f
...
@@ -46,11 +46,11 @@ size.
...
@@ -46,11 +46,11 @@ size.
BUF_strdup() copies a null terminated string into a block of allocated
BUF_strdup() copies a null terminated string into a block of allocated
memory and returns a pointer to the allocated block.
memory and returns a pointer to the allocated block.
Unlike the standard C library strdup() this function uses
M
alloc() and so
Unlike the standard C library strdup() this function uses
OPENSSL_m
alloc() and so
should be used in preference to the standard library strdup() because it can
should be used in preference to the standard library strdup() because it can
be used for memory leak checking or replacing the malloc() function.
be used for memory leak checking or replacing the malloc() function.
The memory allocated from BUF_strdup() should be freed up using the
F
ree()
The memory allocated from BUF_strdup() should be freed up using the
OPENSSL_f
ree()
function.
function.
=head1 RETURN VALUES
=head1 RETURN VALUES
...
...
doc/crypto/lhash.pod
浏览文件 @
18edda0f
...
@@ -102,7 +102,7 @@ The following description is based on the SSLeay documentation:
...
@@ -102,7 +102,7 @@ The following description is based on the SSLeay documentation:
The B<lhash> library implements a hash table described in the
The B<lhash> library implements a hash table described in the
I<Communications of the ACM> in 1991. What makes this hash table
I<Communications of the ACM> in 1991. What makes this hash table
different is that as the table fills, the hash table is increased (or
different is that as the table fills, the hash table is increased (or
decreased) in size via
R
ealloc(). When a 'resize' is done, instead of
decreased) in size via
OPENSSL_r
ealloc(). When a 'resize' is done, instead of
all hashes being redistributed over twice as many 'buckets', one
all hashes being redistributed over twice as many 'buckets', one
bucket is split. So when an 'expand' is done, there is only a minimal
bucket is split. So when an 'expand' is done, there is only a minimal
cost to redistribute some values. Subsequent inserts will cause more
cost to redistribute some values. Subsequent inserts will cause more
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录