getopt.c

/* * Copyright (c) 1987, 1993, 1994 * 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. */ /* #if !defined(lint) * static char sccsid[] = "@(#)getopt.c 8.2 (Berkeley) 4/2/94"; * #endif */ #include <stdio.h> #include <stdlib.h> #include <string.h> /* declarations to provide consistent linkage */ extern char *optarg; extern int optind; extern int opterr; int opterr = 1, /* if error message should be printed */ optind = 1, /* index into parent argv vector */ optopt, /* character checked for validity */ optreset; /* reset getopt */ char *optarg; /* argument associated with option */ #define BADCH (int)'?' #define BADARG (int)':' #define EMSG "" /* * getopt -- * Parse argc/argv argument vector. */ int getopt(nargc, nargv, ostr) int nargc; char * const *nargv; const char *ostr; { static char *place = EMSG; /* option letter processing */ char *oli; /* option letter list index */ if (optreset || !*place) { /* update scanning pointer */ optreset = 0; if (optind >= nargc || *(place = nargv[optind]) != '-') { place = EMSG; return (EOF); } if (place[1] && *++place == '-') { /* found "--" */ ++optind; place = EMSG; return (EOF); } } /* option letter okay? */ if ((optopt = (int)*place++) == (int)':' || !(oli = strchr(ostr, optopt))) { /* * if the user didn't specify '-' as an option, * assume it means EOF. */ if (optopt == (int)'-') return (EOF); if (!*place) ++optind; if (opterr && *ostr != ':') (void)fprintf(stderr, "%s: illegal option -- %c\n", __FILE__, optopt); return (BADCH); } if (*++oli != ':') { /* don't need argument */ optarg = NULL; if (!*place) ++optind; } else { /* need an argument */ if (*place) /* no white space */ optarg = place; else if (nargc <= ++optind) { /* no arg */ place = EMSG; if (*ostr == ':') return (BADARG); if (opterr) (void)fprintf(stderr, "%s: option requires an argument -- %c\n", __FILE__, optopt); return (BADCH); } else /* white space */ optarg = nargv[optind]; place = EMSG; ++optind; } return (optopt); /* dump back option letter */ }

tkUnixInit.c

#ifdef WIN32 #include <windows.h> #endif #include <tcl.h> #include <tk.h> #include <string.h> int #if (TK_MAJOR_VERSION < 8) TkPlatformInit(Tcl_Interp *interp) #else TkpInit(Tcl_Interp *interp) #endif { Tcl_SetVar(interp, "tk_library", ".", TCL_GLOBAL_ONLY); #ifndef WIN32 { extern void TkCreateXEventSource(void); TkCreateXEventSource(); } #endif return (TCL_OK); } #if (TK_MAJOR_VERSION == 8) void TkpGetAppName(Tcl_Interp* interp, Tcl_DString* namePtr) { char *p, *name; #ifdef WIN32 int argc; char** argv; #endif name = Tcl_GetVar(interp, "argv0", TCL_GLOBAL_ONLY); #ifdef WIN32 if (name != NULL) { Tcl_SplitPath(name, &argc, &argv); if (argc > 0) { name = argv[argc-1]; p = strrchr(name, '.'); if (p != NULL) { *p = '\0'; } } else { name = NULL; } } #endif if ((name == NULL) || (*name == 0)) { name = "tk"; } #ifndef WIN32 else { p = strrchr(name, '/'); if (p != NULL) { name = p+1; } } #endif Tcl_DStringAppend(namePtr, name, -1); #ifdef WIN32 if (argv != NULL) { ckfree((char *)argv); } #endif } void TkpDisplayWarning(char* msg, char* title) { #ifdef WIN32 MessageBox(NULL, msg, title, MB_OK | MB_ICONEXCLAMATION | MB_SYSTEMMODAL | MB_SETFOREGROUND | MB_TOPMOST); #else Tcl_Channel errChannel = Tcl_GetStdChannel(TCL_STDERR); if (errChannel) { Tcl_Write(errChannel, title, -1); Tcl_Write(errChannel, ": ", 2); Tcl_Write(errChannel, msg, -1); Tcl_Write(errChannel, "\n", 1); } #endif } #endif

tkcompat.c

/* * Copyright (c) 1997 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 Computer Systems * Engineering Group at Lawrence Berkeley Laboratory. * 4. Neither the name of the University nor of the Laboratory 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. * * ------------------------------- * * Filename: tkcompat.c * * Description: * These are functions that are required for compiling with previous * versions of tcl or tk. * * @(#) $Header$ */ #ifndef TKCOMPAT_C #define TKCOMPAT_C #include "tk.h" #if TK_MAJOR_VERSION < 8 #include "tkcompat.h" /* *--------------------------------------------------------------------------- * * Tk_GetFontMetrics -- * * Returns overall ascent and descent metrics for the given font. * These values can be used to space multiple lines of text and * to align the baselines of text in different fonts. * */ void Tk_GetFontMetrics(Tk_Font pf, Tk_FontMetrics *fmPtr) { fmPtr->ascent = pf->ascent; fmPtr->descent = pf->descent; fmPtr->linespace = pf->ascent + pf->descent; } #endif /* (TK_MAJOR_VERSION < 8) */ #endif /* #ifdef TKCOMPAT_C */

win32.c

/* * Copyright (c) 1996 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 Network Research * Group at Lawrence Berkeley National Laboratory. * 4. Neither the name of the University nor of the Laboratory 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. * * This module contributed by John Brezak <brezak@apollo.hp.com>. * January 31, 1996 */ #ifndef lint static char rcsid[] = "@(#) $Header$ (LBL)"; #endif #include <assert.h> #include <io.h> #include <process.h> #include <fcntl.h> #include <windows.h> #include <malloc.h> #include <string.h> #include <stdio.h> #include <time.h> #include <winsock.h> #include <tk.h> #include <locale.h> /* forward declarations */ int WinGetUserName(ClientData, Tcl_Interp*, int ac, char**av); int WinGetHostName(ClientData, Tcl_Interp*, int ac, char**av); int WinPutRegistry(ClientData, Tcl_Interp*, int ac, char**av); int WinGetRegistry(ClientData, Tcl_Interp*, int ac, char**av); int WinExit(ClientData, Tcl_Interp*, int ac, char**av); void TkConsoleCreate(); int TkConsoleInit(Tcl_Interp* interp); #ifdef STATIC_TCLTK extern HINSTANCE Tk_GetHINSTANCE(); extern BOOL APIENTRY Tk_LibMain(HINSTANCE hInstance,DWORD reason,LPVOID reserved); extern BOOL APIENTRY Tcl_LibMain(HINSTANCE hInstance,DWORD reason,LPVOID reserved); void static_exit(void){ HINSTANCE hInstance = Tk_GetHINSTANCE(); Tcl_LibMain(hInstance, DLL_PROCESS_DETACH, NULL); Tk_LibMain(hInstance, DLL_PROCESS_DETACH, NULL); } #endif int strcasecmp(const char *s1, const char *s2) { return stricmp(s1, s2); } extern void TkWinXInit(HINSTANCE hInstance); extern int main(int argc, const char *argv[]); #ifndef STATIC_TCLTK extern int __argc; extern char **__argv; #endif static char argv0[255]; /* Buffer used to hold argv0. */ char *__progname = "nam"; void ShowMessage(int level, char *msg) { MessageBeep(level); MessageBox(NULL, msg, __progname, level | MB_OK | MB_TASKMODAL | MB_SETFOREGROUND); } int SetupConsole() { // stuff from knowledge base Q105305 (see that for details) // open a console and do the work around to get the console to work in all // cases int hCrt; FILE *hf=0; const COORD screenSz = {80, 2000}; /* size of console buffer */ AllocConsole(); hf=0; hCrt = _open_osfhandle( (long)GetStdHandle(STD_OUTPUT_HANDLE), _O_TEXT); if (hCrt!=-1) hf = _fdopen(hCrt, "w"); if (hf!=0) *stdout = *hf; if (hCrt==-1 || hf==0 || 0!=setvbuf(stdout, NULL, _IONBF, 0)) { ShowMessage(MB_ICONINFORMATION, "unable to reroute stdout"); return FALSE; } SetConsoleScreenBufferSize(GetStdHandle(STD_OUTPUT_HANDLE), screenSz); hf=0; hCrt = _open_osfhandle( (long)GetStdHandle(STD_ERROR_HANDLE), _O_TEXT); if (hCrt!=-1) hf = _fdopen(hCrt, "w"); if (hf!=0) *stderr = *hf; if (hCrt==-1 || hf==0 || 0!=setvbuf(stderr, NULL, _IONBF, 0)) { ShowMessage(MB_ICONINFORMATION, "reroute stderr failed in SetupConsole"); return FALSE; } hf=0; hCrt = _open_osfhandle((long)GetStdHandle(STD_INPUT_HANDLE), _O_TEXT); if (hCrt!=-1) hf = _fdopen(hCrt, "r"); if (hf!=0) *stdin = *hf; if (hCrt==-1 || hf==0 || 0!=setvbuf(stdin, NULL, _IONBF, 0)) { ShowMessage(MB_ICONINFORMATION, "reroute stdin failed in SetupConsole"); return FALSE; } return TRUE; } int APIENTRY WinMain( HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpszCmdLine, int nCmdShow) { char *p; WSADATA WSAdata; int retcode; #ifdef STATIC_TCLTK Tcl_LibMain(hInstance, DLL_PROCESS_ATTACH, NULL); Tk_LibMain(hInstance, DLL_PROCESS_ATTACH, NULL); atexit(static_exit); #endif setlocale(LC_ALL, "C"); /* XXX * initialize our socket interface plus the tcl 7.5 socket * interface (since they redefine some routines we call). * eventually we should just call the tcl sockets but at * the moment that's hard to set up since they only support * tcp in the notifier. */ if (WSAStartup(MAKEWORD (1, 1), &WSAdata)) { perror("Windows Sockets init failed"); abort(); } /* TclHasSockets(NULL); TkWinXInit(hInstance); */ /* * Increase the application queue size from default value of 8. * At the default value, cross application SendMessage of WM_KILLFOCUS * will fail because the handler will not be able to do a PostMessage! * This is only needed for Windows 3.x, since NT dynamically expands * the queue. */ SetMessageQueue(64); GetModuleFileName(NULL, argv0, 255); p = argv0; __progname = strrchr(p, '/'); if (__progname != NULL) { __progname++; } else { __progname = strrchr(p, '\\'); if (__progname != NULL) { __progname++; } else { __progname = p; } } if (__argc>1) { SetupConsole(); } retcode=main(__argc, (const char**)__argv); if (retcode!=0) { assert(FALSE); // don't die without letting user know why } return retcode; } static char szTemp[4096]; int outputErr(const char* szPrefix, Tcl_Interp* interp) { char *szError=Tcl_GetVar(interp, "errorInfo", TCL_GLOBAL_ONLY); int l = strlen(szPrefix) + strlen(interp->result) + 2 + strlen(szError) + 1; char* szMsg = szTemp; if (l>4096) szMsg = (char*)malloc(l*sizeof(char)); strcpy(szMsg, szPrefix); // strcat(szMsg, interp->result); strcat(szMsg, "\n"); strcat(szMsg, szError); OutputDebugString(szMsg); ShowMessage(MB_ICONERROR, szMsg); assert(FALSE); if (szMsg != szTemp) free(szMsg); return 0; } void win_perror(const char *msg) { DWORD cMsgLen; CHAR *msgBuf; DWORD dwError = GetLastError(); cMsgLen = FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_ALLOCATE_BUFFER | 40, NULL, dwError, MAKELANGID(0, SUBLANG_ENGLISH_US), (LPTSTR) &msgBuf, 512, NULL); if (!cMsgLen) fprintf(stderr, "%s%sError code %lu\n", msg?msg:"", msg?": ":"", dwError); else { fprintf(stderr, "%s%s%s\n", msg?msg:"", msg?": ":"", msgBuf); LocalFree((HLOCAL)msgBuf); } } #if 0 static char szTemp[4096]; int printf(const char *fmt, ...) { int retval; va_list ap; va_start (ap, fmt); retval = vsprintf(szTemp, fmt, ap); OutputDebugString(szTemp); ShowMessage(MB_ICONINFORMATION, szTemp); va_end (ap); return(retval); } int fprintf(FILE *f, const char *fmt, ...) { int retval; va_list ap; va_start (ap, fmt); if (f == stderr) { retval = vsprintf(szTemp, fmt, ap); OutputDebugString(szTemp); ShowMessage(MB_ICONERROR, szTemp); va_end (ap); } else retval = vfprintf(f, fmt, ap); return(retval); } void perror(const char *msg) { DWORD cMsgLen; CHAR *msgBuf; DWORD dwError = GetLastError(); cMsgLen = FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_ALLOCATE_BUFFER | 40, NULL, dwError, MAKELANGID(0, SUBLANG_ENGLISH_US), (LPTSTR) &msgBuf, 512, NULL); if (!cMsgLen) fprintf(stderr, "%s%sError code %lu\n", msg?msg:"", msg?": ":"", dwError); else { fprintf(stderr, "%s%s%s\n", msg?msg:"", msg?": ":"", msgBuf); LocalFree((HLOCAL)msgBuf); } } int WinPutsCmd(clientData, interp, argc, argv) ClientData clientData; /* ConsoleInfo pointer. */ Tcl_Interp *interp; /* Current interpreter. */ int argc; /* Number of arguments. */ char **argv; /* Argument strings. */ { int i, newline; char *fileId; i = 1; newline = 1; if ((argc >= 2) && (strcmp(argv[1], "-nonewline") == 0)) { newline = 0; i++; } if ((i < (argc-3)) || (i >= argc)) { Tcl_AppendResult(interp, "wrong # args: should be \"", argv[0], " ?-nonewline? ?fileId? string\"", (char *) NULL); return TCL_ERROR; } /* * The code below provides backwards compatibility with an old * form of the command that is no longer recommended or documented. */ if (i == (argc-3)) { if (strncmp(argv[i+2], "nonewline", strlen(argv[i+2])) != 0) { Tcl_AppendResult(interp, "bad argument \"", argv[i+2], "\": should be \"nonewline\"", (char *) NULL); return TCL_ERROR; } newline = 0; } if (i == (argc-1)) { fileId = "stdout"; } else { fileId = argv[i]; i++; } if (strcmp(fileId, "stdout") == 0 || strcmp(fileId, "stderr") == 0) { char *result; int level; if (newline) { int len = strlen(argv[i]); result = ckalloc(len+2); memcpy(result, argv[i], len); result[len] = '\n'; result[len+1] = 0; } else { result = argv[i]; } if (strcmp(fileId, "stdout") == 0) { level = MB_ICONINFORMATION; } else { level = MB_ICONERROR; } OutputDebugString(result); ShowMessage(level, result); if (newline) ckfree(result); return TCL_OK; } else { extern int Tcl_PutsCmd(ClientData clientData, Tcl_Interp *interp, int argc, char **argv); return (Tcl_PutsCmd(clientData, interp, argc, argv)); } } #endif int WinGetUserName(clientData, interp, argc, argv) ClientData clientData; Tcl_Interp *interp; /* Current interpreter. */ int argc; /* Number of arguments. */ char *argv[]; /* Argument strings. */ { char user[256]; int size = sizeof(user); if (!GetUserName(user, &size)) { Tcl_AppendResult(interp, "GetUserName failed", NULL); return TCL_ERROR; } Tcl_AppendResult(interp, user, NULL); return TCL_OK; } int WinGetHostName(clientData, interp, argc, argv) ClientData clientData; Tcl_Interp *interp; /* Current interpreter. */ int argc; /* Number of arguments. */ char *argv[]; /* Argument strings. */ { char hostname[MAXGETHOSTSTRUCT]; if (SOCKET_ERROR == gethostname(hostname, MAXGETHOSTSTRUCT)) { Tcl_AddErrorInfo(interp, "gethostname failed!"); } Tcl_AppendResult(interp, hostname, NULL); return TCL_OK; } static HKEY regroot(root) char *root; { if (strcasecmp(root, "HKEY_LOCAL_MACHINE") == 0) return HKEY_LOCAL_MACHINE; else if (strcasecmp(root, "HKEY_CURRENT_USER") == 0) return HKEY_CURRENT_USER; else if (strcasecmp(root, "HKEY_USERS") == 0) return HKEY_USERS; else if (strcasecmp(root, "HKEY_CLASSES_ROOT") == 0) return HKEY_CLASSES_ROOT; else return NULL; } int WinGetRegistry(clientData, interp, argc, argv) ClientData clientData; Tcl_Interp *interp; /* Current interpreter. */ int argc; /* Number of arguments. */ char **argv; /* Argument strings. */ { HKEY hKey, hRootKey; DWORD dwType; DWORD len, retCode; CHAR *regRoot, *regPath, *keyValue, *keyData; int retval = TCL_ERROR; if (argc != 3) { Tcl_AppendResult(interp, "wrong # args: should be \"", argv[0], "key value\"", (char *) NULL); return TCL_ERROR; } regRoot = argv[1]; keyValue = argv[2]; regPath = strchr(regRoot, '\\'); *regPath++ = '\0'; if ((hRootKey = regroot(regRoot)) == NULL) { Tcl_AppendResult(interp, "Unknown registry root \"", regRoot, "\"", NULL); return (TCL_ERROR); } retCode = RegOpenKeyEx(hRootKey, regPath, 0, KEY_READ, &hKey); if (retCode == ERROR_SUCCESS) { retCode = RegQueryValueEx(hKey, keyValue, NULL, &dwType, NULL, &len); if (retCode == ERROR_SUCCESS && dwType == REG_SZ && len) { keyData = (CHAR *) ckalloc(len); retCode = RegQueryValueEx(hKey, keyValue, NULL, NULL, keyData, &len); if (retCode == ERROR_SUCCESS) { Tcl_AppendResult(interp, keyData, NULL); free(keyData); retval = TCL_OK; } } RegCloseKey(hKey); } if (retval == TCL_ERROR) { Tcl_AppendResult(interp, "Cannot find registry entry \"", regRoot, "\\", regPath, "\\", keyValue, "\"", NULL); } return (retval); } int WinPutRegistry(clientData, interp, argc, argv) ClientData clientData; Tcl_Interp *interp; /* Current interpreter. */ int argc; /* Number of arguments. */ char **argv; /* Argument strings. */ { HKEY hKey, hRootKey; DWORD retCode; CHAR *regRoot, *regPath, *keyValue, *keyData; DWORD new; int result = TCL_OK; if (argc != 4) { Tcl_AppendResult(interp, "wrong # args: should be \"", argv[0], "key value data\"", (char *) NULL); return TCL_ERROR; } regRoot = argv[1]; keyValue = argv[2]; keyData = argv[3]; regPath = strchr(regRoot, '\\'); *regPath++ = '\0'; if ((hRootKey = regroot(regRoot)) == NULL) { Tcl_AppendResult(interp, "Unknown registry root \"", regRoot, "\"", NULL); return (TCL_ERROR); } retCode = RegCreateKeyEx(hRootKey, regPath, 0, "", REG_OPTION_NON_VOLATILE, KEY_ALL_ACCESS, NULL, &hKey, &new); if (retCode == ERROR_SUCCESS) { retCode = RegSetValueEx(hKey, keyValue, 0, REG_SZ, keyData, strlen(keyData)); if (retCode != ERROR_SUCCESS) { Tcl_AppendResult(interp, "unable to set key \"", regRoot, "\\", regPath, "\" with value \"", keyValue, "\"", (char *) NULL); result = TCL_ERROR; } RegCloseKey(hKey); } else { Tcl_AppendResult(interp, "unable to create key \"", regRoot, "\\", regPath, "\"", (char *) NULL); result = TCL_ERROR; } return (result); } /* does everything the normal exit command does, but shows a dialog box if * there is an error so that the console does not vaporize */ int WinExit(dummy, interp, argc, argv) ClientData dummy; /* Not used. */ Tcl_Interp *interp; /* Current interpreter. */ int argc; /* Number of arguments. */ char **argv; { int value; char buffer[100]; if ((argc != 1) && (argc != 2)) { Tcl_AppendResult(interp, "wrong # args: should be \"", argv[0], " ?returnCode?\"", (char *) NULL); return TCL_ERROR; } if (argc == 1) { value = 0; } else if (Tcl_GetInt(interp, argv[1], &value) != TCL_OK) { return TCL_ERROR; } /* all the error information should be in the console, so just * show the message and wait for user input */ if (value != 0) { ShowMessage(MB_ICONERROR, "Application exiting with error!"); } /* call the usual (renamed) tcl exit command */ sprintf(buffer, "tcl_exit %d", value); Tcl_Eval(interp, buffer); /*NOTREACHED*/ return TCL_OK; } static char initScript[]= "proc init {} {\n\ global tcl_library tcl_platform tcl_version tcl_patchLevel env errorInfo\n\ global tcl_pkgPath\n\ rename init {}\n\ set errors {}\n\ proc tcl_envTraceProc {lo n1 n2 op} {\n\ global env\n\ set x $env($n2)\n\ set env($lo) $x\n\ set env([string toupper $lo]) $x\n\ }\n\ foreach p [array names env] {\n\ set u [string toupper $p]\n\ if {$u != $p} {\n\ switch -- $u {\n\ COMSPEC -\n\ PATH {\n\ if {![info exists env($u)]} {\n\ set env($u) $env($p)\n\ }\n\ trace variable env($p) w [list tcl_envTraceProc $p]\n\ trace variable env($u) w [list tcl_envTraceProc $p]\n\ }\n\ }\n\ }\n\ }\n\ if {![info exists env(COMSPEC)]} {\n\ if {$tcl_platform(os) == {Windows NT}} {\n\ set env(COMSPEC) cmd.exe\n\ } else {\n\ set env(COMSPEC) command.com\n\ }\n\ } \n\ }\n\ init\n"; int platformInit(Tcl_Interp* interp) { /* tcl.CreateCommand("puts", WinPutsCmd, (ClientData)0); */ Tcl_CreateCommand(interp, "getusername", WinGetUserName, (ClientData)0, (Tcl_CmdDeleteProc*)0); Tcl_CreateCommand(interp, "gethostname", WinGetHostName, (ClientData)0, (Tcl_CmdDeleteProc*)0); Tcl_CreateCommand(interp, "putregistry", WinPutRegistry, (ClientData)0, (Tcl_CmdDeleteProc*)0); Tcl_CreateCommand(interp, "getregistry", WinGetRegistry, (ClientData)0, (Tcl_CmdDeleteProc*)0); Tcl_Eval(interp, initScript); if (TCL_OK==Tcl_Eval(interp, "rename exit tcl_exit")) { Tcl_CreateCommand(interp, "exit", WinExit, (ClientData)0, (Tcl_CmdDeleteProc*)0); } else { fprintf(stderr, "rename of exit proc failed!"); } #if 0 /* * Initialize the console only if we are running as an interactive * application. */ { char* interactive; if ((interactive=Tcl_GetVar(interp, "tcl_interactive", TCL_GLOBAL_ONLY)) && !strcmp(interactive, "1")) { /* * Create the console channels and install them as the standard * channels. All I/O will be discarded until TkConsoleInit is * called to attach the console to a text widget. */ TkConsoleCreate(); if (TkConsoleInit(interp) == TCL_ERROR) { fprintf(stderr, "error calling TkConsoleInit\n"); } } } #endif return TCL_OK; }

xwd.c

/* * Stolen from X11R6's xwd.c * $XConsortium: xwd.c /main/64 1996/01/14 16:53:13 kaleb $ * by John Heidemann, 15-Dec-97. */ /* Copyright (c) 1987 X Consortium Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Except as contained in this notice, the name of the X Consortium shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization from the X Consortium. */ /* * xwd.c MIT Project Athena, X Window system window raster image dumper. * * This program will dump a raster image of the contents of a window into a * file for output on graphics printers or for other uses. * * Author: Tony Della Fera, DEC * 17-Jun-85 * * Modification history: * * 11/14/86 Bill Wyatt, Smithsonian Astrophysical Observatory * - Removed Z format option, changing it to an XY option. Monochrome * windows will always dump in XY format. Color windows will dump * in Z format by default, but can be dumped in XY format with the * -xy option. * * 11/18/86 Bill Wyatt * - VERSION 6 is same as version 5 for monchrome. For colors, the * appropriate number of Color structs are dumped after the header, * which has the number of colors (=0 for monochrome) in place of the * V5 padding at the end. Up to 16-bit displays are supported. I * don't yet know how 24- to 32-bit displays will be handled under * the Version 11 protocol. * * 6/15/87 David Krikorian, MIT Project Athena * - VERSION 7 runs under the X Version 11 servers, while the previous * versions of xwd were are for X Version 10. This version is based * on xwd version 6, and should eventually have the same color * abilities. (Xwd V7 has yet to be tested on a color machine, so * all color-related code is commented out until color support * becomes practical.) */ /*% *% This is the format for commenting out color-related code until *% color can be supported. %*/ #include <stdio.h> #include <errno.h> #include <tk.h> #include <X11/Xos.h> #ifdef X_NOT_STDC_ENV extern int errno; #endif #include <X11/Xlib.h> #include <X11/Xutil.h> #include <X11/Xmu/WinUtil.h> typedef unsigned long Pixel; /* Use our own... */ #include "XWDFile.h" /* * work-around solaris 2.6 problem: * SIZEOF is defined in Xmd.h, which is included by XWDFile.h * make sure we get the right (ansi) definition). */ #if defined(sun) && defined(__svr4__) #undef SIZEOF #define SIZEOF(x) sz_##x #endif /* work-around solaris 2.6 problem */ #ifndef SIZEOF #define SIZEOF(x) sz_##x #endif /* * Window_Dump: dump a window to a file which must already be open for * writting. */ static void outl(char *s) { } /* * Determine the pixmap size. */ static int Image_Size(image) XImage *image; { if (image->format != ZPixmap) return(image->bytes_per_line * image->height * image->depth); return(image->bytes_per_line * image->height); } #define lowbit(x) ((x) & (~(x) + 1)) static int ReadColors(tk,cmap,colors) Colormap cmap ; XColor **colors ; { Visual *vis = Tk_Visual(tk); int i,ncolors ; ncolors = vis->map_entries; if (!(*colors = (XColor *) Tcl_Alloc (sizeof(XColor) * ncolors))) { outl("Out of memory!"); exit(1); } if (vis->class == DirectColor || vis->class == TrueColor) { Pixel red, green, blue, red1, green1, blue1; red = green = blue = 0; red1 = lowbit(vis->red_mask); green1 = lowbit(vis->green_mask); blue1 = lowbit(vis->blue_mask); for (i=0; i<ncolors; i++) { (*colors)[i].pixel = red|green|blue; (*colors)[i].pad = 0; red += red1; if (red > vis->red_mask) red = 0; green += green1; if (green > vis->green_mask) green = 0; blue += blue1; if (blue > vis->blue_mask) blue = 0; } } else { for (i=0; i<ncolors; i++) { (*colors)[i].pixel = i; (*colors)[i].pad = 0; } } XQueryColors(Tk_Display(tk), cmap, *colors, ncolors); return(ncolors); } /* * Get the XColors of all pixels in image - returns # of colors */ static int Get_XColors(tk, colors) Tk_Window tk; XColor **colors; { int ncolors; Colormap cmap = Tk_Colormap(tk); #if 0 if (use_installed) /* assume the visual will be OK ... */ cmap = XListInstalledColormaps(dpy, win_info->root, &i)[0]; #endif 0 if (!cmap) return(0); ncolors = ReadColors(tk,cmap,colors) ; return ncolors ; } static void _swapshort (bp, n) register char *bp; register unsigned n; { register char c; register char *ep = bp + n; while (bp < ep) { c = *bp; *bp = *(bp + 1); bp++; *bp++ = c; } } static void _swaplong (bp, n) register char *bp; register unsigned n; { register char c; register char *ep = bp + n; register char *sp; while (bp < ep) { sp = bp + 3; c = *sp; *sp = *bp; *bp++ = c; sp = bp + 1; c = *sp; *sp = *bp; *bp++ = c; bp += 2; } } void xwd_Window_Dump(tk, offscreen, width, height, out) Tk_Window tk; Drawable offscreen; unsigned width, height; FILE *out; { unsigned long swaptest = 1; XColor *colors; unsigned buffer_size; int header_size; int ncolors, i; char *win_name = "a"; int win_name_size = 1; /* strlen("a") */ XImage *image; int absx, absy, x, y; XWDFileHeader header; XWDColor xwdcolor; int format = ZPixmap; int debug = 0; Display *dpy = Tk_Display(tk); Visual *vis; absx = absy = 0; image = XGetImage (dpy, offscreen, 0, 0, width, height, AllPlanes, format); if (!image) { fprintf (stderr, "%s: unable to get image at %dx%d+%d+%d\n", "xwd", width, height, x, y); exit (1); } /* * Determine the pixmap size. */ buffer_size = Image_Size(image); if (debug) outl("xwd: Getting Colors.\n"); ncolors = Get_XColors(tk, &colors); vis = Tk_Visual(tk); /* * Calculate header size. */ if (debug) outl("xwd: Calculating header size.\n"); header_size = SIZEOF(XWDheader) + win_name_size; /* * Write out header information. */ if (debug) outl("xwd: Constructing and dumping file header.\n"); header.header_size = (CARD32) header_size; header.file_version = (CARD32) XWD_FILE_VERSION; header.pixmap_format = (CARD32) format; header.pixmap_depth = (CARD32) image->depth; header.pixmap_width = (CARD32) image->width; header.pixmap_height = (CARD32) image->height; header.xoffset = (CARD32) image->xoffset; header.byte_order = (CARD32) image->byte_order; header.bitmap_unit = (CARD32) image->bitmap_unit; header.bitmap_bit_order = (CARD32) image->bitmap_bit_order; header.bitmap_pad = (CARD32) image->bitmap_pad; header.bits_per_pixel = (CARD32) image->bits_per_pixel; header.bytes_per_line = (CARD32) image->bytes_per_line; /**** header.visual_class = (CARD32) win_info.visual->class; header.red_mask = (CARD32) win_info.visual->red_mask; header.green_mask = (CARD32) win_info.visual->green_mask; header.blue_mask = (CARD32) win_info.visual->blue_mask; header.bits_per_rgb = (CARD32) win_info.visual->bits_per_rgb; header.colormap_entries = (CARD32) win_info.visual->map_entries; *****/ header.visual_class = (CARD32) vis->class; header.red_mask = (CARD32) vis->red_mask; header.green_mask = (CARD32) vis->green_mask; header.blue_mask = (CARD32) vis->blue_mask; header.bits_per_rgb = (CARD32) vis->bits_per_rgb; header.colormap_entries = (CARD32) vis->map_entries; header.ncolors = ncolors; header.window_width = (CARD32) width; header.window_height = (CARD32) height; header.window_x = absx; header.window_y = absy; header.window_bdrwidth = (CARD32) 0; if (*(char *) &swaptest) { _swaplong((char *) &header, sizeof(header)); for (i = 0; i < ncolors; i++) { _swaplong((char *) &colors[i].pixel, sizeof(long)); _swapshort((char *) &colors[i].red, 3 * sizeof(short)); } } if (fwrite((char *)&header, SIZEOF(XWDheader), 1, out) != 1 || fwrite(win_name, win_name_size, 1, out) != 1) { perror("xwd"); exit(1); } /* * Write out the color maps, if any */ /* if (debug) outl("xwd: Dumping %d colors.\n", ncolors); */ for (i = 0; i < ncolors; i++) { xwdcolor.pixel = colors[i].pixel; xwdcolor.red = colors[i].red; xwdcolor.green = colors[i].green; xwdcolor.blue = colors[i].blue; xwdcolor.flags = colors[i].flags; if (fwrite((char *) &xwdcolor, SIZEOF(XWDColor), 1, out) != 1) { perror("xwd"); exit(1); } } /* * Write out the buffer. */ /* if (debug) outl("xwd: Dumping pixmap. bufsize=%d\n",buffer_size); */ /* * This copying of the bit stream (data) to a file is to be replaced * by an Xlib call which hasn't been written yet. It is not clear * what other functions of xwd will be taken over by this (as yet) * non-existant X function. */ if (fwrite(image->data, (int) buffer_size, 1, out) != 1) { perror("xwd"); exit(1); } /* * free the color buffer. */ if(debug && ncolors > 0) outl("xwd: Freeing colors.\n"); if(ncolors > 0) Tcl_Free((char*)colors); /* * Free image */ XDestroyImage(image); } int xwd_Window_Dump_To_File( Tk_Window tk, Drawable offscreen, unsigned width, unsigned height, char *name) { FILE *f; if (!(f = fopen(name, "w"))) { fprintf(stderr, "cannot open %s", name); return TCL_ERROR; }; xwd_Window_Dump(tk, offscreen, width, height, f); fclose(f); return TCL_OK; }

address.cc

/* * Copyright (c) 1990-1997 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 Computer Systems * Engineering Group at Lawrence Berkeley Laboratory. * 4. Neither the name of the University nor of the Laboratory 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. * * $Header$ */ #include <stdio.h> #include <stdlib.h> #include "tclcl.h" #include "address.h" #include "config.h" static class AddressClass : public TclClass { public: AddressClass() : TclClass("Address") {} TclObject* create(int, const char*const*) { return (new Address()); } } class_address; Address* Address::instance_; Address::Address() : PortShift_(0), PortMask_(0), McastShift_(0), McastMask_(0), levels_(0) { for (int i = 0; i < 10; i++) { NodeShift_[i] = 0; NodeMask_[i] = 0; } // setting instance_ should be in constructor, instead of Address:: if ((instance_ == 0) || (instance_ != this)) instance_ = this; } Address::~Address() { } int Address::command(int argc, const char*const* argv) { int i, c, temp=0; Tcl& tcl = Tcl::instance(); // if ((instance_ == 0) || (instance_ != this)) // instance_ = this; if (argc == 4) { if (strcmp(argv[1], "portbits-are") == 0) { PortShift_ = atoi(argv[2]); PortMask_ = atoi(argv[3]); return (TCL_OK); } if (strcmp(argv[1], "mcastbits-are") == 0) { McastShift_ = atoi(argv[2]); McastMask_ = atoi(argv[3]); return (TCL_OK); } } if (argc >= 4) { if (strcmp(argv[1], "add-hier") == 0) { /* * <address> add-hier <level> <mask> <shift> */ int level = atoi(argv[2]); int mask = atoi(argv[3]); int shift = atoi(argv[4]); if (levels_ < level) levels_ = level; NodeShift_[level] = shift; NodeMask_[level] = mask; return (TCL_OK); } if (strcmp(argv[1], "idsbits-are") == 0) { temp = (argc - 2)/2; if (levels_) { if (temp != levels_) { tcl.resultf("#idshiftbits don't match with #hier levels\n"); return (TCL_ERROR); } } else levels_ = temp; // NodeShift_ = new int[levels_]; for (i = 3, c = 1; c <= levels_; c++, i+=2) NodeShift_[c] = atoi(argv[i]); return (TCL_OK); } if (strcmp(argv[1], "idmbits-are") == 0) { temp = (argc - 2)/2; if (levels_) { if (temp != levels_) { tcl.resultf("#idmaskbits don't match with #hier levels\n"); return (TCL_ERROR); } } else levels_ = temp; // NodeMask_ = new int[levels_]; for (i = 3, c = 1; c <= levels_; c++, i+=2) NodeMask_[c] = atoi(argv[i]); return (TCL_OK); } } return TclObject::command(argc, argv); } char *Address::print_nodeaddr(int address) { int a; char temp[SMALL_LEN]; char str[SMALL_LEN]; char *addrstr; str[0] = '\0'; for (int i=1; i <= levels_; i++) { a = address >> NodeShift_[i]; if (levels_ > 1) a = a & NodeMask_[i]; sprintf(temp, "%d.", a); strcat(str, temp); } addrstr = new char[strlen(str)]; strcpy(addrstr, str); // printf("Nodeaddr - %s\n",addrstr); return(addrstr); } char *Address::print_portaddr(int address) { int a; char str[SMALL_LEN]; char *addrstr; str[0] = '\0'; a = address >> PortShift_; a = a & PortMask_; sprintf(str, "%d", a); addrstr = new char[strlen(str)]; strcpy(addrstr, str); // printf("Portaddr - %s\n",addrstr); return(addrstr); } // Convert address in string format to binary format (int). int Address::str2addr(char *str) { if (levels_ == 0) return atoi(str); char *delim = "."; char *tok; int addr; for (int i = 1; i <= levels_; i++) { if (i == 1) { tok = strtok(str, delim); addr = atoi(tok); } else { tok = strtok(NULL, delim); addr = set_word_field(addr, atoi(tok), NodeShift_[i], NodeMask_[i]); } } return addr; }

agent.cc

anetmodel.cc

animation.cc

animator.cc

// $Header$ #include "animator.h" class NetworkAnimatorClass : TclClass { public: NetworkAnimatorClass() : TclClass("Animator") {} TclObject* create(int, const char*const*) { return (new NetworkAnimator()); } } networkanimator_class; // We put it here in C++ because we need to keep a pointer to it // in NetModel, etc. int NetworkAnimator::command(int argc, const char *const* argv) { // In case we want to put something here. return TclObject::command(argc, argv); }

drop.cc

edge.cc

editview.cc

enetmodel.cc

feature.cc

graphview.cc

group.cc

lan.cc

main.cc

monitor.cc

class Node; #include "config.h" #include "stdio.h" #include "monitor.h" #include "animation.h" #include "netview.h" #include "paint.h" Monitor::Monitor(int mon_num, Animation *a, double size) : mon_num_(mon_num), anim_(a), size_(size) { paint_=Paint::instance()->thin(); mon_state_=a->monitor_state(); sprintf(label_, "%d", mon_num); } Monitor::~Monitor() { if (mon_state_!=NULL) delete(mon_state_); } void Monitor::update(double now, char *result, int len) { if (anim_!=NULL) anim_->monitor(this, now, result, len); else sprintf(result, "Not visible"); } void Monitor::size(double size) { size_=size; } /*XXX there must be a cleaner way to do this*/ /*we need coordinates from the animation itself, and information about the size of the whole model from the netmodel. Thus we have two draw methods, one from the animation that sets up data and one from the netmodel that actually does the drawing*/ void Monitor::draw(View */*nv*/, float x, float y) { x_=x; y_=y; } void Monitor::draw_monitor(View *nv, float ymin, float /*ymax*/) const { if (anim_==NULL) return; float delta = 0.5 * size_; nv->line(x_,y_,x_,ymin-delta,paint_); nv->rect(x_-delta, ymin-delta, x_+delta, ymin-(size_+delta), paint_); nv->string(x_, ymin-size_, size_, label_, ANCHOR_CENTER); } void Monitor::delete_monitor_object(Animation *m) { /*need to check this because we can sometimes hand a monitor over to a new animation just before the old animation calls this*/ if (anim_==m) anim_=NULL; }

nam_stream.cc

netgraph.cc

/* * Copyright (c) 1997 University of Southern 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 Information Sciences * Institute of the University of Southern California. * 4. Neither the name of the University nor of the Institute 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. * * @(#) $Header$ (LBL) */ #include <stdlib.h> #include <ctype.h> #include <math.h> #include "config.h" #include "graphview.h" #include "netgraph.h" #include "paint.h" #include "sincos.h" #include "state.h" #include "bbox.h" #include <float.h> extern int lineno; //static int next_pat; /*XXX */ class NetworkGraphClass : public TclClass { public: NetworkGraphClass() : TclClass("NetworkGraph") {} TclObject* create(int /*argc*/, const char*const* /*argv*/) { return (new NetGraph); } } networkgraph_class; class EnergyNetworkGraphClass : public TclClass { public: EnergyNetworkGraphClass() : TclClass("EnergyNetworkGraph") {} TclObject* create(int /*argc*/, const char*const* /*argv*/) { return (new EnergyNetGraph); } } energynetworkgraph_class; class LinkNetworkGraphClass : public TclClass { public: LinkNetworkGraphClass() : TclClass("LinkNetworkGraph") {} TclObject* create(int /*argc*/, const char*const* /*argv*/) { return (new LinkNetGraph); } } linknetworkgraph_class; class FeatureNetworkGraphClass : public TclClass { public: FeatureNetworkGraphClass() : TclClass("FeatureNetworkGraph") {} TclObject* create(int /*argc*/, const char*const* /*argv*/) { return (new FeatureNetGraph); } } featurenetworkgraph_class; NetGraph::NetGraph() : views_(NULL), minx_(0), maxx_(0), miny_(0.0), maxy_(0.0), time_(0.0), tix_(-1) { int i; for (i = 0; i < MAX_GRAPH; i++) graphdata_[i]=0.0; Paint *paint = Paint::instance(); int p = paint->thin(); ncolors_ = 8; paint_ = new int[ncolors_]; for (i = 0; i < ncolors_; ++i) paint_[i] = p; paint_[1]=paint->lookup("red",1); } EnergyNetGraph::EnergyNetGraph() : NetGraph() { } LinkNetGraph::LinkNetGraph() : NetGraph(), src_(-1), dst_(-1) { } NetGraph::~NetGraph() { } EnergyNetGraph::~EnergyNetGraph() { } LinkNetGraph::~LinkNetGraph() { } void NetGraph::update(double /*now*/) { } void NetGraph::update(double /*now*/, Animation* /*a*/) { } /* Reset all animations and queues to time 'now'. */ void NetGraph::reset(double /*now*/) { } void NetGraph::render(GraphView* view) { int i; if (miny_!=maxy_) { for(i=0;i<maxx_-minx_;i++) { if (scaleddata_[i]!=0) view->line(i, 0, i, scaleddata_[i], paint_[0]); } //draw the current time line view->line(tix_, 0, tix_, maxy_, paint_[1]); } else { view->string((double)minx_, 0.5, 0.5, "No such events found in tracefile.", ANCHOR_WEST); } } void NetGraph::BoundingBox(BBox& bb) { int i; minx_=int(bb.xmin); maxx_=int(bb.xmax); int newtix=int(time_*(maxx_-minx_)/(maxtime_-mintime_)); if (newtix!=tix_) { tix_=newtix; } for(i=0;i<maxx_-minx_;i++) { scaleddata_[i]=0.0; } maxy_=0.0; /*Note: storing the data in an array like this is quick, but introduces some aliasing effects in the scaling process. I think they're negligable for this purpose but if we really want to remove them we must store the unscaled data in a list instead*/ for(i=0;i<MAX_GRAPH;i++) { int ix = int(((float)(i*(maxx_-minx_)))/MAX_GRAPH); scaleddata_[ix]+=graphdata_[i]; if (scaleddata_[ix]>maxy_) maxy_=scaleddata_[ix]; } if (miny_!=maxy_) { bb.ymin=miny_; bb.ymax=maxy_; } else { bb.ymin=0.0; bb.ymax=1.0; } } /* Trace event handler. */ void NetGraph::handle(const TraceEvent& e, double /*now*/, int /*direction*/) { switch (e.tt) { case 'v': /* 'variable' -- just execute it as a tcl command */ break; case 'h': printf("hop\n"); break; case 'a': printf("agent\n"); break; case 'f': printf("feature\n"); break; case 'r': printf("receive\n"); break; case '+': printf("enqueue\n"); break; case '-': printf("dequeue\n"); break; case 'l': printf("link\n"); break; case 'n': printf("node\n"); break; case 'R': printf("Route\n"); break; case 'd': printf("drop\n"); break; } } /* Trace event handler. */ void EnergyNetGraph::handle(const TraceEvent& e, double /*now*/, int /*direction*/) { switch (e.tt) { case 'g': int timeix = int(((e.time-mintime_)*MAX_GRAPH)/(maxtime_-mintime_)); for (int i=timeix; i< MAX_GRAPH ; i++) graphdata_[i]+=1; if (graphdata_[timeix]>maxy_) maxy_=graphdata_[timeix]; break; } } /* Trace event handler. */ void LinkNetGraph::handle(const TraceEvent& e, double /*now*/, int /*direction*/) { switch (e.tt) { case 'h': if (gtype_==GR_BW) { if ((e.pe.src==src_) && (e.pe.dst==dst_)) { int timeix = int(((e.time-mintime_)*MAX_GRAPH)/(maxtime_-mintime_)); graphdata_[timeix]+=e.pe.pkt.size; if (graphdata_[timeix]>maxy_) maxy_=graphdata_[timeix]; } } break; case 'd': fflush(stdout); if (gtype_==GR_LOSS) { if ((e.pe.src==src_) && (e.pe.dst==dst_)) { fflush(stdout); int timeix = int(((e.time-mintime_)*MAX_GRAPH)/(maxtime_-mintime_)); graphdata_[timeix]+=1; if (graphdata_[timeix]>maxy_) maxy_=graphdata_[timeix]; } } break; } } int NetGraph::command(int argc, const char *const *argv) { Tcl& tcl = Tcl::instance(); if (argc == 3) { if (strcmp(argv[1], "view") == 0) { /* * <net> view <viewName> * Create the window for the network layout/topology. */ GraphView *v = new GraphView(argv[2], this); v->next_ = views_; views_ = v; return (TCL_OK); } if (strcmp(argv[1], "settime") == 0) { if (argc == 3) { time_=atof(argv[2]); GraphView *view = views_; int newtix=int(time_*(maxx_-minx_)/(maxtime_-mintime_)); if (newtix!=tix_) { while(view!=NULL) { view->draw(); view=view->next_; } tix_=newtix; } return (TCL_OK); } else { tcl.resultf("\"%s\": arg mismatch", argv[0]); return (TCL_ERROR); } } } if (argc == 4 && strcmp(argv[1], "timerange") == 0) { mintime_=atof(argv[2]); maxtime_=atof(argv[3]); return (TCL_OK); } /* If no NetModel commands matched, try the Object commands. */ return (TclObject::command(argc, argv)); } int EnergyNetGraph::command(int argc, const char *const *argv) { return (NetGraph::command(argc, argv)); } int LinkNetGraph::command(int argc, const char *const *argv) { //Tcl& tcl = Tcl::instance(); if (argc == 4) { // printf("command: %s %s %s\n", argv[1],argv[2],argv[3]); if (strcmp(argv[1], "bw") == 0) { src_=atoi(argv[2]); dst_=atoi(argv[3]); gtype_=GR_BW; return (TCL_OK); } if (strcmp(argv[1], "loss") == 0) { src_=atoi(argv[2]); dst_=atoi(argv[3]); gtype_=GR_LOSS; return (TCL_OK); } } /* If no NetModel commands matched, try the Object commands. */ return (NetGraph::command(argc, argv)); } /************/ FeatureNetGraph::FeatureNetGraph() : NetGraph(), src_(-1), aname_(0), vname_(0), lastix_(0) { } FeatureNetGraph::~FeatureNetGraph() { } int FeatureNetGraph::command(int argc, const char *const *argv) { if (argc == 5) { if (strcmp(argv[1], "feature") == 0) { src_ = atoi(argv[2]); aname_ = new char[strlen(argv[3]) + 1]; strcpy(aname_, argv[3]); vname_ = new char[strlen(argv[4]) + 1]; strcpy(vname_, argv[4]); return(TCL_OK); } } return (NetGraph::command(argc, argv)); } void FeatureNetGraph::handle(const TraceEvent& e, double /*now*/, int /*direction*/) { switch (e.tt) { case 'f': // print the source, the agent, name, value // print records we care about if (src_ == e.fe.src && (strcmp(aname_, e.fe.feature.agent) == 0) && (strcmp(vname_, e.fe.feature.name) == 0)) { /* printf("Feature %d %s %s %s\n", e.fe.src, e.fe.feature.agent, e.fe.feature.name, e.fe.feature.value); */ /* start out doing what is done in LinkNetGraph::handle */ int timeix = int(((e.time-mintime_)*MAX_GRAPH)/(maxtime_-mintime_)); graphdata_[timeix]+=atof(e.fe.feature.value); // printf("%d %g\n", timeix, graphdata_[timeix]); if (graphdata_[timeix]>maxy_) maxy_=graphdata_[timeix]; /* fill in any points we may have missed */ int i; double lastval = graphdata_[lastix_]; for (i = lastix_ + 1; i < timeix; i++) { graphdata_[i] = lastval; } lastix_ = timeix; } break; default: break; } } /* following is a hack to get around the aliasing effects referred to * in the comments in NetGraph::BoundingBox. It works for those data * sets I've tested it with, but it could produce undesired results * in some cases. */ void FeatureNetGraph::BoundingBox(BBox& bb) { int i; minx_=int(bb.xmin); maxx_=int(bb.xmax); int newtix=int(time_*(maxx_-minx_)/(maxtime_-mintime_)); if (newtix!=tix_) { tix_=newtix; } for(i=0;i<maxx_-minx_;i++) { scaleddata_[i]=0.0; } maxy_=1.0; /*Note: storing the data in an array like this is quick, but introduces some aliasing effects in the scaling process. I think they're negligable for this purpose but if we really want to remove them we must store the unscaled data in a list instead*/ for(i=0;i<MAX_GRAPH;i++) { int ix = int(((float)(i*(maxx_-minx_)))/MAX_GRAPH); scaleddata_[ix]=graphdata_[i]; if (scaleddata_[ix]>maxy_) maxy_=scaleddata_[ix]; } if (miny_!=maxy_) { bb.ymin=miny_; bb.ymax=maxy_; } else { bb.ymin=0.0; bb.ymax=1.0; } }

netmodel.cc

netview.cc

node.cc

packet.cc

paint.cc

/* * Copyright (c) 1993 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 Computer Systems * Engineering Group at Lawrence Berkeley Laboratory. * 4. Neither the name of the University nor of the Laboratory 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. * * @(#) $Header$ (LBL) */ #ifdef WIN32 #include <windows.h> #endif #include "config.h" #include "paint.h" #include "tclcl.h" Paint* Paint::instance_; Paint::Paint() { Tcl& tcl = Tcl::instance(); Tk_Window tk = tcl.tkmain(); Tk_Uid bg = Tk_GetOption(tk, "viewBackground", NULL); XColor* p = Tk_GetColor(tcl.interp(), tk, bg); if (p == 0) abort(); background_ = p->pixel; XGCValues v; v.background = background_; v.foreground = background_; const unsigned long mask = GCForeground|GCBackground; gctab_ = new GC[PaintStaticGCSize]; rgb_ = new rgb[PaintStaticGCSize]; gcSize_ = PaintStaticGCSize; gctab_[0] = Tk_GetGC(tk, mask, &v); rgb_[0].colorname = strdup("black"); rgb_[0].red=p->red; rgb_[0].green=p->green; rgb_[0].blue=p->blue; ngc_ = 1; thick_ = lookup("black", 3); thin_ = lookup("black", 1); xor_ = lookupXor("black", 1); } void Paint::init() { instance_ = new Paint; } GC Paint::text_gc(Font fid, const char* color) { Tcl& tcl = Tcl::instance(); Tk_Window tk = tcl.tkmain(); XColor *p; if (color == NULL) p = Tk_GetColor(tcl.interp(), tk, "black"); else { Tk_Uid colorname; if (strcmp(color, "background") == 0) colorname = Tk_GetOption(tk, "viewBackground", NULL); else colorname = Tk_GetUid(color); p = Tk_GetColor(tcl.interp(), tk, colorname); } if (p == 0) return (0); XGCValues v; v.background = background_; v.foreground = p->pixel; v.line_width = 1; v.font = fid; const unsigned long mask = GCFont|GCForeground|GCBackground|GCLineWidth; return (Tk_GetGC(tk, mask, &v)); } char* Paint::lookupName(int r, int g, int b) { XColor color; Tcl& tcl = Tcl::instance(); Tk_Window tk = tcl.tkmain(); color.red = r; color.green = g; color.blue = b; XColor *p = Tk_GetColorByValue(tk,&color); return (Tk_NameOfColor(p)); } int Paint::lookup(const char * color, int linewidth) { Tcl& tcl = Tcl::instance(); Tk_Window tk = tcl.tkmain(); Tk_Uid colorname; if (strcmp(color, "background") == 0) colorname = Tk_GetOption(tk, "viewBackground", NULL); else colorname = Tk_GetUid(color); XColor* p = Tk_GetColor(tcl.interp(), tk, colorname); if (p == 0) { fprintf(stderr, "Nam: cannot find color %s, use default.\n", color); return (0); } XGCValues v; v.background = background_; v.foreground = p->pixel; v.line_width = linewidth; const unsigned long mask = GCForeground|GCBackground|GCLineWidth; GC gc = Tk_GetGC(tk, mask, &v); int i; for (i = 0; i < ngc_; ++i) if (gctab_[i] == gc) return (i); gctab_[i] = gc; rgb_[i].colorname = strdup(color); rgb_[i].red=p->red; rgb_[i].green=p->green; rgb_[i].blue=p->blue; ngc_ = i + 1; if (ngc_ >= gcSize_) // PaintStaticGCSize) adjust(); return (i); } int Paint::lookupXor(const char * color, int linewidth) { Tcl& tcl = Tcl::instance(); Tk_Window tk = tcl.tkmain(); Tk_Uid colorname; if (strcmp(color, "background") == 0) colorname = Tk_GetOption(tk, "background", NULL); else colorname = Tk_GetUid(color); XColor* p = Tk_GetColor(tcl.interp(), tk, colorname); if (p == 0) { fprintf(stderr, "Nam: cannot find color %s, use default.\n", color); return (0); } XGCValues v; v.background = background_; v.foreground = p->pixel ^ background_; v.line_width = linewidth; v.function = GXxor; const unsigned long mask = GCForeground|GCBackground|GCLineWidth|GCFunction; GC gc = Tk_GetGC(tk, mask, &v); int i; for (i = 0; i < ngc_; ++i) if (gctab_[i] == gc) return (i); gctab_[i] = gc; rgb_[i].colorname = strdup(color); rgb_[i].red=p->red; rgb_[i].green=p->green; rgb_[i].blue=p->blue; ngc_ = i + 1; if (ngc_ >= gcSize_) // PaintStaticGCSize) adjust(); return (i); } void Paint::adjust() { GC *tg = new GC[ngc_ + PaintGCIncrement]; rgb *tr = new rgb[ngc_ + PaintGCIncrement]; gcSize_ = ngc_ + PaintGCIncrement; memcpy((char *)tg, (char *)gctab_, sizeof(GC)*ngc_); memcpy((char *)tr, (char *)rgb_, sizeof(rgb)*ngc_); delete gctab_; delete rgb_; gctab_ = tg; rgb_ = tr; }

psview.cc

queue.cc

random.cc

/* -*- Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */ /* * Copyright (c) 1995 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 Computer Systems * Engineering Group at Lawrence Berkeley Laboratory. * 4. Neither the name of the University nor of the Laboratory 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. * * "@(#) $Header$ (LBL)"; */ #ifndef WIN32 #include <sys/time.h> #include "config.h" #include "random.h" RANDOM_RETURN_TYPE random() { printf("random() called in ns.\nRandom is not portable, please use Random::uniform() instead.\n"); abort(); } #endif WIN32

rng.cc

/* -*- Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */ /* * Copyright (c) 1997 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 Computer Systems * Engineering Group at Lawrence Berkeley Laboratory. * 4. Neither the name of the University nor of the Laboratory 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. */ #ifndef lint static const char rcsid[] = "@(#) $Header$ (LBL)"; #endif /* new random number generator */ #ifndef WIN32 #include <sys/time.h> // for gettimeofday #include <unistd.h> #endif #include <stdio.h> #include "rng.h" #ifndef MAXINT #define MAXINT 2147483648 // XX [for now] #endif #if defined(sun) extern "C" { // XXX Why not include config.h? int atoi(...); // int gettimeofday(struct timeval*, struct timezone*); int gettimeofday(...); //fix to work on solaris as well } #endif /* * RNGImplementation */ /* * Generate a periodic sequence of pseudo-random numbers with * a period of 2^31 - 2. The generator is the "minimal standard" * multiplicative linear congruential generator of Park, S.K. and * Miller, K.W., "Random Number Generators: Good Ones are Hard to Find," * CACM 31:10, Oct. 88, pp. 1192-1201. * * The algorithm implemented is: Sn = (a*s) mod m. * The modulus m can be approximately factored as: m = a*q + r, * where q = m div a and r = m mod a. * * Then Sn = g(s) + m*d(s) * where g(s) = a(s mod q) - r(s div q) * and d(s) = (s div q) - ((a*s) div m) * * Observations: * - d(s) is either 0 or 1. * - both terms of g(s) are in 0, 1, 2, . . ., m - 1. * - |g(s)| <= m - 1. * - if g(s) > 0, d(s) = 0, else d(s) = 1. * - s mod q = s - k*q, where k = s div q. * * Thus Sn = a(s - k*q) - r*k, * if (Sn <= 0), then Sn += m. * * To test an implementation for A = 16807, M = 2^31-1, you should * get the following sequences for the given starting seeds: * * s0, s1, s2, s3, . . . , s10000, . . . , s551246 * 1, 16807, 282475249, 1622650073, . . . , 1043618065, . . . , 1003 * 1973272912, 1207871363, 531082850, 967423018 * * It is important to check for s10000 and s551246 with s0=1, to guard * against overflow. */ /* * The sparc assembly code [no longer here] is based on Carta, D.G., "Two Fast * Implementations of the 'Minimal Standard' Random Number * Generator," CACM 33:1, Jan. 90, pp. 87-88. * * ASSUME that "the product of two [signed 32-bit] integers (a, sn) * will occupy two [32-bit] registers (p, q)." * Thus: a*s = (2^31)p + q * * From the observation that: x = y mod z is but * x = z * the fraction part of (y/z), * Let: sn = m * Frac(as/m) * * For m = 2^31 - 1, * sn = (2^31 - 1) * Frac[as/(2^31 -1)] * = (2^31 - 1) * Frac[as(2^-31 + 2^-2(31) + 2^-3(31) + . . .)] * = (2^31 - 1) * Frac{[(2^31)p + q] [2^-31 + 2^-2(31) + 2^-3(31) + . . .]} * = (2^31 - 1) * Frac[p+(p+q)2^-31+(p+q)2^-2(31)+(p+q)3^(-31)+ . . .] * * if p+q < 2^31: * sn = (2^31 - 1) * Frac[p + a fraction + a fraction + a fraction + . . .] * = (2^31 - 1) * [(p+q)2^-31 + (p+q)2^-2(31) + (p+q)3^(-31) + . . .] * = p + q * * otherwise: * sn = (2^31 - 1) * Frac[p + 1.frac . . .] * = (2^31 - 1) * (-1 + 1.frac . . .) * = (2^31 - 1) * [-1 + (p+q)2^-31 + (p+q)2^-2(31) + (p+q)3^(-31) + . . .] * = p + q - 2^31 + 1 */ #define A 16807L /* multiplier, 7**5 */ #define M 2147483647L /* modulus, 2**31 - 1; both used in random */ #define INVERSE_M ((double)4.656612875e-10) /* (1.0/(double)M) */ long RNGImplementation::next() { long L, H; L = A * (seed_ & 0xffff); H = A * (seed_ >> 16); seed_ = ((H & 0x7fff) << 16) + L; seed_ -= 0x7fffffff; seed_ += H >> 15; if (seed_ <= 0) { seed_ += 0x7fffffff; } return(seed_); } double RNGImplementation::next_double() { long i = next(); return i * INVERSE_M; } /* * RNG implements a nice front-end around RNGImplementation */ static class RNGClass : public TclClass { public: RNGClass() : TclClass("RNG") {} TclObject* create(int, const char*const*) { return(new RNG()); } } class_rng; /* default RNG */ RNG* RNG::default_ = NULL; int RNG::command(int argc, const char*const* argv) { Tcl& tcl = Tcl::instance(); if (argc == 3) { if (strcmp(argv[1], "testint") == 0) { int n = atoi(argv[2]); tcl.resultf("%d", uniform(n)); return (TCL_OK); } if (strcmp(argv[1], "testdouble") == 0) { double d = atof(argv[2]); tcl.resultf("%6e", uniform(d)); return (TCL_OK); } if (strcmp(argv[1], "seed") == 0) { int s = atoi(argv[2]); // NEEDSWORK: should be a way to set seed to PRDEF_SEED_SORUCE if (s) { if (s <= 0 || (unsigned int)s >= MAXINT) { // MAXINT on freebsd is a ``black hole'' (it says at MAXINT). tcl.resultf("Setting random number seed to known bad value."); return TCL_ERROR; }; set_seed(RAW_SEED_SOURCE, s); } else set_seed(HEURISTIC_SEED_SOURCE, 0); return(TCL_OK); } } if (argc == 2) { if (strcmp(argv[1], "next-random") == 0) { tcl.resultf("%u", uniform_positive_int()); return(TCL_OK); } if (strcmp(argv[1], "seed") == 0) { tcl.resultf("%u", stream_.seed()); return(TCL_OK); } if (strcmp(argv[1], "default") == 0) { default_ = this; return(TCL_OK); } #if 0 if (strcmp(argv[1], "test") == 0) { if (test()) tcl.resultf("RNG test failed"); else tcl.resultf("RNG test passed"); return(TCL_OK); } #endif } return(TclObject::command(argc, argv)); } void RNG::set_seed(RNGSources source, int seed) { /* The following predefined seeds are evenly spaced around * the 2^31 cycle. Each is approximately 33,000,000 elements * apart. */ #define N_SEEDS_ 64 static long predef_seeds[N_SEEDS_] = { 1973272912L, 188312339L, 1072664641L, 694388766L, 2009044369L, 934100682L, 1972392646L, 1936856304L, 1598189534L, 1822174485L, 1871883252L, 558746720L, 605846893L, 1384311643L, 2081634991L, 1644999263L, 773370613L, 358485174L, 1996632795L, 1000004583L, 1769370802L, 1895218768L, 186872697L, 1859168769L, 349544396L, 1996610406L, 222735214L, 1334983095L, 144443207L, 720236707L, 762772169L, 437720306L, 939612284L, 425414105L, 1998078925L, 981631283L, 1024155645L, 822780843L, 701857417L, 960703545L, 2101442385L, 2125204119L, 2041095833L, 89865291L, 898723423L, 1859531344L, 764283187L, 1349341884L, 678622600L, 778794064L, 1319566104L, 1277478588L, 538474442L, 683102175L, 999157082L, 985046914L, 722594620L, 1695858027L, 1700738670L, 1995749838L, 1147024708L, 346983590L, 565528207L, 513791680L }; static long heuristic_sequence = 0; switch (source) { case RAW_SEED_SOURCE: // use it as it is break; case PREDEF_SEED_SOURCE: if (seed < 0 || seed >= N_SEEDS_) abort(); seed = predef_seeds[seed]; break; case HEURISTIC_SEED_SOURCE: timeval tv; gettimeofday(&tv, 0); heuristic_sequence++; // Always make sure we're different than last time. seed = (tv.tv_sec ^ tv.tv_usec ^ (heuristic_sequence << 8)) & 0x7fffffff; break; }; // set it // NEEDSWORK: should we throw out known bad seeds? // (are there any?) if (seed < 0) seed = -seed; stream_.set_seed(seed); // Toss away the first few values of heuristic seed. // In practice this makes sequential heuristic seeds // generate different first values. // // How many values to throw away should be the subject // of careful analysis. Until then, I just throw away // ``a bunch''. --johnh if (source == HEURISTIC_SEED_SOURCE) { int i; for (i = 0; i < 128; i++) { stream_.next(); }; }; } /* * RNGTest: * Make sure the RNG makes known values. * Optionally, print out some stuff. * * Simple test program: * #include "rng.h" * void main() { RNGTest test; test.verbose(); } */ #ifdef rng_test RNGTest::RNGTest() { RNG rng(RNG::RAW_SEED_SOURCE, 1L); int i; long r; for (i = 0; i < 10000; i++) r = rng.uniform_positive_int(); if (r != 1043618065L) abort(); for (i = 10000; i < 551246; i++) r = rng.uniform_positive_int(); if (r != 1003L) abort(); } void RNGTest::first_n(RNG::RNGSources source, long seed, int n) { RNG rng(source, seed); for (int i = 0; i < n; i++) { int r = rng.uniform_positive_int(); printf("%10d ", r); }; printf("\n"); } void RNGTest::verbose() { printf ("default: "); first_n(RNG::RAW_SEED_SOURCE, 1L, 5); int i; for (i = 0; i < 64; i++) { printf ("predef source %2d: ", i); first_n(RNG::PREDEF_SEED_SOURCE, i, 5); }; printf("heuristic seeds should be different from each other and on each run.\n"); for (i = 0; i < 64; i++) { printf ("heuristic source %2d: ", i); first_n(RNG::HEURISTIC_SEED_SOURCE, i, 5); }; } #endif /* rng_test */

route.cc

state.cc

tag.cc

// // Copyright (c) 1997 by the University of Southern California // All rights reserved. // // Permission to use, copy, modify, and distribute this software and its // documentation in source and binary forms for non-commercial purposes // and without fee is hereby granted, provided that the above copyright // notice appear in all copies and that both the copyright notice and // this permission notice appear in supporting documentation. and that // any documentation, advertising materials, and other materials related // to such distribution and use acknowledge that the software was // developed by the University of Southern California, Information // Sciences Institute. The name of the University may not be used to // endorse or promote products derived from this software without // specific prior written permission. // // THE UNIVERSITY OF SOUTHERN CALIFORNIA makes no representations about // the suitability of this software for any purpose. THIS SOFTWARE IS // PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, // INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF // MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. // // Other copyrights might apply to parts of this software and are so // noted when applicable. // // $Header$ #ifdef WIN32 #include <windows.h> #endif #include <string.h> #include <tcl.h> #include "animation.h" #include "tag.h" #include "view.h" Tag::Tag() : Animation(0, 0), nMbr_(0), name_(NULL) { mbrHash_ = new Tcl_HashTable; Tcl_InitHashTable(mbrHash_, TCL_ONE_WORD_KEYS); } Tag::Tag(const char *name) : Animation(0, 0), nMbr_(0) { size_t len = strlen(name); if (len == 0) name_ = NULL; else { name_ = new char[len+1]; strcpy(name_, name); } mbrHash_ = new Tcl_HashTable; Tcl_InitHashTable(mbrHash_, TCL_ONE_WORD_KEYS); } Tag::~Tag() { remove(); Tcl_DeleteHashTable(mbrHash_); delete mbrHash_; if (name_ != NULL) delete []name_; } void Tag::setname(const char *name) { if (name_ != NULL) delete name_; size_t len = strlen(name); if (len == 0) name_ = NULL; else { name_ = new char[len+1]; strcpy(name_, name); } } void Tag::add(Animation *a) { int newEntry = 1; Tcl_HashEntry *he = Tcl_CreateHashEntry(mbrHash_,(const char *)a->id(), &newEntry); if (newEntry && (he != NULL)) { // Do not handle exception he == NULL. Don't know how. Tcl_SetHashValue(he, (ClientData)a); nMbr_++; a->merge(bb_); // Let that object know about this group a->addTag(this); } } void Tag::remove() { // Remove this tag from all its members Animation *p; Tcl_HashEntry *he; Tcl_HashSearch hs; int i = 0; for (he = Tcl_FirstHashEntry(mbrHash_, &hs); he != NULL; he = Tcl_NextHashEntry(&hs), i++) { p = (Animation *) Tcl_GetHashValue(he); p->deleteTag(this); Tcl_DeleteHashEntry(he); nMbr_--; } bb_.clear(); } void Tag::remove(Animation *a) { Tcl_HashEntry *he = Tcl_FindHashEntry(mbrHash_, (const char *)a->id()); if (he != NULL) { a->deleteTag(this); Tcl_DeleteHashEntry(he); nMbr_--; update_bb(); } } void Tag::draw(View *v, double) const { // XXX don't draw anything except it's selected. Or draw // 4 black dots in the 4 corners. v->rect(bb_.xmin, bb_.ymin, bb_.xmax, bb_.ymax, Paint::instance()->thin()); } // Used for xor-draw only void Tag::xdraw(View *v, double now) const { // Draw every object of this group Tcl_HashEntry *he; Tcl_HashSearch hs; Animation *a; for (he = Tcl_FirstHashEntry(mbrHash_, &hs); he != NULL; he = Tcl_NextHashEntry(&hs)) { a = (Animation *) Tcl_GetHashValue(he); a->draw(v, now); } } void Tag::update_bb(void) { Tcl_HashEntry *he; Tcl_HashSearch hs; Animation *a; bb_.clear(); for (he = Tcl_FirstHashEntry(mbrHash_, &hs); he != NULL; he = Tcl_NextHashEntry(&hs)) { a = (Animation *) Tcl_GetHashValue(he); a->merge(bb_); } } void Tag::reset(double /*now*/) { } // Move this object and update bbox void Tag::move(EditView *v, float wdx, float wdy) { Tcl_HashEntry *he; Tcl_HashSearch hs; Animation *a; bb_.clear(); for (he = Tcl_FirstHashEntry(mbrHash_, &hs); he != NULL; he = Tcl_NextHashEntry(&hs)) { a = (Animation *) Tcl_GetHashValue(he); a->move(v, wdx, wdy); a->merge(bb_); } // We do separate move for bb_ because } const char *Tag::info() const { static char str[256]; strcpy(str, "Tag"); return str; }

testview.cc

trace.cc

tracehook.cc

transform.cc

view.cc

wnetmodel.cc