You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The compiler generates very complex expression tree graphs for certain operations. A lot of it is for speed reasons, but there are cases where the currently used scheme makes the IL instruction count balloon out of control.
We should look into reducing the IL size, even if it requires us to sacrifice performance in a few cases. I'm going to document the exact cases where the IL balooning happen and track the progress of reducing it in here.
The text was updated successfully, but these errors were encountered:
The compiler generates very complex expression tree graphs for certain operations. A lot of it is for speed reasons, but there are cases where the currently used scheme makes the IL instruction count balloon out of control.
We should look into reducing the IL size, even if it requires us to sacrifice performance in a few cases. I'm going to document the exact cases where the IL balooning happen and track the progress of reducing it in here.
The text was updated successfully, but these errors were encountered: