Differences

This shows you the differences between two versions of the page.

--- schedule_code_generator_for_code_with_subsystem [2014/07/07 14:58]
yun [TargetMapping for the Matrix Multiplication Example]
+++ schedule_code_generator_for_code_with_subsystem [2014/07/07 15:38]
yun [TargetMapping for Optimization]
@@ Line 87: / Line 87: @@
 ====TargetMapping for Optimization====
+The schedule code generator generates three special statements for each input/output of each useEquation. However, those special statements can be saved under some situation. For example,  the <iP, jP>th value of the final matrix C is computed by a dot product of the <iP>th row of matrix A and the <jP>th column of matrix B
+by the <iP, jP>th instance of the use equation. Assume that the memory for matrix A, B and C are all allocated in row-wise major, the <iP>th row of matrix A can be passed as a pointer of A, no temporary variable is needed. This can be achieved by specifying the memory space for the first input of the useEquation to be the same as A.
+The following command is the command that specifies the optimization for the first input of the useEquation C.
+<sxh cs; gutter:false>
+setMemorySpaceForUseEuqationOptimization(prog, rootSystem, label, 0, 0, "A");
+</sxh>
+The code generated passes the corresponding pointer of A is passed into the function call.

AlphaZ