1 /*******************************************************************************
2 * Copyright (c) 2007, 2010 Association for Decentralized Information Management
4 * All rights reserved. This program and the accompanying materials
5 * are made available under the terms of the Eclipse Public License v1.0
6 * which accompanies this distribution, and is available at
7 * http://www.eclipse.org/legal/epl-v10.html
10 * VTT Technical Research Centre of Finland - initial API and implementation
11 *******************************************************************************/
12 package org.simantics.db.impl.query;
14 import java.util.concurrent.Semaphore;
16 import org.simantics.db.common.exception.DebugException;
17 import org.simantics.db.impl.graph.ReadGraphImpl;
18 import org.simantics.db.impl.procedure.IntProcedureAdapter;
19 import org.simantics.db.procedure.ListenerBase;
21 final public class DirectPredicates extends CollectionUnaryQuery<IntProcedure> {
23 private DirectPredicates(final int resource) {
27 final static DirectPredicates entry(final QueryProcessor provider, final int r) {
29 return (DirectPredicates)provider.cache.directPredicatesMap.get(r);
33 final static void runner(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {
35 DirectPredicates entry = (DirectPredicates)provider.cache.directPredicatesMap.get(r);
38 entry = new DirectPredicates(r);
40 entry.clearResult(provider.querySupport);
41 entry.putEntry(provider);
43 provider.performForEach(graph, entry, parent, listener, procedure);
47 if(!entry.isReady()) {
49 if(!entry.isReady()) {
50 provider.registerDependencies(graph, entry, parent, listener, procedure, false);
51 entry.computeForEach(graph, provider, procedure, true);
57 provider.performForEach(graph, entry, parent, listener, procedure);
63 final public static void queryEach(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {
65 if(parent == null && listener == null) {
66 DirectPredicates entry = (DirectPredicates)provider.cache.directPredicatesMap.get(r);
67 if(entry != null && entry.isReady()) {
68 entry.performFromCache(graph, provider, procedure);
71 computeForEach(graph, r, null, procedure, false);
76 runner(graph, r, provider, parent, listener, procedure);
82 public void clearResult(QuerySupport support) {
83 // The cached result is never used
84 setResult(INVALID_RESULT);
88 public UnaryQuery<IntProcedure> getEntry(QueryProcessor provider) {
89 return provider.cache.directPredicatesMap.get(id);
93 public void putEntry(QueryProcessor provider) {
94 provider.cache.directPredicatesMap.put(id, this);
98 final public void removeEntry(QueryProcessor provider) {
99 provider.cache.directPredicatesMap.remove(id);
103 public Object computeForEach(ReadGraphImpl graph, QueryProcessor provider, IntProcedure procedure, boolean store) {
104 return computeForEach(graph, id, this, procedure, store);
107 public static Object computeForEach(ReadGraphImpl graph, int id, final DirectPredicates entry, final IntProcedure procedure, final boolean store) {
109 graph.processor.querySupport.ensureLoaded(graph, id);
111 final IntArray list = new IntArray();
113 graph.processor.querySupport.getPredicates(graph, id, new IntProcedure() {
116 public void execute(ReadGraphImpl graph, int i) {
121 public void finished(ReadGraphImpl graph) {
125 public void exception(ReadGraphImpl graph, Throwable t) {
126 if(DebugException.DEBUG) new DebugException(t).printStackTrace();
132 entry.finish(graph, graph.processor);
134 if(list.data == null) {
135 if(list.sizeOrData != IntArray.NO_DATA) procedure.execute(graph, list.sizeOrData);
137 for(int i = 0;i < list.sizeOrData ; i++) procedure.execute(graph, list.data[i]);
140 procedure.finished(graph);
147 public String toString() {
148 return "DirectPredicates[" + id + "]";
152 public void setReady() {
153 statusOrException = READY;
156 final private void finish(ReadGraphImpl graph, QueryProcessor provider) {
163 public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, IntProcedure procedure) {
167 return computeForEach(graph, provider, procedure, false);
172 public void recompute(ReadGraphImpl graph, QueryProcessor provider) {
174 final Semaphore s = new Semaphore(0);
176 computeForEach(graph, provider, new IntProcedureAdapter() {
179 public void finished(ReadGraphImpl graph) {
184 public void exception(ReadGraphImpl graph, Throwable t) {
186 new Error("Error in recompute.", t).printStackTrace();
191 while(!s.tryAcquire()) {
192 provider.resume(graph);
199 boolean isImmutable(ReadGraphImpl graph) {
200 return graph.processor.isImmutable(id);