siptransdebugger.cxx

Vovida 社区开源的 SIP 协议源码

/* ====================================================================
 * The Vovida Software License, Version 1.0 
 * 
 * Copyright (c) 2000 Vovida Networks, Inc.  All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 * 
 * 3. The names "VOCAL", "Vovida Open Communication Application Library",
 *    and "Vovida Open Communication Application Library (VOCAL)" must
 *    not be used to endorse or promote products derived from this
 *    software without prior written permission. For written
 *    permission, please contact [e-mail].
 *
 * 4. Products derived from this software may not be called "VOCAL", nor
 *    may "VOCAL" appear in their name, without prior written
 *    permission of Vovida Networks, Inc.
 * 
 * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESSED OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
 * NON-INFRINGEMENT ARE DISCLAIMED.  IN NO EVENT SHALL VOVIDA
 * NETWORKS, INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT DAMAGES
 * IN EXCESS OF $1,000, NOR FOR ANY INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
 * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
 * DAMAGE.
 * 
 * ====================================================================
 * 
 * This software consists of voluntary contributions made by Vovida
 * Networks, Inc. and many individuals on behalf of Vovida Networks,
 * Inc.  For more information on Vovida Networks, Inc., please see
 * <http://www.vovida.org/>.
 *
 */

static const char* const SipTransDebugger_cxx_version =
    "$Id: SipTransDebugger.cxx,v 1.7 2002/03/19 23:26:19 bko Exp $";

#include "global.h"
#include "SipTransDebugger.hxx"
#include <stdio.h>

using namespace Vocal;

Data
SipTransDebugger::printDebug(SipTransHashTable* table)
{
    //// lock the whole table, just to make life easier...
    table->rwLock.ReadLock();

    int level2count = 0;
    int level3count = 0;
    int resCount = 0;
    int reqCount = 0;

    for (unsigned int i=0;i<table->size;i++)
    {
	table->buckets[i].rwLock.ReadLock();
	SipTransHashTable::Node* currNode;
	currNode = table->buckets[i].first;
	for(;currNode;)
	{
	    currNode->rwLock.ReadLock();
	    SipTransLevel1Node * topNode = currNode->myNode;
	    if(topNode)
	    {
		topNode->lock.lock();
		SipTransactionList<SipTransLevel2Node*>::SipTransListNode *
		level2node = topNode->level2.getFirst();
		while(level2node)
		{
		    level2count++;
		    SipTransactionList<SipTransLevel3Node*>::SipTransListNode *
		    level3node = level2node->val->level3.getFirst();
		    while(level3node)
		    {
			level3count++;
			if(level3node->val->msgs.request)
			    reqCount++;
			if(level3node->val->msgs.response)
			    resCount++;
			level3node =
			    level2node->val->level3.getNext(level3node);
		    }
		    level2node = topNode->level2.getNext(level2node);
		}
		topNode->lock.unlock();
	    }
	    currNode->rwLock.Unlock();
	    currNode = currNode->next;
	}
	table->buckets[i].rwLock.Unlock();
    }
    table->rwLock.Unlock();
    char details[200];
    sprintf(details,"%s[%ld] : %s[%d] : %s[%d]\nTotal: %s[%d], %s[%d] %s[%ld]",
	    "top node count", table->count,
	    "level 2 count", level2count,
	    "level 3 count", level3count,
	    "requests", reqCount,
	    "responses", resCount,
	    "total buckets", table->size);
    return Data(details);
}


/* Local Variables: */
/* c-file-style: "stroustrup" */
/* indent-tabs-mode: nil */
/* c-file-offsets: ((access-label . -) (inclass . ++)) */
/* c-basic-offset: 4 */
/* End: */