| /* |
| * Licensed to the Apache Software Foundation (ASF) under one or more contributor license |
| * agreements. See the NOTICE file distributed with this work for additional information regarding |
| * copyright ownership. The ASF 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 org.apache.geode.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 org.apache.geode.cache.EntryEvent; |
| |
| import org.apache.geode.internal.cache.lru.EnableLRU; |
| |
| import org.apache.geode.internal.InternalStatisticsDisabledException; |
| |
| import org.apache.geode.internal.cache.lru.LRUClockNode; |
| import org.apache.geode.internal.cache.lru.NewLRUClockHand; |
| |
| import org.apache.geode.distributed.internal.membership.InternalDistributedMember; |
| import org.apache.geode.internal.cache.versions.VersionSource; |
| import org.apache.geode.internal.cache.versions.VersionStamp; |
| import org.apache.geode.internal.cache.versions.VersionTag; |
| |
| import org.apache.geode.internal.offheap.OffHeapRegionEntryHelper; |
| import org.apache.geode.internal.offheap.annotations.Released; |
| import org.apache.geode.internal.offheap.annotations.Retained; |
| import org.apache.geode.internal.offheap.annotations.Unretained; |
| |
| import org.apache.geode.internal.util.concurrent.CustomEntryConcurrentHashMap.HashEntry; |
| |
| // macros whose definition changes this class: |
| // disk: DISK |
| // lru: 1 |
| // stats: 1 |
| // versioned: 1 |
| // offheap: 1 |
| // One of the following key macros must be defined: |
| // key object: KEY_OBJECT |
| // key int: KEY_INT |
| // key long: 1 |
| // 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 |
| * ./dev-tools/generateRegionEntryClasses.sh (it must be run from the top level directory). |
| */ |
| public class VersionedStatsLRURegionEntryOffHeapLongKey |
| extends VersionedStatsLRURegionEntryOffHeap { |
| public VersionedStatsLRURegionEntryOffHeapLongKey(RegionEntryContext context, long key, |
| |
| @Retained |
| |
| Object value |
| |
| |
| |
| ) { |
| super(context, |
| |
| |
| |
| value |
| |
| ); |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| |
| |
| |
| this.key = key; |
| |
| } |
| |
| // 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<VersionedStatsLRURegionEntryOffHeapLongKey> lastModifiedUpdater = |
| AtomicLongFieldUpdater.newUpdater(VersionedStatsLRURegionEntryOffHeapLongKey.class, |
| "lastModified"); |
| |
| /** |
| * All access done using ohAddrUpdater so it is used even though the compiler can not tell it is. |
| */ |
| @SuppressWarnings("unused") |
| @Retained |
| @Released |
| private volatile long ohAddress; |
| /** |
| * I needed to add this because I wanted clear to call setValue which normally can only be called |
| * while the re is synced. But if I sync in that code it causes a lock ordering deadlock with the |
| * disk regions because they also get a rw lock in clear. Some hardware platforms do not support |
| * CAS on a long. If gemfire is run on one of those the AtomicLongFieldUpdater does a sync on the |
| * re and we will once again be deadlocked. I don't know if we support any of the hardware |
| * platforms that do not have a 64bit CAS. If we do then we can expect deadlocks on disk regions. |
| */ |
| private final static AtomicLongFieldUpdater<VersionedStatsLRURegionEntryOffHeapLongKey> ohAddrUpdater = |
| AtomicLongFieldUpdater.newUpdater(VersionedStatsLRURegionEntryOffHeapLongKey.class, |
| "ohAddress"); |
| |
| @Override |
| public Token getValueAsToken() { |
| return OffHeapRegionEntryHelper.getValueAsToken(this); |
| } |
| |
| @Override |
| protected Object getValueField() { |
| return OffHeapRegionEntryHelper._getValue(this); |
| } |
| |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| @Override |
| |
| @Unretained |
| protected void setValueField(@Unretained Object v) { |
| |
| |
| |
| OffHeapRegionEntryHelper.setValue(this, v); |
| } |
| |
| @Override |
| |
| @Retained |
| |
| public Object _getValueRetain(RegionEntryContext context, boolean decompress) { |
| return OffHeapRegionEntryHelper._getValueRetain(this, decompress, context); |
| } |
| |
| @Override |
| public long getAddress() { |
| return ohAddrUpdater.get(this); |
| } |
| |
| @Override |
| public boolean setAddress(long expectedAddr, long newAddr) { |
| return ohAddrUpdater.compareAndSet(this, expectedAddr, newAddr); |
| } |
| |
| @Override |
| |
| @Released |
| |
| public void release() { |
| OffHeapRegionEntryHelper.releaseEntry(this); |
| } |
| |
| @Override |
| public void returnToPool() { |
| // Deadcoded for now; never was working |
| // if (this instanceof VMThinRegionEntryLongKey) { |
| // factory.returnToPool((VMThinRegionEntryLongKey)this); |
| // } |
| } |
| |
| protected long getLastModifiedField() { |
| return lastModifiedUpdater.get(this); |
| } |
| |
| protected boolean compareAndSetLastModifiedField(long expectedValue, long newValue) { |
| return lastModifiedUpdater.compareAndSet(this, expectedValue, newValue); |
| } |
| |
| /** |
| * @see HashEntry#getEntryHash() |
| */ |
| public int getEntryHash() { |
| return this.hash; |
| } |
| |
| protected void setEntryHash(int v) { |
| this.hash = v; |
| } |
| |
| /** |
| * @see HashEntry#getNextEntry() |
| */ |
| public HashEntry<Object, Object> getNextEntry() { |
| return this.next; |
| } |
| |
| /** |
| * @see HashEntry#setNextEntry |
| */ |
| public 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 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 synchronized int updateEntrySize(EnableLRU capacityController, Object value) { |
| int oldSize = getEntrySize(); |
| int newSize = capacityController.entrySize(getKeyForSizing(), value); |
| setEntrySize(newSize); |
| int delta = newSize - oldSize; |
| return delta; |
| } |
| |
| public boolean testRecentlyUsed() { |
| return areAnyBitsSet(RECENTLY_USED); |
| } |
| |
| @Override |
| public void setRecentlyUsed() { |
| setBits(RECENTLY_USED); |
| } |
| |
| public void unsetRecentlyUsed() { |
| clearBits(~RECENTLY_USED); |
| } |
| |
| public boolean testEvicted() { |
| return areAnyBitsSet(EVICTED); |
| } |
| |
| public void setEvicted() { |
| setBits(EVICTED); |
| } |
| |
| public 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 void setNextLRUNode(LRUClockNode next) { |
| this.nextLRU = next; |
| } |
| |
| public LRUClockNode nextLRUNode() { |
| return this.nextLRU; |
| } |
| |
| public void setPrevLRUNode(LRUClockNode prev) { |
| this.prevLRU = prev; |
| } |
| |
| public LRUClockNode prevLRUNode() { |
| return this.prevLRU; |
| } |
| |
| public int getEntrySize() { |
| return this.size; |
| } |
| |
| protected void setEntrySize(int size) { |
| this.size = size; |
| } |
| |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| |
| @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 |
| |
| // stats code |
| @Override |
| public void updateStatsForGet(boolean hit, long time) { |
| setLastAccessed(time); |
| if (hit) { |
| incrementHitCount(); |
| } else { |
| incrementMissCount(); |
| } |
| } |
| |
| @Override |
| protected void setLastModifiedAndAccessedTimes(long lastModified, long lastAccessed) { |
| _setLastModified(lastModified); |
| if (!DISABLE_ACCESS_TIME_UPDATE_ON_PUT) { |
| setLastAccessed(lastAccessed); |
| } |
| } |
| |
| private volatile long lastAccessed; |
| private volatile int hitCount; |
| private volatile int missCount; |
| |
| private static final AtomicIntegerFieldUpdater<VersionedStatsLRURegionEntryOffHeapLongKey> hitCountUpdater = |
| AtomicIntegerFieldUpdater.newUpdater(VersionedStatsLRURegionEntryOffHeapLongKey.class, |
| "hitCount"); |
| private static final AtomicIntegerFieldUpdater<VersionedStatsLRURegionEntryOffHeapLongKey> missCountUpdater = |
| AtomicIntegerFieldUpdater.newUpdater(VersionedStatsLRURegionEntryOffHeapLongKey.class, |
| "missCount"); |
| |
| @Override |
| public long getLastAccessed() throws InternalStatisticsDisabledException { |
| return this.lastAccessed; |
| } |
| |
| private void setLastAccessed(long lastAccessed) { |
| this.lastAccessed = lastAccessed; |
| } |
| |
| @Override |
| public long getHitCount() throws InternalStatisticsDisabledException { |
| return this.hitCount & 0xFFFFFFFFL; |
| } |
| |
| @Override |
| public long getMissCount() throws InternalStatisticsDisabledException { |
| return this.missCount & 0xFFFFFFFFL; |
| } |
| |
| private void incrementHitCount() { |
| hitCountUpdater.incrementAndGet(this); |
| } |
| |
| private void incrementMissCount() { |
| missCountUpdater.incrementAndGet(this); |
| } |
| |
| @Override |
| public void resetCounts() throws InternalStatisticsDisabledException { |
| hitCountUpdater.set(this, 0); |
| missCountUpdater.set(this, 0); |
| } |
| |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| |
| @Override |
| public void txDidDestroy(long currTime) { |
| setLastModified(currTime); |
| setLastAccessed(currTime); |
| this.hitCount = 0; |
| this.missCount = 0; |
| } |
| |
| @Override |
| public boolean hasStats() { |
| return true; |
| } |
| |
| |
| |
| // 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 key; |
| |
| @Override |
| public Object getKey() { |
| return this.key; |
| } |
| |
| @Override |
| public boolean isKeyEqual(Object k) { |
| if (k instanceof Long) { |
| return ((Long) k).longValue() == this.key; |
| } |
| return false; |
| } |
| |
| |
| // DO NOT modify this class. It was generated from LeafRegionEntry.cpp |
| } |
| |