📄 hash_8c-source.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"><title>OCILIB (C Driver for Oracle): C:/Users/vincent/Data/Perso/dev/ocilib/ocilib/src/hash.c Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.5.4 --><div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="modules.html"><span>Modules</span></a></li> <li><a href="annotated.html"><span>Data Structures</span></a></li> <li class="current"><a href="files.html"><span>Files</span></a></li> </ul></div><h1>C:/Users/vincent/Data/Perso/dev/ocilib/ocilib/src/hash.c</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span><a name="l00002"></a>00002 <span class="comment"> +----------------------------------------------------------------------+ </span><a name="l00003"></a>00003 <span class="comment"> | |</span><a name="l00004"></a>00004 <span class="comment"> | OCILIB - C Driver for Oracle |</span><a name="l00005"></a>00005 <span class="comment"> | |</span><a name="l00006"></a>00006 <span class="comment"> | (C Wrapper for Oracle OCI) |</span><a name="l00007"></a>00007 <span class="comment"> | |</span><a name="l00008"></a>00008 <span class="comment"> +----------------------------------------------------------------------+</span><a name="l00009"></a>00009 <span class="comment"> | Website : http://ocilib.net |</span><a name="l00010"></a>00010 <span class="comment"> +----------------------------------------------------------------------+</span><a name="l00011"></a>00011 <span class="comment"> | Copyright (c) 2007-2009 Vincent ROGIER |</span><a name="l00012"></a>00012 <span class="comment"> +----------------------------------------------------------------------+</span><a name="l00013"></a>00013 <span class="comment"> | This library is free software; you can redistribute it and/or |</span><a name="l00014"></a>00014 <span class="comment"> | modify it under the terms of the GNU Library General Public |</span><a name="l00015"></a>00015 <span class="comment"> | License as published by the Free Software Foundation; either |</span><a name="l00016"></a>00016 <span class="comment"> | version 2 of the License, or (at your option) any later version. |</span><a name="l00017"></a>00017 <span class="comment"> | |</span><a name="l00018"></a>00018 <span class="comment"> | This library is distributed in the hope that it will be useful, |</span><a name="l00019"></a>00019 <span class="comment"> | but WITHOUT ANY WARRANTY; without even the implied warranty of |</span><a name="l00020"></a>00020 <span class="comment"> | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |</span><a name="l00021"></a>00021 <span class="comment"> | Library General Public License for more details. |</span><a name="l00022"></a>00022 <span class="comment"> | |</span><a name="l00023"></a>00023 <span class="comment"> | You should have received a copy of the GNU Library General Public |</span><a name="l00024"></a>00024 <span class="comment"> | License along with this library; if not, write to the Free |</span><a name="l00025"></a>00025 <span class="comment"> | Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |</span><a name="l00026"></a>00026 <span class="comment"> +----------------------------------------------------------------------+</span><a name="l00027"></a>00027 <span class="comment"> | Author: Vincent ROGIER <vince.rogier@gmail.com> |</span><a name="l00028"></a>00028 <span class="comment"> +----------------------------------------------------------------------+ </span><a name="l00029"></a>00029 <span class="comment">*/</span><a name="l00030"></a>00030 <a name="l00031"></a>00031 <span class="comment">/* ------------------------------------------------------------------------ *</span><a name="l00032"></a>00032 <span class="comment"> * $Id: hash.c, v 3.2.0 2009/04/20 00:00 Vince $</span><a name="l00033"></a>00033 <span class="comment"> * ------------------------------------------------------------------------ */</span><a name="l00034"></a>00034 <a name="l00035"></a>00035 <span class="preprocessor">#include "ocilib_internal.h"</span><a name="l00036"></a>00036 <a name="l00037"></a>00037 <span class="comment">/* ************************************************************************ *</span><a name="l00038"></a>00038 <span class="comment"> * PRIVATE FUNCTIONS</span><a name="l00039"></a>00039 <span class="comment"> * ************************************************************************ */</span><a name="l00040"></a>00040 <a name="l00041"></a>00041 <span class="comment">/* ------------------------------------------------------------------------ *</span><a name="l00042"></a>00042 <span class="comment"> * OCI_HashCompute</span><a name="l00043"></a>00043 <span class="comment"> * ------------------------------------------------------------------------ */</span><a name="l00044"></a>00044 <a name="l00045"></a>00045 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> OCI_HashCompute(<a class="code" href="struct_o_c_i___hash_table.html" title="OCILIB implementation of hash tables.">OCI_HashTable</a> *table, <span class="keyword">const</span> mtext *str)<a name="l00046"></a>00046 {<a name="l00047"></a>00047 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> h;<a name="l00048"></a>00048 mtext *p;<a name="l00049"></a>00049 mtext c;<a name="l00050"></a>00050 <a name="l00051"></a>00051 OCI_CHECK(table == NULL, 0);<a name="l00052"></a>00052 OCI_CHECK(str == NULL, 0);<a name="l00053"></a>00053 <a name="l00054"></a>00054 <span class="keywordflow">for</span>(h = 0, p = (mtext *) str; (*p) != 0; p++)<a name="l00055"></a>00055 {<a name="l00056"></a>00056 c = *p;<a name="l00057"></a>00057 <a name="l00058"></a>00058 h = 31 * h + mttoupper(c);<a name="l00059"></a>00059 }<a name="l00060"></a>00060 <a name="l00061"></a>00061 <span class="keywordflow">return</span> (h % table-><a class="code" href="struct_o_c_i___hash_table.html#97279c92f378e6d7055b84cef40f37f8">size</a>);<a name="l00062"></a>00062 }<a name="l00063"></a>00063 <a name="l00064"></a>00064 <span class="comment">/* ************************************************************************ *</span><a name="l00065"></a>00065 <span class="comment"> * PUBLIC FUNCTIONS</span><a name="l00066"></a>00066 <span class="comment"> * ************************************************************************ */</span><a name="l00067"></a>00067 <a name="l00068"></a>00068 <span class="comment">/* ------------------------------------------------------------------------ *</span><a name="l00069"></a>00069 <span class="comment"> * OCI_HashCreate</span><a name="l00070"></a>00070 <span class="comment"> * ------------------------------------------------------------------------ */</span><a name="l00071"></a>00071 <a name="l00072"></a><a class="code" href="group__g__hash.html#ga4375677fb934961a73a1f5d0de6eadd">00072</a> <a class="code" href="struct_o_c_i___hash_table.html" title="OCILIB implementation of hash tables.">OCI_HashTable</a> * OCI_API <a class="code" href="group__g__hash.html#ga4375677fb934961a73a1f5d0de6eadd" title="Create a hash table.">OCI_HashCreate</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> size, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> type)<a name="l00073"></a>00073 {<a name="l00074"></a>00074 <a class="code" href="struct_o_c_i___hash_table.html" title="OCILIB implementation of hash tables.">OCI_HashTable</a> *table = NULL;<a name="l00075"></a>00075 <span class="keywordtype">boolean</span> res = TRUE;<a name="l00076"></a>00076 <a name="l00077"></a>00077 <span class="comment">/* allocate table structure */</span><a name="l00078"></a>00078 <a name="l00079"></a>00079 table = (<a class="code" href="struct_o_c_i___hash_table.html" title="OCILIB implementation of hash tables.">OCI_HashTable</a> *) OCI_MemAlloc(OCI_IPC_HASHTABLE, <span class="keyword">sizeof</span>(*table), 1, TRUE);<a name="l00080"></a>00080 <a name="l00081"></a>00081 <span class="comment">/* set up attributes and allocate internal array of hash entry pointers */</span><a name="l00082"></a>00082 <a name="l00083"></a>00083 <span class="keywordflow">if</span> (table != NULL)<a name="l00084"></a>00084 {<a name="l00085"></a>00085 table-><a class="code" href="struct_o_c_i___hash_table.html#97279c92f378e6d7055b84cef40f37f8">size</a> = size;<a name="l00086"></a>00086 table-><a class="code" href="struct_o_c_i___hash_table.html#a6525f1ae5c855c254e80a406b0448b4">type</a> = type;<a name="l00087"></a>00087 table-><a class="code" href="struct_o_c_i___hash_table.html#c8d12a50d7ca4ad391914f1e141acbd8">count</a> = 0;<a name="l00088"></a>00088 <a name="l00089"></a>00089 table-><a class="code" href="struct_o_c_i___hash_table.html#9dfd0e1c5cf8bfdfe4c8f0c6ed525ee8">items</a> = (<a class="code" href="struct_o_c_i___hash_entry.html" title="Hash table entry.">OCI_HashEntry</a> **) OCI_MemAlloc(OCI_IPC_HASHENTRY_ARRAY,<a name="l00090"></a>00090 <span class="keyword">sizeof</span>(*table-><a class="code" href="struct_o_c_i___hash_table.html#9dfd0e1c5cf8bfdfe4c8f0c6ed525ee8">items</a>),<a name="l00091"></a>00091 size, TRUE);<a name="l00092"></a>00092 res = (table-><a class="code" href="struct_o_c_i___hash_table.html#9dfd0e1c5cf8bfdfe4c8f0c6ed525ee8">items</a> != NULL);<a name="l00093"></a>00093 }<a name="l00094"></a>00094 <span class="keywordflow">else</span><a name="l00095"></a>00095 res = FALSE;<a name="l00096"></a>00096 <a name="l00097"></a>00097 <span class="keywordflow">if</span> (res == FALSE)<a name="l00098"></a>00098 <a class="code" href="group__g__hash.html#g9d85500c527e1cb75697abd663add2f1" title="Destroy a hash table.">OCI_HashFree</a>(table);<a name="l00099"></a>00099 <a name="l00100"></a>00100 OCI_RESULT(res);<a name="l00101"></a>00101 <a name="l00102"></a>00102 <span class="keywordflow">return</span> table;<a name="l00103"></a>00103 }<a name="l00104"></a>00104 <a name="l00105"></a>00105 <span class="comment">/* ------------------------------------------------------------------------ *</span><a name="l00106"></a>00106 <span class="comment"> * OCI_HashFree</span><a name="l00107"></a>00107 <span class="comment"> * ------------------------------------------------------------------------ */</span><a name="l00108"></a>00108 <a name="l00109"></a><a class="code" href="group__g__hash.html#g9d85500c527e1cb75697abd663add2f1">00109</a> <span class="keywordtype">boolean</span> OCI_API <a class="code" href="group__g__hash.html#g9d85500c527e1cb75697abd663add2f1" title="Destroy a hash table.">OCI_HashFree</a>(<a class="code" href="struct_o_c_i___hash_table.html" title="OCILIB implementation of hash tables.">OCI_HashTable</a> *table)<a name="l00110"></a>00110 {<a name="l00111"></a>00111 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;<a name="l00112"></a>00112 <a name="l00113"></a>00113 <a class="code" href="struct_o_c_i___hash_entry.html" title="Hash table entry.">OCI_HashEntry</a> *e1, *e2;<a name="l00114"></a>00114 <a class="code" href="struct_o_c_i___hash_value.html" title="Hash table entry value.">OCI_HashValue</a> *v1, *v2;<a name="l00115"></a>00115 <a name="l00116"></a>00116 OCI_CHECK_PTR(OCI_IPC_HASHTABLE, table, FALSE);<a name="l00117"></a>00117 <a name="l00118"></a>00118 <span class="keywordflow">for</span> (i = 0; i < table-><a class="code" href="struct_o_c_i___hash_table.html#97279c92f378e6d7055b84cef40f37f8">size</a>; i++)<a name="l00119"></a>00119 {<a name="l00120"></a>00120 e1 = table-><a class="code" href="struct_o_c_i___hash_table.html#9dfd0e1c5cf8bfdfe4c8f0c6ed525ee8">items</a>[i];<a name="l00121"></a>00121 <a name="l00122"></a>00122 <span class="keywordflow">while</span> (e1 != NULL)<a name="l00123"></a>00123 {<a name="l00124"></a>00124 e2 = e1;<a name="l00125"></a>00125 e1 = e1-><a class="code" href="struct_o_c_i___hash_entry.html#30a5b623b628109381323e600a625731">next</a>;<a name="l00126"></a>00126 <a name="l00127"></a>00127 v1 = e2-><a class="code" href="struct_o_c_i___hash_entry.html#8a6e3f404f4b84f31f8b026ba9c651a5">values</a>;<a name="l00128"></a>00128 <a name="l00129"></a>00129 <span class="keywordflow">while</span> (v1 != NULL)<a name="l00130"></a>00130 {<a name="l00131"></a>00131 v2 = v1;<a name="l00132"></a>00132 v1 = v1-><a class="code" href="struct_o_c_i___hash_value.html#c4a5d0ce333010cefeabebf2cb78e897">next</a>;<a name="l00133"></a>00133 <a name="l00134"></a>00134 <span class="keywordflow">if</span> (table-><a class="code" href="struct_o_c_i___hash_table.html#a6525f1ae5c855c254e80a406b0448b4">type</a> == OCI_HASH_STRING)<a name="l00135"></a>00135 OCI_FREE(v2-><a class="code" href="struct_o_c_i___hash_value.html#b702bde98ae6323bcfd9996245c5b000">value</a>.<a class="code" href="union_o_c_i___variant.html#3fcdb2b40ab4ece809f7676c148252a6">p_mtext</a>);<a name="l00136"></a>00136 <a name="l00137"></a>00137 OCI_FREE(v2);<a name="l00138"></a>00138 }<a name="l00139"></a>00139 <a name="l00140"></a>00140 <span class="keywordflow">if</span> (e2-><a class="code" href="struct_o_c_i___hash_entry.html#6836bf979e9ff6975b14f13e1f1dc31d">key</a>)<a name="l00141"></a>00141 OCI_FREE(e2-><a class="code" href="struct_o_c_i___hash_entry.html#6836bf979e9ff6975b14f13e1f1dc31d">key</a>);<a name="l00142"></a>00142 <a name="l00143"></a>00143 <span class="keywordflow">if</span> (e2)<a name="l00144"></a>00144 OCI_FREE(e2);<a name="l00145"></a>00145 }⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -