| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/utilities/ |
| H A D | concurrentHashTable.inline.hpp | 453 bool have_dead = false; in internal_remove() local
455 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
617 bool* have_dead, size_t* loops) const in get_node() argument
627 if (is_dead && !(*have_dead)) { in get_node()
628 *have_dead = true; in get_node()
|
| H A D | concurrentHashTable.hpp | 288 bool* have_dead, size_t* loops = NULL) const;
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/utilities/ |
| H A D | concurrentHashTable.inline.hpp | 454 bool have_dead = false; in internal_remove() local
456 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
618 bool* have_dead, size_t* loops) const in get_node() argument
628 if (is_dead && !(*have_dead)) { in get_node()
629 *have_dead = true; in get_node()
|
| H A D | concurrentHashTable.hpp | 290 bool* have_dead, size_t* loops = NULL) const;
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/utilities/ |
| H A D | concurrentHashTable.inline.hpp | 453 bool have_dead = false; in internal_remove() local
455 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
617 bool* have_dead, size_t* loops) const in get_node() argument
627 if (is_dead && !(*have_dead)) { in get_node()
628 *have_dead = true; in get_node()
|
| H A D | concurrentHashTable.hpp | 295 bool* have_dead, size_t* loops = NULL) const;
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/utilities/ |
| H A D | concurrentHashTable.inline.hpp | 453 bool have_dead = false; in internal_remove() local
455 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
617 bool* have_dead, size_t* loops) const in get_node() argument
627 if (is_dead && !(*have_dead)) { in get_node()
628 *have_dead = true; in get_node()
|
| H A D | concurrentHashTable.hpp | 295 bool* have_dead, size_t* loops = NULL) const;
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/utilities/ |
| H A D | concurrentHashTable.inline.hpp | 467 bool have_dead = false; in internal_remove() local
469 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
626 bool* have_dead, size_t* loops) const in get_node() argument
636 if (is_dead && !(*have_dead)) { in get_node()
637 *have_dead = true; in get_node()
|
| H A D | concurrentHashTable.hpp | 287 bool* have_dead, size_t* loops = NULL) const;
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/utilities/ |
| H A D | concurrentHashTable.inline.hpp | 467 bool have_dead = false; in internal_remove() local
469 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
626 bool* have_dead, size_t* loops) const in get_node() argument
636 if (is_dead && !(*have_dead)) { in get_node()
637 *have_dead = true; in get_node()
|
| H A D | concurrentHashTable.hpp | 287 bool* have_dead, size_t* loops = NULL) const;
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/utilities/ |
| H A D | concurrentHashTable.inline.hpp | 468 bool have_dead = false; in internal_remove() local
470 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
632 bool* have_dead, size_t* loops) const in get_node() argument
642 if (is_dead && !(*have_dead)) { in get_node()
643 *have_dead = true; in get_node()
|
| H A D | concurrentHashTable.hpp | 294 bool* have_dead, size_t* loops = NULL) const;
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/utilities/ |
| H A D | concurrentHashTable.inline.hpp | 464 bool have_dead = false; in internal_remove() local
466 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
625 bool* have_dead, size_t* loops) const in get_node() argument
635 if (is_dead && !(*have_dead)) { in get_node()
636 *have_dead = true; in get_node()
|
| H A D | concurrentHashTable.hpp | 292 bool* have_dead, size_t* loops = NULL) const;
|