Skip to content
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

Refactor bevy_mikktspace into idiomatic Rust #4932

Closed
wants to merge 44 commits into from

Conversation

DJMcNab
Copy link
Member

@DJMcNab DJMcNab commented Jun 5, 2022

Objective

  • bevy_mikktspace's use of unsafe is concerning.
  • Eventually, we want this to be #[forbid(unsafe_code)]
  • The refactor needs to maintain the same behaviour.

Solution

  • Do small refactoring on the unsafe version (e.g. moving variables down to their declarations, adding comments)
  • Chip away at the unsafe code
  • Refactor some of the gnarlier parts to use standard facilities

@alice-i-cecile alice-i-cecile added A-Rendering Drawing game state to the screen C-Code-Quality A section of code that is hard to understand or change labels Jun 5, 2022
@alice-i-cecile
Copy link
Member

Yes please. Fundamentally from what I can see there's nothing in this algorithm that should require the use of unsafe.

@alice-i-cecile alice-i-cecile added the P-Unsound A bug that results in undefined compiler behavior label Jun 5, 2022
@alice-i-cecile
Copy link
Member

I'm giving this the Unsound label. I haven't proven that there's UB in the original auto-translated code, I would be very very surprised if there was none. Even if there isn't, the safety hazards of having this code around in the current form are very high due to the extreme challenges working with the existing code correctly.

@DJMcNab DJMcNab marked this pull request as ready for review June 23, 2022 11:56
@DJMcNab
Copy link
Member Author

DJMcNab commented Jun 24, 2022

bors try

Failure seems to be spurious?

Note to reviewers: This isn't used at all internally, so hopefully there are no behaviour changes, but I don't care significantly if there are :).

Good future work is adding comparison fuzzing with the original C code's output (note: not the Rust port, since that definitely has UB).
Calling C code which has UB from Rust might itself be UB - and original mikktspace apparently has UB. Therefore, we'd probably need to compile the original C to WASM for this?

bors bot added a commit that referenced this pull request Jun 24, 2022
@superdump
Copy link
Contributor

superdump commented Jun 24, 2022

I would like to review this before it is merged. Just mentioning that so it doesn’t get merged before I’ve taken a look.

I have not yet reviewed the PR so the following comments are not based on having seen the changes, just on awareness that this PR makes changes to numerically-sensitive code. I’m concerned about the numeric behaviour of any changes. I know @DJMcNab is aware of this concern and I trust that care has been taken. Still I feel it is easy to unintentionally change arithmetic behaviour. Ideally there would be a comprehensive set of regression tests for this kind of thing, as @DJMcNab suggests, comparing against the behaviour of the original the scope of verifying numeric results are the same. I suppose as we have the flight helmet model in the repo, one thing we could do is to generate tangents for that using the original C code and store those in the repo, and generate tangents using this code and compare. It wouldn’t be a set of tests targeted at edge/corner cases but it would at least test something.

Note to reviewers: This isn't used at all internally, so hopefully there are no behaviour changes, but I don't care significantly if there are :).

I don’t understand this comment. What isn’t used internally?

@DJMcNab
Copy link
Member Author

DJMcNab commented Jun 24, 2022

So what I mean is my priority is removing the unsound implemenation more than having exactly the same behaviour as the C code.

As an examplel, the original C code is completely careless in their handling of NaN/Infinity, and so I'm fairly sure we have different behaviour there (more panicky). However, I think the original's behaviour would still be completely wrong anyway.
As far as I know, the only changes I've made to the behaviour are cases where NaN/Infinity (/maybe subnormals) crop up.

The vast majority of the code doesn't do any floating point handling, and is just moving data around in hilariously evil ways.
The parts that do floating point operations, I think I've done an exact translation.

@superdump
Copy link
Contributor

So what I mean is my priority is removing the unsound implemenation more than having exactly the same behaviour as the C code.

How do you define behaviour? It is only the numeric results that I care about being consistent. How it gets there, aside from performance, code maintenance, API ergonomics, etc, is secondary.

As an examplel, the original C code is completely careless in their handling of NaN/Infinity, and so I'm fairly sure we have different behaviour there (more panicky). However, I think the original's behaviour would still be completely wrong anyway. As far as I know, the only changes I've made to the behaviour are cases where NaN/Infinity (/maybe subnormals) crop up.

NaN/infinity aren’t always invalid in shader land. There is a trick used to discard vertices by setting their position to NaN for example. I’d be careful about deciding to explicitly check and handle NaNs unless it is very clear that a NaN at that point is invalid and has to be handled.

The vast majority of the code doesn't do any floating point handling, and is just moving data around in hilariously evil ways. The parts that do floating point operations, I think I've done an exact translation.

Right, totally down with making how the data is moved around be safe and rusty. And if indeed the float operations are an exact translation (including allowing NaNs or whatever, I guess, until proven that handling them differently is the correct thing to do) then this sounds great. Just saying this for the purpose of alignment. :)

@DJMcNab
Copy link
Member Author

DJMcNab commented Jun 24, 2022

As an example, as far as I can tell, if there's a single vertex with infinite position, this line means that none of the vertices get merged.
However, identical vertices being merged is relied upon for correctness.

So, assuming that all positions are finite, what next?

Following through the code, eventually you get to calling m_setTSpace with NaN or Infinity vectors, which breaks the contract of that method.

This is in C api rules, which best as I can tell is that any input which gets garbage out must be an illegal input.

The only mention of NaN handling in mikktspace I can find is here, which prevents an infinite loop when they occur. In the original paper, the word NaN does not appear, not does Infinity except in a single mention for (as best as I can tell) something unrelated.

Additionally, as best as I can tell from a quick check, weird values are forbidden in GLTF.

Basically, I'm pretty confident that panicking in the prescense of NaN/infinity is fine.

@superdump superdump requested a review from cart July 9, 2022 16:36
@superdump superdump added this to the Bevy 0.8 milestone Jul 9, 2022
@cart cart removed this from the Bevy 0.8 milestone Jul 16, 2022
@alice-i-cecile alice-i-cecile added the D-Complex Quite challenging from either a design or technical perspective. Ask for help! label Jan 26, 2023
@DJMcNab
Copy link
Member Author

DJMcNab commented Jul 6, 2023

I'm not likely to drive this forward, so I'll defer to #9050

@cart cart closed this Jul 7, 2023
@DJMcNab DJMcNab deleted the mikktsafe branch July 8, 2023 06:47
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
A-Rendering Drawing game state to the screen C-Code-Quality A section of code that is hard to understand or change D-Complex Quite challenging from either a design or technical perspective. Ask for help! P-Unsound A bug that results in undefined compiler behavior
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants