summaryrefslogtreecommitdiff
path: root/gnu/CORBA/Asynchron.java
blob: 4ea222543446da46ca0c8a75be8d58fbc738bd6f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
/* Asynchron.java --
   Copyright (C) 2005 Free Software Foundation, Inc.

This file is part of GNU Classpath.

GNU Classpath is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.

GNU Classpath is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING.  If not, write to the
Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA.

Linking this library statically or dynamically with other modules is
making a combined work based on this library.  Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.

As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module.  An independent module is a module which is not derived from
or based on this library.  If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so.  If you do not wish to do so, delete this
exception statement from your version. */


package gnu.CORBA;

import org.omg.CORBA.Request;
import org.omg.CORBA.WrongTransaction;

import java.util.Iterator;
import java.util.LinkedList;

/**
 * Handles the asynchronous dynamic invocations.
 *
 * @author Audrius Meskauskas, Lithuania (AudriusA@Bioinformatics.org)
 */
public class Asynchron
{
  LinkedList sent = new LinkedList();

  /**
   * Send multiple prepared requests one way, do not caring about the answer.
   * The messages, containing requests, will be marked, indicating that
   * the sender is not expecting to get a reply.
   *
   * @param requests the prepared array of requests.
   *
   * @see Request#send_oneway()
   */
  public void send_multiple_requests_oneway(Request[] requests)
  {
    for (int i = 0; i < requests.length; i++)
      {
        requests [ i ].send_oneway();
      }
  }

  /**
   * Send multiple prepared requests expecting to get a reply. All requests
   * are send in parallel, each in its own separate thread. When the
   * reply arrives, it is stored in the agreed fields of the corresponing
   * request data structure. If this method is called repeatedly,
   * the new requests are added to the set of the currently sent requests,
   * but the old set is not discarded.
   *
   * @param requests the prepared array of requests.
   *
   * @see #poll_next_response()
   * @see #get_next_response()
   * @see Request#send_deferred()
   */
  public void send_multiple_requests_deferred(Request[] requests)
  {
    synchronized (sent)
      {
        for (int i = 0; i < requests.length; i++)
          {
            sent.add(requests [ i ]);

            // TODO Reuse threads that are instantiated in the method below,
            // one thread per call.
            requests [ i ].send_deferred();
          }
      }
  }

  /**
   * Find if any of the requests that have been previously sent with
   * {@link #send_multiple_requests_deferred}, have a response yet.
   *
   * @return true if there is at least one response to the previously
   * sent request, false otherwise.
   */
  public boolean poll_next_response()
  {
    synchronized (sent)
      {
        Iterator iter = sent.iterator();
        Request r;
        while (iter.hasNext())
          {
            r = (Request) iter.next();
            if (r.poll_response())
              return true;
          }
      }
    return false;
  }

  /**
   * Get the next instance with a response being received. If all currently
   * sent responses not yet processed, this method pauses till at least one of
   * them is complete. If there are no requests currently sent, the method
   * pauses till some request is submitted and the response is received.
   * This strategy is identical to the one accepted by Suns 1.4 ORB
   * implementation.
   *
   * The returned response is removed from the list of the currently
   * submitted responses and is never returned again.
   *
   * @return the previously sent request that now contains the received
   * response.
   *
   * @throws WrongTransaction If the method was called from the transaction
   * scope different than the one, used to send the request. The exception
   * can be raised only if the request is implicitly associated with some
   * particular transaction.
   */
  public Request get_next_response()
                            throws WrongTransaction
  {
    // The hard-coded waiting times for the incremental waiter.
    // TODO it is possible to write more tricky system where the
    // requests notify the Asynchron when they are complete.
    // Wait for 5 ms intially.
    int wait = 8;

    // Double the waiting time
    int INC = 2;

    // Do not increase if the waiting time is already over 500 ms.
    int MAX = 500;
    while (true)
      {
        synchronized (sent)
          {
            Iterator iter = sent.iterator();
            Request r;
            while (iter.hasNext())
              {
                r = (Request) iter.next();
                if (r.poll_response())
                {
                  sent.remove(r);
                  return r;
                }
              }
          }
        try
          {
            Thread.sleep(wait);
            if (wait < MAX)
              wait = wait * INC;
          }
        catch (InterruptedException ex)
          {
          }
      }
  }
}