How to fix strcpy so that it detects overlapping strings

You could probably use memmove() if you expect the strings to be overlapping.

char* my_strcpy(char *a, char *b) { memmove(a, b, strlen(b) + 1); return a; } 

Note: Here, b is the address of the source string and a is the address of the destination.

With a > b you wouldn't necessarily have an overlap. If

(a <= b && a+strlen(a) >= b) || (b <= a && b+strlen(b) >= a) 

then you have an overlap.

However, besides detecting overlap for the sake of interview, a > b should do fine for strcpy. The idea is this:

If b is placed further in the memory (b > a), then you can normally copy b into a. Parts of b will be overwritten, but you are already past that part.

If a is placed further in the memory (a > b), it means that possibly by writing on the first location of a, you have already overwritten a location in b with a higher index. In such a case, you should copy in the opposite direction. So instead of copy from index 0 to strlen(b)-1, you should copy from strlen(b)-1 to 0.

If you are confused how that helps, draw two overlapping arrays on paper and try to copy once from the beginning of the array and once from the end. Try this with the overlapping arrays both in cases a > b and a < b.

Note, if a == b, you don't need to actually copy anything and you can just return.

Edit: I am not sure, but reading the other solutions, it seems like this answer may not be completely portable. Beware of that.

if a > b; then copy a from the beginning else if a < b; then copy a from the ending else // a == b do nothing 

You can refer to an implementation of memmove, it's quite like what I said.

Even without using relational pointer comparisons, memmove, or equivalent, it is possible to code a version of strcpy which will be performed as an strlen and memcpy in the non-overlapping case, and as a top-down copy in the overlapping case. The key is to exploit the fact that if the first byte of the destination is read and then replaced with zero, calling strlen on the source and adding to the source pointer the value that was returned will yield a legitimate pointer which will equal the start of the destination in the "troublesome overlap" case. If the source and destination are different objects, the "source plus strlen" pointer may be safely computed and observed to be unequal to the destination.

In the event that adding the string length to the source pointer yields the destination pointer, replacing the zero byte with the earlier-read value and calling strlen on the destination will allow code to determine the ending address of the source and destination strings. Further, the length of the source string will indicate the distance between the pointers. If this value is large (probably greater than 16 or so), code may efficiently subdivide the "move" operation into a top-down sequence of memcpy operations. Otherwise the string may be copied with a top-down loop of single-byte copy operations, or with a sequence of "memcpy to source to buffer"/"memcpy buffer to destination" operations [if the per-byte cost of a large memcpy is less than half that of an individual-character-copy loop, using a ~256-byte buffer may be a useful optimization].

if (a>= b && a <= b+strlen(b))) || (b+strlen(b) >= a && b+strlen(b) <= a + strlen(b)) 

(*) you should cache strlen(b) to improve performance

What it does:
checks if the a+len [address of a + extra len bytes] is inside the string, or a [address of a] is inside the string, these are the only possibilities for a string overlapping.

If these two strings overlap, then, while copying you'll run over the original a or b pointers.

Assuming that strcpy( a, b ) roughly means a <- b, i.e., the first parameter is the destination of the copy, then you only check whether the copy pointer reaches b's position.

You only need to save the b original position, and while copying, check you haven't reached it. Also, don't write the trailing zero if you have reached that position.

 char* my_strcpy(char *a, const char *b) { if ( a == NULL || b == NULL ) { return NULL; } char *n = a; const char * oldB = b; while( *b != '\0' && a != oldB ) { *a = *b; a++; b++; } if ( a != oldB ) { *a = '\0'; } return n; } 

This algorithm just stops copying. Maybe you want to do something else, such as marking the error condition, or add an end-of-the string mark to the previous position (though failing silently (as the algorithm does at the moment) isn't the best option).

Hope this helps.

I was asked this in a recent interview. We don't have to 'detect' overlap. We can write strcpy in such a way that overlapping addresses are taken care of. The key is to copy from the end of source string instead of from the start.

Here is a quick code.

void str_copy(const char *src, char *dst) { /* error checks */ int i = strlen(a); /* may have to account for null character */ while(i >= 0) { dst[i] = src[i]; i--; } } 

EDIT: This only works when a < b. For a > b, copy from the start.

This SO entry is already older, but I am currently working on a old piece of code that copies overlapping strings with strcpy(). Characters were missing in the log output. I decided to use the following compact solution, which copies char by char.

static char *overlapped_strcpy(char *dest, const char *src) { char *dst = dest; if (dest == NULL || src == NULL || dest == src) return dest; do { *dst++ = *src; } while (*src++); return dest; } 

EDIT:

As @Gerhardh pointed out, the code above only works if dest <= src (I just had to solve this case). For the case dest > src it is more complicated. However, copying from behind, as other answers have already mentioned, leads to success. For example:

if (dest <= src) { /* do the above */ } else { int i = (int)strlen(src); while (i >= 0) { dst[i] = src[i]; i--; } }