| /*========================================================================= |
| * 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.AtomicIntegerFieldUpdater; |
| import java.util.concurrent.atomic.AtomicLongFieldUpdater; |
| import com.gemstone.gemfire.cache.EntryEvent; |
| import com.gemstone.gemfire.internal.cache.lru.EnableLRU; |
| import com.gemstone.gemfire.internal.cache.lru.LRUClockNode; |
| import com.gemstone.gemfire.internal.cache.lru.NewLRUClockHand; |
| import com.gemstone.gemfire.distributed.internal.membership.InternalDistributedMember; |
| import com.gemstone.gemfire.internal.cache.versions.VersionSource; |
| import com.gemstone.gemfire.internal.cache.versions.VersionStamp; |
| import com.gemstone.gemfire.internal.cache.versions.VersionTag; |
| 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 VersionedThinLRURegionEntryHeapStringKey1 extends VersionedThinLRURegionEntryHeap { |
| public VersionedThinLRURegionEntryHeapStringKey1 (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; |
| 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. |
| tmpBits1 |= (byte)key.charAt(i) & 0xff; |
| tmpBits1 <<= 8; |
| } |
| tmpBits1 |= 1<<6; |
| } else { |
| for (int i=key.length()-1; i >= 0; i--) { |
| tmpBits1 |= key.charAt(i); |
| tmpBits1 <<= 16; |
| } |
| } |
| tmpBits1 |= key.length(); |
| this.bits1 = tmpBits1; |
| } |
| // 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<VersionedThinLRURegionEntryHeapStringKey1> lastModifiedUpdater |
| = AtomicLongFieldUpdater.newUpdater(VersionedThinLRURegionEntryHeapStringKey1.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 |
| // lru code |
| @Override |
| public void setDelayedDiskId(LocalRegion r) { |
| // nothing needed for LRUs with no disk |
| } |
| public final synchronized int updateEntrySize(EnableLRU capacityController) { |
| return updateEntrySize(capacityController, _getValue()); // OFHEAP: _getValue ok w/o incing refcount because we are synced and only getting the size |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| public final synchronized int updateEntrySize(EnableLRU capacityController, |
| Object value) { |
| int oldSize = getEntrySize(); |
| int newSize = capacityController.entrySize( getKeyForSizing(), value); |
| setEntrySize(newSize); |
| int delta = newSize - oldSize; |
| // if ( debug ) log( "updateEntrySize key=" + getKey() |
| // + (_getValue() == Token.INVALID ? " invalid" : |
| // (_getValue() == Token.LOCAL_INVALID ? "local_invalid" : |
| // (_getValue()==null ? " evicted" : " valid"))) |
| // + " oldSize=" + oldSize |
| // + " newSize=" + this.size ); |
| return delta; |
| } |
| public final boolean testRecentlyUsed() { |
| return areAnyBitsSet(RECENTLY_USED); |
| } |
| @Override |
| public final void setRecentlyUsed() { |
| setBits(RECENTLY_USED); |
| } |
| public final void unsetRecentlyUsed() { |
| clearBits(~RECENTLY_USED); |
| } |
| public final boolean testEvicted() { |
| return areAnyBitsSet(EVICTED); |
| } |
| public final void setEvicted() { |
| setBits(EVICTED); |
| } |
| public final void unsetEvicted() { |
| clearBits(~EVICTED); |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| private LRUClockNode nextLRU; |
| private LRUClockNode prevLRU; |
| private int size; |
| public final void setNextLRUNode( LRUClockNode next ) { |
| this.nextLRU = next; |
| } |
| public final LRUClockNode nextLRUNode() { |
| return this.nextLRU; |
| } |
| public final void setPrevLRUNode( LRUClockNode prev ) { |
| this.prevLRU = prev; |
| } |
| public final LRUClockNode prevLRUNode() { |
| return this.prevLRU; |
| } |
| public final int getEntrySize() { |
| return this.size; |
| } |
| protected final void setEntrySize(int size) { |
| this.size = size; |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| //@Override |
| //public StringBuilder appendFieldsToString(final StringBuilder sb) { |
| // StringBuilder result = super.appendFieldsToString(sb); |
| // result.append("; prev=").append(this.prevLRU==null?"null":"not null"); |
| // result.append("; next=").append(this.nextLRU==null?"null":"not null"); |
| // return result; |
| //} |
| @Override |
| public Object getKeyForSizing() { |
| // inline keys always report null for sizing since the size comes from the entry size |
| return null; |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| // versioned code |
| private VersionSource memberID; |
| private short entryVersionLowBytes; |
| private short regionVersionHighBytes; |
| private int regionVersionLowBytes; |
| private byte entryVersionHighByte; |
| private byte distributedSystemId; |
| public int getEntryVersion() { |
| return ((entryVersionHighByte << 16) & 0xFF0000) | (entryVersionLowBytes & 0xFFFF); |
| } |
| public long getRegionVersion() { |
| return (((long)regionVersionHighBytes) << 32) | (regionVersionLowBytes & 0x00000000FFFFFFFFL); |
| } |
| public long getVersionTimeStamp() { |
| return getLastModified(); |
| } |
| public void setVersionTimeStamp(long time) { |
| setLastModified(time); |
| } |
| public VersionSource getMemberID() { |
| return this.memberID; |
| } |
| public int getDistributedSystemId() { |
| return this.distributedSystemId; |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| public void setVersions(VersionTag tag) { |
| this.memberID = tag.getMemberID(); |
| int eVersion = tag.getEntryVersion(); |
| this.entryVersionLowBytes = (short)(eVersion & 0xffff); |
| this.entryVersionHighByte = (byte)((eVersion & 0xff0000) >> 16); |
| this.regionVersionHighBytes = tag.getRegionVersionHighBytes(); |
| this.regionVersionLowBytes = tag.getRegionVersionLowBytes(); |
| if (!(tag.isGatewayTag()) && this.distributedSystemId == tag.getDistributedSystemId()) { |
| if (getVersionTimeStamp() <= tag.getVersionTimeStamp()) { |
| setVersionTimeStamp(tag.getVersionTimeStamp()); |
| } else { |
| tag.setVersionTimeStamp(getVersionTimeStamp()); |
| } |
| } else { |
| setVersionTimeStamp(tag.getVersionTimeStamp()); |
| } |
| this.distributedSystemId = (byte)(tag.getDistributedSystemId() & 0xff); |
| } |
| public void setMemberID(VersionSource memberID) { |
| this.memberID = memberID; |
| } |
| @Override |
| public VersionStamp getVersionStamp() { |
| return this; |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| public VersionTag asVersionTag() { |
| VersionTag tag = VersionTag.create(memberID); |
| tag.setEntryVersion(getEntryVersion()); |
| tag.setRegionVersion(this.regionVersionHighBytes, this.regionVersionLowBytes); |
| tag.setVersionTimeStamp(getVersionTimeStamp()); |
| tag.setDistributedSystemId(this.distributedSystemId); |
| return tag; |
| } |
| public void processVersionTag(LocalRegion r, VersionTag tag, |
| boolean isTombstoneFromGII, boolean hasDelta, |
| VersionSource thisVM, InternalDistributedMember sender, boolean checkForConflicts) { |
| basicProcessVersionTag(r, tag, isTombstoneFromGII, hasDelta, thisVM, sender, checkForConflicts); |
| } |
| @Override |
| public void processVersionTag(EntryEvent cacheEvent) { |
| // this keeps Eclipse happy. without it the sender chain becomes confused |
| // while browsing this code |
| super.processVersionTag(cacheEvent); |
| } |
| /** get rvv internal high byte. Used by region entries for transferring to storage */ |
| public short getRegionVersionHighBytes() { |
| return this.regionVersionHighBytes; |
| } |
| /** get rvv internal low bytes. Used by region entries for transferring to storage */ |
| public int getRegionVersionLowBytes() { |
| return this.regionVersionLowBytes; |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| // key code |
| private final long bits1; |
| 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; |
| if (getEncoding() == 1) { |
| for (int i=0; i < keylen; i++) { |
| tmpBits1 >>= 8; |
| chars[i] = (char) (tmpBits1 & 0x00ff); |
| } |
| } else { |
| for (int i=0; i < keylen; i++) { |
| tmpBits1 >>= 16; |
| chars[i] = (char) (tmpBits1 & 0x00FFff); |
| } |
| } |
| 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; |
| if (getEncoding() == 1) { |
| for (int i=0; i < keylen; i++) { |
| tmpBits1 >>= 8; |
| char c = (char) (tmpBits1 & 0x00ff); |
| if (str.charAt(i) != c) { |
| return false; |
| } |
| } |
| } else { |
| for (int i=0; i < keylen; i++) { |
| tmpBits1 >>= 16; |
| char c = (char) (tmpBits1 & 0x00FFff); |
| if (str.charAt(i) != c) { |
| return false; |
| } |
| } |
| } |
| return true; |
| } |
| } |
| return false; |
| } |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| } |