Jeff King <p...@peff.net> writes:
> On Thu, Jan 31, 2013 at 07:27:04AM +0000, Jongman Heo wrote:
>
>> FYI, gdb backtrace and valgrind output attached below, Thanks.
>
> Thanks, that's helpful.
>
>> #4 0x0812bda0 in string_list_insert (list=0xbfffe7c0,
>> string=0x821ec3c "refs/remotes/origin/HEAD") at string-list.c:57
>> #5 0x08071838 in add_existing (refname=0x821ec3c
>> "refs/remotes/origin/HEAD",
>> sha1=0x821ec14 "\a\fW\337B\352N\255\314C\320Em\021E`\022C&",
>> <incomplete sequence \303>, flag=1, cbdata=0xbfffe7c0)
>> at builtin/fetch.c:570
>
> So we are inserting the string from add_existing, which gets the list
> from a callback parameter. Which comes from...
>
>> #13 0x0807390a in do_fetch (remote=<value optimized out>, argc=0,
>> argv=0xbfffe9f8) at builtin/fetch.c:699
>
> ...here, which does this:
>
> struct string_list existing_refs = STRING_LIST_INIT_NODUP;
> [...]
> for_each_ref(add_existing, &existing_refs);
>
> And yet we get:
>
>> ==2195== Conditional jump or move depends on uninitialised value(s)
>> ==2195== at 0x812B41F: get_entry_index (string-list.c:10)
>> ==2195== by 0x812BD5F: string_list_insert_at_index (string-list.c:33)
>> ==2195== by 0x812BD9F: string_list_insert (string-list.c:57)
>> ==2195== by 0x8071837: add_existing (fetch.c:570)
>> ==2195== by 0x810AF96: do_one_ref (refs.c:525)
>> ==2195== by 0x810BB20: do_for_each_ref_in_dir (refs.c:551)
>> ==2195== by 0x810BD34: do_for_each_ref_in_dirs (refs.c:623)
>> ==2195== by 0x810BC8D: do_for_each_ref_in_dirs (refs.c:597)
>> ==2195== by 0x810C303: do_for_each_ref (refs.c:1295)
>> ==2195== by 0x810C63A: for_each_ref (refs.c:1343)
>> ==2195== by 0x8073909: fetch_one (fetch.c:699)
>> ==2195== by 0x8074250: cmd_fetch (fetch.c:992)
>
> which seems odd. cmp should be initialized to NULL, and then we never
> touch it (and even if we did, it wouldn't be unitialized, but rather
> have the value we put in it).
>
> It's almost like the compiler is getting the initializer wrong. It's a
> long shot, but I wonder if the presence of the bitfield could be
> triggering a compiler bug (or there is a subtle C rule about bitfield
> initializations that I do not know). Just for the sake of my sanity,
> what does the following program output for you?
>
> -- >8 --
> #include <stdio.h>
> #include <stdlib.h>
>
> typedef int (*compare_fn)(const char *, const char *);
>
> struct foo {
> char **items;
> unsigned int nr, alloc;
> unsigned int bitfield:1;
> compare_fn cmp;
> };
>
> int main(void)
> {
> struct foo f = { NULL, 0, 0, 0 };
> printf("cmp is %lu\n", (unsigned long)f.cmp);
> return 0;
> }
I doubt that would help because that stack region would be 0 anyway due
to kernel initialization of new pages. You'd have to somehow trample
over it first, like below.
Or perhaps something in the build process went wrong, and fetch.c didn't
get the memo about the new field in the struct. Depending on stack
layout, the next variable might be the 'int i' right before the
'string_list list' in the code, which could explain the value of 1.
---- 8< ----
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef int (*compare_fn)(const char *, const char *);
struct foo {
char **items;
unsigned int nr, alloc;
unsigned int bitfield:1;
compare_fn cmp;
};
void scramble()
{
char foo[256];
memset(foo, 0x42, 256);
}
void init()
{
struct foo f = { NULL, 0, 0, 0 };
printf("cmp is %lu\n", (unsigned long)f.cmp);
}
int main(void)
{
scramble();
init();
return 0;
}
--
To unsubscribe from this list: send the line "unsubscribe git" in
the body of a message to majord...@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
