転送方式の選択可能性判定を一通り実装、テストコードはこれから

Fork: 1

nitta-lab / AlgebraicDataflowArchitectureModel

Browse code 転送方式の選択可能性判定を一通り実装、テストコードはこれから 2024_stable ASE2022submit FACS2023 MODELS2025_submit Models2024 SimulatorVisualization bug-pathParam bug-swingNativeReceiver controlFlowModeling dynamicResourceCreation experiment20231128 experiment_2023_1_25 extendForWebServices feature-addTableUI feature-keyboard-shortcuts feature_addLoggerToCFD fix fix-window-position fixSerializeException fix_connectionAnEdgeAtDependsOnMediator forMultipleOutputResources forWebServices gameEngine gameEngine-DTRAM gameEngine2 hieararchicalLayout htmlGUi importVisualModelingUpdates language-server master ohta ohta2 ota outputChannelAsAClass refactor simulationLayout simulator swingInterface test two-stage-modeling update-dtram-parser update-parser ...updateHierarchicalResources
1 parent 6932a6e commit 42dff7491becf6cf77b03d5430b9e7e56cbb1cfb yoichiro authored on 24 Mar 2020

Browse code

2024_stable ...updateHierarchicalResources

1 parent 6932a6e commit 42dff7491becf6cf77b03d5430b9e7e56cbb1cfb

yoichiro authored on 24 Mar 2020

Patch

Unified Split

Showing 4 changed files

                Ignore Space
               Show notes
              View
            
          
          3 ■■■■■
          AlgebraicDataflowArchitectureModel/src/algorithm/DataStorageNecessity.java
 				Expression curexp = member.getStateTransition().getCurStateExpression();
				Expression nextexp = member.getStateTransition().getNextStateExpression();
				boolean flag = false;
				for (Position pos : curexp.getVariables().keySet()) {
					System.out.println(curexp);
					System.out.println(curexp.getVariables().containsKey(pos));
					System.out.println(nextexp);
					if (nextexp.contains(curexp.getVariables().get(pos))) {
						flag = true;
					}
				}
 				Expression curexp = member.getStateTransition().getCurStateExpression();
 				Expression nextexp = member.getStateTransition().getNextStateExpression();
 				boolean flag = false;
 				for (Position pos : curexp.getVariables().keySet()) {
-					System.out.println(curexp);
-					System.out.println(curexp.getVariables().containsKey(pos));
-					System.out.println(nextexp);
 					if (nextexp.contains(curexp.getVariables().get(pos))) {
 						flag = true;
 					}
 				}

                Ignore Space
               Show notes
              View
            
          
          29 ■■■■■
          AlgebraicDataflowArchitectureModel/src/algorithm/EdgeTransitionSelectable.java
             package algorithm;
 
import models.*;
import models.dataFlowModel.*;
 
public class EdgeTransitionSelectable {
	static public void run(ResourceDependencyGraph graph) {
		PushPullAttribute ppat = new PushPullAttribute();
		ppat.addOption(PushPullValue.PUSHorPULL);
		ppat.addOption(PushPullValue.PUSH);
		ppat.addOption(PushPullValue.PULL);
		for (Node n : graph.getNodes()) {
			if (((StoreAttribute) ((ResourceNode) n).getAttribute()).isNeeded()) {
				trackEdges(n);
			}
		}
		for (Edge e : graph.getEdges()) {
			if (((ResourceDependency) e).getAttribute() == null) {
				((ResourceDependency) e).setAttribute(ppat);
			}
		}
	}
 
	static private void trackEdges(Node n) {
		PushPullAttribute ppat = new PushPullAttribute();
		ppat.addOption(PushPullValue.PUSH);
		for (Node pre : n.getPredecessors()) {
			for (Edge in : n.getInEdges()) {
				((ResourceDependency) in).setAttribute(ppat);
			}
			trackEdges(pre);
		}
	}
}
 package algorithm;
+import models.*;
+import models.dataFlowModel.*;
 public class EdgeTransitionSelectable {
+	static public void run(ResourceDependencyGraph graph) {
+		PushPullAttribute ppat = new PushPullAttribute();
+		ppat.addOption(PushPullValue.PUSHorPULL);
+		ppat.addOption(PushPullValue.PUSH);
+		ppat.addOption(PushPullValue.PULL);
+		for (Node n : graph.getNodes()) {
+			if (((StoreAttribute) ((ResourceNode) n).getAttribute()).isNeeded()) {
+				trackEdges(n);
+			}
+		}
+		for (Edge e : graph.getEdges()) {
+			if (((ResourceDependency) e).getAttribute() == null) {
+				((ResourceDependency) e).setAttribute(ppat);
+			}
+		}
+	}
+	static private void trackEdges(Node n) {
+		PushPullAttribute ppat = new PushPullAttribute();
+		ppat.addOption(PushPullValue.PUSH);
+		for (Node pre : n.getPredecessors()) {
+			for (Edge in : n.getInEdges()) {
+				((ResourceDependency) in).setAttribute(ppat);
+			}
+			trackEdges(pre);
+		}
+	}
 }

                Ignore Space
               Show notes
              View
            
          
          6 ■■■■■
          AlgebraicDataflowArchitectureModel/src/tests/DataStorageDecisionTest.java
        
        
        
          0 → 100644
             package tests;
 
public class DataStorageDecisionTest {
 
}
+package tests;
+public class DataStorageDecisionTest {
+}

Ignore Space Show notes View AlgebraicDataflowArchitectureModel/src/tests/EdgeTransitionSelectableTest.java 0 → 100644

Show line notes below