Documentation/aoe/todo.txt

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: 沈芳丽  <fairyshen@163.com>
---------------------------------------------------------------------
Documentation/aoe/todo.txt的中文翻译

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

中文版维护者：沈芳丽  <fairyshen@163.com>
中文版翻译者：沈芳丽  <fairyshen@163.com>
中文版校译者：沈芳丽  <fairyshen@163.com>

以下为正文

There is a potential for deadlock when allocating a struct sk_buff for data 

that needs to be written out to aoe storage.  

分配一个需要写入AOE存储数据的struct sk_buff时，有一个潜在的死锁。

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.  

如果数据被写入脏页，以便释放该页面，如果没有其他页面，那么当需要一个

空闲页来分配sk_buff时可能会发生死锁情况。

This situation has not been observed, but it would be nice to eliminate any 

potential for deadlock under memory pressure.

这种情况还未被觉察到，但它有利于在内存压力下消除任何潜在的死锁。

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.

由于以太网ATA内核的IP代码没有碎片，所以由析构函数的​​结构成员sk_buff

提供aoe驱动程序。

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.

除了前几个sk_buff，其他所有的都通过内存池分配，并且通过注册析构

函数，我们应该能够有效地分配sk_buffs而不引入任何潜在的死锁。