--- old/src/hotspot/share/jfr/utilities/jfrDoublyLinkedList.hpp	2020-07-22 23:41:38.890000000 +0900
+++ new/src/hotspot/share/jfr/utilities/jfrDoublyLinkedList.hpp	2020-07-22 23:41:38.800000000 +0900
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2020, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -135,7 +135,6 @@
     prev->set_next(next);
   }
   --_count;
-  assert(_count >= 0, "invariant");
   assert(!in_list(node), "still in list error");
   return node;
 }
--- old/src/hotspot/share/jfr/utilities/jfrHashtable.hpp	2020-07-22 23:41:39.230000000 +0900
+++ new/src/hotspot/share/jfr/utilities/jfrHashtable.hpp	2020-07-22 23:41:39.110000000 +0900
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2020, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -83,7 +83,7 @@
 
   size_t hash_to_index(uintptr_t full_hash) const {
     const uintptr_t h = full_hash % _table_size;
-    assert(h >= 0 && h < _table_size, "Illegal hash value");
+    assert(h < _table_size, "Illegal hash value");
     return (size_t)h;
   }
   size_t entry_size() const { return _entry_size; }