suzanne.soy/racket
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix a sorting problem in a bytecode's submodule table

Browse Source
This commit is contained in:
Matthew Flatt 2012-11-16 14:07:39 -07:00
parent 9a48e5d1e5
commit 8d30f1738c
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/racket/src/print.c
View File

@ -1877,15 +1877,15 @@ static int compare_modules(const void *_am, const void *_bm)
Scheme_Object *a = ((Module_And_Offset *)_am)->mod; Scheme_Object *a = ((Module_And_Offset *)_am)->mod;
Scheme_Object *b = ((Module_And_Offset *)_bm)->mod; Scheme_Object *b = ((Module_And_Offset *)_bm)->mod;
intptr_t i, alen, blen; intptr_t i, alen, blen;
char *as, *bs; unsigned char *as, *bs;
a = SCHEME_CAR(a); a = SCHEME_CAR(a);
b = SCHEME_CAR(b); b = SCHEME_CAR(b);
alen = SCHEME_BYTE_STRLEN_VAL(a); alen = SCHEME_BYTE_STRLEN_VAL(a);
blen = SCHEME_BYTE_STRLEN_VAL(a); blen = SCHEME_BYTE_STRLEN_VAL(b);
as = SCHEME_BYTE_STR_VAL(a); as = (unsigned char *)SCHEME_BYTE_STR_VAL(a);
bs = SCHEME_BYTE_STR_VAL(b); bs = (unsigned char *)SCHEME_BYTE_STR_VAL(b);
for (i = 0; (i < alen) && (i < blen); i++) { for (i = 0; (i < alen) && (i < blen); i++) {
if (as[i] != bs[i]) if (as[i] != bs[i])