Updated doc to match code
[sipe-libnice.git] / agent / test-priority.c
blobe8ee42ac318dd225b29538e42b9004057a8a0523
1 /*
2 * This file is part of the Nice GLib ICE library.
4 * (C) 2006, 2007 Collabora Ltd.
5 * Contact: Dafydd Harries
6 * (C) 2006, 2007 Nokia Corporation. All rights reserved.
7 * Contact: Kai Vehmanen
9 * The contents of this file are subject to the Mozilla Public License Version
10 * 1.1 (the "License"); you may not use this file except in compliance with
11 * the License. You may obtain a copy of the License at
12 * http://www.mozilla.org/MPL/
14 * Software distributed under the License is distributed on an "AS IS" basis,
15 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
16 * for the specific language governing rights and limitations under the
17 * License.
19 * The Original Code is the Nice GLib ICE library.
21 * The Initial Developers of the Original Code are Collabora Ltd and Nokia
22 * Corporation. All Rights Reserved.
24 * Contributors:
25 * Dafydd Harries, Collabora Ltd.
27 * Alternatively, the contents of this file may be used under the terms of the
28 * the GNU Lesser General Public License Version 2.1 (the "LGPL"), in which
29 * case the provisions of LGPL are applicable instead of those above. If you
30 * wish to allow use of your version of this file only under the terms of the
31 * LGPL and not to allow others to use your version of this file under the
32 * MPL, indicate your decision by deleting the provisions above and replace
33 * them with the notice and other provisions required by the LGPL. If you do
34 * not delete the provisions above, a recipient may use your version of this
35 * file under either the MPL or the LGPL.
37 #ifdef HAVE_CONFIG_H
38 # include <config.h>
39 #endif
41 #include "agent.h"
43 int
44 main (void)
46 NiceCandidate *candidate;
48 /* test 1 */
49 candidate = nice_candidate_new (NICE_CANDIDATE_TYPE_HOST);
50 g_assert (nice_candidate_ice_priority (candidate) == 0x78000200);
51 g_assert (nice_candidate_jingle_priority (candidate) == 1.0);
52 nice_candidate_free (candidate);
54 /* test 2 */
56 /* 2^32*MIN(O,A) + 2*MAX(O,A) + (O>A?1:0)
57 = 2^32*1 + 2*5000 + 0
58 = 4294977296 */
59 g_assert (nice_candidate_pair_priority (1,5000) == 4294977296LL);
61 /* 2^32*1 + 2*5000 + 1 = 4294977297 */
62 g_assert (nice_candidate_pair_priority (5000, 1) == 4294977297LL);
64 return 0;