This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
schedule_code_generator_for_code_with_subsystem [2014/07/07 14:57] yun [TargetMapping for the Matrix Multiplication Example] |
schedule_code_generator_for_code_with_subsystem [2014/07/07 15:39] yun [TargetMapping for the Matrix Multiplication Example] |
||
---|---|---|---|
Line 81: | Line 81: | ||
setSpaceTimeMapForUseEquationOptimization(prog, | setSpaceTimeMapForUseEquationOptimization(prog, | ||
+ | #command for generating the code | ||
generateScheduledCode(prog, | generateScheduledCode(prog, | ||
generateWrapper(prog, | generateWrapper(prog, | ||
Line 86: | Line 87: | ||
</ | </ | ||
+ | ====TargetMapping for Optimization==== | ||
+ | The schedule code generator generates three special statements for each input/ | ||
+ | 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 < | ||
+ | The following command is the command that specifies the optimization for the first input of the useEquation C. | ||
+ | <sxh cs; gutter: | ||
+ | setMemorySpaceForUseEuqationOptimization(prog, | ||
+ | </ | ||
+ | The code generated passes the corresponding pointer of A is passed into the function call. | ||