diff options
author | Peter Zhu <peter@peterzhu.ca> | 2022-12-14 10:57:44 -0500 |
---|---|---|
committer | Peter Zhu <peter@peterzhu.ca> | 2022-12-14 13:21:46 -0500 |
commit | 7a63114f8eaba7a1fe8a56a2e665703d9f9cfa8a (patch) | |
tree | a80ae550182778803674c33f813e4e74f4709a6f /shape.c | |
parent | 71dd8b3caa6462e5c3dfd7059314459b51ebebc0 (diff) | |
download | ruby-7a63114f8eaba7a1fe8a56a2e665703d9f9cfa8a.tar.gz |
Remove dead code in get_next_shape_internal
If the rb_id_table_lookup fails, then res is not updated so it cannot be
any value other than null.
Diffstat (limited to 'shape.c')
-rw-r--r-- | shape.c | 6 |
1 files changed, 0 insertions, 6 deletions
@@ -142,12 +142,6 @@ get_next_shape_internal(rb_shape_t * shape, ID id, enum shape_type shape_type) // Lookup the shape in edges - if there's already an edge and a corresponding shape for it, // we can return that. Otherwise, we'll need to get a new shape if (!rb_id_table_lookup(shape->edges, id, (VALUE *)&res)) { - // In this case, the shape exists, but the shape is garbage, so we need to recreate it - if (res) { - rb_id_table_delete(shape->edges, id); - res->parent_id = INVALID_SHAPE_ID; - } - rb_shape_t * new_shape = rb_shape_alloc(id, shape); new_shape->type = (uint8_t)shape_type; |