--- /dev/null
+/*******************************************************************************\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 java.util.ArrayList;\r
+import java.util.Collection;\r
+import java.util.concurrent.Semaphore;\r
+import java.util.concurrent.atomic.AtomicBoolean;\r
+\r
+import org.simantics.db.RelationInfo;\r
+import org.simantics.db.common.exception.DebugException;\r
+import org.simantics.db.exception.ManyObjectsForFunctionalRelationException;\r
+import org.simantics.db.impl.graph.ReadGraphImpl;\r
+import org.simantics.db.impl.procedure.InternalProcedure;\r
+import org.simantics.db.impl.procedure.TripleIntProcedureAdapter;\r
+import org.simantics.db.procedure.ListenerBase;\r
+import org.simantics.db.request.RequestFlags;\r
+\r
+final public class Statements extends CollectionBinaryQuery<TripleIntProcedure> {\r
+ \r
+// public ArrayList<TripleIntProcedure> procs = null;\r
+ \r
+ public Statements(final int r1, final int r2) {\r
+ super(r1, r2);\r
+ }\r
+\r
+ final static Statements entry(final QueryProcessor processor, final int r1, final int r2) {\r
+ \r
+ return (Statements)processor.statementsMap.get(id(r1,r2));\r
+\r
+ }\r
+ \r
+ final static Collection<Statements> entries(final QueryProcessor processor, final int r1) {\r
+ return processor.statementsMap.values(r1);\r
+ }\r
+ \r
+ final static void runner(ReadGraphImpl graph, final int r1, final int r2, CacheEntry parent, final ListenerBase listener, final TripleIntProcedure procedure) {\r
+ \r
+ QueryProcessor processor = graph.processor;\r
+\r
+ Statements entry = (Statements)processor.statementsMap.get(id(r1,r2));\r
+ if(entry == null) {\r
+ \r
+ entry = new Statements(r1, r2);\r
+ entry.setPending();\r
+ entry.clearResult(processor.querySupport);\r
+ entry.putEntry(processor);\r
+ \r
+ processor.performForEach(graph, entry, parent, listener, procedure);\r
+ \r
+ } else {\r
+ \r
+ if(entry.isPending()) {\r
+ synchronized(entry) {\r
+ if(entry.isPending()) {\r
+ throw new IllegalStateException();\r
+// if(entry.procs == null) entry.procs = new ArrayList<TripleIntProcedure>();\r
+// entry.procs.add(procedure);\r
+// processor.registerDependencies(graph, entry, parent, listener, procedure, false);\r
+// return;\r
+ }\r
+ }\r
+ }\r
+ \r
+ processor.performForEach(graph, entry, parent, listener, procedure);\r
+ \r
+ }\r
+\r
+ }\r
+ \r
+ final public static void queryEach(ReadGraphImpl graph, final int r1, final int r2, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final TripleIntProcedure procedure) {\r
+ \r
+ assert(r1 != 0);\r
+ assert(r2 != 0);\r
+ \r
+ if(parent == null && listener == null) {\r
+ Statements.computeForEach(graph, r1, r2, null, procedure);\r
+ return;\r
+ }\r
+ \r
+ runner(graph, r1, r2, parent, listener, procedure);\r
+ \r
+ }\r
+\r
+ @Override\r
+ public BinaryQuery<TripleIntProcedure> getEntry(QueryProcessor provider) {\r
+ return provider.statementsMap.get(id);\r
+ }\r
+ \r
+ @Override\r
+ public void putEntry(QueryProcessor provider) {\r
+ provider.statementsMap.put(id, this);\r
+ }\r
+\r
+ @Override\r
+ final public void removeEntry(QueryProcessor provider) {\r
+ provider.statementsMap.remove(id);\r
+ }\r
+ \r
+ final static TripleIntProcedure NOPT = new TripleIntProcedure() {\r
+\r
+\r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable throwable) {\r
+ }\r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, int s, int p, int o) {\r
+ }\r
+\r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ }\r
+ \r
+ };\r
+ \r
+ final static private IntArray getAssertionMap(ReadGraphImpl graph, final int r1, final int r2, final Statements entry) {\r
+ \r
+ class AssertionMapProc implements IntProcedure {\r
+ \r
+ boolean first = true;\r
+\r
+ private IntArray result;\r
+\r
+ public void addStatement(int s, int p, int o) {\r
+ \r
+ if(result.size() == 0) {\r
+ result.add(s);\r
+ result.add(p);\r
+ result.add(o);\r
+ } else {\r
+ for(int i = 0;i < result.sizeOrData ; i+=3) {\r
+ int existingP = result.data[i+1];\r
+ if(p == existingP) {\r
+ int existingO = result.data[i+2];\r
+ if(existingO == o) return;\r
+ }\r
+ }\r
+ result.add(s);\r
+ result.add(p);\r
+ result.add(o);\r
+ }\r
+ \r
+ }\r
+ \r
+ @Override\r
+ public void execute(ReadGraphImpl graph, int type) {\r
+ AssertedStatements stms = AssertedStatements.queryEach(graph, type, r2, graph.processor, entry, null, NOPT);\r
+ if(result == null) {\r
+ result = stms.getResult();\r
+ } else {\r
+ if (first) {\r
+ IntArray ia = result;\r
+ result = new IntArray();\r
+ if(ia.data != null) {\r
+ for(int i = 0;i < ia.sizeOrData ; i+=3) addStatement(ia.data[i],ia.data[i+1],ia.data[i+2]);\r
+ }\r
+ first = false;\r
+ }\r
+ IntArray ia = stms.getResult();\r
+ if(ia.data != null) {\r
+ for(int i = 0;i < ia.sizeOrData ; i+=3) addStatement(ia.data[i],ia.data[i+1],ia.data[i+2]);\r
+ }\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ }\r
+\r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable throwable) {\r
+ }\r
+\r
+ }\r
+ \r
+ AssertionMapProc amp = new AssertionMapProc();\r
+\r
+ // This dependency could be cut\r
+ PrincipalTypes.queryEach(graph, r1, graph.processor, entry, null, amp);\r
+ \r
+ return amp.result;\r
+ \r
+ }\r
+ \r
+ final static private void forSingleAssertion(ReadGraphImpl graph, final int r1, final int r2, final Statements entry, final TripleIntProcedure procedure) {\r
+ \r
+ IntArray map = getAssertionMap(graph, r1, r2, entry);\r
+ if(map == null) {\r
+ if(entry != null) entry.finish(graph, procedure);\r
+ else procedure.finished(graph);\r
+ return;\r
+ }\r
+ \r
+ int size = map.size();\r
+ if(size == 3) {\r
+\r
+ int s = map.data[0];\r
+ int p = map.data[1];\r
+ int o = map.data[2];\r
+ \r
+ if(entry != null) {\r
+ entry.addOrSetFunctional(s,p,o);\r
+ entry.finish(graph, procedure);\r
+ } else {\r
+ procedure.execute(graph, s,p,o);\r
+ procedure.finished(graph);\r
+ }\r
+\r
+ } else if(size == 0) {\r
+\r
+ if(entry != null) entry.finish(graph, procedure);\r
+ else procedure.finished(graph);\r
+ \r
+ } else {\r
+\r
+ int candidateS = map.data[0];\r
+ int candidateP = map.data[1];\r
+ int candidateO = map.data[2];\r
+\r
+ SuperTypes candidate = SuperTypes.queryEach(graph, candidateS, graph.processor, entry, null, NOP);\r
+ if(candidate.isExcepted()) {\r
+ if(entry != null) entry.except((Throwable)candidate.getResult());\r
+ procedure.exception(graph, (Throwable)candidate.getResult());\r
+ return;\r
+ }\r
+ IntSet candidateIs = candidate.getResult();\r
+ \r
+ for(int i=3;i<map.size();i+=3) {\r
+\r
+ int nextS = map.data[i];\r
+ int nextP = map.data[i+1];\r
+ int nextO = map.data[i+2];\r
+ \r
+ if(nextS != candidateS) {\r
+\r
+ if(candidateIs.contains(nextS)) {\r
+ \r
+ // Next is a super type of candidate => ignore next\r
+ \r
+ } else {\r
+ \r
+ SuperTypes next = SuperTypes.queryEach(graph, nextS, graph.processor, entry, null, NOP);\r
+ if(next.isExcepted()) {\r
+ if(entry != null) entry.except((Throwable)next.getResult());\r
+ procedure.exception(graph, (Throwable)next.getResult());\r
+ return;\r
+ }\r
+ IntSet nextIs = next.getResult();\r
+ \r
+ if(nextIs.contains(candidateS)) {\r
+\r
+ // Candidate is a super type of next => next is the new candidate\r
+ \r
+ candidateS = nextS;\r
+ candidateP = nextP;\r
+ candidateO = nextO;\r
+ candidateIs = nextIs;\r
+ \r
+ } else {\r
+\r
+ // candidate and next are unrelated => error\r
+ ManyObjectsForFunctionalRelationException exception = new ManyObjectsForFunctionalRelationException("Functional relation has conflicting assertions.", r1);\r
+ \r
+ if(entry != null) entry.except(exception);\r
+ procedure.exception(graph, exception);\r
+ return; \r
+ \r
+ }\r
+ \r
+ }\r
+ \r
+ }\r
+ \r
+ }\r
+ \r
+ if(entry != null) {\r
+ entry.addOrSetFunctional(candidateS, candidateP, candidateO);\r
+ entry.finish(graph, procedure);\r
+ } else {\r
+ procedure.execute(graph, candidateS, candidateP, candidateO);\r
+ procedure.finished(graph);\r
+ }\r
+ \r
+ }\r
+ \r
+ }\r
+ \r
+ final static InternalProcedure<IntSet> NOP = new InternalProcedure<IntSet>() {\r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, IntSet result) {\r
+ }\r
+\r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable throwable) {\r
+ }\r
+ \r
+ };\r
+ \r
+ // Search for one statement\r
+ final static public void computeFunctionalIndex(ReadGraphImpl graph, final int r1, final int r2, final Statements entry, final RelationInfo ri, final TripleIntProcedure procedure) {\r
+ \r
+ if(ri.isFinal) {\r
+ \r
+ int result = graph.processor.querySupport.getFunctionalObject(r1, r2);\r
+\r
+ if(result == 0) {\r
+\r
+ // Check for assertions\r
+ forSingleAssertion(graph, r1, r2, entry, procedure);\r
+\r
+ } else if(result == -1) {\r
+\r
+ graph.processor.querySupport.getObjects(graph, r1, r2, new IntProcedure() {\r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, int i) {\r
+ if(entry != null) entry.addOrSetFunctional(r1, r2, i);\r
+ else procedure.execute(graph, r1, r2, i);\r
+ }\r
+\r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable t) {\r
+ if(DebugException.DEBUG) new DebugException(t).printStackTrace();\r
+ }\r
+\r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ }\r
+\r
+ });\r
+\r
+ // Check for assertions\r
+ forSingleAssertion(graph, r1, r2, entry, procedure);\r
+ \r
+ } else {\r
+\r
+ // If functional relation was found there is no need to check assertions\r
+ if(entry != null) {\r
+ entry.addOrSetFunctional(r1, r2, result);\r
+ entry.finish(graph, procedure);\r
+ } else {\r
+ procedure.execute(graph, r1, r2, result);\r
+ procedure.finished(graph);\r
+ }\r
+ \r
+ }\r
+\r
+ \r
+ } else {\r
+ \r
+ final AtomicBoolean found = new AtomicBoolean(false);\r
+ \r
+ // Note! The dependency is intentionally cut!\r
+ DirectPredicates.queryEach(graph, r1, graph.processor, null, null, new SyncIntProcedure() {\r
+ \r
+ @Override\r
+ public void run(ReadGraphImpl graph) {\r
+ \r
+ if(found.get()) {\r
+ if(entry != null) entry.finish(graph, procedure);\r
+ else procedure.finished(graph);\r
+ } else {\r
+ \r
+ // Check for assertions\r
+ forSingleAssertion(graph, r1, r2, entry, procedure);\r
+ \r
+ }\r
+ \r
+ }\r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, final int pred) {\r
+ \r
+ if(found.get()) return;\r
+\r
+ if(pred == r2) {\r
+ \r
+ inc();\r
+ \r
+ // Note! The dependency is intentionally cut!\r
+ DirectObjects.queryEach(graph, r1, pred, graph.processor, null, null, new IntProcedure() {\r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, int i) {\r
+ \r
+ if(found.compareAndSet(false, true)) {\r
+ \r
+ if(entry != null) entry.addOrSetFunctional(r1, pred, i);\r
+ else procedure.execute(graph, r1, pred, i);\r
+ \r
+ } else {\r
+\r
+ ManyObjectsForFunctionalRelationException exception = new ManyObjectsForFunctionalRelationException("Functional relation has more than one statement.", r1);\r
+ if(entry != null) entry.except(exception);\r
+ procedure.exception(graph, exception);\r
+ \r
+ }\r
+\r
+ }\r
+\r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ dec(graph);\r
+ }\r
+ \r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable t) {\r
+ procedure.exception(graph, t);\r
+ dec(graph);\r
+ }\r
+\r
+ });\r
+\r
+ } else {\r
+ \r
+ inc();\r
+ \r
+ SuperRelations.queryEach(graph, pred, graph.processor, entry, null, new InternalProcedure<IntSet>() {\r
+ \r
+ @Override\r
+ public void execute(ReadGraphImpl graph, IntSet result) {\r
+ \r
+ if(found.get()) {\r
+ dec(graph);\r
+ return;\r
+ }\r
+\r
+ if(result.contains(r2)) {\r
+ \r
+ inc();\r
+ \r
+ // Note! The dependency is intentionally cut!\r
+ DirectObjects.queryEach(graph, r1, pred, graph.processor, null, null, new IntProcedure() {\r
+ \r
+ @Override\r
+ public void execute(ReadGraphImpl graph, int i) {\r
+ \r
+ if(found.compareAndSet(false, true)) {\r
+ \r
+ if(entry != null) entry.addOrSetFunctional(r1, pred, i);\r
+ else procedure.execute(graph, r1, pred, i);\r
+ \r
+ } else {\r
+\r
+ ManyObjectsForFunctionalRelationException exception = new ManyObjectsForFunctionalRelationException("Functional relation has more than one statement.", r1);\r
+ if(entry != null) entry.except(exception);\r
+ procedure.exception(graph, exception);\r
+ \r
+ }\r
+ \r
+ }\r
+ \r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ dec(graph);\r
+ }\r
+ \r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable t) {\r
+ procedure.exception(graph, t);\r
+ dec(graph);\r
+ }\r
+\r
+ });\r
+ \r
+ }\r
+ \r
+ dec(graph);\r
+ \r
+ }\r
+ \r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable t) {\r
+ procedure.exception(graph, t);\r
+ dec(graph);\r
+ }\r
+\r
+ });\r
+ \r
+ }\r
+ \r
+ }\r
+\r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ \r
+ dec(graph);\r
+ \r
+ }\r
+ \r
+ });\r
+ \r
+ }\r
+\r
+ }\r
+ \r
+ final static private void forAssertions(ReadGraphImpl graph, final int r1, final int r2, final Statements entry, final TripleIntProcedure procedure) {\r
+\r
+ PrincipalTypes.queryEach(graph, r1, graph.processor, entry, null, new SyncIntProcedure() {\r
+ \r
+ @Override\r
+ public void run(ReadGraphImpl graph) {\r
+ \r
+ if(entry != null) entry.finish(graph, procedure);\r
+ else procedure.finished(graph);\r
+ \r
+ }\r
+ \r
+ TripleIntProcedure proc = new TripleIntProcedureAdapter() {\r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, int s, int p, int o) {\r
+ if(entry != null) entry.addOrSet(s, p, o);\r
+ else procedure.execute(graph, s, p, o);\r
+ }\r
+\r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ dec(graph);\r
+ }\r
+ \r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable t) {\r
+ dec(graph);\r
+ procedure.exception(graph, t);\r
+ }\r
+\r
+ }; \r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, int type) {\r
+\r
+ inc();\r
+ \r
+ AssertedStatements.queryEach(graph, type, r2, graph.processor, entry, null, proc);\r
+ \r
+ }\r
+ \r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ dec(graph); \r
+ }\r
+ \r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable t) {\r
+ dec(graph);\r
+ }\r
+ \r
+ });\r
+ \r
+\r
+ }\r
+\r
+ final static public void computeNotFunctionalIndex(ReadGraphImpl graph, final int r1, final int r2, final Statements entry, final RelationInfo ri, final TripleIntProcedure procedure) {\r
+\r
+ if(ri.isFinal) {\r
+\r
+ graph.processor.querySupport.getObjects(graph, r1, r2, new IntProcedure() {\r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, int i) {\r
+ if(entry != null) entry.addOrSet(r1, r2, i);\r
+ else procedure.execute(graph, r1, r2, i);\r
+ }\r
+\r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable t) {\r
+ if(DebugException.DEBUG) new DebugException(t).printStackTrace();\r
+ procedure.exception(graph, t);\r
+ }\r
+\r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ }\r
+\r
+ });\r
+\r
+ if(ri.isAsserted) {\r
+ forAssertions(graph, r1, r2, entry, procedure);\r
+ } else {\r
+ if(entry != null) entry.finish(graph, procedure);\r
+ else procedure.finished(graph);\r
+ }\r
+\r
+ } else {\r
+\r
+ // Note! The dependency is intentionally cut!\r
+ DirectPredicates.queryEach(graph, r1, graph.processor, null, null, new SyncIntProcedure() {\r
+ \r
+ @Override\r
+ public void run(ReadGraphImpl graph) {\r
+ \r
+ forAssertions(graph, r1, r2, entry, procedure);\r
+ \r
+ }\r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, final int pred2) {\r
+\r
+ if(pred2 == r2) {\r
+ \r
+ inc();\r
+ \r
+ // Note! The dependency is intentionally cut!\r
+ DirectObjects.queryEach(graph, r1, pred2, graph.processor, null, null, new IntProcedure() {\r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, int i) {\r
+ if(entry != null) entry.addOrSet(r1, pred2, i);\r
+ else procedure.execute(graph, r1, pred2, i);\r
+ }\r
+\r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ dec(graph);\r
+ }\r
+ \r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable t) {\r
+ procedure.exception(graph, t);\r
+ dec(graph);\r
+ }\r
+\r
+ });\r
+\r
+ } else {\r
+ \r
+// inc();\r
+\r
+ try {\r
+ \r
+ IntSet result = SuperRelations.queryEach2(graph, pred2, graph.processor, entry, null, null);\r
+ if(result.contains(r2)) {\r
+\r
+ inc();\r
+\r
+ // Note! The dependency is intentionally cut!\r
+ DirectObjects.queryEach(graph, r1, pred2, graph.processor, null, null, new IntProcedure() {\r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, int i) {\r
+ if(entry != null) entry.addOrSet(r1, pred2, i);\r
+ else procedure.execute(graph, r1, pred2, i);\r
+\r
+ }\r
+\r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ dec(graph);\r
+ }\r
+\r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable t) {\r
+ procedure.exception(graph, t);\r
+ dec(graph);\r
+ }\r
+\r
+ });\r
+\r
+ }\r
+ \r
+ } catch (Throwable e) {\r
+ procedure.exception(graph, e);\r
+ }\r
+\r
+ }\r
+ \r
+ }\r
+\r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ dec(graph);\r
+ }\r
+ \r
+ });\r
+ \r
+ }\r
+ \r
+ }\r
+ \r
+ @Override\r
+ public void computeForEach(ReadGraphImpl graph, final QueryProcessor provider, final TripleIntProcedure procedure, final boolean store) {\r
+ computeForEach(graph, r1(), r2(), this, procedure);\r
+ }\r
+ \r
+ public static void computeForEach(ReadGraphImpl graph, final int r1, final int r2, final Statements entry, final TripleIntProcedure procedure) {\r
+\r
+ RelationInfoQuery riEntry = RelationInfoQuery.probe(graph, r2);\r
+ if(riEntry != null) {\r
+ RelationInfo ri = riEntry.getResult();\r
+ graph.ensureLoaded(r1, r2); \r
+ if(ri.isFunctional) {\r
+ computeFunctionalIndex(graph, r1, r2, entry, ri, procedure);\r
+ } else {\r
+ computeNotFunctionalIndex(graph, r1, r2, entry, ri, procedure);\r
+ }\r
+ return;\r
+ }\r
+ \r
+ RelationInfoQuery.queryEach(graph, r2, graph.processor, entry, null, new InternalProcedure<RelationInfo>() {\r
+\r
+ @Override\r
+ public void execute(ReadGraphImpl graph, final RelationInfo ri) {\r
+ \r
+ graph.ensureLoaded(r1, r2);\r
+ if(ri.isFunctional) {\r
+ computeFunctionalIndex(graph, r1, r2, entry, ri, procedure);\r
+ } else {\r
+ computeNotFunctionalIndex(graph, r1, r2, entry, ri, procedure);\r
+ }\r
+ \r
+ }\r
+ \r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable t) {\r
+ procedure.exception(graph, t);\r
+ }\r
+\r
+ });\r
+ \r
+ }\r
+ \r
+ @Override\r
+ public String toString() {\r
+ return "Statements[" + r1() + " - " + r2() + "]";\r
+ }\r
+\r
+ final private void finish(ReadGraphImpl graph, TripleIntProcedure procedure) {\r
+ \r
+ assert(assertPending());\r
+\r
+// ArrayList<TripleIntProcedure> p = null;\r
+\r
+ synchronized(this) {\r
+\r
+ setReady();\r
+// p = procs;\r
+// procs = null;\r
+\r
+ }\r
+\r
+ IntArray v = (IntArray)getResult();\r
+ final IntArray value = (IntArray)getResult();\r
+\r
+// if(p != null) {\r
+//\r
+// for(TripleIntProcedure proc : p) {\r
+// for(int i=0;i<value.size();i+=3) {\r
+// proc.execute(graph, value.data[i], value.data[i+1], value.data[i+2]);\r
+// }\r
+// }\r
+// for(int i=0;i<value.size();i+=3) {\r
+// procedure.execute(graph, value.data[i], value.data[i+1], value.data[i+2]);\r
+// }\r
+//\r
+// for(TripleIntProcedure proc : p) proc.finished(graph);\r
+//\r
+// }\r
+\r
+ for(int i=0;i<value.size();i+=3) {\r
+ procedure.execute(graph, value.data[i], value.data[i+1], value.data[i+2]);\r
+ }\r
+ \r
+ procedure.finished(graph);\r
+ \r
+ }\r
+\r
+// final private void finish(ReadGraphImpl graph, QueryProcessor provider) {\r
+// \r
+// assert(isPending());\r
+//\r
+// ArrayList<TripleIntProcedure> p = null;\r
+//\r
+// synchronized(this) {\r
+// \r
+// setReady();\r
+// p = procs;\r
+// procs = null; \r
+// \r
+// }\r
+// \r
+// if(p != null) {\r
+// \r
+// final IntArray value = (IntArray)getResult();\r
+// for(TripleIntProcedure proc : p) {\r
+// for(int i=0;i<value.size();i+=3) {\r
+// proc.execute(graph, value.data[i], value.data[i+1], value.data[i+2]);\r
+// }\r
+// }\r
+//\r
+// for(TripleIntProcedure proc : p) proc.finished(graph);\r
+//\r
+// }\r
+//\r
+// }\r
+ \r
+ synchronized public void addOrSet(int s, int p, int o) {\r
+ \r
+ assert(assertPending());\r
+ \r
+ IntArray value = (IntArray)getResult();\r
+ value.add(s);\r
+ value.add(p);\r
+ value.add(o);\r
+ \r
+ }\r
+\r
+ final static public int r1(long id) {\r
+ return (int)(id>>>32);\r
+ }\r
+ \r
+ final static public int r2(long id) {\r
+ return (int)id;\r
+ }\r
+ \r
+ final public void addOrSetFunctional(int s, long po) {\r
+ \r
+ addOrSetFunctional(s, r1(po), r2(po));\r
+ \r
+ }\r
+\r
+ final public void addOrSetFunctional(int s, int p, int o) {\r
+ \r
+ assert(assertPending());\r
+ \r
+ IntArray value = (IntArray)getResult();\r
+ value.add(s);\r
+ value.add(p);\r
+ value.add(o);\r
+ \r
+ }\r
+ \r
+ @Override\r
+ public void performFromCache(ReadGraphImpl graph, QueryProcessor provider, final TripleIntProcedure procedure) {\r
+\r
+ assert(isReady());\r
+\r
+ if(handleException(graph, procedure)) return;\r
+ \r
+ final IntArray value = (IntArray)getResult();\r
+ for(int i=0;i<value.size();i+=3) {\r
+ procedure.execute(graph, value.data[i], value.data[i+1], value.data[i+2]);\r
+ }\r
+\r
+ procedure.finished(graph);\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 TripleIntProcedureAdapter() {\r
+\r
+ @Override\r
+ public void finished(ReadGraphImpl graph) {\r
+ s.release();\r
+ }\r
+ \r
+ @Override\r
+ public void exception(ReadGraphImpl graph, Throwable t) {\r
+ new Error("Error in recompute.", t).printStackTrace();\r
+ s.release();\r
+ }\r
+\r
+ }, true);\r
+ \r
+ while(!s.tryAcquire()) {\r
+ provider.resume(graph);\r
+ }\r
+ \r
+// try {\r
+// s.acquire();\r
+// } catch (InterruptedException e) {\r
+// throw new Error(e);\r
+// }\r
+ \r
+ }\r
+\r
+ @Override\r
+ public int type() {\r
+ return RequestFlags.IMMEDIATE_UPDATE;\r
+ }\r
+ \r
+\r
+ @Override\r
+ boolean isImmutable(ReadGraphImpl graph) {\r
+ return graph.processor.isImmutable(r1());\r
+ }\r
+ \r
+}\r
Code Review / simantics / platform.git / blobdiff