obstack.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628
  1. /* obstack.c - subroutines used implicitly by object stack macros
  2. Copyright (C) 1988-1994,96,97,98,99,2000,2001 Free Software Foundation, Inc.
  3. This file is part of the GNU C Library. Its master source is NOT part of
  4. the C library, however. The master source lives in /gd/gnu/lib.
  5. The GNU C Library is free software; you can redistribute it and/or
  6. modify it under the terms of the GNU Lesser General Public
  7. License as published by the Free Software Foundation; either
  8. version 2.1 of the License, or (at your option) any later version.
  9. The GNU C Library is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. Lesser General Public License for more details.
  13. You should have received a copy of the GNU Lesser General Public
  14. License along with the GNU C Library; if not, write to the Free
  15. Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  16. 02111-1307 USA. */
  17. /* Make uClibc lie about being glibc. */
  18. #define __FORCE_GLIBC 1
  19. #ifdef HAVE_CONFIG_H
  20. # include <config.h>
  21. #endif
  22. #include <obstack.h>
  23. /* NOTE BEFORE MODIFYING THIS FILE: This version number must be
  24. incremented whenever callers compiled using an old obstack.h can no
  25. longer properly call the functions in this obstack.c. */
  26. #define OBSTACK_INTERFACE_VERSION 1
  27. /* Comment out all this code if we are using the GNU C Library, and are not
  28. actually compiling the library itself, and the installed library
  29. supports the same library interface we do. This code is part of the GNU
  30. C Library, but also included in many other GNU distributions. Compiling
  31. and linking in this code is a waste when using the GNU C library
  32. (especially if it is a shared library). Rather than having every GNU
  33. program understand `configure --with-gnu-libc' and omit the object
  34. files, it is simpler to just do this in the source for each such file. */
  35. #include <stdio.h> /* Random thing to get __GNU_LIBRARY__. */
  36. #if !defined _LIBC && defined __GNU_LIBRARY__ && __GNU_LIBRARY__ > 1
  37. # include <gnu-versions.h>
  38. # if _GNU_OBSTACK_INTERFACE_VERSION == OBSTACK_INTERFACE_VERSION
  39. # define ELIDE_CODE
  40. # endif
  41. #endif
  42. #if defined _LIBC && defined USE_IN_LIBIO
  43. # include <wchar.h>
  44. #endif
  45. #ifndef ELIDE_CODE
  46. # if defined __STDC__ && __STDC__
  47. # define POINTER void *
  48. # else
  49. # define POINTER char *
  50. # endif
  51. /* Determine default alignment. */
  52. struct fooalign {char x; double d;};
  53. # define DEFAULT_ALIGNMENT \
  54. ((PTR_INT_TYPE) ((char *) &((struct fooalign *) 0)->d - (char *) 0))
  55. /* If malloc were really smart, it would round addresses to DEFAULT_ALIGNMENT.
  56. But in fact it might be less smart and round addresses to as much as
  57. DEFAULT_ROUNDING. So we prepare for it to do that. */
  58. union fooround {long x; double d;};
  59. # define DEFAULT_ROUNDING (sizeof (union fooround))
  60. /* When we copy a long block of data, this is the unit to do it with.
  61. On some machines, copying successive ints does not work;
  62. in such a case, redefine COPYING_UNIT to `long' (if that works)
  63. or `char' as a last resort. */
  64. # ifndef COPYING_UNIT
  65. # define COPYING_UNIT int
  66. # endif
  67. /* The functions allocating more room by calling `obstack_chunk_alloc'
  68. jump to the handler pointed to by `obstack_alloc_failed_handler'.
  69. This can be set to a user defined function which should either
  70. abort gracefully or use longjump - but shouldn't return. This
  71. variable by default points to the internal function
  72. `print_and_abort'. */
  73. # if defined __STDC__ && __STDC__
  74. static void print_and_abort (void);
  75. void (*obstack_alloc_failed_handler) (void) = print_and_abort;
  76. # else
  77. static void print_and_abort ();
  78. void (*obstack_alloc_failed_handler) () = print_and_abort;
  79. # endif
  80. /* Exit value used when `print_and_abort' is used. */
  81. # if defined __GNU_LIBRARY__ || defined HAVE_STDLIB_H
  82. # include <stdlib.h>
  83. # endif
  84. # ifndef EXIT_FAILURE
  85. # define EXIT_FAILURE 1
  86. # endif
  87. int obstack_exit_failure = EXIT_FAILURE;
  88. /* The non-GNU-C macros copy the obstack into this global variable
  89. to avoid multiple evaluation. */
  90. struct obstack *_obstack;
  91. /* Define a macro that either calls functions with the traditional malloc/free
  92. calling interface, or calls functions with the mmalloc/mfree interface
  93. (that adds an extra first argument), based on the state of use_extra_arg.
  94. For free, do not use ?:, since some compilers, like the MIPS compilers,
  95. do not allow (expr) ? void : void. */
  96. # if defined __STDC__ && __STDC__
  97. # define CALL_CHUNKFUN(h, size) \
  98. (((h) -> use_extra_arg) \
  99. ? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
  100. : (*(struct _obstack_chunk *(*) (long)) (h)->chunkfun) ((size)))
  101. # define CALL_FREEFUN(h, old_chunk) \
  102. do { \
  103. if ((h) -> use_extra_arg) \
  104. (*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
  105. else \
  106. (*(void (*) (void *)) (h)->freefun) ((old_chunk)); \
  107. } while (0)
  108. # else
  109. # define CALL_CHUNKFUN(h, size) \
  110. (((h) -> use_extra_arg) \
  111. ? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
  112. : (*(struct _obstack_chunk *(*) ()) (h)->chunkfun) ((size)))
  113. # define CALL_FREEFUN(h, old_chunk) \
  114. do { \
  115. if ((h) -> use_extra_arg) \
  116. (*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
  117. else \
  118. (*(void (*) ()) (h)->freefun) ((old_chunk)); \
  119. } while (0)
  120. # endif
  121. /* Initialize an obstack H for use. Specify chunk size SIZE (0 means default).
  122. Objects start on multiples of ALIGNMENT (0 means use default).
  123. CHUNKFUN is the function to use to allocate chunks,
  124. and FREEFUN the function to free them.
  125. Return nonzero if successful, calls obstack_alloc_failed_handler if
  126. allocation fails. */
  127. int
  128. _obstack_begin (h, size, alignment, chunkfun, freefun)
  129. struct obstack *h;
  130. int size;
  131. int alignment;
  132. # if defined __STDC__ && __STDC__
  133. POINTER (*chunkfun) (long);
  134. void (*freefun) (void *);
  135. # else
  136. POINTER (*chunkfun) ();
  137. void (*freefun) ();
  138. # endif
  139. {
  140. register struct _obstack_chunk *chunk; /* points to new chunk */
  141. if (alignment == 0)
  142. alignment = (int) DEFAULT_ALIGNMENT;
  143. if (size == 0)
  144. /* Default size is what GNU malloc can fit in a 4096-byte block. */
  145. {
  146. /* 12 is sizeof (mhead) and 4 is EXTRA from GNU malloc.
  147. Use the values for range checking, because if range checking is off,
  148. the extra bytes won't be missed terribly, but if range checking is on
  149. and we used a larger request, a whole extra 4096 bytes would be
  150. allocated.
  151. These number are irrelevant to the new GNU malloc. I suspect it is
  152. less sensitive to the size of the request. */
  153. int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1))
  154. + 4 + DEFAULT_ROUNDING - 1)
  155. & ~(DEFAULT_ROUNDING - 1));
  156. size = 4096 - extra;
  157. }
  158. # if defined __STDC__ && __STDC__
  159. h->chunkfun = (struct _obstack_chunk * (*)(void *, long)) chunkfun;
  160. h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun;
  161. # else
  162. h->chunkfun = (struct _obstack_chunk * (*)()) chunkfun;
  163. h->freefun = freefun;
  164. # endif
  165. h->chunk_size = size;
  166. h->alignment_mask = alignment - 1;
  167. h->use_extra_arg = 0;
  168. chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
  169. if (!chunk)
  170. (*obstack_alloc_failed_handler) ();
  171. h->next_free = h->object_base = chunk->contents;
  172. h->chunk_limit = chunk->limit
  173. = (char *) chunk + h->chunk_size;
  174. chunk->prev = 0;
  175. /* The initial chunk now contains no empty object. */
  176. h->maybe_empty_object = 0;
  177. h->alloc_failed = 0;
  178. return 1;
  179. }
  180. int
  181. _obstack_begin_1 (h, size, alignment, chunkfun, freefun, arg)
  182. struct obstack *h;
  183. int size;
  184. int alignment;
  185. # if defined __STDC__ && __STDC__
  186. POINTER (*chunkfun) (POINTER, long);
  187. void (*freefun) (POINTER, POINTER);
  188. # else
  189. POINTER (*chunkfun) ();
  190. void (*freefun) ();
  191. # endif
  192. POINTER arg;
  193. {
  194. register struct _obstack_chunk *chunk; /* points to new chunk */
  195. if (alignment == 0)
  196. alignment = (int) DEFAULT_ALIGNMENT;
  197. if (size == 0)
  198. /* Default size is what GNU malloc can fit in a 4096-byte block. */
  199. {
  200. /* 12 is sizeof (mhead) and 4 is EXTRA from GNU malloc.
  201. Use the values for range checking, because if range checking is off,
  202. the extra bytes won't be missed terribly, but if range checking is on
  203. and we used a larger request, a whole extra 4096 bytes would be
  204. allocated.
  205. These number are irrelevant to the new GNU malloc. I suspect it is
  206. less sensitive to the size of the request. */
  207. int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1))
  208. + 4 + DEFAULT_ROUNDING - 1)
  209. & ~(DEFAULT_ROUNDING - 1));
  210. size = 4096 - extra;
  211. }
  212. # if defined __STDC__ && __STDC__
  213. h->chunkfun = (struct _obstack_chunk * (*)(void *,long)) chunkfun;
  214. h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun;
  215. # else
  216. h->chunkfun = (struct _obstack_chunk * (*)()) chunkfun;
  217. h->freefun = freefun;
  218. # endif
  219. h->chunk_size = size;
  220. h->alignment_mask = alignment - 1;
  221. h->extra_arg = arg;
  222. h->use_extra_arg = 1;
  223. chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
  224. if (!chunk)
  225. (*obstack_alloc_failed_handler) ();
  226. h->next_free = h->object_base = chunk->contents;
  227. h->chunk_limit = chunk->limit
  228. = (char *) chunk + h->chunk_size;
  229. chunk->prev = 0;
  230. /* The initial chunk now contains no empty object. */
  231. h->maybe_empty_object = 0;
  232. h->alloc_failed = 0;
  233. return 1;
  234. }
  235. /* Allocate a new current chunk for the obstack *H
  236. on the assumption that LENGTH bytes need to be added
  237. to the current object, or a new object of length LENGTH allocated.
  238. Copies any partial object from the end of the old chunk
  239. to the beginning of the new one. */
  240. void
  241. _obstack_newchunk (h, length)
  242. struct obstack *h;
  243. int length;
  244. {
  245. register struct _obstack_chunk *old_chunk = h->chunk;
  246. register struct _obstack_chunk *new_chunk;
  247. register long new_size;
  248. register long obj_size = h->next_free - h->object_base;
  249. register long i;
  250. long already;
  251. char *object_base;
  252. /* Compute size for new chunk. */
  253. new_size = (obj_size + length) + (obj_size >> 3) + h->alignment_mask + 100;
  254. if (new_size < h->chunk_size)
  255. new_size = h->chunk_size;
  256. /* Allocate and initialize the new chunk. */
  257. new_chunk = CALL_CHUNKFUN (h, new_size);
  258. if (!new_chunk)
  259. (*obstack_alloc_failed_handler) ();
  260. h->chunk = new_chunk;
  261. new_chunk->prev = old_chunk;
  262. new_chunk->limit = h->chunk_limit = (char *) new_chunk + new_size;
  263. /* Compute an aligned object_base in the new chunk */
  264. object_base =
  265. __INT_TO_PTR ((__PTR_TO_INT (new_chunk->contents) + h->alignment_mask)
  266. & ~ (h->alignment_mask));
  267. /* Move the existing object to the new chunk.
  268. Word at a time is fast and is safe if the object
  269. is sufficiently aligned. */
  270. if (h->alignment_mask + 1 >= DEFAULT_ALIGNMENT)
  271. {
  272. for (i = obj_size / sizeof (COPYING_UNIT) - 1;
  273. i >= 0; i--)
  274. ((COPYING_UNIT *)object_base)[i]
  275. = ((COPYING_UNIT *)h->object_base)[i];
  276. /* We used to copy the odd few remaining bytes as one extra COPYING_UNIT,
  277. but that can cross a page boundary on a machine
  278. which does not do strict alignment for COPYING_UNITS. */
  279. already = obj_size / sizeof (COPYING_UNIT) * sizeof (COPYING_UNIT);
  280. }
  281. else
  282. already = 0;
  283. /* Copy remaining bytes one by one. */
  284. for (i = already; i < obj_size; i++)
  285. object_base[i] = h->object_base[i];
  286. /* If the object just copied was the only data in OLD_CHUNK,
  287. free that chunk and remove it from the chain.
  288. But not if that chunk might contain an empty object. */
  289. if (h->object_base == old_chunk->contents && ! h->maybe_empty_object)
  290. {
  291. new_chunk->prev = old_chunk->prev;
  292. CALL_FREEFUN (h, old_chunk);
  293. }
  294. h->object_base = object_base;
  295. h->next_free = h->object_base + obj_size;
  296. /* The new chunk certainly contains no empty object yet. */
  297. h->maybe_empty_object = 0;
  298. }
  299. /* Return nonzero if object OBJ has been allocated from obstack H.
  300. This is here for debugging.
  301. If you use it in a program, you are probably losing. */
  302. # if defined __STDC__ && __STDC__
  303. /* Suppress -Wmissing-prototypes warning. We don't want to declare this in
  304. obstack.h because it is just for debugging. */
  305. int _obstack_allocated_p (struct obstack *h, POINTER obj);
  306. # endif
  307. int
  308. _obstack_allocated_p (h, obj)
  309. struct obstack *h;
  310. POINTER obj;
  311. {
  312. register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
  313. register struct _obstack_chunk *plp; /* point to previous chunk if any */
  314. lp = (h)->chunk;
  315. /* We use >= rather than > since the object cannot be exactly at
  316. the beginning of the chunk but might be an empty object exactly
  317. at the end of an adjacent chunk. */
  318. while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
  319. {
  320. plp = lp->prev;
  321. lp = plp;
  322. }
  323. return lp != 0;
  324. }
  325. /* Free objects in obstack H, including OBJ and everything allocate
  326. more recently than OBJ. If OBJ is zero, free everything in H. */
  327. # undef obstack_free
  328. /* This function has two names with identical definitions.
  329. This is the first one, called from non-ANSI code. */
  330. void
  331. _obstack_free (h, obj)
  332. struct obstack *h;
  333. POINTER obj;
  334. {
  335. register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
  336. register struct _obstack_chunk *plp; /* point to previous chunk if any */
  337. lp = h->chunk;
  338. /* We use >= because there cannot be an object at the beginning of a chunk.
  339. But there can be an empty object at that address
  340. at the end of another chunk. */
  341. while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
  342. {
  343. plp = lp->prev;
  344. CALL_FREEFUN (h, lp);
  345. lp = plp;
  346. /* If we switch chunks, we can't tell whether the new current
  347. chunk contains an empty object, so assume that it may. */
  348. h->maybe_empty_object = 1;
  349. }
  350. if (lp)
  351. {
  352. h->object_base = h->next_free = (char *) (obj);
  353. h->chunk_limit = lp->limit;
  354. h->chunk = lp;
  355. }
  356. else if (obj != 0)
  357. /* obj is not in any of the chunks! */
  358. abort ();
  359. }
  360. /* This function is used from ANSI code. */
  361. void
  362. obstack_free (h, obj)
  363. struct obstack *h;
  364. POINTER obj;
  365. {
  366. register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
  367. register struct _obstack_chunk *plp; /* point to previous chunk if any */
  368. lp = h->chunk;
  369. /* We use >= because there cannot be an object at the beginning of a chunk.
  370. But there can be an empty object at that address
  371. at the end of another chunk. */
  372. while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
  373. {
  374. plp = lp->prev;
  375. CALL_FREEFUN (h, lp);
  376. lp = plp;
  377. /* If we switch chunks, we can't tell whether the new current
  378. chunk contains an empty object, so assume that it may. */
  379. h->maybe_empty_object = 1;
  380. }
  381. if (lp)
  382. {
  383. h->object_base = h->next_free = (char *) (obj);
  384. h->chunk_limit = lp->limit;
  385. h->chunk = lp;
  386. }
  387. else if (obj != 0)
  388. /* obj is not in any of the chunks! */
  389. abort ();
  390. }
  391. int
  392. _obstack_memory_used (h)
  393. struct obstack *h;
  394. {
  395. register struct _obstack_chunk* lp;
  396. register int nbytes = 0;
  397. for (lp = h->chunk; lp != 0; lp = lp->prev)
  398. {
  399. nbytes += lp->limit - (char *) lp;
  400. }
  401. return nbytes;
  402. }
  403. /* Define the error handler. */
  404. # ifndef _
  405. /* # if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC */
  406. # ifdef __UCLIBC_HAS_GETTEXT_AWARENESS__
  407. # include <libintl.h>
  408. # ifndef _
  409. # define _(Str) __dcgettext (NULL, Str, LC_MESSAGES)
  410. # endif
  411. # else
  412. # define _(Str) (Str)
  413. # endif
  414. # endif
  415. # if defined _LIBC && defined USE_IN_LIBIO
  416. # include <libio/iolibio.h>
  417. # define fputs(s, f) _IO_fputs (s, f)
  418. # endif
  419. # ifndef __attribute__
  420. /* This feature is available in gcc versions 2.5 and later. */
  421. # if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 5)
  422. # define __attribute__(Spec) /* empty */
  423. # endif
  424. # endif
  425. static void
  426. __attribute__ ((noreturn))
  427. print_and_abort ()
  428. {
  429. /* Don't change any of these strings. Yes, it would be possible to add
  430. the newline to the string and use fputs or so. But this must not
  431. happen because the "memory exhausted" message appears in other places
  432. like this and the translation should be reused instead of creating
  433. a very similar string which requires a separate translation. */
  434. # if defined _LIBC && defined USE_IN_LIBIO
  435. if (_IO_fwide (stderr, 0) > 0)
  436. __fwprintf (stderr, L"%s\n", _("memory exhausted"));
  437. else
  438. # endif
  439. fprintf (stderr, "%s\n", _("memory exhausted"));
  440. exit (obstack_exit_failure);
  441. }
  442. # if 0
  443. /* These are now turned off because the applications do not use it
  444. and it uses bcopy via obstack_grow, which causes trouble on sysV. */
  445. /* Now define the functional versions of the obstack macros.
  446. Define them to simply use the corresponding macros to do the job. */
  447. # if defined __STDC__ && __STDC__
  448. /* These function definitions do not work with non-ANSI preprocessors;
  449. they won't pass through the macro names in parentheses. */
  450. /* The function names appear in parentheses in order to prevent
  451. the macro-definitions of the names from being expanded there. */
  452. POINTER (obstack_base) (obstack)
  453. struct obstack *obstack;
  454. {
  455. return obstack_base (obstack);
  456. }
  457. POINTER (obstack_next_free) (obstack)
  458. struct obstack *obstack;
  459. {
  460. return obstack_next_free (obstack);
  461. }
  462. int (obstack_object_size) (obstack)
  463. struct obstack *obstack;
  464. {
  465. return obstack_object_size (obstack);
  466. }
  467. int (obstack_room) (obstack)
  468. struct obstack *obstack;
  469. {
  470. return obstack_room (obstack);
  471. }
  472. int (obstack_make_room) (obstack, length)
  473. struct obstack *obstack;
  474. int length;
  475. {
  476. return obstack_make_room (obstack, length);
  477. }
  478. void (obstack_grow) (obstack, data, length)
  479. struct obstack *obstack;
  480. const POINTER data;
  481. int length;
  482. {
  483. obstack_grow (obstack, data, length);
  484. }
  485. void (obstack_grow0) (obstack, data, length)
  486. struct obstack *obstack;
  487. const POINTER data;
  488. int length;
  489. {
  490. obstack_grow0 (obstack, data, length);
  491. }
  492. void (obstack_1grow) (obstack, character)
  493. struct obstack *obstack;
  494. int character;
  495. {
  496. obstack_1grow (obstack, character);
  497. }
  498. void (obstack_blank) (obstack, length)
  499. struct obstack *obstack;
  500. int length;
  501. {
  502. obstack_blank (obstack, length);
  503. }
  504. void (obstack_1grow_fast) (obstack, character)
  505. struct obstack *obstack;
  506. int character;
  507. {
  508. obstack_1grow_fast (obstack, character);
  509. }
  510. void (obstack_blank_fast) (obstack, length)
  511. struct obstack *obstack;
  512. int length;
  513. {
  514. obstack_blank_fast (obstack, length);
  515. }
  516. POINTER (obstack_finish) (obstack)
  517. struct obstack *obstack;
  518. {
  519. return obstack_finish (obstack);
  520. }
  521. POINTER (obstack_alloc) (obstack, length)
  522. struct obstack *obstack;
  523. int length;
  524. {
  525. return obstack_alloc (obstack, length);
  526. }
  527. POINTER (obstack_copy) (obstack, address, length)
  528. struct obstack *obstack;
  529. const POINTER address;
  530. int length;
  531. {
  532. return obstack_copy (obstack, address, length);
  533. }
  534. POINTER (obstack_copy0) (obstack, address, length)
  535. struct obstack *obstack;
  536. const POINTER address;
  537. int length;
  538. {
  539. return obstack_copy0 (obstack, address, length);
  540. }
  541. # endif /* __STDC__ */
  542. # endif /* 0 */
  543. #endif /* !ELIDE_CODE */