summaryrefslogtreecommitdiff
path: root/data
diff options
context:
space:
mode:
authorJoel E. Denny <jdenny@clemson.edu>2009-12-29 12:43:26 -0500
committerJoel E. Denny <jdenny@clemson.edu>2009-12-29 15:39:37 -0500
commit2728ac7ecd663c4a60f94fe7ab7679a9e83ebcd0 (patch)
treec221175ff693600b17caae056f03d097e4acf30d /data
parentabcc7c03ccf95f3c19445330b9b6d55365c85ccc (diff)
downloadbison-2728ac7ecd663c4a60f94fe7ab7679a9e83ebcd0.tar.gz
portability: `<' and `>' are not always defined on addresses.
Specifically, don't sort objects by their memory addresses when they're not allocated in the same array or other object. Though I haven't found a test case where that fails on my platform, C says the behavior is undefined. * src/AnnotationList.c (AnnotationList__insertInto): Remove FIXME. Use new id field of InadequacyList nodes rather than their memory addresses when sorting. (AnnotationList__compute_from_inadequacies): Add inadequacy_list_node_count argument to pass to InadequacyList__new_conflict. * src/AnnotationList.h (AnnotationList__compute_from_inadequacies): Update prototype and documentation for new argument. * src/InadequacyList.c (InadequacyList__new_conflict): Add node_count argument and use it to assign a unique ID. * src/InadequacyList.h (InadequacyListNodeCount): New typedef. (InadequacyList): Add id field. (InadequacyList__new_conflict): Update prototype and documentation for new argument. * src/ielr.c (ielr_compute_annotation_lists): Update AnnotationList__compute_from_inadequacies invocation.
Diffstat (limited to 'data')
0 files changed, 0 insertions, 0 deletions