/usr/share/doc/libortp8-dev/html/str__utils_8h_source.html is in libortp-dev 3.3.2-4.1ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>oRTP: include/ortp/str_utils.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">oRTP
 <span id="projectnumber">0.16.3</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- Generated by Doxygen 1.7.6.1 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</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>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div>
<div class="header">
<div class="headertitle">
<div class="title">include/ortp/str_utils.h</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> The oRTP library is an RTP (Realtime Transport Protocol - rfc3550) stack.</span>
<a name="l00003"></a>00003 <span class="comment"> Copyright (C) 2001 Simon MORLAT simon.morlat@linphone.org</span>
<a name="l00004"></a>00004 <span class="comment"></span>
<a name="l00005"></a>00005 <span class="comment"> This library is free software; you can redistribute it and/or</span>
<a name="l00006"></a>00006 <span class="comment"> modify it under the terms of the GNU Lesser General Public</span>
<a name="l00007"></a>00007 <span class="comment"> License as published by the Free Software Foundation; either</span>
<a name="l00008"></a>00008 <span class="comment"> version 2.1 of the License, or (at your option) any later version.</span>
<a name="l00009"></a>00009 <span class="comment"></span>
<a name="l00010"></a>00010 <span class="comment"> This library is distributed in the hope that it will be useful,</span>
<a name="l00011"></a>00011 <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00012"></a>00012 <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00013"></a>00013 <span class="comment"> Lesser General Public License for more details.</span>
<a name="l00014"></a>00014 <span class="comment"></span>
<a name="l00015"></a>00015 <span class="comment"> You should have received a copy of the GNU Lesser General Public</span>
<a name="l00016"></a>00016 <span class="comment"> License along with this library; if not, write to the Free Software</span>
<a name="l00017"></a>00017 <span class="comment"> Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</span>
<a name="l00018"></a>00018 <span class="comment">*/</span>
<a name="l00019"></a>00019
<a name="l00020"></a>00020 <span class="preprocessor">#ifndef STR_UTILS_H</span>
<a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define STR_UTILS_H</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span>
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="preprocessor">#include <ortp/port.h></span>
<a name="l00025"></a>00025
<a name="l00026"></a>00026
<a name="l00027"></a><a class="code" href="structmsgb.html">00027</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structmsgb.html">msgb</a>
<a name="l00028"></a>00028 {
<a name="l00029"></a>00029 <span class="keyword">struct </span><a class="code" href="structmsgb.html">msgb</a> *b_prev;
<a name="l00030"></a>00030 <span class="keyword">struct </span><a class="code" href="structmsgb.html">msgb</a> *b_next;
<a name="l00031"></a>00031 <span class="keyword">struct </span><a class="code" href="structmsgb.html">msgb</a> *b_cont;
<a name="l00032"></a>00032 <span class="keyword">struct </span><a class="code" href="structdatab.html">datab</a> *b_datap;
<a name="l00033"></a>00033 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *b_rptr;
<a name="l00034"></a>00034 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *b_wptr;
<a name="l00035"></a>00035 uint32_t reserved1;
<a name="l00036"></a>00036 uint32_t reserved2;
<a name="l00037"></a>00037 } <a class="code" href="structmsgb.html">mblk_t</a>;
<a name="l00038"></a>00038
<a name="l00039"></a><a class="code" href="structdatab.html">00039</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structdatab.html">datab</a>
<a name="l00040"></a>00040 {
<a name="l00041"></a>00041 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *db_base;
<a name="l00042"></a>00042 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *db_lim;
<a name="l00043"></a>00043 void (*db_freefn)(<span class="keywordtype">void</span>*);
<a name="l00044"></a>00044 <span class="keywordtype">int</span> db_ref;
<a name="l00045"></a>00045 } <a class="code" href="structdatab.html">dblk_t</a>;
<a name="l00046"></a>00046
<a name="l00047"></a><a class="code" href="struct__queue.html">00047</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="struct__queue.html">_queue</a>
<a name="l00048"></a>00048 {
<a name="l00049"></a>00049 <a class="code" href="structmsgb.html">mblk_t</a> _q_stopper;
<a name="l00050"></a>00050 <span class="keywordtype">int</span> q_mcount; <span class="comment">/*number of packet in the q */</span>
<a name="l00051"></a>00051 } <a class="code" href="struct__queue.html">queue_t</a>;
<a name="l00052"></a>00052
<a name="l00053"></a>00053 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00054"></a>00054 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">"C"</span> {
<a name="l00055"></a>00055 <span class="preprocessor">#endif</span>
<a name="l00056"></a>00056 <span class="preprocessor"></span>
<a name="l00057"></a>00057 <span class="keywordtype">void</span> qinit(<a class="code" href="struct__queue.html">queue_t</a> *q);
<a name="l00058"></a>00058
<a name="l00059"></a>00059 <span class="keywordtype">void</span> putq(<a class="code" href="struct__queue.html">queue_t</a> *q, <a class="code" href="structmsgb.html">mblk_t</a> *m);
<a name="l00060"></a>00060
<a name="l00061"></a>00061 <a class="code" href="structmsgb.html">mblk_t</a> * getq(<a class="code" href="struct__queue.html">queue_t</a> *q);
<a name="l00062"></a>00062
<a name="l00063"></a>00063 <span class="keywordtype">void</span> insq(<a class="code" href="struct__queue.html">queue_t</a> *q,<a class="code" href="structmsgb.html">mblk_t</a> *emp, <a class="code" href="structmsgb.html">mblk_t</a> *mp);
<a name="l00064"></a>00064
<a name="l00065"></a>00065 <span class="keywordtype">void</span> remq(<a class="code" href="struct__queue.html">queue_t</a> *q, <a class="code" href="structmsgb.html">mblk_t</a> *mp);
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <a class="code" href="structmsgb.html">mblk_t</a> * peekq(<a class="code" href="struct__queue.html">queue_t</a> *q);
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="comment">/* remove and free all messages in the q */</span>
<a name="l00070"></a>00070 <span class="preprocessor">#define FLUSHALL 0</span>
<a name="l00071"></a>00071 <span class="preprocessor"></span><span class="keywordtype">void</span> flushq(<a class="code" href="struct__queue.html">queue_t</a> *q, <span class="keywordtype">int</span> how);
<a name="l00072"></a>00072
<a name="l00073"></a>00073 <span class="keywordtype">void</span> mblk_init(<a class="code" href="structmsgb.html">mblk_t</a> *mp);
<a name="l00074"></a>00074
<a name="l00075"></a>00075 <span class="comment">/* allocates a mblk_t, that points to a datab_t, that points to a buffer of size size. */</span>
<a name="l00076"></a>00076 <a class="code" href="structmsgb.html">mblk_t</a> *allocb(<span class="keywordtype">int</span> size, <span class="keywordtype">int</span> unused);
<a name="l00077"></a>00077 <span class="preprocessor">#define BPRI_MED 0</span>
<a name="l00078"></a>00078 <span class="preprocessor"></span>
<a name="l00079"></a>00079 <span class="comment">/* allocates a mblk_t, that points to a datab_t, that points to buf; buf will be freed using freefn */</span>
<a name="l00080"></a>00080 <a class="code" href="structmsgb.html">mblk_t</a> *esballoc(uint8_t *buf, <span class="keywordtype">int</span> size, <span class="keywordtype">int</span> pri, <span class="keywordtype">void</span> (*freefn)(<span class="keywordtype">void</span>*) );
<a name="l00081"></a>00081
<a name="l00082"></a>00082 <span class="comment">/* frees a mblk_t, and if the datab ref_count is 0, frees it and the buffer too */</span>
<a name="l00083"></a>00083 <span class="keywordtype">void</span> freeb(<a class="code" href="structmsgb.html">mblk_t</a> *m);
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="comment">/* frees recursively (follow b_cont) a mblk_t, and if the datab</span>
<a name="l00086"></a>00086 <span class="comment">ref_count is 0, frees it and the buffer too */</span>
<a name="l00087"></a>00087 <span class="keywordtype">void</span> freemsg(<a class="code" href="structmsgb.html">mblk_t</a> *mp);
<a name="l00088"></a>00088
<a name="l00089"></a>00089 <span class="comment">/* duplicates a mblk_t , buffer is not duplicated*/</span>
<a name="l00090"></a>00090 <a class="code" href="structmsgb.html">mblk_t</a> *dupb(<a class="code" href="structmsgb.html">mblk_t</a> *m);
<a name="l00091"></a>00091
<a name="l00092"></a>00092 <span class="comment">/* duplicates a complex mblk_t, buffer is not duplicated */</span>
<a name="l00093"></a>00093 <a class="code" href="structmsgb.html">mblk_t</a> *dupmsg(<a class="code" href="structmsgb.html">mblk_t</a>* m);
<a name="l00094"></a>00094
<a name="l00095"></a>00095 <span class="comment">/* returns the size of data of a message */</span>
<a name="l00096"></a>00096 <span class="keywordtype">int</span> msgdsize(<span class="keyword">const</span> <a class="code" href="structmsgb.html">mblk_t</a> *mp);
<a name="l00097"></a>00097
<a name="l00098"></a>00098 <span class="comment">/* concatenates all fragment of a complex message*/</span>
<a name="l00099"></a>00099 <span class="keywordtype">void</span> msgpullup(<a class="code" href="structmsgb.html">mblk_t</a> *mp,<span class="keywordtype">int</span> len);
<a name="l00100"></a>00100
<a name="l00101"></a>00101 <span class="comment">/* duplicates a single message, but with buffer included */</span>
<a name="l00102"></a>00102 <a class="code" href="structmsgb.html">mblk_t</a> *copyb(<a class="code" href="structmsgb.html">mblk_t</a> *mp);
<a name="l00103"></a>00103
<a name="l00104"></a>00104 <span class="comment">/* duplicates a complex message with buffer included */</span>
<a name="l00105"></a>00105 <a class="code" href="structmsgb.html">mblk_t</a> *copymsg(<a class="code" href="structmsgb.html">mblk_t</a> *mp);
<a name="l00106"></a>00106
<a name="l00107"></a>00107 <a class="code" href="structmsgb.html">mblk_t</a> * appendb(<a class="code" href="structmsgb.html">mblk_t</a> *mp, <span class="keyword">const</span> <span class="keywordtype">char</span> *data, <span class="keywordtype">int</span> size, bool_t pad);
<a name="l00108"></a>00108 <span class="keywordtype">void</span> msgappend(<a class="code" href="structmsgb.html">mblk_t</a> *mp, <span class="keyword">const</span> <span class="keywordtype">char</span> *data, <span class="keywordtype">int</span> size, bool_t pad);
<a name="l00109"></a>00109
<a name="l00110"></a>00110 <a class="code" href="structmsgb.html">mblk_t</a> *concatb(<a class="code" href="structmsgb.html">mblk_t</a> *mp, <a class="code" href="structmsgb.html">mblk_t</a> *newm);
<a name="l00111"></a>00111
<a name="l00112"></a>00112 <span class="preprocessor">#define qempty(q) (&(q)->_q_stopper==(q)->_q_stopper.b_next)</span>
<a name="l00113"></a>00113 <span class="preprocessor"></span><span class="preprocessor">#define qfirst(q) ((q)->_q_stopper.b_next!=&(q)->_q_stopper ? (q)->_q_stopper.b_next : NULL)</span>
<a name="l00114"></a>00114 <span class="preprocessor"></span><span class="preprocessor">#define qbegin(q) ((q)->_q_stopper.b_next)</span>
<a name="l00115"></a>00115 <span class="preprocessor"></span><span class="preprocessor">#define qlast(q) ((q)->_q_stopper.b_prev!=&(q)->_q_stopper ? (q)->_q_stopper.b_prev : NULL)</span>
<a name="l00116"></a>00116 <span class="preprocessor"></span><span class="preprocessor">#define qend(q,mp) ((mp)==&(q)->_q_stopper)</span>
<a name="l00117"></a>00117 <span class="preprocessor"></span><span class="preprocessor">#define qnext(q,mp) ((mp)->b_next)</span>
<a name="l00118"></a>00118 <span class="preprocessor"></span>
<a name="l00119"></a><a class="code" href="struct__msgb__allocator.html">00119</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="struct__msgb__allocator.html">_msgb_allocator</a>{
<a name="l00120"></a>00120 <a class="code" href="struct__queue.html">queue_t</a> q;
<a name="l00121"></a>00121 }<a class="code" href="struct__msgb__allocator.html">msgb_allocator_t</a>;
<a name="l00122"></a>00122
<a name="l00123"></a>00123 <span class="keywordtype">void</span> msgb_allocator_init(<a class="code" href="struct__msgb__allocator.html">msgb_allocator_t</a> *pa);
<a name="l00124"></a>00124 <a class="code" href="structmsgb.html">mblk_t</a> *msgb_allocator_alloc(<a class="code" href="struct__msgb__allocator.html">msgb_allocator_t</a> *pa, <span class="keywordtype">int</span> size);
<a name="l00125"></a>00125 <span class="keywordtype">void</span> msgb_allocator_uninit(<a class="code" href="struct__msgb__allocator.html">msgb_allocator_t</a> *pa);
<a name="l00126"></a>00126
<a name="l00127"></a>00127 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00128"></a>00128 <span class="preprocessor"></span>}
<a name="l00129"></a>00129 <span class="preprocessor">#endif</span>
<a name="l00130"></a>00130 <span class="preprocessor"></span>
<a name="l00131"></a>00131 <span class="preprocessor">#endif</span>
</pre></div></div><!-- contents -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Mar 9 2012 18:31:57 for oRTP by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>
</body>
</html>
|