Re: volatile and caches

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



> Well, every variable that may change without code being in place must in
> first place be locked or operated using atomic operations. And these

NO!

Locks are used to keep two pieces of code from accessing a variable at the
same time, nothing to do with cached values. I.e. the Reader/Writer
problem.  Atomic operations state that this operation is gaurenteed to
complete without interuption, atomic variables are volatile, and are
used to perform locks. Locks around a variable DO NOT gaurentee you are
getting the latest value, you can still be getting a cached value.

--
Kernelnewbies: Help each other learn about the Linux kernel.
Archive:       http://mail.nl.linux.org/kernelnewbies/
FAQ:           http://kernelnewbies.org/faq/


[Index of Archives]     [Newbies FAQ]     [Linux Kernel Mentors]     [Linux Kernel Development]     [IETF Annouce]     [Git]     [Networking]     [Security]     [Bugtraq]     [Yosemite]     [MIPS Linux]     [ARM Linux]     [Linux RAID]     [Linux SCSI]     [Linux ACPI]
  Powered by Linux