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 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is mozilla.org code.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 2001
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
package org.ietf.ldap;
import java.io.Serializable;
import java.util.*;
import org.ietf.ldap.client.*;
/**
* Manages search results, references and responses returned on one or
* more search requests
*
*/
public class LDAPSearchQueue extends LDAPMessageQueueImpl {
static final long serialVersionUID = -7163312406176592277L;
/**
* Constructs a search message queue
*
* @param asynchOp a boolean flag indicating whether the object is used
* for asynchronous LDAP operations
* @param cons LDAP search constraints
* @see org.ietf.ldap.LDAPAsynchronousConnection
*/
LDAPSearchQueue( boolean asynchOp,
LDAPSearchConstraints cons ) {
super( asynchOp );
_constraints = cons;
}
/**
* Blocks until a search result, reference or response is available,
* or until all operations associated with the object have completed
* or been canceled.
* Wakes up the LDAPConnThread if the backlog limit has been reached.
*
* @return a search result, search reference, search response message,
* or null if there are no more outstanding requests.
* @exception LDAPException Network error exception
* @exception LDAPInterruptedException The invoking thread was interrupted
* @see LDAPResponse
* @see LDAPSearchResult
* @see LDAPSearchResultReference
*/
public LDAPMessage getResponse() throws LDAPException{
LDAPMessage result = super.getResponse();
// Notify LDAPConnThread to wake up if backlog limit has been reached
if ( result instanceof LDAPSearchResult ||
result instanceof LDAPSearchResultReference ) {
LDAPConnThread connThread =
getConnThread( result.getMessageID() );
if ( connThread != null ) {
connThread.resultRetrieved();
}
}
return result;
}
/**
* Blocks until a response is available for a particular message ID, or
* until all operations associated with the message ID have completed or
* been canceled, and returns the response. If there is no outstanding
* operation for the message ID (or if it is zero or a negative number),
* IllegalArgumentException is thrown.
*
* @param msgid A particular message to query for responses available
* @return a response for an LDAP operation or null if there are no
* more outstanding requests.
* @exception LDAPException Network error exception
* @exception LDAPInterruptedException The invoking thread was interrupted
*/
public LDAPMessage getResponse( int msgid )
throws LDAPException {
LDAPMessage result = super.getResponse( msgid );
// Notify LDAPConnThread to wake up if backlog limit has been reached
if ( result instanceof LDAPSearchResult ||
result instanceof LDAPSearchResultReference ) {
LDAPConnThread connThread =
getConnThread( result.getMessageID() );
if ( connThread != null ) {
connThread.resultRetrieved();
}
}
return result;
}
/**
* Reports true if all results for a particular message ID have been
* received by the API implementation. That is the case if a
* searchResultDone response has been received by the SDK. There may
* still be messages queued in the object for retrieval by the
* application. If there is no outstanding operation for the message ID
* (or if it is zero or a negative number), IllegalArgumentException is
* thrown.
*
* @param msgid A particular message to query for completion
* @return true if all results for a particular message ID have been
* received
*/
public synchronized boolean isComplete( int msgid ) throws LDAPException {
boolean OK = false;
for ( int i = (_messageQueue.size()-1); i >= 0; i-- ) {
LDAPMessage msg = (LDAPMessage)_messageQueue.get(i);
if ( msg.getMessageID() == msgid ) {
OK = true;
break;
}
}
if ( !OK ) {
throw new IllegalArgumentException( "Invalid msg ID: " + msgid );
}
// Search an instance of LDAPResponse
for ( int i = _messageQueue.size()-1; i >= 0; i-- ) {
LDAPMessage msg = (LDAPMessage)_messageQueue.get(i);
if ( msg instanceof LDAPResponse ) {
return true;
}
}
return false;
}
/**
* Gets the key of the cache entry
*
* @return the key of the cache entry
*/
Long getKey() {
return _key;
}
/**
* Returns the search constraints used to create this object.
*
* @return the search constraints used to create this object.
*/
LDAPSearchConstraints getSearchConstraints() {
return _constraints;
}
/**
* Resets the state of this object so it can be recycled
* Used by LDAPConnection synchronous operations.
*/
void reset() {
super.reset();
_constraints = null;
}
/**
* Sets the key of the cache entry. The queue needs to know this value
* when the results get processed. After the results have been
* saved in the vector, then the key and a vector of results are put in
* the cache.
*
* @param key the key of the cache entry
*/
void setKey( Long key ) {
_key = key;
}
/**
* Sets search constraints
*
* @param cons LDAP search constraints
*/
void setSearchConstraints( LDAPSearchConstraints cons ) {
_constraints = cons;
}
// this instance variable is only for cache purposes
private Long _key = null;
private LDAPSearchConstraints _constraints;
}
|