-/*******************************************************************************\r
- * Copyright (c) 2007, 2010 Association for Decentralized Information Management\r
- * in Industry THTH ry.\r
- * All rights reserved. This program and the accompanying materials\r
- * are made available under the terms of the Eclipse Public License v1.0\r
- * which accompanies this distribution, and is available at\r
- * http://www.eclipse.org/legal/epl-v10.html\r
- *\r
- * Contributors:\r
- * VTT Technical Research Centre of Finland - initial API and implementation\r
- *******************************************************************************/\r
-package org.simantics.db.impl.query;\r
-\r
-import gnu.trove.procedure.TIntProcedure;\r
-import gnu.trove.set.hash.TIntHashSet;\r
-\r
-import java.util.concurrent.Semaphore;\r
-import java.util.concurrent.atomic.AtomicInteger;\r
-\r
-import org.simantics.db.impl.graph.ReadGraphImpl;\r
-import org.simantics.db.impl.procedure.InternalProcedure;\r
-import org.simantics.db.procedure.ListenerBase;\r
-\r
-final public class SuperRelations extends UnaryQuery<InternalProcedure<IntSet>> {\r
- \r
-// public ArrayList<InternalProcedure<IntSet>> procs = null;\r
- \r
- private SuperRelations(final int resource) {\r
- super(resource);\r
- }\r
- \r
- final static SuperRelations entry(final QueryProcessor provider, final int r) {\r
- \r
- return (SuperRelations)provider.superRelationsMap.get(r);\r
-\r
- }\r
-\r
- final static IntSet runner(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final InternalProcedure<IntSet> procedure) {\r
-\r
- SuperRelations entry = (SuperRelations)provider.superRelationsMap.get(r);\r
- if(entry == null) {\r
-\r
- entry = new SuperRelations(r);\r
- entry.setPending();\r
- entry.clearResult(provider.querySupport);\r
- entry.putEntry(provider);\r
- \r
- return (IntSet)provider.performForEach(graph, entry, parent, listener, procedure);\r
- \r
- } else {\r
- \r
- if(!entry.isReady()) {\r
- throw new IllegalStateException();\r
- }\r
- return (IntSet)provider.performForEach(graph, entry, parent, listener, procedure);\r
- \r
- }\r
-\r
- }\r
- \r
- final static IntSet runner2(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final InternalProcedure<IntSet> procedure) throws Throwable {\r
-\r
- SuperRelations entry = (SuperRelations)provider.superRelationsMap.get(r);\r
- if(entry == null) {\r
-\r
- entry = new SuperRelations(r);\r
- entry.setPending();\r
- entry.clearResult(provider.querySupport);\r
- entry.putEntry(provider);\r
- \r
- return (IntSet)provider.performForEach2(graph, entry, parent, listener, procedure);\r
- \r
- } else {\r
- \r
- if(!entry.isReady()) {\r
- throw new IllegalStateException();\r
- }\r
- return (IntSet)provider.performForEach2(graph, entry, parent, listener, procedure);\r
- \r
- }\r
-\r
- } \r
- \r
- final public static void queryEach(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final InternalProcedure<IntSet> procedure) {\r
-\r
- if(parent == null && listener == null) {\r
- SuperRelations entry = (SuperRelations)provider.superRelationsMap.get(r);\r
- if(entry != null && entry.isReady()) {\r
- entry.performFromCache(graph, provider, procedure);\r
- return;\r
- }\r
- }\r
- \r
- runner(graph, r, provider, parent, listener, procedure);\r
- \r
- }\r
-\r
- final public static IntSet queryEach2(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final InternalProcedure<IntSet> procedure) throws Throwable {\r
-\r
- if(parent == null && listener == null) {\r
- SuperRelations entry = (SuperRelations)provider.superRelationsMap.get(r);\r
- if(entry != null && entry.isReady()) {\r
- return (IntSet)entry.get(graph, provider, procedure);\r
- }\r
- }\r
- \r
- return runner2(graph, r, provider, parent, listener, procedure);\r
- \r
- }\r
- \r
- @Override\r
- public UnaryQuery<InternalProcedure<IntSet>> getEntry(QueryProcessor provider) {\r
- return provider.superRelationsMap.get(id);\r
- }\r
- \r
- @Override\r
- public void putEntry(QueryProcessor provider) {\r
- provider.superRelationsMap.put(id, this);\r
- }\r
-\r
- @Override\r
- final public void removeEntry(QueryProcessor provider) {\r
- provider.superRelationsMap.remove(id);\r
- }\r
- \r
- static int histoCounter = 0;\r
- static IntSet EMPTY_SET = new IntSet();\r
- static int counter = 0;\r
- \r
- class Koss {\r
- \r
- private TIntHashSet set = null;\r
- public int single = 0;\r
- \r
- public boolean add(int val) {\r
- if(single == val) return false;\r
- if(single == 0) {\r
- single = val;\r
- return true;\r
- }\r
- if(set == null) set = new TIntHashSet(4);\r
- return set.add(val);\r
- }\r
- \r
- public int size() {\r
- \r
- if(single == 0) return 0;\r
- if(set == null) return 1;\r
- return set.size() + 1;\r
- \r
- }\r
-\r
- public void forEach(TIntProcedure proc) {\r
- if(single > 0) proc.execute(single);\r
- if(set != null) set.forEach(proc);\r
- }\r
- \r
- }\r
-\r
- @Override\r
- public Object computeForEach(final ReadGraphImpl graph, final QueryProcessor provider, final InternalProcedure<IntSet> procedure, final boolean store) {\r
-\r
- provider.querySupport.ensureLoaded(graph, id);\r
- \r
- final InternalProcedure<IntSet> proc = (InternalProcedure<IntSet>)procedure;\r
-\r
- final int subrelationOf = provider.getSubrelationOf();\r
-\r
- final IntSet result = new IntSet(provider.querySupport);\r
-\r
- final class DirectProcedure extends Koss implements IntProcedure, TIntProcedure, InternalProcedure<IntSet> {\r
- @Override\r
- final public boolean execute(int r) {\r
- result.add(r);\r
- return true;\r
- }\r
- @Override\r
- final public void execute(ReadGraphImpl graph, int r) {\r
- if(single == 0) {\r
- single = r;\r
- return;\r
- }\r
- add(r);\r
- }\r
- @Override\r
- final public void execute(ReadGraphImpl graph, IntSet set) {\r
- set.forEach(this);\r
- addOrSet(graph, result, provider);\r
- proc.execute(graph, result);\r
- }\r
- @Override\r
- public void finished(ReadGraphImpl graph) {\r
- }\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
- throw new Error("Errors are not supported.", t);\r
- }\r
-\r
- }\r
-\r
- final DirectProcedure directProc = new DirectProcedure();\r
-\r
- provider.querySupport.getObjects(graph, id, subrelationOf, directProc);\r
-\r
- int size = directProc.size();\r
-\r
- if(size == 0) {\r
-\r
- addOrSet(graph, EMPTY_SET, provider);\r
- proc.execute(graph, EMPTY_SET);\r
-\r
- } else if (size == 1) {\r
-\r
- result.add(directProc.single);\r
- SuperRelations.queryEach(graph, directProc.single, provider, SuperRelations.this, null, directProc);\r
-\r
- } else {\r
-\r
- // if((counter++ % 500) == 0) System.out.println("SR " + counter);\r
-\r
- final TIntProcedure addToResult = new TIntProcedure() {\r
- @Override\r
- public boolean execute(int r) {\r
- synchronized(result) {\r
- result.add(r);\r
- }\r
- return true;\r
- }\r
- };\r
-\r
- final AtomicInteger finishes = new AtomicInteger(0);\r
-\r
- directProc.forEach(new TIntProcedure() {\r
-\r
- @Override\r
- public boolean execute(int arg0) {\r
-\r
- synchronized(result) {\r
- result.add(arg0);\r
- }\r
-\r
- SuperRelations.queryEach(graph, arg0, provider, SuperRelations.this, null, new InternalProcedure<IntSet>() {\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph, IntSet set) {\r
- set.forEach(addToResult);\r
- int current = finishes.addAndGet(1);\r
- if(current == directProc.size()) {\r
- addOrSet(graph, result, provider);\r
- proc.execute(graph, result);\r
- return; \r
- }\r
- }\r
-\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
- proc.exception(graph, t);\r
- }\r
-\r
- });\r
-\r
- return true;\r
-\r
- }\r
-\r
- });\r
-\r
- }\r
- \r
- return result;\r
- \r
- }\r
- \r
- @Override\r
- public String toString() {\r
- return "SuperRelations[" + id + "]";\r
- }\r
-\r
- private void addOrSet(ReadGraphImpl graph, final IntSet value, QueryProcessor provider) {\r
-\r
- assert(!isReady());\r
-\r
-// ArrayList<InternalProcedure<IntSet>> p = null;\r
-\r
- synchronized(this) {\r
- \r
- value.trim();\r
- setResult(value);\r
- setReady();\r
-// p = procs;\r
-// procs = null; \r
- \r
- }\r
-\r
-// if(p != null) {\r
-// IntSet v = (IntSet)getResult();\r
-// if(v != null) {\r
-// for(InternalProcedure<IntSet> proc : p) proc.execute(graph, v);\r
-// }\r
-// }\r
- \r
- }\r
- \r
- @Override\r
- public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, InternalProcedure<IntSet> procedure) {\r
- \r
- assert(isReady());\r
-\r
- if(handleException(graph, procedure)) return null;\r
- \r
- IntSet result = getResult();\r
- \r
- procedure.execute(graph, result);\r
- \r
- return result;\r
- \r
- }\r
-\r
- @Override\r
- public void recompute(ReadGraphImpl graph, QueryProcessor provider) {\r
- \r
- final Semaphore s = new Semaphore(0);\r
-\r
- computeForEach(graph, provider, new InternalProcedure<IntSet>() {\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph, IntSet result) {\r
- s.release();\r
- }\r
-\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
- s.release();\r
- new Error("Error in recompute.", t).printStackTrace();\r
- }\r
-\r
- }, true);\r
-\r
- while(!s.tryAcquire()) {\r
- provider.resume(graph);\r
- }\r
- \r
- }\r
- \r
-\r
- @Override\r
- boolean isImmutable(ReadGraphImpl graph) {\r
- return graph.processor.isImmutable(id);\r
- }\r
- \r
-}\r
+/*******************************************************************************
+ * Copyright (c) 2007, 2010 Association for Decentralized Information Management
+ * in Industry THTH ry.
+ * All rights reserved. This program and the accompanying materials
+ * are made available under the terms of the Eclipse Public License v1.0
+ * which accompanies this distribution, and is available at
+ * http://www.eclipse.org/legal/epl-v10.html
+ *
+ * Contributors:
+ * VTT Technical Research Centre of Finland - initial API and implementation
+ *******************************************************************************/
+package org.simantics.db.impl.query;
+
+import gnu.trove.procedure.TIntProcedure;
+import gnu.trove.set.hash.TIntHashSet;
+
+import java.util.concurrent.Semaphore;
+import java.util.concurrent.atomic.AtomicInteger;
+
+import org.simantics.db.impl.graph.ReadGraphImpl;
+import org.simantics.db.impl.procedure.InternalProcedure;
+import org.simantics.db.procedure.ListenerBase;
+
+final public class SuperRelations extends UnaryQuery<InternalProcedure<IntSet>> {
+
+// public ArrayList<InternalProcedure<IntSet>> procs = null;
+
+ private SuperRelations(final int resource) {
+ super(resource);
+ }
+
+ final static SuperRelations entry(final QueryProcessor provider, final int r) {
+
+ return (SuperRelations)provider.superRelationsMap.get(r);
+
+ }
+
+ final static IntSet runner(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final InternalProcedure<IntSet> procedure) {
+
+ SuperRelations entry = (SuperRelations)provider.superRelationsMap.get(r);
+ if(entry == null) {
+
+ entry = new SuperRelations(r);
+ entry.setPending();
+ entry.clearResult(provider.querySupport);
+ entry.putEntry(provider);
+
+ return (IntSet)provider.performForEach(graph, entry, parent, listener, procedure);
+
+ } else {
+
+ if(!entry.isReady()) {
+ throw new IllegalStateException();
+ }
+ return (IntSet)provider.performForEach(graph, entry, parent, listener, procedure);
+
+ }
+
+ }
+
+ final static IntSet runner2(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final InternalProcedure<IntSet> procedure) throws Throwable {
+
+ SuperRelations entry = (SuperRelations)provider.superRelationsMap.get(r);
+ if(entry == null) {
+
+ entry = new SuperRelations(r);
+ entry.setPending();
+ entry.clearResult(provider.querySupport);
+ entry.putEntry(provider);
+
+ return (IntSet)provider.performForEach2(graph, entry, parent, listener, procedure);
+
+ } else {
+
+ if(!entry.isReady()) {
+ throw new IllegalStateException();
+ }
+ return (IntSet)provider.performForEach2(graph, entry, parent, listener, procedure);
+
+ }
+
+ }
+
+ final public static void queryEach(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final InternalProcedure<IntSet> procedure) {
+
+ if(parent == null && listener == null) {
+ SuperRelations entry = (SuperRelations)provider.superRelationsMap.get(r);
+ if(entry != null && entry.isReady()) {
+ entry.performFromCache(graph, provider, procedure);
+ return;
+ }
+ }
+
+ runner(graph, r, provider, parent, listener, procedure);
+
+ }
+
+ final public static IntSet queryEach2(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final InternalProcedure<IntSet> procedure) throws Throwable {
+
+ if(parent == null && listener == null) {
+ SuperRelations entry = (SuperRelations)provider.superRelationsMap.get(r);
+ if(entry != null && entry.isReady()) {
+ return (IntSet)entry.get(graph, provider, procedure);
+ }
+ }
+
+ return runner2(graph, r, provider, parent, listener, procedure);
+
+ }
+
+ @Override
+ public UnaryQuery<InternalProcedure<IntSet>> getEntry(QueryProcessor provider) {
+ return provider.superRelationsMap.get(id);
+ }
+
+ @Override
+ public void putEntry(QueryProcessor provider) {
+ provider.superRelationsMap.put(id, this);
+ }
+
+ @Override
+ final public void removeEntry(QueryProcessor provider) {
+ provider.superRelationsMap.remove(id);
+ }
+
+ static int histoCounter = 0;
+ static IntSet EMPTY_SET = new IntSet();
+ static int counter = 0;
+
+ class Koss {
+
+ private TIntHashSet set = null;
+ public int single = 0;
+
+ public boolean add(int val) {
+ if(single == val) return false;
+ if(single == 0) {
+ single = val;
+ return true;
+ }
+ if(set == null) set = new TIntHashSet(4);
+ return set.add(val);
+ }
+
+ public int size() {
+
+ if(single == 0) return 0;
+ if(set == null) return 1;
+ return set.size() + 1;
+
+ }
+
+ public void forEach(TIntProcedure proc) {
+ if(single > 0) proc.execute(single);
+ if(set != null) set.forEach(proc);
+ }
+
+ }
+
+ @Override
+ public Object computeForEach(final ReadGraphImpl graph, final QueryProcessor provider, final InternalProcedure<IntSet> procedure, final boolean store) {
+
+ provider.querySupport.ensureLoaded(graph, id);
+
+ final InternalProcedure<IntSet> proc = (InternalProcedure<IntSet>)procedure;
+
+ final int subrelationOf = provider.getSubrelationOf();
+
+ final IntSet result = new IntSet(provider.querySupport);
+
+ final class DirectProcedure extends Koss implements IntProcedure, TIntProcedure, InternalProcedure<IntSet> {
+ @Override
+ final public boolean execute(int r) {
+ result.add(r);
+ return true;
+ }
+ @Override
+ final public void execute(ReadGraphImpl graph, int r) {
+ if(single == 0) {
+ single = r;
+ return;
+ }
+ add(r);
+ }
+ @Override
+ final public void execute(ReadGraphImpl graph, IntSet set) {
+ set.forEach(this);
+ addOrSet(graph, result, provider);
+ proc.execute(graph, result);
+ }
+ @Override
+ public void finished(ReadGraphImpl graph) {
+ }
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable t) {
+ throw new Error("Errors are not supported.", t);
+ }
+
+ }
+
+ final DirectProcedure directProc = new DirectProcedure();
+
+ provider.querySupport.getObjects(graph, id, subrelationOf, directProc);
+
+ int size = directProc.size();
+
+ if(size == 0) {
+
+ addOrSet(graph, EMPTY_SET, provider);
+ proc.execute(graph, EMPTY_SET);
+
+ } else if (size == 1) {
+
+ result.add(directProc.single);
+ SuperRelations.queryEach(graph, directProc.single, provider, SuperRelations.this, null, directProc);
+
+ } else {
+
+ // if((counter++ % 500) == 0) System.out.println("SR " + counter);
+
+ final TIntProcedure addToResult = new TIntProcedure() {
+ @Override
+ public boolean execute(int r) {
+ synchronized(result) {
+ result.add(r);
+ }
+ return true;
+ }
+ };
+
+ final AtomicInteger finishes = new AtomicInteger(0);
+
+ directProc.forEach(new TIntProcedure() {
+
+ @Override
+ public boolean execute(int arg0) {
+
+ synchronized(result) {
+ result.add(arg0);
+ }
+
+ SuperRelations.queryEach(graph, arg0, provider, SuperRelations.this, null, new InternalProcedure<IntSet>() {
+
+ @Override
+ public void execute(ReadGraphImpl graph, IntSet set) {
+ set.forEach(addToResult);
+ int current = finishes.addAndGet(1);
+ if(current == directProc.size()) {
+ addOrSet(graph, result, provider);
+ proc.execute(graph, result);
+ return;
+ }
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable t) {
+ proc.exception(graph, t);
+ }
+
+ });
+
+ return true;
+
+ }
+
+ });
+
+ }
+
+ return result;
+
+ }
+
+ @Override
+ public String toString() {
+ return "SuperRelations[" + id + "]";
+ }
+
+ private void addOrSet(ReadGraphImpl graph, final IntSet value, QueryProcessor provider) {
+
+ assert(!isReady());
+
+// ArrayList<InternalProcedure<IntSet>> p = null;
+
+ synchronized(this) {
+
+ value.trim();
+ setResult(value);
+ setReady();
+// p = procs;
+// procs = null;
+
+ }
+
+// if(p != null) {
+// IntSet v = (IntSet)getResult();
+// if(v != null) {
+// for(InternalProcedure<IntSet> proc : p) proc.execute(graph, v);
+// }
+// }
+
+ }
+
+ @Override
+ public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, InternalProcedure<IntSet> procedure) {
+
+ assert(isReady());
+
+ if(handleException(graph, procedure)) return null;
+
+ IntSet result = getResult();
+
+ procedure.execute(graph, result);
+
+ return result;
+
+ }
+
+ @Override
+ public void recompute(ReadGraphImpl graph, QueryProcessor provider) {
+
+ final Semaphore s = new Semaphore(0);
+
+ computeForEach(graph, provider, new InternalProcedure<IntSet>() {
+
+ @Override
+ public void execute(ReadGraphImpl graph, IntSet result) {
+ s.release();
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable t) {
+ s.release();
+ new Error("Error in recompute.", t).printStackTrace();
+ }
+
+ }, true);
+
+ while(!s.tryAcquire()) {
+ provider.resume(graph);
+ }
+
+ }
+
+
+ @Override
+ boolean isImmutable(ReadGraphImpl graph) {
+ return graph.processor.isImmutable(id);
+ }
+
+}