1// -*- C++ -*-
2
3// Copyright (C) 2005-2015 Free Software Foundation, Inc.
4//
5// This file is part of the GNU ISO C++ Library.  This library is free
6// software; you can redistribute it and/or modify it under the terms
7// of the GNU General Public License as published by the Free Software
8// Foundation; either version 3, or (at your option) any later
9// version.
10
11// This library is distributed in the hope that it will be useful, but
12// WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
14// General Public License for more details.
15
16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
23// <http://www.gnu.org/licenses/>.
24
25// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
26
27// Permission to use, copy, modify, sell, and distribute this software
28// is hereby granted without fee, provided that the above copyright
29// notice appears in all copies, and that both that copyright notice
30// and this permission notice appear in supporting documentation. None
31// of the above authors, nor IBM Haifa Research Laboratories, make any
32// representation about the suitability of this software for any
33// purpose. It is provided "as is" without express or implied
34// warranty.
35
36/**
37 * @file gp_hash_table_map_/insert_store_hash_fn_imps.hpp
38 * Contains implementations of gp_ht_map_'s find related functions,
39 * when the hash value is stored.
40 */
41
42PB_DS_CLASS_T_DEC
43inline typename PB_DS_CLASS_C_DEC::comp_hash
44PB_DS_CLASS_C_DEC::
45find_ins_pos(key_const_reference r_key, true_type)
46{
47  PB_DS_ASSERT_VALID((*this))
48  comp_hash pos_hash_pair = ranged_probe_fn_base::operator()(r_key);
49
50  size_type i;
51
52  /* The insertion position is initted to a non-legal value to indicate
53   *     that it has not been initted yet.
54   */
55  size_type ins_pos = m_num_e;
56  resize_base::notify_insert_search_start();
57  for (i = 0; i < m_num_e; ++i)
58    {
59      const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
60
61      entry* const p_e = m_entries + pos;
62      switch(p_e->m_stat)
63        {
64        case empty_entry_status:
65	  {
66            resize_base::notify_insert_search_end();
67	    PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
68
69	    return ((ins_pos == m_num_e) ?
70		     std::make_pair(pos, pos_hash_pair.second) :
71		     std::make_pair(ins_pos, pos_hash_pair.second));
72	  }
73	  break;
74        case erased_entry_status:
75	  if (ins_pos == m_num_e)
76	    ins_pos = pos;
77	  break;
78        case valid_entry_status:
79	  if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash,
80					  r_key, pos_hash_pair.second))
81            {
82	      resize_base::notify_insert_search_end();
83	      PB_DS_CHECK_KEY_EXISTS(r_key)
84              return std::make_pair(pos, pos_hash_pair.second);
85            }
86	  break;
87        default:
88	  _GLIBCXX_DEBUG_ASSERT(0);
89        };
90      resize_base::notify_insert_search_collision();
91    }
92  resize_base::notify_insert_search_end();
93  if (ins_pos == m_num_e)
94    __throw_insert_error();
95  return std::make_pair(ins_pos, pos_hash_pair.second);
96}
97
98PB_DS_CLASS_T_DEC
99inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
100PB_DS_CLASS_C_DEC::
101insert_imp(const_reference r_val, true_type)
102{
103  key_const_reference r_key = PB_DS_V2F(r_val);
104  comp_hash pos_hash_pair = find_ins_pos(r_key,
105					 traits_base::m_store_extra_indicator);
106
107  _GLIBCXX_DEBUG_ASSERT(pos_hash_pair.first < m_num_e);
108  entry_pointer p_e =& m_entries[pos_hash_pair.first];
109  if (p_e->m_stat == valid_entry_status)
110    {
111      PB_DS_CHECK_KEY_EXISTS(r_key)
112      return std::make_pair(&p_e->m_value, false);
113    }
114
115  PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
116  return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true);
117}
118
119