Skip to content

Fixed link to memory addressing slide in lab08-64bit #134

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fixed link to memory addressing slide in lab08-64bit #134

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion labs/lab08-64bit/index.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -164,6 +164,6 @@ <h3 id="sample-execution-run-2">Sample Execution Run</h3>
<p>Once you have completed the in-lab, submit linearSearch.s, testLinearSearch.cpp, and your Makefile</p>
<h3 id="hints">Hints</h3>
<h4 id="accessing-array-elements-in-assembly">Accessing Array Elements in Assembly</h4>
<p>Recall that C++ arrays are stored contiguously in memory. This means that if you know the start address of the array <code>&amp;a</code>, and the size of the elements that are being stored, you can find the address of an element at any index <code>i</code> with <code>&amp;a[i] = &amp;a + &lt;size_of_elements&gt;*i</code> (if the array is one-dimensional). Use this fact along with <a href="../slides/08-assembly-64bit.html#/3/8">the memory addressing slide</a> from lecture to access array elements in assembly.</p>
<p>Recall that C++ arrays are stored contiguously in memory. This means that if you know the start address of the array <code>&amp;a</code>, and the size of the elements that are being stored, you can find the address of an element at any index <code>i</code> with <code>&amp;a[i] = &amp;a + &lt;size_of_elements&gt;*i</code> (if the array is one-dimensional). Use this fact along with <a href="../../slides/08-assembly-64bit.html#/3/8">the memory addressing slide</a> from lecture to access array elements in assembly.</p>
</body>
</html>
2 changes: 1 addition & 1 deletion labs/lab08-64bit/index.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -213,4 +213,4 @@ Once you have completed the in-lab, submit linearSearch.s, testLinearSearch.cpp,

#### Accessing Array Elements in Assembly ####

Recall that C++ arrays are stored contiguously in memory. This means that if you know the start address of the array `&a`, and the size of the elements that are being stored, you can find the address of an element at any index `i` with `&a[i] = &a + <size_of_elements>*i` (if the array is one-dimensional). Use this fact along with [the memory addressing slide](../slides/08-assembly-64bit.html#/3/8) from lecture to access array elements in assembly.
Recall that C++ arrays are stored contiguously in memory. This means that if you know the start address of the array `&a`, and the size of the elements that are being stored, you can find the address of an element at any index `i` with `&a[i] = &a + <size_of_elements>*i` (if the array is one-dimensional). Use this fact along with [the memory addressing slide](../../slides/08-assembly-64bit.html#/3/8) from lecture to access array elements in assembly.