how would you calculate the cache tag?
is there a way to break a binary address into it's separate parts?
i know that we the block address is calculated by dividing the byte address by the block size. i know the set index is calculated by modulating the block address by the total number of sets. but how do you calculate the cache tag?
"Hence to fight and conquer in all your battles is not supreme excellence;
supreme excellence consists in breaking the enemy's resistance without fighting."
Art of War Sun Tzu
Treat the address as an unsigned long say, then use bitwise operators to mask off certain groups of bits.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
