Lines Matching refs:I
73 In the description here, B<I<TYPE>> is used
76 The STACK_OF() macro returns the name for a stack of the specified B<I<TYPE>>.
84 DEFINE_STACK_OF() creates set of functions for a stack of B<I<TYPE>> elements.
86 B<STACK_OF>(B<I<TYPE>>) and each function name begins with B<sk_I<TYPE>_>.
103 B<sk_I<TYPE>_num>() returns the number of elements in I<sk> or -1 if I<sk> is
106 B<sk_I<TYPE>_value>() returns element I<idx> in I<sk>, where I<idx> starts at
107 zero. If I<idx> is out of range then NULL is returned.
110 I<compare>. If I<compare> is NULL then no comparison function is used. This
111 function is equivalent to B<sk_I<TYPE>_new_reserve>(I<compare>, 0).
116 B<sk_I<TYPE>_reserve>() allocates additional memory in the I<sk> structure
117 such that the next I<n> calls to B<sk_I<TYPE>_insert>(), B<sk_I<TYPE>_push>()
119 or reallocated. If I<n> is zero, any excess space allocated in the
120 I<sk> structure is freed. On error I<sk> is unchanged.
123 additional memory allocated to hold I<n> elements if I<n> is positive.
124 The next I<n> calls to B<sk_I<TYPE>_insert>(), B<sk_I<TYPE>_push>() or
126 reallocated. If I<n> is zero or less than zero, no memory is allocated.
127 B<sk_I<TYPE>_new_reserve>() also sets the comparison function I<compare>
128 to the newly created stack. If I<compare> is NULL then no comparison
131 B<sk_I<TYPE>_set_cmp_func>() sets the comparison function of I<sk> to
132 I<compare>. The previous comparison function is returned or NULL if there
135 B<sk_I<TYPE>_free>() frees up the I<sk> structure. It does I<not> free up any
136 elements of I<sk>. After this call I<sk> is no longer valid.
138 B<sk_I<TYPE>_zero>() sets the number of elements in I<sk> to zero. It does not
139 free I<sk> so after this call I<sk> is still valid.
141 B<sk_I<TYPE>_pop_free>() frees up all elements of I<sk> and I<sk> itself. The
144 B<sk_I<TYPE>_delete>() deletes element I<i> from I<sk>. It returns the deleted
145 element or NULL if I<i> is out of range.
147 B<sk_I<TYPE>_delete_ptr>() deletes element matching I<ptr> from I<sk>. It
148 returns the deleted element or NULL if no element matching I<ptr> was found.
150 B<sk_I<TYPE>_insert>() inserts I<ptr> into I<sk> at position I<idx>. Any
151 existing elements at or after I<idx> are moved downwards. If I<idx> is out
152 of range the new element is appended to I<sk>. B<sk_I<TYPE>_insert>() either
153 returns the number of elements in I<sk> after the new element is inserted or
156 B<sk_I<TYPE>_push>() appends I<ptr> to I<sk> it is equivalent to:
160 B<sk_I<TYPE>_unshift>() inserts I<ptr> at the start of I<sk> it is equivalent
165 B<sk_I<TYPE>_pop>() returns and removes the last element from I<sk>.
167 B<sk_I<TYPE>_shift>() returns and removes the first element from I<sk>.
169 B<sk_I<TYPE>_set>() sets element I<idx> of I<sk> to I<ptr> replacing the current
171 this will only happen if I<sk> is NULL or I<idx> is out of range.
173 B<sk_I<TYPE>_find>() searches I<sk> for the element I<ptr>. In the case
175 a linear search for a pointer equal to I<ptr>. The index of the first
177 where a comparison function has been specified, I<sk> is sorted and
181 the order of elements in I<sk> can change.
186 element either before or after the location where I<ptr> would be if it were
187 present in I<sk>. The function also does not guarantee that the first matching
191 sets the I<*pnum> to number of matching elements in the stack. In case
192 no comparison function has been specified the I<*pnum> will be always set
195 B<sk_I<TYPE>_sort>() sorts I<sk> using the supplied comparison function.
197 B<sk_I<TYPE>_is_sorted>() returns B<1> if I<sk> is sorted and B<0> otherwise.
199 B<sk_I<TYPE>_dup>() returns a shallow copy of I<sk>
218 positive or negative value if I<a> is equal to, greater than
219 or less than I<b> respectively.
299 Before OpenSSL 3.3.0 B<sk_I<TYPE>_push>() returned -1 if I<sk> was NULL. It
