8accc52b03
Motivation: The twitter hpack project does not have the support that it used to have. See discussion here: https://github.com/netty/netty/issues/4403. Modifications: Created a new module in Netty and copied the latest from twitter hpack master. Result: Netty no longer depends on twitter hpack.
200 lines
5.8 KiB
Java
200 lines
5.8 KiB
Java
/*
|
|
* Copyright 2015 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.
|
|
*/
|
|
|
|
/*
|
|
* Copyright 2014 Twitter, Inc.
|
|
*
|
|
* Licensed 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.hpack;
|
|
|
|
import static io.netty.handler.codec.http2.hpack.HeaderField.HEADER_ENTRY_OVERHEAD;
|
|
|
|
final class DynamicTable {
|
|
|
|
// a circular queue of header fields
|
|
HeaderField[] headerFields;
|
|
int head;
|
|
int tail;
|
|
private int size;
|
|
private int capacity = -1; // ensure setCapacity creates the array
|
|
|
|
/**
|
|
* Creates a new dynamic table with the specified initial capacity.
|
|
*/
|
|
DynamicTable(int initialCapacity) {
|
|
setCapacity(initialCapacity);
|
|
}
|
|
|
|
/**
|
|
* Return the number of header fields in the dynamic table.
|
|
*/
|
|
public int length() {
|
|
int length;
|
|
if (head < tail) {
|
|
length = headerFields.length - tail + head;
|
|
} else {
|
|
length = head - tail;
|
|
}
|
|
return length;
|
|
}
|
|
|
|
/**
|
|
* Return the current size of the dynamic table. This is the sum of the size of the entries.
|
|
*/
|
|
public int size() {
|
|
return size;
|
|
}
|
|
|
|
/**
|
|
* Return the maximum allowable size of the dynamic table.
|
|
*/
|
|
public int capacity() {
|
|
return capacity;
|
|
}
|
|
|
|
/**
|
|
* Return the header field at the given index. The first and newest entry is always at index 1,
|
|
* and the oldest entry is at the index length().
|
|
*/
|
|
public HeaderField getEntry(int index) {
|
|
if (index <= 0 || index > length()) {
|
|
throw new IndexOutOfBoundsException();
|
|
}
|
|
int i = head - index;
|
|
if (i < 0) {
|
|
return headerFields[i + headerFields.length];
|
|
} else {
|
|
return headerFields[i];
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Add the header field to the dynamic table. Entries are evicted from the dynamic table until
|
|
* the size of the table and the new header field is less than or equal to the table's capacity.
|
|
* If the size of the new entry is larger than the table's capacity, the dynamic table will be
|
|
* cleared.
|
|
*/
|
|
public void add(HeaderField header) {
|
|
int headerSize = header.size();
|
|
if (headerSize > capacity) {
|
|
clear();
|
|
return;
|
|
}
|
|
while (size + headerSize > capacity) {
|
|
remove();
|
|
}
|
|
headerFields[head++] = header;
|
|
size += header.size();
|
|
if (head == headerFields.length) {
|
|
head = 0;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Remove and return the oldest header field from the dynamic table.
|
|
*/
|
|
public HeaderField remove() {
|
|
HeaderField removed = headerFields[tail];
|
|
if (removed == null) {
|
|
return null;
|
|
}
|
|
size -= removed.size();
|
|
headerFields[tail++] = null;
|
|
if (tail == headerFields.length) {
|
|
tail = 0;
|
|
}
|
|
return removed;
|
|
}
|
|
|
|
/**
|
|
* Remove all entries from the dynamic table.
|
|
*/
|
|
public void clear() {
|
|
while (tail != head) {
|
|
headerFields[tail++] = null;
|
|
if (tail == headerFields.length) {
|
|
tail = 0;
|
|
}
|
|
}
|
|
head = 0;
|
|
tail = 0;
|
|
size = 0;
|
|
}
|
|
|
|
/**
|
|
* Set the maximum size of the dynamic table. Entries are evicted from the dynamic table until
|
|
* the size of the table is less than or equal to the maximum size.
|
|
*/
|
|
public void setCapacity(int capacity) {
|
|
if (capacity < 0) {
|
|
throw new IllegalArgumentException("Illegal Capacity: " + capacity);
|
|
}
|
|
|
|
// initially capacity will be -1 so init won't return here
|
|
if (this.capacity == capacity) {
|
|
return;
|
|
}
|
|
this.capacity = capacity;
|
|
|
|
if (capacity == 0) {
|
|
clear();
|
|
} else {
|
|
// initially size will be 0 so remove won't be called
|
|
while (size > capacity) {
|
|
remove();
|
|
}
|
|
}
|
|
|
|
int maxEntries = capacity / HEADER_ENTRY_OVERHEAD;
|
|
if (capacity % HEADER_ENTRY_OVERHEAD != 0) {
|
|
maxEntries++;
|
|
}
|
|
|
|
// check if capacity change requires us to reallocate the array
|
|
if (headerFields != null && headerFields.length == maxEntries) {
|
|
return;
|
|
}
|
|
|
|
HeaderField[] tmp = new HeaderField[maxEntries];
|
|
|
|
// initially length will be 0 so there will be no copy
|
|
int len = length();
|
|
int cursor = tail;
|
|
for (int i = 0; i < len; i++) {
|
|
HeaderField entry = headerFields[cursor++];
|
|
tmp[i] = entry;
|
|
if (cursor == headerFields.length) {
|
|
cursor = 0;
|
|
}
|
|
}
|
|
|
|
this.tail = 0;
|
|
this.head = tail + len;
|
|
this.headerFields = tmp;
|
|
}
|
|
}
|