Lines Matching refs:st
142 int sk_insert(STACK *st, char *data, int loc)
146 if(st == NULL) return 0;
147 if (st->num_alloc <= st->num+1)
149 s=(char **)OPENSSL_realloc((char *)st->data,
150 (unsigned int)sizeof(char *)*st->num_alloc*2);
153 st->data=s;
154 st->num_alloc*=2;
156 if ((loc >= (int)st->num) || (loc < 0))
157 st->data[st->num]=data;
163 f=(char **)st->data;
164 t=(char **)&(st->data[1]);
165 for (i=st->num; i>=loc; i--)
169 memmove( (char *)&(st->data[loc+1]),
170 (char *)&(st->data[loc]),
171 sizeof(char *)*(st->num-loc));
173 st->data[loc]=data;
175 st->num++;
176 st->sorted=0;
177 return(st->num);
180 char *sk_delete_ptr(STACK *st, char *p)
184 for (i=0; i<st->num; i++)
185 if (st->data[i] == p)
186 return(sk_delete(st,i));
190 char *sk_delete(STACK *st, int loc)
195 if(!st || (loc < 0) || (loc >= st->num)) return NULL;
197 ret=st->data[loc];
198 if (loc != st->num-1)
200 j=st->num-1;
202 st->data[i]=st->data[i+1];
204 * memcpy( &(st->data[loc]),
205 * &(st->data[loc+1]),
206 * sizeof(char *)*(st->num-loc-1));
209 st->num--;
213 static int internal_find(STACK *st, char *data, int ret_val_options)
218 if(st == NULL) return -1;
220 if (st->comp == NULL)
222 for (i=0; i<st->num; i++)
223 if (st->data[i] == data)
227 sk_sort(st);
235 comp_func=(int (*)(const void *,const void *))(st->comp);
236 r=(char **)OBJ_bsearch_ex((char *)&data,(char *)st->data,
237 st->num,sizeof(char *),comp_func,ret_val_options);
239 return((int)(r-st->data));
242 int sk_find(STACK *st, char *data)
244 return internal_find(st, data, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH);
246 int sk_find_ex(STACK *st, char *data)
248 return internal_find(st, data, OBJ_BSEARCH_VALUE_ON_NOMATCH);
251 int sk_push(STACK *st, char *data)
253 return(sk_insert(st,data,st->num));
256 int sk_unshift(STACK *st, char *data)
258 return(sk_insert(st,data,0));
261 char *sk_shift(STACK *st)
263 if (st == NULL) return(NULL);
264 if (st->num <= 0) return(NULL);
265 return(sk_delete(st,0));
268 char *sk_pop(STACK *st)
270 if (st == NULL) return(NULL);
271 if (st->num <= 0) return(NULL);
272 return(sk_delete(st,st->num-1));
275 void sk_zero(STACK *st)
277 if (st == NULL) return;
278 if (st->num <= 0) return;
279 memset((char *)st->data,0,sizeof(st->data)*st->num);
280 st->num=0;
283 void sk_pop_free(STACK *st, void (*func)(void *))
287 if (st == NULL) return;
288 for (i=0; i<st->num; i++)
289 if (st->data[i] != NULL)
290 func(st->data[i]);
291 sk_free(st);
294 void sk_free(STACK *st)
296 if (st == NULL) return;
297 if (st->data != NULL) OPENSSL_free(st->data);
298 OPENSSL_free(st);
301 int sk_num(const STACK *st)
303 if(st == NULL) return -1;
304 return st->num;
307 char *sk_value(const STACK *st, int i)
309 if(!st || (i < 0) || (i >= st->num)) return NULL;
310 return st->data[i];
313 char *sk_set(STACK *st, int i, char *value)
315 if(!st || (i < 0) || (i >= st->num)) return NULL;
316 return (st->data[i] = value);
319 void sk_sort(STACK *st)
321 if (st && !st->sorted)
325 /* same comment as in sk_find ... previously st->comp was declared
330 comp_func=(int (*)(const void *,const void *))(st->comp);
331 qsort(st->data,st->num,sizeof(char *), comp_func);
332 st->sorted=1;
336 int sk_is_sorted(const STACK *st)
338 if (!st)
340 return st->sorted;