| /*========================================================================= |
| * Copyright (c) 2010-2014 Pivotal Software, Inc. All Rights Reserved. |
| * This product is protected by U.S. and international copyright |
| * and intellectual property laws. Pivotal products are covered by |
| * one or more patents listed at http://www.pivotal.io/patents. |
| *========================================================================= |
| */ |
| package com.gemstone.gemfire.internal.cache; |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| import java.util.concurrent.atomic.AtomicLongFieldUpdater; |
| import com.gemstone.gemfire.internal.util.concurrent.CustomEntryConcurrentHashMap.HashEntry; |
| // macros whose definition changes this class: |
| // disk: DISK |
| // lru: LRU |
| // stats: STATS |
| // versioned: VERSIONED |
| // offheap: OFFHEAP |
| // One of the following key macros must be defined: |
| // key object: KEY_OBJECT |
| // key int: KEY_INT |
| // key long: KEY_LONG |
| // key uuid: KEY_UUID |
| // key string1: KEY_STRING1 |
| // key string2: KEY_STRING2 |
| /** |
| * Do not modify this class. It was generated. |
| * Instead modify LeafRegionEntry.cpp and then run |
| * bin/generateRegionEntryClasses.sh from the directory |
| * that contains your build.xml. |
| */ |
| public class VMThinRegionEntryHeapStringKey2 extends VMThinRegionEntryHeap { |
| public VMThinRegionEntryHeapStringKey2 (RegionEntryContext context, String key, |
| Object value |
| , boolean byteEncode |
| ) { |
| super(context, |
| value |
| ); |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| // caller has already confirmed that key.length <= MAX_INLINE_STRING_KEY |
| long tmpBits1 = 0L; |
| long tmpBits2 = 0L; |
| if (byteEncode) { |
| for (int i=key.length()-1; i >= 0; i--) { |
| // Note: we know each byte is <= 0x7f so the "& 0xff" is not needed. But I added it in to keep findbugs happy. |
| if (i < 7) { |
| tmpBits1 |= (byte)key.charAt(i) & 0xff; |
| tmpBits1 <<= 8; |
| } else { |
| tmpBits2 <<= 8; |
| tmpBits2 |= (byte)key.charAt(i) & 0xff; |
| } |
| } |
| tmpBits1 |= 1<<6; |
| } else { |
| for (int i=key.length()-1; i >= 0; i--) { |
| if (i < 3) { |
| tmpBits1 |= key.charAt(i); |
| tmpBits1 <<= 16; |
| } else { |
| tmpBits2 <<= 16; |
| tmpBits2 |= key.charAt(i); |
| } |
| } |
| } |
| tmpBits1 |= key.length(); |
| this.bits1 = tmpBits1; |
| this.bits2 = tmpBits2; |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| // common code |
| protected int hash; |
| private HashEntry<Object, Object> next; |
| @SuppressWarnings("unused") |
| private volatile long lastModified; |
| private static final AtomicLongFieldUpdater<VMThinRegionEntryHeapStringKey2> lastModifiedUpdater |
| = AtomicLongFieldUpdater.newUpdater(VMThinRegionEntryHeapStringKey2.class, "lastModified"); |
| private volatile Object value; |
| @Override |
| protected final Object getValueField() { |
| return this.value; |
| } |
| @Override |
| protected void setValueField(Object v) { |
| this.value = v; |
| } |
| protected long getlastModifiedField() { |
| return lastModifiedUpdater.get(this); |
| } |
| protected boolean compareAndSetLastModifiedField(long expectedValue, long newValue) { |
| return lastModifiedUpdater.compareAndSet(this, expectedValue, newValue); |
| } |
| /** |
| * @see HashEntry#getEntryHash() |
| */ |
| public final int getEntryHash() { |
| return this.hash; |
| } |
| protected void setEntryHash(int v) { |
| this.hash = v; |
| } |
| /** |
| * @see HashEntry#getNextEntry() |
| */ |
| public final HashEntry<Object, Object> getNextEntry() { |
| return this.next; |
| } |
| /** |
| * @see HashEntry#setNextEntry |
| */ |
| public final void setNextEntry(final HashEntry<Object, Object> n) { |
| this.next = n; |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| // key code |
| // strlen is encoded in lowest 6 bits (max strlen is 63) |
| // character encoding info is in bits 7 and 8 |
| // The other bits are used to encoded character data. |
| private final long bits1; |
| // bits2 encodes character data |
| private final long bits2; |
| private int getKeyLength() { |
| return (int) (this.bits1 & 0x003fL); |
| } |
| private int getEncoding() { |
| // 0 means encoded as char |
| // 1 means encoded as bytes that are all <= 0x7f; |
| return (int) (this.bits1 >> 6) & 0x03; |
| } |
| @Override |
| public final Object getKey() { |
| int keylen = getKeyLength(); |
| char[] chars = new char[keylen]; |
| long tmpBits1 = this.bits1; |
| long tmpBits2 = this.bits2; |
| if (getEncoding() == 1) { |
| for (int i=0; i < keylen; i++) { |
| if (i < 7) { |
| tmpBits1 >>= 8; |
| chars[i] = (char) (tmpBits1 & 0x00ff); |
| } else { |
| chars[i] = (char) (tmpBits2 & 0x00ff); |
| tmpBits2 >>= 8; |
| } |
| } |
| } else { |
| for (int i=0; i < keylen; i++) { |
| if (i < 3) { |
| tmpBits1 >>= 16; |
| chars[i] = (char) (tmpBits1 & 0x00FFff); |
| } else { |
| chars[i] = (char) (tmpBits2 & 0x00FFff); |
| tmpBits2 >>= 16; |
| } |
| } |
| } |
| return new String(chars); |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| @Override |
| public boolean isKeyEqual(Object k) { |
| if (k instanceof String) { |
| String str = (String)k; |
| int keylen = getKeyLength(); |
| if (str.length() == keylen) { |
| long tmpBits1 = this.bits1; |
| long tmpBits2 = this.bits2; |
| if (getEncoding() == 1) { |
| for (int i=0; i < keylen; i++) { |
| char c; |
| if (i < 7) { |
| tmpBits1 >>= 8; |
| c = (char) (tmpBits1 & 0x00ff); |
| } else { |
| c = (char) (tmpBits2 & 0x00ff); |
| tmpBits2 >>= 8; |
| } |
| if (str.charAt(i) != c) { |
| return false; |
| } |
| } |
| } else { |
| for (int i=0; i < keylen; i++) { |
| char c; |
| if (i < 3) { |
| tmpBits1 >>= 16; |
| c = (char) (tmpBits1 & 0x00FFff); |
| } else { |
| c = (char) (tmpBits2 & 0x00FFff); |
| tmpBits2 >>= 16; |
| } |
| if (str.charAt(i) != c) { |
| return false; |
| } |
| } |
| } |
| return true; |
| } |
| } |
| return false; |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| } |