testNonInviteServerTx.cxx

Go to the documentation of this file.

#include "resip/stack/SipStack.hxx"
#include "resip/stack/Transport.hxx"
#include "resip/stack/Uri.hxx"
#include "resip/stack/Helper.hxx"
#include "resip/stack/UdpTransport.hxx"

#include "rutil/Logger.hxx"
#include "rutil/DataStream.hxx"

#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>


using namespace resip;
using namespace std;

#define RESIPROCATE_SUBSYSTEM Subsystem::APP
#define CRLF "\r\n"


SipStack* client=0;
Fifo<Message> received;
UdpTransport* server=0;

void
doit(int serverResponse, int expectedRetrans, int expectedClientResponse);


int
main(int argc, char *argv[])
{
    Log::initialize(Log::Cout, Log::Debug, argv[0]);

    InfoLog( << "Starting up, making stack");

    client = new SipStack();
    client->addTransport(UDP, 5060);

    server = new UdpTransport("localhost", 5070, "default", received);

    
    // Test 1: 
    // client sends a reg, server does nothing, client should retransmit 10
    // times, client should receive 408

    // Test 2: 
    // client sends a reg, server sends 100, client should retransmit 7 times
    // client should receive 408
    
    // Test 3:
    // client sends a reg, server sends 200, client shouldn't retransmit at all
    // client should receive 200

    // Test 4:
    // client sends a reg, server sends 400, client shouldn't retransmit at all
    // client should receive 400

    //doit(100, 7, 408);
    doit(200, 1, 200);
    doit(400, 1, 400);
    doit(0, 10, 408);
    
    return 0;
}


void
doit(int serverResponse, int expectedRetrans, int expectedClientResponse)
{
   InfoLog (<< "Running test: " << serverResponse << " " << expectedRetrans << " " << expectedClientResponse);
   
    NameAddr me;
    me.uri().host() = "localhost";
    me.uri().port() = 5070;
    SipMessage* reg = Helper::makeRegister(me, me);
    Data encoded(2048, true);
    DataStream strm(encoded);
    reg->encode(strm);
    strm.flush();

    client->send(*reg);

    Data encodedResponse(2048, true);
    
    int count=0;
    while (1)
    {
       struct timeval tv;
       fd_set fdReadSet;
       int fdSetSize = 0;
       
       // Init the fd_set for the select()
       FD_ZERO(&fdReadSet);
       
       fdSetSize = 0;
       client->buildFdSet(&fdReadSet, &fdSetSize);
       server->buildFdSet(&fdReadSet, &fdSetSize);
       
       // block on fdset
       tv.tv_sec = 0;
       tv.tv_usec = 1000 * client->getTimeTillNextProcess();

       // get the sip message that we just sent and process it
       int err = select(fdSetSize, &fdReadSet, 0, 0, &tv);
       assert (err != -1);
       
       client->process(&fdReadSet);
       server->process(&fdReadSet);
       
       SipMessage* sipMessage = client->receive();
            
       if (sipMessage) 
       {
          InfoLog( << "got message (client)" << *sipMessage);
          assert(sipMessage->isResponse());
          assert(sipMessage->header(h_StatusLine).responseCode() == expectedClientResponse);
          assert(count == expectedRetrans);
          return;
       }

       client->process(&fdReadSet);
       if (received.messageAvailable())
       {
          count++;
          
          SipMessage* sip = dynamic_cast<SipMessage*>(received.getNext());
          assert(sip);
          InfoLog( << "got message (server)" << *sip);

          if (serverResponse)
          {
             SipMessage* response = Helper::makeResponse(*sip, serverResponse);
             DebugLog (<< "server sending response = " << endl << *response);
            
             DataStream strm(encodedResponse);
             response->encode(strm);
             strm.flush();

             // create address to send to
             struct sockaddr_in sa;
            
             sa.sin_family = PF_INET;
             sa.sin_addr.s_addr = inet_addr("127.0.0.1");
             sa.sin_port = htons(5060);
            
             server->send(sa, encodedResponse);
          }
         
          delete sip;
            
       }

       usleep(20);
    }
}
/* ====================================================================
 * 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 vocal@vovida.org.
 *
 * 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/>.
 *
 */