base/error.c

   1 /*
   2  * Copyright (c) 2010 Kungliga Tekniska Högskolan
   3  * (Royal Institute of Technology, Stockholm, Sweden).
   4  * All rights reserved.
   5  *
   6  * Portions Copyright (c) 2010 Apple Inc. All rights reserved.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  11  *
  12  * 1. Redistributions of source code must retain the above copyright
  13  *    notice, this list of conditions and the following disclaimer.
  14  *
  15  * 2. Redistributions in binary form must reproduce the above copyright
  16  *    notice, this list of conditions and the following disclaimer in the
  17  *    documentation and/or other materials provided with the distribution.
  18  *
  19  * 3. Neither the name of the Institute nor the names of its contributors
  20  *    may be used to endorse or promote products derived from this software
  21  *    without specific prior written permission.
  22  *
  23  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
  24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
  27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  33  * SUCH DAMAGE.
  34  */
  35
  36 #include "baselocl.h"
  37
  38 struct heim_error {
  39     int error_code;
  40     heim_string_t msg;
  41     struct heim_error *next;
  42 };
  43
  44 static void
  45 error_dealloc(void *ptr)
  46 {
  47     struct heim_error *p = ptr;
  48     heim_release(p->msg);
  49     heim_release(p->next);
  50 }
  51
  52 static int
  53 error_cmp(void *a, void *b)
  54 {
  55     struct heim_error *ap = a, *bp = b;
  56     if (ap->error_code == ap->error_code)
  57         return ap->error_code - ap->error_code;
  58     return heim_cmp(ap->msg, bp->msg);
  59 }
  60
  61 static unsigned long
  62 error_hash(void *ptr)
  63 {
  64     struct heim_error *p = ptr;
  65     return p->error_code;
  66 }
  67
  68 struct heim_type_data _heim_error_object = {
  69     HEIM_TID_ERROR,
  70     "error-object",
  71     NULL,
  72     error_dealloc,
  73     NULL,
  74     error_cmp,
  75     error_hash
  76 };
  77
  78 heim_error_t
  79 heim_error_create(int error_code, const char *fmt, ...)
  80 {
  81     heim_error_t e;
  82     va_list ap;
  83
  84     va_start(ap, fmt);
  85     e = heim_error_createv(error_code, fmt, ap);
  86     va_end(ap);
  87
  88     return e;
  89 }
  90
  91 heim_error_t
  92 heim_error_createv(int error_code, const char *fmt, va_list ap)
  93 {
  94     heim_error_t e;
  95     char *str;
  96     int len;
  97
  98     str = malloc(1024);
  99     if (str == NULL)
 100         return NULL;
 101     len = vsnprintf(str, 1024, fmt, ap);
 102     if (len < 0) {
 103         free(str);
 104         return NULL;
 105     }
 106
 107     e = _heim_alloc_object(&_heim_error_object, sizeof(struct heim_error));
 108     if (e) {
 109         e->msg = heim_string_create(str);
 110         e->error_code = error_code;
 111     }
 112     free(str);
 113
 114     return e;
 115 }
 116
 117 heim_string_t
 118 heim_error_copy_string(heim_error_t error)
 119 {
 120     /* XXX concat all strings */
 121     return heim_retain(error->msg);
 122 }
 123
 124 int
 125 heim_error_get_code(heim_error_t error)
 126 {
 127     return error->error_code;
 128 }
 129
 130 heim_error_t
 131 heim_error_append(heim_error_t top, heim_error_t append)
 132 {
 133     if (top->next)
 134         heim_release(top->next);
 135     top->next = heim_retain(append);
 136     return top;
 137 }