Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*******************************************************************************
* Copyright (c) 2015-2018 Skymind, Inc.
*
* This program and the accompanying materials are made available under the
* terms of the Apache License, Version 2.0 which is available at
* https://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.
*
* SPDX-License-Identifier: Apache-2.0
******************************************************************************/
package org.nd4j.linalg.cpu.nativecpu;
import lombok.extern.slf4j.Slf4j;
import org.nd4j.linalg.api.shape.LongShapeDescriptor;
import org.nd4j.linalg.primitives.Pair;
import org.nd4j.linalg.api.buffer.DataBuffer;
import org.nd4j.linalg.api.ndarray.BaseShapeInfoProvider;
import org.nd4j.linalg.api.shape.ShapeDescriptor;
import java.util.Map;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.atomic.AtomicInteger;
/**
* @author [email protected]
*/
@Slf4j
public class DirectShapeInfoProvider extends BaseShapeInfoProvider {
// TODO: to be removed
private Map> shapeCache = new ConcurrentHashMap<>();
private Map> longCache = new ConcurrentHashMap<>();
private AtomicInteger counter = new AtomicInteger(0);
private static final int MAX_ENTRIES = 1000;
@Override
public Pair createShapeInformation(int[] shape, int[] stride, long offset, int elementWiseStride, char order) {
return createShapeInformation(shape, stride, offset, elementWiseStride, order, 0L);
}
@Override
public Pair createShapeInformation(int[] shape, int[] stride, long offset, int elementWiseStride, char order, long extras) {
// We enforce offset to 0 in shapeBuffer, since we need it for cache efficiency + we don't actually use offset value @ native side
offset = 0;
ShapeDescriptor descriptor = new ShapeDescriptor(shape, stride, offset, elementWiseStride, order, extras);
if (!shapeCache.containsKey(descriptor)) {
if (counter.get() < MAX_ENTRIES) {
synchronized (this) {
if (!shapeCache.containsKey(descriptor)) {
counter.incrementAndGet();
Pair buffer =
super.createShapeInformation(shape, stride, offset, elementWiseStride, order, extras);
shapeCache.put(descriptor, buffer);
bytes.addAndGet(buffer.getFirst().length() * 4 * 2);
return buffer;
} else
return shapeCache.get(descriptor);
}
} else {
return super.createShapeInformation(shape, stride, offset, elementWiseStride, order, extras);
}
}
return shapeCache.get(descriptor);
}
@Override
public Pair createShapeInformation(long[] shape, long[] stride, long offset, long elementWiseStride, char order) {
return createShapeInformation(shape, stride, offset, elementWiseStride, order, 0L);
}
@Override
public Pair createShapeInformation(long[] shape, long[] stride, long offset, long elementWiseStride, char order, long extras) {
// We enforce offset to 0 in shapeBuffer, since we need it for cache efficiency + we don't actually use offset value @ native side
offset = 0;
LongShapeDescriptor descriptor = new LongShapeDescriptor(shape, stride, offset, elementWiseStride, order, extras);
if (!shapeCache.containsKey(descriptor)) {
if (counter.get() < MAX_ENTRIES) {
synchronized (this) {
if (!longCache.containsKey(descriptor)) {
counter.incrementAndGet();
Pair buffer = super.createShapeInformation(shape, stride, offset, elementWiseStride, order, extras);
longCache.put(descriptor, buffer);
bytes.addAndGet(buffer.getFirst().length() * 4 * 2);
return buffer;
} else
return longCache.get(descriptor);
}
} else {
return super.createShapeInformation(shape, stride, offset, elementWiseStride, order, extras);
}
}
return longCache.get(descriptor);
}
@Override
public void purgeCache() {
shapeCache = new ConcurrentHashMap<>();
}
}
