Lines Matching refs:num
103 ret->num=sk->num; in sk_dup()
104 memcpy(ret->data,sk->data,sizeof(char *)*sk->num); in sk_dup()
133 ret->num=0; in sk_new()
147 if (st->num_alloc <= st->num+1) in sk_insert()
156 if ((loc >= (int)st->num) || (loc < 0)) in sk_insert()
157 st->data[st->num]=data; in sk_insert()
165 for (i=st->num; i>=loc; i--) in sk_insert()
171 sizeof(char *)*(st->num-loc)); in sk_insert()
175 st->num++; in sk_insert()
177 return(st->num); in sk_insert()
184 for (i=0; i<st->num; i++) in sk_delete_ptr()
195 if(!st || (loc < 0) || (loc >= st->num)) return NULL; in sk_delete()
198 if (loc != st->num-1) in sk_delete()
200 j=st->num-1; in sk_delete()
209 st->num--; in sk_delete()
222 for (i=0; i<st->num; i++) in internal_find()
237 st->num,sizeof(char *),comp_func,ret_val_options); in internal_find()
253 return(sk_insert(st,data,st->num)); in sk_push()
264 if (st->num <= 0) return(NULL); in sk_shift()
271 if (st->num <= 0) return(NULL); in sk_pop()
272 return(sk_delete(st,st->num-1)); in sk_pop()
278 if (st->num <= 0) return; in sk_zero()
279 memset((char *)st->data,0,sizeof(st->data)*st->num); in sk_zero()
280 st->num=0; in sk_zero()
288 for (i=0; i<st->num; i++) in sk_pop_free()
304 return st->num; in sk_num()
309 if(!st || (i < 0) || (i >= st->num)) return NULL; in sk_value()
315 if(!st || (i < 0) || (i >= st->num)) return NULL; in sk_set()
331 qsort(st->data,st->num,sizeof(char *), comp_func); in sk_sort()