iOS weak 原理
直接看源碼
objc_object::rootDealloc()
{
if (isTaggedPointer()) return; // fixme necessary?
if (fastpath(isa.nonpointer &&
!isa.weakly_referenced &&
!isa.has_assoc &&
!isa.has_cxx_dtor &&
!isa.has_sidetable_rc))
{
assert(!sidetable_present());
free(this);
}
else {
object_dispose((id)this);
}
}
上篇文章提到 isa 指針的結構,如果看過的人,對前面的 if 語句,一看便知,如果是非指針型 isa 并且 沒有弱引用并且沒有關聯對象并且C++函數并且沒有sidetable存儲表,那么就直接釋放。
id
object_dispose(id obj)
{
if (!obj) return nil;
objc_destructInstance(obj);
free(obj);
return nil;
}
void *objc_destructInstance(id obj)
{
if (obj) {
// Read all of the flags at once for performance.
bool cxx = obj->hasCxxDtor();
bool assoc = obj->hasAssociatedObjects();
// This order is important.
if (cxx) object_cxxDestruct(obj);
if (assoc) _object_remove_assocations(obj);
obj->clearDeallocating();
}
return obj;
}
inline void
objc_object::clearDeallocating()
{
if (slowpath(!isa.nonpointer)) {
// Slow path for raw pointer isa.
sidetable_clearDeallocating();
}
else if (slowpath(isa.weakly_referenced || isa.has_sidetable_rc)) {
// Slow path for non-pointer isa with weak refs and/or side table data.
clearDeallocating_slow();
}
assert(!sidetable_present());
}
NEVER_INLINE void
objc_object::clearDeallocating_slow()
{
assert(isa.nonpointer && (isa.weakly_referenced || isa.has_sidetable_rc));
SideTable& table = SideTables()[this];
table.lock();
if (isa.weakly_referenced) {
weak_clear_no_lock(&table.weak_table, (id)this);
}
if (isa.has_sidetable_rc) {
table.refcnts.erase(this);
}
table.unlock();
}
void
weak_clear_no_lock(weak_table_t *weak_table, id referent_id)
{
objc_object *referent = (objc_object *)referent_id;
weak_entry_t *entry = weak_entry_for_referent(weak_table, referent);
if (entry == nil) {
/// XXX shouldn't happen, but does with mismatched CF/objc
//printf("XXX no entry for clear deallocating %p\n", referent);
return;
}
// zero out references
weak_referrer_t *referrers;
size_t count;
if (entry->out_of_line()) {
referrers = entry->referrers;
count = TABLE_SIZE(entry);
}
else {
referrers = entry->inline_referrers;
count = WEAK_INLINE_COUNT;
}
for (size_t i = 0; i < count; ++i) {
objc_object **referrer = referrers[i];
if (referrer) {
if (*referrer == referent) {
*referrer = nil;
}
else if (*referrer) {
_objc_inform("__weak variable at %p holds %p instead of %p. "
"This is probably incorrect use of "
"objc_storeWeak() and objc_loadWeak(). "
"Break on objc_weak_error to debug.\n",
referrer, (void*)*referrer, (void*)referent);
objc_weak_error();
}
}
}
weak_entry_remove(weak_table, entry);
}
可以看到最后,移除弱引用的操作,
if (isa.weakly_referenced) {
weak_clear_no_lock(&table.weak_table, (id)this);
}
從代碼中可以看出,首先 SideTable& table = SideTables()[this];
從 SideTables 中,通過hash運算找到對應的 SideTable ,我們來看下我們的 SideTable 的結構
struct SideTable {
spinlock_t slock;
RefcountMap refcnts;
weak_table_t weak_table;
里面有個 weak_table 的結構,這個結構體
struct weak_table_t {
weak_entry_t *weak_entries;
size_t num_entries;
uintptr_t mask;
uintptr_t max_hash_displacement;
};
里面存儲著 weak_entries ,也就是弱引用表,當我們找到對應的 SideTable 之后,然后拿到這個 SideTable 中的 weaktable,也就是弱引用表,然后去找對應的 weak_entry_t , 因為 weaktable 里面存儲著 weak_entry_t , 所以,通過 hash 就能拿到對應的弱引用結構,然后最后從我們的弱引用表里面清除就可以了。
從代碼中也不難看出有弱引用,會調用另一個方法,然后 weak_entry_t *entry = weak_entry_for_referent(weak_table, referent);
去找到弱引用表,最后調用 weak_entry_remove(weak_table, entry);
移除弱引用。接著判斷是否有引用計數表嗎,如果有也擦除掉,這就是為什么 weak 指針會自動釋放。
總結,其實如果存在弱引用,系統會將這些弱引用存儲到一個 hash 表里面,并把 isa 指針弱引用的值設置為1,當銷毀的時候,會找到這個弱引用表然后移除弱引用,擦除引用計數。