Effective replacement of dynamic polymorphism with std::variant

12.04.2019 Effective replacement of dynamic polymorphism with std::variant
file:///C:/repos/cppTrainings/build/out/polymorphism_with_variant/polymorphism_with_variant.html#108 1/108
Mateusz Pusz
April 12, 2019
E ective replacement of dynamic
polymorphism with
std::variant

Why?

• Time required to perform some action or to produce some result
• Measured in units of time like hours, minutes, seconds, nanoseconds or clock periods
ACCU 2019 | E ective replacement of dynamic polymorphism with std::variant
Why?
LATENCY
3

• Time required to perform some action or to produce some result
• Measured in units of time like hours, minutes, seconds, nanoseconds or clock periods
• In capital markets, the use of algorithmic trading to react to market events faster than the competition
to increase profitability of trades
• Many use cases where predictability of latency in message delivery is just as important, if not more
important than achieving a low average latency
Why?
LATENCY
LOW LATENCY
3

• In Low Latency system we care a lot about
WCET (Worst Case Execution Time)
• In order to limit WCET we should limit the
usage of specific C++ language features
How NOT to develop software that have predictable
performance?
4

Things to avoid on the fast path
5

• C++ tools that trade performance for usability (e.g. std::shared_ptr, std::function)
5

• Throwing exceptions on a likely code path
5

• Dynamic polymorphism
5

• Multiple inheritance
5

• RTTI
5

• RTTI
• Dynamic memory allocations
5

• Dynamic memory allocations
• RTTI
6

How?

class base : noncopyable {
public:
virtual ~base() = default;
virtual void foo() = 0;
};
class x : public base {
public:
void foo() override;
};
class y : public base {
public:
};
std::unique_ptr<base> b = std::make_unique<x>();
b->foo();
How?
DYNAMIC POLYMORPHISM
8

public:
};
public:
};
public:
};
b->foo();
How?
DYNAMIC POLYMORPHISM
8

public:
};
public:
};
public:
};
b->foo();
struct x { void foo(); };
struct y { void foo(); };
std::variant<x, y> b;
std::visit([](auto&& v){ v.foo(); }, b);
• Shorter
• Faster
• Value semantics
• Works on unrelated classes
• More flexible thanks to duck typing
How?
DYNAMIC POLYMORPHISM VARIANT
8

THE END
T H A N K Y O U !
9

Bonus slides

Abstract machine that can be in exactly one of a finite number of
states at any given time.
-- Wikipedia
Finite State Machine
11

12

• State changes to another in a response to
some external inputs called events
12

• The change from one state to another is
called a transition
12

• The change from one state to another is
called a transition
• A FSM is defined by
– a list of states
– its initial state
– the conditions for each transition
12

Single dynamic dispatch
CASE #1

Class diagram
14

template<typename Event>
class state : noncopyable {
public:
virtual ~state() = default;
virtual std::unique_ptr<state> on_event(Event) = 0;
};
15

public:
};
class fsm {
std::unique_ptr<state<Event>> state_;
public:
explicit fsm(std::unique_ptr<state<Event>> state) : state_(std::move(state)) {}
void dispatch(Event e)
{
auto new_state = state_->on_event(e);
if(new_state)
state_ = std::move(new_state);
}
};
15

public:
};
class fsm {
std::unique_ptr<state<Event>> state_;
public:
explicit fsm(std::unique_ptr<state<Event>> state) : state_(std::move(state)) {}
void dispatch(Event e)
{
auto new_state = state_->on_event(e);
if(new_state)
}
};
16

class connection_fsm : public fsm<event> {
public:
connection_fsm():
fsm<event>(std::make_unique<state_idle>()) {}
};
Connection FSM
17

public:
connection_fsm():
};
using s = state<event>;
Connection FSM
17

public:
connection_fsm():
};
using s = state<event>;
class state_idle final : public s {
public:
std::unique_ptr<s> on_event(event e) override;
};
class state_connecting final : public s {
static constexpr int n_max = 3;
int n = 0;
public:
};
class state_connected final : public s {
public:
};
Connection FSM
17

std::unique_ptr<s> state_idle::on_event(event e)
{
}
std::unique_ptr<s> state_connecting::on_event(event e)
{
}
std::unique_ptr<s> state_connected::on_event(event e)
{
}
Transitions
18

{
if(e == event::connect)
return std::make_unique<state_connecting>();
return nullptr;
}
{
}
{
}
Transitions
18

{
return nullptr;
}
{
switch(e) {
case event::connected:
return std::make_unique<state_connected>();
case event::timeout:
return ++n < n_max ?
nullptr : std::make_unique<state_idle>();
default:
return nullptr;
}
}
{
}
Transitions
18

{
return nullptr;
}
{
switch(e) {
default:
return nullptr;
}
}
{
if(e == event::disconnect)
return std::make_unique<state_idle>();
return nullptr;
}
Transitions
18

{
return nullptr;
}
{
switch(e) {
default:
return nullptr;
}
}
{
if(e == event::disconnect)
return nullptr;
}
The slow part
19

• Fold expressions come handy ;-)
template<typename Fsm, typename... Events>
void dispatch(Fsm& fsm, Events... events)
{
(fsm.dispatch(events), ...);
}
Testing transitions
20

• Fold expressions come handy ;-)
void dispatch(Fsm& fsm, Events... events)
{
(fsm.dispatch(events), ...);
}
• Simple message flow
connection_fsm fsm;
dispatch(fsm, event::connect, event::timeout, event::connected, event::disconnect);
Testing transitions
20

• Open to new alternatives
– new derived types may be added by clients at any point of time (long a er base class
implementation is finished)
21

• Closed to new operations
– clients cannot add new operations to dynamic dispatch
21

• Multi-level
– many levels of inheritance possible
21

• Multi-level
• Object Oriented
– whole framework is based on objects
21

Double dynamic dispatch
CASE #2

class event : noncopyable {
public:
virtual ~event() = default;
};
class event_connect final : public event {
std::string_view address_;
public:
explicit event_connect(std::string_view address): address_(address) {}
std::string_view address() const { return address_; }
};
What if we want our events to pass data?
23

public:
};
public:
};
std::unique_ptr<state> state_idle::on_event(const event& e)
{
if(auto ptr = dynamic_cast<const event_connect*>(&e)) { /* ... */ }
else { /* ... */ }
}
23

public:
};
public:
};
std::unique_ptr<state> state_idle::on_event(const event& e)
{
if(auto ptr = dynamic_cast<const event_connect*>(&e)) { /* ... */ }
else { /* ... */ }
}
A really bad idea :-(
23

Special form of multiple dispatch, and a mechanism that
dispatches a function call to di erent concrete functions
depending on the runtime types of two objects involved in the call
-- Wikipedia
Double dispatch (aka Visitor Pattern)
24

template<typename State>
struct event : private noncopyable {
virtual std::unique_ptr<State> dispatch(State& s) const = 0;
};
25

};
template<typename State, typename Event>
class fsm {
std::unique_ptr<State> state_;
public:
explicit fsm(std::unique_ptr<State> state) : state_(std::move(state)) {}
void dispatch(const Event& e)
{
auto new_state = e.dispatch(*state_);
if(new_state)
}
};
25

};
struct event_connect final : public event<state> {
std::unique_ptr<state> dispatch(state& s) const override { return s.on_event(*this); }
// ...
};
struct event_connected final : public event<state> {
};
struct event_disconnect final : public event<state> {
};
struct event_timeout final : public event<state> {
};
26

};
public:
virtual std::unique_ptr<state> on_event(const event_connect&) { return nullptr; }
virtual std::unique_ptr<state> on_event(const event_connected&) { return nullptr; }
virtual std::unique_ptr<state> on_event(const event_disconnect&) { return nullptr; }
virtual std::unique_ptr<state> on_event(const event_timeout&) { return nullptr; }
};
27

};
public:
virtual std::unique_ptr<state> on_event(const event_connect&) { return nullptr; }
virtual std::unique_ptr<state> on_event(const event_connected&) { return nullptr; }
virtual std::unique_ptr<state> on_event(const event_disconnect&) { return nullptr; }
virtual std::unique_ptr<state> on_event(const event_timeout&) { return nullptr; }
};
class state_idle final : public state {
public:
using state::on_event;
std::unique_ptr<state> on_event(const event_connect& e) override
{
return std::make_unique<state_connecting>(std::string(e.address()));
}
};
27

Class diagram
28

};
struct event_connect final : public event<state> {
// ...
};
struct event_connected final : public event<state> {
};
struct event_disconnect final : public event<state> {
};
struct event_timeout final : public event<state> {
};
Curiously Recurring Template Pattern (CRTP)
29

};
template<typename Child>
struct event_crtp : event<state> {
std::unique_ptr<state> dispatch(state& s) const override { return s.on_event(*static_cast<const Child*>(this)); }
};
30

};
};
struct event_connect final : public event_crtp<event_connect> {
// ...
};
struct event_connected final : public event_crtp<event_connected> {};
struct event_disconnect final : public event_crtp<event_disconnect> {};
struct event_timeout final : public event_crtp<event_timeout> {};
30

};
};
struct event_connect final : public event_crtp<event_connect> {
private:
};
struct event_connected final : public event_crtp<event_connected> {};
struct event_disconnect final : public event_crtp<event_disconnect> {};
struct event_timeout final : public event_crtp<event_timeout> {};
• Hey look ma, now all fits on one slide ;-)
31

std::unique_ptr<state>
state_idle::on_event(const event_connect& e)
{
}
state_connecting::on_event(const event_connected&)
{
}
state_connecting::on_event(const event_timeout&)
{
}
state_connected::on_event(const event_disconnect&)
{
}
Transitions
32

{
return std::make_unique<state_connecting>(
std::string{e.address()});
}
{
}
{
}
{
}
Transitions
32

{
}
{
}
{
}
{
}
Transitions
32

{
}
{
}
{
}
{
}
The slow part
33

void dispatch(Fsm& fsm, const Events&... events)
{
(fsm.dispatch(*events), ...);
}
Testing transitions
34

{
}
dispatch(fsm,
std::make_unique<event_connect>("train-it.eu"),
std::make_unique<event_timeout>(),
std::make_unique<event_connected>(),
std::make_unique<event_disconnect>());
Testing transitions
34

{
}
dispatch(fsm,
std::make_unique<event_connect>("train-it.eu"),
std::make_unique<event_timeout>(),
std::make_unique<event_connected>(),
std::make_unique<event_disconnect>());
The slow part
35

• Closed to new alternatives
– one of class hierarchies fixed at design time and cannot be extended by clients
• Multi-level
• Object Oriented
– whole framework is based on objects
Double dynamic dispatch (aka Visitor Pattern)
36

Variant + external transitions
CASE #3

struct event_connect { std::string_view address; };
struct event_connected {};
struct event_disconnect {};
struct event_timeout {};
using event = std::variant<event_connect, event_connected, event_disconnect, event_timeout>;
Events and states
EVENTS
38

struct event_connect { std::string_view address; };
struct event_connected {};
struct event_disconnect {};
struct event_timeout {};
using event = std::variant<event_connect, event_connected, event_disconnect, event_timeout>;
struct state_idle {};
struct state_connecting {
static constexpr int n_max = 3;
int n = 0;
std::string address;
};
struct state_connected {};
using state = std::variant<state_idle, state_connecting, state_connected>;
Events and states
EVENTS
STATES
38

struct transitions {
optional<state> operator()(state_idle&,
const event_connect& e)
{ }
optional<state> operator()(state_connecting&,
const event_connected&)
{ }
optional<state> operator()(state_connecting& s,
const event_timeout&)
{
}
optional<state> operator()(state_connected&,
const event_disconnect&)
{ }
};
Transitions
39

{ return state_connecting{std::string(e.address)}; }
{ }
{
}
{ }
};
Transitions
39

{ return state_connected{}; }
{
}
{ }
};
Transitions
39

{
return ++s.n < state_connecting::n_max ?
std::nullopt : optional<state>(state_idle{});
}
{ }
};
Transitions
39

{
}
{ return state_idle{}; }
};
Transitions
39

{
}
optional<state> operator()(State&,
const Event&) const
{ return std::nullopt; }
};
Transitions
39

template<typename StateVariant, typename EventVariant, typename Transitions>
class fsm {
StateVariant state_;
public:
void dispatch(const EventVariant& event)
{
std::optional<StateVariant> new_state = std::visit(Transitions{}, state_, event);
if(new_state)
state_ = *std::move(new_state);
}
};
using connection_fsm = fsm<state, event, transitions>;
FSM engine
40

class fsm {
public:
{
if(new_state)
}
};
FSM engine
41

class fsm {
public:
{
if(new_state)
}
};
FSM engine
42

Class diagram
43

void dispatch(Fsm& fsm, Events&&... events)
{
(fsm.dispatch(std::forward<Events>(events)), ...);
}
dispatch(fsm,
event_connect{"train-it.eu"},
event_timeout{},
event_connected{},
event_disconnect{});
Testing transitions
44

Variant + transitions in FSM
CASE #4

template<typename Derived, typename StateVariant, typename EventVariant>
class fsm {
public:
{
auto new_state = std::visit(
state_, event);
if(new_state)
}
};
FSM engine
46

template<typename Derived, typename StateVariant, typename EventVariant>
class fsm {
public:
{
Derived& child = static_cast<Derived&>(*this);
[&](auto& s, const auto& e) -> std::optional<StateVariant>
{ return child.on_event(s, e); },
state_, event);
if(new_state)
}
};
• CRTP again ;-)
FSM engine
46

template<typename Derived, typename StateVariant>
class fsm {
public:
void dispatch(Event&& event)
{
Derived& child = static_cast<Derived&>(*this);
[&](auto& s) -> std::optional<StateVariant>
{ return child.on_event(s, std::forward<Event>(event)); },
state_);
if(new_state)
}
};
• Visitation on a StateVariant only
FSM engine: dispatch() as an overload set
47

class connection_fsm
: public fsm<connection_fsm, state> {
public:
auto on_event(state_idle&,
{ }
auto on_event(state_connecting&,
{ }
auto on_event(state_connecting& s,
{
}
auto on_event(state_connected&,
{ }
auto on_event(State&, const Event&)
{ }
};
Transitions de ned by the FSM itself
48

class connection_fsm
: public fsm<connection_fsm, state> {
public:
auto on_event(state_idle&,
auto on_event(state_connecting&,
auto on_event(state_connecting& s,
{
std::nullopt : std::optional<state>(state_idle{});
}
auto on_event(state_connected&,
auto on_event(State&, const Event&)
{ return std::nullopt; }
};
Transitions de ned by the FSM itself
48

Class diagram
49

What about performance?

CLOSED(Start)
LISTEN/-
CLOSE/-
LISTEN
SYN
RECEIVED
SYN
SENT
CONNECT/ (Step 1 of the 3-way-handshake)SYN
SYN/SYN+ACK(Step 2 of the 3-way-handshake)
unusual event
client/receiver path
server/sender path
RST/-
SYN/SYN+ACK (simultaneous open)
SYN+ACK/ACK
(Step 3 of the 3-way-handshake)
Data exchange occurs
ESTABLISHED
FIN/ACK
ACK/-
CLOSE/-
SEND/SYN
CLOSE/FIN
CLOSE/FIN
CLOSING
TIME WAIT
CLOSED
FIN WAIT 1
FIN WAIT 2
CLOSE WAIT
LAST ACK
CLOSE/FIN
FIN/ACK
FIN+ACK/ACK
ACK/-
FIN/ACK
Timeout
(Go back to start)
Active CLOSE Passive CLOSE
ACK/-
ACK/-
TCP state diagram
51

TCP FSM Performance
52

Summary

std::variant<Types...> vs inheritance
INHERITANCE VARIANT
54

• Open/Closed to new alternatives • Closed to new alternatives
INHERITANCE VARIANT
54

• Open/Closed to new alternatives
• Open to new operations
INHERITANCE VARIANT
54

• Multi-level
• Single level
INHERITANCE VARIANT
54

• Multi-level
• OO
• Single level
• Functional
INHERITANCE VARIANT
54

• Multi-level
• OO
• Pointer semantics
• Single level
• Functional
• Value semantics
INHERITANCE VARIANT
54

• Multi-level
• OO
• Design forced by the implementation details
• Single level
• Functional
• Value semantics
• Many design choices possible
INHERITANCE VARIANT
54

• Multi-level
• OO
• Forces dynamic memory allocations
• Single level
• Functional
• Value semantics
• No dynamic memory allocations
INHERITANCE VARIANT
54

• Multi-level
• OO
• Strict interfaces
• Single level
• Functional
• Value semantics
• Duck typing
INHERITANCE VARIANT
54

• Multi-level
• OO
• Complex
• Single level
• Functional
• Value semantics
• Duck typing
• Simple
INHERITANCE VARIANT
54

• Multi-level
• OO
• Complex
• Slower
• Single level
• Functional
• Value semantics
• Duck typing
• Simple
• Faster
INHERITANCE VARIANT
54

Effective replacement of dynamic polymorphism with std::variant

More Related Content

Similar to Effective replacement of dynamic polymorphism with std::variant (20)

More from Mateusz Pusz (12)

Recently uploaded (20)

Effective replacement of dynamic polymorphism with std::variant