Openssl-stack 阅读笔记

最新推荐文章于 2024-04-22 15:30:46 发布
lovzm
最新推荐文章于 2024-04-22 15:30:46 发布
阅读量375
点赞数
分类专栏： openssl 文章标签： openssl stack 二分查找快速排序
本文链接：https://blog.csdn.net/lsyyff23/article/details/79616414
版权
openssl 专栏收录该内容
6 篇文章 0 订阅
订阅专栏
openssl stack
stack 各函数

# define sk_TEST_EXAM_new(cmp) SKM_sk_new(TEST_EXAM, (cmp))
# define sk_TEST_EXAM_new_null() SKM_sk_new_null(TEST_EXAM)
# define sk_TEST_EXAM_free(st) SKM_sk_free(TEST_EXAM, (st))
# define sk_TEST_EXAM_num(st) SKM_sk_num(TEST_EXAM, (st))
# define sk_TEST_EXAM_value(st, i) SKM_sk_value(TEST_EXAM, (st), (i))
# define sk_TEST_EXAM_set(st, i, val) SKM_sk_set(TEST_EXAM, (st), (i), (val))
# define sk_TEST_EXAM_zero(st) SKM_sk_zero(TEST_EXAM, (st))
# define sk_TEST_EXAM_push(st, val) SKM_sk_push(TEST_EXAM, (st), (val))
# define sk_TEST_EXAM_unshift(st, val) SKM_sk_unshift(TEST_EXAM, (st), (val))
# define sk_TEST_EXAM_find(st, val) SKM_sk_find(TEST_EXAM, (st), (val))
# define sk_TEST_EXAM_find_ex(st, val) SKM_sk_find_ex(TEST_EXAM, (st), (val))
# define sk_TEST_EXAM_delete(st, i) SKM_sk_delete(TEST_EXAM, (st), (i))
# define sk_TEST_EXAM_delete_ptr(st, ptr) SKM_sk_delete_ptr(TEST_EXAM, (st), (ptr))
# define sk_TEST_EXAM_insert(st, val, i) SKM_sk_insert(TEST_EXAM, (st), (val), (i))
# define sk_TEST_EXAM_set_cmp_func(st, cmp) SKM_sk_set_cmp_func(TEST_EXAM, (st), (cmp))
# define sk_TEST_EXAM_dup(st) SKM_sk_dup(TEST_EXAM, st)
# define sk_TEST_EXAM_pop_free(st, free_func) SKM_sk_pop_free(TEST_EXAM, (st), (free_func))
# define sk_TEST_EXAM_deep_copy(st, copy_func, free_func) SKM_sk_deep_copy(TEST_EXAM, (st), (copy_func), (free_func))
# define sk_TEST_EXAM_shift(st) SKM_sk_shift(TEST_EXAM, (st))
# define sk_TEST_EXAM_pop(st) SKM_sk_pop(TEST_EXAM, (st))
# define sk_TEST_EXAM_sort(st) SKM_sk_sort(TEST_EXAM, (st))
# define sk_TEST_EXAM_is_sorted(st) SKM_sk_is_sorted(TEST_EXAM, (st))

typedef struct {
  int idx;
  char name[12];
}TEST_EXAM;
使用前需先定义宏， 提供sk_TEST_EXAM_xxx 接口对STACK_OF(TEST_EXAM)进行管理，


typedef struct stack_st {
    int num;
    char **data;
    int sorted;
    int num_alloc;
    int (*comp) (const void *, const void *);
} _STACK;     

1  
int sk_num(const _STACK *)
{
    if (st == NULL)
        return -1;
    return st->num;
}
返回当前stack内部成员个数；

2 
void *sk_value(const _STACK *st, int i)
{
    if (!st || (i < 0) || (i >= st->num))
        return NULL;
    return st->data[i];
}
返回stack的下标为i的成员（0为第1个）

3
void *sk_set(_STACK *st, int i, void *value)
{
    if (!st || (i < 0) || (i >= st->num))
        return NULL;
    return (st->data[i] = value);
}
设置下标i的成员值；

4
_STACK *sk_new(int (*cmp) (const void *, const void *));
调用openssl_malloc申请空间，
初始化_STACK， 设置栈最小成员个数为MIN_NODES(4)个，
设置比较函数为cmp;

_STACK *sk_new_null(void);
初始化_STACK， 设置栈最小成员个数为MIN_NODES(4)个，
不设置比较函数;

5
void sk_free(_STACK *);
调用openssl_free释放_STACK

void sk_pop_free(_STACK *st, void (*func) (void *));
{
  ...
  if (st->data[i] != NULL)
            func(st->data[i]);
  ...
}
释放_STACK并且调用func来使用data[]成员；

6
_STACK *sk_deep_copy(_STACK *, void *(*)(void *), void (*)(void *));
{
  _STACK *ret;
  ...
        if ((ret->data[i] = copy_func(sk->data[i])) == NULL) {
            while (--i >= 0)
                if (ret->data[i] != NULL)
                    free_func(ret->data[i]);
            sk_free(ret);
            return NULL;
        }
  ...
}
深层拷贝


7
int sk_insert(_STACK *sk, void *data, int loc)
{
      if ((loc >= (int)st->num) || (loc < 0))
        st->data[st->num] = data;
      else {
        for (i = st->num; i >= loc; i--)
              t[i] = f[i];

  #ifdef undef                    /* no memmove on sunos :-( */
          memmove(&(st->data[loc + 1]),
                  &(st->data[loc]), sizeof(char *) * (st->num - loc));
  #endif
          st->data[loc] = data;
      }
}
在_STACK 的loc位置插入data

8
void *sk_delete(_STACK *st, int loc)
{
    char *ret;
    ret = st->data[loc];
    ...
    for (i = loc; i < j; i++)
            st->data[i] = st->data[i + 1];
    ...
}
返回loc的数据

void *sk_delete_ptr(_STACK *st, void *p)
{
    for (i = 0; i < st->num; i++)
        if (st->data[i] == p)
            return (sk_delete(st, i));
}
删除指针值为p的数据；

9
static int internal_find(_STACK *st, void *data, int ret_val_options)
{
    const void *const *r;
    int i;

    if (st == NULL)
        return -1;

    if (st->comp == NULL) {
        for (i = 0; i < st->num; i++)
            if (st->data[i] == data)
                return (i);
        return (-1);
    }
    sk_sort(st);
    if (data == NULL)
        return (-1);
    r = OBJ_bsearch_ex_(&data, st->data, st->num, sizeof(void *), st->comp,
                        ret_val_options);
    if (r == NULL)
        return (-1);
    return (int)((char **)r - st->data);
}
无comp函数时，比较指针地址；
有则二分搜索查找；

比较函数是int (*c) (const void *a, const void *b) 由sk_new() 设置
或者int (*sk_set_cmp_func(_STACK *sk, int (*c) (const void *, const void *))) 设置；
==0 返回相等

int sk_find(_STACK *st, void *data)
{
    return internal_find(st, data, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH);
}
查找第一个满足条件的下标
int sk_find_ex(_STACK *st, void *data);
{
    return internal_find(st, data, OBJ_BSEARCH_VALUE_ON_NOMATCH);
}
查找不满足条件的

10
int sk_push(_STACK *st, void *data)
{
    return (sk_insert(st, data, st->num));
}
插入尾部

int sk_unshift(_STACK *st, void *data)
{
    return (sk_insert(st, data, 0));
}
插入头部

11
void *sk_shift(_STACK *st)
{
    if (st == NULL)
        return (NULL);
    if (st->num <= 0)
        return (NULL);
    return (sk_delete(st, 0));
}
删除头部

void *sk_pop(_STACK *st)
{
    if (st == NULL)
        return (NULL);
    if (st->num <= 0)
        return (NULL);
    return (sk_delete(st, st->num - 1));
}
删除尾部；

12
void sk_zero(_STACK *st)
{
    if (st == NULL)
        return;
    if (st->num <= 0)
        return;
    memset((char *)st->data, 0, sizeof(*st->data) * st->num);
    st->num = 0;
}
置0，不安全，未释放已有数据；


13
int (*sk_set_cmp_func(_STACK *sk, int (*c) (const void *, const void *)))
 (const void *, const void *){
    int (*old) (const void *, const void *) = sk->comp;

    if (sk->comp != c)
        sk->sorted = 0;
    sk->comp = c;

    return old;
}
设置比较函数

14
_STACK *sk_dup(_STACK *st)
{
    ret->data = s;

    ret->num = sk->num;
    memcpy(ret->data, sk->data, sizeof(char *) * sk->num);
    ret->sorted = sk->sorted;
    ret->num_alloc = sk->num_alloc;
    ret->comp = sk->comp;
    return (ret);
}
浅复制，共享了data指向的内存空间；

15
void sk_sort(_STACK *st)
{
    ...
    qsort(st->data, st->num, sizeof(char *), comp_func);
    ...
}
快速排序

16
int sk_is_sorted(const _STACK *st)
{
    if (!st)
        return 1;
    return st->sorted;
}
返回是否排序