Searched refs:__h (Results 1 - 17 of 17) sorted by relevance

/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dstl_hash_fun.h42 unsigned long __h = 0; local
44 __h = 5*__h + *__s;
46 return size_t(__h);
/haiku-buildtools/gcc/libstdc++-v3/include/backward/
H A Dhash_fun.h73 unsigned long __h = 0; local
75 __h = 5 * __h + *__s;
76 return size_t(__h);
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A D20001203-2.c62 struct obstack *__h =
65 struct obstack *__o = (__h);
72 struct obstack *__o1 = (__h);
/haiku-buildtools/gcc/gmp/
H A Dlonglong.h527 struct {USItype __l, __h;} __i; \
532 (w1) = __x.__i.__h; (w0) = __x.__i.__l;})
535 struct {SItype __l, __h;} __i; \
540 (w1) = __x.__i.__h; (w0) = __x.__i.__l;})
553 struct {USItype __h, __l;} __i; \
556 (ph) = __x.__i.__h; \
562 struct {USItype __h, __l;} __i; \
565 (ph) = __x.__i.__h; \
607 struct {USItype __h, __l;} __i; \
610 (wh) = __x.__i.__h; \
[all...]
/haiku-buildtools/legacy/gcc/gcc/
H A Dlonglong.h211 struct {USItype __l, __h;} __i; \
217 (w1) = __xx.__i.__h; (w0) = __xx.__i.__l;})
220 struct {SItype __l, __h;} __i; \
226 (w1) = __xx.__i.__h; (w0) = __xx.__i.__l;})
389 struct {USItype __l, __h;} __i; \
392 __a.__i.__h = (ah); \
394 __b.__i.__h = (bh); \
398 (sh) = __s.__i.__h; \
406 struct {USItype __l, __h;} __i; \
409 __a.__i.__h
[all...]
/haiku-buildtools/gcc/mpfr/src/
H A Dmpfr-longlong.h515 struct {USItype __l, __h;} __i; \
520 (w1) = __x.__i.__h; (w0) = __x.__i.__l;})
523 struct {SItype __l, __h;} __i; \
528 (w1) = __x.__i.__h; (w0) = __x.__i.__l;})
541 struct {USItype __h, __l;} __i; \
544 (ph) = __x.__i.__h; \
550 struct {USItype __h, __l;} __i; \
553 (ph) = __x.__i.__h; \
595 struct {USItype __h, __l;} __i; \
598 (wh) = __x.__i.__h; \
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dhashtable_policy.h124 _ReuseOrAllocNode(__node_type* __nodes, __hashtable_alloc& __h) argument
125 : _M_nodes(__nodes), _M_h(__h) { }
174 _AllocNode(__hashtable_alloc& __h) argument
175 : _M_h(__h) { }
590 __hashtable* __h = static_cast<__hashtable*>(this); variable
591 __hash_code __code = __h->_M_hash_code(__k);
592 std::size_t __n = __h->_M_bucket_index(__k, __code);
593 __node_type* __p = __h->_M_find_node(__n, __k, __code);
597 __p = __h->_M_allocate_node(std::piecewise_construct,
600 return __h
615 __hashtable* __h = static_cast<__hashtable*>(this); variable
640 __hashtable* __h = static_cast<__hashtable*>(this); variable
659 const __hashtable* __h = static_cast<const __hashtable*>(this); variable
713 __hashtable& __h = _M_conjure_hashtable(); local
721 __hashtable& __h = _M_conjure_hashtable(); local
734 __hashtable& __h = _M_conjure_hashtable(); local
757 __hashtable& __h = _M_conjure_hashtable(); local
810 __hashtable& __h = this->_M_conjure_hashtable(); local
818 __hashtable& __h = this->_M_conjure_hashtable(); local
851 __hashtable& __h = this->_M_conjure_hashtable(); local
859 __hashtable& __h = this->_M_conjure_hashtable(); local
902 __hashtable& __h = this->_M_conjure_hashtable(); local
910 __hashtable& __h = this->_M_conjure_hashtable(); local
1071 _Hash_code_base(const _ExtractKey& __ex, const _H1&, const _H2&, const _Hash& __h) argument
[all...]
H A Dhashtable.h385 _Hashtable(const _H1& __h1, const _H2& __h2, const _Hash& __h, argument
388 : __hashtable_base(__exk, __h1, __h2, __h, __eq),
798 const _H1& __h1, const _H2& __h2, const _Hash& __h,
801 : _Hashtable(__h1, __h2, __h, __eq, __exk, __a)
820 const _H1& __h1, const _H2& __h2, const _Hash& __h,
823 : _Hashtable(__h1, __h2, __h, __eq, __exk, __a)
797 _Hashtable(size_type __bucket_hint, const _H1& __h1, const _H2& __h2, const _Hash& __h, const _Equal& __eq, const _ExtractKey& __exk, const allocator_type& __a) argument
818 _Hashtable(_InputIterator __f, _InputIterator __l, size_type __bucket_hint, const _H1& __h1, const _H2& __h2, const _Hash& __h, const _Equal& __eq, const _ExtractKey& __exk, const allocator_type& __a) argument
/haiku-buildtools/legacy/binutils/include/
H A Dobstack.h407 ({ struct obstack *__h = (OBSTACK); \
408 obstack_blank (__h, (length)); \
409 obstack_finish (__h); })
413 ({ struct obstack *__h = (OBSTACK); \
414 obstack_grow (__h, (where), (length)); \
415 obstack_finish (__h); })
419 ({ struct obstack *__h = (OBSTACK); \
420 obstack_grow0 (__h, (where), (length)); \
421 obstack_finish (__h); })
/haiku-buildtools/gcc/include/
H A Dobstack.h407 ({ struct obstack *__h = (OBSTACK); \
408 obstack_blank (__h, (length)); \
409 obstack_finish (__h); })
413 ({ struct obstack *__h = (OBSTACK); \
414 obstack_grow (__h, (where), (length)); \
415 obstack_finish (__h); })
419 ({ struct obstack *__h = (OBSTACK); \
420 obstack_grow0 (__h, (where), (length)); \
421 obstack_finish (__h); })
H A Dlonglong.h411 struct {USItype __h, __l;} __i; \
416 (xh) = __x.__i.__h; (xl) = __x.__i.__l; \
421 struct {USItype __h, __l;} __i; \
423 __x.__i.__h = n1; __x.__i.__l = n0; \
427 (q) = __x.__i.__l; (r) = __x.__i.__h; \
529 struct {USItype __l, __h;} __i; \
535 (w1) = __xx.__i.__h; (w0) = __xx.__i.__l;})
780 struct {USItype __h, __l;} __i; \
786 (wh) = __xx.__i.__h; \
791 struct {USItype __h, __
[all...]
/haiku-buildtools/binutils/include/
H A Dobstack.h385 ({ struct obstack *__h = (OBSTACK); \
386 obstack_blank (__h, (length)); \
387 obstack_finish (__h); })
391 ({ struct obstack *__h = (OBSTACK); \
392 obstack_grow (__h, (where), (length)); \
393 obstack_finish (__h); })
397 ({ struct obstack *__h = (OBSTACK); \
398 obstack_grow0 (__h, (where), (length)); \
399 obstack_finish (__h); })
H A Dlonglong.h411 struct {USItype __h, __l;} __i; \
416 (xh) = __x.__i.__h; (xl) = __x.__i.__l; \
421 struct {USItype __h, __l;} __i; \
423 __x.__i.__h = n1; __x.__i.__l = n0; \
427 (q) = __x.__i.__l; (r) = __x.__i.__h; \
529 struct {USItype __l, __h;} __i; \
535 (w1) = __xx.__i.__h; (w0) = __xx.__i.__l;})
780 struct {USItype __h, __l;} __i; \
786 (wh) = __xx.__i.__h; \
791 struct {USItype __h, __
[all...]
/haiku-buildtools/legacy/gcc/include/
H A Dobstack.h449 ({ struct obstack *__h = (OBSTACK); \
450 obstack_blank (__h, (length)); \
451 obstack_finish (__h); })
455 ({ struct obstack *__h = (OBSTACK); \
456 obstack_grow (__h, (where), (length)); \
457 obstack_finish (__h); })
461 ({ struct obstack *__h = (OBSTACK); \
462 obstack_grow0 (__h, (where), (length)); \
463 obstack_finish (__h); })
/haiku-buildtools/gcc/libstdc++-v3/include/tr1/
H A Dhashtable_policy.h522 _Hashtable* __h = static_cast<_Hashtable*>(this); local
523 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
524 std::size_t __n = __h->_M_bucket_index(__k, __code,
525 __h->_M_bucket_count);
528 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
586 const _H1&, const _H2&, const _Hash& __h)
587 : _M_extract(__ex), _M_eq(__eq), _M_ranged_hash(__h) { }
585 _Hash_code_base(const _ExtractKey& __ex, const _Equal& __eq, const _H1&, const _H2&, const _Hash& __h) argument
H A Dhashtable.h519 const _H1& __h1, const _H2& __h2, const _Hash& __h,
525 __h1, __h2, __h),
545 const _H1& __h1, const _H2& __h2, const _Hash& __h,
551 __h1, __h2, __h),
518 _Hashtable(size_type __bucket_hint, const _H1& __h1, const _H2& __h2, const _Hash& __h, const _Equal& __eq, const _ExtractKey& __exk, const allocator_type& __a) argument
543 _Hashtable(_InputIterator __f, _InputIterator __l, size_type __bucket_hint, const _H1& __h1, const _H2& __h2, const _Hash& __h, const _Equal& __eq, const _ExtractKey& __exk, const allocator_type& __a) argument
/haiku-buildtools/gcc/libstdc++-v3/include/ext/
H A Dthrow_allocator.h957 std::hash<std::size_t> __h;
958 size_t __result = __h(__val._M_i);
972 std::hash<std::size_t> __h;
973 size_t __result = __h(__val._M_i);

Completed in 294 milliseconds