cache size

I'm trying to write a program in C that spits out data that I can use to find the size of my L1 cache (theoretical experiment, I know I can just look it up). It isn't working, though.

Basically what I'm doing is I'm allocating arrays of incrementally larger sizes, filling them with random numbers, and then accessing each of the elements in the array, in order, 10,000 times in a row, and timing how long that takes. The concept is that once the array is larger than my L1 cache size, the average access time should suddenly jump higher. However, I'm not seeing this and am getting a constant increase in access time from array size 1K to 4MB. (my actual L1 cache size is 64K).

Anyone care to point out where I'm fucking up?

>>13
But at least it is jews who keep PPCs and ARMs in various ghettoes, right?

Also it happens that PPC actually has cache too, therefore your passive-agressive remark about inferiority of x86 architecture is invalid. I mean, it's all very interesting with your childhood traumas and stuff, but clearly you've chosen an absolutely inappropriate occasion to relate it.