test-suite/mem_node_test.cc

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