Documentation\aoe\todo

Chinese translated version of Documentation\aoe\todo

If you have any comment or update to the content, please contact the
original document maintainer directly.  However, if you have a problem
communicating in English you can also ask the Chinese maintainer for
help.  Contact the Chinese maintainer if this translation is outdated
or if there is a problem with the translation.

Chinese maintainer: 赵晶  [e-mail]
---------------------------------------------------------------------
Documentation\aoe\todo 的中文翻译

如果想评论或更新本文的内容，请直接联系原文档的维护者。如果你使用英文
交流有困难的话，也可以向中文版维护者求助。如果本翻译更新不及时或者翻
译存在问题，请联系中文版维护者。

中文版维护者： 赵晶  [e-mail]
中文版翻译者： 赵晶  [e-mail]
中文版校译者： 赵晶  [e-mail]

以下为正文
---------------------------------------------------------------------
There is a potential for deadlock when allocating a struct sk_buff for
data that needs to be written out to aoe storage.  If the data is
being written from a dirty page in order to free that page, and if
there are no other pages available, then deadlock may occur when a
free page is needed for the sk_buff allocation.  This situation has
not been observed, but it would be nice to eliminate any potential for
deadlock under memory pressure.

死锁有一个潜力，当为数据分配sk_buff结构时

需要写入AOE存储。如果数据

在脏页中被写是为了释放那个网页，并且如果

没有可用的其他页面，那么可能会发生死锁当

空白网页在为sk_buff分配时被需要。这种情况

没有被观察到，但好在它会消除任何潜在的死锁在

内存压力下。

Because ATA over Ethernet is not fragmented by the kernel's IP code,
the destructor member of the struct sk_buff is available to the aoe
driver.  By using a mempool for allocating all but the first few
sk_buffs, and by registering a destructor, we should be able to
efficiently allocate sk_buffs without introducing any potential for
deadlock.

因为ATA在以太网上不是由内核的IP代码分段，

这个sk_buff结构的析构函数成员是可用的，对于AOE

驱动。通过使用一个mempool分配所有但第一次，几个

sk_buffs，并通过注册析构函数，我们应该能够

有效地分配sk_buffs，并且没有引入任何死锁的可能。