-
Notifications
You must be signed in to change notification settings - Fork 1
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Dead code eliminator: use default if other actions won't be executed #56
Merged
Merged
Changes from all commits
Commits
Show all changes
7 commits
Select commit
Hold shift + click to select a range
801a850
Dead code eliminator: use default if other actions won't be executed
RabbitWhite1 4c0619b
lint
RabbitWhite1 17942c8
update more reference files
RabbitWhite1 11da514
fix
RabbitWhite1 5de49df
Record eliminated nodes with potential replaced nodes
RabbitWhite1 fb454b6
Merge branch 'master' into zhanghan/default-action
RabbitWhite1 0a4d536
update ref
RabbitWhite1 File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 35: apply { t.apply(); } | ||
Replaced node at line 35: apply { t.apply(); } with add() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 35: apply { t.apply(); } | ||
Replaced node at line 35: apply { t.apply(); } with compare() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 35: apply { t.apply(); } | ||
Replaced node at line 35: apply { t.apply(); } with compare() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 35: apply { t.apply(); } | ||
Replaced node at line 35: apply { t.apply(); } with shift() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 35: apply { t.apply(); } | ||
Replaced node at line 35: apply { t.apply(); } with shift() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 35: apply { t.apply(); } | ||
Replaced node at line 35: apply { t.apply(); } with shift() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 132: guh.apply(); | ||
Replaced node at line 132: guh.apply(); with foo() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 35: apply { t.apply(); } | ||
Replaced node at line 35: apply { t.apply(); } with concat() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 38: forward.apply(); | ||
Replaced node at line 38: forward.apply(); with drop() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 73: t2.apply(); | ||
Replaced node at line 73: t2.apply(); with add() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
Eliminated node at line 106: guh.apply(); | ||
Replaced node at line 106: guh.apply(); with hash_drop_decision() | ||
Eliminated node at line 107: debug_table.apply(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 69: t_exact.apply(); | ||
Replaced node at line 69: t_exact.apply(); with set_error_idx(8w0) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 87: mac_da.apply(); | ||
Replaced node at line 87: mac_da.apply(); with my_drop() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 82: mac_da.apply(); | ||
Replaced node at line 82: mac_da.apply(); with my_drop() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 80: mac_da.apply(); | ||
Replaced node at line 80: mac_da.apply(); with my_drop() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 80: mac_da.apply(); | ||
Replaced node at line 80: mac_da.apply(); with my_drop() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 46: apply { t.apply(); } | ||
Replaced node at line 46: apply { t.apply(); } with case0() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
Eliminated node at line 117: ipv4_sa_filter.apply(); | ||
Eliminated node at line 118: ipv4_da_lpm.apply(); | ||
Replaced node at line 118: ipv4_da_lpm.apply(); with my_drop() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 133: guh.apply(); | ||
Replaced node at line 133: guh.apply(); with foo() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
Eliminated node at line 164: drop_tbl.apply(); | ||
Eliminated node at line 187: round_tbl.apply(); | ||
Replaced node at line 187: round_tbl.apply(); with read_round() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 57: apply { t.apply(); } | ||
Replaced node at line 57: apply { t.apply(); } with my_action(9w0) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 81: guh.apply(); | ||
Replaced node at line 81: guh.apply(); with foo() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,3 @@ | ||
Eliminated node at line 127: ipv4_da_lpm.apply(); | ||
Eliminated node at line 128: mac_da.apply(); | ||
Eliminated node at line 150: send_frame.apply(); | ||
Replaced node at line 127: ipv4_da_lpm.apply(); with drop_with_count() | ||
Replaced node at line 128: mac_da.apply(); with my_drop() | ||
Replaced node at line 150: send_frame.apply(); with my_drop() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,3 @@ | ||
Eliminated node at line 306: ipv4_da_lpm.apply(); | ||
Eliminated node at line 307: mac_da.apply(); | ||
Eliminated node at line 330: send_frame.apply(); | ||
Replaced node at line 306: ipv4_da_lpm.apply(); with my_drop() | ||
Replaced node at line 307: mac_da.apply(); with my_drop() | ||
Replaced node at line 330: send_frame.apply(); with my_drop() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 97: guh.apply(); | ||
Replaced node at line 97: guh.apply(); with foo() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 57: tbl_act.apply(); | ||
Replaced node at line 57: tbl_act.apply(); with act() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 63: apply { t.apply(); } | ||
Replaced node at line 63: apply { t.apply(); } with set_port() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 57: apply { t.apply(); } | ||
Replaced node at line 57: apply { t.apply(); } with case0() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 51: apply { t.apply(); } | ||
Replaced node at line 51: apply { t.apply(); } with case0() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 59: apply { t.apply(); } | ||
Replaced node at line 59: apply { t.apply(); } with my_action(9w0) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,3 @@ | ||
Eliminated node at line 133: ipv4_da_lpm.apply(); | ||
Eliminated node at line 134: mac_da.apply(); | ||
Eliminated node at line 162: send_frame.apply(); | ||
Replaced node at line 133: ipv4_da_lpm.apply(); with my_drop() | ||
Replaced node at line 134: mac_da.apply(); with my_drop() | ||
Replaced node at line 162: send_frame.apply(); with my_drop() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,8 +1,8 @@ | ||
Eliminated node at line 290: if ((standard_metadata.instance_type == BMV2_V1MODEL_INSTANCE_TYPE_RESUBMIT)) { | ||
Eliminated node at line 293: } else if ((standard_metadata.instance_type == BMV2_V1MODEL_INSTANCE_TYPE_RECIRC)) { | ||
Eliminated node at line 297: ipv4_da_lpm.apply(); | ||
Replaced node at line 297: ipv4_da_lpm.apply(); with my_drop() | ||
Eliminated node at line 299: if (meta.fwd.l2ptr != 0) { | ||
Eliminated node at line 364: if ((standard_metadata.instance_type == BMV2_V1MODEL_INSTANCE_TYPE_INGRESS_CLONE)) { | ||
Eliminated node at line 370: } else if ((standard_metadata.instance_type == BMV2_V1MODEL_INSTANCE_TYPE_EGRESS_CLONE)) { | ||
Eliminated node at line 377: if ((standard_metadata.instance_type == BMV2_V1MODEL_INSTANCE_TYPE_REPLICATION)) { | ||
Eliminated node at line 382: send_frame.apply(); | ||
Replaced node at line 382: send_frame.apply(); with my_drop() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
Eliminated node at line 119: forward.apply(); | ||
Replaced node at line 119: forward.apply(); with miss() | ||
Eliminated node at line 121: ipRouteMulticast.apply(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
Eliminated node at line 127: forward.apply(); | ||
Replaced node at line 127: forward.apply(); with miss() | ||
Eliminated node at line 128: set_dest.apply(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,3 @@ | ||
Eliminated node at line 141: output_port.apply(); | ||
Eliminated node at line 145: tbl_hash1.apply(); | ||
Eliminated node at line 146: tbl_hash2.apply(); | ||
Replaced node at line 145: tbl_hash1.apply(); with apply_hash1() | ||
Replaced node at line 146: tbl_hash2.apply(); with apply_hash2() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,3 @@ | ||
Eliminated node at line 86: } else if (ig_dprsr_md.digest_type == 2) { | ||
Eliminated node at line 154: smac.apply(); | ||
Replaced node at line 154: smac.apply(); with smac_miss() | ||
Eliminated node at line 165: dmac.apply(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
Eliminated node at line 153: forward.apply(); | ||
Replaced node at line 153: forward.apply(); with miss() | ||
Eliminated node at line 155: ipRoute.apply(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 135: bloom_filter_1_0.apply(); | ||
Replaced node at line 135: bloom_filter_1_0.apply(); with check_bloom_filter_1() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,3 @@ | ||
Eliminated node at line 168: forward.apply(); | ||
Replaced node at line 168: forward.apply(); with miss(3w0x1) | ||
Eliminated node at line 170: ipRoute.apply(); | ||
Eliminated node at line 171: forward_timeout.apply(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
Eliminated node at line 128: forward.apply(); | ||
Replaced node at line 128: forward.apply(); with miss() | ||
Eliminated node at line 129: alpm_forward.apply(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,4 +1,4 @@ | ||
Eliminated node at line 202: ing_port.apply(); | ||
Eliminated node at line 203: ing_src_ifid.apply(); | ||
Eliminated node at line 204: ing_dmac.apply(); | ||
Replaced node at line 204: ing_dmac.apply(); with flood() | ||
Eliminated node at line 205: if (ig_md.l3 == 1) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
Eliminated node at line 130: forward.apply(); | ||
Replaced node at line 130: forward.apply(); with miss() | ||
Eliminated node at line 131: forward_dst.apply(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
Eliminated node at line 119: t.apply(); | ||
Eliminated node at line 121: p.apply(); | ||
Replaced node at line 119: t.apply(); with drop() | ||
Replaced node at line 121: p.apply(); with drop() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 126: port_md_exm_match.apply(); | ||
Replaced node at line 126: port_md_exm_match.apply(); with miss() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 135: port_md_exm_match.apply(); | ||
Replaced node at line 135: port_md_exm_match.apply(); with miss() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
Eliminated node at line 128: forward.apply(); | ||
Replaced node at line 128: forward.apply(); with miss() | ||
Eliminated node at line 130: ipRoute.apply(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 61: bypass_egress.apply(); | ||
Replaced node at line 61: bypass_egress.apply(); with set_bypass_egress() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
Eliminated node at line 102: forward.apply(); | ||
Replaced node at line 102: forward.apply(); with miss() |
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Well, we can still add some form of eliminated node here. Otherwise we do not track that we have modified the table here. What do you think?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
In the sense of
eliminatedNodes.push_back(stmt);
or something similar. Our current ref files do not quite capture this ambiguity.There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Yes. I think a better way is to create another vector to store these because they are not simply eliminated. What do you think?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You could make it a vector of pairs, with the original node and the replaced node.
There is a question on the performance impact when we keep adding nodes. Recall that this code may run on every control-plane update message. But I do not think it will have much impact because we only invoke the elimination when the semantics have changed. Still, it's something we should keep in mind.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
That sounds good. I will do it soon.
And yes, I agree on the performance thing.