Home
last modified time | relevance | path

Searched refs:lookup_f (Results 1 – 19 of 19) sorted by relevance

/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/utilities/
H A DconcurrentHashTable.hpp291 Node* get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f,
311 VALUE* internal_get(Thread* thread, LOOKUP_FUNC& lookup_f,
327 bool internal_remove(Thread* thread, LOOKUP_FUNC& lookup_f,
417 return get_insert_lazy(thread, lookup_f, val_f, noOp, grow_hint); in get_insert_lazy()
425 return get_insert_lazy(thread, lookup_f, vp, callback_f, grow_hint); in get_insert()
432 return get_insert(thread, lookup_f, value, noOp, grow_hint); in get_insert()
438 bool get(Thread* thread, LOOKUP_FUNC& lookup_f, FOUND_FUNC& foundf,
461 return internal_remove(thread, lookup_f, del_f); in remove()
466 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f) { in remove() argument
467 return internal_remove(thread, lookup_f, noOp); in remove()
[all …]
H A DconcurrentHashTable.inline.hpp466 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
552 lookup_f.equals(rem_n->value(), &is_dead); in delete_in_bucket()
632 if (lookup_f.equals(node->value(), &is_dead)) { in get_node()
864 const Bucket* bucket = get_bucket(lookup_f.get_hash()); in internal_get()
865 Node* node = get_node(bucket, lookup_f, &clean, &loops); in internal_get()
888 uintx hash = lookup_f.get_hash(); in internal_get_insert()
931 delete_in_bucket(thread, bucket, lookup_f); in internal_get_insert()
959 uintx hash = lookup_f.get_hash(); in internal_insert()
996 delete_in_bucket(thread, bucket, lookup_f); in internal_insert()
1128 VALUE* val = internal_get(thread, lookup_f, grow_hint); in get()
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/utilities/
H A DconcurrentHashTable.hpp286 Node* get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f,
306 VALUE* internal_get(Thread* thread, LOOKUP_FUNC& lookup_f,
317 bool internal_remove(Thread* thread, LOOKUP_FUNC& lookup_f,
407 return get_insert_lazy(thread, lookup_f, val_f, noOp, grow_hint); in get_insert_lazy()
422 return get_insert(thread, lookup_f, value, noOp, grow_hint); in get_insert()
428 bool get(Thread* thread, LOOKUP_FUNC& lookup_f, FOUND_FUNC& foundf,
441 return internal_insert(thread, lookup_f, vp, noOp, grow_hint); in insert()
452 return internal_remove(thread, lookup_f, del_f); in remove()
457 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f) { in remove() argument
458 return internal_remove(thread, lookup_f, noOp); in remove()
[all …]
H A DconcurrentHashTable.inline.hpp249 MultiGetHandle::get(LOOKUP_FUNC& lookup_f, bool* grow_hint) in get() argument
469 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
553 lookup_f.equals(rem_n->value(), &is_dead); in delete_in_bucket()
625 get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f, in get_node() argument
633 if (lookup_f.equals(node->value(), &is_dead)) { in get_node()
865 const Bucket* bucket = get_bucket(lookup_f.get_hash()); in internal_get()
866 Node* node = get_node(bucket, lookup_f, &clean, &loops); in internal_get()
889 uintx hash = lookup_f.get_hash(); in internal_insert()
933 delete_in_bucket(thread, bucket, lookup_f); in internal_insert()
1060 VALUE* val = internal_get(thread, lookup_f, grow_hint); in get()
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/utilities/
H A DconcurrentHashTable.hpp286 Node* get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f,
306 VALUE* internal_get(Thread* thread, LOOKUP_FUNC& lookup_f,
317 bool internal_remove(Thread* thread, LOOKUP_FUNC& lookup_f,
407 return get_insert_lazy(thread, lookup_f, val_f, noOp, grow_hint); in get_insert_lazy()
422 return get_insert(thread, lookup_f, value, noOp, grow_hint); in get_insert()
428 bool get(Thread* thread, LOOKUP_FUNC& lookup_f, FOUND_FUNC& foundf,
441 return internal_insert(thread, lookup_f, vp, noOp, grow_hint); in insert()
452 return internal_remove(thread, lookup_f, del_f); in remove()
457 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f) { in remove() argument
458 return internal_remove(thread, lookup_f, noOp); in remove()
[all …]
H A DconcurrentHashTable.inline.hpp249 MultiGetHandle::get(LOOKUP_FUNC& lookup_f, bool* grow_hint) in get() argument
469 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
553 lookup_f.equals(rem_n->value(), &is_dead); in delete_in_bucket()
625 get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f, in get_node() argument
633 if (lookup_f.equals(node->value(), &is_dead)) { in get_node()
865 const Bucket* bucket = get_bucket(lookup_f.get_hash()); in internal_get()
866 Node* node = get_node(bucket, lookup_f, &clean, &loops); in internal_get()
889 uintx hash = lookup_f.get_hash(); in internal_insert()
933 delete_in_bucket(thread, bucket, lookup_f); in internal_insert()
1060 VALUE* val = internal_get(thread, lookup_f, grow_hint); in get()
[all …]
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/utilities/
H A DconcurrentHashTable.hpp289 Node* get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f,
310 VALUE* internal_get(Thread* thread, LOOKUP_FUNC& lookup_f,
321 bool internal_remove(Thread* thread, LOOKUP_FUNC& lookup_f,
372 void delete_in_bucket(Thread* thread, Bucket* bucket, LOOKUP_FUNC& lookup_f);
411 bool get(Thread* thread, LOOKUP_FUNC& lookup_f, FOUND_FUNC& foundf,
417 bool insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, in insert() argument
440 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f, DELETE_FUNC& del_f) { in remove() argument
441 return internal_remove(thread, lookup_f, del_f); in remove()
446 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f) { in remove() argument
450 return internal_remove(thread, lookup_f, ignore_del_f); in remove()
[all …]
H A DconcurrentHashTable.inline.hpp236 MultiGetHandle::get(LOOKUP_FUNC& lookup_f, bool* grow_hint) in get() argument
456 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
544 lookup_f.equals(rem_n->value(), &is_dead); in delete_in_bucket()
617 get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f, in get_node() argument
625 if (lookup_f.equals(node->value(), &is_dead)) { in get_node()
871 const Bucket* bucket = get_bucket(lookup_f.get_hash()); in internal_get()
872 Node* node = get_node(bucket, lookup_f, &clean, &loops); in internal_get()
894 uintx hash = lookup_f.get_hash(); in internal_insert_get()
902 Node* old = get_node(bucket, lookup_f, &clean, &loops); in internal_insert_get()
934 delete_in_bucket(thread, bucket, lookup_f); in internal_insert_get()
[all …]
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/utilities/
H A DconcurrentHashTable.hpp293 Node* get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f,
313 VALUE* internal_get(Thread* thread, LOOKUP_FUNC& lookup_f,
324 bool internal_remove(Thread* thread, LOOKUP_FUNC& lookup_f,
406 bool get(Thread* thread, LOOKUP_FUNC& lookup_f, FOUND_FUNC& foundf,
412 bool insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, in insert() argument
414 return internal_insert(thread, lookup_f, value, grow_hint, clean_hint); in insert()
424 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f, DELETE_FUNC& del_f) { in remove() argument
425 return internal_remove(thread, lookup_f, del_f); in remove()
430 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f) { in remove() argument
431 return internal_remove(thread, lookup_f, noOp); in remove()
[all …]
H A DconcurrentHashTable.inline.hpp250 MultiGetHandle::get(LOOKUP_FUNC& lookup_f, bool* grow_hint) in get() argument
470 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
558 lookup_f.equals(rem_n->value(), &is_dead); in delete_in_bucket()
631 get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f, in get_node() argument
639 if (lookup_f.equals(node->value(), &is_dead)) { in get_node()
871 const Bucket* bucket = get_bucket(lookup_f.get_hash()); in internal_get()
872 Node* node = get_node(bucket, lookup_f, &clean, &loops); in internal_get()
894 uintx hash = lookup_f.get_hash(); in internal_insert()
902 Node* old = get_node(bucket, lookup_f, &clean, &loops); in internal_insert()
932 delete_in_bucket(thread, bucket, lookup_f); in internal_insert()
[all …]
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/utilities/
H A DconcurrentHashTable.hpp287 Node* get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f,
307 VALUE* internal_get(Thread* thread, LOOKUP_FUNC& lookup_f,
318 bool internal_remove(Thread* thread, LOOKUP_FUNC& lookup_f,
400 bool get(Thread* thread, LOOKUP_FUNC& lookup_f, FOUND_FUNC& foundf,
406 bool insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, in insert() argument
408 return internal_insert(thread, lookup_f, value, grow_hint, clean_hint); in insert()
418 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f, DELETE_FUNC& del_f) { in remove() argument
419 return internal_remove(thread, lookup_f, del_f); in remove()
424 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f) { in remove() argument
428 return internal_remove(thread, lookup_f, ignore_del_f); in remove()
[all …]
H A DconcurrentHashTable.inline.hpp235 MultiGetHandle::get(LOOKUP_FUNC& lookup_f, bool* grow_hint) in get() argument
455 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
543 lookup_f.equals(rem_n->value(), &is_dead); in delete_in_bucket()
616 get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f, in get_node() argument
624 if (lookup_f.equals(node->value(), &is_dead)) { in get_node()
856 const Bucket* bucket = get_bucket(lookup_f.get_hash()); in internal_get()
857 Node* node = get_node(bucket, lookup_f, &clean, &loops); in internal_get()
879 uintx hash = lookup_f.get_hash(); in internal_insert()
887 Node* old = get_node(bucket, lookup_f, &clean, &loops); in internal_insert()
917 delete_in_bucket(thread, bucket, lookup_f); in internal_insert()
[all …]
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/utilities/
H A DconcurrentHashTable.hpp294 Node* get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f,
314 VALUE* internal_get(Thread* thread, LOOKUP_FUNC& lookup_f,
325 bool internal_remove(Thread* thread, LOOKUP_FUNC& lookup_f,
407 bool get(Thread* thread, LOOKUP_FUNC& lookup_f, FOUND_FUNC& foundf,
413 bool insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, in insert() argument
415 return internal_insert(thread, lookup_f, value, grow_hint, clean_hint); in insert()
425 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f, DELETE_FUNC& del_f) { in remove() argument
426 return internal_remove(thread, lookup_f, del_f); in remove()
431 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f) { in remove() argument
432 return internal_remove(thread, lookup_f, noOp); in remove()
[all …]
H A DconcurrentHashTable.inline.hpp235 MultiGetHandle::get(LOOKUP_FUNC& lookup_f, bool* grow_hint) in get() argument
455 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
543 lookup_f.equals(rem_n->value(), &is_dead); in delete_in_bucket()
616 get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f, in get_node() argument
624 if (lookup_f.equals(node->value(), &is_dead)) { in get_node()
856 const Bucket* bucket = get_bucket(lookup_f.get_hash()); in internal_get()
857 Node* node = get_node(bucket, lookup_f, &clean, &loops); in internal_get()
879 uintx hash = lookup_f.get_hash(); in internal_insert()
887 Node* old = get_node(bucket, lookup_f, &clean, &loops); in internal_insert()
917 delete_in_bucket(thread, bucket, lookup_f); in internal_insert()
[all …]
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/utilities/
H A DconcurrentHashTable.hpp294 Node* get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f,
314 VALUE* internal_get(Thread* thread, LOOKUP_FUNC& lookup_f,
325 bool internal_remove(Thread* thread, LOOKUP_FUNC& lookup_f,
407 bool get(Thread* thread, LOOKUP_FUNC& lookup_f, FOUND_FUNC& foundf,
413 bool insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, in insert() argument
415 return internal_insert(thread, lookup_f, value, grow_hint, clean_hint); in insert()
425 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f, DELETE_FUNC& del_f) { in remove() argument
426 return internal_remove(thread, lookup_f, del_f); in remove()
431 bool remove(Thread* thread, LOOKUP_FUNC& lookup_f) { in remove() argument
432 return internal_remove(thread, lookup_f, noOp); in remove()
[all …]
H A DconcurrentHashTable.inline.hpp235 MultiGetHandle::get(LOOKUP_FUNC& lookup_f, bool* grow_hint) in get() argument
455 if (lookup_f.equals(rem_n->value(), &have_dead)) { in internal_remove()
543 lookup_f.equals(rem_n->value(), &is_dead); in delete_in_bucket()
616 get_node(const Bucket* const bucket, LOOKUP_FUNC& lookup_f, in get_node() argument
624 if (lookup_f.equals(node->value(), &is_dead)) { in get_node()
856 const Bucket* bucket = get_bucket(lookup_f.get_hash()); in internal_get()
857 Node* node = get_node(bucket, lookup_f, &clean, &loops); in internal_get()
879 uintx hash = lookup_f.get_hash(); in internal_insert()
887 Node* old = get_node(bucket, lookup_f, &clean, &loops); in internal_insert()
917 delete_in_bucket(thread, bucket, lookup_f); in internal_insert()
[all …]
/dports/finance/py-pycoin/pycoin-0.91.20210515/pycoin/encoding/
H A Dbase_conversion.py4 def to_long(base, lookup_f, s): argument
21 v += lookup_f(c)
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/ghc-exactprint-0.6.4/tests/examples/ghc86/
H A DTH_lookupName.hs30 $(TheLib.lookup_f),
31 $( [| let f = "local f" in $(TheLib.lookup_f) |] ),
/dports/lang/yap/yap-6.2.2/C/
H A Dindex.c3783 lookup_f(Functor f, yamop *tab, COUNT entries) in lookup_f() function
4221 fe = lookup_f(f,ipc->u.sssl.l,ipc->u.sssl.s); in expand_index()
5870 fe = lookup_f(f, ipc->u.sssl.l, ipc->u.sssl.s); in add_to_index()
6374 fe = lookup_f(f, ipc->u.sssl.l, ipc->u.sssl.s); in remove_from_index()
7055 fe = lookup_f(f, ipc->u.sssl.l, ipc->u.sssl.s); in Yap_FollowIndexingCode()