search for: nothingderived

...is incomplete (in a way) when it's not perform *after* inlining and constant propagation. It seems to me therefore that because of this we are missing optimization opportunities. Suppose the following example program: #include <cstdio> struct Base { virtual void foo() = 0; }; struct NothingDerived: Base { virtual void foo() {} }; struct PrintDerived: Base { virtual void foo() { printf("Hello World!"); } }; Base& select(int i) { static NothingDerived nd; static PrintDerived pd; if (i % 2 == 0) { return nd; } return pd; } int main() { Base& b = select(0...

...is incomplete (in a way) when it's not perform *after* inlining and constant propagation. It seems to me therefore that because of this we are missing optimization opportunities. Suppose the following example program: #include <cstdio> struct Base { virtual void foo() = 0; }; struct NothingDerived: Base { virtual void foo() {} }; struct PrintDerived: Base { virtual void foo() { printf("Hello World!"); } }; Base& select(int i) { static NothingDerived nd; static PrintDerived pd; if (i % 2 == 0) { return nd; } return pd; } int main() { Base& b = select(0...

...pagation. >> >> >> It seems to me therefore that because of this we are missing >> optimization opportunities. Suppose the following example program: >> >> #include <cstdio> >> >> struct Base { virtual void foo() = 0; }; >> >> struct NothingDerived: Base { virtual void foo() {} }; >> >> struct PrintDerived: Base { virtual void foo() { printf("Hello World!"); } }; >> >> Base& select(int i) { >> static NothingDerived nd; >> static PrintDerived pd; >> if (i % 2 == 0) { return nd...

...m *after* > inlining and constant propagation. > > > It seems to me therefore that because of this we are missing > optimization opportunities. Suppose the following example program: > > #include <cstdio> > > struct Base { virtual void foo() = 0; }; > > struct NothingDerived: Base { virtual void foo() {} }; > > struct PrintDerived: Base { virtual void foo() { printf("Hello World!"); } }; > > Base& select(int i) { > static NothingDerived nd; > static PrintDerived pd; > if (i % 2 == 0) { return nd; } > return pd; >...

...; It seems to me therefore that because of this we are missing > >> optimization opportunities. Suppose the following example program: > >> > >> #include <cstdio> > >> > >> struct Base { virtual void foo() = 0; }; > >> > >> struct NothingDerived: Base { virtual void foo() {} }; > >> > >> struct PrintDerived: Base { virtual void foo() { printf("Hello > World!"); } }; > >> > >> Base& select(int i) { > >> static NothingDerived nd; > >> static PrintDerived pd; >...

...hat because of this we are missing >> >> optimization opportunities. Suppose the following example program: >> >> >> >> #include <cstdio> >> >> >> >> struct Base { virtual void foo() = 0; }; >> >> >> >> struct NothingDerived: Base { virtual void foo() {} }; >> >> >> >> struct PrintDerived: Base { virtual void foo() { printf("Hello >> >> World!"); } }; >> >> >> >> Base& select(int i) { >> >> static NothingDerived nd; >> >&...

...issing >>> >> optimization opportunities. Suppose the following example program: >>> >> >>> >> #include <cstdio> >>> >> >>> >> struct Base { virtual void foo() = 0; }; >>> >> >>> >> struct NothingDerived: Base { virtual void foo() {} }; >>> >> >>> >> struct PrintDerived: Base { virtual void foo() { printf("Hello >>> >> World!"); } }; >>> >> >>> >> Base& select(int i) { >>> >> static NothingDe...