test-suite/test_tools.cc

   1 // XXX: This file is made of large pieces of src/tools.cc
   2 // with only a few minor modifications. TODO: redesign or delete.
   3
   4 #include "squid.h"
   5 #include "dlink.h"
   6 #include <iostream>
   7
   8 void
   9 xassert(const char *msg, const char *file, int line)
  10 {
  11     std::cout << "Assertion failed: (" << msg << ") at " << file << ":" << line << std::endl;
  12     exit (1);
  13 }
  14
  15 dlink_node *
  16 dlinkNodeNew()
  17 {
  18     return new dlink_node;
  19 }
  20
  21 /* the node needs to be unlinked FIRST */
  22 void
  23 dlinkNodeDelete(dlink_node * m)
  24 {
  25     if (m == NULL)
  26         return;
  27
  28     delete m;
  29 }
  30
  31 void
  32 dlinkAdd(void *data, dlink_node * m, dlink_list * list)
  33 {
  34     m->data = data;
  35     m->prev = NULL;
  36     m->next = list->head;
  37
  38     if (list->head)
  39         list->head->prev = m;
  40
  41     list->head = m;
  42
  43     if (list->tail == NULL)
  44         list->tail = m;
  45 }
  46
  47 void
  48 dlinkAddAfter(void *data, dlink_node * m, dlink_node * n, dlink_list * list)
  49 {
  50     m->data = data;
  51     m->prev = n;
  52     m->next = n->next;
  53
  54     if (n->next)
  55         n->next->prev = m;
  56     else {
  57         assert(list->tail == n);
  58         list->tail = m;
  59     }
  60
  61     n->next = m;
  62 }
  63
  64 void
  65 dlinkAddTail(void *data, dlink_node * m, dlink_list * list)
  66 {
  67     m->data = data;
  68     m->next = NULL;
  69     m->prev = list->tail;
  70
  71     if (list->tail)
  72         list->tail->next = m;
  73
  74     list->tail = m;
  75
  76     if (list->head == NULL)
  77         list->head = m;
  78 }
  79
  80 void
  81 dlinkDelete(dlink_node * m, dlink_list * list)
  82 {
  83     if (m->next)
  84         m->next->prev = m->prev;
  85
  86     if (m->prev)
  87         m->prev->next = m->next;
  88
  89     if (m == list->head)
  90         list->head = m->next;
  91
  92     if (m == list->tail)
  93         list->tail = m->prev;
  94
  95     m->next = m->prev = NULL;
  96 }