views:

542

answers:

5

I have some code where I frequently copy a large block of memory, often after making only very small changes to it.

I have implemented a system which tracks the changes, but I thought it might be nice, if possible to tell the OS to do a 'copy-on-write' of the memory, and let it deal with only making a copy of those parts which change. However while Linux does copy-on-write, for example when fork()ing, I can't find a way of controlling it and doing it myself.

+1  A: 

The copy-on-write mechanism employed e.g. by fork() is a feature of the MMU (Memory Management Unit), which handles the memory paging for the kernel. Accessing the MMU is a priviledged operation, i.e. cannot be done by a userspace application. I am not aware of any copy-on-write API exported to user-space, either.

(Then again, I am not exactly a guru on the Linux API, so others might point out relevant API calls I have missed.)

Edit: And lo, MSalters rises to the occasion. ;-)

DevSolar
+2  A: 

Depending on what exactly it is that you are copying, a persistent data structure might be a solution for your problem.

Jørgen Fogh
+1  A: 

Its easier to implement copy-on-write in a object oriented language, like c++. For example, most of the container classes in Qt are copy-on-write.

But if course you can do that in C too, it's just some more work. When you want to assign your data to a new data block, you don't do a copy, instead you just copy a pointer in a wrapper strcut around your data. You need to keep track in your data blocks of the status of the data. If you now change something in your new data block, you make a "real" copy and change the status. You can't of course no longer use the simple operators like "=" for assignment, instead need to have functions (In C++ you would just do operator overloading).

A more robust implementation should use reference counters instead of a simple flag, I leave it up to you.

A quick and dirty example: If you have a

struct big {
//lots of data
    int data[BIG_NUMBER];
}

you have to implement assign functions and getters/setters yourself.

// assume you want to implent cow for a struct big of some kind
// now instead of
struct big a, b;
a = b;
a.data[12345] = 6789;

// you need to use
struct cow_big a,b;
assign(&a, b);   //only pointers get copied
set_some_data(a, 12345, 6789); // now the stuff gets really copied


//the basic implementation could look like 
struct cow_big {
    struct big *data;
    int needs_copy;
}

// shallow copy, only sets a pointer. 
void assign(struct cow_big* dst, struct cow_big src) {
    dst->data = src.data;
    dst->needs_copy = true;
}

// change some data in struct big. if it hasn't made a deep copy yet, do it here.
void set_some_data(struct cow_big* dst, int index, int data } {
    if (dst->needs_copy) {
        struct big* src = dst->data;
        dst->data = malloc(sizeof(big));
        *(dst->data) = src->data;   // now here is the deep copy
       dst->needs_copy = false;
   }
   dst->data[index] = data;
}

You need to write constructors and destructors as well. I really recommend c++ for this.

drhirsch
That doesn't generate the COW semantics that I want, if the OS did it it would only copy the (on Mac OS X at least) 4k page which was changed, leaving the rest of the (other 10s or 100s of MB) data-structure still COW.Of course, I could, and have, implemented what I actually want, but it would be nice if I could get the OS to do it for me.
Chris Jefferson
A newer version of the linux kernel may do it automagically, the kernels 2.6.32+ have code for replacing duplicate pages with copy-on-write links http://lwn.net/Articles/353501/ , yet the ksm subsystem is not very mature and until now works the other way around: The pages are scanned after they have been copied and replaced if identical.If you want it to control it from userspace, you may want to look at linux/mm/ksm.c and make the changes you need.
drhirsch
The posted solution really isn't "CoW" at all, it's a software emulation thereof that forces all "write" operations through an indirection layer. I believe Chris was asking specifically for a memory-level solution using the MMU hardware. And FWIW: you don't need a new version of the Linux kernel. BSD mmap() has supported MAP_PRIVATE for decades now -- it's been part of POSIX since the beginning.
Andy Ross
+5  A: 

Your best chance is probably to mmap() the original data to file, and then mmap() the same file again using MAP_PRIVATE.

MSalters
Note that you need to create two `MAP_PRIVATE` mappings - COW semantics require all users to have COW copies, with no-one using a "master" copy. Unfortunately the file itself seems to be necessary.
caf
Why? Assume the master is `AA`, and the reason for COW is that you want a copy which you can change to `AB`. There's no reason the original `AA` needs to be a private mapping, as nobody is planning to write to it. It's merely a template.
MSalters
My comment was based on the possibility that the "original" copy may also be written to, in which case it would be unspecified if those changes get reflected in the COW copy or not. As an aside, it is a pity that `mmap` does not provide inherent support for this - I might play around with adding support to `mmap` for duplicating existing mappings and see how it goes.
caf
I'm with MSalters: there's no "standard" set of COW semantics. Having one mapping be the "real" file and one be a private copy seems perfectly reasonable. Obviously some apps need writable snapshots or whatnot, but not all.
Andy Ross
+2  A: 

You should be able to open your own memory via /proc/$PID/mem and then mmap() the interesting part of it with MAP_PRIVATE to some other place.