1 //===-------------------------- debug.cpp ---------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #define _LIBCPP_DEBUG2 1
15 #include "__hash_table"
18 _LIBCPP_BEGIN_NAMESPACE_STD
24 static __libcpp_db db;
38 typedef mutex mutex_type;
39 typedef lock_guard<mutex_type> WLock;
40 typedef lock_guard<mutex_type> RLock;
49 } // unnamed namespace
70 __libcpp_db::__libcpp_db()
80 __libcpp_db::~__libcpp_db()
84 for (__c_node** p = __cbeg_; p != __cend_; ++p)
96 for (__i_node** p = __ibeg_; p != __iend_; ++p)
109 __libcpp_db::__find_c_from_i(void* __i) const
112 __i_node* i = __find_iterator(__i);
113 _LIBCPP_ASSERT(i != nullptr, "iterator not found in debug database.");
114 return i->__c_ != nullptr ? i->__c_->__c_ : nullptr;
118 __libcpp_db::__insert_ic(void* __i, const void* __c)
121 __i_node* i = __insert_iterator(__i);
123 "Container constructed in a translation unit with debug mode disabled."
124 " But it is being used in a translation unit with debug mode enabled."
125 " Enable it in the other translation unit with #define _LIBCPP_DEBUG2 1";
126 _LIBCPP_ASSERT(__cbeg_ != __cend_, errmsg);
127 size_t hc = hash<const void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_);
128 __c_node* c = __cbeg_[hc];
129 _LIBCPP_ASSERT(c != nullptr, errmsg);
130 while (c->__c_ != __c)
133 _LIBCPP_ASSERT(c != nullptr, errmsg);
140 __libcpp_db::__insert_c(void* __c)
143 if (__csz_ + 1 > static_cast<size_t>(__cend_ - __cbeg_))
145 size_t nc = __next_prime(2*static_cast<size_t>(__cend_ - __cbeg_) + 1);
146 __c_node** cbeg = static_cast<__c_node**>(calloc(nc, sizeof(void*)));
148 #ifndef _LIBCPP_NO_EXCEPTIONS
153 for (__c_node** p = __cbeg_; p != __cend_; ++p)
158 size_t h = hash<void*>()(q->__c_) % nc;
159 __c_node* r = q->__next_;
160 q->__next_ = cbeg[h];
167 __cend_ = __cbeg_ + nc;
169 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_);
170 __c_node* p = __cbeg_[hc];
171 __c_node* r = __cbeg_[hc] =
172 static_cast<__c_node*>(malloc(sizeof(__c_node)));
173 if (__cbeg_[hc] == nullptr)
174 #ifndef _LIBCPP_NO_EXCEPTIONS
186 __libcpp_db::__erase_i(void* __i)
189 if (__ibeg_ != __iend_)
191 size_t hi = hash<void*>()(__i) % static_cast<size_t>(__iend_ - __ibeg_);
192 __i_node* p = __ibeg_[hi];
195 __i_node* q = nullptr;
196 while (p->__i_ != __i)
204 __ibeg_[hi] = p->__next_;
206 q->__next_ = p->__next_;
207 __c_node* c = p->__c_;
217 __libcpp_db::__invalidate_all(void* __c)
220 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_);
221 __c_node* p = __cbeg_[hc];
222 _LIBCPP_ASSERT(p != nullptr, "debug mode internal logic error __invalidate_all A");
223 while (p->__c_ != __c)
226 _LIBCPP_ASSERT(p != nullptr, "debug mode internal logic error __invalidate_all B");
228 while (p->end_ != p->beg_)
231 (*p->end_)->__c_ = nullptr;
236 __libcpp_db::__find_c_and_lock(void* __c) const
239 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_);
240 __c_node* p = __cbeg_[hc];
241 _LIBCPP_ASSERT(p != nullptr, "debug mode internal logic error __find_c_and_lock A");
242 while (p->__c_ != __c)
245 _LIBCPP_ASSERT(p != nullptr, "debug mode internal logic error __find_c_and_lock B");
251 __libcpp_db::__find_c(void* __c) const
253 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_);
254 __c_node* p = __cbeg_[hc];
255 _LIBCPP_ASSERT(p != nullptr, "debug mode internal logic error __find_c A");
256 while (p->__c_ != __c)
259 _LIBCPP_ASSERT(p != nullptr, "debug mode internal logic error __find_c B");
265 __libcpp_db::unlock() const
271 __libcpp_db::__erase_c(void* __c)
274 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_);
275 __c_node* p = __cbeg_[hc];
276 __c_node* q = nullptr;
277 _LIBCPP_ASSERT(p != nullptr, "debug mode internal logic error __erase_c A");
278 while (p->__c_ != __c)
282 _LIBCPP_ASSERT(p != nullptr, "debug mode internal logic error __erase_c B");
285 __cbeg_[hc] = p->__next_;
287 q->__next_ = p->__next_;
288 while (p->end_ != p->beg_)
291 (*p->end_)->__c_ = nullptr;
299 __libcpp_db::__iterator_copy(void* __i, const void* __i0)
302 __i_node* i = __find_iterator(__i);
303 __i_node* i0 = __find_iterator(__i0);
304 __c_node* c0 = i0 != nullptr ? i0->__c_ : nullptr;
305 if (i == nullptr && i0 != nullptr)
306 i = __insert_iterator(__i);
307 __c_node* c = i != nullptr ? i->__c_ : nullptr;
325 __libcpp_db::__dereferenceable(const void* __i) const
328 __i_node* i = __find_iterator(__i);
329 return i != nullptr && i->__c_ != nullptr && i->__c_->__dereferenceable(__i);
333 __libcpp_db::__decrementable(const void* __i) const
336 __i_node* i = __find_iterator(__i);
337 return i != nullptr && i->__c_ != nullptr && i->__c_->__decrementable(__i);
341 __libcpp_db::__addable(const void* __i, ptrdiff_t __n) const
344 __i_node* i = __find_iterator(__i);
345 return i != nullptr && i->__c_ != nullptr && i->__c_->__addable(__i, __n);
349 __libcpp_db::__subscriptable(const void* __i, ptrdiff_t __n) const
352 __i_node* i = __find_iterator(__i);
353 return i != nullptr && i->__c_ != nullptr && i->__c_->__subscriptable(__i, __n);
357 __libcpp_db::__comparable(const void* __i, const void* __j) const
360 __i_node* i = __find_iterator(__i);
361 __i_node* j = __find_iterator(__j);
362 __c_node* ci = i != nullptr ? i->__c_ : nullptr;
363 __c_node* cj = j != nullptr ? j->__c_ : nullptr;
364 return ci != nullptr && ci == cj;
368 __libcpp_db::swap(void* c1, void* c2)
371 size_t hc = hash<void*>()(c1) % static_cast<size_t>(__cend_ - __cbeg_);
372 __c_node* p1 = __cbeg_[hc];
373 _LIBCPP_ASSERT(p1 != nullptr, "debug mode internal logic error swap A");
374 while (p1->__c_ != c1)
377 _LIBCPP_ASSERT(p1 != nullptr, "debug mode internal logic error swap B");
379 hc = hash<void*>()(c2) % static_cast<size_t>(__cend_ - __cbeg_);
380 __c_node* p2 = __cbeg_[hc];
381 _LIBCPP_ASSERT(p2 != nullptr, "debug mode internal logic error swap C");
382 while (p2->__c_ != c2)
385 _LIBCPP_ASSERT(p2 != nullptr, "debug mode internal logic error swap D");
387 std::swap(p1->beg_, p2->beg_);
388 std::swap(p1->end_, p2->end_);
389 std::swap(p1->cap_, p2->cap_);
390 for (__i_node** p = p1->beg_; p != p1->end_; ++p)
392 for (__i_node** p = p2->beg_; p != p2->end_; ++p)
397 __libcpp_db::__insert_i(void* __i)
400 __insert_iterator(__i);
404 __c_node::__add(__i_node* i)
408 size_t nc = 2*static_cast<size_t>(cap_ - beg_);
412 static_cast<__i_node**>(malloc(nc * sizeof(__i_node*)));
414 #ifndef _LIBCPP_NO_EXCEPTIONS
420 memcpy(beg, beg_, nc/2*sizeof(__i_node*));
433 __libcpp_db::__insert_iterator(void* __i)
435 if (__isz_ + 1 > static_cast<size_t>(__iend_ - __ibeg_))
437 size_t nc = __next_prime(2*static_cast<size_t>(__iend_ - __ibeg_) + 1);
438 __i_node** ibeg = static_cast<__i_node**>(calloc(nc, sizeof(void*)));
440 #ifndef _LIBCPP_NO_EXCEPTIONS
445 for (__i_node** p = __ibeg_; p != __iend_; ++p)
450 size_t h = hash<void*>()(q->__i_) % nc;
451 __i_node* r = q->__next_;
452 q->__next_ = ibeg[h];
459 __iend_ = __ibeg_ + nc;
461 size_t hi = hash<void*>()(__i) % static_cast<size_t>(__iend_ - __ibeg_);
462 __i_node* p = __ibeg_[hi];
463 __i_node* r = __ibeg_[hi] =
464 static_cast<__i_node*>(malloc(sizeof(__i_node)));
466 #ifndef _LIBCPP_NO_EXCEPTIONS
471 ::new(r) __i_node(__i, p, nullptr);
478 __libcpp_db::__find_iterator(const void* __i) const
480 __i_node* r = nullptr;
481 if (__ibeg_ != __iend_)
483 size_t h = hash<const void*>()(__i) % static_cast<size_t>(__iend_ - __ibeg_);
484 for (__i_node* nd = __ibeg_[h]; nd != nullptr; nd = nd->__next_)
498 __c_node::__remove(__i_node* p)
500 __i_node** r = find(beg_, end_, p);
501 _LIBCPP_ASSERT(r != end_, "debug mode internal logic error __c_node::__remove");
503 memmove(r, r+1, static_cast<size_t>(end_ - r)*sizeof(__i_node*));
506 _LIBCPP_END_NAMESPACE_STD