Arm/cachehit

Consider the following cache:

Direct-mapped (i.e., 1-way set-associative)
2^B block size
2^S sets

Write a function that will determine whether the cache block for a given address is in a cache (i.e., will hit). Your function will be provided B, S, an array of tags (one for each cache block), and one address.

Assume every cache block in the cache is valid. The array of tags contains exactly 2^S words, one for each set. Each entry in the array is a 32-bit word, but only the tag bits are valid (the lower bits that correspond to the set number and offset are undefined).

Your function should return 1 or 0, indicating whether the cache block containing the given address is located in the cache.

int cachehit(unsigned int B, unsigned int S, unsigned int *cachetags, unsigned int addr);

Expected solution length: Around 15 lines.

Sample Input

[See below]

Sample Output

r0=1

.data
# This direct-mapped cache has 4 sets/blocks. Their tags are 0, 0x100, 0xc0, and 0x40
# for set 0, 1, 2, and 3, respectively.
CacheTags:
.word 0
.word 0x100
.word 0xc0
.word 0x40

.text
.global _start
_start:
	ldr r0, =4	// Cache has 2^4 byte blocks
	ldr r1, =2	// Cache has 2^2 sets
	ldr r2, =CacheTags
	ldr r3, =0x110	// Is 0x110 in the cache?
	bl cachehit
1:	b 1b    // Done


cachehit:

Write your solution here

Upload a source file...

arm/cachehit

arm/cachetagPrevious

Nextarm/cachehits

Arm/cachehit

From ASMBits

Sample Input

Sample Output

Write your solution here

Or upload a file

Solution