@@ -235,8 +235,8 @@ int uds_allocate_memory(size_t size, size_t align, const char *what, void *ptr)
if (p == NULL) {
/*
* It is possible for kmalloc to fail to allocate memory because there is
- * no page available (see VDO-3688). A short sleep may allow the page
- * reclaimer to free a page.
+ * no page available. A short sleep may allow the page reclaimer to
+ * free a page.
*/
fsleep(1000);
p = kmalloc(size, gfp_flags);
@@ -251,8 +251,8 @@ int uds_allocate_memory(size_t size, size_t align, const char *what, void *ptr)
UDS_SUCCESS) {
/*
* It is possible for __vmalloc to fail to allocate memory because there
- * are no pages available (see VDO-3661). A short sleep may allow the page
- * reclaimer to free enough pages for a small allocation.
+ * are no pages available. A short sleep may allow the page reclaimer
+ * to free enough pages for a small allocation.
*
* For larger allocations, the page_alloc code is racing against the page
* reclaimer. If the page reclaimer can stay ahead of page_alloc, the
@@ -191,7 +191,7 @@ static inline void __down(struct semaphore *semaphore)
* happens, sleep briefly to avoid keeping the CPU locked up in
* this loop. We could just call cond_resched, but then we'd
* still keep consuming CPU time slices and swamp other threads
- * trying to do computational work. [VDO-4980]
+ * trying to do computational work.
*/
fsleep(1000);
}