2012-05-11 Stan Shebs <stan@codesourcery.com>
[deliverable/binutils-gdb.git] / gdb / common / buffer.c
1 /* A simple growing buffer for GDB.
2
3 Copyright (C) 2009-2012 Free Software Foundation, Inc.
4
5 This file is part of GDB.
6
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
11
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
19
20 #ifdef GDBSERVER
21 #include "server.h"
22 #else
23 #include "defs.h"
24 #endif
25
26 #include "xml-utils.h"
27 #include "buffer.h"
28
29 #include <stdlib.h>
30 #include <string.h>
31 #include <stdio.h>
32
33 void
34 buffer_grow (struct buffer *buffer, const char *data, size_t size)
35 {
36 char *new_buffer;
37 size_t new_buffer_size;
38
39 if (size == 0)
40 return;
41
42 new_buffer_size = buffer->buffer_size;
43
44 if (new_buffer_size == 0)
45 new_buffer_size = 1;
46
47 while (buffer->used_size + size > new_buffer_size)
48 new_buffer_size *= 2;
49 new_buffer = xrealloc (buffer->buffer, new_buffer_size);
50 if (!new_buffer)
51 abort ();
52 memcpy (new_buffer + buffer->used_size, data, size);
53 buffer->buffer = new_buffer;
54 buffer->buffer_size = new_buffer_size;
55 buffer->used_size += size;
56 }
57
58 void
59 buffer_free (struct buffer *buffer)
60 {
61 if (!buffer)
62 return;
63
64 xfree (buffer->buffer);
65 buffer->buffer = NULL;
66 buffer->buffer_size = 0;
67 buffer->used_size = 0;
68 }
69
70 void
71 buffer_init (struct buffer *buffer)
72 {
73 memset (buffer, 0, sizeof (*buffer));
74 }
75
76 char*
77 buffer_finish (struct buffer *buffer)
78 {
79 char *ret = buffer->buffer;
80 buffer->buffer = NULL;
81 buffer->buffer_size = 0;
82 buffer->used_size = 0;
83 return ret;
84 }
85
86 void
87 buffer_xml_printf (struct buffer *buffer, const char *format, ...)
88 {
89 va_list ap;
90 const char *f;
91 const char *prev;
92 int percent = 0;
93
94 va_start (ap, format);
95
96 prev = format;
97 for (f = format; *f; f++)
98 {
99 if (percent)
100 {
101 char buf[32];
102 char *p;
103 char *str = buf;
104 const char *f_old = f;
105
106 switch (*f)
107 {
108 case 's':
109 str = va_arg (ap, char *);
110 break;
111 case 'd':
112 sprintf (str, "%d", va_arg (ap, int));
113 break;
114 case 'u':
115 sprintf (str, "%u", va_arg (ap, unsigned int));
116 break;
117 case 'x':
118 sprintf (str, "%x", va_arg (ap, unsigned int));
119 break;
120 case 'o':
121 sprintf (str, "%o", va_arg (ap, unsigned int));
122 break;
123 case 'l':
124 f++;
125 switch (*f)
126 {
127 case 'd':
128 sprintf (str, "%ld", va_arg (ap, long));
129 break;
130 case 'u':
131 sprintf (str, "%lu", va_arg (ap, unsigned long));
132 break;
133 case 'x':
134 sprintf (str, "%lx", va_arg (ap, unsigned long));
135 break;
136 case 'o':
137 sprintf (str, "%lo", va_arg (ap, unsigned long));
138 break;
139 case 'l':
140 f++;
141 switch (*f)
142 {
143 case 'd':
144 sprintf (str, "%lld", va_arg (ap, long long));
145 break;
146 case 'u':
147 sprintf (str, "%llu", va_arg (ap, unsigned long long));
148 break;
149 case 'x':
150 sprintf (str, "%llx", va_arg (ap, unsigned long long));
151 break;
152 case 'o':
153 sprintf (str, "%llo", va_arg (ap, unsigned long long));
154 break;
155 default:
156 str = 0;
157 break;
158 }
159 break;
160 default:
161 str = 0;
162 break;
163 }
164 break;
165 default:
166 str = 0;
167 break;
168 }
169
170 if (str)
171 {
172 buffer_grow (buffer, prev, f_old - prev - 1);
173 p = xml_escape_text (str);
174 buffer_grow_str (buffer, p);
175 xfree (p);
176 prev = f + 1;
177 }
178 percent = 0;
179 }
180 else if (*f == '%')
181 percent = 1;
182 }
183
184 buffer_grow_str (buffer, prev);
185 va_end (ap);
186 }
187
This page took 0.049134 seconds and 5 git commands to generate.