Understanding the Empty Base Optimization

http://www.informit.com/guides/content.aspx?g=cplusplus&seqNum=319

The Empty Base class optimization enables an implementation to reduce the size of a base class subobject to zero. Although it’s not required by the standard, many compilers now implement this optimization. Let’s see how the EBO works and what its impact on performance is.

Is An Empty Object Possible?

When I discussed the C++ object model a couple of years ago, I briefly touched on the issue of "empty classes". An empty class is one that contain no nonstatic data members, either directly or indirectly (i.e., inherited from a base class). Here are a few such "empty classes":

struct S 
{
 S(); //not a POD type
 ~S();
};
class A
{
 static int x; //static data members are stored outside the object
};

Many C++ programmers are surprised to discover that the size of both A and S isn’t zero. On atypical implementation, sizeof(S) and sizeof(A) equal 1. The reason for this policy is arrays. C and C++ require that arrays shall have contiguous storage, and that each element in an array shall have a unique address. To meet these two requirements, an object’s size must be at least 1 byte.

This is an opportunity to dispel two common myths about the C++ object model: member functions aren’t represented as pointers to functions or pointers to member functions inside an object. In fact, they have no representation at all inside the object. Therefore, no matter how many non virtual member functions a class has, their number doesn’t affect its size. Similarly, static data members are stored in a memory location that doesn’t belong to any object. Therefore, the presence of static data members (and of course, static member functions) doesn’t affect the object’s size either. With respect to their binary layout, S and A are identical: objects of these classes contain a 1 or more dummy bytes.

Empty with Virtual Functions

When you add a virtual destructor or any other virtual member function to a class, that class becomes polymorphic. Although the C++ standard doesn’t specify the implementation details of polymorphic objects, in practice all implementations insert into every polymorphic object an implicit data member equal to the size of a pointer. Therefore, it’s reasonable to assume that the following polymorphic classes, which contain no overt nonstatic data members, have the same size of a pointer:

struct D
{
virtual ~D();
};
class G
{
public:
virtual f(); 
};
class H: public D{};

Put differently, you can assume that:

sizeof (H) == sizeof(D)==sizeof(G)==sizeof(void*)

Strictly speaking, these classes aren’t empty because they contain an implicit data member, i.e., the vptr. What happens when any of these classes become a base class of another class?

The Empty Optimization in Action

When a strictly-empty class such as S becomes a base of another class T, you would expect that the memory block of T should first contain the suobject S, immediately followed by the subobject T. In other words, the first byte of T should be the inherited dummy byte of S, followed by any other nonstatic data members declared in T:

struct T: S
{
int x;
};

Indeed, that’s exactly what older compilers would do. They would calculate the size of T assizeof(S) + sizeof(int). On a typical 32 bit system, the result would be 5. In practice, compilers increase the size of a class so that it fits the memory alignment requirements of the target platform. A four-byte alignment implementation will therefore increase the size of T from 5 to 8. This is a serious waste of space. After all, only 50% of the space that T occupies is used for real data, whereas the remaining 50% are unused. One could argue that a waste of four bytes is no big deal. However, a typical C++ application nowadays uses containers that store, manipulate and rearrange hundreds, thousands or millions of objects. Since most containers store value objects, not pointers or references, this means that every container of T objects occupies twice the amount of memory that it really needs. That’s hardly acceptable.

Luckily, compiler vendors found an escape clause in the standard that allows them to fix this loophole. Indeed, the standard requires that the size of an object shall never be zero; it also requires that in a derived object data members of the base class(es) shall appear before user-declared data members of the derived class. However, a base class subobject isn’t considered a complete object. Therefore, it’s possible to remove the base class subobject from the derived object without violating the rules. In other words, in the object t, the offset of S and x may overlap:

T t;

This is in essence what the EBO is all about. Notice that we didn’t lose any data or code accuracy: when you create a standalone object of type S, the object’s size is still 1 (or more) as before; only when S is used as base class of another class does its memory footprint shrink to zero. To realize the impact of this saving, imagine a vector<T> that contains 125,000 objects. The EBO alone saves half a megabyte of memory!

EBO and Polymorphic Classes

T isn’t a typical example of using public inheritance though. Normally, a base class is polymorphic. What happens when you derive from an empty but polymorphic base class? Seemingly, the base class isn’t empty so the EBO shouldn’t apply. This isn’t necessarily the case though. Let’s look at two examples:

class S2: public D {}; //D is polymorphic
class T2: public D
{
public:
virtual func();
};
T2 t2;

S2 and T2 inherit from the same polymorphic base class D. The memory layout of S2 is the same as that of D, since S doesn’t introduce new non-static data members. So in a way you could see the same optimization trick used here as well, except that this time, it’s the derived class that gets optimized -- if S2 were an empty class without a base class, its size would be larger than zero. This is a trivial case though. T2 is more interesting. T2 introduces a new virtual function. It also inherits avptr from its polymorphic base class. Will T2 end up having two vptrs? Not really. The memory layout of T2 is the same as that of D. This is because new virtual members in a derived class don’t cause a new vptr to be added. Rather, the inherited vptr is simply assigned a different value (i.e., it holds the address of a different virtual table). Consequently, sizeof(T2) is the same as sizeof(D). As with the EBO, you have two subobjects (the base subobject and the derived subobject) sharing the same memory address within the complete object t2.


《餐馆点餐管理系统——基于Java和MySQL的课程设计解析》 在信息技术日益发达的今天,餐饮行业的数字化管理已经成为一种趋势。本次课程设计的主题是“餐馆点餐管理系统”,它结合了编程语言Java和数据库管理系统MySQL,旨在帮助初学者理解如何构建一个实际的、具有基本功能的餐饮管理软件。下面,我们将深入探讨这个系统的实现细节及其所涉及的关键知识点。 我们要关注的是数据库设计。在“res_db.sql”文件中,我们可以看到数据库的结构,可能包括菜品表、订单表、顾客信息表等。在MySQL中,我们需要创建这些表格并定义相应的字段,如菜品ID、名称、价格、库存等。此外,还要设置主键、外键来保证数据的一致性和完整性。例如,菜品ID作为主键,确保每个菜品的唯一性;订单表中的顾客ID和菜品ID则作为外键,与顾客信息表和菜品表关联,形成数据间的联系。 接下来,我们来看Java部分。在这个系统中,Java主要负责前端界面的展示和后端逻辑的处理。使用Java Swing或JavaFX库可以创建用户友好的图形用户界面(GUI),让顾客能够方便地浏览菜单、下单。同时,Java还负责与MySQL数据库进行交互,通过JDBC(Java Database Connectivity)API实现数据的增删查改操作。在程序中,我们需要编写SQL语句,比如INSERT用于添加新的菜品信息,SELECT用于查询所有菜品,UPDATE用于更新菜品的价格,DELETE用于删除不再提供的菜品。 在系统设计中,我们还需要考虑一些关键功能的实现。例如,“新增菜品和价格”的功能,需要用户输入菜品信息,然后通过Java程序将这些信息存储到数据库中。在显示所有菜品的功能上,程序需要从数据库获取所有菜品数据,然后在界面上动态生成列表或者表格展示。同时,为了提高用户体验,可能还需要实现搜索和排序功能,允许用户根据菜品名称或价格进行筛选。 另外,安全性也是系统设计的重要一环。在连接数据库时,要避免SQL注入攻击,可以通过预编译的PreparedStatement对象来执行SQL命令。对于用户输入的数据,需要进行验证和过滤,防止非法字符和异常值。 这个“餐馆点餐管理系统”项目涵盖了Java编程、数据库设计与管理、用户界面设计等多个方面,是一个很好的学习实践平台。通过这个项目,初学者不仅可以提升编程技能,还能对数据库管理和软件工程有更深入的理解。在实际开发过程中,还会遇到调试、测试、优化等挑战,这些都是成长为专业开发者不可或缺的经验积累
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值