vector.c 1.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081
  1. /*
  2. * vector.c:
  3. * simple vectors
  4. *
  5. * Copyright (c) 2001 Chris Lightfoot. All rights reserved.
  6. *
  7. */
  8. static const char rcsid[] = "$Id: vector.c,v 1.3 2003/11/07 02:16:41 pdw Exp $";
  9. #ifdef HAVE_CONFIG_H
  10. /*include "configuration.h"*/
  11. #endif /* HAVE_CONFIG_H */
  12. #include <stdlib.h>
  13. #include <string.h>
  14. #include "vector.h"
  15. #include "iftop.h"
  16. vector vector_new(void) {
  17. vector v;
  18. v = xcalloc(1, sizeof *v);
  19. if (!v) return NULL;
  20. v->ary = xcalloc(16, sizeof *v->ary);
  21. v->n = 16;
  22. v->n_used = 0;
  23. return v;
  24. }
  25. void vector_delete(vector v) {
  26. xfree(v->ary);
  27. xfree(v);
  28. }
  29. void vector_delete_free(vector v) {
  30. item *i;
  31. vector_iterate(v, i) {
  32. xfree(i->v);
  33. }
  34. xfree(v->ary);
  35. xfree(v);
  36. }
  37. void vector_push_back(vector v, const item t) {
  38. if (v->n_used == v->n) vector_reallocate(v, v->n * 2);
  39. v->ary[v->n_used++] = t;
  40. }
  41. void vector_pop_back(vector v) {
  42. if (v->n_used > 0) {
  43. --v->n_used;
  44. if (v->n_used < v->n / 2) vector_reallocate(v, v->n / 2);
  45. }
  46. }
  47. item vector_back(vector v) {
  48. return v->ary[v->n_used - 1];
  49. }
  50. item *vector_remove(vector v, item *t) {
  51. if (t >= v->ary + v->n_used) return NULL;
  52. if (t < v->ary + v->n_used - 1)
  53. memmove(t, t + 1, (v->n_used - (t - v->ary)) * sizeof(item));
  54. memset(v->ary + v->n_used--, 0, sizeof(item));
  55. if (v->n_used < v->n / 2 && v->n > 16) {
  56. size_t i = t - v->ary;
  57. vector_reallocate(v, v->n / 2);
  58. t = v->ary + i;
  59. }
  60. return t;
  61. }
  62. void vector_reallocate(vector v, const size_t n) {
  63. if (n < v->n_used || n <= 0) return;
  64. v->ary = xrealloc(v->ary, n * sizeof(item));
  65. memset(v->ary + v->n_used, 0, (v->n - v->n_used) * sizeof(item));
  66. v->n = n;
  67. }