df46a349e0
Motivation: Http2MultiplexCodec and Http2MultiplexHandler had a very strong coupling with Http2FrameCodec which we can reduce easily. The end-goal should be to have no coupling at all. Modifications: - Reduce coupling by move some common logic to Http2CodecUtil - Move logic to check if a stream may have existed before to Http2FrameCodec - Use ArrayDeque as replacement for custom double-linked-list which makes the code a lot more readable - Use WindowUpdateFrame to signal consume bytes (just as users do when they use Http2FrameCodec directly) Result: Less coupling and cleaner code.
130 lines
2.8 KiB
Java
130 lines
2.8 KiB
Java
/*
|
|
* Copyright 2019 The Netty Project
|
|
*
|
|
* The Netty Project 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.
|
|
*/
|
|
package io.netty.handler.codec.http2;
|
|
|
|
import java.util.Collection;
|
|
import java.util.Iterator;
|
|
import java.util.Queue;
|
|
|
|
final class MaxCapacityQueue<E> implements Queue<E> {
|
|
private final Queue<E> queue;
|
|
private final int maxCapacity;
|
|
|
|
MaxCapacityQueue(Queue<E> queue, int maxCapacity) {
|
|
this.queue = queue;
|
|
this.maxCapacity = maxCapacity;
|
|
}
|
|
|
|
@Override
|
|
public boolean add(E element) {
|
|
if (offer(element)) {
|
|
return true;
|
|
}
|
|
throw new IllegalStateException();
|
|
}
|
|
|
|
@Override
|
|
public boolean offer(E element) {
|
|
if (maxCapacity <= queue.size()) {
|
|
return false;
|
|
}
|
|
return queue.offer(element);
|
|
}
|
|
|
|
@Override
|
|
public E remove() {
|
|
return queue.remove();
|
|
}
|
|
|
|
@Override
|
|
public E poll() {
|
|
return queue.poll();
|
|
}
|
|
|
|
@Override
|
|
public E element() {
|
|
return queue.element();
|
|
}
|
|
|
|
@Override
|
|
public E peek() {
|
|
return queue.peek();
|
|
}
|
|
|
|
@Override
|
|
public int size() {
|
|
return queue.size();
|
|
}
|
|
|
|
@Override
|
|
public boolean isEmpty() {
|
|
return queue.isEmpty();
|
|
}
|
|
|
|
@Override
|
|
public boolean contains(Object o) {
|
|
return queue.contains(o);
|
|
}
|
|
|
|
@Override
|
|
public Iterator<E> iterator() {
|
|
return queue.iterator();
|
|
}
|
|
|
|
@Override
|
|
public Object[] toArray() {
|
|
return queue.toArray();
|
|
}
|
|
|
|
@Override
|
|
public <T> T[] toArray(T[] a) {
|
|
return queue.toArray(a);
|
|
}
|
|
|
|
@Override
|
|
public boolean remove(Object o) {
|
|
return queue.remove(o);
|
|
}
|
|
|
|
@Override
|
|
public boolean containsAll(Collection<?> c) {
|
|
return queue.containsAll(c);
|
|
}
|
|
|
|
@Override
|
|
public boolean addAll(Collection<? extends E> c) {
|
|
if (maxCapacity >= size() + c.size()) {
|
|
return queue.addAll(c);
|
|
}
|
|
throw new IllegalStateException();
|
|
}
|
|
|
|
@Override
|
|
public boolean removeAll(Collection<?> c) {
|
|
return queue.removeAll(c);
|
|
}
|
|
|
|
@Override
|
|
public boolean retainAll(Collection<?> c) {
|
|
return queue.retainAll(c);
|
|
}
|
|
|
|
@Override
|
|
public void clear() {
|
|
queue.clear();
|
|
}
|
|
}
|