/*
 * Copyright (c) 1989 Stanford University
 *
 * Permission to use, copy, modify, distribute, and sell this software and its
 * documentation for any purpose is hereby granted without fee, provided
 * that the above copyright notice appear in all copies and that both that
 * copyright notice and this permission notice appear in supporting
 * documentation, and that the name of Stanford not be used in advertising or
 * publicity pertaining to distribution of the software without specific,
 * written prior permission.  Stanford makes no representations about
 * the suitability of this software for any purpose.  It is provided "as is"
 * without express or implied warranty.
 *
 * STANFORD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
 * IN NO EVENT SHALL STANFORD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
 * DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

/*
 * Call finalization functions for static objects.
 */

#if defined(__GNUG__)

#include <InterViews/defs.h>

typedef void (*PF)();

struct PFList {
    int count;
    PF f[1];		/* really PF f[count]; */
    PFList* next;	/* for dynamically loaded objects */
};

extern PFList __DTOR_LIST__;

#if defined(__cplusplus)
extern "C" { void _finish(); }
#endif

void _finish() {
    PFList* list = &__DTOR_LIST__;
    if (list->count > 0) {
	PF* end;
	do {
	    end = &list->f[list->count];
	    for (PF* f = &list->f[0]; f < end; f++) {
		(**f)();
	    }
	    list = *(PFList**)end;
	} while (list != nil);
    }
}

#endif