Subversion Repositories tendra.SVN

Rev

Rev 2 | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
2 7u83 1 
/*
7 7u83 2 
 * Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
3 
 * All rights reserved.
4 
 *
5 
 * Redistribution and use in source and binary forms, with or without
6 
 * modification, are permitted provided that the following conditions are met:
7 
 *
8 
 * 1. Redistributions of source code must retain the above copyright notice,
9 
 *    this list of conditions and the following disclaimer.
10 
 * 2. Redistributions in binary form must reproduce the above copyright notice,
11 
 *    this list of conditions and the following disclaimer in the documentation
12 
 *    and/or other materials provided with the distribution.
13 
 * 3. Neither the name of The TenDRA Project nor the names of its contributors
14 
 *    may be used to endorse or promote products derived from this software
15 
 *    without specific, prior written permission.
16 
 *
17 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
18 
 * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
19 
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
20 
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
21 
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
22 
 * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
23 
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
24 
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25 
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
26 
 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
27 
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 
 *
29 
 * $Id$
30 
 */
31 
/*
2 7u83 32 
    		 Crown Copyright (c) 1997
33 
 
34 
    This TenDRA(r) Computer Program is subject to Copyright
35 
    owned by the United Kingdom Secretary of State for Defence
36 
    acting through the Defence Evaluation and Research Agency
37 
    (DERA).  It is made available to Recipients with a
38 
    royalty-free licence for its use, reproduction, transfer
39 
    to other parties and amendment for any purpose not excluding
40 
    product development provided that any such use et cetera
41 
    shall be deemed to be acceptance of the following conditions:-
42 
 
43 
        (1) Its Recipients shall ensure that this Notice is
44 
        reproduced upon any copies or amended versions of it;
45 
 
46 
        (2) Any amended version of it shall be clearly marked to
47 
        show both the nature of and the organisation responsible
48 
        for the relevant amendment or amendments;
49 
 
50 
        (3) Its onward transfer from a recipient to another
51 
        party shall be deemed to be that party's acceptance of
52 
        these conditions;
53 
 
54 
        (4) DERA gives no warranty or assurance as to its
55 
        quality or suitability for any purpose and DERA accepts
56 
        no liability whatsoever in relation to any use to which
57 
        it may be put.
58 
*/
59 
 
60 
 
61 
/**********************************************************************
62 
$Author: release $
63 
$Date: 1998/01/17 15:55:45 $
64 
$Revision: 1.1.1.1 $
65 
$Log: xalloc.c,v $
66 
 * Revision 1.1.1.1  1998/01/17  15:55:45  release
67 
 * First version to be checked into rolling release.
68 
 *
69 
 * Revision 1.1  1995/04/06  10:43:34  currie
70 
 * Initial revision
71 
 *
72 
***********************************************************************/
73 
 
74 
 
75 
#include "config.h"
76 
#include "common_types.h"
77 
#include "basicread.h"
78 
#include "messages_r.h"
79 
#include "xalloc.h"
80 
 
7 7u83 81 
voidstar
82 
xcalloc(int n, size_t s)
2 7u83 83 
{
7 7u83 84 
  voidstar v;
85 
  if (n == 0) {
86 
    return((voidstar)0);
2 7u83 87 
  }
7 7u83 88 
 
89 
  v = (voidstar)calloc((size_t)n, s);
90 
  if (v == (voidstar)0) {
91 
    failer(NO_MEMORY);
92 
    exit(EXIT_FAILURE);
93 
  }
94 
  return(v);
2 7u83 95 
}
96 
 
7 7u83 97 
voidstar
98 
xrealloc(voidstar p, size_t s)
2 7u83 99 
{
7 7u83 100 
  voidstar v;
101 
 
102 
  v = (voidstar)realloc(p, s);
103 
  if (v == (voidstar)0) {
104 
    failer(NO_MEMORY);
105 
    exit(EXIT_FAILURE);
2 7u83 106 
  }
107 
  return v;
108 
}
109 
 
7 7u83 110 
void
111 
xfree(voidstar p)
2 7u83 112 
{
7 7u83 113 
   if (p) {
2 7u83 114 
     free(p);
7 7u83 115 
   }
2 7u83 116 
   return;
117 
}
118 
 
7 7u83 119 
voidstar
120 
xmalloc(size_t s)
2 7u83 121 
{
7 7u83 122 
  voidstar v;
123 
 
124 
  v = (voidstar)malloc(s);
125 
  if (s != (size_t)0 && v == (voidstar)0) {
126 
    failer(NO_MEMORY);
127 
    exit(EXIT_FAILURE);
2 7u83 128 
  }
7 7u83 129 
  return(v);
2 7u83 130 
}