0d5ed7dff5
git-svn-id: https://swig.svn.sourceforge.net/svnroot/swig/trunk/SWIG@651 626c5289-ae23-0410-ae9c-e8d60b6d4f22
103 lines
3.8 KiB
C
103 lines
3.8 KiB
C
/* -----------------------------------------------------------------------------
|
|
* misc.c
|
|
*
|
|
* Miscellaneous functions that don't really fit anywhere else.
|
|
*
|
|
* Author(s) : David Beazley (beazley@cs.uchicago.edu)
|
|
*
|
|
* Copyright (C) 1999-2000. The University of Chicago
|
|
* See the file LICENSE for information on usage and redistribution.
|
|
* ----------------------------------------------------------------------------- */
|
|
|
|
static char cvsroot[] = "$Header$";
|
|
|
|
#include "swig.h"
|
|
#include "swigver.h"
|
|
|
|
/* -----------------------------------------------------------------------------
|
|
* Swig_copy_string()
|
|
*
|
|
* Duplicate a NULL-terminate string given as a char *.
|
|
* ----------------------------------------------------------------------------- */
|
|
|
|
char *
|
|
Swig_copy_string(const char *s) {
|
|
char *c = 0;
|
|
if (s) {
|
|
c = (char *) malloc(strlen(s)+1);
|
|
strcpy(c,s);
|
|
}
|
|
return c;
|
|
}
|
|
|
|
/* -----------------------------------------------------------------------------
|
|
* Swig_banner()
|
|
*
|
|
* Emits the SWIG identifying banner.
|
|
* ----------------------------------------------------------------------------- */
|
|
|
|
void
|
|
Swig_banner(File *f) {
|
|
Printf(f,
|
|
"/* ----------------------------------------------------------------------------\n\
|
|
* This file was automatically generated by SWIG (http://www.swig.org).\n\
|
|
* Version %s %s\n\
|
|
* \n\
|
|
* Portions Copyright (c) 1995-2000\n\
|
|
* The University of Utah, The Regents of the University of California, and\n\
|
|
* The University of Chicago. Permission is hereby granted to use, modify, \n\
|
|
* and distribute this file in any manner provided this notice remains intact.\n\
|
|
* \n\
|
|
* This file is not intended to be easily readable and contains a number of \n\
|
|
* coding conventions designed to improve portability and efficiency. Do not make\n\
|
|
* changes to this file unless you know what you are doing--modify the SWIG \n\
|
|
* interface file instead. \n\
|
|
* ----------------------------------------------------------------------------- */\n\n", SWIG_VERSION, SWIG_SPIN);
|
|
|
|
}
|
|
|
|
/* -----------------------------------------------------------------------------
|
|
* Swig_temp_result()
|
|
*
|
|
* This function is used to return a "temporary" result--a result that is only
|
|
* guaranteed to exist for a short period of time. Typically this is used by
|
|
* functions that return strings and other intermediate results that are
|
|
* used in print statements.
|
|
*
|
|
* Note: this is really a bit of a kludge to make it easier to work with
|
|
* temporary variables (so that the caller doesn't have to worry about
|
|
* memory management). In theory, it is possible to break this if an
|
|
* operation produces so many temporaries that it overflows the internal
|
|
* array before they are used. However, in practice, this would only
|
|
* occur for very deep levels of recursion or functions taking lots of
|
|
* parameters---neither of which occur very often in SWIG (if at all).
|
|
* Also, a user can prevent destruction of a temporary object by increasing
|
|
* it's reference count using DohIncref().
|
|
*
|
|
* It is an error to place two identical results onto this list. It is also
|
|
* an error for a caller to free anything returned by this function.
|
|
*
|
|
* Note: SWIG1.1 did something similar to this in a less-organized manner.
|
|
* ----------------------------------------------------------------------------- */
|
|
|
|
#define MAX_RESULT 512
|
|
|
|
static DOH *results[MAX_RESULT];
|
|
static int results_index = 0;
|
|
static int results_init = 0;
|
|
|
|
DOH *Swig_temp_result(DOH *x) {
|
|
int i;
|
|
if (!results_init) {
|
|
for (i = 0; i < MAX_RESULT; i++) results[i] = 0;
|
|
results_init = 1;
|
|
}
|
|
/* Printf(stdout,"results_index = %d, %x, '%s'\n", results_index, x, x); */
|
|
if (results[results_index]) Delete(results[results_index]);
|
|
results[results_index] = x;
|
|
results_index = (results_index + 1) % MAX_RESULT;
|
|
return x;
|
|
}
|
|
|
|
|
|
|