| /dports/dns/void-zones-tools/void-zones-tools-1.0.2/ |
| H A D | store.c | 202 Node *findTreeNode(const char *name, Node *node) in findTreeNode() function
212 return findTreeNode(name, node->L); in findTreeNode()
215 return findTreeNode(name, node->R); in findTreeNode()
461 return findTreeNode(name, table[mmh3(name, naml)%n + 1]); in findName()
|
| H A D | store.h | 75 Node *findTreeNode(const char *name, Node *node);
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 1149 (p = r.findTreeNode(hash, key, null)) != null) { in replaceNode()
1701 (p = r.findTreeNode(h, key, null)) != null) in computeIfAbsent()
1792 (p = r.findTreeNode(h, key, null)) != null) { in computeIfPresent()
1907 p = r.findTreeNode(h, key, null); in compute()
2018 r.findTreeNode(h, key, null); in merge()
2672 return findTreeNode(h, k, null); in find()
2679 final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { in findTreeNode() method in ConcurrentHashMap.TreeNode
2699 else if ((q = pr.findTreeNode(h, k, kc)) != null) in findTreeNode()
2851 r.findTreeNode(h, k, null)); in find()
2891 (q = ch.findTreeNode(h, k, kc)) != null) || in putTreeVal()
[all …]
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 1149 (p = r.findTreeNode(hash, key, null)) != null) { in replaceNode()
1701 (p = r.findTreeNode(h, key, null)) != null) in computeIfAbsent()
1792 (p = r.findTreeNode(h, key, null)) != null) { in computeIfPresent()
1907 p = r.findTreeNode(h, key, null); in compute()
2018 r.findTreeNode(h, key, null); in merge()
2672 return findTreeNode(h, k, null); in find()
2679 final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { in findTreeNode() method in ConcurrentHashMap.TreeNode
2699 else if ((q = pr.findTreeNode(h, k, kc)) != null) in findTreeNode()
2851 r.findTreeNode(h, k, null)); in find()
2891 (q = ch.findTreeNode(h, k, kc)) != null) || in putTreeVal()
[all …]
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 1154 (p = r.findTreeNode(hash, key, null)) != null) { in replaceNode()
1752 (p = r.findTreeNode(h, key, null)) != null) in computeIfAbsent()
1845 (p = r.findTreeNode(h, key, null)) != null) { in computeIfPresent()
1963 p = r.findTreeNode(h, key, null); in compute()
2075 r.findTreeNode(h, key, null); in merge()
2718 return findTreeNode(h, k, null); in find()
2725 final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { in findTreeNode() method in ConcurrentHashMap.TreeNode
2745 else if ((q = pr.findTreeNode(h, k, kc)) != null) in findTreeNode()
2897 r.findTreeNode(h, k, null)); in find()
2937 (q = ch.findTreeNode(h, k, kc)) != null) || in putTreeVal()
[all …]
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 1154 (p = r.findTreeNode(hash, key, null)) != null) { in replaceNode()
1752 (p = r.findTreeNode(h, key, null)) != null) in computeIfAbsent()
1845 (p = r.findTreeNode(h, key, null)) != null) { in computeIfPresent()
1963 p = r.findTreeNode(h, key, null); in compute()
2075 r.findTreeNode(h, key, null); in merge()
2718 return findTreeNode(h, k, null); in find()
2725 final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { in findTreeNode() method in ConcurrentHashMap.TreeNode
2745 else if ((q = pr.findTreeNode(h, k, kc)) != null) in findTreeNode()
2897 r.findTreeNode(h, k, null)); in find()
2937 (q = ch.findTreeNode(h, k, kc)) != null) || in putTreeVal()
[all …]
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.base/share/classes/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 1154 (p = r.findTreeNode(hash, key, null)) != null) { in replaceNode()
1752 (p = r.findTreeNode(h, key, null)) != null) in computeIfAbsent()
1845 (p = r.findTreeNode(h, key, null)) != null) { in computeIfPresent()
1963 p = r.findTreeNode(h, key, null); in compute()
2075 r.findTreeNode(h, key, null); in merge()
2718 return findTreeNode(h, k, null); in find()
2725 final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { in findTreeNode() method in ConcurrentHashMap.TreeNode
2745 else if ((q = pr.findTreeNode(h, k, kc)) != null) in findTreeNode()
2897 r.findTreeNode(h, k, null)); in find()
2937 (q = ch.findTreeNode(h, k, kc)) != null) || in putTreeVal()
[all …]
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.base/share/classes/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 1154 (p = r.findTreeNode(hash, key, null)) != null) { in replaceNode()
1755 (p = r.findTreeNode(h, key, null)) != null) in computeIfAbsent()
1851 (p = r.findTreeNode(h, key, null)) != null) { in computeIfPresent()
1971 p = r.findTreeNode(h, key, null); in compute()
2083 r.findTreeNode(h, key, null); in merge()
2726 return findTreeNode(h, k, null); in find()
2733 final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { in findTreeNode() method in ConcurrentHashMap.TreeNode
2753 else if ((q = pr.findTreeNode(h, k, kc)) != null) in findTreeNode()
2905 r.findTreeNode(h, k, null)); in find()
2945 (q = ch.findTreeNode(h, k, kc)) != null) || in putTreeVal()
[all …]
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.base/share/classes/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 1154 (p = r.findTreeNode(hash, key, null)) != null) { in replaceNode()
1755 (p = r.findTreeNode(h, key, null)) != null) in computeIfAbsent()
1851 (p = r.findTreeNode(h, key, null)) != null) { in computeIfPresent()
1971 p = r.findTreeNode(h, key, null); in compute()
2083 r.findTreeNode(h, key, null); in merge()
2726 return findTreeNode(h, k, null); in find()
2733 final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { in findTreeNode() method in ConcurrentHashMap.TreeNode
2753 else if ((q = pr.findTreeNode(h, k, kc)) != null) in findTreeNode()
2905 r.findTreeNode(h, k, null)); in find()
2945 (q = ch.findTreeNode(h, k, kc)) != null) || in putTreeVal()
[all …]
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.base/share/classes/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 1154 (p = r.findTreeNode(hash, key, null)) != null) { in replaceNode()
1752 (p = r.findTreeNode(h, key, null)) != null) in computeIfAbsent()
1845 (p = r.findTreeNode(h, key, null)) != null) { in computeIfPresent()
1963 p = r.findTreeNode(h, key, null); in compute()
2075 r.findTreeNode(h, key, null); in merge()
2718 return findTreeNode(h, k, null); in find()
2725 final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { in findTreeNode() method in ConcurrentHashMap.TreeNode
2745 else if ((q = pr.findTreeNode(h, k, kc)) != null) in findTreeNode()
2897 r.findTreeNode(h, k, null)); in find()
2937 (q = ch.findTreeNode(h, k, kc)) != null) || in putTreeVal()
[all …]
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.base/share/classes/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 1154 (p = r.findTreeNode(hash, key, null)) != null) { in replaceNode()
1755 (p = r.findTreeNode(h, key, null)) != null) in computeIfAbsent()
1851 (p = r.findTreeNode(h, key, null)) != null) { in computeIfPresent()
1971 p = r.findTreeNode(h, key, null); in compute()
2083 r.findTreeNode(h, key, null); in merge()
2726 return findTreeNode(h, k, null); in find()
2733 final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { in findTreeNode() method in ConcurrentHashMap.TreeNode
2753 else if ((q = pr.findTreeNode(h, k, kc)) != null) in findTreeNode()
2905 r.findTreeNode(h, k, null)); in find()
2945 (q = ch.findTreeNode(h, k, kc)) != null) || in putTreeVal()
[all …]
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.base/share/classes/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 1154 (p = r.findTreeNode(hash, key, null)) != null) { in replaceNode()
1755 (p = r.findTreeNode(h, key, null)) != null) in computeIfAbsent()
1851 (p = r.findTreeNode(h, key, null)) != null) { in computeIfPresent()
1971 p = r.findTreeNode(h, key, null); in compute()
2083 r.findTreeNode(h, key, null); in merge()
2726 return findTreeNode(h, k, null); in find()
2733 final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { in findTreeNode() method in ConcurrentHashMap.TreeNode
2753 else if ((q = pr.findTreeNode(h, k, kc)) != null) in findTreeNode()
2905 r.findTreeNode(h, k, null)); in find()
2945 (q = ch.findTreeNode(h, k, kc)) != null) || in putTreeVal()
[all …]
|