Apache
/
activemq-artemis
mirror of https://github.com/apache/activemq-artemis.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

This closes #2984

This commit is contained in:
Clebert Suconic 2020-03-17 16:30:12 -04:00
parent 04572f9915 a5bd0065a9
commit d5104656f9
3 changed files with 12 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
artemis-protocols/artemis-amqp-protocol/src/main/java/org/apache/activemq/artemis/protocol/amqp/broker/AMQPMessage.java
View File

@ -44,7 +44,6 @@ import org.apache.activemq.artemis.protocol.amqp.util.NettyWritable;
import org.apache.activemq.artemis.protocol.amqp.util.TLSEncode; import org.apache.activemq.artemis.protocol.amqp.util.TLSEncode;
import org.apache.activemq.artemis.reader.MessageUtil; import org.apache.activemq.artemis.reader.MessageUtil;
import org.apache.activemq.artemis.utils.ByteUtil; import org.apache.activemq.artemis.utils.ByteUtil;
import org.apache.activemq.artemis.utils.algo.KMPNeedle;
import org.apache.activemq.artemis.utils.collections.TypedProperties; import org.apache.activemq.artemis.utils.collections.TypedProperties;
import org.apache.qpid.proton.amqp.Binary; import org.apache.qpid.proton.amqp.Binary;
import org.apache.qpid.proton.amqp.Symbol; import org.apache.qpid.proton.amqp.Symbol;

3
artemis-protocols/artemis-amqp-protocol/src/main/java/org/apache/activemq/artemis/protocol/amqp/broker/AMQPMessageSymbolSearch.java
View File

@ -22,7 +22,6 @@ import java.util.IdentityHashMap;
import java.util.List; import java.util.List;
import org.apache.activemq.artemis.protocol.amqp.util.TLSEncode; import org.apache.activemq.artemis.protocol.amqp.util.TLSEncode;
import org.apache.activemq.artemis.utils.algo.KMPNeedle;
import org.apache.qpid.proton.amqp.Symbol; import org.apache.qpid.proton.amqp.Symbol;
import org.apache.qpid.proton.amqp.messaging.AmqpSequence; import org.apache.qpid.proton.amqp.messaging.AmqpSequence;
import org.apache.qpid.proton.amqp.messaging.AmqpValue; import org.apache.qpid.proton.amqp.messaging.AmqpValue;
@ -67,7 +66,7 @@ final class AMQPMessageSymbolSearch {
constructor.skipValue(); constructor.skipValue();
final int end = data.position(); final int end = data.position();
for (int i = 0, count = needles.length; i < count; i++) { for (int i = 0, count = needles.length; i < count; i++) {
final int foundIndex = needles[i].searchInto(ReadableBuffer::get, data, end, start); final int foundIndex = needles[i].searchInto(data, start, end);
if (foundIndex != -1) { if (foundIndex != -1) {
return true; return true;
} }

24
artemis-commons/src/main/java/org/apache/activemq/artemis/utils/algo/KMPNeedle.java → artemis-protocols/artemis-amqp-protocol/src/main/java/org/apache/activemq/artemis/protocol/amqp/broker/KMPNeedle.java
View File

@ -14,21 +14,17 @@
* See the License for the specific language governing permissions and * See the License for the specific language governing permissions and
* limitations under the License. * limitations under the License.
*/ */
package org.apache.activemq.artemis.utils.algo; package org.apache.activemq.artemis.protocol.amqp.broker;
import java.util.Objects; import java.util.Objects;
import org.apache.qpid.proton.codec.ReadableBuffer;
/** /**
* Abstraction of {@code byte[] }<a href="https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm">Knuth-Morris-Pratt</a>'s needle to be used * Abstraction of {@code byte[] }<a href="https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm">Knuth-Morris-Pratt</a>'s needle to be used
* to perform pattern matching over indexed haystack of {@code byte}s. * to perform pattern matching over {@link ReadableBuffer}.
*/ */
public final class KMPNeedle { final class KMPNeedle {
@FunctionalInterface
public interface IndexedByteSupplier<S> {
byte get(S source, int index);
}
private final int[] jumpTable; private final int[] jumpTable;
private final byte[] needle; private final byte[] needle;
@ -66,8 +62,10 @@ public final class KMPNeedle {
* This version differ from the original algorithm, because allows to fail fast (and faster) if * This version differ from the original algorithm, because allows to fail fast (and faster) if
* the remaining haystack to be processed is < of the remaining needle to be matched. * the remaining haystack to be processed is < of the remaining needle to be matched.
*/ */
public <H> int searchInto(IndexedByteSupplier<? super H> haystackReader, H haystack, int end, int start) { public int searchInto(ReadableBuffer haystack, int start, int end) {
assert end >= 0 && start >= 0 && end >= start; if (end < 0 || start < 0 || end < start) {
return -1;
}
final int length = end - start; final int length = end - start;
int j = 0; int j = 0;
final int needleLength = needle.length; final int needleLength = needle.length;
@ -78,7 +76,7 @@ public final class KMPNeedle {
return -1; return -1;
} }
final int index = start + i; final int index = start + i;
final byte value = haystackReader.get(haystack, index); final byte value = haystack.get(index);
while (j > 0 && needle[j] != value) { while (j > 0 && needle[j] != value) {
j = jumpTable == null ? 0 : jumpTable[j]; j = jumpTable == null ? 0 : jumpTable[j];
remainingNeedle = needleLength - j; remainingNeedle = needleLength - j;
@ -99,5 +97,5 @@ public final class KMPNeedle {
public static KMPNeedle of(byte[] needle) { public static KMPNeedle of(byte[] needle) {
return new KMPNeedle(needle); return new KMPNeedle(needle);
} }
} }