arlad/ptest.c

   1 /*
   2  * Copyright (c) 2002, 2005, Stockholms universitet
   3  * (Stockholm University, Stockholm Sweden)
   4  * All rights reserved.
   5  *
   6  * Redistribution and use in source and binary forms, with or without
   7  * modification, are permitted provided that the following conditions
   8  * are met:
   9  *
  10  * 1. Redistributions of source code must retain the above copyright
  11  *    notice, this list of conditions and the following disclaimer.
  12  *
  13  * 2. Redistributions in binary form must reproduce the above copyright
  14  *    notice, this list of conditions and the following disclaimer in the
  15  *    documentation and/or other materials provided with the distribution.
  16  *
  17  * 3. Neither the name of the university nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  22  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  25  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  26  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  27  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  28  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  29  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  30  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  31  * POSSIBILITY OF SUCH DAMAGE.
  32  */
  33
  34 #include <arla_local.h>
  35 RCSID("$Id$");
  36
  37 enum connected_mode connected_mode = CONNECTED;
  38
  39 static CredCacheEntry dummy_cred;
  40
  41 CredCacheEntry *
  42 cred_get (long cell, nnpfs_pag_t cred, int type)
  43 {
  44     return &dummy_cred;
  45 }
  46
  47 void
  48 cred_free (CredCacheEntry *ce)
  49 {
  50     assert(&dummy_cred == ce);
  51 }
  52
  53 int
  54 fs_probe (struct rx_connection *conn)
  55 {
  56     return 0;
  57 }
  58
  59 static ConnCacheEntry dummy_cce;
  60
  61 ConnCacheEntry *
  62 conn_get (int32_t cell, uint32_t host, uint16_t port, uint16_t service,
  63           int (*probe)(struct rx_connection *),
  64           CredCacheEntry *ce)
  65 {
  66     return &dummy_cce;
  67 }
  68
  69 void
  70 conn_free (ConnCacheEntry *e)
  71 {
  72     assert(&dummy_cce == e);
  73 }
  74
  75 Bool
  76 conn_isalivep (ConnCacheEntry *e)
  77 {
  78     return TRUE;
  79 }
  80
  81 int
  82 volcache_getname (uint32_t id, int32_t cell,
  83                   char *name, size_t name_sz)
  84 {
  85     snprintf(name, name_sz, "dummy");
  86     return 0;
  87 }
  88
  89 int
  90 main(int argc, char **argv)
  91 {
  92     ConnCacheEntry cce;
  93     struct rx_connection conn;
  94     struct rx_peer peer;
  95     unsigned long number;
  96     void *pe, *pe2;
  97     PROCESS p;
  98
  99     LWP_InitializeProcessSupport(4, &p);
 100     arla_loginit("/dev/stdout", 0);
 101     cell_init(0, arla_log_method);
 102     poller_init();
 103
 104     memset(&cce, 0, sizeof(cce));
 105     memset(&conn, 0, sizeof(conn));
 106     memset(&peer, 0, sizeof(peer));
 107
 108     conn.peer = &peer;
 109     cce.connection = &conn;
 110
 111     printf("add\n");
 112     number = 1000000;
 113     while(number--) {
 114         pe = poller_add_conn(&cce);
 115     }
 116     poller_remove(pe);
 117
 118     printf("add-remove\n");
 119     number = 1000000;
 120     while(number--) {
 121         pe = poller_add_conn(&cce);
 122         poller_remove(pe);
 123     }
 124
 125     printf("add-add-remove-remove-remove\n");
 126     pe = NULL;
 127     number = 1000000;
 128     while(number--) {
 129         pe = poller_add_conn(&cce);
 130         pe2 = poller_add_conn(&cce);
 131         assert(pe == pe2);
 132         poller_remove(pe);
 133         poller_remove(pe2);
 134     }
 135     return 0;
 136 }