test-suite/mem_node_test.cc

   1
   2 /*
   3  * DEBUG: section 19    Store Memory Primitives
   4  * AUTHOR: Robert Collins
   5  *
   6  * SQUID Web Proxy Cache          http://www.squid-cache.org/
   7  * ----------------------------------------------------------
   8  *
   9  *  Squid is the result of efforts by numerous individuals from
  10  *  the Internet community; see the CONTRIBUTORS file for full
  11  *  details.   Many organizations have provided support for Squid's
  12  *  development; see the SPONSORS file for full details.  Squid is
  13  *  Copyrighted (C) 2001 by the Regents of the University of
  14  *  California; see the COPYRIGHT file for full details.  Squid
  15  *  incorporates software developed and/or copyrighted by other
  16  *  sources; see the CREDITS file for full details.
  17  *
  18  *  This program is free software; you can redistribute it and/or modify
  19  *  it under the terms of the GNU General Public License as published by
  20  *  the Free Software Foundation; either version 2 of the License, or
  21  *  (at your option) any later version.
  22  *
  23  *  This program is distributed in the hope that it will be useful,
  24  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  25  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  26  *  GNU General Public License for more details.
  27  *
  28  *  You should have received a copy of the GNU General Public License
  29  *  along with this program; if not, write to the Free Software
  30  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
  31  *
  32  */
  33
  34 #include "squid.h"
  35 #include "mem_node.h"
  36
  37 #include <iostream>
  38
  39 /* TODO: put this in a libTest */
  40 void
  41 xassert(const char *msg, const char *file, int line)
  42 {
  43     std::cout << "Assertion failed: (" << msg << ") at " << file << ":" << line << std::endl;
  44     exit (1);
  45 }
  46
  47 int
  48 main(int argc, char **argv)
  49 {
  50     mem_node *aNode = new mem_node(0);
  51     assert (aNode);
  52     /* This will fail if MemPools are disabled. A knock on effect is that
  53      * the store will never trim memory
  54      */
  55     assert (mem_node::InUseCount() == 1);
  56     assert (SM_PAGE_SIZE > 50);
  57     aNode->nodeBuffer.length = 45;
  58     assert (aNode->start() == 0);
  59     assert (aNode->end() == 45);
  60     assert (aNode->dataRange().size() == 45);
  61     aNode->nodeBuffer.offset = 50;
  62     assert (aNode->start() == 50);
  63     assert (aNode->end() == 95);
  64     assert (aNode->dataRange().size() == 45);
  65     assert (!aNode->contains(49));
  66     assert (aNode->contains(50));
  67     assert (aNode->contains(75));
  68     assert (!aNode->contains(95));
  69     assert (aNode->contains(94));
  70     assert (!aNode->canAccept(50));
  71     assert (aNode->canAccept(95));
  72     assert (!aNode->canAccept(94));
  73     aNode->nodeBuffer.length = SM_PAGE_SIZE - 1;
  74     assert (aNode->canAccept (50 + SM_PAGE_SIZE - 1));
  75     assert (!aNode->canAccept (50 + SM_PAGE_SIZE));
  76     assert (mem_node (0) < mem_node (2));
  77     assert (!(mem_node (0) < mem_node (0)));
  78     assert (!(mem_node (2) < mem_node (0)));
  79     delete aNode;
  80     assert (mem_node::InUseCount() == 0);
  81     return 0;
  82 }