K 54 extra_lib/include/platinum/NptHash.h template <typename K> K 46 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 54 extra_lib/include/platinum/NptMap.h Entry(const K& key, const V& value) : m_Key(key), m_Value(value) {} K 55 extra_lib/include/platinum/NptMap.h Entry(const K& key) : m_Key(key) {} K 58 extra_lib/include/platinum/NptMap.h const K& GetKey() const { return m_Key; } K 71 extra_lib/include/platinum/NptMap.h K m_Key; K 75 extra_lib/include/platinum/NptMap.h friend class NPT_Map<K,V>; K 79 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>() {} K 80 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>(const NPT_Map<K,V>& copy); K 83 extra_lib/include/platinum/NptMap.h ~NPT_Map<K,V>(); K 86 extra_lib/include/platinum/NptMap.h NPT_Result Put(const K& key, const V& value); K 87 extra_lib/include/platinum/NptMap.h NPT_Result Get(const K& key, V*& value) const; // WARNING: the second parameter is a POINTER on the value type!!! K 88 extra_lib/include/platinum/NptMap.h bool HasKey(const K& key) const { return GetEntry(key) != NULL; } K 90 extra_lib/include/platinum/NptMap.h NPT_Result Erase(const K& key); K 96 extra_lib/include/platinum/NptMap.h V& operator[](const K& key); K 97 extra_lib/include/platinum/NptMap.h const NPT_Map<K,V>& operator=(const NPT_Map<K,V>& copy); K 98 extra_lib/include/platinum/NptMap.h bool operator==(const NPT_Map<K,V>& other) const; K 99 extra_lib/include/platinum/NptMap.h bool operator!=(const NPT_Map<K,V>& other) const; K 106 extra_lib/include/platinum/NptMap.h Entry* GetEntry(const K& key) const; K 115 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 116 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::NPT_Map(const NPT_Map<K,V>& copy) K 124 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 125 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::~NPT_Map() K 134 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 136 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::Clear() K 147 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 148 extra_lib/include/platinum/NptMap.h typename NPT_Map<K,V>::Entry* K 149 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::GetEntry(const K& key) const K 165 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 167 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::Put(const K& key, const V& value) K 184 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 186 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::Get(const K& key, V*& value) const K 203 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 205 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::HasValue(const V& value) const K 221 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 222 extra_lib/include/platinum/NptMap.h const NPT_Map<K,V>& K 223 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::operator=(const NPT_Map<K,V>& copy) K 244 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 246 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::Erase(const K& key) K 266 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 268 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::operator==(const NPT_Map<K,V>& other) const K 293 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 295 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::operator!=(const NPT_Map<K,V>& other) const K 303 extra_lib/include/platinum/NptMap.h template <typename K, typename V> K 305 extra_lib/include/platinum/NptMap.h NPT_Map<K,V>::operator[](const K& key) K 320 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF = NPT_Hash<K> > K 328 extra_lib/include/platinum/NptMap.h Entry(NPT_UInt32 hash_value, const K& key, const V& value) : m_HashValue(hash_value), m_Key(key), m_Value(value) {} K 329 extra_lib/include/platinum/NptMap.h Entry(NPT_UInt32 hash_value, const K& key) : m_HashValue(hash_value), m_Key(key) {} K 332 extra_lib/include/platinum/NptMap.h const K& GetKey() const { return m_Key; } K 347 extra_lib/include/platinum/NptMap.h K m_Key; K 351 extra_lib/include/platinum/NptMap.h friend class NPT_HashMap<K,V,HF>; K 357 extra_lib/include/platinum/NptMap.h Iterator(Entry** entry, const NPT_HashMap<K,V,HF>* map) : m_Entry(entry), m_Map(map) {} K 394 extra_lib/include/platinum/NptMap.h friend class NPT_HashMap<K,V,HF>; K 398 extra_lib/include/platinum/NptMap.h const NPT_HashMap<K,V,HF>* m_Map; K 402 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>(); K 403 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>(const HF& hasher); K 404 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>(const NPT_HashMap<K,V,HF>& copy); K 407 extra_lib/include/platinum/NptMap.h ~NPT_HashMap<K,V,HF>(); K 410 extra_lib/include/platinum/NptMap.h NPT_Result Put(const K& key, const V& value); K 411 extra_lib/include/platinum/NptMap.h NPT_Result Get(const K& key, V*& value) const; // WARNING: the second parameter is a POINTER on the value type!!! K 412 extra_lib/include/platinum/NptMap.h bool HasKey(const K& key) const { return GetEntry(key) != NULL; } K 414 extra_lib/include/platinum/NptMap.h NPT_Result Erase(const K& key); K 434 extra_lib/include/platinum/NptMap.h V& operator[](const K& key); K 435 extra_lib/include/platinum/NptMap.h const NPT_HashMap<K,V,HF>& operator=(const NPT_HashMap<K,V,HF>& copy); K 436 extra_lib/include/platinum/NptMap.h bool operator==(const NPT_HashMap<K,V,HF>& other) const; K 437 extra_lib/include/platinum/NptMap.h bool operator!=(const NPT_HashMap<K,V,HF>& other) const; K 441 extra_lib/include/platinum/NptMap.h Entry* GetEntry(const K& key, NPT_UInt32* position=NULL) const; K 456 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 457 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::NPT_HashMap() : K 467 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 468 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::NPT_HashMap(const HF& hasher) : K 479 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 480 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::NPT_HashMap(const NPT_HashMap<K,V,HF>& copy) : K 491 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 492 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::~NPT_HashMap() K 503 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 505 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::AllocateBuckets(unsigned int count_log) K 517 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 519 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::AdjustBuckets(NPT_Cardinal entry_count, bool allow_shrink) K 544 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 546 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::Clear() K 563 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 564 extra_lib/include/platinum/NptMap.h typename NPT_HashMap<K,V,HF>::Iterator K 565 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::GetEntries() const K 578 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 579 extra_lib/include/platinum/NptMap.h typename NPT_HashMap<K,V,HF>::Entry* K 580 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::GetEntry(const K& key, NPT_UInt32* position) const K 601 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 603 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::AddEntry(Entry* entry) K 622 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 624 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::Put(const K& key, const V& value) K 641 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 643 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::Get(const K& key, V*& value) const K 660 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 662 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::HasValue(const V& value) const K 676 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 678 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::Erase(const K& key) K 721 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 722 extra_lib/include/platinum/NptMap.h const NPT_HashMap<K,V,HF>& K 723 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::operator=(const NPT_HashMap<K,V,HF>& copy) K 749 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 751 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::operator==(const NPT_HashMap<K,V,HF>& other) const K 772 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 774 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::operator!=(const NPT_HashMap<K,V,HF>& other) const K 782 extra_lib/include/platinum/NptMap.h template <typename K, typename V, typename HF> K 784 extra_lib/include/platinum/NptMap.h NPT_HashMap<K,V,HF>::operator[](const K& key) K 2711 src/utils/dlmalloc.c unsigned int K;\ K 2712 src/utils/dlmalloc.c __asm__("bsrl\t%1, %0\n\t" : "=r" (K) : "g" (X));\ K 2713 src/utils/dlmalloc.c I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ K 2726 src/utils/dlmalloc.c unsigned int K = _bit_scan_reverse (X); \ K 2727 src/utils/dlmalloc.c I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ K 2740 src/utils/dlmalloc.c unsigned int K;\ K 2741 src/utils/dlmalloc.c _BitScanReverse((DWORD *) &K, (DWORD)X);\ K 2742 src/utils/dlmalloc.c I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ K 2757 src/utils/dlmalloc.c unsigned int K = (((Y <<= N) - 0x1000) >> 16) & 4;\ K 2758 src/utils/dlmalloc.c N += K;\ K 2759 src/utils/dlmalloc.c N += K = (((Y <<= K) - 0x4000) >> 16) & 2;\ K 2760 src/utils/dlmalloc.c K = 14 - N + ((Y <<= K) >> 15);\ K 2761 src/utils/dlmalloc.c I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));\ K 2837 src/utils/dlmalloc.c unsigned int K = Y >> (16-4) & 16;\ K 2838 src/utils/dlmalloc.c unsigned int N = K; Y >>= K;\ K 2839 src/utils/dlmalloc.c N += K = Y >> (8-3) & 8; Y >>= K;\ K 2840 src/utils/dlmalloc.c N += K = Y >> (4-2) & 4; Y >>= K;\ K 2841 src/utils/dlmalloc.c N += K = Y >> (2-1) & 2; Y >>= K;\ K 2842 src/utils/dlmalloc.c N += K = Y >> (1-0) & 1; Y >>= K;\ K 3513 src/utils/dlmalloc.c size_t K = S << leftshift_for_tree_index(I);\ K 3516 src/utils/dlmalloc.c tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\ K 3517 src/utils/dlmalloc.c K <<= 1;\ K 116 src/utils/sha1.c e += S(a,5) + F(b,c,d) + K + x; b = S(b,30); \ K 424 src/utils/sha1.c const unsigned K[] = /* Constants defined in SHA-1 */ K 461 src/utils/sha1.c ((B & C) | ((~B) & D)) + E + W[t] + K[0]; K 472 src/utils/sha1.c temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[1]; K 484 src/utils/sha1.c ((B & C) | (B & D) | (C & D)) + E + W[t] + K[2]; K 495 src/utils/sha1.c temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[3];