webruby 0.1.2 → 0.2.1

data/modules/emscripten/src/framework.js

@@ -1,257 +0,0 @@
-//"use strict";
-
-//
-// A framework to make building Emscripten easier. Lets you write modular
-// code to handle specific issues.
-//
-// Actor - Some code that processes items.
-// Item - Some data that is processed by actors.
-// Substrate - A 'world' with some actors and some items.
-//
-// The idea is to create a substrate, fill it with the proper items
-// and actors, and then run it to completion. Actors will process
-// the items they are given, and forward the results to other actors,
-// until we are finished. Some of the results are then the final
-// output of the entire calculation done in the substrate.
-//
-
-var DEBUG = 0;
-var DEBUG_MEMORY = 0;
-
-var MemoryDebugger = {
-  clear: function() {
-    MemoryDebugger.time = Date.now();
-    MemoryDebugger.datas = {};
-    var info = MemoryDebugger.doGC();
-    MemoryDebugger.last = info[2];
-    MemoryDebugger.max = 0;
-    MemoryDebugger.tick('--clear--');
-  },
-
-  doGC: function() {
-    var raw = gc().replace('\n', '');
-    print('zz raw gc info: ' + raw);
-    return /before (\d+), after (\d+),.*/.exec(raw);
-  },
-
-  tick: function(name) {
-    var now = Date.now();
-    if (now - this.time > 1000) {
-      // ..
-      this.time = now;
-    }
-
-    // assume |name| exists from now on
-
-    var raw = gc().replace('\n', '');
-    var info = MemoryDebugger.doGC();
-    var before = info[1];
-    var after = info[2];
-    MemoryDebugger.max = Math.max(MemoryDebugger.max, before, after);
-    // A GC not called by us may have done some work 'silently'
-    var garbage = before - after;
-    var real = after - MemoryDebugger.last;
-    print('zz gc stats changes: ' + [name, real, garbage]);
-    MemoryDebugger.last = after;
-
-    if (Math.abs(garbage) + Math.abs(real) > 0) {
-      var data = MemoryDebugger.datas[name];
-      if (!data) {
-        data = MemoryDebugger.datas[name] = {
-          name: name,
-          count: 0,
-          garbage: 0,
-          real: 0
-        };
-      }
-      data.garbage += garbage;
-      data.real += real;
-      data.count++;
-    }
-
-    MemoryDebugger.dump();
-  },
-
-  dump: function() {
-    var vals = values(MemoryDebugger.datas);
-    print('zz max: ' + (MemoryDebugger.max/(1024*1024)).toFixed(3));
-    print('zz real:');
-    vals.sort(function(x, y) { return y.real - x.real });
-    vals.forEach(function(v) { if (Math.abs(v.real) > 1024*1024) print('zz    ' + v.name + ' real = ' + (v.real/(1024*1024)).toFixed(3) + ' mb'); });
-    print('zz garbage:');
-    vals.sort(function(x, y) { return y.garbage - x.garbage });
-    vals.forEach(function(v) { if (Math.abs(v.garbage) > 1024*1024) print('zz    ' + v.name + ' garbage = ' + (v.garbage/(1024*1024)).toFixed(3) + ' mb'); });
-  }
-}
-
-if (DEBUG_MEMORY) MemoryDebugger.clear();
-
-function Substrate(name_) {
-  this.name_ = name_;
-  this.actors = {};
-  this.currUid = 1;
-};
-
-Substrate.prototype = {
-  addItem: function(item, targetActor) {
-    if (targetActor == '/dev/null') return;
-    if (targetActor == '/dev/stdout') {
-      this.results.push(item);
-      return;
-    }
-    this.actors[targetActor].inbox.push(item);
-  },
-
-  addItems: function(items, targetActor) {
-    if (targetActor == '/dev/null') return;
-    if (targetActor == '/dev/stdout') {
-      this.results = this.results.concat(items);
-      return;
-    }
-    this.actors[targetActor].inbox = this.actors[targetActor].inbox.concat(items);
-  },
-
-  checkInbox: function(actor) {
-    var items = actor.inbox;
-    for (var i = 0; i < items.length; i++) {
-      var item = items[i];
-      if (!item.__uid__) {
-        item.__uid__ = this.currUid;
-        this.currUid ++;
-      }
-    }
-    var MAX_INCOMING = Infinity;
-    if (MAX_INCOMING == Infinity) {
-      actor.inbox = [];
-      actor.items = actor.items.concat(items);
-    } else {
-      throw 'Warning: Enter this code at your own risk. It can save memory, but often regresses speed.';
-      actor.inbox = items.slice(MAX_INCOMING);
-      actor.items = actor.items.concat(items.slice(0, MAX_INCOMING));
-    }
-  },
-
-  addActor: function(name_, actor) {
-    assert(name_ && actor);
-    actor.name_ = name_;
-    actor.items = [];
-    actor.inbox = [];
-    actor.forwardItem  = bind(this, this.addItem);
-    actor.forwardItems = bind(this, this.addItems);
-    this.actors[name_] = actor;
-    if (!actor.process) actor.process = Actor.prototype.process;
-    return actor;
-  },
-
-  solve: function() {
-    dprint('framework', "// Solving " + this.name_ + "...");
-
-    if (DEBUG_MEMORY) MemoryDebugger.tick('pre-run substrate ' + this.name_ + ' (priors may be cleaned)');
-
-    var startTime = Date.now();
-    var midTime = startTime;
-    var that = this;
-    function midComment() {
-      var curr = Date.now();
-      if (curr - midTime > 500) {
-        dprint('framework', '// Working on ' + that.name_ + ', so far ' + ((curr-startTime)/1000).toString().substr(0,10) + ' seconds.');
-        midTime = curr;
-      }
-    }
-    function finalComment() {
-      dprint('framework', '// Completed ' + that.name_ + ' in ' + ((Date.now() - startTime)/1000).toString().substr(0,10) + ' seconds.');
-    }
-
-    var ret = null;
-    var finalResult = null;
-    this.results = [];
-    var finished = false;
-    var onResult = this.onResult;
-    var actors = values(this.actors); // Assumes actors are not constantly added
-    while (!finished) {
-      dprint('framework', "Cycle start, items: ");// + values(this.actors).map(function(actor) actor.items).reduce(function(x,y) x+y, 0));
-      var hadProcessing = false;
-      for (var i = 0; i < actors.length; i++) {
-        var actor = actors[i];
-        if (actor.inbox.length == 0 && actor.items.length == 0) continue;
-
-        midComment();
-
-        this.checkInbox(actor);
-        var outputs;
-        var currResultCount = this.results.length;
-        dprint('framework', 'Processing using ' + actor.name_ + ': ' + actor.items.length);
-        outputs = actor.process(actor.items);
-        actor.items = [];
-        if (DEBUG_MEMORY) MemoryDebugger.tick('actor ' + actor.name_);
-        dprint('framework', 'New results: ' + (outputs.length + this.results.length - currResultCount) + ' out of ' + (this.results.length + outputs.length));
-        hadProcessing = true;
-
-        if (outputs && outputs.length > 0) {
-          if (outputs.length === 1 && outputs[0].__finalResult__) {
-            if (DEBUG) print("Solving complete: __finalResult__");
-            delete outputs[0].__finalResult__; // Might recycle this
-            delete outputs[0].__uid__;
-            finalComment();
-            finished = true;
-            finalResult = outputs[0];
-          } else {
-            this.results = this.results.concat(outputs);
-          }
-        }
-      }
-      if (!hadProcessing) {
-        if (DEBUG) print("Solving complete: no remaining items");
-        finalComment();
-        this.results.forEach(function(result) {
-          delete result.__uid__; // Might recycle these
-          if (onResult) onResult(result);
-        });
-        ret = this.results;
-        this.results = null; // No need to hold on to them any more
-        break;
-      }
-      if (finalResult) {
-        ret = finalResult;
-        break;
-      }
-      midComment();
-    }
-
-    // Clear the actors. Do not forget about the actors, though, to make this substrate reusable.
-    actors.forEach(function(actor) {
-      actor.items = null;
-      actor.inbox = null;
-    });
-
-    if (DEBUG_MEMORY) MemoryDebugger.tick('finished ' + this.name_);
-
-    return ret;
-  }
-};
-
-// Global access to the currently-being processed item.
-// Note that if you overload process in Actor, this will need to be set if you rely on it.
-var Framework = {
-  currItem: null
-};
-
-function Actor() { };
-Actor.prototype = {
-  process: function(items) {
-    var ret = [];
-    for (var i = 0; i < items.length; i++) {
-      var item = items[i];
-      items[i] = null; // items may be very very large. Allow GCing to occur in the loop by releasing refs here
-      dprint('frameworkLines', 'Processing item for llvm line ' + item.lineNum);
-      Framework.currItem = item;
-      var outputs = this.processItem(item);
-      Framework.currItem = null;
-      if (outputs) {
-        ret = ret.concat(outputs);
-      }
-    }
-    return ret;
-  }
-};
-

data/modules/emscripten/system/include/bsd/float.h

@@ -1,91 +0,0 @@
-/*	$OpenBSD: float.h,v 1.9 2011/08/29 13:13:21 kettenis Exp $	*/
-/*	$NetBSD: float.h,v 1.8 1995/06/20 20:45:37 jtc Exp $	*/
-
-/*
- * Copyright (c) 1989 Regents of the University of California.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. Neither the name of the University nor the names of its contributors
- *    may be used to endorse or promote products derived from this software
- *    without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- *
- *	@(#)float.h	7.1 (Berkeley) 5/8/90
- */
-
-#ifndef _MACHINE_FLOAT_H_
-#define _MACHINE_FLOAT_H_
-
-#include <sys/cdefs.h>
-
-__BEGIN_DECLS
-int __flt_rounds(void);
-__END_DECLS
-
-#define FLT_RADIX	2		/* b */
-/*
- * XXX Emscripten
- * See float.h documentation for these values
- * 1 seems best for JavaScript instead of:
- * #define FLT_ROUNDS	__flt_rounds()
- */
-#define FLT_ROUNDS	1
-#if __ISO_C_VISIBLE >= 1999
-#define FLT_EVAL_METHOD	2		/* long double */
-#endif
-
-#define FLT_MANT_DIG	24		/* p */
-#define FLT_EPSILON	1.19209290E-07F	/* b**(1-p) */
-#define FLT_DIG		6		/* floor((p-1)*log10(b))+(b == 10) */
-#define FLT_MIN_EXP	(-125)		/* emin */
-#define FLT_MIN		1.17549435E-38F	/* b**(emin-1) */
-#define FLT_MIN_10_EXP	(-37)		/* ceil(log10(b**(emin-1))) */
-#define FLT_MAX_EXP	128		/* emax */
-#define FLT_MAX		3.40282347E+38F	/* (1-b**(-p))*b**emax */
-#define FLT_MAX_10_EXP	38		/* floor(log10((1-b**(-p))*b**emax)) */
-
-#define DBL_MANT_DIG	53
-#define DBL_EPSILON	2.2204460492503131E-16
-#define DBL_DIG		15
-#define DBL_MIN_EXP	(-1021)
-#define DBL_MIN		2.2250738585072014E-308
-#define DBL_MIN_10_EXP	(-307)
-#define DBL_MAX_EXP	1024
-#define DBL_MAX		1.7976931348623157E+308
-#define DBL_MAX_10_EXP	308
-
-#define LDBL_MANT_DIG	DBL_MANT_DIG
-#define LDBL_EPSILON	DBL_EPSILON
-#define LDBL_DIG	DBL_DIG
-#define LDBL_MIN_EXP	DBL_MIN_EXP
-#define LDBL_MIN	DBL_MIN
-#define LDBL_MIN_10_EXP	DBL_MIN_10_EXP
-#define LDBL_MAX_EXP	DBL_MAX_EXP
-#define LDBL_MAX	DBL_MAX
-#define LDBL_MAX_10_EXP	DBL_MAX_10_EXP
-
-#if __ISO_C_VISIBLE >= 1999
-#define DECIMAL_DIG	21
-#endif
-
-#endif	/* _MACHINE_FLOAT_H_ */
-

data/modules/emscripten/system/include/bsd/readme.txt

@@ -1,2 +0,0 @@
-The contents of this directory are from FreeBSD or OpenBSD (see details in each file).
-

data/modules/emscripten/system/include/bsd/sys/mman.h

@@ -1,180 +0,0 @@
-/*-
- * Copyright (c) 1982, 1986, 1993
- *	The Regents of the University of California.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *	This product includes software developed by the University of
- *	California, Berkeley and its contributors.
- * 4. Neither the name of the University nor the names of its contributors
- *    may be used to endorse or promote products derived from this software
- *    without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- *
- *	@(#)mman.h	8.2 (Berkeley) 1/9/95
- * $FreeBSD: src/sys/sys/mman.h,v 1.29.2.1 2001/08/25 07:25:43 dillon Exp $
- */
-
-#ifndef _SYS_MMAN_H_
-#define _SYS_MMAN_H_
-
-#include <stddef.h> /* XXX Emscripten for size_t */
-#include <sys/types.h> /* XXX Emscripten for C++ compilation, not just C */
-
-/* XXX Emscripten #include <sys/_posix.h> */
-
-/*
- * Inheritance for minherit()
- */
-#define INHERIT_SHARE  0
-#define INHERIT_COPY   1
-#define INHERIT_NONE   2
-
-/*
- * Protections are chosen from these bits, or-ed together
- */
-#define	PROT_NONE	0x00	/* no permissions */
-#define	PROT_READ	0x01	/* pages can be read */
-#define	PROT_WRITE	0x02	/* pages can be written */
-#define	PROT_EXEC	0x04	/* pages can be executed */
-
-/*
- * Flags contain sharing type and options.
- * Sharing types; choose one.
- */
-#define	MAP_SHARED	0x0001		/* share changes */
-#define	MAP_PRIVATE	0x0002		/* changes are private */
-#define	MAP_COPY	MAP_PRIVATE	/* Obsolete */
-
-/*
- * Other flags
- */
-#define	MAP_FIXED	 0x0010	/* map addr must be exactly as requested */
-#define	MAP_RENAME	 0x0020	/* Sun: rename private pages to file */
-#define	MAP_NORESERVE	 0x0040	/* Sun: don't reserve needed swap area */
-#define	MAP_INHERIT	 0x0080	/* region is retained after exec */
-#define	MAP_NOEXTEND	 0x0100	/* for MAP_FILE, don't change file size */
-#define	MAP_HASSEMAPHORE 0x0200	/* region may contain semaphores */
-#define	MAP_STACK	 0x0400	/* region grows down, like a stack */
-#define	MAP_NOSYNC	 0x0800 /* page to but do not sync underlying file */
-
-/*
- * Extended flags
- */
-#define	MAP_NOCORE	 0x00020000 /* dont include these pages in a coredump */
-
-#ifdef _P1003_1B_VISIBLE
-/*
- * Process memory locking
- */
-#define MCL_CURRENT	0x0001	/* Lock only current memory */
-#define MCL_FUTURE	0x0002	/* Lock all future memory as well */
-
-#endif /* _P1003_1B_VISIBLE */
-
-/*
- * Error return from mmap()
- */
-#define MAP_FAILED	((void *)-1)
-
-/*
- * msync() flags
- */
-#define	MS_SYNC		0x0000	/* msync synchronously */
-#define MS_ASYNC	0x0001	/* return immediately */
-#define MS_INVALIDATE	0x0002	/* invalidate all cached data */
-
-
-/*
- * Mapping type
- */
-#define	MAP_FILE	0x0000	/* map from file (default) */
-#define	MAP_ANON	0x1000	/* allocated from memory, swap space */
-
-/*
- * Advice to madvise
- */
-#define	MADV_NORMAL	0	/* no further special treatment */
-#define	MADV_RANDOM	1	/* expect random page references */
-#define	MADV_SEQUENTIAL	2	/* expect sequential page references */
-#define	MADV_WILLNEED	3	/* will need these pages */
-#define	MADV_DONTNEED	4	/* dont need these pages */
-#define	MADV_FREE	5	/* dont need these pages, and junk contents */
-#define	MADV_NOSYNC	6	/* try to avoid flushes to physical media */
-#define	MADV_AUTOSYNC	7	/* revert to default flushing strategy */
-#define	MADV_NOCORE	8	/* do not include these pages in a core file */
-#define	MADV_CORE	9	/* revert to including pages in a core file */
-
-/*
- * Return bits from mincore
- */
-#define	MINCORE_INCORE	 	 0x1 /* Page is incore */
-#define	MINCORE_REFERENCED	 0x2 /* Page has been referenced by us */
-#define	MINCORE_MODIFIED	 0x4 /* Page has been modified by us */
-#define	MINCORE_REFERENCED_OTHER 0x8 /* Page has been referenced */
-#define	MINCORE_MODIFIED_OTHER	0x10 /* Page has been modified */
-
-#ifndef _KERNEL
-
-#include <sys/cdefs.h>
-
-__BEGIN_DECLS
-#ifdef _P1003_1B_VISIBLE
-int	mlockall __P((int));
-int	munlockall __P((void));
-int	shm_open __P((const char *, int, mode_t));
-int	shm_unlink __P((const char *));
-#endif /* _P1003_1B_VISIBLE */
-int	mlock __P((const void *, size_t));
-#ifndef _MMAP_DECLARED
-#define	_MMAP_DECLARED
-void *	mmap __P((void *, size_t, int, int, int, off_t));
-#endif
-int	mprotect __P((const void *, size_t, int));
-int	msync __P((void *, size_t, int));
-int	munlock __P((const void *, size_t));
-int	munmap __P((void *, size_t));
-#ifndef _POSIX_SOURCE
-int	madvise __P((void *, size_t, int));
-int	mincore __P((const void *, size_t, unsigned char *));
-int	minherit __P((void *, size_t, int));
-#endif
-
-/* XXX Emscripten */
-void *mremap(void *old_address, size_t old_size , size_t new_size, unsigned long flags);
-
-__END_DECLS
-
-#endif /* !_KERNEL */
-
-#endif
-
-
-
-
-
-
-
-
-
-
-

data/modules/emscripten/system/include/bsd/sys/utsname.h

@@ -1,70 +0,0 @@
-/*-
- * Copyright (c) 1994
- *	The Regents of the University of California.  All rights reserved.
- *
- * This code is derived from software contributed to Berkeley by
- * Chuck Karish of Mindcraft, Inc.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *	This product includes software developed by the University of
- *	California, Berkeley and its contributors.
- * 4. Neither the name of the University nor the names of its contributors
- *    may be used to endorse or promote products derived from this software
- *    without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- *
- *	@(#)utsname.h	8.1 (Berkeley) 1/4/94
- * $FreeBSD: src/sys/sys/utsname.h,v 1.7 1999/12/29 04:24:49 peter Exp $
- */
-
-#ifndef	_SYS_UTSNAME_H
-#define	_SYS_UTSNAME_H
-
-#define SYS_NMLN	32
-
-struct utsname {
-	char	sysname[SYS_NMLN];	/* Name of this OS. */
-	char	nodename[SYS_NMLN];	/* Name of this network node. */
-	char	release[SYS_NMLN];	/* Release level. */
-	char	version[SYS_NMLN];	/* Version level. */
-	char	machine[SYS_NMLN];	/* Hardware type. */
-};
-
-
-#include <sys/cdefs.h>
-
-
-#ifndef _KERNEL
-#ifdef __STDC__
-__BEGIN_DECLS
-int	uname __P((struct utsname *));
-__END_DECLS
-#else
-extern int uname();
-#endif
-#else
-extern struct utsname utsname;
-#endif	/* _KERNEL */
-
-#endif	/* !_SYS_UTSNAME_H */
-

data/modules/emscripten/system/include/dlfcn.h

@@ -1,31 +0,0 @@
-#ifndef _DLFCN_H_INCLUDED
-#define _DLFCN_H_INCLUDED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#define RTLD_DEFAULT 0
-#define RTLD_LAZY    1
-#define RTLD_NOW     2
-#define RTLD_GLOBAL  4
-#define RTLD_LOCAL   8
-
-typedef struct {
-  const char *dli_fname;
-  void       *dli_fbase;
-  const char *dli_sname;
-  void       *dli_saddr;
-} Dl_info;
-
-void  *dlopen(const char *, int);
-void  *dlsym(void *, const char *);
-int    dlclose(void *);
-char  *dlerror(void);
-int    dladdr(void *addr, Dl_info *info);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif