|
#define | sk_ACCESS_DESCRIPTION_new(comp) |
|
#define | sk_ACCESS_DESCRIPTION_new_null() ((STACK_OF(ACCESS_DESCRIPTION) *)sk_new_null()) |
|
#define | sk_ACCESS_DESCRIPTION_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(ACCESS_DESCRIPTION) *, sk)) |
|
#define | sk_ACCESS_DESCRIPTION_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(ACCESS_DESCRIPTION) *, sk)); |
|
#define | sk_ACCESS_DESCRIPTION_value(sk, i) |
|
#define | sk_ACCESS_DESCRIPTION_set(sk, i, p) |
|
#define | sk_ACCESS_DESCRIPTION_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(ACCESS_DESCRIPTION) *, sk)) |
|
#define | sk_ACCESS_DESCRIPTION_pop_free(sk, free_func) |
|
#define | sk_ACCESS_DESCRIPTION_insert(sk, p, where) |
|
#define | sk_ACCESS_DESCRIPTION_delete(sk, where) |
|
#define | sk_ACCESS_DESCRIPTION_delete_ptr(sk, p) |
|
#define | sk_ACCESS_DESCRIPTION_find(sk, out_index, p) |
|
#define | sk_ACCESS_DESCRIPTION_shift(sk) |
|
#define | sk_ACCESS_DESCRIPTION_push(sk, p) |
|
#define | sk_ACCESS_DESCRIPTION_pop(sk) |
|
#define | sk_ACCESS_DESCRIPTION_dup(sk) |
|
#define | sk_ACCESS_DESCRIPTION_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(ACCESS_DESCRIPTION) *, sk)) |
|
#define | sk_ACCESS_DESCRIPTION_is_sorted(sk) |
|
#define | sk_ACCESS_DESCRIPTION_set_cmp_func(sk, comp) |
|
#define | sk_ACCESS_DESCRIPTION_deep_copy(sk, copy_func, free_func) |
|
#define | sk_ASN1_ADB_TABLE_new(comp) |
|
#define | sk_ASN1_ADB_TABLE_new_null() ((STACK_OF(ASN1_ADB_TABLE) *)sk_new_null()) |
|
#define | sk_ASN1_ADB_TABLE_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(ASN1_ADB_TABLE) *, sk)) |
|
#define | sk_ASN1_ADB_TABLE_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(ASN1_ADB_TABLE) *, sk)); |
|
#define | sk_ASN1_ADB_TABLE_value(sk, i) |
|
#define | sk_ASN1_ADB_TABLE_set(sk, i, p) |
|
#define | sk_ASN1_ADB_TABLE_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(ASN1_ADB_TABLE) *, sk)) |
|
#define | sk_ASN1_ADB_TABLE_pop_free(sk, free_func) |
|
#define | sk_ASN1_ADB_TABLE_insert(sk, p, where) |
|
#define | sk_ASN1_ADB_TABLE_delete(sk, where) |
|
#define | sk_ASN1_ADB_TABLE_delete_ptr(sk, p) |
|
#define | sk_ASN1_ADB_TABLE_find(sk, out_index, p) |
|
#define | sk_ASN1_ADB_TABLE_shift(sk) |
|
#define | sk_ASN1_ADB_TABLE_push(sk, p) |
|
#define | sk_ASN1_ADB_TABLE_pop(sk) |
|
#define | sk_ASN1_ADB_TABLE_dup(sk) |
|
#define | sk_ASN1_ADB_TABLE_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(ASN1_ADB_TABLE) *, sk)) |
|
#define | sk_ASN1_ADB_TABLE_is_sorted(sk) |
|
#define | sk_ASN1_ADB_TABLE_set_cmp_func(sk, comp) |
|
#define | sk_ASN1_ADB_TABLE_deep_copy(sk, copy_func, free_func) |
|
#define | sk_ASN1_GENERALSTRING_new(comp) |
|
#define | sk_ASN1_GENERALSTRING_new_null() ((STACK_OF(ASN1_GENERALSTRING) *)sk_new_null()) |
|
#define | sk_ASN1_GENERALSTRING_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(ASN1_GENERALSTRING) *, sk)) |
|
#define | sk_ASN1_GENERALSTRING_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(ASN1_GENERALSTRING) *, sk)); |
|
#define | sk_ASN1_GENERALSTRING_value(sk, i) |
|
#define | sk_ASN1_GENERALSTRING_set(sk, i, p) |
|
#define | sk_ASN1_GENERALSTRING_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(ASN1_GENERALSTRING) *, sk)) |
|
#define | sk_ASN1_GENERALSTRING_pop_free(sk, free_func) |
|
#define | sk_ASN1_GENERALSTRING_insert(sk, p, where) |
|
#define | sk_ASN1_GENERALSTRING_delete(sk, where) |
|
#define | sk_ASN1_GENERALSTRING_delete_ptr(sk, p) |
|
#define | sk_ASN1_GENERALSTRING_find(sk, out_index, p) |
|
#define | sk_ASN1_GENERALSTRING_shift(sk) |
|
#define | sk_ASN1_GENERALSTRING_push(sk, p) |
|
#define | sk_ASN1_GENERALSTRING_pop(sk) |
|
#define | sk_ASN1_GENERALSTRING_dup(sk) |
|
#define | sk_ASN1_GENERALSTRING_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(ASN1_GENERALSTRING) *, sk)) |
|
#define | sk_ASN1_GENERALSTRING_is_sorted(sk) |
|
#define | sk_ASN1_GENERALSTRING_set_cmp_func(sk, comp) |
|
#define | sk_ASN1_GENERALSTRING_deep_copy(sk, copy_func, free_func) |
|
#define | sk_ASN1_INTEGER_new(comp) |
|
#define | sk_ASN1_INTEGER_new_null() ((STACK_OF(ASN1_INTEGER) *)sk_new_null()) |
|
#define | sk_ASN1_INTEGER_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(ASN1_INTEGER) *, sk)) |
|
#define | sk_ASN1_INTEGER_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(ASN1_INTEGER) *, sk)); |
|
#define | sk_ASN1_INTEGER_value(sk, i) |
|
#define | sk_ASN1_INTEGER_set(sk, i, p) |
|
#define | sk_ASN1_INTEGER_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(ASN1_INTEGER) *, sk)) |
|
#define | sk_ASN1_INTEGER_pop_free(sk, free_func) |
|
#define | sk_ASN1_INTEGER_insert(sk, p, where) |
|
#define | sk_ASN1_INTEGER_delete(sk, where) |
|
#define | sk_ASN1_INTEGER_delete_ptr(sk, p) |
|
#define | sk_ASN1_INTEGER_find(sk, out_index, p) |
|
#define | sk_ASN1_INTEGER_shift(sk) |
|
#define | sk_ASN1_INTEGER_push(sk, p) |
|
#define | sk_ASN1_INTEGER_pop(sk) ((ASN1_INTEGER *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(ASN1_INTEGER) *, sk))) |
|
#define | sk_ASN1_INTEGER_dup(sk) |
|
#define | sk_ASN1_INTEGER_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(ASN1_INTEGER) *, sk)) |
|
#define | sk_ASN1_INTEGER_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(ASN1_INTEGER) *, sk)) |
|
#define | sk_ASN1_INTEGER_set_cmp_func(sk, comp) |
|
#define | sk_ASN1_INTEGER_deep_copy(sk, copy_func, free_func) |
|
#define | sk_ASN1_OBJECT_new(comp) |
|
#define | sk_ASN1_OBJECT_new_null() ((STACK_OF(ASN1_OBJECT) *)sk_new_null()) |
|
#define | sk_ASN1_OBJECT_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(ASN1_OBJECT) *, sk)) |
|
#define | sk_ASN1_OBJECT_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(ASN1_OBJECT) *, sk)); |
|
#define | sk_ASN1_OBJECT_value(sk, i) |
|
#define | sk_ASN1_OBJECT_set(sk, i, p) |
|
#define | sk_ASN1_OBJECT_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(ASN1_OBJECT) *, sk)) |
|
#define | sk_ASN1_OBJECT_pop_free(sk, free_func) |
|
#define | sk_ASN1_OBJECT_insert(sk, p, where) |
|
#define | sk_ASN1_OBJECT_delete(sk, where) |
|
#define | sk_ASN1_OBJECT_delete_ptr(sk, p) |
|
#define | sk_ASN1_OBJECT_find(sk, out_index, p) |
|
#define | sk_ASN1_OBJECT_shift(sk) ((ASN1_OBJECT *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(ASN1_OBJECT) *, sk))) |
|
#define | sk_ASN1_OBJECT_push(sk, p) |
|
#define | sk_ASN1_OBJECT_pop(sk) ((ASN1_OBJECT *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(ASN1_OBJECT) *, sk))) |
|
#define | sk_ASN1_OBJECT_dup(sk) |
|
#define | sk_ASN1_OBJECT_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(ASN1_OBJECT) *, sk)) |
|
#define | sk_ASN1_OBJECT_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(ASN1_OBJECT) *, sk)) |
|
#define | sk_ASN1_OBJECT_set_cmp_func(sk, comp) |
|
#define | sk_ASN1_OBJECT_deep_copy(sk, copy_func, free_func) |
|
#define | sk_ASN1_STRING_TABLE_new(comp) |
|
#define | sk_ASN1_STRING_TABLE_new_null() ((STACK_OF(ASN1_STRING_TABLE) *)sk_new_null()) |
|
#define | sk_ASN1_STRING_TABLE_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(ASN1_STRING_TABLE) *, sk)) |
|
#define | sk_ASN1_STRING_TABLE_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(ASN1_STRING_TABLE) *, sk)); |
|
#define | sk_ASN1_STRING_TABLE_value(sk, i) |
|
#define | sk_ASN1_STRING_TABLE_set(sk, i, p) |
|
#define | sk_ASN1_STRING_TABLE_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(ASN1_STRING_TABLE) *, sk)) |
|
#define | sk_ASN1_STRING_TABLE_pop_free(sk, free_func) |
|
#define | sk_ASN1_STRING_TABLE_insert(sk, p, where) |
|
#define | sk_ASN1_STRING_TABLE_delete(sk, where) |
|
#define | sk_ASN1_STRING_TABLE_delete_ptr(sk, p) |
|
#define | sk_ASN1_STRING_TABLE_find(sk, out_index, p) |
|
#define | sk_ASN1_STRING_TABLE_shift(sk) |
|
#define | sk_ASN1_STRING_TABLE_push(sk, p) |
|
#define | sk_ASN1_STRING_TABLE_pop(sk) |
|
#define | sk_ASN1_STRING_TABLE_dup(sk) |
|
#define | sk_ASN1_STRING_TABLE_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(ASN1_STRING_TABLE) *, sk)) |
|
#define | sk_ASN1_STRING_TABLE_is_sorted(sk) |
|
#define | sk_ASN1_STRING_TABLE_set_cmp_func(sk, comp) |
|
#define | sk_ASN1_STRING_TABLE_deep_copy(sk, copy_func, free_func) |
|
#define | sk_ASN1_TYPE_new(comp) |
|
#define | sk_ASN1_TYPE_new_null() ((STACK_OF(ASN1_TYPE) *)sk_new_null()) |
|
#define | sk_ASN1_TYPE_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(ASN1_TYPE) *, sk)) |
|
#define | sk_ASN1_TYPE_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(ASN1_TYPE) *, sk)); |
|
#define | sk_ASN1_TYPE_value(sk, i) |
|
#define | sk_ASN1_TYPE_set(sk, i, p) |
|
#define | sk_ASN1_TYPE_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(ASN1_TYPE) *, sk)) |
|
#define | sk_ASN1_TYPE_pop_free(sk, free_func) |
|
#define | sk_ASN1_TYPE_insert(sk, p, where) |
|
#define | sk_ASN1_TYPE_delete(sk, where) |
|
#define | sk_ASN1_TYPE_delete_ptr(sk, p) |
|
#define | sk_ASN1_TYPE_find(sk, out_index, p) |
|
#define | sk_ASN1_TYPE_shift(sk) ((ASN1_TYPE *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(ASN1_TYPE) *, sk))) |
|
#define | sk_ASN1_TYPE_push(sk, p) |
|
#define | sk_ASN1_TYPE_pop(sk) ((ASN1_TYPE *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(ASN1_TYPE) *, sk))) |
|
#define | sk_ASN1_TYPE_dup(sk) |
|
#define | sk_ASN1_TYPE_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(ASN1_TYPE) *, sk)) |
|
#define | sk_ASN1_TYPE_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(ASN1_TYPE) *, sk)) |
|
#define | sk_ASN1_TYPE_set_cmp_func(sk, comp) |
|
#define | sk_ASN1_TYPE_deep_copy(sk, copy_func, free_func) |
|
#define | sk_ASN1_VALUE_new(comp) |
|
#define | sk_ASN1_VALUE_new_null() ((STACK_OF(ASN1_VALUE) *)sk_new_null()) |
|
#define | sk_ASN1_VALUE_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(ASN1_VALUE) *, sk)) |
|
#define | sk_ASN1_VALUE_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(ASN1_VALUE) *, sk)); |
|
#define | sk_ASN1_VALUE_value(sk, i) |
|
#define | sk_ASN1_VALUE_set(sk, i, p) |
|
#define | sk_ASN1_VALUE_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(ASN1_VALUE) *, sk)) |
|
#define | sk_ASN1_VALUE_pop_free(sk, free_func) |
|
#define | sk_ASN1_VALUE_insert(sk, p, where) |
|
#define | sk_ASN1_VALUE_delete(sk, where) |
|
#define | sk_ASN1_VALUE_delete_ptr(sk, p) |
|
#define | sk_ASN1_VALUE_find(sk, out_index, p) |
|
#define | sk_ASN1_VALUE_shift(sk) ((ASN1_VALUE *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(ASN1_VALUE) *, sk))) |
|
#define | sk_ASN1_VALUE_push(sk, p) |
|
#define | sk_ASN1_VALUE_pop(sk) ((ASN1_VALUE *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(ASN1_VALUE) *, sk))) |
|
#define | sk_ASN1_VALUE_dup(sk) |
|
#define | sk_ASN1_VALUE_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(ASN1_VALUE) *, sk)) |
|
#define | sk_ASN1_VALUE_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(ASN1_VALUE) *, sk)) |
|
#define | sk_ASN1_VALUE_set_cmp_func(sk, comp) |
|
#define | sk_ASN1_VALUE_deep_copy(sk, copy_func, free_func) |
|
#define | sk_BIO_new(comp) |
|
#define | sk_BIO_new_null() ((STACK_OF(BIO) *)sk_new_null()) |
|
#define | sk_BIO_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(BIO) *, sk)) |
|
#define | sk_BIO_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(BIO) *, sk)); |
|
#define | sk_BIO_value(sk, i) |
|
#define | sk_BIO_set(sk, i, p) |
|
#define | sk_BIO_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(BIO) *, sk)) |
|
#define | sk_BIO_pop_free(sk, free_func) |
|
#define | sk_BIO_insert(sk, p, where) |
|
#define | sk_BIO_delete(sk, where) ((BIO *)sk_delete(CHECKED_CAST(_STACK *, STACK_OF(BIO) *, sk), (where))) |
|
#define | sk_BIO_delete_ptr(sk, p) |
|
#define | sk_BIO_find(sk, out_index, p) |
|
#define | sk_BIO_shift(sk) ((BIO *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(BIO) *, sk))) |
|
#define | sk_BIO_push(sk, p) |
|
#define | sk_BIO_pop(sk) ((BIO *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(BIO) *, sk))) |
|
#define | sk_BIO_dup(sk) |
|
#define | sk_BIO_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(BIO) *, sk)) |
|
#define | sk_BIO_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(BIO) *, sk)) |
|
#define | sk_BIO_set_cmp_func(sk, comp) |
|
#define | sk_BIO_deep_copy(sk, copy_func, free_func) |
|
#define | sk_BY_DIR_ENTRY_new(comp) |
|
#define | sk_BY_DIR_ENTRY_new_null() ((STACK_OF(BY_DIR_ENTRY) *)sk_new_null()) |
|
#define | sk_BY_DIR_ENTRY_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(BY_DIR_ENTRY) *, sk)) |
|
#define | sk_BY_DIR_ENTRY_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(BY_DIR_ENTRY) *, sk)); |
|
#define | sk_BY_DIR_ENTRY_value(sk, i) |
|
#define | sk_BY_DIR_ENTRY_set(sk, i, p) |
|
#define | sk_BY_DIR_ENTRY_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(BY_DIR_ENTRY) *, sk)) |
|
#define | sk_BY_DIR_ENTRY_pop_free(sk, free_func) |
|
#define | sk_BY_DIR_ENTRY_insert(sk, p, where) |
|
#define | sk_BY_DIR_ENTRY_delete(sk, where) |
|
#define | sk_BY_DIR_ENTRY_delete_ptr(sk, p) |
|
#define | sk_BY_DIR_ENTRY_find(sk, out_index, p) |
|
#define | sk_BY_DIR_ENTRY_shift(sk) |
|
#define | sk_BY_DIR_ENTRY_push(sk, p) |
|
#define | sk_BY_DIR_ENTRY_pop(sk) ((BY_DIR_ENTRY *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(BY_DIR_ENTRY) *, sk))) |
|
#define | sk_BY_DIR_ENTRY_dup(sk) |
|
#define | sk_BY_DIR_ENTRY_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(BY_DIR_ENTRY) *, sk)) |
|
#define | sk_BY_DIR_ENTRY_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(BY_DIR_ENTRY) *, sk)) |
|
#define | sk_BY_DIR_ENTRY_set_cmp_func(sk, comp) |
|
#define | sk_BY_DIR_ENTRY_deep_copy(sk, copy_func, free_func) |
|
#define | sk_BY_DIR_HASH_new(comp) |
|
#define | sk_BY_DIR_HASH_new_null() ((STACK_OF(BY_DIR_HASH) *)sk_new_null()) |
|
#define | sk_BY_DIR_HASH_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(BY_DIR_HASH) *, sk)) |
|
#define | sk_BY_DIR_HASH_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(BY_DIR_HASH) *, sk)); |
|
#define | sk_BY_DIR_HASH_value(sk, i) |
|
#define | sk_BY_DIR_HASH_set(sk, i, p) |
|
#define | sk_BY_DIR_HASH_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(BY_DIR_HASH) *, sk)) |
|
#define | sk_BY_DIR_HASH_pop_free(sk, free_func) |
|
#define | sk_BY_DIR_HASH_insert(sk, p, where) |
|
#define | sk_BY_DIR_HASH_delete(sk, where) |
|
#define | sk_BY_DIR_HASH_delete_ptr(sk, p) |
|
#define | sk_BY_DIR_HASH_find(sk, out_index, p) |
|
#define | sk_BY_DIR_HASH_shift(sk) ((BY_DIR_HASH *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(BY_DIR_HASH) *, sk))) |
|
#define | sk_BY_DIR_HASH_push(sk, p) |
|
#define | sk_BY_DIR_HASH_pop(sk) ((BY_DIR_HASH *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(BY_DIR_HASH) *, sk))) |
|
#define | sk_BY_DIR_HASH_dup(sk) |
|
#define | sk_BY_DIR_HASH_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(BY_DIR_HASH) *, sk)) |
|
#define | sk_BY_DIR_HASH_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(BY_DIR_HASH) *, sk)) |
|
#define | sk_BY_DIR_HASH_set_cmp_func(sk, comp) |
|
#define | sk_BY_DIR_HASH_deep_copy(sk, copy_func, free_func) |
|
#define | sk_CONF_VALUE_new(comp) |
|
#define | sk_CONF_VALUE_new_null() ((STACK_OF(CONF_VALUE) *)sk_new_null()) |
|
#define | sk_CONF_VALUE_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(CONF_VALUE) *, sk)) |
|
#define | sk_CONF_VALUE_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(CONF_VALUE) *, sk)); |
|
#define | sk_CONF_VALUE_value(sk, i) |
|
#define | sk_CONF_VALUE_set(sk, i, p) |
|
#define | sk_CONF_VALUE_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(CONF_VALUE) *, sk)) |
|
#define | sk_CONF_VALUE_pop_free(sk, free_func) |
|
#define | sk_CONF_VALUE_insert(sk, p, where) |
|
#define | sk_CONF_VALUE_delete(sk, where) |
|
#define | sk_CONF_VALUE_delete_ptr(sk, p) |
|
#define | sk_CONF_VALUE_find(sk, out_index, p) |
|
#define | sk_CONF_VALUE_shift(sk) ((CONF_VALUE *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(CONF_VALUE) *, sk))) |
|
#define | sk_CONF_VALUE_push(sk, p) |
|
#define | sk_CONF_VALUE_pop(sk) ((CONF_VALUE *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(CONF_VALUE) *, sk))) |
|
#define | sk_CONF_VALUE_dup(sk) |
|
#define | sk_CONF_VALUE_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(CONF_VALUE) *, sk)) |
|
#define | sk_CONF_VALUE_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(CONF_VALUE) *, sk)) |
|
#define | sk_CONF_VALUE_set_cmp_func(sk, comp) |
|
#define | sk_CONF_VALUE_deep_copy(sk, copy_func, free_func) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_new(comp) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_new_null() ((STACK_OF(CRYPTO_EX_DATA_FUNCS) *)sk_new_null()) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_num(sk) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(CRYPTO_EX_DATA_FUNCS) *, sk)); |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_value(sk, i) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_set(sk, i, p) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(CRYPTO_EX_DATA_FUNCS) *, sk)) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_pop_free(sk, free_func) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_insert(sk, p, where) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_delete(sk, where) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_delete_ptr(sk, p) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_find(sk, out_index, p) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_shift(sk) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_push(sk, p) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_pop(sk) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_dup(sk) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(CRYPTO_EX_DATA_FUNCS) *, sk)) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_is_sorted(sk) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_set_cmp_func(sk, comp) |
|
#define | sk_CRYPTO_EX_DATA_FUNCS_deep_copy(sk, copy_func, free_func) |
|
#define | sk_DIST_POINT_new(comp) |
|
#define | sk_DIST_POINT_new_null() ((STACK_OF(DIST_POINT) *)sk_new_null()) |
|
#define | sk_DIST_POINT_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(DIST_POINT) *, sk)) |
|
#define | sk_DIST_POINT_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(DIST_POINT) *, sk)); |
|
#define | sk_DIST_POINT_value(sk, i) |
|
#define | sk_DIST_POINT_set(sk, i, p) |
|
#define | sk_DIST_POINT_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(DIST_POINT) *, sk)) |
|
#define | sk_DIST_POINT_pop_free(sk, free_func) |
|
#define | sk_DIST_POINT_insert(sk, p, where) |
|
#define | sk_DIST_POINT_delete(sk, where) |
|
#define | sk_DIST_POINT_delete_ptr(sk, p) |
|
#define | sk_DIST_POINT_find(sk, out_index, p) |
|
#define | sk_DIST_POINT_shift(sk) ((DIST_POINT *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(DIST_POINT) *, sk))) |
|
#define | sk_DIST_POINT_push(sk, p) |
|
#define | sk_DIST_POINT_pop(sk) ((DIST_POINT *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(DIST_POINT) *, sk))) |
|
#define | sk_DIST_POINT_dup(sk) |
|
#define | sk_DIST_POINT_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(DIST_POINT) *, sk)) |
|
#define | sk_DIST_POINT_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(DIST_POINT) *, sk)) |
|
#define | sk_DIST_POINT_set_cmp_func(sk, comp) |
|
#define | sk_DIST_POINT_deep_copy(sk, copy_func, free_func) |
|
#define | sk_GENERAL_NAME_new(comp) |
|
#define | sk_GENERAL_NAME_new_null() ((STACK_OF(GENERAL_NAME) *)sk_new_null()) |
|
#define | sk_GENERAL_NAME_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(GENERAL_NAME) *, sk)) |
|
#define | sk_GENERAL_NAME_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(GENERAL_NAME) *, sk)); |
|
#define | sk_GENERAL_NAME_value(sk, i) |
|
#define | sk_GENERAL_NAME_set(sk, i, p) |
|
#define | sk_GENERAL_NAME_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(GENERAL_NAME) *, sk)) |
|
#define | sk_GENERAL_NAME_pop_free(sk, free_func) |
|
#define | sk_GENERAL_NAME_insert(sk, p, where) |
|
#define | sk_GENERAL_NAME_delete(sk, where) |
|
#define | sk_GENERAL_NAME_delete_ptr(sk, p) |
|
#define | sk_GENERAL_NAME_find(sk, out_index, p) |
|
#define | sk_GENERAL_NAME_shift(sk) |
|
#define | sk_GENERAL_NAME_push(sk, p) |
|
#define | sk_GENERAL_NAME_pop(sk) ((GENERAL_NAME *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(GENERAL_NAME) *, sk))) |
|
#define | sk_GENERAL_NAME_dup(sk) |
|
#define | sk_GENERAL_NAME_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(GENERAL_NAME) *, sk)) |
|
#define | sk_GENERAL_NAME_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(GENERAL_NAME) *, sk)) |
|
#define | sk_GENERAL_NAME_set_cmp_func(sk, comp) |
|
#define | sk_GENERAL_NAME_deep_copy(sk, copy_func, free_func) |
|
#define | sk_GENERAL_NAMES_new(comp) |
|
#define | sk_GENERAL_NAMES_new_null() ((STACK_OF(GENERAL_NAMES) *)sk_new_null()) |
|
#define | sk_GENERAL_NAMES_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(GENERAL_NAMES) *, sk)) |
|
#define | sk_GENERAL_NAMES_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(GENERAL_NAMES) *, sk)); |
|
#define | sk_GENERAL_NAMES_value(sk, i) |
|
#define | sk_GENERAL_NAMES_set(sk, i, p) |
|
#define | sk_GENERAL_NAMES_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(GENERAL_NAMES) *, sk)) |
|
#define | sk_GENERAL_NAMES_pop_free(sk, free_func) |
|
#define | sk_GENERAL_NAMES_insert(sk, p, where) |
|
#define | sk_GENERAL_NAMES_delete(sk, where) |
|
#define | sk_GENERAL_NAMES_delete_ptr(sk, p) |
|
#define | sk_GENERAL_NAMES_find(sk, out_index, p) |
|
#define | sk_GENERAL_NAMES_shift(sk) |
|
#define | sk_GENERAL_NAMES_push(sk, p) |
|
#define | sk_GENERAL_NAMES_pop(sk) |
|
#define | sk_GENERAL_NAMES_dup(sk) |
|
#define | sk_GENERAL_NAMES_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(GENERAL_NAMES) *, sk)) |
|
#define | sk_GENERAL_NAMES_is_sorted(sk) |
|
#define | sk_GENERAL_NAMES_set_cmp_func(sk, comp) |
|
#define | sk_GENERAL_NAMES_deep_copy(sk, copy_func, free_func) |
|
#define | sk_GENERAL_SUBTREE_new(comp) |
|
#define | sk_GENERAL_SUBTREE_new_null() ((STACK_OF(GENERAL_SUBTREE) *)sk_new_null()) |
|
#define | sk_GENERAL_SUBTREE_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(GENERAL_SUBTREE) *, sk)) |
|
#define | sk_GENERAL_SUBTREE_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(GENERAL_SUBTREE) *, sk)); |
|
#define | sk_GENERAL_SUBTREE_value(sk, i) |
|
#define | sk_GENERAL_SUBTREE_set(sk, i, p) |
|
#define | sk_GENERAL_SUBTREE_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(GENERAL_SUBTREE) *, sk)) |
|
#define | sk_GENERAL_SUBTREE_pop_free(sk, free_func) |
|
#define | sk_GENERAL_SUBTREE_insert(sk, p, where) |
|
#define | sk_GENERAL_SUBTREE_delete(sk, where) |
|
#define | sk_GENERAL_SUBTREE_delete_ptr(sk, p) |
|
#define | sk_GENERAL_SUBTREE_find(sk, out_index, p) |
|
#define | sk_GENERAL_SUBTREE_shift(sk) |
|
#define | sk_GENERAL_SUBTREE_push(sk, p) |
|
#define | sk_GENERAL_SUBTREE_pop(sk) |
|
#define | sk_GENERAL_SUBTREE_dup(sk) |
|
#define | sk_GENERAL_SUBTREE_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(GENERAL_SUBTREE) *, sk)) |
|
#define | sk_GENERAL_SUBTREE_is_sorted(sk) |
|
#define | sk_GENERAL_SUBTREE_set_cmp_func(sk, comp) |
|
#define | sk_GENERAL_SUBTREE_deep_copy(sk, copy_func, free_func) |
|
#define | sk_POLICYINFO_new(comp) |
|
#define | sk_POLICYINFO_new_null() ((STACK_OF(POLICYINFO) *)sk_new_null()) |
|
#define | sk_POLICYINFO_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(POLICYINFO) *, sk)) |
|
#define | sk_POLICYINFO_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(POLICYINFO) *, sk)); |
|
#define | sk_POLICYINFO_value(sk, i) |
|
#define | sk_POLICYINFO_set(sk, i, p) |
|
#define | sk_POLICYINFO_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(POLICYINFO) *, sk)) |
|
#define | sk_POLICYINFO_pop_free(sk, free_func) |
|
#define | sk_POLICYINFO_insert(sk, p, where) |
|
#define | sk_POLICYINFO_delete(sk, where) |
|
#define | sk_POLICYINFO_delete_ptr(sk, p) |
|
#define | sk_POLICYINFO_find(sk, out_index, p) |
|
#define | sk_POLICYINFO_shift(sk) ((POLICYINFO *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(POLICYINFO) *, sk))) |
|
#define | sk_POLICYINFO_push(sk, p) |
|
#define | sk_POLICYINFO_pop(sk) ((POLICYINFO *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(POLICYINFO) *, sk))) |
|
#define | sk_POLICYINFO_dup(sk) |
|
#define | sk_POLICYINFO_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(POLICYINFO) *, sk)) |
|
#define | sk_POLICYINFO_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(POLICYINFO) *, sk)) |
|
#define | sk_POLICYINFO_set_cmp_func(sk, comp) |
|
#define | sk_POLICYINFO_deep_copy(sk, copy_func, free_func) |
|
#define | sk_POLICYQUALINFO_new(comp) |
|
#define | sk_POLICYQUALINFO_new_null() ((STACK_OF(POLICYQUALINFO) *)sk_new_null()) |
|
#define | sk_POLICYQUALINFO_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(POLICYQUALINFO) *, sk)) |
|
#define | sk_POLICYQUALINFO_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(POLICYQUALINFO) *, sk)); |
|
#define | sk_POLICYQUALINFO_value(sk, i) |
|
#define | sk_POLICYQUALINFO_set(sk, i, p) |
|
#define | sk_POLICYQUALINFO_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(POLICYQUALINFO) *, sk)) |
|
#define | sk_POLICYQUALINFO_pop_free(sk, free_func) |
|
#define | sk_POLICYQUALINFO_insert(sk, p, where) |
|
#define | sk_POLICYQUALINFO_delete(sk, where) |
|
#define | sk_POLICYQUALINFO_delete_ptr(sk, p) |
|
#define | sk_POLICYQUALINFO_find(sk, out_index, p) |
|
#define | sk_POLICYQUALINFO_shift(sk) |
|
#define | sk_POLICYQUALINFO_push(sk, p) |
|
#define | sk_POLICYQUALINFO_pop(sk) |
|
#define | sk_POLICYQUALINFO_dup(sk) |
|
#define | sk_POLICYQUALINFO_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(POLICYQUALINFO) *, sk)) |
|
#define | sk_POLICYQUALINFO_is_sorted(sk) |
|
#define | sk_POLICYQUALINFO_set_cmp_func(sk, comp) |
|
#define | sk_POLICYQUALINFO_deep_copy(sk, copy_func, free_func) |
|
#define | sk_POLICY_MAPPING_new(comp) |
|
#define | sk_POLICY_MAPPING_new_null() ((STACK_OF(POLICY_MAPPING) *)sk_new_null()) |
|
#define | sk_POLICY_MAPPING_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(POLICY_MAPPING) *, sk)) |
|
#define | sk_POLICY_MAPPING_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(POLICY_MAPPING) *, sk)); |
|
#define | sk_POLICY_MAPPING_value(sk, i) |
|
#define | sk_POLICY_MAPPING_set(sk, i, p) |
|
#define | sk_POLICY_MAPPING_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(POLICY_MAPPING) *, sk)) |
|
#define | sk_POLICY_MAPPING_pop_free(sk, free_func) |
|
#define | sk_POLICY_MAPPING_insert(sk, p, where) |
|
#define | sk_POLICY_MAPPING_delete(sk, where) |
|
#define | sk_POLICY_MAPPING_delete_ptr(sk, p) |
|
#define | sk_POLICY_MAPPING_find(sk, out_index, p) |
|
#define | sk_POLICY_MAPPING_shift(sk) |
|
#define | sk_POLICY_MAPPING_push(sk, p) |
|
#define | sk_POLICY_MAPPING_pop(sk) |
|
#define | sk_POLICY_MAPPING_dup(sk) |
|
#define | sk_POLICY_MAPPING_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(POLICY_MAPPING) *, sk)) |
|
#define | sk_POLICY_MAPPING_is_sorted(sk) |
|
#define | sk_POLICY_MAPPING_set_cmp_func(sk, comp) |
|
#define | sk_POLICY_MAPPING_deep_copy(sk, copy_func, free_func) |
|
#define | sk_RSA_additional_prime_new(comp) |
|
#define | sk_RSA_additional_prime_new_null() ((STACK_OF(RSA_additional_prime) *)sk_new_null()) |
|
#define | sk_RSA_additional_prime_num(sk) |
|
#define | sk_RSA_additional_prime_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(RSA_additional_prime) *, sk)); |
|
#define | sk_RSA_additional_prime_value(sk, i) |
|
#define | sk_RSA_additional_prime_set(sk, i, p) |
|
#define | sk_RSA_additional_prime_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(RSA_additional_prime) *, sk)) |
|
#define | sk_RSA_additional_prime_pop_free(sk, free_func) |
|
#define | sk_RSA_additional_prime_insert(sk, p, where) |
|
#define | sk_RSA_additional_prime_delete(sk, where) |
|
#define | sk_RSA_additional_prime_delete_ptr(sk, p) |
|
#define | sk_RSA_additional_prime_find(sk, out_index, p) |
|
#define | sk_RSA_additional_prime_shift(sk) |
|
#define | sk_RSA_additional_prime_push(sk, p) |
|
#define | sk_RSA_additional_prime_pop(sk) |
|
#define | sk_RSA_additional_prime_dup(sk) |
|
#define | sk_RSA_additional_prime_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(RSA_additional_prime) *, sk)) |
|
#define | sk_RSA_additional_prime_is_sorted(sk) |
|
#define | sk_RSA_additional_prime_set_cmp_func(sk, comp) |
|
#define | sk_RSA_additional_prime_deep_copy(sk, copy_func, free_func) |
|
#define | sk_SSL_COMP_new(comp) |
|
#define | sk_SSL_COMP_new_null() ((STACK_OF(SSL_COMP) *)sk_new_null()) |
|
#define | sk_SSL_COMP_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(SSL_COMP) *, sk)) |
|
#define | sk_SSL_COMP_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(SSL_COMP) *, sk)); |
|
#define | sk_SSL_COMP_value(sk, i) |
|
#define | sk_SSL_COMP_set(sk, i, p) |
|
#define | sk_SSL_COMP_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(SSL_COMP) *, sk)) |
|
#define | sk_SSL_COMP_pop_free(sk, free_func) |
|
#define | sk_SSL_COMP_insert(sk, p, where) |
|
#define | sk_SSL_COMP_delete(sk, where) |
|
#define | sk_SSL_COMP_delete_ptr(sk, p) |
|
#define | sk_SSL_COMP_find(sk, out_index, p) |
|
#define | sk_SSL_COMP_shift(sk) ((SSL_COMP *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(SSL_COMP) *, sk))) |
|
#define | sk_SSL_COMP_push(sk, p) |
|
#define | sk_SSL_COMP_pop(sk) ((SSL_COMP *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(SSL_COMP) *, sk))) |
|
#define | sk_SSL_COMP_dup(sk) |
|
#define | sk_SSL_COMP_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(SSL_COMP) *, sk)) |
|
#define | sk_SSL_COMP_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(SSL_COMP) *, sk)) |
|
#define | sk_SSL_COMP_set_cmp_func(sk, comp) |
|
#define | sk_SSL_COMP_deep_copy(sk, copy_func, free_func) |
|
#define | sk_SSL_CUSTOM_EXTENSION_new(comp) |
|
#define | sk_SSL_CUSTOM_EXTENSION_new_null() ((STACK_OF(SSL_CUSTOM_EXTENSION) *)sk_new_null()) |
|
#define | sk_SSL_CUSTOM_EXTENSION_num(sk) |
|
#define | sk_SSL_CUSTOM_EXTENSION_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(SSL_CUSTOM_EXTENSION) *, sk)); |
|
#define | sk_SSL_CUSTOM_EXTENSION_value(sk, i) |
|
#define | sk_SSL_CUSTOM_EXTENSION_set(sk, i, p) |
|
#define | sk_SSL_CUSTOM_EXTENSION_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(SSL_CUSTOM_EXTENSION) *, sk)) |
|
#define | sk_SSL_CUSTOM_EXTENSION_pop_free(sk, free_func) |
|
#define | sk_SSL_CUSTOM_EXTENSION_insert(sk, p, where) |
|
#define | sk_SSL_CUSTOM_EXTENSION_delete(sk, where) |
|
#define | sk_SSL_CUSTOM_EXTENSION_delete_ptr(sk, p) |
|
#define | sk_SSL_CUSTOM_EXTENSION_find(sk, out_index, p) |
|
#define | sk_SSL_CUSTOM_EXTENSION_shift(sk) |
|
#define | sk_SSL_CUSTOM_EXTENSION_push(sk, p) |
|
#define | sk_SSL_CUSTOM_EXTENSION_pop(sk) |
|
#define | sk_SSL_CUSTOM_EXTENSION_dup(sk) |
|
#define | sk_SSL_CUSTOM_EXTENSION_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(SSL_CUSTOM_EXTENSION) *, sk)) |
|
#define | sk_SSL_CUSTOM_EXTENSION_is_sorted(sk) |
|
#define | sk_SSL_CUSTOM_EXTENSION_set_cmp_func(sk, comp) |
|
#define | sk_SSL_CUSTOM_EXTENSION_deep_copy(sk, copy_func, free_func) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_new(comp) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_new_null() ((STACK_OF(STACK_OF_X509_NAME_ENTRY) *)sk_new_null()) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_num(sk) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(STACK_OF_X509_NAME_ENTRY) *, sk)); |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_value(sk, i) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_set(sk, i, p) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(STACK_OF_X509_NAME_ENTRY) *, sk)) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_pop_free(sk, free_func) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_insert(sk, p, where) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_delete(sk, where) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_delete_ptr(sk, p) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_find(sk, out_index, p) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_shift(sk) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_push(sk, p) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_pop(sk) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_dup(sk) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(STACK_OF_X509_NAME_ENTRY) *, sk)) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_is_sorted(sk) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_set_cmp_func(sk, comp) |
|
#define | sk_STACK_OF_X509_NAME_ENTRY_deep_copy(sk, copy_func, free_func) |
|
#define | sk_SXNETID_new(comp) |
|
#define | sk_SXNETID_new_null() ((STACK_OF(SXNETID) *)sk_new_null()) |
|
#define | sk_SXNETID_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(SXNETID) *, sk)) |
|
#define | sk_SXNETID_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(SXNETID) *, sk)); |
|
#define | sk_SXNETID_value(sk, i) |
|
#define | sk_SXNETID_set(sk, i, p) |
|
#define | sk_SXNETID_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(SXNETID) *, sk)) |
|
#define | sk_SXNETID_pop_free(sk, free_func) |
|
#define | sk_SXNETID_insert(sk, p, where) |
|
#define | sk_SXNETID_delete(sk, where) |
|
#define | sk_SXNETID_delete_ptr(sk, p) |
|
#define | sk_SXNETID_find(sk, out_index, p) |
|
#define | sk_SXNETID_shift(sk) ((SXNETID *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(SXNETID) *, sk))) |
|
#define | sk_SXNETID_push(sk, p) |
|
#define | sk_SXNETID_pop(sk) ((SXNETID *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(SXNETID) *, sk))) |
|
#define | sk_SXNETID_dup(sk) |
|
#define | sk_SXNETID_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(SXNETID) *, sk)) |
|
#define | sk_SXNETID_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(SXNETID) *, sk)) |
|
#define | sk_SXNETID_set_cmp_func(sk, comp) |
|
#define | sk_SXNETID_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_new(comp) |
|
#define | sk_X509_new_null() ((STACK_OF(X509) *)sk_new_null()) |
|
#define | sk_X509_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509) *, sk)) |
|
#define | sk_X509_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509) *, sk)); |
|
#define | sk_X509_value(sk, i) |
|
#define | sk_X509_set(sk, i, p) |
|
#define | sk_X509_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509) *, sk)) |
|
#define | sk_X509_pop_free(sk, free_func) |
|
#define | sk_X509_insert(sk, p, where) |
|
#define | sk_X509_delete(sk, where) ((X509 *)sk_delete(CHECKED_CAST(_STACK *, STACK_OF(X509) *, sk), (where))) |
|
#define | sk_X509_delete_ptr(sk, p) |
|
#define | sk_X509_find(sk, out_index, p) |
|
#define | sk_X509_shift(sk) ((X509 *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(X509) *, sk))) |
|
#define | sk_X509_push(sk, p) |
|
#define | sk_X509_pop(sk) ((X509 *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(X509) *, sk))) |
|
#define | sk_X509_dup(sk) |
|
#define | sk_X509_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509) *, sk)) |
|
#define | sk_X509_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(X509) *, sk)) |
|
#define | sk_X509_set_cmp_func(sk, comp) |
|
#define | sk_X509_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509V3_EXT_METHOD_new(comp) |
|
#define | sk_X509V3_EXT_METHOD_new_null() ((STACK_OF(X509V3_EXT_METHOD) *)sk_new_null()) |
|
#define | sk_X509V3_EXT_METHOD_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509V3_EXT_METHOD) *, sk)) |
|
#define | sk_X509V3_EXT_METHOD_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509V3_EXT_METHOD) *, sk)); |
|
#define | sk_X509V3_EXT_METHOD_value(sk, i) |
|
#define | sk_X509V3_EXT_METHOD_set(sk, i, p) |
|
#define | sk_X509V3_EXT_METHOD_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509V3_EXT_METHOD) *, sk)) |
|
#define | sk_X509V3_EXT_METHOD_pop_free(sk, free_func) |
|
#define | sk_X509V3_EXT_METHOD_insert(sk, p, where) |
|
#define | sk_X509V3_EXT_METHOD_delete(sk, where) |
|
#define | sk_X509V3_EXT_METHOD_delete_ptr(sk, p) |
|
#define | sk_X509V3_EXT_METHOD_find(sk, out_index, p) |
|
#define | sk_X509V3_EXT_METHOD_shift(sk) |
|
#define | sk_X509V3_EXT_METHOD_push(sk, p) |
|
#define | sk_X509V3_EXT_METHOD_pop(sk) |
|
#define | sk_X509V3_EXT_METHOD_dup(sk) |
|
#define | sk_X509V3_EXT_METHOD_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509V3_EXT_METHOD) *, sk)) |
|
#define | sk_X509V3_EXT_METHOD_is_sorted(sk) |
|
#define | sk_X509V3_EXT_METHOD_set_cmp_func(sk, comp) |
|
#define | sk_X509V3_EXT_METHOD_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_ALGOR_new(comp) |
|
#define | sk_X509_ALGOR_new_null() ((STACK_OF(X509_ALGOR) *)sk_new_null()) |
|
#define | sk_X509_ALGOR_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_ALGOR) *, sk)) |
|
#define | sk_X509_ALGOR_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_ALGOR) *, sk)); |
|
#define | sk_X509_ALGOR_value(sk, i) |
|
#define | sk_X509_ALGOR_set(sk, i, p) |
|
#define | sk_X509_ALGOR_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_ALGOR) *, sk)) |
|
#define | sk_X509_ALGOR_pop_free(sk, free_func) |
|
#define | sk_X509_ALGOR_insert(sk, p, where) |
|
#define | sk_X509_ALGOR_delete(sk, where) |
|
#define | sk_X509_ALGOR_delete_ptr(sk, p) |
|
#define | sk_X509_ALGOR_find(sk, out_index, p) |
|
#define | sk_X509_ALGOR_shift(sk) ((X509_ALGOR *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(X509_ALGOR) *, sk))) |
|
#define | sk_X509_ALGOR_push(sk, p) |
|
#define | sk_X509_ALGOR_pop(sk) ((X509_ALGOR *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(X509_ALGOR) *, sk))) |
|
#define | sk_X509_ALGOR_dup(sk) |
|
#define | sk_X509_ALGOR_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_ALGOR) *, sk)) |
|
#define | sk_X509_ALGOR_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(X509_ALGOR) *, sk)) |
|
#define | sk_X509_ALGOR_set_cmp_func(sk, comp) |
|
#define | sk_X509_ALGOR_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_ATTRIBUTE_new(comp) |
|
#define | sk_X509_ATTRIBUTE_new_null() ((STACK_OF(X509_ATTRIBUTE) *)sk_new_null()) |
|
#define | sk_X509_ATTRIBUTE_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_ATTRIBUTE) *, sk)) |
|
#define | sk_X509_ATTRIBUTE_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_ATTRIBUTE) *, sk)); |
|
#define | sk_X509_ATTRIBUTE_value(sk, i) |
|
#define | sk_X509_ATTRIBUTE_set(sk, i, p) |
|
#define | sk_X509_ATTRIBUTE_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_ATTRIBUTE) *, sk)) |
|
#define | sk_X509_ATTRIBUTE_pop_free(sk, free_func) |
|
#define | sk_X509_ATTRIBUTE_insert(sk, p, where) |
|
#define | sk_X509_ATTRIBUTE_delete(sk, where) |
|
#define | sk_X509_ATTRIBUTE_delete_ptr(sk, p) |
|
#define | sk_X509_ATTRIBUTE_find(sk, out_index, p) |
|
#define | sk_X509_ATTRIBUTE_shift(sk) |
|
#define | sk_X509_ATTRIBUTE_push(sk, p) |
|
#define | sk_X509_ATTRIBUTE_pop(sk) |
|
#define | sk_X509_ATTRIBUTE_dup(sk) |
|
#define | sk_X509_ATTRIBUTE_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_ATTRIBUTE) *, sk)) |
|
#define | sk_X509_ATTRIBUTE_is_sorted(sk) |
|
#define | sk_X509_ATTRIBUTE_set_cmp_func(sk, comp) |
|
#define | sk_X509_ATTRIBUTE_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_CRL_new(comp) |
|
#define | sk_X509_CRL_new_null() ((STACK_OF(X509_CRL) *)sk_new_null()) |
|
#define | sk_X509_CRL_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_CRL) *, sk)) |
|
#define | sk_X509_CRL_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_CRL) *, sk)); |
|
#define | sk_X509_CRL_value(sk, i) |
|
#define | sk_X509_CRL_set(sk, i, p) |
|
#define | sk_X509_CRL_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_CRL) *, sk)) |
|
#define | sk_X509_CRL_pop_free(sk, free_func) |
|
#define | sk_X509_CRL_insert(sk, p, where) |
|
#define | sk_X509_CRL_delete(sk, where) |
|
#define | sk_X509_CRL_delete_ptr(sk, p) |
|
#define | sk_X509_CRL_find(sk, out_index, p) |
|
#define | sk_X509_CRL_shift(sk) ((X509_CRL *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(X509_CRL) *, sk))) |
|
#define | sk_X509_CRL_push(sk, p) |
|
#define | sk_X509_CRL_pop(sk) ((X509_CRL *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(X509_CRL) *, sk))) |
|
#define | sk_X509_CRL_dup(sk) |
|
#define | sk_X509_CRL_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_CRL) *, sk)) |
|
#define | sk_X509_CRL_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(X509_CRL) *, sk)) |
|
#define | sk_X509_CRL_set_cmp_func(sk, comp) |
|
#define | sk_X509_CRL_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_EXTENSION_new(comp) |
|
#define | sk_X509_EXTENSION_new_null() ((STACK_OF(X509_EXTENSION) *)sk_new_null()) |
|
#define | sk_X509_EXTENSION_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_EXTENSION) *, sk)) |
|
#define | sk_X509_EXTENSION_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_EXTENSION) *, sk)); |
|
#define | sk_X509_EXTENSION_value(sk, i) |
|
#define | sk_X509_EXTENSION_set(sk, i, p) |
|
#define | sk_X509_EXTENSION_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_EXTENSION) *, sk)) |
|
#define | sk_X509_EXTENSION_pop_free(sk, free_func) |
|
#define | sk_X509_EXTENSION_insert(sk, p, where) |
|
#define | sk_X509_EXTENSION_delete(sk, where) |
|
#define | sk_X509_EXTENSION_delete_ptr(sk, p) |
|
#define | sk_X509_EXTENSION_find(sk, out_index, p) |
|
#define | sk_X509_EXTENSION_shift(sk) |
|
#define | sk_X509_EXTENSION_push(sk, p) |
|
#define | sk_X509_EXTENSION_pop(sk) |
|
#define | sk_X509_EXTENSION_dup(sk) |
|
#define | sk_X509_EXTENSION_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_EXTENSION) *, sk)) |
|
#define | sk_X509_EXTENSION_is_sorted(sk) |
|
#define | sk_X509_EXTENSION_set_cmp_func(sk, comp) |
|
#define | sk_X509_EXTENSION_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_INFO_new(comp) |
|
#define | sk_X509_INFO_new_null() ((STACK_OF(X509_INFO) *)sk_new_null()) |
|
#define | sk_X509_INFO_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_INFO) *, sk)) |
|
#define | sk_X509_INFO_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_INFO) *, sk)); |
|
#define | sk_X509_INFO_value(sk, i) |
|
#define | sk_X509_INFO_set(sk, i, p) |
|
#define | sk_X509_INFO_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_INFO) *, sk)) |
|
#define | sk_X509_INFO_pop_free(sk, free_func) |
|
#define | sk_X509_INFO_insert(sk, p, where) |
|
#define | sk_X509_INFO_delete(sk, where) |
|
#define | sk_X509_INFO_delete_ptr(sk, p) |
|
#define | sk_X509_INFO_find(sk, out_index, p) |
|
#define | sk_X509_INFO_shift(sk) ((X509_INFO *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(X509_INFO) *, sk))) |
|
#define | sk_X509_INFO_push(sk, p) |
|
#define | sk_X509_INFO_pop(sk) ((X509_INFO *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(X509_INFO) *, sk))) |
|
#define | sk_X509_INFO_dup(sk) |
|
#define | sk_X509_INFO_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_INFO) *, sk)) |
|
#define | sk_X509_INFO_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(X509_INFO) *, sk)) |
|
#define | sk_X509_INFO_set_cmp_func(sk, comp) |
|
#define | sk_X509_INFO_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_LOOKUP_new(comp) |
|
#define | sk_X509_LOOKUP_new_null() ((STACK_OF(X509_LOOKUP) *)sk_new_null()) |
|
#define | sk_X509_LOOKUP_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_LOOKUP) *, sk)) |
|
#define | sk_X509_LOOKUP_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_LOOKUP) *, sk)); |
|
#define | sk_X509_LOOKUP_value(sk, i) |
|
#define | sk_X509_LOOKUP_set(sk, i, p) |
|
#define | sk_X509_LOOKUP_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_LOOKUP) *, sk)) |
|
#define | sk_X509_LOOKUP_pop_free(sk, free_func) |
|
#define | sk_X509_LOOKUP_insert(sk, p, where) |
|
#define | sk_X509_LOOKUP_delete(sk, where) |
|
#define | sk_X509_LOOKUP_delete_ptr(sk, p) |
|
#define | sk_X509_LOOKUP_find(sk, out_index, p) |
|
#define | sk_X509_LOOKUP_shift(sk) ((X509_LOOKUP *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(X509_LOOKUP) *, sk))) |
|
#define | sk_X509_LOOKUP_push(sk, p) |
|
#define | sk_X509_LOOKUP_pop(sk) ((X509_LOOKUP *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(X509_LOOKUP) *, sk))) |
|
#define | sk_X509_LOOKUP_dup(sk) |
|
#define | sk_X509_LOOKUP_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_LOOKUP) *, sk)) |
|
#define | sk_X509_LOOKUP_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(X509_LOOKUP) *, sk)) |
|
#define | sk_X509_LOOKUP_set_cmp_func(sk, comp) |
|
#define | sk_X509_LOOKUP_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_NAME_new(comp) |
|
#define | sk_X509_NAME_new_null() ((STACK_OF(X509_NAME) *)sk_new_null()) |
|
#define | sk_X509_NAME_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_NAME) *, sk)) |
|
#define | sk_X509_NAME_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_NAME) *, sk)); |
|
#define | sk_X509_NAME_value(sk, i) |
|
#define | sk_X509_NAME_set(sk, i, p) |
|
#define | sk_X509_NAME_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_NAME) *, sk)) |
|
#define | sk_X509_NAME_pop_free(sk, free_func) |
|
#define | sk_X509_NAME_insert(sk, p, where) |
|
#define | sk_X509_NAME_delete(sk, where) |
|
#define | sk_X509_NAME_delete_ptr(sk, p) |
|
#define | sk_X509_NAME_find(sk, out_index, p) |
|
#define | sk_X509_NAME_shift(sk) ((X509_NAME *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(X509_NAME) *, sk))) |
|
#define | sk_X509_NAME_push(sk, p) |
|
#define | sk_X509_NAME_pop(sk) ((X509_NAME *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(X509_NAME) *, sk))) |
|
#define | sk_X509_NAME_dup(sk) |
|
#define | sk_X509_NAME_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_NAME) *, sk)) |
|
#define | sk_X509_NAME_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(X509_NAME) *, sk)) |
|
#define | sk_X509_NAME_set_cmp_func(sk, comp) |
|
#define | sk_X509_NAME_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_NAME_ENTRY_new(comp) |
|
#define | sk_X509_NAME_ENTRY_new_null() ((STACK_OF(X509_NAME_ENTRY) *)sk_new_null()) |
|
#define | sk_X509_NAME_ENTRY_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_NAME_ENTRY) *, sk)) |
|
#define | sk_X509_NAME_ENTRY_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_NAME_ENTRY) *, sk)); |
|
#define | sk_X509_NAME_ENTRY_value(sk, i) |
|
#define | sk_X509_NAME_ENTRY_set(sk, i, p) |
|
#define | sk_X509_NAME_ENTRY_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_NAME_ENTRY) *, sk)) |
|
#define | sk_X509_NAME_ENTRY_pop_free(sk, free_func) |
|
#define | sk_X509_NAME_ENTRY_insert(sk, p, where) |
|
#define | sk_X509_NAME_ENTRY_delete(sk, where) |
|
#define | sk_X509_NAME_ENTRY_delete_ptr(sk, p) |
|
#define | sk_X509_NAME_ENTRY_find(sk, out_index, p) |
|
#define | sk_X509_NAME_ENTRY_shift(sk) |
|
#define | sk_X509_NAME_ENTRY_push(sk, p) |
|
#define | sk_X509_NAME_ENTRY_pop(sk) |
|
#define | sk_X509_NAME_ENTRY_dup(sk) |
|
#define | sk_X509_NAME_ENTRY_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_NAME_ENTRY) *, sk)) |
|
#define | sk_X509_NAME_ENTRY_is_sorted(sk) |
|
#define | sk_X509_NAME_ENTRY_set_cmp_func(sk, comp) |
|
#define | sk_X509_NAME_ENTRY_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_OBJECT_new(comp) |
|
#define | sk_X509_OBJECT_new_null() ((STACK_OF(X509_OBJECT) *)sk_new_null()) |
|
#define | sk_X509_OBJECT_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_OBJECT) *, sk)) |
|
#define | sk_X509_OBJECT_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_OBJECT) *, sk)); |
|
#define | sk_X509_OBJECT_value(sk, i) |
|
#define | sk_X509_OBJECT_set(sk, i, p) |
|
#define | sk_X509_OBJECT_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_OBJECT) *, sk)) |
|
#define | sk_X509_OBJECT_pop_free(sk, free_func) |
|
#define | sk_X509_OBJECT_insert(sk, p, where) |
|
#define | sk_X509_OBJECT_delete(sk, where) |
|
#define | sk_X509_OBJECT_delete_ptr(sk, p) |
|
#define | sk_X509_OBJECT_find(sk, out_index, p) |
|
#define | sk_X509_OBJECT_shift(sk) ((X509_OBJECT *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(X509_OBJECT) *, sk))) |
|
#define | sk_X509_OBJECT_push(sk, p) |
|
#define | sk_X509_OBJECT_pop(sk) ((X509_OBJECT *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(X509_OBJECT) *, sk))) |
|
#define | sk_X509_OBJECT_dup(sk) |
|
#define | sk_X509_OBJECT_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_OBJECT) *, sk)) |
|
#define | sk_X509_OBJECT_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(X509_OBJECT) *, sk)) |
|
#define | sk_X509_OBJECT_set_cmp_func(sk, comp) |
|
#define | sk_X509_OBJECT_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_POLICY_DATA_new(comp) |
|
#define | sk_X509_POLICY_DATA_new_null() ((STACK_OF(X509_POLICY_DATA) *)sk_new_null()) |
|
#define | sk_X509_POLICY_DATA_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_POLICY_DATA) *, sk)) |
|
#define | sk_X509_POLICY_DATA_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_POLICY_DATA) *, sk)); |
|
#define | sk_X509_POLICY_DATA_value(sk, i) |
|
#define | sk_X509_POLICY_DATA_set(sk, i, p) |
|
#define | sk_X509_POLICY_DATA_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_POLICY_DATA) *, sk)) |
|
#define | sk_X509_POLICY_DATA_pop_free(sk, free_func) |
|
#define | sk_X509_POLICY_DATA_insert(sk, p, where) |
|
#define | sk_X509_POLICY_DATA_delete(sk, where) |
|
#define | sk_X509_POLICY_DATA_delete_ptr(sk, p) |
|
#define | sk_X509_POLICY_DATA_find(sk, out_index, p) |
|
#define | sk_X509_POLICY_DATA_shift(sk) |
|
#define | sk_X509_POLICY_DATA_push(sk, p) |
|
#define | sk_X509_POLICY_DATA_pop(sk) |
|
#define | sk_X509_POLICY_DATA_dup(sk) |
|
#define | sk_X509_POLICY_DATA_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_POLICY_DATA) *, sk)) |
|
#define | sk_X509_POLICY_DATA_is_sorted(sk) |
|
#define | sk_X509_POLICY_DATA_set_cmp_func(sk, comp) |
|
#define | sk_X509_POLICY_DATA_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_POLICY_NODE_new(comp) |
|
#define | sk_X509_POLICY_NODE_new_null() ((STACK_OF(X509_POLICY_NODE) *)sk_new_null()) |
|
#define | sk_X509_POLICY_NODE_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_POLICY_NODE) *, sk)) |
|
#define | sk_X509_POLICY_NODE_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_POLICY_NODE) *, sk)); |
|
#define | sk_X509_POLICY_NODE_value(sk, i) |
|
#define | sk_X509_POLICY_NODE_set(sk, i, p) |
|
#define | sk_X509_POLICY_NODE_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_POLICY_NODE) *, sk)) |
|
#define | sk_X509_POLICY_NODE_pop_free(sk, free_func) |
|
#define | sk_X509_POLICY_NODE_insert(sk, p, where) |
|
#define | sk_X509_POLICY_NODE_delete(sk, where) |
|
#define | sk_X509_POLICY_NODE_delete_ptr(sk, p) |
|
#define | sk_X509_POLICY_NODE_find(sk, out_index, p) |
|
#define | sk_X509_POLICY_NODE_shift(sk) |
|
#define | sk_X509_POLICY_NODE_push(sk, p) |
|
#define | sk_X509_POLICY_NODE_pop(sk) |
|
#define | sk_X509_POLICY_NODE_dup(sk) |
|
#define | sk_X509_POLICY_NODE_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_POLICY_NODE) *, sk)) |
|
#define | sk_X509_POLICY_NODE_is_sorted(sk) |
|
#define | sk_X509_POLICY_NODE_set_cmp_func(sk, comp) |
|
#define | sk_X509_POLICY_NODE_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_PURPOSE_new(comp) |
|
#define | sk_X509_PURPOSE_new_null() ((STACK_OF(X509_PURPOSE) *)sk_new_null()) |
|
#define | sk_X509_PURPOSE_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_PURPOSE) *, sk)) |
|
#define | sk_X509_PURPOSE_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_PURPOSE) *, sk)); |
|
#define | sk_X509_PURPOSE_value(sk, i) |
|
#define | sk_X509_PURPOSE_set(sk, i, p) |
|
#define | sk_X509_PURPOSE_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_PURPOSE) *, sk)) |
|
#define | sk_X509_PURPOSE_pop_free(sk, free_func) |
|
#define | sk_X509_PURPOSE_insert(sk, p, where) |
|
#define | sk_X509_PURPOSE_delete(sk, where) |
|
#define | sk_X509_PURPOSE_delete_ptr(sk, p) |
|
#define | sk_X509_PURPOSE_find(sk, out_index, p) |
|
#define | sk_X509_PURPOSE_shift(sk) |
|
#define | sk_X509_PURPOSE_push(sk, p) |
|
#define | sk_X509_PURPOSE_pop(sk) ((X509_PURPOSE *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(X509_PURPOSE) *, sk))) |
|
#define | sk_X509_PURPOSE_dup(sk) |
|
#define | sk_X509_PURPOSE_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_PURPOSE) *, sk)) |
|
#define | sk_X509_PURPOSE_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(X509_PURPOSE) *, sk)) |
|
#define | sk_X509_PURPOSE_set_cmp_func(sk, comp) |
|
#define | sk_X509_PURPOSE_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_REVOKED_new(comp) |
|
#define | sk_X509_REVOKED_new_null() ((STACK_OF(X509_REVOKED) *)sk_new_null()) |
|
#define | sk_X509_REVOKED_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_REVOKED) *, sk)) |
|
#define | sk_X509_REVOKED_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_REVOKED) *, sk)); |
|
#define | sk_X509_REVOKED_value(sk, i) |
|
#define | sk_X509_REVOKED_set(sk, i, p) |
|
#define | sk_X509_REVOKED_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_REVOKED) *, sk)) |
|
#define | sk_X509_REVOKED_pop_free(sk, free_func) |
|
#define | sk_X509_REVOKED_insert(sk, p, where) |
|
#define | sk_X509_REVOKED_delete(sk, where) |
|
#define | sk_X509_REVOKED_delete_ptr(sk, p) |
|
#define | sk_X509_REVOKED_find(sk, out_index, p) |
|
#define | sk_X509_REVOKED_shift(sk) |
|
#define | sk_X509_REVOKED_push(sk, p) |
|
#define | sk_X509_REVOKED_pop(sk) ((X509_REVOKED *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(X509_REVOKED) *, sk))) |
|
#define | sk_X509_REVOKED_dup(sk) |
|
#define | sk_X509_REVOKED_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_REVOKED) *, sk)) |
|
#define | sk_X509_REVOKED_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(X509_REVOKED) *, sk)) |
|
#define | sk_X509_REVOKED_set_cmp_func(sk, comp) |
|
#define | sk_X509_REVOKED_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_TRUST_new(comp) |
|
#define | sk_X509_TRUST_new_null() ((STACK_OF(X509_TRUST) *)sk_new_null()) |
|
#define | sk_X509_TRUST_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_TRUST) *, sk)) |
|
#define | sk_X509_TRUST_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_TRUST) *, sk)); |
|
#define | sk_X509_TRUST_value(sk, i) |
|
#define | sk_X509_TRUST_set(sk, i, p) |
|
#define | sk_X509_TRUST_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_TRUST) *, sk)) |
|
#define | sk_X509_TRUST_pop_free(sk, free_func) |
|
#define | sk_X509_TRUST_insert(sk, p, where) |
|
#define | sk_X509_TRUST_delete(sk, where) |
|
#define | sk_X509_TRUST_delete_ptr(sk, p) |
|
#define | sk_X509_TRUST_find(sk, out_index, p) |
|
#define | sk_X509_TRUST_shift(sk) ((X509_TRUST *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(X509_TRUST) *, sk))) |
|
#define | sk_X509_TRUST_push(sk, p) |
|
#define | sk_X509_TRUST_pop(sk) ((X509_TRUST *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(X509_TRUST) *, sk))) |
|
#define | sk_X509_TRUST_dup(sk) |
|
#define | sk_X509_TRUST_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_TRUST) *, sk)) |
|
#define | sk_X509_TRUST_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(X509_TRUST) *, sk)) |
|
#define | sk_X509_TRUST_set_cmp_func(sk, comp) |
|
#define | sk_X509_TRUST_deep_copy(sk, copy_func, free_func) |
|
#define | sk_X509_VERIFY_PARAM_new(comp) |
|
#define | sk_X509_VERIFY_PARAM_new_null() ((STACK_OF(X509_VERIFY_PARAM) *)sk_new_null()) |
|
#define | sk_X509_VERIFY_PARAM_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(X509_VERIFY_PARAM) *, sk)) |
|
#define | sk_X509_VERIFY_PARAM_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(X509_VERIFY_PARAM) *, sk)); |
|
#define | sk_X509_VERIFY_PARAM_value(sk, i) |
|
#define | sk_X509_VERIFY_PARAM_set(sk, i, p) |
|
#define | sk_X509_VERIFY_PARAM_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(X509_VERIFY_PARAM) *, sk)) |
|
#define | sk_X509_VERIFY_PARAM_pop_free(sk, free_func) |
|
#define | sk_X509_VERIFY_PARAM_insert(sk, p, where) |
|
#define | sk_X509_VERIFY_PARAM_delete(sk, where) |
|
#define | sk_X509_VERIFY_PARAM_delete_ptr(sk, p) |
|
#define | sk_X509_VERIFY_PARAM_find(sk, out_index, p) |
|
#define | sk_X509_VERIFY_PARAM_shift(sk) |
|
#define | sk_X509_VERIFY_PARAM_push(sk, p) |
|
#define | sk_X509_VERIFY_PARAM_pop(sk) |
|
#define | sk_X509_VERIFY_PARAM_dup(sk) |
|
#define | sk_X509_VERIFY_PARAM_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(X509_VERIFY_PARAM) *, sk)) |
|
#define | sk_X509_VERIFY_PARAM_is_sorted(sk) |
|
#define | sk_X509_VERIFY_PARAM_set_cmp_func(sk, comp) |
|
#define | sk_X509_VERIFY_PARAM_deep_copy(sk, copy_func, free_func) |
|
#define | sk_void_new(comp) |
|
#define | sk_void_new_null() ((STACK_OF(void) *)sk_new_null()) |
|
#define | sk_void_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(void) *, sk)) |
|
#define | sk_void_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(void) *, sk)); |
|
#define | sk_void_value(sk, i) |
|
#define | sk_void_set(sk, i, p) |
|
#define | sk_void_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(void) *, sk)) |
|
#define | sk_void_pop_free(sk, free_func) |
|
#define | sk_void_insert(sk, p, where) |
|
#define | sk_void_delete(sk, where) ((void *)sk_delete(CHECKED_CAST(_STACK *, STACK_OF(void) *, sk), (where))) |
|
#define | sk_void_delete_ptr(sk, p) |
|
#define | sk_void_find(sk, out_index, p) |
|
#define | sk_void_shift(sk) ((void *)sk_shift(CHECKED_CAST(_STACK *, STACK_OF(void) *, sk))) |
|
#define | sk_void_push(sk, p) |
|
#define | sk_void_pop(sk) ((void *)sk_pop(CHECKED_CAST(_STACK *, STACK_OF(void) *, sk))) |
|
#define | sk_void_dup(sk) |
|
#define | sk_void_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(void) *, sk)) |
|
#define | sk_void_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(void) *, sk)) |
|
#define | sk_void_set_cmp_func(sk, comp) |
|
#define | sk_void_deep_copy(sk, copy_func, free_func) |
|
#define | sk_SRTP_PROTECTION_PROFILE_new(comp) |
|
#define | sk_SRTP_PROTECTION_PROFILE_new_null() ((STACK_OF(SRTP_PROTECTION_PROFILE) *)sk_new_null()) |
|
#define | sk_SRTP_PROTECTION_PROFILE_num(sk) |
|
#define | sk_SRTP_PROTECTION_PROFILE_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(SRTP_PROTECTION_PROFILE) *, sk)); |
|
#define | sk_SRTP_PROTECTION_PROFILE_value(sk, i) |
|
#define | sk_SRTP_PROTECTION_PROFILE_set(sk, i, p) |
|
#define | sk_SRTP_PROTECTION_PROFILE_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(SRTP_PROTECTION_PROFILE) *, sk)) |
|
#define | sk_SRTP_PROTECTION_PROFILE_pop_free(sk, free_func) |
|
#define | sk_SRTP_PROTECTION_PROFILE_insert(sk, p, where) |
|
#define | sk_SRTP_PROTECTION_PROFILE_delete(sk, where) |
|
#define | sk_SRTP_PROTECTION_PROFILE_delete_ptr(sk, p) |
|
#define | sk_SRTP_PROTECTION_PROFILE_find(sk, out_index, p) |
|
#define | sk_SRTP_PROTECTION_PROFILE_shift(sk) |
|
#define | sk_SRTP_PROTECTION_PROFILE_push(sk, p) |
|
#define | sk_SRTP_PROTECTION_PROFILE_pop(sk) |
|
#define | sk_SRTP_PROTECTION_PROFILE_dup(sk) |
|
#define | sk_SRTP_PROTECTION_PROFILE_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(SRTP_PROTECTION_PROFILE) *, sk)) |
|
#define | sk_SRTP_PROTECTION_PROFILE_is_sorted(sk) |
|
#define | sk_SRTP_PROTECTION_PROFILE_set_cmp_func(sk, comp) |
|
#define | sk_SRTP_PROTECTION_PROFILE_deep_copy(sk, copy_func, free_func) |
|
#define | sk_SSL_CIPHER_new(comp) |
|
#define | sk_SSL_CIPHER_new_null() ((STACK_OF(SSL_CIPHER) *)sk_new_null()) |
|
#define | sk_SSL_CIPHER_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(SSL_CIPHER) *, sk)) |
|
#define | sk_SSL_CIPHER_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(SSL_CIPHER) *, sk)); |
|
#define | sk_SSL_CIPHER_value(sk, i) |
|
#define | sk_SSL_CIPHER_set(sk, i, p) |
|
#define | sk_SSL_CIPHER_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(SSL_CIPHER) *, sk)) |
|
#define | sk_SSL_CIPHER_pop_free(sk, free_func) |
|
#define | sk_SSL_CIPHER_insert(sk, p, where) |
|
#define | sk_SSL_CIPHER_delete(sk, where) |
|
#define | sk_SSL_CIPHER_delete_ptr(sk, p) |
|
#define | sk_SSL_CIPHER_find(sk, out_index, p) |
|
#define | sk_SSL_CIPHER_shift(sk) |
|
#define | sk_SSL_CIPHER_push(sk, p) |
|
#define | sk_SSL_CIPHER_pop(sk) |
|
#define | sk_SSL_CIPHER_dup(sk) |
|
#define | sk_SSL_CIPHER_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(SSL_CIPHER) *, sk)) |
|
#define | sk_SSL_CIPHER_is_sorted(sk) sk_is_sorted(CHECKED_CAST(const _STACK *, const STACK_OF(SSL_CIPHER) *, sk)) |
|
#define | sk_SSL_CIPHER_set_cmp_func(sk, comp) |
|
#define | sk_SSL_CIPHER_deep_copy(sk, copy_func, free_func) |
|
#define | sk_OPENSSL_STRING_new(comp) |
|
#define | sk_OPENSSL_STRING_new_null() ((STACK_OF(OPENSSL_STRING) *)sk_new_null()) |
|
#define | sk_OPENSSL_STRING_num(sk) sk_num(CHECKED_CAST(const _STACK *, const STACK_OF(OPENSSL_STRING) *, sk)) |
|
#define | sk_OPENSSL_STRING_zero(sk) sk_zero(CHECKED_CAST(_STACK *, STACK_OF(OPENSSL_STRING) *, sk)); |
|
#define | sk_OPENSSL_STRING_value(sk, i) |
|
#define | sk_OPENSSL_STRING_set(sk, i, p) |
|
#define | sk_OPENSSL_STRING_free(sk) sk_free(CHECKED_CAST(_STACK *, STACK_OF(OPENSSL_STRING) *, sk)) |
|
#define | sk_OPENSSL_STRING_pop_free(sk, free_func) |
|
#define | sk_OPENSSL_STRING_insert(sk, p, where) |
|
#define | sk_OPENSSL_STRING_delete(sk, where) |
|
#define | sk_OPENSSL_STRING_delete_ptr(sk, p) |
|
#define | sk_OPENSSL_STRING_find(sk, out_index, p) |
|
#define | sk_OPENSSL_STRING_shift(sk) |
|
#define | sk_OPENSSL_STRING_push(sk, p) |
|
#define | sk_OPENSSL_STRING_pop(sk) |
|
#define | sk_OPENSSL_STRING_dup(sk) |
|
#define | sk_OPENSSL_STRING_sort(sk) sk_sort(CHECKED_CAST(_STACK *, STACK_OF(OPENSSL_STRING) *, sk)) |
|
#define | sk_OPENSSL_STRING_is_sorted(sk) |
|
#define | sk_OPENSSL_STRING_set_cmp_func(sk, comp) |
|
#define | sk_OPENSSL_STRING_deep_copy(sk, copy_func, free_func) |
|