On Mon, 2002-09-30 at 09:51, Bill Stoddard wrote: > > Given an efficient means of synchronizing searches > > and updates on a linked list, we could add a "search > > for this entry and create it if it doesn't exist" > > function to the mod_cache hash table implementation. > > > > Anybody have opinions on this? > > Sounds desirable but will be a bear to implement portably.
Do you foresee any portability problems other than porting the atomic compare-and-swap itself? I know that doing an atomic CAS for pointers currently is tricky because the CAS code in APR only works on 32-bit values. But we could fix that one by adding a separate CAS function for pointers, apr_atomic_cas_ptr(volatile void **mem, void *with, const void *cmp) Brian
