mirror of
https://github.com/classilla/tenfourfox.git
synced 2024-09-07 06:54:33 +00:00
185 lines
5.4 KiB
Java
185 lines
5.4 KiB
Java
|
/*
|
||
|
* ====================================================================
|
||
|
* Licensed to the Apache Software Foundation (ASF) under one
|
||
|
* or more contributor license agreements. See the NOTICE file
|
||
|
* distributed with this work for additional information
|
||
|
* regarding copyright ownership. The ASF licenses this file
|
||
|
* to you under the Apache License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0
|
||
|
*
|
||
|
* Unless required by applicable law or agreed to in writing,
|
||
|
* software distributed under the License is distributed on an
|
||
|
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
|
||
|
* KIND, either express or implied. See the License for the
|
||
|
* specific language governing permissions and limitations
|
||
|
* under the License.
|
||
|
* ====================================================================
|
||
|
*
|
||
|
* This software consists of voluntary contributions made by many
|
||
|
* individuals on behalf of the Apache Software Foundation. For more
|
||
|
* information on the Apache Software Foundation, please see
|
||
|
* <http://www.apache.org/>.
|
||
|
*
|
||
|
*/
|
||
|
package ch.boye.httpclientandroidlib.pool;
|
||
|
|
||
|
import java.util.HashSet;
|
||
|
import java.util.Iterator;
|
||
|
import java.util.LinkedList;
|
||
|
import java.util.Set;
|
||
|
|
||
|
import ch.boye.httpclientandroidlib.annotation.NotThreadSafe;
|
||
|
import ch.boye.httpclientandroidlib.util.Args;
|
||
|
import ch.boye.httpclientandroidlib.util.Asserts;
|
||
|
|
||
|
@NotThreadSafe
|
||
|
abstract class RouteSpecificPool<T, C, E extends PoolEntry<T, C>> {
|
||
|
|
||
|
private final T route;
|
||
|
private final Set<E> leased;
|
||
|
private final LinkedList<E> available;
|
||
|
private final LinkedList<PoolEntryFuture<E>> pending;
|
||
|
|
||
|
RouteSpecificPool(final T route) {
|
||
|
super();
|
||
|
this.route = route;
|
||
|
this.leased = new HashSet<E>();
|
||
|
this.available = new LinkedList<E>();
|
||
|
this.pending = new LinkedList<PoolEntryFuture<E>>();
|
||
|
}
|
||
|
|
||
|
protected abstract E createEntry(C conn);
|
||
|
|
||
|
public final T getRoute() {
|
||
|
return route;
|
||
|
}
|
||
|
|
||
|
public int getLeasedCount() {
|
||
|
return this.leased.size();
|
||
|
}
|
||
|
|
||
|
public int getPendingCount() {
|
||
|
return this.pending.size();
|
||
|
}
|
||
|
|
||
|
public int getAvailableCount() {
|
||
|
return this.available.size();
|
||
|
}
|
||
|
|
||
|
public int getAllocatedCount() {
|
||
|
return this.available.size() + this.leased.size();
|
||
|
}
|
||
|
|
||
|
public E getFree(final Object state) {
|
||
|
if (!this.available.isEmpty()) {
|
||
|
if (state != null) {
|
||
|
final Iterator<E> it = this.available.iterator();
|
||
|
while (it.hasNext()) {
|
||
|
final E entry = it.next();
|
||
|
if (state.equals(entry.getState())) {
|
||
|
it.remove();
|
||
|
this.leased.add(entry);
|
||
|
return entry;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
final Iterator<E> it = this.available.iterator();
|
||
|
while (it.hasNext()) {
|
||
|
final E entry = it.next();
|
||
|
if (entry.getState() == null) {
|
||
|
it.remove();
|
||
|
this.leased.add(entry);
|
||
|
return entry;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
return null;
|
||
|
}
|
||
|
|
||
|
public E getLastUsed() {
|
||
|
if (!this.available.isEmpty()) {
|
||
|
return this.available.getLast();
|
||
|
} else {
|
||
|
return null;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public boolean remove(final E entry) {
|
||
|
Args.notNull(entry, "Pool entry");
|
||
|
if (!this.available.remove(entry)) {
|
||
|
if (!this.leased.remove(entry)) {
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
public void free(final E entry, final boolean reusable) {
|
||
|
Args.notNull(entry, "Pool entry");
|
||
|
final boolean found = this.leased.remove(entry);
|
||
|
Asserts.check(found, "Entry %s has not been leased from this pool", entry);
|
||
|
if (reusable) {
|
||
|
this.available.addFirst(entry);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public E add(final C conn) {
|
||
|
final E entry = createEntry(conn);
|
||
|
this.leased.add(entry);
|
||
|
return entry;
|
||
|
}
|
||
|
|
||
|
public void queue(final PoolEntryFuture<E> future) {
|
||
|
if (future == null) {
|
||
|
return;
|
||
|
}
|
||
|
this.pending.add(future);
|
||
|
}
|
||
|
|
||
|
public PoolEntryFuture<E> nextPending() {
|
||
|
return this.pending.poll();
|
||
|
}
|
||
|
|
||
|
public void unqueue(final PoolEntryFuture<E> future) {
|
||
|
if (future == null) {
|
||
|
return;
|
||
|
}
|
||
|
|
||
|
this.pending.remove(future);
|
||
|
}
|
||
|
|
||
|
public void shutdown() {
|
||
|
for (final PoolEntryFuture<E> future: this.pending) {
|
||
|
future.cancel(true);
|
||
|
}
|
||
|
this.pending.clear();
|
||
|
for (final E entry: this.available) {
|
||
|
entry.close();
|
||
|
}
|
||
|
this.available.clear();
|
||
|
for (final E entry: this.leased) {
|
||
|
entry.close();
|
||
|
}
|
||
|
this.leased.clear();
|
||
|
}
|
||
|
|
||
|
@Override
|
||
|
public String toString() {
|
||
|
final StringBuilder buffer = new StringBuilder();
|
||
|
buffer.append("[route: ");
|
||
|
buffer.append(this.route);
|
||
|
buffer.append("][leased: ");
|
||
|
buffer.append(this.leased.size());
|
||
|
buffer.append("][available: ");
|
||
|
buffer.append(this.available.size());
|
||
|
buffer.append("][pending: ");
|
||
|
buffer.append(this.pending.size());
|
||
|
buffer.append("]");
|
||
|
return buffer.toString();
|
||
|
}
|
||
|
|
||
|
}
|