Code Generation/Exercise 11 - Revision history

Root: Redirected page to ist:Code Generation/Exercise 11

2018-12-06T18:16:34Z

Redirected page to ist:Code Generation/Exercise 11

Root: /* Código Postfix (não optimizado) */

2018-06-20T13:17:24Z

Código Postfix (não optimizado)

← Older revision		Revision as of 13:17, 20 June 2018
Line 153:		Line 153:
	LOCAL +8 ; &v		LOCAL +8 ; &v
	LDINT ; v		LDINT ; v
	~~LDDOUBLE ; *v~~		STFVAL32
	~~STFVAL64~~
	LEAVE		LEAVE
	RET		RET

Root: /* Código Postfix (não optimizado) */

2018-05-01T22:55:05Z

Código Postfix (não optimizado)

← Older revision		Revision as of 22:55, 1 May 2018
Line 32:		Line 32:
	ALIGN		ALIGN
	LABEL limit ; not really this name		LABEL limit ; not really this name
	~~CONST~~ 1024		SINT 1024
	; done - go back to code segment		; done - go back to code segment
	TEXT		TEXT
Line 40:		Line 40:
	INT 0		INT 0
	LOCAL -4		LOCAL -4
	~~STORE~~ ; i = 0		STINT ; i = 0

	; for-loop test		; for-loop test
	LABEL fortest		LABEL fortest
	LOCAL -4		LOCAL -4
	~~LOAD~~ ; i		LDINT ; i
	ADDR limit		ADDR limit
	~~LOAD~~ ; limit		LDINT ; limit
	LT ; i<limit		LT ; i<limit
	JZ forend		JZ forend
Line 58:		Line 58:
	INT 3		INT 3
	LOCAL -4 ; &i		LOCAL -4 ; &i
	~~LOAD~~ ; i		LDINT ; i
	MUL		MUL
	INT 8 ; sizeof(double)		INT 8 ; sizeof(double)
Line 64:		Line 64:
	I2D		I2D

	~~DDUP~~ ; implement assignment value		DUP64 ; implement assignment value

	; compute &v[i] == v+i*sizeof(double)		; compute &v[i] == v+i*sizeof(double)
	LOCAL +8 ; &v		LOCAL +8 ; &v
	~~LOAD~~ ; v		LDINT ; v
	LOCAL -4 ; &i		LOCAL -4 ; &i
	~~LOAD~~ ; i		LDINT ; i
	INT 8 ; sizeof(double)		INT 8 ; sizeof(double)
	MUL		MUL
	ADD ; &v[i]		ADD ; &v[i]

	~~DSTORE~~ ; do assignment of double value		STDOUBLE ; do assignment of double value

	TRASH 8 ; discard value of assignment		TRASH 8 ; discard value of assignment
Line 84:		Line 84:
	; compute &v[i] == v+i*sizeof(double)		; compute &v[i] == v+i*sizeof(double)
	LOCAL +8 ; &v		LOCAL +8 ; &v
	~~LOAD~~ ; v		LDINT ; v
	LOCAL -4 ; &i		LOCAL -4 ; &i
	~~LOAD~~ ; i		LDINT ; i
	INT 8 ; sizeof(double)		INT 8 ; sizeof(double)
	MUL		MUL
	ADD ; &v[i]		ADD ; &v[i]
	~~DLOAD~~ ; v[i]		LDDOUBLE ; v[i]

	; compute and promote 2*i		; compute and promote 2*i
	INT 2		INT 2
	LOCAL -4 ; &i		LOCAL -4 ; &i
	~~LOAD~~ ; i		LDINT ; i
	MUL		MUL
	I2D		I2D
Line 112:		Line 112:
	; load and promote "limit"		; load and promote "limit"
	ADDR limit		ADDR limit
	~~LOAD~~		LDINT
	I2D		I2D

Line 119:		Line 119:
	; compute &v[i] == v+i*sizeof(double)		; compute &v[i] == v+i*sizeof(double)
	LOCAL +8 ; &v		LOCAL +8 ; &v
	~~LOAD~~ ; v		LDINT ; v
	LOCAL -4 ; &i		LOCAL -4 ; &i
	~~LOAD~~ ; i		LDINT ; i
	INT 8 ; sizeof(double)		INT 8 ; sizeof(double)
	MUL		MUL
	ADD ; &v[i]		ADD ; &v[i]

	~~DSTORE~~ ; do assignment of double value		STDOUBLE ; do assignment of double value

	TRASH 8 ; discard value of assignment		TRASH 8 ; discard value of assignment
Line 138:		Line 138:
	; increment expression		; increment expression
	LOCAL -4 ; &i		LOCAL -4 ; &i
	~~LOAD~~ ; i		LDINT ; i
	~~DUP~~		DUP32
	INT 1		INT 1
	ADD		ADD
	LOCAL -4 ; &i		LOCAL -4 ; &i
	~~STORE~~		STINT
	TRASH 4		TRASH 4

Line 152:		Line 152:
	; return *v		; return *v
	LOCAL +8 ; &v		LOCAL +8 ; &v
	~~LOAD~~ ; v		LDINT ; v
	~~DLOAD~~ ; *v		LDDOUBLE ; *v
	~~DPOP~~		STFVAL64
	LEAVE		LEAVE
	RET		RET

Root: /* Código Postfix (não optimizado) */

2017-05-17T10:58:41Z

Código Postfix (não optimizado)

← Older revision		Revision as of 10:58, 17 May 2017
Line 31:		Line 31:
	RODATA		RODATA
	ALIGN		ALIGN
	LABEL limit		LABEL limit ; not really this name
	CONST 1024		CONST 1024
	; done - go back to code segment		; done - go back to code segment
Line 43:		Line 43:

	; for-loop test		; for-loop test
			LABEL fortest
	LOCAL -4		LOCAL -4
	LOAD ; i		LOAD ; i
Line 54:		Line 55:
	; BEGIN assignment to v[i]		; BEGIN assignment to v[i]

	; compute and promote 3*i~~-sizeof(double)~~		; compute and promote 3*i
	INT 3		INT 3
	LOCAL -4 ; &i		LOCAL -4 ; &i
Line 63:		Line 64:
	I2D		I2D

	DDUP ; ~~compute~~ assignment value		DDUP ; implement assignment value

	; compute &v[i] == v+i*sizeof(double)		; compute &v[i] == v+i*sizeof(double)
Line 76:		Line 77:
	DSTORE ; do assignment of double value		DSTORE ; do assignment of double value

	TRASH 8 ; discard assignment ~~value~~		TRASH 8 ; discard value of assignment

	; END assignment to v[i]		; END assignment to v[i]
Line 102:		Line 103:
	INT 0		INT 0
	GT		GT

			; jump to if end
			JZ ifend

	; BEGIN if block		; BEGIN if block
Line 111:		Line 115:
	I2D		I2D

	DDUP ; ~~compute~~ assignment value		DDUP ; implement assignment value

	; compute &v[i] == v+i*sizeof(double)		; compute &v[i] == v+i*sizeof(double)
Line 122:		Line 126:
	ADD ; &v[i]		ADD ; &v[i]

	DSTORE ; do assignment of double value		DSTORE ; do assignment of double value

	TRASH 8 ; discard assignment ~~value~~		TRASH 8 ; discard value of assignment

	; END if block		; END if block
			LABEL ifend

			; FOR increment
			LABEL forincr

			; increment expression
			LOCAL -4 ; &i
			LOAD ; i
			DUP
			INT 1
			ADD
			LOCAL -4 ; &i
			STORE
			TRASH 4

	; END for-loop body		; END for-loop body
			JMP fortest
			LABEL forend

	; return *v		; return *v
	LOCAL +8 ; &v		LOCAL +8 ; &v
	LOAD ; v		LOAD ; v
	~~POP~~		DLOAD ; *v
			DPOP
	LEAVE		LEAVE
	RET		RET

Root: /* Código Postfix (não optimizado) */

2017-05-09T07:36:03Z

Código Postfix (não optimizado)

← Older revision		Revision as of 07:36, 9 May 2017
Line 20:		Line 20:

	No código Postfix, '''BB#''' significa "[[Optimization Topics\|bloco básico]] número".		No código Postfix, '''BB#''' significa "[[Optimization Topics\|bloco básico]] número".
			{{CollapsedCode\|Postfix code\|
	<asm>		<asm>
	TEXT		TEXT
Line 137:		Line 137:

	</asm>		</asm>
			}}

	== Compiling and Running ==		== Compiling and Running ==

Root: /* Código Postfix (não optimizado) */

2017-05-09T07:25:03Z

Código Postfix (não optimizado)

← Older revision		Revision as of 07:25, 9 May 2017
Line 62:		Line 62:
	SUB		SUB
	I2D		I2D

			DDUP ; compute assignment value

	; compute &v[i] == v+i*sizeof(double)		; compute &v[i] == v+i*sizeof(double)
Line 72:		Line 74:
	ADD ; &v[i]		ADD ; &v[i]

	DSTORE ; do double assignment		DSTORE ; do assignment of double value

			TRASH 8 ; discard assignment value

	; END assignment to v[i]		; END assignment to v[i]
Line 106:		Line 110:
	LOAD		LOAD
	I2D		I2D

			DDUP ; compute assignment value

	; compute &v[i] == v+i*sizeof(double)		; compute &v[i] == v+i*sizeof(double)
Line 116:		Line 122:
	ADD ; &v[i]		ADD ; &v[i]

	DSTORE ; do double assignment		DSTORE ; do assignment of double value

			TRASH 8 ; discard assignment value

	; END if block		; END if block

Root: /* Compiling and Running */

2017-02-16T09:53:27Z

Compiling and Running

← Older revision		Revision as of 09:53, 16 February 2017
Line 134:		Line 134:
	Para compilar o código Postfix directamente, pode ser utilizada a ferramenta [[pf2asm]] (assumindo uma arquitectura de 32 bits):		Para compilar o código Postfix directamente, pode ser utilizada a ferramenta [[pf2asm]] (assumindo uma arquitectura de 32 bits):

	* pf2asm forall.pf		pf2asm forall.pf
	* yasm -felf forall.asm		yasm -felf forall.asm

	[[category:Compiladores]]		[[category:Compiladores]]
	[[category:Ensino]]		[[category:Ensino]]

Root: /* Código Postfix (não optimizado) */

2015-06-22T13:45:47Z

Código Postfix (não optimizado)

← Older revision		Revision as of 13:45, 22 June 2015
Line 22:		Line 22:

	<asm>		<asm>
			TEXT
			ALIGN
			GLOBAL forall, FUNC
			LABEL forall
			ENTER 4 ; i@-4 v@+8

			; define "limit" (this is not an assignment)
			RODATA
			ALIGN
			LABEL limit
			CONST 1024
			; done - go back to code segment
			TEXT
			ALIGN

			; initialize for-loop control variable (again, not an assignment)
			INT 0
			LOCAL -4
			STORE ; i = 0

			; for-loop test
			LOCAL -4
			LOAD ; i
			ADDR limit
			LOAD ; limit
			LT ; i<limit
			JZ forend

			; BEGIN for-loop body

			; BEGIN assignment to v[i]

			; compute and promote 3*i-sizeof(double)
			INT 3
			LOCAL -4 ; &i
			LOAD ; i
			MUL
			INT 8 ; sizeof(double)
			SUB
			I2D

			; compute &v[i] == v+i*sizeof(double)
			LOCAL +8 ; &v
			LOAD ; v
			LOCAL -4 ; &i
			LOAD ; i
			INT 8 ; sizeof(double)
			MUL
			ADD ; &v[i]

			DSTORE ; do double assignment

			; END assignment to v[i]

			; if condition
			; compute &v[i] == v+i*sizeof(double)
			LOCAL +8 ; &v
			LOAD ; v
			LOCAL -4 ; &i
			LOAD ; i
			INT 8 ; sizeof(double)
			MUL
			ADD ; &v[i]
			DLOAD ; v[i]

			; compute and promote 2*i
			INT 2
			LOCAL -4 ; &i
			LOAD ; i
			MUL
			I2D

			; compare
			DCMP
			INT 0
			GT

			; BEGIN if block
			; do assignment (double)

			; load and promote "limit"
			ADDR limit
			LOAD
			I2D

			; compute &v[i] == v+i*sizeof(double)
			LOCAL +8 ; &v
			LOAD ; v
			LOCAL -4 ; &i
			LOAD ; i
			INT 8 ; sizeof(double)
			MUL
			ADD ; &v[i]

			DSTORE ; do double assignment

			; END if block
			; END for-loop body

			; return *v
			LOCAL +8 ; &v
			LOAD ; v
			POP
			LEAVE
			RET

	</asm>		</asm>

Root: /* Código Postfix (não optimizado) */

2015-06-22T13:28:49Z

Código Postfix (não optimizado)

← Older revision		Revision as of 13:28, 22 June 2015
Line 19:		Line 19:
	O código Postfix correspondente à função é o seguinte (agradece-se a comunicação de questões relativas a este código).		O código Postfix correspondente à função é o seguinte (agradece-se a comunicação de questões relativas a este código).

	No código Postfix, '''BB#''' significa "[[Optimization Topics\|~~basic block~~]] número".		No código Postfix, '''BB#''' significa "[[Optimization Topics\|bloco básico]] número".

	<asm>		<asm>

Root: Created page with "{{TOCright}} == Problema == Considere o seguinte código C++ (assuma que ponteiros e '''int''' ocupam 32 bits e que '''double''' ocupa 64 bits). double *forall(doubl..."

2015-06-22T13:28:27Z

Created page with "{{TOCright}} == Problema == Considere o seguinte código C++ (assuma que ponteiros e '''int''' ocupam 32 bits e que '''double''' ocupa 64 bits). <cpp> double *forall(doubl..."

New page

{{TOCright}}
== Problema ==

Considere o seguinte código C++ (assuma que ponteiros e '''int''' ocupam 32 bits e que '''double''' ocupa 64 bits).

<cpp>
double *forall(double *v) {
const static int limit = 1024;
for (int i = 0; i < limit; i++) {
v[i] = 3 * i – sizeof(double);
if (v[i] > 2 * i) v[i] = limit;
}
return v;
}
</cpp>

== Código Postfix (não optimizado) ==

O código Postfix correspondente à função é o seguinte (agradece-se a comunicação de questões relativas a este código).

No código Postfix, '''BB#''' significa "[[Optimization Topics|basic block]] número".

<asm>

</asm>

== Compiling and Running ==

Para compilar o código Postfix directamente, pode ser utilizada a ferramenta [[pf2asm]] (assumindo uma arquitectura de 32 bits):

* pf2asm forall.pf
* yasm -felf forall.asm

[[category:Compiladores]]
[[category:Ensino]]