Rev 12260 | Rev 13757 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 12260 | Rev 12884 | ||
---|---|---|---|
Line 338... | Line 338... | ||
338 | 338 | ||
339 | /* Routines for quick search of item in a list. */ |
339 | /* Routines for quick search of item in a list. */ |
340 | 340 | ||
341 | /* Verify whether a list is well-ordered. For debugging uses. |
341 | /* Verify whether a list is well-ordered. For debugging uses. |
342 | * Returns 0 if order is OK, -1 otherwise. */ |
342 | * Returns 0 if order is OK, -1 otherwise. */ |
343 | int verify_order(void *list, int items, size_t item_size) |
343 | int verify_order(void *list, int items, size_t item_size){ |
344 | { |
- | |
345 | int i; char *old, **p; |
344 | int i; char *old, **p; |
346 | p=list; old=*p; |
345 | p=list; old=*p; |
347 | for(i=item_size;i<items*item_size;i+=item_size) { |
346 | for(i=item_size;i<items*item_size;i+=item_size) { |
348 | p=list+i; |
347 | p=list+i; |
349 | if(strcmp(*p,old)<0) { |
348 | if(strcmp(*p,old)<0) { |
350 | fprintf(stderr,"Table disorder: %s > %s",old,*p); |
349 | fprintf(stderr,"\nTable disorder: %s > %s\n",old,*p); |
351 | exit(1); |
350 | exit(1); |
352 | } |
351 | } |
353 | old=*p; |
352 | old=*p; |
354 | } |
353 | } |
355 | return 0; |
354 | return 0; |