123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354 |
- /*
- ** Written by David Gerdes US Army Construction Engineering Research Lab
- ** April 1992
- ** Copyright 1992 USA-CERL All rights reserved.
- **
- */
- /*
- ** This is a simple best case performance comparison between linkm and malloc
- */
- #include <stdio.h>
- #include <grass/linkm.h>
- struct link
- {
- char let;
- struct link *next;
- };
- /*
- #define LINKM
- */
- int main(int argc, char *argv[])
- {
- register int i;
- VOID_T *head;
- struct link List, *tmp, *p;
- int rev = 0;
- #ifdef LINKM
- head = (VOID_T *) link_init(sizeof(struct link));
- #endif
- for (i = 0; i < 2000000; i++) {
- #ifdef LINKM
- p = (struct link *)link_new(head);
- link_dispose(head, p);
- #else
- p = (struct link *)malloc(sizeof(struct link));
- free(p);
- #endif
- }
- #ifdef LINKM
- link_cleanup(head);
- #endif
- exit(0);
- }
|