Zope-2.0.1-ZEO-nonbin/LICENSE.txt100644 1007 1403 6627 6671334244 16153 0ustar petrillipetrilli Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. Zope-2.0.1-ZEO-nonbin/README.txt100644 1007 1403 4032 6746143650 16014 0ustar petrillipetrilliWelcome to the Zope source release This document provides some general information about the Zope source release and provides links to other documents. Installation information can be found in doc/INSTALL.txt. Other documentation is also in the doc directory. Zope information is available at http://www.zope.org/ Report problems with this release on the Zope mailing list (zope@zope.org) To subscribe to the list send mail to zope-request@zope.org with "subscribe" in the subject line. Introduction The source release is intended for tinkerers, those who want to use Zope components separately, Bobo hackers, people who want to use their own Python, and people who work on obscure platforms because they love to compile everything from source. If you just want to use Zope easily and aren't a programmer the binary release will probably suit you better. All are available at http://www.zope.org/Download License The Zope License is included in LICENSE.txt Send your feedback about the license to zope-license@zope.org. Important This release requires Python 1.5.2. Installing Zope Follow the instructions in doc/INSTALL.txt to install Zope. Using Zope Components Separately Zope consists of many Python packages which can be profitably used by themselves. For example you will find all your old friends from Bobo here: * ZPublisher - A packagized version of the Bobo ORB you know and love. * DocumentTemplate - This package includes cDocumentTemplate which speeds things up considerably. * BoboPOS - This is NOT ZODB 3. It a version of BoboPOS2 which include c code to make things faster. You can find most of these packages in the lib/python directory. If you poke around, you might find other goodies too, like StructuredText. ZPublisher and DocumentTemplate are also available separately. Notes * Zope requires Python 1.5.2. * Lots more documentation is coming. * Don't forget to check the Zope web site and mailing list. * Read the source, have fun! Zope-2.0.1-ZEO-nonbin/ZServer/ 40755 1007 1403 0 6772126757 15632 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/ZServer/PubCore/ 40755 1007 1403 0 6772126757 17171 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/ZServer/PubCore/ZEvent.py100644 1007 1403 7530 6723367406 21052 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Simple Event Manager Based on Pipes """ from ZServer.medusa.select_trigger import trigger Wakeup=trigger().pull_trigger Zope-2.0.1-ZEO-nonbin/ZServer/PubCore/ZRendezvous.py100644 1007 1403 12007 6703244774 22150 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import thread from ZServerPublisher import ZServerPublisher class ZRendevous: def __init__(self, n=1): sync=thread.allocate_lock() self._a=sync.acquire self._r=sync.release pool=[] self._lists=pool, [], [] self._a() try: while n > 0: l=thread.allocate_lock() l.acquire() pool.append(l) thread.start_new_thread(ZServerPublisher, (self.accept,)) n=n-1 finally: self._r() def accept(self): self._a() try: pool, requests, ready = self._lists while not requests: l=pool[-1] del pool[-1] ready.append(l) self._r() l.acquire() self._a() pool.append(l) r=requests[0] del requests[0] return r finally: self._r() def handle(self, name, request, response): self._a() try: pool, requests, ready = self._lists requests.append((name, request, response)) if ready: l=ready[-1] del ready[-1] l.release() finally: self._r() Zope-2.0.1-ZEO-nonbin/ZServer/PubCore/ZServerPublisher.py100644 1007 1403 10146 6756115610 23124 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## from ZPublisher import publish_module class ZServerPublisher: def __init__(self, accept): while 1: try: name, request, response=accept() publish_module( name, request=request, response=response) finally: response._finish() request=response=None Zope-2.0.1-ZEO-nonbin/ZServer/PubCore/__init__.py100644 1007 1403 10002 6720303613 21365 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import ZRendezvous _handle=None _n=1 def handle(*args, **kw): global _handle if _handle is None: _handle=ZRendezvous.ZRendevous(_n).handle return apply(_handle, args, kw) def setNumberOfThreads(n): global _n _n=n global setNumberOfThreads del setNumberOfThreads Zope-2.0.1-ZEO-nonbin/ZServer/FTPRequest.py100644 1007 1403 16540 6766037310 20316 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ FTP Request class for FTP server. The FTP Request does the dirty work of turning an FTP request into something that ZPublisher can understand. """ from ZPublisher.HTTPRequest import HTTPRequest from cStringIO import StringIO import os from regsub import gsub from base64 import encodestring import string class FTPRequest(HTTPRequest): def __init__(self, path, command, channel, response, stdin=None, environ=None): if stdin is None: stdin=StringIO() if environ is None: environ=self._get_env(path, command, channel, stdin) self._orig_env=environ HTTPRequest.__init__(self, stdin, environ, response, clean=1) # support for cookies and cookie authentication self.cookies=channel.cookies if not self.cookies.has_key('__ac') and channel.userid != 'anonymous': self.other['__ac_name']=channel.userid self.other['__ac_password']=channel.password for k,v in self.cookies.items(): if not self.other.has_key(k): self.other[k]=v def retry(self): self.retry_count=self.retry_count+1 r=self.__class__(stdin=self.stdin, environ=self._orig_env, response=self.response.retry(), channel=self, # For my cookies ) return r def _get_env(self, path, command, channel, stdin): "Returns a CGI style environment" env={} env['SCRIPT_NAME']='/%s' % channel.module env['REQUEST_METHOD']='GET' # XXX what should this be? env['SERVER_SOFTWARE']=channel.server.SERVER_IDENT if channel.userid != 'anonymous': env['HTTP_AUTHORIZATION']='Basic %s' % gsub('\012','', encodestring('%s:%s' % (channel.userid, channel.password))) env['SERVER_NAME']=channel.server.hostname env['SERVER_PORT']=str(channel.server.port) env['REMOTE_ADDR']=channel.client_addr[0] env['GATEWAY_INTERFACE']='CGI/1.1' # that's stretching it ;-) # FTP commands # if type(command)==type(()): args=command[1:] command=command[0] if command in ('LST','CWD','PASS'): env['PATH_INFO']=self._join_paths(channel.path, path, 'manage_FTPlist') elif command in ('MDTM','SIZE'): env['PATH_INFO']=self._join_paths(channel.path, path, 'manage_FTPstat') elif command=='RETR': env['PATH_INFO']=self._join_paths(channel.path, path, 'manage_FTPget') elif command in ('RMD','DELE'): env['PATH_INFO']=self._join_paths(channel.path, path, 'manage_delObjects') env['QUERY_STRING']='ids=%s' % args[0] elif command=='MKD': env['PATH_INFO']=self._join_paths(channel.path, path, 'manage_addFolder') env['QUERY_STRING']='id=%s' % args[0] elif command=='STOR': env['PATH_INFO']=self._join_paths(channel.path, path) env['REQUEST_METHOD']='PUT' env['CONTENT_LENGTH']=len(stdin.getvalue()) else: env['PATH_INFO']=self._join_paths(channel.path, path, command) return env def _join_paths(self,*args): path=apply(os.path.join,args) path=os.path.normpath(path) if os.sep != '/': path=string.replace(path,os.sep,'/') return path Zope-2.0.1-ZEO-nonbin/ZServer/FTPResponse.py100644 1007 1403 12611 6733555462 20466 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ Response class for the FTP Server. """ from ZPublisher.HTTPResponse import HTTPResponse from PubCore.ZEvent import Wakeup from cStringIO import StringIO import marshal class FTPResponse(HTTPResponse): """ Response to an FTP command """ def setCookie(self, name, value, **kw): self.cookies[name]=value def appendCookie(self, name, value): self.cookies[name]=self.cookies[name] + value def expireCookie(self, name, **kw): del self.cookies[name] def _cookie_list(self): return [] def _finish(self): self.stdout.finish(self) def _marshalledBody(self): return marshal.loads(self.body) class CallbackPipe: """ Sends response object to a callback. Doesn't write anything. The callback takes place in Medusa's thread, not the request thread. """ def __init__(self, callback, args): self._callback=callback self._args=args def write(self, text): pass def close(self): pass def finish(self, response): self._response=response Wakeup(self.apply) # move callback to medusas thread def apply(self): result=apply(self._callback, self._args+(self._response,)) # is this necessary to break cycles? self._callback=None self._response=None self._args=None return result def make_response(channel, callback, *args): # XXX should this be the FTPResponse constructor instead? r=FTPResponse(stdout=CallbackPipe(callback, args), stderr=StringIO()) r.setHeader('content-type','text/plain') r.cookies=channel.cookies return r Zope-2.0.1-ZEO-nonbin/ZServer/FTPServer.py100644 1007 1403 55252 6754067732 20147 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ZServer FTP Channel for use the medusa's ftp server. FTP Service for Zope. This server allows FTP connections to Zope. In general FTP is used to manage content. You can: * Create and delete Folders, Documents, Files, and Images * Edit the contents of Documents, Files, Images In the future, FTP may be used to edit object properties. FTP Protocol The FTP protocol for Zope gives Zope objects a way to make themselves available to FTP services. See the 'lib/python/OFS/FTPInterface.py' for more details. FTP Permissions FTP access is controlled by one permission: 'FTP access' if bound to a role, users of that role will be able to list directories, and cd to them. Creating and deleting and changing objects are all governed by existing Zope permissions. Permissions are to a certain extent reflected in the permission bits listed in FTP file listings. FTP Authorization Zope supports both normal and anonymous logins. It can be difficult to authorize Zope users since they are defined in distributed user databases. Normally, all logins will be accepted and then the user must proceed to 'cd' to a directory in which they are authorized. In this case for the purpose of FTP limits, the user is considered anonymous until they cd to an authorized directory. Optionally, users can login with a special username which indicates where they are defined. Their login will then be authenticated in the indicated directory, and they will not be considered anonymous. The form of the name is '@' where path takes the form '[/...]' For example: 'amos@Foo/Bar' This will authenticate the user 'amos' in the directory '/Foo/Bar'. In addition the user's FTP session will be rooted in the authenticated directory, i.e. they will not be able to cd out of the directory. The main reason to use the rooted FTP login, is to allow non-anonymous logins. This may be handy, if for example, you disallow anonymous logins, or if you set the limit for simultaneous anonymous logins very low. """ from PubCore import handle from medusa.ftp_server import ftp_channel, ftp_server, recv_channel from medusa import asyncore, asynchat, filesys from FTPResponse import make_response from FTPRequest import FTPRequest from ZServer import CONNECTION_LIMIT from cStringIO import StringIO import string import os from mimetypes import guess_type import marshal import stat import time class zope_ftp_channel(ftp_channel): "Passes its commands to Zope, not a filesystem" read_only=0 anonymous=1 def __init__ (self, server, conn, addr, module): ftp_channel.__init__(self,server,conn,addr) self.module=module self.userid='' self.password='' self.path='/' self.cookies={} def _join_paths(self,*args): path=apply(os.path.join,args) path=os.path.normpath(path) if os.sep != '/': path=string.replace(path,os.sep,'/') return path # Overriden async_chat methods def push(self, producer, send=1): # this is thread-safe when send is false # note, that strings are not wrapped in # producers by default self.producer_fifo.push(producer) if send: self.initiate_send() push_with_producer=push # Overriden ftp_channel methods def cmd_nlst (self, line): 'give name list of files in directory' self.get_dir_list(line,0) def cmd_list (self, line): 'give list files in a directory' # handles files as well as directories. # XXX also should maybe handle globbing, yuck. self.get_dir_list(line,1) def get_dir_list(self, line, long=0): # we need to scan the command line for arguments to '/bin/ls'... # XXX clean this up, maybe with getopts if len(line) > 1: args = string.split(line[1]) else: args =[] path_args = [] for arg in args: if arg[0] != '-': path_args.append (arg) else: if 'l' in arg: long=1 if len(path_args) < 1: dir = '.' else: dir = path_args[0] self.listdir(dir, long) def listdir (self, path, long=0): response=make_response(self, self.listdir_completion, long) request=FTPRequest(path, 'LST', self, response) handle(self.module, request, response) def listdir_completion(self, long, response): status=response.getStatus() if status==200: if self.anonymous and not self.userid=='anonymous': self.anonymous=None dir_list='' file_infos=response._marshalledBody() if type(file_infos[0])==type(''): file_infos=(file_infos,) if long: for id, stat_info in file_infos: dir_list=dir_list+filesys.unix_longify(id,stat_info)+'\r\n' else: for id, stat_info in file_infos: dir_list=dir_list+id+'\r\n' self.make_xmit_channel() self.client_dc.push(dir_list) self.client_dc.close_when_done() self.respond( '150 Opening %s mode data connection for file list' % ( self.type_map[self.current_mode] ) ) elif status==401: self.respond('530 Unauthorized.') else: self.respond('550 Could not list directory.') def cmd_cwd (self, line): 'change working directory' response=make_response(self, self.cwd_completion, self._join_paths(self.path,line[1])) request=FTPRequest(line[1],'CWD',self,response) handle(self.module,request,response) def cwd_completion(self,path,response): 'cwd completion callback' status=response.getStatus() if status==200: listing=response._marshalledBody() # check to see if we are cding to a non-foldoid object if type(listing[0])==type(''): self.respond('550 No such directory.') return else: self.path=path or '/' self.respond('250 CWD command successful.') # now that we've sucussfully cd'd perhaps we are no # longer anonymous if self.anonymous and not self.userid=='anonymous': self.anonymous=None elif status==401: self.respond('530 Unauthorized.') else: self.respond('550 No such directory.') def cmd_cdup (self, line): 'change to parent of current working directory' self.cmd_cwd((None,'..')) def cmd_pwd (self, line): 'print the current working directory' self.respond ( '257 "%s" is the current directory.' % ( self.path ) ) cmd_xpwd=cmd_pwd def cmd_mdtm(self, line): 'show last modification time of file' if len (line) != 2: self.command.not_understood (string.join (line)) return response=make_response(self, self.mdtm_completion) request=FTPRequest(line[1],'MDTM',self,response) handle(self.module,request,response) def mdtm_completion(self, response): status=response.getStatus() if status==200: mtime=response._marshalledBody()[stat.ST_MTIME] mtime=time.gmtime(mtime) self.respond('213 %4d%02d%02d%02d%02d%02d' % ( mtime[0], mtime[1], mtime[2], mtime[3], mtime[4], mtime[5] )) elif status==401: self.respond('530 Unauthorized.') else: self.respond('550 Error getting file modification time.') def cmd_size(self, line): 'return size of file' if len (line) != 2: self.command.not_understood (string.join (line)) return response=make_response(self, self.size_completion) request=FTPRequest(line[1],'SIZE',self,response) handle(self.module,request,response) def size_completion(self,response): status=response.getStatus() if status==200: self.respond('213 %d'% response._marshalledBody()[stat.ST_SIZE]) elif status==401: self.respond('530 Unauthorized.') else: self.respond('550 Error getting file size.') #self.client_dc.close_when_done() def cmd_retr(self,line): if len(line) < 2: self.command_not_understood (string.join (line)) return response=make_response(self, self.retr_completion, line[1]) request=FTPRequest(line[1],'RETR',self,response) handle(self.module,request,response) def retr_completion(self, file, response): status=response.getStatus() if status==200: self.make_xmit_channel() self.client_dc.push(response.body) self.client_dc.close_when_done() self.respond( "150 Opening %s mode data connection for file '%s'" % ( self.type_map[self.current_mode], file )) elif status==401: self.respond('530 Unauthorized.') else: self.respond('550 Error opening file.') def cmd_stor (self, line, mode='wb'): 'store a file' if len (line) < 2: self.command_not_understood (string.join (line)) return elif self.restart_position: restart_position = 0 self.respond ('553 restart on STOR not yet supported') return # XXX Check for possible problems first? # Right now we are limited in the errors we can issue, since # we agree to accept the file before checking authorization fd=ContentReceiver(self.stor_callback, line[1]) self.respond ( '150 Opening %s connection for %s' % ( self.type_map[self.current_mode], line[1] ) ) self.make_recv_channel(fd) def stor_callback(self,path,data): 'callback to do the STOR, after we have the input' response=make_response(self, self.stor_completion) request=FTPRequest(path,'STOR',self,response,stdin=data) handle(self.module,request,response) def stor_completion(self,response): status=response.getStatus() if status in (200,201,204,302): self.client_dc.channel.respond('226 Transfer complete.') elif status==401: self.client_dc.channel.respond('426 Unauthorized.') else: self.client_dc.channel.respond('426 Error creating file.') self.client_dc.close() def cmd_dele(self, line): if len (line) != 2: self.command.not_understood (string.join (line)) return path,id=os.path.split(line[1]) response=make_response(self, self.dele_completion) request=FTPRequest(path,('DELE',id),self,response) handle(self.module,request,response) def dele_completion(self,response): status=response.getStatus() if status==200 and string.find(response.body,'Not Deletable')==-1: self.respond('250 DELE command successful.') elif status==401: self.respond('530 Unauthorized.') else: self.respond('550 Error deleting file.') def cmd_mkd(self, line): if len (line) != 2: self.command.not_understood (string.join (line)) return path,id=os.path.split(line[1]) response=make_response(self, self.mkd_completion) request=FTPRequest(path,('MKD',id),self,response) handle(self.module,request,response) cmd_xmkd=cmd_mkd def mkd_completion(self,response): status=response.getStatus() if status==200: self.respond('257 MKD command successful.') elif status==401: self.respond('530 Unauthorized.') else: self.respond('550 Error creating directory.') def cmd_rmd(self, line): # XXX should object be checked to see if it's folderish # before we allow it to be RMD'd? if len (line) != 2: self.command.not_understood (string.join (line)) return path,id=os.path.split(line[1]) response=make_response(self, self.rmd_completion) request=FTPRequest(path,('RMD',id),self,response) handle(self.module,request,response) cmd_xrmd=cmd_rmd def rmd_completion(self,response): status=response.getStatus() if status==200 and string.find(response.body,'Not Deletable')==-1: self.respond('250 RMD command successful.') elif status==401: self.respond('530 Unauthorized.') else: self.respond('550 Error removing directory.') def cmd_user(self, line): 'specify user name' if len(line) > 1: self.userid = line[1] self.respond('331 Password required.') else: self.command_not_understood (string.join (line)) def cmd_pass(self, line): 'specify password' if len(line) < 2: pw = '' else: pw = line[1] self.password=pw i=string.find(self.userid,'@') if i ==-1: if self.server.limiter.check_limit(self): self.respond ('230 Login successful.') self.authorized = 1 self.anonymous = 1 self.log_info ('Successful login.') else: self.respond('421 User limit reached. Closing connection.') self.close_when_done() else: path=self.userid[i+1:] self.userid=self.userid[:i] self.anonymous=None response=make_response(self, self.pass_completion, self._join_paths('/',path)) request=FTPRequest(path,'PASS',self,response) handle(self.module,request,response) def pass_completion(self,path,response): status=response.getStatus() if status==200: if not self.server.limiter.check_limit(self): self.close_when_done() self.respond('421 User limit reached. Closing connection.') return listing=response._marshalledBody() # check to see if we are cding to a non-foldoid object if type(listing[0])==type(''): self.respond('530 Unauthorized.') return self.path=path or '/' self.authorized = 1 if self.userid=='anonymous': self.anonymous=1 self.log_info('Successful login.') self.respond('230 Login successful.') else: self.respond('530 Unauthorized.') def cmd_appe(self, line): self.respond('502 Command not implemented.') # Override ftp server receive channel reponse mechanism # XXX hack alert, this should probably be redone in a more OO way. def handle_close (self): """response and closure of channel is delayed.""" s = self.channel.server s.total_files_in.increment() s.total_bytes_in.increment(self.bytes_in.as_long()) self.fd.close() self.readable=lambda :0 # don't call close again recv_channel.handle_close=handle_close class ContentReceiver: "Write-only file object used to receive data from FTP" def __init__(self,callback,*args): self.data=StringIO() self.callback=callback self.args=args def write(self,data): self.data.write(data) def close(self): self.data.seek(0) args=self.args+(self.data,) c=self.callback self.callback=None self.args=None apply(c,args) class FTPLimiter: """Rudimentary FTP limits. Helps prevent denial of service attacks. It works by limiting the number of simultaneous connections by userid. There are three limits, one for anonymous connections, and one for authenticated logins. The total number of simultaneous anonymous logins my be less than or equal to the anonymous limit. Each authenticated user can have up to the user limit number of simultaneous connections. The total limit is the maximum number of simultaneous connections of any sort. Do *not* set the total limit lower than or equal to the anonymous limit.""" def __init__(self,anon_limit=10,user_limit=4,total_limit=25): self.anon_limit=anon_limit self.user_limit=user_limit self.total_limit=total_limit def check_limit(self,channel): """Check to see if the user has exhausted their limit or not. Check for existing channels with the same userid and the same ftp server.""" total=0 class_total=0 if channel.anonymous: for existing_channel in asyncore.socket_map.keys(): if (hasattr(existing_channel,'server') and existing_channel.server is channel.server): total=total+1 if existing_channel.anonymous: class_total=class_total+1 if class_total > self.anon_limit: return None else: for existing_channel in asyncore.socket_map.keys(): if (hasattr(existing_channel,'server') and existing_channel.server is channel.server): total=total+1 if channel.userid==existing_channel.userid: class_total=class_total+1 if class_total > self.user_limit: return None if total <= self.total_limit: return 1 class FTPServer(ftp_server): """FTP server for Zope.""" ftp_channel_class = zope_ftp_channel limiter=FTPLimiter(10,1) def __init__(self,module,*args,**kw): apply(ftp_server.__init__, (self, None) + args, kw) self.module=module def handle_accept (self): conn, addr = self.accept() self.total_sessions.increment() self.log_info('Incoming connection from %s:%d' % (addr[0], addr[1])) self.ftp_channel_class (self, conn, addr, self.module) def readable(self): return len(asyncore.socket_map) < CONNECTION_LIMIT def listen(self, num): # override asyncore limits for nt's listen queue size self.accepting = 1 return self.socket.listen (num) Zope-2.0.1-ZEO-nonbin/ZServer/HTTPResponse.py100644 1007 1403 26442 6756541723 20623 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ ZServer HTTPResponse The HTTPResponse class takes care of server headers, response munging and logging duties. """ import time, regex, string, sys from cStringIO import StringIO from ZPublisher.HTTPResponse import HTTPResponse, end_of_header_search from medusa.http_date import build_http_date from PubCore.ZEvent import Wakeup from medusa.producers import hooked_producer from medusa import http_server, asyncore from Producers import ShutdownProducer, LoggingProducer, CallbackProducer class ZServerHTTPResponse(HTTPResponse): "Used to push data into a channel's producer fifo" http_chunk=0 http_chunk_size=1024 # defaults _http_version='1.0' _http_connection='close' _server_version='Zope/2.0 ZServer/2.0' def __str__(self, html_search=regex.compile('',regex.casefold).search, ): if self._wrote: return '' # Streaming output was used. headers=self.headers body=self.body if body: isHTML=self.isHTML(body) if not headers.has_key('content-type'): if isHTML: c='text/html' else: c='text/plain' self.setHeader('content-type',c) else: isHTML = headers['content-type']=='text/html' if isHTML and end_of_header_search(self.body) < 0: lhtml=html_search(body) if lhtml >= 0: lhtml=lhtml+6 body='%s\n%s' % (body[:lhtml],body[lhtml:]) else: body='\n' + body self.setBody(body) body=self.body # set 204 (no content) status if 200 and response is empty if not headers.has_key('content-type') and \ not headers.has_key('content-length') and \ not headers.has_key('transfer-encoding') and \ self.status == 200: self.setStatus('nocontent') # add content length if not transfer encoded if not headers.has_key('content-length') and \ not headers.has_key('transfer-encoding'): self.setHeader('content-length',len(body)) headersl=[] append=headersl.append status=headers.get('status', '200 OK') # status header must come first. append("HTTP/%s %s" % (self._http_version, status)) if headers.has_key('status'): del headers['status'] # add zserver headers append('Server: %s' % self._server_version) append('Date: %s' % build_http_date(time.time())) chunk=0 if self._http_version=='1.0': if self._http_connection=='keep alive': if self.headers.has_key('content-length'): self.setHeader('Connection','close') else: self.setHeader('Connection','Keep-Alive') else: self.setHeader('Connection','close') elif self._http_version=='1.1': if self._http_connection=='close': self.setHeader('Connection','close') elif not self.headers.has_key('content-length'): if self.headers.has_key('transfer-encoding'): if self.headers['transfer-encoding'] != 'chunked': self.setHeader('Connection','close') else: chunk=1 elif self.http_chunk: self.setHeader('Transfer-Encoding','chunked') chunk=1 else: self.setHeader('Connection','close') if chunk: chunked_body='' while body: chunk=body[:self.http_chunk_size] body=body[self.http_chunk_size:] chunked_body='%s%x\r\n%s\r\n' % (chunked_body, len(chunk), chunk) chunked_body='%s0\r\n\r\n' % chunked_body body=chunked_body for key, val in headers.items(): if string.lower(key)==key: # only change non-literal header names key="%s%s" % (string.upper(key[:1]), key[1:]) start=0 l=string.find(key,'-',start) while l >= start: key="%s-%s%s" % (key[:l],string.upper(key[l+1:l+2]),key[l+2:]) start=l+1 l=string.find(key,'-',start) append("%s: %s" % (key, val)) if self.cookies: headersl=headersl+self._cookie_list() headersl[len(headersl):]=[self.accumulated_headers, body] return string.join(headersl,'\r\n') # XXX add server headers, etc to write() def _finish(self): self.stdout.finish(self) self.stdout.close() self.stdout=None # need to break cycle? self._request=None class ChannelPipe: """Experimental pipe from ZPublisher to a ZServer Channel. Should only be used by one thread at a time. Note also that the channel will be being handled by another thread, thus restrict access to channel to the push method only.""" def __init__(self, request): self._channel=request.channel self._request=request self._shutdown=0 self._close=0 self._bytes=0 def write(self, text): self._bytes=self._bytes + len(text) self._channel.push(text,0) Wakeup() def close(self): self._channel.push(LoggingProducer(self._request, self._bytes), 0) self._channel.push(CallbackProducer(self._channel.done), 0) if self._shutdown: try: r=self._shutdown[0] except: r=0 sys.ZServerExitCode=r self._channel.push(ShutdownProducer(), 0) Wakeup(lambda: asyncore.close_all()) else: if self._close: self._channel.push(None, 0) Wakeup() self._channel=None #need to break cycles? self._request=None def finish(self, response): if response.headers.get('bobo-exception-type', '') == \ 'exceptions.SystemExit': r=response.headers.get('bobo-exception-value','0') try: r=string.atoi(r) except: r = r and 1 or 0 self._shutdown=r, if response.headers.get('connection','') == 'close' or \ response.headers.get('Connection','') == 'close': self._close=1 self._request.reply_code=response.status def retry(self): """Return a request object to be used in a retry attempt """ # This implementation is a bit lame, because it assumes that # only stdout stderr were passed to the constructor. OTOH, I # think that that's all that is ever passed. response=self.__class__(stdout=self.stdout, stderr=self.stderr) response._http_version=self._http_version response._http_connection=self._http_connection response._server_version=self._server_version return response def make_response(request, headers): "Simple http response factory" # should this be integrated into the HTTPResponse constructor? response=ZServerHTTPResponse(stdout=ChannelPipe(request), stderr=StringIO()) response._http_version=request.version response._http_connection=string.lower( http_server.get_header(http_server.CONNECTION, request.header)) response._server_version=request.channel.server.SERVER_IDENT return response Zope-2.0.1-ZEO-nonbin/ZServer/HTTPServer.py100644 1007 1403 31213 6761607033 20254 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ Medusa HTTP server for Zope changes from Medusa's http_server Request Threads -- Requests are processed by threads from a thread pool. Output Handling -- Output is pushed directly into the producer fifo by the request-handling thread. The HTTP server does not do any post-processing such as chunking. Pipelineable -- This is needed for protocols such as HTTP/1.1 in which mutiple requests come in on the same channel, before responses are sent back. When requests are pipelined, the client doesn't wait for the response before sending another request. The server must ensure that responses are sent back in the same order as requests are received. """ import sys import regex import string import os import types import thread import time from cStringIO import StringIO from PubCore import handle from HTTPResponse import make_response from ZPublisher.HTTPRequest import HTTPRequest from medusa.http_server import http_server, http_channel from medusa import counter, producers, asyncore, max_sockets from medusa.default_handler import split_path, unquote, get_header from ZServer import CONNECTION_LIMIT, ZOPE_VERSION, ZSERVER_VERSION from zLOG import LOG, register_subsystem, BLATHER, INFO, WARNING, ERROR register_subsystem('ZServer HTTPServer') CONTENT_LENGTH = regex.compile('Content-Length: \([0-9]+\)',regex.casefold) CONNECTION = regex.compile ('Connection: \(.*\)', regex.casefold) # maps request some headers to environment variables. # (those that don't start with 'HTTP_') header2env={'content-length' : 'CONTENT_LENGTH', 'content-type' : 'CONTENT_TYPE', 'connection' : 'CONNECTION_TYPE', } class zhttp_handler: "A medusa style handler for zhttp_server" # XXX add code to allow env overriding def __init__ (self, module, uri_base=None, env=None): """Creates a zope_handler module -- string, the name of the module to publish uri_base -- string, the base uri of the published module defaults to '/' if not given. env -- dictionary, environment variables to be overridden. Replaces standard variables with supplied ones. """ self.module_name=module self.env_override=env or {} self.hits = counter.counter() # if uri_base is unspecified, assume it # starts with the published module name # if uri_base is None: uri_base='/%s' % module elif uri_base == '': uri_base='/' else: if uri_base[0] != '/': uri_base='/'+uri_base if uri_base[-1] == '/': uri_base=uri_base[:-1] self.uri_base=uri_base uri_regex='%s.*' % self.uri_base self.uri_regex = regex.compile(uri_regex) def match(self, request): uri = request.uri if self.uri_regex.match(uri) == len(uri): return 1 else: return 0 def handle_request(self,request): self.hits.increment() size=get_header(CONTENT_LENGTH, request.header) if size and size != '0': size=string.atoi(size) if size > 524288: # write large upload data to a file from tempfile import TemporaryFile self.data = TemporaryFile('w+b') else: self.data = StringIO() self.request = request request.channel.set_terminator(size) request.collector=self else: sin=StringIO() self.continue_request(sin,request) def get_environment(self, request, # These are strictly performance hackery... split=string.split, strip=string.strip, join =string.join, upper=string.upper, lower=string.lower, h2ehas=header2env.has_key, h2eget=header2env.get, workdir=os.getcwd(), ospath=os.path, ): [path, params, query, fragment] = split_path(request.uri) while path and path[0] == '/': path = path[1:] if '%' in path: path = unquote(path) if query: # ZPublisher doesn't want the leading '?' query = query[1:] server=request.channel.server env = {} env['REQUEST_METHOD']=upper(request.command) env['SERVER_PORT']=str(server.port) env['SERVER_NAME']=server.server_name env['SERVER_SOFTWARE']=server.SERVER_IDENT env['SERVER_PROTOCOL']=request.version env['channel.creation_time']=request.channel.creation_time if self.uri_base=='/': env['SCRIPT_NAME']='' env['PATH_INFO']='/' + path else: env['SCRIPT_NAME'] = self.uri_base try: path_info=split(path,self.uri_base[1:],1)[1] except: path_info='' env['PATH_INFO']=path_info env['PATH_TRANSLATED']=ospath.normpath(ospath.join( workdir, env['PATH_INFO'])) if query: env['QUERY_STRING'] = query env['GATEWAY_INTERFACE']='CGI/1.1' env['REMOTE_ADDR']=request.channel.addr[0] # If we're using a resolving logger, try to get the # remote host from the resolver's cache. if hasattr(server.logger, 'resolver'): dns_cache=server.logger.resolver.cache if dns_cache.has_key(env['REMOTE_ADDR']): remote_host=dns_cache[env['REMOTE_ADDR']][2] if remote_host is not None: env['REMOTE_HOST']=remote_host env_has=env.has_key for header in request.header: key,value=split(header,":",1) key=lower(key) value=strip(value) if h2ehas(key) and value: env[h2eget(key)]=value else: key='HTTP_%s' % upper(join(split(key, "-"), "_")) if value and not env_has(key): env[key]=value env.update(self.env_override) return env def continue_request(self, sin, request): "continue handling request now that we have the stdin" env=self.get_environment(request) zresponse=make_response(request,env) zrequest=HTTPRequest(sin, env, zresponse) request.channel.current_request=None request.channel.queue.append(self.module_name, zrequest, zresponse) request.channel.work() def status(self): return producers.simple_producer("""
  • Zope Handler
    • Published Module: % s
    • Hits: %d
    """ %(self.module_name,int(self.hits)) ) # put and post collection methods # def collect_incoming_data (self, data): self.data.write(data) def found_terminator(self): # reset collector self.request.channel.set_terminator('\r\n\r\n') self.request.collector=None # finish request self.data.seek(0) r=self.request d=self.data del self.request del self.data self.continue_request(d,r) class zhttp_channel(http_channel): "http channel" def __init__(self, server, conn, addr): http_channel.__init__(self, server, conn, addr) self.queue=[] self.working=0 def push(self, producer, send=1): # this is thread-safe when send is false # note, that strings are not wrapped in # producers by default self.producer_fifo.push(producer) if send: self.initiate_send() push_with_producer=push def work(self): "try to handle a request" if not self.working: if self.queue: self.working=1 try: module_name, request, response=self.queue.pop(0) except: return handle(module_name, request, response) def done(self): "Called when a publishing request is finished" self.working=0 self.work() def kill_zombies(self): now = int (time.time()) for channel in asyncore.socket_map.keys(): if channel.__class__ == self.__class__: if (now - channel.creation_time) > channel.zombie_timeout: channel.close() class zhttp_server(http_server): "http server" SERVER_IDENT='Zope/%s ZServer/%s' % (ZOPE_VERSION,ZSERVER_VERSION) channel_class = zhttp_channel def readable(self): return self.accepting and \ len(asyncore.socket_map) < CONNECTION_LIMIT def listen(self, num): # override asyncore limits for nt's listen queue size self.accepting = 1 return self.socket.listen (num) Zope-2.0.1-ZEO-nonbin/ZServer/INSTALL.txt100644 1007 1403 10004 6745124413 17574 0ustar petrillipetrilliZServer Installation -------------------- Requirements ZServer comes with Zope 2. Though ZServer can be used with earlier versions of Zope, this is not supported and not covered by this document. Configuration To run ZServer you simply execute the z2.py start script which is located in your Zope directory. You can pass commandline arguments to the start script in order to run Zope with different options. In order to see a list of options use the '-h' help option. Here's an example of use:: $ python1.5.2 z2.py -w 8888 -f "" -p "" -m "" & This example starts Zope using a web server on port 8888. It does not start and FTP server, or a PCGI server, or a Monitor server. It also starts the server running in the backaground. Shell scripts and batch files You may also wish to create a shell script (or batch file under win32) to set environment variables (such as ZOPE_DEBUG_MODE and PYTHONHOME) and run the start script. Here's an example shell script for a binary Zope release:: ZOPE_DEBUG_MODE=1 export ZOPE_DEBUG_MODE PYTHONHOME=/home/Zope export PYTHONHOME /home/Zope/bin/python /home/Zope/z2.py -w 9673 & Note: If ZServer fails because it can't find some standard Python libaries there's a good bet that you need to set the PYTHONHOME as shown above. Here's an example batch file:: set ZOPE_DEBUG_MODE=1 "\Program Files\Zope\bin\python" "\Program Files\Zope\z2.py -w 8888 -f 8021" Now you're ready to go. Starting ZServer To start ZServer run the start script:: $ python1.5.2 z2.py To stop the server type 'control-c'. Note: If you've created a shell script or batch file to run ZServer use that instead. You should see some Medusa information come up on the screen as Zope starts. A log file will be written to the 'var' directory, named 'Z2.log' by default. Using ZServer Once you start ZServer is will publish Zope (or any Python module) on HTTP and/or FTP. To access Zope via HTTP point your browser at the server like so:: http://www.example.com:9673/ This assumes that you have chosen to put HTTP on port 9673 and that you are publishing a module named whose URL prefix is set to ''. Note: to publish Zope normally you publish the 'lib/python/Zope.py' module. To access Zope via FTP you need to FTP to it at the port you set FTP to run on. For example:: ftp www.example.com 9221 This opens a FTP session to your machine on port 9221, ZServer's default FTP port. When you are prompted to log in you should supply a Zope username and password. (Probably you should use an account with the 'Manager' role, unless you have configured Zope to allow FTP access to the 'Anonymous' role.) You can also enter 'anonymous' and any password for anonymous FTP access. Once you have logged in you can start issuing normal FTP commands. Right now ZServer supports most basic FTP commands. Note: When you log in your working directory is set to '/'. If you do not have FTP permissions in this directory, you will need to 'cd' to a directory where you have permissions before you can do anything. See above for more information about logging into FTP. Advanced Usage: zdaemon.py and the Zope NT service. One problem you may notice with ZServer is that once the server is shutdown, either through the web management interface, or by some other means, it will not automatically be restarted. On Unix you can use zdeamon.py to keep Zope running. Specifying the '-Z' switch when starting Zope runs zdaemon.py. Zdeamon will restart Zope when it Zope is restarted through the web, and in case of an unexpected error. On NT, use the Zope service for the same functionality. See ZServer.py for more information on running ZServer as a service. Where to go from here Check out the README.txt file. It contains information on what ZServer can do, how it works and and what you can do if you run into problems. And don't forget to have fun! Zope-2.0.1-ZEO-nonbin/ZServer/PCGIServer.py100644 1007 1403 34165 6754067732 20240 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ Medusa PCGI server. This server functions as the PCGI publisher--it accepts the request from the PCGI wrapper CGI program, services the request, and sends back the response. It should work with both inet and unix domain sockets. Why would you want to use it? Using PCGI to connect to ZServer from another webserver is similar to using the web server as a proxy, with the difference, that the web server gets to control the environment and headers completely. Note that ZServer can operate multiple PCGI servers. """ from medusa import asynchat, asyncore, logger from medusa.counter import counter from medusa.http_server import compute_timezone_for_log from ZServer import CONNECTION_LIMIT from PubCore import handle from PubCore.ZEvent import Wakeup from ZPublisher.HTTPResponse import HTTPResponse from ZPublisher.HTTPRequest import HTTPRequest from Producers import ShutdownProducer, LoggingProducer from cStringIO import StringIO from tempfile import TemporaryFile import socket, string, os, sys, time tz_for_log=compute_timezone_for_log() class PCGIChannel(asynchat.async_chat): """Processes a PCGI request by collecting the env and stdin and then passing them to ZPublisher. The result is wrapped in a producer and sent back.""" def __init__(self,server,sock,addr): self.server = server self.addr = addr asynchat.async_chat.__init__ (self, sock) self.env={} self.data=StringIO() self.set_terminator(10) self.size=None self.done=None def found_terminator(self): if self.size is None: # read the next size header # and prepare to read env or stdin self.data.seek(0) self.size=string.atoi(self.data.read()) self.set_terminator(self.size) if self.size==0: self.set_terminator('\r\n') self.data=StringIO() self.send_response() elif self.size > 1048576: self.data=TemporaryFile('w+b') else: self.data=StringIO() elif not self.env: # read env self.size=None self.data.seek(0) buff=self.data.read() for line in string.split(buff,'\000'): try: k,v = string.split(line,'=',1) self.env[k] = v except: pass # Hack around broken IIS PATH_INFO # maybe, this should go in ZPublisher... if self.env.has_key('SERVER_SOFTWARE') and \ string.find(self.env['SERVER_SOFTWARE'], 'Microsoft-IIS') != -1: script = filter(None,string.split( string.strip(self.env['SCRIPT_NAME']),'/')) path = filter(None,string.split( string.strip(self.env['PATH_INFO']),'/')) self.env['PATH_INFO'] = '/' + string.join(path[len(script):],'/') self.data=StringIO() # now read the next size header self.set_terminator(10) else: # we're done, we've got both env and stdin self.set_terminator('\r\n') self.data.seek(0) self.send_response() def send_response(self): # create an output pipe by passing request to ZPublisher, # and requesting a callback of self.log with the module # name and PATH_INFO as an argument. self.done=1 response=PCGIResponse(stdout=PCGIPipe(self), stderr=StringIO()) request=HTTPRequest(self.data, self.env, response) handle(self.server.module, request, response) def collect_incoming_data(self, data): self.data.write(data) def readable(self): if not self.done: return 1 def log_request(self, bytes): # XXX need to add reply code logging if self.env.has_key('PATH_INFO'): path='%s%s' % (self.server.module, self.env['PATH_INFO']) else: path='%s/' % self.server.module if self.env.has_key('REQUEST_METHOD'): method=self.env['REQUEST_METHOD'] else: method="GET" if self.addr: self.server.logger.log ( self.addr[0], '%d - - [%s] "%s %s" %d' % ( self.addr[1], time.strftime ( '%d/%b/%Y:%H:%M:%S ', time.gmtime(time.time()) ) + tz_for_log, method, path, bytes ) ) else: self.server.logger.log ( '127.0.0.1', '- - [%s] "%s %s" %d' % ( time.strftime ( '%d/%b/%Y:%H:%M:%S ', time.gmtime(time.time()) ) + tz_for_log, method, path, bytes ) ) def push(self, producer, send=1): # this is thread-safe when send is false # note, that strings are not wrapped in # producers by default self.producer_fifo.push(producer) if send: self.initiate_send() def __repr__(self): return "" % id(self) class PCGIServer(asyncore.dispatcher): """Accepts PCGI requests and hands them off to the PCGIChannel for handling. PCGIServer can be configured with either a PCGI info file or by directly specifying the module, pid_file, and either port (for inet sockets) or socket_file (for unix domain sockets.) For inet sockets, the ip argument specifies the address from which the server will accept connections, '' indicates all addresses. If you only want to accept connections from the localhost, set ip to '127.0.0.1'.""" channel_class=PCGIChannel def __init__ (self, module='Main', ip='127.0.0.1', port=None, socket_file=None, pid_file=None, pcgi_file=None, resolver=None, logger_object=None): self.ip = ip asyncore.dispatcher.__init__(self) self.count=counter() if not logger_object: logger_object = logger.file_logger (sys.stdout) if resolver: self.logger = logger.resolving_logger (resolver, logger_object) else: self.logger = logger.unresolving_logger (logger_object) # get configuration self.module=module self.port=port self.pid_file=pid_file self.socket_file=socket_file if pcgi_file is not None: self.read_info(pcgi_file) # write pid file try: f = open(self.pid_file, 'w') f.write(str(os.getpid())) f.close() except IOError: self.log_info("Cannot write PID file.", 'error') # setup sockets if self.port: self.create_socket(socket.AF_INET, socket.SOCK_STREAM) self.set_reuse_addr() self.bind((self.ip, self.port)) else: try: os.unlink(self.socket_file) except os.error: pass self.create_socket(socket.AF_UNIX, socket.SOCK_STREAM) self.set_reuse_addr() self.bind(self.socket_file) try: os.chmod(self.socket_file,0777) except os.error: pass self.listen(256) def read_info(self,info_file): "read configuration information from a PCGI info file" lines=open(info_file).readlines() directives={} for line in lines: line=string.strip(line) if not len(line) or line[0]=='#': continue k,v=string.split(line,'=',1) directives[string.strip(k)]=string.strip(v) self.pid_file=directives.get('PCGI_PID_FILE',None) self.socket_file=directives.get('PCGI_SOCKET_FILE',None) if directives.has_key('PCGI_PORT'): self.port=string.atoi(directives['PCGI_PORT']) if directives.has_key('PCGI_MODULE'): self.module=directives['PCGI_MODULE'] elif directives.has_key('PCGI_MODULE_PATH'): path=directives['PCGI_MODULE_PATH'] path,module=os.path.split(path) module,ext=os.path.splitext(module) self.module=module def handle_accept (self): self.count.increment() try: conn, addr = self.accept() except socket.error: self.log_info('Server accept() threw an exception', 'warning') return self.channel_class(self, conn, addr) def readable(self): return len(asyncore.socket_map) < CONNECTION_LIMIT def writable (self): return 0 def listen(self, num): # override asyncore limits for nt's listen queue size self.accepting = 1 return self.socket.listen (num) class PCGIResponse(HTTPResponse): def _finish(self): self.stdout.finish(self) self.stdout.close() class PCGIPipe: """ Formats a HTTP response in PCGI format 10 digits indicating len of STDOUT STDOUT 10 digits indicating len of STDERR STDERR Note that this implementation never sends STDERR """ def __init__(self, channel): self._channel=channel self._data=StringIO() self._shutdown=0 def write(self,text): self._data.write(text) def close(self): data=self._data.getvalue() l=len(data) self._channel.push('%010d%s%010d' % (l, data, 0), 0) self._channel.push(LoggingProducer(self._channel, l, 'log_request'), 0) if self._shutdown: try: r=self._shutdown[0] except: r=0 sys.ZServerExitCode=r self._channel.push(ShutdownProducer(), 0) Wakeup(lambda: asyncore.close_all()) else: self._channel.push(None, 0) Wakeup() self._channel=None def finish(self,request): if request.headers.get('bobo-exception-type','') == \ 'exceptions.SystemExit': r=request.headers.get('bobo-exception-value','0') try: r=string.atoi(r) except: r = r and 1 or 0 self._shutdown=r, Zope-2.0.1-ZEO-nonbin/ZServer/Producers.py100644 1007 1403 10651 6703246117 20255 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ ZServer pipe utils. These producers basically function as callbacks. """ from medusa import asyncore import sys class ShutdownProducer: "shuts down medusa" def more(self): asyncore.close_all() class LoggingProducer: "logs request" def __init__(self, logger, bytes, method='log'): self.logger=logger self.bytes=bytes self.method=method def more(self): getattr(self.logger, self.method)(self.bytes) return '' class CallbackProducer: "Performs a callback in the channel's thread" def __init__(self, callback): self.callback=callback def more(self): self.callback() return '' Zope-2.0.1-ZEO-nonbin/ZServer/README.txt100644 1007 1403 20535 6745124413 17435 0ustar petrillipetrilliZServer README -------------- What is ZServer? ZServer is an integration of the Zope application server and the Medusa information server. See the ZServer architecture document for more information:: http://www.zope.org/Documentation/Reference/ZServer ZServer gives you HTTP, FTP, WebDAV, PCGI, and remote interactive Python access. In later releases it will probably offer more protocols such as FastCGI, etc. What is Medusa? Medusa is a Python server framework with uses a single threaded asynchronous sockets approach. For more information see:: http://www.nightmare.com/medusa There's also an interesting Medusa tutorial at:: http://www.nightmare.com:8080/nm/apps/medusa/docs/programming.html ZServer HTTP support ZServer offers HTTP 1.1 publishing for Zope. It does not support publishing files from the file system. You can specify the HTTP port using the -w command line argument for the z2.py start script. You can also specify CGI environment variables on the command line using z2.py ZServer FTP support What you can do with FTP FTP access to Zope allows you to FTP to the Zope object hierarchy in order to perform managerial tasks. You can: * Navigate the object hierarchy with 'cd' * Replace the content of Documents, Images, and Files * Create Documents, Images, Files, Folders * Delete objects and Folders. So basically you can do more than is possible with HTTP PUT. Also, unlike PUT, FTP gives you access to Document content. So when you download a Document you are getting its content, not what it looks like when it is rendered. Using FTP To FTP into Zope, ZServer must be configured to serve FTP. By default ZServer serves FTP on port 9221. So to connect to Zope you would issue a command like so:: $ ftp localhost 9221 When logging in to FTP, you have some choices. You can connect anonymously by using a username of 'anonymous' and any password. Or you can login as a Zope user. Since Zope users are defined at different locations in the object hierarchy, authentication can be problematic. There are two solutions: * login and then cd to the directory where you are defined. * login with a special name that indicates where you are defined. The format of the special name is '@'. For example:: joe@Marketing/Projects FTP permissions FTP support is provided for Folders, Documents, Images, and Files. You can control access to FTP via the new 'FTP access' permission. This permission controls the ability to 'cd' to a Folder and to download objects. Uploading and deleting and creating objects are controlled by existing permissions. FTP limits You can set limits for the number of simultaneous FTP connections. You can separately configure the number of anonymous and authenticated connections. Right now this setting is set in 'ZServerFTP.py'. In the future, it may be more easy to configure. Properties and FTP: The next step The next phase of FTP support will allow you to edit properties of all Zope objects. Probably properties will be exposed via special files which will contain an XML representation of the object's properties. You could then download the file, edit the XML and upload it to change the object's properties. We do not currently have a target date for FTP property support. How does FTP work? The ZServer's FTP channel object translates FTP requests into ZPublisher requests. The FTP channel then analyses the response and formulates an appropriate FTP response. The FTP channel stores some state such as the current working directory and the username and password. On the Zope side of things, the 'lib/python/OFS/FTPInterface.py' module defines the Zope FTP interface, for listing sub-items, stating, and getting content. The interface is implemented in 'SimpleItem', and in other Zope classes. Programmers will not need to implement the entire interface if they inherit from 'SimpleItem'. All the other FTP functions are handled by existing methods like 'manage_delObjects', and 'PUT', etc. ZServer PCGI support ZServer will service PCGI requests with both inet and unix domain sockets. This means you can use ZServer instead of 'pcgi_publisher.py' as your long running PCGI server process. In the future, PCGI may be able to activate ZServer. Using PCGI instead of HTTP allows you to forward requests from another web server to ZServer. The CGI environment and HTTP headers are controlled by the web server, so you don't need to worry about managing the ZServer environment. However, this configuration will impose a larger overhead than simply using the web server as an HTTP proxy for ZServer. To use PCGI, configure your PCGI info files to communicate with ZServer by setting the PCGI_PORT, PCGI_SOCKET_FILE, and PCGI_NAME. The other PCGI settings are currently ignored by ZServer. ZServer's PCGI support will work with mod_pcgi. ZServer monitor server ZServer now includes the Medusa monitor server. This basically gives you a remote, secure Python prompt. You can interactively access Zope. This is a very powerful, but dangerous tool. Be careful. To use the monitor server specify a monitor port number using the -m option with the z2.py start script. The default port is 9999. To connect to the monitor server use the 'ZServer/medusa/monitor_client.py' or 'ZServer/medusa/monitor_client_win32.py' script. For example:: $ python1.5.2 ZServer/medusa/monitor_client.py localhost 9999 You will then be asked to enter a password. This is the Zope super manager password which is stored in the 'access' file. Then you will be greeted with a Python prompt. To access Zope import the Zope module:: >>> import Zope The Zope top level Zope object is available via the 'Zope.app' function:: >>> a=Zope.app() From this object you can reach all other Zope objects as subobjects. Remember if you make changes to Zope objects and want those changes to be saved you need to commmit the transaction:: >>> get_transaction().commit() ZServer WebDAV support WebDAV is a new protocol for managing web resources. WebDAV operates over HTTP. Since WebDAV uses HTTP, ZServer doesn't really have to do anything special, except stay out of Zope's way when handling WebDAV requests. The only major WebDAV client at this time is Internet Explorer 5. It works with Zope. Differences between ZopeHTTPServer and ZServer ZopeHTTPServer is old and no longer being actively maintained. Both ZopeHTTPServer and ZServer are Python HTTP servers. ZopeHTTPServer is built on the standard Python SimpleHTTPServer framework. ZServer is built on Medusa. ZopeHTTPServer is very limited. It can only publish one module at a time. It can only publish via HTTP. It has no support for thread pools. ZServer on the other hand is more complex and supports publishing multiple modules, thread pools, and it uses a new threaded architecture for accessing ZPublisher. Running ZServer as nobody Normally ZServer will run with the userid of the user who starts it. However, if ZServer is started by root, it will attempt to become nobody or any userid you specify with the -w argument to the z2.py start script. ZServer is similar to ZopeHTTPServer in these respects. If you run Zope with different userids you must be aware of permission issues. Zope must be able to read and write to the 'var' directory. If you change the userid Zope is running under you will probably need to change the permissions on the 'var' directory and the files in it in order for Zope to run under a different userid. Support Questions and comments should go to 'support@digicool.com'. You can report bugs and check on the status of bugs using the Zope bug collector:: http://www.zope.org/Collector/ License ZServer is covered by the ZPL despite the fact that it comes with much of the Medusa source code. The portions of Medusa that come with ZServer are licensed under the ZPL. Outstanding issues The FTP interface for Zope objects may be changed. HTTP 1.1 support is ZServer is incomplete, though it should work for most HTTP 1.1 clients. Zope-2.0.1-ZEO-nonbin/ZServer/ZService.py100644 1007 1403 25722 6751351040 20041 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ ZServer as a NT service. The serice starts up and monitors a ZServer process. Features: * When you start the service it starts ZServer * When you stop the serivice it stops ZServer * It monitors ZServer and restarts it if it exits abnormally * If ZServer is shutdown from the web, the service stops. * If ZServer cannot be restarted, the service stops. Usage: Installation The ZServer service should be installed by the Zope Windows installer. You can manually install, uninstall the service from the commandline. ZService.py [options] install|update|remove|start [...] |stop|restart [...]|debug [...] Options for 'install' and 'update' commands only: --username domain\username : The Username the service is to run under --password password : The password for the username --startup [manual|auto|disabled] : How the service starts, default = manual Commands install : Installs the service update : Updates the service, use this when you change ZServer.py remove : Removes the service start : Starts the service, this can also be done from the services control panel stop : Stops the service, this can also be done from the services control panel restart : Restarts the service debug : Runs the service in debug mode You can view the usage options by running ZServer.py without any arguments. Note: you may have to register the Python service program first, win32\pythonservice.exe /register Starting Zope Start Zope by clicking the 'start' button in the services control panel. You can set Zope to automatically start at boot time by choosing 'Auto' startup by clicking the 'statup' button. Stopping Zope Stop Zope by clicking the 'stop' button in the services control panel. You can also stop Zope through the web by going to the Zope control panel and by clicking 'Shutdown'. Event logging Zope events are logged to the NT application event log. Use the event viewer to keep track of Zope events. Registry Settings You can change how the service starts ZServer by editing a registry key. HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\Services\ \Parameters\start The value of this key is the command which the service uses to start ZServer. For example: "C:\Program Files\Zope\bin\python.exe" "C:\Program Files\Zope\z2.py" -w 8888 TODO: * Integrate it into the Windows installer. * Add ZLOG logging in addition to event log logging. * Make it easier to run multiple Zope services with one Zope install This script does for NT the same sort of thing zdaemon.py does for UNIX. Requires Python win32api extensions. """ import sys, os, string, time, imp # Some fancy path footwork is required here because we # may be run from python.exe or lib/win32/PythonService.exe home=os.path.split(os.path.split(sys.executable)[0])[0] if sys.executable[-10:]!='python.exe': home=os.path.split(home)[0] home=os.path.split(home)[0] sys.path.append(os.path.join(home, 'bin')) sys.path.append(os.path.join(home, 'ZServer')) sys.path.append(os.path.join(home, 'bin', 'lib', 'win32')) sys.path.append(os.path.join(home, 'bin', 'lib', 'win32', 'lib')) # pythoncom and pywintypes are special, and require these hacks when # we dont have a standard Python installation around. import win32api def magic_import(modulename, filename): # by Mark Hammond try: # See if it does import first! return __import__(modulename) except ImportError: pass # win32 can find the DLL name. h = win32api.LoadLibrary(filename) found = win32api.GetModuleFileName(h) # Python can load the module mod = imp.load_module(modulename, None, found, ('.dll', 'rb', imp.C_EXTENSION)) # inject it into the global module list. sys.modules[modulename] = mod # And finally inject it into the namespace. globals()[modulename] = mod win32api.FreeLibrary(h) magic_import('pywintypes','pywintypes15.dll') import win32serviceutil, win32service, win32event, win32process try: import servicemanager except: pass class ZServerService(win32serviceutil.ServiceFramework): # Some trickery to determine the service name. The WISE # installer will write an svcname.txt to the ZServer dir # that we can use to figure out our service name. path=os.path.join(home, 'ZServer', 'svcname.txt') file=open(path, 'r') _svc_name_=string.strip(file.readline()) file.close() _svc_display_name_ = "Zope (%s)" % _svc_name_ restart_min_time=5 # if ZServer restarts before this many # seconds then we have a problem, and # need to stop the service. def __init__(self, args): win32serviceutil.ServiceFramework.__init__(self, args) self.hWaitStop = win32event.CreateEvent(None, 0, 0, None) def SvcDoRun(self): self.start_zserver() while 1: rc=win32event.WaitForMultipleObjects( (self.hWaitStop, self.hZServer), 0, win32event.INFINITE) if rc - win32event.WAIT_OBJECT_0 == 0: break else: self.restart_zserver() self.ReportServiceStatus(win32service.SERVICE_STOP_PENDING, 5000) def SvcStop(self): servicemanager.LogInfoMsg('Stopping Zope.') try: self.stop_zserver() except: pass self.ReportServiceStatus(win32service.SERVICE_STOP_PENDING) win32event.SetEvent(self.hWaitStop) def start_zserver(self): sc=self.get_start_command() result=win32process.CreateProcess(None, self.get_start_command(), None, None, 0, 0, None, None, win32process.STARTUPINFO()) self.hZServer=result[0] self.last_start_time=time.time() servicemanager.LogInfoMsg('Starting Zope.') def stop_zserver(self): win32process.TerminateProcess(self.hZServer,0) def restart_zserver(self): if time.time() - self.last_start_time < self.restart_min_time: servicemanager.LogErrorMsg('Zope died and could not be restarted.') self.SvcStop() code=win32process.GetExitCodeProcess(self.hZServer) if code == 0: # Exited with a normal status code, # assume that shutdown is intentional. self.SvcStop() else: servicemanager.LogWarningMsg('Restarting Zope.') self.start_zserver() def get_start_command(self): return win32serviceutil.GetServiceCustomOption(self,'start') def set_start_command(value): "sets the ZServer start command" win32serviceutil.SetServiceCustomOption(ZServerService,'start',value) if __name__=='__main__': win32serviceutil.HandleCommandLine(ZServerService) if 'install' in sys.argv: command='"%s" "%s" -S' % (sys.executable, os.path.join(home,'z2.py')) set_start_command(command) print "Setting ZServer start command to:", command Zope-2.0.1-ZEO-nonbin/ZServer/__init__.py100644 1007 1403 11736 6747613423 20061 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import sys from medusa import max_sockets, asyncore # We need to make sure *our* asyncore is *the* asyncore sys.modules['asyncore']=asyncore CONNECTION_LIMIT=max_sockets.max_select_sockets() ZSERVER_VERSION='1.1b1' try: import App.version_txt ZOPE_VERSION=App.version_txt.version_txt() except: ZOPE_VERSION='experimental' # Try to poke zLOG default logging into asyncore # XXX We should probably should do a better job of this, # however that would mean that ZServer required zLOG. try: from zLOG import LOG, register_subsystem, BLATHER, INFO, WARNING, ERROR register_subsystem('ZServer') severity={'info':INFO, 'warning':WARNING, 'error': ERROR} def log_info(self, message, type='info'): if message[:14]=='adding channel' or \ message[:15]=='closing channel': LOG('ZServer', BLATHER, message) else: LOG('ZServer', severity[type], message) from medusa import asyncore asyncore.dispatcher.log_info=log_info except: pass from medusa import resolver, logger, asyncore from HTTPServer import zhttp_server, zhttp_handler from PCGIServer import PCGIServer from FTPServer import FTPServer from PubCore import setNumberOfThreads from medusa.monitor import secure_monitor_server Zope-2.0.1-ZEO-nonbin/ZServer/medusa/ 40755 1007 1403 0 6772126757 17110 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/ZServer/medusa/__init__.py100644 1007 1403 70 6703245715 21241 0ustar petrillipetrilli"""This __init__.py file makes medusa into a package""" Zope-2.0.1-ZEO-nonbin/ZServer/medusa/asynchat.py100644 1007 1403 22366 6744661723 21416 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- # $Id: asynchat.py,v 1.9 1999/07/19 17:43:47 amos Exp $ # Author: Sam Rushing # ====================================================================== # Copyright 1996 by Sam Rushing # # All Rights Reserved # # Permission to use, copy, modify, and distribute this software and # its documentation for any purpose and without fee is hereby # granted, provided that the above copyright notice appear in all # copies and that both that copyright notice and this permission # notice appear in supporting documentation, and that the name of Sam # Rushing not be used in advertising or publicity pertaining to # distribution of the software without specific, written prior # permission. # # SAM RUSHING DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, # INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN # NO EVENT SHALL SAM RUSHING BE LIABLE FOR ANY SPECIAL, INDIRECT OR # CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS # OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, # NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN # CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. # ====================================================================== import socket import asyncore import string # This class adds support for 'chat' style protocols - where one side # sends a 'command', and the other sends a response (examples would be # the common internet protocols - smtp, nntp, ftp, etc..). # The handle_read() method looks at the input stream for the current # 'terminator' (usually '\r\n' for single-line responses, '\r\n.\r\n' # for multi-line output), calling self.found_terminator() on its # receipt. # for example: # Say you build an async nntp client using this class. At the start # of the connection, you'll have self.terminator set to '\r\n', in # order to process the single-line greeting. Just before issuing a # 'LIST' command you'll set it to '\r\n.\r\n'. The output of the LIST # command will be accumulated (using your own 'collect_incoming_data' # method) up to the terminator, and then control will be returned to # you - by calling your self.found_terminator() method class async_chat (asyncore.dispatcher): """This is an abstract class. You must derive from this class, and add the two methods collect_incoming_data() and found_terminator()""" # these are overridable defaults ac_in_buffer_size = 4096 ac_out_buffer_size = 4096 def __init__ (self, conn=None): self.ac_in_buffer = '' self.ac_out_buffer = '' self.producer_fifo = fifo() asyncore.dispatcher.__init__ (self, conn) def set_terminator (self, term): "Set the input delimiter. Can be a fixed string of any length, an integer, or None" self.terminator = term def get_terminator (self): return self.terminator # grab some more data from the socket, # throw it to the collector method, # check for the terminator, # if found, transition to the next state. def handle_read (self): try: data = self.recv (self.ac_in_buffer_size) except socket.error, why: self.handle_error() return self.ac_in_buffer = self.ac_in_buffer + data # Continue to search for self.terminator in self.ac_in_buffer, # while calling self.collect_incoming_data. The while loop # is necessary because we might read several data+terminator # combos with a single recv(1024). while self.ac_in_buffer: lb = len(self.ac_in_buffer) terminator = self.get_terminator() if terminator is None: # no terminator, collect it all self.collect_incoming_data (self.ac_in_buffer) self.ac_in_buffer = '' elif type(terminator) == type(0): # numeric terminator n = terminator if lb < n: self.collect_incoming_data (self.ac_in_buffer) self.ac_in_buffer = '' self.terminator = self.terminator - lb else: self.collect_incoming_data (self.ac_in_buffer[:n]) self.ac_in_buffer = self.ac_in_buffer[n:] self.terminator = 0 self.found_terminator() else: # 3 cases: # 1) end of buffer matches terminator exactly: # collect data, transition # 2) end of buffer matches some prefix: # collect data to the prefix # 3) end of buffer does not match any prefix: # collect data terminator_len = len(terminator) index = string.find (self.ac_in_buffer, terminator) if index != -1: # we found the terminator if index > 0: # don't bother reporting the empty string (source of subtle bugs) self.collect_incoming_data (self.ac_in_buffer[:index]) self.ac_in_buffer = self.ac_in_buffer[index+terminator_len:] # This does the Right Thing if the terminator is changed here. self.found_terminator() else: # check for a prefix of the terminator index = find_prefix_at_end (self.ac_in_buffer, terminator) if index: if index != lb: # we found a prefix, collect up to the prefix self.collect_incoming_data (self.ac_in_buffer[:-index]) self.ac_in_buffer = self.ac_in_buffer[-index:] break else: # no prefix, collect it all self.collect_incoming_data (self.ac_in_buffer) self.ac_in_buffer = '' def handle_write (self): self.initiate_send () def handle_close (self): self.close() def push (self, data): self.producer_fifo.push (simple_producer (data)) self.initiate_send() def push_with_producer (self, producer): self.producer_fifo.push (producer) self.initiate_send() def readable (self): "predicate for inclusion in the readable for select()" return (len(self.ac_in_buffer) <= self.ac_in_buffer_size) def writable (self): "predicate for inclusion in the writable for select()" # return len(self.ac_out_buffer) or len(self.producer_fifo) or (not self.connected) # this is about twice as fast, though not as clear. return not ( (self.ac_out_buffer is '') and self.producer_fifo.is_empty() and self.connected ) def close_when_done (self): "automatically close this channel once the outgoing queue is empty" self.producer_fifo.push (None) # refill the outgoing buffer by calling the more() method # of the first producer in the queue def refill_buffer (self): _string_type = type('') while 1: if len(self.producer_fifo): p = self.producer_fifo.first() # a 'None' in the producer fifo is a sentinel, # telling us to close the channel. if p is None: if not self.ac_out_buffer: self.producer_fifo.pop() self.close() return elif type(p) is _string_type: self.producer_fifo.pop() self.ac_out_buffer = self.ac_out_buffer + p return data = p.more() if data: self.ac_out_buffer = self.ac_out_buffer + data return else: self.producer_fifo.pop() else: return def initiate_send (self): obs = self.ac_out_buffer_size # try to refill the buffer if (len (self.ac_out_buffer) < obs): self.refill_buffer() if self.ac_out_buffer and self.connected: # try to send the buffer try: num_sent = self.send (self.ac_out_buffer[:obs]) if num_sent: self.ac_out_buffer = self.ac_out_buffer[num_sent:] except socket.error, why: self.handle_error() return def discard_buffers (self): # Emergencies only! self.ac_in_buffer = '' self.ac_out_buffer == '' while self.producer_fifo: self.producer_fifo.pop() class simple_producer: def __init__ (self, data, buffer_size=512): self.data = data self.buffer_size = buffer_size def more (self): if len (self.data) > self.buffer_size: result = self.data[:self.buffer_size] self.data = self.data[self.buffer_size:] return result else: result = self.data self.data = '' return result class fifo: def __init__ (self, list=None): if not list: self.list = [] else: self.list = list def __len__ (self): return len(self.list) def is_empty (self): return self.list == [] def first (self): return self.list[0] def push (self, data): self.list.append (data) def pop (self): if self.list: result = self.list[0] del self.list[0] return (1, result) else: return (0, None) # Given 'haystack', see if any prefix of 'needle' is at its end. This # assumes an exact match has already been checked. Return the number of # characters matched. # for example: # f_p_a_e ("qwerty\r", "\r\n") => 1 # f_p_a_e ("qwerty\r\n", "\r\n") => 2 # f_p_a_e ("qwertydkjf", "\r\n") => 0 # this could maybe be made faster with a computed regex? ##def find_prefix_at_end (haystack, needle): ## nl = len(needle) ## result = 0 ## for i in range (1,nl): ## if haystack[-(nl-i):] == needle[:(nl-i)]: ## result = nl-i ## break ## return result # yes, this is about twice as fast, but still seems # to be neglible CPU. The previous could do about 290 # searches/sec. the new one about 555/sec. import regex prefix_cache = {} def prefix_regex (needle): if prefix_cache.has_key (needle): return prefix_cache[needle] else: reg = needle[-1] for i in range(1,len(needle)): reg = '%c\(%s\)?' % (needle[-(i+1)], reg) reg = regex.compile (reg+'$') prefix_cache[needle] = reg, len(needle) return reg, len(needle) def find_prefix_at_end (haystack, needle): reg, length = prefix_regex (needle) lh = len(haystack) result = reg.search (haystack, max(0,lh-length)) if result >= 0: return (lh - result) else: return 0 Zope-2.0.1-ZEO-nonbin/ZServer/medusa/asyncore.py100644 1007 1403 26141 6747004374 21416 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- # $Id: asyncore.py,v 1.6 1999/07/26 07:06:36 amos Exp $ # Author: Sam Rushing # ====================================================================== # Copyright 1996 by Sam Rushing # # All Rights Reserved # # Permission to use, copy, modify, and distribute this software and # its documentation for any purpose and without fee is hereby # granted, provided that the above copyright notice appear in all # copies and that both that copyright notice and this permission # notice appear in supporting documentation, and that the name of Sam # Rushing not be used in advertising or publicity pertaining to # distribution of the software without specific, written prior # permission. # # SAM RUSHING DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, # INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN # NO EVENT SHALL SAM RUSHING BE LIABLE FOR ANY SPECIAL, INDIRECT OR # CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS # OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, # NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN # CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. # ====================================================================== import select import socket import string import sys import os if os.name == 'nt': EWOULDBLOCK = 10035 EINPROGRESS = 10036 EALREADY = 10037 ECONNRESET = 10054 ENOTCONN = 10057 ESHUTDOWN = 10058 else: from errno import EALREADY, EINPROGRESS, EWOULDBLOCK, ECONNRESET, ENOTCONN, ESHUTDOWN socket_map = {} def poll (timeout=0.0): if socket_map: r = []; w = []; e = [] for s in socket_map.keys(): if s.readable(): r.append (s) if s.writable(): w.append (s) (r,w,e) = select.select (r,w,e, timeout) for x in r: try: x.handle_read_event() except: x.handle_error() for x in w: try: x.handle_write_event() except: x.handle_error() def poll2 (timeout=0.0): import poll # timeout is in milliseconds timeout = int(timeout*1000) if socket_map: fd_map = {} for s in socket_map.keys(): fd_map[s.fileno()] = s l = [] for fd, s in fd_map.items(): flags = 0 if s.readable(): flags = poll.POLLIN if s.writable(): flags = flags | poll.POLLOUT if flags: l.append (fd, flags) r = poll.poll (l, timeout) for fd, flags in r: s = fd_map[fd] try: if (flags & poll.POLLIN): s.handle_read_event() if (flags & poll.POLLOUT): s.handle_write_event() if (flags & poll.POLLERR): s.handle_expt_event() except: s.handle_error() def loop (timeout=30.0, use_poll=0): if use_poll: poll_fun = poll2 else: poll_fun = poll while socket_map: poll_fun (timeout) class dispatcher: debug = 0 connected = 0 accepting = 0 closing = 0 addr = None def __init__ (self, sock=None): if sock: self.set_socket (sock) # I think it should inherit this anyway self.socket.setblocking (0) self.connected = 1 def __repr__ (self): try: status = [] if self.accepting and self.addr: status.append ('listening') elif self.connected: status.append ('connected') if self.addr: status.append ('%s:%d' % self.addr) return '<%s %s at %x>' % ( self.__class__.__name__, string.join (status, ' '), id(self) ) except: try: ar = repr(self.addr) except: ar = 'no self.addr!' return '<__repr__ (self) failed for object at %x (addr=%s)>' % (id(self),ar) def add_channel (self): self.log_info ('adding channel %s' % self) socket_map [self] = 1 def del_channel (self): if socket_map.has_key (self): self.log_info ('closing channel %d:%s' % (self.fileno(), self)) del socket_map [self] def create_socket (self, family, type): self.family_and_type = family, type self.socket = socket.socket (family, type) self.socket.setblocking(0) self.add_channel() def set_socket (self, socket): # This is done so we can be called safely from __init__ self.__dict__['socket'] = socket self.add_channel() def set_reuse_addr (self): # try to re-use a server port if possible try: self.socket.setsockopt ( socket.SOL_SOCKET, socket.SO_REUSEADDR, self.socket.getsockopt (socket.SOL_SOCKET, socket.SO_REUSEADDR) | 1 ) except: pass # ================================================== # predicates for select() # these are used as filters for the lists of sockets # to pass to select(). # ================================================== def readable (self): return 1 if os.name == 'mac': # The macintosh will select a listening socket for # write if you let it. What might this mean? def writable (self): return not self.accepting else: def writable (self): return 1 # ================================================== # socket object methods. # ================================================== def listen (self, num): self.accepting = 1 if os.name == 'nt' and num > 5: num = 1 return self.socket.listen (num) def bind (self, addr): self.addr = addr return self.socket.bind (addr) def connect (self, address): self.connected = 0 try: self.socket.connect (address) except socket.error, why: if why[0] in (EINPROGRESS, EALREADY, EWOULDBLOCK): return else: raise socket.error, why self.connected = 1 self.handle_connect() def accept (self): try: conn, addr = self.socket.accept() return conn, addr except socket.error, why: if why[0] == EWOULDBLOCK: pass else: raise socket.error, why def send (self, data): try: result = self.socket.send (data) return result except socket.error, why: if why[0] == EWOULDBLOCK: return 0 else: raise socket.error, why return 0 def recv (self, buffer_size): try: data = self.socket.recv (buffer_size) if not data: # a closed connection is indicated by signaling # a read condition, and having recv() return 0. self.handle_close() return '' else: return data except socket.error, why: # winsock sometimes throws ENOTCONN if why[0] in [ECONNRESET, ENOTCONN, ESHUTDOWN]: self.handle_close() return '' else: raise socket.error, why def close (self): self.del_channel() self.socket.close() # cheap inheritance, used to pass all other attribute # references to the underlying socket object. # NOTE: this may be removed soon for performance reasons. def __getattr__ (self, attr): return getattr (self.socket, attr) # log and log_info maybe overriden to provide more sophisitcated # logging and warning methods. In general, log is for 'hit' logging # and 'log_info' is for informational, warning and error logging. def log (self, message): print 'log:', message def log_info (self, message, type='info'): if __debug__ or type != 'info': print '%s: %s' %(type, message) def handle_read_event (self): if self.accepting: # for an accepting socket, getting a read implies # that we are connected if not self.connected: self.connected = 1 self.handle_accept() elif not self.connected: self.handle_connect() self.connected = 1 self.handle_read() else: self.handle_read() def handle_write_event (self): # getting a write implies that we are connected if not self.connected: self.handle_connect() self.connected = 1 self.handle_write() def handle_expt_event (self): self.handle_expt() def handle_error (self): (file,fun,line), t, v, tbinfo = compact_traceback() # sometimes a user repr method will crash. try: self_repr = repr (self) except: self_repr = '<__repr__ (self) failed for object at %0x>' % id(self) self.log_info ( 'uncaptured python exception, closing channel %s (%s:%s %s)' % ( self_repr, t, v, tbinfo ), 'error' ) self.close() def handle_expt (self): self.log_info ('unhandled exception', 'warning') def handle_read (self): self.log_info ('unhandled read event', 'warning') def handle_write (self): self.log_info ('unhandled write event', 'warning') def handle_connect (self): self.log_info ('unhandled connect event', 'warning') def handle_accept (self): self.log_info ('unhandled accept event', 'warning') def handle_close (self): self.log_info ('unhandled close event', 'warning') self.close() # --------------------------------------------------------------------------- # adds simple buffered output capability, useful for simple clients. # [for more sophisticated usage use asynchat.async_chat] # --------------------------------------------------------------------------- class dispatcher_with_send (dispatcher): def __init__ (self, sock=None): dispatcher.__init__ (self, sock) self.out_buffer = '' def initiate_send (self): num_sent = 0 num_sent = dispatcher.send (self, self.out_buffer[:512]) self.out_buffer = self.out_buffer[num_sent:] def handle_write (self): self.initiate_send() def writable (self): return (not self.connected) or len(self.out_buffer) def send (self, data): if self.debug: self.log_info ('sending %s' % repr(data)) self.out_buffer = self.out_buffer + data self.initiate_send() # --------------------------------------------------------------------------- # used for debugging. # --------------------------------------------------------------------------- def compact_traceback (): t,v,tb = sys.exc_info() tbinfo = [] while 1: tbinfo.append ( tb.tb_frame.f_code.co_filename, tb.tb_frame.f_code.co_name, str(tb.tb_lineno) ) tb = tb.tb_next if not tb: break # just to be safe del tb file, function, line = tbinfo[-1] info = '[' + string.join ( map ( lambda x: string.join (x, '|'), tbinfo ), '] [' ) + ']' return (file, function, line), t, v, info def close_all (): global socket_map for x in socket_map.keys(): x.socket.close() socket_map.clear() # Asynchronous File I/O: # # After a little research (reading man pages on various unixen, and # digging through the linux kernel), I've determined that select() # isn't meant for doing doing asynchronous file i/o. # Heartening, though - reading linux/mm/filemap.c shows that linux # supports asynchronous read-ahead. So _MOST_ of the time, the data # will be sitting in memory for us already when we go to read it. # # What other OS's (besides NT) support async file i/o? [VMS?] # # Regardless, this is useful for pipes, and stdin/stdout... import os if os.name == 'posix': import fcntl import FCNTL class file_wrapper: # here we override just enough to make a file # look like a socket for the purposes of asyncore. def __init__ (self, fd): self.fd = fd def recv (self, *args): return apply (os.read, (self.fd,)+args) def write (self, *args): return apply (os.write, (self.fd,)+args) def close (self): return os.close (self.fd) def fileno (self): return self.fd class file_dispatcher (dispatcher): def __init__ (self, fd): dispatcher.__init__ (self) self.connected = 1 # set it to non-blocking mode flags = fcntl.fcntl (fd, FCNTL.F_GETFL, 0) flags = flags | FCNTL.O_NONBLOCK fcntl.fcntl (fd, FCNTL.F_SETFL, flags) self.set_file (fd) def set_file (self, fd): self.socket = file_wrapper (fd) self.add_channel() Zope-2.0.1-ZEO-nonbin/ZServer/medusa/counter.py100644 1007 1403 2352 6703245715 21226 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- # It is tempting to add an __int__ method to this class, but it's not # a good idea. This class tries to gracefully handle integer # overflow, and to hide this detail from both the programmer and the # user. Note that the __str__ method can be relied on for printing out # the value of a counter: # # >>> print 'Total Client: %s' % self.total_clients # # If you need to do arithmetic with the value, then use the 'as_long' # method, the use of long arithmetic is a reminder that the counter # will overflow. class counter: "general-purpose counter" def __init__ (self, initial_value=0): self.value = initial_value def increment (self, delta=1): result = self.value try: self.value = self.value + delta except OverflowError: self.value = long(self.value) + delta return result def decrement (self, delta=1): result = self.value try: self.value = self.value - delta except OverflowError: self.value = long(self.value) - delta return result def as_long (self): return long(self.value) def __nonzero__ (self): return self.value != 0 def __repr__ (self): return '' % (self.value, id(self)) def __str__ (self): return str(long(self.value))[:-1] Zope-2.0.1-ZEO-nonbin/ZServer/medusa/default_handler.py100644 1007 1403 14140 6703245715 22706 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- # # Author: Sam Rushing # Copyright 1997 by Sam Rushing # All Rights Reserved. # # This software is provided free for non-commercial use. If you are # interested in using this software in a commercial context, or in # purchasing support, please contact the author. RCS_ID = '$Id: default_handler.py,v 1.2 1999/04/09 00:37:33 amos Exp $' # standard python modules import os import regex import posixpath import stat import string import time # medusa modules import http_date import http_server import mime_type_table import status_handler import producers # from _quoteprog = regex.compile('%[0-9a-fA-F][0-9a-fA-F]') def unquote(s): i = 0 n = len(s) res = [] while 0 <= i < n: j = _quoteprog.search(s, i) if j < 0: res.append(s[i:]) break res.append(s[i:j] + chr(string.atoi(s[j+1:j+3], 16))) i = j+3 return string.join (res, '') # split a uri # ;?# path_regex = regex.compile ( # path params query fragment '\\([^;?#]*\\)\\(;[^?#]*\\)?\\(\\?[^#]*\)?\(#.*\)?' ) def split_path (path): if path_regex.match (path) != len(path): raise ValueError, "bad path" else: return map (lambda i,r=path_regex: r.group(i), range(1,5)) # This is the 'default' handler. it implements the base set of # features expected of a simple file-delivering HTTP server. file # services are provided through a 'filesystem' object, the very same # one used by the FTP server. # # You can replace or modify this handler if you want a non-standard # HTTP server. You can also derive your own handler classes from # it. # # support for handling POST requests is available in the derived # class , defined below. # from counter import counter class default_handler: valid_commands = ['get', 'head'] IDENT = 'Default HTTP Request Handler' # Pathnames that are tried when a URI resolves to a directory name directory_defaults = [ 'index.html', 'default.html' ] default_file_producer = producers.file_producer def __init__ (self, filesystem): self.filesystem = filesystem # count total hits self.hit_counter = counter() # count file deliveries self.file_counter = counter() # count cache hits self.cache_counter = counter() hit_counter = 0 def __repr__ (self): return '<%s (%s hits) at %x>' % ( self.IDENT, self.hit_counter, id (self) ) # always match, since this is a default def match (self, request): return 1 # handle a file request, with caching. def handle_request (self, request): if request.command not in self.valid_commands: request.error (400) # bad request return self.hit_counter.increment() [path, params, query, fragment] = split_path (request.uri) # unquote path if necessary (thanks to Skip Montaro for pointing # out that we must unquote in piecemeal fashion). if '%' in path: path = unquote (path) # strip off all leading slashes while path and path[0] == '/': path = path[1:] if self.filesystem.isdir (path): if path and path[-1] != '/': request['Location'] = 'http://%s/%s/' % ( request.channel.server.server_name, path ) request.error (301) return # we could also generate a directory listing here, # may want to move this into another method for that # purpose found = 0 if path and path[-1] != '/': path = path + '/' for default in self.directory_defaults: p = path + default if self.filesystem.isfile (p): path = p found = 1 break if not found: request.error (404) # Not Found return elif not self.filesystem.isfile (path): request.error (404) # Not Found return file_length = self.filesystem.stat (path)[stat.ST_SIZE] ims = get_header (IF_MODIFIED_SINCE, request.header) length_match = 1 if ims: length = IF_MODIFIED_SINCE.group(4) if length: try: length = string.atoi (length) if length != file_length: length_match = 0 except: pass ims_date = 0 if ims: ims_date = http_date.parse_http_date (ims) try: mtime = self.filesystem.stat (path)[stat.ST_MTIME] except: request.error (404) return if length_match and ims_date: if mtime <= ims_date: request.reply_code = 304 request.done() self.cache_counter.increment() return try: file = self.filesystem.open (path, 'rb') except IOError: request.error (404) return request['Last-Modified'] = http_date.build_http_date (mtime) request['Content-Length'] = file_length self.set_content_type (path, request) if request.command == 'get': request.push (self.default_file_producer (file)) self.file_counter.increment() request.done() def set_content_type (self, path, request): ext = string.lower (get_extension (path)) if mime_type_table.content_type_map.has_key (ext): request['Content-Type'] = mime_type_table.content_type_map[ext] else: # TODO: test a chunk off the front of the file for 8-bit # characters, and use application/octet-stream instead. request['Content-Type'] = 'text/plain' def status (self): return producers.simple_producer ( '
  • %s' % status_handler.html_repr (self) + '
      ' + '
    • Total Hits: %s' % self.hit_counter + '
    • Files Delivered: %s' % self.file_counter + '
    • Cache Hits: %s' % self.cache_counter + '
    ' ) ACCEPT = regex.compile ('Accept: \(.*\)', regex.casefold) # HTTP/1.0 doesn't say anything about the "; length=nnnn" addition # to this header. I suppose it's purpose is to avoid the overhead # of parsing dates... IF_MODIFIED_SINCE = regex.compile ( 'If-Modified-Since: \([^;]+\)\(\(; length=\([0-9]+\)$\)\|$\)', regex.casefold ) USER_AGENT = regex.compile ('User-Agent: \(.*\)', regex.casefold) boundary_chars = "A-Za-z0-9'()+_,./:=?-" CONTENT_TYPE = regex.compile ( 'Content-Type: \([^;]+\)\(\(; boundary=\([%s]+\)$\)\|$\)' % boundary_chars, regex.casefold ) get_header = http_server.get_header def get_extension (path): dirsep = string.rfind (path, '/') dotsep = string.rfind (path, '.') if dotsep > dirsep: return path[dotsep+1:] else: return '' Zope-2.0.1-ZEO-nonbin/ZServer/medusa/filesys.py100644 1007 1403 25523 6733464266 21261 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- # $Id: filesys.py,v 1.3 1999/06/21 16:30:46 amos Exp $ # Author: Sam Rushing # # Generic filesystem interface. # # We want to provide a complete wrapper around any and all # filesystem operations. # this class is really just for documentation, # identifying the API for a filesystem object. # opening files for reading, and listing directories, should # return a producer. class abstract_filesystem: def __init__ (self): pass def current_directory (self): "Return a string representing the current directory." pass def listdir (self, path, long=0): """Return a listing of the directory at 'path' The empty string indicates the current directory. If 'long' is set, instead return a list of (name, stat_info) tuples """ pass def open (self, path, mode): "Return an open file object" pass def stat (self, path): "Return the equivalent of os.stat() on the given path." pass def isdir (self, path): "Does the path represent a directory?" pass def isfile (self, path): "Does the path represent a plain file?" pass def cwd (self, path): "Change the working directory." pass def cdup (self): "Change to the parent of the current directory." pass def longify (self, path): """Return a 'long' representation of the filename [for the output of the LIST command]""" pass # standard wrapper around a unix-like filesystem, with a 'false root' # capability. # security considerations: can symbolic links be used to 'escape' the # root? should we allow it? if not, then we could scan the # filesystem on startup, but that would not help if they were added # later. We will probably need to check for symlinks in the cwd method. # what to do if wd is an invalid directory? import os import stat import string def safe_stat (path): try: return (path, os.stat (path)) except: return None import regex import regsub import glob class os_filesystem: path_module = os.path # set this to zero if you want to disable pathname globbing. # [we currently don't glob, anyway] do_globbing = 1 def __init__ (self, root, wd='/'): self.root = root self.wd = wd def current_directory (self): return self.wd def isfile (self, path): p = self.normalize (self.path_module.join (self.wd, path)) return self.path_module.isfile (self.translate(p)) def isdir (self, path): p = self.normalize (self.path_module.join (self.wd, path)) return self.path_module.isdir (self.translate(p)) def cwd (self, path): p = self.normalize (self.path_module.join (self.wd, path)) translated_path = self.translate(p) if not self.path_module.isdir (translated_path): return 0 else: old_dir = os.getcwd() # temporarily change to that directory, in order # to see if we have permission to do so. try: can = 0 try: os.chdir (translated_path) can = 1 self.wd = p except: pass finally: if can: os.chdir (old_dir) return can def cdup (self): return self.cwd ('..') def listdir (self, path, long=0): p = self.translate (path) # I think we should glob, but limit it to the current # directory only. ld = os.listdir (p) if not long: return list_producer (ld, 0, None) else: old_dir = os.getcwd() try: os.chdir (p) # if os.stat fails we ignore that file. result = filter (None, map (safe_stat, ld)) finally: os.chdir (old_dir) return list_producer (result, 1, self.longify) # TODO: implement a cache w/timeout for stat() def stat (self, path): p = self.translate (path) return os.stat (p) def open (self, path, mode): p = self.translate (path) return open (p, mode) def unlink (self, path): p = self.translate (path) return os.unlink (p) def mkdir (self, path): p = self.translate (path) return os.mkdir (p) def rmdir (self, path): p = self.translate (path) return os.rmdir (p) # utility methods def normalize (self, path): # watch for the ever-sneaky '/+' path element path = regsub.gsub ('/+', '/', path) p = self.path_module.normpath (path) # remove 'dangling' cdup's. if len(p) > 2 and p[:3] == '/..': p = '/' return p def translate (self, path): # we need to join together three separate # path components, and do it safely. # // # use the operating system's path separator. path = string.join (string.split (path, '/'), os.sep) p = self.normalize (self.path_module.join (self.wd, path)) p = self.normalize (self.path_module.join (self.root, p[1:])) return p def longify (self, (path, stat_info)): return unix_longify (path, stat_info) def __repr__ (self): return '' % ( self.root, self.wd ) if os.name == 'posix': class unix_filesystem (os_filesystem): pass class schizophrenic_unix_filesystem (os_filesystem): PROCESS_UID = os.getuid() PROCESS_EUID = os.geteuid() PROCESS_GID = os.getgid() PROCESS_EGID = os.getegid() def __init__ (self, root, wd='/', persona=(None, None)): os_filesystem.__init__ (self, root, wd) self.persona = persona def become_persona (self): if self.persona is not (None, None): uid, gid = self.persona # the order of these is important! os.setegid (gid) os.seteuid (uid) def become_nobody (self): if self.persona is not (None, None): os.seteuid (self.PROCESS_UID) os.setegid (self.PROCESS_GID) # cwd, cdup, open, listdir def cwd (self, path): try: self.become_persona() return os_filesystem.cwd (self, path) finally: self.become_nobody() def cdup (self, path): try: self.become_persona() return os_filesystem.cdup (self) finally: self.become_nobody() def open (self, filename, mode): try: self.become_persona() return os_filesystem.open (self, filename, mode) finally: self.become_nobody() def listdir (self, path, long=0): try: self.become_persona() return os_filesystem.listdir (self, path, long) finally: self.become_nobody() # This hasn't been very reliable across different platforms. # maybe think about a separate 'directory server'. # # import posixpath # import fcntl # import FCNTL # import select # import asyncore # # # pipes /bin/ls for directory listings. # class unix_filesystem (os_filesystem): # pass # path_module = posixpath # # def listdir (self, path, long=0): # p = self.translate (path) # if not long: # return list_producer (os.listdir (p), 0, None) # else: # command = '/bin/ls -l %s' % p # print 'opening pipe to "%s"' % command # fd = os.popen (command, 'rt') # return pipe_channel (fd) # # # this is both a dispatcher, _and_ a producer # class pipe_channel (asyncore.file_dispatcher): # buffer_size = 4096 # # def __init__ (self, fd): # asyncore.file_dispatcher.__init__ (self, fd) # self.fd = fd # self.done = 0 # self.data = '' # # def handle_read (self): # if len (self.data) < self.buffer_size: # self.data = self.data + self.fd.read (self.buffer_size) # #print '%s.handle_read() => len(self.data) == %d' % (self, len(self.data)) # # def handle_expt (self): # #print '%s.handle_expt()' % self # self.done = 1 # # def ready (self): # #print '%s.ready() => %d' % (self, len(self.data)) # return ((len (self.data) > 0) or self.done) # # def more (self): # if self.data: # r = self.data # self.data = '' # elif self.done: # self.close() # self.downstream.finished() # r = '' # else: # r = None # #print '%s.more() => %s' % (self, (r and len(r))) # return r # For the 'real' root, we could obtain a list of drives, and then # use that. Doesn't win32 provide such a 'real' filesystem? # [yes, I think something like this "\\.\c\windows"] class msdos_filesystem (os_filesystem): def longify (self, (path, stat_info)): return msdos_longify (path, stat_info) # A merged filesystem will let you plug other filesystems together. # We really need the equivalent of a 'mount' capability - this seems # to be the most general idea. So you'd use a 'mount' method to place # another filesystem somewhere in the hierarchy. # Note: this is most likely how I will handle ~user directories # with the http server. class merged_filesystem: def __init__ (self, *fsys): pass # this matches the output of NT's ftp server (when in # MSDOS mode) exactly. def msdos_longify (file, stat_info): if stat.S_ISDIR (stat_info[stat.ST_MODE]): dir = '' else: dir = ' ' date = msdos_date (stat_info[stat.ST_MTIME]) return '%s %s %8d %s' % ( date, dir, stat_info[stat.ST_SIZE], file ) def msdos_date (t): try: info = time.gmtime (t) except: info = time.gmtime (0) # year, month, day, hour, minute, second, ... if info[3] > 11: merid = 'PM' info[3] = info[3] - 12 else: merid = 'AM' return '%02d-%02d-%02d %02d:%02d%s' % ( info[1], info[2], info[0]%100, info[3], info[4], merid ) months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec'] mode_table = { '0':'---', '1':'--x', '2':'-w-', '3':'-wx', '4':'r--', '5':'r-x', '6':'rw-', '7':'rwx' } import time def unix_longify (file, stat_info): # for now, only pay attention to the lower bits mode = ('%o' % stat_info[stat.ST_MODE])[-3:] mode = string.join (map (lambda x: mode_table[x], mode), '') if stat.S_ISDIR (stat_info[stat.ST_MODE]): dirchar = 'd' else: dirchar = '-' date = ls_date (long(time.time()), stat_info[stat.ST_MTIME]) return '%s%s %3d %-8s %-8s %8d %s %s' % ( dirchar, mode, stat_info[stat.ST_NLINK], stat_info[stat.ST_UID], stat_info[stat.ST_GID], stat_info[stat.ST_SIZE], date, file ) # Emulate the unix 'ls' command's date field. # it has two formats - if the date is more than 180 # days in the past, then it's like this: # Oct 19 1995 # otherwise, it looks like this: # Oct 19 17:33 def ls_date (now, t): try: info = time.gmtime (t) except: info = time.gmtime (0) # 15,600,000 == 86,400 * 180 if (now - t) > 15600000: return '%s %2d %d' % ( months[info[1]-1], info[2], info[0] ) else: return '%s %2d %02d:%02d' % ( months[info[1]-1], info[2], info[3], info[4] ) # =========================================================================== # Producers # =========================================================================== class list_producer: def __init__ (self, file_list, long, longify): self.file_list = file_list self.long = long self.longify = longify self.done = 0 def ready (self): if len(self.file_list): return 1 else: if not self.done: self.done = 1 return 0 return (len(self.file_list) > 0) # this should do a pushd/popd def more (self): if not self.file_list: return '' else: # do a few at a time bunch = self.file_list[:50] if self.long: bunch = map (self.longify, bunch) self.file_list = self.file_list[50:] return string.joinfields (bunch, '\r\n') + '\r\n' Zope-2.0.1-ZEO-nonbin/ZServer/medusa/ftp_server.py100755 1007 1403 76531 6747004573 21766 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- # Author: Sam Rushing # Copyright 1996 by Sam Rushing # All Rights Reserved. # # This software is provided free for non-commercial use. # If you are interested in using this software in a commercial context, # or in purchasing support, please contact the author. RCS_ID = '$Id: ftp_server.py,v 1.7 1999/07/26 07:08:43 amos Exp $' # An extensible, configurable, asynchronous FTP server. # # All socket I/O is non-blocking, however file I/O is currently # blocking. Eventually file I/O may be made non-blocking, too, if it # seems necessary. Currently the only CPU-intensive operation is # getting and formatting a directory listing. [this could be moved # into another process/directory server, or another thread?] # # Only a subset of RFC 959 is implemented, but much of that RFC is # vestigial anyway. I've attempted to include the most commonly-used # commands, using the feature set of wu-ftpd as a guide. import asyncore import asynchat import os import regsub import socket import stat import string import sys import time # TODO: implement a directory listing cache. On very-high-load # servers this could save a lot of disk abuse, and possibly the # work of computing emulated unix ls output. # Potential security problem with the FTP protocol? I don't think # there's any verification of the origin of a data connection. Not # really a problem for the server (since it doesn't send the port # command, except when in PASV mode) But I think a data connection # could be spoofed by a program with access to a sniffer - it could # watch for a PORT command to go over a command channel, and then # connect to that port before the server does. # Unix user id's: # In order to support assuming the id of a particular user, # it seems there are two options: # 1) fork, and seteuid in the child # 2) carefully control the effective uid around filesystem accessing # methods, using try/finally. [this seems to work] VERSION = string.split(RCS_ID)[2] from counter import counter import producers import status_handler import logger import string class ftp_channel (asynchat.async_chat): # defaults for a reliable __repr__ addr = ('unknown','0') # unset this in a derived class in order # to enable the commands in 'self.write_commands' read_only = 1 write_commands = ['appe','dele','mkd','rmd','rnfr','rnto','stor','stou'] restart_position = 0 def __init__ (self, server, conn, addr): self.server = server self.current_mode = 'a' self.addr = addr asynchat.async_chat.__init__ (self, conn) self.set_terminator ('\r\n') # client data port. Defaults to 'the same as the control connection'. self.client_addr = (addr[0], 21) self.client_dc = None self.in_buffer = '' self.closing = 0 self.passive_acceptor = None self.passive_connection = None self.filesystem = None self.authorized = 0 # send the greeting self.respond ( '220 %s FTP server (Medusa Async V%s [experimental]) ready.' % ( self.server.hostname, VERSION ) ) # def __del__ (self): # print 'ftp_channel.__del__()' # -------------------------------------------------- # async-library methods # -------------------------------------------------- def handle_expt (self): # this is handled below. not sure what I could # do here to make that code less kludgish. pass def collect_incoming_data (self, data): self.in_buffer = self.in_buffer + data if len(self.in_buffer) > 4096: # silently truncate really long lines # (possible denial-of-service attack) self.in_buffer = '' def found_terminator (self): line = self.in_buffer if not len(line): return sp = string.find (line, ' ') if sp != -1: line = [line[:sp], line[sp+1:]] else: line = [line] command = string.lower (line[0]) # watch especially for 'urgent' abort commands. if string.find (command, 'abor') != -1: # strip off telnet sync chars and the like... while command and command[0] not in string.letters: command = command[1:] fun_name = 'cmd_%s' % command if command != 'pass': self.log ('<== %s' % repr(self.in_buffer)[1:-1]) else: self.log ('<== %s' % line[0]+' ') self.in_buffer = '' if not hasattr (self, fun_name): self.command_not_understood (line[0]) return fun = getattr (self, fun_name) if (not self.authorized) and (command not in ('user', 'pass', 'help', 'quit')): self.respond ('530 Please log in with USER and PASS') elif (not self.check_command_authorization (command)): self.command_not_authorized (command) else: try: result = apply (fun, (line,)) except: self.server.total_exceptions.increment() (file, fun, line), t,v, tbinfo = asyncore.compact_traceback() if self.client_dc: try: self.client_dc.close() except: pass self.respond ( '451 Server Error: %s, %s: file: %s line: %s' % ( t,v,file,line, ) ) closed = 0 def close (self): if not self.closed: self.closed = 1 if self.passive_acceptor: self.passive_acceptor.close() if self.client_dc: self.client_dc.close() asynchat.async_chat.close (self) # -------------------------------------------------- # filesystem interface functions. # override these to provide access control or perform # other functions. # -------------------------------------------------- def cwd (self, line): return self.filesystem.cwd (line[1]) def cdup (self, line): return self.filesystem.cdup() def open (self, path, mode): return self.filesystem.open (path, mode) # returns a producer def listdir (self, path, long=0): return self.filesystem.listdir (path, long) def get_dir_list (self, line, long=0): # we need to scan the command line for arguments to '/bin/ls'... args = line[1:] path_args = [] for arg in args: if arg[0] != '-': path_args.append (arg) else: # ignore arguments pass if len(path_args) < 1: dir = '.' else: dir = path_args[0] return self.listdir (dir, long) # -------------------------------------------------- # authorization methods # -------------------------------------------------- def check_command_authorization (self, command): if command in self.write_commands and self.read_only: return 0 else: return 1 # -------------------------------------------------- # utility methods # -------------------------------------------------- def log (self, message): self.server.logger.log ( self.addr[0], '%d %s' % ( self.addr[1], message ) ) def respond (self, resp): self.log ('==> %s' % resp) self.push (resp + '\r\n') def command_not_understood (self, command): self.respond ("500 '%s': command not understood." % command) def command_not_authorized (self, command): self.respond ( "530 You are not authorized to perform the '%s' command" % ( command ) ) def make_xmit_channel (self): # In PASV mode, the connection may or may _not_ have been made # yet. [although in most cases it is... FTP Explorer being # the only exception I've yet seen]. This gets somewhat confusing # because things may happen in any order... pa = self.passive_acceptor if pa: if pa.ready: # a connection has already been made. conn, addr = self.passive_acceptor.ready cdc = xmit_channel (self, addr) cdc.set_socket (conn) cdc.connected = 1 self.passive_acceptor.close() self.passive_acceptor = None else: # we're still waiting for a connect to the PASV port. cdc = xmit_channel (self) else: # not in PASV mode. ip, port = self.client_addr cdc = xmit_channel (self, self.client_addr) cdc.create_socket (socket.AF_INET, socket.SOCK_STREAM) try: cdc.connect ((ip, port)) except socket.error, why: self.respond ("425 Can't build data connection") self.client_dc = cdc # pretty much the same as xmit, but only right on the verge of # being worth a merge. def make_recv_channel (self, fd): pa = self.passive_acceptor if pa: if pa.ready: # a connection has already been made. conn, addr = pa.ready cdc = recv_channel (self, addr, fd) cdc.set_socket (conn) cdc.connected = 1 self.passive_acceptor.close() self.passive_acceptor = None else: # we're still waiting for a connect to the PASV port. cdc = recv_channel (self, None, fd) else: # not in PASV mode. ip, port = self.client_addr cdc = recv_channel (self, self.client_addr, fd) cdc.create_socket (socket.AF_INET, socket.SOCK_STREAM) try: cdc.connect ((ip, port)) except socket.error, why: self.respond ("425 Can't build data connection") self.client_dc = cdc type_map = { 'a':'ASCII', 'i':'Binary', 'e':'EBCDIC', 'l':'Binary' } type_mode_map = { 'a':'t', 'i':'b', 'e':'b', 'l':'b' } # -------------------------------------------------- # command methods # -------------------------------------------------- def cmd_type (self, line): 'specify data transfer type' # ascii, ebcdic, image, local t = string.lower (line[1]) # no support for EBCDIC # if t not in ['a','e','i','l']: if t not in ['a','i','l']: self.command_not_understood (string.join (line)) elif t == 'l' and (len(line) > 2 and line[2] != '8'): self.respond ('504 Byte size must be 8') else: self.current_mode = t self.respond ('200 Type set to %s.' % self.type_map[t]) closed = 0 def close (self): if not self.closed: self.closed = 1 asynchat.async_chat.close (self) self.server.closed_sessions.increment() def cmd_quit (self, line): 'terminate session' self.respond ('221 Goodbye.') self.close_when_done() def cmd_port (self, line): 'specify data connection port' info = string.split (line[1], ',') ip = string.join (info[:4], '.') port = string.atoi(info[4])*256 + string.atoi(info[5]) # how many data connections at a time? # I'm assuming one for now... # TODO: we should (optionally) verify that the # ip number belongs to the client. [wu-ftpd does this?] self.client_addr = (ip, port) self.respond ('200 PORT command successful.') def new_passive_acceptor (self): # ensure that only one of these exists at a time. if self.passive_acceptor is not None: self.passive_acceptor.close() self.passive_acceptor = None self.passive_acceptor = passive_acceptor (self) return self.passive_acceptor def cmd_pasv (self, line): 'prepare for server-to-server transfer' pc = self.new_passive_acceptor() port = pc.addr[1] ip_addr = pc.control_channel.getsockname()[0] self.respond ( '227 Entering Passive Mode (%s,%d,%d)' % ( string.join (string.split (ip_addr, '.'), ','), port/256, port%256 ) ) self.client_dc = None def cmd_nlst (self, line): 'give name list of files in directory' # ncftp adds the -FC argument for the user-visible 'nlist' # command. We could try to emulate ls flags, but not just yet. if '-FC' in line: line.remove ('-FC') try: dir_list_producer = self.get_dir_list (line, 0) except os.error, why: self.respond ('550 Could not list directory: %s' % repr(why)) return self.respond ( '150 Opening %s mode data connection for file list' % ( self.type_map[self.current_mode] ) ) self.make_xmit_channel() self.client_dc.push_with_producer (dir_list_producer) self.client_dc.close_when_done() def cmd_list (self, line): 'give list files in a directory' try: dir_list_producer = self.get_dir_list (line, 1) except os.error, why: self.respond ('550 Could not list directory: %s' % repr(why)) return self.respond ( '150 Opening %s mode data connection for file list' % ( self.type_map[self.current_mode] ) ) self.make_xmit_channel() self.client_dc.push_with_producer (dir_list_producer) self.client_dc.close_when_done() def cmd_cwd (self, line): 'change working directory' if self.cwd (line): self.respond ('250 CWD command successful.') else: self.respond ('550 No such directory.') def cmd_cdup (self, line): 'change to parent of current working directory' if self.cdup(line): self.respond ('250 CDUP command successful.') else: self.respond ('550 No such directory.') def cmd_pwd (self, line): 'print the current working directory' self.respond ( '257 "%s" is the current directory.' % ( self.filesystem.current_directory() ) ) # modification time # example output: # 213 19960301204320 def cmd_mdtm (self, line): 'show last modification time of file' filename = line[1] if not self.filesystem.isfile (filename): self.respond ('550 "%s" is not a file' % filename) else: mtime = time.gmtime(self.filesystem.stat(filename)[stat.ST_MTIME]) self.respond ( '213 %4d%02d%02d%02d%02d%02d' % ( mtime[0], mtime[1], mtime[2], mtime[3], mtime[4], mtime[5] ) ) def cmd_noop (self, line): 'do nothing' self.respond ('200 NOOP command successful.') def cmd_size (self, line): 'return size of file' filename = line[1] if not self.filesystem.isfile (filename): self.respond ('550 "%s" is not a file' % filename) else: self.respond ( '213 %d' % (self.filesystem.stat(filename)[stat.ST_SIZE]) ) def cmd_retr (self, line): 'retrieve a file' if len(line) < 2: self.command_not_understood (string.join (line)) else: file = line[1] if not self.filesystem.isfile (file): self.log_info ('checking %s' % file) self.respond ('550 No such file') else: try: # FIXME: for some reason, 'rt' isn't working on win95 mode = 'r'+self.type_mode_map[self.current_mode] fd = self.open (file, mode) except IOError, why: self.respond ('553 could not open file for reading: %s' % (repr(why))) return self.respond ( "150 Opening %s mode data connection for file '%s'" % ( self.type_map[self.current_mode], file ) ) self.make_xmit_channel() if self.restart_position: # try to position the file as requested, but # give up silently on failure (the 'file object' # may not support seek()) try: fd.seek (self.restart_position) except: pass self.restart_position = 0 self.client_dc.push_with_producer ( file_producer (self, self.client_dc, fd) ) self.client_dc.close_when_done() def cmd_stor (self, line, mode='wb'): 'store a file' if len (line) < 2: self.command_not_understood (string.join (line)) else: if self.restart_position: restart_position = 0 self.respond ('553 restart on STOR not yet supported') return file = line[1] # todo: handle that type flag try: fd = self.open (file, mode) except IOError, why: self.respond ('553 could not open file for writing: %s' % (repr(why))) return self.respond ( '150 Opening %s connection for %s' % ( self.type_map[self.current_mode], file ) ) self.make_recv_channel (fd) def cmd_abor (self, line): 'abort operation' if self.client_dc: self.client_dc.close() self.respond ('226 ABOR command successful.') def cmd_appe (self, line): 'append to a file' return self.cmd_stor (line, 'ab') def cmd_dele (self, line): if len (line) != 2: self.command_not_understood (string.join (line)) else: file = line[1] if self.filesystem.isfile (file): try: self.filesystem.unlink (file) self.respond ('250 DELE command successful.') except: self.respond ('550 error deleting file.') else: self.respond ('550 %s: No such file.' % file) def cmd_mkd (self, line): if len (line) != 2: self.command.not_understood (string.join (line)) else: path = line[1] try: self.filesystem.mkdir (path) self.respond ('257 MKD command successful.') except: self.respond ('550 error creating directory.') def cmd_rmd (self, line): if len (line) != 2: self.command.not_understood (string.join (line)) else: path = line[1] try: self.filesystem.rmdir (path) self.respond ('250 RMD command successful.') except: self.respond ('550 error removing directory.') def cmd_user (self, line): 'specify user name' if len(line) > 1: self.user = line[1] self.respond ('331 Password required.') else: self.command_not_understood (string.join (line)) def cmd_pass (self, line): 'specify password' if len(line) < 2: pw = '' else: pw = line[1] result, message, fs = self.server.authorizer.authorize (self, self.user, pw) if result: self.respond ('230 %s' % message) self.filesystem = fs self.authorized = 1 self.log_info('Successful login: Filesystem=%s' % repr(fs)) else: self.respond ('530 %s' % message) def cmd_rest (self, line): 'restart incomplete transfer' try: pos = string.atoi (line[1]) except ValueError: self.command_not_understood (string.join (line)) self.restart_position = pos self.respond ( '350 Restarting at %d. Send STORE or RETRIEVE to initiate transfer.' % pos ) def cmd_stru (self, line): 'obsolete - set file transfer structure' if line[1] in 'fF': # f == 'file' self.respond ('200 STRU F Ok') else: self.respond ('504 Unimplemented STRU type') def cmd_mode (self, line): 'obsolete - set file transfer mode' if line[1] in 'sS': # f == 'file' self.respond ('200 MODE S Ok') else: self.respond ('502 Unimplemented MODE type') # The stat command has two personalities. Normally it returns status # information about the current connection. But if given an argument, # it is equivalent to the LIST command, with the data sent over the # control connection. Strange. But wuftpd, ftpd, and nt's ftp server # all support it. # ## def cmd_stat (self, line): ## 'return status of server' ## pass def cmd_syst (self, line): 'show operating system type of server system' # Replying to this command is of questionable utility, because # this server does not behave in a predictable way w.r.t. the # output of the LIST command. We emulate Unix ls output, but # on win32 the pathname can contain drive information at the front # Currently, the combination of ensuring that os.sep == '/' # and removing the leading slash when necessary seems to work. # [cd'ing to another drive also works] # # This is how wuftpd responds, and is probably # the most expected. The main purpose of this reply is so that # the client knows to expect Unix ls-style LIST output. self.respond ('215 UNIX Type: L8') # one disadvantage to this is that some client programs # assume they can pass args to /bin/ls. # a few typical responses: # 215 UNIX Type: L8 (wuftpd) # 215 Windows_NT version 3.51 # 215 VMS MultiNet V3.3 # 500 'SYST': command not understood. (SVR4) def cmd_help (self, line): 'give help information' # find all the methods that match 'cmd_xxxx', # use their docstrings for the help response. import newdir attrs = newdir.dir(self.__class__) help_lines = [] for attr in attrs: if attr[:4] == 'cmd_': x = getattr (self, attr) if type(x) == type(self.cmd_help): if x.__doc__: help_lines.append ('\t%s\t%s' % (attr[4:], x.__doc__)) if help_lines: self.push ('214-The following commands are recognized\r\n') self.push_with_producer (producers.lines_producer (help_lines)) self.push ('214\r\n') else: self.push ('214-\r\n\tHelp Unavailable\r\n214\r\n') class ftp_server (asyncore.dispatcher): # override this to spawn a different FTP channel class. ftp_channel_class = ftp_channel SERVER_IDENT = 'FTP Server (V%s)' % VERSION def __init__ ( self, authorizer, hostname =None, port =21, resolver =None, logger_object=logger.file_logger (sys.stdout) ): self.port = port self.authorizer = authorizer if hostname is None: self.hostname = socket.gethostname() else: self.hostname = hostname # statistics self.total_sessions = counter() self.closed_sessions = counter() self.total_files_out = counter() self.total_files_in = counter() self.total_bytes_out = counter() self.total_bytes_in = counter() self.total_exceptions = counter() # asyncore.dispatcher.__init__ (self) self.create_socket (socket.AF_INET, socket.SOCK_STREAM) self.set_reuse_addr() self.bind (('', self.port)) self.listen (5) if not logger_object: logger_object = sys.stdout if resolver: self.logger = logger.resolving_logger (resolver, logger_object) else: self.logger = logger.unresolving_logger (logger_object) self.log_info('FTP server started at %s\n\tAuthorizer:%s\n\tHostname: %s\n\tPort: %d' % ( time.ctime(time.time()), repr (self.authorizer), self.hostname, self.port) ) def writable (self): return 0 def handle_read (self): pass def handle_connect (self): pass def handle_accept (self): conn, addr = self.accept() self.total_sessions.increment() self.log_info('Incoming connection from %s:%d' % (addr[0], addr[1])) self.ftp_channel_class (self, conn, addr) # return a producer describing the state of the server def status (self): def nice_bytes (n): return string.join (status_handler.english_bytes (n)) return producers.lines_producer ( ['

    %s

    ' % self.SERVER_IDENT, '
    Listening on Host: %s' % self.hostname, 'Port: %d' % self.port, '
    Sessions', 'Total: %s' % self.total_sessions, 'Current: %d' % (self.total_sessions.as_long() - self.closed_sessions.as_long()), '
    Files', 'Sent: %s' % self.total_files_out, 'Received: %s' % self.total_files_in, '
    Bytes', 'Sent: %s' % nice_bytes (self.total_bytes_out.as_long()), 'Received: %s' % nice_bytes (self.total_bytes_in.as_long()), '
    Exceptions: %s' % self.total_exceptions, ] ) # ====================================================================== # Data Channel Classes # ====================================================================== # This socket accepts a data connection, used when the server has been # placed in passive mode. Although the RFC implies that we ought to # be able to use the same acceptor over and over again, this presents # a problem: how do we shut it off, so that we are accepting # connections only when we expect them? [we can't] # # wuftpd, and probably all the other servers, solve this by allowing # only one connection to hit this acceptor. They then close it. Any # subsequent data-connection command will then try for the default # port on the client side [which is of course never there]. So the # 'always-send-PORT/PASV' behavior seems required. # # Another note: wuftpd will also be listening on the channel as soon # as the PASV command is sent. It does not wait for a data command # first. # --- we need to queue up a particular behavior: # 1) xmit : queue up producer[s] # 2) recv : the file object # # It would be nice if we could make both channels the same. Hmmm.. # class passive_acceptor (asyncore.dispatcher): ready = None def __init__ (self, control_channel): # connect_fun (conn, addr) asyncore.dispatcher.__init__ (self) self.control_channel = control_channel self.create_socket (socket.AF_INET, socket.SOCK_STREAM) # bind to an address on the interface that the # control connection is coming from. self.bind (( self.control_channel.getsockname()[0], 0 )) self.addr = self.getsockname() self.listen (1) # def __del__ (self): # print 'passive_acceptor.__del__()' def log (self, *ignore): pass def handle_accept (self): conn, addr = self.accept() dc = self.control_channel.client_dc if dc is not None: dc.set_socket (conn) dc.addr = addr dc.connected = 1 self.control_channel.passive_acceptor = None else: self.ready = conn, addr self.close() class xmit_channel (asynchat.async_chat): # for an ethernet, you want this to be fairly large, in fact, it # _must_ be large for performance comparable to an ftpd. [64k] we # ought to investigate automatically-sized buffers... ac_out_buffer_size = 16384 bytes_out = 0 def __init__ (self, channel, client_addr=None): self.channel = channel self.client_addr = client_addr asynchat.async_chat.__init__ (self) def readable (self): return 0 def handle_connect(self): pass def writable (self): return 1 def send (self, data): result = asynchat.async_chat.send (self, data) self.bytes_out = self.bytes_out + result return result def handle_error (self): # usually this is to catch an unexpected disconnect. self.log_info ('unexpected disconnect on data xmit channel', 'error') try: self.close() except: pass # TODO: there's a better way to do this. we need to be able to # put 'events' in the producer fifo. to do this cleanly we need # to reposition the 'producer' fifo as an 'event' fifo. def close (self): c = self.channel s = c.server c.client_dc = None s.total_files_out.increment() s.total_bytes_out.increment (self.bytes_out) if not len(self.producer_fifo): c.respond ('226 Transfer complete') elif not c.closed: c.respond ('426 Connection closed; transfer aborted') del c del s del self.channel asynchat.async_chat.close (self) class recv_channel (asyncore.dispatcher): def __init__ (self, channel, client_addr, fd): self.channel = channel self.client_addr = client_addr self.fd = fd asyncore.dispatcher.__init__ (self) self.bytes_in = counter() def log (self, *ignore): pass def handle_connect (self): pass def writable (self): return 0 def recv (*args): result = apply (asyncore.dispatcher.recv, args) self = args[0] self.bytes_in.increment(len(result)) return result buffer_size = 8192 def handle_read (self): block = self.recv (self.buffer_size) if block: try: self.fd.write (block) except IOError: self.log_info ('got exception writing block...', 'error') def handle_close (self): s = self.channel.server s.total_files_in.increment() s.total_bytes_in.increment(self.bytes_in.as_long()) self.fd.close() self.channel.respond ('226 Transfer complete.') self.close() import filesys # not much of a doorman! 8^) class dummy_authorizer: def __init__ (self, root='/'): self.root = root def authorize (self, channel, username, password): channel.persona = -1, -1 channel.read_only = 1 return 1, 'Ok.', filesys.os_filesystem (self.root) class anon_authorizer: def __init__ (self, root='/'): self.root = root def authorize (self, channel, username, password): if username in ('ftp', 'anonymous'): channel.persona = -1, -1 channel.read_only = 1 return 1, 'Ok.', filesys.os_filesystem (self.root) else: return 0, 'Password invalid.', None # =========================================================================== # Unix-specific improvements # =========================================================================== if os.name == 'posix': class unix_authorizer: # return a trio of (success, reply_string, filesystem) def authorize (self, channel, username, password): import crypt import pwd try: info = pwd.getpwnam (username) except KeyError: return 0, 'No such user.', None mangled = info[1] if crypt.crypt (password, mangled[:2]) == mangled: channel.read_only = 0 fs = filesys.schizophrenic_unix_filesystem ( '/', info[5], persona = (info[2], info[3]) ) return 1, 'Login successful.', fs else: return 0, 'Password invalid.', None def __repr__ (self): return '' # simple anonymous ftp support class unix_authorizer_with_anonymous (unix_authorizer): def __init__ (self, root=None, real_users=0): self.root = root self.real_users = real_users def authorize (self, channel, username, password): if string.lower(username) in ['anonymous', 'ftp']: import pwd try: # ok, here we run into lots of confusion. # on some os', anon runs under user 'nobody', # on others as 'ftp'. ownership is also critical. # need to investigate. # linux: new linuxen seem to have nobody's UID=-1, # which is an illegal value. Use ftp. ftp_user_info = pwd.getpwnam ('ftp') if string.lower(os.uname()[0]) == 'linux': nobody_user_info = pwd.getpwnam ('ftp') else: nobody_user_info = pwd.getpwnam ('nobody') channel.read_only = 1 if self.root is None: self.root = ftp_user_info[5] fs = filesys.unix_filesystem (self.root, '/') return 1, 'Anonymous Login Successful', fs except KeyError: return 0, 'Anonymous account not set up', None elif self.real_users: return unix_authorizer.authorize ( self, channel, username, password ) else: return 0, 'User logins not allowed', None class file_producer: block_size = 16384 def __init__ (self, server, dc, fd): self.fd = fd self.done = 0 def more (self): if self.done: return '' else: block = self.fd.read (self.block_size) if not block: self.fd.close() self.done = 1 return block # usage: ftp_server /PATH/TO/FTP/ROOT PORT # for example: # $ ftp_server /home/users/ftp 8021 if os.name == 'posix': def test (port='8021'): import sys fs = ftp_server ( unix_authorizer(), port=string.atoi (port) ) try: asyncore.loop() except KeyboardInterrupt: self.log_info('FTP server shutting down. (received SIGINT)', 'warning') # close everything down on SIGINT. # of course this should be a cleaner shutdown. sm = socket.socket_map socket.socket_map = {} for sock in sm.values(): try: sock.close() except: pass if __name__ == '__main__': test (sys.argv[1]) # not unix else: def test (): fs = ftp_server (dummy_authorizer()) if __name__ == '__main__': test () # this is the command list from the wuftpd man page # '*' means we've implemented it. # '!' requires write access # command_documentation = { 'abor': 'abort previous command', #* 'acct': 'specify account (ignored)', 'allo': 'allocate storage (vacuously)', 'appe': 'append to a file', #*! 'cdup': 'change to parent of current working directory', #* 'cwd': 'change working directory', #* 'dele': 'delete a file', #! 'help': 'give help information', #* 'list': 'give list files in a directory', #* 'mkd': 'make a directory', #! 'mdtm': 'show last modification time of file', #* 'mode': 'specify data transfer mode', 'nlst': 'give name list of files in directory', #* 'noop': 'do nothing', #* 'pass': 'specify password', #* 'pasv': 'prepare for server-to-server transfer', #* 'port': 'specify data connection port', #* 'pwd': 'print the current working directory', #* 'quit': 'terminate session', #* 'rest': 'restart incomplete transfer', #* 'retr': 'retrieve a file', #* 'rmd': 'remove a directory', #! 'rnfr': 'specify rename-from file name', #! 'rnto': 'specify rename-to file name', #! 'site': 'non-standard commands (see next section)', 'size': 'return size of file', #* 'stat': 'return status of server', #* 'stor': 'store a file', #*! 'stou': 'store a file with a unique name', #! 'stru': 'specify data transfer structure', 'syst': 'show operating system type of server system', #* 'type': 'specify data transfer type', #* 'user': 'specify user name', #* 'xcup': 'change to parent of current working directory (deprecated)', 'xcwd': 'change working directory (deprecated)', 'xmkd': 'make a directory (deprecated)', #! 'xpwd': 'print the current working directory (deprecated)', 'xrmd': 'remove a directory (deprecated)', #! } # debugging aid (linux) def get_vm_size (): return string.atoi (string.split(open ('/proc/self/stat').readline())[22]) def print_vm(): print 'vm: %8dk' % (get_vm_size()/1024) Zope-2.0.1-ZEO-nonbin/ZServer/medusa/http_date.py100644 1007 1403 5160 6703245715 21523 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- import regex import string import time def concat (*args): return string.joinfields (args, '') def join (seq, field=' '): return string.joinfields (seq, field) def group (s): return '\\(' + s + '\\)' short_days = ['sun','mon','tue','wed','thu','fri','sat'] long_days = ['sunday','monday','tuesday','wednesday','thursday','friday','saturday'] short_day_reg = group (join (short_days, '\\|')) long_day_reg = group (join (long_days, '\\|')) daymap = {} for i in range(7): daymap[short_days[i]] = i daymap[long_days[i]] = i hms_reg = join (3 * [group('[0-9][0-9]')], ':') months = ['jan','feb','mar','apr','may','jun','jul','aug','sep','oct','nov','dec'] monmap = {} for i in range(12): monmap[months[i]] = i+1 months_reg = group (join (months, '\\|')) # From draft-ietf-http-v11-spec-07.txt/3.3.1 # Sun, 06 Nov 1994 08:49:37 GMT ; RFC 822, updated by RFC 1123 # Sunday, 06-Nov-94 08:49:37 GMT ; RFC 850, obsoleted by RFC 1036 # Sun Nov 6 08:49:37 1994 ; ANSI C's asctime() format # rfc822 format rfc822_date = join ( [concat (short_day_reg,','), # day group('[0-9][0-9]?'), # date months_reg, # month group('[0-9]+'), # year hms_reg, # hour minute second 'gmt' ], ' ' ) rfc822_reg = regex.compile (rfc822_date) def unpack_rfc822 (): g = rfc822_reg.group a = string.atoi return ( a(g(4)), # year monmap[g(3)], # month a(g(2)), # day a(g(5)), # hour a(g(6)), # minute a(g(7)), # second 0, 0, 0 ) # rfc850 format rfc850_date = join ( [concat (long_day_reg,','), join ( [group ('[0-9][0-9]?'), months_reg, group ('[0-9]+') ], '-' ), hms_reg, 'gmt' ], ' ' ) rfc850_reg = regex.compile (rfc850_date) # they actually unpack the same way def unpack_rfc850 (): g = rfc850_reg.group a = string.atoi return ( a(g(4)), # year monmap[g(3)], # month a(g(2)), # day a(g(5)), # hour a(g(6)), # minute a(g(7)), # second 0, 0, 0 ) # parsdate.parsedate - ~700/sec. # parse_http_date - ~1333/sec. def build_http_date (when): return time.strftime ('%a, %d %b %Y %H:%M:%S GMT', time.gmtime(when)) def parse_http_date (d): d = string.lower (d) tz = time.timezone if rfc850_reg.match (d) == len(d): retval = int (time.mktime (unpack_rfc850()) - tz) elif rfc822_reg.match (d) == len(d): retval = int (time.mktime (unpack_rfc822()) - tz) else: return 0 # Thanks to Craig Silverstein for pointing # out the DST discrepancy if time.daylight and time.localtime(retval)[-1] == 1: # DST correction retval = retval + (tz - time.altzone) return retval Zope-2.0.1-ZEO-nonbin/ZServer/medusa/http_server.py100644 1007 1403 47217 6766216627 22156 0ustar petrillipetrilli#! /usr/local/bin/python # -*- Mode: Python; tab-width: 4 -*- # # Author: Sam Rushing # Copyright 1996, 1997 by Sam Rushing # All Rights Reserved. # # This software is provided free for non-commercial use. If you are # interested in using this software in a commercial context, or in # purchasing support, please contact the author. RCS_ID = '$Id: http_server.py,v 1.11 1999/09/10 15:02:47 petrilli Exp $' # python modules import os import regex import socket import stat import string import sys import time # async modules import asyncore import asynchat # medusa modules import http_date import producers import status_handler import logger VERSION_STRING = string.split(RCS_ID)[2] from counter import counter # =========================================================================== # Request Object # =========================================================================== class http_request: # default reply code reply_code = 200 request_counter = counter() # Whether to automatically use chunked encoding when # # HTTP version is 1.1 # Content-Length is not set # Chunked encoding is not already in effect # # If your clients are having trouble, you might want to disable this. use_chunked = 1 # by default, this request object ignores user data. collector = None def __init__ (self, *args): # unpack information about the request (self.channel, self.request, self.command, self.uri, self.version, self.header) = args self.outgoing = fifo() self.reply_headers = { 'Server' : 'Medusa/%s' % VERSION_STRING, 'Date' : http_date.build_http_date (time.time()) } self.request_number = http_request.request_counter.increment() self._split_uri = None self._header_cache = {} # -------------------------------------------------- # reply header management # -------------------------------------------------- def __setitem__ (self, key, value): self.reply_headers[key] = value def __getitem__ (self, key): return self.reply_headers[key] def has_key (self, key): return self.reply_headers.has_key (key) def build_reply_header (self): return string.join ( [self.response(self.reply_code)] + map ( lambda x: '%s: %s' % x, self.reply_headers.items() ), '\r\n' ) + '\r\n\r\n' # -------------------------------------------------- # split a uri # -------------------------------------------------- # ;?# path_regex = regex.compile ( # path params query fragment '\\([^;?#]*\\)\\(;[^?#]*\\)?\\(\\?[^#]*\)?\(#.*\)?' ) def split_uri (self): if self._split_uri is None: if self.path_regex.match (self.uri) != len(self.uri): raise ValueError, "Broken URI" else: self._split_uri = map (lambda i,r=self.path_regex: r.group(i), range(1,5)) return self._split_uri def get_header_with_regex (self, head_reg, group): for line in self.header: if head_reg.match (line) == len(line): return head_reg.group(group) return '' def get_header (self, header): header = string.lower (header) hc = self._header_cache if not hc.has_key (header): h = header + ': ' hl = len(h) for line in self.header: if string.lower (line[:hl]) == h: r = line[hl:] hc[header] = r return r hc[header] = None return None else: return hc[header] # -------------------------------------------------- # user data # -------------------------------------------------- def collect_incoming_data (self, data): if self.collector: self.collector.collect_incoming_data (data) else: self.log_info( 'Dropping %d bytes of incoming request data' % len(data), 'warning' ) def found_terminator (self): if self.collector: self.collector.found_terminator() else: self.log_info ( 'Unexpected end-of-record for incoming request', 'warning' ) def push (self, thing): if type(thing) == type(''): self.outgoing.push (producers.simple_producer (thing)) else: self.outgoing.push (thing) def response (self, code=200): message = self.responses[code] self.reply_code = code return 'HTTP/%s %d %s' % (self.version, code, message) def error (self, code): self.reply_code = code message = self.responses[code] s = self.DEFAULT_ERROR_MESSAGE % { 'code': code, 'message': message, } self['Content-Length'] = len(s) self['Content-Type'] = 'text/html' # make an error reply self.push (s) self.done() # can also be used for empty replies reply_now = error def done (self): "finalize this transaction - send output to the http channel" # ---------------------------------------- # persistent connection management # ---------------------------------------- # --- BUCKLE UP! ---- connection = string.lower (get_header (CONNECTION, self.header)) close_it = 0 wrap_in_chunking = 0 if self.version == '1.0': if connection == 'keep-alive': if not self.has_key ('Content-Length'): close_it = 1 else: self['Connection'] = 'Keep-Alive' else: close_it = 1 elif self.version == '1.1': if connection == 'close': close_it = 1 elif not self.has_key ('Content-Length'): if self.has_key ('Transfer-Encoding'): if not self['Transfer-Encoding'] == 'chunked': close_it = 1 elif self.use_chunked: self['Transfer-Encoding'] = 'chunked' wrap_in_chunking = 1 else: close_it = 1 elif self.version is None: # Although we don't *really* support http/0.9 (because we'd have to # use \r\n as a terminator, and it would just yuck up a lot of stuff) # it's very common for developers to not want to type a version number # when using telnet to debug a server. close_it = 1 outgoing_header = producers.simple_producer (self.build_reply_header()) if close_it: self['Connection'] = 'close' if wrap_in_chunking: outgoing_producer = producers.chunked_producer ( producers.composite_producer (self.outgoing) ) # prepend the header outgoing_producer = producers.composite_producer ( fifo([outgoing_header, outgoing_producer]) ) else: # prepend the header self.outgoing.push_front (outgoing_header) outgoing_producer = producers.composite_producer (self.outgoing) # apply a few final transformations to the output self.channel.push_with_producer ( # globbing gives us large packets producers.globbing_producer ( # hooking lets us log the number of bytes sent producers.hooked_producer ( outgoing_producer, self.log ) ) ) self.channel.current_request = None if close_it: self.channel.close_when_done() def log_date_string (self, when): return time.strftime ( '%d/%b/%Y:%H:%M:%S ', time.gmtime(when) ) + tz_for_log def log (self, bytes): user_agent=self.get_header('user-agent') if not user_agent: user_agent='' referer=self.get_header('referer') if not referer: referer='' self.channel.server.logger.log ( self.channel.addr[0], '%d - - [%s] "%s" %d %d "%s" "%s"\n' % ( self.channel.addr[1], self.log_date_string (time.time()), self.request, self.reply_code, bytes, referer, user_agent ) ) responses = { 100: "Continue", 101: "Switching Protocols", 200: "OK", 201: "Created", 202: "Accepted", 203: "Non-Authoritative Information", 204: "No Content", 205: "Reset Content", 206: "Partial Content", 300: "Multiple Choices", 301: "Moved Permanently", 302: "Moved Temporarily", 303: "See Other", 304: "Not Modified", 305: "Use Proxy", 400: "Bad Request", 401: "Unauthorized", 402: "Payment Required", 403: "Forbidden", 404: "Not Found", 405: "Method Not Allowed", 406: "Not Acceptable", 407: "Proxy Authentication Required", 408: "Request Time-out", 409: "Conflict", 410: "Gone", 411: "Length Required", 412: "Precondition Failed", 413: "Request Entity Too Large", 414: "Request-URI Too Large", 415: "Unsupported Media Type", 500: "Internal Server Error", 501: "Not Implemented", 502: "Bad Gateway", 503: "Service Unavailable", 504: "Gateway Time-out", 505: "HTTP Version not supported" } # Default error message DEFAULT_ERROR_MESSAGE = string.join ( ['', 'Error response', '', '', '

    Error response

    ', '

    Error code %(code)d.', '

    Message: %(message)s.', '', '' ], '\r\n' ) # =========================================================================== # HTTP Channel Object # =========================================================================== class http_channel (asynchat.async_chat): # use a larger default output buffer ac_out_buffer_size = 1<<16 current_request = None channel_counter = counter() def __init__ (self, server, conn, addr): self.channel_number = http_channel.channel_counter.increment() self.request_counter = counter() asynchat.async_chat.__init__ (self, conn) self.server = server self.addr = addr self.set_terminator ('\r\n\r\n') self.in_buffer = '' self.creation_time = int (time.time()) self.check_maintenance() def __repr__ (self): ar = asynchat.async_chat.__repr__(self)[1:-1] return '<%s channel#: %s requests:%s>' % ( ar, self.channel_number, self.request_counter ) # Channel Counter, Maintenance Interval... maintenance_interval = 500 def check_maintenance (self): if not self.channel_number % self.maintenance_interval: self.maintenance() def maintenance (self): self.kill_zombies() # 30-minute zombie timeout. status_handler also knows how to kill zombies. zombie_timeout = 30 * 60 def kill_zombies (self): now = int (time.time()) for channel in asyncore.socket_map.keys(): if channel.__class__ == self.__class__: if (now - channel.creation_time) > channel.zombie_timeout: channel.close() # -------------------------------------------------- # send/recv overrides, good place for instrumentation. # -------------------------------------------------- # this information needs to get into the request object, # so that it may log correctly. def send (self, data): result = asynchat.async_chat.send (self, data) self.server.bytes_out.increment (len(data)) return result def recv (self, buffer_size): try: result = asynchat.async_chat.recv (self, buffer_size) self.server.bytes_in.increment (len(result)) return result except MemoryError: # --- Save a Trip to Your Service Provider --- # It's possible for a process to eat up all the memory of # the machine, and put it in an extremely wedged state, # where medusa keeps running and can't be shut down. This # is where MemoryError tends to get thrown, though of # course it could get thrown elsewhere. sys.exit ("Out of Memory!") def handle_error (self): t, v = sys.exc_info()[:2] if t is SystemExit: raise t, v else: asynchat.async_chat.handle_error (self) def log (self, *args): pass # -------------------------------------------------- # async_chat methods # -------------------------------------------------- def collect_incoming_data (self, data): if self.current_request: # we are receiving data (probably POST data) for a request self.current_request.collect_incoming_data (data) else: # we are receiving header (request) data self.in_buffer = self.in_buffer + data def found_terminator (self): if self.current_request: self.current_request.found_terminator() else: header = self.in_buffer self.in_buffer = '' lines = string.split (header, '\r\n') # -------------------------------------------------- # crack the request header # -------------------------------------------------- request = lines[0] try: command, uri, version = crack_request (request) except: # deal with broken HTTP requests try: # maybe there were spaces in the URL parts=string.split(request) command, uri, version = crack_request( '%s %s %s' % (parts[0], parts[1], parts[-1])) except: self.log_info('Bad HTTP request: %s' % request, 'error') r = http_request (self, request, None, None, None, join_headers(lines[1:])) r.error(400) return header = join_headers (lines[1:]) r = http_request (self, request, command, uri, version, header) self.request_counter.increment() self.server.total_requests.increment() # -------------------------------------------------- # handler selection and dispatch # -------------------------------------------------- for h in self.server.handlers: if h.match (r): try: self.current_request = r # This isn't used anywhere. # r.handler = h # CYCLE h.handle_request (r) except: self.server.exceptions.increment() (file, fun, line), t, v, tbinfo = asyncore.compact_traceback() self.log_info( 'Server Error: %s, %s: file: %s line: %s' % (t,v,file,line), 'error') try: r.error (500) except: pass return # no handlers, so complain r.error (404) def writable (self): # this is just the normal async_chat 'writable', here for comparison return self.ac_out_buffer or len(self.producer_fifo) def writable_for_proxy (self): # this version of writable supports the idea of a 'stalled' producer # [i.e., it's not ready to produce any output yet] This is needed by # the proxy, which will be waiting for the magic combination of # 1) hostname resolved # 2) connection made # 3) data available. if self.ac_out_buffer: return 1 elif len(self.producer_fifo): p = self.producer_fifo.first() if hasattr (p, 'stalled'): return not p.stalled() else: return 1 # =========================================================================== # HTTP Server Object # =========================================================================== class http_server (asyncore.dispatcher): SERVER_IDENT = 'HTTP Server (V%s)' % VERSION_STRING channel_class = http_channel def __init__ (self, ip, port, resolver=None, logger_object=None): self.ip = ip self.port = port asyncore.dispatcher.__init__ (self) self.create_socket (socket.AF_INET, socket.SOCK_STREAM) self.handlers = [] if not logger_object: logger_object = logger.file_logger (sys.stdout) self.set_reuse_addr() self.bind ((ip, port)) # lower this to 5 if your OS complains self.listen (1024) host, port = self.socket.getsockname() if not ip: self.log_info('Computing default hostname', 'warning') ip = socket.gethostbyname (socket.gethostname()) try: self.server_name = socket.gethostbyaddr (ip)[0] except socket.error: self.log_info('Cannot do reverse lookup', 'warning') self.server_name = ip # use the IP address as the "hostname" self.server_port = port self.total_clients = counter() self.total_requests = counter() self.exceptions = counter() self.bytes_out = counter() self.bytes_in = counter() if not logger_object: logger_object = logger.file_logger (sys.stdout) if resolver: self.logger = logger.resolving_logger (resolver, logger_object) else: self.logger = logger.unresolving_logger (logger_object) self.log_info ( 'Medusa (V%s) started at %s' '\n\tHostname: %s' '\n\tPort:%d' '\n' % ( VERSION_STRING, time.ctime(time.time()), self.server_name, port, ) ) def writable (self): return 0 def handle_read (self): pass def readable (self): return self.accepting def handle_connect (self): pass def handle_accept (self): self.total_clients.increment() try: conn, addr = self.accept() except socket.error: # linux: on rare occasions we get a bogus socket back from # accept. socketmodule.c:makesockaddr complains that the # address family is unknown. We don't want the whole server # to shut down because of this. self.log_info('Server accept() threw an exception', 'warning') return self.channel_class (self, conn, addr) def install_handler (self, handler, back=0): if back: self.handlers.append (handler) else: self.handlers.insert (0, handler) def remove_handler (self, handler): self.handlers.remove (handler) def status (self): def nice_bytes (n): return string.join (status_handler.english_bytes (n)) handler_stats = filter (None, map (maybe_status, self.handlers)) if self.total_clients: ratio = self.total_requests.as_long() / float(self.total_clients.as_long()) else: ratio = 0.0 return producers.composite_producer ( fifo ([producers.lines_producer ( ['

    %s

    ' % self.SERVER_IDENT, '
    Listening on: Host: %s' % self.server_name, 'Port: %d' % self.port, '

      ' '
    • Total Clients: %s' % self.total_clients, 'Requests: %s' % self.total_requests, 'Requests/Client: %.1f' % (ratio), '
    • Total Bytes In: %s' % (nice_bytes (self.bytes_in.as_long())), 'Bytes Out: %s' % (nice_bytes (self.bytes_out.as_long())), '
    • Total Exceptions: %s' % self.exceptions, '

    ' 'Extension List

      ', ])] + handler_stats + [producers.simple_producer('
    ')] ) ) def maybe_status (thing): if hasattr (thing, 'status'): return thing.status() else: return None CONNECTION = regex.compile ('Connection: \(.*\)', regex.casefold) # merge multi-line headers # [486dx2: ~500/sec] def join_headers (headers): r = [] for i in range(len(headers)): if headers[i][0] in ' \t': r[-1] = r[-1] + headers[i][1:] else: r.append (headers[i]) return r def get_header (head_reg, lines, group=1): for line in lines: if head_reg.match (line) == len(line): return head_reg.group(group) return '' REQUEST = regex.compile ('\([^ ]+\) \([^ ]+\)\(\( HTTP/\([0-9.]+\)\)$\|$\)') def crack_request (r): if REQUEST.match (r) == len(r): if REQUEST.group(3): version = REQUEST.group(5) else: version = None return string.lower (REQUEST.group (1)), REQUEST.group(2), version class fifo: def __init__ (self, list=None): if not list: self.list = [] else: self.list = list def __len__ (self): return len(self.list) def first (self): return self.list[0] def push_front (self, object): self.list.insert (0, object) def push (self, data): self.list.append (data) def pop (self): if self.list: result = self.list[0] del self.list[0] return (1, result) else: return (0, None) def compute_timezone_for_log (): if time.daylight: tz = time.altzone else: tz = time.timezone if tz > 0: neg = 1 else: neg = 0 tz = -tz h, rem = divmod (tz, 3600) m, rem = divmod (rem, 60) if neg: return '-%02d%02d' % (h, m) else: return '+%02d%02d' % (h, m) # if you run this program over a TZ change boundary, this will be invalid. tz_for_log = compute_timezone_for_log() if __name__ == '__main__': import sys if len(sys.argv) < 2: print 'usage: %s ' % (sys.argv[0]) else: import monitor import filesys import default_handler import status_handler import ftp_server import chat_server import resolver import logger rs = resolver.caching_resolver ('127.0.0.1') lg = logger.file_logger (sys.stdout) ms = monitor.secure_monitor_server ('fnord', '127.0.0.1', 9999) fs = filesys.os_filesystem (sys.argv[1]) dh = default_handler.default_handler (fs) hs = http_server ('', string.atoi (sys.argv[2]), rs, lg) hs.install_handler (dh) ftp = ftp_server.ftp_server ( ftp_server.dummy_authorizer(sys.argv[1]), port=8021, resolver=rs, logger_object=lg ) cs = chat_server.chat_server ('', 7777) sh = status_handler.status_extension([hs,ms,ftp,cs,rs]) hs.install_handler (sh) if ('-p' in sys.argv): def profile_loop (): try: asyncore.loop() except KeyboardInterrupt: pass import profile profile.run ('profile_loop()', 'profile.out') else: asyncore.loop() Zope-2.0.1-ZEO-nonbin/ZServer/medusa/logger.py100644 1007 1403 15427 6766216576 21071 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- import asynchat import socket import string import time # these three are for the rotating logger import os # | import stat # v # # three types of log: # 1) file # with optional flushing. Also, one that rotates the log. # 2) socket # dump output directly to a socket connection. [how do we # keep it open?] # 3) syslog # log to syslog via tcp. this is a per-line protocol. # # # The 'standard' interface to a logging object is simply # log_object.log (message) # # a file-like object that captures output, and # makes sure to flush it always... this could # be connected to: # o stdio file # o low-level file # o socket channel # o syslog output... class file_logger: # pass this either a path or a file object. def __init__ (self, file, flush=1, mode='a'): if type(file) == type(''): if (file == '-'): import sys self.file = sys.stdout else: self.file = open (file, mode) else: self.file = file self.do_flush = flush def __repr__ (self): return '' % self.file def write (self, data): self.file.write (data) self.maybe_flush() def writeline (self, line): self.file.writeline (line) self.maybe_flush() def writelines (self, lines): self.file.writelines (lines) self.maybe_flush() def maybe_flush (self): if self.do_flush: self.file.flush() def flush (self): self.file.flush() def softspace (self, *args): pass def log (self, message): if message[-1] not in ('\r', '\n'): self.write (message + '\n') else: self.write (message) # like a file_logger, but it must be attached to a filename. # When the log gets too full, or a certain time has passed, # it backs up the log and starts a new one. Note that backing # up the log is done via "mv" because anything else (cp, gzip) # would take time, during which medusa would do nothing else. class rotating_file_logger (file_logger): # If freq is non-None we back up "daily", "weekly", or "monthly". # Else if maxsize is non-None we back up whenever the log gets # to big. If both are None we never back up. def __init__ (self, file, freq=None, maxsize=None, flush=1, mode='a'): self.filename = file self.mode = mode self.file = open (file, mode) self.freq = freq self.maxsize = maxsize self.rotate_when = self.next_backup(self.freq) self.do_flush = flush def __repr__ (self): return '' % self.file # We back up at midnight every 1) day, 2) monday, or 3) 1st of month def next_backup (self, freq): (yr, mo, day, hr, min, sec, wd, jday, dst) = time.localtime(time.time()) if freq == 'daily': return time.mktime(yr,mo,day+1, 0,0,0, 0,0,-1) elif freq == 'weekly': return time.mktime(yr,mo,day-wd+7, 0,0,0, 0,0,-1) # wd(monday)==0 elif freq == 'monthly': return time.mktime(yr,mo+1,1, 0,0,0, 0,0,-1) else: return None # not a date-based backup def maybe_flush (self): # rotate first if necessary self.maybe_rotate() if self.do_flush: # from file_logger() self.file.flush() def maybe_rotate (self): if self.freq and time.time() > self.rotate_when: self.rotate() self.rotate_when = self.next_backup(self.freq) elif self.maxsize: # rotate when we get too big try: if os.stat(self.filename)[stat.ST_SIZE] > self.maxsize: self.rotate() except os.error: # file not found, probably self.rotate() # will create a new file def rotate (self): (yr, mo, day, hr, min, sec, wd, jday, dst) = time.localtime(time.time()) try: self.file.close() newname = '%s.ends%04d%02d%02d' % (self.filename, yr, mo, day) try: open(newname, "r").close() # check if file exists newname = newname + "-%02d%02d%02d" % (hr, min, sec) except: # YEARMODY is unique pass os.rename(self.filename, newname) self.file = open(self.filename, self.mode) except: pass # syslog is a line-oriented log protocol - this class would be # appropriate for FTP or HTTP logs, but not for dumping stderr to. # TODO: a simple safety wrapper that will ensure that the line sent # to syslog is reasonable. # TODO: async version of syslog_client: now, log entries use blocking # send() import m_syslog syslog_logger = m_syslog.syslog_client class syslog_logger (m_syslog.syslog_client): def __init__ (self, address, facility='user'): m_syslog.syslog_client.__init__ (self, address) self.facility = m_syslog.facility_names[facility] self.address=address def __repr__ (self): return '' % (repr(self.address)) def log (self, message): m_syslog.syslog_client.log ( self, message, facility=self.facility, priority=m_syslog.LOG_INFO ) # log to a stream socket, asynchronously class socket_logger (asynchat.async_chat): def __init__ (self, address): if type(address) == type(''): self.create_socket (socket.AF_UNIX, socket.SOCK_STREAM) else: self.create_socket (socket.AF_INET, socket.SOCK_STREAM) self.connect (address) self.address = address def __repr__ (self): return '' % (self.address) def log (self, message): if message[-2:] != '\r\n': self.socket.push (message + '\r\n') else: self.socket.push (message) # log to multiple places class multi_logger: def __init__ (self, loggers): self.loggers = loggers def __repr__ (self): return '' % (repr(self.loggers)) def log (self, message): for logger in self.loggers: logger.log (message) class resolving_logger: """Feed (ip, message) combinations into this logger to get a resolved hostname in front of the message. The message will not be logged until the PTR request finishes (or fails).""" def __init__ (self, resolver, logger): self.resolver = resolver self.logger = logger class logger_thunk: def __init__ (self, message, logger): self.message = message self.logger = logger def __call__ (self, host, ttl, answer): if not answer: answer = host self.logger.log ('%s%s' % (answer, self.message)) def log (self, ip, message): self.resolver.resolve_ptr ( ip, self.logger_thunk ( message, self.logger ) ) class unresolving_logger: "Just in case you don't want to resolve" def __init__ (self, logger): self.logger = logger def log (self, ip, message): self.logger.log ('%s:%s' % (ip, message)) def strip_eol (line): while line and line[-1] in '\r\n': line = line[:-1] return line class tail_logger: "Keep track of the last log messages" def __init__ (self, logger, size=500): self.size = size self.logger = logger self.messages = [] def log (self, message): self.messages.append (strip_eol (message)) if len (self.messages) > self.size: del self.messages[0] self.logger.log (message) Zope-2.0.1-ZEO-nonbin/ZServer/medusa/m_syslog.py100644 1007 1403 13221 6703245715 21420 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- # ====================================================================== # Copyright 1997 by Sam Rushing # # All Rights Reserved # # Permission to use, copy, modify, and distribute this software and # its documentation for any purpose and without fee is hereby # granted, provided that the above copyright notice appear in all # copies and that both that copyright notice and this permission # notice appear in supporting documentation, and that the name of Sam # Rushing not be used in advertising or publicity pertaining to # distribution of the software without specific, written prior # permission. # # SAM RUSHING DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, # INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN # NO EVENT SHALL SAM RUSHING BE LIABLE FOR ANY SPECIAL, INDIRECT OR # CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS # OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, # NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN # CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. # ====================================================================== """socket interface to unix syslog. On Unix, there are usually two ways of getting to syslog: via a local unix-domain socket, or via the TCP service. Usually "/dev/log" is the unix domain socket. This may be different for other systems. >>> my_client = syslog_client ('/dev/log') Otherwise, just use the UDP version, port 514. >>> my_client = syslog_client (('my_log_host', 514)) On win32, you will have to use the UDP version. Note that you can use this to log to other hosts (and indeed, multiple hosts). This module is not a drop-in replacement for the python extension module - the interface is different. Usage: >>> c = syslog_client() >>> c = syslog_client ('/strange/non_standard_log_location') >>> c = syslog_client (('other_host.com', 514)) >>> c.log ('testing', facility='local0', priority='debug') """ # TODO: support named-pipe syslog. # [see ftp://sunsite.unc.edu/pub/Linux/system/Daemons/syslog-fifo.tar.z] # from : # =========================================================================== # priorities/facilities are encoded into a single 32-bit quantity, where the # bottom 3 bits are the priority (0-7) and the top 28 bits are the facility # (0-big number). Both the priorities and the facilities map roughly # one-to-one to strings in the syslogd(8) source code. This mapping is # included in this file. # # priorities (these are ordered) LOG_EMERG = 0 # system is unusable LOG_ALERT = 1 # action must be taken immediately LOG_CRIT = 2 # critical conditions LOG_ERR = 3 # error conditions LOG_WARNING = 4 # warning conditions LOG_NOTICE = 5 # normal but significant condition LOG_INFO = 6 # informational LOG_DEBUG = 7 # debug-level messages # facility codes LOG_KERN = 0 # kernel messages LOG_USER = 1 # random user-level messages LOG_MAIL = 2 # mail system LOG_DAEMON = 3 # system daemons LOG_AUTH = 4 # security/authorization messages LOG_SYSLOG = 5 # messages generated internally by syslogd LOG_LPR = 6 # line printer subsystem LOG_NEWS = 7 # network news subsystem LOG_UUCP = 8 # UUCP subsystem LOG_CRON = 9 # clock daemon LOG_AUTHPRIV = 10 # security/authorization messages (private) # other codes through 15 reserved for system use LOG_LOCAL0 = 16 # reserved for local use LOG_LOCAL1 = 17 # reserved for local use LOG_LOCAL2 = 18 # reserved for local use LOG_LOCAL3 = 19 # reserved for local use LOG_LOCAL4 = 20 # reserved for local use LOG_LOCAL5 = 21 # reserved for local use LOG_LOCAL6 = 22 # reserved for local use LOG_LOCAL7 = 23 # reserved for local use priority_names = { "alert": LOG_ALERT, "crit": LOG_CRIT, "debug": LOG_DEBUG, "emerg": LOG_EMERG, "err": LOG_ERR, "error": LOG_ERR, # DEPRECATED "info": LOG_INFO, "notice": LOG_NOTICE, "panic": LOG_EMERG, # DEPRECATED "warn": LOG_WARNING, # DEPRECATED "warning": LOG_WARNING, } facility_names = { "auth": LOG_AUTH, "authpriv": LOG_AUTHPRIV, "cron": LOG_CRON, "daemon": LOG_DAEMON, "kern": LOG_KERN, "lpr": LOG_LPR, "mail": LOG_MAIL, "news": LOG_NEWS, "security": LOG_AUTH, # DEPRECATED "syslog": LOG_SYSLOG, "user": LOG_USER, "uucp": LOG_UUCP, "local0": LOG_LOCAL0, "local1": LOG_LOCAL1, "local2": LOG_LOCAL2, "local3": LOG_LOCAL3, "local4": LOG_LOCAL4, "local5": LOG_LOCAL5, "local6": LOG_LOCAL6, "local7": LOG_LOCAL7, } import socket class syslog_client: def __init__ (self, address='/dev/log'): self.address = address if type (address) == type(''): self.socket = socket.socket (socket.AF_UNIX, socket.SOCK_STREAM) self.socket.connect (address) self.unix = 1 else: self.socket = socket.socket (socket.AF_INET, socket.SOCK_DGRAM) self.unix = 0 # curious: when talking to the unix-domain '/dev/log' socket, a # zero-terminator seems to be required. this string is placed # into a class variable so that it can be overridden if # necessary. log_format_string = '<%d>%s\000' def log (self, message, facility=LOG_USER, priority=LOG_INFO): message = self.log_format_string % ( self.encode_priority (facility, priority), message ) if self.unix: self.socket.send (message) else: self.socket.sendto (message, self.address) def encode_priority (self, facility, priority): if type(facility) == type(''): facility = facility_names[facility] if type(priority) == type(''): priority = priority_names[priority] return (facility<<3) | priority def close (self): if self.unix: self.socket.close() Zope-2.0.1-ZEO-nonbin/ZServer/medusa/max_sockets.py100644 1007 1403 2172 6745124636 22073 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- import socket import select # several factors here we might want to test: # 1) max we can create # 2) max we can bind # 3) max we can listen on # 4) max we can connect def max_server_sockets(): sl = [] while 1: try: s = socket.socket (socket.AF_INET, socket.SOCK_STREAM) s.bind (('',0)) s.listen(5) sl.append (s) except: break num = len(sl) for s in sl: s.close() del sl return num def max_client_sockets(): # make a server socket server = socket.socket (socket.AF_INET, socket.SOCK_STREAM) server.bind (('', 9999)) server.listen (5) sl = [] while 1: try: s = socket.socket (socket.AF_INET, socket.SOCK_STREAM) s.connect (('', 9999)) conn, addr = server.accept() sl.append ((s,conn)) except: break num = len(sl) for s,c in sl: s.close() c.close() del sl return num def max_select_sockets(): sl = [] while 1: try: s = socket.socket (socket.AF_INET, socket.SOCK_STREAM) s.bind (('',0)) s.listen(5) sl.append (s) select.select(sl,[],[],0) except: break num = len(sl) - 1 for s in sl: s.close() del sl return num Zope-2.0.1-ZEO-nonbin/ZServer/medusa/medusa_gif.py100644 1007 1403 5324 6703245715 21654 0ustar petrillipetrilli# -*- Mode: Python -*- # the medusa icon as a python source file. width = 97 height = 61 data = 'GIF89aa\000=\000\204\000\000\000\000\000\255\255\255\245\245\245ssskkkccc111)))\326\326\326!!!\316\316\316\300\300\300\204\204\000\224\224\224\214\214\214\200\200\200RRR\377\377\377JJJ\367\367\367BBB\347\347\347\000\204\000\020\020\020\265\265\265\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000!\371\004\001\000\000\021\000,\000\000\000\000a\000=\000\000\005\376`$\216di\236h\252\256l\353\276p,\317tm\337x\256\357|m\001@\240E\305\000\364\2164\206R)$\005\201\214\007r\012{X\255\312a\004\260\\>\026\3240\353)\224n\001W+X\334\373\231~\344.\303b\216\024\027x<\273\307\255G,rJiWN\014{S}k"?ti\013EdPQ\207G@_%\000\026yy\\\201\202\227\224<\221Fs$pOjWz\241\272\002\325\307g\012(\007\205\312#j\317(\012A\200\224.\241\003\346GS\247\033\245\344\264\366\015L\'PXQl]\266\263\243\232\260?\245\316\371\362\225\035\332\243J\273\332Q\263\357-D\241T\327\270\265\013W&\330\010u\371b\322IW0\214\261]\003\033Va\365Z#\207\213a\030k\2647\262\014p\354\024[n\321N\363\346\317\003\037P\000\235C\302\000\3228(\244\363YaA\005\022\255_\237@\260\000A\212\326\256qbp\321\332\266\011\334=T\023\010"!B\005\003A\010\224\020\220 H\002\337#\020 O\276E\357h\221\327\003\\\000b@v\004\351A.h\365\354\342B\002\011\257\025\\ \220\340\301\353\006\000\024\214\200pA\300\353\012\364\241k/\340\033C\202\003\000\310fZ\011\003V\240R\005\007\354\376\026A\000\000\360\'\202\177\024\004\210\003\000\305\215\360\000\000\015\220\240\332\203\027@\'\202\004\025VpA\000%\210x\321\206\032J\341\316\010\262\211H"l\333\341\200\200>"]P\002\212\011\010`\002\0066FP\200\001\'\024p]\004\027(8B\221\306]\000\201w>\002iB\001\007\340\260"v7J1\343(\257\020\251\243\011\242i\263\017\215\337\035\220\200\221\365m4d\015\016D\251\341iN\354\346Ng\253\200I\240\031\35609\245\2057\311I\302\2007t\231"&`\314\310\244\011e\226(\236\010w\212\300\234\011\012HX(\214\253\311@\001\233^\222pg{% \340\035\224&H\000\246\201\362\215`@\001"L\340\004\030\234\022\250\'\015(V:\302\235\030\240q\337\205\224\212h@\177\006\000\250\210\004\007\310\207\337\005\257-P\346\257\367]p\353\203\271\256:\203\236\211F\340\247\010\3329g\244\010\307*=A\000\203\260y\012\304s#\014\007D\207,N\007\304\265\027\021C\233\207%B\366[m\353\006\006\034j\360\306+\357\274a\204\000\000;' Zope-2.0.1-ZEO-nonbin/ZServer/medusa/mime_type_table.py100644 1007 1403 7545 6703245715 22717 0ustar petrillipetrilli# -*- Python -*- # Converted by ./convert_mime_type_table.py from: # /usr/src2/apache_1.2b6/conf/mime.types # content_type_map = \ { 'ai': 'application/postscript', 'aif': 'audio/x-aiff', 'aifc': 'audio/x-aiff', 'aiff': 'audio/x-aiff', 'au': 'audio/basic', 'avi': 'video/x-msvideo', 'bcpio': 'application/x-bcpio', 'bin': 'application/octet-stream', 'cdf': 'application/x-netcdf', 'class': 'application/octet-stream', 'cpio': 'application/x-cpio', 'cpt': 'application/mac-compactpro', 'csh': 'application/x-csh', 'dcr': 'application/x-director', 'dir': 'application/x-director', 'dms': 'application/octet-stream', 'doc': 'application/msword', 'dvi': 'application/x-dvi', 'dxr': 'application/x-director', 'eps': 'application/postscript', 'etx': 'text/x-setext', 'exe': 'application/octet-stream', 'gif': 'image/gif', 'gtar': 'application/x-gtar', 'gz': 'application/x-gzip', 'hdf': 'application/x-hdf', 'hqx': 'application/mac-binhex40', 'htm': 'text/html', 'html': 'text/html', 'ice': 'x-conference/x-cooltalk', 'ief': 'image/ief', 'jpe': 'image/jpeg', 'jpeg': 'image/jpeg', 'jpg': 'image/jpeg', 'kar': 'audio/midi', 'latex': 'application/x-latex', 'lha': 'application/octet-stream', 'lzh': 'application/octet-stream', 'man': 'application/x-troff-man', 'me': 'application/x-troff-me', 'mid': 'audio/midi', 'midi': 'audio/midi', 'mif': 'application/x-mif', 'mov': 'video/quicktime', 'movie': 'video/x-sgi-movie', 'mp2': 'audio/mpeg', 'mpe': 'video/mpeg', 'mpeg': 'video/mpeg', 'mpg': 'video/mpeg', 'mpga': 'audio/mpeg', 'mp3': 'audio/mpeg', 'ms': 'application/x-troff-ms', 'nc': 'application/x-netcdf', 'oda': 'application/oda', 'pbm': 'image/x-portable-bitmap', 'pdb': 'chemical/x-pdb', 'pdf': 'application/pdf', 'pgm': 'image/x-portable-graymap', 'png': 'image/png', 'pnm': 'image/x-portable-anymap', 'ppm': 'image/x-portable-pixmap', 'ppt': 'application/powerpoint', 'ps': 'application/postscript', 'qt': 'video/quicktime', 'ra': 'audio/x-realaudio', 'ram': 'audio/x-pn-realaudio', 'ras': 'image/x-cmu-raster', 'rgb': 'image/x-rgb', 'roff': 'application/x-troff', 'rpm': 'audio/x-pn-realaudio-plugin', 'rtf': 'application/rtf', 'rtx': 'text/richtext', 'sgm': 'text/x-sgml', 'sgml': 'text/x-sgml', 'sh': 'application/x-sh', 'shar': 'application/x-shar', 'sit': 'application/x-stuffit', 'skd': 'application/x-koan', 'skm': 'application/x-koan', 'skp': 'application/x-koan', 'skt': 'application/x-koan', 'snd': 'audio/basic', 'src': 'application/x-wais-source', 'sv4cpio': 'application/x-sv4cpio', 'sv4crc': 'application/x-sv4crc', 't': 'application/x-troff', 'tar': 'application/x-tar', 'tcl': 'application/x-tcl', 'tex': 'application/x-tex', 'texi': 'application/x-texinfo', 'texinfo': 'application/x-texinfo', 'tif': 'image/tiff', 'tiff': 'image/tiff', 'tr': 'application/x-troff', 'tsv': 'text/tab-separated-values', 'txt': 'text/plain', 'ustar': 'application/x-ustar', 'vcd': 'application/x-cdlink', 'vrml': 'x-world/x-vrml', 'wav': 'audio/x-wav', 'wrl': 'x-world/x-vrml', 'xbm': 'image/x-xbitmap', 'xpm': 'image/x-xpixmap', 'xwd': 'image/x-xwindowdump', 'xyz': 'chemical/x-pdb', 'zip': 'application/zip', } Zope-2.0.1-ZEO-nonbin/ZServer/medusa/monitor.py100644 1007 1403 25633 6745400111 21252 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- # Author: Sam Rushing # # python REPL channel. # RCS_ID = '$Id: monitor.py,v 1.5 1999/07/21 17:15:53 klm Exp $' import md5 import socket import string import sys import time import traceback VERSION = string.split(RCS_ID)[2] import asyncore import asynchat from counter import counter import producers class monitor_channel (asynchat.async_chat): try_linemode = 1 def __init__ (self, server, sock, addr): asynchat.async_chat.__init__ (self, sock) self.server = server self.addr = addr self.set_terminator ('\r\n') self.data = '' # local bindings specific to this channel self.local_env = {} self.push ('Python ' + sys.version + '\r\n') self.push (sys.copyright+'\r\n') self.push ('Welcome to %s\r\n' % self) self.push ("[Hint: try 'from __main__ import *']\r\n") self.prompt() self.number = server.total_sessions.as_long() self.line_counter = counter() self.multi_line = [] def handle_connect (self): # send IAC DO LINEMODE self.push ('\377\375\"') def close (self): self.server.closed_sessions.increment() asynchat.async_chat.close(self) def prompt (self): self.push ('>>> ') def collect_incoming_data (self, data): self.data = self.data + data if len(self.data) > 1024: # denial of service. self.push ('BCNU\r\n') self.close_when_done() def found_terminator (self): line = self.clean_line (self.data) self.data = '' self.line_counter.increment() # check for special case inputs... if not line and not self.multi_line: self.prompt() return if line in ['\004', 'exit']: self.push ('BCNU\r\n') self.close_when_done() return oldout = sys.stdout olderr = sys.stderr try: p = output_producer(self, olderr) sys.stdout = p sys.stderr = p try: # this is, of course, a blocking operation. # if you wanted to thread this, you would have # to synchronize, etc... and treat the output # like a pipe. Not Fun. # # try eval first. If that fails, try exec. If that fails, # hurl. try: if self.multi_line: # oh, this is horrible... raise SyntaxError co = compile (line, repr(self), 'eval') result = eval (co, self.local_env) method = 'eval' if result is not None: self.log_info(repr(result)) print repr(result) self.local_env['_'] = result except SyntaxError: try: if self.multi_line: if line and line[0] in [' ','\t']: self.multi_line.append (line) self.push ('... ') return else: self.multi_line.append (line) line = string.join (self.multi_line, '\n') co = compile (line, repr(self), 'exec') self.multi_line = [] else: co = compile (line, repr(self), 'exec') except SyntaxError, why: if why[0] == 'unexpected EOF while parsing': self.push ('... ') self.multi_line.append (line) return exec co in self.local_env method = 'exec' except: method = 'exception' self.multi_line = [] t, v, tb = sys.exc_info() (file, fun, line), t, v, tbinfo = asyncore.compact_traceback() self.log_info('%s %s %s' %(t, v, tbinfo), 'warning') traceback.print_exception(t, v, tb) del tb finally: sys.stdout = oldout sys.stderr = olderr self.log_info('%s:%s (%s)> %s' % ( self.number, self.line_counter, method, repr(line)) ) self.push_with_producer (p) self.prompt() # for now, we ignore any telnet option stuff sent to # us, and we process the backspace key ourselves. # gee, it would be fun to write a full-blown line-editing # environment, etc... def clean_line (self, line): chars = [] for ch in line: oc = ord(ch) if oc < 127: if oc in [8,177]: # backspace chars = chars[:-1] else: chars.append (ch) return string.join (chars, '') class monitor_server (asyncore.dispatcher): SERVER_IDENT = 'Monitor Server (V%s)' % VERSION channel_class = monitor_channel def __init__ (self, hostname='127.0.0.1', port=8023): self.hostname = hostname self.port = port self.create_socket (socket.AF_INET, socket.SOCK_STREAM) self.set_reuse_addr() self.bind ((hostname, port)) self.log_info('%s started on port %d' % (self.SERVER_IDENT, port)) self.listen (5) self.closed = 0 self.failed_auths = 0 self.total_sessions = counter() self.closed_sessions = counter() def writable (self): return 0 def handle_accept (self): conn, addr = self.accept() self.log_info('Incoming monitor connection from %s:%d' % addr) self.channel_class (self, conn, addr) self.total_sessions.increment() def status (self): return producers.simple_producer ( '

    %s

    ' % self.SERVER_IDENT + '
    Total Sessions: %s' % self.total_sessions + '
    Current Sessions: %d' % ( self.total_sessions.as_long()-self.closed_sessions.as_long() ) ) def hex_digest (s): m = md5.md5() m.update (s) return string.joinfields ( map (lambda x: hex (ord (x))[2:], map (None, m.digest())), '', ) class secure_monitor_channel (monitor_channel): authorized = 0 def __init__ (self, server, sock, addr): asynchat.async_chat.__init__ (self, sock) self.server = server self.addr = addr self.set_terminator ('\r\n') self.data = '' # local bindings specific to this channel self.local_env = {} # send timestamp string self.timestamp = str(time.time()) self.count = 0 self.line_counter = counter() self.number = int(server.total_sessions.as_long()) self.multi_line = [] self.push (self.timestamp + '\r\n') def found_terminator (self): if not self.authorized: if hex_digest ('%s%s' % (self.timestamp, self.server.password)) != self.data: self.log_info ('%s: failed authorization' % self, 'warning') self.server.failed_auths = self.server.failed_auths + 1 self.close() else: self.authorized = 1 self.push ('Python ' + sys.version + '\r\n') self.push (sys.copyright+'\r\n') self.push ('Welcome to %s\r\n' % self) self.push ("[Hint: try 'from __main__ import *']\r\n") self.prompt() self.data = '' else: monitor_channel.found_terminator (self) class secure_encrypted_monitor_channel (secure_monitor_channel): "Wrap send() and recv() with a stream cipher" def __init__ (self, server, conn, addr): key = server.password self.outgoing = server.cipher.new (key) self.incoming = server.cipher.new (key) secure_monitor_channel.__init__ (self, server, conn, addr) def send (self, data): # send the encrypted data instead ed = self.outgoing.encrypt (data) return secure_monitor_channel.send (self, ed) def recv (self, block_size): data = secure_monitor_channel.recv (self, block_size) if data: dd = self.incoming.decrypt (data) return dd else: return data class secure_monitor_server (monitor_server): channel_class = secure_monitor_channel def __init__ (self, password, hostname='', port=8023): monitor_server.__init__ (self, hostname, port) self.password = password def status (self): p = monitor_server.status (self) # kludge p.data = p.data + ('
    Failed Authorizations: %d' % self.failed_auths) return p # don't try to print from within any of the methods # of this object. 8^) class output_producer: def __init__ (self, channel, real_stderr): self.channel = channel self.data = '' # use _this_ for debug output self.stderr = real_stderr def check_data (self): if len(self.data) > 1<<16: # runaway output, close it. self.channel.close() def write (self, data): lines = string.splitfields (data, '\n') data = string.join (lines, '\r\n') self.data = self.data + data self.check_data() def writeline (self, line): self.data = self.data + line + '\r\n' self.check_data() def writelines (self, lines): self.data = self.data + string.joinfields ( lines, '\r\n' ) + '\r\n' self.check_data() def ready (self): return (len (self.data) > 0) def flush (self): pass def softspace (self, *args): pass def more (self): if self.data: result = self.data[:512] self.data = self.data[512:] return result else: return '' if __name__ == '__main__': import string import sys if '-s' in sys.argv: sys.argv.remove ('-s') print 'Enter password: ', password = raw_input() else: password = None if '-e' in sys.argv: sys.argv.remove ('-e') encrypt = 1 else: encrypt = 0 print sys.argv if len(sys.argv) > 1: port = string.atoi (sys.argv[1]) else: port = 8023 if password is not None: s = secure_monitor_server (password, '', port) if encrypt: s.channel_class = secure_encrypted_monitor_channel import sapphire s.cipher = sapphire else: s = monitor_server ('', port) asyncore.loop() Zope-2.0.1-ZEO-nonbin/ZServer/medusa/monitor_client.py100644 1007 1403 5362 6723300043 22564 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- # monitor client, unix version. import asyncore import asynchat import regsub import socket import string import sys import os import md5 import time class stdin_channel (asyncore.file_dispatcher): def handle_read (self): data = self.recv(512) if not data: print '\nclosed.' self.sock_channel.close() try: self.close() except: pass data = regsub.gsub ('\n', '\r\n', data) self.sock_channel.push (data) def writable (self): return 0 def log (self, *ignore): pass class monitor_client (asynchat.async_chat): def __init__ (self, password, addr=('',8023), socket_type=socket.AF_INET): asynchat.async_chat.__init__ (self) self.create_socket (socket_type, socket.SOCK_STREAM) self.terminator = '\r\n' self.connect (addr) self.sent_auth = 0 self.timestamp = '' self.password = password def collect_incoming_data (self, data): if not self.sent_auth: self.timestamp = self.timestamp + data else: sys.stdout.write (data) sys.stdout.flush() def found_terminator (self): if not self.sent_auth: self.push (hex_digest (self.timestamp + self.password) + '\r\n') self.sent_auth = 1 else: print def handle_close (self): # close all the channels, which will make the standard main # loop exit. map (lambda x: x.close(), asyncore.socket_map.keys()) def log (self, *ignore): pass class encrypted_monitor_client (monitor_client): "Wrap push() and recv() with a stream cipher" def init_cipher (self, cipher, key): self.outgoing = cipher.new (key) self.incoming = cipher.new (key) def push (self, data): # push the encrypted data instead return monitor_client.push (self, self.outgoing.encrypt (data)) def recv (self, block_size): data = monitor_client.recv (self, block_size) if data: return self.incoming.decrypt (data) else: return data def hex_digest (s): m = md5.md5() m.update (s) return string.join ( map (lambda x: hex (ord (x))[2:], map (None, m.digest())), '', ) if __name__ == '__main__': if len(sys.argv) == 1: print 'Usage: %s host port' % sys.argv[0] sys.exit(0) if ('-e' in sys.argv): encrypt = 1 sys.argv.remove ('-e') else: encrypt = 0 sys.stderr.write ('Enter Password: ') sys.stderr.flush() import os try: os.system ('stty -echo') p = raw_input() print finally: os.system ('stty echo') stdin = stdin_channel (0) if len(sys.argv) > 1: if encrypt: client = encrypted_monitor_client (p, (sys.argv[1], string.atoi (sys.argv[2]))) import sapphire client.init_cipher (sapphire, p) else: client = monitor_client (p, (sys.argv[1], string.atoi (sys.argv[2]))) else: # default to local host, 'standard' port client = monitor_client (p) stdin.sock_channel = client asyncore.loop() Zope-2.0.1-ZEO-nonbin/ZServer/medusa/monitor_client_win32.py100644 1007 1403 2242 6723300043 23600 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- # monitor client, win32 version # since we can't do select() on stdin/stdout, we simply # use threads and blocking sockets. import regsub import socket import string import sys import thread import md5 def hex_digest (s): m = md5.md5() m.update (s) return string.join ( map (lambda x: hex (ord (x))[2:], map (None, m.digest())), '', ) def reader (lock, sock, password): # first grab the timestamp ts = sock.recv (1024)[:-2] sock.send (hex_digest (ts+password) + '\r\n') while 1: d = sock.recv (1024) if not d: lock.release() print 'Connection closed. Hit to exit' thread.exit() sys.stdout.write (d) sys.stdout.flush() def writer (lock, sock, barrel="just kidding"): while lock.locked(): sock.send ( sys.stdin.readline()[:-1] + '\r\n' ) if __name__ == '__main__': if len(sys.argv) == 1: print 'Usage: %s host port' sys.exit(0) print 'Enter Password: ', p = raw_input() s = socket.socket (socket.AF_INET, socket.SOCK_STREAM) s.connect ((sys.argv[1], string.atoi(sys.argv[2]))) l = thread.allocate_lock() l.acquire() thread.start_new_thread (reader, (l, s, p)) writer (l, s) Zope-2.0.1-ZEO-nonbin/ZServer/medusa/producers.py100644 1007 1403 17323 6703245715 21601 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- RCS_ID = '$Id: producers.py,v 1.5 1999/04/09 00:37:33 amos Exp $' import string """ A collection of producers. Each producer implements a particular feature: They can be combined in various ways to get interesting and useful behaviors. For example, you can feed dynamically-produced output into the compressing producer, then wrap this with the 'chunked' transfer-encoding producer. """ class simple_producer: "producer for a string" def __init__ (self, data, buffer_size=1024): self.data = data self.buffer_size = buffer_size def more (self): if len (self.data) > self.buffer_size: result = self.data[:self.buffer_size] self.data = self.data[self.buffer_size:] return result else: result = self.data self.data = '' return result class scanning_producer: "like simple_producer, but more efficient for large strings" def __init__ (self, data, buffer_size=1024): self.data = data self.buffer_size = buffer_size self.pos = 0 def more (self): if self.pos < len(self.data): lp = self.pos rp = min ( len(self.data), self.pos + self.buffer_size ) result = self.data[lp:rp] self.pos = self.pos + len(result) return result else: return '' class lines_producer: "producer for a list of lines" def __init__ (self, lines): self.lines = lines def ready (self): return len(self.lines) def more (self): if self.lines: chunk = self.lines[:50] self.lines = self.lines[50:] return string.join (chunk, '\r\n') + '\r\n' else: return '' class buffer_list_producer: "producer for a list of buffers" # i.e., data == string.join (buffers, '') def __init__ (self, buffers): self.index = 0 self.buffers = buffers def more (self): if self.index >= len(self.buffers): return '' else: data = self.buffers[self.index] self.index = self.index + 1 return data class file_producer: "producer wrapper for file[-like] objects" # match http_channel's outgoing buffer size out_buffer_size = 1<<16 def __init__ (self, file): self.done = 0 self.file = file def more (self): if self.done: return '' else: data = self.file.read (self.out_buffer_size) if not data: self.file.close() del self.file self.done = 1 return '' else: return data # A simple output producer. This one does not [yet] have # the safety feature builtin to the monitor channel: runaway # output will not be caught. # don't try to print from within any of the methods # of this object. class output_producer: "Acts like an output file; suitable for capturing sys.stdout" def __init__ (self): self.data = '' def write (self, data): lines = string.splitfields (data, '\n') data = string.join (lines, '\r\n') self.data = self.data + data def writeline (self, line): self.data = self.data + line + '\r\n' def writelines (self, lines): self.data = self.data + string.joinfields ( lines, '\r\n' ) + '\r\n' def ready (self): return (len (self.data) > 0) def flush (self): pass def softspace (self, *args): pass def more (self): if self.data: result = self.data[:512] self.data = self.data[512:] return result else: return '' class composite_producer: "combine a fifo of producers into one" def __init__ (self, producers): self.producers = producers def more (self): while len(self.producers): p = self.producers.first() d = p.more() if d: return d else: self.producers.pop() else: return '' class globbing_producer: """ 'glob' the output from a producer into a particular buffer size. helps reduce the number of calls to send(). [this appears to gain about 30% performance on requests to a single channel] """ def __init__ (self, producer, buffer_size=1<<16): self.producer = producer self.buffer = '' self.buffer_size = buffer_size def more (self): while len(self.buffer) < self.buffer_size: data = self.producer.more() if data: self.buffer = self.buffer + data else: break r = self.buffer self.buffer = '' return r class hooked_producer: """ A producer that will call when it empties,. with an argument of the number of bytes produced. Useful for logging/instrumentation purposes. """ def __init__ (self, producer, function): self.producer = producer self.function = function self.bytes = 0 def more (self): if self.producer: result = self.producer.more() if not result: self.producer = None self.function (self.bytes) else: self.bytes = self.bytes + len(result) return result else: return '' # HTTP 1.1 emphasizes that an advertised Content-Length header MUST be # correct. In the face of Strange Files, it is conceivable that # reading a 'file' may produce an amount of data not matching that # reported by os.stat() [text/binary mode issues, perhaps the file is # being appended to, etc..] This makes the chunked encoding a True # Blessing, and it really ought to be used even with normal files. # How beautifully it blends with the concept of the producer. class chunked_producer: """A producer that implements the 'chunked' transfer coding for HTTP/1.1. Here is a sample usage: request['Transfer-Encoding'] = 'chunked' request.push ( producers.chunked_producer (your_producer) ) request.done() """ def __init__ (self, producer, footers=None): self.producer = producer self.footers = footers def more (self): if self.producer: data = self.producer.more() if data: return '%x\r\n%s\r\n' % (len(data), data) else: self.producer = None if self.footers: return string.join ( ['0'] + self.footers, '\r\n' ) + '\r\n\r\n' else: return '0\r\n\r\n' else: return '' # Unfortunately this isn't very useful right now (Aug 97), because # apparently the browsers don't do on-the-fly decompression. Which # is sad, because this could _really_ speed things up, especially for # low-bandwidth clients (i.e., most everyone). try: import zlib except ImportError: zlib = None class compressed_producer: """ Compress another producer on-the-fly, using ZLIB [Unfortunately, none of the current browsers seem to support this] """ # Note: It's not very efficient to have the server repeatedly # compressing your outgoing files: compress them ahead of time, or # use a compress-once-and-store scheme. However, if you have low # bandwidth and low traffic, this may make more sense than # maintaining your source files compressed. # # Can also be used for compressing dynamically-produced output. def __init__ (self, producer, level=5): self.producer = producer self.compressor = zlib.compressobj (level) def more (self): if self.producer: cdata = '' # feed until we get some output while not cdata: data = self.producer.more() if not data: self.producer = None return self.compressor.flush() else: cdata = self.compressor.compress (data) return cdata else: return '' class escaping_producer: "A producer that escapes a sequence of characters" " Common usage: escaping the CRLF.CRLF sequence in SMTP, NNTP, etc..." def __init__ (self, producer, esc_from='\r\n.', esc_to='\r\n..'): self.producer = producer self.esc_from = esc_from self.esc_to = esc_to self.buffer = '' from asynchat import find_prefix_at_end self.find_prefix_at_end = find_prefix_at_end def more (self): esc_from = self.esc_from esc_to = self.esc_to buffer = self.buffer + self.producer.more() if buffer: buffer = string.replace (buffer, esc_from, esc_to) i = self.find_prefix_at_end (buffer, esc_from) if i: # we found a prefix self.buffer = buffer[-i:] return buffer[:-i] else: # no prefix, return it all self.buffer = '' return buffer else: return buffer Zope-2.0.1-ZEO-nonbin/ZServer/medusa/resolver.py100644 1007 1403 31313 6745124636 21433 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- # # Author: Sam Rushing # RCS_ID = '$Id: resolver.py,v 1.4 1999/07/20 16:53:50 amos Exp $' # Fast, low-overhead asynchronous name resolver. uses 'pre-cooked' # DNS requests, unpacks only as much as it needs of the reply. # see rfc1035 for details import string import asyncore import socket import sys import time from counter import counter VERSION = string.split(RCS_ID)[2] # header # 1 1 1 1 1 1 # 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | ID | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # |QR| Opcode |AA|TC|RD|RA| Z | RCODE | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | QDCOUNT | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | ANCOUNT | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | NSCOUNT | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | ARCOUNT | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # question # 1 1 1 1 1 1 # 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | | # / QNAME / # / / # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | QTYPE | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | QCLASS | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # build a DNS address request, _quickly_ def fast_address_request (host, id=0): return ( '%c%c' % (chr((id>>8)&0xff),chr(id&0xff)) + '\001\000\000\001\000\000\000\000\000\000%s\000\000\001\000\001' % ( string.join ( map ( lambda part: '%c%s' % (chr(len(part)),part), string.split (host, '.') ), '' ) ) ) def fast_ptr_request (host, id=0): return ( '%c%c' % (chr((id>>8)&0xff),chr(id&0xff)) + '\001\000\000\001\000\000\000\000\000\000%s\000\000\014\000\001' % ( string.join ( map ( lambda part: '%c%s' % (chr(len(part)),part), string.split (host, '.') ), '' ) ) ) def unpack_name (r,pos): n = [] while 1: ll = ord(r[pos]) if (ll&0xc0): # compression pos = (ll&0x3f << 8) + (ord(r[pos+1])) elif ll == 0: break else: pos = pos + 1 n.append (r[pos:pos+ll]) pos = pos + ll return string.join (n,'.') def skip_name (r,pos): s = pos while 1: ll = ord(r[pos]) if (ll&0xc0): # compression return pos + 2 elif ll == 0: pos = pos + 1 break else: pos = pos + ll + 1 return pos def unpack_ttl (r,pos): return reduce ( lambda x,y: (x<<8)|y, map (ord, r[pos:pos+4]) ) # resource record # 1 1 1 1 1 1 # 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | | # / / # / NAME / # | | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | TYPE | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | CLASS | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | TTL | # | | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ # | RDLENGTH | # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--| # / RDATA / # / / # +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+ def unpack_address_reply (r): ancount = (ord(r[6])<<8) + (ord(r[7])) # skip question, first name starts at 12, # this is followed by QTYPE and QCLASS pos = skip_name (r, 12) + 4 if ancount: # we are looking very specifically for # an answer with TYPE=A, CLASS=IN (\000\001\000\001) for an in range(ancount): pos = skip_name (r, pos) if r[pos:pos+4] == '\000\001\000\001': return ( unpack_ttl (r,pos+4), '%d.%d.%d.%d' % tuple(map(ord,r[pos+10:pos+14])) ) # skip over TYPE, CLASS, TTL, RDLENGTH, RDATA pos = pos + 8 rdlength = (ord(r[pos])<<8) + (ord(r[pos+1])) pos = pos + 2 + rdlength return 0, None else: return 0, None def unpack_ptr_reply (r): ancount = (ord(r[6])<<8) + (ord(r[7])) # skip question, first name starts at 12, # this is followed by QTYPE and QCLASS pos = skip_name (r, 12) + 4 if ancount: # we are looking very specifically for # an answer with TYPE=PTR, CLASS=IN (\000\014\000\001) for an in range(ancount): pos = skip_name (r, pos) if r[pos:pos+4] == '\000\014\000\001': return ( unpack_ttl (r,pos+4), unpack_name (r, pos+10) ) # skip over TYPE, CLASS, TTL, RDLENGTH, RDATA pos = pos + 8 rdlength = (ord(r[pos])<<8) + (ord(r[pos+1])) pos = pos + 2 + rdlength return 0, None else: return 0, None # This is a UDP (datagram) resolver. # # It may be useful to implement a TCP resolver. This would presumably # give us more reliable behavior when things get too busy. A TCP # client would have to manage the connection carefully, since the # server is allowed to close it at will (the RFC recommends closing # after 2 minutes of idle time). # # Note also that the TCP client will have to prepend each request # with a 2-byte length indicator (see rfc1035). # class resolver (asyncore.dispatcher): id = counter() def __init__ (self, server='127.0.0.1'): asyncore.dispatcher.__init__ (self) self.create_socket (socket.AF_INET, socket.SOCK_DGRAM) self.server = server self.request_map = {} self.last_reap_time = int(time.time()) # reap every few minutes def writable (self): return 0 def log (self, *args): pass def handle_close (self): self.log_info('closing!') self.close() def handle_error (self): # don't close the connection on error (file,fun,line), t, v, tbinfo = asyncore.compact_traceback() self.log_info( 'Problem with DNS lookup (%s:%s %s)' % (t, v, tbinfo), 'error') def get_id (self): return (self.id.as_long() % (1<<16)) def reap (self): # find DNS requests that have timed out now = int(time.time()) if now - self.last_reap_time > 180: # reap every 3 minutes self.last_reap_time = now # update before we forget for k,(host,unpack,callback,when) in self.request_map.items(): if now - when > 180: # over 3 minutes old del self.request_map[k] try: # same code as in handle_read callback (host, 0, None) # timeout val is (0,None) except: (file,fun,line), t, v, tbinfo = asyncore.compact_traceback() self.log_info('%s %s %s' % (t,v,tbinfo), 'error') def resolve (self, host, callback): self.reap() # first, get rid of old guys self.socket.sendto ( fast_address_request (host, self.get_id()), (self.server, 53) ) self.request_map [self.get_id()] = ( host, unpack_address_reply, callback, int(time.time())) self.id.increment() def resolve_ptr (self, host, callback): self.reap() # first, get rid of old guys ip = string.split (host, '.') ip.reverse() ip = string.join (ip, '.') + '.in-addr.arpa' self.socket.sendto ( fast_ptr_request (ip, self.get_id()), (self.server, 53) ) self.request_map [self.get_id()] = ( host, unpack_ptr_reply, callback, int(time.time())) self.id.increment() def handle_read (self): reply, whence = self.socket.recvfrom (512) # for security reasons we may want to double-check # that is the server we sent the request to. id = (ord(reply[0])<<8) + ord(reply[1]) if self.request_map.has_key (id): host, unpack, callback, when = self.request_map[id] del self.request_map[id] ttl, answer = unpack (reply) try: callback (host, ttl, answer) except: (file,fun,line), t, v, tbinfo = asyncore.compact_traceback() self.log_info('%s %s %s' % ( t,v,tbinfo), 'error') class rbl (resolver): def resolve_maps (self, host, callback): ip = string.split (host, '.') ip.reverse() ip = string.join (ip, '.') + '.rbl.maps.vix.com' self.socket.sendto ( fast_ptr_request (ip, self.get_id()), (self.server, 53) ) self.request_map [self.get_id()] = host, self.check_reply, callback self.id.increment() def check_reply (self, r): # we only need to check RCODE. rcode = (ord(r[3])&0xf) self.log_info('MAPS RBL; RCODE =%02x\n %s' % (rcode, repr(r))) return 0, rcode # (ttl, answer) class hooked_callback: def __init__ (self, hook, callback): self.hook, self.callback = hook, callback def __call__ (self, *args): apply (self.hook, args) apply (self.callback, args) class caching_resolver (resolver): "Cache DNS queries. Will need to honor the TTL value in the replies" def __init__ (*args): apply (resolver.__init__, args) self = args[0] self.cache = {} self.forward_requests = counter() self.reverse_requests = counter() self.cache_hits = counter() def resolve (self, host, callback): self.forward_requests.increment() if self.cache.has_key (host): when, ttl, answer = self.cache[host] # ignore TTL for now callback (host, ttl, answer) self.cache_hits.increment() else: resolver.resolve ( self, host, hooked_callback ( self.callback_hook, callback ) ) def resolve_ptr (self, host, callback): self.reverse_requests.increment() if self.cache.has_key (host): when, ttl, answer = self.cache[host] # ignore TTL for now callback (host, ttl, answer) self.cache_hits.increment() else: resolver.resolve_ptr ( self, host, hooked_callback ( self.callback_hook, callback ) ) def callback_hook (self, host, ttl, answer): self.cache[host] = time.time(), ttl, answer SERVER_IDENT = 'Caching DNS Resolver (V%s)' % VERSION def status (self): import status_handler import producers return producers.simple_producer ( '

    %s

    ' % self.SERVER_IDENT + '
    Server: %s' % self.server + '
    Cache Entries: %d' % len(self.cache) + '
    Outstanding Requests: %d' % len(self.request_map) + '
    Forward Requests: %s' % self.forward_requests + '
    Reverse Requests: %s' % self.reverse_requests + '
    Cache Hits: %s' % self.cache_hits ) #test_reply = """\000\000\205\200\000\001\000\001\000\002\000\002\006squirl\011nightmare\003com\000\000\001\000\001\300\014\000\001\000\001\000\001Q\200\000\004\315\240\260\005\011nightmare\003com\000\000\002\000\001\000\001Q\200\000\002\300\014\3006\000\002\000\001\000\001Q\200\000\015\003ns1\003iag\003net\000\300\014\000\001\000\001\000\001Q\200\000\004\315\240\260\005\300]\000\001\000\001\000\000\350\227\000\004\314\033\322\005""" # def test_unpacker (): # print unpack_address_reply (test_reply) # # import time # class timer: # def __init__ (self): # self.start = time.time() # def end (self): # return time.time() - self.start # # # I get ~290 unpacks per second for the typical case, compared to ~48 # # using dnslib directly. also, that latter number does not include # # picking the actual data out. # # def benchmark_unpacker(): # # r = range(1000) # t = timer() # for i in r: # unpack_address_reply (test_reply) # print '%.2f unpacks per second' % (1000.0 / t.end()) if __name__ == '__main__': import sys if len(sys.argv) == 1: print 'usage: %s [-r] [-s ] host [host ...]' % sys.argv[0] sys.exit(0) elif ('-s' in sys.argv): i = sys.argv.index('-s') server = sys.argv[i+1] del sys.argv[i:i+2] else: server = '127.0.0.1' if ('-r' in sys.argv): reverse = 1 i = sys.argv.index('-r') del sys.argv[i] else: reverse = 0 if ('-m' in sys.argv): maps = 1 sys.argv.remove ('-m') else: maps = 0 if maps: r = rbl (server) else: r = caching_resolver(server) count = len(sys.argv) - 1 def print_it (host, ttl, answer): global count print '%s: %s' % (host, answer) count = count - 1 if not count: r.close() for host in sys.argv[1:]: if reverse: r.resolve_ptr (host, print_it) elif maps: r.resolve_maps (host, print_it) else: r.resolve (host, print_it) # hooked asyncore.loop() while asyncore.socket_map: asyncore.poll (30.0) print 'requests outstanding: %d' % len(r.request_map) Zope-2.0.1-ZEO-nonbin/ZServer/medusa/select_trigger.py100644 1007 1403 15316 6756343040 22573 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- VERSION_STRING = "$Id: select_trigger.py,v 1.6 1999/08/17 20:29:20 brian Exp $" import asyncore import asynchat import os import socket import string import thread if os.name == 'posix': class trigger (asyncore.file_dispatcher): "Wake up a call to select() running in the main thread" # This is useful in a context where you are using Medusa's I/O # subsystem to deliver data, but the data is generated by another # thread. Normally, if Medusa is in the middle of a call to # select(), new output data generated by another thread will have # to sit until the call to select() either times out or returns. # If the trigger is 'pulled' by another thread, it should immediately # generate a READ event on the trigger object, which will force the # select() invocation to return. # A common use for this facility: letting Medusa manage I/O for a # large number of connections; but routing each request through a # thread chosen from a fixed-size thread pool. When a thread is # acquired, a transaction is performed, but output data is # accumulated into buffers that will be emptied more efficiently # by Medusa. [picture a server that can process database queries # rapidly, but doesn't want to tie up threads waiting to send data # to low-bandwidth connections] # The other major feature provided by this class is the ability to # move work back into the main thread: if you call pull_trigger() # with a thunk argument, when select() wakes up and receives the # event it will call your thunk from within that thread. The main # purpose of this is to remove the need to wrap thread locks around # Medusa's data structures, which normally do not need them. [To see # why this is true, imagine this scenario: A thread tries to push some # new data onto a channel's outgoing data queue at the same time that # the main thread is trying to remove some] def __init__ (self): r, w = os.pipe() self.trigger = w asyncore.file_dispatcher.__init__ (self, r) self.lock = thread.allocate_lock() self.thunks = [] def __repr__ (self): return '' % id(self) def readable (self): return 1 def writable (self): return 0 def handle_connect (self): pass def pull_trigger (self, thunk=None): # print 'PULL_TRIGGER: ', len(self.thunks) if thunk: try: self.lock.acquire() self.thunks.append (thunk) finally: self.lock.release() os.write (self.trigger, 'x') def handle_read (self): self.recv (8192) try: self.lock.acquire() for thunk in self.thunks: try: thunk() except: (file, fun, line), t, v, tbinfo = asyncore.compact_traceback() self.log_info( 'exception in trigger thunk: (%s:%s %s)' % (t, v, tbinfo), 'error') self.thunks = [] finally: self.lock.release() else: class trigger (asyncore.dispatcher): address = ('127.9.9.9', 19999) def __init__ (self): a = socket.socket (socket.AF_INET, socket.SOCK_STREAM) w = socket.socket (socket.AF_INET, socket.SOCK_STREAM) # set TCP_NODELAY to true to avoid buffering w.setsockopt(socket.IPPROTO_TCP, 1, 1) # tricky: get a pair of connected sockets a.bind (self.address) a.listen (1) w.setblocking (0) try: w.connect (self.address) except: pass r, addr = a.accept() a.close() w.setblocking (1) self.trigger = w asyncore.dispatcher.__init__ (self, r) self.lock = thread.allocate_lock() self.thunks = [] self._trigger_connected = 0 def __repr__ (self): return '' % id(self) def readable (self): return 1 def writable (self): return 0 def handle_connect (self): pass def pull_trigger (self, thunk=None): if thunk: try: self.lock.acquire() self.thunks.append (thunk) finally: self.lock.release() self.trigger.send ('x') def handle_read (self): self.recv (8192) try: self.lock.acquire() for thunk in self.thunks: try: thunk() except: (file, fun, line), t, v, tbinfo = asyncore.compact_traceback() self.log_info( 'exception in trigger thunk: (%s:%s %s)' % (t, v, tbinfo), 'error') self.thunks = [] finally: self.lock.release() the_trigger = None class trigger_file: "A 'triggered' file object" buffer_size = 4096 def __init__ (self, parent): global the_trigger if the_trigger is None: the_trigger = trigger() self.parent = parent self.buffer = '' def write (self, data): self.buffer = self.buffer + data if len(self.buffer) > self.buffer_size: d, self.buffer = self.buffer, '' the_trigger.pull_trigger ( lambda d=d,p=self.parent: p.push (d) ) def writeline (self, line): self.write (line+'\r\n') def writelines (self, lines): self.write ( string.joinfields ( lines, '\r\n' ) + '\r\n' ) def flush (self): if self.buffer: d, self.buffer = self.buffer, '' the_trigger.pull_trigger ( lambda p=self.parent,d=d: p.push (d) ) def softspace (self, *args): pass def close (self): # in a derived class, you may want to call trigger_close() instead. self.flush() self.parent = None def trigger_close (self): d, self.buffer = self.buffer, '' p, self.parent = self.parent, None the_trigger.pull_trigger ( lambda p=p,d=d: (p.push(d), p.close_when_done()) ) if __name__ == '__main__': import time def thread_function (output_file, i, n): print 'entering thread_function' while n: time.sleep (5) output_file.write ('%2d.%2d %s\r\n' % (i, n, output_file)) output_file.flush() n = n - 1 output_file.close() print 'exiting thread_function' class thread_parent (asynchat.async_chat): def __init__ (self, conn, addr): self.addr = addr asynchat.async_chat.__init__ (self, conn) self.set_terminator ('\r\n') self.buffer = '' self.count = 0 def collect_incoming_data (self, data): self.buffer = self.buffer + data def found_terminator (self): data, self.buffer = self.buffer, '' if not data: asyncore.close_all() print "done" return n = string.atoi (string.split (data)[0]) tf = trigger_file (self) self.count = self.count + 1 thread.start_new_thread (thread_function, (tf, self.count, n)) class thread_server (asyncore.dispatcher): def __init__ (self, family=socket.AF_INET, address=('', 9003)): asyncore.dispatcher.__init__ (self) self.create_socket (family, socket.SOCK_STREAM) self.set_reuse_addr() self.bind (address) self.listen (5) def handle_accept (self): conn, addr = self.accept() tp = thread_parent (conn, addr) thread_server() #asyncore.loop(1.0, use_poll=1) try: asyncore.loop () except: asyncore.close_all() Zope-2.0.1-ZEO-nonbin/ZServer/medusa/status_handler.py100644 1007 1403 17421 6703245715 22612 0ustar petrillipetrilli# -*- Mode: Python; tab-width: 4 -*- VERSION_STRING = "$Id: status_handler.py,v 1.2 1999/04/09 00:37:33 amos Exp $" # # medusa status extension # import string import time import regex import asyncore import http_server import medusa_gif import producers from counter import counter START_TIME = long(time.time()) # split a uri # ;?# path_regex = regex.compile ( # path params query fragment '\\([^;?#]*\\)\\(;[^?#]*\\)?\\(\\?[^#]*\)?\(#.*\)?' ) def split_path (path): if path_regex.match (path) != len(path): raise ValueError, "bad path" else: return map (lambda i,r=path_regex: r.group(i), range(1,5)) class status_extension: hit_counter = counter() def __init__ (self, objects, statusdir='/status', allow_emergency_debug=0): self.objects = objects self.statusdir = statusdir self.allow_emergency_debug = allow_emergency_debug # We use /status instead of statusdir here because it's too # hard to pass statusdir to the logger, who makes the HREF # to the object dir. We don't need the security-through- # obscurity here in any case, because the id is obscurity enough self.hyper_regex = regex.compile('/status/object/\([0-9]+\)/.*') self.hyper_objects = [] for object in objects: self.register_hyper_object (object) def __repr__ (self): return '' % ( self.hit_counter, id(self) ) def match (self, request): [path, params, query, fragment] = split_path (request.uri) # For reasons explained above, we don't use statusdir for /object return (path[:len(self.statusdir)] == self.statusdir or path[:len("/status/object/")] == '/status/object/') # Possible Targets: # /status # /status/channel_list # /status/medusa.gif # can we have 'clickable' objects? # [yes, we can use id(x) and do a linear search] # Dynamic producers: # HTTP/1.0: we must close the channel, because it's dynamic output # HTTP/1.1: we can use the chunked transfer-encoding, and leave # it open. def handle_request (self, request): [path, params, query, fragment] = split_path (request.uri) self.hit_counter.increment() if path == self.statusdir: # and not a subdirectory up_time = string.join (english_time (long(time.time()) - START_TIME)) request['Content-Type'] = 'text/html' request.push ( '' 'Medusa Status Reports' '' '

    Medusa Status Reports

    ' 'Up: %s' % up_time ) for i in range(len(self.objects)): request.push (self.objects[i].status()) request.push ('
    \r\n') request.push ( '

    Channel List' '

    ' '' '' % ( self.statusdir, self.statusdir, medusa_gif.width, medusa_gif.height ) ) request.done() elif path == self.statusdir + '/channel_list': request['Content-Type'] = 'text/html' request.push ('') request.push(channel_list_producer(self.statusdir)) request.push ( '
    ' '' % ( self.statusdir, medusa_gif.width, medusa_gif.height ) + '' ) request.done() elif path == self.statusdir + '/medusa.gif': request['Content-Type'] = 'image/gif' request['Content-Length'] = len(medusa_gif.data) request.push (medusa_gif.data) request.done() elif path == self.statusdir + '/close_zombies': message = ( '

    Closing all zombie http client connections...

    ' '

    Back to the status page' % self.statusdir ) request['Content-Type'] = 'text/html' request['Content-Length'] = len (message) request.push (message) now = int (time.time()) for channel in asyncore.socket_map.keys(): if channel.__class__ == http_server.http_channel: if channel != request.channel: if (now - channel.creation_time) > channel.zombie_timeout: channel.close() request.done() # Emergency Debug Mode # If a server is running away from you, don't KILL it! # Move all the AF_INET server ports and perform an autopsy... # [disabled by default to protect the innocent] elif self.allow_emergency_debug and path == self.statusdir + '/emergency_debug': request.push ('Moving All Servers...') request.done() for channel in asyncore.socket_map.keys(): if channel.accepting: if type(channel.addr) is type(()): ip, port = channel.addr channel.socket.close() channel.del_channel() channel.addr = (ip, port+10000) fam, typ = channel.family_and_type channel.create_socket (fam, typ) channel.set_reuse_addr() channel.bind (channel.addr) channel.listen(5) elif self.hyper_regex.match (path) != -1: oid = string.atoi (self.hyper_regex.group (1)) for object in self.hyper_objects: if id (object) == oid: if hasattr (object, 'hyper_respond'): object.hyper_respond (self, path, request) else: request.error (404) return def status (self): return producers.simple_producer ( '

  • Status Extension Hits : %s' % self.hit_counter ) def register_hyper_object (self, object): if not object in self.hyper_objects: self.hyper_objects.append (object) import logger class logger_for_status (logger.tail_logger): def status (self): return 'Last %d log entries for: %s' % ( len (self.messages), html_repr (self) ) def hyper_respond (self, sh, path, request): request['Content-Type'] = 'text/plain' messages = self.messages[:] messages.reverse() request.push (lines_producer (messages)) request.done() class lines_producer: def __init__ (self, lines): self.lines = lines def ready (self): return len(self.lines) def more (self): if self.lines: chunk = self.lines[:50] self.lines = self.lines[50:] return string.join (chunk, '\r\n') + '\r\n' else: return '' class channel_list_producer (lines_producer): def __init__ (self, statusdir): channel_reprs = map ( lambda x: '<' + repr(x)[1:-1] + '>', asyncore.socket_map.keys() ) channel_reprs.sort() lines_producer.__init__ ( self, ['

    Active Channel List

    ', '
    '
			 ] + channel_reprs + [
				 '
    ', '

    Status Report' % statusdir ] ) # this really needs a full-blown quoter... def sanitize (s): if '<' in s: s = string.join (string.split (s, '<'), '<') if '>' in s: s = string.join (string.split (s, '>'), '>') return s def html_repr (object): so = sanitize (repr (object)) if hasattr (object, 'hyper_respond'): return '%s' % (id (object), so) else: return so def html_reprs (list, front='', back=''): reprs = map ( lambda x,f=front,b=back: '%s%s%s' % (f,x,b), map (lambda x: sanitize (html_repr(x)), list) ) reprs.sort() return reprs # for example, tera, giga, mega, kilo # p_d (n, (1024, 1024, 1024, 1024)) # smallest divider goes first - for example # minutes, hours, days # p_d (n, (60, 60, 24)) def progressive_divide (n, parts): result = [] for part in parts: n, rem = divmod (n, part) result.append (rem) result.append (n) return result # b,k,m,g,t def split_by_units (n, units, dividers, format_string): divs = progressive_divide (n, dividers) result = [] for i in range(len(units)): if divs[i]: result.append (format_string % (divs[i], units[i])) result.reverse() if not result: return [format_string % (0, units[0])] else: return result def english_bytes (n): return split_by_units ( n, ('','K','M','G','T'), (1024, 1024, 1024, 1024, 1024), '%d %sB' ) def english_time (n): return split_by_units ( n, ('secs', 'mins', 'hours', 'days', 'weeks', 'years'), ( 60, 60, 24, 7, 52), '%d %s' ) Zope-2.0.1-ZEO-nonbin/custom_zodb.py100644 1007 1403 142 6772127275 17202 0ustar petrillipetrilliimport ZEO.ClientStorage Storage=ZEO.ClientStorage.ClientStorage(('216.164.72.7', 5900), async=1) Zope-2.0.1-ZEO-nonbin/doc/ 40755 1007 1403 0 6772126757 14777 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/doc/PLATFORMS/ 40755 1007 1403 0 6772126757 16346 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/doc/PLATFORMS/AIX.txt100644 1007 1403 553 6760533734 17602 0ustar petrillipetrilli from Thiebaut Champenier "python wo_pcgi.py" doesn't build the extensions correctly due to linking problems. To fix it, I just SymLinked ld_so_aix, makexp_aix and python.exp (found in /Modules/) into each of the dirs in /python/lib that contain .c files... and it worked just great. But I'm sure it's not the best solution Zope-2.0.1-ZEO-nonbin/doc/PLATFORMS/README.txt100644 1007 1403 225 6760533532 20106 0ustar petrillipetrilliThis directory is to collect notes that people send us on using Zope on Platforms that we (Digital Creations) don't have and can't support directly. Zope-2.0.1-ZEO-nonbin/doc/CHANGES.txt100755 1007 1403 224124 6771722107 16743 0ustar petrillipetrilliZope Changes This file gives information on changes made to Zope over time, things that need to be done before the next release and future plans. Notes on Zope 2.0 ZOPE 2.0 REQUIRES PYTHON 1.5.2! Zope 2 includes: - ZODB 3, the next generation of the Zope Object Database, - Z Classes, a new mechanism for building Zope applications - WebDAV level 1 support, - Support for XML-RPC clients. - ZServer, the integration of Zope and Medusa, - ZCatalog, a mechanism for indexing content and creating catalogs - Beginnings of XML support o The Python pyexpat extension, which provides access to the widely used expat XML parsing library, is included in the distribution. o DOM interface on Zope objects (initially this is limited to read-only access). o Import/export using XML Of course, XML is used in XML-RPC and WebDAV - Many other sundry big significant items, such as: o Look and feel improvements, o Tighter security, o Simpler creation of Python products. ZODB 3 See ZODB.txt for notes on ZODB 3. ZClasses ZClasses provide a powerful new way to develop Zope applications. ZClasses allow new objects to be developed entirely through the web. ZClasses also support building applications through combinations of Python classes created on the file system and objects created through the web. For example, Python classes could implemented business/domain logic and then augmented with Zope web methods to provide a web interface. Releases Zope 2.0.1 Features Added - The ZCatalog now supports relevance raking. Instead of search results being returned in an essentially random order, results are now sorted by 'score'. For text indexes, the score is the number of occurrences of the search term in a document. The score can be access by an attribute on Catalog results 'data_record_score_' and 'data_record_normalized_score_' contain the score and normalized score for the result object. - Added Keyword Indexes to the Catalog. Keyword indexes allow you to index a sequence of 'keywords' as an atomic property of an object. This is useful for buiding catagorical hierarchies. - Z SQL Methods arguments list is now a TEXTAREA widget to ease editing long aruments lists. - SQL Database Adapters now have a 'test' tab where arbitrary SQL may be entered and executed immediately through the connection object. DTML is not supported in this tab. Features Changed - ZCatalog uses subtransactions to keep memory consuption low at the expense of indexing speed. Subtransactions can now be disabled through the management interface for use with non subtransactions compatible objects like ZSQL Methods (or for raw speed if you have lots of RAM). - Added a coptimizations module. The first optimization is to provide an implementation of persistent_id in C. This routine, which is called extremely often while pickling was found to be a significant bottleneck. - More flexible cache management methods were added to ZODB Connection objects so that apps that want to move objects out of memory can force aggressive cache behavior. - Added the beginnings of internationalization support to Zope. The Zope startup script (z2.py) now supports a "-L" option that can be used to pass a locale name (such as "en" or "de") to Zope at startup. If specified, Zope will attempt to set the locale using the locale module if it is available. This change will allow Zope to better handle international characters in a number of places such as searching and indexing. - Logging from ZServer modified to produce Common Log Format in a Combined format, where user-agent and referer are also logged. Bugs Fixed - ZCatalog now actually saves memory when using subtransactions. Plugged a couple memory leaks doing this. - Fixed a bug which allowed unauthorized options to be displayed when adding a Folder. Now you only see options to add an index_document and/or a user folder if you have adequate permissions. - Added ALT text fixed nested anchor tags produced by the Tree tag to ensure that valid HTML is produced, and fixed the reverse option to the Tree tag. - A bug in FTP cookie authentication was fixed. - Fixed a bug that caused External Methods to be reloaded every time they were used in development mode. - Fixed a permission typo in ZCatalog and a sort_on bug. - Fix for missing REQUEST in a method signature in the CatalogAwareness module. - Changed to propigate errors raised by _begin for thunked database adapters. Also changed completion code to check registered status and avoid completion logic if not registered, which would be the case if _begin failed. - A memory leak in cPersistence has been fixed, and a bug in object deactivation that prevented deactivation of BTrees was fixed. - The permissions for Find support methods were not being properly initialized. - Fixed bug that allowed users with local roles gain priviledges on acquired objects. getRolesInContext did not used the correct context, as defined by the inner-most object wrapping. - Some unnecessary debug mode overhead eliminated - external methods are now automatically reloaded only when the .py files are changed. Zope 2.0 Features Added - Database conflict errors are now logged. Although conflict errors are normally handled by retrying requests, frequent conflict errors can degrade performance and should be dealt with by redesigning applications. Features Changed - The process id displayed in the control panel now inclused the thread id, in parentheses. - Upload of image or file data *always* used sub-transactions. Unfortunately, database adapters don't support subtransactions. Images and files now use subtransactions only of the image or file is greater than 128K bytes in size. Also, subtransactions are not used if data are uploaded as a string by using the ':string' ZPublisher type in the upload form. More advanced DA's could, and probably should support sub-transactions. Bugs Fixed - Attempting to cut an object then paste it into itself or one of its subobjects would cause a recursion problem. - Certain ZCatalog reindex operations could fail due to an unintended transaction abort. - Database connections were leaked when database conflict errors occurred and handled by reexecuting requests. When 7 connections leaked, the site would accept no more web requests. - The transaction-integration for relational databases didn't work properly. Aborting Zope transactions didn't abort relational database transactions. What's worse, transactions were not committed after a Zope transaction using a relational database was aborted. This explains the reported problems with Gadfly databases and transactions. - Fixed a bug which prevented ZPublisher.Client from uploading files to ZServer. - Added some logic to the win32 binary installer to fix some dll loading problems people were getting on international versions of NT. - Fixed a bug in cDocumentTemplate that could cause AttributeError instances to be leaked in certain situations. - 'reverse' option for the 'in' tag as well as the 'tree' tag has been changed to deal with a copy of the data, rather than the original. The database was being modified in place. The side effect is that in large list situations (with ZCatalog for example), sizable memory usage may result. - Missing values (as returned from SQL methods) were output as empty strings by the DTML var tag, even when a numeric format (e.g. "%5.3f") is used. Using a numeric format with a missing value should generate an error, unless the null attribute is used. Also, the null attribute had no effect when outputing missing values. - It was impossible to map some permissions to themselves, or to other inherited, but not registered permissions in products and in class methods. When this failed, a silly error message ("Waaa" ;) was output. - SQL methods had an unused method, getFindContent allowed anonymous users to read SQL method source. This method was renamed to PrincipiaSearchSource, and protected with a permission. - SQL methods could not be found with the find mechanism by searching their source. - The PrincipiaSearchSource method of DTML documents and methods was not protected, so anonymous users could read their source. - Fixed a bug in ZOM which caused getElementsByTagName to fail when using XML Document. Thanks to Andrew Kuchling. - It was possible to hijak 'self' arguments for DTML and External methods with request variables. This was especially problematic for XML-RPC, which uses positional arguments. - It was difficult or impossible to call External methods with 'self' arguments from XML-RPC. Zope 2.0 beta 6 Features Added - The control panel process id display now also includes the thread id. - The Zope start script, 'start', is now written in a location-independent manner, making it a little easier to move Zope sites around after installation. Features Changed Zope 2.0 introduces a new HTML DTML syntax that, among other things, allows simple 'var' tags to be entered using the entity-reference syntax, as in:: The entity reference syntax is mainly intended for use when a var tag is used to insert text into an HTML tag. In these cases, the text needs to be html-quoted. For this reason, use of the entity reference syntax now implies html quoting. For example, the DTML snippet above is equivalent to:: (Note that when inserting text to be used in a URL, as in an A tag HREF attribute, we need to url-quote the text. Zope 2.1 will provide a means to do this with the entity-reference syntax.) Bugs Fixed - Missing values were not formatted correctly with numeric formats and did not work properly with the 'null' attribute of the DTML 'var' tag. - It wasn't possible to map some permissions of objects in Products. For example, it wasn't possible to enable a permission by mapping it to itself. Attempts to do so lead to a rather silly uninformative error message. - When providing default values for input fields, few of the built-in DTML methods used html quoting. This lead to incorrect behavior when default values included markup or quotes. - View filtering failed to show tabs for views in some cases where it should. - Single-character variable names were'nt allowed in the entity-reference DTML syntax. - DTML batch processing didn't work properly. - The DTML functions, '_.getattr', and '_.hasattr' incorrectly acquired attributes even when explicit acquisition was used. - Image dimensions were not autodetected for PNG 1.2 files. - The "View" view didn't display correctly for images with ids with characters that had special meaning in URLs. - The 'optional' attribute in the 'sqltest' tag had no effect. - With browsers (like lynx) that correctly implement RFC 1867 for file-upload support, non-file fields in file-upload requests were treated as file fields. Zope 2.0 beta 5 Features Removed - The help system, which was primarily geared to DTML programmers was removed. Bugs fixed - Database packing failed in certain cases where the data set contained many version commits. - Database packing generated spurious error logs indicating that there were bad references for objects created in ncommitted versions. - A memory leak due to errors in managing request data. - Zope sites became unresponsive (a.k.a. "Hung") due to an error in managing ZODB 3 database connections. - Only the top-level folder's standard_error_message was used. - There were thread-safety and resouce consumption problems in the implementation of thread-safe regex objects. - Fixed bug where ZCatalog's not in the root folder did not recognize the proper URL of objects using the 'Find' machinery. This caused all the objects to mysteriously disapear when you updated the catalog (because their paths were wrong). The Catalog now works correctly anywhere in the object hierarchy. - Fixed a bug that caused error messages to be formatted incorrectly if the standard_html_header did not begin with an HTML tag. - The undo form was accessible even to people who couldn't do undo. This made it look like we were allowing undo in cases where we were'nt supposed to. - The undo form did not restrict undoable transactions to just those transactions performed by users that were authenticated at the same level. This made the new undo less restrictive than the Zope 1 undo. Undo should probably be *more* restrictive, but that will have to wait for 2.1 or later. - Zope crashed under load for applications using ZCatalog due to an ancient bug in handling loading of empty BTrees from the database. This bug has only become effective with ZCatalog. Zope 2.0 beta 4 Features Removed - Draft objects are no longer supported. Features added - The source release install script now checks to make sure that the Python used has thread support. - FileStorages can now habe quotas. Bugs fixed - This release fixes a socket listen-queue depth problem on Win32 systems that caused poor performance and connection refusals in ZServer. - Fixes to the win32 installation were made to prevent a potential conflict on systems that have an existing installation of the Python win32 extensions. - Some of the management views, including the security/permission mapping views were not visible for ExternalMethods. - New SQL methods could bot be created. - New mailhost objects could not be created. - New Draft objects could be created. - Draft objects could not be deleted. - ZClasses could not be added as methods. - Disk full errors could leave the object system in an inconsistent state. The handling of this error was made more robust. Also, when serious errors like this occur late in the transaction commit process, the transaction system switches to read-only mode. The File-storage recovery process needs to change to make disk full errors detectable earlier in the two-phase commit process so that the system can recover without switching to read-only mode. This change, which is expected in 2.1 will also provide better write performance. - Errors during commit of sub-transactions were not handled correctly, leading to inconsistent object data. - Packing not not mark all transactions performed before the pack time as "packed". Undoing these transactions lead to a broken database. - On win9x systems, random data seems to be added to the end of the file on system crashes, causing apparent file corruption. Code has been added to check for this case and recover by truncating the file with a log message. - The Zope version was not shown in the control panel. - The binary release had the PCGI wrapper program in the wrong directory so PCGI installations were not successful. Zope 2.0 beta 3 Features added - Added a 'getobject' method to ZCatalog. This allows you to more easily get at a cataloged object from 'searchResults'. For example::
    Bugs fixed - This release fixes a bug in acquisition that caused creation of ZClass instances to fail under some (common) circumstances. - Copy and Paste validation machinary now takes local roles into account. - ZDOM now adheres more closely to the DOM spec with respect to Document and DOMImplementation nodes. - The main management screen will no longer show the 'Delete' or 'Export' buttons if the user doesn't have adequate permissions to delete or export objects respectively. Zope 2.0 beta 2 Features added - Added a '-r' switch to z2.py for ZServer read-only mode. - The 'null' attribute in the DTML 'var' tag is now used when the value being output if the Python value 'None'. Some people considered this to be a bug. - Permission objects are automatically created for new ZClass objects as part of the ZClass wizard. - For Python programmers, there is a new convenience function for debugging in the Zope package. For example, to debug method spam in the Zope debugger:: python import Zope Zope.debug('spam', d=1) Bugs fixed - Changed the logic used to detect binary content types to only look for control characters. The previous version incorrectly considered certain Latin-1 characters as binary. - The ZService.py used to implement Zope as a Win32 service on NT has been updated to handle a difference in the way .dll files are found on internationalized versions of NT. - The configure.in file used to build PCGI has been updated. - Several fixes to DateTime were added to provide better behavior on machines with unrecognized time zone names. - Conflict errors, which occur when simultaneous writes occur to the same object in multiple database connections, are now handled correctly by re-executing (up to three times) the requests that lost the race condition. - Error formatting with standard_error_message has been moved to the object publisher via a new published module hook, 'zpublisher_exception_hook'. In addition to enabling conflict error handling, this fixed two other bugs: - Error handling in ExternalMethods and in DTML methods or documents called from other DTML documents or methods caused errors to be propagated in ways that defeated use of the try tag and other forms of error handling. - Errors raised before or after calling published objects were not formatted. - Errors in processing form variables, such as missing or miss-typed values resulted in server errors, rather than in formatted error reports. - Database browsing didn't work for ZGadflyDA database adapters. - Transaction meta data were not captured correctly by ZPublisher, which made the undo log look odd wrt the user who performed the transaction. - Permissions for version operations were not set correctly. This made it hard to delegate work to be done in versions and to separate version participation from version finalization. To fix this, it was necessary to split the "Join/Leave" view into separate "Join/Leave" and "Save/Discard" views. - No remark could be entered when discarding versions. - Fixed a ZServer kill_zombies bug which kept ZServer from killing hung connections. - Improved ZServer's handling of slightly broken HTTP requests. - Fixed a properties setting permission bug. - Fixed a product permissions registration bug that allowed product permission data to get lost. - Updated the MailHost product to use the new product initialization procedure. This fixed a MailHost adding permissions bug. - Made Z Class icons visible to everyone. This way you can view a Z Class icon without having and permissions on the Z Class. - Objects were sometimes incorrectly acquired do a bug in detecting attribute errors during acquisition. This led to errors getting covered up or obscured. - There was a memory leak in acquisition. - Some thread-safety problems were fixed. - DTML entity references (e.g. '&dtml-spam;') with missing semicolons (e.g. '&dtml-spam') caused infinite loops. - Extra spaces around expressions in DTML caused syntax errors. - Broken objects, which are used as surrogates for objects that can no longer be instantiated due to missing product installations, no longer use HTML markup in their text representation, as this caused odd effects in HTML titles. - A number of fixes were made to the new DOM support. - Versions could be deleted by users working in the deleted versions. This led to strange paradoxical effects. Attempts to delete a version or an object containing a version by someone working in a version now lead to errors. - ZGadflyDA has been updated to use the current (as of this release) version of Gadfly. (Note that this had been incorrectly reported as a 2.0 beta 1 feature.) - Using an sql method in a version sometimes caused the method to be locked, making it unusable by non-version users. This was due to the way that column meta-data was managed. Now column meta-data, used by report creation wizards, is only safed when sql methods are tested. - In StructuredText, list items could not directly introduce example code. - Undoing transactions that discarded versions did not cause versions to appear non-empty. - Temporary files were created for file storages that were opened in read-only mode. - A bug in FileStorage and DemoStorage didn't show you more than the first 20 previous transactions in the Undo log. - An incorrect contents view was returned after adding a File object. - On the cache parameters page, the number of bytes, rather than the number of objects in the database was shown. Note: The section for Zope 2.0 alpha 4 did not mention that ZCatalog is now shipped with the Zope core. Zope 2.0 beta 1 Backward incompatibility - ZODB 2 is no longer supported or included! - The utility script bbb.py, no longer supports xml output. Known problems - Handling of conflict errors hasn't been implemented. When two threads try to update the same object, one will get a conflict error. By beta release 2, requests that get conflict errors will be retried until they succeed (or fail without a conflict error) or until a maximum number of retries is exceeded. Features added - The default ports used by ZServer have been changed. The new default ports are: 8080 for HTTP, 8021 for FTP and 8099 for the monitor server. - ZServer now uses the zLOG logging mechanism for informational and warning messages. - ZServer now includes a fairly stable NT service ZService.py - 'access' file now can use SHA-1 hashing, and now does by default - 'zpasswd.py' added to top directory to manage this new 'access' file - A number of changes have been made to enhance security control in through-the-web-developed products: - There are new "Permission" objects that can be added to Products. Permission objects provide a mechanism for defining new permissions. These new permissions show up in folder security screens. - Factory objects can have permission settings. This affects whether items show up in add lists and who can use factories. - Objects in products now have permission mapping rather than direct permission settings just like ZClass methods. - New permissions cannot be defined in ZClasses any longer. Rather, ZClasses can select from global permissions, including permissions defined with permission objects. Here's a sample scenario: 1. Add a ZClass, "Container" with the option to create a factory and constructor methods. 2. Add a permission object with the permission "Manage Containers". 3. Change the permission of the factory created in step 1 to "Manage Containers". 4. Visit the ZClass created in step 1, view the "Define Permissions" view and map the "Create class instances" permission to "Manage Containers". 5. Visit the constructor DTML Methods created in step 1, view the "Define Permissions" view and map the "View" permission to "Manage Containers". In this scenario, we created a ZClass and made it addable only by users (roles) that have the "Manage Containers" permission. - There is a new module, Shared.DC.THUNK (lib/python/Shared/DC/THUNK.py) that provides a mix-in class that implements ZODB 3 transaction protocols and that provides course-grained locking logic that should allow many non-thread-safe database adapters to be usable in multi-threaded Zope applications. The Gadfly database adapter has been updated to use this mix-in class. - The transaction management mix-in classes (Shared.DC.TM.TM and Shared.DC.THUNK.THUNKED_TM) now provide a lower-level transaction management protocol. Database adapters that mix these in should: - Call 'self._register()' when performing database queries, and - If necessary, override methods: _begin() -- Which is called to begin a transaction, _finish() -- Which is called to finish a transaction, and save changes, or _abort() -- Which is called to abort (rollback) a transaction, and discard changes, or - Object export now provides an XML export option and import files may be in Zope export format or XML format. - Zope objects that support the Zope management framework now support the DOM 1.0 read interfaces. This allows DOM read methods and attributes to be usable with Zope objects and Python DOM tools, like FourThought's 4XSL to work with Zope objects. Note that DOM-defined attributes are defined with "get" methods. For example, to get the DOM-defined "parentNode" attribute, use: 'object.getParentNode()'. - The pyexpat extension module for using James Clark's expat library for parsing XML is included in the distribution as Shared.DC.pyexpat. Bugs Fixed - You can no longer cd to an acquired directory in ZServer FTP. - A number of changes were made for thread safety. This was not as hard as it sounds, since persistent objects are always thread-safe. (Well, only one thread accesses any particular copy of a persistent object.) The biggest issue here is mutable global variables, mutable objects stored in classes, mutable default Python function arguments, and global variables in extensions. Zope 2.0 alpha 4 Backward incompatibility - The old ZopeHTTPServer is no longer supported or included. Use ZServer. Features added - The let and return tags were added to DTML. - Several new input form types were added: :default -- allows you to specify default values :record -- allows you to combine multiple form variables into a single input variable. For example:: will result in a single variable, 'date', with attributes 'year', 'month', and 'day'. :records -- allows you to input a list of records (ie a table) :ignore-empty -- If the field if the value is an empty string. For more information, see the section on "Form variable types" in http://www.zope.org/Documentation/Reference/Trinkets. - In the startup script, z2.py: - The startup script, z2.py, has additional documentation on providing empty strings as arguments. - Added a -P option to the startup script, z2.py, to specify a base port for the various servers. For example:: python z2.py -P8000 is equivalent to: python z2.py -w8080 -f8021 -m8099 This is a convenient short-hand for systems with many zserver instances running. - Added an -l option to the startup script, z2.py, to specify the location of the ZServer hit log. If the location is a relative path, then it is assumed to be rooted in the 'var' directory. - A progress indicator was added to the database conversion utility, utilities/bbb.py. - The PCGI installer now writes the PCGI info file to use ZODB 3 rather than ZODB 2. - The default content is provided in both ZODB 2 and ZODB 3 format. - There is a new logging framework for reporting errors from Python-level code. See the module zLOG.py for details. For the time being, to turn on logging, set the environment variable STUPID_LOG_FILE to a file name or to an empty string to log to standard error. We will eventually provide a more formal and functional logging configuration interface. - The hooks used by objects that modify their environment were changed. The new hooks are: manage_addHook -- called after an object has been added manage_beforeDelete -- called before an object is deleted manage_afterClone -- called after an object has been copied. This should only be used by object that capture their identity is some way other than their id attribute or persistent id. (It's really for ZClasses, which have global ids.) - Pack is now supported for ZODB3 File Storages. - The header output by manage_tabs now shows whether the current object has been modified or locked by a version and shows the version if the version isn't the current working version. - The locked-in-version decoration in the object management contents view shows the locking version if the version isn't the current working version. - Several demonstration ZODB Storage implementations have been added. See lib/python/ZODB/DemoStorage.py and lib/python/ZODB/dbmStorage.py. - Subtransactions have been added (instead of temporary versions). If a true argument is given in a transaction commit or abort call (e.g. 'get_transaction().commit(1)'), then the commit or abort applies to a subtransaction of the current transaction. This is useful in a number of ways, including: o Subtransaction commits on requests that work with lots of data can reduce memory usage because data can be removed from memory after changes are saved in a subtransaction, o You can rollback changes due to a local error without rolling back *all* of the changes made in a long transaction. - There is an advanced interface for specifying alternate storages for Zope. Zope will try to import the module 'custom_zodb' from INSTANCE_HOME and use it's Storage attribute. For example, to use a Demo storage based on the standard File storage, you might define a 'custom_zodb' module with:: import Globals, ZODB.FileStorage, ZODB.DemoStorage name='%s/Data.fs' % Globals.data_dir base=ZODB.FileStorage.FileStorage(name, read_only=1) Storage=ZODB.DemoStorage.DemoStorage("Demo (%s)" % name, base) - Find can now search text of SQL methods. - DTML tree tags now have a reverse option. - ZClasses now have class ids. These class ids are registered in a central registry and are used when unpicking instances. - Database connections now have a sync method for synchronizing the connection with saved data. This is useful for interactive connections to see database changes made by other threads. - Errors encountered when trying to unpickle object state are now logged, if logging is enabled. - Added an extra checkpoint to ZODB 3 FileStorage Transaction commit to better handle system crashes. - ZPublisher request objects now have a BODYFILE key to get the request body as a file for non-form non-GET requests. - Cookie support was added to the ZServer FTP server to make FTP access compatible with cookie-based authentication. - ZServer now includes a NT Service, 'ZServer.py' This service requires the Python win32 extensions. It is not yet complete and not yet integrated with the Zope installer. It does however include a large doc string. - ZServer is officially using the z2.py start script now. The old start.py and zinit.py were removed. Note: z2.py will call zdaemon.py for you, if you want to use ZServer in daemon mode on Unix. - Added a 'has_permission' method to user objects. This facilitates finding out if a user has access to a given object. For example:: - The product add list is now filtered. This should keep objects out of the product add list for which the user does not have adequate permissions. This is implemented with a new method, 'filtered_meta_types' which returns all the meta_types for which a given user has permissions. Note: Right now ZClasses do not associate permissions with Products. Thus all Control Panel Products appear in the product add list, no matter what roles the user has. - HTTP REQUEST objects now use HTML in their string representation. - The REQUEST keys of the form BASEx and URLx, where x is an integer now allow x to be greater than 9. - index_html is not longer used automatically for XML-RPC requests. - ZPublisher debugger, 'ZPublisher.test' now accepts a 'extra' keyword argument with a dictionary giving extra variables to be added to the request. This is handy for testing methods that require large amounts of input data, such as file uploads. - The load_site utility ('utilities/load_site.py') now accepts a '-9' switch to make it work with Zope (and Principia) sites at revisions 1.9 and lower. Bugs fixed - Got rid of some DOS line-endings in xmlrpclib.py that caused install-time module compilation to fail. - Fixed DOS line-endings in medusa/max_sockets.py - Fixed a NameError (missing TupleType) definition in the export/import (copy/paste) machinery. - The startup script failed on Windows because it imported the posix module without checking the os. - ZServer crashed when the number of simultaneous connections exceeded a system limit, especially on Windows. ZServer now stops accepting new connections when the number of active connections exceeds a threshold. - Accessing cached results of items() (or values() or keys()) calls on BTrees caused core dumps if affected elements were deleted. For example:: for k in abtree.keys(): del abtree[k] Note that this code is still incorrect due to the fact that the objects returned from abtree.items() (or values() or keys()) have reference, rather than copy semantics. - Compiling Acquisition.c caused (bogus) compiler errors on SGI. - zdeemun wus mispeled - Local roles were not handled correctly when filtering management views. - Copying and pasting ZClass instances copied and pasted their ZClasses too, effectively disconnecting them from their managed ZClasses. The same thing happened when ZClass instances were exported and imported. - The Database area in the control panel was broken. - Copy and paste of multiple objects was broken. - Copy and paste of ZClass methods was broken. - Copy and paste of ZClass properysheets was enabled and broken. It is now disabled. - Accidental import of BoboPOS in processes using ZODB (3) caused strange errors. - A bug in batch processing caused batch processing to hang or give incorrect results. - DocumentTemplate-based classes, like DTMLDocument and DTMLMethod could not be subclassed correctly. - There was a memeory leak in the DTML try tag. - When adding folders with user databases, no check was made to make sure the user was permitted to add a user database. - Broken objects weren't created for objects whose class could not be found when using ZODB 3. - The 'self' argument wasn't properly passed to external methods used in ZClasses. - The Setup file in the SearchIndex package had an unneeded -I option that caused compilation errors on some platforms. - ZGadflyDA transactions were not committed. - ZClasses didn't provide an interface to edit their titles. - Propertysheets were broken for ZClasses that inherited from built-in classes, like Folder and DTMLDocument. - Propertysheets were disabled for instances by default. Now, propertysheets have the "manage properties" permission by default. - The navigation pane wasn't updated when classes were added. - Changes in ZClasses were not properly propagated to all database connections using ZODB3. - Database connections were not closed correctly under heavy load when the number of application threads exceeded the number of database connections in the connection pool. This lead to Zope locking up under load if the application thread count was increased using the z2.py -t option. - undo in ZODB 3 didn't properly refresh objects. - export and import was broken for ZODB 3. - Fixed ZServer HTTP zombie killing. Now hung connections are successfully closed. - A bug in handling the case when a file was created on open without the create flag caused weird errors on windows. - The REQUEST BASE1 key was not computed correctly when SCRIPT_NAME was an empty string. - It was impossible to return an empty list or dictionary to an XML-RPC request. - The database conversion script fails when the first record in the input file lacked properly-formatted transaction data. The conversion script also didn't work on some systems due to an incorrect 'flush' call on the *input* file. - Factories that were also ZClass methods didn't get unregistered properly when they were deleted. Zope 2.0 alpha 3 Features added - XML-RPC support All Zope objects are now XML-RPC servers. - ZODB 2 (aka BoboPOS) to ZODB 3 FileStorage database conversion An option has been added to the bbb.py script in the utilities directory to convert ZODB 2 database files to ZODB 3 format. The bbb.py script now accepts an '-f' option that takes an argument specifying an output file name. For example, to convert the ZODB 2 data file, Data.bbb, in the var directory, to ZODB 3 FileStorage format:: python utilities/bbb.py -f var/Data.fs var/Data.bbb Note that version data are not converted. - In Z Classes, Methods and Property Sheets now have a "Define Permissions" management tab to map permissions. This tab used to be labeled "Security". - ZServer's FTP server now attempts to display an object's owner as defined in local roles. Bugs fixed - The cache management screens were broken - Local roles on DTML Methods and Documents were not persistent. - ZServer's select trigger has been updated and now shouldn't give errors when running ZServer as another users. - The tree tag used persistent object ids in ways that were not compatible with ZODB 3. This caused strange behavior like weird content-types and invalid state messages. - The DTML In tag no longer handled batch processing correctly, and sometimes got into infinite loops. This was due to a very old bug that was made effective by Python 1.5.2. - Objects that could not be loaded because their implementing modules (or packages) had been removed were not handled properly as broken objects when ZODB 3 was used. - The DTML Python string format did not allow expressions for simple variable insertion. Expression insertion is now allowed if the var tag name if the var tag name is supplied, as in:: %(var expr="x+1")s Note that, because of this change, the var tag name must also be supplied when a variable named 'var' is inserted, as in:: %(var var)s Zope 2.0 alpha 2 Features added - There is a new optional EXPERIMENTAL HTML DTML syntax. As an alternative to SSI syntax, you can now use ordinary HTML syntax, as in: You can also use an entity-reference syntax for the var tag as an alternative to the tag syntax. For example:: &dtml-foo; is equivalent to:: and is especially handy in attributes:: Both the new syntax and the SSI syntax are allowed in the same document. In fact, if you were really twisted, you could: IMPORTANT This feature really is EXPERIMENTAL. It could disappear someday, depending on how people like it. We'd really like to get feedback on how useful this feature is. - reverse options were added to the in and tree tags. - The startup script, z2.py, has a -D option to turn on debugging mode. - Made environment variable settings work with the http server. So now you can do things like ./z2.py -w 8888 SCRIPT_NAME=Zope and actually have the specified SCRIPT_NAME override the normal SCRIPT_NAME. This is Useful for using ZServer behind a proxy. - Added support for the Medusa monitor server. - There's a first cut at a ZServer NT service. This is Zope on NT's answer to zdeamon.py It actually seems to work, though there's still a fair amount missing. - The error messages for missing or miss-formatted access files was improved. - A new debugging method, manage_debug, has been added to Control_Panel to monitor the Zope process for possible memory leaks. - The name, 'this', has been added to the namespace available to construction methods to provide a function for computing the destination object. The name, 'this' is essentially equivalent to 'Destination' and 'Destination' will be deprecated eventually. - The title of the main Zope management interface now includes a full URL. - Folders that have (or acquire) index_html methods now have view tabs for viewing index_html. - On browsers that support Java Script, the "Add" button is omitted and the add form is visited as soon as a selection is made from the select list. - The python-pickle format used to export data from ZODB 2 was updated to handle string data differently. Bugs fixed - A number of bugs and features were left out of the release notes for Zope 2.0 alpha 1. The notes for Zope 2.0 alpha 1 have been updated substantially. - There was a serious memory leak introduced when a security bug was fixed in 1.10.0. - There was a memory leak in ZODB 3 persistent objects, which now manage object IDs as persistent objects. - The Python 1.5.2 cgi module didn't work with Zope. Zope now includes its own fixed version of the module. This bug caused FTP, Netscape Publishing and WebDAV to fail. - A bug in transaction management caused Gadfly requests to fail. Other database adapters need to be updated. - Running ZServer as nobody failed due to the order in which the log file was opened. - Added fix contributed by Brian Hooper for HTTP Clients which don't always spell their HTTP headers correctly. - A number of classes didn't get there reference-counts reduced when instances were destroyed. This confused the new memory allocation monitoring tool. - New user folders had no effect because they did not get properly registered in their containing folders. - Changes made to factory objects were lost when a process was restarted. - Clicking on the 'Help' caused the help information to be displayed in the current frame, rather than in a new window. - Shutting down Zope attempted to save the database index even when Zope was run in read-only mode. - A number of fixes were made in the Date-Time support. - Batch processing in the in tag sometimes failed. - Sites with custom roles in the top-level application object did not pick up the new 'Owner' role. - Content-type detection had problems in DTML documents and methods. - Some cookie expiration dates used 2-digit years. - Error values for errors raised by ExternalMethods were lost. - Values returned by absolute_url were not URL quoted. - Extra newlines were prepended to documents when they were edited. - Objects ids were not properly quoted in a number of places, because id quoting was unnecessary until recent relaxation of the rules for ids. - ExternalMethods are now automatically reloaded when running in debug mode. - Search interfaces generated by the search interface wizard no longer include a "Cancel" button. - Errors were masked by a bug in handling ZODB3 transaction aborts. - The ZODB 3 cache manager deactivated objects too quickly, causing performance to degrade. - BASEx request variables were not computed correctly when SCRIPT_NAME was not empty. - The URLx variables couldn't be computed in some cases when using ZServer. Zope 2.0 alpha 1 BACKWARD INCOMPATIBILITY - A change was made to the way ZClasses are constructed. Previously, the __call__ method was an alias for the index_html method which took took an id and a request and created a new instance and added the instance to the destination. Now, the __call__ method simply calls the underlying managed class with the supplied arguments to create and return an instance. The instance is not added to a folder. The index_html method is now an alias for the createInObjectManager method, which does what the index_html method did before. There is a new method, fromRequest, that takes an id and a request and creates a new instance. It does not at the instance to a destination. Features Added - Integration of ZODB 3 - The ZClass construction interface has been cleaned up to make construction of ZClasses a little easier from Python. - When adding ZClasses, there is now an option to automatically create construction methods and a factory. - "Management" screens now *only* show tabs a user permitted to see. Used in combination with carefully selected roles, this change provides an adaptable management interface. - Instance homes can now have local Products directories. - There is a new ZServer start up script that can be used without modification and that integrates process management. This script replaces the ZServer 'start.py' and 'zinit.py' scripts. - When the new startup script is used, then the control panel shows a "Restart" button which causes the Zope process to exit and be restarted and a "Shutdown" button that causes Zope to exit and not be restarted. - There is a *very* rough cut at a centralized version manager in the control panel. This is only functional when the ZODB3 database is used. This feature will mature significantly before the final 2.0 release. - A new Zope icon was added, and the "powered by Zope" icon has been updated. - Made DTMLDocuments, DTMLMethods, Images, Files and Folders subclassable by ZClasses. - ZClass property sheets can now have read and modify permissions. - An "add list" name can be specified when creating a ZClass. If specified, then construction methods and a factory are created. This makes the class immediately instantiatable and provides construction method examples. - The ZClass basic property sheet now shows base classes. - Changed the string representation of HTTPRequest so that is a lot friendlier. - Added a Zope debugging short cut. Now:: import ZPublisher ZPublisher.Zope(path) is a shortcut for:: import ZPublisher ZPublisher.test('Zope', path) Bugs Fixed - ZClass permission setting interfaces didn't show inherited permissions. - A number of bugs arising from attempts to set caching headers were fixed. - Some default permissions were not set correctly. - The unused non-functioning resource-consuming Scheduler has been removed. - Access was given to objects without roles even if access would be denied to the container. - Fix submitted by Martijn Pieters: Any property type int or long, set to 0, showed up in the Properties Management tab as blank. This resulted in errors when trying to change values of other properties, etc. - Version names were computed incorrectly. - Delete and rename were broken for ZClasses. - It wasn't possible to override inherited attributes with methods in ZClasses. - Property values were not removed from ZClasses when property sheets were deleted. This made it impossible to re-add a property from a deleted property sheet. - Generated property view and edit forms for ZClass property sheets had a number of problems. - The propertysheets property sheet should only allow addition of property sheets. Zope 1.11.0 pr1, which should have been named Zope 2.0.0 alpha 0. Lots has changed in this release. The major news is ZClasses and WebDAV. Features Added - Added WebDAV support. See http://webdav.zope.org/ for details. - Added Z Classes. Documentation is forthcoming. ZClasses might be viewed as somewhat experimental, although we're using them aggressively for internal projects. - Added Property Sheets. Documentation is forthcoming. - ZServer now included in distribution. - Added new product registration interface. Documentation is forthcoming. - Added local roles which allow for permission settings for users on individual objects. This allows for 'ownership' of Zope objects. Added 'Owner' role to default roles, and automatic setting of the 'Owner' role on a created object to the user who created it. - Added hooks for XML-RPC support to ZPublisher. See the source for details. XML-RPC support is not yet finished. - Added automatic height/width detection for JPEG images. - Revised Zope error messages. - A new DTML 'try' tag added based on work by Jordan B. Baker. See the source for details. Documentation is forthcoming. - A new DTML 'mime' tag has been added. See the MIMETools README.txt for more information. - A new 'range' function added the the '_' DTML variable. - A new 'utilities' directory is included in the distribution. - A new flag attribute, 'only', of the DTML 'with' tag prunes the DTML namespace to only the namespace created with the with tag. - Added contributed support for encoding options in the SendMail tag and MailHost send method. - Management tabs are now prettier and allow status messages with the manage_tabs_message variable. - Added a method of notifying users of changes without using a MessageDialog. This makes editing DTML Documents and Methods easier. - Added more documentation to Product add screens. - New icons for many Zope objects. - Sessions are now known as Versions. - Changed from using 'manage_main' as default management method to use 'manage_workspace' which is a reserved method that dispatches to the default management interface which is the first interface defined in manage_options - Permission settings are now inherited by Products from their base classes. This means when you build a Product you only need to specify its particular permission settings. - Changed ZPublisher.publish_module's interface so that instead of providing a stdin, stdout, and stderr, you can provide a Request and a Response object. ZServer makes extensive use of this feature. - Added methods to HTTPRequest to allow access to ZPublishers object traversal. HTTPRequest.clone and HTTPRequest.resolve_url. See the source for more details. - Added a new "builtin" function reorder to DTML. reorder(s, [with, without]]) Reorder the items in s according to the order given in with and with items mentioned in without removed. Items from s not mentioned in with are removed. s, with, and without are all either sequences if strings or sequences of key-value tuples, with ordering done on the keys. This function is useful for constructing ordered select lists. Bugs Fixed - Added small fixes to ZopeHTTPServer in anticipation of DAV. - Construction, upload, and edit methods did not consistently support either string or file data. This caused really weird behavior when file upload was used with out including the ':string' suffix in the argument name when doing a file upload. This bug was previously (and incorrectly) reported as a ZPublisher.Client problem. - Errors in ExternalMethods were masked by bugs in error reporting logic. The bugs were made far more effective by Python 1.5.1. - Databases (or export files) created in binary distributions were not usable in source distributions due to cPickle limitations in stock Python 1.5.1. We now link/copy the cPickle extension to BoboPOS to make sure that it uses the latest version. - Fixed registration of MailHost settings and incorrect default quoted-printable encoding of message bodies. - Added contributed patch that fixes bug in copied-object id generation. - DTML Documents and Methods now attempt to determine their content-type rather than assuming they are text/html. - Fixed PUT bug in determining content-type of binary files. - Added changes that allow the top level userfolder to be replaced by a UserDB or other userfolder-like object. - Fixed an FTP support bug that sometimes kept simple items from producing FTP listings. - Added URL1 instead of "." as the form target for the workspace forms -- using "." causes NS servers to intercept the request and report an error, making Zope effectively unusable. - Added ZPL 1.0 and credits to copyright link in management screen. - Fixed a bug that prevented validate() from working if the top-level object were accessed and no default object (index_html) existed. - Fixed a logic bug in security validation that allowed access to unacquired objects that didn't have __roles__ even if the containing object was protected. Zope 1.10.2 Bugs Fixed - Fixed a permission problem with DTMLMethod objects that caused errors when attempting to commit permission changes. - Factories could not determine the available methods when they were being edited, making them uneditable. Zope 1.10.1 This is a Python 1.5.2 beta 2 compatibility release. A Python C API change in Python 1.5.2 beta 2 broke Zope. This release contains a fix. Zope should work correctly with Python 1.5, 1.5.1 and beta versions of 1.5.2. Zope 1.10.0 New Features - Added Import/Export interfaces to Folders. Bugs Fixed - Fixed a bug in ZopeHTTPServer which caused it to fail on POST requests without content-type headers. - PUT and file uploads would fail if the content-type could not be determined. Now objects created via PUT and file upload will default to either 'application/octet-stream' for binary files or 'text/plain' for non-binary files if no content-type can be determined from headers or filename extensions. - Fixed a permission bug left from a change to the Find support. - Fixed misc typos in docstrings and docs. - Fixed a bug that kept objects from being freed from the cache! Basically, there was never a check for inactive objects. - MailHost objects didn't do appropriate CRLF conversion or recognize 4xx server responses. Zope 1.10.0 pr1 New Features - Documents generated by the search interface wizard no longer use tab characters. - Added a -s option to ZopeHTTPServer. This is useful for emulating older sites when generating screen shots for creating or updating documentation. - Default bobobase now includes a Zope button along with a link to the Zope site. This satisfies the ZPL attribution requirement. The button is created by a new builtin method 'ZopeAttributionButton'. Also, both the source and the binary distributions now have the same default bobobase. - Made the logic for getting SOFTWARE_HOME a bit more robust, so that it handles relative paths and paths starting with '.' and '..'. This is useful when simply importing Main from the Python prompt in the lib/python directory. - The ThreadLock module has been changed to reflect changes in the Python API in Python 1.5.2. - The '_' variable in DTML now has the random module as an attribute and DateTime.DateTime as the attribute DateTime. - Added keys() and items() methods to the REQUEST object. - Added get_header() method to the REQUEST object for retrieving HTTP headers. - New SearchIndex package and BTree component have been added to the distribution, providing low-level support for products with built-in searching such as Tabula and Confera. - Documents have now been split into two distinct object types: DTML Documents and DTML Methods. DTML Methods behave exactly as Document objects did. DTML Documents are similar except that the "client" or "self" of a DTML Document is the DTML Document itself rather than its parent, and DTML Documents can have properties. - DTML Documents, Image and File objects can now have properties. - A new PropertyManager mixin class allows developers to easily add properties and property management to non-Folder objects. - Added a new absolute_url method which can generate an absolute url for the object on which the method is called. - GIF and PNG Images now figure out their own dimensions when uploaded. Image height and width properties are now editable. - Images now generate themselves as html IMG tags, using an absolute url and correct height and width tags if possible. - There is a new form input type, boolean, for inputing boolean data. - Added a read_only option to the SimpleDB.MultipleRevision and PickleDictionary constructors to open a database in read_only mode. - Added an environment variable, ZOPE_READ_ONLY, used by the Zope framework. If this variable is set, then the database is opened in read only mode. If this variable is set to a string parsable by DateTime.DateTime, then the database is opened read-only as of the time given. Note that changes made by another process after the database has been opened are not visible. - Added a database_quota option to the SimpleDB.MultipleRevision and PickleDictionary constructors and a SimpleDB.MultipleRevision.set_quota method to set a database quota. The quota is given as either an integer number of bytes, or a function taking an integer number of bytes argument and returning whether the quota has been exceeded. - Added an environment variable, ZOPE_DATABASE_QUOTA, used by the Zope framework. If this variable is set, it should be set to an integer number of bytes. Additions to the database are not allowed if the database size exceeds the quota. - Added size and last modification time to DTML Method and DTML Document edit interface. - Added a new module, BoboPOS.winlock, that provides file locking on windows. This should prevent many cases of data corruption. - Added FTP support to Documents, Files, Images, and Folders. FTP interface is detailed in OFS/FTPInterface.py though it may change. Basic FTP support was also added to SimpleItem to make it easier for Zope objects to support FTP. Bugs Fixed - Permissions for manage_clone method were wrong, meaning that essentially only managers could use it. - File paths that showed up in tracebacks reflected the paths the files had when they were compiled (at distribution build-time). The compiled-in paths have been changed to be relative to the Zope installation directory. - Fixed a bug in ZPublisher's special handling the "cancel" submit buttons. The test for the cancel button was case sensitive. I changed it so it would accept any case, as well as extra spaces. Cancel buttons should probably be handled using the new :method form type, but this would require the presense of an appropriate redirect method. Perhaps there should be a :redirect form type. - Date strings with years < 31 were not accepted, even through the documentation says they should be. - If Zope crashed or was unable to completely write a database record, then on restart, a data corruption error was reported. Now, truncated records are removed if necessary on start up. If necessary, other records are removed as well to avoid partially-written transactions. - Lack of sys.argv in the win32 service version of Zope caused it to raise errors under certain conditions. - Several HTTP PUT related bugs were fixed. - Simple items did not have an objectValues method, which caused odd behavior in certain tree tags since the method would be acquired from the parent of the simple item. - The Find form in the management interface depended on javascript to function properly. - Added a fix to compensate for the fact that Apache servers may rename the entire cgi environment when mod_rewrite rules are used in .htaccess files. - If system clocks were changed, so that database records had records in the "future", then database corruption could either occur or be incorrectly reported. Now this situation results in an informative error message and corruption does not occur. Zope 1.9.0 New Features - Zope now provides better information about products. If a Product has a README.txt, then it will be readable through the product management interface. If a product encounters an error during startup, the traceback is available through the product management interface. - Cache statistics are displayed in minutes, rather than seconds. - Products can define the attribute '__module_aliases__' in their '__init__' modules that specifies aliases for modules used in the product. This is useful if module names have changed and the database contains pickles refering to the old modules. The attribute should be a sequence of tuples. Each tuple has a (dotted) module name and a module. Bugs Fixed - Development on ZopeHTTPServer has been frozen in anticipation of the switch to Medusa. Therefor ZopeHTTPServer still does support PUT. Sorry. - ZPublisher.Client used the obsolete rand module. - Errors occuring during product import caused Zope to fail to come up. - Product version information was not displayed correctly. - ZGadflyDA cached table meta-data which lead to missleading information when browsing databases. Zope 1.9 beta 3 New Features - Z SQL Methods (FKA Aqueduct) and the Z Gadfly Database Adapter are now included. - The argument handling for ZopeHTTPServer has been changed to be a bit more flexible wrt the order of argumements. While options must still come first, environment settings can be given in any order. This makes startup scripts loke serve.py quite a bit simpler. - ZopeHTTPServer now sports preliminary support for PUT publishing. - ZopeHTTPServer now serves from port 9673 by default, not 8080. Bugs fixed - The start.bat file used to start ZopeHTTPServer on win32 was misnamed and didn't correctly pass command-line arguments. - Win32 machines without an existing Python installation had problems due to PYTHONPATH bootstrapping. - The included ZopeHTTPServer was failing to start correctly on win32 machines that were not connected to the network. Zope 1.9 beta 2 In addition to various documentation updates, this release includes: New Features - Changed serve.py to accept ZopeHTTPServer command-line options. - Added a -P option to the ZopeHTTPServer to specify a file to contain the process ID. This allows a script to stop the process on Unix. - Added support for the environment variables, Z_REALM and Z_DEBUG_MODE to set an authentication realm and to enable debug mode. Bugs fixed - External methods were broken due to differences in Python 1.4 and Python 1.5 comparison semantics. - ZopeHTTPServer command-line environment settings were not available in os.environ. - Some class references were wrong in examples in the ExtensionClass documentation. - INSTANCE_HOME was not set correctly when the debugger was run with a relative path to the published module. - The #! line in the ZopeHTTPServer was hidden by the copyright statement and didn't have the right path. - A bug in pcgi_publisher.py caused file uploads larger than 1 MB to fail. Zope 1.9 beta 1 Bugs fixed: - pcgi did not build correctly on Solaris 2.6 - links in headers were broken when Zope was reached with /, as is the case when the ZopeHTTPServer is used. - Python sources used tabs and spaces for indentation, which made some people unhappy. - Copyright statements were missing or out of date. - Added better instructions for building and running Zope. - Added new Zope License and attribution information. - Merged BoboHTTPServer updates with ZopeHTTPServer. Including socket changes to allow easier stopping and starting. - Shutting down the ZopeHTTPServer from the application caused an empty document to be returned. - The install scripts failed if run more than once when attempting to create a var directory. Features - Added (and old version of) the zlib module to make installation simpler. - Zope requires an access file. The install scripts now create one. Zope 1.9 alpha 1 This was the inital Zope test release. Futures Things we plan to happen real soon (maybe next release) Features - include a serve shell script along the lines of: #!/bin/sh python serve.py > var/serve.log 2> var/serve.errors & Note that this script should be written by the installers and use sys.executable. (Brian) Bugs - Chase down weird bugs reported by Michel Pelletier. Things to do sometime Features - Better deamon management for ZopeHTTPServer, Medusa, and pcgi-LRP (when pcgi wrapper gets out of process management business). (Note that there is some experimental code along these lines in principia main.) - Need make_clean.py that: - runs make clobber for the extensions - runs make clean in pcgi - prints an message reminding user to manually remove var (brian) - The default access file should be handled a little differently. The installer should make people enter values, the default should have a randomly generated password, or the default should be ommitted. Bugs Zope-2.0.1-ZEO-nonbin/doc/CREDITS.txt100644 1007 1403 3224 6745422557 16730 0ustar petrillipetrilliCredits The Zope software receives contributions from far and wide. Here's the Zope Hall of Fame: o Jeff Bauer is Zope Dude Number One. Jeff took over PCGI and kept pushing it forward through the years. o Sam Rushing worked with us at Digital Creations to make Medusa the publishing platform for ZServer and the concurrency of Zope2. o A subset of windows guru Mark Hammond's win32 extensions are bundled with win32 binary distributions of Zope. o Martijn Pieters and Brian Hooper contributed the #in reverse attribute. o Phillip Eby contributed the DTML 'let' tag and many other useful ideas, including the inspiration for the DTML 'call', 'with' and 'return' tags. o The DateTime module was based on work from Ted Horst. o Jordan Baker contributed the 'try' tag, something we've wanted for a long, long time. o Martijn Pieters chipped in with a safe range function. o Michael Hauser came up with the name "Zope". o Eric Kidd from Userland contributed to ZPublisher's support for XML-RPC. o Andrew M. Kuchling wrote the initial version of mod_pcgi, making him extremely cool in our book. o Jephte CLAIN made some patches to European TimeZope. o All the other Zopistas far and wide that stuck with us during the Bobo/Principia days and politely push us to make the best damn app server on this or any other planet. o Of course the list of credits would be quite incomplete without mentioning Guido van Rossum, benevolent dictator of Python and long-time friend of Digital Creations. Zope Power is Python Power. Zope-2.0.1-ZEO-nonbin/doc/DEBUGGING.txt100644 1007 1403 3005 6756031545 17116 0ustar petrillipetrilli Running Zope in Debug Mode If you wish to run Zope in debug mode, use the -D command line switch. This will have the following effect:: o On UNIX, Zope will not detach from the controlling terminal. o Zope will print logging information to standard error. o The Z_DEBUG_MODE environment variable gets set, which causes some other cool stuff in Zope to happen. Using the Medusa Monitor If you're running ZServer with a medusa monitor port, you can connect and interact via a python prompt with a running Zope session, while others interact with it over the web. Some constraints: o You must connect to a server running on the local host. o You must authenticate as superuser. o At the time of writing the superuser password (in the access file) must be plain text, not encrypted. To use the monitor, start it from the shell prompt like so (as if from the Zope root; must be python 1.5.2 or later): python ZServer/medusa/monitor_client.py localhost 8099 You'll get back a python prompt. To connect with the running Zope session: >>> import Zope >>> app = Zope.app() >>> dir(app.Control_Panel.Products) ['ExternalMethod', 'MIMETools', 'MailHost', 'OFSP', 'ZCatalog', 'ZGadflyDA', 'ZSQLMethods', '_objects'] >>> To see ODB changes effected via the web since you got the app, you may have to do a bit of magic: >>> app._p_jar.sync() To commit changes you make, before exiting, you may have to do another bit of magic: >>> get_transaction().commit() Zope-2.0.1-ZEO-nonbin/doc/FAQ.txt100644 1007 1403 17234 6752360675 16270 0ustar petrillipetrilliZope Installation Frequently Asked Questions -------------------------------------------- Installing Zope 1. I am trying to build Zope on my BSD based system, but I keep getting "symbol not found" errors and the build scripts stop. What do I do? On some BSD based systems (BSDI, BSD/OS), you need to edit the Makefile.pre.in files in your Zope installation to add -rdynamic to the LDSHARED makefile variable. On some systems it may also be necessary to change the file named 'do.py' located in the 'inst' directory of your Zope installation, changing the line: do('make') to: do('make -k'). 2. I am having trouble building Zope on a libc 5 Linux machine. Zope requires Python be built with glibc 2.x (libc 6) on Linux. Starting/Accessing your Zope installation 1. After installing Zope, I go to the URL in my web browser but I get a "404 Not Found" or "Server Error" message This message is coming from your web server, not Zope. It usually means that your web server is misconfigured. Ensure that the PCGI info file generated by the installation procedure exists in a cgi-enabled directory, and that your web server has any required aliases or configuration options set to enable it to find this file and run it as a cgi program. Look in the error log for your web server for details of the error. 2. I have installed Zope, and when I go to the URL in my web browser, I get a password prompt. Although I type in the correct username and password, I keep getting prompted. What is going on? Zope manages access control internally, but it relies on your web server software to relay any authentication information in web requests. Some web servers automatically filter this information out of requests passed to cgi programs. If you keep getting password prompts that never accept your password, this means that your web server is not properly configured to pass authentication info on to Zope. See the doc/WEBVSERVER.txt file for information on correctly configuring your web server to pass authentication information. 3. I have installed Zope, and when I go to the URL in my web browser, I get a screen that says "Temporarily Unavailable". Try the URL again - if you still get "Temporarily Unavailable", this means that your PCGI resource file was unable to start the Zope process. This usually means either an error in the PCGI resource file, or a problem with your Zope installation such as incorrect permissions on certain directories. You should always run the install script to ensure that a correct PCGI resource file is generated. If you have changed this file by hand, ensure that all of the pathnames in the file are valid and that there are no typos. The install script should also ensure correct ownership and permissions on files and directories in your Zope installation. The var subdirectory of your installation and everything therein MUST be writable by the user which runs cgi scripts on your web server (usually nobody if you are using PCGI.) If you have ensured that the PCGI info file is correct and that all permissions are correct, you can look in the /var/tmp directory of your machine for files with names like "pcgi.110407". If PCGI fails to start the Zope process, it will attempt to write a file named pcgi.HHMMSS to /var/tmp containing information which may be useful in determining the error. On Windows NT platforms, check the event log under "Application Log" for error information. Additionally, if you receive a "Temporarily Unavailable", look at the document source for an HTML comment with error information. 4. When I go to a URL for an application that isn't running, it takes quite a while to startup. Why is that? The *PCGI wrapper*, which is the executable run as a CGI script on every request, has quite a bit of thinking to do. First, it has to see if the app is already running. If not, it has to see if any other PCGI wrappers have already started the app. It is this latter part where some of the delay presents itself. Next, the application itself has to get into memory and then get the database loaded. Depending on database file size, this might take a while. Packing your Zope database at regular intervals can reduce startup time. 5. I have Zope with the Oracle Database adapter installed, and can't get it running. Why? If you have Oracle installed, you need to ensure that the environment variable "ORACLE_HOME" is in the environment of the running application. You can do this by adding a line to your PCGI resource file such as: ORACLE_HOME=/usr/bin/oracle Any NAME=VALUE pairs appended to the PCGI resource file will be added to the environment of the process when it is started by PCGI. Managing the Zope process 1. How do I find the application server in my process listing? Whether running Zope with ZServer (yay) or straight PCGI (not so yay), there will be a .pid file in var with the pid of the process. For ZServer, the pid file is named 'z2.pid' (and it contains two pids). For PCGI, the file will be 'pcgi.pid'. 2. If I have more than one Zope process running on the same machine, how do I tell them apart in "ps" listings? When running under ZServer, the Zope processes will show up in the listings with 'z2.py'. (You may need to do a long listing to see it.) PCGI mastered zopes will have 'pcgi-wrapper'. 3. What files are used by the object database? The state of the application is stored in files in the 'var' subdirectory inside the installation. There is currently one file: o Data.fs -- Primary database file Data.fs replaces the database file of prior versions, Data.bbb. To convert an existing Data.bbb file to the new format, see doc/ZODB.txt. Other files in the 'var' directory are associated with each process and are only temporary. 4. Is it OK to use 'kill' to shutdown the process? It is best to shutdown the process using the Shutdown button in the Control Panel. Alternatively, the URL: 'Control_Panel/manage_shutdown' will, with a suitable username and password, shutdown the application. If you need a non-interactive way to shutdown your application, e.g. from a script, then write a program that sends a web request to that URL with the appropriate username and password. If you must, you can shutdown the application by killing it. The respective var/*.pid file will have the pids - for ZServer (yay) it's var/z2.pid, for pcgi (not so yay), it's var/pcgi.pid. General 1. My browser is giving a message of 'Sorry, an error occurred.' How do I find out the error? Step number one in these scenarios is to view the HTML source of the frame containing the error. In general, the *traceback* of the error message is enclosed in an HTML comment. This traceback explains the error message. Occassionally you won't see the error message. Rather, the HTML source will contain the last good HTML returned by the request before the error occurred. This is due to caching by the browser. Clear your cache and view the HTML source again. Zope-2.0.1-ZEO-nonbin/doc/INSTALL.txt100644 1007 1403 11345 6756315562 16763 0ustar petrillipetrilliBuilding and installing Zope from source ---------------------------------------- This document describes building and installing Zope on Unix. We will provide Windows instructions in later releases. We will also provide binary releases for some platforms. Important notes ZOPE 2.0 REQUIRES PYTHON 1.5.2! See CHANGES.txt for important notes on Zope 2.0. Quick Start If you are impatient, the following commands should get you up and running with Zope 2 using ZServer and ZODB 3 on Unix:: python w_pcgi.py # Note, this must be Python 1.5.2 ./start The first command builds and adjusts Zope. Take note of the user name and password output at the end of this command. You will need these to manage Zope. If you get errors indicating that addresses are in use, then you will have to supply arguments to z2.py to change the ports used for HTTP or FTP. The default HTTP and FTP ports used by ZServer are 8080 and 8021 respectively. (See the help for the z2.py script by running z2.py with the -h option for more information on how to specify different ports) You can then connect to Zope 2 by directing your browser to:: http://yourhost:8080/manage where yourhost is the name or address of the machine running Zope 2. If you changed the HTTP port with the -w option to z2.py, then use it rather than 8080. You will be prompted for a user name and password. Use the user name and password output above. Now you're off and running! You should be looking at the Zope management screen which is divided into two frames. On the left you can navigate between Zope object and on the right you can edit them by selecting different management functions with the tabs at the top of the frame. If you haven't used Zope before, you should head to the Zope web site and read some documentation. The Zope Manager's Guide is a good place to start. You can access the Zope site at: 'http://www.zope.org/' Have fun! Building Zope There are some python scripts in the top-level directory that should help you get started. You must run these scripts from the top-level directory. If you want to try out Zope in the simplest fashion using ZServer, then run the script wo_pcgi:: python wo_pcgi.py If you want to use PCGI and an existing web server run w_pcgi:: python w_pcgi.py Notes * You should be using Python 1.5.2 to run the build scripts. * The python you run Zope with *must* have threads compiled in, which is *not* the case for a vanilla build. When you build the python you'll use, 'configure --with-threads' does the right thing. * To build python extensions you need to have Python configuration information available. If your Python comes from an RPM you may need the python-devel package installed too. If you built Python from source all the configuration information should already be there. * If you just want to use Zope components it's not necessary to build Zope but it's a good idea since it will compile Python C extensions for you. * You can use PCGI and an existing web server if you use ZServer. Starting Zope with an existing web server See the WEBSERVERS.txt file for more information about configuring Zope with an existing web server. Running Zope There are two ways to run Zope: - You can use ZServer, the integration of Zope and Medusa. You must use ZServer if you want to use multiple concurrent threads. ZServer is a server application that supports multiple protocols: o HTTP -- ZServer is a Web server o FTP -- ZServer is a file-transfer protocol server. This allows you to use FTP-enabled publishing systems with Zope. o PCGI -- PCGI is a lightweight protocol for forwarding requests from other web servers, like Apache or Netscape, to Zope. This makes it possible to use web server features like connection encryption or logging with Zope. o monitor -- ZServer has the capability to allow you to access the Python interpreter directly over a network channel. If you intend to use this, please read the 'DEBUGGING.txt' document for more information. With ZServer, you must start Zope manually using the z2.py script. Typically, the command used to run the z2.py script will be put in system startup scripts. ZServer is the prefered way to run Zope. - If you *only* want to use PCGI and you don't need multi-threaded operation, you can have a special program, the pcgi_publisger, start Zope for you. See the WEBSERVER.txt file for details on using Zope with an existing webserver. If you wish to enable Zope logging you must specify options on the command line. See LOGGING.txt in the doc directory. Zope-2.0.1-ZEO-nonbin/doc/LOGGING.txt100644 1007 1403 6347 6746157265 16734 0ustar petrillipetrilliZope Logging Zope2 now comes with a Logging facility called ZLogger. ZLogger is an extensible logging system. Currently, ZLogger will log either to a file or to syslog. (Syslog logging works even on windows, because it talks directly to the syslog server using UDP, instead of the POSIX syslog calls). Logging is controlled by setting environment variables. This is done most easily by providing the settings on the z2.py command line. For example:: $ python1.5.2 z2.py ZSYSLOG_SERVER="syslog.mydomain.com:514" \ STUPID_FILE_LOGGER=var/Zope.log" Currently, the following environment variables can be set: STUPID_FILE_LOGGER="path" The stupid file logger writes Zope logging information to a file. It is not very smart about it - it just dumps it to a file and the format is not very configurable - hence the name. ZSYSLOG="anything" Setting this environment variable will cause Zope to try and write to the '/dev/log' UNIX domain socket. This will only work on UNIX, and only if your syslogd domain socket is named /dev/log. ZSYSLOG_SERVER="machine.name:port" Setting this environment variable tells Zope to connect a UDP socket to machine.name (which can be a name or IP address) and 'port' which must be an integer. The default syslogd port is '514' but Zope does not pick a sane default, you must specify a port. This may change, so check back here in future Zope releases. Calling the logger in your code If you want your own Zope extensions to use logging: import zLOG zLOG.LOG(subsystem, severity, summary, detail, error, reraise) The following arguments are required: subsystem -- The subsystem generating the message (e.g. ZODB) severity -- The "severity" of the event. This may be an integer or a floating point number. Logging back ends may consider the int() of this value to be significant. For example, a backend may consider any severity with integer value of WARNING to be a warning. By default, the zLOG module defines the following severities: BLATHER=-100 INFO=0 PROBLEM=WARNING=100 ERROR=200 PANIC=300 summary -- A short summary of the event. detail -- A detailed description. error -- A three-element tuple consisting of an error type, value, and traceback. If provided, then a summary of the error is added to the detail. reraise -- If provided with a true value, then the error given by error is reraised. Creating your own Logger Creating your own Zope logger is easy. Simply define a logger class with the following interface:: class LumberJack: """ an ok Logger I sleep all night, I work all day """ def __init__(self): pass def __call__(self, sub, sev, sum, det, err): print ' %s, %s, %s, %s, %s, %s' % (self, sub, sev, sum, det, err) Then you must edit lib/python/Zope/ZLogger/ZLogger.py and instantiate one of your Loggers in the 'logger' tuple:: loggers = (stupidFileLogger.stupidFileLogger(), syslogLogger.syslogLogger(), LumberJack.LumberJack(),) Zope-2.0.1-ZEO-nonbin/doc/SECURITY.txt100644 1007 1403 6427 6746157426 17113 0ustar petrillipetrilliSetting the Zope "super manager" name and password Because Zope is managed through the web, user names and passwords must be used to assure that only authorized people can make changes to a Zope installation. User names and passwords are normally defined by creating and modifying user folders within Zope. A special "super manager" user name and password are defined outside the application for two reasons * Some user name and password is needed to authorize creation of normal managers of your Zope site. * The "super manager" provides an all-powerful user that can do anything in the application, and whose password cannot be changed through the application user interface. This user name and password is defined in the 'access' file located in the Zope directory. It should be readable only by the user as which your web server runs. The super manager username and password should only be used when defining the normal management users and passwords and when dealing with unusual situations, like lost (or hacked) manager user names and passwords. In order to provide a somewhat higher level of security, various encoding schemes are supported which provide access to either SHA-1 encryption or the standard UNIX crypt facility if it's been compiled into Python. Unless you have some special requirements (see below), you should use the SHA-1 facility, which is the default. The access file should consist of a single line of the form: name:password The build scripts automatically create an 'access' file for you, using a default username and a randomly generated password which will be given at the end of the build script. The default is to encode this with SHA, so please remember this password as there is no way to recover it. Note that you may also add an optional third component to the line in the access file to restrict super manager access by domain. For example, the line: mario:nintendoRules:*.mydomain.com in your 'access' file will only allow super manager access to your installation from *.mydomain.com machines. Attempts to access the system from other domains will fail, even if the correct superuser name and password are used. Note that there is now a program to change the password, 'zpasswd.py', which if run will explain how to use it, and if run it its most basic form will prompt for all information. Please note that if you use the ZServer monitor capability, you will need to run with a clear text password in this beta release. Setting permissions on the var directory. You need to set permissions on the Zope var directory. Zope needs to read and write data from its var directory. Before running Zope you should ensure that you give adequate permissions to the Zope var directory for the userid Zope will run under. Depending on how you choose to run Zope you will need to give different permissions to the var directory. If you use Zope with an existing web server, it will probably run Zope as 'nobody'. In this case 'nobody' needs read and write permissions to the var directory. If you change the way you run Zope you may need to modify the permissions of the var directory and the files in it to allow Zope to read and write under its changed userid. Zope-2.0.1-ZEO-nonbin/doc/WEBSERVER.txt100644 1007 1403 27675 6765757212 17240 0ustar petrillipetrilliUsing Zope with an existing web server -------------------------------------- While Zope comes with a web server, you may wish to use it with an existing web server. Use Persistent CGI (PCGI) to allow your existing web server to work with Zope on Unix and Windows. Roughly, PCGI is a protocol for translating CGI requests from a web server into Zope requests. CGI requests are traditionally one shot events; the web server handles a request for a CGI script by spawning a new process to handle the requests, returning the results of the request when the process dies. Zope is a long running process, which means that it does not start up and die on each request like traditional CGI programs. If it did, each request would take far too long due to the time to start and stop an application server like Zope. Thus, PCGI is one of the options for gatewaying from the separate CGI processes to the Zope long running process. Using Zope in multi-threaded mode with ZServer ---------------------------------------------- ZServer is a general purpose TCP server for publishing Zope objects over various transport protocols. For Zope to run multi-threaded, you must run ZServer. ZServer is based on Sam Rushing's Medusa software. The benefit of using Medusa as the ZServer core is that it is not protocol specific (Medusa provides libraries to program for any protocol) and it is easily extensible. Because Medusa is written in Python, is extremely high performance by design, and comes with an HTTP and FTP server, we chose it for the Zope core. It is not necessary, however, for ZServer to actually listen for incoming HTTP requests. If you want Apache to do the actual listening and serving, then you can use ZServer's PCGI component to communicate with Apache. To run ZServer with PCGI, you must specify the -p option to the 'z2.py' startup script. From the top level Zope directory, you can:: bash% python1.5.2 z2.py -p Note, you must have gone through the directions in 'INSTALL.txt' for this to work. This command will start ZServer up with PCGI (by default, it will also start up an HTTP and FTP server). For PCGI to work, the webserver and Zope must agree on a PCGI resource file. If this file is not named 'Zope.cgi' and is not in the same directory as 'z2.py', then you can specify the file name after the '-p', like:: bash% python.1.5.2 z2.py -p /path/to/PCGI/resource/file Now the Zope long running process is started up, and the PCGI component is loaded and ready to receive CGI requests from your webserver. The installation process should create a 'Zope.cgi' PCGI file. Copy the 'Zope.cgi' file to your web server's 'cgi-bin' directory. On Unix you can also create a symbolic link to 'Zope.cgi' from your cgi-bin directory. For example:: ln -s /home/amos/Zope/Zope.cgi /usr/local/apache/cgi-bin/Zope At this point you should perform any other steps you web server requires to install and configure a CGI script. Note: For more information on PCGI check out Jeff Bauer's "PCGI pages", http://starship.skyport.net/crew/jbauer/persistcgi/. When your Zope.cgi file is correctly configured as a CGI script with your web server, you are ready to access Zope through the web. You should point your browser at: 'http://youmachine.example.com:8998/cgi-bin/Zope.cgi/manage' (Your URL maybe be different depending on how your web server is configured.) You should be prompted to enter a username and password. Enter the Zope "super manager" name and password. Note: Apache requires some tricky configuration to get it to pass the HTTP authentication header information to Zope. See the section 'Zope authentication with existing web servers'. Using Zope in single-threaded mode with pcgi_publisher ------------------------------------------------------ The installation process should create a 'Zope.cgi' PCGI file. Copy the 'Zope.cgi' file to your web server's cgi-bin directory. On Unix you can also create a symbolic link to 'Zope.cgi' from your cgi-bin directory. For example:: ln -s /home/amos/Zope/Zope.cgi /usr/local/apache/cgi-bin/Zope At this point you should perform any other steps you web server requires to install and configure a CGI script. Note: For more information on PCGI check out Jeff Bauer's "PCGI pages", http://starship.skyport.net/crew/jbauer/persistcgi/. When your Zope.cgi file is correctly configured as a CGI script with your web server, you are ready to access Zope through the web. You should point your browser at: 'http://youmachine.example.com:8998/cgi-bin/Zope.cgi/manage' (Your URL maybe be different depending on how your web server is configured.) You should be prompted to enter a username and password. Enter the Zope "super manager" name and password. Zope authentication with existing web servers --------------------------------------------- Zope normally performs both authentication and authorization of users. Some web servers don't pass authentication information to CGI scripts. If you keep getting rejected when you try to access Zope through the web with the "super manager" user name and password, there is a good chance that your web server is not passing authentication information to Zope. Getting Apache to pass authentication headers Before attempting to use your own Apache with Zope, it is highly recommended that you look at Zap. Zap is a preconfigured and precompiled version of Apache for Linux that drops right into Zope with no hassles. Even if you want to use your own Apache, or if you use it on a different platform than Linux, it is very helpful to have Zap's 'httpd.conf' file to guide you through configuring Apache. Zap can be found on the Zope website at: http://www.zope.org/Download/Releases/Zap-1.1.0 If you are using Apache you will need to convince Apache to pass authentication headers to Zope. The easiest way to do this with Apache 1.3 and above is to use mod_rewrite. Here is an example of configuration information which you would place in an Apache conf file:: # Zope configuration maps /Zope/ to the Zope.cgi CGI script RewriteEngine on RewriteCond %{HTTP:Authorization} ^(.*) RewriteRule ^/Zope/(.*) /usr/local/apache/cgi-bin/Zope.cgi/$1 [e=HTTP_CGI_AUTHORIZATION:%1,t=application/x-httpd-cgi,l] Note that the RewriteRule should be one long line, and that the last character is the letter l, not the number 1. For Apache servers version 1.3b4 and above, there is an alternate way to get the server to pass through authorization headers, but you must have the ability to recompile your Apache server binary. If you pass the flag -DSECURITY_HOLE_PASS_AUTHORIZATION when compiling the server, the resulting Apache binary will allow authorization headers to pass through to CGI programs and you can avoid using the Rewrite rules described above. Allowing your server to handle authentication itself Sometimes you may prefer to handle authentication outside Zope, for example if your web server already does complex authorization, or if it seems too difficult to convince it to pass authentication information to Zope. As of 1.9, Zope began supporting a mode that allowed the web server to handle authentication. The 'REMOTE_USER' environment variable is then matched to the identity of a user object in Zope. The following provide step-by-step instructions for setting this up in Apache, allowing both the Zope "super manager" defined in the Zope 'access' file and users defined in Zope User Folders to be authenticated via the web server. Get Apache to authenticate /cgi-bin/Zope Add a directive in your Apache configuration file such as:: AuthType Basic AuthName Zope-realm AuthUserFile /usr/local/etc/httpd/conf/ru_users require valid-user Then send Apache a '-1' signal to tell it to re-read its configuration files. *Note*: The above presumes that '/cgi-bin/Zope' has been made executable by some other Apache directive in the configuration file. Ensure Apache has 'superuser' Using Apache's tools for managing a user database, make sure that the 'AuthUserFile' defined above has a valid user called 'superuser'. Get Zope to use Apache's authentication Change Zope's access file to contain just the superuser id followed by a colon, as in:: superuser: Note that this can be any value, including spaces. The only restriction is that the value must match a user defined in Apache's user database. Shut down Zope by doing:: kill `cat var/Main.pid` from the Zope directory. Configure Zope At this point you are able to log in using the "superuser" identity. If you want other people defined in the Apache user database to have identities in Zope, you need to add them to a User Folder (the object whose ID is acl_users). Either click on the pre-defined acl_users in the top folder or add a User Folder object to a subfolder. Specific web servers Apache * As mentioned above, Apache does not pass authorization information to CGI scripts by default. See above for information on how to deal with this situation. * An Apache module to support PCGI (mod_pcgi) is under development. Netscape Servers * Like Apache, Netscape does not pass HTTP Authorization information to CGI scripts. We have a plugin at our website that addresses this. http://www.digicool.com * Alternatively, you can allow the web server to perform the authentication step. See above for more information. IIS * You must turn off Windows NT Challenge/Response authentication. To do this, go to IIS Manager, right-click on the server, select Service Properties, and deselect *both* 'Windows NT Challenge/Response' and, strangely, Basic Authentication from the Password Authentication area of the Service tabbed worksheet. * IIS kindly throws out PATH_INFO when writing to its logs, so if you want to log which Zope objects are actually being accessed, you will need to investigate an ISAPI filter * An ISAPI module to support PCGI is under development. * IIS 4.0 throws away Zope's error messages by default. This behavior can create quite a few problems, including authentication problems. Microsoft prides itself on the clear error messages that IIS 4.0 presents, when the user makes a mistake. These error messages are implemented in the form of Custom Error handlers, that return a file, or URL to a user when a certain error occurs. This means, that when you forget to fill in an Id when you want to create, say, a new SQL Method, Zope's clear error message is replaced by IIS's totally irrelevant error message. Also, it completely breaks authentication when the user uses IE5.0 when trying to log into a secure area of the server. These Custom Error handlers are enabled by default. Luckily, the handlers can quite easily be switched off: Open the IIS website in the Management Console, and navigate to the folder you put the PCGI executable in. If you named your Zope installation 'Zope', it will be called 'Zope.exe'. Double-click on that file. A property page will appear. Select the 'Custom Errors' tab. Now, select every HTTP Error code in the listbox that doesn't have type 'Default', and click on the 'Set to Default' button for each one. This will disable IIS overriding the error message returned by Zope. Click OK, and voila, Zope is allowed to tell the world what it thinks went wrong. Zope-2.0.1-ZEO-nonbin/doc/ZODB.txt100644 1007 1403 6251 6765756625 16404 0ustar petrillipetrilliThe Zope Object Database, ZODB, version 3.0 ZODB is the next generation of our object database architecture. It provides a number of advantages over or existing databases: - Support for concurrency, - Well-defined storage management interface that will allow many different storage management strategies to be used, from file storage, to RDBMS storage, to memory storage, - More robust file storage format, - Much better version support and integrations of versions with the transaction system. For example, it is possible to commit from one version to another, to undo version commit and abort, and to use "temporary versions" to reduce memory use when manipulating large quantities of data. - Support for multiple databases in the same object system. - Support for multi-process storage managers, although the standard distribution will not include any multiple process storage managers. Note: Using ZODB 3 from Python In ZODB 2, you could access the top-level application object with:: import Main app=Main.app You could then navigate from the top-level object by getting attributes, calling methods, etc.. In ZODB 3, you get the top-level object like this:: import Zope app=Zope.app() ... do stuff with objects # and when you're done: app._p_jar.close() You have to import the Zope application module, which uses ZODB 3 rather than ZODB 2. In ZODB 3, you have to get a connection to a database before you access an object. The 'app()' function combines opening a connection and getting the top level object. When your done using the top-level object (or any objects accessible from it) you can close the database connection by calling the 'close' method on the '_p_jar' attribute, which is the database connection. You don't need to close the connection if you are going to exit Python without doing any more work. Don't forget to:: get_transaction().commit() If you want any changes to made to be saved. Note: Converting ZODB 2 (aka BoboPOS) data files to ZODB 3. The bbb.py script in utilities can be used to convert data files from ZODB 2 to ZODB 3 format:: utilities/bbb.py -f output_file input_file Here's a example:: utilities/bbb.py -f var/Data.fs var/Data.bbb You can also convert export files from ZODB 2 by inclding the -x option:: utilities/bbb.py -x -f output.zexp input.bbe ZODB 3 and Zope Database Adapters Most database adapters are *currently* likely to be problematic unless the underlying extensions and libraries: - allow multiple simultaneous database connections, - are thread safe, - give up the Python global interpreter lock when making database calls. This is only a problem when running Zope 2 with multiple threads. ZODB 3 Futures These are features that are lkely to wait for releases after 2.0. - Multiple database support - OPTIMIZATION: FileStorage will get a more efficient data structure for maintaining index information and key methods in the ZODB framework will move to C. Zope-2.0.1-ZEO-nonbin/inst/ 40755 1007 1403 0 6772126757 15207 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/inst/binary_install.py100644 1007 1403 13357 6752272114 20704 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Try to do all of the installation steps. This must be run from the top-level directory of the installation. \(Yes, this is cheezy. We'll fix this when we have a chance. """ import sys, os, getopt from do import * def setup(me): home=os.path.split(me)[0] if not home or home=='.': home=os.getcwd() home=os.path.split(home)[0] if not home or home=='.': home=os.getcwd() sys.path.insert(0, os.path.join(home)) sys.path.insert(0, os.path.join(home,'inst')) return home def main(args): me=args[0] home=setup(me) pcgi=os.path.join(home, 'Zope.cgi') usage="""install [options] where options are: -p -- Supply the path to the PCGI resource file. This defaults to %s. -g -- Supply the name of the unix group to which the user that runs your web server belongs. If not specified, the installer will attempt to determine the group itself. If no group is specified and the installer is unable to determine the group, the install will fail. -u -- Supply the name of the unix user used to run your web server. If not specified, this defaults to the userid of the current user, or 'nobody' is the current user is root. -h -- Show command summary """ % (pcgi) try: options, args = getopt.getopt(sys.argv[1:], 'p:g:hu:') except: error(usage, sys.exc_info()) if args: error('', ('Unexpected arguments', args)) group=user='' for k, v in options: if k=='-p': pcgi=v elif k=='-g': group=v elif k=='-u': user=v import compilezpy print '-'*78 import zpasswd; zpasswd.write_access(home, user, group) import default_content; default_content.main(home, user, group) import make_resource; make_resource.main(home, pcgi, user, group) import make_start; make_start.sh(home, user, group) print '-'*78 print print 'Done!' if __name__=='__main__': main(sys.argv) Zope-2.0.1-ZEO-nonbin/inst/build_extensions.py100644 1007 1403 10666 6745674206 21262 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Build the Zope Extension Modules You must be in the directory containing this script. """ from do import * print print '-'*78 print 'Building extension modules' make('lib','python') make('lib','python','DocumentTemplate') make('lib','python','ZODB') make('lib','python','SearchIndex') make('lib','python','Shared','DC','xml','pyexpat') # Try to link/copy cPickle.so to BoboPOS to out-fox # stock Python cPickle. cd('lib') files=filter( lambda f: string.lower(f[:8])=='cpickle.', os.listdir('python') ) if files: cd('python'); cd('ZODB') for f in files: src=os.path.join('..',f) try: os.link(src,f) except: open(f,'wb').write(open(src,'rb').read()) cd('..'); cd('..') cd('..') Zope-2.0.1-ZEO-nonbin/inst/build_pcgi.py100644 1007 1403 7651 6745674205 17764 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Build a PCGI You must be in the directory containing this script. """ print print '-'*78 print "Building the PCGI wrapper" from do import * os.chdir('pcgi') do('./configure') do('make') os.chdir('..') Zope-2.0.1-ZEO-nonbin/inst/compilezpy.py100644 1007 1403 7720 6746142167 20051 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import compileall, os, sys class Shutup: def write(*args): pass # :) print print '-'*78 print 'Compiling python modules' stdout=sys.stdout try: sys.stdout=Shutup() compileall.compile_dir(os.getcwd()) finally: sys.stdout=stdout Zope-2.0.1-ZEO-nonbin/inst/default_content.py100644 1007 1403 10243 6745710127 21042 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import os from do import * def main(home, user='', group=''): data_dir=os.path.join(home,'var') ch(data_dir, user, group, 0711) db_path=os.path.join(data_dir, 'Data.fs') dd_path=os.path.join(data_dir, 'Data.fs.in') if not os.path.exists(db_path) and os.path.exists(dd_path): print '-'*78 print 'creating default database' open(db_path,'wb').write(open(dd_path,'rb').read()) ch(db_path, user, group) Zope-2.0.1-ZEO-nonbin/inst/do.py100644 1007 1403 12107 6754370517 16274 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Shared routines used by the various scripts. """ import os, sys, string try: import thread except: print "*******************************************" print "Error: " print "Zope requires Python thread support!" print "*******************************************" sys.exit(1) cd=os.chdir def do(command, picky=1): print command i=os.system(command) if i and picky: raise SystemError, i def wheres_Makefile_pre_in(): "Identify Makefile.pre.in location (in much the same way it does)." return "%s/lib/python%s/config/Makefile.pre.in" % (sys.exec_prefix, sys.version[:3]) def error(message, error): print message if error: print "%s: %s" % error[:2] def ch(path, user, group, mode=0600): if group: mode=mode+060 do("chgrp %s %s" % (group, path), 0) if user: do("chown %s %s" % (user, path), 0) do("chmod %s %s" % (oct(mode), path), 0) def make(*args): print print '-'*48 print 'Compiling extensions in %s' % string.join(args,'/') for a in args: os.chdir(a) # Copy over and use the prototype extensions makefile from python dist: do("cp %s ." % wheres_Makefile_pre_in()) do('make -f Makefile.pre.in boot PYTHON=%s' % sys.executable) do('make') do('make clean') for a in args: os.chdir('..') Zope-2.0.1-ZEO-nonbin/inst/make_resource.py100644 1007 1403 10705 6746102605 20510 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Build a PCGI resource file. You must be in the directory containing this script. """ import os from do import * def main(cwd=os.getcwd(), name='Zope', user='', group=''): python=sys.executable print '-'*78 print 'Writing the pcgi resource file (ie cgi script), %s' % name cwd=os.environ.get('ZDIR',cwd) open(name,'w').write('''#!%(cwd)s/pcgi/pcgi-wrapper PCGI_NAME=Zope PCGI_MODULE_PATH=%(cwd)s/lib/python/Zope PCGI_PUBLISHER=%(cwd)s/pcgi/pcgi_publisher.py PCGI_EXE=%(python)s PCGI_SOCKET_FILE=%(cwd)s/var/pcgi.soc PCGI_PID_FILE=%(cwd)s/var/pcgi.pid PCGI_ERROR_LOG=%(cwd)s/var/pcgi.log PCGI_DISPLAY_ERRORS=1 BOBO_REALM=%(name)s BOBO_DEBUG_MODE=1 INSTANCE_HOME=%(cwd)s ''' % vars()) ch(name, user, group, 0711) Zope-2.0.1-ZEO-nonbin/inst/make_start.py100644 1007 1403 11001 6760612136 20005 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import sys, os from do import * def sh(home, user, group): start=os.path.join(home, 'start') if not os.path.exists(start): print '-'*78 print 'Creating start script, start' open(start,'w').write( "#! /bin/sh\n" "reldir=`dirname $0`\n" "PYTHONHOME=`cd $reldir; pwd`\n" "export PYTHONHOME\n" 'exec %s \\\n $PYTHONHOME/z2.py \\\n -D "$@"\n' % sys.executable) ch(start,user,group,0711) stop=os.path.join(home, 'stop') if not os.path.exists(stop): print '-'*78 print 'Creating stop script, stop' open(stop,'w').write( "#! /bin/sh\n" "kill `cat %s`" % os.path.join(home,'var','Z2.pid')) ch(stop,user,group,0711) Zope-2.0.1-ZEO-nonbin/lib/ 40755 1007 1403 0 6772126757 15000 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/Components/ 40755 1007 1403 0 6772126757 17125 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/Components/BTree/ 40755 1007 1403 0 6772126757 20126 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/Components/BTree/BTree.c100755 1007 1403 132670 6757112625 21434 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ static char BTree_module_documentation[] = "" "\n$Id: BTree.c,v 1.27 1999/08/19 23:39:01 jim Exp $" ; #define PERSISTENT #ifdef PERSISTENT #include "cPersistence.h" #ifdef INTKEY #ifdef INTVAL #include "intSet.h" #endif #endif #else #include "ExtensionClass.h" #define PER_USE_OR_RETURN(self, NULL) #define PER_ALLOW_DEACTIVATION(self) #define PER_PREVENT_DEACTIVATION(self) #define PER_DEL(self) #endif static void PyVar_Assign(PyObject **v, PyObject *e) { Py_XDECREF(*v); *v=e;} #define ASSIGN(V,E) PyVar_Assign(&(V),(E)) #define UNLESS(E) if(!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E); UNLESS(V) #define RETURN_NONE Py_INCREF(Py_None); return Py_None #define LIST(O) ((PyListObject*)(O)) #define OBJECT(O) ((PyObject*)(O)) #define MIN_BUCKET_ALLOC 8 #define MAX_SIZE(N) 32 #ifdef INTKEY #define KEY_TYPE INTKEY #define KEY_PARSE "i" #define TEST_KEY(k) ((k)-ikey) #define DECREF_KEY(k) #define ASSIGN_KEY(k,e) (k=e) #else #define KEY_TYPE PyObject * #define KEY_PARSE "O" #define TEST_KEY(k) PyObject_Compare(k,key) #define DECREF_KEY(k) Py_DECREF(k) #define ASSIGN_KEY(k,e) ASSIGN(k,e) #endif #ifdef INTVAL #define VALUE_TYPE INTVAL #define VALUE_PARSE "i" #define DECREF_VALUE(k) #define ASSIGN_VALUE(k,e) (k=e) #else #define VALUE_TYPE PyObject * #define VALUE_PARSE "O" #define DECREF_VALUE(k) Py_DECREF(k) #define ASSIGN_VALUE(k,e) ASSIGN(k,e) #endif typedef struct ItemStruct { KEY_TYPE key; VALUE_TYPE value; } Item; typedef struct BTreeItemStruct { KEY_TYPE key; PyObject *value; int count; } BTreeItem; typedef struct { cPersistent_HEAD int size, len; Item *data; } Bucket; staticforward PyExtensionClass BucketType; #define BUCKET(O) ((Bucket*)(O)) #define Bucket_Check(O) ((O)->ob_type==(PyTypeObject*)&BucketType) typedef struct { cPersistent_HEAD int size, len; BTreeItem *data; int count; } BTree; staticforward PyExtensionClass BucketType; #define BTREE(O) ((BTree*)(O)) #define BTree_Check(O) ((O)->ob_type==(PyTypeObject*)&BTreeType) /************************************************************************ BTreeItems */ typedef struct { PyObject_HEAD BTree *data; int first, len; char kind; } BTreeItems; staticforward PyTypeObject BTreeItemsType; static PyObject * newBTreeItems(BTree *data, char kind, int first, int last) { BTreeItems *self; UNLESS(self = PyObject_NEW(BTreeItems, &BTreeItemsType)) return NULL; Py_INCREF(data); self->data=data; self->kind=kind; self->first=first; self->len=last-first; return OBJECT(self); } static void BTreeItems_dealloc(BTreeItems *self) { Py_DECREF(self->data); PyMem_DEL(self); } static int BTreeItems_length( BTreeItems *self) { return self->len; } static PyObject * BTreeItems_concat( BTreeItems *self, PyObject *bb) { PyErr_SetString(PyExc_TypeError, "BTreeItems objects do not support concatenation"); return NULL; } static PyObject * BTreeItems_repeat(BTreeItems *self, int n) { PyErr_SetString(PyExc_TypeError, "BTreeItems objects do not support repetition"); return NULL; } static PyObject * BTreeItems_item_BTree(char kind, int i, BTree *btree) { int l; BTreeItem *d; PyObject *r; PER_USE_OR_RETURN(btree, NULL); for(d=btree->data, l=btree->len; --l >= 0 && i >= d->count; i -= d->count, d++); PER_ALLOW_DEACTIVATION(btree); if(Bucket_Check(d->value)) { PER_USE_OR_RETURN((Bucket*)(d->value), NULL); switch(kind) { case 'k': #ifdef INTKEY r=PyInt_FromLong((BUCKET(d->value)->data[i].key)); #else r=(BUCKET(d->value)->data[i].key); Py_INCREF(r); #endif break; case 'v': #ifdef INTVAL r=PyInt_FromLong((BUCKET(d->value)->data[i].value)); #else r=(BUCKET(d->value)->data[i].value); Py_INCREF(r); #endif break; default: r=Py_BuildValue(KEY_PARSE VALUE_PARSE, BUCKET(d->value)->data[i].key, BUCKET(d->value)->data[i].value); } PER_ALLOW_DEACTIVATION(BUCKET(d->value)); return r; } return BTreeItems_item_BTree(kind, i, BTREE(d->value)); } static PyObject * BTreeItems_item(BTreeItems *self, int i) { int j, l, L; j=i; l=self->len; if(j < 0) j += l; i=j+self->first; PER_USE_OR_RETURN(self->data, NULL); L=self->data->count; PER_ALLOW_DEACTIVATION(self->data); if(j < 0 || j >= l || i >= L) { PyObject *v; v=PyInt_FromLong(i); UNLESS(v) { v=Py_None; Py_INCREF(v); } PyErr_SetObject(PyExc_IndexError, v); Py_DECREF(v); return NULL; } return BTreeItems_item_BTree(self->kind, i, self->data); } static PyObject * BTreeItems_slice(BTreeItems *self, int ilow, int ihigh) { if(ihigh > self->len) ihigh=self->len; ilow += self->first; ihigh += self->first; return newBTreeItems(self->data, self->kind, ilow, ihigh); } static int BTreeItems_ass_item(BTreeItems *self, int i, PyObject *v) { PyErr_SetString(PyExc_TypeError, "BTreeItems objects do not support item assignment"); return -1; } static int BTreeItems_ass_slice(PyListObject *self, int ilow, int ihigh, PyObject *v) { PyErr_SetString(PyExc_TypeError, "BTreeItems objects do not support slice assignment"); return -1; } static PySequenceMethods BTreeItems_as_sequence = { (inquiry)BTreeItems_length, /*sq_length*/ (binaryfunc)BTreeItems_concat, /*sq_concat*/ (intargfunc)BTreeItems_repeat, /*sq_repeat*/ (intargfunc)BTreeItems_item, /*sq_item*/ (intintargfunc)BTreeItems_slice, /*sq_slice*/ (intobjargproc)BTreeItems_ass_item, /*sq_ass_item*/ (intintobjargproc)BTreeItems_ass_slice, /*sq_ass_slice*/ }; /* -------------------------------------------------------------- */ static PyTypeObject BTreeItemsType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "BTreeItems", /*tp_name*/ sizeof(BTreeItems), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)BTreeItems_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*obsolete tp_getattr*/ (setattrfunc)0, /*obsolete tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ &BTreeItems_as_sequence, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ 0, /*tp_getattro*/ 0, /*tp_setattro*/ /* Space for future expansion */ 0L,0L, "Sequence type used to iterate over BTree items." /* Documentation string */ }; /************************************************************************/ static void * PyMalloc(size_t sz) { void *r; if(r=malloc(sz)) return r; PyErr_NoMemory(); return NULL; } static void * PyRealloc(void *p, size_t sz) { void *r; if(r=realloc(p,sz)) return r; PyErr_NoMemory(); return NULL; } static PyObject * Twople(PyObject *i1, PyObject *i2) { PyObject *t; if(t=PyTuple_New(2)) { Py_INCREF(i1); PyTuple_SET_ITEM(t,0,i1); Py_INCREF(i2); PyTuple_SET_ITEM(t,1,i2); } return t; } static int BTree_ini(BTree *self) { PyObject *b; UNLESS(b=PyObject_CallObject(OBJECT(&BucketType), NULL)) return -1; #ifndef INTKEY Py_INCREF(Py_None); self->data->key=Py_None; #endif self->data->value=b; self->data->count=0; self->len=1; self->count=0; return 0; } static int BTree_init(BTree *self) { UNLESS(self->data=PyMalloc(sizeof(BTreeItem)*2)) return -1; self->size=2; return BTree_ini(self); } static int bucket_index(Bucket *self, PyObject *key, int less) { /* If less, return the index of the largest key that is less than or equall to key. Otherwise return the index of the smallest key that is greater than or equal to key. */ int min, max, i, l, cmp; #ifdef INTKEY int ikey; UNLESS(PyInt_Check(key)) { PyErr_SetString(PyExc_TypeError, "Bucket __getitem__ expected integer key"); return -9; } ikey=PyInt_AsLong(key); #endif PER_USE_OR_RETURN(self, -1); for(min=0, max=self->len, i=max/2, l=max; i != l; l=i, i=(min+max)/2) { cmp=TEST_KEY(self->data[i].key); if(cmp < 0) min=i; else if(cmp == 0) { PER_ALLOW_DEACTIVATION(self); return i; } else max=i; } PER_ALLOW_DEACTIVATION(self); if(less) return max-1; if(max==min) return min; return min+1; } static PyObject * _bucket_get(Bucket *self, PyObject *key, int has_key) { int min, max, i, l, cmp; PyObject *r; #ifdef INTKEY int ikey; UNLESS(PyInt_Check(key)) { PyErr_SetString(PyExc_TypeError, "Bucket __getitem__ expected integer key"); return NULL; } ikey=PyInt_AsLong(key); #endif PER_USE_OR_RETURN(self, NULL); for(min=0, max=self->len, i=max/2, l=max; i != l; l=i, i=(min+max)/2) { cmp=TEST_KEY(self->data[i].key); if(cmp < 0) min=i; else if(cmp == 0) { if(has_key) r=PyInt_FromLong(1); else { #ifdef INTVAL r=PyInt_FromLong(self->data[i].value); #else r=self->data[i].value; Py_INCREF(r); #endif } PER_ALLOW_DEACTIVATION(self); return r; } else max=i; } PER_ALLOW_DEACTIVATION(self); if(has_key) return PyInt_FromLong(0); PyErr_SetObject(PyExc_KeyError, key); return NULL; } static PyObject * bucket_get(Bucket *self, PyObject *key) { return _bucket_get(self, key, 0); } static PyObject * bucket_map(Bucket *self, PyObject *args) { PyObject *keys, *key, *r; int l, i, a; UNLESS(PyArg_ParseTuple(args,"O", &keys)) return NULL; if((l=PyObject_Length(keys)) < 0) return NULL; UNLESS(r=PyList_New(0)) return NULL; for(i=0; i < l; i++) { UNLESS(key=PySequence_GetItem(keys,i)) goto err; ASSIGN(key, _bucket_get(self, key, 0)); if(key) { a=PyList_Append(r,key); Py_DECREF(key); if(a<0) goto err; } else PyErr_Clear(); } return r; err: Py_DECREF(r); return NULL; } static int BTree_index(BTree *self, PyObject *key, int less) { /* If less, return the index of the largest key that is less than or equall to key. Otherwise return the index of the smallest key that is greater than or equal to key. */ int min, max, i, cmp; #ifdef INTKEY int ikey; UNLESS(PyInt_Check(key)) { PyErr_SetString(PyExc_TypeError, "Bucket __getitem__ expected integer key"); return -9; } ikey=PyInt_AsLong(key); #endif PER_USE_OR_RETURN(self, -1); UNLESS(self->data) if(BTree_init(self) < 0) goto err; for(min=0, max=self->len, i=max/2; max-min > 1; i=(min+max)/2) { cmp=TEST_KEY(self->data[i].key); if(cmp < 0) min=i; else if(cmp == 0) { min=i; break; } else max=i; } if(Bucket_Check(self->data[min].value)) i=bucket_index(BUCKET(self->data[min].value), key, less); else i= BTree_index( BTREE(self->data[min].value), key, less); if(i==-9) goto err; while(--min >= 0) i+=self->data[min].count; PER_ALLOW_DEACTIVATION(self); return i; err: PER_ALLOW_DEACTIVATION(self); return -9; } static PyObject * _BTree_get(BTree *self, PyObject *key, int has_key) { int min, max, i, cmp; PyObject *r; #ifdef INTKEY int ikey; UNLESS(PyInt_Check(key)) { PyErr_SetString(PyExc_TypeError, "Bucket __getitem__ expected integer key"); return NULL; } ikey=PyInt_AsLong(key); #endif PER_USE_OR_RETURN(self, NULL); UNLESS(self->data) if(BTree_init(self) < 0) goto err; for(min=0, max=self->len, i=max/2; max-min > 1; i=(min+max)/2) { cmp=TEST_KEY(self->data[i].key); if(cmp < 0) min=i; else if(cmp == 0) { min=i; break; } else max=i; } if(Bucket_Check(self->data[min].value)) r=_bucket_get(BUCKET(self->data[min].value), key, has_key); else r=_BTree_get( BTREE(self->data[min].value), key, has_key); PER_ALLOW_DEACTIVATION(self); return r; err: PER_ALLOW_DEACTIVATION(self); return NULL; } static PyObject * BTree_get(BTree *self, PyObject *key) { return _BTree_get(self, key, 0); } static PyObject * BTree_map(BTree *self, PyObject *args) { PyObject *keys, *key, *r; int l, i, a; UNLESS(PyArg_ParseTuple(args,"O", &keys)) return NULL; if((l=PyObject_Length(keys)) < 0) return NULL; UNLESS(r=PyList_New(0)) return NULL; for(i=0; i < l; i++) { UNLESS(key=PySequence_GetItem(keys,i)) goto err; ASSIGN(key, _BTree_get(self, key, 0)); if(key) { a=PyList_Append(r,key); Py_DECREF(key); if(a<0) goto err; } else PyErr_Clear(); } return r; err: Py_DECREF(r); return NULL; } static int _bucket_set(Bucket *self, PyObject *key, PyObject *v) { int min, max, i, l, cmp; Item *d; #ifdef INTKEY int ikey; #endif #ifdef INTVAL int iv; #endif #ifdef INTKEY UNLESS(PyInt_Check(key)) { PyErr_SetString(PyExc_TypeError, "Bucket __setitem__ expected integer value"); return -1; } ikey=PyInt_AsLong(key); #endif #ifdef INTVAL if(v) { UNLESS(PyInt_Check(v)) { PyErr_SetString(PyExc_TypeError, "Bucket __getitem__ expected integer key"); return -1; } iv=PyInt_AsLong(v); } #endif PER_USE_OR_RETURN(self, -1); for(min=0, max=l=self->len, i=max/2; i != l; l=i, i=(min+max)/2) { if((cmp=TEST_KEY(self->data[i].key)) < 0) min=i; else if(cmp==0) { if(v) /* Assign value to key */ { #ifdef INTVAL self->data[i].value=iv; #else Py_INCREF(v); ASSIGN(self->data[i].value, v); #endif if(PER_CHANGED(self) < 0) goto err; PER_ALLOW_DEACTIVATION(self); return 0; } else /* There's no value so remove the item */ { self->len--; d=self->data+i; DECREF_KEY(d->key); DECREF_VALUE(d->value); if(i < self->len) memmove(d,d+1,sizeof(Item)*(self->len-i)); else if(! self->len) { self->size=0; free(self->data); self->data=NULL; } if(PER_CHANGED(self) < 0) goto err; PER_ALLOW_DEACTIVATION(self); return 1; } } else max=i; } if(!v) { PyErr_SetObject(PyExc_KeyError, key); goto err; } if(self->len==self->size) { if(self->data) { UNLESS(d=PyRealloc(self->data, sizeof(Item)*self->size*2)) goto err; self->data=d; self->size*=2; } else { UNLESS(self->data=PyMalloc(sizeof(Item)*MIN_BUCKET_ALLOC)) goto err; self->size=MIN_BUCKET_ALLOC; } } if(max != i) i++; d=self->data+i; if(self->len > i) memmove(d+1,d,sizeof(Item)*(self->len-i)); #ifdef INTKEY d->key=ikey; #else d->key=key; Py_INCREF(key); #endif #ifdef INTVAL d->value=iv; #else d->value=v; Py_INCREF(v); #endif self->len++; if(PER_CHANGED(self) < 0) goto err; PER_ALLOW_DEACTIVATION(self); return 1; err: PER_ALLOW_DEACTIVATION(self); return -1; } static int bucket_setitem(Bucket *self, PyObject *key, PyObject *v) { if(_bucket_set(self,key,v) < 0) return -1; return 0; } static int bucket_split(Bucket *self, int index, Bucket *next) { if(index < 0 || index >= self->len) index=self->len/2; UNLESS(next->data=PyMalloc(sizeof(Item)*(self->len-index))) return -1; next->len=self->len-index; next->size=next->len; memcpy(next->data, self->data+index, sizeof(Item)*next->size); self->len=index; return 0; } static int BTree_count(BTree *self) { int i, c=0; BTreeItem *d; for(i=self->len, d=self->data; --i >= 0; d++) c += d->count; return c; } static int BTree_split(BTree *self, int index, BTree *next) { if(index < 0 || index >= self->len) index=self->len/2; UNLESS(next->data=PyMalloc(sizeof(BTreeItem)*(self->len-index))) return -1; next->len=self->len-index; next->size=next->len; memcpy(next->data, self->data+index, sizeof(BTreeItem)*next->size); if((next->count=BTree_count(next)) < 0) return -1; self->len = index; self->count -= next->count; return 0; } static int BTree_clone(BTree *self) { /* We've grown really big without anybody splitting us. We should split ourselves. */ BTree *n1=0, *n2=0; BTreeItem *d=0; int count; /* Create two BTrees to hold ourselves after split */ UNLESS(n1=BTREE(PyObject_CallObject(OBJECT(self->ob_type), NULL))) return -1; UNLESS(n2=BTREE(PyObject_CallObject(OBJECT(self->ob_type), NULL))) goto err; /* Create a new data buffer to hold two BTrees */ UNLESS(d=PyMalloc(sizeof(BTreeItem)*2)) goto err; count=self->count; /* Split ourself */ if(BTree_split(self,-1,n2) < 0) goto err; /* Move our data to new BTree */ n1->size=self->size; n1->len=self->len; n1->count=self->count; n1->data=self->data; /* Initialize our data to hold split data */ self->data=d; Py_INCREF(Py_None); #ifndef INTKEY self->data->key=Py_None; #endif self->len=2; self->size=2; self->data->value=OBJECT(n1); self->data->count=n1->count; #ifndef INTKEY Py_INCREF(n2->data->key); #endif self->data[1].key=n2->data->key; self->data[1].value=OBJECT(n2); self->data[1].count=n2->count; self->count=count; return 0; err: Py_XDECREF(n1); Py_XDECREF(n2); free(d); return -1; } static int BTree_grow(BTree *self, int index) { int i; PyObject *v, *e=0; BTreeItem *d; if(self->len == self->size) { UNLESS(d=PyRealloc(self->data, sizeof(BTreeItem)*self->size*2)) return -1; self->data=d; self->size *= 2; } d=self->data+index; v=d->value; UNLESS(e=PyObject_CallObject(OBJECT(v->ob_type), NULL)) return -1; PER_USE_OR_RETURN((Bucket*)v, -1); if(Bucket_Check(v)) { i=bucket_split(BUCKET(v), -1, BUCKET(e)); d->count=BUCKET(v)->len; } else { i=BTree_split( BTREE(v), -1, BTREE(e)); d->count=BTREE(v)->count; } PER_ALLOW_DEACTIVATION(BUCKET(v)); if(i < 0) { Py_DECREF(e); return -1; } index++; d++; if(self->len > index) memmove(d+1, d, sizeof(BTreeItem)*(self->len-index)); if(Bucket_Check(v)) { d->key=BUCKET(e)->data->key; d->count=BUCKET(e)->len; } else { d->key=BTREE(e)->data->key; d->count=BTREE(e)->count; } #ifndef INTKEY Py_INCREF(d->key); #endif d->value=e; self->len++; if(self->len >= MAX_SIZE(self) * 2) return BTree_clone(self); return 0; } static int _BTree_set(BTree *self, PyObject *key, PyObject *value) { int i, min, max, cmp, grew; BTreeItem *d; #ifdef INTKEY int ikey; #endif #ifdef INTKEY UNLESS(PyInt_Check(key)) { PyErr_SetString(PyExc_TypeError, "Bucket __setitem__ expected integer value"); return -1; } ikey=PyInt_AsLong(key); #endif PER_USE_OR_RETURN(self, -1); UNLESS(self->data) if(BTree_init(self) < 0) goto err; for(min=0, max=self->len, i=max/2; max-min > 1; i=(max+min)/2) { d=self->data+i; cmp=TEST_KEY(d->key); if(cmp < 0) min=i; else if(cmp==0) { min=i; break; } else max=i; } d=self->data+min; if(Bucket_Check(d->value)) grew=_bucket_set(BUCKET(d->value), key, value); else grew= _BTree_set( BTREE(d->value), key, value); if(grew < 0) goto err; if(grew) { if(value) /* got bigger */ { d->count++; self->count++; if(BUCKET(d->value)->len > MAX_SIZE(self) && BTree_grow(self,min) < 0) goto err; } else /* got smaller */ { d->count--; self->count--; if(! d->count && self->len > 1) { self->len--; Py_DECREF(d->value); DECREF_KEY(d->key); if(min < self->len) memmove(d, d+1, (self->len-min)*sizeof(BTreeItem)); } } if(PER_CHANGED(self) < 0) goto err; } PER_ALLOW_DEACTIVATION(self); return grew; err: PER_ALLOW_DEACTIVATION(self); return -1; } static int BTree_setitem(BTree *self, PyObject *key, PyObject *v) { if(_BTree_set(self,key,v) < 0) return -1; return 0; } static PyObject * bucket_keys(Bucket *self, PyObject *args) { PyObject *r=0, *key; int i; PER_USE_OR_RETURN(self, NULL); UNLESS(r=PyList_New(self->len)) goto err; for(i=self->len; --i >= 0; ) { #ifdef INTKEY UNLESS(key=PyInt_FromLong(self->data[i].key)) goto err; #else key=self->data[i].key; Py_INCREF(key); #endif if(PyList_SetItem(r, i, key) < 0) goto err; } PER_ALLOW_DEACTIVATION(self); return r; err: PER_ALLOW_DEACTIVATION(self); Py_DECREF(r); return NULL; } static PyObject * bucket_values(Bucket *self, PyObject *args) { PyObject *r=0, *v; int i; PER_USE_OR_RETURN(self, NULL); UNLESS(r=PyList_New(self->len)) goto err; for(i=self->len; --i >= 0; ) { #ifdef INTVAL UNLESS(v=PyInt_FromLong(self->data[i].value)) goto err; #else v=self->data[i].value; Py_INCREF(v); #endif if(PyList_SetItem(r, i, v) < 0) goto err; } PER_ALLOW_DEACTIVATION(self); return r; err: PER_ALLOW_DEACTIVATION(self); Py_DECREF(r); return NULL; } static PyObject * bucket_items(Bucket *self, PyObject *args) { PyObject *r, *item; int i; PER_USE_OR_RETURN(self, NULL); UNLESS(r=PyList_New(self->len)) goto err; for(i=self->len; --i >= 0; ) { UNLESS(item=Py_BuildValue(KEY_PARSE VALUE_PARSE, self->data[i].key,self->data[i].value)) goto err; if(PyList_SetItem(r, i, item) < 0) goto err; } PER_ALLOW_DEACTIVATION(self); return r; err: PER_ALLOW_DEACTIVATION(self); Py_DECREF(r); return NULL; } #ifdef PERSISTENT static PyObject * bucket__p___reinit__(Bucket *self, PyObject *args) { if(self->state==cPersistent_UPTODATE_STATE) { int i; PyObject *dict; for(i=self->len; --i >= 0; ) { DECREF_KEY(self->data[i].key); DECREF_VALUE(self->data[i].value); } if(HasInstDict(self) && (dict=INSTANCE_DICT(self))) PyDict_Clear(dict); self->len=0; self->state=cPersistent_GHOST_STATE; } Py_INCREF(Py_None); return Py_None; } #endif static PyObject * bucket_clear(Bucket *self, PyObject *args) { int i; PER_USE_OR_RETURN(self, NULL); for(i=self->len; --i >= 0; ) { DECREF_KEY(self->data[i].key); DECREF_VALUE(self->data[i].value); } self->len=0; if(PER_CHANGED(self) < 0) goto err; PER_ALLOW_DEACTIVATION(self); RETURN_NONE; err: PER_ALLOW_DEACTIVATION(self); return NULL; } static int _BTree_clear(BTree *self) { int i; UNLESS(self->data) return 0; for(i=self->len; --i >= 0; ) { DECREF_KEY(self->data[i].key); Py_DECREF(self->data[i].value); } i=BTree_ini(self); return i; } #ifdef PERSISTENT static PyObject * BTree__p___reinit__(BTree *self, PyObject *args) { if(self->state==cPersistent_UPTODATE_STATE) { PyObject *dict; if(_BTree_clear(self) < 0) return NULL; if(HasInstDict(self) && (dict=INSTANCE_DICT(self))) PyDict_Clear(dict); self->state=cPersistent_GHOST_STATE; } Py_INCREF(Py_None); return Py_None; } #endif static PyObject * BTree_clear(BTree *self, PyObject *args) { PER_USE_OR_RETURN(self, NULL); if(_BTree_clear(self) < 0) goto err; if(PER_CHANGED(self) < 0) goto err; PER_ALLOW_DEACTIVATION(self); RETURN_NONE; err: PER_ALLOW_DEACTIVATION(self); return NULL; } static PyObject * bucket_getstate(Bucket *self, PyObject *args) { PyObject *r, *keys=0, *values=0; int i, l; #ifdef INTKEY int v; char *c; #else #ifdef INTVAL int v; char *c; #endif #endif PER_USE_OR_RETURN(self, NULL); l=self->len; #ifdef INTKEY UNLESS(keys=PyString_FromStringAndSize(NULL,l*sizeof(int))) goto err; UNLESS(c=PyString_AsString(keys)) goto err; for(i=0; i < l; i++) { v=self->data[i].key; *c++ = (int)( v & 0xff); *c++ = (int)((v >> 8) & 0xff); *c++ = (int)((v >> 16) & 0xff); *c++ = (int)((v >> 24) & 0xff); } #else UNLESS(keys=PyTuple_New(self->len)) goto err; for(i=0; idata[i].key; Py_INCREF(r); PyTuple_SET_ITEM(keys,i,r); } #endif #ifdef INTVAL UNLESS(values=PyString_FromStringAndSize(NULL,l*sizeof(int))) goto err; UNLESS(c=PyString_AsString(values)) goto err; for(i=0; i < l; i++) { v=self->data[i].value; *c++ = (int)( v & 0xff); *c++ = (int)((v >> 8) & 0xff); *c++ = (int)((v >> 16) & 0xff); *c++ = (int)((v >> 24) & 0xff); } #else UNLESS(values=PyTuple_New(self->len)) goto err; for(i=0; idata[i].value; Py_INCREF(r); PyTuple_SET_ITEM(values,i,r); } #endif PER_ALLOW_DEACTIVATION(self); r=Py_BuildValue("OO",keys,values); Py_DECREF(keys); Py_DECREF(values); return r; err: PER_ALLOW_DEACTIVATION(self); Py_XDECREF(keys); Py_XDECREF(values); return NULL; } static PyObject * bucket_setstate(Bucket *self, PyObject *args) { PyObject *r, *keys=0, *values=0; int i, l, v; Item *d; #ifdef INTKEY char *ck; #endif #ifdef INTVAL char *cv; #endif PER_PREVENT_DEACTIVATION(self); UNLESS(PyArg_ParseTuple(args,"O",&r)) goto err; UNLESS(PyArg_ParseTuple(r,"OO",&keys,&values)) goto err; if((l=PyObject_Length(keys)) < 0) goto err; #ifdef INTKEY l/=4; UNLESS(ck=PyString_AsString(keys)) goto err; #endif if((v=PyObject_Length(values)) < 0) goto err; #ifdef INTVAL v/=4; UNLESS(cv=PyString_AsString(values)) goto err; #endif if(l!=v) { PyErr_SetString(PyExc_ValueError, "number of keys differs from number of values"); goto err; } if(l > self->size) if(self->data) { UNLESS(d=PyRealloc(self->data, sizeof(Item)*l)) goto err; self->data=d; self->size=l; } else { UNLESS(d=PyMalloc(sizeof(Item)*l)) goto err; self->data=d; self->size=l; } else d=self->data; #ifdef INTKEY for(i=l; --i >= 0; d++) { v = ((int)(unsigned char)*ck++) ; v |= ((int)(unsigned char)*ck++) << 8; v |= ((int)(unsigned char)*ck++) << 16; v |= ((int)(unsigned char)*ck++) << 24; d->key=v; } #else for(i=0; ilen) Py_DECREF(d->key); d->key=r; } #endif d=self->data; #ifdef INTVAL for(i=l; --i >= 0; d++) { v = ((int)(unsigned char)*cv++) ; v |= ((int)(unsigned char)*cv++) << 8; v |= ((int)(unsigned char)*cv++) << 16; v |= ((int)(unsigned char)*cv++) << 24; d->value=v; } #else for(i=0; ilen) Py_DECREF(d->value); d->value=r; } #endif self->len=l; PER_ALLOW_DEACTIVATION(self); Py_INCREF(Py_None); return Py_None; err: PER_ALLOW_DEACTIVATION(self); return NULL; } static PyObject * bucket_has_key(Bucket *self, PyObject *args) { PyObject *key; UNLESS(PyArg_ParseTuple(args,"O",&key)) return NULL; return _bucket_get(self, key, 1); } static PyObject * bucket_getm(Bucket *self, PyObject *args) { PyObject *key, *d=Py_None, *r; UNLESS(PyArg_ParseTuple(args, "O|O", &key, &d)) return NULL; if((r=_bucket_get(self, key, 0))) return r; PyErr_Clear(); Py_INCREF(d); return d; } #ifdef INTKEY #ifdef INTVAL static PyObject * _bucket_intset_operation(Bucket *self, intSet *other, int cpysrc, int cpyboth, int cpyoth) { Bucket *r=0; int i, l, io, lo; Item *d; INTSET_DATA_TYPE *od; Item v; int vo; PER_USE_OR_RETURN(self, NULL); PER_USE_OR_RETURN(other, NULL); od=other->data; d=self->data; UNLESS(r=BUCKET(PyObject_CallObject(OBJECT(self->ob_type), NULL))) goto err; for(i=0, l=self->len, io=0, lo=other->len; i < l && io < lo; ) { v=d[i]; vo=od[io]; if(v.key < vo) { if(cpysrc) { if(bucket_setitem(r, PyInt_FromLong(v.key), PyInt_FromLong(v.value)) ) goto err; } i++; } else if(v.key==vo) { if(cpyboth) { if(bucket_setitem(r, PyInt_FromLong(v.key), PyInt_FromLong(v.value+1)) ) goto err; } i++; io++; } else { if(cpyoth) { if(bucket_setitem(r, PyInt_FromLong(vo), PyInt_FromLong(1)) ) goto err; } io++; } } if(cpysrc && i < l) { for(;iob_type)) return _bucket_intset_operation(self, INTSET(other), cpysrc, cpyboth, cpyoth); else if(other->ob_type != self->ob_type) { PyErr_SetString(PyExc_TypeError, "IIBTree set operations requires an object of type " "IIBTree or intSet"); return NULL; } else o=BUCKET(other); PER_USE_OR_RETURN(self, NULL); PER_USE_OR_RETURN(BUCKET(other), NULL); od=o->data; d=self->data; UNLESS(r=BUCKET(PyObject_CallObject(OBJECT(self->ob_type), NULL))) goto err; for(i=0, l=self->len, io=0, lo=o->len; i < l && io < lo; ) { v=d[i]; vo=od[io]; if(v.key < vo.key) { if(cpysrc) { if(bucket_setitem(r, PyInt_FromLong(v.key), PyInt_FromLong(v.value)) ) goto err; } i++; } else if(v.key==vo.key) { if(cpyboth) { if(bucket_setitem(r, PyInt_FromLong(v.key), PyInt_FromLong(v.value+vo.value)) ) goto err; } i++; io++; } else { if(cpyoth) { if(bucket_setitem(r, PyInt_FromLong(vo.key), PyInt_FromLong(vo.value)) ) goto err; } io++; } } if(cpysrc && i < l) { for(;ilen)) goto err; for(i=self->len; --i >= 0; ) { UNLESS(item=Py_BuildValue(KEY_PARSE "Oi", self->data[i].key, self->data[i].value, self->data[i].count)) goto err; PyTuple_SET_ITEM(r,i,item); } PER_ALLOW_DEACTIVATION(self); return r; err: PER_ALLOW_DEACTIVATION(self); Py_DECREF(r); return NULL; } static PyObject * BTree_setstate(BTree *self, PyObject *args) { PyObject *state, *v=0; BTreeItem *d; int l, i; UNLESS(PyArg_ParseTuple(args,"O",&state)) return NULL; if((l=PyTuple_Size(state))<0) return NULL; PER_PREVENT_DEACTIVATION(self); if (l==0) { if (_BTree_clear(self) < 0) return NULL; PER_ALLOW_DEACTIVATION(self); Py_INCREF(Py_None); return Py_None; } if(l>self->size) { if(self->data) { UNLESS(d=PyRealloc(self->data, sizeof(BTreeItem)*l)) goto err; self->data=d; self->size=l; } else { UNLESS(self->data=PyMalloc(sizeof(BTreeItem)*l)) goto err; self->size=l; } } for(i=self->len, d=self->data; --i >= 0; d++) { DECREF_KEY(d->key); Py_DECREF(d->value); } for(self->len=0, self->count=0, i=0, d=self->data; i < l; i++, d++, self->len++) { UNLESS(PyArg_ParseTuple(PyTuple_GET_ITEM(state,i), KEY_PARSE "Oi", &(d->key), &(d->value), &(d->count))) goto err; #ifndef INTKEY Py_INCREF(d->key); #endif Py_INCREF(d->value); self->count+=d->count; } PER_ALLOW_DEACTIVATION(self); Py_INCREF(Py_None); return Py_None; err: PER_ALLOW_DEACTIVATION(self); return NULL; } static PyObject * BTree_elements(BTree *self, PyObject *args, char type) { PyObject *f=0, *l=0; int fi, li; UNLESS(PyArg_ParseTuple(args,"|OO",&f, &l)) return NULL; PER_USE_OR_RETURN(self, NULL); if(f && f != Py_None) { fi=BTree_index(self, f, 0); if(fi==-9) goto err; } else fi=0; if(l) { li=BTree_index(self, l, 1); if(li==-9) goto err; li++; } else li=self->count; PER_ALLOW_DEACTIVATION(self); return newBTreeItems(self,type,fi,li); err: PER_ALLOW_DEACTIVATION(self); return NULL; } static PyObject * BTree_keys(BTree *self, PyObject *args) { return BTree_elements(self,args,'k'); } static PyObject * BTree_values(BTree *self, PyObject *args) { return BTree_elements(self,args,'v'); } static PyObject * BTree_items(BTree *self, PyObject *args) { return BTree_elements(self,args,'i'); } static PyObject * BTree_has_key(BTree *self, PyObject *args) { PyObject *key; UNLESS(PyArg_ParseTuple(args,"O",&key)) return NULL; return _BTree_get(self, key, 1); } static PyObject * BTree_getm(BTree *self, PyObject *args) { PyObject *key, *d=Py_None, *r; UNLESS(PyArg_ParseTuple(args, "O|O", &key, &d)) return NULL; if((r=_BTree_get(self, key, 0))) return r; PyErr_Clear(); Py_INCREF(d); return d; } static struct PyMethodDef BTree_methods[] = { {"__getstate__", (PyCFunction)BTree_getstate, METH_VARARGS, "__getstate__() -- Return the picklable state of the object"}, {"__setstate__", (PyCFunction)BTree_setstate, METH_VARARGS, "__setstate__() -- Set the state of the object"}, {"has_key", (PyCFunction)BTree_has_key, METH_VARARGS, "has_key(key) -- Test whether the bucket contains the given key"}, {"keys", (PyCFunction)BTree_keys, METH_VARARGS, "keys() -- Return the keys"}, {"values", (PyCFunction)BTree_values, METH_VARARGS, "values() -- Return the values"}, {"items", (PyCFunction)BTree_items, METH_VARARGS, "items() -- Return the items"}, {"clear", (PyCFunction)BTree_clear, METH_VARARGS, "clear() -- Remove all of the items from the BTree"}, {"map", (PyCFunction)BTree_map, METH_VARARGS, "map(keys) -- map a sorted sequence of keys into values\n\n" "Invalid keys are skipped"}, {"get", (PyCFunction)BTree_getm, METH_VARARGS, "get(key[,default]) -- Look up a value\n\n" "Return the default (or None) if the key is not found." }, #ifdef PERSISTENT {"_p___reinit__", (PyCFunction)BTree__p___reinit__, METH_VARARGS, "_p___reinit__() -- Reinitialize from a newly created copy"}, {"_p_deactivate", (PyCFunction)BTree__p___reinit__, METH_VARARGS, "_p_deactivate() -- Reinitialize from a newly created copy"}, #endif {NULL, NULL} /* sentinel */ }; static void Bucket_dealloc(Bucket *self) { int i; for(i=self->len; --i >= 0; ) { DECREF_KEY(self->data[i].key); DECREF_VALUE(self->data[i].value); } free(self->data); PER_DEL(self); Py_DECREF(self->ob_type); PyMem_DEL(self); } static void BTree_dealloc(BTree *self) { int i; for(i=self->len; --i >= 0; ) { DECREF_KEY(self->data[i].key); Py_DECREF(self->data[i].value); } free(self->data); PER_DEL(self); Py_DECREF(self->ob_type); PyMem_DEL(self); } /* Code to access Bucket objects as mappings */ static int Bucket_length( Bucket *self) { int r; PER_USE_OR_RETURN(self, -1); r=self->len; PER_ALLOW_DEACTIVATION(self); return r; } static PyMappingMethods Bucket_as_mapping = { (inquiry)Bucket_length, /*mp_length*/ (binaryfunc)bucket_get, /*mp_subscript*/ (objobjargproc)bucket_setitem, /*mp_ass_subscript*/ }; static int BTree_length( BTree *self) { int r; PER_USE_OR_RETURN(self, -1); r=self->count; PER_ALLOW_DEACTIVATION(self); return r; } static PyMappingMethods BTree_as_mapping = { (inquiry)BTree_length, /*mp_length*/ (binaryfunc)BTree_get, /*mp_subscript*/ (objobjargproc)BTree_setitem, /*mp_ass_subscript*/ }; static PyObject * bucket_repr(Bucket *self) { static PyObject *format; PyObject *r, *t; UNLESS(format) UNLESS(format=PyString_FromString("Bucket(%s)")) return NULL; UNLESS(t=PyTuple_New(1)) return NULL; UNLESS(r=bucket_items(self,NULL)) goto err; PyTuple_SET_ITEM(t,0,r); r=t; ASSIGN(r,PyString_Format(format,r)); return r; err: Py_DECREF(t); return NULL; } static PyExtensionClass BucketType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Bucket", /*tp_name*/ sizeof(Bucket), /*tp_basicsize*/ 0, /*tp_itemsize*/ /*********** methods ***********************/ (destructor)Bucket_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*obsolete tp_getattr*/ (setattrfunc)0, /*obsolete tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)bucket_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &Bucket_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)0, /*tp_getattro*/ 0, /*tp_setattro*/ /* Space for future expansion */ 0L,0L, "Mapping type implemented as sorted list of items", METHOD_CHAIN(Bucket_methods), EXTENSIONCLASS_BASICNEW_FLAG | PERSISTENT_TYPE_FLAG, }; static PyExtensionClass BTreeType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "BTree", /*tp_name*/ sizeof(BTree), /*tp_basicsize*/ 0, /*tp_itemsize*/ /************* methods ********************/ (destructor)BTree_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*obsolete tp_getattr*/ (setattrfunc)0, /*obsolete tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &BTree_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)0, 0, /*tp_setattro*/ /* Space for future expansion */ 0L,0L, "Mapping type implemented as sorted list of items", METHOD_CHAIN(BTree_methods), EXTENSIONCLASS_BASICNEW_FLAG | PERSISTENT_TYPE_FLAG, }; static struct PyMethodDef module_methods[] = { {NULL, NULL} /* sentinel */ }; void #ifdef INTKEY #ifdef INTVAL initIIBTree() #define MODNAME "IIBTree" #else initIOBTree() #define MODNAME "IOBTree" #endif #else #ifdef INTVAL initOIBTree() #define MODNAME "OIBTree" #else initBTree() #define MODNAME "BTree" #endif #endif { PyObject *m, *d; char *rev="$Revision: 1.27 $"; UNLESS(PyExtensionClassCAPI=PyCObject_Import("ExtensionClass","CAPI")) return; #ifdef PERSISTENT if(cPersistenceCAPI=PyCObject_Import("cPersistence","CAPI")) { BucketType.methods.link=cPersistenceCAPI->methods; BucketType.tp_getattro=cPersistenceCAPI->getattro; BucketType.tp_setattro=cPersistenceCAPI->setattro; BTreeType.methods.link=cPersistenceCAPI->methods; BTreeType.tp_getattro=cPersistenceCAPI->getattro; BTreeType.tp_setattro=cPersistenceCAPI->setattro; } else return; #else BucketType.tp_getattro=PyExtensionClassCAPI->getattro; BTreeType.tp_getattro=PyExtensionClassCAPI->getattro; #endif BTreeItemsType.ob_type=&PyType_Type; #ifdef INTKEY #ifdef INTVAL UNLESS(d = PyImport_ImportModule("intSet")) return; UNLESS(intSetType = PyObject_GetAttrString (d, "intSet")) return; Py_DECREF (d); #endif #endif /* Create the module and add the functions */ m = Py_InitModule4(MODNAME, module_methods, BTree_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); /* Add some symbolic constants to the module */ d = PyModule_GetDict(m); PyExtensionClass_Export(d,"Bucket",BucketType); PyExtensionClass_Export(d,"BTree",BTreeType); PyDict_SetItemString(d, "__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); /* Check for errors */ if (PyErr_Occurred()) Py_FatalError("can't initialize module BTree"); } Zope-2.0.1-ZEO-nonbin/lib/Components/BTree/IIBTree.c100755 1007 1403 7657 6671334553 21625 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ /* $Id: IIBTree.c,v 1.6 1999/03/10 00:14:35 klm Exp $ */ #define INTKEY int #define INTVAL int static char *needed_to_make_release_happy="$Id: IIBTree.c,v 1.6 1999/03/10 00:14:35 klm Exp $"; #include "BTree.c" Zope-2.0.1-ZEO-nonbin/lib/Components/BTree/IOBTree.c100755 1007 1403 7634 6671334553 21626 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ /* $Id: IOBTree.c,v 1.6 1999/03/10 00:14:35 klm Exp $ */ static char *needed_to_make_release_happy= "$Id: IOBTree.c,v 1.6 1999/03/10 00:14:35 klm Exp $"; #define INTKEY int #include "BTree.c" Zope-2.0.1-ZEO-nonbin/lib/Components/BTree/OIBTree.c100755 1007 1403 7634 6671334553 21626 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ /* $Id: OIBTree.c,v 1.6 1999/03/10 00:14:35 klm Exp $ */ static char *needed_to_make_release_happy= "$Id: OIBTree.c,v 1.6 1999/03/10 00:14:35 klm Exp $"; #define INTVAL int #include "BTree.c" Zope-2.0.1-ZEO-nonbin/lib/Components/BTree/Setup100644 1007 1403 505 6662424564 21221 0ustar petrillipetrilli*shared* BTree BTree.c -I../../Packages/BoboPOS -I../ExtensionClass IIBTree IIBTree.c -I../../Packages/BoboPOS -I../ExtensionClass IOBTree IOBTree.c -I../../Packages/BoboPOS -I../ExtensionClass OIBTree OIBTree.c -I../../Packages/BoboPOS -I../ExtensionClass intSet intSet.c -I../../Packages/BoboPOS -I../ExtensionClass Zope-2.0.1-ZEO-nonbin/lib/Components/BTree/intSet.c100755 1007 1403 40716 6752311121 21643 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ static char intSet_module_documentation[] = "" "\n$Id: intSet.c,v 1.18 1999/08/05 13:32:01 jim Exp $" ; #include #include #include #include #include #include "cPersistence.h" static void PyVar_Assign(PyObject **v, PyObject *e) { Py_XDECREF(*v); *v=e;} #define ASSIGN(V,E) PyVar_Assign(&(V),(E)) #define UNLESS(E) if(!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E); UNLESS(V) #define RETURN_NONE Py_INCREF(Py_None); return Py_None #define MIN_INTSET_ALLOC 8 #define INTSET_DATA_TYPE int #define INTSET_DATA_FLAG "l" typedef struct { cPersistent_HEAD int size, len; INTSET_DATA_TYPE *data; } intSet; staticforward PyExtensionClass intSetType; #define OBJECT(O) ((PyObject*)(O)) #define INTSET(O) ((intSet*)(O)) static PyObject * _PER_RETURN(intSet *self, PyObject *r) { PER_ALLOW_DEACTIVATION(self); return r; } static int _PER_INT_RETURN(intSet *self, int r) { PER_ALLOW_DEACTIVATION(self); return r; } /* We want to be sticky most of the time */ #define PER_RETURN(O,R) R #define PER_INT_RETURN(O,R) R #undef PER_ALLOW_DEACTIVATION #define PER_ALLOW_DEACTIVATION(O) static PyObject * intSet_has_key(intSet *self, PyObject *args) { int min, max, i, l; INTSET_DATA_TYPE k, key; UNLESS(PyArg_ParseTuple(args,INTSET_DATA_FLAG,&key)) return NULL; PER_USE_OR_RETURN(self, NULL); for(min=0, max=self->len, i=max/2, l=max; i != l; l=i, i=(min+max)/2) { k=self->data[i]; if(k == key) return PER_RETURN(self, PyInt_FromLong(1)); if(k > key) max=i; else min=i; } return PER_RETURN(self, PyInt_FromLong(0)); } static int intSet_grow(intSet *self, int l) { int g; INTSET_DATA_TYPE *data; if(self->data) { g=self->size*2; if(g < l) g=l; UNLESS(data=realloc(self->data, sizeof(INTSET_DATA_TYPE)*g)) { PyErr_NoMemory(); return -1; } self->data=data; self->size=g; } else { g=l < MIN_INTSET_ALLOC ? MIN_INTSET_ALLOC : l; UNLESS(self->data=malloc(sizeof(INTSET_DATA_TYPE)*g)) { PyErr_NoMemory(); return -1; } self->size=g; } return 0; } static INTSET_DATA_TYPE intSet_modify(intSet *self, INTSET_DATA_TYPE ikey, int add) { int min, max, i, l; INTSET_DATA_TYPE *data, k; PER_USE_OR_RETURN(self, -1); data=self->data; for(min=0, max=self->len, i=max/2, l=max; i != l; l=i, i=(min+max)/2) { k=data[i]; if(k == ikey) { if(! add) { data+=i; self->len--; if(i < (self->len)) memmove(data, data+1, (self->len-i)*sizeof(INTSET_DATA_TYPE)); if(PER_CHANGED(self) < 0) return PER_INT_RETURN(self, -1); } return PER_INT_RETURN(self, 0); } if(k > ikey) max=i; else min=i; } if(!add) return PER_INT_RETURN(self, 0); if(self->len >= self->size && intSet_grow(self,self->len+1) < 0) return PER_INT_RETURN(self, -1); if(max != i) i++; data=self->data+i; if(self->len > i) memmove(data+1,data,(self->len-i)*sizeof(INTSET_DATA_TYPE)); *data=ikey; self->len++; if(PER_CHANGED(self) < 0) return PER_INT_RETURN(self, -1); return PER_INT_RETURN(self, ikey); } static PyObject * intSet_insert(intSet *self, PyObject *args) { INTSET_DATA_TYPE key; UNLESS(PyArg_ParseTuple(args,INTSET_DATA_FLAG,&key)) return NULL; if(intSet_modify(self, key, 1) < 0) return NULL; RETURN_NONE; } static PyObject * intSet_remove(intSet *self, PyObject *args) { INTSET_DATA_TYPE key; UNLESS(PyArg_ParseTuple(args,INTSET_DATA_FLAG,&key)) return NULL; if(intSet_modify(self, key, 0) < 0) return NULL; RETURN_NONE; } static PyObject * intSet_clear(intSet *self, PyObject *args) { self->len=0; if(PER_CHANGED(self) < 0) return PER_RETURN(self, NULL); RETURN_NONE; } static PyObject * intSet___getstate__(intSet *self, PyObject *args) { PyObject *r=0; int i, l; char *c; INTSET_DATA_TYPE *d; PER_USE_OR_RETURN(self, NULL); l=self->len; UNLESS(r=PyString_FromStringAndSize(NULL,l*4)) goto err; UNLESS(c=PyString_AsString(r)) goto err; d=self->data; for(i=0; i < l; i++, *d++) { *c++ = (int)( *d & 0xff); *c++ = (int)((*d >> 8) & 0xff); *c++ = (int)((*d >> 16) & 0xff); *c++ = (int)((*d >> 24) & 0xff); } return PER_RETURN(self, r); err: Py_DECREF(r); return PER_RETURN(self, NULL); } static PyObject * intSet___setstate__(intSet *self, PyObject *args) { PyObject *data; int i, l, v; char *c; PER_PREVENT_DEACTIVATION(self); UNLESS(PyArg_ParseTuple(args,"O",&data)) return PER_RETURN(self, NULL); UNLESS(c=PyString_AsString(data)) return PER_RETURN(self, NULL); if((l=PyString_Size(data)) < 0) return PER_RETURN(self, NULL); l/=4; intSet_clear(self, NULL); if(l > self->size && intSet_grow(self,l) < 0) return PER_RETURN(self, NULL); PyErr_Clear(); for(i=0; i < l; i++) { v = ((int)(unsigned char)*c++) ; v |= ((int)(unsigned char)*c++) << 8; v |= ((int)(unsigned char)*c++) << 16; v |= ((int)(unsigned char)*c++) << 24; self->data[i]=v; } self->len=l; Py_INCREF(Py_None); return PER_RETURN(self, Py_None); } static PyObject * intSet_set_operation(intSet *self, PyObject *other, int cpysrc, int cpyboth, int cpyoth) { intSet *r=0, *o; int i, l, io, lo; INTSET_DATA_TYPE *d, *od, v, vo; if(other->ob_type != self->ob_type) { PyErr_SetString(PyExc_TypeError, "intSet set operations require same-type operands"); return NULL; } o=INTSET(other); PER_USE_OR_RETURN(self, NULL); PER_USE_OR_RETURN((intSet*)other, NULL); od=o->data; d=self->data; UNLESS(r=INTSET(PyObject_CallObject(OBJECT(self->ob_type), NULL))) goto err; for(i=0, l=self->len, io=0, lo=o->len; i < l && io < lo; ) { v=d[i]; vo=od[io]; if(v < vo) { if(cpysrc) { if(r->len >= r->size && intSet_grow(r,0) < 0) goto err; r->data[r->len]=v; r->len++; } i++; } else if(v==vo) { if(cpyboth) { if(r->len >= r->size && intSet_grow(r,0) < 0) goto err; r->data[r->len]=v; r->len++; } i++; io++; } else { if(cpyoth) { if(r->len >= r->size && intSet_grow(r,0) < 0) goto err; r->data[r->len]=vo; r->len++; } io++; } } if(cpysrc && i < l) { l-=i; if(r->len+l > r->size && intSet_grow(r,r->len+l) < 0) goto err; memcpy(r->data+r->len, d+i, l*sizeof(INTSET_DATA_TYPE)); r->len += l; } else if(cpyoth && io < lo) { lo-=io; if(r->len+lo > r->size && intSet_grow(r,r->len+lo) < 0) goto err; memcpy(r->data+r->len, od+io, lo*sizeof(INTSET_DATA_TYPE)); r->len += lo; } PER_ALLOW_DEACTIVATION(self); PER_ALLOW_DEACTIVATION(o); return OBJECT(r); err: PER_ALLOW_DEACTIVATION(self); PER_ALLOW_DEACTIVATION(o); Py_DECREF(r); return NULL; } static PyObject * intSet_add(intSet *self, PyObject *other) { return intSet_set_operation(self,other,1,1,1); } static PyObject * intSet_union(intSet *self, PyObject *args) { PyObject *other; UNLESS(PyArg_ParseTuple(args,"O",&other)) return NULL; return intSet_set_operation(self,other,1,1,1); } static PyObject * intSet_intersection(intSet *self, PyObject *args) { PyObject *other; UNLESS(PyArg_ParseTuple(args,"O",&other)) return NULL; return intSet_set_operation(self,other,0,1,0); } static PyObject * intSet_difference(intSet *self, PyObject *args) { PyObject *other; UNLESS(PyArg_ParseTuple(args,"O",&other)) return NULL; return intSet_set_operation(self,other,1,0,0); } static PyObject * intSet__p___reinit__(intSet *self, PyObject *args) { PyObject *dict; if(self->state==cPersistent_UPTODATE_STATE && HasInstDict(self) && (dict=INSTANCE_DICT(self))) { PyDict_Clear(dict); self->state=cPersistent_GHOST_STATE; } Py_INCREF(Py_None); return Py_None; } static struct PyMethodDef intSet_methods[] = { {"has_key", (PyCFunction)intSet_has_key, METH_VARARGS, "has_key(id) -- Test whether the set has the given id"}, {"insert", (PyCFunction)intSet_insert, METH_VARARGS, "insert(id,[ignored]) -- Add an id to the set"}, {"remove", (PyCFunction)intSet_remove, METH_VARARGS, "remove(id) -- Remove an id from the set"}, {"clear", (PyCFunction)intSet_clear, METH_VARARGS, "clear() -- Remove all of the ids from the set"}, {"union", (PyCFunction)intSet_union, METH_VARARGS, "union(other) -- Return the union of the set with another set"}, {"intersection", (PyCFunction)intSet_intersection, METH_VARARGS, "intersection(other) -- " "Return the intersection of the set with another set"}, {"difference", (PyCFunction)intSet_difference, METH_VARARGS, "difference(other) -- Return the difference of the set with another set" }, {"__getstate__", (PyCFunction)intSet___getstate__, METH_VARARGS, "__getstate__() -- get the persistent state"}, {"__setstate__", (PyCFunction)intSet___setstate__, METH_VARARGS, "__setstate__() -- set the persistent state"}, {"_p___reinit__", (PyCFunction)intSet__p___reinit__, METH_VARARGS, "_p___reinit__(oid,jar,copy) -- Reinitialize from a newly created copy"}, {"_p_deactivate", (PyCFunction)intSet__p___reinit__, METH_VARARGS, "_p_deactivate(oid,jar,copy) -- Reinitialize from a newly created copy"}, {NULL, NULL} /* sentinel */ }; static void intSet_dealloc(intSet *self) { free(self->data); PER_DEL(self); Py_DECREF(self->ob_type); PyMem_DEL(self); } static PyObject * intSet_getattr(intSet *self, PyObject *name) { return Py_FindAttr((PyObject *)self, name); } /* Code to handle accessing intSet objects as sequence objects */ static int intSet_length(intSet *self) { PER_USE_OR_RETURN(self,-1); return PER_INT_RETURN(self,self->len); } static PyObject * intSet_repeat(intSet *self, int n) { PyErr_SetString(PyExc_TypeError, "intSet objects do not support repetition"); return NULL; } static PyObject * intSet_item(intSet *self, int i) { PyObject *e; PER_USE_OR_RETURN(self,NULL); if(i >= 0 && i < self->len) return PER_RETURN(self,PyInt_FromLong(self->data[i])); UNLESS(e=PyInt_FromLong(i)) goto err; PyErr_SetObject(PyExc_IndexError, e); Py_DECREF(e); err: PER_ALLOW_DEACTIVATION(self) return NULL; } static PyObject * intSet_slice(intSet *self, int ilow, int ihigh) { PyErr_SetString(PyExc_TypeError, "intSet objects do not support slicing"); return NULL; } static int intSet_ass_item(intSet *self, int i, PyObject *v) { PyErr_SetString(PyExc_TypeError, "intSet objects do not support item assignment"); return -1; } static int intSet_ass_slice(PyListObject *self, int ilow, int ihigh, PyObject *v) { PyErr_SetString(PyExc_TypeError, "intSet objects do not support slice assignment"); return -1; } static PySequenceMethods intSet_as_sequence = { (inquiry)intSet_length, /*sq_length*/ (binaryfunc)intSet_add, /*sq_concat*/ (intargfunc)intSet_repeat, /*sq_repeat*/ (intargfunc)intSet_item, /*sq_item*/ (intintargfunc)intSet_slice, /*sq_slice*/ (intobjargproc)intSet_ass_item, /*sq_ass_item*/ (intintobjargproc)intSet_ass_slice, /*sq_ass_slice*/ }; static PyExtensionClass intSetType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "intSet", /*tp_name*/ sizeof(intSet), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)intSet_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*obsolete tp_getattr*/ (setattrfunc)0, /*obsolete tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ &intSet_as_sequence, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)intSet_getattr, /*tp_getattro*/ 0, /*tp_setattro*/ /* Space for future expansion */ 0L,0L, "A set of integers", METHOD_CHAIN(intSet_methods), EXTENSIONCLASS_BASICNEW_FLAG | PERSISTENT_TYPE_FLAG, }; static struct PyMethodDef module_methods[] = { {NULL, NULL} /* sentinel */ }; void initintSet() { PyObject *m, *d; char *rev="$Revision: 1.18 $"; UNLESS(ExtensionClassImported) return; if(cPersistenceCAPI=PyCObject_Import("cPersistence","CAPI")) { intSetType.methods.link=cPersistenceCAPI->methods; intSetType.tp_getattro=cPersistenceCAPI->getattro; intSetType.tp_setattro=cPersistenceCAPI->setattro; } else return; /* Create the module and add the functions */ m = Py_InitModule4("intSet", module_methods, intSet_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); /* Add some symbolic constants to the module */ d = PyModule_GetDict(m); PyExtensionClass_Export(d,"intSet",intSetType); PyDict_SetItemString(d, "__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); /* Check for errors */ if (PyErr_Occurred()) Py_FatalError("can't initialize module intSet"); } Zope-2.0.1-ZEO-nonbin/lib/Components/BTree/intSet.h100644 1007 1403 370 6750411136 21602 0ustar petrillipetrilli#ifndef INTSET_H #define INTSET_H #define INTSET_DATA_TYPE int typedef struct { cPersistent_HEAD int size, len; INTSET_DATA_TYPE *data; } intSet; #define INTSET(O) ((intSet*)(O)) static PyObject *intSetType = NULL; #endif /* INTSET_H */ Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/ 40755 1007 1403 0 6772126757 22067 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/Acquisition.c100644 1007 1403 62654 6772012513 24635 0ustar petrillipetrilli/* Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: o Redistributions of source code must retain the above copyright notice, this list of conditions, and the disclaimer that follows. o 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. o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL CREATIONS 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. $Id: Acquisition.c,v 1.34 1999/09/21 23:31:23 jim Exp $ If you have questions regarding this software, contact: Digital Creations L.C. info@digicool.com (540) 371-6909 */ #include "ExtensionClass.h" static void PyVar_Assign(PyObject **v, PyObject *e) { Py_XDECREF(*v); *v=e; } #define ASSIGN(V,E) PyVar_Assign(&(V),(E)) #define UNLESS(E) if (!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E); UNLESS(V) #define OBJECT(O) ((PyObject*)(O)) static PyObject *py__add__, *py__sub__, *py__mul__, *py__div__, *py__mod__, *py__pow__, *py__divmod__, *py__lshift__, *py__rshift__, *py__and__, *py__or__, *py__xor__, *py__coerce__, *py__neg__, *py__pos__, *py__abs__, *py__nonzero__, *py__inv__, *py__int__, *py__long__, *py__float__, *py__oct__, *py__hex__, *py__getitem__, *py__setitem__, *py__delitem__, *py__getslice__, *py__setslice__, *py__delslice__, *py__concat__, *py__repeat__, *py__len__, *py__of__, *py__call__, *py__repr__, *py__str__; static PyObject *Acquired=0; static void init_py_names() { #define INIT_PY_NAME(N) py ## N = PyString_FromString(#N) INIT_PY_NAME(__add__); INIT_PY_NAME(__sub__); INIT_PY_NAME(__mul__); INIT_PY_NAME(__div__); INIT_PY_NAME(__mod__); INIT_PY_NAME(__pow__); INIT_PY_NAME(__divmod__); INIT_PY_NAME(__lshift__); INIT_PY_NAME(__rshift__); INIT_PY_NAME(__and__); INIT_PY_NAME(__or__); INIT_PY_NAME(__xor__); INIT_PY_NAME(__coerce__); INIT_PY_NAME(__neg__); INIT_PY_NAME(__pos__); INIT_PY_NAME(__abs__); INIT_PY_NAME(__nonzero__); INIT_PY_NAME(__inv__); INIT_PY_NAME(__int__); INIT_PY_NAME(__long__); INIT_PY_NAME(__float__); INIT_PY_NAME(__oct__); INIT_PY_NAME(__hex__); INIT_PY_NAME(__getitem__); INIT_PY_NAME(__setitem__); INIT_PY_NAME(__delitem__); INIT_PY_NAME(__getslice__); INIT_PY_NAME(__setslice__); INIT_PY_NAME(__delslice__); INIT_PY_NAME(__concat__); INIT_PY_NAME(__repeat__); INIT_PY_NAME(__len__); INIT_PY_NAME(__of__); INIT_PY_NAME(__call__); INIT_PY_NAME(__repr__); INIT_PY_NAME(__str__); #undef INIT_PY_NAME } static PyObject * CallMethodO(PyObject *self, PyObject *name, PyObject *args, PyObject *kw) { if (! args && PyErr_Occurred()) return NULL; UNLESS(name=PyObject_GetAttr(self,name)) return NULL; ASSIGN(name,PyEval_CallObjectWithKeywords(name,args,kw)); if (args) Py_DECREF(args); return name; } #define Build Py_BuildValue /* Declarations for objects of type Wrapper */ typedef struct { PyObject_HEAD PyObject *obj; PyObject *container; } Wrapper; staticforward PyExtensionClass Wrappertype, XaqWrappertype; #define isWrapper(O) ((O)->ob_type==(PyTypeObject*)&Wrappertype || \ (O)->ob_type==(PyTypeObject*)&XaqWrappertype) #define WRAPPER(O) ((Wrapper*)(O)) static PyObject * Wrapper__init__(Wrapper *self, PyObject *args) { PyObject *obj, *container; UNLESS(PyArg_Parse(args,"(OO)",&obj,&container)) return NULL; Py_INCREF(obj); Py_INCREF(container); self->obj=obj; self->container=container; Py_INCREF(Py_None); return Py_None; } /* ---------------------------------------------------------------- */ /* ---------- */ static PyObject * __of__(PyObject *inst, PyObject *parent) { PyObject *r, *t; UNLESS(r=PyObject_GetAttr(inst, py__of__)) return NULL; UNLESS(t=PyTuple_New(1)) goto err; PyTuple_SET_ITEM(t,0,parent); ASSIGN(r,PyObject_CallObject(r,t)); PyTuple_SET_ITEM(t,0,NULL); Py_DECREF(t); return r; err: Py_DECREF(r); return NULL; } static Wrapper *freeWrappers=0; static int nWrappers=0; #define MAX_CACHED_WRAPPERS 200 static PyObject * newWrapper(PyObject *obj, PyObject *container, PyTypeObject *Wrappertype) { Wrapper *self; if (freeWrappers) { self=freeWrappers; freeWrappers=(Wrapper*)self->obj; self->ob_type=Wrappertype; self->ob_refcnt=1; nWrappers--; } else { UNLESS(self = PyObject_NEW(Wrapper, Wrappertype)) return NULL; } Py_INCREF(Wrappertype); Py_INCREF(obj); Py_INCREF(container); self->obj=obj; self->container=container; return OBJECT(self); } static void Wrapper_dealloc(Wrapper *self) { Py_DECREF(self->obj); Py_DECREF(self->container); Py_DECREF(self->ob_type); if (nWrappers < MAX_CACHED_WRAPPERS) { self->obj=OBJECT(freeWrappers); freeWrappers=self; nWrappers++; } else { PyMem_DEL(self); } } static PyObject * Wrapper_special(Wrapper *self, char *name, PyObject *oname) { PyObject *r=0; switch(*name) { case 'b': if (strcmp(name,"base")==0) { if (self->obj) { r=self->obj; while (isWrapper(r) && WRAPPER(r)->obj) r=WRAPPER(r)->obj; } else r=Py_None; Py_INCREF(r); return r; } break; case 'p': if (strcmp(name,"parent")==0) { if (self->container) r=self->container; else r=Py_None; Py_INCREF(r); return r; } break; case 's': if (strcmp(name,"self")==0) { if (self->obj) r=self->obj; else r=Py_None; Py_INCREF(r); return r; } break; case 'e': if (strcmp(name,"explicit")==0) { if (self->ob_type != (PyTypeObject *)&XaqWrappertype) return newWrapper(self->obj, self->container, (PyTypeObject *)&XaqWrappertype); Py_INCREF(self); return OBJECT(self); } break; case 'a': if (strcmp(name,"acquire")==0) { return Py_FindAttr(OBJECT(self),oname); } break; case 'c': if (strcmp(name,"chain")==0) { if (r=PyList_New(0)) while (1) { if (PyList_Append(r,OBJECT(self)) >= 0) { if (isWrapper(self) && self->container) { self=WRAPPER(self->container); continue; } } else { Py_DECREF(r); } break; } return r; } break; case 'i': if (strcmp(name,"inContextOf")==0) { return Py_FindAttr(OBJECT(self),oname); } if (strcmp(name,"inner")==0) { if (self->obj) { r=self->obj; while (isWrapper(r) && WRAPPER(r)->obj) { self=WRAPPER(r); r=WRAPPER(r)->obj; } r=OBJECT(self); } else r=Py_None; Py_INCREF(r); return r; } break; case 'u': if (strcmp(name,"uncle")==0) { return PyString_FromString("Bob"); } break; } return NULL; } static int apply_filter(PyObject *filter, PyObject *inst, PyObject *oname, PyObject *r, PyObject *extra, PyObject *orig) { PyObject *fr; int ir; UNLESS(fr=PyTuple_New(5)) goto err; PyTuple_SET_ITEM(fr,0,orig); Py_INCREF(orig); PyTuple_SET_ITEM(fr,1,inst); Py_INCREF(inst); PyTuple_SET_ITEM(fr,2,oname); Py_INCREF(oname); PyTuple_SET_ITEM(fr,3,r); Py_INCREF(r); PyTuple_SET_ITEM(fr,4,extra); Py_INCREF(extra); UNLESS_ASSIGN(fr,PyObject_CallObject(filter, fr)) goto err; ir=PyObject_IsTrue(fr); Py_DECREF(fr); if (ir) return 1; Py_DECREF(r); return 0; err: Py_DECREF(r); return -1; } static PyObject * Wrapper_acquire(Wrapper *self, PyObject *oname, PyObject *filter, PyObject *extra, PyObject *orig, int sob, int sco) { PyObject *r, *v, *tb; char *name; name=PyString_AsString(oname); if (*name++=='a' && *name++=='q' && *name++=='_' && (r=Wrapper_special(self, name, oname))) { if (filter) switch(apply_filter(filter,OBJECT(self),oname,r,extra,orig)) { case -1: return NULL; case 1: return r; } else return r; } if (sob && self->obj) { if (isWrapper(self->obj)) { r=Wrapper_acquire((Wrapper*)self->obj, oname,filter,extra,orig,1,1); if (r) goto acquired; PyErr_Fetch(&r,&v,&tb); if (r && (r != PyExc_AttributeError /* || PyObject_Compare(v,oname) != 0 */ )) { PyErr_Restore(r,v,tb); return NULL; } Py_XDECREF(r); Py_XDECREF(v); Py_XDECREF(tb); r=NULL; } else if ((r=PyObject_GetAttr(self->obj,oname))) { if (isWrapper(r) && WRAPPER(r)->container==self->obj) { if (r->ob_refcnt==1) { Py_INCREF(self); ASSIGN(((Wrapper*)r)->container,OBJECT(self)); } else ASSIGN(r,newWrapper(((Wrapper*)r)->obj, OBJECT(self), r->ob_type)); } else if (PyECMethod_Check(r) && PyECMethod_Self(r)==self->obj) ASSIGN(r,PyECMethod_New(r,OBJECT(self))); else if (has__of__(r)) ASSIGN(r,__of__(r,OBJECT(self))); if (filter) switch(apply_filter(filter,OBJECT(self),oname,r,extra,orig)) { case -1: return NULL; case 1: return r; } else return r; } else { PyErr_Fetch(&r,&v,&tb); if (r != PyExc_AttributeError /* || PyObject_Compare(v,oname) != 0 */ ) { PyErr_Restore(r,v,tb); return NULL; } Py_XDECREF(r); Py_XDECREF(v); Py_XDECREF(tb); r=NULL; } PyErr_Clear(); } if (sco && self->container) { if (isWrapper(self->container)) { if (self->obj && self->obj->ob_type == (PyTypeObject*)&Wrappertype) { if (WRAPPER(self->obj)->container== WRAPPER(self->container)->container) sob=1, sco=0; else if (WRAPPER(self->obj)->container== WRAPPER(self->container)->obj) sob=0, sco=1; else sob=1, sco=1; r=Wrapper_acquire((Wrapper*)self->container, oname,filter,extra,orig, sob, sco); } else r=Wrapper_acquire((Wrapper*)self->container, oname,filter,extra,orig,1,1); if (r) goto acquired; return NULL; } else { if ((r=PyObject_GetAttr(self->container,oname))) if (filter) switch(apply_filter(filter,self->container,oname,r,extra,orig)) { case -1: return NULL; case 1: goto acquired; } else goto acquired; } PyErr_Clear(); } PyErr_SetObject(PyExc_AttributeError,oname); return NULL; acquired: if (has__of__(r)) ASSIGN(r,__of__(r,OBJECT(self))); return r; } static PyObject * handle_Acquired(Wrapper *self, PyObject *oname, PyObject *r) { UNLESS(self->container) { PyErr_SetObject(PyExc_AttributeError, oname); return NULL; } if (isWrapper(self->container)) ASSIGN(r,Wrapper_acquire(WRAPPER(self->container), oname,NULL,NULL,NULL,1,1)); else ASSIGN(r,PyObject_GetAttr(self->container,oname)); if (r && has__of__(r)) ASSIGN(r, __of__(r,OBJECT(self))); return r; } static PyObject * Wrapper_getattro_(Wrapper *self, PyObject *oname, int sob, int sco) { PyObject *r, *v, *tb; char *name; name=PyString_AsString(oname); if (*name=='a' && name[1]=='q' && name[2]=='_' && (r=Wrapper_special(self, name+3, oname))) return r; if (sob && self->obj && (r=PyObject_GetAttr(self->obj,oname))) { if (r == Acquired) return handle_Acquired(self, oname, r); if (isWrapper(r) && WRAPPER(r)->container==self->obj) { if (r->ob_refcnt==1) { Py_INCREF(self); ASSIGN(((Wrapper*)r)->container,OBJECT(self)); } else ASSIGN(r, newWrapper(((Wrapper*)r)->obj,OBJECT(self),r->ob_type)); } else if (PyECMethod_Check(r) && PyECMethod_Self(r)==self->obj) ASSIGN(r,PyECMethod_New(r,OBJECT(self))); else if (has__of__(r)) ASSIGN(r,__of__(r,OBJECT(self))); return r; } if (self->obj) if (sob) { PyErr_Fetch(&r,&v,&tb); if (r != PyExc_AttributeError /* || PyObject_Compare(v,oname) != 0 */ ) { PyErr_Restore(r,v,tb); return NULL; } Py_XDECREF(r); Py_XDECREF(v); Py_XDECREF(tb); r=NULL; } else PyErr_Clear(); if ((*name != '_') && self->container && sco) { if (self->container->ob_type == self->ob_type && self->obj->ob_type==self->ob_type) { if (WRAPPER(self->obj)->container== WRAPPER(self->container)->container) sob=1, sco=0; else if (WRAPPER(self->obj)->container== WRAPPER(self->container)->obj) sob=0, sco=1; else sob=1, sco=1; r=Wrapper_getattro_(WRAPPER(self->container), oname, sob, sco); } else r=PyObject_GetAttr(self->container,oname); if (r) { if (has__of__(r)) ASSIGN(r, __of__(r,OBJECT(self))); return r; } PyErr_Clear(); } if (*name++=='_' && strcmp(name,"_init__")==0) return Py_FindAttr(OBJECT(self),oname); PyErr_SetObject(PyExc_AttributeError,oname); return NULL; } static PyObject * Wrapper_getattro(Wrapper *self, PyObject *oname) { return Wrapper_getattro_(self, oname, 1, 1); } static PyObject * Xaq_getattro(Wrapper *self, PyObject *oname) { PyObject *r, *v, *tb; char *name; name=PyString_AsString(oname); if (*name=='_') { if (strcmp(name,"__init__")==0) return Py_FindAttr(OBJECT(self),oname); } if (*name=='a') { if (name[1]=='c') { if (strcmp(name+2,"quire")==0) return Py_FindAttr(OBJECT(self),oname); } else if (name[1]=='q' && name[2]=='_' && (r=Wrapper_special(self, name+3, oname))) return r; } if (self->obj && (r=PyObject_GetAttr(self->obj,oname))) { if (r==Acquired) return handle_Acquired(self,oname,r); if (isWrapper(r) && WRAPPER(r)->container==self->obj) { if (r->ob_refcnt==1) { Py_INCREF(self); ASSIGN(((Wrapper*)r)->container,OBJECT(self)); } else ASSIGN(r, newWrapper(((Wrapper*)r)->obj, OBJECT(self), r->ob_type)); } else if (PyECMethod_Check(r) && PyECMethod_Self(r)==self->obj) ASSIGN(r,PyECMethod_New(r,OBJECT(self))); else if (has__of__(r)) ASSIGN(r,__of__(r,OBJECT(self))); return r; } if (self->obj) { PyErr_Fetch(&r,&v,&tb); if (r != PyExc_AttributeError /* || PyObject_Compare(v,oname) != 0 */ ) { PyErr_Restore(r,v,tb); return NULL; } Py_XDECREF(r); Py_XDECREF(v); Py_XDECREF(tb); r=NULL; } PyErr_SetObject(PyExc_AttributeError,oname); return NULL; } static int Wrapper_setattro(Wrapper *self, PyObject *name, PyObject *v) { if (v && v->ob_type==(PyTypeObject*)&Wrappertype) v=((Wrapper*)v)->obj; return PyObject_SetAttr(self->obj, name, v); } static int Wrapper_compare(Wrapper *v, Wrapper *w) { return PyObject_Compare(v->obj,w->obj); } static PyObject * Wrapper_repr(Wrapper *self) { PyObject *r; if ((r=PyObject_GetAttr(OBJECT(self),py__repr__))) { ASSIGN(r,PyObject_CallFunction(r,NULL,NULL)); return r; } else { PyErr_Clear(); return PyObject_Repr(self->obj); } } static PyObject * Wrapper_str(Wrapper *self) { PyObject *r; if ((r=PyObject_GetAttr(OBJECT(self),py__str__))) { ASSIGN(r,PyObject_CallFunction(r,NULL,NULL)); return r; } else { PyErr_Clear(); return PyObject_Str(self->obj); } } static long Wrapper_hash(Wrapper *self) { return PyObject_Hash(self->obj); } static PyObject * Wrapper_call(Wrapper *self, PyObject *args, PyObject *kw) { Py_INCREF(args); return CallMethodO(OBJECT(self),py__call__,args,kw); } /* Code to handle accessing Wrapper objects as sequence objects */ static int Wrapper_length(Wrapper *self) { long l; PyObject *r; UNLESS(r=PyObject_GetAttr(OBJECT(self), py__len__)) { /* Hm. Maybe we are being checked to see if we are true. Check to see if we have a __getitem__. If we don't, then answer that we are true, otherwise raise an error. */ PyErr_Clear(); if ((r=PyObject_GetAttr(OBJECT(self), py__getitem__))) { /* Hm, we have getitem, must be error */ Py_DECREF(r); PyErr_SetObject(PyExc_AttributeError, py__len__); return -1; } PyErr_Clear(); /* Try nonzero */ UNLESS(r=PyObject_GetAttr(OBJECT(self), py__nonzero__)) { /* No nonzero, it's true :-) */ PyErr_Clear(); return 1; } } UNLESS_ASSIGN(r,PyObject_CallObject(r,NULL)) return -1; l=PyInt_AsLong(r); Py_DECREF(r); return l; } static PyObject * Wrapper_concat(Wrapper *self, PyObject *bb) { return CallMethodO(OBJECT(self),py__concat__,Build("(O)", bb) ,NULL); } static PyObject * Wrapper_repeat(Wrapper *self, int n) { return CallMethodO(OBJECT(self),py__repeat__,Build("(i)", n),NULL); } static PyObject * Wrapper_item(Wrapper *self, int i) { return CallMethodO(OBJECT(self),py__getitem__, Build("(i)", i),NULL); } static PyObject * Wrapper_slice(Wrapper *self, int ilow, int ihigh) { return CallMethodO(OBJECT(self),py__getslice__, Build("(ii)", ilow, ihigh),NULL); } static int Wrapper_ass_item(Wrapper *self, int i, PyObject *v) { if (v) { UNLESS(v=CallMethodO(OBJECT(self),py__setitem__, Build("(iO)", i, v),NULL)) return -1; } else { UNLESS(v=CallMethodO(OBJECT(self),py__delitem__, Build("(i)", i),NULL)) return -1; } Py_DECREF(v); return 0; } static int Wrapper_ass_slice(Wrapper *self, int ilow, int ihigh, PyObject *v) { if (v) { UNLESS(v=CallMethodO(OBJECT(self),py__setslice__, Build("(iiO)", ilow, ihigh, v),NULL)) return -1; } else { UNLESS(v=CallMethodO(OBJECT(self),py__delslice__, Build("(ii)", ilow, ihigh),NULL)) return -1; } Py_DECREF(v); return 0; } static PySequenceMethods Wrapper_as_sequence = { (inquiry)Wrapper_length, /*sq_length*/ (binaryfunc)Wrapper_concat, /*sq_concat*/ (intargfunc)Wrapper_repeat, /*sq_repeat*/ (intargfunc)Wrapper_item, /*sq_item*/ (intintargfunc)Wrapper_slice, /*sq_slice*/ (intobjargproc)Wrapper_ass_item, /*sq_ass_item*/ (intintobjargproc)Wrapper_ass_slice, /*sq_ass_slice*/ }; /* -------------------------------------------------------------- */ /* Code to access Wrapper objects as mappings */ static PyObject * Wrapper_subscript(Wrapper *self, PyObject *key) { return CallMethodO(OBJECT(self),py__getitem__,Build("(O)", key),NULL); } static int Wrapper_ass_sub(Wrapper *self, PyObject *key, PyObject *v) { if (v) { UNLESS(v=CallMethodO(OBJECT(self),py__setitem__, Build("(OO)", key, v),NULL)) return -1; } else { UNLESS(v=CallMethodO(OBJECT(self),py__delitem__, Build("(O)", key),NULL)) return -1; } Py_XDECREF(v); return 0; } static PyMappingMethods Wrapper_as_mapping = { (inquiry)Wrapper_length, /*mp_length*/ (binaryfunc)Wrapper_subscript, /*mp_subscript*/ (objobjargproc)Wrapper_ass_sub, /*mp_ass_subscript*/ }; /* -------------------------------------------------------- */ static PyObject * Wrapper_acquire_method(Wrapper *self, PyObject *args) { PyObject *name, *filter=0, *extra=Py_None; UNLESS(PyArg_ParseTuple(args,"O|OO",&name,&filter,&extra)) return NULL; return Wrapper_acquire(self,name,filter,extra,OBJECT(self),1,1); } static PyObject * Wrapper_inContextOf(Wrapper *self, PyObject *args) { PyObject *o, *c; int inner=0; UNLESS(PyArg_ParseTuple(args,"O|i",&o,&inner)) return NULL; if (inner) while (self->obj && isWrapper(self->obj)) self=WRAPPER(self->obj); if (OBJECT(self)==o) return PyInt_FromLong(1); c=self->container; while (1) { if (c==o) return PyInt_FromLong(1); if (isWrapper(c)) c=WRAPPER(c)->container; else return PyInt_FromLong(0); } } static struct PyMethodDef Wrapper_methods[] = { {"__init__", (PyCFunction)Wrapper__init__, 0, "Initialize an Acquirer Wrapper"}, {"acquire", (PyCFunction)Wrapper_acquire_method, METH_VARARGS, "Get an attribute, acquiring it if necessary"}, {"aq_acquire", (PyCFunction)Wrapper_acquire_method, METH_VARARGS, "Get an attribute, acquiring it if necessary"}, {"aq_inContextOf", (PyCFunction)Wrapper_inContextOf, METH_VARARGS, "Test whether the object is currently in the context of the argument"}, {NULL, NULL} /* sentinel */ }; static PyExtensionClass Wrappertype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "ImplicitAcquirerWrapper", /*tp_name*/ sizeof(Wrapper), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Wrapper_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)Wrapper_compare, /*tp_compare*/ (reprfunc)Wrapper_repr, /*tp_repr*/ 0, /*tp_as_number*/ &Wrapper_as_sequence, /*tp_as_sequence*/ &Wrapper_as_mapping, /*tp_as_mapping*/ (hashfunc)Wrapper_hash, /*tp_hash*/ (ternaryfunc)Wrapper_call, /*tp_call*/ (reprfunc)Wrapper_str, /*tp_str*/ (getattrofunc)Wrapper_getattro, /*tp_getattr with object key*/ (setattrofunc)Wrapper_setattro, /*tp_setattr with object key*/ /* Space for future expansion */ 0L,0L, "Wrapper object for implicit acquisition", /* Documentation string */ METHOD_CHAIN(Wrapper_methods), EXTENSIONCLASS_BINDABLE_FLAG, }; static PyExtensionClass XaqWrappertype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "ExplicitAcquirerWrapper", /*tp_name*/ sizeof(Wrapper), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Wrapper_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)Wrapper_compare, /*tp_compare*/ (reprfunc)Wrapper_repr, /*tp_repr*/ 0, /*tp_as_number*/ &Wrapper_as_sequence, /*tp_as_sequence*/ &Wrapper_as_mapping, /*tp_as_mapping*/ (hashfunc)Wrapper_hash, /*tp_hash*/ (ternaryfunc)Wrapper_call, /*tp_call*/ (reprfunc)Wrapper_str, /*tp_str*/ (getattrofunc)Xaq_getattro, /*tp_getattr with object key*/ (setattrofunc)Wrapper_setattro, /*tp_setattr with object key*/ /* Space for future expansion */ 0L,0L, "Wrapper object for explicit acquisition", /* Documentation string */ METHOD_CHAIN(Wrapper_methods), EXTENSIONCLASS_BINDABLE_FLAG, }; static PyObject * acquire_of(PyObject *self, PyObject *args) { PyObject *inst; UNLESS(PyArg_ParseTuple(args, "O", &inst)) return NULL; UNLESS(PyExtensionInstance_Check(inst)) { PyErr_SetString(PyExc_TypeError, "attempt to wrap extension method using an object that\n" "is not an extension class instance."); return NULL; } return newWrapper(self, inst, (PyTypeObject *)&Wrappertype); } static PyObject * xaq_of(PyObject *self, PyObject *args) { PyObject *inst; UNLESS(PyArg_ParseTuple(args, "O", &inst)) return NULL; UNLESS(PyExtensionInstance_Check(inst)) { PyErr_SetString(PyExc_TypeError, "attempt to wrap extension method using an object that\n" "is not an extension class instance."); return NULL; } return newWrapper(self, inst, (PyTypeObject *)&XaqWrappertype); } static struct PyMethodDef Acquirer_methods[] = { {"__of__",(PyCFunction)acquire_of, METH_VARARGS, "__of__(context) -- return the object in a context"}, {NULL, NULL} /* sentinel */ }; static struct PyMethodDef Xaq_methods[] = { {"__of__",(PyCFunction)xaq_of, METH_VARARGS,""}, {NULL, NULL} /* sentinel */ }; static struct PyMethodDef methods[] = {{NULL, NULL}}; void initAcquisition() { PyObject *m, *d; char *rev="$Revision: 1.34 $"; PURE_MIXIN_CLASS(Acquirer, "Base class for objects that implicitly" " acquire attributes from containers\n" , Acquirer_methods); PURE_MIXIN_CLASS(ExplicitAcquirer, "Base class for objects that explicitly" " acquire attributes from containers\n" , Xaq_methods); UNLESS(ExtensionClassImported) return; UNLESS(Acquired=PyString_FromStringAndSize(NULL,42)) return; strcpy(PyString_AsString(Acquired), ""); /* Create the module and add the functions */ m = Py_InitModule4("Acquisition", methods, "Provide base classes for acquiring objects\n\n" "$Id: Acquisition.c,v 1.34 1999/09/21 23:31:23 jim Exp $\n", OBJECT(NULL),PYTHON_API_VERSION); d = PyModule_GetDict(m); init_py_names(); PyExtensionClass_Export(d,"Acquirer",AcquirerType); PyExtensionClass_Export(d,"ImplicitAcquisitionWrapper",Wrappertype); PyExtensionClass_Export(d,"ExplicitAcquirer",ExplicitAcquirerType); PyExtensionClass_Export(d,"ExplicitAcquisitionWrapper",XaqWrappertype); /* Create aliases */ PyDict_SetItemString(d,"Implicit",OBJECT(&AcquirerType)); PyDict_SetItemString(d,"Explicit",OBJECT(&ExplicitAcquirerType)); PyDict_SetItemString(d,"__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); PyDict_SetItemString(d,"Acquired",Acquired); CHECK_FOR_ERRORS("can't initialize module Acquisition"); } Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/Acquisition.stx100644 1007 1403 21756 6624556761 25245 0ustar petrillipetrilliAcquisition "Copyright (C) 1996-1998, Digital Creations":COPYRIGHT.html. Acquisition [1] is a mechanism that allows objects to obtain attributes from their environment. It is similar to inheritence, except that, rather than traversing an inheritence hierarchy to obtain attributes, a containment hierarchy is traversed. The "ExtensionClass":ExtensionClass.html. release includes mix-in extension base classes that can be used to add acquisition as a feature to extension subclasses. These mix-in classes use the context-wrapping feature of ExtensionClasses to implement acquisition. Consider the following example:: import ExtensionClass, Acquisition class C(ExtensionClass.Base): color='red' class A(Acquisition.Implicit): def report(self): print self.color a=A() c=C() c.a=A() c.a.report() # prints 'red' d=C() d.color='green' d.a=a d.a.report() # prints 'green' a.report() # raises an attribute error The class 'A' inherits acquisition behavior from 'Acquisition.Implicit'. The object, 'a', "has" the color of objects 'c' and 'd' when it is accessed through them, but it has no color by itself. The object 'a' obtains attributes from it's environment, where it's environment is defined by the access path used to reach 'a'. Acquisition wrappers When an object that supports acquisition is accessed through an extension class instance, a special object, called an acquisition wrapper, is returned. In the example above, the expression 'c.a' returns an acquisition wrapper that contains references to both 'c' and 'a'. It is this wrapper that performs attribute lookup in 'c' when an attribute cannot be found in 'a'. Aquisition wrappers provide access to the wrapped objects through the attributes 'aq_parent', 'aq_self', 'aq_base'. In the example above, the expressions:: 'c.a.aq_parent is c' and:: 'c.a.aq_self is a' both evaluate to true, but the expression:: 'c.a is a' evaluates to false, because the expression 'c.a' evaluates to an acquisition wrapper around 'c' and 'a', not 'a' itself. The attribute 'aq_base' is similar to 'aq_self'. Wrappers may be nested and 'aq_self' may be a wrapped object. The 'aq_base' attribute is the underlying object with all wrappers removed. Acquisition Control Two styles of acquisition are supported in the current ExtensionClass release, implicit and explicit aquisition. Implicit acquisition Implicit acquisition is so named because it searches for attributes from the environment automatically whenever an attribute cannot be obtained directly from an object or through inheritence. An attribute may be implicitly acquired if it's name does not begin with an underscore, '_'. To support implicit acquisition, an object should inherit from the mix-in class 'Acquisition.Implicit'. Explicit Acquisition When explicit acquisition is used, attributes are not automatically obtained from the environment. Instead, the method 'aq_aquire' must be used, as in:: print c.a.aq_acquire('color') To support explicit acquisition, an object should inherit from the mix-in class 'Acquisition.Explicit'. Controlled Acquisition A class (or instance) can provide attribute by attribute control over acquisition. This is done by: - subclassing from 'Acquisition.Explicit', and - setting all attributes that should be acquired to the special value: 'Acquisition.Acquired'. Setting an attribute to this value also allows inherited attributes to be overridden with acquired ones. For example, in:: class C(Acquisition.Explicit): id=1 secret=2 color=Acquisition.Acquired __roles__=Acquisition.Acquired The *only* attributes that are automatically acquired from containing objects are 'color', and '__roles__'. Note also that the '__roles__' attribute is acquired even though it's name begins with an underscore. In fact, the special 'Acquisition.Acquired' value can be used in 'Acquisition.Implicit' objects to implicitly acquire selected objects that smell like private objects. Filtered Acquisition The acquisition method, 'aq_acquire', accepts two optional arguments. The first of the additional arguments is a "filtering" function that is used when considering whether to acquire an object. The second of the additional arguments is an object that is passed as extra data when calling the filtering function and which defaults to 'None'. The filter function is called with five arguments: - The object that the 'aq_acquire' method was called on, - The object where an object was found, - The name of the object, as passed to 'aq_acquire', - The object found, and - The extra data passed to 'aq_acquire'. If the filter returns a true object that the object found is returned, otherwise, the acquisition search continues. For example, in:: from Acquisition import Explicit class HandyForTesting: def __init__(self, name): self.name=name def __str__(self): return "%s(%s)" % (self.name, self.__class__.__name__) __repr__=__str__ class E(Explicit, HandyForTesting): pass class Nice(HandyForTesting): isNice=1 def __str__(self): return HandyForTesting.__str__(self)+' and I am nice!' __repr__=__str__ a=E('a') a.b=E('b') a.b.c=E('c') a.p=Nice('spam') a.b.p=E('p') def find_nice(self, ancestor, name, object, extra): return hasattr(object,'isNice') and object.isNice print a.b.c.aq_acquire('p', find_nice) The filtered acquisition in the last line skips over the first attribute it finds with the name 'p', because the attribute doesn't satisfy the condition given in the filter. The output of the last line is:: spam(Nice) and I am nice! Acquisition and methods Python methods of objects that support acquisition can use acquired attributes as in the 'report' method of the first example above. When a Python method is called on an object that is wrapped by an acquisition wrapper, the wrapper is passed to the method as the first argument. This rule also applies to user-defined method types and to C methods defined in pure mix-in classes. Unfortunately, C methods defined in extension base classes that define their own data structures, cannot use aquired attributes at this time. This is because wrapper objects do not conform to the data structures expected by these methods. Acquiring Acquiring objects Consider the following example:: from Acquisition import Implicit class C(Implicit): def __init__(self, name): self.name=name def __str__(self): return "%s(%s)" % (self.name, self.__class__.__name__) __repr__=__str__ a=C("a") a.b=C("b") a.b.pref="spam" a.b.c=C("c") a.b.c.color="red" a.b.c.pref="eggs" a.x=C("x") o=a.b.c.x The expression 'o.color' might be expected to return '"red"'. In earlier versions of ExtensionClass, however, this expression failed. Acquired acquiring objects did not acquire from the environment they were accessed in, because objects were only wrapped when they were first found, and were not rewrapped as they were passed down the acquisition tree. In the current release of ExtensionClass, the expression "o.color" does indeed return '"red"'. When searching for an attribute in 'o', objects are searched in the order 'x', 'a', 'b', 'c'. So, for example, the expression, 'o.pref' returns '"spam"', not '"eggs"'. In earlier releases of ExtensionClass, the attempt to get the 'pref' attribute from 'o' would have failed. If desired, the current rules for looking up attributes in complex expressions can best be understood through repeated application of the '__of__' method: 'a.x' -- 'x.__of__(a)' 'a.b' -- 'b.__of__(a)' 'a.b.x' -- 'x.__of__(a).__of__(b.__of__(a))' 'a.b.c' -- 'c.__of__(b.__of__(a))' 'a.b.c.x' -- 'x.__of__(a).__of__(b.__of__(a)).__of__(c.__of__(b.__of__(a)))' and by keeping in mind that attribute lookup in a wrapper is done by trying to lookup the attribute in the wrapped object first and then in the parent object. In the expressions above involving the '__of__' method, lookup proceeds from left to right. Note that heuristics are used to avoid most of the repeated lookups. For example, in the expression: 'a.b.c.x.foo', the object 'a' is searched no more than once, even though it is wrapped three times. .. [1] Gil, J., Lorenz, D., "Environmental Acquisition--A New Inheritance-Like Abstraction Mechanism", http://www.bell-labs.com/people/cope/oopsla/Oopsla96TechnicalProgramAbstracts.html#GilLorenz, OOPSLA '96 Proceedings, ACM SIG-PLAN, October, 1996 Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/COPYRIGHT.txt100644 1007 1403 3103 6624556761 24270 0ustar petrillipetrilliCopyright (C) 1996-1998, Digital Creations, Fredericksburg, VA, USA. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: o Redistributions of source code must retain the above copyright notice, this list of conditions, and the disclaimer that follows. o 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. o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL CREATIONS 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. Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/ComputedAttribute.c100644 1007 1403 10002 6730015527 25767 0ustar petrillipetrilli/* Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: o Redistributions of source code must retain the above copyright notice, this list of conditions, and the disclaimer that follows. o 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. o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL CREATIONS 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. $Id: ComputedAttribute.c,v 1.2 1999/06/10 20:08:55 jim Exp $ If you have questions regarding this software, contact: Digital Creations L.C. info@digicool.com (540) 371-6909 */ #include "ExtensionClass.h" static void PyVar_Assign(PyObject **v, PyObject *e) { Py_XDECREF(*v); *v=e; } #define ASSIGN(V,E) PyVar_Assign(&(V),(E)) #define UNLESS(E) if(!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E); UNLESS(V) #define OBJECT(O) ((PyObject*)(O)) typedef struct { PyObject_HEAD PyObject *callable; } CA; static PyObject * CA__init__(CA *self, PyObject *args) { PyObject *callable; UNLESS(PyArg_ParseTuple(args,"O",&callable)) return NULL; Py_INCREF(callable); self->callable=callable; Py_INCREF(Py_None); return Py_None; } static void CA_dealloc(CA *self) { Py_DECREF(self->callable); Py_DECREF(self->ob_type); PyMem_DEL(self); } static PyObject * CA_of(CA *self, PyObject *args) { PyObject *inst, *r; UNLESS(PyArg_ParseTuple(args,"O",&inst) && (r=PyTuple_New(1))) return NULL; PyTuple_SET_ITEM(r,0,inst); Py_INCREF(inst); if (self->callable) ASSIGN(r, PyObject_CallObject(self->callable, r)); return r; } static struct PyMethodDef CA_methods[] = { {"__init__",(PyCFunction)CA__init__, METH_VARARGS, ""}, {"__of__", (PyCFunction)CA_of, METH_VARARGS, ""}, {NULL, NULL} /* sentinel */ }; static PyExtensionClass ComputedAttributeType = { PyObject_HEAD_INIT(NULL) 0, "ComputedAttribute", sizeof(CA), 0, (destructor)CA_dealloc, 0,0,0,0,0, 0,0,0, 0,0,0,0,0, 0,0, "ComputedAttribute(callable) -- Create a computed attribute", METHOD_CHAIN(CA_methods), EXTENSIONCLASS_BINDABLE_FLAG }; static struct PyMethodDef methods[] = { {NULL, NULL} }; void initComputedAttribute() { PyObject *m, *d; char *rev="$Revision: 1.2 $"; UNLESS(ExtensionClassImported) return; ComputedAttributeType.tp_getattro= (getattrofunc)PyExtensionClassCAPI->getattro; /* Create the module and add the functions */ m = Py_InitModule4("ComputedAttribute", methods, "Provide Computed Attributes\n\n" "$Id: ComputedAttribute.c,v 1.2 1999/06/10 20:08:55 jim Exp $\n", OBJECT(NULL),PYTHON_API_VERSION); d = PyModule_GetDict(m); PyExtensionClass_Export(d,"ComputedAttribute",ComputedAttributeType); PyDict_SetItemString(d,"__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); CHECK_FOR_ERRORS("can't initialize module Acquisition"); } Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/ComputedAttribute.py100644 1007 1403 7507 6632046312 26172 0ustar petrillipetrilli############################################################################## # # Copyright # # Copyright 1996 Digital Creations, L.C., 910 Princess Anne # Street, Suite 300, Fredericksburg, Virginia 22401 U.S.A. All # rights reserved. Copyright in this software is owned by DCLC, # unless otherwise indicated. Permission to use, copy and # distribute this software is hereby granted, provided that the # above copyright notice appear in all copies and that both that # copyright notice and this permission notice appear. Note that # any product, process or technology described in this software # may be the subject of other Intellectual Property rights # reserved by Digital Creations, L.C. and are not licensed # hereunder. # # Trademarks # # Digital Creations & DCLC, are trademarks of Digital Creations, L.C.. # All other trademarks are owned by their respective companies. # # No Warranty # # The software is provided "as is" without warranty of any kind, # either express or implied, including, but not limited to, the # implied warranties of merchantability, fitness for a particular # purpose, or non-infringement. This software could include # technical inaccuracies or typographical errors. Changes are # periodically made to the software; these changes will be # incorporated in new editions of the software. DCLC may make # improvements and/or changes in this software at any time # without notice. # # Limitation Of Liability # # In no event will DCLC be liable for direct, indirect, special, # incidental, economic, cover, or consequential damages arising # out of the use of or inability to use this software even if # advised of the possibility of such damages. Some states do not # allow the exclusion or limitation of implied warranties or # limitation of liability for incidental or consequential # damages, so the above limitation or exclusion may not apply to # you. # # # If you have questions regarding this software, contact: # # Digital Creations, L.C. # 910 Princess Ann Street # Fredericksburge, Virginia 22401 # # info@digicool.com # # (540) 371-6909 # ############################################################################## __doc__='''Sample application of the '__of__' protocol, computed attributes It is not uncommon to wish to expose information via the attribute interface without exposing implementation. In principle, one can use a custom '__getattr__' method to implement computed attributes, however, this can be a bit cumbersome and can interfere with other uses of '__getattr__', such as for persistence. The '__of__' protocol provided by ExtensionClass provides another way of implementing computed attribute. The of '__of__' protocol provides a way of returning sub-objects in the context of a container. For example:: x.__of__(y) should be interpreted as "compute y in the context of x". When getting an ExtensionClass attribute, the attributes '__of__' method is called automatically, if it has one. This module provides a simple computed attribute implementation and an example of its usage. $Id: ComputedAttribute.py,v 1.2 1998/12/04 20:57:46 jim Exp $''' __version__='$Revision: 1.2 $'[11:-2] import ExtensionClass class ComputedAttribute(ExtensionClass.Base): def __init__(self, func): self.func=func def __of__(self, parent): return self.func(parent) ############################################################################## # Test code: # if __name__ == "__main__": from math import sqrt class point(ExtensionClass.Base): def __init__(self, x, y): self.x, self.y = x, y radius=ComputedAttribute(lambda self: sqrt(self.x**2+self.y**2)) p=point(2,2) print p.radius Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/ExtensionClass.c100644 1007 1403 255565 6730723376 25346 0ustar petrillipetrilli/* Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: o Redistributions of source code must retain the above copyright notice, this list of conditions, and the disclaimer that follows. o 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. o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL CREATIONS 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. $Id: ExtensionClass.c,v 1.36 1999/06/13 12:41:34 jim Exp $ If you have questions regarding this software, contact: Digital Creations L.C. info@digicool.com (540) 371-6909 */ static char ExtensionClass_module_documentation[] = "ExtensionClass - Classes implemented in c\n" "\n" "Built-in C classes are like Built-in types except that\n" "they provide some of the behavior of Python classes:\n" "\n" " - They provide access to unbound methods,\n" " - They can be called to create instances.\n" "\n" "$Id: ExtensionClass.c,v 1.36 1999/06/13 12:41:34 jim Exp $\n" ; #include #include "ExtensionClass.h" static void PyVar_Assign(PyObject **v, PyObject *e) { Py_XDECREF(*v); *v=e; } #define ASSIGN(V,E) PyVar_Assign(&(V),(E)) #define UNLESS(E) if (!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E); UNLESS(V) #define OBJECT(O) ((PyObject*)O) /* Declarations for objects of type ExtensionClass */ staticforward PyExtensionClass ECType; #define ExtensionClass_Check(O) ((O)->ob_type == (PyTypeObject*)&ECType) #define ExtensionInstance_Check(O) \ ((O)->ob_type->ob_type == (PyTypeObject*)&ECType) #define AsExtensionClass(O) ((PyExtensionClass*)(O)) #define ExtensionClassOf(O) ((PyExtensionClass*)((O)->ob_type)) #define AsPyObject(O) ((PyObject*)(O)) #define NeedsToBeBound(O) \ ((O)->ob_type->ob_type == (PyTypeObject*)&ECType && \ (((PyExtensionClass*)((O)->ob_type))->class_flags & \ EXTENSIONCLASS_BINDABLE_FLAG)) #define HasMethodHook(O) \ ((O)->ob_type->ob_type == (PyTypeObject*)&ECType && \ (((PyExtensionClass*)((O)->ob_type))->class_flags & \ EXTENSIONCLASS_METHODHOOK_FLAG)) #define ALLOC_FREE(T) \ if (free ## T) { \ self=free ## T; \ free ## T=(T*)self->self; \ self->ob_refcnt=1; \ } \ else UNLESS(self = PyObject_NEW(T, & T ## Type)) return NULL; #define METH_BY_NAME (2 << 16) static PyObject *py__add__, *py__sub__, *py__mul__, *py__div__, *py__mod__, *py__pow__, *py__divmod__, *py__lshift__, *py__rshift__, *py__and__, *py__or__, *py__xor__, *py__coerce__, *py__neg__, *py__pos__, *py__abs__, *py__nonzero__, *py__inv__, *py__int__, *py__long__, *py__float__, *py__oct__, *py__hex__, *py__of__, *py__call__, *py__call_method__, *py__getitem__, *py__setitem__, *py__delitem__, *py__getslice__, *py__setslice__, *py__delslice__, *py__len__, *py__getattr__, *py__setattr__, *py__delattr__, *py__del__, *py__repr__, *py__str__, *py__class__, *py__name__, *py__hash__, *py__cmp__, *py__var_size__, *py__init__, *py__getinitargs__, *py__getstate__, *py__setstate__, *py__dict__, *pyclass_, *py__module__; static PyObject *concat_fmt=0; static PyObject *subclass_watcher=0; /* Object that subclass events */ static void init_py_names() { #define INIT_PY_NAME(N) py ## N = PyString_FromString(#N) INIT_PY_NAME(__add__); INIT_PY_NAME(__sub__); INIT_PY_NAME(__mul__); INIT_PY_NAME(__div__); INIT_PY_NAME(__mod__); INIT_PY_NAME(__pow__); INIT_PY_NAME(__divmod__); INIT_PY_NAME(__lshift__); INIT_PY_NAME(__rshift__); INIT_PY_NAME(__and__); INIT_PY_NAME(__or__); INIT_PY_NAME(__xor__); INIT_PY_NAME(__coerce__); INIT_PY_NAME(__neg__); INIT_PY_NAME(__pos__); INIT_PY_NAME(__abs__); INIT_PY_NAME(__nonzero__); INIT_PY_NAME(__inv__); INIT_PY_NAME(__int__); INIT_PY_NAME(__long__); INIT_PY_NAME(__float__); INIT_PY_NAME(__oct__); INIT_PY_NAME(__hex__); INIT_PY_NAME(__getitem__); INIT_PY_NAME(__setitem__); INIT_PY_NAME(__delitem__); INIT_PY_NAME(__getslice__); INIT_PY_NAME(__setslice__); INIT_PY_NAME(__delslice__); INIT_PY_NAME(__len__); INIT_PY_NAME(__of__); INIT_PY_NAME(__call__); INIT_PY_NAME(__call_method__); INIT_PY_NAME(__getattr__); INIT_PY_NAME(__setattr__); INIT_PY_NAME(__delattr__); INIT_PY_NAME(__del__); INIT_PY_NAME(__repr__); INIT_PY_NAME(__str__); INIT_PY_NAME(__class__); INIT_PY_NAME(__name__); INIT_PY_NAME(__hash__); INIT_PY_NAME(__cmp__); INIT_PY_NAME(__var_size__); INIT_PY_NAME(__init__); INIT_PY_NAME(__getinitargs__); INIT_PY_NAME(__getstate__); INIT_PY_NAME(__setstate__); INIT_PY_NAME(__dict__); INIT_PY_NAME(class_); INIT_PY_NAME(__module__); #undef INIT_PY_NAME } static PyObject * CallMethodO(PyObject *self, PyObject *name, PyObject *args, PyObject *kw) { if (! args && PyErr_Occurred()) return NULL; UNLESS(name=PyObject_GetAttr(self,name)) return NULL; ASSIGN(name,PyEval_CallObjectWithKeywords(name,args,kw)); if (args) Py_DECREF(args); return name; } #define Build Py_BuildValue /* CMethod objects: */ typedef struct { PyObject_HEAD PyTypeObject *type; PyObject *self; char *name; PyCFunction meth; int flags; char *doc; } CMethod; staticforward PyTypeObject CMethodType; #define CMethod_Check(O) ((O)->ob_type==&CMethodType) #define UnboundCMethod_Check(O) \ ((O)->ob_type==&CMethodType && ! ((CMethod*)(O))->self) #define AsCMethod(O) ((CMethod*)(O)) #define CMETHOD(O) ((CMethod*)(O)) #define PMethod PyECMethodObject #define PMethodType PyECMethodObjectType staticforward PyTypeObject PMethodType; #define PMethod_Check(O) ((O)->ob_type==&PMethodType) #define UnboundPMethod_Check(O) \ ((O)->ob_type==&PMethodType && ! ((PMethod*)(O))->self) #define UnboundEMethod_Check(O) \ (((O)->ob_type==&PMethodType ||(O)->ob_type==&CMethodType) \ && ! ((PMethod*)(O))->self) #define PMETHOD(O) ((PMethod*)(O)) static PyObject * #ifdef HAVE_STDARG_PROTOTYPES /* VARARGS 2 */ JimErr_Format(PyObject *ErrType, char *stringformat, char *format, ...) #else /* VARARGS */ JimErr_Format(va_alist) va_dcl #endif { va_list va; PyObject *args=0, *retval=0; #ifdef HAVE_STDARG_PROTOTYPES va_start(va, format); #else PyObject *ErrType; char *stringformat, *format; va_start(va); ErrType = va_arg(va, PyObject *); stringformat = va_arg(va, char *); format = va_arg(va, char *); #endif if (format) args = Py_VaBuildValue(format, va); va_end(va); if (format && ! args) return NULL; if (stringformat && !(retval=PyString_FromString(stringformat))) return NULL; if (retval) { if (args) { PyObject *v; v=PyString_Format(retval, args); Py_DECREF(retval); Py_DECREF(args); if (! v) return NULL; retval=v; } } else if (args) retval=args; else { PyErr_SetObject(ErrType,Py_None); return NULL; } PyErr_SetObject(ErrType,retval); Py_DECREF(retval); return NULL; } static PyObject * #ifdef HAVE_STDARG_PROTOTYPES /* VARARGS 2 */ JimString_Build(char *out_format, char *build_format, ...) #else /* VARARGS */ JimString_Build(va_alist) va_dcl #endif { va_list va; PyObject *args, *retval, *fmt; #ifdef HAVE_STDARG_PROTOTYPES va_start(va, build_format); #else char *build_format; char *out_format; va_start(va); out_format = va_arg(va, char *); build_format = va_arg(va, char *); #endif if (build_format) args = Py_VaBuildValue(build_format, va); else args = PyTuple_New(0); va_end(va); if (! args) return NULL; if (! PyTuple_Check(args)) { PyObject *a; a=PyTuple_New(1); if (! a) return NULL; if (PyTuple_SetItem(a,0,args) == -1) return NULL; args=a; } fmt = PyString_FromString(out_format); retval = PyString_Format(fmt, args); Py_DECREF(args); Py_DECREF(fmt); return retval; } static int CMethod_issubclass(PyExtensionClass *sub, PyExtensionClass *type) { int i,l; PyObject *t; if (sub==type) return 1; if (! sub->bases) return 0; l=PyTuple_Size(sub->bases); for (i=0; i < l; i++) { t=PyTuple_GET_ITEM(sub->bases, i); if (t==(PyObject*)type) return 1; if (ExtensionClass_Check(t) && AsExtensionClass(t)->bases && CMethod_issubclass(AsExtensionClass(t),type) ) return 1; } return 0; } #define Subclass_Check(C1,C2) \ CMethod_issubclass((PyExtensionClass *)(C1), (PyExtensionClass *)(C2)) #define SubclassInstance_Check(C1,C2) \ CMethod_issubclass((PyExtensionClass *)((C1)->ob_type), \ (PyExtensionClass *)(C2)) static CMethod *freeCMethod=0; static PyObject * newCMethod(PyExtensionClass *type, PyObject *inst, char *name, PyCFunction meth, int flags, char *doc) { CMethod *self; ALLOC_FREE(CMethod); Py_INCREF(type); Py_XINCREF(inst); self->type=(PyTypeObject*)type; self->self=inst; self->name=name; self->meth=meth; self->flags=flags; self->doc=doc; return (PyObject*)self; } static CMethod * bindCMethod(CMethod *m, PyObject *inst) { CMethod *self; UNLESS(inst->ob_type==m->type || (ExtensionInstance_Check(inst) && SubclassInstance_Check(inst,m->type)) || ((m->flags & METH_CLASS_METHOD) && ExtensionClass_Check(inst)) ) { Py_INCREF(m); return m; } ALLOC_FREE(CMethod); Py_INCREF(inst); Py_INCREF(m->type); self->type=m->type; self->self=inst; self->name=m->name; self->meth=m->meth; self->flags=m->flags; self->doc=m->doc; return self; } static void CMethod_dealloc(CMethod *self) { #ifdef TRACE_DEALLOC fprintf(stderr,"Deallocating C method %s\n", self->name); #endif Py_XDECREF(self->type); Py_XDECREF(self->self); self->self=(PyObject*)freeCMethod; freeCMethod=self; } typedef PyObject *(*call_by_name_type)(PyObject*,PyObject*,PyObject*, PyTypeObject*); typedef PyObject *(*by_name_type)(PyObject*,PyObject*, PyTypeObject*); static PyObject * call_cmethod(CMethod *self, PyObject *inst, PyObject *args, PyObject *kw) { if (!(self->flags & METH_VARARGS)) { int size = PyTuple_Size(args); if (size == 1) args = PyTuple_GET_ITEM(args, 0); else if (size == 0) args = NULL; } if (self->flags & METH_KEYWORDS) { if (self->flags & METH_BY_NAME) return (*(call_by_name_type)self->meth)(inst, args, kw, self->type); else return (*(PyCFunctionWithKeywords)self->meth)(inst, args, kw); } else if (self->flags & METH_BY_NAME) return (*(by_name_type)self->meth)(inst, args, self->type); else { if (kw != NULL && PyDict_Size(kw) != 0) { PyErr_SetString(PyExc_TypeError, "this function takes no keyword arguments"); return NULL; } return (*self->meth)(inst, args); } } static char *hook_mark="C method being called through a hook."; static PyObject * callCMethodWithHook(CMethod *self, PyObject *inst, PyObject *args, PyObject *kw) { PyObject *hook, *m; UNLESS(m=newCMethod(AsExtensionClass(self->type), inst, self->name, self->meth, self->flags, hook_mark)) return NULL; if ((hook=PyObject_GetAttr(inst,py__call_method__))) { if ((CMethod_Check(hook) && CMETHOD(hook)->meth==self->meth) || (PMethod_Check(hook) && CMethod_Check(PMETHOD(hook)->meth) && CMETHOD(PMETHOD(hook)->meth)->meth==self->meth) ) { /* Oops, we are already calling the hook! */ Py_DECREF(hook); return PyEval_CallObjectWithKeywords(m,args,kw); } if (kw) ASSIGN(hook,PyObject_CallFunction(hook,"OOO",m,args,kw)); else ASSIGN(hook,PyObject_CallFunction(hook,"OO",m,args)); } else { PyErr_Clear(); hook=PyEval_CallObjectWithKeywords(m,args,kw); } Py_DECREF(m); return hook; } static PyObject * CMethod_call(CMethod *self, PyObject *args, PyObject *kw) { int size; if (self->self) { if (HasMethodHook(self->self) && self->doc != hook_mark /* This check prevents infinite recursion */ ) return callCMethodWithHook(self,self->self,args,kw); return call_cmethod(self,self->self,args,kw); } if ((size=PyTuple_Size(args)) > 0) { PyObject *first=0; UNLESS(first=PyTuple_GET_ITEM(args, 0)) return NULL; if ( first->ob_type==self->type || (ExtensionInstance_Check(first) && CMethod_issubclass(ExtensionClassOf(first), AsExtensionClass(self->type)) ) ) { PyObject *rest=0; if (HasMethodHook(first) && self->doc != hook_mark /* This check prevents infinite recursion */ ) return callCMethodWithHook(self,first,args,kw); UNLESS(rest=PySequence_GetSlice(args,1,size)) return NULL; ASSIGN(rest,call_cmethod(self,first,rest,kw)); return rest; } } return JimErr_Format(PyExc_TypeError, "unbound C method must be called with %s 1st argument", "s", self->type->tp_name); } static PyObject * CMethod_getattro(CMethod *self, PyObject *oname) { PyObject *r; if (PyString_Check(oname)) { char *name; UNLESS(name=PyString_AsString(oname)) return NULL; if (name[0] != '_' && name[0] && name[1] != '_' && PyEval_GetRestricted()) { PyErr_SetString(PyExc_RuntimeError, "function attributes not accessible in restricted mode"); return NULL; } if (strcmp(name,"__name__")==0 || strcmp(name,"func_name")==0 ) return PyString_FromString(self->name); if (strcmp(name,"func_code")==0 || strcmp(name,"im_func")==0) { Py_INCREF(self); return (PyObject *)self; } if (strcmp(name,"__doc__")==0 || strcmp(name,"func_doc")==0) { if (self->doc) return PyString_FromString(self->doc); else return PyString_FromString(""); } if (strcmp(name,"im_class")==0) { Py_INCREF(self->type); return (PyObject *)self->type; } if (strcmp(name,"im_self")==0) { if (self->self) r=self->self; else r=Py_None; Py_INCREF(r); return r; } } if (self->self) /* Psuedo attributes */ { UNLESS(oname=Py_BuildValue("sO", self->name, oname)) return NULL; UNLESS_ASSIGN(oname,PyString_Format(concat_fmt, oname)) return NULL; r=PyObject_GetAttr(self->self, oname); Py_DECREF(oname); return r; } PyErr_SetObject(PyExc_AttributeError, oname); return NULL; } static int CMethod_setattro(CMethod *self, PyObject *oname, PyObject *v) { int r; if (self->self && ! PyEval_GetRestricted()) /* Psuedo attributes */ { UNLESS(oname=Py_BuildValue("sO", self->name, oname)) return -1; UNLESS_ASSIGN(oname,PyString_Format(concat_fmt, oname)) return -1; r=PyObject_SetAttr(self->self, oname, v); Py_DECREF(oname); return r; } PyErr_SetObject(PyExc_AttributeError, oname); return -1; } static PyTypeObject CMethodType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "CMethod", /*tp_name*/ sizeof(CMethod), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)CMethod_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ 0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)CMethod_call, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)CMethod_getattro, /* tp_getattro */ (setattrofunc)CMethod_setattro, /* tp_setattro */ /* Space for future expansion */ 0L,0L, "Storage manager for unbound C function PyObject data" /* Documentation string */ }; /* PMethod objects: */ static PMethod *freePMethod=0; static PyObject * newPMethod(PyExtensionClass *type, PyObject *meth) { PMethod *self; ALLOC_FREE(PMethod); Py_INCREF(type); Py_INCREF(meth); self->type=(PyTypeObject*)type; self->self=NULL; self->meth=meth; return (PyObject*)self; } static PyObject * bindPMethod(PMethod *m, PyObject *inst) { PMethod *self; if (NeedsToBeBound(m->meth)) return CallMethodO(m->meth, py__of__, Build("(O)", inst), NULL); if (m->ob_refcnt==1) { Py_INCREF(inst); ASSIGN(m->self, inst); Py_INCREF(m); return (PyObject*)m; } ALLOC_FREE(PMethod); Py_INCREF(inst); Py_INCREF(m->type); self->type=m->type; self->self=inst; self->meth=m->meth; return (PyObject*)self; } static PyObject * PMethod_New(PyObject *meth, PyObject *inst) { if (PMethod_Check(meth)) return bindPMethod((PMethod*)meth,inst); UNLESS(ExtensionInstance_Check(inst)) return JimErr_Format(PyExc_TypeError, "Attempt to use %s as method for %s, which is " "not an extension class instance.", "OO",meth,inst); if ((meth=newPMethod(ExtensionClassOf(inst), meth))) UNLESS_ASSIGN(((PMethod*)meth)->self,inst) return NULL; Py_INCREF(inst); return meth; } static void PMethod_dealloc(PMethod *self) { #ifdef TRACE_DEALLOC fprintf(stderr,"Deallocating PM ... "); #endif Py_XDECREF(self->type); Py_XDECREF(self->self); self->self=(PyObject*)freePMethod; freePMethod=self; #ifdef TRACE_DEALLOC fprintf(stderr," Done Deallocating PM\n"); #endif } static PyObject * callMethodWithPossibleHook(PyObject *inst, PyObject *meth, PyObject *args, PyObject *kw) { if (HasMethodHook(inst)) { PyObject *hook; if ((hook=PyObject_GetAttr(inst,py__call_method__))) { if (PMethod_Check(hook) && ((PMethod*)hook)->meth==meth) { /* Oops, we are already calling the hook! */ Py_DECREF(hook); return PyEval_CallObjectWithKeywords(meth,args,kw); } if (kw) ASSIGN(hook,PyObject_CallFunction(hook,"OOO",meth,args,kw)); else ASSIGN(hook,PyObject_CallFunction(hook,"OO",meth,args)); return hook; } PyErr_Clear(); } return PyEval_CallObjectWithKeywords(meth,args,kw); } static PyObject * call_PMethod(PMethod *self, PyObject *inst, PyObject *args, PyObject *kw) { PyObject *a; if (CMethod_Check(self->meth) && CMETHOD(self->meth)->type->tp_basicsize == sizeof(PyPureMixinObject) && ! (CMETHOD(self->meth)->self) ) { /* Special HACK^H^H^Hcase: we are wrapping an abstract unbound CMethod */ if (HasMethodHook(inst) && /* This check prevents infinite recursion: */ CMETHOD(self->meth)->doc != hook_mark ) return callCMethodWithHook(CMETHOD(self->meth),inst,args,kw); return call_cmethod(CMETHOD(self->meth),inst,args,kw); } else { a=Py_BuildValue("(O)",inst); if (a) ASSIGN(a,PySequence_Concat(a,args)); if (a) ASSIGN(a,callMethodWithPossibleHook(inst,self->meth,a,kw)); return a; } } static PyObject * PMethod_call(PMethod *self, PyObject *args, PyObject *kw) { int size; if (self->self) return call_PMethod(self,self->self,args,kw); if ((size=PyTuple_Size(args)) > 0) { PyObject *first=0, *ftype=0; UNLESS(first=PyTuple_GET_ITEM(args, 0)) return NULL; if (! self->type || ((ftype=PyObject_GetAttr(first,py__class__)) && (ftype==(PyObject*)self->type || (ExtensionClass_Check(ftype) && CMethod_issubclass(AsExtensionClass(ftype), AsExtensionClass(self->type)) ) ) ) ) { if (NeedsToBeBound(self->meth)) { PyObject *r, *rest; UNLESS(r=CallMethodO(self->meth,py__of__,Build("(O)", first), NULL)) return NULL; UNLESS(rest=PySequence_GetSlice(args,1,size)) { Py_DECREF(r); return NULL; } ASSIGN(r,callMethodWithPossibleHook(first,r,rest,kw)); Py_DECREF(rest); return r; } Py_DECREF(ftype); return callMethodWithPossibleHook(first,self->meth,args,kw); } Py_XDECREF(ftype); } return JimErr_Format(PyExc_TypeError, "unbound Python method must be called with %s" " 1st argument", "s", self->type->tp_name); } static PyObject * PMethod_getattro(PMethod *self, PyObject *oname) { PyObject *r; if (PyString_Check(oname)) { char *name; UNLESS(name=PyString_AsString(oname)) return NULL; if (name[0]=='_' && name[1]=='_') { if (strcmp(name+2,"name__")==0) return PyObject_GetAttrString(self->meth,"__name__"); if (strcmp(name+2,"doc__")==0) return PyObject_GetAttrString(self->meth,"__doc__"); } else if (PyEval_GetRestricted()) { PyErr_SetString(PyExc_RuntimeError, "function attributes not accessible in restricted mode"); return NULL; } else if (name[0]=='f' && name[1]=='u' && name[2]=='n' && name[3]=='c' && name[4]=='_') { if (strcmp(name+5,"name")==0 ) return PyObject_GetAttrString(self->meth,"__name__"); if (strcmp(name+5,"doc")==0) return PyObject_GetAttrString(self->meth,"__doc__"); } if (*name++=='i' && *name++=='m' && *name++=='_') { if (strcmp(name,"func")==0) { Py_INCREF(self->meth); return self->meth; } if (strcmp(name,"class")==0) { Py_INCREF(self->type); return (PyObject *)self->type; } if (strcmp(name,"self")==0) { if (self->self) r=self->self; else r=Py_None; Py_INCREF(r); return r; } } } if (self->meth) { if ((r=PyObject_GetAttr(self->meth, oname))) return r; PyErr_Clear(); if (self->self) /* Psuedo attrs */ { PyObject *myname; UNLESS(myname=PyObject_GetAttr(self->meth, py__name__)) return NULL; oname=Py_BuildValue("OO", myname, oname); Py_DECREF(myname); UNLESS(oname) return NULL; UNLESS_ASSIGN(oname,PyString_Format(concat_fmt, oname)) return NULL; r=PyObject_GetAttr(self->self, oname); Py_DECREF(oname); return r; } } PyErr_SetObject(PyExc_AttributeError, oname); return NULL; return PyObject_GetAttr(self->meth, oname); } static int PMethod_setattro(PMethod *self, PyObject *oname, PyObject *v) { int r; PyObject *spam; if (self->meth) { if ((spam=PyObject_GetAttr(self->meth, oname))) { Py_DECREF(spam); PyErr_SetString(PyExc_TypeError, "Attempt to overwrite shared method attribute"); return -1; } else PyErr_Clear(); if (self->self && ! PyEval_GetRestricted()) /* Psuedo attrs */ { PyObject *myname; UNLESS(myname=PyObject_GetAttr(self->meth, py__name__)) return -1; oname=Py_BuildValue("OO", myname, oname); Py_DECREF(myname); UNLESS(oname) return -1; UNLESS_ASSIGN(oname,PyString_Format(concat_fmt, oname)) return -1; r=PyObject_SetAttr(self->self, oname, v); Py_DECREF(oname); return r; } } PyErr_SetObject(PyExc_AttributeError, oname); return -1; } static PyTypeObject PMethodType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Python Method", /*tp_name*/ sizeof(PMethod), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)PMethod_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ 0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)PMethod_call, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)PMethod_getattro, /*tp_getattro*/ (setattrofunc)PMethod_setattro, /* tp_setattro */ /* Space for future expansion */ 0L,0L, "Storage manager for unbound C function PyObject data" /* Documentation string */ }; static PyObject *CCL_getattr(PyExtensionClass*,PyObject*,int); /* Special Methods */ #define UNARY_OP(OP) \ static PyObject * \ OP ## _by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { \ UNLESS(PyArg_ParseTuple(args,"")) return NULL; \ return ob_type->tp_ ## OP(self); \ } UNARY_OP(repr) UNARY_OP(str) static PyObject * hash_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { long r; UNLESS(PyArg_ParseTuple(args,"")) return NULL; UNLESS(-1 != (r=ob_type->tp_hash(self))) return NULL; return PyInt_FromLong(r); } static PyObject * call_by_name(PyObject *self, PyObject *args, PyObject *kw, PyTypeObject *ob_type) { return ob_type->tp_call(self,args,kw); } static PyObject * compare_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { PyObject *other; UNLESS(PyArg_ParseTuple(args,"O", &other)) return NULL; return PyInt_FromLong(ob_type->tp_compare(self,other)); } static PyObject * getattr_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { char *name; UNLESS(PyArg_ParseTuple(args,"s",&name)) return NULL; return ob_type->tp_getattr(self,name); } static PyObject * setattr_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { char *name; PyObject *v; UNLESS(PyArg_ParseTuple(args,"sO",&name,&v)) return NULL; UNLESS(-1 != ob_type->tp_setattr(self,name,v)) return NULL; Py_INCREF(Py_None); return Py_None; } static PyObject * getattro_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { PyObject *name; UNLESS(PyArg_ParseTuple(args,"O",&name)) return NULL; return ob_type->tp_getattro(self,name); } static PyObject * setattro_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { PyObject *name; PyObject *v; UNLESS(PyArg_ParseTuple(args,"OO",&name,&v)) return NULL; UNLESS(-1 != ob_type->tp_setattro(self,name,v)) return NULL; Py_INCREF(Py_None); return Py_None; } static PyObject * length_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { long r; UNLESS(PyArg_ParseTuple(args,"")) return NULL; if (ob_type->tp_as_sequence) { UNLESS(-1 != (r=ob_type->tp_as_sequence->sq_length(self))) return NULL; } else { UNLESS(-1 != (r=ob_type->tp_as_mapping->mp_length(self))) return NULL; } return PyInt_FromLong(r); } static PyObject * getitem_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { PyObject *key; UNLESS(PyArg_ParseTuple(args,"O",&key)) return NULL; if (ob_type->tp_as_mapping) return ob_type->tp_as_mapping->mp_subscript(self,key); else { int index; UNLESS(-1 != (index=PyInt_AsLong(key))) return NULL; return ob_type->tp_as_sequence->sq_item(self,index); } } static PyCFunction item_by_name=(PyCFunction)getitem_by_name; static PyCFunction subscript_by_name=(PyCFunction)getitem_by_name; static PyObject * setitem_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { PyObject *key, *v; long r; UNLESS(PyArg_ParseTuple(args,"OO",&key,&v)) return NULL; if (ob_type->tp_as_mapping) r=ob_type->tp_as_mapping->mp_ass_subscript(self,key,v); else { int index; UNLESS(-1 != (index=PyInt_AsLong(key))) return NULL; r=ob_type->tp_as_sequence->sq_ass_item(self,index,v); } if (r < 0) return NULL; Py_INCREF(Py_None); return Py_None; } static PyCFunction ass_item_by_name=(PyCFunction)setitem_by_name; static PyCFunction ass_subscript_by_name=(PyCFunction)setitem_by_name; static PyObject * slice_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { int i1,i2; UNLESS(PyArg_ParseTuple(args,"ii",&i1,&i2)) return NULL; return ob_type->tp_as_sequence->sq_slice(self,i1,i2); } static PyObject * ass_slice_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { int i1,i2; PyObject *v; long r; UNLESS(PyArg_ParseTuple(args,"iiO",&i1,&i2,&v)) return NULL; r=ob_type->tp_as_sequence->sq_ass_slice(self,i1,i2,v); if (r<0) return NULL; Py_INCREF(Py_None); return Py_None; } static PyObject * concat_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { PyObject *other; UNLESS(PyArg_ParseTuple(args,"O",&other)) return NULL; return ob_type->tp_as_sequence->sq_concat(self,other); } static PyObject * repeat_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { int r; UNLESS(PyArg_ParseTuple(args,"i",&r)) return NULL; return ob_type->tp_as_sequence->sq_repeat(self,r); } #define BINOP(OP,AOP) \ static PyObject * \ OP ## _by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { \ PyObject *v; \ UNLESS(PyArg_ParseTuple(args,"O",&v)) return NULL; \ return ob_type->tp_as_number->nb_ ## OP(self, v); \ } BINOP(add,Add) BINOP(subtract,Subtract) BINOP(multiply,Multiply) BINOP(divide,Divide) BINOP(remainder,Remainder) BINOP(divmod,Divmod) static PyObject * power_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { PyObject *v, *z=NULL; UNLESS(PyArg_ParseTuple(args,"O|O",&v,&z)) return NULL; return ob_type->tp_as_number->nb_power(self,v,z); } #define UNOP(OP) \ static PyObject * \ OP ## _by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { \ UNLESS(PyArg_ParseTuple(args,"")) return NULL; \ return ob_type->tp_as_number->nb_ ## OP(self); \ } UNOP(negative) UNOP(positive) UNOP(absolute) static PyObject * nonzero_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { long r; UNLESS(PyArg_ParseTuple(args,"")) return NULL; UNLESS(-1 != (r=ob_type->tp_as_number->nb_nonzero(self))) return NULL; return PyInt_FromLong(r); } UNOP(invert) BINOP(lshift,Lshift) BINOP(rshift,Rshift) BINOP(and,And) BINOP(or,Or) BINOP(xor,Xor) static PyObject * coerce_by_name(PyObject *self, PyObject *args, PyTypeObject *ob_type) { PyObject *v; int r; UNLESS(PyArg_ParseTuple(args,"O", &v)) return NULL; UNLESS(-1 != (r=ob_type->tp_as_number->nb_coerce(&self,&v))) { Py_INCREF(Py_None); return Py_None; } args=Py_BuildValue("OO",self,v); Py_DECREF(self); Py_DECREF(v); return args; } UNOP(long) UNOP(int) UNOP(float) UNOP(oct) UNOP(hex) #define FILLENTRY(T,MN,N,F,D) if (T ## _ ## MN) { \ UNLESS(-1 != PyMapping_SetItemString(dict,"__" # N "__", \ newCMethod(type, NULL, "__" # N "__", \ (PyCFunction)MN ## _by_name, F | METH_BY_NAME, # D))) \ goto err; } static PyObject * getBaseDictionary(PyExtensionClass *type) { PyNumberMethods *nm; PySequenceMethods *sm; PyMappingMethods *mm; PyObject *dict; UNLESS(dict=type->class_dictionary) UNLESS(dict=PyDict_New()) return NULL; FILLENTRY(type->tp, repr, repr, METH_VARARGS, "convert to an expression string"); FILLENTRY(type->tp, hash, hash, METH_VARARGS, "compute a hash value"); FILLENTRY(type->tp, call, call, METH_VARARGS | METH_KEYWORDS, "call as a function"); FILLENTRY(type->tp, compare, comp, METH_VARARGS, "compare with another object"); FILLENTRY(type->tp, getattr, getattr, METH_VARARGS, "Get an attribute"); FILLENTRY(type->tp, setattr, setattr, METH_VARARGS, "Set an attribute"); FILLENTRY(type->tp, getattro, getattr, METH_VARARGS, "Get an attribute"); FILLENTRY(type->tp, setattro, setattr, METH_VARARGS, "Set an attribute"); if ((sm=type->tp_as_sequence)) { FILLENTRY(sm->sq, length, len, METH_VARARGS, "Get the object length"); FILLENTRY(sm->sq, repeat, mul, METH_VARARGS, "Get a new object that is the object repeated."); FILLENTRY(sm->sq, item, getitem, METH_VARARGS, "Get an item"); FILLENTRY(sm->sq, slice, getslice, METH_VARARGS, "Get a slice"); FILLENTRY(sm->sq, ass_item, setitem, METH_VARARGS, "Assign an item"); FILLENTRY(sm->sq, ass_slice, setslice, METH_VARARGS, "Assign a slice"); } if ((mm=type->tp_as_mapping)) { FILLENTRY(mm->mp, length, len, METH_VARARGS, "Get the object length"); FILLENTRY(mm->mp, subscript, getitem, METH_VARARGS, "Get an item"); FILLENTRY(mm->mp, ass_subscript, setitem, METH_VARARGS, "Assign an item"); } if ((nm=type->tp_as_number) != NULL) { FILLENTRY(nm->nb, add, add, METH_VARARGS, "Add to another"); FILLENTRY(nm->nb, subtract, sub, METH_VARARGS, "Subtract another"); FILLENTRY(nm->nb, multiply, mul, METH_VARARGS, "Multiple by another"); FILLENTRY(nm->nb, divide, div, METH_VARARGS, "Divide by another"); FILLENTRY(nm->nb, remainder, mod, METH_VARARGS, "Compute a remainder"); FILLENTRY(nm->nb, power, pow, METH_VARARGS, "Raise to a power"); FILLENTRY(nm->nb, divmod, divmod, METH_VARARGS, "Compute the whole result and remainder of dividing\n" "by another"); FILLENTRY(nm->nb, negative, neg, METH_VARARGS, "Get the negative value."); FILLENTRY(nm->nb, positive, pos, METH_VARARGS, "Compute positive value"); FILLENTRY(nm->nb, absolute, abs, METH_VARARGS, "Compute absolute value"); FILLENTRY(nm->nb, nonzero, nonzero, METH_VARARGS, "Determine whether nonzero"); FILLENTRY(nm->nb, invert, inv, METH_VARARGS, "Compute inverse"); FILLENTRY(nm->nb, lshift, lshift, METH_VARARGS, "Shist left"); FILLENTRY(nm->nb, rshift, rshift, METH_VARARGS, "Shist right"); FILLENTRY(nm->nb, and, and, METH_VARARGS, "bitwize logical and"); FILLENTRY(nm->nb, or, or, METH_VARARGS, "bitwize logical or"); FILLENTRY(nm->nb, xor, xor, METH_VARARGS, "bitwize logical excusive or"); FILLENTRY(nm->nb, coerce, coerce, METH_VARARGS, "Coerce woth another to a common type"); FILLENTRY(nm->nb, int, int, METH_VARARGS, "Convert to an integer"); FILLENTRY(nm->nb, long, long, METH_VARARGS, "Convert to an infinite-precision integer"); FILLENTRY(nm->nb, float, float, METH_VARARGS, "Convert to floating point number"); FILLENTRY(nm->nb, oct, oct, METH_VARARGS, "Convert to an octal string"); FILLENTRY(nm->nb, hex, hex, METH_VARARGS, "Convert to a hexadecimal string"); } if ((sm=type->tp_as_sequence)) { FILLENTRY(sm->sq, concat, add, METH_VARARGS, "Concatinate the object with another"); } return dict; err: Py_DECREF(dict); return NULL; } #undef UNARY_OP #undef BINOP #undef UNOP #undef FILLENTRY PyObject * EC_reduce(PyObject *self, PyObject *args) { PyObject *state=0; if ((args=PyObject_GetAttr(self,py__getinitargs__))) { UNLESS_ASSIGN(args,PyEval_CallObject(args,NULL)) return NULL; UNLESS_ASSIGN(args,PySequence_Tuple(args)) return NULL; } else { PyErr_Clear(); if (ExtensionClassOf(self)->class_flags & EXTENSIONCLASS_BASICNEW_FLAG) { args=Py_None; Py_INCREF(args); } else args=PyTuple_New(0); } if ((state=PyObject_GetAttr(self,py__getstate__))) { UNLESS_ASSIGN(state,PyEval_CallObject(state,NULL)) goto err; ASSIGN(args,Py_BuildValue("OOO", self->ob_type, args, state)); Py_DECREF(state); } else { PyErr_Clear(); if ((state=PyObject_GetAttr(self, py__dict__))) { ASSIGN(args,Py_BuildValue("OOO", self->ob_type, args, state)); Py_DECREF(state); } else { PyErr_Clear(); ASSIGN(args, Py_BuildValue("OO", self->ob_type, args)); } } return args; err: Py_DECREF(args); return NULL; } static PyObject * inheritedAttribute(PyExtensionClass *self, PyObject *args) { PyObject *name; UNLESS(PyArg_ParseTuple(args,"O!",&PyString_Type, &name)) return NULL; return CCL_getattr(AsExtensionClass(self),name,1); } static PyObject * basicnew(PyExtensionClass *self, PyObject *args) { PyObject *inst=0; typedef struct { PyObject_VAR_HEAD } PyVarObject__; if (! self->tp_dealloc) { PyErr_SetString(PyExc_TypeError, "Attempt to create instance of an abstract type"); return NULL; } UNLESS(self->class_flags & EXTENSIONCLASS_BASICNEW_FLAG) return PyObject_CallObject(OBJECT(self), NULL); if (self->tp_itemsize) { /* We have a variable-sized object, we need to get it's size */ PyObject *var_size; int size; UNLESS(var_size=CCL_getattr(self, py__var_size__, 0)) return NULL; UNLESS_ASSIGN(var_size,PyObject_CallObject(var_size,NULL)) return NULL; size=PyInt_AsLong(var_size); if (PyErr_Occurred()) return NULL; UNLESS(inst=PyObject_NEW_VAR(PyObject,(PyTypeObject *)self, size)) return NULL; memset(inst,0,self->tp_basicsize+self->tp_itemsize*size); ((PyVarObject__*)inst)->ob_size=size; } else { UNLESS(inst=PyObject_NEW(PyObject,(PyTypeObject *)self)) return NULL; memset(inst,0,self->tp_basicsize); } inst->ob_refcnt=1; inst->ob_type=(PyTypeObject *)self; Py_INCREF(self); if (ClassHasInstDict(self)) UNLESS(INSTANCE_DICT(inst)=PyDict_New()) goto err; if (self->bases && subclass_watcher && ! PyObject_CallMethod(subclass_watcher,"created","O",inst)) PyErr_Clear(); return inst; err: Py_DECREF(inst); return NULL; } struct PyMethodDef ECI_methods[] = { {"__reduce__",(PyCFunction)EC_reduce, METH_VARARGS, "__reduce__() -- Reduce an instance into it's class and creation data" }, {"inheritedAttribute",(PyCFunction)inheritedAttribute, METH_VARARGS | METH_CLASS_METHOD, "inheritedAttribute(class,name) -- Get an inherited attribute\n\n" "Get an attribute that would be inherited if the given (extension)\n" "class did not define it. This method is used when overriding\n" "inherited methods. It provides 2 advantages over accessing\n" "\n" "attributes directly through a superclass:\n" "\n" "1. The superclass need not be known,\n" "\n" "2. The superclass may be a Python class. Without this method, it would\n" " be possible to override methods inherited from python classes because\n" " unbound methods gotten from Python classes cannot be called with \n" " extension class instances. \n" }, {"__basicnew__",(PyCFunction)basicnew, METH_VARARGS | METH_CLASS_METHOD, "__basicnew__() -- return a new uninitialized instance" }, {NULL, NULL} /* sentinel */ }; static PyObject * initializeBaseExtensionClass(PyExtensionClass *self) { static PyMethodChain top = { ECI_methods, NULL }; PyMethodChain *chain; PyObject *dict; int abstract; /* Is this an abstract, or at least a dataless, class? */ abstract=self->tp_basicsize == sizeof(PyPureMixinObject); self->ob_type=(PyTypeObject*)&ECType; Py_INCREF(self->ob_type); UNLESS(dict=self->class_dictionary=getBaseDictionary(self)) return NULL; if (self->tp_name) { PyObject *name; UNLESS(name=PyString_FromString(self->tp_name)) goto err; if (0 > PyMapping_SetItemString(dict,"__doc__",name)) goto err; Py_DECREF(name); } else if (0 > PyMapping_SetItemString(dict,"__doc__",Py_None)) goto err; if (&self->methods) chain=&(self->methods); else chain=⊤ while (1) { PyMethodDef *ml = chain->methods; for (; ml && ml->ml_name != NULL; ml++) { if (ml->ml_meth) { if (! PyMapping_HasKeyString(dict,ml->ml_name)) { PyObject *m; /* Note that we create a circular reference here. I suppose that this isn't so bad, since this is probably a static thing anyway. Still, it is a bit troubling. Oh well. */ if (ml->ml_flags & METH_CLASS_METHOD) { UNLESS(m=newCMethod( AsExtensionClass(self->ob_type), NULL, ml->ml_name, ml->ml_meth, ml->ml_flags, ml->ml_doc)) return NULL; } else { UNLESS(m=newCMethod(self, NULL, ml->ml_name, ml->ml_meth, ml->ml_flags, ml->ml_doc)) return NULL; if (abstract) UNLESS_ASSIGN(m, newPMethod(self, m)) return NULL; } if (PyMapping_SetItemString(dict,ml->ml_name,m) < 0) return NULL; } } else if (ml->ml_doc && *(ml->ml_doc)) { /* No actual meth, this is probably to hook a doc string onto a special method. */ PyObject *m; if ((m=PyMapping_GetItemString(dict,ml->ml_name))) { if (m->ob_type==&CMethodType) ((CMethod *)(m))->doc=ml->ml_doc; } else PyErr_Clear(); } } if (chain == &top) break; UNLESS(chain=chain->link) chain=⊤ } return (PyObject*)self; err: Py_DECREF(dict); return NULL; } static void CCL_dealloc(PyExtensionClass *self) { #ifdef TRACE_DEALLOC fprintf(stderr,"Deallocating %s\n", self->tp_name); #endif Py_XDECREF(self->class_dictionary); if (self->bases) { /* If we are a subclass, then we strduped our name */ free(self->tp_name); /* And we allocated our own protocol structures */ if (self->tp_as_number) free(self->tp_as_number); if (self->tp_as_sequence) free(self->tp_as_sequence); if (self->tp_as_mapping) free(self->tp_as_mapping); Py_DECREF(self->bases); } if (((PyExtensionClass*)self->ob_type) != self) Py_XDECREF(self->ob_type); PyMem_DEL(self); } static PyObject * ExtensionClass_FindInstanceAttribute(PyObject *inst, PyObject *oname, char *name) { /* Look up an attribute for an instance from: The instance dictionary, The class dictionary, or The base objects. */ PyObject *r=0; PyExtensionClass *self; if (! name) return NULL; self=(PyExtensionClass*)(inst->ob_type); if (*name=='_' && name[1]=='_') { char *n=name+2; if (*n == 'c' && strcmp(n,"class__")==0) { Py_INCREF(self); return (PyObject*)self; } if (ClassHasInstDict(self) && *n=='d' && strcmp(n,"dict__")==0) { r = INSTANCE_DICT(inst); Py_INCREF(r); return r; } } if (ClassHasInstDict(self)) { r= INSTANCE_DICT(inst); if ((r = PyObject_GetItem(r,oname)) && NeedsToBeBound(r)) { ASSIGN(r, CallMethodO(r, py__of__, Build("(O)", inst), NULL)); UNLESS(r) return NULL; } } UNLESS(r) { if (*name=='_' && name[1]=='_' && name[2]=='b' && strcmp(name+2,"bases__")==0) { PyErr_SetObject(PyExc_AttributeError, oname); return NULL; } PyErr_Clear(); UNLESS(r=CCL_getattr(self,oname,0)) return NULL; /* We got something from our class, maybe its an unbound method. */ if (UnboundCMethod_Check(r)) ASSIGN(r,(PyObject*)bindCMethod((CMethod*)r,inst)); else if (UnboundPMethod_Check(r)) ASSIGN(r,bindPMethod((PMethod*)r,inst)); } return r; } static PyObject * EC_findiattrs(PyObject *self, char *name) { PyObject *s, *r; UNLESS(s=PyString_FromString(name)) return NULL; r=ExtensionClass_FindInstanceAttribute(self,s,name); Py_DECREF(s); return r; } static PyObject * EC_findiattro(PyObject *self, PyObject *name) { return ExtensionClass_FindInstanceAttribute(self,name, PyString_AsString(name)); } static int subclass_simple_setattr(PyObject *self, char *name, PyObject *v); static PyObject * CCL_getattr(PyExtensionClass *self, PyObject *oname, int look_super) { PyObject *r=0; if (! look_super) r=PyObject_GetItem(self->class_dictionary,oname); UNLESS(r) { if (self->bases) { int n, i; PyObject *c; n=PyTuple_Size(self->bases); for (i=0; i < n; i++) { PyErr_Clear(); c=PyTuple_GET_ITEM(self->bases, i); if (ExtensionClass_Check(c)) r=CCL_getattr(AsExtensionClass(c),oname,0); else r=PyObject_GetAttr(c,oname); if (r) break; } } UNLESS(r) { PyObject *t, *v, *tb; PyErr_Fetch(&t,&v,&tb); if (t==PyExc_KeyError && PyObject_Compare(v,oname) == 0) { Py_DECREF(t); t=PyExc_AttributeError; Py_INCREF(t); } PyErr_Restore(t,v,tb); return NULL; } } if (PyFunction_Check(r) || NeedsToBeBound(r)) ASSIGN(r,newPMethod(self,r)); else if (PyMethod_Check(r) && ! PyMethod_Self(r)) ASSIGN(r,newPMethod(self, PyMethod_Function(r))); return r; } static PyObject * CCL_reduce(PyExtensionClass *self, PyObject *args) { return PyString_FromString(self->tp_name); } PyObject * CCL_getattro(PyExtensionClass *self, PyObject *name) { char *n, *nm=0; PyObject *r; if (PyString_Check(name) && (n=nm=PyString_AS_STRING((PyStringObject*)name))) { if (*n=='_' && *++n=='_') { switch (*++n) { case 's': if (strcmp(n,"safe_for_unpickling__")==0) return PyInt_FromLong(1); break; case 'n': if (strcmp(n,"name__")==0) return PyString_FromString(self->tp_name); break; case 'b': if (strcmp(n,"bases__")==0) { if (self->bases) { Py_INCREF(self->bases); return self->bases; } else return PyTuple_New(0); } break; case 'r': if (strcmp(n,"reduce__")==0) return newCMethod(self,(PyObject*)self, "__reduce__",(PyCFunction)CCL_reduce,0, "__reduce__() -- Reduce the class to a class name"); break; case 'd': if (strcmp(n,"dict__")==0) { Py_INCREF(self->class_dictionary); return self->class_dictionary; } break; case 'c': if (strcmp(n,"class__")==0) { Py_INCREF(self->ob_type); return OBJECT(self->ob_type); } break; } } } if ((r=CCL_getattr(self,name,0))) { if (UnboundCMethod_Check(r) && (AsCMethod(r)->flags & METH_CLASS_METHOD)) ASSIGN(r,(PyObject*)bindCMethod((CMethod*)r,OBJECT(self))); } return r; } static int CCL_setattro(PyExtensionClass *self, PyObject *name, PyObject *v) { if (! v) return PyObject_DelItem(self->class_dictionary, name); if (v && UnboundCMethod_Check(v) && ! (self->class_flags & EXTENSIONCLASS_METHODHOOK_FLAG) ) { char *n; PyNumberMethods *nm; PySequenceMethods *s, *ms; PyMappingMethods *m, *mm; UNLESS(n=PyString_AsString(name)) return -1; if (*n++=='_' && *n++=='_') { #define SET_SPECIAL(C,P) \ if (strcmp(n,#P "__")==0 \ && AsCMethod(v)->meth==(PyCFunction)C ## _by_name \ && Subclass_Check(self,AsCMethod(v)->type)) { \ self->tp_ ## C=AsCMethod(v)->type->tp_ ## C; \ return PyObject_SetItem(self->class_dictionary, name, v); } /* SET_SPECIAL(setattr,setattr); SET_SPECIAL(setattro,setattr); */ SET_SPECIAL(compare,cmp); SET_SPECIAL(hash,hash); SET_SPECIAL(repr,repr); SET_SPECIAL(call,call); SET_SPECIAL(str,str); #undef SET_SPECIAL #define SET_SPECIAL(C,P) \ if (strcmp(n,#P "__")==0 \ && AsCMethod(v)->meth==(PyCFunction)C ## _by_name \ && Subclass_Check(self,AsCMethod(v)->type) \ && (nm=self->tp_as_number)) { \ nm->nb_ ## C=AsCMethod(v)->type->tp_as_number->nb_ ## C; \ return PyObject_SetItem(self->class_dictionary, name, v); } SET_SPECIAL(add,add); SET_SPECIAL(subtract,sub); SET_SPECIAL(multiply,mult); SET_SPECIAL(divide,div); SET_SPECIAL(remainder,mod); SET_SPECIAL(power,pow); SET_SPECIAL(divmod,divmod); SET_SPECIAL(lshift,lshift); SET_SPECIAL(rshift,rshift); SET_SPECIAL(and,and); SET_SPECIAL(or,or); SET_SPECIAL(xor,xor); SET_SPECIAL(coerce,coerce); SET_SPECIAL(negative,neg); SET_SPECIAL(positive,pos); SET_SPECIAL(absolute,abs); SET_SPECIAL(nonzero,nonzero); SET_SPECIAL(invert,inv); SET_SPECIAL(int,int); SET_SPECIAL(long,long); SET_SPECIAL(float,float); SET_SPECIAL(oct,oct); SET_SPECIAL(hex,hex); #undef SET_SPECIAL if (strcmp(n,"len__")==0 && AsCMethod(v)->meth==(PyCFunction)length_by_name && Subclass_Check(self,AsCMethod(v)->type)) { if ((s=self->tp_as_sequence) && (ms=AsCMethod(v)->type->tp_as_sequence) && ms->sq_length) s->sq_length=ms->sq_length; if ((m=self->tp_as_mapping) && (mm=AsCMethod(v)->type->tp_as_mapping) && mm->mp_length) m->mp_length=mm->mp_length; return PyObject_SetItem(self->class_dictionary, name, v); } if (strcmp(n,"getitem__")==0 && AsCMethod(v)->meth==(PyCFunction)getitem_by_name && Subclass_Check(self,AsCMethod(v)->type)) { if ((s=self->tp_as_sequence) && (ms=AsCMethod(v)->type->tp_as_sequence) && ms->sq_item) s->sq_item=ms->sq_item; if ((m=self->tp_as_mapping) && (mm=AsCMethod(v)->type->tp_as_mapping) && mm->mp_subscript) m->mp_subscript=mm->mp_subscript; return PyObject_SetItem(self->class_dictionary, name, v); } if (strcmp(n,"setitem__")==0 && AsCMethod(v)->meth==(PyCFunction)setitem_by_name && Subclass_Check(self,AsCMethod(v)->type)) { if ((s=self->tp_as_sequence) && (ms=AsCMethod(v)->type->tp_as_sequence) && ms->sq_ass_item) s->sq_ass_item=ms->sq_ass_item; if ((m=self->tp_as_mapping) && (mm=AsCMethod(v)->type->tp_as_mapping) && mm->mp_ass_subscript) m->mp_ass_subscript=mm->mp_ass_subscript; return PyObject_SetItem(self->class_dictionary, name, v); } #define SET_SPECIAL(C,P) \ if (strcmp(n,#P "__")==0 \ && AsCMethod(v)->meth==(PyCFunction)C ## _by_name \ && Subclass_Check(self,AsCMethod(v)->type) \ && (s=self->tp_as_sequence)) { \ s->sq_ ## C=AsCMethod(v)->type->tp_as_sequence->sq_ ## C; \ return PyObject_SetItem(self->class_dictionary, name, v); } SET_SPECIAL(slice,getslice); SET_SPECIAL(ass_slice,setslice); SET_SPECIAL(concat,concat); SET_SPECIAL(repeat,repeat); #undef SET_SPECIAL } } return PyObject_SetItem(self->class_dictionary, name, v); } static PyObject * CCL_call(PyExtensionClass *self, PyObject *arg, PyObject *kw) { PyObject *inst=0, *init=0, *args=0; typedef struct { PyObject_VAR_HEAD } PyVarObject__; if (! self->tp_dealloc) { PyErr_SetString(PyExc_TypeError, "Attempt to create instance of an abstract type"); return NULL; } if (self->tp_itemsize) { /* We have a variable-sized object, we need to get it's size */ PyObject *var_size; int size; if ((var_size=CCL_getattr(self,py__var_size__, 0))) { UNLESS_ASSIGN(var_size,PyObject_CallObject(var_size,arg)) return NULL; size=PyInt_AsLong(var_size); if (PyErr_Occurred()) return NULL; } else { UNLESS(-1 != (size=PyTuple_Size(arg))) return NULL; if (size > 0) { var_size=PyTuple_GET_ITEM(arg, 0); if (PyInt_Check(var_size)) size=PyInt_AsLong(var_size); else size=-1; } else size=-1; if (size < 0) { PyErr_SetString(PyExc_TypeError, "object size expected as first argument"); return NULL; } } UNLESS(inst=PyObject_NEW_VAR(PyObject,(PyTypeObject *)self, size)) return NULL; memset(inst,0,self->tp_basicsize+self->tp_itemsize*size); ((PyVarObject__*)inst)->ob_size=size; } else { UNLESS(inst=PyObject_NEW(PyObject,(PyTypeObject *)self)) return NULL; memset(inst,0,self->tp_basicsize); } inst->ob_refcnt=1; inst->ob_type=(PyTypeObject *)self; Py_INCREF(self); if (ClassHasInstDict(self)) UNLESS(INSTANCE_DICT(inst)=PyDict_New()) goto err; if ((init=CCL_getattr(self,py__init__,0))) { UNLESS(args=Py_BuildValue("(O)",inst)) goto err; if (arg) UNLESS_ASSIGN(args,PySequence_Concat(args,arg)) goto err; UNLESS_ASSIGN(args,PyEval_CallObjectWithKeywords(init,args,kw)) goto err; Py_DECREF(args); Py_DECREF(init); } else PyErr_Clear(); if (self->bases && subclass_watcher && ! PyObject_CallMethod(subclass_watcher,"created","O",inst)) PyErr_Clear(); return inst; err: Py_DECREF(inst); Py_XDECREF(init); Py_XDECREF(args); return NULL; } static PyObject * CCL_repr(PyExtensionClass *self) { char p[128], *pp; PyObject *m; if ((m=PyObject_GetAttr(OBJECT(self), py__module__))) { if (! PyObject_IsTrue(m)) { Py_DECREF(m); m=0; } } else PyErr_Clear(); sprintf(p,"%p",self); if (*p=='0' && p[1]=='x') pp=p+2; else pp=p; if (m) ASSIGN(m, JimString_Build("","Oss", m, self->tp_name, pp)); else m= JimString_Build("","ss", self->tp_name, pp); return m; } static PyTypeObject ECTypeType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "ExtensionClass Class", /*tp_name*/ sizeof(PyExtensionClass), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)CCL_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)CCL_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)CCL_call, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)CCL_getattro, /*tp_getattr with object key*/ (setattrofunc)CCL_setattro, /*tp_setattr with object key*/ /* Space for future expansion */ 0L,0L, "Class of C classes" /* Documentation string */ }; /* End of code for ExtensionClass objects */ /* -------------------------------------------------------- */ /* subclassing code: */ static PyObject * subclass_getspecial(PyObject *inst, PyObject *oname) { PyObject *r=0; PyExtensionClass *self; self=(PyExtensionClass*)(inst->ob_type); if (HasInstDict(inst)) { r= INSTANCE_DICT(inst); r = PyObject_GetItem(r,oname); UNLESS(r) { PyErr_Clear(); r=CCL_getattr(self,oname,0); } } else r=CCL_getattr(self,oname,0); return r; } static PyObject * subclass_getattro(PyObject *self, PyObject *name) { PyObject *r; if (! name) return NULL; UNLESS(r=EC_findiattro(self,name)) { PyErr_Clear(); r=EC_findiattro(self,py__getattr__); if (r) ASSIGN(r,PyObject_CallFunction(r,"O",name)); if (r && NeedsToBeBound(r)) ASSIGN(r, CallMethodO(r, py__of__, Build("(O)", self), NULL)); } return r; } static int subclass_simple_setattro(PyObject *self, PyObject *name, PyObject *v) { if (! HasInstDict(self)) { PyErr_SetObject(PyExc_AttributeError, name); return -1; } if (v) return PyDict_SetItem(INSTANCE_DICT(self),name,v); else return PyDict_DelItem(INSTANCE_DICT(self),name); } static int subclass_simple_setattr(PyObject *self, char *name, PyObject *v) { if (! HasInstDict(self)) { PyErr_SetString(PyExc_AttributeError, name); return -1; } if (v) return PyDict_SetItemString(INSTANCE_DICT(self),name,v); else return PyDict_DelItemString(INSTANCE_DICT(self),name); } static int subclass_setattr(PyObject *self, PyObject *oname, char *name, PyObject *v) { PyObject *m=0, *et, *ev, *etb; if (! name) return -1; if (!v && (m=subclass_getspecial(self,py__delattr__))) { if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"OO",self,oname)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"O",oname)) return -1; Py_DECREF(m); return 0; } UNLESS(m=subclass_getspecial(self,py__setattr__)) goto default_setattr; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)setattr_by_name && SubclassInstance_Check(self,AsCMethod(m)->type)) { UNLESS(-1 != AsCMethod(m)->type->tp_setattr(self,name,v)) goto dictionary_setattr; return 0; } else if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)setattro_by_name && SubclassInstance_Check(self,AsCMethod(m)->type)) { UNLESS(-1 != AsCMethod(m)->type->tp_setattro(self,oname,v)) goto dictionary_setattr; return 0; } if (! v) goto default_setattr; if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"OOO",self,oname,v)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"OO",oname,v)) return -1; Py_DECREF(m); return 0; dictionary_setattr: Py_XDECREF(m); PyErr_Fetch(&et, &ev, &etb); if (et==PyExc_AttributeError) { char *s; if (ev && PyString_Check(ev) && (s=PyString_AsString(ev)) && strcmp(s,name)==0) { Py_XDECREF(et); Py_XDECREF(ev); Py_XDECREF(etb); et=0; } } if (et) { PyErr_Restore(et,ev,etb); return -1; } default_setattr: PyErr_Clear(); return subclass_simple_setattro(self, oname, v); } static int subclass_setattro(PyObject *self, PyObject *name, PyObject *v) { return subclass_setattr(self,name,PyString_AsString(name),v); } static int subclass_compare(PyObject *self, PyObject *v) { PyObject *m; long r; UNLESS(m=subclass_getspecial(self,py__cmp__)) { PyErr_Clear(); return self-v; } if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)compare_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) r=AsCMethod(m)->type->tp_compare(self,v); else { if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"OO",self,v)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"O",v)) return -1; r=PyInt_AsLong(m); } Py_DECREF(m); return r; } static long subclass_hash(PyObject *self) { PyObject *m; long r; UNLESS(m=subclass_getspecial(self,py__hash__)) return -1; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)hash_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) r=AsCMethod(m)->type->tp_hash(self); else { if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"O",self)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"")) return -1; r=PyInt_AsLong(m); } Py_DECREF(m); return r; } static PyObject * default_subclass_repr(PyObject *self) { char p[128], *pp; PyErr_Clear(); sprintf(p,"%p",self); if (*p=='0' && p[1]=='x') pp=p+2; else pp=p; return JimString_Build("<%s instance at %s>","ss", self->ob_type->tp_name, pp); } static PyObject * subclass_repr(PyObject *self) { PyObject *m; UNLESS(m=subclass_getspecial(self,py__repr__)) return default_subclass_repr(self); if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)repr_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) ASSIGN(m,AsCMethod(m)->type->tp_repr(self)); else if (UnboundEMethod_Check(m)) ASSIGN(m,PyObject_CallFunction(m,"O",self)); else ASSIGN(m,PyObject_CallFunction(m,"")); return m; } static PyObject * subclass_call(PyObject *self, PyObject *args, PyObject *kw) { PyObject *m; UNLESS(m=subclass_getspecial(self,py__call__)) return NULL; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)call_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) ASSIGN(m,AsCMethod(m)->type->tp_call(self,args,kw)); else { if (UnboundEMethod_Check(m)) { PyObject *a; a=Py_BuildValue("(O)",self); if (a) ASSIGN(a,PySequence_Concat(a,args)); if (a) ASSIGN(m,PyEval_CallObjectWithKeywords(m,a,kw)); else ASSIGN(m,NULL); Py_XDECREF(a); } else ASSIGN(m,PyEval_CallObjectWithKeywords(m,args,kw)); } return m; } static PyObject * subclass_str(PyObject *self) { PyObject *m; UNLESS(m=subclass_getspecial(self,py__str__)) { PyErr_Clear(); return subclass_repr(self); } if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)str_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) ASSIGN(m,AsCMethod(m)->type->tp_str(self)); else if (UnboundEMethod_Check(m)) ASSIGN(m,PyObject_CallFunction(m,"O",self)); else ASSIGN(m,PyObject_CallFunction(m,"")); return m; } #define BINSUB(M,N,A) \ static PyObject * \ subclass_ ## M(PyObject *self, PyObject *v) \ { \ PyObject *m; \ UNLESS(m=subclass_getspecial(self,py__ ## N ## __)) return NULL; \ if (UnboundCMethod_Check(m) \ && AsCMethod(m)->meth==(PyCFunction)M ## _by_name \ && SubclassInstance_Check(self,AsCMethod(m)->type) \ && ! HasMethodHook(self)) \ ASSIGN(m,AsCMethod(m)->type->tp_as_number->nb_ ## M(self,v)); \ else if (UnboundEMethod_Check(m)) \ ASSIGN(m,PyObject_CallFunction(m,"OO",self,v)); \ else \ ASSIGN(m,PyObject_CallFunction(m,"O",v)); \ return m; \ } static PyObject * subclass_add(PyObject *self, PyObject *v) { PyObject *m; UNLESS(m=subclass_getspecial(self,py__add__)) return NULL; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)concat_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) ASSIGN(m,AsCMethod(m)->type->tp_as_sequence->sq_concat(self,v)); else if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)add_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) ASSIGN(m,AsCMethod(m)->type->tp_as_number->nb_add(self,v)); else if (UnboundEMethod_Check(m)) ASSIGN(m,PyObject_CallFunction(m,"OO",self,v)); else ASSIGN(m,PyObject_CallFunction(m,"O",v)); return m; } BINSUB(subtract,sub,Subtract) static PyObject * subclass_multiply(PyObject *self, PyObject *v) { PyObject *m; UNLESS(m=subclass_getspecial(self,py__mul__)) return NULL; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)repeat_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) { int i; i=PyInt_AsLong(v); if (i==-1 && PyErr_Occurred()) return NULL; ASSIGN(m,AsCMethod(m)->type->tp_as_sequence->sq_repeat(self,i)); } else if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)multiply_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) ASSIGN(m,AsCMethod(m)->type->tp_as_number->nb_multiply(self,v)); else if (UnboundEMethod_Check(m)) ASSIGN(m,PyObject_CallFunction(m,"OO",self,v)); else ASSIGN(m,PyObject_CallFunction(m,"O",v)); return m; } BINSUB(divide,div,Divide) BINSUB(remainder,mod,Remainder) static PyObject * subclass_power(PyObject *self, PyObject *v, PyObject *w) { PyObject *m; UNLESS(m=subclass_getspecial(self,py__pow__)) return NULL; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)power_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) ASSIGN(m,AsCMethod(m)->type->tp_as_number->nb_power(self,v,w)); else if (UnboundEMethod_Check(m)) ASSIGN(m,PyObject_CallFunction(m,"OOO",self,v,w)); else ASSIGN(m,PyObject_CallFunction(m,"OO",v,w)); return m; } BINSUB(divmod,divmod,Divmod) BINSUB(lshift,lshift,Lshift) BINSUB(rshift,rshift,Rshift) BINSUB(and,and,And) BINSUB(or,or,Or) BINSUB(xor,xor,Xor) static int subclass_coerce(PyObject **self, PyObject **v) { PyObject *m; int r; UNLESS(m=subclass_getspecial(*self,py__coerce__)) { PyErr_Clear(); Py_INCREF(*self); Py_INCREF(*v); return 0; } if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)coerce_by_name && SubclassInstance_Check(*self,AsCMethod(m)->type) && ! HasMethodHook(*self)) r=AsCMethod(m)->type->tp_as_number->nb_coerce(self,v); else { if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"OO",*self,v)) return -1; } UNLESS_ASSIGN(m,PyObject_CallFunction(m,"O",*v)) return -1; if (m==Py_None) r=-1; else { PyArg_ParseTuple(m,"O",v); Py_INCREF(*self); Py_INCREF(*v); r=0; } } Py_DECREF(m); return r; } #define UNSUB(M,N) \ static PyObject * \ subclass_ ## M(PyObject *self) \ { \ PyObject *m; \ UNLESS(m=subclass_getspecial(self,py__ ## N ## __)) return NULL; \ if (UnboundCMethod_Check(m) \ && AsCMethod(m)->meth==(PyCFunction)M ## _by_name \ && SubclassInstance_Check(self,AsCMethod(m)->type) \ && ! HasMethodHook(self)) \ ASSIGN(m,AsCMethod(m)->type->tp_as_number->nb_ ## M(self)); \ else if (UnboundEMethod_Check(m)) \ ASSIGN(m,PyObject_CallFunction(m,"O",self)); \ else \ ASSIGN(m,PyObject_CallFunction(m,"")); \ return m; \ } UNSUB(negative, neg) UNSUB(positive, pos) UNSUB(absolute, abs) static int subclass_nonzero(PyObject *self) { PyObject *m; long r; UNLESS(m=subclass_getspecial(self,py__nonzero__)) { /* We are being asked is we are true Check out len, and if that fails, say we are true. */ PyErr_Clear(); UNLESS(m=subclass_getspecial(self,py__len__)) { PyErr_Clear(); return 1; } } if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)nonzero_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) r=AsCMethod(m)->type->tp_as_number->nb_nonzero(self); else { if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"O",self)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"")) return -1; r=PyInt_AsLong(m); } Py_DECREF(m); return r; } UNSUB(invert, inv) UNSUB(int, int) UNSUB(long, long) UNSUB(float, float) UNSUB(oct, oct) UNSUB(hex, hex) #undef UNSUB #undef BINSUB static PyNumberMethods subclass_as_number = { (binaryfunc)subclass_add, /*nb_add*/ (binaryfunc)subclass_subtract, /*nb_subtract*/ (binaryfunc)subclass_multiply, /*nb_multiply*/ (binaryfunc)subclass_divide, /*nb_divide*/ (binaryfunc)subclass_remainder, /*nb_remainder*/ (binaryfunc)subclass_divmod, /*nb_divmod*/ (ternaryfunc)subclass_power, /*nb_power*/ (unaryfunc)subclass_negative, /*nb_negative*/ (unaryfunc)subclass_positive, /*nb_positive*/ (unaryfunc)subclass_absolute, /*nb_absolute*/ (inquiry)subclass_nonzero, /*nb_nonzero*/ (unaryfunc)subclass_invert, /*nb_invert*/ (binaryfunc)subclass_lshift, /*nb_lshift*/ (binaryfunc)subclass_rshift, /*nb_rshift*/ (binaryfunc)subclass_and, /*nb_and*/ (binaryfunc)subclass_xor, /*nb_xor*/ (binaryfunc)subclass_or, /*nb_or*/ (coercion)subclass_coerce, /*nb_coerce*/ (unaryfunc)subclass_int, /*nb_int*/ (unaryfunc)subclass_long, /*nb_long*/ (unaryfunc)subclass_float, /*nb_float*/ (unaryfunc)subclass_oct, /*nb_oct*/ (unaryfunc)subclass_hex, /*nb_hex*/ }; static long subclass_length(PyObject *self) { PyObject *m; long r; PyExtensionClass *t; UNLESS(m=subclass_getspecial(self,py__len__)) { /* Hm. Maybe we are being checked to see if we are true. Check to see if we have a __getitem__. If we don't, then answer that we are true. */ PyErr_Clear(); if ((m=subclass_getspecial(self,py__getitem__))) { /* Hm, we have getitem, must be error */ Py_DECREF(m); PyErr_SetObject(PyExc_AttributeError, py__len__); return -1; } PyErr_Clear(); return subclass_nonzero(self); } if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)length_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) { t=(PyExtensionClass*)AsCMethod(m)->type; Py_DECREF(m); if (t->tp_as_sequence) return t->tp_as_sequence->sq_length(self); else return t->tp_as_mapping->mp_length(self); } if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"O",self)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"")) return -1; r=PyInt_AsLong(m); Py_DECREF(m); return r; } static PyObject * subclass_item(PyObject *self, int index) { PyObject *m; PyExtensionClass *t; UNLESS(m=subclass_getspecial(self,py__getitem__)) return NULL; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)getitem_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) { t=(PyExtensionClass*)AsCMethod(m)->type; if (t->tp_as_sequence && t->tp_as_sequence->sq_item) { Py_DECREF(m); return t->tp_as_sequence->sq_item(self,index); } } if (UnboundEMethod_Check(m)) ASSIGN(m,PyObject_CallFunction(m,"Oi",self,index)); else ASSIGN(m,PyObject_CallFunction(m,"i",index)); return m; } static PyObject * subclass_slice(PyObject *self, int i1, int i2) { PyObject *m; UNLESS(m=subclass_getspecial(self,py__getslice__)) return NULL; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)slice_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) ASSIGN(m,AsCMethod(m)->type->tp_as_sequence->sq_slice(self,i1,i2)); else if (UnboundEMethod_Check(m)) ASSIGN(m,PyObject_CallFunction(m,"Oii",self,i1,i2)); else ASSIGN(m,PyObject_CallFunction(m,"ii",i1,i2)); return m; } static long subclass_ass_item(PyObject *self, int index, PyObject *v) { PyObject *m; PyExtensionClass *t; if (! v && (m=subclass_getspecial(self,py__delitem__))) { if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"Oi",self,index)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"i",index)) return -1; Py_DECREF(m); return 0; } UNLESS(m=subclass_getspecial(self,py__setitem__)) return -1; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)setitem_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) { t=(PyExtensionClass*)AsCMethod(m)->type; if (t->tp_as_sequence && t->tp_as_sequence->sq_ass_item) { Py_DECREF(m); return t->tp_as_sequence->sq_ass_item(self,index,v); } } if (! v) { PyErr_SetObject(PyExc_AttributeError, py__delitem__); return -1; } if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"OiO",self,index,v)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"iO",index,v)) return -1; Py_DECREF(m); return 0; } static int subclass_ass_slice(PyObject *self, int i1, int i2, PyObject *v) { PyObject *m; long r; if (! v && (m=subclass_getspecial(self,py__delslice__))) { if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"Oii",self,i1,i2)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"ii",i1,i2)) return -1; Py_DECREF(m); return 0; } UNLESS(m=subclass_getspecial(self,py__setslice__)) return -1; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)ass_slice_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) { r=AsCMethod(m)->type->tp_as_sequence->sq_ass_slice(self,i1,i2,v); Py_DECREF(m); return r; } if (! v) { PyErr_SetObject(PyExc_AttributeError, py__delslice__); return -1; } if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"OiiO",self,i1,i2,v)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"iiO",i1,i2,v)) return -1; Py_DECREF(m); return 0; } static PyObject * subclass_repeat(PyObject *self, int v) { PyObject *m; UNLESS(m=subclass_getspecial(self,py__mul__)) return NULL; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)repeat_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) ASSIGN(m,AsCMethod(m)->type->tp_as_sequence->sq_repeat(self,v)); else if (UnboundEMethod_Check(m)) ASSIGN(m,PyObject_CallFunction(m,"Oi",self,v)); else ASSIGN(m,PyObject_CallFunction(m,"i",v)); return m; } PySequenceMethods subclass_as_sequence = { (inquiry)subclass_length, /*sq_length*/ (binaryfunc)subclass_add, /*sq_concat*/ (intargfunc)subclass_repeat, /*sq_repeat*/ (intargfunc)subclass_item, /*sq_item*/ (intintargfunc)subclass_slice, /*sq_slice*/ (intobjargproc)subclass_ass_item, /*sq_ass_item*/ (intintobjargproc)subclass_ass_slice, /*sq_ass_slice*/ }; static PyObject * subclass_subscript(PyObject *self, PyObject *key) { PyObject *m; PyExtensionClass *t; UNLESS(m=subclass_getspecial(self,py__getitem__)) return NULL; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)getitem_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) { t=(PyExtensionClass*)AsCMethod(m)->type; if (t->tp_as_mapping && t->tp_as_mapping->mp_subscript) { Py_DECREF(m); return t->tp_as_mapping->mp_subscript(self,key); } else if (t->tp_as_sequence && t->tp_as_sequence->sq_item) { int i, l; Py_DECREF(m); UNLESS(PyInt_Check(key)) { PyErr_SetString(PyExc_TypeError, "sequence subscript not int"); return NULL; } i=PyInt_AsLong(key); if (i < 0) { if ((l=PyObject_Length(self)) < 0) return NULL; i+=l; } return t->tp_as_sequence->sq_item(self,i); } } if (UnboundEMethod_Check(m)) ASSIGN(m,PyObject_CallFunction(m,"OO",self,key)); else ASSIGN(m,PyObject_CallFunction(m,"O",key)); return m; } static long subclass_ass_subscript(PyObject *self, PyObject *index, PyObject *v) { PyObject *m; PyExtensionClass *t; if (! v && (m=subclass_getspecial(self,py__delitem__))) { if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"OO",self,index)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"O",index)) return -1; Py_DECREF(m); return 0; } UNLESS(m=subclass_getspecial(self,py__setitem__)) return -1; if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)setitem_by_name && SubclassInstance_Check(self,AsCMethod(m)->type) && ! HasMethodHook(self)) { t=(PyExtensionClass*)AsCMethod(m)->type; if (t->tp_as_mapping && t->tp_as_mapping->mp_ass_subscript) { Py_DECREF(m); return t->tp_as_mapping->mp_ass_subscript(self,index,v); } else if (t->tp_as_sequence && t->tp_as_sequence->sq_ass_item) { int i, l; Py_DECREF(m); UNLESS(PyInt_Check(index)) { PyErr_SetString(PyExc_TypeError, "sequence subscript not int"); return -1; } i=PyInt_AsLong(index); if (i < 0) { if ((l=PyObject_Length(self)) < 0) return -1; i+=l; } return t->tp_as_sequence->sq_ass_item(self,i,v); } } if (! v) { PyErr_SetObject(PyExc_AttributeError, py__delitem__); return -1; } if (UnboundEMethod_Check(m)) { UNLESS_ASSIGN(m,PyObject_CallFunction(m,"OOO",self,index,v)) return -1; } else UNLESS_ASSIGN(m,PyObject_CallFunction(m,"OO",index,v)) return -1; Py_DECREF(m); return 0; } PyMappingMethods subclass_as_mapping = { (inquiry)subclass_length, /*mp_length*/ (binaryfunc)subclass_subscript, /*mp_subscript*/ (objobjargproc)subclass_ass_subscript, /*mp_ass_subscript*/ }; static int dealloc_base(PyObject *inst, PyExtensionClass* self) { int i,l; PyObject *t; l=PyTuple_Size(self->bases); for (i=0; i < l; i++) { t=PyTuple_GET_ITEM(self->bases, i); if (ExtensionClass_Check(t)) { if (AsExtensionClass(t)->bases) { if (dealloc_base(inst,AsExtensionClass(t))) return 1; } else { if (((PyExtensionClass*)t)->tp_dealloc) { ((PyExtensionClass*)t)->tp_dealloc(inst); return 1; } } } } return 0; } static void subclass_dealloc(PyObject *self) { PyObject *m, *t, *v, *tb; int base_dealloced; #ifdef TRACE_DEALLOC fprintf(stderr,"Deallocating a %s\n", self->ob_type->tp_name); #endif PyErr_Fetch(&t,&v,&tb); Py_INCREF(self); /* Give us a new lease on life */ if (subclass_watcher && ! PyObject_CallMethod(subclass_watcher,"destroying","O",self)) PyErr_Clear(); if ((m=subclass_getspecial(self,py__del__))) { if (UnboundEMethod_Check(m)) ASSIGN(m,PyObject_CallFunction(m,"O",self)); else ASSIGN(m,PyObject_CallFunction(m,"")); Py_XDECREF(m); } PyErr_Clear(); if (--self->ob_refcnt > 0) { PyErr_Restore(t,v,tb); return; /* we added a reference; don't delete now */ } if (HasInstDict(self)) Py_XDECREF(INSTANCE_DICT(self)); /* See if there was a dealloc handler in a (C) base class. If there was, then it deallocates the object and we get a true value back. Note that if there *is* a base class dealloc, then *it* should decref the class. */ base_dealloced=dealloc_base(self,(PyExtensionClass*)self->ob_type); /* We only deallocate ourselves if a base class didn't */ UNLESS(base_dealloced) { Py_DECREF(self->ob_type); PyMem_DEL(self); } PyErr_Restore(t,v,tb); } static void datafull_baseclassesf(PyExtensionClass *type, PyObject **c1, PyObject **c2) { /* Find the number of classes that have data and return them. There should be no more than one. */ int l, i; PyObject *base; l=PyTuple_Size(type->bases); for (i=0; i < l && ! (*c1 && *c2); i++) { base=PyTuple_GET_ITEM(type->bases, i); if (ExtensionClass_Check(base)) { if (AsExtensionClass(base)->bases) datafull_baseclassesf(AsExtensionClass(base),c1,c2); else { if (AsExtensionClass(base)->tp_basicsize > sizeof(PyPureMixinObject) || AsExtensionClass(base)->tp_itemsize > 0) { if (! *c1) *c1=base; else if (*c1 != base) *c2=base; } } } } } static int datafull_baseclasses(PyExtensionClass *type) { PyObject *c1=0, *c2=0; datafull_baseclassesf(type, &c1, &c2); if (c2) return 2; if (c1) return 1; return 0; } static PyObject * datafull_baseclass(PyExtensionClass *type) { /* Find the baseclass that has data and. There should be only one. */ int l, i; PyObject *base, *dbase; l=PyTuple_Size(type->bases); for (i=0; i < l; i++) { base=PyTuple_GET_ITEM(type->bases, i); if (ExtensionClass_Check(base)) { if (AsExtensionClass(base)->bases) { if ((dbase=datafull_baseclass(AsExtensionClass(base)))) return dbase; } else { if (AsExtensionClass(base)->tp_basicsize > sizeof(PyPureMixinObject) || AsExtensionClass(base)->tp_itemsize > 0) return base; } } } return NULL; } static PyObject * extension_baseclass(PyExtensionClass *type) { /* Find the first immediate base class that is an extension class */ int l, i; PyObject *base; l=PyTuple_Size(type->bases); for (i=0; i < l; i++) { base=PyTuple_GET_ITEM(type->bases, i); if (ExtensionClass_Check(base)) return base; } return JimErr_Format(PyExc_TypeError, "No extension class found in subclass", NULL); } static int subclass_hasattr(PyExtensionClass *type, PyObject *name) { PyObject *o; if ((o=CCL_getattro(type,name))) { Py_DECREF(o); return 1; } PyErr_Clear(); return 0; } static void subclass_init_getattr(PyExtensionClass *self, PyObject *methods) { PyObject *m; if ((m=CCL_getattr(self,py__getattr__,0))) { if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)getattr_by_name && Subclass_Check(self,AsCMethod(m)->type)) { self->tp_getattr=AsCMethod(m)->type->tp_getattr; } else if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)getattro_by_name && Subclass_Check(self,AsCMethod(m)->type)) { self->tp_getattro=AsCMethod(m)->type->tp_getattro; } else { PyObject_SetItem(methods,py__getattr__,m); self->tp_getattro=subclass_getattro; } Py_DECREF(m); } else { PyErr_Clear(); self->tp_getattro=EC_findiattro; } } static void subclass_init_setattr(PyExtensionClass *self, PyObject *methods) { PyObject *m; if ((m=CCL_getattr(self,py__setattr__,0))) { if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)setattr_by_name && Subclass_Check(self,AsCMethod(m)->type)) { self->tp_setattr=AsCMethod(m)->type->tp_setattr; } else if (UnboundCMethod_Check(m) && AsCMethod(m)->meth==(PyCFunction)setattro_by_name && Subclass_Check(self,AsCMethod(m)->type)) { self->tp_setattro=AsCMethod(m)->type->tp_setattro; } else { PyObject_SetItem(methods,py__setattr__,m); self->tp_setattro=subclass_setattro; } Py_DECREF(m); } else { PyErr_Clear(); self->tp_setattro=subclass_simple_setattro; } } static PyObject * CopyMethods(PyExtensionClass *type, PyObject *base_methods) { PyObject *methods, *key, *v; int pos; UNLESS(type->class_dictionary && PyDict_Check(base_methods) && ExtensionInstance_Check(type->class_dictionary)) { Py_INCREF(base_methods); return base_methods; } UNLESS(methods= PyObject_CallObject((PyObject*)type->class_dictionary->ob_type, NULL)) return NULL; for (pos=0; PyDict_Next(base_methods, &pos, &key, &v); ) UNLESS(0 <= PyObject_SetItem(methods,key,v)) goto err; return methods; err: Py_DECREF(methods); return NULL; } /* Constructor for building subclasses of C classes. That is, we want to build a C class object that described a subclass of a built-in type. */ static PyObject * subclass__init__(PyExtensionClass *self, PyObject *args) { PyObject *bases, *methods, *class_init; PyExtensionClass *type; char *name, *p; int l; UNLESS(PyArg_ParseTuple(args,"sOO", &name, &bases, &methods)) return NULL; l=strlen(name)+1; UNLESS(p=(char*)malloc(l*sizeof(char))) return PyErr_NoMemory(); memcpy(p,name,l); name=p; UNLESS(PyTuple_Check(bases) && PyTuple_Size(bases)) { PyErr_SetString (PyExc_TypeError, "second argument must be a tuple of 1 or more base classes"); } self->bases=bases; Py_INCREF(bases); if (datafull_baseclasses(self) > 1) { PyErr_SetString(PyExc_TypeError, "too many datafull base classes"); return NULL; } UNLESS(type=(PyExtensionClass *)datafull_baseclass(self)) UNLESS(type=(PyExtensionClass *)extension_baseclass(self)) return NULL; self->tp_name=name; UNLESS(self->class_dictionary=CopyMethods(type,methods)) return NULL; #define copy_member(M) self->M=type->M copy_member(ob_size); copy_member(class_flags); copy_member(tp_itemsize); copy_member(tp_print); self->tp_dealloc=subclass_dealloc; subclass_init_getattr(self,methods); subclass_init_setattr(self,methods); #define subclass_set(OP,N) \ self->tp_ ##OP = subclass_ ##OP subclass_set(compare,cmp); subclass_set(repr,repr); if (subclass_hasattr(self,py__of__)) self->class_flags |= EXTENSIONCLASS_BINDABLE_FLAG; if (subclass_hasattr(self,py__call_method__)) self->class_flags |= EXTENSIONCLASS_METHODHOOK_FLAG; UNLESS(self->class_flags & EXTENSIONCLASS_NOINSTDICT_FLAG) self->class_flags |= EXTENSIONCLASS_INSTDICT_FLAG; if (type->bases || ! ClassHasInstDict(self)) copy_member(tp_basicsize); else { self->tp_basicsize=type->tp_basicsize/sizeof(PyObject*)*sizeof(PyObject*); if (self->tp_basicsize < type->tp_basicsize) self->tp_basicsize += sizeof(PyObject*); /* To align on PyObject */ self->tp_basicsize += sizeof(PyObject*); /* For instance dictionary */ } self->tp_as_number=(PyNumberMethods*)malloc(sizeof(PyNumberMethods)); UNLESS(self->tp_as_number) return PyErr_NoMemory(); *(self->tp_as_number)=subclass_as_number; self->tp_as_sequence= (PySequenceMethods*)malloc(sizeof(PySequenceMethods)); UNLESS(self->tp_as_sequence) return PyErr_NoMemory(); *(self->tp_as_sequence)=subclass_as_sequence; self->tp_as_mapping=(PyMappingMethods*)malloc(sizeof(PyMappingMethods)); UNLESS(self->tp_as_mapping) return PyErr_NoMemory(); *(self->tp_as_mapping)=subclass_as_mapping; subclass_set(hash,hash); subclass_set(call,call); subclass_set(str,str); self->tp_doc=0; /* Implement __module__=__name__ */ if (PyDict_GetItem(methods, py__module__) == NULL) { PyObject *globals = PyEval_GetGlobals(); if (globals != NULL) { PyObject *modname = PyDict_GetItem(globals, py__name__); if (modname != NULL) { if (PyDict_SetItem(methods, py__module__, modname) < 0) return NULL; } } } /* Check for and use __class_init__ */ if ((class_init=PyObject_GetAttrString(AsPyObject(self),"__class_init__"))) { UNLESS_ASSIGN(class_init,PyObject_GetAttrString(class_init,"im_func")) return NULL; UNLESS_ASSIGN(class_init,PyObject_CallFunction(class_init,"O",self)) return NULL; Py_DECREF(class_init); } else PyErr_Clear(); Py_INCREF(Py_None); return Py_None; } struct PyMethodDef ExtensionClass_methods[] = { {"__init__",(PyCFunction)subclass__init__,1,""}, {NULL, NULL} /* sentinel */ }; static PyExtensionClass ECType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "ExtensionClass", /*tp_name*/ sizeof(PyExtensionClass), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)CCL_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)CCL_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)CCL_call, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)CCL_getattro, /*tp_getattr with object key*/ (setattrofunc)CCL_setattro, /*tp_setattr with object key*/ /* Space for future expansion */ 0L,0L, "C classes", /* Documentation string */ METHOD_CHAIN(ExtensionClass_methods) }; /* List of methods defined in the module */ static PyObject * set_subclass_watcher(PyObject *ignored, PyObject *args) { PyObject *old, *sw=0; UNLESS(PyArg_ParseTuple(args,"|O",&sw)) return NULL; old=subclass_watcher; subclass_watcher=sw; if (sw) Py_INCREF(sw); if (old) return old; Py_INCREF(Py_None); return Py_None; } static struct PyMethodDef CC_methods[] = { {"subclass_watcher", (PyCFunction)set_subclass_watcher, 1, "subclass_watcher(ob) -- " "Register an object to watch subclass instance events" }, {NULL, NULL} /* sentinel */ }; static int export_type(PyObject *dict, char *name, PyExtensionClass *typ) { initializeBaseExtensionClass(typ); if (PyErr_Occurred()) return -1; if (PyDict_GetItem(typ->class_dictionary, py__module__) == NULL) { PyObject *modname = PyDict_GetItem(dict, py__name__); if (modname != NULL) { if (PyDict_SetItem(typ->class_dictionary, py__module__, modname) < 0) return -1; } } PyErr_Clear(); return PyMapping_SetItemString(dict,name,(PyObject*)typ); } static struct ExtensionClassCAPIstruct TrueExtensionClassCAPI = { export_type, EC_findiattrs, EC_findiattro, subclass_simple_setattr, subclass_simple_setattro, (PyObject*)&ECType, (PyObject*)&PMethodType, PMethod_New, CMethod_issubclass, }; void initExtensionClass() { PyObject *m, *d; char *rev="$Revision: 1.36 $"; PURE_MIXIN_CLASS(Base, "Minimalbase class for Extension Classes", NULL); PMethodType.ob_type=&PyType_Type; CMethodType.ob_type=&PyType_Type; ECTypeType.ob_type=&PyType_Type; ECType.ob_type=&ECTypeType; UNLESS(concat_fmt=PyString_FromString("%s%s")); m = Py_InitModule4("ExtensionClass", CC_methods, ExtensionClass_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); d = PyModule_GetDict(m); PyDict_SetItemString(d,"__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); init_py_names(); if (0) PyCObject_Import14("this will go away", "in 1.5 :-)"); initializeBaseExtensionClass(&ECType); PyDict_SetItemString(d, "ExtensionClass", (PyObject*)&ECType); initializeBaseExtensionClass(&BaseType); PyDict_SetItemString(d, "Base", (PyObject*)&BaseType); PyDict_SetItemString(d, "PythonMethodType", (PyObject*)&PMethodType); PyDict_SetItemString(d, "ExtensionMethodType", (PyObject*)&CMethodType); /* Export C attribute lookup API */ PyExtensionClassCAPI=&TrueExtensionClassCAPI; PyDict_SetItemString(d, "CAPI", PyCObject_FromVoidPtr(PyExtensionClassCAPI,NULL)); CHECK_FOR_ERRORS("can't initialize module ExtensionClass"); } Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/ExtensionClass.h100644 1007 1403 40165 6626245507 25316 0ustar petrillipetrilli/* $Id: ExtensionClass.h,v 1.13 1998/11/23 11:47:19 jim Exp $ Extension Class Definitions Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: o Redistributions of source code must retain the above copyright notice, this list of conditions, and the disclaimer that follows. o 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. o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL CREATIONS 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. Implementing base extension classes A base extension class is implemented in much the same way that an extension type is implemented, except: - The include file, 'ExtensionClass.h', must be included. - The type structure is declared to be of type 'PyExtensionClass', rather than of type 'PyTypeObject'. - The type structure has an additional member that must be defined after the documentation string. This extra member is a method chain ('PyMethodChain') containing a linked list of method definition ('PyMethodDef') lists. Method chains can be used to implement method inheritance in C. Most extensions don't use method chains, but simply define method lists, which are null-terminated arrays of method definitions. A macro, 'METHOD_CHAIN' is defined in 'ExtensionClass.h' that converts a method list to a method chain. (See the example below.) - Module functions that create new instances must be replaced by an '__init__' method that initializes, but does not create storage for instances. - The extension class must be initialized and exported to the module with:: PyExtensionClass_Export(d,"name",type); where 'name' is the module name and 'type' is the extension class type object. Attribute lookup Attribute lookup is performed by calling the base extension class 'getattr' operation for the base extension class that includes C data, or for the first base extension class, if none of the base extension classes include C data. 'ExtensionClass.h' defines a macro 'Py_FindAttrString' that can be used to find an object's attributes that are stored in the object's instance dictionary or in the object's class or base classes:: v = Py_FindAttrString(self,name); In addition, a macro is provided that replaces 'Py_FindMethod' calls with logic to perform the same sort of lookup that is provided by 'Py_FindAttrString'. Linking The extension class mechanism was designed to be useful with dynamically linked extension modules. Modules that implement extension classes do not have to be linked against an extension class library. The macro 'PyExtensionClass_Export' imports the 'ExtensionClass' module and uses objects imported from this module to initialize an extension class with necessary behavior. If you have questions regarding this software, contact: If you have questions regarding this software, contact: Digital Creations L.C. info@digicool.com (540) 371-6909 */ #ifndef EXTENSIONCLASS_H #define EXTENSIONCLASS_H #include "Python.h" #include "import.h" /* Declarations for objects of type ExtensionClass */ typedef struct { PyObject_VAR_HEAD char *tp_name; /* For printing */ int tp_basicsize, tp_itemsize; /* For allocation */ /* Methods to implement standard operations */ destructor tp_dealloc; printfunc tp_print; getattrfunc tp_getattr; setattrfunc tp_setattr; cmpfunc tp_compare; reprfunc tp_repr; /* Method suites for standard classes */ PyNumberMethods *tp_as_number; PySequenceMethods *tp_as_sequence; PyMappingMethods *tp_as_mapping; /* More standard operations (at end for binary compatibility) */ hashfunc tp_hash; ternaryfunc tp_call; reprfunc tp_str; getattrofunc tp_getattro; setattrofunc tp_setattro; /* Space for future expansion */ long tp_xxx3; long tp_xxx4; char *tp_doc; /* Documentation string */ #ifdef COUNT_ALLOCS /* these must be last */ int tp_alloc; int tp_free; int tp_maxalloc; struct _typeobject *tp_next; #endif /* Here's the juicy stuff: */ /* Put your method chain here. If you just have a method list, you can use the METHON_CHAIN macro to make a chain. */ PyMethodChain methods; /* You may set certain flags here. */ long class_flags; /* The following flags are used by ExtensionClass */ #define EXTENSIONCLASS_DYNAMIC_FLAG 1 << 0 #define EXTENSIONCLASS_BINDABLE_FLAG 1 << 2 #define EXTENSIONCLASS_METHODHOOK_FLAG 1 << 3 #define EXTENSIONCLASS_INSTDICT_FLAG 1 << 4 #define EXTENSIONCLASS_NOINSTDICT_FLAG 1 << 5 #define EXTENSIONCLASS_BASICNEW_FLAG 1 << 6 /* The following flags are for use by extension class developers. */ #define EXTENSIONCLASS_USER_FLAG1 1 << 16 #define EXTENSIONCLASS_USER_FLAG2 1 << 17 #define EXTENSIONCLASS_USER_FLAG3 1 << 18 #define EXTENSIONCLASS_USER_FLAG4 1 << 19 #define EXTENSIONCLASS_USER_FLAG5 1 << 20 #define EXTENSIONCLASS_USER_FLAG6 1 << 21 #define EXTENSIONCLASS_USER_FLAG7 1 << 22 #define EXTENSIONCLASS_USER_FLAG8 1 << 23 #define EXTENSIONCLASS_USER_FLAG9 1 << 24 #define EXTENSIONCLASS_USER_FLAG10 1 << 25 #define EXTENSIONCLASS_USER_FLAG11 1 << 26 #define EXTENSIONCLASS_USER_FLAG12 1 << 27 #define EXTENSIONCLASS_USER_FLAG13 1 << 28 #define EXTENSIONCLASS_USER_FLAG14 1 << 29 #define EXTENSIONCLASS_USER_FLAG15 1 << 30 #define EXTENSIONCLASS_USER_FLAG16 1 << 31 /* This is the class dictionary, which is normally created for you. If you wish, you can provide your own class dictionary object. If you do provide your own class dictionary, it *must* be a mapping object. If the object given is also an extension instance, then sub-class instance dictionaries will be created by calling the class dictionary's class with zero argumemts. Otherwise, subclass dictionaries will be of the default type. */ PyObject *class_dictionary; /* You should not set the remaining members. */ PyObject *bases; PyObject *reserved; } PyExtensionClass; /* Following are macros that are needed or useful for defining extension classes: */ /* This macro redefines Py_FindMethod to do attribute for an attribute name given by a C string lookup using extension class meta-data. This is used by older getattr implementations. This macro is used in base class implementations of tp_getattr to lookup methods or attributes that are not managed by the base type directly. The macro is generally used to search for attributes after other attribute searches have failed. Note that in Python 1.4, a getattr operation may be provided that uses an object argument. Classes that support this new operation should use Py_FindAttr. */ #define Py_FindMethod(M,SELF,NAME) \ (PyExtensionClassCAPI->getattrs((SELF),(NAME))) /* Do method or attribute lookup for an attribute name given by a C string using extension class meta-data. This macro is used in base class implementations of tp_getattro to lookup methods or attributes that are not managed by the base type directly. The macro is generally used to search for attributes after other attribute searches have failed. Note that in Python 1.4, a getattr operation may be provided that uses an object argument. Classes that support this new operation should use Py_FindAttr. */ #define Py_FindAttrString(SELF,NAME) \ (PyExtensionClassCAPI->getattrs((SELF),(NAME))) /* Do method or attribute lookup using extension class meta-data. This macro is used in base class implementations of tp_getattr to lookup methods or attributes that are not managed by the base type directly. The macro is generally used to search for attributes after other attribute searches have failed. */ #define Py_FindAttr(SELF,NAME) (PyExtensionClassCAPI->getattro((SELF),(NAME))) /* Do method or attribute assignment for an attribute name given by a C string using extension class meta-data. This macro is used in base class implementations of tp_setattr to set attributes that are not managed by the base type directly. The macro is generally used to assign attributes after other attribute attempts to assign attributes have failed. Note that in Python 1.4, a setattr operation may be provided that uses an object argument. Classes that support this new operation should use PyEC_SetAttr. */ #define PyEC_SetAttrString(SELF,NAME,V) \ (PyExtensionClassCAPI->setattrs((SELF),(NAME),(V))) /* Do attribute assignment for an attribute. This macro is used in base class implementations of tp_setattro to set attributes that are not managed by the base type directly. The macro is generally used to assign attributes after other attribute attempts to assign attributes have failed. */ #define PyEC_SetAttr(SELF,NAME,V) \ (PyExtensionClassCAPI->setattro((SELF),(NAME),(V))) /* Import the ExtensionClass CAPI */ #define ExtensionClassImported \ (PyExtensionClassCAPI=PyCObject_Import("ExtensionClass","CAPI")) /* Make sure the C interface has been imported and import it if necessary. This can be used in an if. */ #define MakeSureExtensionClassImported \ (PyExtensionClassCAPI || \ (PyExtensionClassCAPI=PyCObject_Import("ExtensionClass","CAPI"))) /* Export an Extension Base class in a given module dictionary with a given name and ExtensionClass structure. */ #define PyExtensionClass_Export(D,N,T) \ if(PyExtensionClassCAPI || \ (PyExtensionClassCAPI= PyCObject_Import("ExtensionClass","CAPI"))) \ { PyExtensionClassCAPI->Export(D,N,&T); } /* Convert a method list to a method chain. */ #define METHOD_CHAIN(DEF) { DEF, NULL } /* The following macro checks whether a type is an extension class: */ #define PyExtensionClass_Check(TYPE) \ ((PyObject*)(TYPE)->ob_type==PyExtensionClassCAPI->ExtensionClassType) /* The following macro checks whether an instance is an extension instance: */ #define PyExtensionInstance_Check(INST) \ ((PyObject*)(INST)->ob_type->ob_type== \ PyExtensionClassCAPI->ExtensionClassType) /* The following macro checks for errors and prints out an error message that is more informative than the one given by Python when an extension module initialization fails. */ #define CHECK_FOR_ERRORS(MESS) \ if(PyErr_Occurred()) { \ PyObject *__sys_exc_type, *__sys_exc_value, *__sys_exc_traceback; \ PyErr_Fetch( &__sys_exc_type, &__sys_exc_value, \ &__sys_exc_traceback); \ fprintf(stderr, # MESS ":\n\t"); \ PyObject_Print(__sys_exc_type, stderr,0); \ fprintf(stderr,", "); \ PyObject_Print(__sys_exc_value, stderr,0); \ fprintf(stderr,"\n"); \ fflush(stderr); \ Py_FatalError(# MESS); \ } /* The following macro can be used to define an extension base class that only provides method and that is used as a pure mix-in class. */ #define PURE_MIXIN_CLASS(NAME,DOC,METHODS) \ static PyExtensionClass NAME ## Type = { PyObject_HEAD_INIT(NULL) \ 0, # NAME, sizeof(PyPureMixinObject), 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \ 0, 0, 0, 0, 0, 0, 0, DOC, {METHODS, NULL}, \ EXTENSIONCLASS_BASICNEW_FLAG} /* The following macros provide limited access to extension-class method facilities. */ /* Test for an ExtensionClass method: */ #define PyECMethod_Check(O) \ ((PyObject*)(O)->ob_type==PyExtensionClassCAPI->MethodType) /* Create a method object that wraps a callable object and an instance. Note that if the callable object is an extension class method, then the new method will wrap the callable object that is wrapped by the extension class method. Also note that if the callable object is an extension class method with a reference count of 1, then the callable object will be rebound to the instance and returned with an incremented reference count. */ #define PyECMethod_New(CALLABLE,INST) \ (PyExtensionClassCAPI->Method_New(CALLABLE,INST)) /* Return the instance that is bound by an extension class method. */ #define PyECMethod_Self(M) (((PyECMethodObject*)M)->self) /* Check whether an object has an __of__ method for returning itself in the context of it's container. */ #define has__of__(O) \ ((O)->ob_type->ob_type == \ (PyTypeObject*)PyExtensionClassCAPI->ExtensionClassType && \ (((PyExtensionClass*)((O)->ob_type))->class_flags & \ EXTENSIONCLASS_BINDABLE_FLAG)) /* The following macros are used to check whether an instance or a class' instanses have instance dictionaries: */ #define HasInstDict(O) \ ((((PyExtensionClass*)((O)->ob_type))->class_flags & \ EXTENSIONCLASS_INSTDICT_FLAG)) #define ClassHasInstDict(O) (O->class_flags & EXTENSIONCLASS_INSTDICT_FLAG) /* Get an object's instance dictionary. Use with caution */ #define INSTANCE_DICT(inst) \ *(((PyObject**)inst) + (inst->ob_type->tp_basicsize/sizeof(PyObject*) - 1)) /* Test whether an ExtensionClass, S, is a subclass of ExtensionClass C. */ #define ExtensionClassSubclass_Check(S,C) ( \ ((PyObject*)(S)->ob_type==PyExtensionClassCAPI->ExtensionClassType) && \ ((PyObject*)(C)->ob_type==PyExtensionClassCAPI->ExtensionClassType) && \ (PyExtensionClassCAPI->issubclass((PyExtensionClass *)(S), \ (PyExtensionClass *)(C)))) /* Test whether an ExtensionClass instance , I, is a subclass of ExtensionClass C. */ #define ExtensionClassSubclassInstance_Check(I,C) ( \ ((PyObject*)(I)->ob_type->ob_type== \ PyExtensionClassCAPI->ExtensionClassType) && \ ((PyObject*)(C)->ob_type==PyExtensionClassCAPI->ExtensionClassType) && \ (PyExtensionClassCAPI->issubclass((PyExtensionClass *)((I)->ob_type), \ (PyExtensionClass *)(C)))) /* This let's you define built-in class methods. */ #define METH_CLASS_METHOD (2 << 17) /***************************************************************************** WARNING: EVERYTHING BELOW HERE IS PRIVATE TO THE EXTENSION CLASS INTERFACE IMPLEMENTATION AND IS SUBJECT TO CHANGE !!! *****************************************************************************/ static struct ExtensionClassCAPIstruct { int (*Export)(PyObject *dict, char *name, PyExtensionClass *ob_type); PyObject *(*getattrs)(PyObject *, char *); PyObject *(*getattro)(PyObject *, PyObject *); int (*setattrs)(PyObject *, char *, PyObject *); int (*setattro)(PyObject *, PyObject *, PyObject *); PyObject *ExtensionClassType; PyObject *MethodType; PyObject *(*Method_New)(PyObject *callable, PyObject *inst); int (*issubclass)(PyExtensionClass *sub, PyExtensionClass *type); } *PyExtensionClassCAPI = NULL; typedef struct { PyObject_HEAD } PyPureMixinObject; typedef struct { PyObject_HEAD PyTypeObject *type; PyObject *self; PyObject *meth; } PyECMethodObject; /* The following is to avoid whining from 1.5 :-) */ #define PyCObject_Import PyCObject_Import14 static void * PyCObject_Import14(char *module_name, char *name) { PyObject *m, *c; void *r=NULL; if((m=PyImport_ImportModule(module_name))) { if((c=PyObject_GetAttrString(m,name))) { r=PyCObject_AsVoidPtr(c); Py_DECREF(c); } Py_DECREF(m); } return r; } #endif Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/ExtensionClass.stx100644 1007 1403 72606 6727252011 25700 0ustar petrillipetrilliExtension Classes, Python Extension Types Become Classes Jim Fulton, Digital Creations, Inc. jim@digicool.com "Copyright (C) 1996-1998, Digital Creations":COPYRIGHT.html. Abstract A lightweight mechanism has been developed for making Python extension types more class-like. Classes can be developed in an extension language, such as C or C++, and these classes can be treated like other python classes: - They can be sub-classed in python, - They provide access to method documentation strings, and - They can be used to directly create new instances. An example class shows how extension classes are implemented and how they differ from extension types. Extension classes provide additional extensions to class and instance semantics, including: - A protocol for accessing subobjects "in the context of" their containers. This is used to implement custom method types and "environmental acquisition":Acquisition.html. - A protocol for overriding method call semantics. This is used to implement "synchonized" classes and could be used to implement argument type checking. - A protocol for class initialization that supports execution of a special '__class_init__' method after a class has been initialized. Extension classes illustrate how the Python class mechanism can be extended and may provide a basis for improved or specialized class models. Releases To find out what's changed in this release, see the "release notes":release.html. Problem Currently, Python provides two ways of defining new kinds of objects: - Python classes - Extension types Each approach has it's strengths. Extension types provide much greater control to the programmer and, generally, better performance. Because extension types are written in C, the programmer has greater access to external resources. (Note that Python's use of the term type has little to do with the notion of type as a formal specification.) Classes provide a higher level of abstraction and are generally much easier to develop. Classes provide full inheritance support, while support for inheritance when developing extension types is very limited. Classes provide run-time meta-data, such as method documentation strings, that are useful for documentation and discovery. Classes act as factories for creating instances, while separate functions must be provided to create instances of types. It would be useful to combine the features of the two approaches. It would be useful to be able to have better support for inheritance for types, or to be able to subclass from types in Python. It would be useful to be able to have class-like meta-data support for types and the ability to construct instances directly from types. Our software is developed in Python. When necessary, we convert debugged Python routines and classes to C for improved performance. In most cases, a small number of methods in a class is responsible for most of the computation. It should be possible to convert only these methods to C, while leaving the other method in Python. A natural way to approach this is to create a base class in C that contains only the performance-critical aspects of a class' implementation and mix this base class into a Python class. We have need, in a number of projects, for semantics that are slightly different than the usual class and instance semantics, yet we don't want to do most of our development in C. For example, we have developed a persistence mechanism [1] that redefines '__getattr__' and '__setattr__' to take storage-related actions when object state is accessed or modified. We want to be able to take certain actions on *every* attribute reference, but for python class instances, '__getattr__' is only called when attribute lookup fails by normal means. As another example, we would like to have greater control over how methods are bound. Currently, when accessing a class instance attribute, the attribute value is bound together with the instance in a method object *if and only if* the attribute value is a python function. For some applications, we might also want to be able to bind extension functions, or other types of callable objects, such as HTML document templates [2]. Furthermore, we might want to have greater control over how objects are bound. For example, we might want to bind instances and callable objects with special method objects that assure that no more than one thread accesses the object or method at one time. We can provide these special semantics in extension types, but we wish to provide them for classes developed in Python. Background At the first Python Workshop, Don Beaudry presented work [3] done at V.I. Corp to integrate Python with C++ frameworks. This system provided a number of important features, including: - Definition of extension types that provide class-like meta-data and that can be called to create instances. - Ability to subclass in python from C types. - Ability to define classes in python who's data are stored as C structures rather than in dictionaries to better interface to C and C++ libraries, and for better performance. - Less dynamic data structures. In particular, the data structure for a class is declared during class definition. - Support for enumeration types. This work was not released, initially. Shortly after the workshop, changes were made to Python to support the sub-classing features described in [3]. These changes were not documented until the fourth Python Workshop [4]. At the third Python workshop, I presented some work I had done on generating module documentation for extension types. Based on the discussion at this workshop, I developed a meta-type proposal [5]. This meta-type proposal was for an object that simply stored meta-information for a type, for the purpose of generating module documentation. In the summer of 1996, Don Beaudry released the system described in [3] under the name MESS [6]. MESS addresses a number of needs but has a few drawbacks: - Only single inheritance is supported. - The mechanisms for defining MESS extension types is very different from and more complicated than the standard Python type creation mechanism. - Defining MESS types requires the use of an extensive C applications programming interface. This presents problems for configuring dynamically-loaded extension modules unless the MESS library is linked into the Python interpreter. - Because the system tries to do a number of different things, it is fairly large, about 15,000 lines. - There is very little documentation, especially for the C programming interface. - The system is a work in progress, with a number of outstanding bugs. As MESS matures, we expect most of these problems to be addressed. Extension Classes To meet short term needs for a C-based persistence mechanism [1], an extension class module was developed using the mechanism described in [4] and building on ideas from MESS [6]. The extension class module recasts extension types as "extension classes" by seeking to eliminate, or at least reduce semantic differences between types and classes. The module was designed to meet the following goal: - Provide class-like behavior for extension types, including interfaces for meta information and for constructing instances. - Support sub-classing in Python from extension classes, with support for multiple inheritance. - Provide a small hardened implementation that can be used for current products. - Provide a mechanism that requires minimal modification to existing extension types. - Provide a basis for research on alternative semantics for classes and inheritance. **Note:** I use *non-standard* terminology here. By standard *python* terminology, only standard python classes can be called classes. ExtensionClass "classes" are technically just "types" that happen to swim, walk and quack like python classes. Base extension classes and extension subclasses Base extension classes are implemented in C. Extension subclasses are implemented in Python and inherit, directly or indirectly from one or more base extension classes. An extension subclass may inherit from base extension classes, extension subclasses, and ordinary python classes. The usual inheritance order rules apply. Currently, extension subclasses must conform to the following two rules: - The first super class listed in the class statement defining an extension subclass must be either a base extension class or an extension subclass. This restriction will be removed in Python-1.5. - At most one base extension direct or indirect super class may define C data members. If an extension subclass inherits from multiple base extension classes, then all but one must be mix-in classes that provide extension methods but no data. Meta Information Like standard python classes, extension classes have the following attributes containing meta-data: '__doc__' -- a documentation string for the class, '__name__' -- the class name, '__bases__' -- a sequence of base classes, '__dict__' -- a class dictionary, and '__module__' -- the name of the module in which the class was defined. The class dictionary provides access to unbound methods and their documentation strings, including extension methods and special methods, such as methods that implement sequence and numeric protocols. Unbound methods can be called with instance first arguments. Subclass instance data Extension subclass instances have instance dictionaries, just like Python class instances do. When fetching attribute values, extension class instances will first try to obtain data from the base extension class data structure, then from the instance dictionary, then from the class dictionary, and finally from base classes. When setting attributes, extension classes first attempt to use extension base class attribute setting operations, and if these fail, then data are placed in the instance dictionary. Implementing base extension classes A base extension class is implemented in much the same way that an extension type is implemented, except: - The include file, 'ExtensionClass.h', must be included. - The type structure is declared to be of type 'PyExtensionClass', rather than of type 'PyTypeObject'. - The type structure has an additional member that must be defined after the documentation string. This extra member is a method chain ('PyMethodChain') containing a linked list of method definition ('PyMethodDef') lists. Method chains can be used to implement method inheritance in C. Most extensions don't use method chains, but simply define method lists, which are null-terminated arrays of method definitions. A macro, 'METHOD_CHAIN' is defined in 'ExtensionClass.h' that converts a method list to a method chain. (See the example below.) - Module functions that create new instances must be replaced by '__init__' methods that initialize, but does not create storage for instances. - The extension class must be initialized and exported to the module with:: PyExtensionClass_Export(d,"name",type); where 'name' is the module name and 'type' is the extension class type object. Attribute lookup Attribute lookup is performed by calling the base extension class 'getattr' operation for the base extension class that includes C data, or for the first base extension class, if none of the base extension classes include C data. 'ExtensionClass.h' defines a macro 'Py_FindAttrString' that can be used to find an object's attributes that are stored in the object's instance dictionary or in the object's class or base classes:: v = Py_FindAttrString(self,name); where 'name' is a C string containing the attribute name. In addition, a macro is provided that replaces 'Py_FindMethod' calls with logic to perform the same sort of lookup that is provided by 'Py_FindAttrString'. If an attribute name is contained in a Python string object, rather than a C string object, then the macro 'Py_FindAttr' should be used to look up an attribute value. Linking The extension class mechanism was designed to be useful with dynamically linked extension modules. Modules that implement extension classes do not have to be linked against an extension class library. The macro 'PyExtensionClass_Export' imports the 'ExtensionClass' module and uses objects imported from this module to initialize an extension class with necessary behavior. Example: MultiMapping objects An "example":MultiMapping.html, is provided that illustrates the changes needed to convert an existing type to an ExtensionClass. Implementing base extension class constructors Some care should be taken when implementing or overriding base class constructors. When a Python class overrides a base class constructor and fails to call the base class constructor, a program using the class may fail, but it will not crash the interpreter. On the other hand, an extension subclass that overrides a constructor in an extension base class must call the extension base class constructor or risk crashing the interpreter. This is because the base class constructor may set C pointers that, if not set properly, will cause the interpreter to crash when accessed. This is the case with the 'MultiMapping' extension base class shown in the example above. If no base class constructor is provided, extension class instance memory will be initialized to 0. It is a good idea to design extension base classes so that instance methods check for uninitialized memory and perform initialialization if necessary. This was not done above to simplify the example. Overriding methods inherited from Python base classes A problem occurs when trying to overide methods inherited from Python base classes. Consider the following example:: from ExtensionClass import Base class Spam: def __init__(self, name): self.name=name class ECSpam(Base, Spam): def __init__(self, name, favorite_color): Spam.__init__(self,name) self.favorite_color=favorite_color This implementation will fail when an 'ECSpam' object is instantiated. The problem is that 'ECSpam.__init__' calls 'Spam.__init__', and 'Spam.__init__' can only be called with a Python instance (an object of type '"instance"') as the first argument. The first argument passed to 'Spam.__init__' will be an 'ECSpam' instance (an object of type 'ECSPam'). To overcome this problem, extension classes provide a class method 'inheritedAttribute' that can be used to obtain an inherited attribute that is suitable for calling with an extension class instance. Using the 'inheritedAttribute' method, the above example can be rewritten as:: from ExtensionClass import Base class Spam: def __init__(self, name): self.name=name class ECSpam(Base, Spam): def __init__(self, name, favorite_color): ECSpam.inheritedAttribute('__init__')(self,name) self.favorite_color=favorite_color This isn't as pretty but does provide the desired result. New class and instance semantics Context Wrapping It is sometimes useful to be able to wrap up an object together with a containing object. I call this "context wrapping" because an object is accessed in the context of the object it is accessed through. We have found many applications for this, including: - User-defined method objects, - "Acquisition":Acquisition.html, and - Computed attributes User-defined method objects Python classes wrap Python function attributes into methods. When a class has a function attribute that is accessed as an instance attribute, a method object is created and returned that contains references to the original function and instance. When the method is called, the original function is called with the instance as the first argument followed by any arguments passed to the method. Extension classes provide a similar mechanism for attributes that are Python functions or inherited extension functions. In addition, if an extension class attribute is an instance of an extension class that defines an '__of__' method, then when the attribute is accessed through an instance, it's '__of__' method will be called to create a bound method. Consider the following example:: import ExtensionClass class CustomMethod(ExtensionClass.Base): def __call__(self,ob): print 'a %s was called' % ob.__class__.__name__ class wrapper: def __init__(self,m,o): self.meth, self.ob=m,o def __call__(self): self.meth(self.ob) def __of__(self,o): return self.wrapper(self,o) class bar(ExtensionClass.Base): hi=CustomMethod() x=bar() hi=x.hi() Note that 'ExtensionClass.Base' is a base extension class that provides very basic ExtensionClass behavior. When run, this program outputs: 'a bar was called'. Computed Attributes It is not uncommon to wish to expose information via the attribute interface without affecting implementation data structures. One can use a custom '__getattr__' method to implement computed attributes, however, this can be a bit cumbersome and can interfere with other uses of '__getattr__', such as for persistence. The '__of__' protocol provides a convenient way to implement computed attributes. First, we define a ComputedAttribute class. a ComputedAttribute is constructed with a function to be used to compute an attribute, and calls the function when it's '__of__' method is called: import ExtensionClass class ComputedAttribute(ExtensionClass.Base): def __init__(self, func): self.func=func def __of__(self, parent): return self.func(parent) Then we can use this class to create computed attributes. In the example below, we create a computed attribute, 'radius': from math import sqrt class Point(ExtensionClass.Base): def __init__(self, x, y): self.x, self.y = x, y radius=ComputedAttribute(lambda self: sqrt(self.x**2+self.y**2)) which we can use just like an ordinary attribute: p=Point(2,2) print p.radius Overriding method calls Normally, when a method is called, the function wrapped by the method is called directly by the method. In some cases, it is useful for user-defined logic to participate in the actual function call. Extension classes introduce a new protocol that provides extension classes greater control over how their methods are called. If an extension class defines a special method, '__call_method__', then this method will be called to call the functions (or other callable object) wrapped by the method. The method. '__call_method__' should provide the same interface as provided by the Python builtin 'apply' function. For example, consider the expression: 'x.meth(arg1, arg2)'. The expression is evaluated by first computing a method object that wraps 'x' and the attribute of 'x' stored under the name 'meth'. Assuming that 'x' has a '__call_method__' method defined, then the '__call_method__' method of 'x' will be called with two arguments, the attribute of 'x' stored under the name 'meth', and a tuple containing 'x', 'arg1', and 'arg2'. To see how this feature may be used, see the Python module, 'Syn.py', which is included in the ExtensionClass distribution. This module provides a mix-in class that provides Java-like "synchonized" classes that limit access to their methods to one thread at a time. An interesting application of this mechanism would be to implement interface checking on method calls. Method attributes Methods of ExtensionClass instances can have user-defined attributes, which are stored in their associated instances. For example:: class C(ExtensionClass.Base): def f(self): "Get a secret" .... c=C() c.f.__roles__=['Trusted People'] print c.f.__roles__ # outputs ['Trusted People'] print c.f__roles__ # outputs ['Trusted People'] print C.f.__roles__ # fails, unbound method A bound method attribute is set by setting an attribute in it's instance with a name consisting of the concatination of the method's '__name__' attribute and the attribute name. Attributes cannot be set on unbound methods. Class initialization Normal Python class initialization is similar to but subtley different from instance initialization. An instance '__init__' function is called on an instance immediately *after* it is created. An instance '__init__' function can use instance information, like it's class and can pass the instance to other functions. On the other hand, the code in class statements is executed immediately *before* the class is created. This means that the code in a class statement cannot use class attributes, like '__bases__', or pass the class to functions. Extension classes provide a mechanism for specifying code to be run *after* a class has been created. If a class or one of it's base classes defines a '__class_init__' method, then this method will be called just after a class has been created. The one argument passed to the method will be the class, *not* an instance of the class. Useful macros defined in ExtensionClass.h A number of useful macros are defined in ExtensionClass.h. These are documented in 'ExtensionClass.h'. Pickleability Classes created with ExtensionClass, including extension base classes are automatically pickleable. The usual gymnastics necessary to pickle 'non-standard' types are not necessray for types that have been modified to be extension base classes. Status The current release of the extension class module is "1.1", http://www.digicool.com/releases/ExtensionClass/ExtensionClass-1.1.tar.gz. The core implementation has less than four thousand lines of code, including comments. This release requires Python 1.4 or higher. To find out what's changed in this release, see the "release notes":release.html. "Installation instructions":Installation.html, are provided. Issues There are a number of issues that came up in the course of this work and that deserve mention. - In Python 1.4, the class extension mechanism described in [4] required that the first superclass in a list of super-classes must be of the extended class type. This may not be convenient if mix-in behavior is desired. If a list of base classes starts with a standard python class, but includes an extension class, then an error was raised. It would be more useful if, when a list of base classes contains one or more objects that are not python classes, the first such object was used to control the extended class definition. To get around this, the 'ExtensionClass' module exports a base extension class, 'Base', that can be used as the first base class in a list of base classes to assure that an extension subclass is created. Python 1.5 allows the class extension even if the first non-class object in the list of base classes is not the first object in the list. This issue appears to go away in Python 1.5, however, the restriction that the first non-class object in a list of base classes must be the first in the list may reappear in later versions of Python. - Currently, only one base extension class can define any data in C. The data layout of subclasses-instances is the same as for the base class that defines data in C, except that the data structure is extended to hold an instance dictionary. The data structure begins with a standard python header, and extension methods expect the C instance data to occur immediately after the object header. If two or more base classes defined C data, the methods for the different base classes would expect their data to be in the same location. A solution might be to allocate base class instances and store pointers to these instances in the subclass data structure. The method binding mechanism would have to be a more complicated to make sure that methods were bound to the correct base data structure. Alternatively, the signature of C methods could be expanded to allow pointers to expected class data to be passed in addition to object pointers. - There is currently no support for sub-classing in C, beyond that provided by method chains. - Rules for mixed-type arithmetic are different for python class instances than they are for extension type instances. Python classes can define right and left versions of numeric binary operators, or they can define a coercion operator for converting binary operator operands to a common type. For extension types, only the latter, coercion-based, approach is supported. The coercion-based approach does not work well for many data types for which coercion rules depend on the operator. Because extension classes are based on extension types, they are currently limited to the coercion-based approach. It should be possible to extend the extension class implementation to allow both types of mixed-type arithmetic control. - I considered making extension classes immutable, meaning that class attributes could not be set after class creation. I also considered making extension subclasses cache inherited attributes. Both of these are related and attractive for some applications, however, I decided that it would be better to retain standard class instance semantics and provide these features as options at a later time. - The extension class module defines new method types to bind C and python methods to extension class instances. It would be useful for these method objects to provide access to function call information, such as the number and names of arguments and the number of defaults, by parsing extension function documentation strings. Applications Aside from test and demonstration applications, the extension class mechanism has been used to provide an extension-based implementation of the persistence mechanism described in [1]. We have developed this further to provide features such as automatic deactivation of objects not used after some period of time and to provide more efficient persistent-object cache management. Acquisition has been heavily used in our recent products. Synchonized classes have also been used in recent products. Summary The extension-class mechanism described here provides a way to add class services to extension types. It allows: - Sub-classing extension classes in Python, - Construction of extension class instances by calling extension classes, - Extension classes to provide meta-data, such as unbound methods and their documentation string. In addition, the extension class module provides a relatively concise example of the use of mechanisms that were added to Python to support MESS [6], and that were described at the fourth Python Workshop [4]. It is hoped that this will spur research in improved and specialized models for class implementation in Python. References .. [1] Fulton, J., "Providing Persistence for World-Wide-Web Applications", http://www.digicool.com/papers/Persistence.html, Proceedings of the 5th Python Workshop. .. [2] Page, R. and Cropper, S., "Document Template", http://www.digicool.com/papers/DocumentTemplate.html, Proceedings of the 5th Python Workshop. .. [3] Beaudry, D., "Deriving Built-In Classes in Python", http://www.python.org/workshops/1994-11/BuiltInClasses/BuiltInClasses_1.html, Proceedings of the First International Python Workshop. .. [4] Van Rossum, G., "Don Beaudry Hack - MESS", http://www.python.org/workshops/1996-06/notes/thursday.html, presented in the Developer's Future Enhancements session of the 4th Python Workshop. .. [5] Fulton, J., "Meta-Type Object", http://www.digicool.com/jim/MetaType.c, This is a small proposal, the text of which is contained in a sample implementation source file, .. [6] Beaudry, D., and Ascher, D., "The Meta-Extension Set", http://starship.skyport.net/~da/mess/. Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/Installation100644 1007 1403 7536 6624556762 24562 0ustar petrillipetrilliInstallation "Copyright (C) 1996-1998, Digital Creations":COPYRIGHT.html. The ExtensionClass distribution now uses the "Universal Unix Makefile for Python extensions", 'Makefile.pre.in', which was introduced as part of Python1.4. Copies of this file for Python 1.4 and Python 1.5 are included with this release. See the instructions in the make file, itself. Note that you will need to copy or rename the the file for the Python version you're using to Makefile.pre.in. Files ExtensionClass.stx -- This file in structured text format ExtensionClass.html -- This file in HTML format Installation -- Installation instructions in structured text format. Installation.html -- Installation instructions in HTML format. Acquisition.stx -- Acquisition documentation in structured text format. Acquisition.html -- Acquisition documentation in HTML format. MultiMapping.stx -- The MultiMapping example in structured text format. MultiMapping.html -- The MultiMapping example in structured text format. release.notes -- Release notes in structured text format. release.html -- Release notes in HTML format. README -- A file that says to read this file. Makefile.pre.in-1.4 -- The Universal Unix Makefile for Python extensions. This is the Python 1.4 version. Copy this to Makefile.pre.in before using it. Makefile.pre.in-1.5 -- The Universal Unix Makefile for Python extensions. This is the Python 1.5 version. Copy this to Makefile.pre.in before using it. Setup -- a configuration file used by the Universal Unix Makefile for Python extensions ExtensionClass.c -- The ExtensionClass source ExtensionClass.h -- The ExtensionClass header file Acquisition.c -- The source for the 'Acquisition' module that provides mix-in classes to support environmental acquisition MethodObject.c -- The source for the 'MethodObject' module that provides a mix-in class for user-defined method types. To create a user-defined method type, just create an extension subclass of 'MethodObject.MethodObject' that has an '__call__' method. Missing.c -- The source for the 'Missing' module that provides a class for objects that model "missing" or unknown data. Missing objects have the property that all mathematical operations yield a missing value. This is included mainly as an example (and test) of a numeric extension base class. MultiMapping.c -- The source for a slightly enhanced 'MultiMapping' module that is based on the 'MultiMapping' example given in this paper. If present, document templates [2] will take advantage of this module to significantly increase rendering performance. Sync.py -- A Python module that provides a 'Synchonized' mix-in class that limits access to an object's methods to one thread at a time. This requires the installation of the ThreadLock module. ThreadLock.c -- The source for the 'ThreadLock' module that provides 'ThreadLock' objects. These are similar to the lock objects provided by the 'thread' modules. Unlike normal Python lock objects, 'ThreadLock' objects can be acquired (and released) more than once by the same thread. In addition to the files listed above, several "test" modules are included. These are modules that I used to test ExtensionClass. They do not constitute a regression testing suit and I've made little effort to assure that they actually work, although that would be a good thing to do if time permits. Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/MethodObject.c100644 1007 1403 6367 6624351574 24704 0ustar petrillipetrilli/* Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: o Redistributions of source code must retain the above copyright notice, this list of conditions, and the disclaimer that follows. o 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. o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL CREATIONS 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. $Id: MethodObject.c,v 1.5 1998/11/17 19:50:20 jim Exp $ If you have questions regarding this software, contact: Digital Creations L.C. info@digicool.com (540) 371-6909 */ #include "ExtensionClass.h" static PyObject * of(PyObject *self, PyObject *args) { PyObject *inst; if(PyArg_Parse(args,"O",&inst)) return PyECMethod_New(self,inst); else return NULL; } struct PyMethodDef Method_methods[] = { {"__of__",(PyCFunction)of,0,""}, {NULL, NULL} /* sentinel */ }; static struct PyMethodDef methods[] = {{NULL, NULL}}; void initMethodObject() { PyObject *m, *d; char *rev="$Revision: 1.5 $"; PURE_MIXIN_CLASS(Method, "Base class for objects that want to be treated as methods\n" "\n" "The method class provides a method, __of__, that\n" "binds an object to an instance. If a method is a subobject\n" "of an extension-class instance, the the method will be bound\n" "to the instance and when the resulting object is called, it\n" "will call the method and pass the instance in addition to\n" "other arguments. It is the responsibility of Method objects\n" "to implement (or inherit) a __call__ method.\n", Method_methods); /* Create the module and add the functions */ m = Py_InitModule4("MethodObject", methods, "Method-object mix-in class module\n\n" "$Id: MethodObject.c,v 1.5 1998/11/17 19:50:20 jim Exp $\n", (PyObject*)NULL,PYTHON_API_VERSION); d = PyModule_GetDict(m); PyExtensionClass_Export(d,"Method",MethodType); PyDict_SetItemString(d,"__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); /* Check for errors */ CHECK_FOR_ERRORS("can't initialize module MethodObject"); } Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/Missing.c100644 1007 1403 22536 6761047341 23756 0ustar petrillipetrilli/* Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: o Redistributions of source code must retain the above copyright notice, this list of conditions, and the disclaimer that follows. o 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. o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL CREATIONS 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. $Id: Missing.c,v 1.10 1999/08/25 20:15:29 jim Exp $ If you have questions regarding this software, contact: Digital Creations L.C. info@digicool.com (540) 371-6909 */ static char Missing_module_documentation[] = "" "\n$Id: Missing.c,v 1.10 1999/08/25 20:15:29 jim Exp $" ; #include #include "ExtensionClass.h" /* Declarations for objects of type Missing */ typedef struct { PyObject_HEAD } Missing; static PyObject *vname=0, *Missing_dot_Value=0, *empty_string=0, *reduce=0; static PyObject *theValue; static void Missing_dealloc(Missing *self) { Py_DECREF(self->ob_type); PyMem_DEL(self); } static PyObject * Missing_repr(Missing *self) { Py_INCREF(Missing_dot_Value); return Missing_dot_Value; } static PyObject * Missing_str(Missing *self) { Py_INCREF(empty_string); return empty_string; } /* Code to access Missing objects as numbers */ static PyObject * Missing_bin(PyObject *v, PyObject *w) { Py_INCREF(v); return v; } static PyObject * Missing_pow(PyObject *v, PyObject *w, PyObject *z) { Py_INCREF(v); return v; } static PyObject * Missing_un(PyObject *v) { Py_INCREF(v); return v; } static int Missing_nonzero(PyObject *v) { return 0; } static int Missing_coerce(PyObject **pv, PyObject **pw) { Py_INCREF(*pv); Py_INCREF(*pw); return 0; } static PyObject * Missing_int(Missing *v) { PyErr_SetString(PyExc_TypeError, "Missing objects do not support conversion to integer"); return NULL; } static PyObject * Missing_long(Missing *v) { PyErr_SetString(PyExc_TypeError, "Missing objects do not support conversion to long"); return NULL; } static PyObject * Missing_float(Missing *v) { PyErr_SetString(PyExc_TypeError, "Missing objects do not support conversion to float"); return NULL; } static PyObject * Missing_oct(Missing *v) { PyErr_SetString(PyExc_TypeError, "Missing objects do not support conversion to an octal string"); return NULL; } static PyObject * Missing_hex(Missing *v) { PyErr_SetString(PyExc_TypeError, "Missing objects do not support conversion to hexadecimal strings"); return NULL; } static PyNumberMethods Missing_as_number = { (binaryfunc)Missing_bin, /*nb_add*/ (binaryfunc)Missing_bin, /*nb_subtract*/ (binaryfunc)Missing_bin, /*nb_multiply*/ (binaryfunc)Missing_bin, /*nb_divide*/ (binaryfunc)Missing_bin, /*nb_remainder*/ (binaryfunc)Missing_bin, /*nb_divmod*/ (ternaryfunc)Missing_pow, /*nb_power*/ (unaryfunc)Missing_un, /*nb_negative*/ (unaryfunc)Missing_un, /*nb_positive*/ (unaryfunc)Missing_un, /*nb_absolute*/ (inquiry)Missing_nonzero, /*nb_nonzero*/ (unaryfunc)Missing_un, /*nb_invert*/ (binaryfunc)Missing_bin, /*nb_lshift*/ (binaryfunc)Missing_bin, /*nb_rshift*/ (binaryfunc)Missing_bin, /*nb_and*/ (binaryfunc)Missing_bin, /*nb_xor*/ (binaryfunc)Missing_bin, /*nb_or*/ (coercion)Missing_coerce, /*nb_coerce*/ (unaryfunc)Missing_int, /*nb_int*/ (unaryfunc)Missing_long, /*nb_long*/ (unaryfunc)Missing_float, /*nb_float*/ (unaryfunc)Missing_oct, /*nb_oct*/ (unaryfunc)Missing_hex, /*nb_hex*/ }; /* ------------------------------------------------------- */ static PyObject * Missing_reduce(PyObject *self, PyObject *args, PyObject *kw) { if(self==theValue) { Py_INCREF(vname); return vname; } return Py_BuildValue("O()",self->ob_type); } static struct PyMethodDef reduce_ml[] = { {"__reduce__", (PyCFunction)Missing_reduce, 1, "Return a missing value reduced to standard python objects" } }; static PyObject * Missing_getattr(PyObject *self, PyObject *name) { char *c, *legal; if(!(c=PyString_AsString(name))) return NULL; legal=c; if (strchr("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ", *legal) != NULL) { for (legal++; *legal; legal++) if (strchr("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_", *legal) == NULL) { legal=NULL; break; } } else legal=NULL; if(! legal) { if(strcmp(c,"__reduce__")==0) { if(self==theValue) { Py_INCREF(reduce); return reduce; } return PyCFunction_New(reduce_ml, self); } PyErr_SetObject(PyExc_AttributeError, name); return NULL; } Py_INCREF(self); return self; } static PyObject * Missing_call(PyObject *self, PyObject *args, PyObject *kw) { Py_INCREF(self); return self; } static int Missing_cmp(Missing *m1, Missing *m2) { return m1->ob_type != m2->ob_type ; } static PyExtensionClass MissingType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Missing", /*tp_name*/ sizeof(Missing), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Missing_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*obsolete tp_getattr*/ (setattrfunc)0, /*obsolete tp_setattr*/ (cmpfunc)Missing_cmp, /*tp_compare*/ (reprfunc)Missing_repr, /*tp_repr*/ &Missing_as_number, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)Missing_call, /*tp_call*/ (reprfunc)Missing_str, /*tp_str*/ (getattrofunc)Missing_getattr, /*tp_getattro*/ (setattrofunc)0, /*tp_setattro*/ /* Space for future expansion */ 0L,0L, "Represent totally unknown quantities\n" "\n" "Missing values are used to represent numberic quantities that are\n" "unknown. They support all mathematical operations except\n" "conversions by returning themselves.\n", METHOD_CHAIN(NULL) }; /* End of code for Missing objects */ /* -------------------------------------------------------- */ /* List of methods defined in the module */ static struct PyMethodDef Module_Level__methods[] = { {NULL, (PyCFunction)NULL, 0, NULL} /* sentinel */ }; void initMissing() { PyObject *m, *d; char *rev="$Revision: 1.10 $"; if(! ((vname=PyString_FromString("V")) && (Missing_dot_Value=PyString_FromString("Missing.Value")) && (empty_string=PyString_FromString("")) )) return; /* Create the module and add the functions */ m = Py_InitModule4("Missing", Module_Level__methods, Missing_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); /* Add some symbolic constants to the module */ d = PyModule_GetDict(m); PyDict_SetItemString(d, "__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); PyExtensionClass_Export(d,"Missing",MissingType); theValue=PyObject_CallObject((PyObject*)&MissingType, NULL); reduce=PyCFunction_New(reduce_ml, theValue); PyDict_SetItemString(d, "Value", theValue); PyDict_SetItemString(d, "V", theValue); PyDict_SetItemString(d, "MV", theValue); /* Check for errors */ if (PyErr_Occurred()) Py_FatalError("can't initialize module Missing"); } /***************************************************************************** Revision Log: $Log: Missing.c,v $ Revision 1.10 1999/08/25 20:15:29 jim Made getattr a bit pickler to prevent getting attributes like "%f5.3". Revision 1.9 1999/06/10 20:09:47 jim Updated to use new ExtensionClass destructor protocol. Revision 1.8 1998/11/17 19:54:33 jim new copyright. Revision 1.7 1997/10/03 14:43:27 jim Fixed comparison bug, again :-( Revision 1.6 1997/09/23 16:06:03 jim Added MV member. Revision 1.5 1997/09/23 15:17:12 jim Added cmp. Revision 1.4 1997/09/18 21:01:33 jim Added check to getattr to fail on methods that begin with underscore. Note that Missing really defeats testing from protocols by testing for attributes. Revision 1.3 1997/09/17 22:49:35 jim Fixed refcount bug. Added logic so: Missing.Value.spam() returns Missing.Value. Added logic to make Missing.Value picklable. Revision 1.2 1997/07/02 20:19:37 jim Got rid of unused macros and ErrorObject. Revision 1.1 1997/07/01 21:36:34 jim *****************************************************************************/ Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/MultiMapping.c100644 1007 1403 15112 6730015706 24737 0ustar petrillipetrilli/* Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: o Redistributions of source code must retain the above copyright notice, this list of conditions, and the disclaimer that follows. o 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. o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL CREATIONS 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. $Id: MultiMapping.c,v 1.8 1999/06/10 20:10:46 jim Exp $ If you have questions regarding this software, contact: Digital Creations L.C. info@digicool.com (540) 371-6909 */ #include "Python.h" #include "ExtensionClass.h" #define UNLESS(E) if(!(E)) typedef struct { PyObject_HEAD PyObject *data; } MMobject; staticforward PyExtensionClass MMtype; static PyObject * MM_push(MMobject *self, PyObject *args) { PyObject *src; UNLESS(PyArg_ParseTuple(args, "O", &src)) return NULL; UNLESS(-1 != PyList_Append(self->data,src)) return NULL; Py_INCREF(Py_None); return Py_None; } static PyObject * MM_pop(MMobject *self, PyObject *args) { int i=1, l; PyObject *r; if(args) UNLESS(PyArg_ParseTuple(args, "|i", &i)) return NULL; if((l=PyList_Size(self->data)) < 0) return NULL; i=l-i; UNLESS(r=PySequence_GetItem(self->data,l-1)) return NULL; if(PyList_SetSlice(self->data,i,l,NULL) < 0) goto err; return r; err: Py_DECREF(r); return NULL; } static PyObject * MM__init__(MMobject *self, PyObject *args) { UNLESS(self->data=PyList_New(0)) return NULL; if (args) { int l, i; if ((l=PyTuple_Size(args)) < 0) return NULL; for (i=0; i < l; i++) if (PyList_Append(self->data, PyTuple_GET_ITEM(args, i)) < 0) return NULL; } Py_INCREF(Py_None); return Py_None; } static PyObject * MM_subscript(MMobject *self, PyObject *key) { long i; PyObject *e; UNLESS(-1 != (i=PyList_Size(self->data))) return NULL; while(--i >= 0) { e=PyList_GetItem(self->data,i); if((e=PyObject_GetItem(e,key))) return e; PyErr_Clear(); } PyErr_SetObject(PyExc_KeyError,key); return NULL; } static PyObject * MM_has_key(MMobject *self, PyObject *args) { PyObject *key; UNLESS(PyArg_ParseTuple(args,"O",&key)) return NULL; if((key=MM_subscript(self, key))) { Py_DECREF(key); return PyInt_FromLong(1); } PyErr_Clear(); return PyInt_FromLong(0); } static PyObject * MM_get(MMobject *self, PyObject *args) { PyObject *key, *d=Py_None; UNLESS(PyArg_ParseTuple(args,"O|O",&key,&d)) return NULL; if((key=MM_subscript(self, key))) return key; PyErr_Clear(); Py_INCREF(d); return d; } static struct PyMethodDef MM_methods[] = { {"__init__", (PyCFunction)MM__init__, METH_VARARGS, "__init__([m1, m2, ...]) -- Create a new empty multi-mapping"}, {"get", (PyCFunction) MM_get, METH_VARARGS, "get(key,[default]) -- Return a value for the given key or a default"}, {"has_key", (PyCFunction) MM_has_key, METH_VARARGS, "has_key(key) -- Return 1 if the mapping has the key, and 0 otherwise"}, {"push", (PyCFunction) MM_push, METH_VARARGS, "push(mapping_object) -- Add a data source"}, {"pop", (PyCFunction) MM_pop, METH_VARARGS, "pop([n]) -- Remove and return the last data source added"}, {NULL, NULL} /* sentinel */ }; static void MM_dealloc(MMobject *self) { Py_XDECREF(self->data); Py_DECREF(self->ob_type); PyMem_DEL(self); } static PyObject * MM_getattr(MMobject *self, char *name) { return Py_FindMethod(MM_methods, (PyObject *)self, name); } static int MM_length(MMobject *self) { long l=0, el, i; PyObject *e=0; UNLESS(-1 != (i=PyList_Size(self->data))) return -1; while(--i >= 0) { e=PyList_GetItem(self->data,i); UNLESS(-1 != (el=PyObject_Length(e))) return -1; l+=el; } return l; } static PyMappingMethods MM_as_mapping = { (inquiry)MM_length, /*mp_length*/ (binaryfunc)MM_subscript, /*mp_subscript*/ (objobjargproc)NULL, /*mp_ass_subscript*/ }; /* -------------------------------------------------------- */ static char MMtype__doc__[] = "MultiMapping -- Combine multiple mapping objects for lookup" ; static PyExtensionClass MMtype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "MultiMapping", /*tp_name*/ sizeof(MMobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)MM_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)MM_getattr, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &MM_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, MMtype__doc__, /* Documentation string */ METHOD_CHAIN(MM_methods) }; static struct PyMethodDef MultiMapping_methods[] = { {NULL, NULL} /* sentinel */ }; void initMultiMapping() { PyObject *m, *d; char *rev="$Revision: 1.8 $"; m = Py_InitModule4( "MultiMapping", MultiMapping_methods, "MultiMapping -- Wrap multiple mapping objects for lookup" "\n\n" "$Id: MultiMapping.c,v 1.8 1999/06/10 20:10:46 jim Exp $\n", (PyObject*)NULL,PYTHON_API_VERSION); d = PyModule_GetDict(m); PyExtensionClass_Export(d,"MultiMapping",MMtype); PyDict_SetItemString(d,"__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); if (PyErr_Occurred()) Py_FatalError("can't initialize module MultiMapping"); } Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/MultiMapping.stx100644 1007 1403 32002 6624556762 25346 0ustar petrillipetrilliExample: MultiMapping objects "Copyright (C) 1996-1998, Digital Creations":COPYRIGHT.html. As an example, consider an extension class that implements a "MultiMapping". A multi-mapping is an object that encapsulates 0 or more mapping objects. When an attempt is made to lookup an object, the encapsulated mapping objects are searched until an object is found. Consider an implementation of a MultiMapping extension type, without use of the extension class mechanism:: #include "Python.h" #define UNLESS(E) if(!(E)) typedef struct { PyObject_HEAD PyObject *data; } MMobject; staticforward PyTypeObject MMtype; static PyObject * MM_push(MMobject *self, PyObject *args){ PyObject *src; UNLESS(PyArg_ParseTuple(args, "O", &src)) return NULL; UNLESS(-1 != PyList_Append(self->data,src)) return NULL; Py_INCREF(Py_None); return Py_None; } static PyObject * MM_pop(MMobject *self, PyObject *args){ long l; PyObject *r; static PyObject *emptyList=0; UNLESS(emptyList) UNLESS(emptyList=PyList_New(0)) return NULL; UNLESS(PyArg_ParseTuple(args, "")) return NULL; UNLESS(-1 != (l=PyList_Size(self->data))) return NULL; l--; UNLESS(r=PySequence_GetItem(self->data,l)) return NULL; UNLESS(-1 != PyList_SetSlice(self->data,l,l+1,emptyList)) goto err; return r; err: Py_DECREF(r); return NULL; } static struct PyMethodDef MM_methods[] = { {"push", (PyCFunction) MM_push, 1, "push(mapping_object) -- Add a data source"}, {"pop", (PyCFunction) MM_pop, 1, "pop() -- Remove and return the last data source added"}, {NULL, NULL} /* sentinel */ }; static PyObject * newMMobject(PyObject *ignored, PyObject *args){ MMobject *self; UNLESS(PyArg_ParseTuple(args, "")) return NULL; UNLESS(self = PyObject_NEW(MMobject, &MMtype)) return NULL; UNLESS(self->data=PyList_New(0)) goto err; return (PyObject *)self; err: Py_DECREF(self); return NULL; } static void MM_dealloc(MMobject *self){ Py_XDECREF(self->data); PyMem_DEL(self); } static PyObject * MM_getattr(MMobject *self, char *name){ return Py_FindMethod(MM_methods, (PyObject *)self, name); } static int MM_length(MMobject *self){ long l=0, el, i; PyObject *e=0; UNLESS(-1 != (i=PyList_Size(self->data))) return -1; while(--i >= 0) { e=PyList_GetItem(self->data,i); UNLESS(-1 != (el=PyObject_Length(e))) return -1; l+=el; } return l; } static PyObject * MM_subscript(MMobject *self, PyObject *key){ long i; PyObject *e; UNLESS(-1 != (i=PyList_Size(self->data))) return NULL; while(--i >= 0) { e=PyList_GetItem(self->data,i); if(e=PyObject_GetItem(e,key)) return e; PyErr_Clear(); } PyErr_SetObject(PyExc_KeyError,key); return NULL; } static PyMappingMethods MM_as_mapping = { (inquiry)MM_length, /*mp_length*/ (binaryfunc)MM_subscript, /*mp_subscript*/ (objobjargproc)NULL, /*mp_ass_subscript*/ }; /* -------------------------------------------------------- */ static char MMtype__doc__[] = "MultiMapping -- Combine multiple mapping objects for lookup" ; static PyTypeObject MMtype = { PyObject_HEAD_INIT(&PyType_Type) 0, /*ob_size*/ "MultMapping", /*tp_name*/ sizeof(MMobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)MM_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)MM_getattr, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &MM_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, MMtype__doc__ /* Documentation string */ }; static struct PyMethodDef MultiMapping_methods[] = { {"MultiMapping", (PyCFunction)newMMobject, 1, "MultiMapping() -- Create a new empty multi-mapping"}, {NULL, NULL} /* sentinel */ }; void initMultiMapping(){ PyObject *m; m = Py_InitModule4( "MultiMapping", MultiMapping_methods, "MultiMapping -- Wrap multiple mapping objects for lookup", (PyObject*)NULL,PYTHON_API_VERSION); if (PyErr_Occurred()) Py_FatalError("can't initialize module MultiMapping"); } This module defines an extension type, 'MultiMapping', and exports a module function, 'MultiMapping', that creates 'MultiMapping' Instances. The type provides two methods, 'push', and 'pop', for adding and removing mapping objects to the multi-mapping. The type provides mapping behavior, implementing mapping length and subscript operators but not mapping a subscript assignment operator. Now consider an extension class implementation of MultiMapping objects:: #include "Python.h" #include "ExtensionClass.h" #define UNLESS(E) if(!(E)) typedef struct { PyObject_HEAD PyObject *data; } MMobject; staticforward PyExtensionClass MMtype; static PyObject * MM_push(self, args) MMobject *self; PyObject *args; { PyObject *src; UNLESS(PyArg_ParseTuple(args, "O", &src)) return NULL; UNLESS(-1 != PyList_Append(self->data,src)) return NULL; Py_INCREF(Py_None); return Py_None; } static PyObject * MM_pop(self, args) MMobject *self; PyObject *args; { long l; PyObject *r; static PyObject *emptyList=0; UNLESS(emptyList) UNLESS(emptyList=PyList_New(0)) return NULL; UNLESS(PyArg_ParseTuple(args, "")) return NULL; UNLESS(-1 != (l=PyList_Size(self->data))) return NULL; l--; UNLESS(r=PySequence_GetItem(self->data,l)) return NULL; UNLESS(-1 != PyList_SetSlice(self->data,l,l+1,emptyList)) goto err; return r; err: Py_DECREF(r); return NULL; } static PyObject * MM__init__(self, args) MMobject *self; PyObject *args; { UNLESS(PyArg_ParseTuple(args, "")) return NULL; UNLESS(self->data=PyList_New(0)) goto err; Py_INCREF(Py_None); return Py_None; err: Py_DECREF(self); return NULL; } static struct PyMethodDef MM_methods[] = { {"__init__", (PyCFunction)MM__init__, 1, "__init__() -- Create a new empty multi-mapping"}, {"push", (PyCFunction) MM_push, 1, "push(mapping_object) -- Add a data source"}, {"pop", (PyCFunction) MM_pop, 1, "pop() -- Remove and return the last data source added"}, {NULL, NULL} /* sentinel */ }; static void MM_dealloc(self) MMobject *self; { Py_XDECREF(self->data); PyMem_DEL(self); } static PyObject * MM_getattr(self, name) MMobject *self; char *name; { return Py_FindMethod(MM_methods, (PyObject *)self, name); } static int MM_length(self) MMobject *self; { long l=0, el, i; PyObject *e=0; UNLESS(-1 != (i=PyList_Size(self->data))) return -1; while(--i >= 0) { e=PyList_GetItem(self->data,i); UNLESS(-1 != (el=PyObject_Length(e))) return -1; l+=el; } return l; } static PyObject * MM_subscript(self, key) MMobject *self; PyObject *key; { long i; PyObject *e; UNLESS(-1 != (i=PyList_Size(self->data))) return NULL; while(--i >= 0) { e=PyList_GetItem(self->data,i); if(e=PyObject_GetItem(e,key)) return e; PyErr_Clear(); } PyErr_SetObject(PyExc_KeyError,key); return NULL; } static PyMappingMethods MM_as_mapping = { (inquiry)MM_length, /*mp_length*/ (binaryfunc)MM_subscript, /*mp_subscript*/ (objobjargproc)NULL, /*mp_ass_subscript*/ }; /* -------------------------------------------------------- */ static char MMtype__doc__[] = "MultiMapping -- Combine multiple mapping objects for lookup" ; static PyExtensionClass MMtype = { PyObject_HEAD_INIT(&PyType_Type) 0, /*ob_size*/ "MultMapping", /*tp_name*/ sizeof(MMobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)MM_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)MM_getattr, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &MM_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, MMtype__doc__, /* Documentation string */ METHOD_CHAIN(MM_methods) }; static struct PyMethodDef MultiMapping_methods[] = { {NULL, NULL} /* sentinel */ }; void initMultiMapping() { PyObject *m, *d; m = Py_InitModule4( "MultiMapping", MultiMapping_methods, "MultiMapping -- Wrap multiple mapping objects for lookup", (PyObject*)NULL,PYTHON_API_VERSION); d = PyModule_GetDict(m); PyExtensionClass_Export(d,"MultiMapping",MMtype); if (PyErr_Occurred()) Py_FatalError("can't initialize module MultiMapping"); } This version includes 'ExtensionClass.h'. The two declarations of 'MMtype' have been changed from 'PyTypeObject' to 'PyExtensionClass'. The 'METHOD_CHAIN' macro has been used to add methods to the end of the definition for 'MMtype'. The module function, newMMobject has been replaced by the 'MMtype' method, 'MM__init__'. Note that this method does not create or return a new object. Finally, the lines:: d = PyModule_GetDict(m); PyExtensionClass_Export(d,"MultiMapping",MMtype); Have been added to both initialize the extension class and to export it in the module dictionary. To use this module, compile, link, and import it as with any other extension module. The following python code illustrates the module's use:: from MultiMapping import MultiMapping m=MultiMapping() m.push({'spam':1, 'eggs':2}) m.push({'spam':3, 'ham':4}) m['spam'] # returns 3 m['ham'] # returns 4 m['foo'] # raises a key error Creating the 'MultiMapping' object took three steps, one to create an empty 'MultiMapping', and two to add mapping objects to it. We might wish to simplify the process of creating MultiMapping objects by providing a constructor that takes source mapping objects as parameters. We can do this by sub-classing MultiMapping in Python:: from MultiMapping import MultiMapping class ExtendedMultiMapping(MultiMapping): def __init__(self,*data): MultiMapping.__init__(self) for d in data: self.push(d) m=ExtendedMultiMapping({'spam':1, 'eggs':2}, {'spam':3, 'ham':4}) m['spam'] # returns 3 m['ham'] # returns 4 m['foo'] # raises a key error Note that the source file included in the ExtensionClass distribution has numerous enhancements beyond the version shown in this document. Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/README100644 1007 1403 261 6356510443 23006 0ustar petrillipetrilliSee the file ExtensionClass.stx or ExtensionClass.html for a description of extension class and for installation instructions. For more information, contact info@digicool.com Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/Record.c100644 1007 1403 41057 6730016011 23544 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ static char Record_module_documentation[] = "" "\n$Id: Record.c,v 1.8 1999/06/10 20:11:53 jim Exp $" ; #ifdef PERSISTENCE #include "cPersistence.h" #else #include "ExtensionClass.h" #endif /* ----------------------------------------------------- */ static void PyVar_Assign(PyObject **v, PyObject *e) { Py_XDECREF(*v); *v=e;} #define ASSIGN(V,E) PyVar_Assign(&(V),(E)) #define UNLESS(E) if(!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E); UNLESS(V) #define OBJECT(O) ((PyObject*)(O)) static PyObject *py___record_schema__; /* Declarations for objects of type Record */ typedef struct { #ifdef PERSISTENCE cPersistent_HEAD #else PyObject_HEAD #endif PyObject **data; PyObject *schema; } Record; staticforward PyExtensionClass RecordType; /* ---------------------------------------------------------------- */ static int Record_init(Record *self) { int l; UNLESS(self->schema) UNLESS(self->schema=PyObject_GetAttr(OBJECT(self->ob_type), py___record_schema__)) return -1; if((l=PyObject_Length(self->schema)) < 0) return -1; UNLESS(self->data) { UNLESS(self->data=malloc(sizeof(PyObject*)*l)) { PyErr_NoMemory(); return -1; } memset(self->data, 0, sizeof(PyObject*)*l); } return l; } static PyObject * Record___setstate__(Record *self, PyObject *args) { PyObject *state=0, *parent, **d; int l, ls, i; if((l=Record_init(self)) < 0) return NULL; UNLESS(PyArg_ParseTuple(args, "|OO", &state, &parent)) return NULL; if(state) if(PyDict_Check(state)) { PyObject *k, *v; for(i=0; PyDict_Next(state, &i, &k, &v);) if(k && v && PyObject_SetAttr(OBJECT(self),k,v) < 0) PyErr_Clear(); } else { if((ls=PyObject_Length(state)) < 0) return NULL; for(i=0, d=self->data; i < l && i < ls; i++, d++) { ASSIGN(*d, PySequence_GetItem(state, i)); UNLESS(*d) return NULL; } } Py_INCREF(Py_None); return Py_None; } static PyObject * Record___getstate__( Record *self, PyObject *args) { PyObject *r, **d, *v; int i, l; UNLESS(self->data) return PyTuple_New(0); if((l=Record_init(self)) < 0) return NULL; UNLESS(r=PyTuple_New(l)) return NULL; for(d=self->data, i=0; i < l; i++, d++) { v= *d; if(!v) v=Py_None; Py_INCREF(v); PyTuple_SET_ITEM(r,i,v); } return r; } static void Record_deal(Record *self) { int l; PyObject **d; if(self->schema) { l=PyObject_Length(self->schema); for(d=self->data; --l >= 0; d++) { Py_XDECREF(*d); } Py_DECREF(self->schema); free(self->data); } } #ifdef PERSISTENCE static PyObject * Record__p_deactivate(Record *self, PyObject *args) { Record_deal(self); self->schema=NULL; self->data=NULL; self->state=cPersistent_GHOST_STATE; Py_INCREF(Py_None); return Py_None; } #endif static struct PyMethodDef Record_methods[] = { {"__getstate__", (PyCFunction)Record___getstate__, METH_VARARGS, "__getstate__() -- Get the record's data" }, {"__setstate__", (PyCFunction)Record___setstate__, METH_VARARGS, "__setstate__(v) -- Set the record's data" }, {"__init__", (PyCFunction)Record___setstate__, METH_VARARGS, "__init__([v]) -- Initialize a record, possibly with state" }, #ifdef PERSISTENCE {"_p_deactivate", (PyCFunction)Record__p_deactivate, METH_VARARGS, "_p_deactivate() -- Reset the record's data" }, #endif {NULL, NULL} /* sentinel */ }; /* ---------- */ static void Record_dealloc(Record *self) { Record_deal(self); Py_DECREF(self->ob_type); PyMem_DEL(self); } static PyObject * Record_getattr(Record *self, PyObject *name) { int l, i; PyObject *io; if((l=Record_init(self)) < 0) return NULL; if(io=Py_FindAttr((PyObject *)self, name)) return io; PyErr_Clear(); if(io=PyObject_GetItem(self->schema, name)) { UNLESS(PyInt_Check(io)) { PyErr_SetString(PyExc_TypeError, "invalid record schema"); return NULL; } i=PyInt_AsLong(io); if(i >= 0 && i < l) { ASSIGN(io, self->data[i]); UNLESS(io) io=Py_None; } else ASSIGN(io, Py_None); Py_INCREF(io); return io; } PyErr_SetObject(PyExc_AttributeError, name); return NULL; } static int Record_setattr(Record *self, PyObject *name, PyObject *v) { int l, i; PyObject *io; if((l=Record_init(self)) < 0) return -1; if(io=PyObject_GetItem(self->schema, name)) { UNLESS(PyInt_Check(io)) { PyErr_SetString(PyExc_TypeError, "invalid record schema"); return -1; } i=PyInt_AsLong(io); Py_DECREF(io); if(i >= 0 && i < l) { Py_XINCREF(v); ASSIGN(self->data[i],v); return 0; } } PyErr_SetObject(PyExc_AttributeError, name); return -1; } #ifdef PERSISTENCE static PyObject * pRecord_getattr(Record *self, PyObject *name) { char *c; UNLESS(c=PyString_AsString(name)) return NULL; return cPersistenceCAPI->pergetattro(OBJECT(self),name,c, Record_getattr); } static int pRecord_setattr(Record *self, PyObject *name, PyObject *v) { return cPersistenceCAPI->persetattro(OBJECT(self),name,v,Record_setattr); } #endif static int Record_compare(Record *v, Record *w) { int lv, lw, i, c; PyObject **dv, **dw; if((lv=Record_init(v)) < 0) return -1; if((lw=Record_init(w)) < 0) return -1; if(lw < lv) lv=lw; for(i=0, dv=v->data, dw=w->data; i < lv; i++, dv++, dw++) { if(*dv) if(*dw) { if(c=PyObject_Compare(*dv,*dw)) return c; } else return 1; else if(*dw) return -1; } if(*dv) return 1; if(*dw) return -1; return 0; } /* Code to handle accessing Record objects as sequence objects */ static PyObject * Record_concat(Record *self, PyObject *bb) { PyErr_SetString(PyExc_TypeError, "Record objects do not support concatenation"); return NULL; } static PyObject * Record_repeat(Record *self, int n) { PyErr_SetString(PyExc_TypeError, "Record objects do not support repetition"); return NULL; } static PyObject * IndexError(int i) { PyObject *v; if((v=PyInt_FromLong(i))) { PyErr_SetObject(PyExc_IndexError, v); Py_DECREF(v); } return NULL; } static PyObject * Record_item(Record *self, int i) { PyObject *o; int l; if((l=Record_init(self)) < 0) return NULL; if(i < 0 || i >= l) return IndexError(i); o=self->data[i]; UNLESS(o) o=Py_None; Py_INCREF(o); return o; } static PyObject * Record_slice(Record *self, int ilow, int ihigh) { PyErr_SetString(PyExc_TypeError, "Record objects do not support slicing"); return NULL; } static int Record_ass_item(Record *self, int i, PyObject *v) { int l; if((l=Record_init(self)) < 0) return -1; if(i < 0 || i >= l) { IndexError(i); return -1; } UNLESS(v) { PyErr_SetString(PyExc_TypeError,"cannot delete record items"); return -1; } Py_INCREF(v); ASSIGN(self->data[i], v); return 0; } static int Record_ass_slice(Record *self, int ilow, int ihigh, PyObject *v) { PyErr_SetString(PyExc_TypeError, "Record objects do not support slice assignment"); return -1; } static PySequenceMethods Record_as_sequence = { (inquiry)Record_init, /*sq_length*/ (binaryfunc)Record_concat, /*sq_concat*/ (intargfunc)Record_repeat, /*sq_repeat*/ (intargfunc)Record_item, /*sq_item*/ (intintargfunc)Record_slice, /*sq_slice*/ (intobjargproc)Record_ass_item, /*sq_ass_item*/ (intintobjargproc)Record_ass_slice, /*sq_ass_slice*/ }; /* -------------------------------------------------------------- */ static PyObject * Record_subscript(Record *self, PyObject *key) { int i, l; PyObject *io; if((l=Record_init(self)) < 0) return NULL; if(PyInt_Check(key)) { i=PyInt_AsLong(key); if(i<0) i+=l; return Record_item(self, i); } if(io=PyObject_GetItem(self->schema, key)) { UNLESS(PyInt_Check(io)) { PyErr_SetString(PyExc_TypeError, "invalid record schema"); return NULL; } i=PyInt_AsLong(io); if(i >= 0 && i < l) { ASSIGN(io, self->data[i]); UNLESS(io) io=Py_None; } else ASSIGN(io, Py_None); Py_INCREF(io); return io; } PyErr_Clear(); if (io=PyObject_GetAttr(OBJECT(self), key)) return io; PyErr_SetObject(PyExc_KeyError, key); return NULL; } static int Record_ass_sub(Record *self, PyObject *key, PyObject *v) { int i, l; PyObject *io; if((l=Record_init(self)) < 0) return -1; if(PyInt_Check(key)) { i=PyInt_AsLong(key); if(i<0) i+=l; return Record_ass_item(self, i, v); } if(io=PyObject_GetItem(self->schema, key)) { UNLESS(PyInt_Check(io)) { PyErr_SetString(PyExc_TypeError, "invalid record schema"); return -1; } i=PyInt_AsLong(io); Py_DECREF(io); if(i >= 0 && i < l) { Py_XINCREF(v); ASSIGN(self->data[i],v); return 0; } } return -1; } static PyMappingMethods Record_as_mapping = { (inquiry)Record_init, /*mp_length*/ (binaryfunc)Record_subscript, /*mp_subscript*/ (objobjargproc)Record_ass_sub, /*mp_ass_subscript*/ }; /* -------------------------------------------------------- */ static PyExtensionClass RecordType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Record", /*tp_name*/ sizeof(Record), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Record_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*obsolete tp_getattr*/ (setattrfunc)0, /*obsolete tp_setattr*/ (cmpfunc)Record_compare, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ &Record_as_sequence, /*tp_as_sequence*/ &Record_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ #ifdef PERSISTENCE (getattrofunc)pRecord_getattr, /*tp_getattro*/ (setattrofunc)pRecord_setattr, /*tp_setattro*/ #else (getattrofunc)Record_getattr, /*tp_getattro*/ (setattrofunc)Record_setattr, /*tp_setattro*/ #endif /* Space for future expansion */ 0L,0L, "Simple Record Types", /* Documentation string */ METHOD_CHAIN(Record_methods), EXTENSIONCLASS_NOINSTDICT_FLAG, }; /* End of code for Record objects */ /* -------------------------------------------------------- */ /* List of methods defined in the module */ static struct PyMethodDef Module_Level__methods[] = { {NULL, (PyCFunction)NULL, 0, NULL} /* sentinel */ }; /* Initialization function for the module (*must* be called initRecord) */ void initRecord() { PyObject *m, *d; char *rev="$Revision: 1.8 $"; UNLESS(py___record_schema__=PyString_FromString("__record_schema__")) return; UNLESS(ExtensionClassImported) return; #ifdef PERSISTENCE if(cPersistenceCAPI=PyCObject_Import("cPersistence","CAPI")) { static PyMethodChain m; m.methods=RecordType.methods.methods; RecordType.methods.methods=cPersistenceCAPI->methods->methods; RecordType.methods.link=&m; } else return; #endif /* Create the module and add the functions */ m = Py_InitModule4("Record", Module_Level__methods, Record_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); /* Add some symbolic constants to the module */ d = PyModule_GetDict(m); PyExtensionClass_Export(d,"Record",RecordType); PyDict_SetItemString(d, "__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); /* Check for errors */ if (PyErr_Occurred()) Py_FatalError("can't initialize module Record"); } /***************************************************************************** Revision Log: $Log: Record.c,v $ Revision 1.8 1999/06/10 20:11:53 jim Updated to use new ExtensionClass destructor protocol. Revision 1.7 1999/04/16 15:21:40 jim Added logic to fall back to getattr when getitem fails. This is needed to make computed attributes work in ZTables, but it might be better to expand the schema notion to accomidate computed attributes. Revision 1.6 1999/03/10 00:14:41 klm Committing with version 1.0 of the license. Revision 1.5 1998/12/04 20:15:24 jim Detabification and new copyright. Revision 1.4 1998/07/27 13:09:58 jim Changed _p___reinit__ to _p_deactivate. Revision 1.3 1998/01/16 21:13:28 jim Added extra ignored parent object argument to __init__ and __setstate__. Revision 1.2 1997/09/26 15:05:17 jim Added sequence and mapping behavior. Revision 1.1 1997/09/25 22:12:28 jim *** empty log message *** Revision 1.5 1997/07/16 20:17:45 jim *** empty log message *** Revision 1.4 1997/06/06 18:31:54 jim Fixed bug in __getstate__ that caused core dumps when some attributes were unset. Revision 1.3 1997/05/19 14:05:46 jim Fixed several bugs. Revision 1.2 1997/04/30 11:37:35 jim Fixed bug in reinitialization that probably explains the bug that Ellen reported where ad attributes were set to None. Revision 1.1 1997/04/27 09:18:42 jim *** empty log message *** $Revision 1.1 1997/02/24 23:25:42 jim $initial $ *****************************************************************************/ Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/Setup100644 1007 1403 347 6671506704 23163 0ustar petrillipetrilli*shared* ExtensionClass ExtensionClass.c Acquisition Acquisition.c MethodObject MethodObject.c MultiMapping MultiMapping.c ThreadLock ThreadLock.c Missing Missing.c Sync Sync.c Record Record.c ComputedAttribute ComputedAttribute.c Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/Sync.c100644 1007 1403 10537 6624355412 23256 0ustar petrillipetrilli/* Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: o Redistributions of source code must retain the above copyright notice, this list of conditions, and the disclaimer that follows. o 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. o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL CREATIONS 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. $Id: Sync.c,v 1.2 1998/11/17 20:22:34 jim Exp $ If you have questions regarding this software, contact: Digital Creations L.C. info@digicool.com (540) 371-6909 */ static char Sync_module_documentation[] = "" "\n$Id: Sync.c,v 1.2 1998/11/17 20:22:34 jim Exp $" ; #include "ExtensionClass.h" static PyObject *ErrorObject; /* ----------------------------------------------------- */ static void PyVar_Assign(PyObject **v, PyObject *e) { Py_XDECREF(*v); *v=e;} #define ASSIGN(V,E) PyVar_Assign(&(V),(E)) #define UNLESS(E) if(!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E); UNLESS(V) #define OBJECT(O) ((PyObject*)(O)) PyObject *lockstr, *aqstr, *restr, *newlock; static PyObject * Synchronized___call_method__(PyObject *self, PyObject *args) { PyObject *f, *a, *k=0, *l=0, *aq=0, *t, *v, *tb, *r; UNLESS(PyArg_ParseTuple(args, "OO|O", &f, &a, &k)) return NULL; UNLESS(l=PyObject_GetAttr(self, lockstr)) { PyErr_Clear(); UNLESS(l=PyObject_CallObject(newlock, NULL)) return NULL; if(PyObject_SetAttr(self, lockstr, l) < 0) goto err; } UNLESS(aq=PyObject_GetAttr(l, aqstr)) goto err; UNLESS_ASSIGN(aq,PyObject_CallObject(aq,NULL)) goto err; if(k) r=PyEval_CallObjectWithKeywords(f,a,k); else r=PyObject_CallObject(f,a); PyErr_Fetch(&t, &v, &tb); ASSIGN(aq,PyObject_GetAttr(l, restr)); if(aq) ASSIGN(aq,PyObject_CallObject(aq,NULL)); Py_XDECREF(aq); Py_DECREF(l); PyErr_Restore(t, v, tb); return r; err: Py_DECREF(l); return NULL; } static struct PyMethodDef Synchronized_methods[] = { {"__call_method__", (PyCFunction)Synchronized___call_method__, METH_VARARGS, "Call a method by first getting a thread lock" }, {NULL, NULL} }; static struct PyMethodDef Module_Level__methods[] = { {NULL, (PyCFunction)NULL, 0, NULL} }; void initSync() { PyObject *m, *d; char *rev="$Revision: 1.2 $"; PURE_MIXIN_CLASS( Synchronized, "Mix-in class that provides synchonization of method calls\n" "\n" "Only one thread is allowed to call a synchronized \n" "object's methods.\n", Synchronized_methods); UNLESS((lockstr=PyString_FromString("_sync__lock")) && (aqstr=PyString_FromString("acquire")) && (restr=PyString_FromString("release")) && (newlock=PyImport_ImportModule("ThreadLock")) ) return; ASSIGN(newlock, PyObject_GetAttrString(newlock, "allocate_lock")); UNLESS(newlock) return; m = Py_InitModule4("Sync", Module_Level__methods, Sync_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); d = PyModule_GetDict(m); PyExtensionClass_Export(d,"Synchronized",SynchronizedType); PyDict_SetItemString(d,"__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); CHECK_FOR_ERRORS("can't initialize module MethodObject"); } Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/ThreadLock.c100644 1007 1403 20260 6663306335 24357 0ustar petrillipetrilli/* Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: o Redistributions of source code must retain the above copyright notice, this list of conditions, and the disclaimer that follows. o 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. o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL CREATIONS 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. $Id: ThreadLock.c,v 1.7 1999/02/19 16:10:05 jim Exp $ If you have questions regarding this software, contact: Digital Creations L.C. info@digicool.com (540) 371-6909 */ static char ThreadLock_module_documentation[] = "" "\n$Id: ThreadLock.c,v 1.7 1999/02/19 16:10:05 jim Exp $" ; #include "Python.h" #ifdef WITH_THREAD #include "listobject.h" #ifdef PyList_SET_ITEM #include "pythread.h" #define get_thread_ident PyThread_get_thread_ident #define acquire_lock PyThread_acquire_lock #define release_lock PyThread_release_lock #define type_lock PyThread_type_lock #define free_lock PyThread_free_lock #define allocate_lock PyThread_allocate_lock #else #include "thread.h" #endif #endif static PyObject *ErrorObject; /* ----------------------------------------------------- */ #define UNLESS(E) if(!(E)) /* Declarations for objects of type ThreadLock */ typedef struct { PyObject_HEAD int count; long id; #ifdef WITH_THREAD type_lock lock; #endif } ThreadLockObject; staticforward PyTypeObject ThreadLockType; static int cacquire(ThreadLockObject *self) { #ifdef WITH_THREAD long id = get_thread_ident(); #else long id = 1; #endif if(self->count >= 0 && self->id==id) { /* Somebody has locked me. It is either the current thread or another thread. */ /* So this thread has it. I can't have a race condition, because, if another thread had the lock, then the id would not be this one. */ self->count++; } else { #ifdef WITH_THREAD Py_BEGIN_ALLOW_THREADS acquire_lock(self->lock, 1); Py_END_ALLOW_THREADS #endif self->count=0; self->id=id; } return 0; } static PyObject * acquire(ThreadLockObject *self, PyObject *args) { if(cacquire(self) < 0) return NULL; Py_INCREF(Py_None); return Py_None; } static int crelease(ThreadLockObject *self) { #ifdef WITH_THREAD long id = get_thread_ident(); #else long id = 1; #endif if(self->count >= 0 && self->id==id) { /* Somebody has locked me. It is either the current thread or another thread. */ /* So this thread has it. I can't have a race condition, because, if another thread had the lock, then the id would not be this one. */ self->count--; #ifdef WITH_THREAD if(self->count < 0) release_lock(self->lock); #endif } else { PyErr_SetString(ErrorObject, "release unlocked lock"); return -1; } return 0; } static PyObject * release(ThreadLockObject *self, PyObject *args) { if(crelease(self) < 0) return NULL; Py_INCREF(Py_None); return Py_None; } static PyObject * call_method(ThreadLockObject *self, PyObject *args) { PyObject *f, *a=0, *k=0; UNLESS(PyArg_ParseTuple(args,"OO|O",&f, &a, &k)) return NULL; if(cacquire(self) < 0) return NULL; f=PyEval_CallObjectWithKeywords(f,a,k); if(crelease(self) < 0) { Py_XDECREF(f); f=NULL; } return f; } static struct PyMethodDef ThreadLock_methods[] = { {"guarded_apply", (PyCFunction)call_method, 1, "guarded_apply(FUNCTION, ARGS[, KEYWORDS]) -- Make a guarded function call\n" "\n" "Acquire the lock, call the function, and then release the lock.\n" }, {"acquire", (PyCFunction)acquire, 1, "acquire() -- Acquire a lock, taking the thread ID into account" }, {"release", (PyCFunction)release, 1, "release() -- Release a lock, taking the thread ID into account" }, {NULL, NULL} /* sentinel */ }; static void ThreadLock_dealloc(ThreadLockObject *self) { #ifdef WITH_THREAD free_lock(self->lock); #endif PyMem_DEL(self); } static PyObject * ThreadLock_getattr(ThreadLockObject *self, PyObject *name) { char *cname; if((cname=PyString_AsString(name))) { if(*cname=='c' && strcmp(cname,"count")==0) return PyInt_FromLong(self->count); if(*cname=='i' && strcmp(cname,"id")==0) return PyInt_FromLong(self->id); return Py_FindMethod(ThreadLock_methods, (PyObject *)self, cname); } PyErr_SetObject(PyExc_AttributeError, name); return NULL; } static PyTypeObject ThreadLockType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "ThreadLock", /*tp_name*/ sizeof(ThreadLockObject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)ThreadLock_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*obsolete tp_getattr*/ (setattrfunc)0, /*obsolete tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)ThreadLock_getattr, /*tp_getattro*/ 0, /*tp_setattro*/ /* Space for future expansion */ 0L,0L, "Thread-based lock objects\n" "\n" "These lock objects may be allocated multiple times by the same\n" "thread, but may only be allocated by one thread at a time.\n" "This is useful for locking instances in possibly nested method calls\n" }; static PyObject * newThreadLockObject(ThreadLockObject *self, PyObject *args) { UNLESS(PyArg_ParseTuple(args,"")) return NULL; UNLESS(self = PyObject_NEW(ThreadLockObject, &ThreadLockType)) return NULL; self->count=-1; #ifdef WITH_THREAD self->lock = allocate_lock(); if (self->lock == NULL) { PyMem_DEL(self); self = NULL; PyErr_SetString(ErrorObject, "can't allocate lock"); } #endif return (PyObject*)self; } static PyObject * ident(PyObject *self, PyObject *args) { #ifdef WITH_THREAD return PyInt_FromLong(get_thread_ident()); #else return PyInt_FromLong(0); #endif } static struct PyMethodDef Module_methods[] = { { "allocate_lock", (PyCFunction)newThreadLockObject, 1, "allocate_lock() -- Return a new lock object" }, { "get_ident", (PyCFunction)ident, 1, "get_ident() -- Get the id of the current thread" }, {NULL, (PyCFunction)NULL, 0, NULL} /* sentinel */ }; void initThreadLock() { PyObject *m, *d; char *rev="$Revision: 1.7 $"; m = Py_InitModule4("ThreadLock", Module_methods, ThreadLock_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); d = PyModule_GetDict(m); ThreadLockType.ob_type=&PyType_Type; PyDict_SetItemString(d,"ThreadLockType", (PyObject*)&ThreadLockType); ErrorObject = PyString_FromString("ThreadLock.error"); PyDict_SetItemString(d, "error", ErrorObject); PyDict_SetItemString(d, "__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); #ifdef WITH_THREAD PyDict_SetItemString(d, "WITH_THREAD", PyInt_FromLong(1)); #else PyDict_SetItemString(d, "WITH_THREAD", Py_None); #endif /* Check for errors */ if (PyErr_Occurred()) Py_FatalError("can't initialize module ThreadLock"); } Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/Xaq.py100644 1007 1403 175 6352303746 23237 0ustar petrillipetrilli# Compatibility module # $Id: Xaq.py,v 1.1 1997/06/19 19:26:30 jim Exp $ import Acquisition Acquirer = Acquisition.Explicit Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/index.stx100644 1007 1403 3401 6624610252 24011 0ustar petrillipetrilli Extension Class "Copyright (C) 1996-1998, Digital Creations":COPYRIGHT.html. A lightweight mechanism has been developed for making Python extension types more class-like. Classes can be developed in an extension language, such as C or C++, and these classes can be treated like other python classes: - They can be sub-classed in python, - They provide access to method documentation strings, and - They can be used to directly create new instances. Extension classes provide additional extensions to class and instance semantics, including: - A protocol for accessing subobjects "in the context of" their containers. This is used to implement custom method types and "environmental acquisition":Acquisition.html. - A protocol for overriding method call semantics. This is used to implement "synchonized" classes and could be used to implement argument type checking. - A protocol for class initialization that supports execution of a special '__class_init__' method after a class has been initialized. Extension classes illustrate how the Python class mechanism can be extended and may provide a basis for improved or specialized class models. Releases The current release is "1.2":ExtensionClass-1.2.tar.gz, To find out what's changed in this release, see the "release notes":release.html. Documentation is available "on-line":ExtensionClass.html. Windows Binaries A win32 binary release, "ec12.zip":ec12.zip, is available. This release includes all of the ExtensionClass modules built as Windows extension modules (.pyd) files. These were built for Python 1.5.1 using Microsoft Visual C++ 5.0 in "Release" mode. Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/release.fl100644 1007 1403 771 6624557235 24107 0ustar petrillipetrilliCOPYRIGHT.txt COPYRIGHT.html ExtensionClass.stx ExtensionClass.html Installation Installation.html Acquisition.stx Acquisition.html MultiMapping.stx MultiMapping.html release.notes release.html README Makefile.pre.in-1.4 Makefile.pre.in-1.5 Setup ExtensionClass.c ExtensionClass.h Acquisition.c MethodObject.c Missing.c MultiMapping.c Sync.c ThreadLock.c test_MultiMapping.py test_Sync.py test_ThreadLock.py test_acquisition.py test_add.py test_binding.py test_method_hook.py test_explicit_acquisition.py Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/release.notes100644 1007 1403 11715 6624552545 24675 0ustar petrillipetrilliRelease Notes 1.2 This release provides some important bug fixes, some new features, and a new copyright. New functionality: - One or more mapping objects can be passed to the MultiMapping constructor. - MultiMapping objects implement the has_key and get methods as defined for Python 1.5 dictionaries. Bugs fixed: - When support was added for passing acquisition wrappers to methods of data-less C mix-in classes, C-based __call_method__ hooks were broken. The most notable example of this was the breaking of the Synchronized class. - Calling C-base-class special methods from overriding methods, as in:: class LowerMultiMapping(MultiMapping): def __getitem__(self, key): return MultiMapping.__getitem__(self, lower(key)) caused infinite loops. - A typo in the Acquisition probably caused __delitem__ calls on wrapped mapping objects to fail. 1.1 New functionality: - Changed the way that methods in pure mix-in classes are constructed. Now methods are wrapped in such a way that tricky wrapper objects (like Acquisition wrappers) can bind them to wrapped objects. - An "is subclass" test is provided via the macros 'ExtensionClassSubclass_Check', and 'ExtensionClassSubclassInstance_Check', which are documented in 'ExtensionClass.h'. - Methods and Acquisition wrappers use free list to improve allocation and deallocation performance. - Bound methods have attributes who's values are stored in their instances. - Added '__module__' attribute to ExtensionClasses to be consistent with Python 1.5 classes and to work correctly with 1.5 pickling. - Added the '__basic__' new class method to allow ExtensionClass instances to be unpickled without calling their constructors. - Acquired acquiring objects can nor acquire from the object they were accessed in, in addition to the object they were acquired from. - Added new 'Acquisition' variable, 'Acquired', to support "Controlled Acquisition'. - Added a new 'aq_acquire' method for objects that subclass 'Acquisition.Implicit' or 'Acquisition.Explicit'. This supports explicit acquisition and provides an option filter function to support "Filtered Acquisiition". The 'acquire' method available in earlier releases is still available, but is deprecated. Bugs fixed: - There were some incorrect C-level error return values. - A bug in handling method chains caused "C inheritence" to fail. This only affected extension types that inherited from extension types using method chains, *not* extension subclasses defined in Python inheriting from extension base classes defined in C. - Expressions like 'not foo' or statements like:: if foo: ... often failed for non-collection types because of an incorrect attempt to take the 'len' of an object. - Comparisons of objects with different classes didn't work correctly. - Instances provided access to their class '__bases__' attribute. 1.0.2 Bugs fixed: - Fixed bug in handling subclasses of Sequence objects. - Fixed comparison bug in Missing objects. 1.0.1 Added functionality to and fixed bug in Missing module - Fixed horible reference-counting bug - Changed so that 'Missing.Value.spam(a1,a2,whatever)' returns 'Missing.Value' for any method name (except '__reduce__') and any arguments. - Changed so that missing values are picklable. Note that the special global, Missing.Value, is pickled in a slightly more efficient manner than other missing values. 1.0 First non-beta release This release is the result of a major rewrite and "hardening" effort to increase performance and reliability. This version is being used in several Digital Creations products, so if parts are broken, we probably don't use them. :-) This release also contains several new features and example modules, including: - Acquisition, - Custom method calls, - Class initialization protocol, - A class method that makes it possible to explicitly call Python base-class methods. - A sample application of custom method calls that provides Java-like synchronized classes that prevent more than one thread from accessing an object's methods at one time. Note that there is one known incompatibility with previous releases. In previouse releases, the method used to support context wrapping was named '__bind_to_object__'. The name of this method was changed to '__of__' in this release and I do not expect this name to change in the future. Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/release.sh100644 1007 1403 771 6624610267 24113 0ustar petrillipetrilli#!/bin/sh R=$1 M=ExtensionClass StructuredText -t < $M.stx > $M.html StructuredText -t < Installation > Installation.html StructuredText -t < Acquisition.stx > Acquisition.html StructuredText -t < MultiMapping.stx > MultiMapping.html StructuredText -t < COPYRIGHT.txt > COPYRIGHT.html StructuredText -t < release.notes > release.html StructuredText -t < index.stx > index.html rm -rf "$M-$R" mkdir "$M-$R" for f in `cat release.fl`; do cp $f "$M-$R/" done tar cvf - "$M-$R" | gzip > "$M-$R.tar.gz" Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/test_MultiMapping.py100644 1007 1403 535 6624551753 26160 0ustar petrillipetrillifrom MultiMapping import * m=MultiMapping() m.push({'spam':1, 'eggs':2}) print m['spam'] print m['eggs'] m.push({'spam':3}) print m['spam'] print m['eggs'] print m.pop() print m.pop() try: print m.pop() raise "That\'s odd", "This last pop should have failed!" except: # I should probably raise a specific error in this case. pass Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/test_Sync.py100644 1007 1403 1235 6727263564 24510 0ustar petrillipetrilli from Sync import Synchronized import thread from random import random from time import sleep class P(Synchronized): def __init__(self,*args,**kw): self.count=0 def inc(self): c=self.count sleep(random()) self.count=self.count+1 return c,self.count def incn(self,n): c=self.count for i in range(n): self.inc() return c,self.count p=P(1,2,spam=3) def test(): for i in range(10): n=3 old,new=p.incn(n) print old,new if old+n != new: print 'oops' for i in range(10): thread.start_new_thread(test,()) sleep(50) Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/test_ThreadLock.py100644 1007 1403 2172 6727263633 25612 0ustar petrillipetrilli import ThreadLock, thread from random import random from time import sleep from ExtensionClass import Base with_lock=1 class P(Base): def __oldcall_method__(self,f,a,k={}): if with_lock: try: lock=self.lock except AttributeError: return apply(f,a,k) else: return apply(f,a,k) try: lock.acquire() return apply(f,a,k) finally: lock.release() __call_method__=apply def __init__(self,*args,**kw): self.count=0 if with_lock: self.lock=lock=ThreadLock.allocate_lock() self.__call_method__=lock.guarded_apply def inc(self): c=self.count sleep(random()) self.count=self.count+1 return c,self.count def incn(self,n): c=self.count for i in range(n): self.inc() return c,self.count p=P(1,2,spam=3) def test(): for i in range(10): n=3 old,new=p.incn(n) print old,new if old+n != new: print 'oops' for i in range(10): thread.start_new_thread(test,()) sleep(50) Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/test_acquisition.py100644 1007 1403 440 6624552063 26070 0ustar petrillipetrillifrom ExtensionClass import Base import Acquisition class B(Base): color='red' class A(Acquisition.Implicit): def hi(self): print self, self.color b=B() b.a=A() b.a.hi() b.a.color='green' b.a.hi() try: A().hi() raise 'Program error', 'spam' except AttributeError: pass Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/test_add.py100644 1007 1403 157 6624552332 24274 0ustar petrillipetrilli from ExtensionClass import * class foo(Base): def __add__(self,other): print 'add called' foo()+foo() Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/test_binding.py100644 1007 1403 344 6624552332 25154 0ustar petrillipetrilli from ExtensionClass import Base from MethodObject import Method class foo(Method): def __call__(self,ob,*args,**kw): print 'called', ob, args, kw class bar(Base): hi=foo() x=bar() hi=x.hi print hi hi(1,2,3,name='spam') Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/test_explicit_acquisition.py100644 1007 1403 453 6624552332 27774 0ustar petrillipetrillifrom ExtensionClass import Base import Acquisition class B(Base): color='red' class A(Acquisition.Explicit): def hi(self): print self, self.acquire('color') b=B() b.a=A() b.a.hi() b.a.color='green' b.a.hi() try: A().hi() raise 'Program error', 'spam' except AttributeError: pass Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/test_func_attr.py100644 1007 1403 2105 6624552332 25544 0ustar petrillipetrilli#! /usr/bin/env python """Test function attributes Jim Fulton """ verbose=1 from ExtensionClass import Base def f(a): return a*a class C(Base): def m(self, a): return a*a m.spam='eggs' i=C() if verbose: print 'Trying function wo attributes' if f(2) != 4: print 'failed' if verbose: print 'Trying method wo attributes' if i.m(2) != 4: print 'failed' if verbose: print 'Trying setting function attribute' f.spam='eggs' if verbose: print 'Trying function w attributes' if f(2) != 4: print 'failed' if verbose: print 'Trying method w attributes' if i.m(2) != 4: print 'failed' if verbose: print 'Trying method getattr' try: if i.m.spam != 'eggs': print 'failed' except AttributeError: print 'failed' try: i.m.foo print 'failed' except AttributeError: pass if verbose: print 'Trying setting built-in function attribute' max.color='red' if max.color != 'red': print 'failed' if max(1,2) != 2: print 'failed' if verbose: print 'Trying setting built-in method attribute' import sys try: sys.stdout.write.color='green' print 'failed' except TypeError: pass Zope-2.0.1-ZEO-nonbin/lib/Components/ExtensionClass/test_method_hook.py100644 1007 1403 423 6632046456 26044 0ustar petrillipetrilli import ExtensionClass class C(ExtensionClass.Base): def __call_method__(self,meth,args,kw={}): print 'give us a hook, hook, hook...' apply(meth,args,kw) def hi(self,*args,**kw): print self, args, kw c=C() c.hi() c.hi(1,2,3) c.hi(1,2,spam='eggs') Zope-2.0.1-ZEO-nonbin/lib/Components/cPickle/ 40755 1007 1403 0 6772126757 20477 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/Components/cPickle/PyErr_Format.h100644 1007 1403 4102 6300113064 23261 0ustar petrillipetrilli/* PyErr_Format -- Raise an exception from C using format strings Arguments: ErrType -- The type of error to be raised string_format -- A Python format-string-style format used to create a string return value. This argument may be NULL, in which case the error value will be a value built with Py_BuildValue using the build-format argument. build_format -- A PyBuild_Value format string for building a Python values from C objects. If this argument is NULL, and string_format is not NULL, then PyErr_Format is equivalent to PyErr_SetString, except that a NULL value is returned. If both build_format and string_format are ommitted, then PyErr_Format uses None as the error return value. The remaining arguments will be passed to PyBuildValue. Return This function always returns a NULL pointer. This allows the function to be used in simple return statements. For example, in a function that returns a PyObject pointer, an error may be raised like this:: if(some_error_condition) return PyErr_Format("Something bad happened with %s at index %s", "si", some_c_string, some_int) */ PyObject * PyErr_Format(PyObject *ErrType, char *string_format, char *build_format, ...); /* PyErr_Format -- Raise an exception from C using a C format string Arguments: ErrType -- The type of error to be raised format -- A C format string The remaining arguments will be used with the C format string. Limitation The size of the formatted string must not exceed 500 characters. Return This function always returns a NULL pointer. This allows the function to be used in simple return statements. For example, in a function that returns a PyObject pointer, an error may be raised like this:: if(some_error_condition) return PyErr_CFormat("Something bad happened with %s at index %d", some_c_string, some_int) */ PyObject * PyErr_CFormat(PyObject *ErrType, char *format, ...); Zope-2.0.1-ZEO-nonbin/lib/Components/cPickle/Setup100644 1007 1403 126 6334425017 21557 0ustar petrillipetrilli*shared* cStringIO cStringIO.c cPickle cPickle.c -DFORMAT_1_3 # install copy_reg.py Zope-2.0.1-ZEO-nonbin/lib/Components/cPickle/cPickle.c100644 1007 1403 315404 6742116172 22344 0ustar petrillipetrilli/* * $Id: cPickle.c,v 1.71 1999/07/11 13:30:34 jim Exp $ * * Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are * met: * * o Redistributions of source code must retain the above copyright * notice, this list of conditions, and the disclaimer that follows. * * o 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. * * o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL * CREATIONS 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 you have questions regarding this software, contact: # # Digital Creations, L.C. # 910 Princess Ann Street # Fredericksburge, Virginia 22401 # # info@digicool.com # # (540) 371-6909 */ static char cPickle_module_documentation[] = "C implementation and optimization of the Python pickle module\n" "\n" "$Id: cPickle.c,v 1.71 1999/07/11 13:30:34 jim Exp $\n" ; #include "Python.h" #include "cStringIO.h" #include "mymath.h" #ifndef Py_eval_input #include #define Py_eval_input eval_input #endif /* Py_eval_input */ #include #define UNLESS(E) if (!(E)) #define DEL_LIST_SLICE(list, from, to) (PyList_SetSlice(list, from, to, NULL)) #define WRITE_BUF_SIZE 256 #define MARK '(' #define STOP '.' #define POP '0' #define POP_MARK '1' #define DUP '2' #define FLOAT 'F' #define BINFLOAT 'G' #define INT 'I' #define BININT 'J' #define BININT1 'K' #define LONG 'L' #define BININT2 'M' #define NONE 'N' #define PERSID 'P' #define BINPERSID 'Q' #define REDUCE 'R' #define STRING 'S' #define BINSTRING 'T' #define SHORT_BINSTRING 'U' #define APPEND 'a' #define BUILD 'b' #define GLOBAL 'c' #define DICT 'd' #define EMPTY_DICT '}' #define APPENDS 'e' #define GET 'g' #define BINGET 'h' #define INST 'i' #define LONG_BINGET 'j' #define LIST 'l' #define EMPTY_LIST ']' #define OBJ 'o' #define PUT 'p' #define BINPUT 'q' #define LONG_BINPUT 'r' #define SETITEM 's' #define TUPLE 't' #define EMPTY_TUPLE ')' #define SETITEMS 'u' static char MARKv = MARK; /* atol function from string module */ static PyObject *atol_func; static PyObject *PickleError; static PyObject *PicklingError; static PyObject *UnpickleableError; static PyObject *UnpicklingError; static PyObject *BadPickleGet; static PyObject *dispatch_table; static PyObject *safe_constructors; static PyObject *empty_tuple; static PyObject *__class___str, *__getinitargs___str, *__dict___str, *__getstate___str, *__setstate___str, *__name___str, *__reduce___str, *write_str, *__safe_for_unpickling___str, *append_str, *read_str, *readline_str, *__main___str, *__basicnew___str, *copy_reg_str, *dispatch_table_str, *safe_constructors_str, *empty_str; static int save(); static int put2(); #ifndef PyList_SET_ITEM #define PyList_SET_ITEM(op, i, v) (((PyListObject *)(op))->ob_item[i] = (v)) #endif #ifndef PyList_GET_SIZE #define PyList_GET_SIZE(op) (((PyListObject *)(op))->ob_size) #endif #ifndef PyTuple_SET_ITEM #define PyTuple_SET_ITEM(op, i, v) (((PyTupleObject *)(op))->ob_item[i] = (v)) #endif #ifndef PyTuple_GET_SIZE #define PyTuple_GET_SIZE(op) (((PyTupleObject *)(op))->ob_size) #endif #ifndef PyString_GET_SIZE #define PyString_GET_SIZE(op) (((PyStringObject *)(op))->ob_size) #endif /************************************************************************* Internal Data type for pickle data. */ typedef struct { PyObject_HEAD int length, size; PyObject **data; } Pdata; static void Pdata_dealloc(Pdata *self) { int i; PyObject **p; for (i=self->length, p=self->data; --i >= 0; p++) Py_DECREF(*p); if (self->data) free(self->data); PyMem_DEL(self); } static PyTypeObject PdataType = { PyObject_HEAD_INIT(NULL) 0, "Pdata", sizeof(Pdata), 0, (destructor)Pdata_dealloc, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0L,0L,0L,0L, "" }; #define Pdata_Check(O) ((O)->ob_type == &PdataType) static PyObject * Pdata_New() { Pdata *self; UNLESS (self = PyObject_NEW(Pdata, &PdataType)) return NULL; self->size=8; self->length=0; self->data=malloc(self->size * sizeof(PyObject*)); if (self->data) return (PyObject*)self; Py_DECREF(self); return PyErr_NoMemory(); } static int stackUnderflow() { PyErr_SetString(UnpicklingError, "unpickling stack underflow"); return -1; } static int Pdata_clear(Pdata *self, int clearto) { int i; PyObject **p; if (clearto < 0) return stackUnderflow(); if (clearto >= self->length) return 0; for (i=self->length, p=self->data+clearto; --i >= clearto; p++) Py_DECREF(*p); self->length=clearto; return 0; } static int Pdata_grow(Pdata *self) { if (! self->size) { PyErr_NoMemory(); return -1; } self->size *= 2; self->data = realloc(self->data, self->size*sizeof(PyObject*)); if (! self->data) { self->size = 0; PyErr_NoMemory(); return -1; } return 0; } #define PDATA_POP(D,V) { \ if ((D)->length) V=D->data[--((D)->length)]; \ else { \ PyErr_SetString(UnpicklingError, "bad pickle data"); \ V=NULL; \ } \ } static PyObject * Pdata_popTuple(Pdata *self, int start) { PyObject *r; int i, j, l; l=self->length-start; UNLESS (r=PyTuple_New(l)) return NULL; for (i=start, j=0 ; j < l; ) PyTuple_SET_ITEM(r,j++,self->data[i++]); self->length=start; return r; } static PyObject * Pdata_popList(Pdata *self, int start) { PyObject *r; int i, j, l; l=self->length-start; UNLESS (r=PyList_New(l)) return NULL; for (i=start, j=0 ; j < l; ) PyList_SET_ITEM(r,j++,self->data[i++]); self->length=start; return r; } #define PDATA_APPEND_(D,O,ER) { \ if (Pdata_Append(((Pdata*)(D)), O) < 0) return ER; \ } #define PDATA_APPEND(D,O,ER) { \ if (((Pdata*)(D))->length == ((Pdata*)(D))->size && \ Pdata_grow((Pdata*)(D)) < 0) \ return ER; \ Py_INCREF(O); \ ((Pdata*)(D))->data[((Pdata*)(D))->length++]=O; \ } #define PDATA_PUSH(D,O,ER) { \ if (((Pdata*)(D))->length == ((Pdata*)(D))->size && \ Pdata_grow((Pdata*)(D)) < 0) { \ Py_DECREF(O); \ return ER; \ } \ ((Pdata*)(D))->data[((Pdata*)(D))->length++]=O; \ } /*************************************************************************/ #define ARG_TUP(self, o) { \ if (self->arg || (self->arg=PyTuple_New(1))) { \ Py_XDECREF(PyTuple_GET_ITEM(self->arg,0)); \ PyTuple_SET_ITEM(self->arg,0,o); \ } \ else { \ Py_DECREF(o); \ } \ } #define FREE_ARG_TUP(self) { \ if (self->arg->ob_refcnt > 1) { \ Py_DECREF(self->arg); \ self->arg=NULL; \ } \ } typedef struct { PyObject_HEAD FILE *fp; PyObject *write; PyObject *file; PyObject *memo; PyObject *arg; PyObject *pers_func; PyObject *inst_pers_func; int bin; int fast; /* Fast mode doesn't save in memo, don't use if circ ref */ int (*write_func)(); char *write_buf; int buf_size; PyObject *dispatch_table; } Picklerobject; staticforward PyTypeObject Picklertype; typedef struct { PyObject_HEAD FILE *fp; PyObject *file; PyObject *readline; PyObject *read; PyObject *memo; PyObject *arg; Pdata *stack; PyObject *mark; PyObject *pers_func; PyObject *last_string; int *marks; int num_marks; int marks_size; int (*read_func)(); int (*readline_func)(); int buf_size; char *buf; PyObject *safe_constructors; PyObject *find_class; } Unpicklerobject; staticforward PyTypeObject Unpicklertype; int cPickle_PyMapping_HasKey(PyObject *o, PyObject *key) { PyObject *v; if ((v = PyObject_GetItem(o,key))) { Py_DECREF(v); return 1; } PyErr_Clear(); return 0; } static PyObject * #ifdef HAVE_STDARG_PROTOTYPES /* VARARGS 2 */ cPickle_ErrFormat(PyObject *ErrType, char *stringformat, char *format, ...) { #else /* VARARGS */ cPickle_ErrFormat(va_alist) va_dcl { #endif va_list va; PyObject *args=0, *retval=0; #ifdef HAVE_STDARG_PROTOTYPES va_start(va, format); #else PyObject *ErrType; char *stringformat, *format; va_start(va); ErrType = va_arg(va, PyObject *); stringformat = va_arg(va, char *); format = va_arg(va, char *); #endif if (format) args = Py_VaBuildValue(format, va); va_end(va); if (format && ! args) return NULL; if (stringformat && !(retval=PyString_FromString(stringformat))) return NULL; if (retval) { if (args) { PyObject *v; v=PyString_Format(retval, args); Py_DECREF(retval); Py_DECREF(args); if (! v) return NULL; retval=v; } } else if (args) retval=args; else { PyErr_SetObject(ErrType,Py_None); return NULL; } PyErr_SetObject(ErrType,retval); Py_DECREF(retval); return NULL; } static int write_file(Picklerobject *self, char *s, int n) { if (s == NULL) { return 0; } if ((int)fwrite(s, sizeof(char), n, self->fp) != n) { PyErr_SetFromErrno(PyExc_IOError); return -1; } return n; } static int write_cStringIO(Picklerobject *self, char *s, int n) { if (s == NULL) { return 0; } if (PycStringIO->cwrite((PyObject *)self->file, s, n) != n) { return -1; } return n; } static int write_none(Picklerobject *self, char *s, int n) { if (s == NULL) return 0; return n; } static int write_other(Picklerobject *self, char *s, int n) { PyObject *py_str = 0, *junk = 0; if (s == NULL) { UNLESS (self->buf_size) return 0; UNLESS (py_str = PyString_FromStringAndSize(self->write_buf, self->buf_size)) return -1; } else { if (self->buf_size && (n + self->buf_size) > WRITE_BUF_SIZE) { if (write_other(self, NULL, 0) < 0) return -1; } if (n > WRITE_BUF_SIZE) { UNLESS (py_str = PyString_FromStringAndSize(s, n)) return -1; } else { memcpy(self->write_buf + self->buf_size, s, n); self->buf_size += n; return n; } } if (self->write) { /* object with write method */ ARG_TUP(self, py_str); if (self->arg) { junk = PyObject_CallObject(self->write, self->arg); FREE_ARG_TUP(self); } if (junk) Py_DECREF(junk); else return -1; } else PDATA_PUSH(self->file, py_str, -1); self->buf_size = 0; return n; } static int read_file(Unpicklerobject *self, char **s, int n) { if (self->buf_size == 0) { int size; size = ((n < 32) ? 32 : n); UNLESS (self->buf = (char *)malloc(size * sizeof(char))) { PyErr_NoMemory(); return -1; } self->buf_size = size; } else if (n > self->buf_size) { UNLESS (self->buf = (char *)realloc(self->buf, n * sizeof(char))) { PyErr_NoMemory(); return -1; } self->buf_size = n; } if ((int)fread(self->buf, sizeof(char), n, self->fp) != n) { if (feof(self->fp)) { PyErr_SetNone(PyExc_EOFError); return -1; } PyErr_SetFromErrno(PyExc_IOError); return -1; } *s = self->buf; return n; } static int readline_file(Unpicklerobject *self, char **s) { int i; if (self->buf_size == 0) { UNLESS (self->buf = (char *)malloc(40 * sizeof(char))) { PyErr_NoMemory(); return -1; } self->buf_size = 40; } i = 0; while (1) { for (; i < (self->buf_size - 1); i++) { if (feof(self->fp) || (self->buf[i] = getc(self->fp)) == '\n') { self->buf[i + 1] = '\0'; *s = self->buf; return i + 1; } } UNLESS (self->buf = (char *)realloc(self->buf, (self->buf_size * 2) * sizeof(char))) { PyErr_NoMemory(); return -1; } self->buf_size *= 2; } } static int read_cStringIO(Unpicklerobject *self, char **s, int n) { char *ptr; if (PycStringIO->cread((PyObject *)self->file, &ptr, n) != n) { PyErr_SetNone(PyExc_EOFError); return -1; } *s = ptr; return n; } static int readline_cStringIO(Unpicklerobject *self, char **s) { int n; char *ptr; if ((n = PycStringIO->creadline((PyObject *)self->file, &ptr)) < 0) { return -1; } *s = ptr; return n; } static int read_other(Unpicklerobject *self, char **s, int n) { PyObject *bytes, *str=0; UNLESS (bytes = PyInt_FromLong(n)) return -1; ARG_TUP(self, bytes); if (self->arg) { str = PyObject_CallObject(self->read, self->arg); FREE_ARG_TUP(self); } if (! str) return -1; Py_XDECREF(self->last_string); self->last_string = str; if (! (*s = PyString_AsString(str))) return -1; return n; } static int readline_other(Unpicklerobject *self, char **s) { PyObject *str; int str_size; UNLESS (str = PyObject_CallObject(self->readline, empty_tuple)) { return -1; } if ((str_size = PyString_Size(str)) < 0) return -1; Py_XDECREF(self->last_string); self->last_string = str; if (! (*s = PyString_AsString(str))) return -1; return str_size; } static char * pystrndup(char *s, int l) { char *r; UNLESS (r=malloc((l+1)*sizeof(char))) return (char*)PyErr_NoMemory(); memcpy(r,s,l); r[l]=0; return r; } static int get(Picklerobject *self, PyObject *id) { PyObject *value, *mv; long c_value; char s[30]; int len; UNLESS (mv = PyDict_GetItem(self->memo, id)) { PyErr_SetObject(PyExc_KeyError, id); return -1; } UNLESS (value = PyTuple_GetItem(mv, 0)) return -1; UNLESS (PyInt_Check(value)) { PyErr_SetString(PicklingError, "no int where int expected in memo"); return -1; } c_value = PyInt_AS_LONG((PyIntObject*)value); if (!self->bin) { s[0] = GET; sprintf(s + 1, "%ld\n", c_value); len = strlen(s); } else if (Pdata_Check(self->file)) { if (write_other(self, NULL, 0) < 0) return -1; PDATA_APPEND(self->file, mv, -1); return 0; } else { if (c_value < 256) { s[0] = BINGET; s[1] = (int)(c_value & 0xff); len = 2; } else { s[0] = LONG_BINGET; s[1] = (int)(c_value & 0xff); s[2] = (int)((c_value >> 8) & 0xff); s[3] = (int)((c_value >> 16) & 0xff); s[4] = (int)((c_value >> 24) & 0xff); len = 5; } } if ((*self->write_func)(self, s, len) < 0) return -1; return 0; } static int put(Picklerobject *self, PyObject *ob) { if (ob->ob_refcnt < 2 || self->fast) return 0; return put2(self, ob); } static int put2(Picklerobject *self, PyObject *ob) { char c_str[30]; int p, len, res = -1; PyObject *py_ob_id = 0, *memo_len = 0, *t = 0; if (self->fast) return 0; if ((p = PyDict_Size(self->memo)) < 0) goto finally; p++; /* Make sure memo keys are positive! */ UNLESS (py_ob_id = PyInt_FromLong((long)ob)) goto finally; UNLESS (memo_len = PyInt_FromLong(p)) goto finally; UNLESS (t = PyTuple_New(2)) goto finally; PyTuple_SET_ITEM(t, 0, memo_len); Py_INCREF(memo_len); PyTuple_SET_ITEM(t, 1, ob); Py_INCREF(ob); if (PyDict_SetItem(self->memo, py_ob_id, t) < 0) goto finally; if (!self->bin) { c_str[0] = PUT; sprintf(c_str + 1, "%d\n", p); len = strlen(c_str); } else if (Pdata_Check(self->file)) { if (write_other(self, NULL, 0) < 0) return -1; PDATA_APPEND(self->file, memo_len, -1); res=0; /* Job well done ;) */ goto finally; } else { if (p >= 256) { c_str[0] = LONG_BINPUT; c_str[1] = (int)(p & 0xff); c_str[2] = (int)((p >> 8) & 0xff); c_str[3] = (int)((p >> 16) & 0xff); c_str[4] = (int)((p >> 24) & 0xff); len = 5; } else { c_str[0] = BINPUT; c_str[1] = p; len = 2; } } if ((*self->write_func)(self, c_str, len) < 0) goto finally; res = 0; finally: Py_XDECREF(py_ob_id); Py_XDECREF(memo_len); Py_XDECREF(t); return res; } #define PyImport_Import cPickle_Import static PyObject * PyImport_Import(PyObject *module_name) { static PyObject *silly_list=0, *__builtins___str=0, *__import___str; static PyObject *standard_builtins=0; PyObject *globals=0, *__import__=0, *__builtins__=0, *r=0; UNLESS (silly_list) { UNLESS (__import___str=PyString_FromString("__import__")) return NULL; UNLESS (__builtins___str=PyString_FromString("__builtins__")) return NULL; UNLESS (silly_list=Py_BuildValue("[s]","__doc__")) return NULL; } if ((globals=PyEval_GetGlobals())) { Py_INCREF(globals); UNLESS (__builtins__=PyObject_GetItem(globals,__builtins___str)) goto err; } else { PyErr_Clear(); UNLESS (standard_builtins || (standard_builtins=PyImport_ImportModule("__builtin__"))) return NULL; __builtins__=standard_builtins; Py_INCREF(__builtins__); UNLESS (globals = Py_BuildValue("{sO}", "__builtins__", __builtins__)) goto err; } if (PyDict_Check(__builtins__)) { UNLESS (__import__=PyObject_GetItem(__builtins__,__import___str)) goto err; } else { UNLESS (__import__=PyObject_GetAttr(__builtins__,__import___str)) goto err; } UNLESS (r=PyObject_CallFunction(__import__,"OOOO", module_name, globals, globals, silly_list)) goto err; Py_DECREF(globals); Py_DECREF(__builtins__); Py_DECREF(__import__); return r; err: Py_XDECREF(globals); Py_XDECREF(__builtins__); Py_XDECREF(__import__); return NULL; } static PyObject * whichmodule(PyObject *global, PyObject *global_name) { int i, j; PyObject *module = 0, *modules_dict = 0, *global_name_attr = 0, *name = 0; module = PyObject_GetAttrString(global, "__module__"); if (module) return module; PyErr_Clear(); UNLESS (modules_dict = PySys_GetObject("modules")) return NULL; i = 0; while ((j = PyDict_Next(modules_dict, &i, &name, &module))) { if (PyObject_Compare(name, __main___str)==0) continue; UNLESS (global_name_attr = PyObject_GetAttr(module, global_name)) { PyErr_Clear(); continue; } if (global_name_attr != global) { Py_DECREF(global_name_attr); continue; } Py_DECREF(global_name_attr); break; } /* The following implements the rule in pickle.py added in 1.5 that used __main__ if no module is found. I don't actually like this rule. jlf */ if (!j) { j=1; name=__main___str; } Py_INCREF(name); return name; } static int save_none(Picklerobject *self, PyObject *args) { static char none = NONE; if ((*self->write_func)(self, &none, 1) < 0) return -1; return 0; } static int save_int(Picklerobject *self, PyObject *args) { char c_str[32]; long l = PyInt_AS_LONG((PyIntObject *)args); int len = 0; if (!self->bin #if SIZEOF_LONG > 4 || (l >> 32) #endif ) { /* Save extra-long ints in non-binary mode, so that we can use python long parsing code to restore, if necessary. */ c_str[0] = INT; sprintf(c_str + 1, "%ld\n", l); if ((*self->write_func)(self, c_str, strlen(c_str)) < 0) return -1; } else { c_str[1] = (int)( l & 0xff); c_str[2] = (int)((l >> 8) & 0xff); c_str[3] = (int)((l >> 16) & 0xff); c_str[4] = (int)((l >> 24) & 0xff); if ((c_str[4] == 0) && (c_str[3] == 0)) { if (c_str[2] == 0) { c_str[0] = BININT1; len = 2; } else { c_str[0] = BININT2; len = 3; } } else { c_str[0] = BININT; len = 5; } if ((*self->write_func)(self, c_str, len) < 0) return -1; } return 0; } static int save_long(Picklerobject *self, PyObject *args) { int size, res = -1; PyObject *repr = 0; static char l = LONG; UNLESS (repr = PyObject_Repr(args)) goto finally; if ((size = PyString_Size(repr)) < 0) goto finally; if ((*self->write_func)(self, &l, 1) < 0) goto finally; if ((*self->write_func)(self, PyString_AS_STRING((PyStringObject *)repr), size) < 0) goto finally; if ((*self->write_func)(self, "\n", 1) < 0) goto finally; res = 0; finally: Py_XDECREF(repr); return res; } static int save_float(Picklerobject *self, PyObject *args) { double x = PyFloat_AS_DOUBLE((PyFloatObject *)args); if (self->bin) { int s, e; double f; long fhi, flo; char str[9], *p = str; *p = BINFLOAT; p++; if (x < 0) { s = 1; x = -x; } else s = 0; f = frexp(x, &e); /* Normalize f to be in the range [1.0, 2.0) */ if (0.5 <= f && f < 1.0) { f *= 2.0; e--; } else if (f == 0.0) { e = 0; } else { PyErr_SetString(PyExc_SystemError, "frexp() result out of range"); return -1; } if (e >= 1024) { /* XXX 1024 itself is reserved for Inf/NaN */ PyErr_SetString(PyExc_OverflowError, "float too large to pack with d format"); return -1; } else if (e < -1022) { /* Gradual underflow */ f = ldexp(f, 1022 + e); e = 0; } else if (!(e == 0 && f == 0.0)) { e += 1023; f -= 1.0; /* Get rid of leading 1 */ } /* fhi receives the high 28 bits; flo the low 24 bits (== 52 bits) */ f *= 268435456.0; /* 2**28 */ fhi = (long) floor(f); /* Truncate */ f -= (double)fhi; f *= 16777216.0; /* 2**24 */ flo = (long) floor(f + 0.5); /* Round */ /* First byte */ *p = (s<<7) | (e>>4); p++; /* Second byte */ *p = (char) (((e&0xF)<<4) | (fhi>>24)); p++; /* Third byte */ *p = (fhi>>16) & 0xFF; p++; /* Fourth byte */ *p = (fhi>>8) & 0xFF; p++; /* Fifth byte */ *p = fhi & 0xFF; p++; /* Sixth byte */ *p = (flo>>16) & 0xFF; p++; /* Seventh byte */ *p = (flo>>8) & 0xFF; p++; /* Eighth byte */ *p = flo & 0xFF; if ((*self->write_func)(self, str, 9) < 0) return -1; } else { char c_str[250]; c_str[0] = FLOAT; sprintf(c_str + 1, "%.17g\n", x); if ((*self->write_func)(self, c_str, strlen(c_str)) < 0) return -1; } return 0; } static int save_string(Picklerobject *self, PyObject *args, int doput) { int size, len; PyObject *repr=0; if ((size = PyString_Size(args)) < 0) return -1; if (!self->bin) { char *repr_str; static char string = STRING; UNLESS (repr = PyObject_Repr(args)) return -1; if ((len = PyString_Size(repr)) < 0) goto err; repr_str = PyString_AS_STRING((PyStringObject *)repr); if ((*self->write_func)(self, &string, 1) < 0) goto err; if ((*self->write_func)(self, repr_str, len) < 0) goto err; if ((*self->write_func)(self, "\n", 1) < 0) goto err; Py_XDECREF(repr); } else { int i; char c_str[5]; if ((size = PyString_Size(args)) < 0) return -1; if (size < 256) { c_str[0] = SHORT_BINSTRING; c_str[1] = size; len = 2; } else { c_str[0] = BINSTRING; for (i = 1; i < 5; i++) c_str[i] = (int)(size >> ((i - 1) * 8)); len = 5; } if ((*self->write_func)(self, c_str, len) < 0) return -1; if (size > 128 && Pdata_Check(self->file)) { if (write_other(self, NULL, 0) < 0) return -1; PDATA_APPEND(self->file, args, -1); } else { if ((*self->write_func)(self, PyString_AS_STRING((PyStringObject *)args), size) < 0) return -1; } } if (doput) if (put(self, args) < 0) return -1; return 0; err: Py_XDECREF(repr); return -1; } static int save_tuple(Picklerobject *self, PyObject *args) { PyObject *element = 0, *py_tuple_id = 0; int len, i, has_key, res = -1; static char tuple = TUPLE; if ((*self->write_func)(self, &MARKv, 1) < 0) goto finally; if ((len = PyTuple_Size(args)) < 0) goto finally; for (i = 0; i < len; i++) { UNLESS (element = PyTuple_GET_ITEM((PyTupleObject *)args, i)) goto finally; if (save(self, element, 0) < 0) goto finally; } UNLESS (py_tuple_id = PyInt_FromLong((long)args)) goto finally; if (len) { if ((has_key = cPickle_PyMapping_HasKey(self->memo, py_tuple_id)) < 0) goto finally; if (has_key) { if (self->bin) { static char pop_mark = POP_MARK; if ((*self->write_func)(self, &pop_mark, 1) < 0) goto finally; } else { static char pop = POP; for (i = 0; i <= len; i++) { if ((*self->write_func)(self, &pop, 1) < 0) goto finally; } } if (get(self, py_tuple_id) < 0) goto finally; res = 0; goto finally; } } if ((*self->write_func)(self, &tuple, 1) < 0) { goto finally; } if (put(self, args) < 0) goto finally; res = 0; finally: Py_XDECREF(py_tuple_id); return res; } static int save_empty_tuple(Picklerobject *self, PyObject *args) { static char tuple = EMPTY_TUPLE; return (*self->write_func)(self, &tuple, 1); } static int save_list(Picklerobject *self, PyObject *args) { PyObject *element = 0; int s_len, len, i, using_appends, res = -1; char s[3]; static char append = APPEND, appends = APPENDS; if (self->bin) { s[0] = EMPTY_LIST; s_len = 1; } else { s[0] = MARK; s[1] = LIST; s_len = 2; } if ((len = PyList_Size(args)) < 0) goto finally; if ((*self->write_func)(self, s, s_len) < 0) goto finally; if (len == 0) { if (put(self, args) < 0) goto finally; } else { if (put2(self, args) < 0) goto finally; } if ((using_appends = (self->bin && (len > 1)))) if ((*self->write_func)(self, &MARKv, 1) < 0) goto finally; for (i = 0; i < len; i++) { UNLESS (element = PyList_GET_ITEM((PyListObject *)args, i)) goto finally; if (save(self, element, 0) < 0) goto finally; if (!using_appends) { if ((*self->write_func)(self, &append, 1) < 0) goto finally; } } if (using_appends) { if ((*self->write_func)(self, &appends, 1) < 0) goto finally; } res = 0; finally: return res; } static int save_dict(Picklerobject *self, PyObject *args) { PyObject *key = 0, *value = 0; int i, len, res = -1, using_setitems; char s[3]; static char setitem = SETITEM, setitems = SETITEMS; if (self->bin) { s[0] = EMPTY_DICT; len = 1; } else { s[0] = MARK; s[1] = DICT; len = 2; } if ((*self->write_func)(self, s, len) < 0) goto finally; if ((len = PyDict_Size(args)) < 0) goto finally; if (len == 0) { if (put(self, args) < 0) goto finally; } else { if (put2(self, args) < 0) goto finally; } if ((using_setitems = (self->bin && (PyDict_Size(args) > 1)))) if ((*self->write_func)(self, &MARKv, 1) < 0) goto finally; i = 0; while (PyDict_Next(args, &i, &key, &value)) { if (save(self, key, 0) < 0) goto finally; if (save(self, value, 0) < 0) goto finally; if (!using_setitems) { if ((*self->write_func)(self, &setitem, 1) < 0) goto finally; } } if (using_setitems) { if ((*self->write_func)(self, &setitems, 1) < 0) goto finally; } res = 0; finally: return res; } static int save_inst(Picklerobject *self, PyObject *args) { PyObject *class = 0, *module = 0, *name = 0, *state = 0, *getinitargs_func = 0, *getstate_func = 0, *class_args = 0; char *module_str, *name_str; int module_size, name_size, res = -1; static char inst = INST, obj = OBJ, build = BUILD; if ((*self->write_func)(self, &MARKv, 1) < 0) goto finally; UNLESS (class = PyObject_GetAttr(args, __class___str)) goto finally; if (self->bin) { if (save(self, class, 0) < 0) goto finally; } if ((getinitargs_func = PyObject_GetAttr(args, __getinitargs___str))) { PyObject *element = 0; int i, len; UNLESS (class_args = PyObject_CallObject(getinitargs_func, empty_tuple)) goto finally; if ((len = PyObject_Length(class_args)) < 0) goto finally; for (i = 0; i < len; i++) { UNLESS (element = PySequence_GetItem(class_args, i)) goto finally; if (save(self, element, 0) < 0) { Py_DECREF(element); goto finally; } Py_DECREF(element); } } else { PyErr_Clear(); } if (!self->bin) { UNLESS (name = ((PyClassObject *)class)->cl_name) { PyErr_SetString(PicklingError, "class has no name"); goto finally; } UNLESS (module = whichmodule(class, name)) goto finally; if ((module_size = PyString_Size(module)) < 0 || (name_size = PyString_Size(name)) < 0) goto finally; module_str = PyString_AS_STRING((PyStringObject *)module); name_str = PyString_AS_STRING((PyStringObject *)name); if ((*self->write_func)(self, &inst, 1) < 0) goto finally; if ((*self->write_func)(self, module_str, module_size) < 0) goto finally; if ((*self->write_func)(self, "\n", 1) < 0) goto finally; if ((*self->write_func)(self, name_str, name_size) < 0) goto finally; if ((*self->write_func)(self, "\n", 1) < 0) goto finally; } else if ((*self->write_func)(self, &obj, 1) < 0) { goto finally; } if ((getstate_func = PyObject_GetAttr(args, __getstate___str))) { UNLESS (state = PyObject_CallObject(getstate_func, empty_tuple)) goto finally; } else { PyErr_Clear(); UNLESS (state = PyObject_GetAttr(args, __dict___str)) { PyErr_Clear(); res = 0; goto finally; } } if (!PyDict_Check(state)) { if (put2(self, args) < 0) goto finally; } else { if (put(self, args) < 0) goto finally; } if (save(self, state, 0) < 0) goto finally; if ((*self->write_func)(self, &build, 1) < 0) goto finally; res = 0; finally: Py_XDECREF(module); Py_XDECREF(class); Py_XDECREF(state); Py_XDECREF(getinitargs_func); Py_XDECREF(getstate_func); Py_XDECREF(class_args); return res; } static int save_global(Picklerobject *self, PyObject *args, PyObject *name) { PyObject *global_name = 0, *module = 0; char *name_str, *module_str; int module_size, name_size, res = -1; static char global = GLOBAL; if (name) { global_name = name; Py_INCREF(global_name); } else { UNLESS (global_name = PyObject_GetAttr(args, __name___str)) goto finally; } UNLESS (module = whichmodule(args, global_name)) goto finally; if ((module_size = PyString_Size(module)) < 0 || (name_size = PyString_Size(global_name)) < 0) goto finally; module_str = PyString_AS_STRING((PyStringObject *)module); name_str = PyString_AS_STRING((PyStringObject *)global_name); if ((*self->write_func)(self, &global, 1) < 0) goto finally; if ((*self->write_func)(self, module_str, module_size) < 0) goto finally; if ((*self->write_func)(self, "\n", 1) < 0) goto finally; if ((*self->write_func)(self, name_str, name_size) < 0) goto finally; if ((*self->write_func)(self, "\n", 1) < 0) goto finally; if (put(self, args) < 0) goto finally; res = 0; finally: Py_XDECREF(module); Py_XDECREF(global_name); return res; } static int save_pers(Picklerobject *self, PyObject *args, PyObject *f) { PyObject *pid = 0; int size, res = -1; static char persid = PERSID, binpersid = BINPERSID; Py_INCREF(args); ARG_TUP(self, args); if (self->arg) { pid = PyObject_CallObject(f, self->arg); FREE_ARG_TUP(self); } if (! pid) return -1; if (pid != Py_None) { if (!self->bin) { if (!PyString_Check(pid)) { PyErr_SetString(PicklingError, "persistent id must be string"); goto finally; } if ((*self->write_func)(self, &persid, 1) < 0) goto finally; if ((size = PyString_Size(pid)) < 0) goto finally; if ((*self->write_func)(self, PyString_AS_STRING((PyStringObject *)pid), size) < 0) goto finally; if ((*self->write_func)(self, "\n", 1) < 0) goto finally; res = 1; goto finally; } else if (save(self, pid, 1) >= 0) { if ((*self->write_func)(self, &binpersid, 1) < 0) res = -1; else res = 1; } goto finally; } res = 0; finally: Py_XDECREF(pid); return res; } static int save_reduce(Picklerobject *self, PyObject *callable, PyObject *tup, PyObject *state, PyObject *ob) { static char reduce = REDUCE, build = BUILD; if (save(self, callable, 0) < 0) return -1; if (save(self, tup, 0) < 0) return -1; if ((*self->write_func)(self, &reduce, 1) < 0) return -1; if (ob != NULL) { if (state && !PyDict_Check(state)) { if (put2(self, ob) < 0) return -1; } else { if (put(self, ob) < 0) return -1; } } if (state) { if (save(self, state, 0) < 0) return -1; if ((*self->write_func)(self, &build, 1) < 0) return -1; } return 0; } static int save(Picklerobject *self, PyObject *args, int pers_save) { PyTypeObject *type; PyObject *py_ob_id = 0, *__reduce__ = 0, *t = 0, *arg_tup = 0, *callable = 0, *state = 0; int res = -1, tmp, size; if (!pers_save && self->pers_func) { if ((tmp = save_pers(self, args, self->pers_func)) != 0) { res = tmp; goto finally; } } if (args == Py_None) { res = save_none(self, args); goto finally; } type = args->ob_type; switch (type->tp_name[0]) { case 'i': if (type == &PyInt_Type) { res = save_int(self, args); goto finally; } break; case 'l': if (type == &PyLong_Type) { res = save_long(self, args); goto finally; } break; case 'f': if (type == &PyFloat_Type) { res = save_float(self, args); goto finally; } break; case 't': if (type == &PyTuple_Type && PyTuple_Size(args)==0) { if (self->bin) res = save_empty_tuple(self, args); else res = save_tuple(self, args); goto finally; } break; case 's': if ((type == &PyString_Type) && (PyString_GET_SIZE(args) < 2)) { res = save_string(self, args, 0); goto finally; } } if (args->ob_refcnt > 1) { long ob_id; int has_key; ob_id = (long)args; UNLESS (py_ob_id = PyInt_FromLong(ob_id)) goto finally; if ((has_key = cPickle_PyMapping_HasKey(self->memo, py_ob_id)) < 0) goto finally; if (has_key) { if (get(self, py_ob_id) < 0) goto finally; res = 0; goto finally; } } switch (type->tp_name[0]) { case 's': if (type == &PyString_Type) { res = save_string(self, args, 1); goto finally; } break; case 't': if (type == &PyTuple_Type) { res = save_tuple(self, args); goto finally; } break; case 'l': if (type == &PyList_Type) { res = save_list(self, args); goto finally; } break; case 'd': if (type == &PyDict_Type) { res = save_dict(self, args); goto finally; } break; case 'i': if (type == &PyInstance_Type) { res = save_inst(self, args); goto finally; } break; case 'c': if (type == &PyClass_Type) { res = save_global(self, args, NULL); goto finally; } break; case 'f': if (type == &PyFunction_Type) { res = save_global(self, args, NULL); goto finally; } break; case 'b': if (type == &PyCFunction_Type) { res = save_global(self, args, NULL); goto finally; } } if (!pers_save && self->inst_pers_func) { if ((tmp = save_pers(self, args, self->inst_pers_func)) != 0) { res = tmp; goto finally; } } if ((__reduce__ = PyDict_GetItem(dispatch_table, (PyObject *)type))) { Py_INCREF(__reduce__); Py_INCREF(args); ARG_TUP(self, args); if (self->arg) { t = PyObject_CallObject(__reduce__, self->arg); FREE_ARG_TUP(self); } if (! t) goto finally; } else { PyErr_Clear(); if ((__reduce__ = PyObject_GetAttr(args, __reduce___str))) { UNLESS (t = PyObject_CallObject(__reduce__, empty_tuple)) goto finally; } else { PyErr_Clear(); } } if (t) { if (PyString_Check(t)) { res = save_global(self, args, t); goto finally; } if (!PyTuple_Check(t)) { cPickle_ErrFormat(PicklingError, "Value returned by %s must " "be a tuple", "O", __reduce__); goto finally; } size = PyTuple_Size(t); if ((size != 3) && (size != 2)) { cPickle_ErrFormat(PicklingError, "tuple returned by %s must " "contain only two or three elements", "O", __reduce__); goto finally; } callable = PyTuple_GET_ITEM(t, 0); arg_tup = PyTuple_GET_ITEM(t, 1); if (size > 2) { state = PyTuple_GET_ITEM(t, 2); } UNLESS (PyTuple_Check(arg_tup) || arg_tup==Py_None) { cPickle_ErrFormat(PicklingError, "Second element of tuple " "returned by %s must be a tuple", "O", __reduce__); goto finally; } res = save_reduce(self, callable, arg_tup, state, args); goto finally; } PyErr_SetObject(UnpickleableError, args); finally: Py_XDECREF(py_ob_id); Py_XDECREF(__reduce__); Py_XDECREF(t); return res; } static int dump(Picklerobject *self, PyObject *args) { static char stop = STOP; if (save(self, args, 0) < 0) return -1; if ((*self->write_func)(self, &stop, 1) < 0) return -1; if ((*self->write_func)(self, NULL, 0) < 0) return -1; return 0; } static PyObject * Pickle_clear_memo(Picklerobject *self, PyObject *args) { if (args && ! PyArg_ParseTuple(args,"")) return NULL; if (self->memo) PyDict_Clear(self->memo); Py_INCREF(Py_None); return Py_None; } static PyObject * Pickle_getvalue(Picklerobject *self, PyObject *args) { int l, i, rsize, ssize, clear=1, lm; long ik; PyObject *k, *r; char *s, *p, *have_get; Pdata *data; if (args && ! PyArg_ParseTuple(args,"|i",&clear)) return NULL; /* Check to make sure we are based on a list */ if (! Pdata_Check(self->file)) { PyErr_SetString(PicklingError, "Attempt to getvalue a non-list-based pickler"); return NULL; } /* flush write buffer */ if (write_other(self, NULL, 0) < 0) return NULL; data=(Pdata*)self->file; l=data->length; /* set up an array to hold get/put status */ if ((lm=PyDict_Size(self->memo)) < 0) return NULL; lm++; if (! (have_get=malloc((lm)*sizeof(char)))) return PyErr_NoMemory(); memset(have_get,0,lm); /* Scan for gets. */ for (rsize=0, i=l; --i >= 0; ) { k=data->data[i]; if (PyString_Check(k)) { rsize += PyString_GET_SIZE(k); } else if (PyInt_Check(k)) { /* put */ ik=PyInt_AS_LONG((PyIntObject*)k); if (ik >= lm || ik==0) { PyErr_SetString(PicklingError, "Invalid get data"); return NULL; } if (have_get[ik]) { /* with matching get */ if (ik < 256) rsize += 2; else rsize+=5; } } else if (! (PyTuple_Check(k) && PyTuple_GET_SIZE(k) == 2 && PyInt_Check((k=PyTuple_GET_ITEM(k,0)))) ) { PyErr_SetString(PicklingError, "Unexpected data in internal list"); return NULL; } else { /* put */ ik=PyInt_AS_LONG((PyIntObject*)k); if (ik >= lm || ik==0) { PyErr_SetString(PicklingError, "Invalid get data"); return NULL; } have_get[ik]=1; if (ik < 256) rsize += 2; else rsize+=5; } } /* Now generate the result */ UNLESS (r=PyString_FromStringAndSize(NULL,rsize)) goto err; s=PyString_AS_STRING((PyStringObject*)r); for (i=0; idata[i]; if (PyString_Check(k)) { ssize=PyString_GET_SIZE(k); if (ssize) { p=PyString_AS_STRING((PyStringObject*)k); while (--ssize >= 0) *s++=*p++; } } else if (PyTuple_Check(k)) { /* get */ ik=PyInt_AS_LONG((PyIntObject*)PyTuple_GET_ITEM(k,0)); if (ik < 256) { *s++ = BINGET; *s++ = (int)(ik & 0xff); } else { *s++ = LONG_BINGET; *s++ = (int)(ik & 0xff); *s++ = (int)((ik >> 8) & 0xff); *s++ = (int)((ik >> 16) & 0xff); *s++ = (int)((ik >> 24) & 0xff); } } else { /* put */ ik=PyInt_AS_LONG((PyIntObject*)k); if (have_get[ik]) { /* with matching get */ if (ik < 256) { *s++ = BINPUT; *s++ = (int)(ik & 0xff); } else { *s++ = LONG_BINPUT; *s++ = (int)(ik & 0xff); *s++ = (int)((ik >> 8) & 0xff); *s++ = (int)((ik >> 16) & 0xff); *s++ = (int)((ik >> 24) & 0xff); } } } } if (clear) { PyDict_Clear(self->memo); Pdata_clear(data,0); } free(have_get); return r; err: free(have_get); return NULL; } static PyObject * Pickler_dump(Picklerobject *self, PyObject *args) { PyObject *ob; int get=0; UNLESS (PyArg_ParseTuple(args, "O|i", &ob, &get)) return NULL; if (dump(self, ob) < 0) return NULL; if (get) return Pickle_getvalue(self, NULL); Py_INCREF(self); return (PyObject*)self; } static struct PyMethodDef Pickler_methods[] = { {"dump", (PyCFunction)Pickler_dump, 1, "dump(object) --" "Write an object in pickle format to the object's pickle stream\n" }, {"clear_memo", (PyCFunction)Pickle_clear_memo, 1, "clear_memo() -- Clear the picklers memo"}, {"getvalue", (PyCFunction)Pickle_getvalue, 1, "getvalue() -- Finish picking a list-based pickle"}, {NULL, NULL} /* sentinel */ }; static Picklerobject * newPicklerobject(PyObject *file, int bin) { Picklerobject *self; UNLESS (self = PyObject_NEW(Picklerobject, &Picklertype)) return NULL; self->fp = NULL; self->write = NULL; self->memo = NULL; self->arg = NULL; self->pers_func = NULL; self->inst_pers_func = NULL; self->write_buf = NULL; self->bin = bin; self->fast = 0; self->buf_size = 0; self->dispatch_table = NULL; if (file) Py_INCREF(file); else file=Pdata_New(); self->file = file; UNLESS (self->memo = PyDict_New()) { Py_XDECREF((PyObject *)self); return NULL; } if (PyFile_Check(file)) { self->fp = PyFile_AsFile(file); if (self->fp == NULL) { PyErr_SetString(PyExc_IOError, "output file closed"); return NULL; } self->write_func = write_file; } else if (PycStringIO_OutputCheck(file)) { self->write_func = write_cStringIO; } else if (file == Py_None) { self->write_func = write_none; } else { self->write_func = write_other; if (! Pdata_Check(file)) { UNLESS (self->write = PyObject_GetAttr(file, write_str)) { PyErr_Clear(); PyErr_SetString(PyExc_TypeError, "argument must have 'write' " "attribute"); goto err; } } UNLESS (self->write_buf = (char *)malloc(WRITE_BUF_SIZE * sizeof(char))) { PyErr_NoMemory(); goto err; } } if (PyEval_GetRestricted()) { /* Restricted execution, get private tables */ PyObject *m; UNLESS (m=PyImport_Import(copy_reg_str)) goto err; self->dispatch_table=PyObject_GetAttr(m, dispatch_table_str); Py_DECREF(m); UNLESS (self->dispatch_table) goto err; } else { self->dispatch_table=dispatch_table; Py_INCREF(dispatch_table); } return self; err: Py_DECREF((PyObject *)self); return NULL; } static PyObject * get_Pickler(PyObject *self, PyObject *args) { PyObject *file=NULL; int bin; bin=1; if (! PyArg_ParseTuple(args, "|i", &bin)) { PyErr_Clear(); bin=0; if (! PyArg_ParseTuple(args, "O|i", &file, &bin)) return NULL; } return (PyObject *)newPicklerobject(file, bin); } static void Pickler_dealloc(Picklerobject *self) { Py_XDECREF(self->write); Py_XDECREF(self->memo); Py_XDECREF(self->arg); Py_XDECREF(self->file); Py_XDECREF(self->pers_func); Py_XDECREF(self->inst_pers_func); Py_XDECREF(self->dispatch_table); if (self->write_buf) { free(self->write_buf); } PyMem_DEL(self); } static PyObject * Pickler_getattr(Picklerobject *self, char *name) { switch (*name) { case 'p': if (strcmp(name, "persistent_id") == 0) { if (!self->pers_func) { PyErr_SetString(PyExc_AttributeError, name); return NULL; } Py_INCREF(self->pers_func); return self->pers_func; } break; case 'm': if (strcmp(name, "memo") == 0) { if (!self->memo) { PyErr_SetString(PyExc_AttributeError, name); return NULL; } Py_INCREF(self->memo); return self->memo; } break; case 'P': if (strcmp(name, "PicklingError") == 0) { Py_INCREF(PicklingError); return PicklingError; } break; case 'b': if (strcmp(name, "binary")==0) return PyInt_FromLong(self->bin); break; case 'f': if (strcmp(name, "fast")==0) return PyInt_FromLong(self->fast); break; case 'g': if (strcmp(name, "getvalue")==0 && ! Pdata_Check(self->file)) { PyErr_SetString(PyExc_AttributeError, name); return NULL; } break; } return Py_FindMethod(Pickler_methods, (PyObject *)self, name); } int Pickler_setattr(Picklerobject *self, char *name, PyObject *value) { if (! value) { PyErr_SetString(PyExc_TypeError, "attribute deletion is not supported"); return -1; } if (strcmp(name, "persistent_id") == 0) { Py_XDECREF(self->pers_func); self->pers_func = value; Py_INCREF(value); return 0; } if (strcmp(name, "inst_persistent_id") == 0) { Py_XDECREF(self->inst_pers_func); self->inst_pers_func = value; Py_INCREF(value); return 0; } if (strcmp(name, "memo") == 0) { if (! PyDict_Check(value)) { PyErr_SetString(PyExc_TypeError, "memo must be a dictionary"); return -1; } Py_XDECREF(self->memo); self->memo = value; Py_INCREF(value); return 0; } if (strcmp(name, "binary")==0) { self->bin=PyObject_IsTrue(value); return 0; } if (strcmp(name, "fast")==0) { self->fast=PyObject_IsTrue(value); return 0; } PyErr_SetString(PyExc_AttributeError, name); return -1; } static char Picklertype__doc__[] = "Objects that know how to pickle objects\n" ; static PyTypeObject Picklertype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Pickler", /*tp_name*/ sizeof(Picklerobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Pickler_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)Pickler_getattr, /*tp_getattr*/ (setattrfunc)Pickler_setattr, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, Picklertype__doc__ /* Documentation string */ }; static PyObject * find_class(PyObject *py_module_name, PyObject *py_global_name, PyObject *fc) { PyObject *global = 0, *module; if (fc) { if (fc==Py_None) { PyErr_SetString(UnpicklingError, "Global and instance pickles are not supported."); return NULL; } return PyObject_CallFunction(fc, "OO", py_module_name, py_global_name); } module = PySys_GetObject("modules"); if (module == NULL) return NULL; module = PyDict_GetItem(module, py_module_name); if (module == NULL) { module = PyImport_Import(py_module_name); if (!module) return NULL; global = PyObject_GetAttr(module, py_global_name); Py_DECREF(module); } else global = PyObject_GetAttr(module, py_global_name); if (global == NULL) { char buf[256 + 37]; sprintf(buf, "Failed to import class %.128s from module %.128s", PyString_AS_STRING((PyStringObject*)py_global_name), PyString_AS_STRING((PyStringObject*)py_module_name)); PyErr_SetString(PyExc_SystemError, buf); return NULL; } return global; } static int marker(Unpicklerobject *self) { if (self->num_marks < 1) { PyErr_SetString(UnpicklingError, "could not find MARK"); return -1; } return self->marks[--self->num_marks]; } static int load_none(Unpicklerobject *self) { PDATA_APPEND(self->stack, Py_None, -1); return 0; } static int bad_readline() { PyErr_SetString(UnpicklingError, "pickle data was truncated"); return -1; } static int load_int(Unpicklerobject *self) { PyObject *py_int = 0; char *endptr, *s; int len, res = -1; long l; if ((len = (*self->readline_func)(self, &s)) < 0) return -1; if (len < 2) return bad_readline(); UNLESS (s=pystrndup(s,len)) return -1; errno = 0; l = strtol(s, &endptr, 0); if (errno || (*endptr != '\n') || (endptr[1] != '\0')) { /* Hm, maybe we've got something long. Let's try reading it as a Python long object. */ errno=0; UNLESS (py_int=PyLong_FromString(s,&endptr,0)) goto finally; if ((*endptr != '\n') || (endptr[1] != '\0')) { PyErr_SetString(PyExc_ValueError, "could not convert string to int"); goto finally; } } else { UNLESS (py_int = PyInt_FromLong(l)) goto finally; } free(s); PDATA_PUSH(self->stack, py_int, -1); return 0; finally: free(s); return res; } static long calc_binint(char *s, int x) { unsigned char c; int i; long l; for (i = 0, l = 0L; i < x; i++) { c = (unsigned char)s[i]; l |= (long)c << (i * 8); } return l; } static int load_binintx(Unpicklerobject *self, char *s, int x) { PyObject *py_int = 0; long l; l = calc_binint(s, x); UNLESS (py_int = PyInt_FromLong(l)) return -1; PDATA_PUSH(self->stack, py_int, -1); return 0; } static int load_binint(Unpicklerobject *self) { char *s; if ((*self->read_func)(self, &s, 4) < 0) return -1; return load_binintx(self, s, 4); } static int load_binint1(Unpicklerobject *self) { char *s; if ((*self->read_func)(self, &s, 1) < 0) return -1; return load_binintx(self, s, 1); } static int load_binint2(Unpicklerobject *self) { char *s; if ((*self->read_func)(self, &s, 2) < 0) return -1; return load_binintx(self, s, 2); } static int load_long(Unpicklerobject *self) { PyObject *l = 0; char *end, *s; int len, res = -1; if ((len = (*self->readline_func)(self, &s)) < 0) return -1; if (len < 2) return bad_readline(); UNLESS (s=pystrndup(s,len)) return -1; UNLESS (l = PyLong_FromString(s, &end, 0)) goto finally; free(s); PDATA_PUSH(self->stack, l, -1); return 0; finally: free(s); return res; } static int load_float(Unpicklerobject *self) { PyObject *py_float = 0; char *endptr, *s; int len, res = -1; double d; if ((len = (*self->readline_func)(self, &s)) < 0) return -1; if (len < 2) return bad_readline(); UNLESS (s=pystrndup(s,len)) return -1; errno = 0; d = strtod(s, &endptr); if (errno || (endptr[0] != '\n') || (endptr[1] != '\0')) { PyErr_SetString(PyExc_ValueError, "could not convert string to float"); goto finally; } UNLESS (py_float = PyFloat_FromDouble(d)) goto finally; free(s); PDATA_PUSH(self->stack, py_float, -1); return 0; finally: free(s); return res; } static int load_binfloat(Unpicklerobject *self) { PyObject *py_float = 0; int s, e; long fhi, flo; double x; char *p; if ((*self->read_func)(self, &p, 8) < 0) return -1; /* First byte */ s = (*p>>7) & 1; e = (*p & 0x7F) << 4; p++; /* Second byte */ e |= (*p>>4) & 0xF; fhi = (*p & 0xF) << 24; p++; /* Third byte */ fhi |= (*p & 0xFF) << 16; p++; /* Fourth byte */ fhi |= (*p & 0xFF) << 8; p++; /* Fifth byte */ fhi |= *p & 0xFF; p++; /* Sixth byte */ flo = (*p & 0xFF) << 16; p++; /* Seventh byte */ flo |= (*p & 0xFF) << 8; p++; /* Eighth byte */ flo |= *p & 0xFF; x = (double)fhi + (double)flo / 16777216.0; /* 2**24 */ x /= 268435456.0; /* 2**28 */ /* XXX This sadly ignores Inf/NaN */ if (e == 0) e = -1022; else { x += 1.0; e -= 1023; } x = ldexp(x, e); if (s) x = -x; UNLESS (py_float = PyFloat_FromDouble(x)) return -1; PDATA_PUSH(self->stack, py_float, -1); return 0; } static int load_string(Unpicklerobject *self) { PyObject *str = 0; int len, res = -1, nslash; char *s, q, *p; static PyObject *eval_dict = 0; if ((len = (*self->readline_func)(self, &s)) < 0) return -1; if (len < 2) return bad_readline(); UNLESS (s=pystrndup(s,len)) return -1; /* Check for unquoted quotes (evil strings) */ q=*s; if (q != '"' && q != '\'') goto insecure; for (p=s+1, nslash=0; *p; p++) { if (*p==q && nslash%2==0) break; if (*p=='\\') nslash++; else nslash=0; } if (*p==q) { for (p++; *p; p++) if (*p > ' ') goto insecure; } else goto insecure; /********************************************/ UNLESS (eval_dict) UNLESS (eval_dict = Py_BuildValue("{s{}}", "__builtins__")) goto finally; UNLESS (str = PyRun_String(s, Py_eval_input, eval_dict, eval_dict)) goto finally; free(s); PDATA_PUSH(self->stack, str, -1); return 0; finally: free(s); return res; insecure: free(s); PyErr_SetString(PyExc_ValueError,"insecure string pickle"); return -1; } static int load_binstring(Unpicklerobject *self) { PyObject *py_string = 0; long l; char *s; if ((*self->read_func)(self, &s, 4) < 0) return -1; l = calc_binint(s, 4); if ((*self->read_func)(self, &s, l) < 0) return -1; UNLESS (py_string = PyString_FromStringAndSize(s, l)) return -1; PDATA_PUSH(self->stack, py_string, -1); return 0; } static int load_short_binstring(Unpicklerobject *self) { PyObject *py_string = 0; unsigned char l; char *s; if ((*self->read_func)(self, &s, 1) < 0) return -1; l = (unsigned char)s[0]; if ((*self->read_func)(self, &s, l) < 0) return -1; UNLESS (py_string = PyString_FromStringAndSize(s, l)) return -1; PDATA_PUSH(self->stack, py_string, -1); return 0; } static int load_tuple(Unpicklerobject *self) { PyObject *tup; int i; if ((i = marker(self)) < 0) return -1; UNLESS (tup=Pdata_popTuple(self->stack, i)) return -1; PDATA_PUSH(self->stack, tup, -1); return 0; } static int load_empty_tuple(Unpicklerobject *self) { PyObject *tup; UNLESS (tup=PyTuple_New(0)) return -1; PDATA_PUSH(self->stack, tup, -1); return 0; } static int load_empty_list(Unpicklerobject *self) { PyObject *list; UNLESS (list=PyList_New(0)) return -1; PDATA_PUSH(self->stack, list, -1); return 0; } static int load_empty_dict(Unpicklerobject *self) { PyObject *dict; UNLESS (dict=PyDict_New()) return -1; PDATA_PUSH(self->stack, dict, -1); return 0; } static int load_list(Unpicklerobject *self) { PyObject *list = 0; int i; if ((i = marker(self)) < 0) return -1; UNLESS (list=Pdata_popList(self->stack, i)) return -1; PDATA_PUSH(self->stack, list, -1); return 0; } static int load_dict(Unpicklerobject *self) { PyObject *dict, *key, *value; int i, j, k; if ((i = marker(self)) < 0) return -1; j=self->stack->length; UNLESS (dict = PyDict_New()) return -1; for (k = i+1; k < j; k += 2) { key =self->stack->data[k-1]; value=self->stack->data[k ]; if (PyDict_SetItem(dict, key, value) < 0) { Py_DECREF(dict); return -1; } } Pdata_clear(self->stack, i); PDATA_PUSH(self->stack, dict, -1); return 0; } static PyObject * Instance_New(PyObject *cls, PyObject *args) { int has_key; PyObject *safe=0, *r=0; if (PyClass_Check(cls)) { int l; if ((l=PyObject_Length(args)) < 0) goto err; UNLESS (l) { PyObject *__getinitargs__; UNLESS (__getinitargs__=PyObject_GetAttr(cls, __getinitargs___str)) { /* We have a class with no __getinitargs__, so bypass usual construction */ PyInstanceObject *inst; PyErr_Clear(); UNLESS (inst=PyObject_NEW(PyInstanceObject, &PyInstance_Type)) goto err; inst->in_class=(PyClassObject*)cls; Py_INCREF(cls); UNLESS (inst->in_dict=PyDict_New()) { Py_DECREF(inst); goto err; } return (PyObject *)inst; } Py_DECREF(__getinitargs__); } if ((r=PyInstance_New(cls, args, NULL))) return r; else goto err; } if ((has_key = cPickle_PyMapping_HasKey(safe_constructors, cls)) < 0) goto err; if (!has_key) if (!(safe = PyObject_GetAttr(cls, __safe_for_unpickling___str)) || !PyObject_IsTrue(safe)) { cPickle_ErrFormat(UnpicklingError, "%s is not safe for unpickling", "O", cls); Py_XDECREF(safe); return NULL; } if (args==Py_None) { /* Special case, call cls.__basicnew__() */ PyObject *basicnew; UNLESS (basicnew=PyObject_GetAttr(cls, __basicnew___str)) return NULL; r=PyObject_CallObject(basicnew, NULL); Py_DECREF(basicnew); if (r) return r; } if ((r=PyObject_CallObject(cls, args))) return r; err: { PyObject *tp, *v, *tb; PyErr_Fetch(&tp, &v, &tb); if ((r=Py_BuildValue("OOO",v,cls,args))) { Py_XDECREF(v); v=r; } PyErr_Restore(tp,v,tb); } return NULL; } static int load_obj(Unpicklerobject *self) { PyObject *class, *tup, *obj=0; int i; if ((i = marker(self)) < 0) return -1; UNLESS (tup=Pdata_popTuple(self->stack, i+1)) return -1; PDATA_POP(self->stack, class); if (class) { obj = Instance_New(class, tup); Py_DECREF(class); } Py_DECREF(tup); if (! obj) return -1; PDATA_PUSH(self->stack, obj, -1); return 0; } static int load_inst(Unpicklerobject *self) { PyObject *tup, *class=0, *obj=0, *module_name, *class_name; int i, len; char *s; if ((i = marker(self)) < 0) return -1; if ((len = (*self->readline_func)(self, &s)) < 0) return -1; if (len < 2) return bad_readline(); UNLESS (module_name = PyString_FromStringAndSize(s, len - 1)) return -1; if ((len = (*self->readline_func)(self, &s)) >= 0) { if (len < 2) return bad_readline(); if ((class_name = PyString_FromStringAndSize(s, len - 1))) { class = find_class(module_name, class_name, self->find_class); Py_DECREF(class_name); } } Py_DECREF(module_name); if (! class) return -1; if ((tup=Pdata_popTuple(self->stack, i))) { obj = Instance_New(class, tup); Py_DECREF(tup); } Py_DECREF(class); if (! obj) return -1; PDATA_PUSH(self->stack, obj, -1); return 0; } static int load_global(Unpicklerobject *self) { PyObject *class = 0, *module_name = 0, *class_name = 0; int len; char *s; if ((len = (*self->readline_func)(self, &s)) < 0) return -1; if (len < 2) return bad_readline(); UNLESS (module_name = PyString_FromStringAndSize(s, len - 1)) return -1; if ((len = (*self->readline_func)(self, &s)) >= 0) { if (len < 2) return bad_readline(); if ((class_name = PyString_FromStringAndSize(s, len - 1))) { class = find_class(module_name, class_name, self->find_class); Py_DECREF(class_name); } } Py_DECREF(module_name); if (! class) return -1; PDATA_PUSH(self->stack, class, -1); return 0; } static int load_persid(Unpicklerobject *self) { PyObject *pid = 0; int len; char *s; if (self->pers_func) { if ((len = (*self->readline_func)(self, &s)) < 0) return -1; if (len < 2) return bad_readline(); UNLESS (pid = PyString_FromStringAndSize(s, len - 1)) return -1; if (PyList_Check(self->pers_func)) { if (PyList_Append(self->pers_func, pid) < 0) { Py_DECREF(pid); return -1; } } else { ARG_TUP(self, pid); if (self->arg) { pid = PyObject_CallObject(self->pers_func, self->arg); FREE_ARG_TUP(self); } } if (! pid) return -1; PDATA_PUSH(self->stack, pid, -1); return 0; } else { PyErr_SetString(UnpicklingError, "A load persistent id instruction was encountered,\n" "but no persistent_load function was specified."); return -1; } } static int load_binpersid(Unpicklerobject *self) { PyObject *pid = 0; if (self->pers_func) { PDATA_POP(self->stack, pid); if (! pid) return -1; if (PyList_Check(self->pers_func)) { if (PyList_Append(self->pers_func, pid) < 0) { Py_DECREF(pid); return -1; } } else { ARG_TUP(self, pid); if (self->arg) { pid = PyObject_CallObject(self->pers_func, self->arg); FREE_ARG_TUP(self); } if (! pid) return -1; } PDATA_PUSH(self->stack, pid, -1); return 0; } else { PyErr_SetString(UnpicklingError, "A load persistent id instruction was encountered,\n" "but no persistent_load function was specified."); return -1; } } static int load_pop(Unpicklerobject *self) { int len; UNLESS ((len=self->stack->length) > 0) return stackUnderflow(); if ((self->num_marks > 0) && (self->marks[self->num_marks - 1] == len)) self->num_marks--; else Py_DECREF(self->stack->data[--(self->stack->length)]); return 0; } static int load_pop_mark(Unpicklerobject *self) { int i; if ((i = marker(self)) < 0) return -1; Pdata_clear(self->stack, i); return 0; } static int load_dup(Unpicklerobject *self) { PyObject *last; int len; if ((len = self->stack->length) <= 0) return stackUnderflow(); last=self->stack->data[len-1]; Py_INCREF(last); PDATA_PUSH(self->stack, last, -1); return 0; } static int load_get(Unpicklerobject *self) { PyObject *py_str = 0, *value = 0; int len; char *s; int rc; if ((len = (*self->readline_func)(self, &s)) < 0) return -1; if (len < 2) return bad_readline(); UNLESS (py_str = PyString_FromStringAndSize(s, len - 1)) return -1; value = PyDict_GetItem(self->memo, py_str); if (! value) { PyErr_SetObject(BadPickleGet, py_str); rc = -1; } else { PDATA_APPEND(self->stack, value, -1); rc = 0; } Py_DECREF(py_str); return rc; } static int load_binget(Unpicklerobject *self) { PyObject *py_key = 0, *value = 0; unsigned char key; char *s; int rc; if ((*self->read_func)(self, &s, 1) < 0) return -1; key = (unsigned char)s[0]; UNLESS (py_key = PyInt_FromLong((long)key)) return -1; value = PyDict_GetItem(self->memo, py_key); if (! value) { PyErr_SetObject(BadPickleGet, py_key); rc = -1; } else { PDATA_APPEND(self->stack, value, -1); rc = 0; } Py_DECREF(py_key); return rc; } static int load_long_binget(Unpicklerobject *self) { PyObject *py_key = 0, *value = 0; unsigned char c, *s; long key; int rc; if ((*self->read_func)(self, &s, 4) < 0) return -1; c = (unsigned char)s[0]; key = (long)c; c = (unsigned char)s[1]; key |= (long)c << 8; c = (unsigned char)s[2]; key |= (long)c << 16; c = (unsigned char)s[3]; key |= (long)c << 24; UNLESS (py_key = PyInt_FromLong((long)key)) return -1; value = PyDict_GetItem(self->memo, py_key); if (! value) { PyErr_SetObject(BadPickleGet, py_key); rc = -1; } else { PDATA_APPEND(self->stack, value, -1); rc = 0; } Py_DECREF(py_key); return rc; } static int load_put(Unpicklerobject *self) { PyObject *py_str = 0, *value = 0; int len, l; char *s; if ((l = (*self->readline_func)(self, &s)) < 0) return -1; if (l < 2) return bad_readline(); UNLESS (len=self->stack->length) return stackUnderflow(); UNLESS (py_str = PyString_FromStringAndSize(s, l - 1)) return -1; value=self->stack->data[len-1]; l=PyDict_SetItem(self->memo, py_str, value); Py_DECREF(py_str); return l; } static int load_binput(Unpicklerobject *self) { PyObject *py_key = 0, *value = 0; unsigned char key, *s; int len; if ((*self->read_func)(self, &s, 1) < 0) return -1; UNLESS ((len=self->stack->length) > 0) return stackUnderflow(); key = (unsigned char)s[0]; UNLESS (py_key = PyInt_FromLong((long)key)) return -1; value=self->stack->data[len-1]; len=PyDict_SetItem(self->memo, py_key, value); Py_DECREF(py_key); return len; } static int load_long_binput(Unpicklerobject *self) { PyObject *py_key = 0, *value = 0; long key; unsigned char c, *s; int len; if ((*self->read_func)(self, &s, 4) < 0) return -1; UNLESS (len=self->stack->length) return stackUnderflow(); c = (unsigned char)s[0]; key = (long)c; c = (unsigned char)s[1]; key |= (long)c << 8; c = (unsigned char)s[2]; key |= (long)c << 16; c = (unsigned char)s[3]; key |= (long)c << 24; UNLESS (py_key = PyInt_FromLong(key)) return -1; value=self->stack->data[len-1]; len=PyDict_SetItem(self->memo, py_key, value); Py_DECREF(py_key); return len; } static int do_append(Unpicklerobject *self, int x) { PyObject *value = 0, *list = 0, *append_method = 0; int len, i; UNLESS ((len=self->stack->length) >= x && x > 0) return stackUnderflow(); if (len==x) return 0; /* nothing to do */ list=self->stack->data[x-1]; if (PyList_Check(list)) { PyObject *slice; int list_len; slice=Pdata_popList(self->stack, x); list_len = PyList_GET_SIZE(list); i=PyList_SetSlice(list, list_len, list_len, slice); Py_DECREF(slice); return i; } else { UNLESS (append_method = PyObject_GetAttr(list, append_str)) return -1; for (i = x; i < len; i++) { PyObject *junk; value=self->stack->data[i]; junk=0; ARG_TUP(self, value); if (self->arg) { junk = PyObject_CallObject(append_method, self->arg); FREE_ARG_TUP(self); } if (! junk) { Pdata_clear(self->stack, i+1); self->stack->length=x; Py_DECREF(append_method); return -1; } Py_DECREF(junk); } self->stack->length=x; Py_DECREF(append_method); } return 0; } static int load_append(Unpicklerobject *self) { return do_append(self, self->stack->length - 1); } static int load_appends(Unpicklerobject *self) { return do_append(self, marker(self)); } static int do_setitems(Unpicklerobject *self, int x) { PyObject *value = 0, *key = 0, *dict = 0; int len, i, r=0; UNLESS ((len=self->stack->length) >= x && x > 0) return stackUnderflow(); dict=self->stack->data[x-1]; for (i = x+1; i < len; i += 2) { key =self->stack->data[i-1]; value=self->stack->data[i ]; if (PyObject_SetItem(dict, key, value) < 0) { r=-1; break; } } Pdata_clear(self->stack, x); return r; } static int load_setitem(Unpicklerobject *self) { return do_setitems(self, self->stack->length - 2); } static int load_setitems(Unpicklerobject *self) { return do_setitems(self, marker(self)); } static int load_build(Unpicklerobject *self) { PyObject *value = 0, *inst = 0, *instdict = 0, *d_key = 0, *d_value = 0, *junk = 0, *__setstate__ = 0; int i, r = 0; if (self->stack->length < 2) return stackUnderflow(); PDATA_POP(self->stack, value); if (! value) return -1; inst=self->stack->data[self->stack->length-1]; if ((__setstate__ = PyObject_GetAttr(inst, __setstate___str))) { ARG_TUP(self, value); if (self->arg) { junk = PyObject_CallObject(__setstate__, self->arg); FREE_ARG_TUP(self); } Py_DECREF(__setstate__); if (! junk) return -1; Py_DECREF(junk); return 0; } PyErr_Clear(); if ((instdict = PyObject_GetAttr(inst, __dict___str))) { i = 0; while (PyDict_Next(value, &i, &d_key, &d_value)) { if (PyObject_SetItem(instdict, d_key, d_value) < 0) { r=-1; break; } } Py_DECREF(instdict); } else r=-1; Py_XDECREF(value); return r; } static int load_mark(Unpicklerobject *self) { int s; if ((self->num_marks + 1) >= self->marks_size) { s=self->marks_size+20; if (s <= self->num_marks) s=self->num_marks + 1; if (self->marks == NULL) self->marks=(int *)malloc(s * sizeof(int)); else self->marks=(int *)realloc(self->marks, s * sizeof(int)); if (! self->marks) { PyErr_NoMemory(); return -1; } self->marks_size = s; } self->marks[self->num_marks++] = self->stack->length; return 0; } static int load_reduce(Unpicklerobject *self) { PyObject *callable = 0, *arg_tup = 0, *ob = 0; PDATA_POP(self->stack, arg_tup); if (! arg_tup) return -1; PDATA_POP(self->stack, callable); if (callable) { ob = Instance_New(callable, arg_tup); Py_DECREF(callable); } Py_DECREF(arg_tup); if (! ob) return -1; PDATA_PUSH(self->stack, ob, -1); return 0; } static PyObject * load(Unpicklerobject *self) { PyObject *err = 0, *val = 0; char *s; self->num_marks = 0; if (self->stack->length) Pdata_clear(self->stack, 0); while (1) { if ((*self->read_func)(self, &s, 1) < 0) break; switch (s[0]) { case NONE: if (load_none(self) < 0) break; continue; case BININT: if (load_binint(self) < 0) break; continue; case BININT1: if (load_binint1(self) < 0) break; continue; case BININT2: if (load_binint2(self) < 0) break; continue; case INT: if (load_int(self) < 0) break; continue; case LONG: if (load_long(self) < 0) break; continue; case FLOAT: if (load_float(self) < 0) break; continue; case BINFLOAT: if (load_binfloat(self) < 0) break; continue; case BINSTRING: if (load_binstring(self) < 0) break; continue; case SHORT_BINSTRING: if (load_short_binstring(self) < 0) break; continue; case STRING: if (load_string(self) < 0) break; continue; case EMPTY_TUPLE: if (load_empty_tuple(self) < 0) break; continue; case TUPLE: if (load_tuple(self) < 0) break; continue; case EMPTY_LIST: if (load_empty_list(self) < 0) break; continue; case LIST: if (load_list(self) < 0) break; continue; case EMPTY_DICT: if (load_empty_dict(self) < 0) break; continue; case DICT: if (load_dict(self) < 0) break; continue; case OBJ: if (load_obj(self) < 0) break; continue; case INST: if (load_inst(self) < 0) break; continue; case GLOBAL: if (load_global(self) < 0) break; continue; case APPEND: if (load_append(self) < 0) break; continue; case APPENDS: if (load_appends(self) < 0) break; continue; case BUILD: if (load_build(self) < 0) break; continue; case DUP: if (load_dup(self) < 0) break; continue; case BINGET: if (load_binget(self) < 0) break; continue; case LONG_BINGET: if (load_long_binget(self) < 0) break; continue; case GET: if (load_get(self) < 0) break; continue; case MARK: if (load_mark(self) < 0) break; continue; case BINPUT: if (load_binput(self) < 0) break; continue; case LONG_BINPUT: if (load_long_binput(self) < 0) break; continue; case PUT: if (load_put(self) < 0) break; continue; case POP: if (load_pop(self) < 0) break; continue; case POP_MARK: if (load_pop_mark(self) < 0) break; continue; case SETITEM: if (load_setitem(self) < 0) break; continue; case SETITEMS: if (load_setitems(self) < 0) break; continue; case STOP: break; case PERSID: if (load_persid(self) < 0) break; continue; case BINPERSID: if (load_binpersid(self) < 0) break; continue; case REDUCE: if (load_reduce(self) < 0) break; continue; default: cPickle_ErrFormat(UnpicklingError, "invalid load key, '%s'.", "c", s[0]); return NULL; } break; } if ((err = PyErr_Occurred())) { if (err == PyExc_EOFError) { PyErr_SetNone(PyExc_EOFError); } return NULL; } PDATA_POP(self->stack, val); return val; } /* No-load functions to support noload, which is used to find persistent references. */ static int noload_obj(Unpicklerobject *self) { int i; if ((i = marker(self)) < 0) return -1; return Pdata_clear(self->stack, i+1); } static int noload_inst(Unpicklerobject *self) { int i; char *s; if ((i = marker(self)) < 0) return -1; Pdata_clear(self->stack, i); if ((*self->readline_func)(self, &s) < 0) return -1; if ((*self->readline_func)(self, &s) < 0) return -1; PDATA_APPEND(self->stack, Py_None,-1); return 0; } static int noload_global(Unpicklerobject *self) { char *s; if ((*self->readline_func)(self, &s) < 0) return -1; if ((*self->readline_func)(self, &s) < 0) return -1; PDATA_APPEND(self->stack, Py_None,-1); return 0; } static int noload_reduce(Unpicklerobject *self) { if (self->stack->length < 2) return stackUnderflow(); Pdata_clear(self->stack, self->stack->length-2); PDATA_APPEND(self->stack, Py_None,-1); return 0; } static int noload_build(Unpicklerobject *self) { if (self->stack->length < 1) return stackUnderflow(); Pdata_clear(self->stack, self->stack->length-1); return 0; } static PyObject * noload(Unpicklerobject *self) { PyObject *err = 0, *val = 0; char *s; self->num_marks = 0; Pdata_clear(self->stack, 0); while (1) { if ((*self->read_func)(self, &s, 1) < 0) break; switch (s[0]) { case NONE: if (load_none(self) < 0) break; continue; case BININT: if (load_binint(self) < 0) break; continue; case BININT1: if (load_binint1(self) < 0) break; continue; case BININT2: if (load_binint2(self) < 0) break; continue; case INT: if (load_int(self) < 0) break; continue; case LONG: if (load_long(self) < 0) break; continue; case FLOAT: if (load_float(self) < 0) break; continue; case BINFLOAT: if (load_binfloat(self) < 0) break; continue; case BINSTRING: if (load_binstring(self) < 0) break; continue; case SHORT_BINSTRING: if (load_short_binstring(self) < 0) break; continue; case STRING: if (load_string(self) < 0) break; continue; case EMPTY_TUPLE: if (load_empty_tuple(self) < 0) break; continue; case TUPLE: if (load_tuple(self) < 0) break; continue; case EMPTY_LIST: if (load_empty_list(self) < 0) break; continue; case LIST: if (load_list(self) < 0) break; continue; case EMPTY_DICT: if (load_empty_dict(self) < 0) break; continue; case DICT: if (load_dict(self) < 0) break; continue; case OBJ: if (noload_obj(self) < 0) break; continue; case INST: if (noload_inst(self) < 0) break; continue; case GLOBAL: if (noload_global(self) < 0) break; continue; case APPEND: if (load_append(self) < 0) break; continue; case APPENDS: if (load_appends(self) < 0) break; continue; case BUILD: if (noload_build(self) < 0) break; continue; case DUP: if (load_dup(self) < 0) break; continue; case BINGET: if (load_binget(self) < 0) break; continue; case LONG_BINGET: if (load_long_binget(self) < 0) break; continue; case GET: if (load_get(self) < 0) break; continue; case MARK: if (load_mark(self) < 0) break; continue; case BINPUT: if (load_binput(self) < 0) break; continue; case LONG_BINPUT: if (load_long_binput(self) < 0) break; continue; case PUT: if (load_put(self) < 0) break; continue; case POP: if (load_pop(self) < 0) break; continue; case POP_MARK: if (load_pop_mark(self) < 0) break; continue; case SETITEM: if (load_setitem(self) < 0) break; continue; case SETITEMS: if (load_setitems(self) < 0) break; continue; case STOP: break; case PERSID: if (load_persid(self) < 0) break; continue; case BINPERSID: if (load_binpersid(self) < 0) break; continue; case REDUCE: if (noload_reduce(self) < 0) break; continue; default: cPickle_ErrFormat(UnpicklingError, "invalid load key, '%s'.", "c", s[0]); return NULL; } break; } if ((err = PyErr_Occurred())) { if (err == PyExc_EOFError) { PyErr_SetNone(PyExc_EOFError); } return NULL; } PDATA_POP(self->stack, val); return val; } static PyObject * Unpickler_load(Unpicklerobject *self, PyObject *args) { UNLESS (PyArg_ParseTuple(args, "")) return NULL; return load(self); } static PyObject * Unpickler_noload(Unpicklerobject *self, PyObject *args) { UNLESS (PyArg_ParseTuple(args, "")) return NULL; return noload(self); } static struct PyMethodDef Unpickler_methods[] = { {"load", (PyCFunction)Unpickler_load, 1, "load() -- Load a pickle" }, {"noload", (PyCFunction)Unpickler_noload, 1, "noload() -- not load a pickle, but go through most of the motions\n" "\n" "This function can be used to read past a pickle without instantiating\n" "any objects or importing any modules. It can also be used to find all\n" "persistent references without instantiating any objects or importing\n" "any modules.\n" }, {NULL, NULL} /* sentinel */ }; static Unpicklerobject * newUnpicklerobject(PyObject *f) { Unpicklerobject *self; UNLESS (self = PyObject_NEW(Unpicklerobject, &Unpicklertype)) return NULL; self->file = NULL; self->arg = NULL; self->stack = (Pdata*)Pdata_New(); self->pers_func = NULL; self->last_string = NULL; self->marks = NULL; self->num_marks = 0; self->marks_size = 0; self->buf_size = 0; self->read = NULL; self->readline = NULL; self->safe_constructors = NULL; self->find_class = NULL; UNLESS (self->memo = PyDict_New()) { Py_XDECREF((PyObject *)self); return NULL; } Py_INCREF(f); self->file = f; /* Set read, readline based on type of f */ if (PyFile_Check(f)) { self->fp = PyFile_AsFile(f); if (self->fp == NULL) { PyErr_SetString(PyExc_IOError, "input file closed"); return NULL; } self->read_func = read_file; self->readline_func = readline_file; } else if (PycStringIO_InputCheck(f)) { self->fp = NULL; self->read_func = read_cStringIO; self->readline_func = readline_cStringIO; } else { self->fp = NULL; self->read_func = read_other; self->readline_func = readline_other; UNLESS ((self->readline = PyObject_GetAttr(f, readline_str)) && (self->read = PyObject_GetAttr(f, read_str))) { PyErr_Clear(); PyErr_SetString( PyExc_TypeError, "argument must have 'read' and " "'readline' attributes" ); goto err; } } if (PyEval_GetRestricted()) { /* Restricted execution, get private tables */ PyObject *m; UNLESS (m=PyImport_Import(copy_reg_str)) goto err; self->safe_constructors=PyObject_GetAttr(m, safe_constructors_str); Py_DECREF(m); UNLESS (self->safe_constructors) goto err; } else { self->safe_constructors=safe_constructors; Py_INCREF(safe_constructors); } return self; err: Py_DECREF((PyObject *)self); return NULL; } static PyObject * get_Unpickler(PyObject *self, PyObject *args) { PyObject *file; UNLESS (PyArg_ParseTuple(args, "O", &file)) return NULL; return (PyObject *)newUnpicklerobject(file); } static void Unpickler_dealloc(Unpicklerobject *self) { Py_XDECREF(self->readline); Py_XDECREF(self->read); Py_XDECREF(self->file); Py_XDECREF(self->memo); Py_XDECREF(self->stack); Py_XDECREF(self->pers_func); Py_XDECREF(self->arg); Py_XDECREF(self->last_string); Py_XDECREF(self->safe_constructors); if (self->marks) { free(self->marks); } if (self->buf_size) { free(self->buf); } PyMem_DEL(self); } static PyObject * Unpickler_getattr(Unpicklerobject *self, char *name) { if (!strcmp(name, "persistent_load")) { if (!self->pers_func) { PyErr_SetString(PyExc_AttributeError, name); return NULL; } Py_INCREF(self->pers_func); return self->pers_func; } if (!strcmp(name, "find_global")) { if (!self->find_class) { PyErr_SetString(PyExc_AttributeError, name); return NULL; } Py_INCREF(self->find_class); return self->find_class; } if (!strcmp(name, "memo")) { if (!self->memo) { PyErr_SetString(PyExc_AttributeError, name); return NULL; } Py_INCREF(self->memo); return self->memo; } if (!strcmp(name, "UnpicklingError")) { Py_INCREF(UnpicklingError); return UnpicklingError; } return Py_FindMethod(Unpickler_methods, (PyObject *)self, name); } static int Unpickler_setattr(Unpicklerobject *self, char *name, PyObject *value) { if (!strcmp(name, "persistent_load")) { Py_XDECREF(self->pers_func); self->pers_func = value; Py_XINCREF(value); return 0; } if (!strcmp(name, "find_global")) { Py_XDECREF(self->find_class); self->find_class = value; Py_XINCREF(value); return 0; } if (! value) { PyErr_SetString(PyExc_TypeError, "attribute deletion is not supported"); return -1; } if (strcmp(name, "memo") == 0) { if (! PyDict_Check(value)) { PyErr_SetString(PyExc_TypeError, "memo must be a dictionary"); return -1; } Py_XDECREF(self->memo); self->memo = value; Py_INCREF(value); return 0; } PyErr_SetString(PyExc_AttributeError, name); return -1; } static PyObject * cpm_dump(PyObject *self, PyObject *args) { PyObject *ob, *file, *res = NULL; Picklerobject *pickler = 0; int bin = 0; UNLESS (PyArg_ParseTuple(args, "OO|i", &ob, &file, &bin)) goto finally; UNLESS (pickler = newPicklerobject(file, bin)) goto finally; if (dump(pickler, ob) < 0) goto finally; Py_INCREF(Py_None); res = Py_None; finally: Py_XDECREF(pickler); return res; } static PyObject * cpm_dumps(PyObject *self, PyObject *args) { PyObject *ob, *file = 0, *res = NULL; Picklerobject *pickler = 0; int bin = 0; UNLESS (PyArg_ParseTuple(args, "O|i", &ob, &bin)) goto finally; UNLESS (file = PycStringIO->NewOutput(128)) goto finally; UNLESS (pickler = newPicklerobject(file, bin)) goto finally; if (dump(pickler, ob) < 0) goto finally; res = PycStringIO->cgetvalue(file); finally: Py_XDECREF(pickler); Py_XDECREF(file); return res; } static PyObject * cpm_load(PyObject *self, PyObject *args) { Unpicklerobject *unpickler = 0; PyObject *ob, *res = NULL; UNLESS (PyArg_ParseTuple(args, "O", &ob)) goto finally; UNLESS (unpickler = newUnpicklerobject(ob)) goto finally; res = load(unpickler); finally: Py_XDECREF(unpickler); return res; } static PyObject * cpm_loads(PyObject *self, PyObject *args) { PyObject *ob, *file = 0, *res = NULL; Unpicklerobject *unpickler = 0; UNLESS (PyArg_ParseTuple(args, "S", &ob)) goto finally; UNLESS (file = PycStringIO->NewInput(ob)) goto finally; UNLESS (unpickler = newUnpicklerobject(file)) goto finally; res = load(unpickler); finally: Py_XDECREF(file); Py_XDECREF(unpickler); return res; } static char Unpicklertype__doc__[] = "Objects that know how to unpickle"; static PyTypeObject Unpicklertype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Unpickler", /*tp_name*/ sizeof(Unpicklerobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Unpickler_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)Unpickler_getattr, /*tp_getattr*/ (setattrfunc)Unpickler_setattr, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, Unpicklertype__doc__ /* Documentation string */ }; static struct PyMethodDef cPickle_methods[] = { {"dump", (PyCFunction)cpm_dump, 1, "dump(object, file, [binary]) --" "Write an object in pickle format to the given file\n" "\n" "If the optional argument, binary, is provided and is true, then the\n" "pickle will be written in binary format, which is more space and\n" "computationally efficient. \n" }, {"dumps", (PyCFunction)cpm_dumps, 1, "dumps(object, [binary]) --" "Return a string containing an object in pickle format\n" "\n" "If the optional argument, binary, is provided and is true, then the\n" "pickle will be written in binary format, which is more space and\n" "computationally efficient. \n" }, {"load", (PyCFunction)cpm_load, 1, "load(file) -- Load a pickle from the given file"}, {"loads", (PyCFunction)cpm_loads, 1, "loads(string) -- Load a pickle from the given string"}, {"Pickler", (PyCFunction)get_Pickler, 1, "Pickler(file, [binary]) -- Create a pickler\n" "\n" "If the optional argument, binary, is provided and is true, then\n" "pickles will be written in binary format, which is more space and\n" "computationally efficient. \n" }, {"Unpickler", (PyCFunction)get_Unpickler, 1, "Unpickler(file) -- Create an unpickler"}, { NULL, NULL } }; static int init_stuff(PyObject *module, PyObject *module_dict) { PyObject *string, *copy_reg, *t, *r; #define INIT_STR(S) UNLESS(S ## _str=PyString_FromString(#S)) return -1; INIT_STR(__class__); INIT_STR(__getinitargs__); INIT_STR(__dict__); INIT_STR(__getstate__); INIT_STR(__setstate__); INIT_STR(__name__); INIT_STR(__main__); INIT_STR(__reduce__); INIT_STR(write); INIT_STR(__safe_for_unpickling__); INIT_STR(append); INIT_STR(read); INIT_STR(readline); INIT_STR(copy_reg); INIT_STR(dispatch_table); INIT_STR(safe_constructors); INIT_STR(__basicnew__); UNLESS (empty_str=PyString_FromString("")) return -1; UNLESS (copy_reg = PyImport_ImportModule("copy_reg")) return -1; /* These next few are special because we want to use different ones in restricted mode. */ UNLESS (dispatch_table = PyObject_GetAttr(copy_reg, dispatch_table_str)) return -1; UNLESS (safe_constructors = PyObject_GetAttr(copy_reg, safe_constructors_str)) return -1; Py_DECREF(copy_reg); /* Down to here ********************************** */ UNLESS (string = PyImport_ImportModule("string")) return -1; UNLESS (atol_func = PyObject_GetAttrString(string, "atol")) return -1; Py_DECREF(string); UNLESS (empty_tuple = PyTuple_New(0)) return -1; /* Ugh */ UNLESS (t=PyImport_ImportModule("__builtin__")) return -1; if (PyDict_SetItemString(module_dict, "__builtins__", t) < 0) return -1; UNLESS (t=PyDict_New()) return -1; UNLESS (r=PyRun_String( "def __init__(self, *args): self.args=args\n\n" "def __str__(self):\n" " return self.args and ('%s' % self.args[0]) or '(what)'\n", Py_file_input, module_dict, t) ) return -1; Py_DECREF(r); UNLESS (PickleError = PyErr_NewException("cPickle.PickleError", NULL, t)) return -1; Py_DECREF(t); UNLESS (PicklingError = PyErr_NewException("cPickle.PicklingError", PickleError, NULL)) return -1; UNLESS (t=PyDict_New()) return -1; UNLESS (r=PyRun_String( "def __init__(self, *args): self.args=args\n\n" "def __str__(self):\n" " a=self.args\n" " a=a and type(a[0]) or '(what)'\n" " return 'Cannot pickle %s objects' % a\n" , Py_file_input, module_dict, t) ) return -1; Py_DECREF(r); UNLESS (UnpickleableError = PyErr_NewException( "cPickle.UnpickleableError", PicklingError, t)) return -1; Py_DECREF(t); UNLESS (UnpicklingError = PyErr_NewException("cPickle.UnpicklingError", PickleError, NULL)) return -1; if (PyDict_SetItemString(module_dict, "PickleError", PickleError) < 0) return -1; if (PyDict_SetItemString(module_dict, "PicklingError", PicklingError) < 0) return -1; if (PyDict_SetItemString(module_dict, "UnpicklingError", UnpicklingError) < 0) return -1; if (PyDict_SetItemString(module_dict, "UnpickleableError", UnpickleableError) < 0) return -1; UNLESS (BadPickleGet = PyString_FromString("cPickle.BadPickleGet")) return -1; if (PyDict_SetItemString(module_dict, "BadPickleGet", BadPickleGet) < 0) return -1; PycString_IMPORT; return 0; } #ifndef DL_EXPORT /* declarations for DLL import/export */ #define DL_EXPORT(RTYPE) RTYPE #endif DL_EXPORT(void) initcPickle() { PyObject *m, *d, *v; char *rev="$Revision: 1.71 $"; PyObject *format_version; PyObject *compatible_formats; Picklertype.ob_type = &PyType_Type; Unpicklertype.ob_type = &PyType_Type; PdataType.ob_type = &PyType_Type; /* Create the module and add the functions */ m = Py_InitModule4("cPickle", cPickle_methods, cPickle_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); /* Add some symbolic constants to the module */ d = PyModule_GetDict(m); PyDict_SetItemString(d,"__version__", v = PyString_FromString(rev)); Py_XDECREF(v); format_version = PyString_FromString("1.3"); compatible_formats = Py_BuildValue("[sss]", "1.0", "1.1", "1.2"); PyDict_SetItemString(d, "format_version", format_version); PyDict_SetItemString(d, "compatible_formats", compatible_formats); Py_XDECREF(format_version); Py_XDECREF(compatible_formats); init_stuff(m, d); } Zope-2.0.1-ZEO-nonbin/lib/Components/cPickle/cPickle.stx100644 1007 1403 32452 6442532701 22714 0ustar petrillipetrillicPickle, A C Pickle Implementation "cPickle", http://www.digicool.com/releases/cPickle/cPickle-1.0b2.tar.gz, is a C implementation of the Python module, pickle.py, and is fully compatible with pickle: all types picklable by pickle can be pickled using cPickle [1], and pickles generated using pickle may be unpickled using cPickle and vice versa. The basic interface for cPickle is nearly the same as pickle's, the only difference being that an optional value may be specified as the final argument to Pickler(), dump, and dumps(), specifying that binary mode should be used. For instance, to pickle an object, ob, to file, f, which has been opened for binary writing:: p = cPickle.Pickler(f, 1) p.dump(ob) alternately:: cPickle.dump(ob, f, 1) Using binary format produces smaller pickles and increases the speed of pickling and unpickling. Note, however, old versions of pickle cannot read binary pickles and files containing binary pickles should be opened in binary mode. Customization For this release of cPickle, a small amount of customization is possible for the Pickler and Unpickler. Specifically, the persistent_id attribute of the Pickler and the persistent_load attribute of the Unpickler may be set to user-defined functions by setting attributes. For instance:: def peristent_id(object): ... return appropriate persistent id string ... p = cPickle.Pickler(f) p.persistent_id = persistent_id def persistent_load(pers_id): ... return appropriate object, given a persistent id ... u = cPickle.Unpickler(f) u.persistent_load = persistent_load Note that this mechanism works with the current pickle module too. The cPickle module does not support customization through inheritance as pickle.py does. Pickling Extension Types When the pickler encounters an object it doesn't know how to pickle, it checks to see if the object has a __reduce__ method. This should return a tuple consisting of an callable object, a tuple of arguments, and an optional object state value. If a state value is supplied, it will be passed to the newly created object's __setstate__ method. If the object has no __setstate__ method, it will be added to the object's __dict__ (note that the state value must be a dictionary in this case). The contents of this tuple will be saved, and, on unpickling, the callable object will be called with the arguments to create the instance. The callable object must either be: - a Class, - registered in the set of safe constructors (see below), - or have an attribute, __safe_for_unpickling__, with a true value. Note that the __reduce__ method may also return a string value. In this case, the value of the global variable with the name given by the string value is used. The module copy_reg.py provides an interface for registering pickling functions:: def pickle(ob_type, pickle_function, constructor = None): '''Register the function, 'pickle_function' to be called to pickle objects of type 'ob_type'. The pickle function must behave in the same manner as the __reduce__ method described above. If the argument 'constructor' is specified, then it will be registered as an object that is safe for unpickling objects. copy_reg.py also provides an interface for updating a registry of safe constructors to be used when unpickling:: def constructor(object): 'Register the object as safe for unpicking objects' The following example shows how one might add support for pickling complex numbers:: import copy_reg def pickle_complex(z): return (complex, (z.real, z.imag)) copy_reg.pickle(type(complex(0,0)), pickle_complex, complex) This release also includes the latest release of the cStringIO module. The cStringIO module is a C implementation of the Python StringIO module; it is used internally by cPickle. It may also be used outside of cPickle as a much faster StringIO implementation. A new version of pickle.py is also provided. This version adds support for writing and reading binary pickles. Status The current release of cPickle is "1.0b2", http://www.digicool.com/releases/cPickle/cPickle-1.0b2.tar.gz. This release requires Python version 1.4 or higher. This version introduces a special binary mode format for floats. Since this could not be implemented in the python version, it is disabled by default in cPickle. To enable the new float format, see the instructions in the Makefile. Installation The cPickle distribution now uses the "Universal Unix Makefile for Python extensions", 'Makefile.pre.in', which was introduced as part of Python1.4. A copy of this make file is included with this release. See the instructions in the make file, itself. Note that cPickle requires that both copy_reg and cStringIO be importable. Files Makefile.pre.in -- The Universal Unix Makefile for Python extensions Setup -- a configuration file used by the Universal Unix Makefile for Python extensions cPickle.stx -- This file in structured text format cPickle.html -- This file in HTML format cPickle.c -- The cPickle source cStringIO.c -- The cStringIO source cStringIO.h -- The cStringIO C-API definition pickle.py -- The Python implementation of pickle with cPickle Extensions copy_reg.py -- An auxilary module used to keep Pickle registration information used by cPickle Release Notes 0.1 -- Initial (Alpha) Release 0.2 -- Second release incorporating many fixes and improvements over initial release. This is the first Beta release. 0.2.1 -- Bug fix release and slight format enhancement Bugs fixed: - Objects placed in memo when pickling were not actually retained, causing weird behavior when additional objects were created with the same ids (i.e. addresses). - Objects saved via the '__reduce__' mechanism were not placed in memo when pickling. In addition, binary floating point format was added. This uses code from the new struct module. Unfortunately, this cannot be supported in the current Python version. Support of this format is disabled by default. To enable this feature, edit the make file 'CFLAGS' variable as described in the make file, 'Makefile'. 0.2.2 -- Bug fix release Bugs fixed: - Incomplete initialization of Pickler and Unpickler objects caused core dump if an error occured while creating either of the objects. - Empty tuples saved in non-binary mode when using pickle.py produced an extra MARK if there was already an empty tuple in the memo. - Too few POPs written for recursive tuples. - Lists and dictionaries were not being placed into the memo before their items were saved - Only placing objects with a reference count > 1 in the memo was not always safe. - PyMapping_HasKey() leaked memory 0.3 -- Bug fixes and minor new features New features: - In cStringIO, Guido added an unused softspace attribute for compatibility with file objects. - In cStringIO, the getvalue() method now accepts an optional argument. If the argument is true, then the string returned is the contents of the StringIO up to the current file position. Otherwise, the entire contents are returned. - In cPickle, made some minor optimizations in pickling. - In cPickle, added clear_memo method to Pickler objects. This is useful when reusing Picklers. Bug fixes - In cStringIO, getvalue() returned it's contents only up to the file position, rather than the entire contents. - In cPickle, added logic from pickle.py to avoid picking '__main__' as a class' module when pickling classes. - Fixed bug (pointed out by Mark Lake) in saving tuples that participate in circular references. This release includes a number of changes made for 1.5, and changes to make 'gcc -Wall -pedantic' happy. 0.3.1 -- Bug Fix - Fixed a reference counting bug in the code that unpickles global objects. (I incorrectly assumed that PyEval_GetGlobals incremented the reference count of the object it returned.) This bug caused really bizarre things to happen after unpickling a pickle with lots of global references. 1.0b1 -- Official release (almost) This is the release that I expect to be included in Python 1.5 final. Old new features Some important features were added in earlier releases, but are not mentioned above. - Flexible module import. Now cPickle calles __import__ so it works with ni and other specialized import mechanisms. - New unpickler methods and features to support persistent object systems: - The persistent_load attribute can be set to a list instead of a function. In this case, persistent ids encountered during unpickling are added to the list. - Unpickler 'noload' method is like 'load' except that it doesn't create any objects. This is useful in finding persistent ids in a pickle:: f=StringIO(some_pickle) u=Unpickler(f) ids=[] u.persistent_load=ids u.noload() # at this point, ids contains any persistent ids # found in the pickle. Note that this technique works even if instances are encountered for classes defined in modules that cannot be imported, since no attempt is made to actually instantiate the instances. New feature - In cPickle, cPickle checks to see if a class has a __module__ attribute and, if present, uses that attribute to pickle the class. - A new instance pickling/unpickling protocol is used. If a class defines no __getinitargs__ method, then __init__ method is not called when an instance is unpickled. - Support for restricted execution environments was finished in cPickle. Bug Fix - Changed the way __version__ is created to avoid seg fault when different C version strings are used. Cleanup - A number of cleanups done by Guido were incorporated. 1.0b2 -- I forgot a few things in 1.0b1 New features - Loading non-binary string pickles checks for insecure strings. This is needed because cPickle (still) uses a restricted eval to parse non-binary string pickles. This change is needed to prevent untrusted pickles like:: "S'hello world'*2000000\012p0\012." from hosing an application. - User-defined types can now support unpickling without executing a constructor. The second value returned from '__reduce__' can now be None, rather than an argument tuple. On unpickling, if the second value returned from '__reduce__' during pickling was None, then rather than calling the first value returned from '__reduce__', directly, the '__basicnew__' method of the first value returned from '__reduce__' is called without arguments. Cleanup - Incorporated Guido's changes to cStringIO.h and copy_reg.py - Removed pickle.py from cPickle distribution. To do - Support for pickling humongous arrays. Konrad Hinsen summed up the issue: "With pickle.py, NumPy derives special pickler/unpickler classes that know how to deal with arrays. With cPickle, I'd have to use the method described under "pickling extension types". Unless I have missed something essential, that means I have to find a representation of the extension type in terms of built-in Python types. For large arrays, this will certainly eat up all speed advantage that cPickle can offer, and in addition it creates memory problems. Is there any specific reason for not simply allowing an extension type to pickle und unpickle itself with special methods?" cPickle and it's associated version of pickle.py use a new "reduce" protocol to handle new types. Unfortunately, the intermediate objects created in this protocol are imprectical when working with millions of numbers. Konrad and I have discussed a number of options, but I'm not happy enough with any of them to have implemented them. .. [1] An earlier version of the pickle module provided for saving extension type instances that had __class__ attributes. Using cPickle, extension types can only be be pickled using the mechanism described in the section "Pickling Extension Types" above. Zope-2.0.1-ZEO-nonbin/lib/Components/cPickle/cStringIO.c100644 1007 1403 41264 6731457323 22617 0ustar petrillipetrilli/* * $Id: cStringIO.c,v 1.29 1999/06/15 14:10:27 jim Exp $ * * Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are * met: * * o Redistributions of source code must retain the above copyright * notice, this list of conditions, and the disclaimer that follows. * * o 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. * * o All advertising materials mentioning features or use of this * software must display the following acknowledgement: * * This product includes software developed by Digital Creations * and its contributors. * * o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL * CREATIONS 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 you have questions regarding this software, contact: # # Digital Creations, L.C. # 910 Princess Ann Street # Fredericksburge, Virginia 22401 # # info@digicool.com # # (540) 371-6909 */ static char cStringIO_module_documentation[] = "A simple fast partial StringIO replacement.\n" "\n" "This module provides a simple useful replacement for\n" "the StringIO module that is written in C. It does not provide the\n" "full generality if StringIO, but it provides anough for most\n" "applications and is especially useful in conjuction with the\n" "pickle module.\n" "\n" "Usage:\n" "\n" " from cStringIO import StringIO\n" "\n" " an_output_stream=StringIO()\n" " an_output_stream.write(some_stuff)\n" " ...\n" " value=an_output_stream.getvalue() # str(an_output_stream) works too!\n" "\n" " an_input_stream=StringIO(a_string)\n" " spam=an_input_stream.readline()\n" " spam=an_input_stream.read(5)\n" " an_input_stream.seek(0) # OK, start over\n" " spam=an_input_stream.read() # and read it all\n" " \n" "If someone else wants to provide a more complete implementation,\n" "go for it. :-) \n" "\n" "$Id: cStringIO.c,v 1.29 1999/06/15 14:10:27 jim Exp $\n" ; #include "Python.h" #include "import.h" #include "cStringIO.h" #define UNLESS(E) if(!(E)) /* Declarations for objects of type StringO */ typedef struct { PyObject_HEAD char *buf; int pos, string_size, buf_size, softspace; } Oobject; /* Declarations for objects of type StringI */ typedef struct { PyObject_HEAD char *buf; int pos, string_size; PyObject *pbuf; } Iobject; static char O_reset__doc__[] = "reset() -- Reset the file position to the beginning" ; static PyObject * O_reset(Oobject *self, PyObject *args) { self->pos = 0; Py_INCREF(Py_None); return Py_None; } static char O_tell__doc__[] = "tell() -- get the current position."; static PyObject * O_tell(Oobject *self, PyObject *args) { return PyInt_FromLong(self->pos); } static char O_seek__doc__[] = "seek(position) -- set the current position\n" "seek(position, mode) -- mode 0: absolute; 1: relative; 2: relative to EOF"; static PyObject * O_seek(Oobject *self, PyObject *args) { int position, mode = 0; UNLESS(PyArg_ParseTuple(args, "i|i", &position, &mode)) { return NULL; } if (mode == 2) { position += self->string_size; } else if (mode == 1) { position += self->pos; } if (position > self->buf_size) { self->buf_size*=2; if(self->buf_size <= position) self->buf_size=position+1; UNLESS(self->buf=(char*)realloc(self->buf,self->buf_size*sizeof(char))) { self->buf_size=self->pos=0; return PyErr_NoMemory(); } } else if(position < 0) position=0; self->pos=position; while(--position >= self->string_size) self->buf[position]=0; Py_INCREF(Py_None); return Py_None; } static char O_read__doc__[] = "read([s]) -- Read s characters, or the rest of the string" ; static int O_cread(PyObject *self, char **output, int n) { int l; l = ((Oobject*)self)->string_size - ((Oobject*)self)->pos; if (n < 0 || n > l) { n = l; if (n < 0) n=0; } *output=((Oobject*)self)->buf + ((Oobject*)self)->pos; ((Oobject*)self)->pos += n; return n; } static PyObject * O_read(Oobject *self, PyObject *args) { int n = -1; char *output; UNLESS(PyArg_ParseTuple(args, "|i", &n)) return NULL; n=O_cread((PyObject*)self,&output,n); return PyString_FromStringAndSize(output, n); } static char O_readline__doc__[] = "readline() -- Read one line" ; static int O_creadline(PyObject *self, char **output) { char *n, *s; int l; for (n = ((Oobject*)self)->buf + ((Oobject*)self)->pos, s = ((Oobject*)self)->buf + ((Oobject*)self)->string_size; n < s && *n != '\n'; n++); if (n < s) n++; *output=((Oobject*)self)->buf + ((Oobject*)self)->pos; l = n - ((Oobject*)self)->buf - ((Oobject*)self)->pos; ((Oobject*)self)->pos += l; return l; } static PyObject * O_readline(Oobject *self, PyObject *args) { int n; char *output; n=O_creadline((PyObject*)self,&output); return PyString_FromStringAndSize(output, n); } static char O_write__doc__[] = "write(s) -- Write a string to the file" "\n\nNote (hack:) writing None resets the buffer" ; static int O_cwrite(PyObject *self, char *c, int l) { int newl; newl=((Oobject*)self)->pos+l; if(newl >= ((Oobject*)self)->buf_size) { ((Oobject*)self)->buf_size*=2; if(((Oobject*)self)->buf_size <= newl) ((Oobject*)self)->buf_size=newl+1; UNLESS(((Oobject*)self)->buf= (char*)realloc(((Oobject*)self)->buf, (((Oobject*)self)->buf_size) *sizeof(char))) { PyErr_SetString(PyExc_MemoryError,"out of memory"); ((Oobject*)self)->buf_size=((Oobject*)self)->pos=0; return -1; } } memcpy(((Oobject*)((Oobject*)self))->buf+((Oobject*)self)->pos,c,l); ((Oobject*)self)->pos += l; if (((Oobject*)self)->string_size < ((Oobject*)self)->pos) { ((Oobject*)self)->string_size = ((Oobject*)self)->pos; } return l; } static PyObject * O_write(Oobject *self, PyObject *args) { PyObject *s; char *c; int l; UNLESS(PyArg_ParseTuple(args, "O", &s)) return NULL; UNLESS(-1 != (l=PyString_Size(s))) return NULL; UNLESS(c=PyString_AsString(s)) return NULL; UNLESS(-1 != O_cwrite((PyObject*)self,c,l)) return NULL; Py_INCREF(Py_None); return Py_None; } static char O_getval__doc__[] = "getvalue([use_pos]) -- Get the string value." "\n" "If use_pos is specified and is a true value, then the string returned\n" "will include only the text up to the current file position.\n" ; static PyObject * O_getval(Oobject *self, PyObject *args) { PyObject *use_pos=Py_None; int s; use_pos=Py_None; UNLESS(PyArg_ParseTuple(args,"|O",&use_pos)) return NULL; if(PyObject_IsTrue(use_pos)) { s=self->pos; if (s > self->string_size) s=self->string_size; } else s=self->string_size; return PyString_FromStringAndSize(self->buf, s); } static PyObject * O_cgetval(PyObject *self) { return PyString_FromStringAndSize(((Oobject*)self)->buf, ((Oobject*)self)->pos); } static char O_truncate__doc__[] = "truncate(): truncate the file at the current position."; static PyObject * O_truncate(Oobject *self, PyObject *args) { if (self->string_size > self->pos) self->string_size = self->pos; Py_INCREF(Py_None); return Py_None; } static char O_isatty__doc__[] = "isatty(): always returns 0"; static PyObject * O_isatty(Oobject *self, PyObject *args) { return PyInt_FromLong(0); } static char O_close__doc__[] = "close(): explicitly release resources held."; static PyObject * O_close(Oobject *self, PyObject *args) { if (self->buf != NULL) free(self->buf); self->buf = NULL; self->pos = self->string_size = self->buf_size = 0; Py_INCREF(Py_None); return Py_None; } static char O_flush__doc__[] = "flush(): does nothing."; static PyObject * O_flush(Oobject *self, PyObject *args) { Py_INCREF(Py_None); return Py_None; } static char O_writelines__doc__[] = "writelines(sequence_of_strings): write each string"; static PyObject * O_writelines(Oobject *self, PyObject *args) { PyObject *string_module = 0; static PyObject *string_joinfields = 0; UNLESS(PyArg_ParseTuple(args, "O", &args)) { return NULL; } if (!string_joinfields) { UNLESS(string_module = PyImport_ImportModule("string")) { return NULL; } UNLESS(string_joinfields= PyObject_GetAttrString(string_module, "joinfields")) { return NULL; } Py_DECREF(string_module); } if (PyObject_Length(args) == -1) { return NULL; } { PyObject *x = PyObject_CallFunction(string_joinfields, "Os", args, ""); if (x == NULL) return NULL; args = Py_BuildValue("(O)", x); Py_DECREF(x); if (args == NULL) return NULL; x = O_write(self, args); Py_DECREF(args); return x; } } static struct PyMethodDef O_methods[] = { {"write", (PyCFunction)O_write, METH_VARARGS, O_write__doc__}, {"read", (PyCFunction)O_read, METH_VARARGS, O_read__doc__}, {"readline", (PyCFunction)O_readline, METH_VARARGS, O_readline__doc__}, {"reset", (PyCFunction)O_reset, METH_VARARGS, O_reset__doc__}, {"seek", (PyCFunction)O_seek, METH_VARARGS, O_seek__doc__}, {"tell", (PyCFunction)O_tell, METH_VARARGS, O_tell__doc__}, {"getvalue", (PyCFunction)O_getval, METH_VARARGS, O_getval__doc__}, {"truncate", (PyCFunction)O_truncate, METH_VARARGS, O_truncate__doc__}, {"isatty", (PyCFunction)O_isatty, METH_VARARGS, O_isatty__doc__}, {"close", (PyCFunction)O_close, METH_VARARGS, O_close__doc__}, {"flush", (PyCFunction)O_flush, METH_VARARGS, O_flush__doc__}, {"writelines", (PyCFunction)O_writelines, METH_VARARGS, O_writelines__doc__}, {NULL, NULL} /* sentinel */ }; static void O_dealloc(Oobject *self) { if (self->buf != NULL) free(self->buf); PyMem_DEL(self); } static PyObject * O_getattr(Oobject *self, char *name) { if (strcmp(name, "softspace") == 0) { return PyInt_FromLong(self->softspace); } return Py_FindMethod(O_methods, (PyObject *)self, name); } static int O_setattr(Oobject *self, char *name, PyObject *value) { long x; if (strcmp(name, "softspace") != 0) { PyErr_SetString(PyExc_AttributeError, name); return -1; } x = PyInt_AsLong(value); if (x == -1 && PyErr_Occurred()) return -1; self->softspace = x; return 0; } static char Otype__doc__[] = "Simple type for output to strings." ; static PyTypeObject Otype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "StringO", /*tp_name*/ sizeof(Oobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)O_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)O_getattr, /*tp_getattr*/ (setattrfunc)O_setattr, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, Otype__doc__ /* Documentation string */ }; static PyObject * newOobject(int size) { Oobject *self; self = PyObject_NEW(Oobject, &Otype); if (self == NULL) return NULL; self->pos=0; self->string_size = 0; self->softspace = 0; UNLESS(self->buf=malloc(size*sizeof(char))) { PyErr_SetString(PyExc_MemoryError,"out of memory"); self->buf_size = 0; return NULL; } self->buf_size=size; return (PyObject*)self; } /* End of code for StringO objects */ /* -------------------------------------------------------- */ static PyObject * I_close(Iobject *self, PyObject *args) { Py_XDECREF(self->pbuf); self->pbuf = NULL; self->pos = self->string_size = 0; Py_INCREF(Py_None); return Py_None; } static PyObject * I_seek(Oobject *self, PyObject *args) { int position, mode = 0; UNLESS(PyArg_ParseTuple(args, "i|i", &position, &mode)) { return NULL; } if (mode == 2) { position += self->string_size; } else if (mode == 1) { position += self->pos; } if(position < 0) position=0; self->pos=position; Py_INCREF(Py_None); return Py_None; } static struct PyMethodDef I_methods[] = { {"read", (PyCFunction)O_read, METH_VARARGS, O_read__doc__}, {"readline", (PyCFunction)O_readline, METH_VARARGS, O_readline__doc__}, {"reset", (PyCFunction)O_reset, METH_VARARGS, O_reset__doc__}, {"seek", (PyCFunction)I_seek, METH_VARARGS, O_seek__doc__}, {"tell", (PyCFunction)O_tell, METH_VARARGS, O_tell__doc__}, {"getvalue", (PyCFunction)O_getval, METH_VARARGS, O_getval__doc__}, {"truncate", (PyCFunction)O_truncate, METH_VARARGS, O_truncate__doc__}, {"isatty", (PyCFunction)O_isatty, METH_VARARGS, O_isatty__doc__}, {"close", (PyCFunction)I_close, METH_VARARGS, O_close__doc__}, {"flush", (PyCFunction)O_flush, METH_VARARGS, O_flush__doc__}, {NULL, NULL} }; static void I_dealloc(Iobject *self) { Py_XDECREF(self->pbuf); PyMem_DEL(self); } static PyObject * I_getattr(Iobject *self, char *name) { return Py_FindMethod(I_methods, (PyObject *)self, name); } static char Itype__doc__[] = "Simple type for treating strings as input file streams" ; static PyTypeObject Itype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "StringI", /*tp_name*/ sizeof(Iobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)I_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)I_getattr, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, Itype__doc__ /* Documentation string */ }; static PyObject * newIobject(PyObject *s) { Iobject *self; char *buf; int size; UNLESS(buf=PyString_AsString(s)) return NULL; UNLESS(-1 != (size=PyString_Size(s))) return NULL; UNLESS(self = PyObject_NEW(Iobject, &Itype)) return NULL; Py_INCREF(s); self->buf=buf; self->string_size=size; self->pbuf=s; self->pos=0; return (PyObject*)self; } /* End of code for StringI objects */ /* -------------------------------------------------------- */ static char IO_StringIO__doc__[] = "StringIO([s]) -- Return a StringIO-like stream for reading or writing" ; static PyObject * IO_StringIO(PyObject *self, PyObject *args) { PyObject *s=0; UNLESS(PyArg_ParseTuple(args, "|O", &s)) return NULL; if(s) return newIobject(s); return newOobject(128); } /* List of methods defined in the module */ static struct PyMethodDef IO_methods[] = { {"StringIO", (PyCFunction)IO_StringIO, 1, IO_StringIO__doc__}, {NULL, NULL} /* sentinel */ }; /* Initialization function for the module (*must* be called initcStringIO) */ static struct PycStringIO_CAPI CAPI = { O_cread, O_creadline, O_cwrite, O_cgetval, newOobject, newIobject, &Itype, &Otype, }; #ifndef DL_EXPORT /* declarations for DLL import/export */ #define DL_EXPORT(RTYPE) RTYPE #endif DL_EXPORT(void) initcStringIO() { PyObject *m, *d, *v; /* Create the module and add the functions */ m = Py_InitModule4("cStringIO", IO_methods, cStringIO_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); /* Add some symbolic constants to the module */ d = PyModule_GetDict(m); /* Export C API */ Itype.ob_type=&PyType_Type; Otype.ob_type=&PyType_Type; PyDict_SetItemString(d,"cStringIO_CAPI", v = PyCObject_FromVoidPtr(&CAPI,NULL)); Py_XDECREF(v); /* Export Types */ PyDict_SetItemString(d,"InputType", (PyObject*)&Itype); PyDict_SetItemString(d,"OutputType", (PyObject*)&Otype); /* Maybe make certain warnings go away */ if(0) PycString_IMPORT; } Zope-2.0.1-ZEO-nonbin/lib/Components/cPickle/cStringIO.h100644 1007 1403 10032 6442531064 22603 0ustar petrillipetrilli#ifndef CSTRINGIO_INCLUDED #define CSTRINGIO_INCLUDED /* $Id: cStringIO.h,v 1.4 1997/12/07 14:27:00 jim Exp $ cStringIO C API Copyright Copyright 1996 Digital Creations, L.C., 910 Princess Anne Street, Suite 300, Fredericksburg, Virginia 22401 U.S.A. All rights reserved. Copyright in this software is owned by DCLC, unless otherwise indicated. Permission to use, copy and distribute this software is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear. Note that any product, process or technology described in this software may be the subject of other Intellectual Property rights reserved by Digital Creations, L.C. and are not licensed hereunder. Trademarks Digital Creations & DCLC, are trademarks of Digital Creations, L.C.. All other trademarks are owned by their respective companies. No Warranty The software is provided "as is" without warranty of any kind, either express or implied, including, but not limited to, the implied warranties of merchantability, fitness for a particular purpose, or non-infringement. This software could include technical inaccuracies or typographical errors. Changes are periodically made to the software; these changes will be incorporated in new editions of the software. DCLC may make improvements and/or changes in this software at any time without notice. Limitation Of Liability In no event will DCLC be liable for direct, indirect, special, incidental, economic, cover, or consequential damages arising out of the use of or inability to use this software even if advised of the possibility of such damages. Some states do not allow the exclusion or limitation of implied warranties or limitation of liability for incidental or consequential damages, so the above limitation or exclusion may not apply to you. If you have questions regarding this software, contact: info@digicool.com Digital Creations L.C. (540) 371-6909 This header provides access to cStringIO objects from C. Functions are provided for calling cStringIO objects and macros are provided for testing whether you have cStringIO objects. Before calling any of the functions or macros, you must initialize the routines with: PycStringIO_IMPORT This would typically be done in your init function. */ /* Basic fuctions to manipulate cStringIO objects from C */ static struct PycStringIO_CAPI { /* Read a string. If the last argument is -1, the remainder will be read. */ int(*cread) Py_FPROTO((PyObject *, char **, int)); /* Read a line */ int(*creadline) Py_FPROTO((PyObject *, char **)); /* Write a string */ int(*cwrite) Py_FPROTO((PyObject *, char *, int)); /* Get the cStringIO object as a Python string */ PyObject *(*cgetvalue) Py_FPROTO((PyObject *)); /* Create a new output object */ PyObject *(*NewOutput) Py_FPROTO((int)); /* Create an input object from a Python string */ PyObject *(*NewInput) Py_FPROTO((PyObject *)); /* The Python types for cStringIO input and output objects. Note that you can do input on an output object. */ PyTypeObject *InputType, *OutputType; } * PycStringIO = NULL; /* These can be used to test if you have one */ #define PycStringIO_InputCheck(O) \ ((O)->ob_type==PycStringIO->InputType) #define PycStringIO_OutputCheck(O) \ ((O)->ob_type==PycStringIO->OutputType) static void * xxxPyCObject_Import(module_name, name) char *module_name; char *name; { PyObject *m, *c; void *r=NULL; if((m=PyImport_ImportModule(module_name))) { if((c=PyObject_GetAttrString(m,name))) { r=PyCObject_AsVoidPtr(c); Py_DECREF(c); } Py_DECREF(m); } return r; } #define PycString_IMPORT \ PycStringIO=xxxPyCObject_Import("cStringIO", "cStringIO_CAPI") #endif /* CSTRINGIO_INCLUDED */ Zope-2.0.1-ZEO-nonbin/lib/Components/cPickle/copy_reg.py100644 1007 1403 765 6442531520 22723 0ustar petrillipetrilli# Helper to provide extensibility for pickle/cPickle. dispatch_table = {} safe_constructors = {} def pickle(ob_type, pickle_function, constructor_ob = None): dispatch_table[ob_type] = pickle_function if constructor_ob is not None: constructor(constructor_ob) def constructor(object): safe_constructors[object] = 1 # Example: provide pickling support for complex numbers. def pickle_complex(c): return complex, (c.real, c.imag) pickle(type(1j), pickle_complex, complex) Zope-2.0.1-ZEO-nonbin/lib/Components/cPickle/release.fl100644 1007 1403 135 6442531163 22477 0ustar petrillipetrilliSetup Makefile.pre.in cPickle.stx cPickle.html cPickle.c cStringIO.c cStringIO.h copy_reg.py Zope-2.0.1-ZEO-nonbin/lib/Components/cPickle/release.sh100644 1007 1403 271 6441374352 22515 0ustar petrillipetrilli#!/bin/sh R=$1 M=cPickle StructuredText < $M.stx > $M.html rm -rf "$M-$R" mkdir "$M-$R" tar -c -R release.fl -f - | (cd "$M-$R"; tar xvf -) tar cvf - "$M-$R" | gzip > "$M-$R.tar.gz" Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/ 40755 1007 1403 0 6772126757 20065 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/Components/zlib/adler32.c100644 1007 1403 2376 6363455064 21562 0ustar petrillipetrilli/* adler32.c -- compute the Adler-32 checksum of a data stream * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* $Id: adler32.c,v 1.1 1997/07/17 17:45:24 jim Exp $ */ #include "zlib.h" #define BASE 65521L /* largest prime smaller than 65536 */ #define NMAX 5552 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ #define DO1(buf,i) {s1 += buf[i]; s2 += s1;} #define DO2(buf,i) DO1(buf,i); DO1(buf,i+1); #define DO4(buf,i) DO2(buf,i); DO2(buf,i+2); #define DO8(buf,i) DO4(buf,i); DO4(buf,i+4); #define DO16(buf) DO8(buf,0); DO8(buf,8); /* ========================================================================= */ uLong adler32(adler, buf, len) uLong adler; const Bytef *buf; uInt len; { unsigned long s1 = adler & 0xffff; unsigned long s2 = (adler >> 16) & 0xffff; int k; if (buf == Z_NULL) return 1L; while (len > 0) { k = len < NMAX ? len : NMAX; len -= k; while (k >= 16) { DO16(buf); buf += 16; k -= 16; } if (k != 0) do { s1 += *buf++; s2 += s1; } while (--k); s1 %= BASE; s2 %= BASE; } return (s2 << 16) | s1; } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/Setup100644 1007 1403 241 6363457633 21156 0ustar petrillipetrilli*shared* zlib zlib.c -I. adler32.c compress.c crc32.c gzio.c uncompr.c deflate.c trees.c zutil.c inflate.c infblock.c inftrees.c infcodes.c infutil.c inffast.c Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/compress.c100644 1007 1403 3460 6363455065 22155 0ustar petrillipetrilli/* compress.c -- compress a memory buffer * Copyright (C) 1995-1996 Jean-loup Gailly. * For conditions of distribution and use, see copyright notice in zlib.h */ /* $Id: compress.c,v 1.1 1997/07/17 17:45:25 jim Exp $ */ #include "zlib.h" /* =========================================================================== Compresses the source buffer into the destination buffer. sourceLen is the byte length of the source buffer. Upon entry, destLen is the total size of the destination buffer, which must be at least 0.1% larger than sourceLen plus 8 bytes. Upon exit, destLen is the actual size of the compressed buffer. This function can be used to compress a whole file at once if the input file is mmap'ed. compress returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_BUF_ERROR if there was not enough room in the output buffer. */ int compress (dest, destLen, source, sourceLen) Bytef *dest; uLongf *destLen; const Bytef *source; uLong sourceLen; { z_stream stream; int err; stream.next_in = (Bytef*)source; stream.avail_in = (uInt)sourceLen; #ifdef MAXSEG_64K /* Check for source > 64K on 16-bit machine: */ if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR; #endif stream.next_out = dest; stream.avail_out = (uInt)*destLen; if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR; stream.zalloc = (alloc_func)0; stream.zfree = (free_func)0; stream.opaque = (voidpf)0; err = deflateInit(&stream, Z_DEFAULT_COMPRESSION); if (err != Z_OK) return err; err = deflate(&stream, Z_FINISH); if (err != Z_STREAM_END) { deflateEnd(&stream); return err == Z_OK ? Z_BUF_ERROR : err; } *destLen = stream.total_out; err = deflateEnd(&stream); return err; } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/config.c100644 1007 1403 7202 6363455065 21565 0ustar petrillipetrilli/* Generated automatically from /usr/local/python-1.4/lib/python1.4/config/config.c.in by makesetup. */ /* -*- C -*- *********************************************** Copyright 1991-1995 by Stichting Mathematisch Centrum, Amsterdam, The Netherlands. All Rights Reserved Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the names of Stichting Mathematisch Centrum or CWI or Corporation for National Research Initiatives or CNRI not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. While CWI is the initial source for this software, a modified version is made available by the Corporation for National Research Initiatives (CNRI) at the Internet address ftp://ftp.python.org. STICHTING MATHEMATISCH CENTRUM AND CNRI DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM OR CNRI BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ******************************************************************/ /* Module configuration */ /* !!! !!! !!! This file is edited by the makesetup script !!! !!! !!! */ /* This file contains the table of built-in modules. See init_builtin() in import.c. */ #include "Python.h" extern void initposix(); extern void initsignal(); extern void initsocket(); extern void initthread(); extern void initmath(); extern void initregex(); extern void initstrop(); extern void inittime(); extern void initarray(); extern void initcmath(); extern void initstruct(); extern void initoperator(); extern void initfcntl(); extern void initpwd(); extern void initgrp(); extern void initcrypt(); extern void initselect(); extern void initerrno(); extern void inittermios(); extern void init_xdr(); extern void initaudioop(); extern void initimageop(); extern void initrgbimg(); extern void initmd5(); extern void inittiming(); extern void initrotor(); extern void initsyslog(); extern void initnew(); extern void initbinascii(); extern void initparser(); /* -- ADDMODULE MARKER 1 -- */ extern void PyMarshal_Init(); extern void initimp(); struct _inittab inittab[] = { {"posix", initposix}, {"signal", initsignal}, {"socket", initsocket}, {"thread", initthread}, {"math", initmath}, {"regex", initregex}, {"strop", initstrop}, {"time", inittime}, {"array", initarray}, {"cmath", initcmath}, {"struct", initstruct}, {"operator", initoperator}, {"fcntl", initfcntl}, {"pwd", initpwd}, {"grp", initgrp}, {"crypt", initcrypt}, {"select", initselect}, {"errno", initerrno}, {"termios", inittermios}, {"_xdr", init_xdr}, {"audioop", initaudioop}, {"imageop", initimageop}, {"rgbimg", initrgbimg}, {"md5", initmd5}, {"timing", inittiming}, {"rotor", initrotor}, {"syslog", initsyslog}, {"new", initnew}, {"binascii", initbinascii}, {"parser", initparser}, /* -- ADDMODULE MARKER 2 -- */ /* This module "lives in" with marshal.c */ {"marshal", PyMarshal_Init}, /* This lives it with import.c */ {"imp", initimp}, /* These entries are here for sys.builtin_module_names */ {"__main__", NULL}, {"__builtin__", NULL}, {"sys", NULL}, /* Sentinel */ {0, 0} }; Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/crc32.c100644 1007 1403 15474 6363455066 21267 0ustar petrillipetrilli/* crc32.c -- compute the CRC-32 of a data stream * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* $Id: crc32.c,v 1.1 1997/07/17 17:45:26 jim Exp $ */ #include "zlib.h" #define local static #ifdef DYNAMIC_CRC_TABLE local int crc_table_empty = 1; local uLongf crc_table[256]; local void make_crc_table OF((void)); /* Generate a table for a byte-wise 32-bit CRC calculation on the polynomial: x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+1. Polynomials over GF(2) are represented in binary, one bit per coefficient, with the lowest powers in the most significant bit. Then adding polynomials is just exclusive-or, and multiplying a polynomial by x is a right shift by one. If we call the above polynomial p, and represent a byte as the polynomial q, also with the lowest power in the most significant bit (so the byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p, where a mod b means the remainder after dividing a by b. This calculation is done using the shift-register method of multiplying and taking the remainder. The register is initialized to zero, and for each incoming bit, x^32 is added mod p to the register if the bit is a one (where x^32 mod p is p+x^32 = x^26+...+1), and the register is multiplied mod p by x (which is shifting right by one and adding x^32 mod p if the bit shifted out is a one). We start with the highest power (least significant bit) of q and repeat for all eight bits of q. The table is simply the CRC of all possible eight bit values. This is all the information needed to generate CRC's on data a byte at a time for all combinations of CRC register values and incoming bytes. */ local void make_crc_table() { uLong c; int n, k; uLong poly; /* polynomial exclusive-or pattern */ /* terms of polynomial defining this crc (except x^32): */ static Byte p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26}; /* make exclusive-or pattern from polynomial (0xedb88320L) */ poly = 0L; for (n = 0; n < sizeof(p)/sizeof(Byte); n++) poly |= 1L << (31 - p[n]); for (n = 0; n < 256; n++) { c = (uLong)n; for (k = 0; k < 8; k++) c = c & 1 ? poly ^ (c >> 1) : c >> 1; crc_table[n] = c; } crc_table_empty = 0; } #else /* ======================================================================== * Table of CRC-32's of all single-byte values (made by make_crc_table) */ local uLongf crc_table[256] = { 0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L, 0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L, 0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L, 0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL, 0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L, 0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L, 0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L, 0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL, 0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L, 0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL, 0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L, 0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L, 0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L, 0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL, 0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL, 0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L, 0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL, 0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L, 0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L, 0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L, 0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL, 0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L, 0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L, 0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL, 0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L, 0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L, 0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L, 0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L, 0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L, 0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL, 0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL, 0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L, 0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L, 0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL, 0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL, 0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L, 0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL, 0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L, 0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL, 0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L, 0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL, 0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L, 0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L, 0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL, 0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L, 0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L, 0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L, 0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L, 0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L, 0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L, 0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL, 0x2d02ef8dL }; #endif /* ========================================================================= * This function can be used by asm versions of crc32() */ uLongf *get_crc_table() { #ifdef DYNAMIC_CRC_TABLE if (crc_table_empty) make_crc_table(); #endif return (uLongf *)crc_table; } /* ========================================================================= */ #define DO1(buf) crc = crc_table[((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8); #define DO2(buf) DO1(buf); DO1(buf); #define DO4(buf) DO2(buf); DO2(buf); #define DO8(buf) DO4(buf); DO4(buf); /* ========================================================================= */ uLong crc32(crc, buf, len) uLong crc; const Bytef *buf; uInt len; { if (buf == Z_NULL) return 0L; #ifdef DYNAMIC_CRC_TABLE if (crc_table_empty) make_crc_table(); #endif crc = crc ^ 0xffffffffL; while (len >= 8) { DO8(buf); len -= 8; } if (len) do { DO1(buf); } while (--len); return crc ^ 0xffffffffL; } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/deflate.c100644 1007 1403 125724 6363455066 21777 0ustar petrillipetrilli/* deflate.c -- compress data using the deflation algorithm * Copyright (C) 1995-1996 Jean-loup Gailly. * For conditions of distribution and use, see copyright notice in zlib.h */ /* * ALGORITHM * * The "deflation" process depends on being able to identify portions * of the input text which are identical to earlier input (within a * sliding window trailing behind the input currently being processed). * * The most straightforward technique turns out to be the fastest for * most input files: try all possible matches and select the longest. * The key feature of this algorithm is that insertions into the string * dictionary are very simple and thus fast, and deletions are avoided * completely. Insertions are performed at each input character, whereas * string matches are performed only when the previous match ends. So it * is preferable to spend more time in matches to allow very fast string * insertions and avoid deletions. The matching algorithm for small * strings is inspired from that of Rabin & Karp. A brute force approach * is used to find longer strings when a small match has been found. * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze * (by Leonid Broukhis). * A previous version of this file used a more sophisticated algorithm * (by Fiala and Greene) which is guaranteed to run in linear amortized * time, but has a larger average cost, uses more memory and is patented. * However the F&G algorithm may be faster for some highly redundant * files if the parameter max_chain_length (described below) is too large. * * ACKNOWLEDGEMENTS * * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and * I found it in 'freeze' written by Leonid Broukhis. * Thanks to many people for bug reports and testing. * * REFERENCES * * Deutsch, L.P.,"'Deflate' Compressed Data Format Specification". * Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc * * A description of the Rabin and Karp algorithm is given in the book * "Algorithms" by R. Sedgewick, Addison-Wesley, p252. * * Fiala,E.R., and Greene,D.H. * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595 * */ /* $Id: deflate.c,v 1.1 1997/07/17 17:45:26 jim Exp $ */ #include "deflate.h" char deflate_copyright[] = " deflate 1.0.4 Copyright 1995-1996 Jean-loup Gailly "; /* If you use the zlib library in a product, an acknowledgment is welcome in the documentation of your product. If for some reason you cannot include such an acknowledgment, I would appreciate that you keep this copyright string in the executable of your product. */ /* =========================================================================== * Function prototypes. */ typedef enum { need_more, /* block not completed, need more input or more output */ block_done, /* block flush performed */ finish_started, /* finish started, need only more output at next deflate */ finish_done /* finish done, accept no more input or output */ } block_state; typedef block_state (*compress_func) OF((deflate_state *s, int flush)); /* Compression function. Returns the block state after the call. */ local void fill_window OF((deflate_state *s)); local block_state deflate_stored OF((deflate_state *s, int flush)); local block_state deflate_fast OF((deflate_state *s, int flush)); local block_state deflate_slow OF((deflate_state *s, int flush)); local void lm_init OF((deflate_state *s)); local uInt longest_match OF((deflate_state *s, IPos cur_match)); local void putShortMSB OF((deflate_state *s, uInt b)); local void flush_pending OF((z_streamp strm)); local int read_buf OF((z_streamp strm, charf *buf, unsigned size)); #ifdef ASMV void match_init OF((void)); /* asm code initialization */ #endif #ifdef DEBUG local void check_match OF((deflate_state *s, IPos start, IPos match, int length)); #endif /* =========================================================================== * Local data */ #define NIL 0 /* Tail of hash chains */ #ifndef TOO_FAR # define TOO_FAR 4096 #endif /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */ #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) /* Minimum amount of lookahead, except at the end of the input file. * See deflate.c for comments about the MIN_MATCH+1. */ /* Values for max_lazy_match, good_match and max_chain_length, depending on * the desired pack level (0..9). The values given below have been tuned to * exclude worst case performance for pathological files. Better values may be * found for specific files. */ typedef struct config_s { ush good_length; /* reduce lazy search above this match length */ ush max_lazy; /* do not perform lazy search above this match length */ ush nice_length; /* quit search above this match length */ ush max_chain; compress_func func; } config; local config configuration_table[10] = { /* good lazy nice chain */ /* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */ /* 1 */ {4, 4, 8, 4, deflate_fast}, /* maximum speed, no lazy matches */ /* 2 */ {4, 5, 16, 8, deflate_fast}, /* 3 */ {4, 6, 32, 32, deflate_fast}, /* 4 */ {4, 4, 16, 16, deflate_slow}, /* lazy matches */ /* 5 */ {8, 16, 32, 32, deflate_slow}, /* 6 */ {8, 16, 128, 128, deflate_slow}, /* 7 */ {8, 32, 128, 256, deflate_slow}, /* 8 */ {32, 128, 258, 1024, deflate_slow}, /* 9 */ {32, 258, 258, 4096, deflate_slow}}; /* maximum compression */ /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 * For deflate_fast() (levels <= 3) good is ignored and lazy has a different * meaning. */ #define EQUAL 0 /* result of memcmp for equal strings */ struct static_tree_desc_s {int dummy;}; /* for buggy compilers */ /* =========================================================================== * Update a hash value with the given input byte * IN assertion: all calls to to UPDATE_HASH are made with consecutive * input characters, so that a running hash key can be computed from the * previous key instead of complete recalculation each time. */ #define UPDATE_HASH(s,h,c) (h = (((h)<hash_shift) ^ (c)) & s->hash_mask) /* =========================================================================== * Insert string str in the dictionary and set match_head to the previous head * of the hash chain (the most recent string with same hash key). Return * the previous length of the hash chain. * IN assertion: all calls to to INSERT_STRING are made with consecutive * input characters and the first MIN_MATCH bytes of str are valid * (except for the last MIN_MATCH-1 bytes of the input file). */ #define INSERT_STRING(s, str, match_head) \ (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \ s->head[s->ins_h] = (Pos)(str)) /* =========================================================================== * Initialize the hash table (avoiding 64K overflow for 16 bit systems). * prev[] will be initialized on the fly. */ #define CLEAR_HASH(s) \ s->head[s->hash_size-1] = NIL; \ zmemzero((charf *)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head)); /* ========================================================================= */ int deflateInit_(strm, level, version, stream_size) z_streamp strm; int level; const char *version; int stream_size; { return deflateInit2_(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY, version, stream_size); /* To do: ignore strm->next_in if we use it as window */ } /* ========================================================================= */ int deflateInit2_(strm, level, method, windowBits, memLevel, strategy, version, stream_size) z_streamp strm; int level; int method; int windowBits; int memLevel; int strategy; const char *version; int stream_size; { deflate_state *s; int noheader = 0; ushf *overlay; /* We overlay pending_buf and d_buf+l_buf. This works since the average * output size for (length,distance) codes is <= 24 bits. */ if (version == Z_NULL || version[0] != ZLIB_VERSION[0] || stream_size != sizeof(z_stream)) { return Z_VERSION_ERROR; } if (strm == Z_NULL) return Z_STREAM_ERROR; strm->msg = Z_NULL; if (strm->zalloc == Z_NULL) { strm->zalloc = zcalloc; strm->opaque = (voidpf)0; } if (strm->zfree == Z_NULL) strm->zfree = zcfree; if (level == Z_DEFAULT_COMPRESSION) level = 6; if (windowBits < 0) { /* undocumented feature: suppress zlib header */ noheader = 1; windowBits = -windowBits; } if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED || windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || strategy < 0 || strategy > Z_HUFFMAN_ONLY) { return Z_STREAM_ERROR; } s = (deflate_state *) ZALLOC(strm, 1, sizeof(deflate_state)); if (s == Z_NULL) return Z_MEM_ERROR; strm->state = (struct internal_state FAR *)s; s->strm = strm; s->noheader = noheader; s->w_bits = windowBits; s->w_size = 1 << s->w_bits; s->w_mask = s->w_size - 1; s->hash_bits = memLevel + 7; s->hash_size = 1 << s->hash_bits; s->hash_mask = s->hash_size - 1; s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte)); s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos)); s->head = (Posf *) ZALLOC(strm, s->hash_size, sizeof(Pos)); s->lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2); s->pending_buf = (uchf *) overlay; if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL || s->pending_buf == Z_NULL) { strm->msg = (char*)ERR_MSG(Z_MEM_ERROR); deflateEnd (strm); return Z_MEM_ERROR; } s->d_buf = overlay + s->lit_bufsize/sizeof(ush); s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; s->level = level; s->strategy = strategy; s->method = (Byte)method; return deflateReset(strm); } /* ========================================================================= */ int deflateSetDictionary (strm, dictionary, dictLength) z_streamp strm; const Bytef *dictionary; uInt dictLength; { deflate_state *s; uInt length = dictLength; uInt n; IPos hash_head = 0; if (strm == Z_NULL || strm->state == Z_NULL || dictionary == Z_NULL || strm->state->status != INIT_STATE) return Z_STREAM_ERROR; s = strm->state; strm->adler = adler32(strm->adler, dictionary, dictLength); if (length < MIN_MATCH) return Z_OK; if (length > MAX_DIST(s)) { length = MAX_DIST(s); dictionary += dictLength - length; } zmemcpy((charf *)s->window, dictionary, length); s->strstart = length; s->block_start = (long)length; /* Insert all strings in the hash table (except for the last two bytes). * s->lookahead stays null, so s->ins_h will be recomputed at the next * call of fill_window. */ s->ins_h = s->window[0]; UPDATE_HASH(s, s->ins_h, s->window[1]); for (n = 0; n <= length - MIN_MATCH; n++) { INSERT_STRING(s, n, hash_head); } if (hash_head) hash_head = 0; /* to make compiler happy */ return Z_OK; } /* ========================================================================= */ int deflateReset (strm) z_streamp strm; { deflate_state *s; if (strm == Z_NULL || strm->state == Z_NULL || strm->zalloc == Z_NULL || strm->zfree == Z_NULL) return Z_STREAM_ERROR; strm->total_in = strm->total_out = 0; strm->msg = Z_NULL; /* use zfree if we ever allocate msg dynamically */ strm->data_type = Z_UNKNOWN; s = (deflate_state *)strm->state; s->pending = 0; s->pending_out = s->pending_buf; if (s->noheader < 0) { s->noheader = 0; /* was set to -1 by deflate(..., Z_FINISH); */ } s->status = s->noheader ? BUSY_STATE : INIT_STATE; strm->adler = 1; s->last_flush = Z_NO_FLUSH; _tr_init(s); lm_init(s); return Z_OK; } /* ========================================================================= */ int deflateParams(strm, level, strategy) z_streamp strm; int level; int strategy; { deflate_state *s; compress_func func; int err = Z_OK; if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR; s = strm->state; if (level == Z_DEFAULT_COMPRESSION) { level = 6; } if (level < 0 || level > 9 || strategy < 0 || strategy > Z_HUFFMAN_ONLY) { return Z_STREAM_ERROR; } func = configuration_table[s->level].func; if (func != configuration_table[level].func && strm->total_in != 0) { /* Flush the last buffer: */ err = deflate(strm, Z_PARTIAL_FLUSH); } if (s->level != level) { s->level = level; s->max_lazy_match = configuration_table[level].max_lazy; s->good_match = configuration_table[level].good_length; s->nice_match = configuration_table[level].nice_length; s->max_chain_length = configuration_table[level].max_chain; } s->strategy = strategy; return err; } /* ========================================================================= * Put a short in the pending buffer. The 16-bit value is put in MSB order. * IN assertion: the stream state is correct and there is enough room in * pending_buf. */ local void putShortMSB (s, b) deflate_state *s; uInt b; { put_byte(s, (Byte)(b >> 8)); put_byte(s, (Byte)(b & 0xff)); } /* ========================================================================= * Flush as much pending output as possible. All deflate() output goes * through this function so some applications may wish to modify it * to avoid allocating a large strm->next_out buffer and copying into it. * (See also read_buf()). */ local void flush_pending(strm) z_streamp strm; { unsigned len = strm->state->pending; if (len > strm->avail_out) len = strm->avail_out; if (len == 0) return; zmemcpy(strm->next_out, strm->state->pending_out, len); strm->next_out += len; strm->state->pending_out += len; strm->total_out += len; strm->avail_out -= len; strm->state->pending -= len; if (strm->state->pending == 0) { strm->state->pending_out = strm->state->pending_buf; } } /* ========================================================================= */ int deflate (strm, flush) z_streamp strm; int flush; { int old_flush; /* value of flush param for previous deflate call */ deflate_state *s; if (strm == Z_NULL || strm->state == Z_NULL || flush > Z_FINISH || flush < 0) { return Z_STREAM_ERROR; } s = strm->state; if (strm->next_out == Z_NULL || (strm->next_in == Z_NULL && strm->avail_in != 0) || (s->status == FINISH_STATE && flush != Z_FINISH)) { ERR_RETURN(strm, Z_STREAM_ERROR); } if (strm->avail_out == 0) ERR_RETURN(strm, Z_BUF_ERROR); s->strm = strm; /* just in case */ old_flush = s->last_flush; s->last_flush = flush; /* Write the zlib header */ if (s->status == INIT_STATE) { uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8; uInt level_flags = (s->level-1) >> 1; if (level_flags > 3) level_flags = 3; header |= (level_flags << 6); if (s->strstart != 0) header |= PRESET_DICT; header += 31 - (header % 31); s->status = BUSY_STATE; putShortMSB(s, header); /* Save the adler32 of the preset dictionary: */ if (s->strstart != 0) { putShortMSB(s, (uInt)(strm->adler >> 16)); putShortMSB(s, (uInt)(strm->adler & 0xffff)); } strm->adler = 1L; } /* Flush as much pending output as possible */ if (s->pending != 0) { flush_pending(strm); if (strm->avail_out == 0) { /* Since avail_out is 0, deflate will be called again with * more output space, but possibly with both pending and * avail_in equal to zero. There won't be anything to do, * but this is not an error situation so make sure we * return OK instead of BUF_ERROR at next call of deflate: */ s->last_flush = -1; return Z_OK; } /* Make sure there is something to do and avoid duplicate consecutive * flushes. For repeated and useless calls with Z_FINISH, we keep * returning Z_STREAM_END instead of Z_BUFF_ERROR. */ } else if (strm->avail_in == 0 && flush <= old_flush && flush != Z_FINISH) { ERR_RETURN(strm, Z_BUF_ERROR); } /* User must not provide more input after the first FINISH: */ if (s->status == FINISH_STATE && strm->avail_in != 0) { ERR_RETURN(strm, Z_BUF_ERROR); } /* Start a new block or continue the current one. */ if (strm->avail_in != 0 || s->lookahead != 0 || (flush != Z_NO_FLUSH && s->status != FINISH_STATE)) { block_state bstate; bstate = (*(configuration_table[s->level].func))(s, flush); if (bstate == finish_started || bstate == finish_done) { s->status = FINISH_STATE; } if (bstate == need_more || bstate == finish_started) { if (strm->avail_out == 0) { s->last_flush = -1; /* avoid BUF_ERROR next call, see above */ } return Z_OK; /* If flush != Z_NO_FLUSH && avail_out == 0, the next call * of deflate should use the same flush parameter to make sure * that the flush is complete. So we don't have to output an * empty block here, this will be done at next call. This also * ensures that for a very small output buffer, we emit at most * one empty block. */ } if (bstate == block_done) { if (flush == Z_PARTIAL_FLUSH) { _tr_align(s); } else { /* FULL_FLUSH or SYNC_FLUSH */ _tr_stored_block(s, (char*)0, 0L, 0); /* For a full flush, this empty block will be recognized * as a special marker by inflate_sync(). */ if (flush == Z_FULL_FLUSH) { CLEAR_HASH(s); /* forget history */ } } flush_pending(strm); if (strm->avail_out == 0) { s->last_flush = -1; /* avoid BUF_ERROR at next call, see above */ return Z_OK; } } } Assert(strm->avail_out > 0, "bug2"); if (flush != Z_FINISH) return Z_OK; if (s->noheader) return Z_STREAM_END; /* Write the zlib trailer (adler32) */ putShortMSB(s, (uInt)(strm->adler >> 16)); putShortMSB(s, (uInt)(strm->adler & 0xffff)); flush_pending(strm); /* If avail_out is zero, the application will call deflate again * to flush the rest. */ s->noheader = -1; /* write the trailer only once! */ return s->pending != 0 ? Z_OK : Z_STREAM_END; } /* ========================================================================= */ int deflateEnd (strm) z_streamp strm; { int status; if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR; /* Deallocate in reverse order of allocations: */ TRY_FREE(strm, strm->state->pending_buf); TRY_FREE(strm, strm->state->head); TRY_FREE(strm, strm->state->prev); TRY_FREE(strm, strm->state->window); status = strm->state->status; ZFREE(strm, strm->state); strm->state = Z_NULL; return status == BUSY_STATE ? Z_DATA_ERROR : Z_OK; } /* ========================================================================= */ int deflateCopy (dest, source) z_streamp dest; z_streamp source; { if (source == Z_NULL || dest == Z_NULL || source->state == Z_NULL) { return Z_STREAM_ERROR; } *dest = *source; return Z_STREAM_ERROR; /* to be implemented */ #if 0 dest->state = (struct internal_state FAR *) (*dest->zalloc)(1, sizeof(deflate_state)); if (dest->state == Z_NULL) return Z_MEM_ERROR; *(dest->state) = *(source->state); return Z_OK; #endif } /* =========================================================================== * Read a new buffer from the current input stream, update the adler32 * and total number of bytes read. All deflate() input goes through * this function so some applications may wish to modify it to avoid * allocating a large strm->next_in buffer and copying from it. * (See also flush_pending()). */ local int read_buf(strm, buf, size) z_streamp strm; charf *buf; unsigned size; { unsigned len = strm->avail_in; if (len > size) len = size; if (len == 0) return 0; strm->avail_in -= len; if (!strm->state->noheader) { strm->adler = adler32(strm->adler, strm->next_in, len); } zmemcpy(buf, strm->next_in, len); strm->next_in += len; strm->total_in += len; return (int)len; } /* =========================================================================== * Initialize the "longest match" routines for a new zlib stream */ local void lm_init (s) deflate_state *s; { s->window_size = (ulg)2L*s->w_size; CLEAR_HASH(s); /* Set the default configuration parameters: */ s->max_lazy_match = configuration_table[s->level].max_lazy; s->good_match = configuration_table[s->level].good_length; s->nice_match = configuration_table[s->level].nice_length; s->max_chain_length = configuration_table[s->level].max_chain; s->strstart = 0; s->block_start = 0L; s->lookahead = 0; s->match_length = s->prev_length = MIN_MATCH-1; s->match_available = 0; s->ins_h = 0; #ifdef ASMV match_init(); /* initialize the asm code */ #endif } /* =========================================================================== * Set match_start to the longest match starting at the given string and * return its length. Matches shorter or equal to prev_length are discarded, * in which case the result is equal to prev_length and match_start is * garbage. * IN assertions: cur_match is the head of the hash chain for the current * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 * OUT assertion: the match length is not greater than s->lookahead. */ #ifndef ASMV /* For 80x86 and 680x0, an optimized version will be provided in match.asm or * match.S. The code will be functionally equivalent. */ local uInt longest_match(s, cur_match) deflate_state *s; IPos cur_match; /* current match */ { unsigned chain_length = s->max_chain_length;/* max hash chain length */ register Bytef *scan = s->window + s->strstart; /* current string */ register Bytef *match; /* matched string */ register int len; /* length of current match */ int best_len = s->prev_length; /* best match length so far */ int nice_match = s->nice_match; /* stop if match long enough */ IPos limit = s->strstart > (IPos)MAX_DIST(s) ? s->strstart - (IPos)MAX_DIST(s) : NIL; /* Stop when cur_match becomes <= limit. To simplify the code, * we prevent matches with the string of window index 0. */ Posf *prev = s->prev; uInt wmask = s->w_mask; #ifdef UNALIGNED_OK /* Compare two bytes at a time. Note: this is not always beneficial. * Try with and without -DUNALIGNED_OK to check. */ register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; register ush scan_start = *(ushf*)scan; register ush scan_end = *(ushf*)(scan+best_len-1); #else register Bytef *strend = s->window + s->strstart + MAX_MATCH; register Byte scan_end1 = scan[best_len-1]; register Byte scan_end = scan[best_len]; #endif /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. * It is easy to get rid of this optimization if necessary. */ Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); /* Do not waste too much time if we already have a good match: */ if (s->prev_length >= s->good_match) { chain_length >>= 2; } /* Do not look for matches beyond the end of the input. This is necessary * to make deflate deterministic. */ if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead; Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); do { Assert(cur_match < s->strstart, "no future"); match = s->window + cur_match; /* Skip to next match if the match length cannot increase * or if the match length is less than 2: */ #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) /* This code assumes sizeof(unsigned short) == 2. Do not use * UNALIGNED_OK if your compiler uses a different size. */ if (*(ushf*)(match+best_len-1) != scan_end || *(ushf*)match != scan_start) continue; /* It is not necessary to compare scan[2] and match[2] since they are * always equal when the other bytes match, given that the hash keys * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at * strstart+3, +5, ... up to strstart+257. We check for insufficient * lookahead only every 4th comparison; the 128th check will be made * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is * necessary to put more guard bytes at the end of the window, or * to check more often for insufficient lookahead. */ Assert(scan[2] == match[2], "scan[2]?"); scan++, match++; do { } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) && *(ushf*)(scan+=2) == *(ushf*)(match+=2) && *(ushf*)(scan+=2) == *(ushf*)(match+=2) && *(ushf*)(scan+=2) == *(ushf*)(match+=2) && scan < strend); /* The funny "do {}" generates better code on most compilers */ /* Here, scan <= window+strstart+257 */ Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); if (*scan == *match) scan++; len = (MAX_MATCH - 1) - (int)(strend-scan); scan = strend - (MAX_MATCH-1); #else /* UNALIGNED_OK */ if (match[best_len] != scan_end || match[best_len-1] != scan_end1 || *match != *scan || *++match != scan[1]) continue; /* The check at best_len-1 can be removed because it will be made * again later. (This heuristic is not always a win.) * It is not necessary to compare scan[2] and match[2] since they * are always equal when the other bytes match, given that * the hash keys are equal and that HASH_BITS >= 8. */ scan += 2, match++; Assert(*scan == *match, "match[2]?"); /* We check for insufficient lookahead only every 8th comparison; * the 256th check will be made at strstart+258. */ do { } while (*++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && scan < strend); Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); len = MAX_MATCH - (int)(strend - scan); scan = strend - MAX_MATCH; #endif /* UNALIGNED_OK */ if (len > best_len) { s->match_start = cur_match; best_len = len; if (len >= nice_match) break; #ifdef UNALIGNED_OK scan_end = *(ushf*)(scan+best_len-1); #else scan_end1 = scan[best_len-1]; scan_end = scan[best_len]; #endif } } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length != 0); if ((uInt)best_len <= s->lookahead) return best_len; return s->lookahead; } #endif /* ASMV */ #ifdef DEBUG /* =========================================================================== * Check that the match at match_start is indeed a match. */ local void check_match(s, start, match, length) deflate_state *s; IPos start, match; int length; { /* check that the match is indeed a match */ if (zmemcmp((charf *)s->window + match, (charf *)s->window + start, length) != EQUAL) { fprintf(stderr, " start %u, match %u, length %d\n", start, match, length); do { fprintf(stderr, "%c%c", s->window[match++], s->window[start++]); } while (--length != 0); z_error("invalid match"); } if (verbose > 1) { fprintf(stderr,"\\[%d,%d]", start-match, length); do { putc(s->window[start++], stderr); } while (--length != 0); } } #else # define check_match(s, start, match, length) #endif /* =========================================================================== * Fill the window when the lookahead becomes insufficient. * Updates strstart and lookahead. * * IN assertion: lookahead < MIN_LOOKAHEAD * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD * At least one byte has been read, or avail_in == 0; reads are * performed for at least two bytes (required for the zip translate_eol * option -- not supported here). */ local void fill_window(s) deflate_state *s; { register unsigned n, m; register Posf *p; unsigned more; /* Amount of free space at the end of the window. */ uInt wsize = s->w_size; do { more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart); /* Deal with !@#$% 64K limit: */ if (more == 0 && s->strstart == 0 && s->lookahead == 0) { more = wsize; } else if (more == (unsigned)(-1)) { /* Very unlikely, but possible on 16 bit machine if strstart == 0 * and lookahead == 1 (input done one byte at time) */ more--; /* If the window is almost full and there is insufficient lookahead, * move the upper half to the lower one to make room in the upper half. */ } else if (s->strstart >= wsize+MAX_DIST(s)) { zmemcpy((charf *)s->window, (charf *)s->window+wsize, (unsigned)wsize); s->match_start -= wsize; s->strstart -= wsize; /* we now have strstart >= MAX_DIST */ s->block_start -= (long) wsize; /* Slide the hash table (could be avoided with 32 bit values at the expense of memory usage): */ n = s->hash_size; p = &s->head[n]; do { m = *--p; *p = (Pos)(m >= wsize ? m-wsize : NIL); } while (--n); n = wsize; p = &s->prev[n]; do { m = *--p; *p = (Pos)(m >= wsize ? m-wsize : NIL); /* If n is not on any hash chain, prev[n] is garbage but * its value will never be used. */ } while (--n); more += wsize; } if (s->strm->avail_in == 0) return; /* If there was no sliding: * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && * more == window_size - lookahead - strstart * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) * => more >= window_size - 2*WSIZE + 2 * In the BIG_MEM or MMAP case (not yet supported), * window_size == input_size + MIN_LOOKAHEAD && * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. * Otherwise, window_size == 2*WSIZE so more >= 2. * If there was sliding, more >= WSIZE. So in all cases, more >= 2. */ Assert(more >= 2, "more < 2"); n = read_buf(s->strm, (charf *)s->window + s->strstart + s->lookahead, more); s->lookahead += n; /* Initialize the hash value now that we have some input: */ if (s->lookahead >= MIN_MATCH) { s->ins_h = s->window[s->strstart]; UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]); #if MIN_MATCH != 3 Call UPDATE_HASH() MIN_MATCH-3 more times #endif } /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, * but this is not important since only literal bytes will be emitted. */ } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0); } /* =========================================================================== * Flush the current block, with given end-of-file flag. * IN assertion: strstart is set to the end of the current match. */ #define FLUSH_BLOCK_ONLY(s, eof) { \ _tr_flush_block(s, (s->block_start >= 0L ? \ (charf *)&s->window[(unsigned)s->block_start] : \ (charf *)Z_NULL), \ (ulg)((long)s->strstart - s->block_start), \ (eof)); \ s->block_start = s->strstart; \ flush_pending(s->strm); \ Tracev((stderr,"[FLUSH]")); \ } /* Same but force premature exit if necessary. */ #define FLUSH_BLOCK(s, eof) { \ FLUSH_BLOCK_ONLY(s, eof); \ if (s->strm->avail_out == 0) return (eof) ? finish_started : need_more; \ } /* =========================================================================== * Copy without compression as much as possible from the input stream, return * the current block state. * This function does not insert new strings in the dictionary since * uncompressible data is probably not useful. This function is used * only for the level=0 compression option. * NOTE: this function should be optimized to avoid extra copying. */ local block_state deflate_stored(s, flush) deflate_state *s; int flush; { for (;;) { /* Fill the window as much as possible: */ if (s->lookahead <= 1) { Assert(s->strstart < s->w_size+MAX_DIST(s) || s->block_start >= (long)s->w_size, "slide too late"); fill_window(s); if (s->lookahead == 0 && flush == Z_NO_FLUSH) return need_more; if (s->lookahead == 0) break; /* flush the current block */ } Assert(s->block_start >= 0L, "block gone"); s->strstart += s->lookahead; s->lookahead = 0; /* Stored blocks are limited to 0xffff bytes: */ if (s->strstart == 0 || s->strstart > 0xfffe) { /* strstart == 0 is possible when wraparound on 16-bit machine */ s->lookahead = s->strstart - 0xffff; s->strstart = 0xffff; } /* Emit a stored block if it is large enough: */ if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) { FLUSH_BLOCK(s, 0); } } FLUSH_BLOCK(s, flush == Z_FINISH); return flush == Z_FINISH ? finish_done : block_done; } /* =========================================================================== * Compress as much as possible from the input stream, return the current * block state. * This function does not perform lazy evaluation of matches and inserts * new strings in the dictionary only for unmatched strings or for short * matches. It is used only for the fast compression options. */ local block_state deflate_fast(s, flush) deflate_state *s; int flush; { IPos hash_head = NIL; /* head of the hash chain */ int bflush; /* set if current block must be flushed */ for (;;) { /* Make sure that we always have enough lookahead, except * at the end of the input file. We need MAX_MATCH bytes * for the next match, plus MIN_MATCH bytes to insert the * string following the next match. */ if (s->lookahead < MIN_LOOKAHEAD) { fill_window(s); if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) { return need_more; } if (s->lookahead == 0) break; /* flush the current block */ } /* Insert the string window[strstart .. strstart+2] in the * dictionary, and set hash_head to the head of the hash chain: */ if (s->lookahead >= MIN_MATCH) { INSERT_STRING(s, s->strstart, hash_head); } /* Find the longest match, discarding those <= prev_length. * At this point we have always match_length < MIN_MATCH */ if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) { /* To simplify the code, we prevent matches with the string * of window index 0 (in particular we have to avoid a match * of the string with itself at the start of the input file). */ if (s->strategy != Z_HUFFMAN_ONLY) { s->match_length = longest_match (s, hash_head); } /* longest_match() sets match_start */ } if (s->match_length >= MIN_MATCH) { check_match(s, s->strstart, s->match_start, s->match_length); bflush = _tr_tally(s, s->strstart - s->match_start, s->match_length - MIN_MATCH); s->lookahead -= s->match_length; /* Insert new strings in the hash table only if the match length * is not too large. This saves time but degrades compression. */ if (s->match_length <= s->max_insert_length && s->lookahead >= MIN_MATCH) { s->match_length--; /* string at strstart already in hash table */ do { s->strstart++; INSERT_STRING(s, s->strstart, hash_head); /* strstart never exceeds WSIZE-MAX_MATCH, so there are * always MIN_MATCH bytes ahead. */ } while (--s->match_length != 0); s->strstart++; } else { s->strstart += s->match_length; s->match_length = 0; s->ins_h = s->window[s->strstart]; UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]); #if MIN_MATCH != 3 Call UPDATE_HASH() MIN_MATCH-3 more times #endif /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not * matter since it will be recomputed at next deflate call. */ } } else { /* No match, output a literal byte */ Tracevv((stderr,"%c", s->window[s->strstart])); bflush = _tr_tally (s, 0, s->window[s->strstart]); s->lookahead--; s->strstart++; } if (bflush) FLUSH_BLOCK(s, 0); } FLUSH_BLOCK(s, flush == Z_FINISH); return flush == Z_FINISH ? finish_done : block_done; } /* =========================================================================== * Same as above, but achieves better compression. We use a lazy * evaluation for matches: a match is finally adopted only if there is * no better match at the next window position. */ local block_state deflate_slow(s, flush) deflate_state *s; int flush; { IPos hash_head = NIL; /* head of hash chain */ int bflush; /* set if current block must be flushed */ /* Process the input block. */ for (;;) { /* Make sure that we always have enough lookahead, except * at the end of the input file. We need MAX_MATCH bytes * for the next match, plus MIN_MATCH bytes to insert the * string following the next match. */ if (s->lookahead < MIN_LOOKAHEAD) { fill_window(s); if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) { return need_more; } if (s->lookahead == 0) break; /* flush the current block */ } /* Insert the string window[strstart .. strstart+2] in the * dictionary, and set hash_head to the head of the hash chain: */ if (s->lookahead >= MIN_MATCH) { INSERT_STRING(s, s->strstart, hash_head); } /* Find the longest match, discarding those <= prev_length. */ s->prev_length = s->match_length, s->prev_match = s->match_start; s->match_length = MIN_MATCH-1; if (hash_head != NIL && s->prev_length < s->max_lazy_match && s->strstart - hash_head <= MAX_DIST(s)) { /* To simplify the code, we prevent matches with the string * of window index 0 (in particular we have to avoid a match * of the string with itself at the start of the input file). */ if (s->strategy != Z_HUFFMAN_ONLY) { s->match_length = longest_match (s, hash_head); } /* longest_match() sets match_start */ if (s->match_length <= 5 && (s->strategy == Z_FILTERED || (s->match_length == MIN_MATCH && s->strstart - s->match_start > TOO_FAR))) { /* If prev_match is also MIN_MATCH, match_start is garbage * but we will ignore the current match anyway. */ s->match_length = MIN_MATCH-1; } } /* If there was a match at the previous step and the current * match is not better, output the previous match: */ if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) { uInt max_insert = s->strstart + s->lookahead - MIN_MATCH; /* Do not insert strings in hash table beyond this. */ check_match(s, s->strstart-1, s->prev_match, s->prev_length); bflush = _tr_tally(s, s->strstart -1 - s->prev_match, s->prev_length - MIN_MATCH); /* Insert in hash table all strings up to the end of the match. * strstart-1 and strstart are already inserted. If there is not * enough lookahead, the last two strings are not inserted in * the hash table. */ s->lookahead -= s->prev_length-1; s->prev_length -= 2; do { if (++s->strstart <= max_insert) { INSERT_STRING(s, s->strstart, hash_head); } } while (--s->prev_length != 0); s->match_available = 0; s->match_length = MIN_MATCH-1; s->strstart++; if (bflush) FLUSH_BLOCK(s, 0); } else if (s->match_available) { /* If there was no match at the previous position, output a * single literal. If there was a match but the current match * is longer, truncate the previous match to a single literal. */ Tracevv((stderr,"%c", s->window[s->strstart-1])); if (_tr_tally (s, 0, s->window[s->strstart-1])) { FLUSH_BLOCK_ONLY(s, 0); } s->strstart++; s->lookahead--; if (s->strm->avail_out == 0) return need_more; } else { /* There is no previous match to compare with, wait for * the next step to decide. */ s->match_available = 1; s->strstart++; s->lookahead--; } } Assert (flush != Z_NO_FLUSH, "no flush?"); if (s->match_available) { Tracevv((stderr,"%c", s->window[s->strstart-1])); _tr_tally (s, 0, s->window[s->strstart-1]); s->match_available = 0; } FLUSH_BLOCK(s, flush == Z_FINISH); return flush == Z_FINISH ? finish_done : block_done; } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/deflate.h100644 1007 1403 24133 6363455067 21755 0ustar petrillipetrilli/* deflate.h -- internal compression state * Copyright (C) 1995-1996 Jean-loup Gailly * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ /* $Id: deflate.h,v 1.1 1997/07/17 17:45:27 jim Exp $ */ #ifndef _DEFLATE_H #define _DEFLATE_H #include "zutil.h" /* =========================================================================== * Internal compression state. */ #define LENGTH_CODES 29 /* number of length codes, not counting the special END_BLOCK code */ #define LITERALS 256 /* number of literal bytes 0..255 */ #define L_CODES (LITERALS+1+LENGTH_CODES) /* number of Literal or Length codes, including the END_BLOCK code */ #define D_CODES 30 /* number of distance codes */ #define BL_CODES 19 /* number of codes used to transfer the bit lengths */ #define HEAP_SIZE (2*L_CODES+1) /* maximum heap size */ #define MAX_BITS 15 /* All codes must not exceed MAX_BITS bits */ #define INIT_STATE 42 #define BUSY_STATE 113 #define FINISH_STATE 666 /* Stream status */ /* Data structure describing a single value and its code string. */ typedef struct ct_data_s { union { ush freq; /* frequency count */ ush code; /* bit string */ } fc; union { ush dad; /* father node in Huffman tree */ ush len; /* length of bit string */ } dl; } FAR ct_data; #define Freq fc.freq #define Code fc.code #define Dad dl.dad #define Len dl.len typedef struct static_tree_desc_s static_tree_desc; typedef struct tree_desc_s { ct_data *dyn_tree; /* the dynamic tree */ int max_code; /* largest code with non zero frequency */ static_tree_desc *stat_desc; /* the corresponding static tree */ } FAR tree_desc; typedef ush Pos; typedef Pos FAR Posf; typedef unsigned IPos; /* A Pos is an index in the character window. We use short instead of int to * save space in the various tables. IPos is used only for parameter passing. */ typedef struct internal_state { z_streamp strm; /* pointer back to this zlib stream */ int status; /* as the name implies */ Bytef *pending_buf; /* output still pending */ Bytef *pending_out; /* next pending byte to output to the stream */ int pending; /* nb of bytes in the pending buffer */ int noheader; /* suppress zlib header and adler32 */ Byte data_type; /* UNKNOWN, BINARY or ASCII */ Byte method; /* STORED (for zip only) or DEFLATED */ int last_flush; /* value of flush param for previous deflate call */ /* used by deflate.c: */ uInt w_size; /* LZ77 window size (32K by default) */ uInt w_bits; /* log2(w_size) (8..16) */ uInt w_mask; /* w_size - 1 */ Bytef *window; /* Sliding window. Input bytes are read into the second half of the window, * and move to the first half later to keep a dictionary of at least wSize * bytes. With this organization, matches are limited to a distance of * wSize-MAX_MATCH bytes, but this ensures that IO is always * performed with a length multiple of the block size. Also, it limits * the window size to 64K, which is quite useful on MSDOS. * To do: use the user input buffer as sliding window. */ ulg window_size; /* Actual size of window: 2*wSize, except when the user input buffer * is directly used as sliding window. */ Posf *prev; /* Link to older string with same hash index. To limit the size of this * array to 64K, this link is maintained only for the last 32K strings. * An index in this array is thus a window index modulo 32K. */ Posf *head; /* Heads of the hash chains or NIL. */ uInt ins_h; /* hash index of string to be inserted */ uInt hash_size; /* number of elements in hash table */ uInt hash_bits; /* log2(hash_size) */ uInt hash_mask; /* hash_size-1 */ uInt hash_shift; /* Number of bits by which ins_h must be shifted at each input * step. It must be such that after MIN_MATCH steps, the oldest * byte no longer takes part in the hash key, that is: * hash_shift * MIN_MATCH >= hash_bits */ long block_start; /* Window position at the beginning of the current output block. Gets * negative when the window is moved backwards. */ uInt match_length; /* length of best match */ IPos prev_match; /* previous match */ int match_available; /* set if previous match exists */ uInt strstart; /* start of string to insert */ uInt match_start; /* start of matching string */ uInt lookahead; /* number of valid bytes ahead in window */ uInt prev_length; /* Length of the best match at previous step. Matches not greater than this * are discarded. This is used in the lazy match evaluation. */ uInt max_chain_length; /* To speed up deflation, hash chains are never searched beyond this * length. A higher limit improves compression ratio but degrades the * speed. */ uInt max_lazy_match; /* Attempt to find a better match only when the current match is strictly * smaller than this value. This mechanism is used only for compression * levels >= 4. */ # define max_insert_length max_lazy_match /* Insert new strings in the hash table only if the match length is not * greater than this length. This saves time but degrades compression. * max_insert_length is used only for compression levels <= 3. */ int level; /* compression level (1..9) */ int strategy; /* favor or force Huffman coding*/ uInt good_match; /* Use a faster search when the previous match is longer than this */ int nice_match; /* Stop searching when current match exceeds this */ /* used by trees.c: */ /* Didn't use ct_data typedef below to supress compiler warning */ struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ struct tree_desc_s l_desc; /* desc. for literal tree */ struct tree_desc_s d_desc; /* desc. for distance tree */ struct tree_desc_s bl_desc; /* desc. for bit length tree */ ush bl_count[MAX_BITS+1]; /* number of codes at each bit length for an optimal tree */ int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ int heap_len; /* number of elements in the heap */ int heap_max; /* element of largest frequency */ /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. * The same heap array is used to build all trees. */ uch depth[2*L_CODES+1]; /* Depth of each subtree used as tie breaker for trees of equal frequency */ uchf *l_buf; /* buffer for literals or lengths */ uInt lit_bufsize; /* Size of match buffer for literals/lengths. There are 4 reasons for * limiting lit_bufsize to 64K: * - frequencies can be kept in 16 bit counters * - if compression is not successful for the first block, all input * data is still in the window so we can still emit a stored block even * when input comes from standard input. (This can also be done for * all blocks if lit_bufsize is not greater than 32K.) * - if compression is not successful for a file smaller than 64K, we can * even emit a stored file instead of a stored block (saving 5 bytes). * This is applicable only for zip (not gzip or zlib). * - creating new Huffman trees less frequently may not provide fast * adaptation to changes in the input data statistics. (Take for * example a binary file with poorly compressible code followed by * a highly compressible string table.) Smaller buffer sizes give * fast adaptation but have of course the overhead of transmitting * trees more frequently. * - I can't count above 4 */ uInt last_lit; /* running index in l_buf */ ushf *d_buf; /* Buffer for distances. To simplify the code, d_buf and l_buf have * the same number of elements. To use different lengths, an extra flag * array would be necessary. */ ulg opt_len; /* bit length of current block with optimal trees */ ulg static_len; /* bit length of current block with static trees */ ulg compressed_len; /* total bit length of compressed file */ uInt matches; /* number of string matches in current block */ int last_eob_len; /* bit length of EOB code for last block */ #ifdef DEBUG ulg bits_sent; /* bit length of the compressed data */ #endif ush bi_buf; /* Output buffer. bits are inserted starting at the bottom (least * significant bits). */ int bi_valid; /* Number of valid bits in bi_buf. All bits above the last valid bit * are always zero. */ } FAR deflate_state; /* Output a byte on the stream. * IN assertion: there is enough room in pending_buf. */ #define put_byte(s, c) {s->pending_buf[s->pending++] = (c);} #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) /* Minimum amount of lookahead, except at the end of the input file. * See deflate.c for comments about the MIN_MATCH+1. */ #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD) /* In order to simplify the code, particularly on 16 bit machines, match * distances are limited to MAX_DIST instead of WSIZE. */ /* in trees.c */ void _tr_init OF((deflate_state *s)); int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc)); ulg _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len, int eof)); void _tr_align OF((deflate_state *s)); void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len, int eof)); #endif Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/gzio.c100644 1007 1403 36411 6363455067 21316 0ustar petrillipetrilli/* gzio.c -- IO on .gz files * Copyright (C) 1995-1996 Jean-loup Gailly. * For conditions of distribution and use, see copyright notice in zlib.h */ /* $Id: gzio.c,v 1.1 1997/07/17 17:45:27 jim Exp $ */ #include #include "zutil.h" struct internal_state {int dummy;}; /* for buggy compilers */ #define Z_BUFSIZE 4096 #define ALLOC(size) malloc(size) #define TRYFREE(p) {if (p) free(p);} static int gz_magic[2] = {0x1f, 0x8b}; /* gzip magic header */ /* gzip flag byte */ #define ASCII_FLAG 0x01 /* bit 0 set: file probably ascii text */ #define HEAD_CRC 0x02 /* bit 1 set: header CRC present */ #define EXTRA_FIELD 0x04 /* bit 2 set: extra field present */ #define ORIG_NAME 0x08 /* bit 3 set: original file name present */ #define COMMENT 0x10 /* bit 4 set: file comment present */ #define RESERVED 0xE0 /* bits 5..7: reserved */ typedef struct gz_stream { z_stream stream; int z_err; /* error code for last stream operation */ int z_eof; /* set if end of input file */ FILE *file; /* .gz file */ Byte *inbuf; /* input buffer */ Byte *outbuf; /* output buffer */ uLong crc; /* crc32 of uncompressed data */ char *msg; /* error message */ char *path; /* path name for debugging only */ int transparent; /* 1 if input file is not a .gz file */ char mode; /* 'w' or 'r' */ } gz_stream; local gzFile gz_open OF((const char *path, const char *mode, int fd)); local int get_byte OF((gz_stream *s)); local void check_header OF((gz_stream *s)); local int destroy OF((gz_stream *s)); local void putLong OF((FILE *file, uLong x)); local uLong getLong OF((gz_stream *s)); /* =========================================================================== Opens a gzip (.gz) file for reading or writing. The mode parameter is as in fopen ("rb" or "wb"). The file is given either by file descriptor or path name (if fd == -1). gz_open return NULL if the file could not be opened or if there was insufficient memory to allocate the (de)compression state; errno can be checked to distinguish the two cases (if errno is zero, the zlib error is Z_MEM_ERROR). */ local gzFile gz_open (path, mode, fd) const char *path; const char *mode; int fd; { int err; int level = Z_DEFAULT_COMPRESSION; /* compression level */ char *p = (char*)mode; gz_stream *s; char fmode[80]; /* copy of mode, without the compression level */ char *m = fmode; if (!path || !mode) return Z_NULL; s = (gz_stream *)ALLOC(sizeof(gz_stream)); if (!s) return Z_NULL; s->stream.zalloc = (alloc_func)0; s->stream.zfree = (free_func)0; s->stream.opaque = (voidpf)0; s->stream.next_in = s->inbuf = Z_NULL; s->stream.next_out = s->outbuf = Z_NULL; s->stream.avail_in = s->stream.avail_out = 0; s->file = NULL; s->z_err = Z_OK; s->z_eof = 0; s->crc = crc32(0L, Z_NULL, 0); s->msg = NULL; s->transparent = 0; s->path = (char*)ALLOC(strlen(path)+1); if (s->path == NULL) { return destroy(s), (gzFile)Z_NULL; } strcpy(s->path, path); /* do this early for debugging */ s->mode = '\0'; do { if (*p == 'r') s->mode = 'r'; if (*p == 'w' || *p == 'a') s->mode = 'w'; if (*p >= '0' && *p <= '9') { level = *p - '0'; } else { *m++ = *p; /* copy the mode */ } } while (*p++ && m != fmode + sizeof(fmode)); if (s->mode == '\0') return destroy(s), (gzFile)Z_NULL; if (s->mode == 'w') { err = deflateInit2(&(s->stream), level, Z_DEFLATED, -MAX_WBITS, DEF_MEM_LEVEL, 0); /* windowBits is passed < 0 to suppress zlib header */ s->stream.next_out = s->outbuf = (Byte*)ALLOC(Z_BUFSIZE); if (err != Z_OK || s->outbuf == Z_NULL) { return destroy(s), (gzFile)Z_NULL; } } else { err = inflateInit2(&(s->stream), -MAX_WBITS); s->stream.next_in = s->inbuf = (Byte*)ALLOC(Z_BUFSIZE); if (err != Z_OK || s->inbuf == Z_NULL) { return destroy(s), (gzFile)Z_NULL; } } s->stream.avail_out = Z_BUFSIZE; errno = 0; s->file = fd < 0 ? FOPEN(path, fmode) : (FILE*)fdopen(fd, fmode); if (s->file == NULL) { return destroy(s), (gzFile)Z_NULL; } if (s->mode == 'w') { /* Write a very simple .gz header: */ fprintf(s->file, "%c%c%c%c%c%c%c%c%c%c", gz_magic[0], gz_magic[1], Z_DEFLATED, 0 /*flags*/, 0,0,0,0 /*time*/, 0 /*xflags*/, OS_CODE); } else { check_header(s); /* skip the .gz header */ } return (gzFile)s; } /* =========================================================================== Opens a gzip (.gz) file for reading or writing. */ gzFile gzopen (path, mode) const char *path; const char *mode; { return gz_open (path, mode, -1); } /* =========================================================================== Associate a gzFile with the file descriptor fd. fd is not dup'ed here to mimic the behavio(u)r of fdopen. */ gzFile gzdopen (fd, mode) int fd; const char *mode; { char name[20]; if (fd < 0) return (gzFile)Z_NULL; sprintf(name, "", fd); /* for debugging */ return gz_open (name, mode, fd); } /* =========================================================================== Read a byte from a gz_stream; update next_in and avail_in. Return EOF for end of file. IN assertion: the stream s has been sucessfully opened for reading. */ local int get_byte(s) gz_stream *s; { if (s->z_eof) return EOF; if (s->stream.avail_in == 0) { errno = 0; s->stream.avail_in = fread(s->inbuf, 1, Z_BUFSIZE, s->file); if (s->stream.avail_in == 0) { s->z_eof = 1; if (ferror(s->file)) s->z_err = Z_ERRNO; return EOF; } s->stream.next_in = s->inbuf; } s->stream.avail_in--; return *(s->stream.next_in)++; } /* =========================================================================== Check the gzip header of a gz_stream opened for reading. Set the stream mode to transparent if the gzip magic header is not present; set s->err to Z_DATA_ERROR if the magic header is present but the rest of the header is incorrect. IN assertion: the stream s has already been created sucessfully; s->stream.avail_in is zero for the first time, but may be non-zero for concatenated .gz files. */ local void check_header(s) gz_stream *s; { int method; /* method byte */ int flags; /* flags byte */ uInt len; int c; /* Check the gzip magic header */ for (len = 0; len < 2; len++) { c = get_byte(s); if (c != gz_magic[len]) { s->transparent = 1; if (c != EOF) s->stream.avail_in++, s->stream.next_in--; s->z_err = s->stream.avail_in != 0 ? Z_OK : Z_STREAM_END; return; } } method = get_byte(s); flags = get_byte(s); if (method != Z_DEFLATED || (flags & RESERVED) != 0) { s->z_err = Z_DATA_ERROR; return; } /* Discard time, xflags and OS code: */ for (len = 0; len < 6; len++) (void)get_byte(s); if ((flags & EXTRA_FIELD) != 0) { /* skip the extra field */ len = (uInt)get_byte(s); len += ((uInt)get_byte(s))<<8; /* len is garbage if EOF but the loop below will quit anyway */ while (len-- != 0 && get_byte(s) != EOF) ; } if ((flags & ORIG_NAME) != 0) { /* skip the original file name */ while ((c = get_byte(s)) != 0 && c != EOF) ; } if ((flags & COMMENT) != 0) { /* skip the .gz file comment */ while ((c = get_byte(s)) != 0 && c != EOF) ; } if ((flags & HEAD_CRC) != 0) { /* skip the header crc */ for (len = 0; len < 2; len++) (void)get_byte(s); } s->z_err = s->z_eof ? Z_DATA_ERROR : Z_OK; } /* =========================================================================== * Cleanup then free the given gz_stream. Return a zlib error code. Try freeing in the reverse order of allocations. */ local int destroy (s) gz_stream *s; { int err = Z_OK; if (!s) return Z_STREAM_ERROR; TRYFREE(s->msg); if (s->stream.state != NULL) { if (s->mode == 'w') { err = deflateEnd(&(s->stream)); } else if (s->mode == 'r') { err = inflateEnd(&(s->stream)); } } if (s->file != NULL && fclose(s->file)) { err = Z_ERRNO; } if (s->z_err < 0) err = s->z_err; TRYFREE(s->inbuf); TRYFREE(s->outbuf); TRYFREE(s->path); TRYFREE(s); return err; } /* =========================================================================== Reads the given number of uncompressed bytes from the compressed file. gzread returns the number of bytes actually read (0 for end of file). */ int gzread (file, buf, len) gzFile file; voidp buf; unsigned len; { gz_stream *s = (gz_stream*)file; Bytef *start = buf; /* starting point for crc computation */ Byte *next_out; /* == stream.next_out but not forced far (for MSDOS) */ if (s == NULL || s->mode != 'r') return Z_STREAM_ERROR; if (s->z_err == Z_DATA_ERROR || s->z_err == Z_ERRNO) return -1; if (s->z_err == Z_STREAM_END) return 0; /* EOF */ s->stream.next_out = next_out = buf; s->stream.avail_out = len; while (s->stream.avail_out != 0) { if (s->transparent) { /* Copy first the lookahead bytes: */ uInt n = s->stream.avail_in; if (n > s->stream.avail_out) n = s->stream.avail_out; if (n > 0) { zmemcpy(s->stream.next_out, s->stream.next_in, n); next_out += n; s->stream.next_out = next_out; s->stream.next_in += n; s->stream.avail_out -= n; s->stream.avail_in -= n; } if (s->stream.avail_out > 0) { s->stream.avail_out -= fread(next_out, 1, s->stream.avail_out, s->file); } return (int)(len - s->stream.avail_out); } if (s->stream.avail_in == 0 && !s->z_eof) { errno = 0; s->stream.avail_in = fread(s->inbuf, 1, Z_BUFSIZE, s->file); if (s->stream.avail_in == 0) { s->z_eof = 1; if (ferror(s->file)) { s->z_err = Z_ERRNO; break; } } s->stream.next_in = s->inbuf; } s->z_err = inflate(&(s->stream), Z_NO_FLUSH); if (s->z_err == Z_STREAM_END) { /* Check CRC and original size */ s->crc = crc32(s->crc, start, (uInt)(s->stream.next_out - start)); start = s->stream.next_out; if (getLong(s) != s->crc || getLong(s) != s->stream.total_out) { s->z_err = Z_DATA_ERROR; } else { /* Check for concatenated .gz files: */ check_header(s); if (s->z_err == Z_OK) { inflateReset(&(s->stream)); s->crc = crc32(0L, Z_NULL, 0); } } } if (s->z_err != Z_OK || s->z_eof) break; } s->crc = crc32(s->crc, start, (uInt)(s->stream.next_out - start)); return (int)(len - s->stream.avail_out); } /* =========================================================================== Writes the given number of uncompressed bytes into the compressed file. gzwrite returns the number of bytes actually written (0 in case of error). */ int gzwrite (file, buf, len) gzFile file; const voidp buf; unsigned len; { gz_stream *s = (gz_stream*)file; if (s == NULL || s->mode != 'w') return Z_STREAM_ERROR; s->stream.next_in = buf; s->stream.avail_in = len; while (s->stream.avail_in != 0) { if (s->stream.avail_out == 0) { s->stream.next_out = s->outbuf; if (fwrite(s->outbuf, 1, Z_BUFSIZE, s->file) != Z_BUFSIZE) { s->z_err = Z_ERRNO; break; } s->stream.avail_out = Z_BUFSIZE; } s->z_err = deflate(&(s->stream), Z_NO_FLUSH); if (s->z_err != Z_OK) break; } s->crc = crc32(s->crc, buf, len); return (int)(len - s->stream.avail_in); } /* =========================================================================== Flushes all pending output into the compressed file. The parameter flush is as in the deflate() function. gzflush should be called only when strictly necessary because it can degrade compression. */ int gzflush (file, flush) gzFile file; int flush; { uInt len; int done = 0; gz_stream *s = (gz_stream*)file; if (s == NULL || s->mode != 'w') return Z_STREAM_ERROR; s->stream.avail_in = 0; /* should be zero already anyway */ for (;;) { len = Z_BUFSIZE - s->stream.avail_out; if (len != 0) { if ((uInt)fwrite(s->outbuf, 1, len, s->file) != len) { s->z_err = Z_ERRNO; return Z_ERRNO; } s->stream.next_out = s->outbuf; s->stream.avail_out = Z_BUFSIZE; } if (done) break; s->z_err = deflate(&(s->stream), flush); /* deflate has finished flushing only when it hasn't used up * all the available space in the output buffer: */ done = (s->stream.avail_out != 0 || s->z_err == Z_STREAM_END); if (s->z_err != Z_OK && s->z_err != Z_STREAM_END) break; } fflush(s->file); return s->z_err == Z_STREAM_END ? Z_OK : s->z_err; } /* =========================================================================== Outputs a long in LSB order to the given file */ local void putLong (file, x) FILE *file; uLong x; { int n; for (n = 0; n < 4; n++) { fputc((int)(x & 0xff), file); x >>= 8; } } /* =========================================================================== Reads a long in LSB order from the given gz_stream. Sets */ local uLong getLong (s) gz_stream *s; { uLong x = (uLong)get_byte(s); int c; x += ((uLong)get_byte(s))<<8; x += ((uLong)get_byte(s))<<16; c = get_byte(s); if (c == EOF) s->z_err = Z_DATA_ERROR; x += ((uLong)c)<<24; return x; } /* =========================================================================== Flushes all pending output if necessary, closes the compressed file and deallocates all the (de)compression state. */ int gzclose (file) gzFile file; { int err; gz_stream *s = (gz_stream*)file; if (s == NULL) return Z_STREAM_ERROR; if (s->mode == 'w') { err = gzflush (file, Z_FINISH); if (err != Z_OK) return destroy(file); putLong (s->file, s->crc); putLong (s->file, s->stream.total_in); } return destroy(file); } /* =========================================================================== Returns the error message for the last error which occured on the given compressed file. errnum is set to zlib error number. If an error occured in the file system and not in the compression library, errnum is set to Z_ERRNO and the application may consult errno to get the exact error code. */ const char* gzerror (file, errnum) gzFile file; int *errnum; { char *m; gz_stream *s = (gz_stream*)file; if (s == NULL) { *errnum = Z_STREAM_ERROR; return (const char*)ERR_MSG(Z_STREAM_ERROR); } *errnum = s->z_err; if (*errnum == Z_OK) return (const char*)""; m = (char*)(*errnum == Z_ERRNO ? zstrerror(errno) : s->stream.msg); if (m == NULL || *m == '\0') m = (char*)ERR_MSG(s->z_err); TRYFREE(s->msg); s->msg = (char*)ALLOC(strlen(s->path) + strlen(m) + 3); strcpy(s->msg, s->path); strcat(s->msg, ": "); strcat(s->msg, m); return (const char*)s->msg; } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/infblock.c100644 1007 1403 30501 6363455070 22121 0ustar petrillipetrilli/* infblock.c -- interpret and process block types to last block * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "zutil.h" #include "infblock.h" #include "inftrees.h" #include "infcodes.h" #include "infutil.h" struct inflate_codes_state {int dummy;}; /* for buggy compilers */ /* Table for deflate from PKZIP's appnote.txt. */ local uInt border[] = { /* Order of the bit length code lengths */ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; /* Notes beyond the 1.93a appnote.txt: 1. Distance pointers never point before the beginning of the output stream. 2. Distance pointers can point back across blocks, up to 32k away. 3. There is an implied maximum of 7 bits for the bit length table and 15 bits for the actual data. 4. If only one code exists, then it is encoded using one bit. (Zero would be more efficient, but perhaps a little confusing.) If two codes exist, they are coded using one bit each (0 and 1). 5. There is no way of sending zero distance codes--a dummy must be sent if there are none. (History: a pre 2.0 version of PKZIP would store blocks with no distance codes, but this was discovered to be too harsh a criterion.) Valid only for 1.93a. 2.04c does allow zero distance codes, which is sent as one code of zero bits in length. 6. There are up to 286 literal/length codes. Code 256 represents the end-of-block. Note however that the static length tree defines 288 codes just to fill out the Huffman codes. Codes 286 and 287 cannot be used though, since there is no length base or extra bits defined for them. Similarily, there are up to 30 distance codes. However, static trees define 32 codes (all 5 bits) to fill out the Huffman codes, but the last two had better not show up in the data. 7. Unzip can check dynamic Huffman blocks for complete code sets. The exception is that a single code would not be complete (see #4). 8. The five bits following the block type is really the number of literal codes sent minus 257. 9. Length codes 8,16,16 are interpreted as 13 length codes of 8 bits (1+6+6). Therefore, to output three times the length, you output three codes (1+1+1), whereas to output four times the same length, you only need two codes (1+3). Hmm. 10. In the tree reconstruction algorithm, Code = Code + Increment only if BitLength(i) is not zero. (Pretty obvious.) 11. Correction: 4 Bits: # of Bit Length codes - 4 (4 - 19) 12. Note: length code 284 can represent 227-258, but length code 285 really is 258. The last length deserves its own, short code since it gets used a lot in very redundant files. The length 258 is special since 258 - 3 (the min match length) is 255. 13. The literal/length and distance code bit lengths are read as a single stream of lengths. It is possible (and advantageous) for a repeat code (16, 17, or 18) to go across the boundary between the two sets of lengths. */ void inflate_blocks_reset(s, z, c) inflate_blocks_statef *s; z_streamp z; uLongf *c; { if (s->checkfn != Z_NULL) *c = s->check; if (s->mode == BTREE || s->mode == DTREE) ZFREE(z, s->sub.trees.blens); if (s->mode == CODES) { inflate_codes_free(s->sub.decode.codes, z); inflate_trees_free(s->sub.decode.td, z); inflate_trees_free(s->sub.decode.tl, z); } s->mode = TYPE; s->bitk = 0; s->bitb = 0; s->read = s->write = s->window; if (s->checkfn != Z_NULL) z->adler = s->check = (*s->checkfn)(0L, Z_NULL, 0); Trace((stderr, "inflate: blocks reset\n")); } inflate_blocks_statef *inflate_blocks_new(z, c, w) z_streamp z; check_func c; uInt w; { inflate_blocks_statef *s; if ((s = (inflate_blocks_statef *)ZALLOC (z,1,sizeof(struct inflate_blocks_state))) == Z_NULL) return s; if ((s->window = (Bytef *)ZALLOC(z, 1, w)) == Z_NULL) { ZFREE(z, s); return Z_NULL; } s->end = s->window + w; s->checkfn = c; s->mode = TYPE; Trace((stderr, "inflate: blocks allocated\n")); inflate_blocks_reset(s, z, &s->check); return s; } #ifdef DEBUG extern uInt inflate_hufts; #endif int inflate_blocks(s, z, r) inflate_blocks_statef *s; z_streamp z; int r; { uInt t; /* temporary storage */ uLong b; /* bit buffer */ uInt k; /* bits in bit buffer */ Bytef *p; /* input data pointer */ uInt n; /* bytes available there */ Bytef *q; /* output window write pointer */ uInt m; /* bytes to end of window or read pointer */ /* copy input/output information to locals (UPDATE macro restores) */ LOAD /* process input based on current state */ while (1) switch (s->mode) { case TYPE: NEEDBITS(3) t = (uInt)b & 7; s->last = t & 1; switch (t >> 1) { case 0: /* stored */ Trace((stderr, "inflate: stored block%s\n", s->last ? " (last)" : "")); DUMPBITS(3) t = k & 7; /* go to byte boundary */ DUMPBITS(t) s->mode = LENS; /* get length of stored block */ break; case 1: /* fixed */ Trace((stderr, "inflate: fixed codes block%s\n", s->last ? " (last)" : "")); { uInt bl, bd; inflate_huft *tl, *td; inflate_trees_fixed(&bl, &bd, &tl, &td); s->sub.decode.codes = inflate_codes_new(bl, bd, tl, td, z); if (s->sub.decode.codes == Z_NULL) { r = Z_MEM_ERROR; LEAVE } s->sub.decode.tl = Z_NULL; /* don't try to free these */ s->sub.decode.td = Z_NULL; } DUMPBITS(3) s->mode = CODES; break; case 2: /* dynamic */ Trace((stderr, "inflate: dynamic codes block%s\n", s->last ? " (last)" : "")); DUMPBITS(3) s->mode = TABLE; break; case 3: /* illegal */ DUMPBITS(3) s->mode = BAD; z->msg = (char*)"invalid block type"; r = Z_DATA_ERROR; LEAVE } break; case LENS: NEEDBITS(32) if ((((~b) >> 16) & 0xffff) != (b & 0xffff)) { s->mode = BAD; z->msg = (char*)"invalid stored block lengths"; r = Z_DATA_ERROR; LEAVE } s->sub.left = (uInt)b & 0xffff; b = k = 0; /* dump bits */ Tracev((stderr, "inflate: stored length %u\n", s->sub.left)); s->mode = s->sub.left ? STORED : (s->last ? DRY : TYPE); break; case STORED: if (n == 0) LEAVE NEEDOUT t = s->sub.left; if (t > n) t = n; if (t > m) t = m; zmemcpy(q, p, t); p += t; n -= t; q += t; m -= t; if ((s->sub.left -= t) != 0) break; Tracev((stderr, "inflate: stored end, %lu total out\n", z->total_out + (q >= s->read ? q - s->read : (s->end - s->read) + (q - s->window)))); s->mode = s->last ? DRY : TYPE; break; case TABLE: NEEDBITS(14) s->sub.trees.table = t = (uInt)b & 0x3fff; #ifndef PKZIP_BUG_WORKAROUND if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29) { s->mode = BAD; z->msg = (char*)"too many length or distance symbols"; r = Z_DATA_ERROR; LEAVE } #endif t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f); if (t < 19) t = 19; if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL) { r = Z_MEM_ERROR; LEAVE } DUMPBITS(14) s->sub.trees.index = 0; Tracev((stderr, "inflate: table sizes ok\n")); s->mode = BTREE; case BTREE: while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10)) { NEEDBITS(3) s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7; DUMPBITS(3) } while (s->sub.trees.index < 19) s->sub.trees.blens[border[s->sub.trees.index++]] = 0; s->sub.trees.bb = 7; t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb, &s->sub.trees.tb, z); if (t != Z_OK) { r = t; if (r == Z_DATA_ERROR) s->mode = BAD; LEAVE } s->sub.trees.index = 0; Tracev((stderr, "inflate: bits tree ok\n")); s->mode = DTREE; case DTREE: while (t = s->sub.trees.table, s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f)) { inflate_huft *h; uInt i, j, c; t = s->sub.trees.bb; NEEDBITS(t) h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]); t = h->word.what.Bits; c = h->more.Base; if (c < 16) { DUMPBITS(t) s->sub.trees.blens[s->sub.trees.index++] = c; } else /* c == 16..18 */ { i = c == 18 ? 7 : c - 14; j = c == 18 ? 11 : 3; NEEDBITS(t + i) DUMPBITS(t) j += (uInt)b & inflate_mask[i]; DUMPBITS(i) i = s->sub.trees.index; t = s->sub.trees.table; if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) || (c == 16 && i < 1)) { s->mode = BAD; z->msg = (char*)"invalid bit length repeat"; r = Z_DATA_ERROR; LEAVE } c = c == 16 ? s->sub.trees.blens[i - 1] : 0; do { s->sub.trees.blens[i++] = c; } while (--j); s->sub.trees.index = i; } } inflate_trees_free(s->sub.trees.tb, z); s->sub.trees.tb = Z_NULL; { uInt bl, bd; inflate_huft *tl, *td; inflate_codes_statef *c; bl = 9; /* must be <= 9 for lookahead assumptions */ bd = 6; /* must be <= 9 for lookahead assumptions */ t = s->sub.trees.table; #ifdef DEBUG inflate_hufts = 0; #endif t = inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), s->sub.trees.blens, &bl, &bd, &tl, &td, z); if (t != Z_OK) { if (t == (uInt)Z_DATA_ERROR) s->mode = BAD; r = t; LEAVE } Tracev((stderr, "inflate: trees ok, %d * %d bytes used\n", inflate_hufts, sizeof(inflate_huft))); if ((c = inflate_codes_new(bl, bd, tl, td, z)) == Z_NULL) { inflate_trees_free(td, z); inflate_trees_free(tl, z); r = Z_MEM_ERROR; LEAVE } ZFREE(z, s->sub.trees.blens); s->sub.decode.codes = c; s->sub.decode.tl = tl; s->sub.decode.td = td; } s->mode = CODES; case CODES: UPDATE if ((r = inflate_codes(s, z, r)) != Z_STREAM_END) return inflate_flush(s, z, r); r = Z_OK; inflate_codes_free(s->sub.decode.codes, z); inflate_trees_free(s->sub.decode.td, z); inflate_trees_free(s->sub.decode.tl, z); LOAD Tracev((stderr, "inflate: codes end, %lu total out\n", z->total_out + (q >= s->read ? q - s->read : (s->end - s->read) + (q - s->window)))); if (!s->last) { s->mode = TYPE; break; } if (k > 7) /* return unused byte, if any */ { Assert(k < 16, "inflate_codes grabbed too many bytes") k -= 8; n++; p--; /* can always return one */ } s->mode = DRY; case DRY: FLUSH if (s->read != s->write) LEAVE s->mode = DONE; case DONE: r = Z_STREAM_END; LEAVE case BAD: r = Z_DATA_ERROR; LEAVE default: r = Z_STREAM_ERROR; LEAVE } } int inflate_blocks_free(s, z, c) inflate_blocks_statef *s; z_streamp z; uLongf *c; { inflate_blocks_reset(s, z, c); ZFREE(z, s->window); ZFREE(z, s); Trace((stderr, "inflate: blocks freed\n")); return Z_OK; } void inflate_set_dictionary(s, d, n) inflate_blocks_statef *s; const Bytef *d; uInt n; { zmemcpy((charf *)s->window, d, n); s->read = s->write = s->window + n; } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/infblock.h100644 1007 1403 2257 6363455070 22115 0ustar petrillipetrilli/* infblock.h -- header to use infblock.c * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ struct inflate_blocks_state; typedef struct inflate_blocks_state FAR inflate_blocks_statef; extern inflate_blocks_statef * inflate_blocks_new OF(( z_streamp z, check_func c, /* check function */ uInt w)); /* window size */ extern int inflate_blocks OF(( inflate_blocks_statef *, z_streamp , int)); /* initial return code */ extern void inflate_blocks_reset OF(( inflate_blocks_statef *, z_streamp , uLongf *)); /* check value on output */ extern int inflate_blocks_free OF(( inflate_blocks_statef *, z_streamp , uLongf *)); /* check value on output */ extern void inflate_set_dictionary OF(( inflate_blocks_statef *s, const Bytef *d, /* dictionary */ uInt n)); /* dictionary length */ Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/infcodes.c100644 1007 1403 16463 6363455071 22140 0ustar petrillipetrilli/* infcodes.c -- process literals and length/distance pairs * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "zutil.h" #include "inftrees.h" #include "infblock.h" #include "infcodes.h" #include "infutil.h" #include "inffast.h" /* simplify the use of the inflate_huft type with some defines */ #define base more.Base #define next more.Next #define exop word.what.Exop #define bits word.what.Bits /* inflate codes private state */ struct inflate_codes_state { /* mode */ enum { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */ START, /* x: set up for LEN */ LEN, /* i: get length/literal/eob next */ LENEXT, /* i: getting length extra (have base) */ DIST, /* i: get distance next */ DISTEXT, /* i: getting distance extra */ COPY, /* o: copying bytes in window, waiting for space */ LIT, /* o: got literal, waiting for output space */ WASH, /* o: got eob, possibly still output waiting */ END, /* x: got eob and all data flushed */ BADCODE} /* x: got error */ mode; /* current inflate_codes mode */ /* mode dependent information */ uInt len; union { struct { inflate_huft *tree; /* pointer into tree */ uInt need; /* bits needed */ } code; /* if LEN or DIST, where in tree */ uInt lit; /* if LIT, literal */ struct { uInt get; /* bits to get for extra */ uInt dist; /* distance back to copy from */ } copy; /* if EXT or COPY, where and how much */ } sub; /* submode */ /* mode independent information */ Byte lbits; /* ltree bits decoded per branch */ Byte dbits; /* dtree bits decoder per branch */ inflate_huft *ltree; /* literal/length/eob tree */ inflate_huft *dtree; /* distance tree */ }; inflate_codes_statef *inflate_codes_new(bl, bd, tl, td, z) uInt bl, bd; inflate_huft *tl; inflate_huft *td; /* need separate declaration for Borland C++ */ z_streamp z; { inflate_codes_statef *c; if ((c = (inflate_codes_statef *) ZALLOC(z,1,sizeof(struct inflate_codes_state))) != Z_NULL) { c->mode = START; c->lbits = (Byte)bl; c->dbits = (Byte)bd; c->ltree = tl; c->dtree = td; Tracev((stderr, "inflate: codes new\n")); } return c; } int inflate_codes(s, z, r) inflate_blocks_statef *s; z_streamp z; int r; { uInt j; /* temporary storage */ inflate_huft *t; /* temporary pointer */ uInt e; /* extra bits or operation */ uLong b; /* bit buffer */ uInt k; /* bits in bit buffer */ Bytef *p; /* input data pointer */ uInt n; /* bytes available there */ Bytef *q; /* output window write pointer */ uInt m; /* bytes to end of window or read pointer */ Bytef *f; /* pointer to copy strings from */ inflate_codes_statef *c = s->sub.decode.codes; /* codes state */ /* copy input/output information to locals (UPDATE macro restores) */ LOAD /* process input and output based on current state */ while (1) switch (c->mode) { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */ case START: /* x: set up for LEN */ #ifndef SLOW if (m >= 258 && n >= 10) { UPDATE r = inflate_fast(c->lbits, c->dbits, c->ltree, c->dtree, s, z); LOAD if (r != Z_OK) { c->mode = r == Z_STREAM_END ? WASH : BADCODE; break; } } #endif /* !SLOW */ c->sub.code.need = c->lbits; c->sub.code.tree = c->ltree; c->mode = LEN; case LEN: /* i: get length/literal/eob next */ j = c->sub.code.need; NEEDBITS(j) t = c->sub.code.tree + ((uInt)b & inflate_mask[j]); DUMPBITS(t->bits) e = (uInt)(t->exop); if (e == 0) /* literal */ { c->sub.lit = t->base; Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? "inflate: literal '%c'\n" : "inflate: literal 0x%02x\n", t->base)); c->mode = LIT; break; } if (e & 16) /* length */ { c->sub.copy.get = e & 15; c->len = t->base; c->mode = LENEXT; break; } if ((e & 64) == 0) /* next table */ { c->sub.code.need = e; c->sub.code.tree = t->next; break; } if (e & 32) /* end of block */ { Tracevv((stderr, "inflate: end of block\n")); c->mode = WASH; break; } c->mode = BADCODE; /* invalid code */ z->msg = (char*)"invalid literal/length code"; r = Z_DATA_ERROR; LEAVE case LENEXT: /* i: getting length extra (have base) */ j = c->sub.copy.get; NEEDBITS(j) c->len += (uInt)b & inflate_mask[j]; DUMPBITS(j) c->sub.code.need = c->dbits; c->sub.code.tree = c->dtree; Tracevv((stderr, "inflate: length %u\n", c->len)); c->mode = DIST; case DIST: /* i: get distance next */ j = c->sub.code.need; NEEDBITS(j) t = c->sub.code.tree + ((uInt)b & inflate_mask[j]); DUMPBITS(t->bits) e = (uInt)(t->exop); if (e & 16) /* distance */ { c->sub.copy.get = e & 15; c->sub.copy.dist = t->base; c->mode = DISTEXT; break; } if ((e & 64) == 0) /* next table */ { c->sub.code.need = e; c->sub.code.tree = t->next; break; } c->mode = BADCODE; /* invalid code */ z->msg = (char*)"invalid distance code"; r = Z_DATA_ERROR; LEAVE case DISTEXT: /* i: getting distance extra */ j = c->sub.copy.get; NEEDBITS(j) c->sub.copy.dist += (uInt)b & inflate_mask[j]; DUMPBITS(j) Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist)); c->mode = COPY; case COPY: /* o: copying bytes in window, waiting for space */ #ifndef __TURBOC__ /* Turbo C bug for following expression */ f = (uInt)(q - s->window) < c->sub.copy.dist ? s->end - (c->sub.copy.dist - (q - s->window)) : q - c->sub.copy.dist; #else f = q - c->sub.copy.dist; if ((uInt)(q - s->window) < c->sub.copy.dist) f = s->end - (c->sub.copy.dist - (uInt)(q - s->window)); #endif while (c->len) { NEEDOUT OUTBYTE(*f++) if (f == s->end) f = s->window; c->len--; } c->mode = START; break; case LIT: /* o: got literal, waiting for output space */ NEEDOUT OUTBYTE(c->sub.lit) c->mode = START; break; case WASH: /* o: got eob, possibly more output */ FLUSH if (s->read != s->write) LEAVE c->mode = END; case END: r = Z_STREAM_END; LEAVE case BADCODE: /* x: got error */ r = Z_DATA_ERROR; LEAVE default: r = Z_STREAM_ERROR; LEAVE } } void inflate_codes_free(c, z) inflate_codes_statef *c; z_streamp z; { ZFREE(z, c); Tracev((stderr, "inflate: codes free\n")); } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/infcodes.h100644 1007 1403 1341 6363455072 22113 0ustar petrillipetrilli/* infcodes.h -- header to use infcodes.c * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ struct inflate_codes_state; typedef struct inflate_codes_state FAR inflate_codes_statef; extern inflate_codes_statef *inflate_codes_new OF(( uInt, uInt, inflate_huft *, inflate_huft *, z_streamp )); extern int inflate_codes OF(( inflate_blocks_statef *, z_streamp , int)); extern void inflate_codes_free OF(( inflate_codes_statef *, z_streamp )); Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/inffast.c100644 1007 1403 12747 6363455073 22003 0ustar petrillipetrilli/* inffast.c -- process literals and length/distance pairs fast * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "zutil.h" #include "inftrees.h" #include "infblock.h" #include "infcodes.h" #include "infutil.h" #include "inffast.h" struct inflate_codes_state {int dummy;}; /* for buggy compilers */ /* simplify the use of the inflate_huft type with some defines */ #define base more.Base #define next more.Next #define exop word.what.Exop #define bits word.what.Bits /* macros for bit input with no checking and for returning unused bytes */ #define GRABBITS(j) {while(k<(j)){b|=((uLong)NEXTBYTE)<>3);p-=c;k&=7;} /* Called with number of bytes left to write in window at least 258 (the maximum string length) and number of input bytes available at least ten. The ten bytes are six bytes for the longest length/ distance pair plus four bytes for overloading the bit buffer. */ int inflate_fast(bl, bd, tl, td, s, z) uInt bl, bd; inflate_huft *tl; inflate_huft *td; /* need separate declaration for Borland C++ */ inflate_blocks_statef *s; z_streamp z; { inflate_huft *t; /* temporary pointer */ uInt e; /* extra bits or operation */ uLong b; /* bit buffer */ uInt k; /* bits in bit buffer */ Bytef *p; /* input data pointer */ uInt n; /* bytes available there */ Bytef *q; /* output window write pointer */ uInt m; /* bytes to end of window or read pointer */ uInt ml; /* mask for literal/length tree */ uInt md; /* mask for distance tree */ uInt c; /* bytes to copy */ uInt d; /* distance back to copy from */ Bytef *r; /* copy source pointer */ /* load input, output, bit values */ LOAD /* initialize masks */ ml = inflate_mask[bl]; md = inflate_mask[bd]; /* do until not enough input or output space for fast loop */ do { /* assume called with m >= 258 && n >= 10 */ /* get literal/length code */ GRABBITS(20) /* max bits for literal/length code */ if ((e = (t = tl + ((uInt)b & ml))->exop) == 0) { DUMPBITS(t->bits) Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? "inflate: * literal '%c'\n" : "inflate: * literal 0x%02x\n", t->base)); *q++ = (Byte)t->base; m--; continue; } do { DUMPBITS(t->bits) if (e & 16) { /* get extra bits for length */ e &= 15; c = t->base + ((uInt)b & inflate_mask[e]); DUMPBITS(e) Tracevv((stderr, "inflate: * length %u\n", c)); /* decode distance base of block to copy */ GRABBITS(15); /* max bits for distance code */ e = (t = td + ((uInt)b & md))->exop; do { DUMPBITS(t->bits) if (e & 16) { /* get extra bits to add to distance base */ e &= 15; GRABBITS(e) /* get extra bits (up to 13) */ d = t->base + ((uInt)b & inflate_mask[e]); DUMPBITS(e) Tracevv((stderr, "inflate: * distance %u\n", d)); /* do the copy */ m -= c; if ((uInt)(q - s->window) >= d) /* offset before dest */ { /* just copy */ r = q - d; *q++ = *r++; c--; /* minimum count is three, */ *q++ = *r++; c--; /* so unroll loop a little */ } else /* else offset after destination */ { e = d - (uInt)(q - s->window); /* bytes from offset to end */ r = s->end - e; /* pointer to offset */ if (c > e) /* if source crosses, */ { c -= e; /* copy to end of window */ do { *q++ = *r++; } while (--e); r = s->window; /* copy rest from start of window */ } } do { /* copy all or what's left */ *q++ = *r++; } while (--c); break; } else if ((e & 64) == 0) e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop; else { z->msg = (char*)"invalid distance code"; UNGRAB UPDATE return Z_DATA_ERROR; } } while (1); break; } if ((e & 64) == 0) { if ((e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop) == 0) { DUMPBITS(t->bits) Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? "inflate: * literal '%c'\n" : "inflate: * literal 0x%02x\n", t->base)); *q++ = (Byte)t->base; m--; break; } } else if (e & 32) { Tracevv((stderr, "inflate: * end of block\n")); UNGRAB UPDATE return Z_STREAM_END; } else { z->msg = (char*)"invalid literal/length code"; UNGRAB UPDATE return Z_DATA_ERROR; } } while (1); } while (m >= 258 && n >= 10); /* not enough input or output--restore pointers and return */ UNGRAB UPDATE return Z_OK; } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/inffast.h100644 1007 1403 750 6363455073 21737 0ustar petrillipetrilli/* inffast.h -- header to use inffast.c * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ extern int inflate_fast OF(( uInt, uInt, inflate_huft *, inflate_huft *, inflate_blocks_statef *, z_streamp )); Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/inflate.c100644 1007 1403 21112 6363455074 21756 0ustar petrillipetrilli/* inflate.c -- zlib interface to inflate modules * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "zutil.h" #include "infblock.h" struct inflate_blocks_state {int dummy;}; /* for buggy compilers */ /* inflate private state */ struct internal_state { /* mode */ enum { METHOD, /* waiting for method byte */ FLAG, /* waiting for flag byte */ DICT4, /* four dictionary check bytes to go */ DICT3, /* three dictionary check bytes to go */ DICT2, /* two dictionary check bytes to go */ DICT1, /* one dictionary check byte to go */ DICT0, /* waiting for inflateSetDictionary */ BLOCKS, /* decompressing blocks */ CHECK4, /* four check bytes to go */ CHECK3, /* three check bytes to go */ CHECK2, /* two check bytes to go */ CHECK1, /* one check byte to go */ DONE, /* finished check, done */ BAD} /* got an error--stay here */ mode; /* current inflate mode */ /* mode dependent information */ union { uInt method; /* if FLAGS, method byte */ struct { uLong was; /* computed check value */ uLong need; /* stream check value */ } check; /* if CHECK, check values to compare */ uInt marker; /* if BAD, inflateSync's marker bytes count */ } sub; /* submode */ /* mode independent information */ int nowrap; /* flag for no wrapper */ uInt wbits; /* log2(window size) (8..15, defaults to 15) */ inflate_blocks_statef *blocks; /* current inflate_blocks state */ }; int inflateReset(z) z_streamp z; { uLong c; if (z == Z_NULL || z->state == Z_NULL) return Z_STREAM_ERROR; z->total_in = z->total_out = 0; z->msg = Z_NULL; z->state->mode = z->state->nowrap ? BLOCKS : METHOD; inflate_blocks_reset(z->state->blocks, z, &c); Trace((stderr, "inflate: reset\n")); return Z_OK; } int inflateEnd(z) z_streamp z; { uLong c; if (z == Z_NULL || z->state == Z_NULL || z->zfree == Z_NULL) return Z_STREAM_ERROR; if (z->state->blocks != Z_NULL) inflate_blocks_free(z->state->blocks, z, &c); ZFREE(z, z->state); z->state = Z_NULL; Trace((stderr, "inflate: end\n")); return Z_OK; } int inflateInit2_(z, w, version, stream_size) z_streamp z; int w; const char *version; int stream_size; { if (version == Z_NULL || version[0] != ZLIB_VERSION[0] || stream_size != sizeof(z_stream)) return Z_VERSION_ERROR; /* initialize state */ if (z == Z_NULL) return Z_STREAM_ERROR; z->msg = Z_NULL; if (z->zalloc == Z_NULL) { z->zalloc = zcalloc; z->opaque = (voidpf)0; } if (z->zfree == Z_NULL) z->zfree = zcfree; if ((z->state = (struct internal_state FAR *) ZALLOC(z,1,sizeof(struct internal_state))) == Z_NULL) return Z_MEM_ERROR; z->state->blocks = Z_NULL; /* handle undocumented nowrap option (no zlib header or check) */ z->state->nowrap = 0; if (w < 0) { w = - w; z->state->nowrap = 1; } /* set window size */ if (w < 8 || w > 15) { inflateEnd(z); return Z_STREAM_ERROR; } z->state->wbits = (uInt)w; /* create inflate_blocks state */ if ((z->state->blocks = inflate_blocks_new(z, z->state->nowrap ? Z_NULL : adler32, (uInt)1 << w)) == Z_NULL) { inflateEnd(z); return Z_MEM_ERROR; } Trace((stderr, "inflate: allocated\n")); /* reset state */ inflateReset(z); return Z_OK; } int inflateInit_(z, version, stream_size) z_streamp z; const char *version; int stream_size; { return inflateInit2_(z, DEF_WBITS, version, stream_size); } #define NEEDBYTE {if(z->avail_in==0)return r;r=Z_OK;} #define NEXTBYTE (z->avail_in--,z->total_in++,*z->next_in++) int inflate(z, f) z_streamp z; int f; { int r; uInt b; if (z == Z_NULL || z->state == Z_NULL || z->next_in == Z_NULL || f < 0) return Z_STREAM_ERROR; r = Z_BUF_ERROR; while (1) switch (z->state->mode) { case METHOD: NEEDBYTE if (((z->state->sub.method = NEXTBYTE) & 0xf) != Z_DEFLATED) { z->state->mode = BAD; z->msg = (char*)"unknown compression method"; z->state->sub.marker = 5; /* can't try inflateSync */ break; } if ((z->state->sub.method >> 4) + 8 > z->state->wbits) { z->state->mode = BAD; z->msg = (char*)"invalid window size"; z->state->sub.marker = 5; /* can't try inflateSync */ break; } z->state->mode = FLAG; case FLAG: NEEDBYTE b = NEXTBYTE; if (((z->state->sub.method << 8) + b) % 31) { z->state->mode = BAD; z->msg = (char*)"incorrect header check"; z->state->sub.marker = 5; /* can't try inflateSync */ break; } Trace((stderr, "inflate: zlib header ok\n")); if (!(b & PRESET_DICT)) { z->state->mode = BLOCKS; break; } z->state->mode = DICT4; case DICT4: NEEDBYTE z->state->sub.check.need = (uLong)NEXTBYTE << 24; z->state->mode = DICT3; case DICT3: NEEDBYTE z->state->sub.check.need += (uLong)NEXTBYTE << 16; z->state->mode = DICT2; case DICT2: NEEDBYTE z->state->sub.check.need += (uLong)NEXTBYTE << 8; z->state->mode = DICT1; case DICT1: NEEDBYTE z->state->sub.check.need += (uLong)NEXTBYTE; z->adler = z->state->sub.check.need; z->state->mode = DICT0; return Z_NEED_DICT; case DICT0: z->state->mode = BAD; z->msg = (char*)"need dictionary"; z->state->sub.marker = 0; /* can try inflateSync */ return Z_STREAM_ERROR; case BLOCKS: r = inflate_blocks(z->state->blocks, z, r); if (r == Z_DATA_ERROR) { z->state->mode = BAD; z->state->sub.marker = 0; /* can try inflateSync */ break; } if (r != Z_STREAM_END) return r; r = Z_OK; inflate_blocks_reset(z->state->blocks, z, &z->state->sub.check.was); if (z->state->nowrap) { z->state->mode = DONE; break; } z->state->mode = CHECK4; case CHECK4: NEEDBYTE z->state->sub.check.need = (uLong)NEXTBYTE << 24; z->state->mode = CHECK3; case CHECK3: NEEDBYTE z->state->sub.check.need += (uLong)NEXTBYTE << 16; z->state->mode = CHECK2; case CHECK2: NEEDBYTE z->state->sub.check.need += (uLong)NEXTBYTE << 8; z->state->mode = CHECK1; case CHECK1: NEEDBYTE z->state->sub.check.need += (uLong)NEXTBYTE; if (z->state->sub.check.was != z->state->sub.check.need) { z->state->mode = BAD; z->msg = (char*)"incorrect data check"; z->state->sub.marker = 5; /* can't try inflateSync */ break; } Trace((stderr, "inflate: zlib check ok\n")); z->state->mode = DONE; case DONE: return Z_STREAM_END; case BAD: return Z_DATA_ERROR; default: return Z_STREAM_ERROR; } } int inflateSetDictionary(z, dictionary, dictLength) z_streamp z; const Bytef *dictionary; uInt dictLength; { uInt length = dictLength; if (z == Z_NULL || z->state == Z_NULL || z->state->mode != DICT0) return Z_STREAM_ERROR; if (adler32(1L, dictionary, dictLength) != z->adler) return Z_DATA_ERROR; z->adler = 1L; if (length >= ((uInt)1<state->wbits)) { length = (1<state->wbits)-1; dictionary += dictLength - length; } inflate_set_dictionary(z->state->blocks, dictionary, length); z->state->mode = BLOCKS; return Z_OK; } int inflateSync(z) z_streamp z; { uInt n; /* number of bytes to look at */ Bytef *p; /* pointer to bytes */ uInt m; /* number of marker bytes found in a row */ uLong r, w; /* temporaries to save total_in and total_out */ /* set up */ if (z == Z_NULL || z->state == Z_NULL) return Z_STREAM_ERROR; if (z->state->mode != BAD) { z->state->mode = BAD; z->state->sub.marker = 0; } if ((n = z->avail_in) == 0) return Z_BUF_ERROR; p = z->next_in; m = z->state->sub.marker; /* search */ while (n && m < 4) { if (*p == (Byte)(m < 2 ? 0 : 0xff)) m++; else if (*p) m = 0; else m = 4 - m; p++, n--; } /* restore */ z->total_in += p - z->next_in; z->next_in = p; z->avail_in = n; z->state->sub.marker = m; /* return no joy or set up to restart on a new block */ if (m != 4) return Z_DATA_ERROR; r = z->total_in; w = z->total_out; inflateReset(z); z->total_in = r; z->total_out = w; z->state->mode = BLOCKS; return Z_OK; } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/inftrees.c100644 1007 1403 37570 6363455074 22172 0ustar petrillipetrilli/* inftrees.c -- generate Huffman trees for efficient decoding * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "zutil.h" #include "inftrees.h" char inflate_copyright[] = " inflate 1.0.4 Copyright 1995-1996 Mark Adler "; /* If you use the zlib library in a product, an acknowledgment is welcome in the documentation of your product. If for some reason you cannot include such an acknowledgment, I would appreciate that you keep this copyright string in the executable of your product. */ struct internal_state {int dummy;}; /* for buggy compilers */ /* simplify the use of the inflate_huft type with some defines */ #define base more.Base #define next more.Next #define exop word.what.Exop #define bits word.what.Bits local int huft_build OF(( uIntf *, /* code lengths in bits */ uInt, /* number of codes */ uInt, /* number of "simple" codes */ uIntf *, /* list of base values for non-simple codes */ uIntf *, /* list of extra bits for non-simple codes */ inflate_huft * FAR*,/* result: starting table */ uIntf *, /* maximum lookup bits (returns actual) */ z_streamp )); /* for zalloc function */ local voidpf falloc OF(( voidpf, /* opaque pointer (not used) */ uInt, /* number of items */ uInt)); /* size of item */ /* Tables for deflate from PKZIP's appnote.txt. */ local uInt cplens[31] = { /* Copy lengths for literal codes 257..285 */ 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; /* actually lengths - 2; also see note #13 above about 258 */ local uInt cplext[31] = { /* Extra bits for literal codes 257..285 */ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 192, 192}; /* 192==invalid */ local uInt cpdist[30] = { /* Copy offsets for distance codes 0..29 */ 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577}; local uInt cpdext[30] = { /* Extra bits for distance codes */ 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13}; /* Huffman code decoding is performed using a multi-level table lookup. The fastest way to decode is to simply build a lookup table whose size is determined by the longest code. However, the time it takes to build this table can also be a factor if the data being decoded is not very long. The most common codes are necessarily the shortest codes, so those codes dominate the decoding time, and hence the speed. The idea is you can have a shorter table that decodes the shorter, more probable codes, and then point to subsidiary tables for the longer codes. The time it costs to decode the longer codes is then traded against the time it takes to make longer tables. This results of this trade are in the variables lbits and dbits below. lbits is the number of bits the first level table for literal/ length codes can decode in one step, and dbits is the same thing for the distance codes. Subsequent tables are also less than or equal to those sizes. These values may be adjusted either when all of the codes are shorter than that, in which case the longest code length in bits is used, or when the shortest code is *longer* than the requested table size, in which case the length of the shortest code in bits is used. There are two different values for the two tables, since they code a different number of possibilities each. The literal/length table codes 286 possible values, or in a flat code, a little over eight bits. The distance table codes 30 possible values, or a little less than five bits, flat. The optimum values for speed end up being about one bit more than those, so lbits is 8+1 and dbits is 5+1. The optimum values may differ though from machine to machine, and possibly even between compilers. Your mileage may vary. */ /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */ #define BMAX 15 /* maximum bit length of any code */ #define N_MAX 288 /* maximum number of codes in any set */ #ifdef DEBUG uInt inflate_hufts; #endif local int huft_build(b, n, s, d, e, t, m, zs) uIntf *b; /* code lengths in bits (all assumed <= BMAX) */ uInt n; /* number of codes (assumed <= N_MAX) */ uInt s; /* number of simple-valued codes (0..s-1) */ uIntf *d; /* list of base values for non-simple codes */ uIntf *e; /* list of extra bits for non-simple codes */ inflate_huft * FAR *t; /* result: starting table */ uIntf *m; /* maximum lookup bits, returns actual */ z_streamp zs; /* for zalloc function */ /* Given a list of code lengths and a maximum table size, make a set of tables to decode that set of codes. Return Z_OK on success, Z_BUF_ERROR if the given code set is incomplete (the tables are still built in this case), Z_DATA_ERROR if the input is invalid (all zero length codes or an over-subscribed set of lengths), or Z_MEM_ERROR if not enough memory. */ { uInt a; /* counter for codes of length k */ uInt c[BMAX+1]; /* bit length count table */ uInt f; /* i repeats in table every f entries */ int g; /* maximum code length */ int h; /* table level */ register uInt i; /* counter, current code */ register uInt j; /* counter */ register int k; /* number of bits in current code */ int l; /* bits per table (returned in m) */ register uIntf *p; /* pointer into c[], b[], or v[] */ inflate_huft *q; /* points to current table */ struct inflate_huft_s r; /* table entry for structure assignment */ inflate_huft *u[BMAX]; /* table stack */ uInt v[N_MAX]; /* values in order of bit length */ register int w; /* bits before this table == (l * h) */ uInt x[BMAX+1]; /* bit offsets, then code stack */ uIntf *xp; /* pointer into x */ int y; /* number of dummy codes added */ uInt z; /* number of entries in current table */ /* Generate counts for each bit length */ p = c; #define C0 *p++ = 0; #define C2 C0 C0 C0 C0 #define C4 C2 C2 C2 C2 C4 /* clear c[]--assume BMAX+1 is 16 */ p = b; i = n; do { c[*p++]++; /* assume all entries <= BMAX */ } while (--i); if (c[0] == n) /* null input--all zero length codes */ { *t = (inflate_huft *)Z_NULL; *m = 0; return Z_OK; } /* Find minimum and maximum length, bound *m by those */ l = *m; for (j = 1; j <= BMAX; j++) if (c[j]) break; k = j; /* minimum code length */ if ((uInt)l < j) l = j; for (i = BMAX; i; i--) if (c[i]) break; g = i; /* maximum code length */ if ((uInt)l > i) l = i; *m = l; /* Adjust last length count to fill out codes, if needed */ for (y = 1 << j; j < i; j++, y <<= 1) if ((y -= c[j]) < 0) return Z_DATA_ERROR; if ((y -= c[i]) < 0) return Z_DATA_ERROR; c[i] += y; /* Generate starting offsets into the value table for each length */ x[1] = j = 0; p = c + 1; xp = x + 2; while (--i) { /* note that i == g from above */ *xp++ = (j += *p++); } /* Make a table of values in order of bit lengths */ p = b; i = 0; do { if ((j = *p++) != 0) v[x[j]++] = i; } while (++i < n); /* Generate the Huffman codes and for each, make the table entries */ x[0] = i = 0; /* first Huffman code is zero */ p = v; /* grab values in bit order */ h = -1; /* no tables yet--level -1 */ w = -l; /* bits decoded == (l * h) */ u[0] = (inflate_huft *)Z_NULL; /* just to keep compilers happy */ q = (inflate_huft *)Z_NULL; /* ditto */ z = 0; /* ditto */ /* go through the bit lengths (k already is bits in shortest code) */ for (; k <= g; k++) { a = c[k]; while (a--) { /* here i is the Huffman code of length k bits for value *p */ /* make tables up to required level */ while (k > w + l) { h++; w += l; /* previous table always l bits */ /* compute minimum size table less than or equal to l bits */ z = g - w; z = z > (uInt)l ? l : z; /* table size upper limit */ if ((f = 1 << (j = k - w)) > a + 1) /* try a k-w bit table */ { /* too few codes for k-w bit table */ f -= a + 1; /* deduct codes from patterns left */ xp = c + k; if (j < z) while (++j < z) /* try smaller tables up to z bits */ { if ((f <<= 1) <= *++xp) break; /* enough codes to use up j bits */ f -= *xp; /* else deduct codes from patterns */ } } z = 1 << j; /* table entries for j-bit table */ /* allocate and link in new table */ if ((q = (inflate_huft *)ZALLOC (zs,z + 1,sizeof(inflate_huft))) == Z_NULL) { if (h) inflate_trees_free(u[0], zs); return Z_MEM_ERROR; /* not enough memory */ } #ifdef DEBUG inflate_hufts += z + 1; #endif *t = q + 1; /* link to list for huft_free() */ *(t = &(q->next)) = Z_NULL; u[h] = ++q; /* table starts after link */ /* connect to last table, if there is one */ if (h) { x[h] = i; /* save pattern for backing up */ r.bits = (Byte)l; /* bits to dump before this table */ r.exop = (Byte)j; /* bits in this table */ r.next = q; /* pointer to this table */ j = i >> (w - l); /* (get around Turbo C bug) */ u[h-1][j] = r; /* connect to last table */ } } /* set up table entry in r */ r.bits = (Byte)(k - w); if (p >= v + n) r.exop = 128 + 64; /* out of values--invalid code */ else if (*p < s) { r.exop = (Byte)(*p < 256 ? 0 : 32 + 64); /* 256 is end-of-block */ r.base = *p++; /* simple code is just the value */ } else { r.exop = (Byte)(e[*p - s] + 16 + 64);/* non-simple--look up in lists */ r.base = d[*p++ - s]; } /* fill code-like entries with r */ f = 1 << (k - w); for (j = i >> w; j < z; j += f) q[j] = r; /* backwards increment the k-bit code i */ for (j = 1 << (k - 1); i & j; j >>= 1) i ^= j; i ^= j; /* backup over finished tables */ while ((i & ((1 << w) - 1)) != x[h]) { h--; /* don't need to update q */ w -= l; } } } /* Return Z_BUF_ERROR if we were given an incomplete table */ return y != 0 && g != 1 ? Z_BUF_ERROR : Z_OK; } int inflate_trees_bits(c, bb, tb, z) uIntf *c; /* 19 code lengths */ uIntf *bb; /* bits tree desired/actual depth */ inflate_huft * FAR *tb; /* bits tree result */ z_streamp z; /* for zfree function */ { int r; r = huft_build(c, 19, 19, (uIntf*)Z_NULL, (uIntf*)Z_NULL, tb, bb, z); if (r == Z_DATA_ERROR) z->msg = (char*)"oversubscribed dynamic bit lengths tree"; else if (r == Z_BUF_ERROR) { inflate_trees_free(*tb, z); z->msg = (char*)"incomplete dynamic bit lengths tree"; r = Z_DATA_ERROR; } return r; } int inflate_trees_dynamic(nl, nd, c, bl, bd, tl, td, z) uInt nl; /* number of literal/length codes */ uInt nd; /* number of distance codes */ uIntf *c; /* that many (total) code lengths */ uIntf *bl; /* literal desired/actual bit depth */ uIntf *bd; /* distance desired/actual bit depth */ inflate_huft * FAR *tl; /* literal/length tree result */ inflate_huft * FAR *td; /* distance tree result */ z_streamp z; /* for zfree function */ { int r; /* build literal/length tree */ if ((r = huft_build(c, nl, 257, cplens, cplext, tl, bl, z)) != Z_OK) { if (r == Z_DATA_ERROR) z->msg = (char*)"oversubscribed literal/length tree"; else if (r == Z_BUF_ERROR) { inflate_trees_free(*tl, z); z->msg = (char*)"incomplete literal/length tree"; r = Z_DATA_ERROR; } return r; } /* build distance tree */ if ((r = huft_build(c + nl, nd, 0, cpdist, cpdext, td, bd, z)) != Z_OK) { if (r == Z_DATA_ERROR) z->msg = (char*)"oversubscribed literal/length tree"; else if (r == Z_BUF_ERROR) { #ifdef PKZIP_BUG_WORKAROUND r = Z_OK; } #else inflate_trees_free(*td, z); z->msg = (char*)"incomplete literal/length tree"; r = Z_DATA_ERROR; } inflate_trees_free(*tl, z); return r; #endif } /* done */ return Z_OK; } /* build fixed tables only once--keep them here */ local int fixed_built = 0; #define FIXEDH 530 /* number of hufts used by fixed tables */ local inflate_huft fixed_mem[FIXEDH]; local uInt fixed_bl; local uInt fixed_bd; local inflate_huft *fixed_tl; local inflate_huft *fixed_td; local voidpf falloc(q, n, s) voidpf q; /* opaque pointer */ uInt n; /* number of items */ uInt s; /* size of item */ { Assert(s == sizeof(inflate_huft) && n <= *(intf *)q, "inflate_trees falloc overflow"); *(intf *)q -= n+s-s; /* s-s to avoid warning */ return (voidpf)(fixed_mem + *(intf *)q); } int inflate_trees_fixed(bl, bd, tl, td) uIntf *bl; /* literal desired/actual bit depth */ uIntf *bd; /* distance desired/actual bit depth */ inflate_huft * FAR *tl; /* literal/length tree result */ inflate_huft * FAR *td; /* distance tree result */ { /* build fixed tables if not already (multiple overlapped executions ok) */ if (!fixed_built) { int k; /* temporary variable */ unsigned c[288]; /* length list for huft_build */ z_stream z; /* for falloc function */ int f = FIXEDH; /* number of hufts left in fixed_mem */ /* set up fake z_stream for memory routines */ z.zalloc = falloc; z.zfree = Z_NULL; z.opaque = (voidpf)&f; /* literal table */ for (k = 0; k < 144; k++) c[k] = 8; for (; k < 256; k++) c[k] = 9; for (; k < 280; k++) c[k] = 7; for (; k < 288; k++) c[k] = 8; fixed_bl = 7; huft_build(c, 288, 257, cplens, cplext, &fixed_tl, &fixed_bl, &z); /* distance table */ for (k = 0; k < 30; k++) c[k] = 5; fixed_bd = 5; huft_build(c, 30, 0, cpdist, cpdext, &fixed_td, &fixed_bd, &z); /* done */ Assert(f == 0, "invalid build of fixed tables"); fixed_built = 1; } *bl = fixed_bl; *bd = fixed_bd; *tl = fixed_tl; *td = fixed_td; return Z_OK; } int inflate_trees_free(t, z) inflate_huft *t; /* table to free */ z_streamp z; /* for zfree function */ /* Free the malloc'ed tables built by huft_build(), which makes a linked list of the tables it made, with the links in a dummy first entry of each table. */ { register inflate_huft *p, *q, *r; /* Reverse linked list */ p = Z_NULL; q = t; while (q != Z_NULL) { r = (q - 1)->next; (q - 1)->next = p; p = q; q = r; } /* Go through linked list, freeing from the malloced (t[-1]) address. */ while (p != Z_NULL) { q = (--p)->next; ZFREE(z,p); p = q; } return Z_OK; } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/inftrees.h100644 1007 1403 4530 6363455075 22146 0ustar petrillipetrilli/* inftrees.h -- header to use inftrees.c * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ /* Huffman code lookup table entry--this entry is four bytes for machines that have 16-bit pointers (e.g. PC's in the small or medium model). */ typedef struct inflate_huft_s FAR inflate_huft; struct inflate_huft_s { union { struct { Byte Exop; /* number of extra bits or operation */ Byte Bits; /* number of bits in this code or subcode */ } what; Bytef *pad; /* pad structure to a power of 2 (4 bytes for */ } word; /* 16-bit, 8 bytes for 32-bit machines) */ union { uInt Base; /* literal, length base, or distance base */ inflate_huft *Next; /* pointer to next level of table */ } more; }; #ifdef DEBUG extern uInt inflate_hufts; #endif extern int inflate_trees_bits OF(( uIntf *, /* 19 code lengths */ uIntf *, /* bits tree desired/actual depth */ inflate_huft * FAR *, /* bits tree result */ z_streamp )); /* for zalloc, zfree functions */ extern int inflate_trees_dynamic OF(( uInt, /* number of literal/length codes */ uInt, /* number of distance codes */ uIntf *, /* that many (total) code lengths */ uIntf *, /* literal desired/actual bit depth */ uIntf *, /* distance desired/actual bit depth */ inflate_huft * FAR *, /* literal/length tree result */ inflate_huft * FAR *, /* distance tree result */ z_streamp )); /* for zalloc, zfree functions */ extern int inflate_trees_fixed OF(( uIntf *, /* literal desired/actual bit depth */ uIntf *, /* distance desired/actual bit depth */ inflate_huft * FAR *, /* literal/length tree result */ inflate_huft * FAR *)); /* distance tree result */ extern int inflate_trees_free OF(( inflate_huft *, /* tables to free */ z_streamp )); /* for zfree function */ Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/infutil.c100644 1007 1403 3717 6363455075 22002 0ustar petrillipetrilli/* inflate_util.c -- data and routines common to blocks and codes * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "zutil.h" #include "infblock.h" #include "inftrees.h" #include "infcodes.h" #include "infutil.h" struct inflate_codes_state {int dummy;}; /* for buggy compilers */ /* And'ing with mask[n] masks the lower n bits */ uInt inflate_mask[17] = { 0x0000, 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff, 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff }; /* copy as much as possible from the sliding window to the output area */ int inflate_flush(s, z, r) inflate_blocks_statef *s; z_streamp z; int r; { uInt n; Bytef *p; Bytef *q; /* local copies of source and destination pointers */ p = z->next_out; q = s->read; /* compute number of bytes to copy as far as end of window */ n = (uInt)((q <= s->write ? s->write : s->end) - q); if (n > z->avail_out) n = z->avail_out; if (n && r == Z_BUF_ERROR) r = Z_OK; /* update counters */ z->avail_out -= n; z->total_out += n; /* update check information */ if (s->checkfn != Z_NULL) z->adler = s->check = (*s->checkfn)(s->check, q, n); /* copy as far as end of window */ zmemcpy(p, q, n); p += n; q += n; /* see if more to copy at beginning of window */ if (q == s->end) { /* wrap pointers */ q = s->window; if (s->write == s->end) s->write = s->window; /* compute bytes to copy */ n = (uInt)(s->write - q); if (n > z->avail_out) n = z->avail_out; if (n && r == Z_BUF_ERROR) r = Z_OK; /* update counters */ z->avail_out -= n; z->total_out += n; /* update check information */ if (s->checkfn != Z_NULL) z->adler = s->check = (*s->checkfn)(s->check, q, n); /* copy */ zmemcpy(p, q, n); p += n; q += n; } /* update pointers */ z->next_out = p; s->read = q; /* done */ return r; } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/infutil.h100644 1007 1403 7160 6363455076 22004 0ustar petrillipetrilli/* infutil.h -- types and macros common to blocks and codes * Copyright (C) 1995-1996 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ #ifndef _INFUTIL_H #define _INFUTIL_H typedef enum { TYPE, /* get type bits (3, including end bit) */ LENS, /* get lengths for stored */ STORED, /* processing stored block */ TABLE, /* get table lengths */ BTREE, /* get bit lengths tree for a dynamic block */ DTREE, /* get length, distance trees for a dynamic block */ CODES, /* processing fixed or dynamic block */ DRY, /* output remaining window bytes */ DONE, /* finished last block, done */ BAD} /* got a data error--stuck here */ inflate_block_mode; /* inflate blocks semi-private state */ struct inflate_blocks_state { /* mode */ inflate_block_mode mode; /* current inflate_block mode */ /* mode dependent information */ union { uInt left; /* if STORED, bytes left to copy */ struct { uInt table; /* table lengths (14 bits) */ uInt index; /* index into blens (or border) */ uIntf *blens; /* bit lengths of codes */ uInt bb; /* bit length tree depth */ inflate_huft *tb; /* bit length decoding tree */ } trees; /* if DTREE, decoding info for trees */ struct { inflate_huft *tl; inflate_huft *td; /* trees to free */ inflate_codes_statef *codes; } decode; /* if CODES, current state */ } sub; /* submode */ uInt last; /* true if this block is the last block */ /* mode independent information */ uInt bitk; /* bits in bit buffer */ uLong bitb; /* bit buffer */ Bytef *window; /* sliding window */ Bytef *end; /* one byte after sliding window */ Bytef *read; /* window read pointer */ Bytef *write; /* window write pointer */ check_func checkfn; /* check function */ uLong check; /* check on output */ }; /* defines for inflate input/output */ /* update pointers and return */ #define UPDBITS {s->bitb=b;s->bitk=k;} #define UPDIN {z->avail_in=n;z->total_in+=p-z->next_in;z->next_in=p;} #define UPDOUT {s->write=q;} #define UPDATE {UPDBITS UPDIN UPDOUT} #define LEAVE {UPDATE return inflate_flush(s,z,r);} /* get bytes and bits */ #define LOADIN {p=z->next_in;n=z->avail_in;b=s->bitb;k=s->bitk;} #define NEEDBYTE {if(n)r=Z_OK;else LEAVE} #define NEXTBYTE (n--,*p++) #define NEEDBITS(j) {while(k<(j)){NEEDBYTE;b|=((uLong)NEXTBYTE)<>=(j);k-=(j);} /* output bytes */ #define WAVAIL (uInt)(qread?s->read-q-1:s->end-q) #define LOADOUT {q=s->write;m=(uInt)WAVAIL;} #define WRAP {if(q==s->end&&s->read!=s->window){q=s->window;m=(uInt)WAVAIL;}} #define FLUSH {UPDOUT r=inflate_flush(s,z,r); LOADOUT} #define NEEDOUT {if(m==0){WRAP if(m==0){FLUSH WRAP if(m==0) LEAVE}}r=Z_OK;} #define OUTBYTE(a) {*q++=(Byte)(a);m--;} /* load local pointers */ #define LOAD {LOADIN LOADOUT} /* masks for lower bits (size given to avoid silly warnings with Visual C++) */ extern uInt inflate_mask[17]; /* copy as much as possible from the sliding window to the output area */ extern int inflate_flush OF(( inflate_blocks_statef *, z_streamp , int)); struct internal_state {int dummy;}; /* for buggy compilers */ #endif Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/trees.c100644 1007 1403 122016 6363455076 21505 0ustar petrillipetrilli/* trees.c -- output deflated data using Huffman coding * Copyright (C) 1995-1996 Jean-loup Gailly * For conditions of distribution and use, see copyright notice in zlib.h */ /* * ALGORITHM * * The "deflation" process uses several Huffman trees. The more * common source values are represented by shorter bit sequences. * * Each code tree is stored in a compressed form which is itself * a Huffman encoding of the lengths of all the code strings (in * ascending order by source values). The actual code strings are * reconstructed from the lengths in the inflate process, as described * in the deflate specification. * * REFERENCES * * Deutsch, L.P.,"'Deflate' Compressed Data Format Specification". * Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc * * Storer, James A. * Data Compression: Methods and Theory, pp. 49-50. * Computer Science Press, 1988. ISBN 0-7167-8156-5. * * Sedgewick, R. * Algorithms, p290. * Addison-Wesley, 1983. ISBN 0-201-06672-6. */ /* $Id: trees.c,v 1.1 1997/07/17 17:45:34 jim Exp $ */ #include "deflate.h" #ifdef DEBUG # include #endif /* =========================================================================== * Constants */ #define MAX_BL_BITS 7 /* Bit length codes must not exceed MAX_BL_BITS bits */ #define END_BLOCK 256 /* end of block literal code */ #define REP_3_6 16 /* repeat previous bit length 3-6 times (2 bits of repeat count) */ #define REPZ_3_10 17 /* repeat a zero length 3-10 times (3 bits of repeat count) */ #define REPZ_11_138 18 /* repeat a zero length 11-138 times (7 bits of repeat count) */ local int extra_lbits[LENGTH_CODES] /* extra bits for each length code */ = {0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0}; local int extra_dbits[D_CODES] /* extra bits for each distance code */ = {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13}; local int extra_blbits[BL_CODES]/* extra bits for each bit length code */ = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7}; local uch bl_order[BL_CODES] = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15}; /* The lengths of the bit length codes are sent in order of decreasing * probability, to avoid transmitting the lengths for unused bit length codes. */ #define Buf_size (8 * 2*sizeof(char)) /* Number of bits used within bi_buf. (bi_buf might be implemented on * more than 16 bits on some systems.) */ /* =========================================================================== * Local data. These are initialized only once. */ local ct_data static_ltree[L_CODES+2]; /* The static literal tree. Since the bit lengths are imposed, there is no * need for the L_CODES extra codes used during heap construction. However * The codes 286 and 287 are needed to build a canonical tree (see _tr_init * below). */ local ct_data static_dtree[D_CODES]; /* The static distance tree. (Actually a trivial tree since all codes use * 5 bits.) */ local uch dist_code[512]; /* distance codes. The first 256 values correspond to the distances * 3 .. 258, the last 256 values correspond to the top 8 bits of * the 15 bit distances. */ local uch length_code[MAX_MATCH-MIN_MATCH+1]; /* length code for each normalized match length (0 == MIN_MATCH) */ local int base_length[LENGTH_CODES]; /* First normalized length for each code (0 = MIN_MATCH) */ local int base_dist[D_CODES]; /* First normalized distance for each code (0 = distance of 1) */ struct static_tree_desc_s { ct_data *static_tree; /* static tree or NULL */ intf *extra_bits; /* extra bits for each code or NULL */ int extra_base; /* base index for extra_bits */ int elems; /* max number of elements in the tree */ int max_length; /* max bit length for the codes */ }; local static_tree_desc static_l_desc = {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS}; local static_tree_desc static_d_desc = {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS}; local static_tree_desc static_bl_desc = {(ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; /* =========================================================================== * Local (static) routines in this file. */ local void tr_static_init OF((void)); local void init_block OF((deflate_state *s)); local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); local void gen_bitlen OF((deflate_state *s, tree_desc *desc)); local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); local void build_tree OF((deflate_state *s, tree_desc *desc)); local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code)); local void send_tree OF((deflate_state *s, ct_data *tree, int max_code)); local int build_bl_tree OF((deflate_state *s)); local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes, int blcodes)); local void compress_block OF((deflate_state *s, ct_data *ltree, ct_data *dtree)); local void set_data_type OF((deflate_state *s)); local unsigned bi_reverse OF((unsigned value, int length)); local void bi_windup OF((deflate_state *s)); local void bi_flush OF((deflate_state *s)); local void copy_block OF((deflate_state *s, charf *buf, unsigned len, int header)); #ifndef DEBUG # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) /* Send a code of the given tree. c and tree must not have side effects */ #else /* DEBUG */ # define send_code(s, c, tree) \ { if (verbose>2) fprintf(stderr,"\ncd %3d ",(c)); \ send_bits(s, tree[c].Code, tree[c].Len); } #endif #define d_code(dist) \ ((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)]) /* Mapping from a distance to a distance code. dist is the distance - 1 and * must not have side effects. dist_code[256] and dist_code[257] are never * used. */ /* =========================================================================== * Output a short LSB first on the stream. * IN assertion: there is enough room in pendingBuf. */ #define put_short(s, w) { \ put_byte(s, (uch)((w) & 0xff)); \ put_byte(s, (uch)((ush)(w) >> 8)); \ } /* =========================================================================== * Send a value on a given number of bits. * IN assertion: length <= 16 and value fits in length bits. */ #ifdef DEBUG local void send_bits OF((deflate_state *s, int value, int length)); local void send_bits(s, value, length) deflate_state *s; int value; /* value to send */ int length; /* number of bits */ { Tracevv((stderr," l %2d v %4x ", length, value)); Assert(length > 0 && length <= 15, "invalid length"); s->bits_sent += (ulg)length; /* If not enough room in bi_buf, use (valid) bits from bi_buf and * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid)) * unused bits in value. */ if (s->bi_valid > (int)Buf_size - length) { s->bi_buf |= (value << s->bi_valid); put_short(s, s->bi_buf); s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); s->bi_valid += length - Buf_size; } else { s->bi_buf |= value << s->bi_valid; s->bi_valid += length; } } #else /* !DEBUG */ #define send_bits(s, value, length) \ { int len = length;\ if (s->bi_valid > (int)Buf_size - len) {\ int val = value;\ s->bi_buf |= (val << s->bi_valid);\ put_short(s, s->bi_buf);\ s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\ s->bi_valid += len - Buf_size;\ } else {\ s->bi_buf |= (value) << s->bi_valid;\ s->bi_valid += len;\ }\ } #endif /* DEBUG */ #define MAX(a,b) (a >= b ? a : b) /* the arguments must not have side effects */ /* =========================================================================== * Initialize the various 'constant' tables. In a multi-threaded environment, * this function may be called by two threads concurrently, but this is * harmless since both invocations do exactly the same thing. */ local void tr_static_init() { static int static_init_done = 0; int n; /* iterates over tree elements */ int bits; /* bit counter */ int length; /* length value */ int code; /* code value */ int dist; /* distance index */ ush bl_count[MAX_BITS+1]; /* number of codes at each bit length for an optimal tree */ if (static_init_done) return; /* Initialize the mapping length (0..255) -> length code (0..28) */ length = 0; for (code = 0; code < LENGTH_CODES-1; code++) { base_length[code] = length; for (n = 0; n < (1< dist code (0..29) */ dist = 0; for (code = 0 ; code < 16; code++) { base_dist[code] = dist; for (n = 0; n < (1<>= 7; /* from now on, all distances are divided by 128 */ for ( ; code < D_CODES; code++) { base_dist[code] = dist << 7; for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) { dist_code[256 + dist++] = (uch)code; } } Assert (dist == 256, "tr_static_init: 256+dist != 512"); /* Construct the codes of the static literal tree */ for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; n = 0; while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; /* Codes 286 and 287 do not exist, but we must include them in the * tree construction to get a canonical Huffman tree (longest code * all ones) */ gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); /* The static distance tree is trivial: */ for (n = 0; n < D_CODES; n++) { static_dtree[n].Len = 5; static_dtree[n].Code = bi_reverse((unsigned)n, 5); } static_init_done = 1; } /* =========================================================================== * Initialize the tree data structures for a new zlib stream. */ void _tr_init(s) deflate_state *s; { tr_static_init(); s->compressed_len = 0L; s->l_desc.dyn_tree = s->dyn_ltree; s->l_desc.stat_desc = &static_l_desc; s->d_desc.dyn_tree = s->dyn_dtree; s->d_desc.stat_desc = &static_d_desc; s->bl_desc.dyn_tree = s->bl_tree; s->bl_desc.stat_desc = &static_bl_desc; s->bi_buf = 0; s->bi_valid = 0; s->last_eob_len = 8; /* enough lookahead for inflate */ #ifdef DEBUG s->bits_sent = 0L; #endif /* Initialize the first block of the first file: */ init_block(s); } /* =========================================================================== * Initialize a new block. */ local void init_block(s) deflate_state *s; { int n; /* iterates over tree elements */ /* Initialize the trees. */ for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; s->dyn_ltree[END_BLOCK].Freq = 1; s->opt_len = s->static_len = 0L; s->last_lit = s->matches = 0; } #define SMALLEST 1 /* Index within the heap array of least frequent node in the Huffman tree */ /* =========================================================================== * Remove the smallest element from the heap and recreate the heap with * one less element. Updates heap and heap_len. */ #define pqremove(s, tree, top) \ {\ top = s->heap[SMALLEST]; \ s->heap[SMALLEST] = s->heap[s->heap_len--]; \ pqdownheap(s, tree, SMALLEST); \ } /* =========================================================================== * Compares to subtrees, using the tree depth as tie breaker when * the subtrees have equal frequency. This minimizes the worst case length. */ #define smaller(tree, n, m, depth) \ (tree[n].Freq < tree[m].Freq || \ (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) /* =========================================================================== * Restore the heap property by moving down the tree starting at node k, * exchanging a node with the smallest of its two sons if necessary, stopping * when the heap property is re-established (each father smaller than its * two sons). */ local void pqdownheap(s, tree, k) deflate_state *s; ct_data *tree; /* the tree to restore */ int k; /* node to move down */ { int v = s->heap[k]; int j = k << 1; /* left son of k */ while (j <= s->heap_len) { /* Set j to the smallest of the two sons: */ if (j < s->heap_len && smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { j++; } /* Exit if v is smaller than both sons */ if (smaller(tree, v, s->heap[j], s->depth)) break; /* Exchange v with the smallest son */ s->heap[k] = s->heap[j]; k = j; /* And continue down the tree, setting j to the left son of k */ j <<= 1; } s->heap[k] = v; } /* =========================================================================== * Compute the optimal bit lengths for a tree and update the total bit length * for the current block. * IN assertion: the fields freq and dad are set, heap[heap_max] and * above are the tree nodes sorted by increasing frequency. * OUT assertions: the field len is set to the optimal bit length, the * array bl_count contains the frequencies for each bit length. * The length opt_len is updated; static_len is also updated if stree is * not null. */ local void gen_bitlen(s, desc) deflate_state *s; tree_desc *desc; /* the tree descriptor */ { ct_data *tree = desc->dyn_tree; int max_code = desc->max_code; ct_data *stree = desc->stat_desc->static_tree; intf *extra = desc->stat_desc->extra_bits; int base = desc->stat_desc->extra_base; int max_length = desc->stat_desc->max_length; int h; /* heap index */ int n, m; /* iterate over the tree elements */ int bits; /* bit length */ int xbits; /* extra bits */ ush f; /* frequency */ int overflow = 0; /* number of elements with bit length too large */ for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0; /* In a first pass, compute the optimal bit lengths (which may * overflow in the case of the bit length tree). */ tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ for (h = s->heap_max+1; h < HEAP_SIZE; h++) { n = s->heap[h]; bits = tree[tree[n].Dad].Len + 1; if (bits > max_length) bits = max_length, overflow++; tree[n].Len = (ush)bits; /* We overwrite tree[n].Dad which is no longer needed */ if (n > max_code) continue; /* not a leaf node */ s->bl_count[bits]++; xbits = 0; if (n >= base) xbits = extra[n-base]; f = tree[n].Freq; s->opt_len += (ulg)f * (bits + xbits); if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits); } if (overflow == 0) return; Trace((stderr,"\nbit length overflow\n")); /* This happens for example on obj2 and pic of the Calgary corpus */ /* Find the first bit length which could increase: */ do { bits = max_length-1; while (s->bl_count[bits] == 0) bits--; s->bl_count[bits]--; /* move one leaf down the tree */ s->bl_count[bits+1] += 2; /* move one overflow item as its brother */ s->bl_count[max_length]--; /* The brother of the overflow item also moves one step up, * but this does not affect bl_count[max_length] */ overflow -= 2; } while (overflow > 0); /* Now recompute all bit lengths, scanning in increasing frequency. * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all * lengths instead of fixing only the wrong ones. This idea is taken * from 'ar' written by Haruhiko Okumura.) */ for (bits = max_length; bits != 0; bits--) { n = s->bl_count[bits]; while (n != 0) { m = s->heap[--h]; if (m > max_code) continue; if (tree[m].Len != (unsigned) bits) { Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); s->opt_len += ((long)bits - (long)tree[m].Len) *(long)tree[m].Freq; tree[m].Len = (ush)bits; } n--; } } } /* =========================================================================== * Generate the codes for a given tree and bit counts (which need not be * optimal). * IN assertion: the array bl_count contains the bit length statistics for * the given tree and the field len is set for all tree elements. * OUT assertion: the field code is set for all tree elements of non * zero code length. */ local void gen_codes (tree, max_code, bl_count) ct_data *tree; /* the tree to decorate */ int max_code; /* largest code with non zero frequency */ ushf *bl_count; /* number of codes at each bit length */ { ush next_code[MAX_BITS+1]; /* next code value for each bit length */ ush code = 0; /* running code value */ int bits; /* bit index */ int n; /* code index */ /* The distribution counts are first used to generate the code values * without bit reversal. */ for (bits = 1; bits <= MAX_BITS; bits++) { next_code[bits] = code = (code + bl_count[bits-1]) << 1; } /* Check that the bit counts in bl_count are consistent. The last code * must be all ones. */ Assert (code + bl_count[MAX_BITS]-1 == (1<dyn_tree; ct_data *stree = desc->stat_desc->static_tree; int elems = desc->stat_desc->elems; int n, m; /* iterate over heap elements */ int max_code = -1; /* largest code with non zero frequency */ int node; /* new node being created */ /* Construct the initial heap, with least frequent element in * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. * heap[0] is not used. */ s->heap_len = 0, s->heap_max = HEAP_SIZE; for (n = 0; n < elems; n++) { if (tree[n].Freq != 0) { s->heap[++(s->heap_len)] = max_code = n; s->depth[n] = 0; } else { tree[n].Len = 0; } } /* The pkzip format requires that at least one distance code exists, * and that at least one bit should be sent even if there is only one * possible code. So to avoid special checks later on we force at least * two codes of non zero frequency. */ while (s->heap_len < 2) { node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); tree[node].Freq = 1; s->depth[node] = 0; s->opt_len--; if (stree) s->static_len -= stree[node].Len; /* node is 0 or 1 so it does not have extra bits */ } desc->max_code = max_code; /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, * establish sub-heaps of increasing lengths: */ for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n); /* Construct the Huffman tree by repeatedly combining the least two * frequent nodes. */ node = elems; /* next internal node of the tree */ do { pqremove(s, tree, n); /* n = node of least frequency */ m = s->heap[SMALLEST]; /* m = node of next least frequency */ s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ s->heap[--(s->heap_max)] = m; /* Create a new node father of n and m */ tree[node].Freq = tree[n].Freq + tree[m].Freq; s->depth[node] = (uch) (MAX(s->depth[n], s->depth[m]) + 1); tree[n].Dad = tree[m].Dad = (ush)node; #ifdef DUMP_BL_TREE if (tree == s->bl_tree) { fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)", node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); } #endif /* and insert the new node in the heap */ s->heap[SMALLEST] = node++; pqdownheap(s, tree, SMALLEST); } while (s->heap_len >= 2); s->heap[--(s->heap_max)] = s->heap[SMALLEST]; /* At this point, the fields freq and dad are set. We can now * generate the bit lengths. */ gen_bitlen(s, (tree_desc *)desc); /* The field len is now set, we can generate the bit codes */ gen_codes ((ct_data *)tree, max_code, s->bl_count); } /* =========================================================================== * Scan a literal or distance tree to determine the frequencies of the codes * in the bit length tree. */ local void scan_tree (s, tree, max_code) deflate_state *s; ct_data *tree; /* the tree to be scanned */ int max_code; /* and its largest code of non zero frequency */ { int n; /* iterates over all tree elements */ int prevlen = -1; /* last emitted length */ int curlen; /* length of current code */ int nextlen = tree[0].Len; /* length of next code */ int count = 0; /* repeat count of the current code */ int max_count = 7; /* max repeat count */ int min_count = 4; /* min repeat count */ if (nextlen == 0) max_count = 138, min_count = 3; tree[max_code+1].Len = (ush)0xffff; /* guard */ for (n = 0; n <= max_code; n++) { curlen = nextlen; nextlen = tree[n+1].Len; if (++count < max_count && curlen == nextlen) { continue; } else if (count < min_count) { s->bl_tree[curlen].Freq += count; } else if (curlen != 0) { if (curlen != prevlen) s->bl_tree[curlen].Freq++; s->bl_tree[REP_3_6].Freq++; } else if (count <= 10) { s->bl_tree[REPZ_3_10].Freq++; } else { s->bl_tree[REPZ_11_138].Freq++; } count = 0; prevlen = curlen; if (nextlen == 0) { max_count = 138, min_count = 3; } else if (curlen == nextlen) { max_count = 6, min_count = 3; } else { max_count = 7, min_count = 4; } } } /* =========================================================================== * Send a literal or distance tree in compressed form, using the codes in * bl_tree. */ local void send_tree (s, tree, max_code) deflate_state *s; ct_data *tree; /* the tree to be scanned */ int max_code; /* and its largest code of non zero frequency */ { int n; /* iterates over all tree elements */ int prevlen = -1; /* last emitted length */ int curlen; /* length of current code */ int nextlen = tree[0].Len; /* length of next code */ int count = 0; /* repeat count of the current code */ int max_count = 7; /* max repeat count */ int min_count = 4; /* min repeat count */ /* tree[max_code+1].Len = -1; */ /* guard already set */ if (nextlen == 0) max_count = 138, min_count = 3; for (n = 0; n <= max_code; n++) { curlen = nextlen; nextlen = tree[n+1].Len; if (++count < max_count && curlen == nextlen) { continue; } else if (count < min_count) { do { send_code(s, curlen, s->bl_tree); } while (--count != 0); } else if (curlen != 0) { if (curlen != prevlen) { send_code(s, curlen, s->bl_tree); count--; } Assert(count >= 3 && count <= 6, " 3_6?"); send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2); } else if (count <= 10) { send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3); } else { send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7); } count = 0; prevlen = curlen; if (nextlen == 0) { max_count = 138, min_count = 3; } else if (curlen == nextlen) { max_count = 6, min_count = 3; } else { max_count = 7, min_count = 4; } } } /* =========================================================================== * Construct the Huffman tree for the bit lengths and return the index in * bl_order of the last bit length code to send. */ local int build_bl_tree(s) deflate_state *s; { int max_blindex; /* index of last bit length code of non zero freq */ /* Determine the bit length frequencies for literal and distance trees */ scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); /* Build the bit length tree: */ build_tree(s, (tree_desc *)(&(s->bl_desc))); /* opt_len now includes the length of the tree representations, except * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. */ /* Determine the number of bit length codes to send. The pkzip format * requires that at least 4 bit length codes be sent. (appnote.txt says * 3 but the actual value used is 4.) */ for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { if (s->bl_tree[bl_order[max_blindex]].Len != 0) break; } /* Update opt_len to include the bit length tree and counts */ s->opt_len += 3*(max_blindex+1) + 5+5+4; Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", s->opt_len, s->static_len)); return max_blindex; } /* =========================================================================== * Send the header for a block using dynamic Huffman trees: the counts, the * lengths of the bit length codes, the literal tree and the distance tree. * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. */ local void send_all_trees(s, lcodes, dcodes, blcodes) deflate_state *s; int lcodes, dcodes, blcodes; /* number of codes for each tree */ { int rank; /* index in bl_order */ Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); Tracev((stderr, "\nbl counts: ")); send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */ send_bits(s, dcodes-1, 5); send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */ for (rank = 0; rank < blcodes; rank++) { Tracev((stderr, "\nbl code %2d ", bl_order[rank])); send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); } Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); } /* =========================================================================== * Send a stored block */ void _tr_stored_block(s, buf, stored_len, eof) deflate_state *s; charf *buf; /* input block */ ulg stored_len; /* length of input block */ int eof; /* true if this is the last block for a file */ { send_bits(s, (STORED_BLOCK<<1)+eof, 3); /* send block type */ s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L; s->compressed_len += (stored_len + 4) << 3; copy_block(s, buf, (unsigned)stored_len, 1); /* with header */ } /* =========================================================================== * Send one empty static block to give enough lookahead for inflate. * This takes 10 bits, of which 7 may remain in the bit buffer. * The current inflate code requires 9 bits of lookahead. If the * last two codes for the previous block (real code plus EOB) were coded * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode * the last real code. In this case we send two empty static blocks instead * of one. (There are no problems if the previous block is stored or fixed.) * To simplify the code, we assume the worst case of last real code encoded * on one bit only. */ void _tr_align(s) deflate_state *s; { send_bits(s, STATIC_TREES<<1, 3); send_code(s, END_BLOCK, static_ltree); s->compressed_len += 10L; /* 3 for block type, 7 for EOB */ bi_flush(s); /* Of the 10 bits for the empty block, we have already sent * (10 - bi_valid) bits. The lookahead for the last real code (before * the EOB of the previous block) was thus at least one plus the length * of the EOB plus what we have just sent of the empty static block. */ if (1 + s->last_eob_len + 10 - s->bi_valid < 9) { send_bits(s, STATIC_TREES<<1, 3); send_code(s, END_BLOCK, static_ltree); s->compressed_len += 10L; bi_flush(s); } s->last_eob_len = 7; } /* =========================================================================== * Determine the best encoding for the current block: dynamic trees, static * trees or store, and output the encoded block to the zip file. This function * returns the total compressed length for the file so far. */ ulg _tr_flush_block(s, buf, stored_len, eof) deflate_state *s; charf *buf; /* input block, or NULL if too old */ ulg stored_len; /* length of input block */ int eof; /* true if this is the last block for a file */ { ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */ int max_blindex = 0; /* index of last bit length code of non zero freq */ /* Build the Huffman trees unless a stored block is forced */ if (s->level > 0) { /* Check if the file is ascii or binary */ if (s->data_type == Z_UNKNOWN) set_data_type(s); /* Construct the literal and distance trees */ build_tree(s, (tree_desc *)(&(s->l_desc))); Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, s->static_len)); build_tree(s, (tree_desc *)(&(s->d_desc))); Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, s->static_len)); /* At this point, opt_len and static_len are the total bit lengths of * the compressed block data, excluding the tree representations. */ /* Build the bit length tree for the above two trees, and get the index * in bl_order of the last bit length code to send. */ max_blindex = build_bl_tree(s); /* Determine the best encoding. Compute first the block length in bytes*/ opt_lenb = (s->opt_len+3+7)>>3; static_lenb = (s->static_len+3+7)>>3; Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, s->last_lit)); if (static_lenb <= opt_lenb) opt_lenb = static_lenb; } else { Assert(buf != (char*)0, "lost buf"); opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ } /* If compression failed and this is the first and last block, * and if the .zip file can be seeked (to rewrite the local header), * the whole file is transformed into a stored file: */ #ifdef STORED_FILE_OK # ifdef FORCE_STORED_FILE if (eof && s->compressed_len == 0L) { /* force stored file */ # else if (stored_len <= opt_lenb && eof && s->compressed_len==0L && seekable()) { # endif /* Since LIT_BUFSIZE <= 2*WSIZE, the input data must be there: */ if (buf == (charf*)0) error ("block vanished"); copy_block(buf, (unsigned)stored_len, 0); /* without header */ s->compressed_len = stored_len << 3; s->method = STORED; } else #endif /* STORED_FILE_OK */ #ifdef FORCE_STORED if (buf != (char*)0) { /* force stored block */ #else if (stored_len+4 <= opt_lenb && buf != (char*)0) { /* 4: two words for the lengths */ #endif /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. * Otherwise we can't have processed more than WSIZE input bytes since * the last block flush, because compression would have been * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to * transform a block into a stored block. */ _tr_stored_block(s, buf, stored_len, eof); #ifdef FORCE_STATIC } else if (static_lenb >= 0) { /* force static trees */ #else } else if (static_lenb == opt_lenb) { #endif send_bits(s, (STATIC_TREES<<1)+eof, 3); compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree); s->compressed_len += 3 + s->static_len; } else { send_bits(s, (DYN_TREES<<1)+eof, 3); send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1, max_blindex+1); compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); s->compressed_len += 3 + s->opt_len; } Assert (s->compressed_len == s->bits_sent, "bad compressed size"); init_block(s); if (eof) { bi_windup(s); s->compressed_len += 7; /* align on byte boundary */ } Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, s->compressed_len-7*eof)); return s->compressed_len >> 3; } /* =========================================================================== * Save the match info and tally the frequency counts. Return true if * the current block must be flushed. */ int _tr_tally (s, dist, lc) deflate_state *s; unsigned dist; /* distance of matched string */ unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ { s->d_buf[s->last_lit] = (ush)dist; s->l_buf[s->last_lit++] = (uch)lc; if (dist == 0) { /* lc is the unmatched char */ s->dyn_ltree[lc].Freq++; } else { s->matches++; /* Here, lc is the match length - MIN_MATCH */ dist--; /* dist = match distance - 1 */ Assert((ush)dist < (ush)MAX_DIST(s) && (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++; s->dyn_dtree[d_code(dist)].Freq++; } /* Try to guess if it is profitable to stop the current block here */ if (s->level > 2 && (s->last_lit & 0xfff) == 0) { /* Compute an upper bound for the compressed length */ ulg out_length = (ulg)s->last_lit*8L; ulg in_length = (ulg)((long)s->strstart - s->block_start); int dcode; for (dcode = 0; dcode < D_CODES; dcode++) { out_length += (ulg)s->dyn_dtree[dcode].Freq * (5L+extra_dbits[dcode]); } out_length >>= 3; Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ", s->last_lit, in_length, out_length, 100L - out_length*100L/in_length)); if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1; } return (s->last_lit == s->lit_bufsize-1); /* We avoid equality with lit_bufsize because of wraparound at 64K * on 16 bit machines and because stored blocks are restricted to * 64K-1 bytes. */ } /* =========================================================================== * Send the block data compressed using the given Huffman trees */ local void compress_block(s, ltree, dtree) deflate_state *s; ct_data *ltree; /* literal tree */ ct_data *dtree; /* distance tree */ { unsigned dist; /* distance of matched string */ int lc; /* match length or unmatched char (if dist == 0) */ unsigned lx = 0; /* running index in l_buf */ unsigned code; /* the code to send */ int extra; /* number of extra bits to send */ if (s->last_lit != 0) do { dist = s->d_buf[lx]; lc = s->l_buf[lx++]; if (dist == 0) { send_code(s, lc, ltree); /* send a literal byte */ Tracecv(isgraph(lc), (stderr," '%c' ", lc)); } else { /* Here, lc is the match length - MIN_MATCH */ code = length_code[lc]; send_code(s, code+LITERALS+1, ltree); /* send the length code */ extra = extra_lbits[code]; if (extra != 0) { lc -= base_length[code]; send_bits(s, lc, extra); /* send the extra length bits */ } dist--; /* dist is now the match distance - 1 */ code = d_code(dist); Assert (code < D_CODES, "bad d_code"); send_code(s, code, dtree); /* send the distance code */ extra = extra_dbits[code]; if (extra != 0) { dist -= base_dist[code]; send_bits(s, dist, extra); /* send the extra distance bits */ } } /* literal or match pair ? */ /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */ Assert(s->pending < s->lit_bufsize + 2*lx, "pendingBuf overflow"); } while (lx < s->last_lit); send_code(s, END_BLOCK, ltree); s->last_eob_len = ltree[END_BLOCK].Len; } /* =========================================================================== * Set the data type to ASCII or BINARY, using a crude approximation: * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise. * IN assertion: the fields freq of dyn_ltree are set and the total of all * frequencies does not exceed 64K (to fit in an int on 16 bit machines). */ local void set_data_type(s) deflate_state *s; { int n = 0; unsigned ascii_freq = 0; unsigned bin_freq = 0; while (n < 7) bin_freq += s->dyn_ltree[n++].Freq; while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq; while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq; s->data_type = (Byte)(bin_freq > (ascii_freq >> 2) ? Z_BINARY : Z_ASCII); } /* =========================================================================== * Reverse the first len bits of a code, using straightforward code (a faster * method would use a table) * IN assertion: 1 <= len <= 15 */ local unsigned bi_reverse(code, len) unsigned code; /* the value to invert */ int len; /* its bit length */ { register unsigned res = 0; do { res |= code & 1; code >>= 1, res <<= 1; } while (--len > 0); return res >> 1; } /* =========================================================================== * Flush the bit buffer, keeping at most 7 bits in it. */ local void bi_flush(s) deflate_state *s; { if (s->bi_valid == 16) { put_short(s, s->bi_buf); s->bi_buf = 0; s->bi_valid = 0; } else if (s->bi_valid >= 8) { put_byte(s, (Byte)s->bi_buf); s->bi_buf >>= 8; s->bi_valid -= 8; } } /* =========================================================================== * Flush the bit buffer and align the output on a byte boundary */ local void bi_windup(s) deflate_state *s; { if (s->bi_valid > 8) { put_short(s, s->bi_buf); } else if (s->bi_valid > 0) { put_byte(s, (Byte)s->bi_buf); } s->bi_buf = 0; s->bi_valid = 0; #ifdef DEBUG s->bits_sent = (s->bits_sent+7) & ~7; #endif } /* =========================================================================== * Copy a stored block, storing first the length and its * one's complement if requested. */ local void copy_block(s, buf, len, header) deflate_state *s; charf *buf; /* the input data */ unsigned len; /* its length */ int header; /* true if block header must be written */ { bi_windup(s); /* align on byte boundary */ s->last_eob_len = 8; /* enough lookahead for inflate */ if (header) { put_short(s, (ush)len); put_short(s, (ush)~len); #ifdef DEBUG s->bits_sent += 2*16; #endif } #ifdef DEBUG s->bits_sent += (ulg)len<<3; #endif while (len--) { put_byte(s, *buf++); } } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/uncompr.c100644 1007 1403 3702 6363455077 22007 0ustar petrillipetrilli/* uncompr.c -- decompress a memory buffer * Copyright (C) 1995-1996 Jean-loup Gailly. * For conditions of distribution and use, see copyright notice in zlib.h */ /* $Id: uncompr.c,v 1.1 1997/07/17 17:45:35 jim Exp $ */ #include "zlib.h" /* =========================================================================== Decompresses the source buffer into the destination buffer. sourceLen is the byte length of the source buffer. Upon entry, destLen is the total size of the destination buffer, which must be large enough to hold the entire uncompressed data. (The size of the uncompressed data must have been saved previously by the compressor and transmitted to the decompressor by some mechanism outside the scope of this compression library.) Upon exit, destLen is the actual size of the compressed buffer. This function can be used to decompress a whole file at once if the input file is mmap'ed. uncompress returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_BUF_ERROR if there was not enough room in the output buffer, or Z_DATA_ERROR if the input data was corrupted. */ int uncompress (dest, destLen, source, sourceLen) Bytef *dest; uLongf *destLen; const Bytef *source; uLong sourceLen; { z_stream stream; int err; stream.next_in = (Bytef*)source; stream.avail_in = (uInt)sourceLen; /* Check for source > 64K on 16-bit machine: */ if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR; stream.next_out = dest; stream.avail_out = (uInt)*destLen; if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR; stream.zalloc = (alloc_func)0; stream.zfree = (free_func)0; err = inflateInit(&stream); if (err != Z_OK) return err; err = inflate(&stream, Z_FINISH); if (err != Z_STREAM_END) { inflateEnd(&stream); return err; } *destLen = stream.total_out; err = inflateEnd(&stream); return err; } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/zconf.h100644 1007 1403 11737 6363455077 21477 0ustar petrillipetrilli/* zconf.h -- configuration of the zlib compression library * Copyright (C) 1995-1996 Jean-loup Gailly. * For conditions of distribution and use, see copyright notice in zlib.h */ /* $Id: zconf.h,v 1.1 1997/07/17 17:45:35 jim Exp $ */ #ifndef _ZCONF_H #define _ZCONF_H /* * If you *really* need a unique prefix for all types and library functions, * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it. */ #ifdef Z_PREFIX # define deflateInit_ z_deflateInit_ # define deflate z_deflate # define deflateEnd z_deflateEnd # define inflateInit_ z_inflateInit_ # define inflate z_inflate # define inflateEnd z_inflateEnd # define deflateInit2_ z_deflateInit2_ # define deflateSetDictionary z_deflateSetDictionary # define deflateCopy z_deflateCopy # define deflateReset z_deflateReset # define deflateParams z_deflateParams # define inflateInit2_ z_inflateInit2_ # define inflateSetDictionary z_inflateSetDictionary # define inflateSync z_inflateSync # define inflateReset z_inflateReset # define compress z_compress # define uncompress z_uncompress # define adler32 z_adler32 # define crc32 z_crc32 # define get_crc_table z_get_crc_table # define Byte z_Byte # define uInt z_uInt # define uLong z_uLong # define Bytef z_Bytef # define charf z_charf # define intf z_intf # define uIntf z_uIntf # define uLongf z_uLongf # define voidpf z_voidpf # define voidp z_voidp #endif #if (defined(_WIN32) || defined(__WIN32__)) && !defined(WIN32) # define WIN32 #endif #if defined(__GNUC__) || defined(WIN32) || defined(__386__) || defined(i386) # ifndef __32BIT__ # define __32BIT__ # endif #endif #if defined(__MSDOS__) && !defined(MSDOS) # define MSDOS #endif /* * Compile with -DMAXSEG_64K if the alloc function cannot allocate more * than 64k bytes at a time (needed on systems with 16-bit int). */ #if defined(MSDOS) && !defined(__32BIT__) # define MAXSEG_64K #endif #ifdef MSDOS # define UNALIGNED_OK #endif #if (defined(MSDOS) || defined(_WINDOWS) || defined(WIN32)) && !defined(STDC) # define STDC #endif #if (defined(__STDC__) || defined(__cplusplus)) && !defined(STDC) # define STDC #endif #ifndef STDC # ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */ # define const # endif #endif /* Some Mac compilers merge all .h files incorrectly: */ #if defined(__MWERKS__) || defined(applec) ||defined(THINK_C) ||defined(__SC__) # define NO_DUMMY_DECL #endif /* Maximum value for memLevel in deflateInit2 */ #ifndef MAX_MEM_LEVEL # ifdef MAXSEG_64K # define MAX_MEM_LEVEL 8 # else # define MAX_MEM_LEVEL 9 # endif #endif /* Maximum value for windowBits in deflateInit2 and inflateInit2 */ #ifndef MAX_WBITS # define MAX_WBITS 15 /* 32K LZ77 window */ #endif /* The memory requirements for deflate are (in bytes): 1 << (windowBits+2) + 1 << (memLevel+9) that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values) plus a few kilobytes for small objects. For example, if you want to reduce the default memory requirements from 256K to 128K, compile with make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7" Of course this will generally degrade compression (there's no free lunch). The memory requirements for inflate are (in bytes) 1 << windowBits that is, 32K for windowBits=15 (default value) plus a few kilobytes for small objects. */ /* Type declarations */ #ifndef OF /* function prototypes */ # ifdef STDC # define OF(args) args # else # define OF(args) () # endif #endif /* The following definitions for FAR are needed only for MSDOS mixed * model programming (small or medium model with some far allocations). * This was tested only with MSC; for other MSDOS compilers you may have * to define NO_MEMCPY in zutil.h. If you don't need the mixed model, * just define FAR to be empty. */ #if (defined(M_I86SM) || defined(M_I86MM)) && !defined(__32BIT__) /* MSC small or medium model */ # define SMALL_MEDIUM # ifdef _MSC_VER # define FAR __far # else # define FAR far # endif #endif #if defined(__BORLANDC__) && (defined(__SMALL__) || defined(__MEDIUM__)) # ifndef __32BIT__ # define SMALL_MEDIUM # define FAR __far # endif #endif #ifndef FAR # define FAR #endif typedef unsigned char Byte; /* 8 bits */ typedef unsigned int uInt; /* 16 bits or more */ typedef unsigned long uLong; /* 32 bits or more */ #if defined(__BORLANDC__) && defined(SMALL_MEDIUM) /* Borland C/C++ ignores FAR inside typedef */ # define Bytef Byte FAR #else typedef Byte FAR Bytef; #endif typedef char FAR charf; typedef int FAR intf; typedef uInt FAR uIntf; typedef uLong FAR uLongf; #ifdef STDC typedef void FAR *voidpf; typedef void *voidp; #else typedef Byte FAR *voidpf; typedef Byte *voidp; #endif /* Compile with -DZLIB_DLL for Windows DLL support */ #if (defined(_WINDOWS) || defined(WINDOWS)) && defined(ZLIB_DLL) # include # define EXPORT WINAPI #else # define EXPORT #endif #endif /* _ZCONF_H */ Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/zlib.c100644 1007 1403 41403 6372411033 21264 0ustar petrillipetrilli/* zlibmodule.c -- gzip-compatible data compression */ #include #include /* The following parameters are copied from zutil.h, version 0.95 */ #define DEFLATED 8 #if MAX_MEM_LEVEL >= 8 # define DEF_MEM_LEVEL 8 #else # define DEF_MEM_LEVEL MAX_MEM_LEVEL #endif #define DEF_WBITS MAX_WBITS /* The output buffer will be increased in chunks of ADDCHUNK bytes. */ #define ADDCHUNK 2048 #define PyInit_zlib initzlib staticforward PyTypeObject Comptype; staticforward PyTypeObject Decomptype; static PyObject *ZlibError; typedef struct { PyObject_HEAD z_stream zst; } compobject; static compobject * newcompobject(type) PyTypeObject *type; { compobject *self; self = PyObject_NEW(compobject, type); if (self == NULL) return NULL; return self; } static PyObject * PyZlib_compress(self, args) PyObject *self; PyObject *args; { PyObject *ReturnVal; Byte *input, *output; int length, level=Z_DEFAULT_COMPRESSION, err; z_stream zst; if (!PyArg_ParseTuple(args, "s#|i", &input, &length, &level)) return NULL; zst.avail_out=length+length/1000+12+1; output=(Byte*)malloc(zst.avail_out); if (output==NULL) { PyErr_SetString(PyExc_MemoryError, "Can't allocate memory to compress data"); return NULL; } zst.zalloc=(free_func)Z_NULL; zst.zfree=(free_func)Z_NULL; zst.next_out=(Byte *)output; zst.next_in =(Byte *)input; zst.avail_in=length; err=deflateInit(&zst, level); switch(err) { case(Z_OK): break; case(Z_MEM_ERROR): PyErr_SetString(PyExc_MemoryError, "Out of memory while compressing data"); free(output); return NULL; break; case(Z_STREAM_ERROR): PyErr_SetString(ZlibError, "Bad compression level"); free(output); return NULL; break; default: { char temp[500]; if (zst.msg==Z_NULL) zst.msg=""; sprintf(temp, "Error %i while compressing data [%s]", err, zst.msg); PyErr_SetString(ZlibError, temp); deflateEnd(&zst); free(output); return NULL; } break; } err=deflate(&zst, Z_FINISH); switch(err) { case(Z_STREAM_END): break; /* Are there other errors to be trapped here? */ default: { char temp[500]; if (zst.msg==Z_NULL) zst.msg=""; sprintf(temp, "Error %i while compressing data [%s]", err, zst.msg); PyErr_SetString(ZlibError, temp); deflateEnd(&zst); free(output); return NULL; } } err=deflateEnd(&zst); if (err!=Z_OK) { char temp[500]; if (zst.msg==Z_NULL) zst.msg=""; sprintf(temp, "Error %i while finishing data compression [%s]", err, zst.msg); PyErr_SetString(ZlibError, temp); free(output); return NULL; } ReturnVal=PyString_FromStringAndSize(output, zst.total_out); free(output); return ReturnVal; } static PyObject * PyZlib_decompress(self, args) PyObject *self; PyObject *args; { PyObject *ReturnVal; Byte *input, *output; int length, err; z_stream zst; if (!PyArg_ParseTuple(args, "s#", &input, &length)) return NULL; zst.avail_in=length; zst.avail_out=length=length*2; output=(Byte*)malloc(zst.avail_out); if (output==NULL) { PyErr_SetString(PyExc_MemoryError, "Can't allocate memory to decompress data"); return NULL; } zst.zalloc=(alloc_func)Z_NULL; zst.zfree=(free_func)Z_NULL; zst.next_out=(Byte *)output; zst.next_in =(Byte *)input; err=inflateInit(&zst); switch(err) { case(Z_OK): break; case(Z_MEM_ERROR): PyErr_SetString(PyExc_MemoryError, "Out of memory while decompressing data"); free(output); return NULL; default: { char temp[500]; if (zst.msg==Z_NULL) zst.msg=""; sprintf(temp, "Error %i while preparing to decompress data [%s]", err, zst.msg); PyErr_SetString(ZlibError, temp); inflateEnd(&zst); free(output); return NULL; } } do { err=inflate(&zst, Z_FINISH); switch(err) { case(Z_OK): case(Z_STREAM_END): output=(Byte *)realloc(output, length+ADDCHUNK); if (output==NULL) { PyErr_SetString(PyExc_MemoryError, "Out of memory while decompressing data"); inflateEnd(&zst); return NULL; } zst.next_out=output+length; zst.avail_out=ADDCHUNK; length += ADDCHUNK; break; default: { char temp[500]; if (zst.msg==Z_NULL) zst.msg=""; sprintf(temp, "Error %i while decompressing data: [%s]", err, zst.msg); PyErr_SetString(ZlibError, temp); inflateEnd(&zst); return NULL; } } } while(err!=Z_STREAM_END); err=inflateEnd(&zst); if (err!=Z_OK) { char temp[500]; if (zst.msg==Z_NULL) zst.msg=""; sprintf(temp, "Error %i while finishing data decompression [%s]", err, zst.msg); PyErr_SetString(ZlibError, temp); free(output); return NULL; } ReturnVal=PyString_FromStringAndSize(output, zst.total_out); free(output); return ReturnVal; } static PyObject * PyZlib_compressobj(selfptr, args) PyObject *selfptr; PyObject *args; { compobject *self; int level=Z_DEFAULT_COMPRESSION, method=DEFLATED; int wbits=MAX_WBITS, memLevel=DEF_MEM_LEVEL, strategy=0, err; /* XXX Argh! Is there a better way to have multiple levels of */ /* optional arguments? */ if (!PyArg_ParseTuple(args, "iiiii", &level, &method, &wbits, &memLevel, &strategy)) { PyErr_Clear(); if (!PyArg_ParseTuple(args, "iiii", &level, &method, &wbits, &memLevel)) { PyErr_Clear(); if (!PyArg_ParseTuple(args, "iii", &level, &method, &wbits)) { PyErr_Clear(); if (!PyArg_ParseTuple(args, "ii", &level, &method)) { PyErr_Clear(); if (!PyArg_ParseTuple(args, "i", &level)) { PyErr_Clear(); if (!PyArg_ParseTuple(args, "")) return (NULL); } } } } } self=newcompobject(&Comptype); if (self==NULL) return(NULL); self->zst.zalloc=(alloc_func)Z_NULL; self->zst.zfree=(free_func)Z_NULL; err=deflateInit2(&self->zst, level, method, wbits, memLevel, strategy); switch(err) { case (Z_OK): return (PyObject*)self; break; case (Z_MEM_ERROR): PyErr_SetString(PyExc_MemoryError, "Can't allocate memory for compression object"); return NULL; break; case(Z_STREAM_ERROR): PyErr_SetString(PyExc_ValueError, "Invalid compression level"); return NULL; break; default: { char temp[500]; if (self->zst.msg==Z_NULL) self->zst.msg=""; sprintf(temp, "Error %i while creating compression object [%s]", err, self->zst.msg); PyErr_SetString(ZlibError, temp); return NULL; break; } } } static PyObject * PyZlib_decompressobj(selfptr, args) PyObject *selfptr; PyObject *args; { int wbits=DEF_WBITS, err; compobject *self; if (!PyArg_ParseTuple(args, "|i", &wbits)) { return NULL; } self=newcompobject(&Decomptype); if (self==NULL) return(NULL); self->zst.zalloc=(alloc_func)Z_NULL; self->zst.zfree=(free_func)Z_NULL; /* XXX If illegal values of wbits are allowed to get here, Python coredumps, instead of raising an exception as it should. This is a bug in zlib 0.95; I have reported it. */ err=inflateInit2(&self->zst, wbits); switch(err) { case (Z_OK): return (PyObject*)self; break; case (Z_MEM_ERROR): PyErr_SetString(PyExc_MemoryError, "Can't allocate memory for decompression object"); return NULL; break; default: { char temp[500]; if (self->zst.msg==Z_NULL) self->zst.msg=""; sprintf(temp, "Error %i while creating decompression object [%s]", err, self->zst.msg); PyErr_SetString(ZlibError, temp); return NULL; break; } } } static void Comp_dealloc(self) compobject *self; { int err; err=deflateEnd(&self->zst); /* Deallocate zstream structure */ } static void Decomp_dealloc(self) compobject *self; { int err; err=inflateEnd(&self->zst); /* Deallocate zstream structure */ } static PyObject * PyZlib_objcompress(self, args) compobject *self; PyObject *args; { int length=0, err, inplen; Byte *buf=NULL; PyObject *RetVal; Byte *input; if (!PyArg_ParseTuple(args, "s#", &input, &inplen)) return NULL; self->zst.avail_in=inplen; self->zst.next_in=input; do { buf=(Byte *)realloc(buf, length+ADDCHUNK); if (buf==NULL) { PyErr_SetString(PyExc_MemoryError, "Can't allocate memory to compress data"); return NULL; } self->zst.next_out=buf+length; self->zst.avail_out=ADDCHUNK; length += ADDCHUNK; err=deflate(&(self->zst), Z_NO_FLUSH); } while (self->zst.avail_in!=0 && err==Z_OK); if (err!=Z_OK) { char temp[500]; if (self->zst.msg==Z_NULL) self->zst.msg=""; sprintf(temp, "Error %i while compressing [%s]", err, self->zst.msg); PyErr_SetString(ZlibError, temp); return NULL; } RetVal=PyString_FromStringAndSize(buf, self->zst.next_out-buf); free(buf); return RetVal; } static PyObject * PyZlib_objdecompress(self, args) compobject *self; PyObject *args; { int length=0, err, inplen; Byte *buf=NULL; PyObject *RetVal; Byte *input; if (!PyArg_ParseTuple(args, "s#", &input, &inplen)) return NULL; self->zst.avail_in=inplen; self->zst.next_in=input; do { buf=(Byte *)realloc(buf, length+ADDCHUNK); if (buf==NULL) { PyErr_SetString(PyExc_MemoryError, "Can't allocate memory to decompress data"); return NULL; } self->zst.next_out=buf+length; self->zst.avail_out=ADDCHUNK; length += ADDCHUNK; err=inflate(&(self->zst), Z_NO_FLUSH); } while (self->zst.avail_in!=0 && err==Z_OK); if (err!=Z_OK && err!=Z_STREAM_END) { char temp[500]; if (self->zst.msg==Z_NULL) self->zst.msg=""; sprintf(temp, "Error %i while decompressing [%s]", err, self->zst.msg); PyErr_SetString(ZlibError, temp); return NULL; } RetVal=PyString_FromStringAndSize(buf, self->zst.next_out-buf); free(buf); return RetVal; } static PyObject * PyZlib_flush(self, args) compobject *self; PyObject *args; { int length=0, err; Byte *buf=NULL; PyObject *RetVal; if (!PyArg_NoArgs(args)) return NULL; self->zst.avail_in=0; do { buf=(Byte *)realloc(buf, length+ADDCHUNK); if (buf==NULL) { PyErr_SetString(PyExc_MemoryError, "Can't allocate memory to compress data"); return NULL; } self->zst.next_out=buf+length; self->zst.avail_out=ADDCHUNK; length += ADDCHUNK; err=deflate(&(self->zst), Z_FINISH); } while (err==Z_OK); if (err!=Z_STREAM_END) { char temp[500]; if (self->zst.msg==Z_NULL) self->zst.msg=""; sprintf(temp, "Error %i while compressing [%s]", err, self->zst.msg); PyErr_SetString(ZlibError, temp); return NULL; } RetVal=PyString_FromStringAndSize(buf, self->zst.next_out-buf); free(buf); err=deflateEnd(&(self->zst)); if (err!=Z_OK) { char temp[500]; if (self->zst.msg==Z_NULL) self->zst.msg=""; sprintf(temp, "Error %i while flushing compression object [%s]", err, self->zst.msg); PyErr_SetString(ZlibError, temp); return NULL; } return RetVal; } static PyObject * PyZlib_unflush(self, args) compobject *self; PyObject *args; { int length=0, err; Byte *buf=NULL; PyObject *RetVal; if (!PyArg_NoArgs(args)) return NULL; self->zst.avail_in=0; do { buf=(Byte *)realloc(buf, length+ADDCHUNK); if (buf==NULL) { PyErr_SetString(PyExc_MemoryError, "Can't allocate memory to decompress data"); return NULL; } self->zst.next_out=buf+length; length += ADDCHUNK; err=inflate(&(self->zst), Z_FINISH); } while (err==Z_OK); if (err!=Z_STREAM_END) { char temp[500]; if (self->zst.msg==Z_NULL) self->zst.msg=""; sprintf(temp, "Error %i while decompressing [%s]", err, self->zst.msg); PyErr_SetString(ZlibError, temp); return NULL; } RetVal=PyString_FromStringAndSize(buf, self->zst.next_out - buf); free(buf); err=inflateEnd(&(self->zst)); if (err!=Z_OK) { char temp[500]; if (self->zst.msg==Z_NULL) self->zst.msg=""; sprintf(temp, "Error %i while flushing decompression object [%s]", err, self->zst.msg); PyErr_SetString(ZlibError, temp); return NULL; } return RetVal; } static PyMethodDef comp_methods[] = { {"compress", PyZlib_objcompress, 1}, {"flush", PyZlib_flush, 0}, {NULL, NULL} }; static PyMethodDef Decomp_methods[] = { {"decompress", PyZlib_objdecompress, 1}, {"flush", PyZlib_unflush, 0}, {NULL, NULL} }; static PyObject * Comp_getattr(self, name) compobject *self; char *name; { return Py_FindMethod(comp_methods, (PyObject *)self, name); } static PyObject * Decomp_getattr(self, name) compobject *self; char *name; { return Py_FindMethod(Decomp_methods, (PyObject *)self, name); } static PyObject * PyZlib_adler32(self, args) PyObject *self, *args; { uLong adler32val=adler32(0L, Z_NULL, 0); Byte *buf; int len; if (!PyArg_ParseTuple(args, "s#|l", &buf, &len, &adler32val)) { return NULL; } adler32val=adler32(adler32val, buf, len); return Py_BuildValue("l", adler32val); } static PyObject * PyZlib_crc32(self, args) PyObject *self, *args; { uLong crc32val=crc32(0L, Z_NULL, 0); Byte *buf; int len; if (!PyArg_ParseTuple(args, "s#|l", &buf, &len, &crc32val)) { return NULL; } crc32val=crc32(crc32val, buf, len); return Py_BuildValue("l", crc32val); } static PyMethodDef zlib_methods[] = { {"adler32", PyZlib_adler32, 1}, {"compress", PyZlib_compress, 1}, {"compressobj", PyZlib_compressobj, 1}, {"crc32", PyZlib_crc32, 1}, {"decompress", PyZlib_decompress, 1}, {"decompressobj", PyZlib_decompressobj, 1}, {NULL, NULL} }; statichere PyTypeObject Comptype = { PyObject_HEAD_INIT(NULL) 0, "Compress", sizeof(compobject), 0, (destructor)Comp_dealloc, /*tp_dealloc*/ 0, /*tp_print*/ (getattrfunc)Comp_getattr, /*tp_getattr*/ 0, /*tp_setattr*/ 0, /*tp_compare*/ 0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ }; statichere PyTypeObject Decomptype = { PyObject_HEAD_INIT(NULL) 0, "Decompress", sizeof(compobject), 0, (destructor)Decomp_dealloc, /*tp_dealloc*/ 0, /*tp_print*/ (getattrfunc)Decomp_getattr, /*tp_getattr*/ 0, /*tp_setattr*/ 0, /*tp_compare*/ 0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ }; /* The following insint() routine was blatantly ripped off from socketmodule.c */ /* Convenience routine to export an integer value. For simplicity, errors (which are unlikely anyway) are ignored. */ static void insint(d, name, value) PyObject *d; char *name; int value; { PyObject *v = PyInt_FromLong((long) value); if (v == NULL) { /* Don't bother reporting this error */ PyErr_Clear(); } else { PyDict_SetItemString(d, name, v); Py_DECREF(v); } } void PyInit_zlib() { PyObject *m, *d; Comptype.ob_type=&PyType_Type; Decomptype.ob_type=&PyType_Type; m = Py_InitModule("zlib", zlib_methods); d = PyModule_GetDict(m); ZlibError = Py_BuildValue("s", "zlib.error"); PyDict_SetItemString(d, "error", ZlibError); PyDict_SetItemString(d, "IDString", PyString_FromString("$Id: zlib.c,v 1.3 1997/08/07 18:21:15 jim Exp $")); insint(d, "MAX_WBITS", MAX_WBITS); insint(d, "DEFLATED", DEFLATED); insint(d, "DEF_MEM_LEVEL", DEF_MEM_LEVEL); if (PyErr_Occurred()) Py_FatalError("can't initialize module zlib"); } Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/zlib.h100644 1007 1403 106746 6363455100 21330 0ustar petrillipetrilli/* zlib.h -- interface of the 'zlib' general purpose compression library version 1.0.4, Jul 24th, 1996. Copyright (C) 1995-1996 Jean-loup Gailly and Mark Adler This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. Jean-loup Gailly Mark Adler gzip@prep.ai.mit.edu madler@alumni.caltech.edu The data format used by the zlib library is described by RFCs (Request for Comments) 1950 to 1952 in the files ftp://ds.internic.net/rfc/rfc1950.txt (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format). */ #ifndef _ZLIB_H #define _ZLIB_H #ifdef __cplusplus extern "C" { #endif #include "zconf.h" #define ZLIB_VERSION "1.0.4" /* The 'zlib' compression library provides in-memory compression and decompression functions, including integrity checks of the uncompressed data. This version of the library supports only one compression method (deflation) but other algorithms may be added later and will have the same stream interface. For compression the application must provide the output buffer and may optionally provide the input buffer for optimization. For decompression, the application must provide the input buffer and may optionally provide the output buffer for optimization. Compression can be done in a single step if the buffers are large enough (for example if an input file is mmap'ed), or can be done by repeated calls of the compression function. In the latter case, the application must provide more input and/or consume the output (providing more output space) before each call. The library does not install any signal handler. It is recommended to add at least a handler for SIGSEGV when decompressing; the library checks the consistency of the input data whenever possible but may go nuts for some forms of corrupted input. */ typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size)); typedef void (*free_func) OF((voidpf opaque, voidpf address)); struct internal_state; typedef struct z_stream_s { Bytef *next_in; /* next input byte */ uInt avail_in; /* number of bytes available at next_in */ uLong total_in; /* total nb of input bytes read so far */ Bytef *next_out; /* next output byte should be put there */ uInt avail_out; /* remaining free space at next_out */ uLong total_out; /* total nb of bytes output so far */ char *msg; /* last error message, NULL if no error */ struct internal_state FAR *state; /* not visible by applications */ alloc_func zalloc; /* used to allocate the internal state */ free_func zfree; /* used to free the internal state */ voidpf opaque; /* private data object passed to zalloc and zfree */ int data_type; /* best guess about the data type: ascii or binary */ uLong adler; /* adler32 value of the uncompressed data */ uLong reserved; /* reserved for future use */ } z_stream; typedef z_stream FAR *z_streamp; /* The application must update next_in and avail_in when avail_in has dropped to zero. It must update next_out and avail_out when avail_out has dropped to zero. The application must initialize zalloc, zfree and opaque before calling the init function. All other fields are set by the compression library and must not be updated by the application. The opaque value provided by the application will be passed as the first parameter for calls of zalloc and zfree. This can be useful for custom memory management. The compression library attaches no meaning to the opaque value. zalloc must return Z_NULL if there is not enough memory for the object. On 16-bit systems, the functions zalloc and zfree must be able to allocate exactly 65536 bytes, but will not be required to allocate more than this if the symbol MAXSEG_64K is defined (see zconf.h). WARNING: On MSDOS, pointers returned by zalloc for objects of exactly 65536 bytes *must* have their offset normalized to zero. The default allocation function provided by this library ensures this (see zutil.c). To reduce memory requirements and avoid any allocation of 64K objects, at the expense of compression ratio, compile the library with -DMAX_WBITS=14 (see zconf.h). The fields total_in and total_out can be used for statistics or progress reports. After compression, total_in holds the total size of the uncompressed data and may be saved for use in the decompressor (particularly if the decompressor wants to decompress everything in a single step). */ /* constants */ #define Z_NO_FLUSH 0 #define Z_PARTIAL_FLUSH 1 #define Z_SYNC_FLUSH 2 #define Z_FULL_FLUSH 3 #define Z_FINISH 4 /* Allowed flush values; see deflate() below for details */ #define Z_OK 0 #define Z_STREAM_END 1 #define Z_NEED_DICT 2 #define Z_ERRNO (-1) #define Z_STREAM_ERROR (-2) #define Z_DATA_ERROR (-3) #define Z_MEM_ERROR (-4) #define Z_BUF_ERROR (-5) #define Z_VERSION_ERROR (-6) /* Return codes for the compression/decompression functions. Negative * values are errors, positive values are used for special but normal events. */ #define Z_NO_COMPRESSION 0 #define Z_BEST_SPEED 1 #define Z_BEST_COMPRESSION 9 #define Z_DEFAULT_COMPRESSION (-1) /* compression levels */ #define Z_FILTERED 1 #define Z_HUFFMAN_ONLY 2 #define Z_DEFAULT_STRATEGY 0 /* compression strategy; see deflateInit2() below for details */ #define Z_BINARY 0 #define Z_ASCII 1 #define Z_UNKNOWN 2 /* Possible values of the data_type field */ #define Z_DEFLATED 8 /* The deflate compression method (the only one supported in this version) */ #define Z_NULL 0 /* for initializing zalloc, zfree, opaque */ #define zlib_version zlibVersion() /* for compatibility with versions < 1.0.2 */ /* basic functions */ extern const char * EXPORT zlibVersion OF((void)); /* The application can compare zlibVersion and ZLIB_VERSION for consistency. If the first character differs, the library code actually used is not compatible with the zlib.h header file used by the application. This check is automatically made by deflateInit and inflateInit. */ /* extern int EXPORT deflateInit OF((z_streamp strm, int level)); Initializes the internal stream state for compression. The fields zalloc, zfree and opaque must be initialized before by the caller. If zalloc and zfree are set to Z_NULL, deflateInit updates them to use default allocation functions. The compression level must be Z_DEFAULT_COMPRESSION, or between 0 and 9: 1 gives best speed, 9 gives best compression, 0 gives no compression at all (the input data is simply copied a block at a time). Z_DEFAULT_COMPRESSION requests a default compromise between speed and compression (currently equivalent to level 6). deflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_STREAM_ERROR if level is not a valid compression level, Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible with the version assumed by the caller (ZLIB_VERSION). msg is set to null if there is no error message. deflateInit does not perform any compression: this will be done by deflate(). */ extern int EXPORT deflate OF((z_streamp strm, int flush)); /* Performs one or both of the following actions: - Compress more input starting at next_in and update next_in and avail_in accordingly. If not all input can be processed (because there is not enough room in the output buffer), next_in and avail_in are updated and processing will resume at this point for the next call of deflate(). - Provide more output starting at next_out and update next_out and avail_out accordingly. This action is forced if the parameter flush is non zero. Forcing flush frequently degrades the compression ratio, so this parameter should be set only when necessary (in interactive applications). Some output may be provided even if flush is not set. Before the call of deflate(), the application should ensure that at least one of the actions is possible, by providing more input and/or consuming more output, and updating avail_in or avail_out accordingly; avail_out should never be zero before the call. The application can consume the compressed output when it wants, for example when the output buffer is full (avail_out == 0), or after each call of deflate(). If deflate returns Z_OK and with zero avail_out, it must be called again after making room in the output buffer because there might be more output pending. If the parameter flush is set to Z_PARTIAL_FLUSH, the current compression block is terminated and flushed to the output buffer so that the decompressor can get all input data available so far. For method 9, a future variant on method 8, the current block will be flushed but not terminated. Z_SYNC_FLUSH has the same effect as partial flush except that the compressed output is byte aligned (the compressor can clear its internal bit buffer) and the current block is always terminated; this can be useful if the compressor has to be restarted from scratch after an interruption (in which case the internal state of the compressor may be lost). If flush is set to Z_FULL_FLUSH, the compression block is terminated, a special marker is output and the compression dictionary is discarded; this is useful to allow the decompressor to synchronize if one compressed block has been damaged (see inflateSync below). Flushing degrades compression and so should be used only when necessary. Using Z_FULL_FLUSH too often can seriously degrade the compression. If deflate returns with avail_out == 0, this function must be called again with the same value of the flush parameter and more output space (updated avail_out), until the flush is complete (deflate returns with non-zero avail_out). If the parameter flush is set to Z_FINISH, pending input is processed, pending output is flushed and deflate returns with Z_STREAM_END if there was enough output space; if deflate returns with Z_OK, this function must be called again with Z_FINISH and more output space (updated avail_out) but no more input data, until it returns with Z_STREAM_END or an error. After deflate has returned Z_STREAM_END, the only possible operations on the stream are deflateReset or deflateEnd. Z_FINISH can be used immediately after deflateInit if all the compression is to be done in a single step. In this case, avail_out must be at least 0.1% larger than avail_in plus 12 bytes. If deflate does not return Z_STREAM_END, then it must be called again as described above. deflate() may update data_type if it can make a good guess about the input data type (Z_ASCII or Z_BINARY). In doubt, the data is considered binary. This field is only for information purposes and does not affect the compression algorithm in any manner. deflate() returns Z_OK if some progress has been made (more input processed or more output produced), Z_STREAM_END if all input has been consumed and all output has been produced (only when flush is set to Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible. */ extern int EXPORT deflateEnd OF((z_streamp strm)); /* All dynamically allocated data structures for this stream are freed. This function discards any unprocessed input and does not flush any pending output. deflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state was inconsistent, Z_DATA_ERROR if the stream was freed prematurely (some input or output was discarded). In the error case, msg may be set but then points to a static string (which must not be deallocated). */ /* extern int EXPORT inflateInit OF((z_streamp strm)); Initializes the internal stream state for decompression. The fields zalloc, zfree and opaque must be initialized before by the caller. If zalloc and zfree are set to Z_NULL, inflateInit updates them to use default allocation functions. inflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_VERSION_ERROR if the zlib library version is incompatible with the version assumed by the caller. msg is set to null if there is no error message. inflateInit does not perform any decompression: this will be done by inflate(). */ extern int EXPORT inflate OF((z_streamp strm, int flush)); /* Performs one or both of the following actions: - Decompress more input starting at next_in and update next_in and avail_in accordingly. If not all input can be processed (because there is not enough room in the output buffer), next_in is updated and processing will resume at this point for the next call of inflate(). - Provide more output starting at next_out and update next_out and avail_out accordingly. inflate() provides as much output as possible, until there is no more input data or no more space in the output buffer (see below about the flush parameter). Before the call of inflate(), the application should ensure that at least one of the actions is possible, by providing more input and/or consuming more output, and updating the next_* and avail_* values accordingly. The application can consume the uncompressed output when it wants, for example when the output buffer is full (avail_out == 0), or after each call of inflate(). If inflate returns Z_OK and with zero avail_out, it must be called again after making room in the output buffer because there might be more output pending. If the parameter flush is set to Z_PARTIAL_FLUSH, inflate flushes as much output as possible to the output buffer. The flushing behavior of inflate is not specified for values of the flush parameter other than Z_PARTIAL_FLUSH and Z_FINISH, but the current implementation actually flushes as much output as possible anyway. inflate() should normally be called until it returns Z_STREAM_END or an error. However if all decompression is to be performed in a single step (a single call of inflate), the parameter flush should be set to Z_FINISH. In this case all pending input is processed and all pending output is flushed; avail_out must be large enough to hold all the uncompressed data. (The size of the uncompressed data may have been saved by the compressor for this purpose.) The next operation on this stream must be inflateEnd to deallocate the decompression state. The use of Z_FINISH is never required, but can be used to inform inflate that a faster routine may be used for the single inflate() call. inflate() returns Z_OK if some progress has been made (more input processed or more output produced), Z_STREAM_END if the end of the compressed data has been reached and all uncompressed output has been produced, Z_NEED_DICT if a preset dictionary is needed at this point (see inflateSetDictionary below), Z_DATA_ERROR if the input data was corrupted, Z_STREAM_ERROR if the stream structure was inconsistent (for example if next_in or next_out was NULL), Z_MEM_ERROR if there was not enough memory, Z_BUF_ERROR if no progress is possible or if there was not enough room in the output buffer when Z_FINISH is used. In the Z_DATA_ERROR case, the application may then call inflateSync to look for a good compression block. In the Z_NEED_DICT case, strm->adler is set to the Adler32 value of the dictionary chosen by the compressor. */ extern int EXPORT inflateEnd OF((z_streamp strm)); /* All dynamically allocated data structures for this stream are freed. This function discards any unprocessed input and does not flush any pending output. inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state was inconsistent. In the error case, msg may be set but then points to a static string (which must not be deallocated). */ /* Advanced functions */ /* The following functions are needed only in some special applications. */ /* extern int EXPORT deflateInit2 OF((z_streamp strm, int level, int method, int windowBits, int memLevel, int strategy)); This is another version of deflateInit with more compression options. The fields next_in, zalloc, zfree and opaque must be initialized before by the caller. The method parameter is the compression method. It must be Z_DEFLATED in this version of the library. (Method 9 will allow a 64K history buffer and partial block flushes.) The windowBits parameter is the base two logarithm of the window size (the size of the history buffer). It should be in the range 8..15 for this version of the library (the value 16 will be allowed for method 9). Larger values of this parameter result in better compression at the expense of memory usage. The default value is 15 if deflateInit is used instead. The memLevel parameter specifies how much memory should be allocated for the internal compression state. memLevel=1 uses minimum memory but is slow and reduces compression ratio; memLevel=9 uses maximum memory for optimal speed. The default value is 8. See zconf.h for total memory usage as a function of windowBits and memLevel. The strategy parameter is used to tune the compression algorithm. Use the value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data produced by a filter (or predictor), or Z_HUFFMAN_ONLY to force Huffman encoding only (no string match). Filtered data consists mostly of small values with a somewhat random distribution. In this case, the compression algorithm is tuned to compress them better. The effect of Z_FILTERED is to force more Huffman coding and less string matching; it is somewhat intermediate between Z_DEFAULT and Z_HUFFMAN_ONLY. The strategy parameter only affects the compression ratio but not the correctness of the compressed output even if it is not set appropriately. If next_in is not null, the library will use this buffer to hold also some history information; the buffer must either hold the entire input data, or have at least 1<<(windowBits+1) bytes and be writable. If next_in is null, the library will allocate its own history buffer (and leave next_in null). next_out need not be provided here but must be provided by the application for the next call of deflate(). If the history buffer is provided by the application, next_in must must never be changed by the application since the compressor maintains information inside this buffer from call to call; the application must provide more input only by increasing avail_in. next_in is always reset by the library in this case. deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_STREAM_ERROR if a parameter is invalid (such as an invalid method). msg is set to null if there is no error message. deflateInit2 does not perform any compression: this will be done by deflate(). */ extern int EXPORT deflateSetDictionary OF((z_streamp strm, const Bytef *dictionary, uInt dictLength)); /* Initializes the compression dictionary (history buffer) from the given byte sequence without producing any compressed output. This function must be called immediately after deflateInit or deflateInit2, before any call of deflate. The compressor and decompressor must use exactly the same dictionary (see inflateSetDictionary). The dictionary should consist of strings (byte sequences) that are likely to be encountered later in the data to be compressed, with the most commonly used strings preferably put towards the end of the dictionary. Using a dictionary is most useful when the data to be compressed is short and can be predicted with good accuracy; the data can then be compressed better than with the default empty dictionary. In this version of the library, only the last 32K bytes of the dictionary are used. Upon return of this function, strm->adler is set to the Adler32 value of the dictionary; the decompressor may later use this value to determine which dictionary has been used by the compressor. (The Adler32 value applies to the whole dictionary even if only a subset of the dictionary is actually used by the compressor.) deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a parameter is invalid (such as NULL dictionary) or the stream state is inconsistent (for example if deflate has already been called for this stream). deflateSetDictionary does not perform any compression: this will be done by deflate(). */ extern int EXPORT deflateCopy OF((z_streamp dest, z_streamp source)); /* Sets the destination stream as a complete copy of the source stream. If the source stream is using an application-supplied history buffer, a new buffer is allocated for the destination stream. The compressed output buffer is always application-supplied. It's the responsibility of the application to provide the correct values of next_out and avail_out for the next call of deflate. This function can be useful when several compression strategies will be tried, for example when there are several ways of pre-processing the input data with a filter. The streams that will be discarded should then be freed by calling deflateEnd. Note that deflateCopy duplicates the internal compression state which can be quite large, so this strategy is slow and can consume lots of memory. deflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_STREAM_ERROR if the source stream state was inconsistent (such as zalloc being NULL). msg is left unchanged in both source and destination. */ extern int EXPORT deflateReset OF((z_streamp strm)); /* This function is equivalent to deflateEnd followed by deflateInit, but does not free and reallocate all the internal compression state. The stream will keep the same compression level and any other attributes that may have been set by deflateInit2. deflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source stream state was inconsistent (such as zalloc or state being NULL). */ extern int EXPORT deflateParams OF((z_streamp strm, int level, int strategy)); /* Dynamically update the compression level and compression strategy. This can be used to switch between compression and straight copy of the input data, or to switch to a different kind of input data requiring a different strategy. If the compression level is changed, the input available so far is compressed with the old level (and may be flushed); the new level will take effect only at the next call of deflate(). Before the call of deflateParams, the stream state must be set as for a call of deflate(), since the currently available input may have to be compressed and flushed. In particular, strm->avail_out must be non-zero. deflateParams returns Z_OK if success, Z_STREAM_ERROR if the source stream state was inconsistent or if a parameter was invalid, Z_BUF_ERROR if strm->avail_out was zero. */ /* extern int EXPORT inflateInit2 OF((z_streamp strm, int windowBits)); This is another version of inflateInit with more compression options. The fields next_out, zalloc, zfree and opaque must be initialized before by the caller. The windowBits parameter is the base two logarithm of the maximum window size (the size of the history buffer). It should be in the range 8..15 for this version of the library (the value 16 will be allowed soon). The default value is 15 if inflateInit is used instead. If a compressed stream with a larger window size is given as input, inflate() will return with the error code Z_DATA_ERROR instead of trying to allocate a larger window. If next_out is not null, the library will use this buffer for the history buffer; the buffer must either be large enough to hold the entire output data, or have at least 1<&-ݸ<><:=G)ߗ{761b{kAM2Ua"2&T<*.ytkԴ5r?_V,bTVxUyFCT+, Se(qBmC$ TY40-7kK51&eQ41+8[iVx uu:er2祽iRh[KQ:ſS|.#00]DV:L[YWY& γ"01aacc,mg| VD(ձ[U[lqx󓍜d̤.4(1_8fYhFJ%3Y>(Q MD\ Kջ4VCzlSbxkŏy^!?ɰl)aS'xwzut~N椲Y ұJ l7kΧOۤ$@!<3<*'Y]N"ԊLGz-Tڟeo@q݋@0 ]$K/pm?%pm^a fX*'yņxiH\ Cl#j?e3Y>舕&"C$$^^hYF-dt6b#qx kPԩ:>?D܅0+4N!"׾b}`ȝ@\  pT,$v"٤t.&QIF.a:-Z hd>Ij9H17Em!\ rdRBRcB ;h7FdjfI:"ƒ0#g7u wÏ$43 SmAY7ESB.tC RR'd 'B׆ Ë32w&-)msf*>]wupD_Oc߄F^O6r  ܘ,1rh/p m%i{J1u1P>!񃢉 :' R-jɐf {a'1UзYDZXe&} XU &2竟쯧ǧO_?6;QMjĴ!%L峼^+u 3'p! wog zDT=|Kzo} '%7SWGgh'adxv6777Oߠ!h_lla'r]̻+ ?X ?\ |S=KLztPz JR בq3ΙY šIpRG I!I2_wׂ~#2_"#HE/~av~cO9qwH5X'46rJ-25"1/o <ie#$ڪˮ5ф-B |,(&Pe@ɶc1&$E#8$x KI*;.Y9;6"K$UwHiY/I^%` j tlN)cO!޻ou\'iĢ|= laZ8 薘8qV͗wn9tfQrv Klq?g`V7V<SB?A)糶; -AjɕkrDPo|AXޓYp+J;_Ap }oo?[/7w_?5=kkښt- qH _+՞\Y~I;Փs%,i4 oy"&oЉmJ5;óoЄo.Om*).2rI;"#>YVܠSraʹ:BA;`׺Г냵Kpg)y ;'J(%vKaZ:B,:u :=r88j&M@տ:8 cRxIY{.VA? ij^D+UgN*L? l>rzx^ht^9 6fH 2m@5l}hHZ<-/-  J&"srqtz5*W2lXﶡw;8*0{kbK7ݴn_!jg2̡t_[V#Ie+J ǨeWo  6 `֮Su݋*Hը2P\4bwIMoHǙɐttSn2<鄡Ty幭(r)UT['5+*JL FMCZZ6fwĂ ^*ʢivc ^gRd7 zegm]h dN"xo=9"!w'Umx4H?PY͢{]mus>TX[usU九oHiKeQ6-mzf띺@ tZF>\|X`B.(Xp)k$]ѕ'm[M>;=ys/2J\ӝ^X Ba:5=ˏJW נkrNat"`/ c1[R\A'.IjEmElFa 3s 䨦ޚª=M~`)T'QMGp%,78H0uK~gZ=kZ>-{\怽IX7:v6F!$Ɇ@֟Y3$taϵD OZe"]91/Ƌۢ/ ,] 1Å}ytٮag)2wy]QuH[@gq6݆N}l4M'dDhMSna"ⶥF`ʭĆw]XD1tbmcrO PH> bƋ(Mʍ_ vf;3j51npMlf@akt!s\] |ˎUڗ4s;s.5)XlTUc$/:U~~>lqO# 0W>ԀH J>t˸ĔIQ&k:|p| qw԰  Ae"D|3t3ISL7 \@v.A#Б l>JJPDHog.sip\U(`aRF!L3;>RJL$ `D^,sQ`$PZЍ:83>_}>JoL0z&`مM@JCgE} eIʙMLri0 6G9Oj(vKAn'Z ^@d#M.|FԄBK \>9 ?1$!>:!hd yUU߷qth認\XbyS^]P7` ldIm}ad^)1Q=swoGB6&f垱lWtzEd޲Qْ;V8,רaIr0=}C'yVISmz>gBGKJmL%9Vc-]wMIL # *91m&m\D Afz[}_ԟg^(ˈ$V u^.\*!1Pv/w0bu"V򰪇C浄.]TvNr暣cځ2UEN^fwpW$bDD.DAdR?()RNS&LiRT@ ۺ.%\BbB#(] WK}w!ᝎmzjeERtiBSu%g֖i۝:g}2 HT,XJ"@Ej'O*غ=Ŕ{t69Z(!!Sn>޹vZ^7@h,`5a` KѿK)Qϗ8$URgD:N)d 2}Gi__1%rM1 Р&m>fE.h23;EM>oI?Mݙ33g.~äZ& ɌI'BWyN92I\B3e(lC7@ '6(ḿFa ݁6&NE/9Y%%]p%b;bqEVՖU:E:Diw!n,/Ɇ2Ieē'"!i;[ ]{ќ)VӉz1B3bq-ybTiߝj=osv :?x|ab4ZJKJۅ*劻"ɯϣogs;IJz~;CU U>I]NhQL);}=JB0 0P@14e`}i6r=m<p(#3b)7).O@(@~pKL] +4'HeU{!jJ+j/Z՗J"N;t>MEv)!%C\3 "OI/k t_Ԃ&RUＪ"B59\%ͼېj>TM+dF"t9 /:Hdìx7ߧf}>;O$UeJQ K~$_LvYX 2EF$k;v/|v Bk,XgȋD}_>D~2Aoޏ=Eb$;ٞ{d.Z\`"N/x63LYCVY~P c=ix*;1#$L=IjP1HG+=B4XtʰCrJ53a ~;aQl05j:jwދfjQݐ=ȼ4(OjPxJ-"e⏽# ;. 4-@v=zBgE/}KCTLnmu~Swj>y/vaEw-WmsSG^vQius[w-9E-t #kvtBŢA|^t@^ap⹺5"x54|XP$[c֘?^OKgJV5 ]Jݷy1OTcjjXk:f&bZ]=T a#yށHğ# ^$j7+@+@+7{z4b}4|KWhix_=2kT,fi~qF5$cd7Xt3 VFȿ2t{b忝Bs>˭ Ax6D{Fdxz2oy=)TZ-ZxB C WL&^=oD>w| %^QQfۢv<Y4BD:+S5 : u_7jZ{jٍ2ݎOM}ċr*]˲Xh1(i<908|K4j8 y1G? O5Z1X1>`6;ssc?uo3Jժدnh?5Q7ԇX rO΅(x:\ˢF!w@"B~]W9â.ܯ55o'qh9ˢ"G%#E\AADAeA/j?,im&5xYK!_K˒T0j,j?,iN;Z0Q.gn3g!aQS:5ofnnZH"! ڭ"hWLl"H?ɻ+22߂27RaX FeLjv"k&ƐE]I#ҟ憤,yt9UFၪR? ?_J >D;%^%kz#e5ȣEFCa?:b,:'Ϗ'̓4-jע8lfno_'s)-9$E91t )@ZgƄ>)Cܣ"H|f_X0KuO jM|4 8.4bv҉q"uJZ)`,KTWPB 7lcP1Bۧ5s'"VPSfSTX6#bz&rZ1j-?Q ;pl9!v`1ܨ?Ic ʩº_e!4; f;N[e}kKuɅnQ-f |66u!ySy 拟huChOlP8 o@qXpE%A=b4s_AC- *[i AZ%~{d\s{ ~T`-0_DdSQ3I|LHph06liXB&:yEeǐw\Ff2Gf.H#^ [9M*ehxis'/Qb6 /hB(:B$A1|t5]Pe$1]d5??.?'f={}rftƹjGožCKMlh8!Y3e#%G8f4n9ƅv6{y^r :b=Tgn!e绐!UHR$LJ!zO r=qqŇU~ja=5Ogeh,du5أwJ{rVFP(f t&yX^w ɘt >8hz8nW͎h)# @Ķt6zeBҐ-yk2ZQÒNg"ꇮI$#}X[F[f[f[f[3 l rxknG'@lͯobD@˝n'Ugi9 ͪ"(lr̶"88|gP>`Haʆk_ЮdNom7q#% J yn ~{ʽC 8[M;<}0\}h7=Bʷ8,EtU>S|A([-";/<40oVlj |-Ԩz$fkS _C]p*;AxH4B*LpWF'*sQ8qaC/ m0 y3xo3yBe-?a#($y A39,WAUH~ȋeه?хkfR3lK]u#~4hؗ5kƾ[ߒcnRv(Jb|]s-rG7k/ھmrdcnVݴ{mNbQ{ z]<,?r4Qš_F{NaeY?WU*s\?WU*sðw Rq{7_ǸRX ّeQkʍvFr]Ѯhʍ~69Xo}Vܛ}UW֡6N{_ç6oV//.n ۹Uʭ$>Mei<͟ z<.wW[R.uZ 'u{@~:jvjpL\u']j|;pfeH/}k5Qt8o_Tf7{3P;M􍽿C/meeM" 3۷%Mϊoӓ$l, ~~%YQDmdTGeH a0ГܡśA~ššG KShkJ^(CKuE0ı%U hDQ+vg2= M>BOݧLUj_uq韄nXvw\v˺.raݮ.mO(W_^l4oRW\7j21n=N΍htmAzrVYl4 *?t¯JcmhvvwW `C#>'#q)8PՋKw4u'Ž^7SVm~e#Bf ~} ^u|q-qt>:j_x ؇nCEF3 ]݁?rUuc6T/pQ"s n&;nW8v) ^d:]u;!9o@}=[("OQ@O|%{y,&~Rs\ ZYg`f"1E"ouwV0.˯?JT;wWjIsfU*/ 3K3\Z9zLitus/[C扎gVN l^+7 a冰`ټ25s{eؕT_wL{{)r;9ßo S0׾'f냷}.|/|{|>7],]{w܌EGOE>WnJjW=v+!s/gxVIMHS+VnbR%[F"#`N]O dZʢ؟!L|g.؂FR ^!u}EO[ZS֟T@' [rˎ ]>ٕc™/iZ@J~b..vs+i/zA۴`x6Ö?foM&}'{h`w dhӳг{S`@>:=7jS2zٜpm״0ӴfZ(>/- .SW&ia?ia}I KK 9I 9~ND ^Pã f-. M:\q D0!-^|%(%8/?8cR:CZ˙ L%$KFzQK29%fmT|' ' !B 9G*"6{&Yb)K{x1qL0wEͩ tK/k6} Y1&qNx_~+82ۖŠ?qϕ8]s{?2Z?Y;&9m$Z, e}ò?6:l[Vyqcm~.'6b6ߠovV;9nP2SK /x{D͋z%_͢lnnzx<[kPtn~?HQnOsģc|iѽpr؟1b !T[' #M"-nsyB&k s#hp ],Mj9#đQ^T0{D|ׂr0sj|NrGSuCsFM q2sg=a CGQEB5[N'X<GI.J 'lw ;9XDPX'oqf5@ ,K^k($nK:~ xz81a!nwW$[p2Kؗ|7HuUu)~ BћSWQx# yUxقR.E"nw04jCQKg6B/p/=ie4/xu| 謨w!]nGfE0&1BzI@PlZ.DˆXzLT;!@;($R\],dލ+;]*C*8΍BhfC WUË`h;\R;5NR ƄZʟ.Bܭ` ?}݅${caY\cֻ3GvFy3[߹l6za8\&ݎZSW(hPŒԍXm 1Eyǔ΋ipo#" NɄƭ@Хg:MSJZs@pxׁ?:n1n)>]'^v54Ci]lL/wK5gl Y8]:']ةvi ~`ӉF`ಹI%tmAD`Qo< rĉ @hȃ  IyzBo2uȺt@BWWښ/IlAta5$"KG{I[3]R"9p/݁5F} " ԎoHuz;+:$& v:-t>4Ț2s7  [;AcD{HGC>hII]X> .S yv>ZE {/ i9NǛm?GJzFSc1:8/!IZc3`UZ&K5% "F^y!PzK'NICob\1:=C,7;M׋⌆S '1 27cS1jP/i$FǮKfՅ?@l5-r- {yĠ~H1Vo[ <: Yzf+܊K܅c7@.o&NHx㰆wzh'n.ő|/%/i+uZ*i& ܎^@j{< q6ə 8n>Wn {}~v4*آv RA,0XOs8v_!6{.e)'3-3Ȟ=D ñ $\thũCi\Ӫ8ռJ!ŮO4pJz v5lG.[^I<4. X+1ҕ?{wDeoj_usV)82\@5Ѵ `|XU c*%0u~ap<,'oqN I!qDôi`$)֒Qi[%SH`Q]C[7/r^.r/ "q7߇iq'W܏ޢb|!>Lqz><""ޝZLȷdJ$[ȥo'#4 /Q{TAF(VwŜػ-,+/O8 vπŌ(ڒ-R}d>P Z]!!qO X? ~X_ޑ|HbT̯#_2tN3_Fg/Q_H~vv/ wIs*>} 43gmK:B~\qb:'ctc,giٟ8dM+ 2;HP2ҝYɛd)hF,Z#aF? lJ/J@P\ATSrr9TGB udnk A$k֌4] 8 ,Jf-KZ,4pXHuϒAǴy:=/Qb{C#ߴacjQ:؛S%kq'nH惿ب=AcC7S&xYdaY 9#Τxy%AAsb 5JJ4tZqg+"IJ?9[+xUa7,FҌ430!/w*'aw̬1TR^=*Yn[VqV|ɜ|*eXtj`)PKi|=*ӁVcm7K\s^`}f\R %~$ↀ O~gO=8O_Ѳec Ã_=XpOLF2qaI/[ 4:\ iG0x)<tM[Ji͍G?%?g?ώ|2uwkQ)yO!=Z;'S(&<{rp /_Е܎_I@i&xhWʏ1{T@@<.n@)5pNe]<ɻ؞XoT_j|?Jz'EKlxm"LF=y'g7c(a̲)ch`Cg:V?CĎ2؄NWT4KǐH wsS>)ޡ8;yʱ&s. qL$xs\g :创u@0О'3b}ԝk,*.:Y |j &ـƳ7_13Fs}`<S9 VOǁYr$O%SOp9S'wKXS/^@t6U<< );w xf0!2}>bduVb#` 9ZN#5aP6}UC.)aT8{Q<1^pOQn>dAsͿ/ȃ|ȣxwE[RUouE2a䉏cLD߳YHNJ½(g!8s(>{BudnuFIsy+K"BÌH'eP B{Uo}R#߽͑{؄Y) pwz~ Vi(ʨ:D#i0t Kīعri](UgDB.ԢYE>ʅT iJ-TP90.J\eM18+'bcfدl~7C ۼO V]gб̡3oh[ɢ>k2M c5t>˛P4߸_ JG/80eO֦,*N[C⟥yvj ]99GqAPX,Vx5mE[ЇE4RyY Z|#hMmuW4MmͽH}MEб{AWL^ֻ#SAD/\ 4X'HԭOE:u NRezA ZDU܆duø!tƚ$M:xݘĸ`ڮk`9foѨt׵aحLq"3ZʚVFZfd\v^xXsZ1c0ӎv1 ܃qM_7^0TNEwķcvuEfk]оfy6⋐ZŲ̲do g xĸ!2'X:XrvqԮcE0ؚmڮ,FDOg܅FB҂-*kEgaAG!aA1;M/WNQ F0eצe&'LS t-OwׇZ& \H*kl8MTM ՉlW.JʸL{hX);6m;md$ĶNcS,{.=&`\]JDS̊ iqohZ3uJh aƀ7%$x6E{7mEb4a~}נL ]Sl{ 7j=DֶuʧS3u֫@FEq-3 `p4ýow%-{a;. srټ@gtm*XfKcYc!e<َïut&"}Fv|>YIwQW0qe~0qNra` Y2AJ!6 ^I(x{~ت[Mu?Qy:?:#<DgG/?Or_=Wʷ#&J*v r']Togl1{~rL=l9+@q=\JްJ) ]5wnj| 4rAҚTxju?F[SuwV@1unϢy)# U#/la:R0zPUOّ|{~nAa81/jeGx0va  ;4kZt1ODQ"feܿUR*$Xa]xutF~Uqb/}XeDܠWv2?WL5-kut nwVJHGf_T3*Pt#c,ٜT%_,k^UFF mIA|0{yW+ JIޞn˽(lu+ q k ; jy63"pR`%L&8q[]D !ObAb^Q}pY\b62Sse3{A#7I/M8OPtYoS7Z"hH(X;Ծ]R=eNjq1{F \ %ۻg?xdWU ,rKEL `%-RLAIrrk|+r2yv:X )/1sށGOo ^^lη;}nޜm*]\^{w.]q sݰgPb)F{[τ&W?{-r͏5us˻=}8՝$[TgJ-GKhs,Ń[+84-mHPqjh~^5{ͣNO/VqO7nPrt(|_S>q>S.p|0\[\ fe)U)O@yFJ}`o/aISR334v v.pu9DؖJug\#FyQ[ zXak|ن÷)Ӽ%Ő-@qH‚ڱfǣɩuWmhT}ZyEʹd@mًkOgvRhdmݣ+C{*]yPc>òȚu!Q7?=8jiF6i yэ?UUs${zcB.JƐ&Ӿ )O.=f1>yddߗO^|wrNäb /W\kھ)[T9/W?a=`p '#/FFx\Cʊ~/Y. Wiw:W~λƜ9\6i+ڹ ,J7:XDOj}~I'gةNx 8ȮnexatraXdӊcȅ9כu!lzZOW[8 >WBs;OIl.Zn1k1,f -  _wvÂ8Dػ7 _nj>,8iuRk>X1n2<54 ֓|}w>jmm4,Nj4uJl7/7mǦZ)mkQI+*Ts]~hKu땶v2V79'jd#9f^?tٶjŸrN<Ƶ87X 9ZTYX0Ex!'~߾V{jb1İ!fe_9$ \O(q k8dö\Pv :02gūf0|6{57wYҵ9Ł),\?4sٽŸa=9 ٓD⣇nQey6431/bF;@n>?zz>Ւ3ܪvzkB?3rUr<Ӿw{o 3d=w-\޿7qdgmIX1`ȃd' Բ;1 糿VUe31KuU}!^'_ՠj1(q[R/`{j dLm_v#VĸF3 mv`<:5{=K=/qa챞ͣqq 4C .m)P9jR Kk5ˊ*_yNFP_[YEg`&gڲd+Ґ+46b%C0:k8q')3y՗nݺbA ?Z1 p2zWpT ,'挣'љHX1<̦9>[TN+\O}ׯW|,Wx8³N 8Rxɕ_HEYTiKr .$[b )t | jXfDor4Y}S3:;kf^a(vt:Q4Ff+c Zq&L@7ĖʅQ)i<0B\{0UCEY@,CAc)/"Rh[q ݧv>⋶C6إodB DHA:؋ rS6BȰ8ߑO7{ +j`&uk'>Kok` [ǗO<vѯ:VJYb8m#sl\"䥰k%r{N/eGP:'I[,cq<C棭pyz* zWR`c $y N+a+\ORlj@)PtK~cnr!L=~E{mM'&3]}"U׷30m;AhM-6K[?Ei?eU rћ[}f*.Ȏ5,7e9wkŬiiz/A;D̮pNPS'PEHrq'NG]Y`֗Jl jߖ")Ę^@;JZʰm^H`1.4g*+#m|͘t#Sղo&$V?4{LJQ"x>;D.k#( }p|=W=Uj$jEM$->Sx@>8ݕX&T}?.OPL1J)n9@ Jڦl꘍f!}£]P#m'G/YN'dOAz> ?k U|ND/B;Re:]5ړI0OeC 7{ZNjTmhM^J;8My%U#};D.@@^ܗb72v#a)o$fNNGcsbm៹uU'k;rڑ;*?hg$%a-ۄF ZzYQqrMTkJ&n0/e1LFdz&*.T:̠(zdVc~v޳|D$ԏ֔I,XmN6((Y:ezHQF .ɶQ؇gj3 ЍA5ph̶.T54NDžL%\:tcxKK_Mثk{l^k~ C/Bt 9 SDڮ_VQw.>7 m+Ah>Zw_1 KPF.SmDI2nC>БPb?cW`$N".X4Brr'R6/]K802|M{O@hh mz>(|qp3KTFQҊ ZF[Nw:eC-P0kHrj_^Y$*_#4[*-/dׄn-Ԕf h܍߄ռDP26`9l\:jK?@4k\F=`Dv"aq>89}|&`5YX TlKs(on@8y+Yc N:jђe6S@GSb$6uDRNwfx53rBCeTi^A]46DmAY#dN[)K:IL)/}H)C$"0va=@ z2 _o+G3 gC!Q*H7DgW&ki~5Ԍ.Q ru([KJ vD΁l ÏKJE‚HAC|^(C $H0fZ]rꟕ֥Dq%KE01PY7ɌJ=|$o D Iİ!0O8&V/K:faO ~_ҍ8k9>/55CfV 4UI-i F"(4ɋ_O880fX/yn}n0 8FhmVP\fh v=DR"=?ٷi뾆$1'P$wt!%9oQ|@R%v 7',%ZX7 yMĎtAUGp-6Rk z7I1ζ].pyG0z1b$ya3B{4 OOj7Q&Q1c24ŌH*fa^\%]P ^ .D>^g*q ZT`(R~Ok7ztDHk-pjUeTU= Cӏ_[nYB{r` P(!yfS+)tonlky~bme |Cҩ&jOX|7$4?pg -,hZ })kijFPsY $XbUa9j V $6ޛnHc׸55|赡k\/rh3={g*vsH~rу׫iCÐA' 녋cc(n،rM 4208O&g 4L=NѐL V._ q|K qq"?؋Z' zDDpsFx~iWx@.e~ŝـ~wkظk69P-?fJSd&&0Qyua* 2  SwiC%:41f m=*l&HXrQ Kex3%^<.v44Z2ͩaϿ- |:"3+isC0 ʧt&OS,d$wr&F&rq "; )XEk؄ءlԞtmØ|tó)ax>İel1JؿDׁtb o N&DPrxDL  \no6ܳ OWl%ƇUeHUcLvb v-~y:~=BTڅ3+:R77оa6M\2!jm}>k6ɯ8C,pVY׆^$qhL-72XI}[-Ch#w›,+ 1G TL867 $}Xp":y3=XsSEJkN /a ,I80\Ӧ e2.MNQr_YxA\@l 1*LËD1KmsvTZۺCAFRƨn~2E&Ҥ,W$8.Ҍ&52\iue rGF4Ƌ:@"1VڀqLuf=$I]DU-꡹T^yXH8B-ԣT,)ZfпFocz!F"ƥz fb)\l&"'VOk/^c?ĖPǖM{q&|M^ݨG[lF3Qf}kA:n$ᬇ,11ǘV$%&r`x6ͪ~RO${`|&t1Ed6Qnqg'p-A,ztXXHs7%0l= =^U*VWö\6 O"  >}DX9jل&ox-Z}\񶣐ڀh~=Џd=8+6ػVRjŰpr`(ڞ0Z@V<3F!%+,Mk`aM$ӓd^ Bk;xp|Knp7{µOXzu5(/mIRS82'`rMt ,UɠI3y&D JPԌu?w߄'7WM)Z y) `˱O7Ps׿vɭom@S1 Իjc%X?z?/: 0Ftkbtűj  F-ӄ.dSVTeO?qtvtDOa9l}9 }`d΄8{pAp+FcgxWK{/`&Eo [~TЀrhNޅڋG|,/1ק*l+$١O Ĩ 61sԺ@ױbP\65##D&"@iY1{n t2 •og23$meX^}o;vu\^g|&O/OgS-gCW+߂Sog# E Wǫoo,fQV9v4w !qY/G 뎛sd#x\M ; ׊ k +w#-[I}<"mzs)&G,@6Y\&׻VkEUdHG&߈y5Db5xӱ s9{%0~!yAdXط95($ y8UMX;!vGU/QH'@4Be@ܢ$'?o)02]{/t=S_dPS""l =7i"#Z9IM{] -PbC^q/A/3C94HO|D^ $k.b0G8sdZD[ʗ39Kk eVbެ+>[KT+ކs >\!NyH=C37 /id06>:6sfXl<\ 8ލaJBya_1m’C9o4EG>} 4W{` Q鞚!%/;C#-W($[ j*yA͞~8`H8=.pja}$q/hB'nBkU2Z,hzPD^<~Af{paŚ% iG)JhgPS+'Gc,Fs*%!XV*,ҧ{w}5=}Dq/3i L:fֽmYi#Ozy[-r:|?Z35%3w U$dG/1d񰗩? Ė׉N@T"*ƔTS 0Q&UU8Z\8 GXY|ny&.F}」S-9V0$NaZ<O]BJ^\](1X͗-,8:.x! nRg쨇Cy"ų󞐏ã~x\騇) :'1 (hj ?JBso5R[z FĿsܺE R:oiŒ`,1R!?f%'h_/s -ciP Qm*v$܌͒A?8%P{߇=MsK/%n&Nb݀|P;6ĎljE?6 V `#P݌aW)dt`1[NtYl(c[΢'҅? NE(Չ]`krx(lq;EaY6οiQgIR']Ѭ,U< ,ݍFm]io_TTD$.ɞ`ϙ;NK7f47^~)x-JLNT|4(HV?ij?$uIp|/j%ʐ:P_!SDdL(G+ ZXWmKj?#:QEB&sgVR %aׁ$V\^;Ob]p?eA\eMgQϚ ] =3Z|6r)a05Z x[/^u(~/]vn@EB0 )0>Lg(:8VbBBR\~ٮw柰n3Gc|!-$Meځz;Gk&u#"M%LM5o[Ő(m.u6ʰJ:UIj\r]lkqt;P\'{އuZ{ڗΓ <Y5 9I8R9uvF ^`u5P)x]fYtIC 4O=IxY\t݅)NU:y>8 3P0EoʠEuKp&*Jػf 5C| _gBȵR 8gs{tIi'g޺}e-Jh .NB|`RD*U$6sx)eeRi7gwt垧FfRy5Д(|s* _ZipO }vH\ 4tpAʴ|h²le'" R3_@4wa&F0!=9z K83];YtUoW"h4X΃"L4 1" dpCGV{Y ?H 8w&rG7H5Y;G;kj!Հό`sTLci ɿ(G L-y2갖PVE;^b[/hQ@m s < nG0z$KVt_ z6l !ěPG'/N]R,t :yxpE\uԮ:+[e.R'b$Ghfxp-!YA W%>bstl,{;6NAmCmTʫ!5cW``͆ /%P5Z:ŀ\@TW~uc}d!GN1ӭm$TIJtКp+%- vI–|A|\";Skpmhb<AU?] qZ_"zW *,s g`t%Dh%\ CxF,Ƕg%kDDJ. d6였>j%$u.@h3r oͥ@H? I1SluJ@$#2$C "ݯ(dMt?2,Q1yBi ބ/lxOէU´!`Fܼ#2}fwwKfkcJ[Xlcs㿢&&g CR?c-:/l>ֽ{[ o;i2lG@v'N8J;=ʐۆK9OgYv,:c!DJ1\J+sbi]#Z 1& OȈ,~>;0Sdj}^CY v}u]5\;k;w֣fkwm-q&~5 -Ofvn-7/L*yhcoj&J0BJ\Ir=4`S8Hë-(`6@䘂yQEZ[XS6p6kf]A pZot(0ֆi]RO8@= =B&86 a$O).ҙMiߎhVr;W Ě^إ*[P:Ih%iHVя^o  Ҵе_.D1B#s)`*< :Xj¨݁K _ W74Oq` څZ8/9Z^ f`IWduB5{wwʮڃihiX!eRoR"Ơɔ`GRkQ޶Pӆ1{j#)Ra:TņC( $ $Yh:BbV&b=HN[غ|$ϭgDA*eYSΐy&ftJdtR;p \3ƷrYe*&&-Xy(u2eI2lRC!ˠ#o5^&G[0%{oeJzg5|kNqڦg?={˳z_B?~tx\#cCw>F<"r]&8%`I@O{*1jqdY TʳãfhJ!' ،3Zm`$Bʼm^nP`+p\R^*z fo.B3 q@r`dϘP6Kz;6!?VHLI-Mas~qâ9_FJ(3ea6,@$oҫ:7ٴW|u=s Q.fv5~Mh,=φCe"llC0=O0-;.0ļ2taI]pyVt&+R DDkr.܃F^b8,bwDm&U P5$لfar?elLIxwMIn,πaw q䪐Ǣ*ÕKA^@dͭUb9IYtkHOdBN{JsmFkwr#w[? m5ZU{t:Ŭ۔X߰{|Ӊ" fxs1fe)J|PdݢMdo Xt*9'0J#"v( oyl4T:$׵QA]4K lH`)C!#,lâ#qmZMu{tQ0ϡ)b.&Б`&#S6Y`=,Ks|eJDū'pR-U`uj@ l1q7us2-% sBT]a/1|EP).'>%[n29[&!uY0=I KЗ%ذ]n$e38f<MWVtGBt7&"c8:]S4EPS<(uoSVf?nĈrn%Aޮ"|'ǖ6̘!b#Bq/*"E:QM~4Pƨ9$\5AdPal:_vi"WLEO͡G77.")זJ -b ?e$Kgr̀I::3*Cs&,m )PvtCgE)03Vvqݖy\FMha^t 7C·Y!4)!);J}"ɘ"gxL nZ([| bY_9'%qhl%Io0Jh02hʾr_WW_ctN*<8kՊ6i6$ی/8!rau H{2}o۸ I bTn=&]ĎwHk"g>Ҕ] 1fGrŷ&kDviSlSjZpRoe}rQQl W(n/b}6=ƫ&f&{Q8ۮAFdwSZ6-ЭM`9/Kp[&)Vbe_bW=yM]pʔ"*◂O4s9ACI 7O.l<Q[@kIKyGE%iO('M}J$/ϴ(؋(iż6NK*6}֞G}lN˲AI4׌Y:FHyAw. ns{4&[JjaU$[?@$( ,"\r,$!*1EC^heט9ƿ#ȇvhSXA0v6a c)F)TP?fTv/^n2Y[Um*Ձm{|dO~qp||Y-v$ /vI1 //hb=J5K&(Mw۫tg<U9Rk[Dm8+VGI,/.s xΉX1EykO^?==xf_xE;v] .\ZM9X bBݴ.8HqPw>*d[dk4-!4-`r,-2?e %2zNs*.CrN?".@'D8OdC/hݿ5 P'cZ)/?rH 3Ut*]hg&YWd$|{ì1*x9/z BK*rf5\X'$CQ([gو$Cp j F:UvuPkCYڧQ!^]s pϔG)B/QuP Zzj?I^6/1b/Y*YMɟ4L1ny<>}|& p3.B zN^ ޺e-$[ݭ"a#j7J(RL}uG>XY F>ɗ%_ .WKAϲamJ9 եl J[{ ~VPɄ1ч{L4J\Ԡ eWNibWӿ@]CUS>) -VaVa(QF_Ec|(X?w|X!QGVȚ\59yvi2xt"VjaFi5uP#rBӢerxۨ^b)_Ek%Q<fIo~I|[$e:>у}OgUu-F#8kqjAqA46@vEnD?"ƪRzAO<ٚ&gMBȉQ1>勼/{f;[;[[X|W}GH h{ˣcM,g>nPֵq* I֝ WFϯlC?o_>*kjEyT}N^Am *DB$ 9:xE޵zh3 šJd^` P~VPbͬa]OFg;YT?NxD'X7m  QЫ}?'/O=ڛ:זEYUgOW\efBJZyӃg'LfZT R88>xRϣfsg7>sqnPSd^fxb EHJ9? G R`^ ,bZO<$*dP eC b_("tNd~IDtl(t~u&`hH puK'r!Ï !+ųNѷ1[} * VP%]Lw@w8K0~Ž ސU8PurnLqr"ۘEå2i4W1dt-6s.M"n`ꝫ$+]|vn:Tk1/#zQb)݉`;SB`h;k耇A+8Xy((әV):zk.2k eFcb$6KslDDa"E8E,^/db8="R3I`k4.$k9 I\-T3㗃; r8뀦ưuJ}zTTz%8Bg*!S:sS1^mIwbm.cq1l~6n-nͼ '[Z2|\ ,+ȿu<^-AX 3JICتh`Vhtr*=Wc]~]\%\2et\UqK/+ \~W(Mzv͂y\ϋ ȑR}# Fc0G?8nc, wF8pb.3ړ,2Z{A%@\AU_n E=Bs:_[;y찜c@>zgrv#$W^bV\$>t0EoH߈bb0.Y $P V_Zè(W`>s0A=;>l,3kf@ɺ̿'PH;Z1$oF0~-%A{?G,!p ]r4d 5 ڝK17mR桋m6b ˇ_.[3${+EOy4;|dxdI 'Dx#~b4c#1 4It} ̞:"cj%L;h},Z[ *{?UwCy) [mg0اŁ|\JvkKўseFSZ Mū_ G D; nK#:N 4f C E`I Sfu3uy&̧6"b˝5.KC9" epX"DL$ `b?6iqQ2EFm$ gъ-N˝%+9 8ovB5bO6G xJ9X]v ~LP%Z/xn\wɖ1 Dze>&X,x0AZZ8 ͞ӐqV\nyxT2GcR&m$XYi*G j '>tU`^ {NSI"S6ıDX ƒc`r^eB[lC#;ܪ a!okQ-F~k:,*,oT =-hTǺ_A (OuJ ޿(vEj d8i IA菤[-"jxʌصCPEFmm3P̦❵+FfH&&[XAk*Y.["BTPN7rJpl|jARmV mopx*i}Q>ڝ* Ye Ed@E,Z1ʜNI-KKBEwe PPi[@!:PhHv*!ݚ%(v[F;(CYVtp^pq+Rˆz~e;yKk|訚)\\%љ/*XVL]/m1V{PQYOy[dA&& ː}5e48Е:#%A P,#Q$ExPky!9/se'_-9`X{@a)qr֌K9ar.ۨR^g`Kq\ Tْ.m!xT !{s"cJmgw j$7r~'Ffob\N+<`fE nr2pW ]D^.OKu5=掇 Zkmp)styd3G@yQdwR JVR+*`.RDVW{>'!_9p/*9/aG,<:~:(ewLXqHLĵ Tg(mބ_r6isEwϒ<؋~AWr#x+[%+e+SXXf2~X, ){'$^)"JA4rE^ ݿ﹫49/!SsbRyu#S|JkOh5 (9i.,:r qoL &Kl>"rWt.Q3MgHI@ 2FZļa3:ELcӶ\s ɯi: D *IZvNxWd?u P\ Hwz:2yg L9 VP8 .哵Cӧ?:f5akgn'cyY> 9?}T#_Kh|eULό-F J4\:!%~;oPjڜ6VΈ,dYuvF—;g/Qkv]4rcZh~ף SkT=!{^o5m$zthp6Ms,u͋hyy6@-2#&erIFѱTIg22К#4E2V6H7!'[F]6{ưNTS <-@,'tkH1N؀'}slPM ,l L"Md504 h Wm&@\KZ(BW.׺fF# 0YjvY Ck8!tS0=_3+:,>p=xadA_&9\phl4"r nA声|OZq k;bnt)͔,B]H|1[D5=ђo%Ebp^Nus#ls}kctn ƨ`ȇ9]ұpalMG ģǻI]"i Yq8wӐ^C+/$bg\fy4C4FG ] ``t, XfuB,W'- y__H'x`IJ*IO_i`!W Dv{HA5\Wpi -m Ǩ>")jШVWfg:nqdϙ Dvmգ̿@kx$WFj.GK_iSAǐ Zkpq08IJ BR|bPǿVNgtG]}MyIkYl0 Vs xm6M[p}?b roߟބ{\Ո]v=d&MNc}.֒ 2|x],c3 SS$ L fn2Bu8ddlMFQ%C& 1yk`P"Eky>5^:=S|H Y#[Urƈ& Mx>.a󑡤lpyH8Lӡ=  ͌N)ht zԉDSHZm4}{DJJ YHbtXBK!ÓZ3 0޳@qvdVtȢ5t=ƚtb(iSV婗M Ma18'L:xhfJFV".>+F\dtZ!.0F0EY^[4az<ĶQcG=1XX(XI ! u8kSm۫slV>K ^͆R@l^ih4]hVmn)p0デ/XYdŬ7CGz/e0&& Ѵ1h:PVN܈8ƺvmH#gvPG?IN.WO9НS t`Ŏf"'׀\42P\ z,O\7ˍ0ύh HuSH6y<. W"A\QgXa m7L -s wU}fUSڌ}g1l1e )1N9_<ދ)iߣ@LnޛO$+K!M* r Hg8ѵѺWJ*cYMmGPUe1 `mX9NP)*wK0&y VryDJ4.WW_.gzʮ @'d]Kgx١M˴0A% ܠQP|z`xcY S߈࿽3D8%@zB"h>CtVG{h1QLEaBg42{I" ɴEk7zPCa9RQ!nqWJ*YyL3kaeв_qS5۱ Yl&0`RKn4~R4֯𨇬2 LZQ(`X{Hx+6SG EY|xTc],֎wQ$]s#W@ʼB/*dGE 򩺩ϙ;eRd2z X7ZX.K;q[De+P?,4G(X{ =;UH8WSNǥ9b@軡XסIVCSO\ jo]Eb'B dy-1USo؉ b5pfNԱ8 ,wSTh>/{{O32eWoP~t vlVQBˠ\fh$iW<$_YKgP.Sm?/u;:hsEJՀk2]U(>1ҾfDLi8Xg`m$o@c8uɞq8] 5g*vKHB)QhNa" _o{oDH9M+W@ :E>}0g~e~v_+Piڐ]i?Լ6:KK(ɲ<-|r} @~O;dcx6}Փ rW; YV(z6 A1@Q*ry9'߬{LxÁi_+Mt67pn\sAJ7KG2-aTڨ~hMZ:$o,E#1j.t3 vHy]3p EpځDPB_g Fw+x#IqV,|X-8&ooC|_axtF;Krӌ#-m E.h`tiijqg>NߍƑW*| T$ҏ${߬Mx_Hh#adסO%.Bq2@h;Y[eNQu l<*33 3Bf n#^e=X@5_%4PT>N7X>-4R84㠺ݒݰP/ $ޯ-ֶ{`,ar"%Ocj* O8y)F9ŕJ;}k0p4>Z]zG-s,wZmSZ*+U/6ccEtCC~틮jL9_T5b* #+#䤝vA~>=@h/:zԏaH#>ُv+toJ>Fĸd82 GGw͞"j͔U7f(`Afw[;]{Ym%tn䶝SknoG˩D/`  #Eγ9[K][R!u:%P1Ó^}&'\`|^A>ڻoߑUԮ,GO-slѬb5n"jd/@/0Bf.al=o[\p6KLC5<wY7Cds8;Pwad \,}eZ4+b56hNgd@}M,iUԕQ*WvZaWڱ@M{2iR%ɎO:]ZŸZ@Ja&$ F'c[ bbKqqv|;3L _ ma H9=8Nk# @aapY] PD,4 L3;F7rf` ц>z 6ĹFuD7 ,hbeF@CFp!͆SNDb7#\CQϷH4GcbՓײtI/\\lL=^yh~oǥ_L Wͷ5b Ҟ4EFA̎׎4sוw-n_V Do/26T+?Vkݜ p6:_Gx<=̛QwO-H9g]5Ovҿ&`ON~|^t/Ӌȴ2g4yPᣓMKTB*r_oW\/G720ciZk9N ᄢG?םO-AF!FdKd:(OwY0at^S(m6[[ucK+ڊ}ObN|}M9γXb/(LC}w޻Ԙ\8Dn< k4نЛ ,i4,B›^={[}/8+ڕ2Sʏ9qjg~UF$تZɃa<}O{.L0L5\vޢXoS([SZht;czq)^N/\h(VS5]k)/<|^>l p 3&eQ0;T\+*?G)O)2}jqnjh>:k&di6DXO\IΨ`VNYBGtlA p|(pvGp "Q؜yGBJ.]8KgEǼӍ.tXCG5z2z7C4N{>|F~iҬMyV^%AK݈oiEcHTiMكPRX{I"kqpH_P_џd?n C=KdQb;HWi4"_]g}%JvQ?384×OܣbW37O.ߛP{vQ%MDSy{ Dg#lܼuӍӍvZkk{nA럧׻s;m|?'<ѯ=wh66pLlv?vCGwܳ柵Vyd:k'9w*3hIιo&j\i)AH]&J!"9_3,w!"T, ea_[X9R Axſs^ ,] yP tydzGT ɸ bu罽!ۤW2LҾpQnd\nefaZQpL]ZI['[+5s'*zV*6|r̄6NAw)ߨnK^70J1-e)6[2KUd'HkV:j'޷Y&$B DY$ȱ&QϚ*CDQy1W(RjEI&&䵈!h6݄c17z$A>:!j8ZcYKg9hoN"G <EP+3 d01TD p쓏&Z i Rr!Bd˺N˖???;[;dY[}=/w4;O)yq8PrISf^/d'lxat.L /[59DZYw؋F32DQ"(ɨ;LhjtPO烔ݪ.~g4H %SFg RIibwC?qCXXjcʌB0$d<^)N/Fޤj"@K;3ma%RO,ex`{$ kˠPŜ@f+Fz![h/p"zi騼OMYs|Np8eFu?xa0isnJq@xvEa_m~ ZxU[;--$٨GhmףztݫG5ׂZ:|h~oA-({U{uX߂mwshD(#Yp!6l|?H/%n pvU[WT_l:>a8g_m[.%~ys#ۼO6n|mY A8|M u[[Xְ斫[v#H7vv`ҾU[0Պһwbˀَz{pe6~ Kgq!T4L2JdoӾH~Ml k ^&+ 2l BJ f./FD0.Cr!($7zt @H ga7)̠!#tH;S櫞$g) \ TE4 \Q&s1L͘::OqR;9qvq.uDl}>NӮ N'DKTO&FQ~:ᑰ :Klvg I˩fD!lJ>t`raqql|`³Npf'p} =Dd4qCkxd5Ǡq` 9a!; 8]!t)lE?SjV$Bˤ(G|,[bB#yJG =4vp$(cw KSKxɫg9P7p4SAGRP›& 9,aT*M&(5Z5bʢru>eV[q!au@/{LIzv `H)H36zdcGqỻj^.Aü-9F&}SG&9btzC¼~Er0vJ<)n!/LpvM0❉nGt(jmTᕍc Oݻ! GH`" :CF_tѐAD0GsYO#ZC\ñ=ZbXЕ5U5_ iϼѲN]jqUI4s=EKEC` {%l=9 YfS›2ؖ.FD :Xdb,Q) +*J72Ę,z#Ӹz]nMf6Pޜdc4ပ\1%pJzP/vޞ^5l͋y5w!bjLsTXƅU[0Sͯ{eݠtV3=aIX?oTulyK%. 3Ow^Gg[J2Q;n2 *40y4iPqU!7%ncGWte.kw4o3/J5Ŋ /X]sDd"/: v󝃣yp䀑dڤ4EZ0[AT`t?tdDD\a:ӶУ5_6s=ޤ7ڂuh4$)o"ֶ=Q۠fW8:)f26X[z ^=0ne[鉝CPLx۞dp~x[ʂzA0rF&#]![ n>$N<_ar7P+^6db?I6>5g!k4XX80 KAd.mAmV{v`;ax>Fm2"U1fuˌFZGC+xo$$Few@v FkTRhr.~K)1,gr+7@K"ZEwe]y** 3{ɂ{gLxU_νR"&Y0 0Ό:B'o_m4c`Ƣ bWS~s?WUhqK;B@2Ʋcq'ZlIr>IzHkFdњwIMtdR0o_C> xY+j)."m„ObZKl`8_2 afZ c֫7Q-1XҘU0 2#`Bc!2fvY6IW#y{h}l^xF3C%*lK!E3Jk1!{jr-v7ly1F o ' ch9Ah#Do/AXsOziL+[pM$=NѲ&|;NhQ9A^T-^kh;=|a'>t/lOY\YZ8񐬬DžXL#yl~A׿+K&25zу0C r6S|38ɆoEiaiJ11]{#NI8p ?L d;SRG|Fd鋞PwJU84 שCDCO5 bi^XO{E'WxQDz.Pb!J"eŁ*ޤwloBT#;l^f˧E?7sX:RhurهTc ;$ uLBRe($p@>]}Żmx͚{|QpCp߉Qc$CP\n+b ?(lkoܣJF<Mlr.Jl\q랯qʧV9'U;qcfK]gm2+5U(&5ZZ*:EXhåqehuͻA?ݫa2:$Rq>YځUx <%^AlmدGn=B` o~{$`zTvwsd>T)뒤c23j\W ٦zI1;yKOFR3RZ3>۱Jx9؈(>d2 %| ם!.e]#X}UVKatޚ$+]m䀮b.Ƭ|HϺ.  E_iLaқthMGYoʶ;9` I6Ю3:l)ΞL xZWhFڳAvein{ԏ.KvERDhlT(e?ɴ#HI38+ 9^zy886. \E-y#')5:rj2!+kv'y\ޏrA\D~~,ƚ}t7vJ41)T:+ZxhuZ{m ؜0g,{_.^ˌ G>*Al-9 Dv$m1n6kOcmZYz׶}D%ċa`x[V7J/ACY{łw ;kOPA #c4 qlNd_=ǷVJ}uQplKPp(1h {CeZLwCᓮ{Ba'S.3uebh`JPyi%E5s7&XqRqrLq@kΖowZ{~SlHRO'?~PkK$9]0 kCHiVo-!wwghنޑ=ݒ{G~ïg#1My4htq`.y?*P+D@eK򋚉TBzXv0,U3́5-l ZvˊLX 6D?6K& #7kYbh[}jri2La`ȋl"$NoQԸ<еˋ-WEI/LmoSM!\W#*c׭A:茯jc[wU7 DP0Ta6qp~S^8?HȻdňsPeh[Eo)]o)NRf[1Pt8Zai>\@!Eζ@(F-f O+_im俛k;_}G8w&C?_"7D)'/ON?ꑕzyO~F |6 W8:xvUq>)*~>>yOFɞ.Gu=*C@u8ʅ4ę<wO0o03|ֵtdCEϪ,ՙ!Z>];b6e FdL\rɳ=Oq"of!HJq{5;VMlF?SlҴȧ7^Vg zKg2\Ƭo&]=>O}0W riYݻy϶CM~ɒX"TeG 㾰{.3?bo iW3q#ܢZ_^LK7u4͞㄰1ړ?0&{p`1hX7=X VX?VWě3ۃFìxe{K}X]x($e sƛnq{ƉF=mIQO끪n,)|EYT.q? r>OZAYK?nQg6H2DG%ByR&F4G?$%_@M p tL*3e&F黄b @y=͜E?S>IM9Ҹprߛ^YiFsEEl {EWW9z2a;&}#rINٌP,D+68]6 َӮ͒5j50GHQas(7;y8U3DРդPll!@6j5[k4wvoBlmJG `bگ<~7>'J.U|<=},]r7Fn'Ƽu/6c^g8ÑYER1:>89}xlůO_袃+J߆#~XKXrM+v*`z̆sϥzo/<9hq~4"m8<~I:ی}D_NO/Nm6BлӣgV="7n<'7,r+D /`CksluZ[třE)B,# x1`A\C 4nR՗h^r4A!}?ə's>5 Nt\Sm'G(iɆux1UPU*R kں niPƂ ^9xI9Q0C|L;u%|~5m*lA8r`fs&@B㶢 j]`(' rF.Q}^q݆k-zdVì%EclٳlyMTQ w뀉^L3pQfW|$NXQϲ^;Vb$![(͓D Cq7A1Y֖ej$I8'`6k#fxPo{MogwѦ̸~H|S 2R* ;şKdL/M pW XW8m1(!ǐb`ك^ ,ndzqo}ѳQl @}IL FX>Pz@12@.d, hH1lyWQSb|& ^k,{F$B {%FtX˓e2,2Q-(MuTe lr:X>ȬN.|,Ḳ2ΡƊ): r`ܱ(揻cBy>X ~ - JIl;" p INash*m*?Sj4A!EnPx ;@CI~ӶGe9f9Աga1%:7<"'Wvp; asJg~n+$!(#Pc98>ӇsĘOI rRrvS59{pa$lN鮏lZN>> 5Bz5էL?[(C@&K/009Wxtyi\H0G ab]}y_z0SK`g@h4l&vLY/A^0ҵWU np֣F\hp]km}^/EӍ?igL?\w *]\>_уH.ec)[5sKRIjg,(p":KS6.6)yѴwXPa[::8زRHS2P?i$v8[܉"KY bYd2DeIN.oayŒNV|z&hH.68RcrEC7X،d'v^<9xq^lcRw,zcrӶEdЦl;ٝdҹx;ܑ~l51n#T` .cw}N/F]Ml7{5#vיDǝ !*yBٺw.lgZcӸnlywv m_ρ^ .ѰK+mi:XYol[#QD.^|q-Tw8ʔwMK\)OVqoz⌶vT㉗nEݨhíik.4|VEL;svqS)j)~ut쇓Oɚ5edd**^aiɟu!6ϖYCsp0.kE(nz޶ mut+ɣԙ nJwTjm[;]vfsfYl$p`ka WC$L l62uSBmtPwiSul:5-f6d硠zdX ݬeqx)6QK6ۧg^3h@ΙrEBO]v x a2f#"όhc$ <\l4\҇v]cY;NOndmiW{5l&5gu<` .päbI7 %4lYj %Ʌ ~w;ԹdqDGdn4:2𨆔trmey<9\ŗƌ0l! ̞\`ip KvdF ;@5ftsMg4$)_,6=и5s F X5}]fh5e(jL iѣtrT,WC ^ rSJ&gUuM(FQ؜κѲVhAAd *^1 @4JrfXԴLm>"z*1to7rTjɈ Iƃ䏌&_LAGѮz%V;kb۞& (2|a&}5U#jrVM9ДzZaMi~)Nx@;::~( H" W E 'e$dv,rl z9>p/1;C>GH|\J?m /`>x_XQgD}/?q &zmBJ; 4_bҖpEuF?TS,H`k6s1NII߾Yoaeo7vA=c)%dpNE[*?6jsvOIP籌r:Y<Î/5j;o;`P.t vua Ѱcӎ@P妼ZAPaTi<{4#ՌR{'T\kp A̤FQ޸ƆUfy(5=ssG9 ^>(7iK l?id,Oaw,ۚ/swEW Kn;* G5܍,ܣ7< L-Q-gp'p5R291G U/C+|ewL %%O5h*9ohc ySb\,0vKJiuQ6%+8revBuGm7 xDлUZOx-q%,q-^2I( `b bd2/g/<DZY;IHpE'r?ciB$aYdbѠA21b6bZPP a4OH 1&u16 /8j4OoFkW;1 mz̤0 ~_mV3*=\0PDӃGra CCwEuHmڵsFUw}ʤ03K3Pllt{i5q0_0L.2#6+Y .ƟS,E3uRnE3Еif9Pl *M`r{m4}+(fHLoN\$VL՝@ 'n)Jө ZX +~H?Ɇ|՘NB:8]0^n;RWơ;< p1d~C2⚃ {joftO9"DO,㖴V GКy..d+KzĄ5R*ʼ))h 5q.ty bMc3"lYꖲ໠o᫴%1 z%#aRh3Tµ:hɹӠ,,c tL *fY zuAm5v$WZtOSƃŢ L|BzQ%d472@\ϧLJW_j5TkwjҠ M8XV-c.U*@AxlpvmuKHOΙl/҈87!@J'?,N]fm<])]x`j^Y #tJ^ Tq,ՂPf%*\㸽ʹ^kIi!` @z.NF\E2cN6ݗ@N8~1Rg4ӈ^@㎭6FhqgZњk=h|ʲAH%`9O1 utGil,UE7VePD$sFȨPNvCNCSE/>j͢fT`zLH;cK o/{GC1+RqF7MHŐAA7Dwd g"{3 f+@=U7l4JP@BlFC_q 1lh fOE*K2![1xmb_ jfJp+A+<1^kXܻs85W Eoeٍ-lcơ>+xyty0.K)E}:ȴi@i^u@=aZ,4?DZ7\1)d(ܒ+dc|n2K1 U#L.i%ޯ08,R ޚ(n5l[>4Zc*ʚ@3FN ĉ՚{28Kߟ gB ṾmិPc5f9l_U{Ia}˳}}SuoaRbA\VCSP;D97^VK*o.d)s"FY-kbFMD J=a<]G?IxCbL1.*/dG9?Cυ9IEh{=3ZC,%` %tWt A%%g7:̲4"ponNmy}e* MM]$ZﴇJkA(bX"ִBum+Y '9* ֊&No$w=ýHGwy2=CG">z"uX$'>@;)T$m:F7#(Q\iDhC b"[cˑ3-Nc~J5s6fw jzqvyЖ607[ u$|(85\Fc -4"ǰ)F*Ö  GAZyַhɩ`\wW[|Nm\WyDV1v F唤F."!D7DQQV{$ٕDK}SxIYϊ5ʰ(g$MjJeE[t|H&v?(S,hd%؍FMaV:$l&M4PZ:9 |#^Xbʁ&<5( z|5*(ٷG5t9SY ? 5`.ak_g.d ^!@v~Ln\ȯCRVLy5|ŕKPaoHl6mW lHt}ْ/7ú%Hc_Dܔ,~AuT4]tY0ew"sc"}l ń,.B^y%RFJɇm15n}|yՅ6i"*lY-.ʌ$+!5[)3'c{)%|U|#R Ã2q,/+DU ~i&hnƞ~UH9\+J$Ɣ_׉=d:yvkIʆ֦_ ,e5v#[w^}e@-,t}\ȣxv O_Füpm6JE2بmҬB e,ι'saRc*qU7 F#w劳^3/]U9~nIeԸ.׷M`5P-P ZSQIʛ*۵:_{]x/pe^bl% .ʝ]0IJ\4YٵBw0}^j!PsNgafsb9sw,i 7yA>, bԁ,a,,S0g]o|z|a|Id#l7&, \ե8_7W6d5Όۍm\5%(%5i5@lB'AMURzP];>y@ܿߊW f>MQywcՊWY6-~Po RbePk,dl{\$\K礃ܨ?MNu$)9'gA:I17ֵ{iS%D"f{6E,A, ݸv4}5}xza]qSTd>eJ4Y5 Y)mndlq:n)+9t^r|`xq[ JQ4###B6 dzٻK)&e++e& 0LA*1l[= iXwỒ>uwOOe1dw#yR9#sfkAuP|`FIPSWXBoF+H⤡éV-ޱ*MT;K{P8Qٞ54}_aUŨ&F!=(SLBZKl}rxtp'wNϟ<T7ʕ\(ٕTK.Bql#zk9-j M9w×OQ&q%OBl9w+#8O([fy )߲V*f}8utuz5.KTA -7N^g۾@-Go;qժ@.aw`+{2 uFӔ48 8J $"52cws6jʐ1J ?oM; fUИܝDFY$\<8"M"V!.y1ª]|ٴ ‚vA[ L4r~l܇!P1NNn }w‹"<n Ui?ټaOEm:F/*W[ %}kI+$ k$C靤E@%]MbJ)/ ‚~a놼 ɱPօ(!:͆]g*%Æ, P{^ 4vVpn8.2RIIlao%Wf!z!3<'ɰ6P^M8(kDsM*٘&?}+ XmIeG&v64 ibX"_|qPL%GX5iPւ8Tԇ e)$6~L'3z.m㙹$9Uu1kg3x|x|6 q 6:>VJw6ylq7BCEuUhף6pA 6YOez#ôE9HtL}N  ; l<P2[ jsI460US=UY, p E 2Ȇ&;vڨuÔIb$9ƽGW pmhUOJOуie; U,0Bn'w~[ O% UZk5T|rVx.)}65nwMH?<@>^J їM$+mivUNq2!(NOVE2l(`$l({&9jd)r2@3Nge-NG[<1phT$ dro璾.)33ė_|(lW<[_! ȅw֍CXt*)Ǚ;+.zPIcBPj*ts>ы %ST~_P$.E j~G#E$t) H=X*w̹1L'R+u\spw{qhX{I 3Z#^r2_ٷ^1fYչXi츹GS<B?$ 'nh=iH7{M 3u?}heNs?ndG?>j4 87fd{/`G1)2kcR0<"dxetovKy,ROuF+wR!4d.4 ޯ:  4lT4ng^OH 8|!ng/~5poO<q.^mOX kZi["-W0Z߭.| gYsE(Cb#G~@JG4s*.1U'YsaK3?yKXˁVn$VjQ[8޹lx}zT{lQM  i})]   kx]"X$;v.l D=8)U ّO8Oz\QS)0y}9߄tcyWV\`xN\Te6|Oz[G'ؑ =Ε60RX K%}ֳN$u;hZYf?cXlw f~1R`0-fejLPa}"&9:&-a|z{őNIM?0'/4+[Ѯ=(_UOu]Nz]bӚJo:B@Ǫ;2v*w$L.'쑡u , FCk-Paw*}6S0g1rpm:ψ8Io &EGG|eE) +V~Dëjt;^#"3_?<ލVsygfs-ݒւ6g;_0 _ E5HY\`$ڣ8jݻՀ&F4G?$Y}J'X;|K-Չ()dN.Sa?YBl^Dte߇]7ۨռcؾֺvoðwJ|—cny ЊFH3!)\ِƝ*Gt= |$6T,w\>D^.^zrC€/Fl-AG$5Ϛ P;@*l t'L k=YPv]j |b, g Ȓeg0z#ZCZAOX8N˩1iI,e> gZm`C"pkk]=~C{B iux_Xdg6O7IEqSv2 ' 3EY>?ZD#6fc"XdDMn.^wGV z @2fG<(s)-ҮMؼ?h _*dbĔIi-VbݼJR4VzZ$=P? iJu5~=*YԒLK/yV k(L>鏽ЇS<47=NZ߶]Bi6W07{t6pnz-x>;<p=Pn0%njV)3S%lX6bӺ?M+=^V =7ְ_WdߑOlD\w"e7A('rp}M;kQkkw !="G}ۣϞ7.D4M^t5E+ۿZw Y3e\FXX:lN,ǿ;2ɤkrnHV02W vC!DޟR@  FPH/s|"LKrNgX ׵ߊe^y:uk$/_4X.OZWÎk˘诪9P|ToU":OI`A8O!ߟzߗTA >1*?n遢 5s3#7(ey$Hv᳍8?#h2}csI>=0b| f:ڸQ̮l^O7d۞0?~~=yC=z`#>N)OͥQ&c|J!C(l +7<& fTrq_S A} p[Cfc›Z\N-aHz`'?dwGzX]oS|i#Sk/f~hy9;ZcA *~gO|@&lrD@!;RHHfOO~pN5eJGwiu{Z+qFE썖TL~,Y):mgGzQ.K(L QġqX22x׳jgM`uDV %]%) Wvd֟JXh$Q/d# (y]*:";$^/ᔓwg3t10)OX GX(%F{FpxXb)_-l,/a(hv$"L8Anz>IfPߡ*"I@0Eby{iTy^.]{T')nq.,lÒ6+q=A3n'dS _i<MGZ0&3!YxLa*=H-.=gh%Z§$VmtD TE=.2 6t0j< +Ķdbn_-v(,i?Qz&8!mz¨~8I8͋fd]#W7$ Rp .{w>~Ӹ`E+`.N\y| 8SXR]59g|ѣϑh CBZ0IŸQPj `gD]kw[( HsQ6vMdYV}D u/%hrx8v|tj 'CKY6 B%y+j>T=$t9tBdjLdW'j^^+TUUgXYS~;:|x/t/~gM XiMϼ 6M}{'k?t׎|& Gy#/+[k;(l ,kYhp^ұwTƳx̰Mq AS=~(%mQi11OɛhEHX(|ԛ^&x"%y#˿[)ƤN߱Z B  Wxcf)88SJe1i H] B9J& +aEC-:E(g|!)=NBl\6,̒UȘ!ٔېbM1yD1нـioOe==7v|4+ϒhހ fΛ貟v%-ڤ@ufL Ϥ)Ԕv65YDžh}Ya+О[1L -y/BE-PJaa^PgCb=6i\YtNLc"%BUY, N~ԙ$kiHh0̚s/$'1 Qd0 x(j/تkgbk{[foY(ӛwMδutzg?aܡΣlQ[>;T` 41xN7V#wC(iRG-?ZvqlcPLJϟE˄X~X] DYKCe] &) fV žO[R`Kd `jOF$K C",ɼ^?1gj &0OdML;f,iXzaT>ڠ/E4ј1xtq Hťcr=o_;Q, H--uG@[u;MFͱY-YZ 8X3d3;;C $e7~[i+zMq1쵤%^Ax@vwXmg[GЧB;sY֓#7OX7 ']~nIJ7kP@Љ)Nw|./ҡ:1c*@SD% 3*fAS (z_mřEe WX8\ $gJHvc4暑KK/PnHa@wj<·DJ&L#JF@ vF)Y!31 vf\zR5g`J7M9 ]> S]OoN?5y;Ja9DFofYoI6(g;~+N'cĽED#b FٰiV2!Ǔ-3˲hҦ}fs֏Ezrk)%gY߼[Zo3nD/jJ}'oKtMo6M˜+lM6iͷq #HrƊpv!vw2eɈpv%9Fl) +#ݓ>eO0^@oG!2Nn\_R5+2SK«:]2L!bMT^lk63ә!x + {>׀qؒdhc@9N. O ;2sdHO',5v6=a̳H[|zd5Sk6̦fuKP3momml3­mNnEfj=dB ĦDB_ FH[QFNOxvqVXTE^* 7(9Í^d}kxH͝* Q0)VHMԁɝa0zd zkYv:(1E:'bVkDt q0,Żp.z;1XѽpG 0nF.D<@ vXXlcgkud.HHǓ>{~\pMyn7ǿ>{j7Ou7 m"߿b:\/f6̊ )A穇lI2|pᣓ(ϞpyV\9rzs_wUw[HJl1D5L)@S!iFs8I浦K(O82eZsGj0c*70?88&1O<<8>9=6)sO/GA)ڲ;+Ո(!<9<:9x@ǗO<vѯzI'?s z"ʃiZ%&t'.~6aYt`w#Zd^"lS%0C@"Z$,yaݐ* Y~;іD0~pV}T95h,ɳ"ZH:xC}eg5"^S4IUD#r"{*h  Id?Fj2KdFݴHl<;o'G=CCu>]i`,,2v0  GZ#YQqa䦢+FuLװ+a |$#$^'sȾ\ CP[Q#̙lv=̣pA a-̡ U\O8\5EiѺA5.h9thԆ$1D.Ŕ ycz_>?G7@ U$ /}rD@+j Bicvl͞wS-v}@j sB vg}V_J#?&RI,ɽ:Z͸IpOy^\Ja&)I'"O][@4Z,*XIĞ&BݺPyTqZ2ɕސI6^&8b1+aqcw&a2D*TCHuп7]8&=J щ]| ODxALteVMYI&]jh5eQ|aѯhì`yKH2l'RhR@%#*Zip7qp%W.{OXGk{J' Ux At(RfiS:N`ISH2D5Kؘ Y5Ì0qJ'C⸒Ŝudm'u"CP0QyMC}hnA(U5zБ wŊn^vA&p⯊s#{Qf(DPd :1V1> x#6D#>2.s; s:l,Pm{ jn'q 0`tZjd hNՒ9m&yv%G5_a5)Y 'G.D6r~ \=rKJ[/v=vz5#hL, iٴ\G&t$'YI(udHil.< H!YcI!;DOVeq>j,E36d#_25 񀣍LK!Eoڱ"d?.c"6D(s3["5aJeB-J.X!$4cQ O5qxz]' HT`c6tiY&dP"6Qd^)*ٕ%wbcΤ 4+Ay.*QTR4,"TfHFEFl3dĤ95ٚwSUF&T.GV Xӫ}~1je1W~'ȏxXUȏu3OܹE$KzL %|AIo}$H%MjqrRI?U.D*)$|$RmDΜOB3K'ZfYqay@Ӎ(O.[>'qY{GO,cW -f_OW&8k Ku@PR-(N(x 2P MD֗91j (jgE6M1Nro21EQ≂AqBXYf08Yz0GYer4AQ6Ԟ".% ÅM|,_)Wax%̓J885sr֢z"Z؁s9q>ZDYq0ւ΄OҎˊ(\ylyFO]Ձ8z*qYq3T(,Y*4p3VV c?#%e2" gtBL j>aΎg :l,*V$4@#qݠ $,0*ҫ[> 2¡Q0m2ECQZʋTm=iLBj:/$ՏXXy LY5EKi+Ey=CD'lJV4J3xM%p0de֩:*m+6A]MjJ*fdYo `x9 oB<BhsDR+ :Y\0L""Pb*raȍ1?eE˞eǸMWԂ4.ݚS% FVD1.p#;M R*֬}iN%9)aoM<5й#!:9 K$#6fqMo_aK5P6B}  f = s:b {d+ad DPͥiJ-Α .7QRϾmʼ&ۢŁ@ >g=.Y8w$6|;ZXЙ ʆGRvQldt~3ހ-@Bt̲h_elu?7L)F4/R[ʴʧ'NmLADߤعg"ئS,"djޙoȶBt`p l $nPmxG0X)mzQeQET, s3rOM\S>n u.G{11Tl {kG$}zE*!Iͩ$%e.RC;%e7]@:SzP/ZIr19Cj身16b[^o{8V6(_K\)K mSo]рp"_=?rW5Kz_*W|?|o:7EѲ ^\oPۼLYuz"2FMi6!,b # `:, -m&jsmMP(H3ibog;lb)p%]LElFҿ*K=(櫓PiԜ  r0e]`>D9X[F$ H1>ҭyf0V΁s,3>Uc~:+-Z4F'#fa֣:Y"iOi ׊A5/Wa7tAct,{Ǔř#2Ekv&i'1*5Cc1eH0ʈ7w]rU7(q(԰0C!2xH* `ia aD+i0jBH((lfGqzZyB!h*P-c"eܱ ɥSx=w|RvEa֍9l`d+pH9:*- m A6H}a$mtx"إ-IOҤ,79tvTڄO;s܇c'r{̢O`m{~9aL<'V?d`>Ghh4B" 9{2}WrB5GmyrՖ/ϖc66tRT,[Fq)J@tf&]dR{Ja7Ccb{&7ʻ1X2$Y*8a ,n\+Y'CńjM\ȲPLw9A@ex>rVvgFg9,gwC`:h0&j1y#Jt $1i 9dx.]vqfTȋ~dArlb#'&i3bap\O(q?4H>zJ?37?ӂgL w '73+_[;ۘk֮ "ZK釚=YDGEϟĒf$U-N\{F<\$sQUәt`A"=:ة{-@ O ~鯧Ŝ,(Q!Cg+4%:)dй/VUrV _\"N@w%=hCiusoc4?bA4w$}Xlo|Ǐ(\YbE8}h6#;â$a\F 1@GqԺwomG7Mh6~H>#^TP#0בp81LC-hϒfGNmjvpwvoFnkdtn&шϧlԼx-skKK~ X!=>y\4u{FOwf}?Bmj2E8!„Q? `Yl`Gڅɿ1)XWa"qJS5HL@4e/Y8FF18 ]y^bq,N5JDPjx)8x٨$䔅\P{/שF159G]43/lڀEFjD!Ԗz Xn.GFa k~+_/XƖ Fj8W.ȏ""_9\̛vGakU8bJￗpdDBN 0X^xti&q-o<֋s[ +FO~q@wZ;=OWWF[~კt"oȋ 5T.~Tß_tѧ*`N^x)Qi5C_?{ =[ɲ?3E F7K!jW3€sw4f@}\Dguuuuuuu+~Hj'ͽ=nRkV/vO'zut7;DgC^ɭ%`@Bhp"={/j!ig6$f o[N5D'a6MzE^$[,jc batޥ_ٺtœT^ ;cv",="XԪZlP?R9znf4M܋!V,.źMkmii7ަK KWl[|@?CBV&%QbA3W'T(ugDzȴ}xbb m0j`c/&ԫiĦc6a =2ґDp \J-3V;Z.OVq?@eϰ;.9i|lmAMشn4aUaNbQؐ5i+㧑νJI't! åފ"8ۅcCbZkDEbHEܳx衧Mb/D|/=Ȼ< 82K{cU!OPI I|^t`Gr~fŲDa[&yC-~!TwSJMȁBJY{QU(*+2L1! Ax{\<ݔ ^[^~WDf[ɒ[-tơq]rDB4l7 {/S,KaPGrKȻ|]aï"xqp֑ .,ׂXJ vvlٴqy8iьc? GJo>['$9*2F5&(a3L'[x JBVQKh3s7Cd 9Wu_#\UWzNt$gC? tZe0䂼ro=t23E+*SH'y*?8ƞ"*դąa9 AﶉJ=7t*̛62C=x%_N1qbGA+Gfq7hڶ?2 >g z{uZ[mb'J_[_?֭ǻ'[Pak!d2T<^H5\H5mmM,ٴ!yJwIg|K|3?Q 94R Aj>+XB 9Wa5JC76 8rl<8lfʋe8:t̴G/h?e$5@nZ6#D3 'lyYM$ch zgWhsNLY5w@,>`j+ggV7q8kR$ӡ^>D8|!`(qa/l{%,iF;hѕzqkAl'_H$I#Mb2e6+JYGM'+?A7j;= jCj6wc$@5>[3IZdxVQ ÓsrãzuFi/s;P(1NkחP%$RNe]JdR}{}TD?s)t%QV6L0o_Qe1b*|洁lO5v#~b)m?uզTHb5("ᮚ4/Hz@.}CA ÉSs;el0c[1b@( s$䈬iL/Ój"GqwҒ8^0r蕇L%huK:s0Q*s> 'ӪX-RM`kT!_`FISIBCi54 v%`Vc<$xDJcFD(Ĩ.l852MT ҦATI$j"ʊt[kk T\{KtU420fg)d(Br'z)߽nڐb.j"1֒oԔv2E#4-?gLT2}thAjN* TŴvzk,IۼIJ-˃jnwt5>+{UgODV^]Anu^]XC?=K;&,W DZwؙ<&` ^̎3^!En%`$~=a!tӣKedB_O8DQI<~}\,EË @[ bhJp?4$VXsezPM/xጮ$h jQ0mnY(흣_b"kEr*OGj].Q=*V ?@:]Z\tr^Ns4A!Ϡ%hkrrmg8_8TM>OUDO#@ހ*B߹t@ taWVqz,;CUt,Io{ gGxq b{EL }>DّAb"2&'Oni kLU6'Xv#\ V6 1x"E$CFndfJg%<GD? 'ZW(=][_qw5v` w+QAv[ o1\՟.ȜsV΂P7#5 сͽZޅ@pm7wҬ%RcvmTn/X\D0au/čne\[ag|[ "T^K}OyW ?r0 1U<5+z2Uz㩕dTV~WQV]o,.T{dEIU~mXS&K!(M:'!W9W)o6!8S X)P5\ZrP W oULP8SEe l&M,SwVgYu Z&%FRH3@3' 8ϲ,I;FSQ4i]$m$}n<-_/ϔ֪iךp4Fe!;6IzM`u]c괏Sfͩvd5|^upj5@5k{Oa ϱSc+U6P O݂ܚ[?>QESFէό9?#/.u8NF!+BrP@f>v:8▞=vێ f)f5iݤw'I yeyՅDvs.]HOݔӳD+@stk{OcE} YdttiƎGTnikpmM 1 QuE:BTA$Ȟ)@4]Q \cԪrL x 2(i6 = ; (uOH-> 6EvidyMF)F=%-ts"T8R"iJt6AA(0 #ړlm- sv­g@!7L~㳱~8S5_$qNϭ1! dۍL5ߛ 9IGІgFo֪wt%@a &W| V5K3p+|G(\)BgvԬ,d&HJҲc{ӔleQ4Yt6v] 0Ƒbꅡ6Ϙ/;s9s7c2mԚD { ܟX!*5Zؼ+*?z7o]q f9 >{~d0O:|2CEHKR}1K?bhsJ"mzew5W8X&r<6IlRo&gng\0diu )z'^@2ةf7kLzd}t~T{ٰTa mv 0p!rrYjQ֭ ,ڍYjںvt͘)7,{\Y2W ;@C!l4Ki,A-Ku?R:g8nhE9HTFU{p_;$n,] #Ql ɕH $O~zD h6W| W*?!QD{8EIg[}ߣ z+.eݱgŝTzÁ>tܞPMfzkyK}]frSMq"w#A7s*+TF?Qs7P~>CԶ2g Sjzቮ6|![$"&'}ЛenRW1?ab\j$&ߣ0,Nr&zrK8ǃMںof_Wuz1PҠ9Ċ?Hv0ր|[d7 @^~O"_zA91 ܽ`IYwwm,+Uy#r"gnCoB1 Vrg^CzZk`3RqLpӺ zK=K$=k P$;q㜛sN SC ;Nf񓥝I\R˽ZEgQ/1V.|jY*i~YJ[4 DnI-C+FpF->4;X;@"7SˇfI-ߝIW`wg IFp0cbw^%v՛^3F+t@bğ@J"pBl.x_O"4iáRR(\TI\MƧgjNhX BQ\$w6@&ȉo.Ӆ!CU;p[2fGf/(hJOZ p֩y6M-= s;ksKYUI// #׾c)icf/R5ڿJ@%Lo_UGj?wW^ '>*LBՁ7`WGsH\^>1n[s1yVK r|rL=B81 `/X +2kr 4l9{qEP[S7GY9e}hblc@`|UR )&!_ɨ.%M(ȴ'cVRE'CX*>(UA9#g*\гpL'<?dCف3>Mo"Y&lDe[1[X[%8P"x/=<,f zbSe-Q_%-3l;Oa;w n;<`A B[cJj>3_ xojӅ|zLx入Y}ԝoD?:\ M*s~䚕q>VR5z?Fw].blx!J|;z-(|VUF?AX_R,FhA! -zJ .$f}O9A(xvky{@7/;z${:@ ul!{H&{tBY=nvΫc0"پFKI yKG++acv\'U \g2؋*7%ppK1p~Z+I&yy#Q[v9'&+HM%ydE l՞( &Dx@* z]qĈACj{yl;^'gn."U FҾjkVO~+ҝ)w:' /M PsH(Eq}B` "ݭ-h=Km#.:@bm_U\/ÉmSp\bJѣ" DEâJ6ه{ЍGJVwZi=az`awR:Kakc0 mpL DWP+ Rs^U$0z=Y>xhW>&'M.jug =2zb(Ѧ1ʤG@UqGT; "25<}G-DpO]OmBaSŴ F,`caϳ* 9KzI {B[ͩYJӁ)z> Q {smfEM ?ed*I!\:؀vKAk,X| @sgK}~z}ɞ0~\>8(l]aǰi/l_-d䠻)-ٜN-9ZV69gmĿ3ۗbmFtQS{'2ň&a݋8 U}9BM}y8!7tw1sa  k DQɈfㄲN*`6ߙ>$ &zcɺY$]EqzWQcQ;{%:di) kjFb:<\P!CVfBb-vfa)H;,xaRq?BBY!ys{*)E9m #txj 0|yln bߤѲa d:w݋T)nhӄPs;;PsWBDEKZ4` AJω9,Bפraut?̎u]V6@R%% HPH0?;CrEh˦w^s4.5DX)8ӝ_NKp?s 4whZIKiIhqy%Hj]k1~Li*RhG㟈ښM.!lը a8_]4QS8XFMVh\,B:Jo+Q0vC@G:^;߫ ϗ,SJ}f T&ƅ8AL,IQybRq RޔW75nbXfͼ(s(.nI,].A VW}[֪K{LJ{^0e~TJ%hʈnrAU\NByW%8Z ~5m2oKVKRHhJPޮ~|x" IC7+k* qGyױlF3BvED~K҅lLUn^׀'Pk˵k(o'8RXx &4 v3Ib9ɲ5HR31]\;Xq< P\"2me=j8'HzmLhu-/ Yl#5v^3U%Hj,n%=]-\ZAF5H%8( ԎKF@e6AJGMu8b}9Y2lmŌaXΝ n$L'~y3D}:r ޔXҽ7ʘIJ/I t֙<2f^> r+ef5\)g 7s@4;L"@V,T . /4PrJYp8rߎuUqPK@Gm!Gd3@gdzQ!oN3]d3vt+Yx+ ;93Gh`]X #1 ఁpƾPٿZo$b.ewʣ#tCI8@R׋ 婩Grtݐ=mN+̒B\=nq<]|gY|gY|gY|gY|gY|gY|?曭Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/zutil.c100644 1007 1403 11627 6363455101 21504 0ustar petrillipetrilli/* zutil.c -- target dependent utility functions for the compression library * Copyright (C) 1995-1996 Jean-loup Gailly. * For conditions of distribution and use, see copyright notice in zlib.h */ /* $Id: zutil.c,v 1.1 1997/07/17 17:45:37 jim Exp $ */ #include #include "zutil.h" struct internal_state {int dummy;}; /* for buggy compilers */ #ifndef STDC extern void exit OF((int)); #endif const char *z_errmsg[10] = { "need dictionary", /* Z_NEED_DICT 2 */ "stream end", /* Z_STREAM_END 1 */ "", /* Z_OK 0 */ "file error", /* Z_ERRNO (-1) */ "stream error", /* Z_STREAM_ERROR (-2) */ "data error", /* Z_DATA_ERROR (-3) */ "insufficient memory", /* Z_MEM_ERROR (-4) */ "buffer error", /* Z_BUF_ERROR (-5) */ "incompatible version",/* Z_VERSION_ERROR (-6) */ ""}; const char *zlibVersion() { return ZLIB_VERSION; } #ifdef DEBUG void z_error (m) char *m; { fprintf(stderr, "%s\n", m); exit(1); } #endif #ifndef HAVE_MEMCPY void zmemcpy(dest, source, len) Bytef* dest; Bytef* source; uInt len; { if (len == 0) return; do { *dest++ = *source++; /* ??? to be unrolled */ } while (--len != 0); } int zmemcmp(s1, s2, len) Bytef* s1; Bytef* s2; uInt len; { uInt j; for (j = 0; j < len; j++) { if (s1[j] != s2[j]) return 2*(s1[j] > s2[j])-1; } return 0; } void zmemzero(dest, len) Bytef* dest; uInt len; { if (len == 0) return; do { *dest++ = 0; /* ??? to be unrolled */ } while (--len != 0); } #endif #ifdef __TURBOC__ #if (defined( __BORLANDC__) || !defined(SMALL_MEDIUM)) && !defined(__32BIT__) /* Small and medium model in Turbo C are for now limited to near allocation * with reduced MAX_WBITS and MAX_MEM_LEVEL */ # define MY_ZCALLOC /* Turbo C malloc() does not allow dynamic allocation of 64K bytes * and farmalloc(64K) returns a pointer with an offset of 8, so we * must fix the pointer. Warning: the pointer must be put back to its * original form in order to free it, use zcfree(). */ #define MAX_PTR 10 /* 10*64K = 640K */ local int next_ptr = 0; typedef struct ptr_table_s { voidpf org_ptr; voidpf new_ptr; } ptr_table; local ptr_table table[MAX_PTR]; /* This table is used to remember the original form of pointers * to large buffers (64K). Such pointers are normalized with a zero offset. * Since MSDOS is not a preemptive multitasking OS, this table is not * protected from concurrent access. This hack doesn't work anyway on * a protected system like OS/2. Use Microsoft C instead. */ voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) { voidpf buf = opaque; /* just to make some compilers happy */ ulg bsize = (ulg)items*size; /* If we allocate less than 65520 bytes, we assume that farmalloc * will return a usable pointer which doesn't have to be normalized. */ if (bsize < 65520L) { buf = farmalloc(bsize); if (*(ush*)&buf != 0) return buf; } else { buf = farmalloc(bsize + 16L); } if (buf == NULL || next_ptr >= MAX_PTR) return NULL; table[next_ptr].org_ptr = buf; /* Normalize the pointer to seg:0 */ *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; *(ush*)&buf = 0; table[next_ptr++].new_ptr = buf; return buf; } void zcfree (voidpf opaque, voidpf ptr) { int n; if (*(ush*)&ptr != 0) { /* object < 64K */ farfree(ptr); return; } /* Find the original pointer */ for (n = 0; n < next_ptr; n++) { if (ptr != table[n].new_ptr) continue; farfree(table[n].org_ptr); while (++n < next_ptr) { table[n-1] = table[n]; } next_ptr--; return; } ptr = opaque; /* just to make some compilers happy */ Assert(0, "zcfree: ptr not found"); } #endif #endif /* __TURBOC__ */ #if defined(M_I86) && !defined(__32BIT__) /* Microsoft C in 16-bit mode */ # define MY_ZCALLOC #if (!defined(_MSC_VER) || (_MSC_VER < 600)) # define _halloc halloc # define _hfree hfree #endif voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) { if (opaque) opaque = 0; /* to make compiler happy */ return _halloc((long)items, size); } void zcfree (voidpf opaque, voidpf ptr) { if (opaque) opaque = 0; /* to make compiler happy */ _hfree(ptr); } #endif /* MSC */ #ifndef MY_ZCALLOC /* Any system without a special alloc function */ #ifndef STDC extern voidp calloc OF((uInt items, uInt size)); extern void free OF((voidpf ptr)); #endif voidpf zcalloc (opaque, items, size) voidpf opaque; unsigned items; unsigned size; { if (opaque) items += size - size; /* make compiler happy */ return (voidpf)calloc(items, size); } void zcfree (opaque, ptr) voidpf opaque; voidpf ptr; { free(ptr); if (opaque) return; /* make compiler happy */ } #endif /* MY_ZCALLOC */ Zope-2.0.1-ZEO-nonbin/lib/Components/zlib/zutil.h100644 1007 1403 11521 6363455101 21502 0ustar petrillipetrilli/* zutil.h -- internal interface and configuration of the compression library * Copyright (C) 1995-1996 Jean-loup Gailly. * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ /* $Id: zutil.h,v 1.1 1997/07/17 17:45:37 jim Exp $ */ #ifndef _Z_UTIL_H #define _Z_UTIL_H #include "zlib.h" #if defined(MSDOS)||defined(VMS)||defined(CRAY)||defined(WIN32)||defined(RISCOS) # include # include #else extern int errno; #endif #ifdef STDC # include # include #endif #ifndef local # define local static #endif /* compile with -Dlocal if your debugger can't find static symbols */ typedef unsigned char uch; typedef uch FAR uchf; typedef unsigned short ush; typedef ush FAR ushf; typedef unsigned long ulg; extern const char *z_errmsg[10]; /* indexed by 2-zlib_error */ /* (size given to avoid silly warnings with Visual C++) */ #define ERR_MSG(err) z_errmsg[Z_NEED_DICT-(err)] #define ERR_RETURN(strm,err) \ return (strm->msg = (char*)ERR_MSG(err), (err)) /* To be used only when the state is known to be valid */ /* common constants */ #ifndef DEF_WBITS # define DEF_WBITS MAX_WBITS #endif /* default windowBits for decompression. MAX_WBITS is for compression only */ #if MAX_MEM_LEVEL >= 8 # define DEF_MEM_LEVEL 8 #else # define DEF_MEM_LEVEL MAX_MEM_LEVEL #endif /* default memLevel */ #define STORED_BLOCK 0 #define STATIC_TREES 1 #define DYN_TREES 2 /* The three kinds of block type */ #define MIN_MATCH 3 #define MAX_MATCH 258 /* The minimum and maximum match lengths */ #define PRESET_DICT 0x20 /* preset dictionary flag in zlib header */ /* target dependencies */ #ifdef MSDOS # define OS_CODE 0x00 # ifdef __TURBOC__ # include # else /* MSC or DJGPP */ # include # endif #endif #ifdef OS2 # define OS_CODE 0x06 #endif #ifdef WIN32 /* Window 95 & Windows NT */ # define OS_CODE 0x0b #endif #if defined(VAXC) || defined(VMS) # define OS_CODE 0x02 # define FOPEN(name, mode) \ fopen((name), (mode), "mbc=60", "ctx=stm", "rfm=fix", "mrs=512") #endif #ifdef AMIGA # define OS_CODE 0x01 #endif #if defined(ATARI) || defined(atarist) # define OS_CODE 0x05 #endif #ifdef MACOS # define OS_CODE 0x07 #endif #ifdef __50SERIES /* Prime/PRIMOS */ # define OS_CODE 0x0F #endif #ifdef TOPS20 # define OS_CODE 0x0a #endif #if defined(_BEOS_) || defined(RISCOS) # define fdopen(fd,mode) NULL /* No fdopen() */ #endif /* Common defaults */ #ifndef OS_CODE # define OS_CODE 0x03 /* assume Unix */ #endif #ifndef FOPEN # define FOPEN(name, mode) fopen((name), (mode)) #endif /* functions */ #ifdef HAVE_STRERROR extern char *strerror OF((int)); # define zstrerror(errnum) strerror(errnum) #else # define zstrerror(errnum) "" #endif #if defined(pyr) # define NO_MEMCPY #endif #if (defined(M_I86SM) || defined(M_I86MM)) && !defined(_MSC_VER) /* Use our own functions for small and medium model with MSC <= 5.0. * You may have to use the same strategy for Borland C (untested). */ # define NO_MEMCPY #endif #if defined(STDC) && !defined(HAVE_MEMCPY) && !defined(NO_MEMCPY) # define HAVE_MEMCPY #endif #ifdef HAVE_MEMCPY # ifdef SMALL_MEDIUM /* MSDOS small or medium model */ # define zmemcpy _fmemcpy # define zmemcmp _fmemcmp # define zmemzero(dest, len) _fmemset(dest, 0, len) # else # define zmemcpy memcpy # define zmemcmp memcmp # define zmemzero(dest, len) memset(dest, 0, len) # endif #else extern void zmemcpy OF((Bytef* dest, Bytef* source, uInt len)); extern int zmemcmp OF((Bytef* s1, Bytef* s2, uInt len)); extern void zmemzero OF((Bytef* dest, uInt len)); #endif /* Diagnostic functions */ #ifdef DEBUG # include # ifndef verbose # define verbose 0 # endif extern void z_error OF((char *m)); # define Assert(cond,msg) {if(!(cond)) z_error(msg);} # define Trace(x) fprintf x # define Tracev(x) {if (verbose) fprintf x ;} # define Tracevv(x) {if (verbose>1) fprintf x ;} # define Tracec(c,x) {if (verbose && (c)) fprintf x ;} # define Tracecv(c,x) {if (verbose>1 && (c)) fprintf x ;} #else # define Assert(cond,msg) # define Trace(x) # define Tracev(x) # define Tracevv(x) # define Tracec(c,x) # define Tracecv(c,x) #endif typedef uLong (*check_func) OF((uLong check, const Bytef *buf, uInt len)); voidpf zcalloc OF((voidpf opaque, unsigned items, unsigned size)); void zcfree OF((voidpf opaque, voidpf ptr)); #define ZALLOC(strm, items, size) \ (*((strm)->zalloc))((strm)->opaque, (items), (size)) #define ZFREE(strm, addr) (*((strm)->zfree))((strm)->opaque, (voidpf)(addr)) #define TRY_FREE(s, p) {if (p) ZFREE(s, p);} #endif /* _Z_UTIL_H */ Zope-2.0.1-ZEO-nonbin/lib/python/ 40755 1007 1403 0 6772126757 16321 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/AccessControl/ 40755 1007 1403 0 6772126757 21063 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/AccessControl/www/ 40755 1007 1403 0 6772126757 21707 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/AccessControl/www/AccessControl_icon.gif100644 1007 1403 1632 6372647765 26252 0ustar petrillipetrilliGIF89aPPP@@@@@!,@w @0 @ 8a$HF t<!0aRd L8!C3)2Ĉ2$ :#ϖ2řtȗ;#։-?R O;Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/www/User_icon.gif100744 1007 1403 1540 6442026132 24376 0ustar petrillipetrilliGIF89aPPP@@@@@!,=HA8XPBBpE3>Q#CAN1ȇ !VD`K 1 ;Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/AccessControl.txt100644 1007 1403 14073 6452470563 24500 0ustar petrillipetrilliSecurity Architecture --------------------- Users ----- Objects representing users may be created in Principia User Folder objects. User objects maintain the information used to authenticate users, and allow roles to be associated with a user. Permissions ----------- A "permission" is the smallest unit of access to an object, roughly equivalent to the atomic permissions seen in NT: R (Read), W(Write), X(Execute), etc. In Principia, a permission usually describes a fine-grained logical operation on an object, such as "View Management Screens", "Add Properties", etc. Different types of objects will define different permissions as appropriate for the object. Types of access --------------- A "type of access" is a named grouping of 0 or more of the permissions defined by an object. All objects have one predefined type of access called Full Access (all permissions defined by that object). A user who has the special role "Manager" always has Full Access to all objects at or below the level in the object hierarchy at which the user is defined. New types of access may be defined as combinations of the various permissions defined by a given object. These new types of access may be defined by the programmer, or by users at runtime. Roles ----- A role is a name that ties users (authentication of identity) to permissions (authorization for that identity) in the system. Roles may be defined in any Folder (or Folderish) object in the system. Sub folders can make use of roles defined higher in the hierarchy. These roles can be assigned to users. All users, including non-authenticated users have the built-in role of "Anonymous". Principia objects allow the association of defined roles with a single "type of access" each, in the context of that object. A single role is associated with one and only one type of access in the context of a given object. Examples -------- User Object1 o has the role "RoleA" o has given "RoleA" Full Access Result: the user has Full Access to Object1. User Object2 o has the role "RoleA" o has given "RoleB" Full Access o has given the role "RoleA" View Access, a custom type of access that allows only viewing of the object. Result: the user has only View Access. Notes ----- All objects define a permission called "Default permission". If this permission is given to a role, users with that role will be able to access subobjects which do not explicitly restrict access. Technical --------- Objects define their permissions as logical operations. Programmers have to determine the appropriate operations for their object type, and provide a mapping of permission name to attribute names. It is important to note that permissions cannot overlap - none of the attributes named in a permission can occur in any of the other permissions. The following are proposed permissions for some current principia objects: Folder o View management screens o Change permissions o Undo changes o Add objects o Delete objects o Add properties o Change properties o Delete properties o Default permission Confera Topic o View management screens o Change permissions o Undo changes o Add objects o Delete objects o Add properties o Change properties o Delete properties o Default permission o Change Configuration o Add Messages o Change Messages o Delete Messages Tabula Collection o View management screens o Change permissions o Undo changes o Add objects o Delete objects o Add properties o Change properties o Delete properties o Default permission o Change schema o Upload data o Add computed fields o Change computed fields o Delete computed fields Document/Image/File o View management screens o Change permissions o Change/upload data o View Session o View management screens o Change permissions o Change session config o Join/leave session o Save/discard session Mail Host o View management screens o Change permissions o Change configuration To support the architecture, developers must derive an object from the AccessControl.RoleManager mixin class, and define in their class an __ac_permissions__ attribute. This should be a tuple of tuples, where each tuple represents a permission and contains a string permission name as its first element and a list of attribute names as its second element. Example: __ac_permissions__=( ('View management screens', ['manage','manage_menu','manage_main','manage_copyright', 'manage_tabs','manage_propertiesForm','manage_UndoForm']), ('Undo changes', ['manage_undo_transactions']), ('Change permissions', ['manage_access']), ('Add objects', ['manage_addObject']), ('Delete objects', ['manage_delObjects']), ('Add properties', ['manage_addProperty']), ('Change properties', ['manage_editProperties']), ('Delete properties', ['manage_delProperties']), ('Default permission', ['']), ) The developer may also predefine useful types of access, by specifying an __ac_types__ attribute. This should be a tuple of tuples, where each tuple represents a type of access and contains a string name as its first element and a list of permission names as its second element. By default, only "Full Access" is defined (by the RoleManager mixin). If you wish to override __ac_types__ to provide convenient types of access, you must always be sure to define "Full Access" as containing the names of all possible permissions for your object. Example: __ac_types__=( ('Full Access', map(lambda x: x[0], __ac_permissions__)), ('Change', ['Add Objects', 'Add Properties', 'Change Properties']), ) Developers may also provide pre-defined role names that are not deletable via the interface by specifying an __ac_roles__ attribute. This is probably not something we'll ever use under the new architecture, but it's there if you need it. Example: __ac_roles__=('Manager', 'Anonymous') Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/AuthEncoding.py100644 1007 1403 11405 6746132272 24111 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __version__='$Revision: 1.1 $'[11:-2] import sha, binascii from string import upper # Bogosity on various platforms due to ITAR restrictions try: import crypt except ImportError: crypt = None def pw_validate(reference, attempt): """Validate the provided password string, which uses LDAP-style encoding notation. Reference is the correct password, attempt is clear text password attempt.""" result = 0 if upper(reference[:5]) == '{SHA}': attempt = binascii.b2a_base64(sha.new(attempt).digest())[:-1] result = reference[5:] == attempt elif upper(reference[:7]) == '{CRYPT}' and crypt is not None: #if crypt is None, it's not compiled in and everything will fail attempt = crypt(attempt, reference[7:9]) result = reference[7:] == attempt else: result = reference == attempt return result def pw_encode(pw, encoding='SHA'): """Encode the provided plain text password using the encoding if provided and return it in an LDAP-style representation.""" pass Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/Permission.py100644 1007 1403 16435 6745343570 23705 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''short description $Id: Permission.py,v 1.6 1999/07/21 13:13:28 jim Exp $''' __version__='$Revision: 1.6 $'[11:-2] from Globals import HTMLFile, MessageDialog from string import join, strip, split, find from Acquisition import Implicit import Globals, string ListType=type([]) name_trans=filter(lambda c, an=string.letters+string.digits+'_': c not in an, map(chr,range(256))) name_trans=string.maketrans(string.join(name_trans,''), '_'*len(name_trans)) def pname(name, translate=string.translate, name_trans=name_trans): return '_'+translate(name,name_trans)+"_Permission" _marker=[] class Permission: # A Permission maps a named logical permission to a set # of attribute names. Attribute names which appear in a # permission may not appear in any other permission defined # by the object. def __init__(self,name,data,obj,default=None): self.name=name self._p='_'+string.translate(name,name_trans)+"_Permission" self.data=data if hasattr(obj, 'aq_base'): obj=obj.aq_base self.obj=obj self.default=default def getRoles(self, default=_marker): # Return the list of role names which have been given # this permission for the object in question. To do # this, we try to get __roles__ from all of the object # attributes that this permission represents. obj=self.obj name=self._p if hasattr(obj, name): return getattr(obj, name) roles=default for name in self.data: if name: if hasattr(obj, name): attr=getattr(obj, name) if hasattr(attr,'im_self'): attr=attr.im_self if hasattr(attr, '__dict__'): attr=attr.__dict__ name=name+'__roles__' if attr.has_key(name): roles=attr[name] break elif hasattr(obj, '__dict__'): attr=obj.__dict__ if attr.has_key('__roles__'): roles=attr['__roles__'] break if roles: try: if 'Shared' not in roles: return tuple(roles) roles=list(roles) roles.remove('Shared') return roles except: return [] if roles is None: return ['Manager','Anonymous'] if roles is _marker: return ['Manager'] return roles def setRoles(self, roles): obj=self.obj if type(roles) is ListType and not roles: if hasattr(obj, self._p): delattr(obj, self._p) else: setattr(obj, self._p, roles) for name in self.data: if name=='': attr=obj else: attr=getattr(obj, name) try: del attr.__roles__ except: pass try: delattr(obj,name+'__roles__') except: pass def setRole(self, role, present): roles=self.getRoles() if role in roles: if present: return if type(roles) is ListType: roles.remove(role) else: roles=list(roles) roles.remove(role) roles=tuple(roles) elif not present: return else: if type(roles) is ListType: roles.append(role) else: roles=roles+(role,) self.setRoles(roles) def __len__(self): return 1 def __str__(self): return self.name Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/PermissionMapping.py100644 1007 1403 17166 6761256435 25224 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Permission Mapping Sometimes, we need an object's permissions to be remapped to other permissions when the object is used in specual ways. This is rather hard, since we need the object's ordinary permissions intact so we can manage it. """ import ExtensionClass, Acquisition from AccessControl.Permission import pname class RoleManager: def manage_getPermissionMapping(self): """Return the permission mapping for the object This is a list of dictionaries with: permission_name -- The name of the native object permission class_permission -- The class permission the permission is mapped to. """ wrapper=getattr(self, '_permissionMapper', None) if wrapper is None: wrapper=PM() perms={} for p in self.possible_permissions(): perms[pname(p)]=p r=[] a=r.append for ac_perms in self.ac_inherited_permissions(1): p=perms.get(getPermissionMapping(ac_perms[0], wrapper), '') a({'permission_name': ac_perms[0], 'class_permission': p}) return r def manage_setPermissionMapping(self, permission_names=[], class_permissions=[], REQUEST=None): """Change the permission mapping """ wrapper=getattr(self, '_permissionMapper', None) if wrapper is None: wrapper=PM() perms=self.possible_permissions() for i in range(len(permission_names)): name=permission_names[i] p=class_permissions[i] if p and (p not in perms): __traceback_info__=perms, p, i raise 'Permission mapping error', ( """Attempted to map a permission to a permission, %s, that is not valid. This should never happen. (Waaa). """ % p) setPermissionMapping(name, wrapper, p) self._permissionMapper=wrapper if REQUEST is not None: return self.manage_access( self, REQUEST, manage_tabs_message='The permission mapping has been updated') def _isBeingUsedAsAMethod(self, REQUEST =None, wannaBe=0): try: if hasattr(self, 'aq_self'): r=self.aq_acquire('_isBeingUsedAsAMethod_') else: r=self._isBeingUsedAsAMethod_ except: r=0 if REQUEST is not None: if not r != (not wannaBe): REQUEST.response.notFoundError() return r def getPermissionMapping(name, obj, st=type('')): obj=getattr(obj, 'aq_base', obj) name=pname(name) r=getattr(obj, name, '') if type(r) is not st: r='' return r def setPermissionMapping(name, obj, v): name=pname(name) if v: setattr(obj, name, pname(v)) elif obj.__dict__.has_key(name): delattr(obj, name) class PM(ExtensionClass.Base): _View_Permission='_View_Permission' def __getattr__(self, name): # We want to make sure that any non-explicitly set methods are # private! if name[:1]=='_' and name[-11:]=="_Permission": return '' raise AttributeError, name PermissionMapper=PM def aqwrap(object, wrapper, parent): r=Rewrapper() r._ugh=wrapper, object, parent return r class Rewrapper(ExtensionClass.Base): def __of__(self, parent): w, m, p = self._ugh return m.__of__( Acquisition.ImplicitAcquisitionWrapper( w, parent)) def __getattr__(self, name): w, m, parent = self._ugh self=m.__of__( Acquisition.ImplicitAcquisitionWrapper( w, parent)) return getattr(self, name) def __call__(self, *args, **kw): w, m, parent = self._ugh self=m.__of__( Acquisition.ImplicitAcquisitionWrapper( w, parent)) return apply(self, args, kw) Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/PermissionRole.py100644 1007 1403 20330 6745343570 24514 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Objects that implement Permission-based roles. $Id: PermissionRole.py,v 1.7 1999/07/21 13:13:28 jim Exp $''' __version__='$Revision: 1.7 $'[11:-2] import sys from ExtensionClass import Base import string name_trans=filter(lambda c, an=string.letters+string.digits+'_': c not in an, map(chr,range(256))) name_trans=string.maketrans(string.join(name_trans,''), '_'*len(name_trans)) def rolesForPermissionOn(perm, object, default=('Manager',)): """Return the roles that have the given permission on the given object """ im=imPermissionRole() im._p='_'+string.translate(perm, name_trans)+"_Permission" im._d=default return im.__of__(object) class PermissionRole(Base): """Implement permission-based roles. Under normal circumstances, our __of__ method will be called with an unwrapped object. The result will then be called with a wrapped object, if the original object was wrapped. To deal with this, we have to create an intermediate object. """ def __init__(self, name, default=('Manager',)): self.__name__=name self._p='_'+string.translate(name,name_trans)+"_Permission" self._d=default def __of__(self, parent): r=imPermissionRole() r._p=self._p r._pa=parent r._d=self._d return r _what_not_even_god_should_do=[] class imPermissionRole(Base): """Implement permission-based roles """ def __of__(self, parent, tt=type(()), st=type('')): obj=parent n=self._p r=None while 1: if hasattr(obj,n): roles=getattr(obj, n) if roles is None: return 'Anonymous', t=type(roles) if t is tt: # If we get a tuple, then we don't acquire if r is None: return roles return r+list(roles) if t is st: # We found roles set to a name. Start over # with the new permission name. If the permission # name is '', then treat as private! if roles: if roles != n: n=roles # If we find a name that is the same as the # current name, we just ignore it. roles=None else: return _what_not_even_god_should_do elif roles: if r is None: r=list(roles) else: r=r+list(roles) if hasattr(obj,'aq_parent'): obj=obj.aq_parent else: break if r is None: r=self._d return r # The following methods are needed in the unlikely case that an unwrapped # object is accessed: def __getitem__(self, i): try: v=self._v except: v=self._v=self.__of__(self._pa) del self._pa return v[i] def __len__(self): try: v=self._v except: v=self._v=self.__of__(self._pa) del self._pa return len(v) ############################################################################## # Test functions: # def main(): # The "main" program for this module import sys sys.path.append('/projects/_/ExtensionClass') from Acquisition import Implicit class I(Implicit): x__roles__=PermissionRole('x') y__roles__=PermissionRole('y') z__roles__=PermissionRole('z') def x(self): pass def y(self): pass def z(self): pass a=I() a.b=I() a.b.c=I() a.q=I() a.q._x_Permission=('foo',) a._y_Permission=('bar',) a._z_Permission=('zee',) a.b.c._y_Permission=('Manage',) a.b._z_Permission=['also'] print a.x.__roles__, list(a.x.__roles__) print a.b.x.__roles__ print a.b.c.x.__roles__ print a.q.x.__roles__ print a.b.q.x.__roles__ print a.b.c.q.x.__roles__ print print a.y.__roles__, list(a.y.__roles__) print a.b.y.__roles__ print a.b.c.y.__roles__ print a.q.y.__roles__ print a.b.q.y.__roles__ print a.b.c.q.y.__roles__ print print a.z.__roles__, list(a.z.__roles__) print a.b.z.__roles__ print a.b.c.z.__roles__ print a.q.z.__roles__ print a.b.q.z.__roles__ print a.b.c.q.z.__roles__ print Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/Role.py100644 1007 1403 47427 6761261146 22457 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Access control support""" __version__='$Revision: 1.36 $'[11:-2] from Globals import HTMLFile, MessageDialog, Dictionary from string import join, strip, split, find from Acquisition import Implicit, Acquired import Globals, ExtensionClass, PermissionMapping, Products from Permission import Permission from App.Common import aq_base ListType=type([]) class RoleManager(ExtensionClass.Base, PermissionMapping.RoleManager): """An obect that has configurable permissions""" __ac_permissions__=( ('Change permissions', ('manage_access', 'permission_settings', 'ac_inherited_permissions', 'manage_roleForm', 'manage_role', 'manage_acquiredForm', 'manage_acquiredPermissions', 'manage_permissionForm', 'manage_permission', 'manage_changePermissions', 'permissionsOfRole', 'rolesOfPermission', 'acquiredRolesAreUsedBy', 'manage_defined_roles', 'userdefined_roles', 'manage_listLocalRoles', 'manage_editLocalRoles', 'manage_setLocalRoles', 'manage_addLocalRoles', 'manage_delLocalRoles', )), # ('View management screens', ('manage_access',)), ) __ac_roles__=('Manager', 'Owner', 'Anonymous') permissionMappingPossibleValues=Acquired #------------------------------------------------------------ def ac_inherited_permissions(self, all=0): # Get all permissions not defined in ourself that are inherited # This will be a sequence of tuples with a name as the first item and # an empty tuple as the second. d={} perms=self.__ac_permissions__ for p in perms: d[p[0]]=None r=gather_permissions(self.__class__, [], d) if all: if hasattr(self, '_subobject_permissions'): for p in self._subobject_permissions(): pname=p[0] if not d.has_key(pname): d[pname]=1 r.append(p) r=list(perms)+r r.sort() return tuple(r) def permission_settings(self): """Return user-role permission settings """ result=[] valid=self.valid_roles() indexes=range(len(valid)) ip=0 for p in self.ac_inherited_permissions(1): name, value = p[:2] p=Permission(name,value,self) roles=p.getRoles() d={'name': name, 'acquire': type(roles) is ListType and 'CHECKED' or '', 'roles': map( lambda ir, roles=roles, valid=valid, ip=ip: { 'name': "p%dr%d" % (ip,ir), 'checked': (valid[ir] in roles) and 'CHECKED' or '', }, indexes) } ip=ip+1 result.append(d) return result manage_roleForm=HTMLFile('roleEdit', globals()) def manage_role(self, role_to_manage, permissions=[], REQUEST=None): "Change the permissions given to the given role" self._isBeingUsedAsAMethod(REQUEST, 0) for p in self.ac_inherited_permissions(1): name, value = p[:2] p=Permission(name,value,self) p.setRole(role_to_manage, name in permissions) if REQUEST is not None: return self.manage_access(self,REQUEST) manage_acquiredForm=HTMLFile('acquiredEdit', globals()) def manage_acquiredPermissions(self, permissions=[], REQUEST=None): "Change the permissions that acquire" self._isBeingUsedAsAMethod(REQUEST, 0) for p in self.ac_inherited_permissions(1): name, value = p[:2] p=Permission(name,value,self) roles=p.getRoles() if roles is None: continue if name in permissions: p.setRoles(list(roles)) else: p.setRoles(tuple(roles)) if REQUEST is not None: return self.manage_access(self,REQUEST) manage_permissionForm=HTMLFile('permissionEdit', globals()) def manage_permission(self, permission_to_manage, roles=[], acquire=0, REQUEST=None): """Change the settings for the given permission If optional arg acquire is true, then the roles for the permission are acquired, in addition to the ones specified, otherwise the permissions are restricted to only the designated roles.""" self._isBeingUsedAsAMethod(REQUEST, 0) for p in self.ac_inherited_permissions(1): name, value = p[:2] if name==permission_to_manage: p=Permission(name,value,self) if acquire: roles=list(roles) else: roles=tuple(roles) p.setRoles(roles) if REQUEST is not None: return self.manage_access(self,REQUEST) return raise 'Invalid Permission', ( "The permission %s is invalid." % permission_to_manage) def manage_access( trueself, self, REQUEST, _normal_manage_access=HTMLFile('access', globals()), _method_manage_access=HTMLFile('methodAccess', globals()), **kw): "Return an interface for making permissions settings" if self._isBeingUsedAsAMethod(): return apply(_method_manage_access,(trueself, self, REQUEST), kw) else: return apply(_normal_manage_access,(trueself, self, REQUEST), kw) def manage_changePermissions(self, REQUEST): "Change all permissions settings, called by management screen" self._isBeingUsedAsAMethod(REQUEST, 0) valid_roles=self.valid_roles() indexes=range(len(valid_roles)) have=REQUEST.has_key permissions=self.ac_inherited_permissions(1) for ip in range(len(permissions)): roles=[] for ir in indexes: if have("p%dr%d" % (ip,ir)): roles.append(valid_roles[ir]) name, value = permissions[ip][:2] p=Permission(name,value,self) if not have('a%d' % ip): roles=tuple(roles) p.setRoles(roles) return MessageDialog( title ='Success!', message='Your changes have been saved', action ='manage_access') def permissionsOfRole(self, role): "used by management screen" r=[] for p in self.ac_inherited_permissions(1): name, value = p[:2] p=Permission(name,value,self) roles=p.getRoles() r.append({'name': name, 'selected': role in roles and 'SELECTED' or '', }) return r def rolesOfPermission(self, permission): "used by management screen" valid_roles=self.valid_roles() for p in self.ac_inherited_permissions(1): name, value = p[:2] if name==permission: p=Permission(name,value,self) roles=p.getRoles() return map( lambda role, roles=roles: {'name': role, 'selected': role in roles and 'SELECTED' or '', }, valid_roles) raise 'Invalid Permission', ( "The permission %s is invalid." % permission) def acquiredRolesAreUsedBy(self, permission): "used by management screen" for p in self.ac_inherited_permissions(1): name, value = p[:2] if name==permission: p=Permission(name,value,self) roles=p.getRoles() return type(roles) is ListType and 'CHECKED' or '' raise 'Invalid Permission', ( "The permission %s is invalid." % permission) # Local roles support # ------------------- # # Local roles allow a user to be given extra roles in the context # of a particular object (and its children). When a user is given # extra roles in a particular object, an entry for that user is made # in the __ac_local_roles__ dict containing the extra roles. __ac_local_roles__=None manage_listLocalRoles=HTMLFile('listLocalRoles', globals()) manage_editLocalRoles=HTMLFile('editLocalRoles', globals()) def has_local_roles(self): dict=self.__ac_local_roles__ or {} return len(dict) def get_local_roles(self): dict=self.__ac_local_roles__ or {} keys=dict.keys() keys.sort() info=[] for key in keys: info.append((key, dict[key])) return info def get_valid_userids(self): item=self dict={} while 1: if hasattr(aq_base(item), 'acl_users') and \ hasattr(item.acl_users, 'user_names'): for name in item.acl_users.user_names(): dict[name]=1 if not hasattr(item, 'aq_parent'): break item=item.aq_parent keys=dict.keys() keys.sort() return keys def get_local_roles_for_userid(self, userid): dict=self.__ac_local_roles__ or {} return dict.get(userid, []) def manage_addLocalRoles(self, userid, roles, REQUEST=None): """Set local roles for a user.""" if not roles: raise ValueError, 'One or more roles must be given!' dict=self.__ac_local_roles__ or {} local_roles = dict.get(userid, []) for r in roles: if r not in local_roles: local_roles.append(r) dict[userid] = local_roles self.__ac_local_roles__=dict if REQUEST is not None: stat='Your changes have been saved.' return self.manage_listLocalRoles(self, REQUEST, stat=stat) def manage_setLocalRoles(self, userid, roles, REQUEST=None): """Set local roles for a user.""" if not roles: raise ValueError, 'One or more roles must be given!' dict=self.__ac_local_roles__ or {} dict[userid]=roles self.__ac_local_roles__=dict if REQUEST is not None: stat='Your changes have been saved.' return self.manage_listLocalRoles(self, REQUEST, stat=stat) def manage_delLocalRoles(self, userids, REQUEST=None): """Remove all local roles for a user.""" dict=self.__ac_local_roles__ or {} for userid in userids: if dict.has_key(userid): del dict[userid] self.__ac_local_roles__=dict if REQUEST is not None: stat='Your changes have been saved.' return self.manage_listLocalRoles(self, REQUEST, stat=stat) #------------------------------------------------------------ def access_debug_info(self): "Return debug info" clas=class_attrs(self) inst=instance_attrs(self) data=[] _add=data.append for key, value in inst.items(): if find(key,'__roles__') >= 0: _add({'name': key, 'value': value, 'class': 0}) if hasattr(value, '__roles__'): _add({'name': '%s.__roles__' % key, 'value': value.__roles__, 'class': 0}) for key, value in clas.items(): if find(key,'__roles__') >= 0: _add({'name': key, 'value': value, 'class' : 1}) if hasattr(value, '__roles__'): _add({'name': '%s.__roles__' % key, 'value': value.__roles__, 'class': 1}) return data def valid_roles(self): "Return list of valid roles" obj=self dict={} dup =dict.has_key x=0 while x < 100: if hasattr(obj, '__ac_roles__'): roles=obj.__ac_roles__ for role in roles: if not dup(role): dict[role]=1 if not hasattr(obj, 'aq_parent'): break obj=obj.aq_parent x=x+1 roles=dict.keys() roles.sort() return roles def validate_roles(self, roles): "Return true if all given roles are valid" valid=self.valid_roles() for role in roles: if role not in valid: return 0 return 1 def userdefined_roles(self): "Return list of user-defined roles" roles=list(self.__ac_roles__) for role in classattr(self.__class__,'__ac_roles__'): try: roles.remove(role) except: pass return roles def manage_defined_roles(self,submit=None,REQUEST=None): """Called by management screen.""" if submit=='Add Role': role=reqattr(REQUEST, 'role') return self._addRole(role, REQUEST) if submit=='Delete Role': roles=reqattr(REQUEST, 'roles') return self._delRoles(roles, REQUEST) return self.manage_access(self,REQUEST) def _addRole(self, role, REQUEST=None): if not role: return MessageDialog( title ='Incomplete', message='You must specify a role name', action ='manage_changeAccess') if role in self.__ac_roles__: return MessageDialog( title ='Role Exists', message='The given role is already defined', action ='manage_changeAccess') data=list(self.__ac_roles__) data.append(role) self.__ac_roles__=tuple(data) if REQUEST is not None: return self.manage_access(self, REQUEST) def _delRoles(self, roles, REQUEST): if not roles: return MessageDialog( title ='Incomplete', message='You must specify a role name', action ='manage_changeAccess') data=list(self.__ac_roles__) for role in roles: try: data.remove(role) except: pass self.__ac_roles__=tuple(data) if REQUEST is not None: return self.manage_access(self, REQUEST) def _has_user_defined_role(self, role): return role in self.__ac_roles__ # Compatibility names only!! smallRolesWidget=selectedRoles=aclAChecked=aclPChecked=aclEChecked='' validRoles=valid_roles #manage_rolesForm=manage_access def manage_editRoles(self,REQUEST,acl_type='A',acl_roles=[]): pass def _setRoles(self,acl_type,acl_roles): pass def possible_permissions(self): d={} for p in Products.__ac_permissions__: d[p[0]]=1 for p in self.aq_acquire('_getProductRegistryData')('ac_permissions'): d[p[0]]=1 for p in self.ac_inherited_permissions(1): d[p[0]]=1 d=d.keys() d.sort() return d Globals.default__class_init__(RoleManager) def reqattr(request, attr): try: return request[attr] except: return None def classattr(cls, attr): if hasattr(cls, attr): return getattr(cls, attr) try: bases=cls.__bases__ except: bases=() for base in bases: if classattr(base, attr): return attr return None def instance_dict(inst): try: return inst.__dict__ except: return {} def class_dict(_class): try: return _class.__dict__ except: return {} def instance_attrs(inst): return instance_dict(inst) def class_attrs(inst, _class=None, data=None): if _class is None: _class=inst.__class__ data={} clas_dict=class_dict(_class) inst_dict=instance_dict(inst) inst_attr=inst_dict.has_key for key, value in clas_dict.items(): if not inst_attr(key): data[key]=value for base in _class.__bases__: data=class_attrs(inst, base, data) return data def gather_permissions(klass, result, seen): for base in klass.__bases__: if base.__dict__.has_key('__ac_permissions__'): for p in base.__ac_permissions__: name=p[0] if seen.has_key(name): continue result.append((name, ())) seen[name]=None gather_permissions(base, result, seen) return result Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/Setup100644 1007 1403 371 6524615550 22151 0ustar petrillipetrilli# install Role.py # install User.py # install addUser.dtml # install editUser.dtml # install mainUser.dtml # install www # install Permission.py # install PermissionRole.py # install access.dtml # install permissionEdit.dtml # install roleEdit.dtml Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/User.py100644 1007 1403 61267 6770450764 22500 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Access control package""" __version__='$Revision: 1.92 $'[11:-2] import Globals, App.Undo, socket, regex from Globals import HTMLFile, MessageDialog, Persistent, PersistentMapping from string import join,strip,split,lower from App.Management import Navigation, Tabs from Acquisition import Implicit from OFS.SimpleItem import Item from base64 import decodestring from App.ImageFile import ImageFile from Role import RoleManager from string import split, join, upper from PermissionRole import _what_not_even_god_should_do, rolesForPermissionOn from AuthEncoding import pw_validate ListType=type([]) NotImplemented='NotImplemented' class BasicUser(Implicit): """Base class for all User objects""" # ---------------------------- # Public User object interface # ---------------------------- def __init__(self,name,password,roles,domains): raise NotImplemented def getUserName(self): """Return the username of a user""" raise NotImplemented def _getPassword(self): """Return the password of the user.""" raise NotImplemented def getRoles(self): """Return the list of roles assigned to a user.""" raise NotImplemented def getRolesInContext(self, object): """Return the list of roles assigned to the user, including local roles assigned in context of the passed in object.""" name=self.getUserName() roles=self.getRoles() local={} object=getattr(object, 'aq_inner', object) while 1: if hasattr(object, '__ac_local_roles__'): dict=object.__ac_local_roles__ or {} for r in dict.get(name, []): local[r]=1 if hasattr(object, 'aq_parent'): object=object.aq_parent continue if hasattr(object, 'im_self'): object=object.im_self object=getattr(object, 'aq_inner', object) continue break roles=list(roles) + local.keys() return roles def getDomains(self): """Return the list of domain restrictions for a user""" raise NotImplemented # ------------------------------ # Internal User object interface # ------------------------------ def authenticate(self, password, request): passwrd=self._getPassword() result = pw_validate(passwrd, password) domains=self.getDomains() if domains: return result and domainSpecMatch(domains, request) return result def _shared_roles(self, parent): r=[] while 1: if hasattr(parent,'__roles__'): roles=parent.__roles__ if roles is None: return 'Anonymous', if 'Shared' in roles: roles=list(roles) roles.remove('Shared') r=r+roles else: try: return r+list(roles) except: return r if hasattr(parent, 'aq_parent'): while hasattr(parent.aq_self,'aq_self'): parent=parent.aq_self parent=parent.aq_parent else: return r def allowed(self, parent, roles=None): """Check whether the user has access to parent, assuming that parent.__roles__ is the given roles.""" if roles is None or 'Anonymous' in roles: return 1 usr_roles=self.getRolesInContext(parent) for role in roles: if role in usr_roles: if (hasattr(self,'aq_parent') and hasattr(self.aq_parent,'aq_parent')): if parent is None: return 1 if (not hasattr(parent, 'aq_inContextOf') and hasattr(parent, 'im_self')): # This is a method, grab it's self. parent=parent.im_self if not parent.aq_inContextOf(self.aq_parent.aq_parent,1): if 'Shared' in roles: # Damn, old role setting. Waaa roles=self._shared_roles(parent) if 'Anonymous' in roles: return 1 return None return 1 if 'Shared' in roles: # Damn, old role setting. Waaa roles=self._shared_roles(parent) if roles is None or 'Anonymous' in roles: return 1 while 'Shared' in roles: roles.remove('Shared') return self.allowed(parent,roles) return None hasRole=allowed domains=[] def has_role(self, roles, object=None): """Check to see if a user has a given role or roles.""" if type(roles)==type('s'): roles=[roles] if object is not None: user_roles = self.getRolesInContext(object) else: # Global roles only... user_roles=self.getRoles() for role in roles: if role in user_roles: return 1 return 0 def has_permission(self, permission, object): """Check to see if a user has a given permission on an object.""" roles=rolesForPermissionOn(permission, object) return self.has_role(roles, object) def __len__(self): return 1 def __str__(self): return self.getUserName() __repr__=__str__ class User(BasicUser, Persistent): """Standard Principia User object""" def __init__(self,name,password,roles,domains): self.name =name self.__ =password self.roles =roles self.domains=domains def getUserName(self): """Return the username of a user""" return self.name def _getPassword(self): """Return the password of the user.""" return self.__ def getRoles(self): """Return the list of roles assigned to a user.""" return self.roles def getDomains(self): """Return the list of domain restrictions for a user""" return self.domains class Super(User): """Super user """ def allowed(self,parent,roles=None): return roles is not _what_not_even_god_should_do hasRole=allowed def has_role(self, roles, object=None): return 1 def has_permission(self, permission, object): return 1 _remote_user_mode=0 try: f=open('%s/access' % INSTANCE_HOME, 'r') except IOError: raise 'InstallError', ( 'No access file found at %s - see INSTALL.txt' % INSTANCE_HOME ) try: data=split(strip(f.readline()),':') f.close() _remote_user_mode=not data[1] try: ds=split(data[2], ' ') except: ds=[] super=Super(data[0],data[1],('manage',), ds) del data except: raise 'InstallError', 'Invalid format for access file - see INSTALL.txt' nobody=User('Anonymous User','',('Anonymous',), []) class BasicUserFolder(Implicit, Persistent, Navigation, Tabs, RoleManager, Item, App.Undo.UndoSupport): """Base class for UserFolder-like objects""" meta_type='User Folder' id ='acl_users' title ='User Folder' isPrincipiaFolderish=1 isAUserFolder=1 manage_options=( {'label':'Contents', 'action':'manage_main'}, {'label':'Security', 'action':'manage_access'}, {'label':'Undo', 'action':'manage_UndoForm'}, ) __ac_permissions__=( ('Manage users', ('manage_users','getUserNames','getUser','getUsers', )), ) # ---------------------------------- # Public UserFolder object interface # ---------------------------------- def getUserNames(self): """Return a list of usernames""" raise NotImplemented def getUsers(self): """Return a list of user objects""" raise NotImplemented def getUser(self, name): """Return the named user object or None""" raise NotImplemented def _doAddUser(self, name, password, roles, domains): """Create a new user""" raise NotImplemented def _doChangeUser(self, name, password, roles, domains): """Modify an existing user""" raise NotImplemented def _doDelUsers(self, names): """Delete one or more users""" raise NotImplemented # ----------------------------------- # Private UserFolder object interface # ----------------------------------- _remote_user_mode=_remote_user_mode _super=super _nobody=nobody def validate(self,request,auth='',roles=None): if roles is _what_not_even_god_should_do: request.response.notFoundError() parents=request.get('PARENTS', []) if not parents: parent=self.aq_parent else: parent=parents[0] # If no authorization, only a user with a # domain spec and no passwd or nobody can # match if not auth: for ob in self.getUsers(): domains=ob.getDomains() if domains: if ob.authenticate('', request): if ob.allowed(parent, roles): ob=ob.__of__(self) return ob nobody=self._nobody if self._isTop() and nobody.allowed(parent, roles): ob=nobody.__of__(self) return ob return None # Only do basic authentication if lower(auth[:6])!='basic ': return None name,password=tuple(split(decodestring(split(auth)[-1]), ':', 1)) # Check for superuser super=self._super if self._isTop() and (name==super.getUserName()) and \ super.authenticate(password, request): return super # Try to get user user=self.getUser(name) if user is None: return None # Try to authenticate user if not user.authenticate(password, request): return None # We need the user to be able to acquire! user=user.__of__(self) # Try to authorize user if user.allowed(parent, roles): return user return None if _remote_user_mode: def validate(self,request,auth='',roles=None): parent=request['PARENTS'][0] e=request.environ if e.has_key('REMOTE_USER'): name=e['REMOTE_USER'] else: for ob in self.getUsers(): domains=ob.getDomains() if domains: if ob.authenticate('', request): if ob.allowed(parent, roles): ob=ob.__of__(self) return ob nobody=self._nobody if self._isTop() and nobody.allowed(parent, roles): ob=nobody.__of__(self) return ob return None # Check for superuser super=self._super if self._isTop() and (name==super.getUserName()): return super # Try to get user user=self.getUser(name) if user is None: return None # We need the user to be able to acquire! user=user.__of__(self) # Try to authorize user if user.allowed(parent, roles): return user return None def _isTop(self): try: return self.aq_parent.aq_base.isTopLevelPrincipiaApplicationObject except: return 0 def __len__(self): return 1 _mainUser=HTMLFile('mainUser', globals()) _add_User=HTMLFile('addUser', globals(), remote_user_mode__=_remote_user_mode) _editUser=HTMLFile('editUser', globals(), remote_user_mode__=_remote_user_mode) manage=manage_main=_mainUser def domainSpecValidate(self, spec): for ob in spec: sz=len(ob) if not ((addr_match(ob) == sz) or (host_match(ob) == sz)): return 0 return 1 def _addUser(self,name,password,confirm,roles,domains,REQUEST=None): if not name: return MessageDialog( title ='Illegal value', message='A username must be specified', action ='manage_main') if not password or not confirm: if not domains: return MessageDialog( title ='Illegal value', message='Password and confirmation must be specified', action ='manage_main') if self.getUser(name) or (name==self._super.getUserName()): return MessageDialog( title ='Illegal value', message='A user with the specified name already exists', action ='manage_main') if (password or confirm) and (password != confirm): return MessageDialog( title ='Illegal value', message='Password and confirmation do not match', action ='manage_main') if not roles: roles=[] if not domains: domains=[] if domains and not self.domainSpecValidate(domains): return MessageDialog( title ='Illegal value', message='Illegal domain specification', action ='manage_main') self._doAddUser(name, password, roles, domains) if REQUEST: return self._mainUser(self, REQUEST) def _changeUser(self,name,password,confirm,roles,domains,REQUEST=None): if not name: return MessageDialog( title ='Illegal value', message='A username must be specified', action ='manage_main') if not password or not confirm: if not domains: return MessageDialog( title ='Illegal value', message='Password and confirmation must be specified', action ='manage_main') if not self.getUser(name): return MessageDialog( title ='Illegal value', message='Unknown user', action ='manage_main') if (password or confirm) and (password != confirm): return MessageDialog( title ='Illegal value', message='Password and confirmation do not match', action ='manage_main') if not roles: roles=[] if not domains: domains=[] if domains and not self.domainSpecValidate(domains): return MessageDialog( title ='Illegal value', message='Illegal domain specification', action ='manage_main') self._doChangeUser(name, password, roles, domains) if REQUEST: return self._mainUser(self, REQUEST) def _delUsers(self,names,REQUEST=None): if not names: return MessageDialog( title ='Illegal value', message='No users specified', action ='manage_main') self._doDelUsers(names) if REQUEST: return self._mainUser(self, REQUEST) def manage_users(self,submit=None,REQUEST=None,RESPONSE=None): """ """ if submit=='Add...': return self._add_User(self, REQUEST) if submit=='Edit': try: user=self.getUser(reqattr(REQUEST, 'name')) except: return MessageDialog( title ='Illegal value', message='The specified user does not exist', action ='manage_main') return self._editUser(self,REQUEST,user=user,password=user.__) if submit=='Add': name =reqattr(REQUEST, 'name') password=reqattr(REQUEST, 'password') confirm =reqattr(REQUEST, 'confirm') roles =reqattr(REQUEST, 'roles') domains =reqattr(REQUEST, 'domains') return self._addUser(name,password,confirm,roles,domains,REQUEST) if submit=='Change': name =reqattr(REQUEST, 'name') password=reqattr(REQUEST, 'password') confirm =reqattr(REQUEST, 'confirm') roles =reqattr(REQUEST, 'roles') domains =reqattr(REQUEST, 'domains') return self._changeUser(name,password,confirm,roles, domains,REQUEST) if submit=='Delete': names=reqattr(REQUEST, 'names') return self._delUsers(names,REQUEST) return self._mainUser(self, REQUEST) def user_names(self): return self.getUserNames() def manage_beforeDelete(self, item, container): if item is self: try: del container.__allow_groups__ except: pass def manage_afterAdd(self, item, container): if item is self: if hasattr(self, 'aq_base'): self=self.aq_base container.__allow_groups__=self def _setId(self, id): if id != self.id: raise Globals.MessageDialog( title='Invalid Id', message='Cannot change the id of a UserFolder', action ='./manage_main',) class UserFolder(BasicUserFolder): """Standard Principia UserFolder object A UserFolder holds User objects which contain information about users including name, password domain, and roles. UserFolders function chiefly to contol access by authenticating users and binding them to a collection of roles.""" meta_type='User Folder' id ='acl_users' title ='User Folder' icon ='p_/UserFolder' def __init__(self): self.data=PersistentMapping() def getUserNames(self): """Return a list of usernames""" names=self.data.keys() names.sort() return names def getUsers(self): """Return a list of user objects""" data=self.data names=data.keys() names.sort() users=[] f=users.append for n in names: f(data[n]) return users def getUser(self, name): """Return the named user object or None""" if self.data.has_key(name): return self.data[name] return None def _doAddUser(self, name, password, roles, domains): """Create a new user""" self.data[name]=User(name,password,roles,domains) def _doChangeUser(self, name, password, roles, domains): user=self.data[name] user.__=password user.roles=roles user.domains=domains def _doDelUsers(self, names): for name in names: del self.data[name] Globals.default__class_init__(UserFolder) def manage_addUserFolder(self,dtself=None,REQUEST=None,**ignored): """ """ f=UserFolder() self=self.this() try: self._setObject('acl_users', f) except: return MessageDialog( title ='Item Exists', message='This object already contains a User Folder', action ='%s/manage_main' % REQUEST['URL1']) self.__allow_groups__=f if REQUEST: return self.manage_main(self,REQUEST,update_menu=1) def rolejoin(roles, other): dict={} for role in roles: dict[role]=1 for role in other: dict[role]=1 roles=dict.keys() roles.sort() return roles addr_match=regex.compile('[0-9\.\*]*').match #TS host_match=regex.compile('[-A-Za-z0-9\.\*]*').match #TS def domainSpecMatch(spec, request): host='' addr='' if request.has_key('REMOTE_HOST'): host=request['REMOTE_HOST'] if request.has_key('REMOTE_ADDR'): addr=request['REMOTE_ADDR'] if not host and not addr: return 0 if not host: try: host=socket.gethostbyaddr(addr)[0] except: pass if not addr: try: addr=socket.gethostbyname(host) except: pass _host=split(host, '.') _addr=split(addr, '.') _hlen=len(_host) _alen=len(_addr) for ob in spec: sz=len(ob) _ob=split(ob, '.') _sz=len(_ob) if addr_match(ob)==sz: fail=0 for i in range(_sz): a=_addr[i] o=_ob[i] if (o != a) and (o != '*'): fail=1 break if fail: continue return 1 if host_match(ob)==sz: if _hlen < _sz: continue elif _hlen > _sz: _item=_host[-_sz:] else: _item=_host fail=0 for i in range(_sz): h=_item[i] o=_ob[i] if (o != h) and (o != '*'): fail=1 break if fail: continue return 1 return 0 def absattr(attr): if callable(attr): return attr() return attr def reqattr(request, attr): try: return request[attr] except: return None Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/__init__.py100644 1007 1403 7332 6671334571 23267 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/access.dtml100644 1007 1403 7161 6761246411 23274 0ustar petrillipetrilli Security

    The listing below shows the current security settings for this item. Permissions are rows and roles are columns. Checkboxes are used to indicate where roles are assigned permissions. You can also assign local roles to users, which give users extra roles in the context of this object and its subobjects.

    When a role is assigned to a permission, users with the given role will be able to perform tasks associated with the permission on this item. When the Acquire permission settings checkbox is selected then the containing objects's permission settings are used. Note: the acquired permission settings may be augmented by selecting Roles for a permission in addition to selecting to acquire permissions.

    You can define new Roles by using the User defined roles form below.

    Permission "> Roles
    Acquire
    permission
    settings    ?
    > >
    " ALIGN="CENTER"> " ALIGN="CENTER">

    User defined roles
    Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/acquiredEdit.dtml100644 1007 1403 1072 6561335233 24430 0ustar petrillipetrilliManage Acquired Permission Settings
    Select permissions that acquire permission settings:

    Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/addUser.dtml100644 1007 1403 3255 6761246411 23422 0ustar petrillipetrilli Add User

    To add a new user, enter the name, password, confirmation and roles for the new user and click "Add". Domains is an optional list of domains from which the user is allowed to login.

    Name
    Password
    (Confirm)
    Domains
    Roles
    Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/editLocalRoles.dtml100755 1007 1403 2567 6761246411 24750 0ustar petrillipetrilli Manage Local Roles

    Local roles allow you to give particular users extra roles in the context of this object, in addition to the roles they already have.

    To change the local roles for this user, select the extra roles this user should have in the context of this object and click the Change button.

    User
    		Roles
    Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/editUser.dtml100644 1007 1403 3504 6761246411 23614 0ustar petrillipetrilli Change User
    Name
    Password
    (Confirm)
    Domains ">
    Roles ">
    Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/listLocalRoles.dtml100755 1007 1403 4640 6761246411 24770 0ustar petrillipetrilli Manage Local Roles

    Local roles allow you to give particular users extra roles in the context of this object, in addition to the roles they already have.
    The following users have been given local roles. To modify the local roles given to a particular user, click on the name of the user. To remove all local roles from a user, select the checkbox next to the name of the user and click the Remove button.

    "> (, )

    To give a user extra roles when accessing this object (and its children), select a user from the User list below, select the extra roles that should be given to that user from the Roles list.

    User
    		Roles
    Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/mainUser.dtml100644 1007 1403 2307 6761246411 23613 0ustar petrillipetrilli Contents
    The following users have been defined. Click on a user to edit that user.

    Click to edit user

    There are no users defined.

    Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/methodAccess.dtml100644 1007 1403 2317 6761246411 24433 0ustar petrillipetrilliSecurity

    The listing below shows the current permission mappings for this item.

    Permission is mapped to
    Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/permissionEdit.dtml100644 1007 1403 1663 6761246411 25032 0ustar petrillipetrilliManage Permission
    Roles assigned to permission :

    Also use roles acquired from folders containing this object: >

    Zope-2.0.1-ZEO-nonbin/lib/python/AccessControl/roleEdit.dtml100644 1007 1403 1230 6761246411 23571 0ustar petrillipetrilliManage Role
    Permissions assigned to role :

    Zope-2.0.1-ZEO-nonbin/lib/python/.cvsignore100644 1007 1403 71 6676003527 20344 0ustar petrillipetrillisedscript config.c Makefile Makefile.pre Makefile.pre.in Zope-2.0.1-ZEO-nonbin/lib/python/ExportImportXML.py100644 1007 1403 21352 6745670444 22045 0ustar petrillipetrilliimport string, struct, sys, tempfile import Shared.DC.xml.ppml import Shared.DC.xml.xyap ppml=Shared.DC.xml.ppml xyap=Shared.DC.xml.xyap xyap=xyap.xyap p64=ppml.p64 u64=ppml.u64 cp=ppml.cp try: from cStringIO import StringIO except: from StringIO import StringIO export_end_marker='\377'*16 StringType=type('') class ZopeData: def __init__(self, parser, tag, attrs): self._pos=0 self.file=parser.file self.tempfile=parser.tempfile def append(self, transaction, f=None): file=self.file write=file.write tfile=self.tempfile dlen=tfile.tell() tfile.seek(0) id=transaction.serial user, desc, ext = transaction._ude transaction._ude=None tlen=transaction._thl pos=self._pos file.seek(pos) tl=tlen+dlen stl=p64(tl) write(struct.pack( ">8s" "8s" "c" "H" "H" "H" , id, stl, ' ', len(user), len(desc), len(ext), )) if user: write(user) if desc: write(desc) if ext: write(ext) cp(tfile,file,dlen) write(stl) self._pos=pos+tl+8 class Transaction: def __init__(self, parser, tag, attrs): self.file=parser.file self.tempfile=parser.tempfile self.tempfile.seek(0) tyme=attrs['time'] start=0 stop=string.find(tyme[start:],'-')+start year=string.atoi(tyme[start:stop]) start=stop+1 stop=string.find(tyme[start:],'-')+start month=string.atoi(tyme[start:stop]) start=stop+1 stop=string.find(tyme[start:],' ')+start day=string.atoi(tyme[start:stop]) start=stop+1 stop=string.find(tyme[start:],':')+start hour=string.atoi(tyme[start:stop]) start=stop+1 stop=string.find(tyme[start:],':')+start minute=string.atoi(tyme[start:stop]) start=stop+1 second=string.atof(tyme[start:]) t=(((((year-1900)*12+month-1)*31+day-1)*24+hour)*60+minute) t=struct.pack(">If",t,second*(1L<<32)/60) self.serial=t self._user=user='' self._descr=desc='' self._ext=ext='' self._thl= 23+len(user)+len(desc)+len(ext) self._ude= user, desc, ext self._index={} self._tindex=[] self._pos=0 self._oid='\0\0\0\0\0\0\0\0' def append(self, data): version='' old=self._index.get(self._oid,0) pnv=None if old: file=self.file file.seek(old) read=file.read h=read(42) doid,oserial,sprev,stloc,vlen,splen = unpack(">8s8s8s8sH8s", h) if doid != self.serial: raise CorruptedDataError, h tfile=self.tempfile write=tfile.write pos=self._pos serial=self.serial oid=self._oid here=tfile.tell()+pos+self._thl self._tindex.append(self._oid, here) serial=self.serial write(struct.pack(">8s8s8s8sH8s", oid, serial, p64(old), p64(pos), len(version), p64(len(data)))) for x in data[2:]: write(x) return serial def save_user(self, tag, data): transaction=self._transaction if len(data)>2: v=data[2] else: v='' self._user=v transaction._thl=self._transaction._thl+len(v) transaction._ude=v,transaction._ude[1],transaction._ude[2] return v def save_description(self, tag, data): transaction=self._transaction if len(data)>2: v=data[2] else: v='' a=data[1] if a.has_key('encoding'): encoding=a['encoding'] else: encoding='' if encoding: v=unconvert(encoding,v) transaction._descr=v transaction._thl=transaction._thl+len(v) transaction._ude=transaction._ude[0],v,transaction._ude[2] return v def save_rec(self, tag, data): a=data[1] if a.has_key('id'): a['id']=p64(string.atoi(a['id'])+1) if a.has_key('time'): start=0 stop=string.find(a['time'][start:],'-')+start year=string.atoi(a['time'][start:stop]) start=stop+1 stop=string.find(a['time'][start:],'-')+start month=string.atoi(a['time'][start:stop]) start=stop+1 stop=string.find(a['time'][start:],' ')+start day=string.atoi(a['time'][start:stop]) start=stop+1 stop=string.find(a['time'][start:],':')+start hour=string.atoi(a['time'][start:stop]) start=stop+1 stop=string.find(a['time'][start:],':')+start minute=string.atoi(a['time'][start:stop]) start=stop+1 second=string.atof(a['time'][start:]) a['time']=struct.pack(">If",(((((year-1900)*12)+month-1)*31+day-1)*24+ hour)*60 +minute, second*(1L<<32)/60) data[1]=a return data def start_transaction(self, tag, attrs): self._transaction=Transaction(self, tag, attrs) return self._transaction def start_ZopeData(self, tag, attrs): self._ZopeData=ZopeData(self, tag, attrs) return self._ZopeData def XMLtobbb(infile, outfile, binary=0): import Shared.DC.xml.pyexpat if type(infile) is StringType: data=open(infile).read() if type(outfile) is StringType: outfile=open(outfile,'w'+'b') F=ppml.xmlPickler() F.end_handlers['user'] = save_user F.end_handlers['description'] = save_description F.end_handlers['rec'] = save_rec F.start_handlers['transaction'] = start_transaction F.start_handlers['ZopeData'] = start_ZopeData F.binary=binary F.file=outfile F.tempfile=tempfile.TemporaryFile() p=xml.parsers.pyexpat.ParserCreate() p.CharacterDataHandler=F.handle_data p.StartElementHandler=F.unknown_starttag p.EndElementHandler=F.unknown_endtag r=p.Parse(data) return r def save_record(self, tag, data): file=self.file write=file.write pos=file.tell() file.seek(pos) a=data[1] if a.has_key('id'): oid=a['id'] oid=ppml.p64(string.atoi(oid)) v='' for x in data[2:]: v=v+x l=ppml.p64(len(v)) v=oid+l+v return v class zopedata: def __init__(self, parser, tag, attrs): self.file=parser.file write=self.file.write write('ZEXP') def append(self, data): file=self.file write=file.write pos=file.tell() file.seek(pos) write(data) def start_zopedata(self, tag, data): return zopedata(self, tag, data) def save_zopedata(self, tag, data): file=self.file write=file.write pos=file.tell() file.seek(pos) write(export_end_marker) def XMLtoExport(infile, outfile): import Shared.DC.xml.pyexpat.pyexpat pyexpat=Shared.DC.xml.pyexpat.pyexpat if type(infile) is StringType: infile=open(infile) if type(outfile) is StringType: outfile=open(outfile,'w'+'b') data=infile.read() F=ppml.xmlPickler() F.end_handlers['record'] = save_record F.end_handlers['ZopeData'] = save_zopedata F.start_handlers['ZopeData'] = start_zopedata F.binary=1 F.file=outfile p=pyexpat.ParserCreate() p.CharacterDataHandler=F.handle_data p.StartElementHandler=F.unknown_starttag p.EndElementHandler=F.unknown_endtag r=p.Parse(data) return r def XMLrecord(oid,len,p): q=ppml.ToXMLUnpickler f=StringIO(p) u=q(f) u.idprefix=str(oid)+'.' p=u.load().__str__(4) if f.tell() < len: p=p+u.load().__str__(4) String=' \n%s \n' % (oid, p) return String def ExporttoXML(file): String='' if type(file) is StringType: file=open(file,'rb') read=file.read if read(4) !='ZEXP': raise POSException.ExportError, 'Invalid export header' String=String+'\012\n' while 1: h=read(16) if h == export_end_marker: break if len(h) != 16: raise ExportError, 'Truncated export file' oid=ppml.u64(h[:8]) l=ppml.u64(h[8:16]) pos=file.tell() p=read(l) if len(p) != l: raise ExportError, 'Truncated export file' String=String+XMLrecord(oid,l,p) l=l+pos String=String+'\n' return String # End exportToXML def XMLstringToExport(data, outfile): import Shared.DC.xml.pyexpat if type(outfile) is StringType: outfile=open(outfile,'w'+'b') F=ppml.xmlPickler() F.end_handlers['record'] = save_record F.end_handlers['ZopeData'] = save_zopedata F.start_handlers['ZopeData'] = start_zopedata F.binary=1 F.file=outfile p=xml.parsers.pyexpat.ParserCreate() p.CharacterDataHandler=F.handle_data p.StartElementHandler=F.unknown_starttag p.EndElementHandler=F.unknown_endtag r=p.Parse(data) return r if __name__=='__main__': exportToXML(sys.argv[1]) Zope-2.0.1-ZEO-nonbin/lib/python/Globals.py100755 1007 1403 11142 6714435577 20374 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Global definitions""" __version__='$Revision: 1.42 $'[11:-2] import Acquisition, ComputedAttribute, App.PersistentExtra, os import TreeDisplay, string from App.FindHomes import INSTANCE_HOME, SOFTWARE_HOME from DateTime import DateTime from App.Common import package_home, attrget, Dictionary from Persistence import Persistent, PersistentMapping from App.special_dtml import HTML, HTMLFile from App.class_init import default__class_init__, ApplicationDefaultPermissions from App.Dialogs import MessageDialog from App.ImageFile import ImageFile DevelopmentMode=None VersionNameName='Zope-Version' data_dir = INSTANCE_HOME+'/var' for n in 'Z', 'BOBO': if os.environ.has_key('%s_DEBUG_MODE' % n): n=string.lower(os.environ['%s_DEBUG_MODE' % n]) if n=='no' or n=='off': continue try: n=string.atoi(n) except: pass if n: DevelopmentMode=1 opened=[] Zope-2.0.1-ZEO-nonbin/lib/python/ImageFile.py100755 1007 1403 7773 6712130466 20615 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Image object that is stored in a file""" __version__='$Revision: 1.11 $'[11:-2] ############################################################ # # Eventually this module will go away! # ############################################################ from App.ImageFile import ImageFile Zope-2.0.1-ZEO-nonbin/lib/python/LOG.py100644 1007 1403 7462 6736136113 17405 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## # We've renamed this module to zLOG. This one will dissappear soon. from zLOG import * Zope-2.0.1-ZEO-nonbin/lib/python/Main.py100644 1007 1403 13125 6744723443 17670 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Provide a Main application for the Zope framework The Job of this module is to: - Configure and open the database - Establish the top-level object for ZPublisher - Perform very high-level configuration tasks """ # We import BoboPOS before importing any other application # modules. This is needed to assure that the right # versions of Persistent etc get registered. from BoboPOS import SimpleDB, TJar, SingleThreadedTransaction import sys, os, string, Globals, OFS.Application Globals.BobobaseName = '%s/Data.bbb' % Globals.data_dir Globals.DatabaseVersion='2' # Setup support for broken objects: import OFS.Uninstalled, BoboPOS.PickleJar BoboPOS.PickleJar.PickleJar.Broken=OFS.Uninstalled.Broken # Open the application database OFS.Application.import_products() revision=read_only=None if os.environ.has_key('ZOPE_READ_ONLY'): read_only=1 try: revision=DateTime(os.environ['ZOPE_READ_ONLY']).timeTime() except: pass Bobobase=Globals.Bobobase=BoboPOS.PickleDictionary( Globals.BobobaseName, read_only=read_only, revision=revision) Globals.opened.append(Bobobase) VersionBase=Globals.VersionBase=TJar.TM(Bobobase) Globals.opened.append(VersionBase) try: app=Bobobase['Application'] except KeyError: app=OFS.Application.Application() Bobobase['Application']=app get_transaction().note('created Application object') get_transaction().commit() bobo_application=app OFS.Application.initialize(app) if os.environ.has_key('ZOPE_DATABASE_QUOTA'): quota=string.atoi(os.environ['ZOPE_DATABASE_QUOTA']) Bobobase._jar.db.set_quota( lambda x, quota=quota, otherdb=VersionBase.TDB: x + otherdb.pos > quota) VersionBase.TDB.set_quota( lambda x, quota=quota, otherdb=Bobobase._jar.db: x + otherdb.pos > quota) SingleThreadedTransaction.Transaction.commit=VersionBase.committer() __bobo_debug_mode__=Globals.DevelopmentMode Zope-2.0.1-ZEO-nonbin/lib/python/Persistence.py100644 1007 1403 7512 6712130466 21243 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Provide access to Persistent and PersistentMapping This avoids dependency on the database package name. """ Zope-2.0.1-ZEO-nonbin/lib/python/Setup100644 1007 1403 3706 6744726317 17444 0ustar petrillipetrilli*shared* ExtensionClass ../Components/ExtensionClass/ExtensionClass.c -I../Components/ExtensionClass Acquisition ../Components/ExtensionClass/Acquisition.c -I../Components/ExtensionClass MethodObject ../Components/ExtensionClass/MethodObject.c -I../Components/ExtensionClass MultiMapping ../Components/ExtensionClass/MultiMapping.c -I../Components/ExtensionClass ThreadLock ../Components/ExtensionClass/ThreadLock.c -I../Components/ExtensionClass Missing ../Components/ExtensionClass/Missing.c -I../Components/ExtensionClass Sync ../Components/ExtensionClass/Sync.c -I../Components/ExtensionClass Record ../Components/ExtensionClass/Record.c -I../Components/ExtensionClass ComputedAttribute ../Components/ExtensionClass/ComputedAttribute.c -I../Components/ExtensionClass cStringIO ../Components/cPickle/cStringIO.c cPickle ../Components/cPickle/cPickle.c BTree ../Components/BTree/BTree.c -I../Components/ExtensionClass -I../Components/BTree -I./ZODB IIBTree ../Components/BTree/IIBTree.c -I../Components/ExtensionClass -I../Components/BTree -I./ZODB IOBTree ../Components/BTree/IOBTree.c -I../Components/ExtensionClass -I../Components/BTree -I./ZODB OIBTree ../Components/BTree/OIBTree.c -I../Components/ExtensionClass -I../Components/BTree -I./ZODB intSet ../Components/BTree/intSet.c -I../Components/ExtensionClass -I../Components/BTree -I./ZODB zlib ../Components/zlib/zlib.c -I../Components/zlib ../Components/zlib/adler32.c ../Components/zlib/compress.c ../Components/zlib/crc32.c ../Components/zlib/gzio.c ../Components/zlib/uncompr.c ../Components/zlib/deflate.c ../Components/zlib/trees.c ../Components/zlib/zutil.c ../Components/zlib/inflate.c ../Components/zlib/infblock.c ../Components/zlib/inftrees.c ../Components/zlib/infcodes.c ../Components/zlib/infutil.c ../Components/zlib/inffast.c Zope-2.0.1-ZEO-nonbin/lib/python/dcdb.py100644 1007 1403 7357 6671334564 17673 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## def debug(): x=1 Zope-2.0.1-ZEO-nonbin/lib/python/ts_regex.py100644 1007 1403 15647 6756611134 20633 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Provide a thread-safe interface to regex """ import regex, regsub #, Sync from regex import * from regsub import split, sub, gsub, splitx, capwords try: import thread except: class allocate_lock: def acquire(*args): pass def release(*args): pass else: class SafeFunction: _l=thread.allocate_lock() _a=_l.acquire _r=_l.release def __init__(self, f): self._f=f def __call__(self, *args, **kw): self._a() try: return apply(self._f, args, kw) finally: self._r() split=SafeFunction(split) sub=SafeFunction(sub) gsub=SafeFunction(gsub) splitx=SafeFunction(splitx) capwords=SafeFunction(capwords) allocate_lock=thread.allocate_lock class compile: _r=None groupindex=None def __init__(self, *args): self._r=r=apply(regex.compile,args) self._init(r) def _init(self, r): lock=allocate_lock() self.__a=lock.acquire self.__r=lock.release self.translate=r.translate self.givenpat=r.givenpat self.realpat=r.realpat def match(self, string, pos=0): self.__a() try: return self._r.match(string, pos) finally: self.__r() def search(self, string, pos=0): self.__a() try: return self._r.search(string, pos) finally: self.__r() def search_group(self, str, group, pos=0): """Search a string for a pattern. If the pattern was not found, then None is returned, otherwise, the location where the pattern was found, as well as any specified group are returned. """ self.__a() try: r=self._r l=r.search(str, pos) if l < 0: return None return l, apply(r.group, group) finally: self.__r() def match_group(self, str, group, pos=0): """Match a pattern against a string If the string does not match the pattern, then None is returned, otherwise, the length of the match, as well as any specified group are returned. """ self.__a() try: r=self._r l=r.match(str, pos) if l < 0: return None return l, apply(r.group, group) finally: self.__r() def search_regs(self, str, pos=0): """Search a string for a pattern. If the pattern was not found, then None is returned, otherwise, the 'regs' attribute of the expression is returned. """ self.__a() try: r=self._r r.search(str, pos) return r.regs finally: self.__r() def match_regs(self, str, pos=0): """Match a pattern against a string If the string does not match the pattern, then None is returned, otherwise, the 'regs' attribute of the expression is returned. """ self.__a() try: r=self._r r.match(str, pos) return r.regs finally: self.__r() class symcomp(compile): def __init__(self, *args): self._r=r=apply(regex.symcomp,args) self._init(r) self.groupindex=r.groupindex Zope-2.0.1-ZEO-nonbin/lib/python/xmlrpclib.py100755 1007 1403 34566 6735721356 21020 0ustar petrillipetrilli# # XML-RPC CLIENT LIBRARY # $Id: xmlrpclib.py,v 1.1.1.1 1999/06/11 15:04:49 emk Exp $ # # an XML-RPC client interface for Python # # the marshalling and response parser code can also be used to # implement XML-RPC servers # # History: # 1999-01-14 fl Created # 1999-01-15 fl Changed dateTime to use localtime # 1999-01-16 fl Added Binary/base64 element, default to RPC2 service # 1999-01-19 fl Fixed array data element (from Skip Montanaro) # 1999-01-21 fl Fixed dateTime constructor, etc. # 1999-02-02 fl Added fault handling, handle empty sequences, etc. # # written by Fredrik Lundh, January 1999. # # Copyright (c) 1999 by Secret Labs AB. # Copyright (c) 1999 by Fredrik Lundh. # # fredrik@pythonware.com # http://www.pythonware.com # # -------------------------------------------------------------------- # The XML-RPC client interface is # # Copyright (c) 1999 by Secret Labs AB # Copyright (c) 1999 by Fredrik Lundh # # By obtaining, using, and/or copying this software and/or its # associated documentation, you agree that you have read, understood, # and will comply with the following terms and conditions: # # Permission to use, copy, modify, and distribute this software and its # associated documentation for any purpose and without fee is hereby # granted, provided that the above copyright notice appears in all # copies, and that both that copyright notice and this permission notice # appear in supporting documentation, and that the name of Secret Labs # AB or the author not be used in advertising or publicity pertaining to # distribution of the software without specific, written prior # permission. # # SECRET LABS AB AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO # THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND # FITNESS. IN NO EVENT SHALL SECRET LABS AB OR THE AUTHOR BE LIABLE FOR # ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES # WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN # ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT # OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. # -------------------------------------------------------------------- import operator, string, time import httplib, urllib import xmllib from types import * from cgi import escape __version__ = "0.9.5" USER_AGENT = "xmlrpclib.py/%s (by www.pythonware.com)" % __version__ # -------------------------------------------------------------------- # Exceptions class Error: # base class for client errors pass class ProtocolError(Error): # indicates an HTTP protocol error def __init__(self, url, errcode, errmsg, headers): self.url = url self.errcode = errcode self.errmsg = errmsg self.headers = headers def __repr__(self): return ( "" % (self.url, self.errcode, self.errmsg) ) class ResponseError(Error): # indicates a broken response chunk pass class Fault(Error): # indicates a XML-RPC fault package def __init__(self, faultCode, faultString, **extra): self.faultCode = faultCode self.faultString = faultString def __repr__(self): return ( "" % (self.faultCode, repr(self.faultString)) ) # -------------------------------------------------------------------- # Special values # boolean wrapper # (you must use True or False to generate a "boolean" XML-RPC value) class Boolean: def __init__(self, value = 0): self.value = (value != 0) def encode(self, out): out.write("%d\n" % self.value) def __repr__(self): if self.value: return "" % id(self) else: return "" % id(self) def __int__(self): return self.value def __nonzero__(self): return self.value True, False = Boolean(1), Boolean(0) # # dateTime wrapper # (wrap your iso8601 string or localtime tuple or time value in this # class to generate a "dateTime.iso8601" XML-RPC value) class DateTime: def __init__(self, value): t = type(value) if t is not StringType: if t is not TupleType: value = time.localtime(value) value = time.strftime("%Y%m%dT%H:%M:%S", value) self.value = value def __repr__(self): return "" % (self.value, id(self)) def decode(self, data): self.value = string.strip(data) def encode(self, out): out.write("") out.write(self.value) out.write("\n") # # binary data wrapper (NOTE: this is an extension to Userland's # XML-RPC protocol! only for use with compatible servers!) class Binary: def __init__(self, data=None): self.data = data def decode(self, data): import base64 self.data = base64.decodestring(data) def encode(self, out): import base64, StringIO out.write("\n") base64.encode(StringIO.StringIO(self.data), out) out.write("\n") WRAPPERS = DateTime, Binary, Boolean # -------------------------------------------------------------------- # XML-RPC response parser class ResponseParser(xmllib.XMLParser): """Parse an XML-RPC response into a Python data structure""" # USAGE: create a parser instance, and call "feed" to add data to # it (in chunks or as a single string). call "close" to flush the # internal buffers and return the resulting data structure. # note that this reader is fairly tolerant, and gladly accepts # bogus XML-RPC data without complaining (but not bogus XML). # this could of course be simplified by using an XML tree builder # (DOM, coreXML, or whatever), but this version works with any # standard installation of 1.5 or later (except 1.5.2b1, but # we're working on that) # by the way, if you don't understand what's going on in here, # that's perfectly ok. def __init__(self): self.__type = None self.__stack = [] self.__marks = [] self.__data = [] self.__methodname = None xmllib.XMLParser.__init__(self) def close(self): xmllib.XMLParser.close(self) # return response code and the actual response if self.__type is None or self.__marks: raise ResponseError() if self.__type == "fault": raise apply(Fault, (), self.__stack[0]) return tuple(self.__stack) def getmethodname(self): return self.__methodname # # container types (containers can be nested, so we use a separate # mark stack to keep track of the beginning of each container). def start_array(self, attrs): self.__marks.append(len(self.__stack)) start_struct = start_array def unknown_starttag(self, tag, attrs): self.__data = [] self.__value = (tag == "value") def handle_data(self, text): self.__data.append(text) def unknown_endtag(self, tag, join=string.join): # the standard dispatcher cannot handle tags with uncommon # characters in them, so we have to do this ourselves. if tag == "dateTime.iso8601": value = DateTime() value.decode(join(self.__data, "")) self.__stack.append(value) # # add values to the stack on end tags def end_boolean(self, join=string.join): value = join(self.__data, "") if value == "0": self.__stack.append(False) elif value == "1": self.__stack.append(True) else: raise TypeError, "bad boolean value" def end_int(self, join=string.join): self.__stack.append(int(join(self.__data, ""))) def end_double(self, join=string.join): self.__stack.append(float(join(self.__data, ""))) def end_string(self, join=string.join): self.__stack.append(join(self.__data, "")) # aliases end_i4 = end_int end_name = end_string # struct keys are always strings def end_array(self): mark = self.__marks[-1] del self.__marks[-1] # map arrays to Python lists self.__stack[mark:] = [self.__stack[mark:]] def end_struct(self): mark = self.__marks[-1] del self.__marks[-1] # map structs to Python dictionaries dict = {} items = self.__stack[mark:] for i in range(0, len(items), 2): dict[items[i]] = items[i+1] self.__stack[mark:] = [dict] def end_base64(self, join=string.join): value = Binary() value.decode(join(self.__data, "")) self.__stack.append(value) def end_value(self): # if we stumble upon an value element with no # no internal elements, treat it as a string # element if self.__value: self.end_string() def end_params(self): self.__type = "params" def end_fault(self): self.__type = "fault" def end_methodName(self, join=string.join): self.__methodname = join(self.__data, "") # -------------------------------------------------------------------- # XML-RPC marshaller class Marshaller: """Generate an XML-RPC params chunk from a Python data structure""" # USAGE: create a marshaller instance for each set of parameters, # and use "dumps" to convert your data (represented as a tuple) to # a XML-RPC params chunk. to write a fault response, pass a Fault # instance instead. # again, this could of course be simplified by using an XML writer # (coreXML or whatever), but this version works with any standard # installation of 1.5 or later (except 1.5.2b1, but we're working # on that) # and again, if you don't understand what's going on in here, # that's perfectly ok. def __init__(self): self.memo = {} self.data = None dispatch = {} def dumps(self, values): if isinstance(values, Fault): # fault instance self.__out = ["\n"] self.__dump(vars(values)) self.write("\n") else: # parameter block self.__out = ["\n"] for v in values: self.write("\n") self.__dump(v) self.write("\n") self.write("\n") return string.join(self.__out, "") def write(self, string): self.__out.append(string) def __dump(self, value): try: f = self.dispatch[type(value)] except KeyError: raise TypeError, "cannot marshal %s objects" % type(value) else: f(self, value) def dump_int(self, value): self.write("%s\n" % value) dispatch[IntType] = dump_int def dump_double(self, value): self.write("%s\n" % value) dispatch[FloatType] = dump_double def dump_string(self, value): self.write("%s\n" % escape(value)) dispatch[StringType] = dump_string def container(self, value): if value: i = id(value) if self.memo.has_key(i): raise TypeError, "cannot marshal recursive data structures" self.memo[i] = None def dump_array(self, value): self.container(value) self.write("\n") for v in value: self.__dump(v) self.write("\n") dispatch[TupleType] = dump_array dispatch[ListType] = dump_array def dump_struct(self, value): self.container(value) write = self.write write("\n") for k, v in value.items(): write("\n") if type(k) is not StringType: raise TypeError, "dictionary key must be string" write("%s\n" % escape(k)) self.__dump(v) write("\n") write("\n") dispatch[DictType] = dump_struct def dump_instance(self, value): # check for special wrappers write = self.write if value.__class__ in WRAPPERS: value.encode(self) else: # store instance attributes as a struct (?) self.dump_struct(value.__dict__) dispatch[InstanceType] = dump_instance # -------------------------------------------------------------------- # convenience functions def dumps(params, methodname=None, methodresponse=None): assert type(params) == TupleType or isinstance(params, Fault),\ "argument must be tuple or Fault instance" m = Marshaller() data = m.dumps(params) # standard XML-RPC wrappings if methodname: # a method call data = ( "\n" "\n" "%s\n" "%s\n" "\n" % (methodname, data) ) elif methodresponse or isinstance(params, Fault): # a method response data = ( "\n" "\n" "%s\n" "\n" % data ) return data def loads(data): # returns data plus methodname (None if not present) p = ResponseParser() p.feed(data) return p.close(), p.getmethodname() # -------------------------------------------------------------------- # request dispatcher class Method: # some magic to bind an XML-RPC method to an RPC server. # supports "nested" methods (e.g. examples.getStateName) def __init__(self, send, name): self.__send = send self.__name = name def __getattr__(self, name): return Method(self.__send, self.__name + "." + name) def __call__(self, *args): return self.__send(self.__name, args) class Server: """Represents a connection XML-RPC server""" def __init__(self, uri): # establish a "logical" server connection type, uri = urllib.splittype(uri) if type != "http": raise IOError, "unsupported XML-RPC protocol" self.__host, self.__handler = urllib.splithost(uri) if not self.__handler: self.__handler = "/RPC2" def __request(self, methodname, params): # call a method on the remote server request = dumps(params, methodname) # send the request h = httplib.HTTP(self.__host) h.putrequest("POST", self.__handler) h.putheader("User-Agent", USER_AGENT) h.putheader("Host", self.__host) h.putheader("Content-Type", "text/xml") h.putheader("Content-Length", str(len(request))) h.endheaders() if request: h.send(request) errcode, errmsg, headers = h.getreply() if errcode != 200: raise ProtocolError( self.__host + self.__handler, errcode, errmsg, headers ) # parse the response fp = h.getfile() p = ResponseParser() while 1: response = fp.read(1024) if not response: break p.feed(response) response = p.close() if len(response) == 1: return response[0] return response def __repr__(self): return ( "" % (self.__host, self.__handler) ) __str__ = __repr__ def __getattr__(self, name): # method dispatcher return Method(self.__request, name) if __name__ == "__main__": # simple test program (from the specification) # server = Server("http://localhost:8000") # local server server = Server("http://nirvana.userland.com") print server try: print server.examples.getStateName(41) except Error, v: print "ERROR", v Zope-2.0.1-ZEO-nonbin/lib/python/zLOG.py100644 1007 1403 24214 6743131532 17607 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """General logging facility This module attempts to provide a simple programming API for logging with a pluggable API for defining where log messages should go. Programmers call the LOG function to log information. The LOG function, in turn, calls the write_log method to actually write logging information somewhere. This module provides a very simple write_log implementation. It is intended that applications main programs will replace this method with a method more suited to their needs. The module provides a register_subsystem method that does nothing, but provides a hook that logging management systems could use to collect information about subsystems being used. The module defines several standard severities: BLATHER=-100 -- Somebody shut this app up. INFO=0 -- For things like startup and shutdown. PROBLEM=100 -- This isn't causing any immediate problems, but deserves attention. WARNING=100 -- A wishy-washy alias for PROBLEM. ERROR=200 -- This is going to have adverse effects. PANIC=300 -- We're dead! Also, looging facilities will normally ignore negative severities. To plug in a log handler, simply replace the log_write function with a callable object that takes 5 arguments: subsystem -- The subsystem generating the message (e.g. ZODB) severity -- The "severity" of the event. This may be an integer or a floating point number. Logging back ends may consider the int() of this valua to be significant. For example, a backend may consider any severity whos integer value is WARNING to be a warning. summary -- A short summary of the event detail -- A detailed description error -- A three-element tuple consisting of an error type, value, and traceback. If provided, then a summary of the error is added to the detail. There is a default stupid logging facility that: - swallows logging information by default, - outputs to sys.stderr if the environment variable STUPID_LOG_FILE is set to an empty string, and - outputs to file if the environment variable STUPID_LOG_FILE is set to a file name. """ import time, sys, string # Standard severities BLATHER=-100 INFO=0 PROBLEM=WARNING=100 ERROR=200 PANIC=300 def severity_string(severity, mapping={ -100: 'BLATHER', 0: 'INFO', 100: 'PROBLEM', 200: 'ERROR', 300: 'PANIC', }): """Convert a severity code to a string """ s=int(severity) if mapping.has_key(s): s=mapping[s] else: s='' return "%s(%s)" % (s, severity) def LOG(subsystem, severity, summary, detail='', error=None, reraise=None): """Log some information The required arguments are: subsystem -- The subsystem generating the message (e.g. ZODB) severity -- The "severity" of the event. This may be an integer or a floating point number. Logging back ends may consider the int() of this valua to be significant. For example, a backend may consider any severity whos integer value is WARNING to be a warning. summary -- A short summary of the event detail -- A detailed description error -- A three-element tuple consisting of an error type, value, and traceback. If provided, then a summary of the error is added to the detail. reraise -- If provided with a true value, then the error given by error is reraised. """ log_write(subsystem, severity, summary, detail, error) if reraise and error: raise error[0], error[1], error[2] _subsystems=[] def register_subsystem(subsystem): """Register a subsystem name A logging facility might replace this function to collect information about subsystems used in an application. """ _subsystems.append(subsystem) def log_time(): """Return a simple time string without spaces suitable for logging """ return ("%4.4d-%2.2d-%2.2dT%2.2d:%2.2d:%2.2d" % time.gmtime(time.time())[:6]) _stupid_dest=None _no_stupid_log=[] def stupid_log_write(subsystem, severity, summary, detail, error): if severity < 0: return global _stupid_dest if _stupid_dest is None: import os if os.environ.has_key('STUPID_LOG_FILE'): f=os.environ['STUPID_LOG_FILE'] if f: _stupid_dest=open(f,'a') else: import sys _stupid_dest=sys.stderr else: _stupid_dest=_no_stupid_log if _stupid_dest is _no_stupid_log: return _stupid_dest.write( "------\n" "%s %s %s %s\n%s" % (log_time(), severity_string(severity), subsystem, summary, detail, ) ) _stupid_dest.flush() if error: try: _stupid_dest.write(format_exception( error[0], error[1], error[2], trailer='\n', limit=100)) except: _stupid_dest.write("%s: %s\n" % error[:2]) log_write=stupid_log_write format_exception_only=None def format_exception(etype,value,tb,limit=None, delimiter='\n', header='', trailer=''): global format_exception_only if format_exception_only is None: import traceback format_exception_only=traceback.format_exception_only result=['Traceback (innermost last):'] if header: result.insert(0,header) if limit is None: if hasattr(sys, 'tracebacklimit'): limit = sys.tracebacklimit n = 0 while tb is not None and (limit is None or n < limit): f = tb.tb_frame lineno = tb.tb_lineno co = f.f_code filename = co.co_filename name = co.co_name locals=f.f_locals result.append(' File %s, line %d, in %s' % (filename,lineno,name)) try: result.append(' (Object: %s)' % locals[co.co_varnames[0]].__name__) except: pass try: result.append(' (Info: %s)' % str(locals['__traceback_info__'])) except: pass tb = tb.tb_next n = n+1 result.append(string.join(format_exception_only(etype, value), ' ')) if trailer: result.append(trailer) return string.join(result, delimiter) Zope-2.0.1-ZEO-nonbin/lib/python/zdaemon.py100755 1007 1403 20041 6743551715 20437 0ustar petrillipetrilli#!/usr/local/bin/python1.5.1 ############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ zinit, slightly smarter server manager and ZServer startup script. zinit will: - Fork a parent and a child - restart the child if it dies - write a pid file so you can kill (the parent) - reports the childs pid to stdout so you can kill that too TODO - Have the parent reap the children when it dies - etc. """ import os, sys, time, signal, posix pyth = sys.executable class KidDiedOnMeError(Exception): pass class ExecError(Exception): pass class ForkError(Exception): pass FORK_ATTEMPTS = 2 # This is the number of seconds between the parent pulsing the child. # Set to 0 to deactivate pulsing. BEAT_DELAY = 0 VERBOSE = 1 # If you want the parent to 'pulse' Zope every 'BEAT_DELAY' seconds, # put the URL to the method you want to call here. This can be any # methodish object that can be called through the web. Format is: # # activities = (("http://x/method", "username", "password"),) # # username and password may be None if the method does not require # authentication. # activities = (('http://localhost:9222/Heart/heart', 'michel', '123'), # ) import zLOG #this is a bit of a hack so I dont have to change too much code def pstamp(message, sev): zLOG.LOG("zdaemon", sev, ("zdaemon: %s: %s" % (time.ctime(time.time()), message))) def heartbeat(): print 'tha-thump' if activities: for a in activities: try: result = ZPublisher.Client.call(a[0], a[1], a[2]) except: pstamp('activity %s failed!' % a[0], zLOG.WARNING) return if result and VERBOSE: pstamp('activity %s returned: %s' % (a[0], result), zLOG.BLATHER) def forkit(attempts = FORK_ATTEMPTS): while attempts: # if at first you don't succeed... attempts = attempts - 1 try: pid = os.fork() except os.error: pstamp('Houston, the fork failed', zLOG.ERROR) time.sleep(2) else: pstamp('Houston, we have forked', zLOG.INFO) return pid def run(argv, pidfile=''): if os.environ.has_key('ZDAEMON_MANAGED'): # We're the child at this point. Don't ask. :/ return os.environ['ZDAEMON_MANAGED']='TRUE' while 1: if not os.environ.has_key('Z_DEBUG_MODE'): pid = os.fork() if pid: sys.exit(0) posix.setsid() lastt=time.time() try: pid = forkit() if pid is None: raise ForkError elif pid: # Parent pstamp(('Hi, I just forked off a kid: %s' % pid), zLOG.INFO) # here we want the pid of the parent if pidfile: pf = open(pidfile, 'w+') pf.write(("%s" % os.getpid())) pf.close() while 1: if not BEAT_DELAY: p,s = os.waitpid(pid, 0) else: p,s = os.waitpid(pid, os.WNOHANG) if not p: time.sleep(BEAT_DELAY) heartbeat() continue if s: pstamp(('Aiieee! %s exited with error code: %s' % (p, s)), zLOG.ERROR) if time.time()-lastt < 20: raise ForkError # We're probably hosed else: raise ForkError pstamp(('The kid, %s, died on me.' % pid), zLOG.WARNING) raise KidDiedOnMeError else: # Child os.execv(pyth, (pyth,)+tuple(argv)) except ExecError: sys.exit() except ForkError: sys.exit() except KidDiedOnMeError: pass def main(): argv=sys.argv[1:] if argv and argv[0][:2]=='-p': pidf=argv[0][2:] del argv[0] else: pidf='' if not argv: print __doc__ % vars() print print 'Error: no script given' run(argv, pidf) if __name__ == '__main__': main() Zope-2.0.1-ZEO-nonbin/lib/python/App/ 40755 1007 1403 0 6772126757 17041 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/App/www/ 40755 1007 1403 0 6772126757 17665 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/App/www/CacheManager_icon.gif100644 1007 1403 1577 6412515600 23745 0ustar petrillipetrilliGIF89aPPP@@@@@!,@\@`@!0aċ+:p@ƅ DFJZDBz1Kmĩ$Ǟ<]d Еk*S;Zope-2.0.1-ZEO-nonbin/lib/python/App/www/PythonPoweredSmall.gif100744 1007 1403 551 6432124176 24215 0ustar petrillipetrilliGIF89a7ֽBBB999111)))c! ,7I+u8덭č$sǣ>ˮoܪts@@cp8&*&́B);\aiC9,Xp~:oqpl#"w`7{}~`pKJNd #P.0>qY-$PgtKNs.%/S9m6,087d29%bC_y{Fa,|riBH̛H|lVna]Rov,I R=!!cF֬bE, J(,iK` .6zCJ@RK-_6;Zope-2.0.1-ZEO-nonbin/lib/python/App/www/arrow.jpg100755 1007 1403 4777 6366201216 21617 0ustar petrillipetrilliJFIFHHPhotoshop 3.08BIMxHH@[ (hht @h0 @CN' dVe9CV+SR8BIMHH8BIM8BIM 8BIM' 8BIMH/fflff/ff2Z5-8BIMp8BIM8BIM8BIM@@8BIM JFIFHH'File written by Adobe Photoshop 4.0Adobed            "?   3!1AQa"q2B#$Rb34rC%Scs5&DTdE£t6UeuF'Vfv7GWgw5!1AQaq"2B#R3$brCScs4%&5DTdEU6teuFVfv'7GWgw ?$U<8+K/^>.!j' [ַoZiiUU}RIMqVFIM$L* )JEs~ջȟIu ]2f쭵MAMUzz.J %kֺSCUSARZJJE W(O~ԋMd(HoD:\YT'[ItK g)O rzF\RHt)tS5e'F+_EѕdunD-傆tMYoz(!iW>DհT^NU.I%f^C~|41-rMjpB~_Zope-2.0.1-ZEO-nonbin/lib/python/App/www/background.jpg100644 1007 1403 6412 6366201217 22566 0ustar petrillipetrilliJFIFC   (1#%(:3=<9387@H\N@DWE78PmQW_bghg>Mqypdx\egc [ }!1AQa"q2#BR$3br %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz?~Q=)T=JQzta`dgKqx'g=8RW$r>z@FF =Gz6rs=S+q?zn6s CK7mZh?1#tTCr=kуtk }QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEفoO^NXs~nN C k }QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEr*sǯց26Nz}Nh r?cc {qqs~@=AgR'=qc~8n-s/9+ӟ)W3 $`gN[\R7=H?˵uO(((((((((((((((((((((((((((((((((`$GxlqQv=sMf'9>q&0OnڀFp i 9F}=~c=)uP0QN8>T* G^r';q~Tdcc~QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQYwsA,C=GQOdp=3o'<`aNI\H=xw<2&רNNFAN(rP )0qgN >4=-eqMunκEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEgK9#*}I0G#=@F2zE'yU#whR#J3\{aCmW9J2Cc B#'&@,H8w=pe* mîzF?tE:(((((((((((((((((((((((((((((((((*?41PIʅ6BT$s^E0H duԞ ~T1F!F#֞xaΘ ҹ""m? ylzF~QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQ_Zope-2.0.1-ZEO-nonbin/lib/python/App/www/border.gif100755 1007 1403 1632 6412521133 21705 0ustar petrillipetrilliGIF89a  !!!"""###$$$%%%&&&'''((()))***+++,,,---...///000111222333444555666777888999:::;;;<<<===>>>???@@@AAABBBCCCDDDEEEFFFGGGHHHIIIJJJKKKLLLMMMNNNOOOPPPQQQRRRSSSTTTUUUVVVWWWXXXYYYZZZ[[[\\\]]]^^^___```aaabbbcccdddeeefffggghhhiiijjjkkklllmmmnnnooopppqqqrrrssstttuuuvvvwwwxxxyyyzzz{{{|||}}}~~~!,wߝHp*LpÆJHq{(em࿏ CIɓ(S\ɲ˗0cʜI͛8sɳϟ@ JQZTtӦPaѫXjʵׯ`ÊKY;Zope-2.0.1-ZEO-nonbin/lib/python/App/www/brokenProduct.gif100755 1007 1403 1560 6636546521 23271 0ustar petrillipetrilliGIF89aPPP@@@@@!,MH`(\h0a "*4x bD.dE3DAF!^xp%Ȏ/ZD2J5C2ذϟ@ ;Zope-2.0.1-ZEO-nonbin/lib/python/App/www/cpSystem.gif100644 1007 1403 1620 6561337200 22236 0ustar petrillipetrilliGIF89aPPP@@@@@!,@m@ 0 8r_'E[7)pl<\5߃*Ją\Tu%RSES]".,^U]F.+[-NbeɪyGn z~/*d;Td*$,ITtooK[/oKƒ]Wpע 9]?ʲ:Vn,\wS^1[ˇI%zqWJٷp޷jNs}<\WֶDp֗nnAPIOTTd-견OᮗC]fk4RZKU~SZ]ҪMZANDE4 \US [ m_ѻVGRZ+[ ^So_~2Ŷ.giE]^ILz$eI^PINj@RIO{_V|yj|:`WXZ*~oU_[݊yxJ򺀄1=*2GIM5aQZ)Ө%q%5.+pKݗ8ZG\J/f'YDSTDUBUIOLIN}ukqxlˊ|7>Ntu7]?Ml*&ڌՅ *ҒJs8BIM'File written by Adobe Photoshop 4.0Adobed           s!1AQa"q2B#R3b$r%C4Scs5D'6Tdt& EFVU(eufv7GWgw8HXhx)9IYiy*:JZjzm!1AQa"q2#BRbr3$4CS%cs5DT &6E'dtU7()󄔤euFVfvGWgw8HXhx9IYiy*:JZjz ?~v_+PѼeԦIq`uo9"wg>&_[2.B9>ҙeW3mZ}'9)=qc8yИ}6z⼹ -RFp2~k-wvQ\2_"hCFCI/)K8VM]' oZope-2.0.1-ZEO-nonbin/lib/python/App/www/installedProduct.gif100644 1007 1403 1561 6561337200 23753 0ustar petrillipetrilliGIF89aPPP@@@@@!,NH*,x† Bxp"@'Nl!ɓIeʒ!]\)%ʖ4<1N5\;Zope-2.0.1-ZEO-nonbin/lib/python/App/www/logo.jpg100755 1007 1403 6303 6405101671 21406 0ustar petrillipetrilliJFIFC  !"$"$C6f" }!1AQa"q2#BR$3br %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz w!1AQaq"2B #3Rbr $4%&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz ?7$.aj0٘M<wmݯ5Kic Pp ++P,q*u{nzKtr~9;q$;bhssί,u^ F| V,"k_:Me+n>uaz_&iFICzrf,FuGZeb_`mjP2Ha^|٬#$(a_o/4 m$fҧ{<+c0+U'WẒt8#34b;LGM_ͿAW۶fIhuMH׈XiVSK2.Qr,*Q;n旷k[Z~%q$)!=ŝ; B7u9BRN-nw:Ot,IљU`9wqk1 M264}o\3hٟKR]ol^iupi0,I g”Uf7yr: jz,>I LGRpM`ŶPX+ϩ^5Q5=A?綷lUƥbc;V8о8w:m>!x&U /d 'r(&h$ޟ {[O]5Fc#LCye`PqV^Vd]:U=Ya|֑JQ&|:33sI,ؗG %r\Ɨ,shV\_?(83k)zu=|<-G#uy? xrSiR%pI-@p6Vn9;q:T[M݂QI'^/׹Ӽy|A\kpz=+oAo9U*3طkx:݂]e/2`wpּN]TK+-W%Gl'ֻ_,|-Ic\>iTrYXaXƽIP]Z2Qw1/,a_ﺁ^kN=@/uy'Tյۻ}\YiVs8 2F[\iGndHt?ݓF bvI՞&f@,bIO&Xd.svO/kzTFK.W-&ywr$# Xlqdlz|Ͻa^P}t[VR/q lNӏws~< =G[}woAu4ϊ:Ӭᴵ,PE<*F8fmH yx,e|^UWj"XÈUtp#WQW, U{I +ϋOXV$M?%( ؈IEoV6Zope-2.0.1-ZEO-nonbin/lib/python/App/www/ltab.gif100644 1007 1403 130 6702456161 21331 0ustar petrillipetrilliGIF89afff3f33! ADOBE:IR1.0!, (2 C4&;Zope-2.0.1-ZEO-nonbin/lib/python/App/www/permission.gif100755 1007 1403 1606 6745343755 22646 0ustar petrillipetrilliGIF89aPPP@@@@@!,c T0†2(D)Fxǎ @$H|H@H(ٲK 4i G3yTp$͚C}eI^\JlZ2bz=^.s_lx+w_ uaL|$IJI$RI$V2J} keѤd\R4xurpqwt $^1L٪W^S)/FY))]Ұ=D^$ʢL+JuVZQi-d$CVS%5T֊2JsQ8BIM'File written by Adobe Photoshop 4.0Adobed           s!1AQa"q2B#R3b$r%C4Scs5D'6Tdt& EFVU(eufv7GWgw8HXhx)9IYiy*:JZjzm!1AQa"q2#BRbr3$4CS%cs5DT &6E'dtU7()󄔤euFVfvGWgw8HXhx9IYiy*:JZjz ?Pk_.ko6MtIiWi$QK $+^,Cc1I~'TOTa>Nqg O$,QOI3{[>៉)Z֏_C5H.}&݀k ̷&5y >df zK g{y1[Y;$gb'Jݪ\f:_Zope-2.0.1-ZEO-nonbin/lib/python/App/www/rtab.gif100644 1007 1403 130 6702456161 21337 0ustar petrillipetrilliGIF89afff3f33! ADOBE:IR1.0!, 1"w=8 $;Zope-2.0.1-ZEO-nonbin/lib/python/App/www/sp.gif100755 1007 1403 53 6702456162 21021 0ustar petrillipetrilliGIF89a!,@D;Zope-2.0.1-ZEO-nonbin/lib/python/App/www/undo_icon.gif100744 1007 1403 1540 6411604370 22405 0ustar petrillipetrilliGIF89aPPP@@@@@!,=H LhC F(Paŋ-Z1Ɗȍ!)f|2A%_X0 ;Zope-2.0.1-ZEO-nonbin/lib/python/App/www/vManage.gif100755 1007 1403 1543 6720305253 22014 0ustar petrillipetrilliGIF89aPPP@@@@@!,@HDXa4ĉ^qcE ?4"5bHrG,;*4I;Zope-2.0.1-ZEO-nonbin/lib/python/App/www/z_button.jpg100644 1007 1403 4615 6712135301 22311 0ustar petrillipetrilliJFIFHHC  !"$"$CMN" A !1AQ"aq 2R$3bcr#&BDdt,!12AQaq ?2}ζr_xŒ(Me :@z k=&3Ńٓ3)+u$u%GRwjr4z ilRGs7V݊ׯtLjD$C +_6jҚJm;Rp|bqU@o1{BppvU5(JӅjiשY>SIj}6i8,k}bSfW\-J{D6w6HMsC$+|X'QֳhӖfߑEƂQ¯ phdzWVvZx~8\!Օ%7ơhu>8=ح\w>̘ɎeԅI# M^qW*piP\BTλX߭Ϩ\ICWu w 6yq(ߤr1mΔ=_sa-cޮn ] Nq!}kW3`it ~!,(6[Nˠu&):Hq+cSZHWVi 3NjZB2 |u=*!:j}l6%p#*$ W[J7JxHӅ<c;RWVj PR zϙ龿TX2KqJ<YSS quχ^Y׾KV6zŷ=~Xm}bK 0'Flτhͩ?939'9Y'NV 6EKf6MY=I''̒O:$w Zë2۷jl#UwvIOE1@u^l7T)0aCFdnf!)$:Fn͹8[BN~j54Ҝ5ԔS sz.~_̮0~ՈH*4N2Tđ)iK.DF!QKhO2z{jI)PD6Vut}[J$!ȈH#(4Ir7Q)5r鈚8c)„c #GQR۶?YP9 0Z\" %8>V6A]GNܮ0(&uGY MR" JFIFHH'File written by Adobe Photoshop 4.0Adobed            7"?   3!1AQa"q2B#$Rb34rC%Scs5&DTdE£t6UeuF'Vfv7GWgw5!1AQaq"2B#R3$brCScs4%&5DTdEU6teuFVfv'7GWgw ?~}Xվu' m}?9uU{^=U?Vq[~wG+ǯp]ګԎ\=^M8x߼U c}M^~Ε:uOenͿW4vc GS2sܯ 'V8xP8~}:5=SztNsG-ZWՊ;+'*Hj_Kz]mq.E.1 }m~O̯ }Wug4zAc?LMgHk=ׅgu;h&3Oj]ʢtvA{w5,'/,Ro?M4_Z?U,Y Ŷ-l"Y]t/Yp33 <\ߛ팳- OR_Z_OS`-?Mbd!n?R7$bFVlx΢[oޏ 5(ef>=O=Ֆz)Ee?G{IOK46Uaik'#P ]ny@tqc*Uv~Bgvmۍ<OE= [?O=T?M4_Z}b=o^>E'YF(5̋kMUls>gt_rkv_Ms׿^{IOE46oVծUmXYc5ͪ1{k׵ȝ?nFOYCJ۽FwTr>=f/k*geS32L?:V ]zu\.ҽvutpj譸R|R;z[oM;h+{-ѕ?E蹝k05Cq0?KCH{ՎV o>e1??ebϦ>g{E?ʳ󿲬.c[H[>+e\v] >L H٭Pۋ 4ndf1*,؝jv551d.MeYߜTmm \",KZyy5}}ǧݕKKTyx[ dRξwmz g'=3ѧ`WI7 7Ɓ%?AjIKrH z~iu| @/B9:ˬ9uT93 6VzmbfP,WuC.nMn[}VSg;)V6CZm~*_S!8Hmw~Cw5!DF'{Vd+}J4fcq݊X涧Y5{ޥ;gu';Ϧ˘ǜx.oI++.Գӱ.k+%89!uy[^Fs[{v8meIK2ȈTđz ~3zt1~E=[[[}lįY_sհp}eYLw{,~ϫ]9-7_[R#0DdxO ?t >eG1\4io_RY>e$C׾΍־ 껧c69UNc5{X[kc:y1F[;? |H;ar560٠hQ|񱕆e== tzq7?cG#|ٸ%!s;E5Rrwߑ_U׊˷>ә/;k.wa +wu7i*hݺߛ?V7(edxzߨ /xO]#_YG7ݵaU×TU}^;vKΜSoXAfexR.kK@ݻmww`um6񕗐IucLskg2Id[(R~ъŏ>n'SVkc=eggf?Z]7OW>׿&p]^m`ȭme N.)Q>)g]f}b4y?c*2m`^ W =,Ժ̸©۽ x~f(DiK҈F  };ͦټ#fszWQꁔgUXpuQ]ev7*9*Nn-`caH~mo2~[JzQŠd3k۽2~o}Nϫ]z z|~4nI2X&w8+H|[~}aIfW`f=ګimXVW3ӛӳv_7$LOOu[:}e85Y/`Y{?u-\RHh_p G+%R츁2K^?qƾkI!]osi^?qƾkI?J^?qƗsk洒Ssi^?qƾkI%?J^?qƗsk洒Ssk7? jVhuY i~c.ƍۊʫg%I)8BIM'File written by Adobe Photoshop 4.0Adobed@       2s  s!1AQa"q2B#R3b$r%C4Scs5D'6Tdt& EFVU(eufv7GWgw8HXhx)9IYiy*:JZjzm!1AQa"q2#BRbr3$4CS%cs5DT &6E'dtU7()󄔤euFVfvGWgw8HXhx9IYiy*:JZjz ?7={Zԯ|\^\O4XBI$ fvbYXqW~o~`*~ZjCA<+.h`Qurmc#VG_Tˡ<"{[V㳻@wB}l#Z[K,44 u_/5X)e4k[[lO)*VHn(T":]G__~.|y5-?= Lc 8ʣ.kC {_TT2ʉiOiCwTT1WʉiOiCwTT1WʉiOiCwTT1WʉiOiCwTT1Wʧ?_V^[}{=.>=:p{OS_yAyF\'m cZjZlS&c[J0({Eƞ_W_y95J,YkҨ`:fHQsv$6x+:>x寛jU/}X 2ۏ_rTڟ??uv{^w氵Akw+ Z’ cc~ʪ/9{|j/*Z.դ sDGy-VagUd_moo}}K^jSy4" 4JC3s h^iy~EdVϓnV- Vt3F_q4К)=̑,#'ʿYtsPIIyk||s{Ci,[xig(!_ͺGɟI4?OѼ;>S5ĶBdЦTqBj$`E7+nU}es-_SNV=orDM+5L$v>rK8qW\ΫM.<]V7t qY?6gq-hNy?v}=c^ZJ"JG9ϰh8X%],n?-+7lٜAȍhskIaqKStqZr[ = /u)L84wMs<ڂ6O"hVZ-BkG=1*<Q"n\3jW>FX :>O~fuhp7<'~H>yMkGKK$qv.\Do>#^8gO^ 㫱ו.ފ_Mǖ}>I4k *][C"j"jqRM˺+6_ .yn!*եs/Xo袎Qc5 h1W\ΫvC^KmD0h&72^[7Z*5!96-jZ5xmcuvmPQ@N{1s垢t9tr7.}_KGShTuQ-C,9CjOÿ՜ߑI"9AM[1'a1!VjOLi$Lwuz[yrZ/8xg`f9DqF]e.W'BP??'jW.lDZ--"]F@ èr-#DN3vqq_KI'>vgo..<.Q@<ʱ4dQ_ň@ .~Yk敱^[蜁t9uHBv<{#zXK%qovw]/?/Ug?k{+4~>N?-}<w?#OWMƧ7C "I $ ϢI Crzuk;Gvf$K j[G$PMJ-Esk txy.P|ݗ|r~ Oߐ~֣]/Q"EO?=>N-n/OH#Iikn PQNc7< S-vlzhnD;ү,_DGUnĩ\-WyRE'n}؜ ˖&da襧LJ 8<5~/.ZǖtCQ뾵ݍ ^O$lƊEOA>冦B3r'&M%(FDnb cɣϱtb$ȡ)j  ⯝;4o4jwl"ƹp[e?%I&OhF{D "ȿ%] W3EJEǯ} ؑ')?*kyz(Pf6>Й}᠈Ip錄% 4O&kPyGTy$IP2Ah}e?e*/UXrVLFɳDPSe 6YY| 䳻OtYIrsf;OR?ѝ1[B;R:S9~W#Sɖ_t4 6"IYS1>&8@kQX^,n4%-GP-ܷZgq {w1 eA2SK D'^]򗖼o%44oRZ+ԞRw;v9N\nfܜlXcXyK˺^auuEo9iV0 tg O<lp,}G5kK-FT5Vo9H$ ,/ʸPE8]^*ٰ=?c(}o"y_VM{*y{L]?Go7ՏyP-J*Q;]?)ኲʬUX*WUbܪ]UrwV*ʬUX*WUbܪ^MwWc_Zope-2.0.1-ZEO-nonbin/lib/python/App/ApplicationManager.py100644 1007 1403 31754 6765474010 23266 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__="""System management components""" __version__='$Revision: 1.57 $'[11:-2] import sys,os,time,string,Globals, Acquisition, os from Globals import HTMLFile from OFS.ObjectManager import ObjectManager from OFS.Folder import Folder from CacheManager import CacheManager from DateTime.DateTime import DateTime from OFS import SimpleItem from App.Dialogs import MessageDialog from Product import ProductFolder from version_txt import version_txt from cStringIO import StringIO try: import thread except: get_ident=lambda: 0 else: get_ident=thread.get_ident class Fake: def locked_in_version(self): return 0 class DatabaseManager(Fake, SimpleItem.Item, Acquisition.Implicit): """Database management""" manage=manage_main=HTMLFile('dbMain', globals()) id ='DatabaseManagement' name=title='Database Management' meta_type ='Database Management' icon='p_/DatabaseManagement_icon' manage_options=( {'label':'Database', 'action':'manage_main'}, {'label':'Cache Parameters', 'action':'manage_cacheParameters'}, {'label':'Flush Cache', 'action':'manage_cacheGC'}, {'label':'Undo', 'action':'manage_UndoForm'}, ) class VersionManager(Fake, SimpleItem.Item, Acquisition.Implicit): """Version management""" manage=manage_main=HTMLFile('versionManager', globals()) id ='Versions' name=title='Version Management' meta_type ='Version Management' icon='p_/VersionManagement_icon' manage_options=( {'label':'Version', 'action':'manage_main'}, ) # refcount snapshot info _v_rcs=None _v_rst=None class ApplicationManager(Folder,CacheManager): """System management""" __roles__=['Manager'] isPrincipiaFolderish=1 Database=DatabaseManager() Versions=VersionManager() manage=manage_main=HTMLFile('cpContents', globals()) manage_undoForm=HTMLFile('undo', globals()) def version_txt(self): if not hasattr(self, '_v_version_txt'): self._v_version_txt=version_txt() return self._v_version_txt def sys_version(self): return sys.version def sys_platform(self): return sys.platform _objects=( {'id': 'Database', 'meta_type': Database.meta_type}, {'id': 'Versions', 'meta_type': Versions.meta_type}, {'id': 'Products', 'meta_type': 'Product Management'}, ) manage_options=( {'label':'Contents', 'action':'manage_main'}, {'label':'Undo', 'action':'manage_UndoForm'}, ) id ='Control_Panel' name=title='Control Panel' meta_type ='Control Panel' icon='p_/ControlPanel_icon' process_id=os.getpid() process_start=int(time.time()) # Disable some inappropriate operations manage_addObject=None manage_delObjects=None manage_addProperty=None manage_editProperties=None manage_delProperties=None def __init__(self): self.Products=ProductFolder() # Note by brian: # # This __setstate__ does not seem to work - it creates a new ProductFolder # and adds it to the CP instance if needed, but the resulting PF does not # seem to be persistent ;( Rather than spend much time figuring out why, # I just added a check in Application.open_bobobase to create the PF if # it is needed (this is where several other b/c checks are done anyway.) # # # def __setstate__(self, v): # ApplicationManager.inheritedAttribute('__setstate__')(self, v) # if not hasattr(self, 'Products'): # self.Products=ProductFolder() def _canCopy(self, op=0): return 0 def _init(self): pass def manage_app(self, URL2): """Return to the main management screen""" raise 'Redirect', URL2+'/manage' def process_time(self): s=int(time.time())-self.process_start d=int(s/86400) s=s-(d*86400) h=int(s/3600) s=s-(h*3600) m=int(s/60) s=s-(m*60) d=d and ('%d day%s' % (d, (d != 1 and 's' or ''))) or '' h=h and ('%d hour%s' % (h, (h != 1 and 's' or ''))) or '' m=m and ('%d min' % m) or '' s='%d sec' % s return '%s %s %s %s' % (d, h, m, s) def thread_get_ident(self): return get_ident() def db_name(self): return self._p_jar.db().getName() def db_size(self): if Globals.DatabaseVersion=='2': s=os.stat(self.db_name())[6] else: s=self._p_jar.db().getSize() if s >= 1048576.0: return '%.1fM' % (s/1048576.0) return '%.1fK' % (s/1024.0) manage_debug=HTMLFile('debug', globals()) def refcount(self, n=None, t=(type(Fake), type(Acquisition.Implicit))): # return class reference info dict={} for m in sys.modules.values(): for sym in dir(m): ob=getattr(m, sym) if type(ob) in t: dict[ob]=sys.getrefcount(ob) pairs=[] append=pairs.append for ob, v in dict.items(): if hasattr(ob, '__module__'): name='%s.%s' % (ob.__module__, ob.__name__) else: name='%s' % ob.__name__ append((v, name)) pairs.sort() pairs.reverse() if n is not None: pairs=pairs[:n] return pairs def refdict(self): rc=self.refcount() dict={} for v, n in rc: dict[n]=v return dict def rcsnapshot(self): global _v_rcs global _v_rst _v_rcs=self.refdict() _v_rst=DateTime() def rcdate(self): return _v_rst def rcdeltas(self): if _v_rcs is None: self.rcsnapshot() nc=self.refdict() rc=_v_rcs rd=[] for n, c in nc.items(): try: prev=rc[n] if c > prev: rd.append( (c - prev, (c, prev, n)) ) except: pass rd.sort() rd.reverse() return map(lambda n: {'name': n[1][2], 'delta': n[0], 'pc': n[1][1], 'rc': n[1][0]}, rd) def dbconnections(self): return Globals.DB.connectionDebugInfo() if hasattr(sys, 'ZMANAGED'): manage_restartable=1 def manage_restart(self, URL1): """Shut down the application""" for db in Globals.opened: db.close() raise SystemExit, """ Zope is restarting """ % URL1 sys.exit(1) def manage_shutdown(self): """Shut down the application""" for db in Globals.opened: db.close() sys.exit(0) def manage_pack(self, days=0, REQUEST=None): """Pack the database""" t=time.time()-days*86400 db=self._p_jar.db() t=db.pack(t) if REQUEST is not None: REQUEST['RESPONSE'].redirect( REQUEST['URL1']+'/manage_workspace') return t def revert_points(self): return () def version_list(self): # Return a list of currently installed products/versions path_join=os.path.join isdir=os.path.isdir exists=os.path.exists strip=string.strip product_dir=path_join(SOFTWARE_HOME,'Products') product_names=os.listdir(product_dir) product_names.sort() info=[] for product_name in product_names: package_dir=path_join(product_dir, product_name) if not isdir(package_dir): continue version_txt=path_join(package_dir, 'version.txt') if not exists(version_txt): continue file=open(version_txt, 'r') data=file.readline() file.close() info.append(strip(data)) return info def version_info(self): r=[] try: db=self._p_jar.db() except: raise 'Zope database version error', """ Sorry, Version management is only supported if you use ZODB 3. """ for v in db.versions(): if db.versionEmpty(v): continue r.append({'id': v}) return r def manage_saveVersions(self, versions, REQUEST=None): "Commit some versions" db=self._p_jar.db() for v in versions: db.commitVersion(v) if REQUEST is not None: REQUEST['RESPONSE'].redirect(REQUEST['URL1']+'/manage_main') def manage_discardVersions(self, versions, REQUEST=None): "Discard some versions" db=self._p_jar.db() for v in versions: db.abortVersion(v) if REQUEST is not None: REQUEST['RESPONSE'].redirect(REQUEST['URL1']+'/manage_main') # Profiling support manage_profile=HTMLFile('profile', globals()) def manage_profile_stats(self, sort='time', limit=200): """Return profile data if available""" stats=getattr(sys, '_ps_', None) if stats is None: return None output=StringIO() stdout=sys.stdout sys.stdout=output stats.strip_dirs().sort_stats(sort).print_stats(limit) sys.stdout.flush() sys.stdout=stdout return output.getvalue() Zope-2.0.1-ZEO-nonbin/lib/python/App/CacheManager.py100644 1007 1403 25041 6752322522 22012 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Cache management support $Id: CacheManager.py,v 1.15 1999/08/05 14:53:06 jim Exp $''' __version__='$Revision: 1.15 $'[11:-2] import Globals, time, sys class CacheManager: """Cache management mix-in """ _cache_age=60 _cache_size=400 _vcache_age=60 _vcache_size=400 manage_cacheParameters=Globals.HTMLFile('cacheParameters', globals()) manage_cacheGC=Globals.HTMLFile('cacheGC', globals()) def cache_length(self): try: db=self._p_jar.db() except: # BoboPOS2 return len(Globals.Bobobase._jar.cache) else: return db.cacheSize() def database_size(self): try: db=self._p_jar.db() except: # BoboPOS2 return len(Globals.Bobobase._jar.db.index)*4 else: return db.objectCount() def cache_age(self): try: if self._p_jar.getVersion(): return self._vcache_age except: pass return self._cache_age def manage_cache_age(self,value,REQUEST): "set cache age" try: v=self._p_jar.getVersion() except: # BoboPOS2: if self._p_jar.db is not Globals.Bobobase._jar.db: raise 'Version Error', ( '''You may not change the database cache age while working in a version''') self._cache_age=Globals.Bobobase._jar.cache.cache_age=value else: if v: self._vcache_age=value self._p_jar.db().setVersionCacheDeactivateAfter(value) else: self._cache_age=value self._p_jar.db().setCacheDeactivateAfter(value) return self.manage_cacheParameters(self,REQUEST) def cache_size(self): try: if self._p_jar.getVersion(): return self._vcache_size except: pass return self._cache_size def manage_cache_size(self,value,REQUEST): "set cache size" try: v=self._p_jar.getVersion() except: # BoboPOS2: if self._p_jar.db is not Globals.Bobobase._jar.db: raise 'Version Error', ( '''You may not change the database cache size while working in a version''') self._cache_size=Globals.Bobobase._jar.cache.cache_size=value else: if v: self._vcache_size=value self._p_jar.db().setVersionCacheSize(value) else: self._cache_size=value self._p_jar.db().setCacheSize(value) return self.manage_cacheParameters(self,REQUEST) def cacheStatistics(self): try: return self._p_jar.db().cacheStatistics() except: pass # BoboPOS 2 return ( ('Mean time since last access (minutes)', "%.4g" % (Globals.Bobobase._jar.cache.cache_mean_age/60.0)), ('Deallocation rate (objects/minute)', "%.4g" % (Globals.Bobobase._jar.cache.cache_mean_deal*60)), ('Deactivation rate (objects/minute)', "%.4g" % (Globals.Bobobase._jar.cache.cache_mean_deac*60)), ('Time of last cache garbage collection', time.asctime(time.localtime( Globals.Bobobase._jar.cache.cache_last_gc_time )) ), ) # BoboPOS 2 def cache_mean_age(self): return Globals.Bobobase._jar.cache.cache_mean_age/60.0 # BoboPOS 2 def cache_mean_deal(self): return Globals.Bobobase._jar.cache.cache_mean_deal*60 # BoboPOS 2 def cache_mean_deac(self): return Globals.Bobobase._jar.cache.cache_mean_deac*60 # BoboPOS 2 def cache_last_gc_time(self): t=Globals.Bobobase._jar.cache.cache_last_gc_time return time.asctime(time.localtime(t)) def manage_full_sweep(self,value,REQUEST): "Perform a full sweep through the cache" try: db=self._p_jar.db() except: # BoboPOS2 Globals.Bobobase._jar.cache.full_sweep(value) else: db.cacheFullSweep(value) return self.manage_cacheGC(self,REQUEST) def manage_minimize(self,value,REQUEST): "Perform a full sweep through the cache" try: db=self._p_jar.db() except: # BoboPOS2 Globals.Bobobase._jar.cache.minimize(value) else: db.cacheMinimize(value) return self.manage_cacheGC(self,REQUEST) def initialize_cache(self): try: db=self._p_jar.db() except: # BoboPOS2 Globals.Bobobase._jar.cache.cache_size=self._cache_size Globals.Bobobase._jar.cache.cache_age =self._cache_age else: db.SetCacheSize(self._cache_size) db.SetCacheDeactivateAfter(self._cache_age) db.SetVersionCacheSize(self._vcache_size) db.SetVersionCacheDeactivateAfter(self._vcache_age) def cache_detail(self): try: db=self._p_jar.db() except: # BoboPOS2 detail={} for oid, ob in Globals.Bobobase._jar.cache.items(): if hasattr(ob, '__class__'): ob=ob.__class__ decor='' else: decor=' class' c="%s.%s%s" % (ob.__module__ or '', ob.__name__, decor) if detail.has_key(c): detail[c]=detail[c]+1 else: detail[c]=1 detail=detail.items() else: # ZODB 3 detail=db.cacheDetail() detail=map(lambda d: (("%s.%s" % (d[0].__module__, d[0].__name__)), d[1]), detail.items()) detail.sort() return detail def cache_extreme_detail(self): try: db=self._p_jar.db() except: # BoboPOS2 detail=[] rc=sys.getrefcount db=Globals.Bobobase._jar.db for oid, ob in Globals.Bobobase._jar.cache.items(): id=oid if hasattr(ob, '__class__'): if hasattr(ob,'__dict__'): d=ob.__dict__ if d.has_key('id'): id="%s (%s)" % (oid, d['id']) elif d.has_key('__name__'): id="%s (%s)" % (oid, d['__name__']) ob=ob.__class__ decor='' else: decor=' class' detail.append({ 'oid': id, 'klass': "%s.%s%s" % (ob.__module__, ob.__name__, decor), 'rc': rc(ob)-4, 'references': db.objectReferencesIn(oid), }) return detail else: # ZODB 3 return db.cacheExtremeDetail() Zope-2.0.1-ZEO-nonbin/lib/python/App/Common.py100755 1007 1403 12512 6744537022 20752 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Commonly used utility functions.""" __version__='$Revision: 1.3 $'[11:-2] from time import time, asctime, gmtime import sys, os from string import split, rfind def rfc1123_date(t=None, time=time, asctime=asctime, gmtime=gmtime, split=split): # Return an RFC 1123 format date string. t=split(asctime(gmtime(t or time()))) return '%s, %s %s %s %s GMT' % (t[0],t[2],t[1],t[4],t[3]) def absattr(attr, c=callable): # Return the absolute value of an attribute, # calling the attr if it is callable. if c(attr): return attr() return attr def aq_base(ob, hasattr=hasattr): # Return the aq_base of an object. if hasattr(ob, 'aq_base'): return ob.aq_base return ob def is_acquired(ob, hasattr=hasattr, aq_base=aq_base, absattr=absattr): # Return true if this object is not a direct # subobject of its aq_parent object. if not hasattr(ob, 'aq_parent'): return 0 if hasattr(aq_base(ob.aq_parent), absattr(ob.id)): return 0 if hasattr(aq_base(ob), 'isTopLevelPrincipiaApplicationObject') and \ ob.isTopLevelPrincipiaApplicationObject: return 0 return 1 def package_home(globals_dict): __name__=globals_dict['__name__'] m=sys.modules[__name__] if hasattr(m,'__path__'): r=m.__path__[0] elif "." in __name__: r=sys.modules[__name__[:rfind(__name__,'.')]].__path__[0] else: r=__name__ return os.path.join(os.getcwd(), r) def attrget(o,name,default): if hasattr(o,name): return getattr(o,name) return default def Dictionary(**kw): return kw # Sorry Guido Zope-2.0.1-ZEO-nonbin/lib/python/App/Dialogs.py100644 1007 1403 12421 6671334577 21111 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Common HTML dialog boxes MessageDialog(title, message, action, [target]) A very simple dialog used to display an HTML page titled title, displaying message message and an OK button. Clicking the OK button will take the browser to the URL specified in action. The *optional* target argument can be used to force a (frames capable) browser to load the URL specified in action into a specific frame. (Specifying '_new' will cause the browser to load the specified URL into a new window, for example). example usage: 
        return MessageDialog(title='Just thought you should know...',
                         message='You have wiped out your data.',
                         action='/paid_tech_support/prices.html',
                         target='_top')
    """ __version__='$Revision: 1.5 $'[11:-2] from Globals import HTML MessageDialog = HTML(""" <!--#var title-->
    TARGET="" >

    !

    """, target='', action='manage_main', title='Changed') Zope-2.0.1-ZEO-nonbin/lib/python/App/Extensions.py100644 1007 1403 20573 6730005131 21646 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Standard routines for handling Principia Extensions Principia extensions currently include external methods and pluggable brains. $Id: Extensions.py,v 1.10 1999/06/10 18:56:25 jim Exp $''' __version__='$Revision: 1.10 $'[11:-2] from string import find import os, zlib, rotor path_split=os.path.split path_join=os.path.join exists=os.path.exists class FuncCode: def __init__(self, f, im=0): self.co_varnames=f.func_code.co_varnames[im:] self.co_argcount=f.func_code.co_argcount-im def __cmp__(self,other): if other is None: return 1 try: return cmp((self.co_argcount, self.co_varnames), (other.co_argcount, other.co_varnames)) except: return 1 def _getPath(home, prefix, name, suffixes): d=path_join(home, prefix) if d==prefix: raise ValueError, ( 'The prefix, %s, should be a relative path' % prefix) d=path_join(d,name) if d==name: raise ValueError, ( # Paranoia 'The file name, %s, should be a simple file name' % name) for s in suffixes: if s: s="%s.%s" % (d, s) else: s=d if exists(s): return s def getPath(prefix, name, checkProduct=1, suffixes=('',)): """Find a file in one of several relative locations Arguments: prefix -- The location, relative to some home, to look for the file name -- The name of the file. This must not be a path. checkProduct -- a flag indicating whether product directories should be used as additional hope ares to be searched. This defaults to a true value. If this is true and the name contains a dot, then the text before the dot is treated as a product name and the product package directory is used as anothe rhome. suffixes -- a sequences of file suffixes to check. By default, the name is used without a suffix. The search takes on multiple homes which are INSTANCE_HOME, the directory containing the directory containing SOFTWARE_HOME, and possibly product areas. """ d,n = path_split(name) if d: raise ValueError, ( 'The file name, %s, should be a simple file name' % name) sw=path_split(path_split(SOFTWARE_HOME)[0])[0] for home in (INSTANCE_HOME, sw): if checkProduct: l=find(name, '.') if l > 0: p=name[:l] n=name[l+1:] r=_getPath(home, "Products/%s/%s/" % (p,prefix), n, suffixes) if r is not None: return r r=_getPath(home, prefix, name, suffixes) if r is not None: return r def getObject(module, name, reload=0, # The use of a mutable default is intentional here, # because modules is a module cache. modules={} ): # The use of modules here is not thread safe, however, there is # no real harm in a rece condition here. If two threads # update the cache, then one will have simply worked a little # harder than need be. So, in this case, we won't incur # the expense of a lock. if modules.has_key(module): old=modules[module] if old.has_key(name) and not reload: return old[name] else: old=None if module[-3:]=='.py': p=module[:-3] elif module[-4:]=='.pyp': p=module[:-4] else: p=module p=getPath('Extensions', p, suffixes=('','py','pyp')) if p is None: raise "Module Error", ( "The specified module, %s, couldn't be found." % module) __traceback_info__=p, module if p[-4:]=='.pyp': data=zlib.decompress( rotor.newrotor(d+' shshsh').decrypt(open(p,'rb').read()) ) execsrc=compile(data,module,'exec') else: try: execsrc=open(p) except: raise "Module Error", ( "The specified module, %s, couldn't be opened." % module) m={} exec execsrc in m try: r=m[name] except KeyError: raise 'Invalid Object Name', ( "The specified object, %s, was not found in module, " "%s." % (name, module)) if old: for k, v in m.items(): old[k]=v else: modules[module]=m return r class NoBrains: pass def getBrain(module, class_name, reload=0): 'Check/load a class' if not module and not class_name: return NoBrains try: c=getObject(module, class_name, reload) except KeyError, v: if v == class_name: raise ValueError, ( 'The class, %s, is not defined in file, %s' % (class_name, module)) if not hasattr(c,'__bases__'): raise ValueError, ( '%s, is not a class' % class_name) return c Zope-2.0.1-ZEO-nonbin/lib/python/App/Factory.py100644 1007 1403 15054 6745343753 21141 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Principia Factories $Id: Factory.py,v 1.13 1999/07/21 13:15:23 jim Exp $''' __version__='$Revision: 1.13 $'[11:-2] import OFS.SimpleItem, Acquisition, Globals, AccessControl.Role import Products, Product class Factory( AccessControl.Role.RoleManager, Globals.Persistent, Acquisition.Implicit, OFS.SimpleItem.Item ): "Model factory meta-data" meta_type='Zope Factory' icon='p_/Factory_icon' permission='' # Waaaa _setObject=Acquisition.Acquired __ac_permissions__=( ('Edit Factories', ('manage_edit','manage_main')), ('Use Factories', ('index_html','')), ) manage_options=( {'label':'Edit', 'action':'manage_main'}, {'label':'Security', 'action':'manage_access'}, ) def __init__(self, id, title, object_type, initial, permission=''): self.id=id self.title=title self.object_type=object_type self.initial=initial self.permission=permission def manage_edit(self, title, object_type, initial, permission='', REQUEST=None): "Modify factory properties." self._unregister() self.title=title self.object_type=object_type self.initial=initial self.permission=permission self.manage_setPermissionMapping(('Use Factories',), (permission,)) self._register() if REQUEST is not None: return self.manage_main(self, REQUEST) def manage_afterAdd(self, item, container): if hasattr(self, 'aq_parent'): container=self.aq_parent elif item is not self: container=None if (item is self or getattr(container, '__class__', None) is Product.Product): self._register() def manage_beforeDelete(self, item, container): if hasattr(self, 'aq_parent'): container=self.aq_parent elif item is not self: container=None if (item is self or getattr(container, '__class__', None) is Product.Product): self._unregister() def _register(self): # Register with the product folder product=self.aq_parent product.aq_acquire('_manage_add_product_meta_type')( product, self.id, self.object_type, self.permission) def _unregister(self): # Unregister with the product folder product=self.aq_parent product.aq_acquire('_manage_remove_product_meta_type')( product, self.id, self.object_type) manage_main=Globals.HTMLFile('editFactory',globals()) def index_html(self, REQUEST): " " return getattr(self, self.initial)(self.aq_parent, REQUEST) def objectIds(self): return filter( lambda id, myid=self.id: id != myid, self.aq_parent.objectIds() ) class ProductFactory(Factory): pass Zope-2.0.1-ZEO-nonbin/lib/python/App/FactoryDispatcher.py100644 1007 1403 14261 6753641736 23150 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## # Implement the manage_addProduct method of object managers import Acquisition, sys from string import rfind from AccessControl.PermissionMapping import aqwrap class ProductDispatcher(Acquisition.Implicit): " " def __getitem__(self, name): product=self.aq_acquire('_getProducts')()._product(name) dispatcher=FactoryDispatcher(product, self.aq_parent) return dispatcher.__of__(self) def __bobo_traverse__(self, REQUEST, name): product=self.aq_acquire('_getProducts')()._product(name) dispatcher=FactoryDispatcher(product, self.aq_parent, REQUEST) return dispatcher.__of__(self) class FactoryDispatcher(Acquisition.Implicit): " " def __init__(self, product, dest, REQUEST=None): if hasattr(product,'aq_base'): product=product.aq_base self._product=product self._d=dest if REQUEST is not None: v=REQUEST['URL'] v=v[:rfind(v,'/')] self._u=v[:rfind(v,'/')] def Destination(self): "Return the destination for factory output" return self.__dict__['_d'] # we don't want to wrap the result! this=Destination this__roles__=Destination__roles__=None def DestinationURL(self): "Return the URL for the destination for factory output" return self._u DestinationURL__roles__=None def __getattr__(self, name): p=self.__dict__['_product'] d=p.__dict__ if hasattr(p,name) and d.has_key(name): m=d[name] w=getattr(m, '_permissionMapper', None) if w is not None: m=ofWrapper(aqwrap(m, getattr(w,'aq_base',w), self)) return m # Waaa m='Products.%s' % p.id if sys.modules.has_key(m) and sys.modules[m]._m.has_key(name): return sys.modules[m]._m[name] raise AttributeError, name # Provide acquired indicators for critical OM methods: _setObject=Acquisition.Acquired # Provide a replacement for manage_main that does a redirection: def manage_main(trueself, self, REQUEST, update_menu=0): """IMplement a contents view by redirecting to the true view """ d = update_menu and '/manage_main?update_menu=1' or '/manage_main' REQUEST['RESPONSE'].redirect(self.DestinationURL()+d) import ExtensionClass class ofWrapper(ExtensionClass.Base): def __init__(self, o): self._o=o def __of__(self, parent): return self.__dict__['_o'] Zope-2.0.1-ZEO-nonbin/lib/python/App/FindHomes.py100644 1007 1403 11554 6716074216 21400 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Commonly used utility functions.""" __version__='$Revision: 1.3 $'[11:-2] import os, sys, Products, string from Common import package_home try: home=os.environ['SOFTWARE_HOME'] except: home=package_home(Products.__dict__) if not os.path.isabs(home): home=os.path.join(os.getcwd(), home) home,e=os.path.split(home) if os.path.split(home)[1]=='.': home=os.path.split(home)[0] if os.path.split(home)[1]=='..': home=os.path.split(os.path.split(home)[0])[0] sys.modules['__builtin__'].SOFTWARE_HOME=SOFTWARE_HOME=home try: chome=os.environ['INSTANCE_HOME'] except: chome=home d,e=os.path.split(chome) if e=='python': d,e=os.path.split(d) if e=='lib': chome=d or os.getcwd() sys.modules['__builtin__'].INSTANCE_HOME=INSTANCE_HOME=chome # If there is a Products package in INSTANCE_HOME, add it to the # Products package path ip=os.path.join(INSTANCE_HOME, 'Products') if os.path.isdir(ip) and ip not in Products.__path__: disallow=string.lower(os.environ.get('DISALLOW_LOCAL_PRODUCTS','')) if disallow in ('no', 'off', '0', ''): Products.__path__.insert(0, ip) Zope-2.0.1-ZEO-nonbin/lib/python/App/ImageFile.py100755 1007 1403 12661 6723535405 21351 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Image object that is stored in a file""" __version__='$Revision: 1.9 $'[11:-2] from OFS.content_types import guess_content_type from Globals import package_home from Common import rfc1123_date from string import rfind, split from DateTime import DateTime from time import time from os import stat import Acquisition import string class ImageFile(Acquisition.Explicit): """Image objects stored in external files.""" def __init__(self,path,_prefix=None): if _prefix is None: _prefix=SOFTWARE_HOME elif type(_prefix) is not type(''): _prefix=package_home(_prefix) path='%s/%s' % (_prefix, path) self.path=path file=open(path, 'rb') data=file.read() file.close() content_type, enc=guess_content_type(path, data) if content_type: self.content_type=content_type else: self.content_type='image/%s' % path[rfind(path,'.')+1:] self.__name__=path[rfind(path,'/')+1:] self.lmt=float(stat(path)[8]) or time() self.lmh=rfc1123_date(self.lmt) def index_html(self, REQUEST, RESPONSE): """Default document""" RESPONSE.setHeader('Content-Type', self.content_type) f=open(self.path,'rb') data=f.read() f.close() return data HEAD__roles__=None def HEAD(self, REQUEST, RESPONSE): """ """ RESPONSE.setHeader('Content-Type', self.content_type) RESPONSE.setHeader('Last-Modified', self.lmh) return '' def __len__(self): # This is bogus and needed because of the way Python tests truth. return 1 def __str__(self): return '%s' % (self.__name__, self.title_or_id()) Zope-2.0.1-ZEO-nonbin/lib/python/App/Management.py100644 1007 1403 21001 6761067077 21573 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Standard management interface support $Id: Management.py,v 1.29 1999/08/25 22:29:19 jim Exp $""" __version__='$Revision: 1.29 $'[11:-2] import sys, Globals, ExtensionClass from Dialogs import MessageDialog from Globals import HTMLFile from string import split, join, find class Tabs(ExtensionClass.Base): """Mix-in provides management folder tab support.""" manage_tabs__roles__=('Anonymous',) manage_tabs =HTMLFile('manage_tabs', globals()) #__ac_permissions__=( # ('View management screens', ('manage_help', )), # ) manage_help__roles__=() def manage_help(self, RESPONSE, SCRIPT_NAME): "Help!" RESPONSE.redirect(SCRIPT_NAME+'/HelpSys/hs_index') return '' manage_options =() filtered_manage_options__roles__=None def filtered_manage_options( self, REQUEST=None, help_option_=({'label': 'Help', 'action': 'manage_help', 'target':"z_help_wnd"},), ): if REQUEST is None and hasattr(self, 'aq_acquire'): try: REQUEST=self.aq_acquire('REQUEST') except: pass try: user=REQUEST['AUTHENTICATED_USER'] except: user=None result=[] seen_roles={} try: options=tuple(self.manage_options)+help_option_ except: options=tuple(self.manage_options())+help_option_ for d in options: label=d.get('label', None) if (label=='Security' and hasattr(self, '_isBeingUsedAsAMethod') and self._isBeingUsedAsAMethod()): d['label']='Define Permissions' path=d.get('path', None) if path is None: path=d['action'] try: # Traverse to get the action: o=self for a in split(path,'/'): if not a: continue if a=='..': o=o.aq_parent continue if hasattr(o, '__bobo_traverse__'): o=o.__bobo_traverse__(REQUEST, a) elif hasattr(o,a): o=getattr(o,a) else: o=o[a] except: o=None if o is None: continue result.append(d) # Waaaa # Get the roles and check for public methods try: roles=o.__roles__ except: roles=None if roles is None or 'Anonymous' in roles: result.append(d) continue # Do the validation check, trying to # optimize things for the common case of # many actions with the same roles. for r in roles: ok=seen_roles.get(r,None) if ok is None: if user is None: break else: try: ok=user.allowed(o, (r,)) except: ok=0 seen_roles[r]=ok if ok: result.append(d) break return result manage_workspace__roles__=('Anonymous',) def manage_workspace(self, REQUEST): """Dispatch to first interface in manage_options """ options=self.filtered_manage_options(REQUEST) try: m=options[0]['action'] if m=='manage_workspace': raise TypeError except: raise 'Unauthorized', ( 'You are not authorized to view this object.

    ') if find(m,'/'): raise 'Redirect', ( "%s/%s" % (REQUEST['URL1'], m)) return getattr(self, m)(self, REQUEST) def tabs_path_info(self, script, path): url=script out=[] while path[:1]=='/': path=path[1:] while path[-1:]=='/': path=path[:-1] while script[:1]=='/': script=script[1:] while script[-1:]=='/': script=script[:-1] path=split(path,'/')[:-1] if script: path=[script]+path if not path: return '' script='' last=path[-1] del path[-1] for p in path: script="%s/%s" % (script, p) out.append('%s' % (script, p)) out.append(last) return join(out,' / ') Globals.default__class_init__(Tabs) class Navigation(ExtensionClass.Base): """Basic (very) navigation UI support""" manage =HTMLFile('manage', globals()) manage_menu =HTMLFile('menu', globals()) manage_copyright=HTMLFile('copyright', globals()) manage_copyright__roles__=None __ac_permissions__=( ('View management screens', ('manage', 'manage_menu',)), ) Globals.default__class_init__(Navigation) Zope-2.0.1-ZEO-nonbin/lib/python/App/Permission.py100644 1007 1403 13700 6745343754 21657 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Zope registerable permissions $Id: Permission.py,v 1.1 1999/07/21 13:15:24 jim Exp $''' __version__='$Revision: 1.1 $'[11:-2] import OFS.SimpleItem, Acquisition, Globals, ExtensionClass, AccessControl.Role class Permission( AccessControl.Role.RoleManager, Globals.Persistent, Acquisition.Implicit, OFS.SimpleItem.Item ): "Model Permission meta-data" meta_type='Zope Permission' icon='p_/Permission_icon' manage_options=( {'label':'Edit', 'action':'manage_main'}, {'label':'Security', 'action':'manage_access'}, ) def __init__(self, id, title, name): self.id=id self.title=title self.name=name def manage_edit(self, title, name, REQUEST=None): "Modify Permission properties." if title != self.title: self.title=title if name != self.name: self._unregister() self.name=name self._register() if REQUEST is not None: return self.manage_main(self, REQUEST) def manage_afterAdd(self, item, container): self._register() def manage_beforeDelete(self, item, container): self._unregister() def _register(self): # Register with the product folder product=self.aq_parent product.aq_acquire('_manage_add_product_permission')( product, self.name) def _unregister(self): # Unregister with the product folder product=self.aq_parent product.aq_acquire('_manage_remove_product_permission')( product, self.name) manage_main=Globals.HTMLFile('editPermission',globals()) index_html=None class PermissionManager(ExtensionClass.Base): __ac_permissions__=( ('Define permissions', ('manage_addPermissionForm', 'manage_addPermission')), ) meta_types={ 'name': Permission.meta_type, 'action': 'manage_addPermissionForm' }, manage_addPermissionForm=Globals.HTMLFile('addPermission',globals()) def manage_addPermission( self, id, title, permission, REQUEST=None): ' ' i=Permission(id, title, permission) self._setObject(id,i) if REQUEST is not None: return self.manage_main(self,REQUEST,update_menu=1) Zope-2.0.1-ZEO-nonbin/lib/python/App/PersistentExtra.py100644 1007 1403 12643 6741151505 22663 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## from class_init import default__class_init__ from Persistence import Persistent import Globals from DateTime import DateTime Persistent.__dict__['__class_init__']=default__class_init__ class PersistentUtil: def bobobase_modification_time(self): jar=self._p_jar oid=self._p_oid if jar is None or oid is None: return DateTime() try: t=self._p_mtime if t is None: return DateTime() except: t=0 return DateTime(t) def locked_in_version(self): """Was the object modified in any version? """ jar=self._p_jar oid=self._p_oid if jar is None or oid is None: return None try: mv=jar.modifiedInVersion except: pass else: return mv(oid) # BoboPOS 2 code: oid=self._p_oid return (oid and Globals.VersionBase.locks.has_key(oid) and Globals.VersionBase.verify_lock(oid) and 'some version') def modified_in_version(self): """Was the object modified in this version? """ jar=self._p_jar oid=self._p_oid if jar is None or oid is None: return None try: mv=jar.modifiedInVersion except: pass else: return mv(oid)==jar.getVersion() # BoboPOS 2 code: jar=self._p_jar if jar is None: if hasattr(self,'aq_parent') and hasattr(self.aq_parent, '_p_jar'): jar=self.aq_parent._p_jar if jar is None: return 0 if not jar.name: return 0 try: jar.db[self._p_oid] except: return 0 return 1 for k, v in PersistentUtil.__dict__.items(): Persistent.__dict__[k]=v Zope-2.0.1-ZEO-nonbin/lib/python/App/Product.py100644 1007 1403 35611 6745343754 21154 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Principia Product Objects """ # The new Product model: # # Products may be defined with Principia or by placing directories in # lib/python/Products. # # Products in lib/python/Products may have up to three sources of information: # # - Static information defined via Python. This information is # described and made available via __init__.py. # # - Dynamic object data that gets copied into the Bobobase. # This is contained in product.dat (which is obfuscated). # # - Static extensions supporting the dynamic data. These too # are obfuscated. # # Products may be copied and pasted only within the products folder. # # If a product is deleted (or cut), it is automatically recreated # on restart if there is still a product directory. import Globals, OFS.Folder, OFS.SimpleItem, os, string, Acquisition, Products from OFS.Folder import Folder import regex, zlib, Globals, cPickle, marshal, rotor from string import rfind, atoi, find, strip, join from Factory import Factory from Permission import PermissionManager import ZClasses, ZClasses.ZClass class ProductFolder(Folder): "Manage a collection of Products" id ='Products' name=title='Product Management' meta_type ='Product Management' icon='p_/ProductFolder_icon' manage_options=( {'label':'Contents', 'action':'manage_main'}, {'label':'Properties', 'action':'manage_propertiesForm'}, {'label':'Security', 'action':'manage_access'}, {'label':'Undo', 'action':'manage_UndoForm'}, {'label':'Find', 'action':'manage_findFrame'}, ) all_meta_types={'name': 'Product', 'action': 'manage_addProductForm'}, meta_types=all_meta_types def _product(self, name): return getattr(self, name) manage_addProductForm=Globals.HTMLFile('addProduct',globals()) def manage_addProduct(self, id, title, REQUEST=None): ' ' i=Product(id, title) self._setObject(id,i) if REQUEST is not None: return self.manage_main(self,REQUEST,update_menu=1) def _canCopy(self, op=0): return 0 class Product(Folder, PermissionManager): """Model a product that can be created through the web. """ meta_type='Product' icon='p_/Product_icon' version='' configurable_objects_=() import_error_=None _isBeingUsedAsAMethod_=1 def new_version(self, _intending=regex.compile("[.]?[0-9]+$").search, #TS ): # Return a new version number based on the existing version. v=str(self.version) if not v: return '1.0' if _intending(v) < 0: return v l=rfind(v,'.') return v[:l+1]+str(1+atoi(v[l+1:])) meta_types=( ZClasses.meta_types+PermissionManager.meta_types+ ( { 'name': Factory.meta_type, 'action': 'manage_addPrincipiaFactoryForm' }, ) ) manage_addZClassForm=ZClasses.methods['manage_addZClassForm'] manage_addZClass =ZClasses.methods['manage_addZClass'] manage_subclassableClassNames=ZClasses.methods[ 'manage_subclassableClassNames'] manage_options=( {'label':'Contents', 'action':'manage_main'}, {'label':'Properties', 'action':'manage_propertiesForm'}, {'label':'Security', 'action':'manage_access'}, {'label':'Undo', 'action':'manage_UndoForm'}, {'label':'Find', 'action':'manage_findFrame'}, {'label':'Distribution', 'action':'manage_distributionView'}, ) manage_distributionView=Globals.HTMLFile('distributionView',globals()) _properties=Folder._properties+( {'id':'version', 'type': 'string'}, ) manage_addPrincipiaFactoryForm=Globals.HTMLFile('addFactory',globals()) def manage_addPrincipiaFactory( self, id, title, object_type, initial, permission=None, REQUEST=None): ' ' i=Factory(id, title, object_type, initial, permission) self._setObject(id,i) if REQUEST is not None: return self.manage_main(self,REQUEST,update_menu=1) def __init__(self, id, title): self.id=id self.title=title def Destination(self): "Return the destination for factory output" return self Destination__roles__=None def DestinationURL(self): "Return the URL for the destination for factory output" return self.REQUEST['BASE4'] DestinationURL__roles__=None def manage_distribute(self, version, RESPONSE, configurable_objects=[]): "Set the product up to create a distribution and give a link" if self.__dict__.has_key('manage_options'): raise TypeError, 'This product is not redistributable.' self.version=version=strip(version) self.configurable_objects_=configurable_objects RESPONSE.redirect('Distributions/%s-%s.tar.gz' % (self.id, version)) def _distribution(self): # Return a distribution if self.__dict__.has_key('manage_options'): raise TypeError, 'This product is not redistributable.' id=self.id import tar rot=rotor.newrotor(id+' shshsh') ar=tar.tgzarchive("%s-%s" % (id, self.version)) prefix="lib/python/Products/%s/" % self.id # __init__.py ar.add(prefix+"__init__.py", '''"Product %s" ''' % id ) # Extensions pp=id+'.' lpp=len(pp) ed=os.path.join(INSTANCE_HOME,'Extensions') if os.path.exists(ed): for name in os.listdir(ed): suffix='' if name[:lpp]==pp: path=os.path.join(ed, name) try: f=open(path) data=f.read() f.close() if name[-3:]=='.py': data=rot.encrypt(zlib.compress(data)) suffix='p' except: data=None if data: ar.add("%sExtensions/%s%s" % (prefix,name[lpp:],suffix), data) # version.txt ar.add(prefix+'version.txt', self.version) # product.dat f=CompressedOutputFile(rot) meta={ '_objects': tuple(filter( lambda o, obs=self.configurable_objects_: o['id'] in obs, self._objects)) } f.write(cPickle.dumps(meta,1)) self._p_jar.exportFile(self._p_oid, f) ar.add(prefix+'product.dat', f.getdata()) ar.finish() return str(ar) class Distributions(Acquisition.Explicit): "Product Distributions" def __bobo_traverse__(self, REQUEST, name): if name[-7:] != '.tar.gz': raise 'Invalid Name', name l=find(name,'-') id, version = name[:l], name[l+1:-7] product=self.aq_parent if product.id==id and product.version==version: return Distribution(product) raise 'Invalid version or product id', name Distributions=Distributions() manage_traceback=Globals.HTMLFile('traceback',globals()) manage_readme=Globals.HTMLFile('readme',globals()) def manage_get_product_readme__(self): try: return open(os.path.join( SOFTWARE_HOME, 'Products', self.id,'README.txt' )).read() except: return '' def permissionMappingPossibleValues(self): return self.possible_permissions() class CompressedOutputFile: def __init__(self, rot): self._c=zlib.compressobj() self._r=[] self._rot=rot rot.encrypt('') def write(self, s): self._r.append(self._rot.encryptmore(self._c.compress(s))) def getdata(self): self._r.append(self._rot.encryptmore(self._c.flush())) return join(self._r,'') class CompressedInputFile: _done=0 def __init__(self, f, rot): self._c=zlib.decompressobj() self._b='' if type(rot) is type(''): rot=rotor.newrotor(rot) self._rot=rot rot.decrypt('') self._f=f def _next(self): if self._done: return l=self._f.read(8196) if not l: l=self._c.flush() self._done=1 else: l=self._c.decompress(self._rot.decryptmore(l)) self._b=self._b+l def read(self, l=None): if l is None: while not self._done: self._next() l=len(self._b) else: while l > len(self._b) and not self._done: self._next() r=self._b[:l] self._b=self._b[l:] return r def readline(self): l=find(self._b, '\n') while l < 0 and not self._done: self._next() l=find(self._b, '\n') if l < 0: l=len(self._b) else: l=l+1 r=self._b[:l] self._b=self._b[l:] return r class Distribution: "A distribution builder" def __init__(self, product): self._product=product def index_html(self, RESPONSE): "Return distribution data" r=self._product._distribution() RESPONSE['content-type']='application/x-gzip' return r def initializeProduct(productp, name, home, app): # Initialize a levered product products=app.Control_Panel.Products if hasattr(productp, '__import_error__'): ie=productp.__import_error__ else: ie=None try: fver=strip(open(home+'/version.txt').read()) except: fver='' old=None try: if ihasattr(products,name): old=getattr(products, name) if (ihasattr(old,'version') and old.version==fver and hasattr(old, 'import_error_') and old.import_error_==ie): return old except: pass try: f=CompressedInputFile(open(home+'/product.dat','rb'),name+' shshsh') meta=cPickle.Unpickler(f).load() product=app._p_jar.importFile(f) product._objects=meta['_objects'] except: f=fver and (" (%s)" % fver) product=Product(name, 'Installed product %s%s' % (name,f)) if old is not None: app._manage_remove_product_meta_type(product) products._delObject(name) for id, v in old.objectValues(): try: product._setObject(id, v) except: pass products._setObject(name, product) #product.__of__(products)._postCopy(products) product.manage_options=Folder.manage_options product.icon='p_/InstalledProduct_icon' product.version=fver product._distribution=None product.manage_distribution=None product.thisIsAnInstalledProduct=1 if ie: product.import_error_=ie product.title='Broken product %s' % name product.icon='p_/BrokenProduct_icon' product.manage_options=( {'label':'Traceback', 'action':'manage_traceback'}, ) if os.path.exists(os.path.join(home, 'README.txt')): product.manage_options=product.manage_options+( {'label':'README', 'action':'manage_readme'}, ) return product def ihasattr(o, name): return hasattr(o, name) and o.__dict__.has_key(name) Zope-2.0.1-ZEO-nonbin/lib/python/App/ProductContext.py100644 1007 1403 23105 6745343754 22514 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Objects providing context for product initialization """ from AccessControl.PermissionRole import PermissionRole import Globals, os, OFS.ObjectManager, OFS.misc_, Products, OFS.PropertySheets if not hasattr(Products, 'meta_types'): Products.meta_types=() if not hasattr(Products, 'meta_classes'): Products.meta_classes={} Products.meta_class_info={} class ProductContext: def __init__(self, product, app, package): self.__prod=product self.__app=app self.__pack=package def registerClass(self, instance_class=None, meta_type='', permission=None, constructors=(), icon=None, permissions=None, legacy=(), ): """Register a constructor Keyword arguments are used to provide meta data: instance_class -- The class of the object that will be created. This is not currently used, but may be used in the future to increase object mobility. meta_type -- The kind of object being created This appears in add lists. If not specified, then the class meta_type will be used. permission -- The permission name for the constructors. If not specified, then a permission name based on the meta type will be used. constructors -- A list of constructor methods A method can me a callable object with a __name__ attribute giving the name the method should have in the product, or the method may be a tuple consisting of a name and a callable object. The method must be picklable. The first method will be used as the initial method called when creating an object. icon -- The name of an image file in the package to be used for instances. Note that the class icon attribute will be set automagically if an icon is provided. permissions -- Additional permissions to be registered If not provided, then permissions defined in the class will be registered. legacy -- A list of legacy methods to be added to ObjectManager for backward compatibility """ app=self.__app pack=self.__pack initial=constructors[0] tt=type(()) productObject=self.__prod pid=productObject.id if icon and instance_class is not None: setattr(instance_class, 'icon', 'misc_/%s/%s' % (pid, os.path.split(icon)[1])) OM=OFS.ObjectManager.ObjectManager perms={} for p in Products.__ac_permissions__: perms[p[0]]=None if permission is None: permission="Add %ss" % (meta_type or instance_class.meta_type) if permissions is None: permissions=[] if hasattr(instance_class, '__ac_permissions__'): for p in instance_class.__ac_permissions__: if len(p) > 2: permissions.append((p[0],p[2])) else: permissions.append(p[0]) pr=None for p in (permission,)+tuple(permissions): if type(p) is tt: p, default= p else: default=('Manager',) if pr is None: pr=pr_=PermissionRole(p,default) else: pr_=PermissionRole(p,default) if not perms.has_key(p): perms[p]=None Products.__ac_permissions__=( Products.__ac_permissions__+((p,(),default),)) if not hasattr(Globals.ApplicationDefaultPermissions, pr_._p): setattr(Globals.ApplicationDefaultPermissions, pr_._p, default) for method in legacy: if type(method) is tt: name, method = method else: name=method.__name__ if not OM.__dict__.has_key(name): setattr(OM, name, method) setattr(OM, name+'__roles__', pr) if type(initial) is tt: name, initial = initial else: name=initial.__name__ if not hasattr(pack, '_m'): pack._m={} m=pack._m Products.meta_types=Products.meta_types+( { 'name': meta_type or instance_class.meta_type, 'action': ('manage_addProduct/%s/%s' % (pid, name)), 'product': pid, 'permission': permission, },) m[name]=initial m[name+'__roles__']=pr for method in constructors[1:]: if type(method) is tt: name, method = method else: name=method.__name__ if not productObject.__dict__.has_key(name): m[name]=method m[name+'__roles__']=pr if icon: name=os.path.split(icon)[1] icon=Globals.ImageFile(icon, self.__pack.__dict__) icon.__roles__=None if not hasattr(OFS.misc_.misc_, pid): setattr(OFS.misc_.misc_, pid, OFS.misc_.Misc_(pid, {})) getattr(OFS.misc_.misc_, pid)[name]=icon def registerZClass(self, Z, meta_type=None): base_class=Z._zclass_ if meta_type is None: if hasattr(base_class, 'meta_type'): meta_type=base_class.meta_type else: meta_type=base_class.__name__ key="%s/%s" % (base_class.__module__, base_class.__name__) Products.meta_class_info[key]=meta_type Products.meta_classes[key]=Z def registerBaseClass(self, base_class, meta_type=None): d={} zname='_ZClass_for_'+base_class.__name__ exec 'class %s: pass' % zname in d Z=d[zname] Z.propertysheets=OFS.PropertySheets.PropertySheets() Z._zclass_=base_class Z.manage_options=() pack=self.__pack Z.__module__=pack.__name__ setattr(pack, zname, Z) return self.registerZClass(Z, meta_type) Zope-2.0.1-ZEO-nonbin/lib/python/App/ProductRegistry.py100644 1007 1403 20234 6751664671 22701 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## # Product registry and new product factory model. There will be a new # mechanism for defining actions for meta types. If an action is of # the form: # # manage_addProduct-name-factoryid # # Then the machinery that invokes an add-product form # will return: # ....what? from OFS.Folder import Folder class ProductRegistryMixin: # This class implements a protocol for registering products that # are defined through the web. # This class is a mix-in class for the top-level application object. def _manage_remove_product_meta_type(self, product, id=None, meta_type=None): r=[] pid=product.id for mt in self._getProductRegistryMetaTypes(): if mt.has_key('product'): if mt['product']==pid and ( meta_type is None or meta_type==mt['name']): continue elif meta_type==mt['name']: continue r.append(mt) self._setProductRegistryMetaTypes(tuple(r)) def _constructor_prefix_string(self, pid): return 'manage_addProduct/%s/' % pid def _manage_add_product_meta_type(self, product, id, meta_type, permission=''): pid=product.id meta_types=self._getProductRegistryMetaTypes() for mt in meta_types: if mt['name']==meta_type: if not mt.has_key('product'): mt['product']=pid if mt['product'] != pid: raise 'Type Exists', ( 'The type %s is already defined.' % meta_type) mt['action']='%s%s' % ( self._constructor_prefix_string(pid), id) if permission: mt['permission']=permission return mt={ 'name': meta_type, 'action': ('%s%s' % ( self._constructor_prefix_string(pid), id)), 'product': pid } if permission: mt['permission']=permission self._setProductRegistryMetaTypes(meta_types+(mt,)) def _manage_remove_product_permission(self, product, permission=None): r=[] r2=[] pid=product.id for d in self._getProductRegistryData('permissions'): if d.has_key('product'): if d['product']==pid and ( permission is None or permission==d['name']): continue elif permission==d['name']: continue r.append(d) r2.append((d['name'], d['methods'], d['default'])) self._setProductRegistryData('permissions', tuple(r)) self._setProductRegistryData('ac_permissions', tuple(r2)) def _manage_add_product_permission( self, product, permission, methods=(), default=('Manager',) ): permissions=self._getProductRegistryData('permissions') for d in permissions: if d['name']==permission: raise 'Type Exists', ( 'The permission %s is already defined.' % permission) d={'name': permission, 'methods': methods, 'permission': permission, 'default': default, 'product': product.id} self._setProductRegistryData('permissions', permissions + (d,)) self._setProductRegistryData( 'ac_permissions', self._getProductRegistryData('ac_permissions') +((d['name'], d['methods'], d['default']),) ) class ProductRegistry(ProductRegistryMixin): # This class implements a protocol for registering products that # are defined through the web. It also provides methods for # getting hold of the Product Registry, Control_Panel.Products. # This class is a mix-in class for the top-level application object. def _getProducts(self): return self.Control_Panel.Products _product_meta_types=() _product_permissions=() _product_ac_permissions=() def _getProductRegistryMetaTypes(self): return self._product_meta_types def _setProductRegistryMetaTypes(self, v): self._product_meta_types=v def _getProductRegistryData(self, name): return getattr(self, '_product_%s' % name) def _setProductRegistryData(self, name, v): name='_product_%s' % name if hasattr(self, name): return setattr(self, name, v) else: raise AttributeError, name Zope-2.0.1-ZEO-nonbin/lib/python/App/Undo.py100644 1007 1403 14400 6756544560 20432 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''short description $Id: Undo.py,v 1.16 1999/08/18 14:55:44 jim Exp $''' __version__='$Revision: 1.16 $'[11:-2] import Globals, ExtensionClass from DateTime import DateTime from string import atof, find, atoi, split, rfind class UndoSupport(ExtensionClass.Base): __ac_permissions__=( ('Undo changes', ( 'manage_undo_transactions', 'undoable_transactions', 'manage_UndoForm', )), ) manage_UndoForm=Globals.HTMLFile( 'undo', globals(), PrincipiaUndoBatchSize=20, first_transaction=0, last_transaction=20) def get_request_var_or_attr(self, name, default): if hasattr(self, 'REQUEST'): REQUEST=self.REQUEST if REQUEST.has_key(name): return REQUEST[name] if hasattr(self, name): v=getattr(self, name) else: v=default REQUEST[name]=v return v else: if hasattr(self, name): v=getattr(self, name) else: v=default return v def undoable_transactions(self, AUTHENTICATION_PATH=None, first_transaction=None, last_transaction=None, PrincipiaUndoBatchSize=None): if AUTHENTICATION_PATH is None: path=self.REQUEST['AUTHENTICATION_PATH'] else: path=AUTHENTICATION_PATH if first_transaction is None: first_transaction=self.get_request_var_or_attr( 'first_transaction', 0) if PrincipiaUndoBatchSize is None: PrincipiaUndoBatchSize=self.get_request_var_or_attr( 'PrincipiaUndoBatchSize', 20) if last_transaction is None: last_transaction=self.get_request_var_or_attr( 'last_transaction', first_transaction+PrincipiaUndoBatchSize) db=self._p_jar.db r=db().undoLog(first_transaction, last_transaction, lambda d, p=path: find(d['user_name'], p)==0 ) for d in r: d['time']=DateTime(d['time']) return r def manage_undo_transactions(self, transaction_info, REQUEST=None): """ """ jar=self._p_jar db=jar.db undo=db().undo for i in transaction_info: undo(i) if REQUEST is None: return REQUEST['RESPONSE'].redirect("%s/manage_main" % REQUEST['URL1']) return '' Globals.default__class_init__(UndoSupport) Zope-2.0.1-ZEO-nonbin/lib/python/App/__init__.py100644 1007 1403 7332 6671334600 21236 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## Zope-2.0.1-ZEO-nonbin/lib/python/App/addFactory.dtml100644 1007 1403 3142 6707215753 22071 0ustar petrillipetrilliAdd an Object Factory

    Add an Object Factory

    A Factory allows you to place entries in the Zope Product add list.

    In the form below the Add list name is the name under which your entry will appear in the Zope Product add list. The Method is the method that will be invoked when a user adds a new object. This must be one of the objects in the product, typically a Document.

    Id
    Title
    Add list name
    Method

    Before you can define a factory, you have to define one or more "methods", such as Document or other objects that do the factory's work. Zope-2.0.1-ZEO-nonbin/lib/python/App/dbMain.dtml100644 1007 1403 2154 6634116355 21202 0ustar petrillipetrilli <!--#var title-->

    The Database Manager allows you to view database status information. It also allows you to perform maintenance tasks such as database packing, cache management, and "undoing" previous changes to your site.

    Database Size
    Database Location

    Click "Pack" to pack the Zope database, removing previous revisions of objects that are older than days.
    Zope-2.0.1-ZEO-nonbin/lib/python/App/addPermission.dtml100644 1007 1403 1424 6745343754 22620 0ustar petrillipetrilliDefine a permission

    Define a permission

    Id
    Title
    Name

    Zope-2.0.1-ZEO-nonbin/lib/python/App/addProduct.dtml100644 1007 1403 1465 6707215753 22110 0ustar petrillipetrilliAdd a product

    Add a Product

    Products allows you to define new types of Zope objects. A Product contains other objects including a Factory which allows you to make your Product objects available via the Product add list.

    Id
    Title

    Zope-2.0.1-ZEO-nonbin/lib/python/App/cacheGC.dtml100644 1007 1403 4120 6761246427 21265 0ustar petrillipetrilli Cache

    Manual Cache Garbage Collection

    Full Sweep
    Make a single pass through the cache, removing any objects that are no longer referenced, and deactivating objects that have not been accessed in the number of seconds given in the input box to the right of this text.

    Minimize
    Make multiple passes through the cache, removing any objects that are no longer referenced, and deactivating objects that have not been accessed in the number of seconds given in the input box to the right of this text.

    Cache Statistics

    Cache Details

    Object ClassCount

    Objects in the cache

    Object ID Object Class Reference Count References
    Zope-2.0.1-ZEO-nonbin/lib/python/App/cacheParameters.dtml100644 1007 1403 3426 6761246427 23107 0ustar petrillipetrilli Cache

    Cache Parameters and Statistics

    Total number of objects in the database
    Number of objects in the cache
    Target size
    Target maximum time between accesses

    Cache Details

    Object ClassCount

    Objects in the cache

    Object ID Object Class Reference Count References
    Zope-2.0.1-ZEO-nonbin/lib/python/App/class_init.py100644 1007 1403 12055 6714043273 21646 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## from AccessControl.PermissionRole import PermissionRole class ApplicationDefaultPermissions: _View_Permission='Manager', 'Anonymous' _Access_contents_information_Permission='Manager', 'Anonymous' def default__class_init__(self): dict=self.__dict__ have=dict.has_key ft=type(default__class_init__) for name, v in dict.items(): if hasattr(v,'_need__name__') and v._need__name__: v.__dict__['__name__']=name if name=='manage' or name[:7]=='manage_': name=name+'__roles__' if not have(name): dict[name]='Manager', elif name=='manage' or name[:7]=='manage_' and type(v) is ft: name=name+'__roles__' if not have(name): dict[name]='Manager', if hasattr(self, '__ac_permissions__'): for acp in self.__ac_permissions__: pname, mnames = acp[:2] pr=PermissionRole(pname) for mname in mnames: try: getattr(self, mname).__roles__=pr except: dict[mname+'__roles__']=pr pname=pr._p if not hasattr(ApplicationDefaultPermissions, pname): if len(acp) > 2: setattr(ApplicationDefaultPermissions, pname, acp[2]) else: setattr(ApplicationDefaultPermissions, pname, ('Manager',)) Zope-2.0.1-ZEO-nonbin/lib/python/App/copyright.dtml100644 1007 1403 21555 6756543102 22045 0ustar petrillipetrilli Copyright

    Zope License | Python License | Zope Credits

    Zope Public License (ZPL) Version 1.0

    Copyright © 1997, 1998, 1999 Digital Creations, All rights reserved.

    This license has been certified as Open Source(tm).

    Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

    1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth.
    4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement:
      "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)."
      In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived.
    5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations.
    6. Modified redistributions of any form whatsoever must retain the following acknowledgment:
      "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement.
    7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above.
    Disclaimer
    THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software is powered by Python!

    Copyright © 1991-1995 by Stichting Mathematisch Centrum, Amsterdam, The Netherlands.

    All Rights Reserved

    Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the names of Stichting Mathematisch Centrum or CWI or Corporation for National Research Initiatives or CNRI not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission.

    While CWI is the initial source for this software, a modified version is made available by the Corporation for National Research Initiatives (CNRI) at the Internet address ftp://ftp.python.org.

    STICHTING MATHEMATISCH CENTRUM AND CNRI DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM OR CNRI BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.

    Zope uses the xmlrpclib module:

    Copyright © 1999 by Secret Labs AB
    Copyright © 1999 by Fredrik Lundh

    By obtaining, using, and/or copying this software and/or its associated documentation, you agree that you have read, understood, and will comply with the following terms and conditions:

    Permission to use, copy, modify, and distribute this software and its associated documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appears in all copies, and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Secret Labs AB or the author not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission.

    SECRET LABS AB AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL SECRET LABS AB OR THE AUTHOR BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.

    Zope uses the C expat library by James Clark, for parsing XML text.

    Copyright (c) 1998, 1999 James Clark. Expat is subject to the Mozilla Public License Version 1.1.

    Zope Credits

    The Zope software receives contributions from far and wide. Here's the Zope Hall of Fame:

    Paul Everitt, paul@digicool.com.

    Zope-2.0.1-ZEO-nonbin/lib/python/App/cpContents.dtml100644 1007 1403 4113 6761025301 22114 0ustar petrillipetrilli Contents

    The Control Panel provides access to system management functions, such as database and product management.

    • Zope version:
    • Python version:
    • System Platform:
    • Process ID: ()
    • Running for:

    Click "Shutdown" to shutdown the Zope process.

    Click "Restart" to restart the Zope process.
    You are currently working in version

    Click to open this item This item has been modified in this version This item has been modified in another version
    Zope-2.0.1-ZEO-nonbin/lib/python/App/debug.dtml100644 1007 1403 3457 6762547316 21114 0ustar petrillipetrilli Debug Information

    Debug Information

    • Zope version:
    • Python version:
    • System Platform:
    • Process ID: ()
    • Running for:
    • Top Refcounts:

      Class Delta
      +
      Update Snapshot | Refresh
    • Connections:
      openedinfoversion
      &dtml-opened;&dtml-info;&dtml-version;

    Zope-2.0.1-ZEO-nonbin/lib/python/App/distributionView.dtml100644 1007 1403 2065 6761246427 23370 0ustar petrillipetrilli Create a Distribution Archive

    Create a Distribution Archive

    Version
    Configurable objects
    Zope-2.0.1-ZEO-nonbin/lib/python/App/editFactory.dtml100644 1007 1403 3212 6761246427 22266 0ustar petrillipetrilliChange a factory
    Id
    Title
    Add list name
    Initial method
    Permission

    The initial method is the method that will be invoked when a user adds a new object. This must be one of the objects in the product, typically a Document. Zope-2.0.1-ZEO-nonbin/lib/python/App/editPermission.dtml100644 1007 1403 1447 6761246427 23017 0ustar petrillipetrilliChange a permission
    Id
    Title
    Name

    Zope-2.0.1-ZEO-nonbin/lib/python/App/manage.dtml100644 1007 1403 1146 6723267033 21237 0ustar petrillipetrilli <!--#var title_or_id--> on <!--#var URL1--> Management interfaces require the use of a <B>frames-capable</B> web browser. Zope-2.0.1-ZEO-nonbin/lib/python/App/manage_tabs.dtml100644 1007 1403 11212 6756073331 22265 0ustar petrillipetrilli
      Zope ">
     href="" href="" target="">   href="" href="" target=""> 


    <!--#var meta_type--> Object at / This item has been modified in this version This item has been modified in another version ()

    You are currently working in version

    Zope-2.0.1-ZEO-nonbin/lib/python/App/menu.dtml100644 1007 1403 2441 6674336261 20757 0ustar petrillipetrilli Navigator
    Click to open this item
    Click to open this item
    © Digital Creations
    Refresh
    Zope-2.0.1-ZEO-nonbin/lib/python/App/profile.dtml100755 1007 1403 3357 6765474010 21461 0ustar petrillipetrilli Profiler Information

    Profile Information

    Sort: Limit:
    Profiling is not currently enabled or there is not yet any profiling data to report. To enable profiling, restart the Zope process with the environment variable PROFILE_PUBLISHER defined. The value of this variable should be the full system path to a file that will be used to dump a profile report when the process restarts or exits. Zope-2.0.1-ZEO-nonbin/lib/python/App/readme.dtml100644 1007 1403 326 6636546521 21230 0ustar petrillipetrilli<!--#var id--> README Zope-2.0.1-ZEO-nonbin/lib/python/App/special_dtml.py100644 1007 1403 11645 6712127664 22167 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import DocumentTemplate, Common, Persistence, MethodObject, Globals, os from Persistence import Persistent class HTML(DocumentTemplate.HTML,Persistence.Persistent,): "Persistent HTML Document Templates" class HTMLFile(DocumentTemplate.HTMLFile,MethodObject.Method,): "Persistent HTML Document Templates read from files" class func_code: pass func_code=func_code() func_code.co_varnames='trueself', 'self', 'REQUEST' func_code.co_argcount=3 _need__name__=1 _v_last_read=0 def __init__(self,name,_prefix=None, **kw): if _prefix is None: _prefix=SOFTWARE_HOME elif type(_prefix) is not type(''): _prefix=Common.package_home(_prefix) args=(self, '%s/%s.dtml' % (_prefix,name)) if not kw.has_key('__name__'): kw['__name__']=name apply(HTMLFile.inheritedAttribute('__init__'),args,kw) def __call__(self, *args, **kw): if Globals.DevelopmentMode: __traceback_info__=self.raw t=os.stat(self.raw) if t != self._v_last_read: self.cook() self._v_last_read=t return apply(HTMLFile.inheritedAttribute('__call__'), (self,)+args[1:],kw) Zope-2.0.1-ZEO-nonbin/lib/python/App/tar.py100644 1007 1403 15447 6671334600 20313 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Simple module for writing tar files $Id: tar.py,v 1.3 1999/03/10 00:14:56 klm Exp $''' __version__='$Revision: 1.3 $'[11:-2] import sys, time, zlib try: from newstruct import pack except: from struct import pack from string import find, join def oct8(i): i=oct(i) return '0'*(6-len(i))+i+' \0' def oct12(i): i=oct(i) return '0'*(11-len(i))+i+' ' def pad(s,l): ls=len(s) if ls >= l: raise ValueError, 'value, %s, too wide for field (%d)' % (s,l) return s+'\0'*(l-ls) class TarEntry: def __init__(self, path, data, mode=0644, uid=0, gid=0, mtime=None, typeflag='0', linkname='', uname='jim', gname='system', prefix=''): "Initialize a Tar archive entry" self.data=data if mtime is None: mtime=int(time.time()) header=join([ pad(path, 100), oct8(mode), oct8(uid), oct8(gid), oct12(len(data)), oct12(mtime), ' ' * 8, typeflag, pad(linkname, 100), 'ustar\0', '00', pad(uname, 32), pad(gname, 32), '000000 \0', '000000 \0', pad(prefix, 155), '\0'*12, ], '') if len(header) != 512: raise 'Bad Header Length', len(header) header=(header[:148]+ oct8(reduce(lambda a,b: a+b, map(ord,header)))+ header[156:]) self.header=header def __str__(self): data=self.data l=len(data) if l%512: data=data+'\0'*(512-l%512) return self.header+data def tar(entries): r=[] ra=r.append for name, data in entries: ra(str(TarEntry(name,data))) ra('\0'*1024) return join(r,'') def tgz(entries): c=zlib.compressobj() compress=c.compress r=[] ra=r.append for name, data in entries: ra(compress(str(TarEntry(name,data)))) ra(compress('\0'*1024)) ra(c.flush()) return join(r,'') class tgzarchive: def __init__(self, name, time=None): self._f=gzFile('%s.tar' % name, time) def add(self, name, data): self._f.write(str(TarEntry(name,data))) def finish(self): self._f.write('\0'*1024) def __str__(self): return self._f.getdata() class gzFile: _l=0 _crc=zlib.crc32("") def __init__(self, name, t=None): self._c=zlib.compressobj(9, zlib.DEFLATED, -zlib.MAX_WBITS, zlib.DEF_MEM_LEVEL, 0) if t is None: t=time.time() self._r=['\037\213\010\010', pack("<!--#var id--> Import Traceback

    Import Traceback
    Zope-2.0.1-ZEO-nonbin/lib/python/App/undo.dtml100644 1007 1403 4576 6761246427 20774 0ustar petrillipetrilli Undo Changes

    This application's transactional feature allows you to easily undo changes made to the application's settings or data. You can revert the application to a "snapshot" of it's state at a previous point in time.

    Select one or more transactions below and then click on the "Undo" button to undo the transactions. Note that even though a transaction is shown below, you will not be able to undo it if later transactions modified objects that were modified by the transaction.
    &last_transaction:int=&PrincipiaUndoBatchSize:int="> Later Transactions
    by Zope on at
    &PrincipiaUndoBatchSize:int="> Earlier Transactions

    There are no transactions that can be undone. Zope-2.0.1-ZEO-nonbin/lib/python/App/versionManager.dtml100644 1007 1403 2165 6761246427 22777 0ustar petrillipetrilli Manage Versions

    Select one or more versions below and then click on the "Save" button to save the versions or click on the "Discard" button to discard changes made in the versions.
    There are no non-empty versions. Zope-2.0.1-ZEO-nonbin/lib/python/App/version_txt.py100644 1007 1403 7622 6754365765 22107 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import os def version_txt(): try: return open(os.path.join(SOFTWARE_HOME,'version.txt')).read() except: return '(unreleased version)' return self._v_version_txt Zope-2.0.1-ZEO-nonbin/lib/python/DateTime/ 40755 1007 1403 0 6772126757 20015 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/DateTime/DateTime.html100644 1007 1403 51662 6637730231 22512 0ustar petrillipetrilli Module DateTime

    DateTime

    Encapsulation of date/time values

    Module Functions

    Timezones()

    Return the list of recognized timezone names

    Class DateTime

    DateTime objects represent instants in time and provide interfaces for controlling its representation without affecting the absolute value of the object.

    DateTime objects may be created from a wide variety of string or numeric data, or may be computed from other DateTime objects. DateTimes support the ability to convert their representations to many major timezones, as well as the ablility to create a DateTime object in the context of a given timezone.

    DateTime objects provide partial numerical behavior:

    • Two date-time objects can be subtracted to obtain a time, in days between the two.

    • A date-time object and a positive or negative number may be added to obtain a new date-time object that is the given number of days later than the input date-time object.

    • A positive or negative number and a date-time object may be added to obtain a new date-time object that is the given number of days later than the input date-time object.

    • A positive or negative number may be subtracted from a date-time object to obtain a new date-time object that is the given number of days earlier than the input date-time object.

    DateTime objects may be converted to integer, long, or float numbers of days since January 1, 1901, using the standard int, long, and float functions (Compatibility Note: int, long and float return the number of days since 1901 in GMT rather than local machine timezone). DateTime objects also provide access to their value in a float format usable with the python time module, provided that the value of the object falls in the range of the epoch-based time module.

    A DateTime object should be considered immutable; all conversion and numeric operations return a new DateTime object rather than modify the current object.

    Constructor For DateTime

    DateTime()

    Return a new date-time object

    A DateTime object always maintains its value as an absolute UTC time, and is represented in the context of some timezone based on the arguments used to create the object. A DateTime object's methods return values based on the timezone context.

    Note that in all cases the local machine timezone is used for representation if no timezone is specified.

    DateTimes may be created with from zero to seven arguments.

    • If the function is called with no arguments, then the current date/time is returned, represented in the timezone of the local machine.

    • If the function is invoked with a single string argument which is a recognized timezone name, an object representing the current time is returned, represented in the specified timezone.

    • If the function is invoked with a single string argument representing a valid date/time, an object representing that date/time will be returned.

      As a general rule, any date-time representation that is recognized and unambigous to a resident of North America is acceptable.(The reason for this qualification is that in North America, a date like: 2/1/1994 is interpreted as February 1, 1994, while in some parts of the world, it is interpreted as January 2, 1994.) A date/time string consists of two components, a date component and an optional time component, separated by one or more spaces. If the time component is omited, 12:00am is assumed. Any recognized timezone name specified as the final element of the date/time string will be used for computing the date/time value. (If you create a DateTime with the string Mar 9, 1997 1:45pm US/Pacific, the value will essentially be the same as if you had captured time.time() at the specified date and time on a machine in that timezone) 

      


                  e=DateTime(US/Eastern)
            # returns current date/time, represented in US/Eastern.
      


                  x=DateTime(1997/3/9 1:45pm)
            # returns specified time, represented in local machine zone.
      


                  y=DateTime(Mar 9, 1997 13:45:00)
            # y is equal to x

      The date component consists of year, month, and day values. The year value must be a one-, two-, or four-digit integer. If a one- or two-digit year is used, the year is assumed to be in the twentieth century. The month may an integer, from 1 to 12, a month name, or a month abreviation, where a period may optionally follow the abreviation. The day must be an integer from 1 to the number of days in the month. The year, month, and day values may be separated by periods, hyphens, forward, shashes, or spaces. Extra spaces are permitted around the delimiters. Year, month, and day values may be given in any order as long as it is possible to distinguish the components. If all three components are numbers that are less than 13, then a a month-day-year ordering is assumed.

      The time component consists of hour, minute, and second values separated by colons. The hour value must be an integer between 0 and 23 inclusively. The minute value must be an integer between 0 and 59 inclusively. The second value may be an integer value between 0 and 59.999 inclusively. The second value or both the minute and second values may be ommitted. The time may be followed by am or pm in upper or lower case, in which case a 12-hour clock is assumed.

    • If the DateTime function is invoked with a single Numeric argument, the number is assumed to be either a floating point value such as that returned by time.time() , or a number of days after January 1, 1901 00:00:00 UTC.

      A DateTime object is returned that represents either the gmt value of the time.time() float represented in the local machine's timezone, or that number of days after January 1, 1901. Note that the number of days after 1901 need to be expressed from the viewpoint of the local machine's timezone. A negative argument will yield a date-time value before 1901.

    • If the function is invoked with two numeric arguments, then the first is taken to be an integer year and the second argument is taken to be an offset in days from the beginning of the year, in the context of the local machine timezone. The date-time value returned is the given offset number of days from the beginning of the given year, represented in the timezone of the local machine. The offset may be positive or negative. Two-digit years are assumed to be in the twentieth century.

    • If the function is invoked with two arguments, the first a float representing a number of seconds past the epoch in gmt (such as those returned by time.time()) and the second a string naming a recognized timezone, a DateTime with a value of that gmt time will be returned, represented in the given timezone. 

                  import time
            t=time.time()
      

                  now_east=DateTime(t,'US/Eastern')
            # Time t represented as US/Eastern
      


                  now_west=DateTime(t,'US/Pacific')
            # Time t represented as US/Pacific
      


                  # now_east == now_west
            # only their representations are different

    • If the function is invoked with three or more numeric arguments, then the first is taken to be an integer year, the second is taken to be an integer month, and the third is taken to be an integer day. If the combination of values is not valid, then a DateTimeError is raised. Two-digit years are assumed to be in the twentieth century. The fourth, fifth, and sixth arguments are floating point, positive or negative offsets in units of hours, minutes, and days, and default to zero if not given. An optional string may be given as the final argument to indicate timezone (the effect of this is as if you had taken the value of time.time() at that time on a machine in the specified timezone).

    If a string argument passed to the DateTime constructor cannot be parsed, it will raise DateTime.SyntaxError. Invalid date, time, or timezone components will raise a DateTime.DateTimeError.

    The module function Timezones() will return a list of the timezones recognized by the DateTime module. Recognition of timezone names is case-insensitive.

    Instance Methods For DateTime

    aMonth()

    Return the abreviated month name.

    pCommon()

    Return a string representing the object's value in the format: Mar. 1, 1997 1:45 pm

    minute()

    Return the minute

    isLeapYear()

    Return true if the current year (in the context of the object's timezone) is a leap year

    pMonth()

    Return the abreviated (with period) month name.

    DayOfWeek()

    Compatibility: see Day

    Day_()

    Compatibility: see pDay

    isCurrentDay()

    Return true if this object represents a date/time that falls within the current day, in the context of this object's timezone representation

    Mon()

    Compatibility: see aMonth

    hour()

    Return the 24-hour clock representation of the hour

    Date()

    Return the date string for the object.

    aCommonZ()

    Return a string representing the object's value in the format: Mar 1, 1997 1:45 pm US/Eastern

    fCommonZ()

    Return a string representing the object's value in the format: March 1, 1997 1:45 pm US/Eastern

    isCurrentYear()

    Return true if this object represents a date/time that falls within the current year, in the context of this object's timezone representation

    AMPMMinutes()

    Return the time string for an object not showing seconds.

    dd()

    Return day as a 2 digit string

    TimeMinutes()

    Return the time string for an object not showing seconds.

    h_24()

    Return the 24-hour clock representation of the hour

    isPast()

    Return true if this object represents a date/time earlier than the time of the call

    dow()

    Return the integer day of the week, where sunday is 0

    isFuture()

    Return true if this object represents a date/time later than the time of the call

    pCommonZ()

    Return a string representing the object's value in the format: Mar. 1, 1997 1:45 pm US/Eastern

    timezone()

    Return the timezone in which the object is represented.

    h_12()

    Return the 12-hour clock representation of the hour

    PreciseTime()

    Return the time string for the object.

    isCurrentMinute()

    Return true if this object represents a date/time that falls within the current minute, in the context of this object's timezone representation

    rfc822()

    Return the date in RFC 822 format

    equalTo(t)

    Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time equal to the specified DateTime or time module style time.

    yy()

    Return calendar year as a 2 digit string

    mm()

    Return month as a 2 digit string

    Mon_()

    Compatibility: see pMonth

    toZone(z)

    Return a DateTime with the value as the current object, represented in the indicated timezone.

    earliestTime()

    Return a new DateTime object that represents the earliest possible time (in whole seconds) that still falls within the current object's day, in the object's timezone context

    aDay()

    Return the abreviated name of the day of the week

    dayOfYear()

    Return the day of the year, in context of the timezone representation of the object

    latestTime()

    Return a new DateTime object that represents the latest possible time (in whole seconds) that still falls within the current object's day, in the object's timezone context

    notEqualTo(t)

    Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time not equal to the specified DateTime or time module style time.

    PreciseAMPM()

    Return the time string for the object.

    day()

    Return the integer day

    timeTime()

    Return the date/time as a floating-point number in UTC, in the format used by the python time module. Note that it is possible to create date/time values with DateTime that have no meaningful value to the time module, and in such cases a DateTimeError is raised. A DateTime object's value must generally be between Jan 1, 1970 (or your local machine epoch) and Jan 2038 to produce a valid time.time() style value.

    ampm()

    Return the appropriate time modifier (am or pm)

    greaterThan(t)

    Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time greater than the specified DateTime or time module style time.

    month()

    Return the month of the object as an integer

    AMPM()

    Return the time string for an object to the nearest second.

    second()

    Return the second

    parts()

    Return a tuple containing the calendar year, month, day, hour, minute second and timezone of the object

    greaterThanEqualTo(t)

    Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time greater than or equal to the specified DateTime or time module style time.

    lessThanEqualTo(t)

    Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time less than or equal to the specified DateTime or time module style time.

    isCurrentHour()

    Return true if this object represents a date/time that falls within the current hour, in the context of this object's timezone representation

    aCommon()

    Return a string representing the object's value in the format: Mar 1, 1997 1:45 pm

    dow_1()

    Return the integer day of the week, where sunday is 1

    Day()

    Return the full name of the day of the week

    fCommon()

    Return a string representing the object's value in the format: March 1, 1997 1:45 pm

    Month()

    Return the full month name

    isCurrentMonth()

    Return true if this object represents a date/time that falls within the current month, in the context of this object's timezone representation

    year()

    Return the calendar year of the object

    lessThan(t)

    Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time less than the specified DateTime or time module style time.

    Time()

    Return the time string for an object to the nearest second.

    pDay()

    Return the abreviated (with period) name of the day of the week

    General Services Provided by DateTime

    `aDateTime`

    Convert a DateTime to a string that looks like a Python expression.

    str(aDateTime)

    Convert a DateTime to a string.

    cmp(aDateTime, other)

    Compare a DateTime with another DateTime object, or a float such as those returned by time.time().

    NOTE: __cmp__ support is provided for backward compatibility only, and mixing DateTimes with ExtensionClasses could cause __cmp__ to break. You should use the methods lessThan, greaterThan, lessThanEqualTo, greaterThanEqualTo, equalTo and notEqualTo to avoid potential problems later!!

    hash(aDateTime)

    Compute a hash value for a DateTime

    Numeric Services Provided by DateTime

    aDateTime + other

    A DateTime may be added to a number and a number may be added to a DateTime; two DateTimes cannot be added.

    aDateTime - other

    Either a DateTime or a number may be subtracted from a DateTime, however, a DateTime may not be subtracted from a number.

    other + aDateTimeAdd aDateTime to other.

    A DateTime may be added to a number and a number may be added to a DateTime; two DateTimes cannot be added.

    int(aDateTime)

    Convert to an integer number of days since Jan. 1, 1901 (gmt)

    long(aDateTime)

    Convert to a long-int number of days since Jan. 1, 1901 (gmt)

    float(aDateTime)

    Convert to floating-point number of days since Jan. 1, 1901 (gmt)

    Last Modified: 14 March 1997 Zope-2.0.1-ZEO-nonbin/lib/python/DateTime/DateTime.py100644 1007 1403 152477 6751650300 22217 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Encapsulation of date/time values""" __version__='$Revision: 1.40 $'[11:-2] import sys, os, math, regex, ts_regex, DateTimeZone from string import strip,split,upper,lower,atoi,atof,find,join from time import time, gmtime, localtime, asctime from time import timezone, strftime, mktime from types import InstanceType,IntType,FloatType,StringType try: from time import tzname except: tzname=('UNKNOWN','UNKNOWN') # Determine machine epoch tm=((0, 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334), (0, 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335)) yr,mo,dy,hr,mn,sc=gmtime(0)[:6] i=int(yr-1) to_year =int(i*365+i/4-i/100+i/400-693960.0) to_month=tm[yr%4==0 and (yr%100!=0 or yr%400==0)][mo] EPOCH =(to_year+to_month+dy+(hr/24.0+mn/1440.0+sc/86400.0))*86400 CENTURY=1900 jd1901 =2415385L numericTimeZoneMatch=regex.compile('[+-][\0-\9][\0-\9][\0-\9][\0-\9]').match #TS class _timezone: def __init__(self,data): self.name,self.timect,self.typect, \ self.ttrans,self.tindex,self.tinfo,self.az=data def default_index(self): if self.timect == 0: return 0 for i in range(self.typect): if self.tinfo[i][1] == 0: return i return 0 def index(self,t=None): t=t or time() if self.timect==0: idx=(0, 0, 0) elif t < self.ttrans[0]: i=self.default_index() idx=(i, ord(self.tindex[0]),i) elif t >= self.ttrans[-1]: if self.timect > 1: idx=(ord(self.tindex[-1]),ord(self.tindex[-1]), ord(self.tindex[-2])) else: idx=(ord(self.tindex[-1]),ord(self.tindex[-1]), self.default_index()) else: for i in range(self.timect-1): if t < self.ttrans[i+1]: if i==0: idx=(ord(self.tindex[0]),ord(self.tindex[1]), self.default_index()) else: idx=(ord(self.tindex[i]),ord(self.tindex[i+1]), ord(self.tindex[i-1])) break return idx def info(self,t=None): idx=self.index(t)[0] zs =self.az[self.tinfo[idx][2]:] return self.tinfo[idx][0],self.tinfo[idx][1],zs[:find(zs,'\000')] class _cache: _zlst=['Brazil/Acre','Brazil/DeNoronha','Brazil/East', 'Brazil/West','Canada/Atlantic','Canada/Central', 'Canada/Eastern','Canada/East-Saskatchewan', 'Canada/Mountain','Canada/Newfoundland', 'Canada/Pacific','Canada/Yukon', 'Chile/Continental','Chile/EasterIsland','CST','Cuba', 'Egypt','EST','GB-Eire','Greenwich','Hongkong','Iceland', 'Iran','Israel','Jamaica','Japan','Mexico/BajaNorte', 'Mexico/BajaSur','Mexico/General','MST','Poland','PST', 'Singapore','Turkey','Universal','US/Alaska','US/Aleutian', 'US/Arizona','US/Central','US/Eastern','US/East-Indiana', 'US/Hawaii','US/Indiana-Starke','US/Michigan', 'US/Mountain','US/Pacific','US/Samoa','UTC','UCT','GMT', 'GMT+0100','GMT+0200','GMT+0300','GMT+0400','GMT+0500', 'GMT+0600','GMT+0700','GMT+0800','GMT+0900','GMT+1000', 'GMT+1100','GMT+1200','GMT+1300','GMT-0100','GMT-0200', 'GMT-0300','GMT-0400','GMT-0500','GMT-0600','GMT-0700', 'GMT-0800','GMT-0900','GMT-1000','GMT-1100','GMT-1200', 'GMT+1', 'UT','BST','CDT','MEST','SST','FST','WADT','EADT','NZDT', 'WET','WAT','AT','AST','NT','IDLW','CET','MET', 'MEWT','SWT','FWT','EET','BT','ZP4','ZP5','ZP6', 'WAST','CCT','JST','EAST','GST','NZT','NZST','IDLE'] _zmap={'aest':'GMT+1000', 'aedt':'GMT+1100', 'aus eastern standard time':'GMT+1000', 'sydney standard time':'GMT+1000', 'tasmania standard time':'GMT+1000', 'e. australia standard time':'GMT+1000', 'aus central standard time':'GMT+0930', 'cen. australia standard time':'GMT+0930', 'w. australia standard time':'GMT+0800', 'brazil/acre':'Brazil/Acre', 'brazil/denoronha':'Brazil/Denoronha', 'brazil/east':'Brazil/East','brazil/west':'Brazil/West', 'canada/atlantic':'Canada/Atlantic', 'canada/central':'Canada/Central', 'canada/eastern':'Canada/Eastern', 'canada/east-saskatchewan':'Canada/East-Saskatchewan', 'canada/mountain':'Canada/Mountain', 'canada/newfoundland':'Canada/Newfoundland', 'canada/pacific':'Canada/Pacific','canada/yukon':'Canada/Yukon', 'central europe standard time':'GMT+0100', 'chile/continental':'Chile/Continental', 'chile/easterisland':'Chile/EasterIsland', 'cst':'Us/Central','cuba':'Cuba','est':'US/Eastern','egypt':'Egypt', 'eastern standard time':'US/Eastern', 'us eastern standard time':'US/Eastern', 'central standard time':'US/Central', 'mountain standard time':'US/Mountain', 'pacific standard time':'US/Pacific', 'gb-eire':'GB-Eire','gmt':'GMT', 'gmt+0000':'GMT+0', 'gmt+0':'GMT+0', 'gmt+0930':'GMT+0930', 'gmt+0100':'GMT+1', 'gmt+0200':'GMT+2', 'gmt+0300':'GMT+3', 'gmt+0400':'GMT+4', 'gmt+0500':'GMT+5', 'gmt+0600':'GMT+6', 'gmt+0700':'GMT+7', 'gmt+0800':'GMT+8', 'gmt+0900':'GMT+9', 'gmt+1000':'GMT+10','gmt+1100':'GMT+11','gmt+1200':'GMT+12', 'gmt+1300':'GMT+13', 'gmt-0100':'GMT-1', 'gmt-0200':'GMT-2', 'gmt-0300':'GMT-3', 'gmt-0400':'GMT-4', 'gmt-0500':'GMT-5', 'gmt-0600':'GMT-6', 'gmt-0700':'GMT-7', 'gmt-0800':'GMT-8', 'gmt-0900':'GMT-9', 'gmt-1000':'GMT-10','gmt-1100':'GMT-11','gmt-1200':'GMT-12', 'gmt+1': 'GMT+1', 'gmt+2': 'GMT+2', 'gmt+3': 'GMT+3', 'gmt+4': 'GMT+4', 'gmt+5': 'GMT+5', 'gmt+6': 'GMT+6', 'gmt+7': 'GMT+7', 'gmt+8': 'GMT+8', 'gmt+9': 'GMT+9', 'gmt+10':'GMT+10','gmt+11':'GMT+11','gmt+12':'GMT+12', 'gmt+13':'GMT+13', 'gmt-1': 'GMT-1', 'gmt-2': 'GMT-2', 'gmt-3': 'GMT-3', 'gmt-4': 'GMT-4', 'gmt-5': 'GMT-5', 'gmt-6': 'GMT-6', 'gmt-7': 'GMT-7', 'gmt-8': 'GMT-8', 'gmt-9': 'GMT-9', 'gmt-10':'GMT-10','gmt-11':'GMT-11','gmt-12':'GMT-12', 'greenwich':'Greenwich','hongkong':'Hongkong', 'iceland':'Iceland','iran':'Iran','israel':'Israel', 'jamaica':'Jamaica','japan':'Japan', 'mexico/bajanorte':'Mexico/BajaNorte', 'mexico/bajasur':'Mexico/BajaSur','mexico/general':'Mexico/General', 'mst':'US/Mountain','pst':'US/Pacific','poland':'Poland', 'singapore':'Singapore','turkey':'Turkey','universal':'Universal', 'utc':'Universal','uct':'Universal','us/alaska':'US/Alaska', 'us/aleutian':'US/Aleutian','us/arizona':'US/Arizona', 'us/central':'US/Central','us/eastern':'US/Eastern', 'us/east-indiana':'US/East-Indiana','us/hawaii':'US/Hawaii', 'us/indiana-starke':'US/Indiana-Starke','us/michigan':'US/Michigan', 'us/mountain':'US/Mountain','us/pacific':'US/Pacific', 'us/samoa':'US/Samoa', 'ut':'Universal', 'bst':'GMT+1', 'cdt':'GMT+2', 'mest':'GMT+2', 'sst':'GMT+2', 'fst':'GMT+2', 'wadt':'GMT+8', 'eadt':'GMT+11', 'nzdt':'GMT+13', 'wet':'GMT', 'wat':'GMT-1', 'at':'GMT-2', 'ast':'GMT-4', 'nt':'GMT-11', 'idlw':'GMT-12', 'cet':'GMT+1', 'met':'GMT+1', 'mewt':'GMT+1', 'swt':'GMT+1', 'fwt':'GMT+1', 'eet':'GMT+2', 'bt':'GMT+3', 'zp4':'GMT+4', 'zp5':'GMT+5', 'zp6':'GMT+6', 'wast':'GMT+7', 'cct':'GMT+8', 'jst':'GMT+9', 'east':'GMT+10', 'gst':'GMT+10', 'nzt':'GMT+12', 'nzst':'GMT+12', 'idle':'GMT+12', 'ret':'GMT+4' } def __init__(self): self._db=DateTimeZone._data self._d,self._zidx={},self._zmap.keys() def __getitem__(self,k): try: n=self._zmap[lower(k)] except KeyError: if numericTimeZoneMatch(k) <= 0: raise 'DateTimeError','Unrecognized timezone: %s' % k return k try: return self._d[n] except KeyError: z=self._d[n]=_timezone(self._db[n]) return z class DateTime: """DateTime objects represent instants in time and provide interfaces for controlling its representation without affecting the absolute value of the object. DateTime objects may be created from a wide variety of string or numeric data, or may be computed from other DateTime objects. DateTimes support the ability to convert their representations to many major timezones, as well as the ablility to create a DateTime object in the context of a given timezone. DateTime objects provide partial numerical behavior: - Two date-time objects can be subtracted to obtain a time, in days between the two. - A date-time object and a positive or negative number may be added to obtain a new date-time object that is the given number of days later than the input date-time object. - A positive or negative number and a date-time object may be added to obtain a new date-time object that is the given number of days later than the input date-time object. - A positive or negative number may be subtracted from a date-time object to obtain a new date-time object that is the given number of days earlier than the input date-time object. DateTime objects may be converted to integer, long, or float numbers of days since January 1, 1901, using the standard int, long, and float functions (Compatibility Note: int, long and float return the number of days since 1901 in GMT rather than local machine timezone). DateTime objects also provide access to their value in a float format usable with the python time module, provided that the value of the object falls in the range of the epoch-based time module. A DateTime object should be considered immutable; all conversion and numeric operations return a new DateTime object rather than modify the current object.""" def __init__(self,*args): """Return a new date-time object A DateTime object always maintains its value as an absolute UTC time, and is represented in the context of some timezone based on the arguments used to create the object. A DateTime object's methods return values based on the timezone context. Note that in all cases the local machine timezone is used for representation if no timezone is specified. DateTimes may be created with from zero to seven arguments. - If the function is called with no arguments, then the current date/time is returned, represented in the timezone of the local machine. - If the function is invoked with a single string argument which is a recognized timezone name, an object representing the current time is returned, represented in the specified timezone. - If the function is invoked with a single string argument representing a valid date/time, an object representing that date/time will be returned. As a general rule, any date-time representation that is recognized and unambigous to a resident of North America is acceptable.(The reason for this qualification is that in North America, a date like: 2/1/1994 is interpreted as February 1, 1994, while in some parts of the world, it is interpreted as January 2, 1994.) A date/time string consists of two components, a date component and an optional time component, separated by one or more spaces. If the time component is omited, 12:00am is assumed. Any recognized timezone name specified as the final element of the date/time string will be used for computing the date/time value. (If you create a DateTime with the string 'Mar 9, 1997 1:45pm US/Pacific', the value will essentially be the same as if you had captured time.time() at the specified date and time on a machine in that timezone) 
    
            e=DateTime('US/Eastern')
            # returns current date/time, represented in US/Eastern.

            x=DateTime('1997/3/9 1:45pm')
            # returns specified time, represented in local machine zone.

            y=DateTime('Mar 9, 1997 13:45:00')
            # y is equal to x
    The date component consists of year, month, and day values. The year value must be a one-, two-, or four-digit integer. If a one- or two-digit year is used, the year is assumed to be in the twentieth century. The month may an integer, from 1 to 12, a month name, or a month abreviation, where a period may optionally follow the abreviation. The day must be an integer from 1 to the number of days in the month. The year, month, and day values may be separated by periods, hyphens, forward, shashes, or spaces. Extra spaces are permitted around the delimiters. Year, month, and day values may be given in any order as long as it is possible to distinguish the components. If all three components are numbers that are less than 13, then a a month-day-year ordering is assumed. The time component consists of hour, minute, and second values separated by colons. The hour value must be an integer between 0 and 23 inclusively. The minute value must be an integer between 0 and 59 inclusively. The second value may be an integer value between 0 and 59.999 inclusively. The second value or both the minute and second values may be ommitted. The time may be followed by am or pm in upper or lower case, in which case a 12-hour clock is assumed. - If the DateTime function is invoked with a single Numeric argument, the number is assumed to be a floating point value such as that returned by time.time(). A DateTime object is returned that represents the gmt value of the time.time() float represented in the local machine's timezone. - If the function is invoked with two numeric arguments, then the first is taken to be an integer year and the second argument is taken to be an offset in days from the beginning of the year, in the context of the local machine timezone. The date-time value returned is the given offset number of days from the beginning of the given year, represented in the timezone of the local machine. The offset may be positive or negative. Two-digit years are assumed to be in the twentieth century. - If the function is invoked with two arguments, the first a float representing a number of seconds past the epoch in gmt (such as those returned by time.time()) and the second a string naming a recognized timezone, a DateTime with a value of that gmt time will be returned, represented in the given timezone. 
                import time
            t=time.time()

            now_east=DateTime(t,'US/Eastern')
            # Time t represented as US/Eastern

            now_west=DateTime(t,'US/Pacific')
            # Time t represented as US/Pacific

            # now_east == now_west
            # only their representations are different
    - If the function is invoked with three or more numeric arguments, then the first is taken to be an integer year, the second is taken to be an integer month, and the third is taken to be an integer day. If the combination of values is not valid, then a DateTimeError is raised. Two-digit years are assumed to be in the twentieth century. The fourth, fifth, and sixth arguments are floating point, positive or negative offsets in units of hours, minutes, and days, and default to zero if not given. An optional string may be given as the final argument to indicate timezone (the effect of this is as if you had taken the value of time.time() at that time on a machine in the specified timezone). If a string argument passed to the DateTime constructor cannot be parsed, it will raise DateTime.SyntaxError. Invalid date, time, or timezone components will raise a DateTime.DateTimeError. The module function Timezones() will return a list of the timezones recognized by the DateTime module. Recognition of timezone names is case-insensitive.""" #' d=t=s=None ac=len(args) if ac and args[0]==None: return elif ac==10: # Internal format called only by DateTime yr,mo,dy,hr,mn,sc,tz,t,d,s=args elif not args: # Current time, exp in local timezone t,tz=time(),self._localzone ms=(t-int(t)) yr,mo,dy,hr,mn,sc=gmtime(int(t))[:6] s=(hr/24.0+mn/1440.0+(sc+ms)/86400.0) d=(self._julianday(yr,mo,dy)-jd1901)+s yr,mo,dy,hr,mn,sc=localtime(t)[:6] sc=sc+ms elif ac==1: arg=args[0] if arg=='': raise self.SyntaxError, arg if type(arg)==StringType and lower(arg) in self._tzinfo._zidx: # Current time, exp in specified timezone t,tz=time(),self._tzinfo._zmap[lower(arg)] ms=(t-int(t)) yr,mo,dy,hr,mn,sc=gmtime(t)[:6] s=(hr/24.0+mn/1440.0+(sc+ms)/86400.0) d=(self._julianday(yr,mo,dy)-jd1901)+s x=d+(self._tzinfo[tz].info(t)[0]/86400.0) yr,mo,dy=self._calendarday(x+jd1901) x=(x-int(x))*86400.0 hr=int(x/3600) x=x-(hr*3600) mn=int(x/60) sc=x-(mn*60) elif type(arg)==StringType: # Date/time string yr,mo,dy,hr,mn,sc,tz=self._parse(arg) try: tz=self._tzinfo._zmap[lower(tz)] except KeyError: if numericTimeZoneMatch(tz) <= 0: raise self.DateTimeError, 'Invalid date: %s' % arg if not self._validDate(yr,mo,dy): raise self.DateTimeError, 'Invalid date: %s' % arg if not self._validTime(hr,mn,int(sc)): raise self.DateTimeError, 'Invalid time: %s' % arg s=(hr/24.0+mn/1440.0+sc/86400.0) d=(self._julianday(yr,mo,dy)-jd1901)+s t=(d*86400.0)-EPOCH+86400.0 try: a=self._tzinfo[tz].info(t)[0] except: if numericTimeZoneMatch(tz) > 0: a=atoi(tz[1:3])*3600+atoi(tz[3:5])*60 d,t=d-(a/86400.0),t-a else: # Seconds from epoch, gmt t,tz=arg,self._localzone ms=(t-int(t)) yr,mo,dy,hr,mn,sc=gmtime(int(t))[:6] s=(hr/24.0+mn/1440.0+(sc+ms)/86400.0) d=(self._julianday(yr,mo,dy)-jd1901)+s yr,mo,dy,hr,mn,sc=localtime(t)[:6] sc=sc+ms elif ac==2: if type(args[1])==StringType: # Seconds from epoch (gmt) and timezone t,tz=args ms=(t-int(t)) tz=self._tzinfo._zmap[lower(tz)] yr,mo,dy,hr,mn,sc=gmtime(t)[:6] s=(hr/24.0+mn/1440.0+(sc+ms)/86400.0) d=(self._julianday(yr,mo,dy)-jd1901)+s x=d+(self._tzinfo[tz].info(t)[0]/86400.0) yr,mo,dy=self._calendarday(x+jd1901) x=(x-int(x))*86400.0 hr=int(x/3600) x=x-(hr*3600) mn=int(x/60) sc=x-(mn*60) if(hr==23 and mn==59 and sc>59.999): # Fix formatting for positives hr,mn,sc=0,0,0.0 else: # Fix formatting for negatives if hr<0: hr=23+hr if mn<0: mn=59+mn if sc<0: if (sc-int(sc)>=0.999): sc=round(sc) sc=59+sc else: # Year, julean expressed in local zone tz=self._localzone yr,jul=args if not yr>100: yr=yr+CENTURY d=(self._julianday(yr,1,0)-jd1901)+jul yr,mo,dy=self._calendarday(d+jd1901) x=(d-int(d))*86400.0 hr=int(x/3600) x=x-(hr*3600) mn=int(x/60) sc=x-(mn*60) if(hr==23 and mn==59 and sc>59.999): # Fix formatting for positives hr,mn,sc=0,0,0.0 else: # Fix formatting for negatives if hr<0: hr=23+hr if mn<0: mn=59+mn if sc<0: if (sc-int(sc)>=0.999): sc=round(sc) sc=59+sc d=d-(self._tzinfo[tz].info(t)[0]/86400.0) s=d-int(d) t=(d*86400.0)-EPOCH else: # Explicit format yr,mo,dy=args[:3] hr,mn,sc,tz=0,0,0,0 yr=(yr>100) and yr or yr+CENTURY if not self._validDate(yr,mo,dy): raise self.DateTimeError, 'Invalid date: %s' % (args,) args=args[3:] if args: hr,args=args[0],args[1:] if args: mn,args=args[0],args[1:] if args: sc,args=args[0],args[1:] if args: tz,args=args[0],args[1:] if args: raise self.DateTimeError,'Too many arguments' if not self._validTime(hr,mn,sc): raise self.DateTimeError, 'Invalid time: %s' % `args` if not tz: tz=self._localzone else: tz=self._tzinfo._zmap[lower(tz)] leap=yr%4==0 and (yr%100!=0 or yr%400==0) s=(hr/24.0+mn/1440.0+sc/86400.0) d=(self._julianday(yr,mo,dy)-jd1901)+s t=(d*86400.0)-EPOCH+86400.0 a=self._tzinfo[tz].info(t)[0] d,t=d-(a/86400.0),t-a if hr>12: self._pmhour=hr-12 self._pm='pm' else: self._pmhour=hr or 12 self._pm= (hr==12) and 'pm' or 'am' self._dayoffset=dx=int((self._julianday(yr,mo,dy)+2L)%7) self._fmon,self._amon,self._pmon= \ self._months[mo],self._months_a[mo],self._months_p[mo] self._fday,self._aday,self._pday= \ self._days[dx],self._days_a[dx],self._days_p[dx] self._nearsec=math.floor(sc) self._year,self._month,self._day =yr,mo,dy self._hour,self._minute,self._second =hr,mn,sc self.time,self._d,self._t,self._tz =s,d,t,tz DateTimeError='DateTimeError' SyntaxError ='Invalid Date-Time String' DateError ='Invalid Date Components' int_pattern =ts_regex.compile('\([0-9]+\)') #TS flt_pattern =ts_regex.compile(':\([0-9]+\.[0-9]+\)') #TS name_pattern =ts_regex.compile('\([a-z][a-z]+\)', ts_regex.casefold) #TS space_chars =' \t\n' delimiters ='-/.:,' _month_len =((0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31), (0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31)) _until_month=((0, 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334), (0, 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335)) _months =['','January','February','March','April','May','June','July', 'August', 'September', 'October', 'November', 'December'] _months_a =['','Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec'] _months_p =['','Jan.', 'Feb.', 'Mar.', 'Apr.', 'May', 'June', 'July', 'Aug.', 'Sep.', 'Oct.', 'Nov.', 'Dec.'] _monthmap ={'january': 1, 'jan': 1, 'february': 2, 'feb': 2, 'march': 3, 'mar': 3, 'april': 4, 'apr': 4, 'may': 5, 'june': 6, 'jun': 6, 'july': 7, 'jul': 7, 'august': 8, 'aug': 8, 'september': 9, 'sep': 9, 'sept': 9, 'october': 10, 'oct': 10, 'november': 11, 'nov': 11, 'december': 12, 'dec': 12} _days =['Sunday','Monday','Tuesday','Wednesday', 'Thursday','Friday','Saturday'] _days_a =['Sun', 'Mon', 'Tue', 'Wed', 'Thu', 'Fri', 'Sat' ] _days_p =['Sun.', 'Mon.', 'Tue.', 'Wed.', 'Thu.', 'Fri.', 'Sat.'] _daymap ={'sunday': 1, 'sun': 1, 'monday': 2, 'mon': 2, 'tuesday': 3, 'tues': 3, 'tue': 3, 'wednesday': 4, 'wed': 4, 'thursday': 5, 'thurs': 5, 'thur': 5, 'thu': 5, 'friday': 6, 'fri': 6, 'saturday': 7, 'sat': 7} try: _localzone=_cache._zmap[lower(tzname[0])] except: try: t=time() localzone=float(int(mktime(gmtime(t))) - int(t)) offset=(-localzone/(60*60)) majorOffset=int(offset) if majorOffset != 0 : minorOffset=abs(int((offset % majorOffset) * 60.0)) else: minorOffset = 0 m=majorOffset >= 0 and '+' or '' lz='%s%0.02d%0.02d' % (m, majorOffset, minorOffset) _localzone=_cache._zmap[lower('GMT%s' % lz)] except: _localzone='' _tzinfo =_cache() def _parse(self,string): # Parse date-time components from a string month=year=tz=tm=None spaces =self.space_chars intpat =self.int_pattern fltpat =self.flt_pattern wordpat =self.name_pattern delimiters =self.delimiters MonthNumbers =self._monthmap DayOfWeekNames=self._daymap ValidZones =self._tzinfo._zidx TimeModifiers =['am','pm'] # Find timezone first, since it should always be the last # element, and may contain a slash, confusing the parser. sp=split(strip(string)) tz=sp[-1] if tz and (lower(tz) in ValidZones): string=join(sp[:-1]) else: tz=self._localzone ints,dels=[],[] i,l=0,len(string) while i < l: while i < l and string[i] in spaces : i=i+1 if i < l and string[i] in delimiters: d=string[i] i=i+1 else: d='' while i < l and string[i] in spaces : i=i+1 # The float pattern needs to look back 1 character, because it # actually looks for a preceding colon like ':33.33'. This is # needed to avoid accidentally matching the date part of a # dot-separated date string such as '1999.12.31'. if i > 0: b=i-1 else: b=i ts_results = fltpat.match_group(string, (1,), b) if ts_results: #s=ts_results[1][0] s=ts_results[1] i=i+len(s) ints.append(atof(s)) continue #TS ts_results = intpat.match_group(string, (1,), i) if ts_results: #s=ts_results[1][0] s=ts_results[1] ls=len(s) i=i+ls if (ls==4 and d and d in '+-' and (len(ints) + (not not month) >= 3)): tz='%s%s' % (d,s) else: v=atoi(s) ints.append(v) continue ts_results = wordpat.match_group(string, (1,), i) if ts_results: o,s=ts_results[1],lower(ts_results[1]) i=i+len(s) if i < l and string[i]=='.': i=i+1 # Check for month name: if MonthNumbers.has_key(s): v=MonthNumbers[s] if month is None: month=v else: raise self.SyntaxError, string continue # Check for time modifier: if s in TimeModifiers: if tm is None: tm=s else: raise self.SyntaxError, string continue # Check for and skip day of week: if DayOfWeekNames.has_key(s): continue raise self.SyntaxError, string day=None if ints[-1] > 60 and d not in ['.',':'] and len(ints) > 2: year=ints[-1] del ints[-1] if month: day=ints[0] del ints[:1] else: month=ints[0] day=ints[1] del ints[:2] elif month: if len(ints) > 1: if ints[0] > 31: year=ints[0] day=ints[1] else: year=ints[1] day=ints[0] del ints[:2] elif len(ints) > 2: if ints[0] > 31: year=ints[0] if ints[1] > 12: day=ints[1] month=ints[2] else: day=ints[2] month=ints[1] if ints[1] > 31: year=ints[1] if ints[0] > 12 and ints[2] <= 12: day=ints[0] month=ints[2] elif ints[2] > 12 and ints[0] <= 12: day=ints[2] month=ints[0] elif ints[2] > 31: year=ints[2] if ints[0] > 12: day=ints[0] month=ints[1] else: day=ints[1] month=ints[0] elif ints[0] <= 12: month=ints[0] day=ints[1] year=ints[2] del ints[:3] if day is None: raise self.SyntaxError, string if year < 100: year=year+CENTURY elif year < 1000: raise self.SyntaxError, string leap = year%4==0 and (year%100!=0 or year%400==0) if not day or day > self._month_len[leap][month]: raise self.SyntaxError, string t=0 if ints: i=ints[0] # Modify hour to reflect am/pm if tm and (tm=='pm') and i<12: i=i+12 if tm and (tm=='am') and i==12: i=0 if i > 24: raise self.SyntaxError, string t=t+i/24.0 del ints[0] if ints: i=ints[0] if i > 60: raise self.SyntaxError, string t=t+i/1440.0 del ints[0] if ints: i=ints[0] if i > 60: raise self.SyntaxError, string t=t+i/86400.0 del ints[0] if ints: raise self.SyntaxError,string t=t*86400.0 hr=int(t/3600) t=t-hr*3600 mn=int(t/60) sc=t-mn*60 tz=tz or self._localzone return year,month,day,hr,mn,sc,tz # Internal methods def __getinitargs__(self): return (None,) def _julianday(self,yr,mo,dy): y,m,d=long(yr),long(mo),long(dy) if m > 12L: y=y+m/12L m=m%12L elif m < 1L: m=-m y=y-m/12L-1L m=12L-m%12L if y > 0L: yr_correct=0L else: yr_correct=3L if m < 3L: y, m=y-1L,m+12L if y*10000L+m*100L+d > 15821014L: b=2L-y/100L+y/400L else: b=0L return (1461L*y-yr_correct)/4L+306001L*(m+1L)/10000L+d+1720994L+b def _calendarday(self,j): j=long(j) if(j < 2299160L): b=j+1525L else: a=(4L*j-7468861L)/146097L b=j+1526L+a-a/4L c=(20L*b-2442L)/7305L d=1461L*c/4L e=10000L*(b-d)/306001L dy=int(b-d-306001L*e/10000L) mo=(e < 14L) and int(e-1L) or int(e-13L) yr=(mo > 2) and (c-4716L) or (c-4715L) return int(yr),int(mo),int(dy) def _validDate(self,y,m,d): if m<1 or m>12 or y<0 or d<1 or d>31: return 0 return d<=self._month_len[(y%4==0 and (y%100!=0 or y%400==0))][m] def _validTime(self,h,m,s): return h>=0 and h<=23 and m>=0 and m<=59 and s>=0 and s<=59 def __getattr__(self, name): if '%' in name: return strftimeFormatter(self, name) raise AttributeError, name # Conversion and comparison methods def timeTime(self): """Return the date/time as a floating-point number in UTC, in the format used by the python time module. Note that it is possible to create date/time values with DateTime that have no meaningful value to the time module.""" return self._t def toZone(self, z): """Return a DateTime with the value as the current object, represented in the indicated timezone.""" t,tz=self._t,self._tzinfo._zmap[lower(z)] if (t>0 and ((t/86400.0) < 24837)): # Try to cheat and use time module for speed... yr,mo,dy,hr,mn,sc=gmtime(t+self._tzinfo[tz].info(t)[0])[:6] sc=self._second return self.__class__(yr,mo,dy,hr,mn,sc,tz,t,self._d,self.time) d=self._d+(self._tzinfo[tz].info(t)[0]/86400.0) yr,mo,dy=self._calendarday((d+jd1901)) s=(d-int(d))*86400.0 hr=int(s/3600) s=s-(hr*3600) mn=int(s/60) sc=s-(mn*60) if(hr==23 and mn==59 and sc>59.999): # Fix formatting for positives hr,mn,sc=0,0,0.0 else: # Fix formatting for negatives if hr<0: hr=23+hr if mn<0: mn=59+mn if sc<0: if (sc-int(sc)>=0.999): sc=round(sc) sc=59+sc return self.__class__(yr,mo,dy,hr,mn,sc,tz,t,self._d,self.time) def isFuture(self): """Return true if this object represents a date/time later than the time of the call""" return (self._t > time()) def isPast(self): """Return true if this object represents a date/time earlier than the time of the call""" return (self._t < time()) def isCurrentYear(self): """Return true if this object represents a date/time that falls within the current year, in the context of this object\'s timezone representation""" t=time() return gmtime(t+self._tzinfo[self._tz].info(t)[0])[0]==self._year def isCurrentMonth(self): """Return true if this object represents a date/time that falls within the current month, in the context of this object\'s timezone representation""" t=time() return gmtime(t+self._tzinfo[self._tz].info(t)[0])[1]==self._month def isCurrentDay(self): """Return true if this object represents a date/time that falls within the current day, in the context of this object\'s timezone representation""" t=time() return gmtime(t+self._tzinfo[self._tz].info(t)[0])[2]==self._day def isCurrentHour(self): """Return true if this object represents a date/time that falls within the current hour, in the context of this object\'s timezone representation""" t=time() return gmtime(t+self._tzinfo[self._tz].info(t)[0])[3]==self._hour def isCurrentMinute(self): """Return true if this object represents a date/time that falls within the current minute, in the context of this object\'s timezone representation""" t=time() return gmtime(t+self._tzinfo[self._tz].info(t)[0])[4]==self._minute def earliestTime(self): """Return a new DateTime object that represents the earliest possible time (in whole seconds) that still falls within the current object\'s day, in the object\'s timezone context""" return self.__class__(self._year,self._month,self._day,0,0,1,self._tz) def latestTime(self): """Return a new DateTime object that represents the latest possible time (in whole seconds) that still falls within the current object\'s day, in the object\'s timezone context""" return self.__class__(self._year,self._month,self._day, 23,59,59,self._tz) def greaterThan(self,t): """Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time greater than the specified DateTime or time module style time.""" try: return (self._d > t._d) except: return (self._t > t) def greaterThanEqualTo(self,t): """Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time greater than or equal to the specified DateTime or time module style time.""" try: return (self._d >= t._d) except: return (self._t >= t) def equalTo(self,t): """Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time equal to the specified DateTime or time module style time.""" try: return (self._d == t._d) except: return (self._t == t) def notEqualTo(self,t): """Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time not equal to the specified DateTime or time module style time.""" try: return (self._d != t._d) except: return (self._t != t) def lessThan(self,t): """Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time less than the specified DateTime or time module style time.""" try: return (self._d < t._d) except: return (self._t < t) def lessThanEqualTo(self,t): """Compare this DateTime object to another DateTime object OR a floating point number such as that which is returned by the python time module. Returns true if the object represents a date/time less than or equal to the specified DateTime or time module style time.""" try: return (self._d <= t._d) except: return (self._t <= t) def isLeapYear(self): """Return true if the current year (in the context of the object\'s timezone) is a leap year""" return self._year%4==0 and (self._year%100!=0 or self._year%400==0) def dayOfYear(self): """Return the day of the year, in context of the timezone representation of the object""" d=int(self._d+(self._tzinfo[self._tz].info(self._t)[0]/86400.0)) return int((d+jd1901)-self._julianday(self._year,1,0)) # Component access def parts(self): """Return a tuple containing the calendar year, month, day, hour, minute second and timezone of the object""" return self._year, self._month, self._day, self._hour, \ self._minute, self._second, self._tz def timezone(self): """Return the timezone in which the object is represented.""" return self._tz def year(self): """Return the calendar year of the object""" return self._year def month(self): """Return the month of the object as an integer""" return self._month def Month(self): """Return the full month name""" return self._fmon def aMonth(self): """Return the abreviated month name.""" return self._amon def Mon(self): """Compatibility: see aMonth""" return self._amon def pMonth(self): """Return the abreviated (with period) month name.""" return self._pmon def Mon_(self): """Compatibility: see pMonth""" return self._pmon def day(self): """Return the integer day""" return self._day def Day(self): """Return the full name of the day of the week""" return self._fday def DayOfWeek(self): """Compatibility: see Day""" return self._fday def aDay(self): """Return the abreviated name of the day of the week""" return self._aday def pDay(self): """Return the abreviated (with period) name of the day of the week""" return self._pday def Day_(self): """Compatibility: see pDay""" return self._pday def dow(self): """Return the integer day of the week, where sunday is 0""" return self._dayoffset def dow_1(self): """Return the integer day of the week, where sunday is 1""" return self._dayoffset+1 def h_12(self): """Return the 12-hour clock representation of the hour""" return self._pmhour def h_24(self): """Return the 24-hour clock representation of the hour""" return self._hour def ampm(self): """Return the appropriate time modifier (am or pm)""" return self._pm def hour(self): """Return the 24-hour clock representation of the hour""" return self._hour def minute(self): """Return the minute""" return self._minute def second(self): """Return the second""" return self._second def strftime(self, format): return strftime(format, gmtime(self.timeTime())) # General formats from previous DateTime def Date(self): """Return the date string for the object.""" return "%s/%2.2d/%2.2d" % (self._year, self._month, self._day) def Time(self): """Return the time string for an object to the nearest second.""" return '%2.2d:%2.2d:%2.2d' % (self._hour,self._minute,self._nearsec) def TimeMinutes(self): """Return the time string for an object not showing seconds.""" return '%2.2d:%2.2d' % (self._hour,self._minute) def AMPM(self): """Return the time string for an object to the nearest second.""" return '%2.2d:%2.2d:%2.2d %s' % ( self._pmhour,self._minute,self._nearsec,self._pm) def AMPMMinutes(self): """Return the time string for an object not showing seconds.""" return '%2.2d:%2.2d %s' % (self._pmhour,self._minute,self._pm) def PreciseTime(self): """Return the time string for the object.""" return '%2.2d:%2.2d:%06.3f' % (self._hour,self._minute,self._second) def PreciseAMPM(self): """Return the time string for the object.""" return '%2.2d:%2.2d:%06.3f %s' % ( self._pmhour,self._minute,self._second,self._pm) def yy(self): """Return calendar year as a 2 digit string""" return str(self._year)[-2:] def mm(self): """Return month as a 2 digit string""" return '%02d' % self._month def dd(self): """Return day as a 2 digit string""" return '%02d' % self._day def rfc822(self): """Return the date in RFC 822 format""" return '%s, %2.2d %s %d %2.2d:%2.2d:%2.2d %s' % ( self._aday,self._day,self._amon,self._year, self._hour,self._minute,self._nearsec,self._tz) # New formats def fCommon(self): """Return a string representing the object\'s value in the format: March 1, 1997 1:45 pm""" return '%s %s, %4.4d %s:%2.2d %s' % ( self._fmon,self._day,self._year,self._pmhour, self._minute,self._pm) def fCommonZ(self): """Return a string representing the object\'s value in the format: March 1, 1997 1:45 pm US/Eastern""" return '%s %s, %4.4d %d:%2.2d %s %s' % ( self._fmon,self._day,self._year,self._pmhour, self._minute,self._pm,self._tz) def aCommon(self): """Return a string representing the object\'s value in the format: Mar 1, 1997 1:45 pm""" return '%s %s, %4.4d %s:%2.2d %s' % ( self._amon,self._day,self._year,self._pmhour, self._minute,self._pm) def aCommonZ(self): """Return a string representing the object\'s value in the format: Mar 1, 1997 1:45 pm US/Eastern""" return '%s %s, %4.4d %d:%2.2d %s %s' % ( self._amon,self._day,self._year,self._pmhour, self._minute,self._pm,self._tz) def pCommon(self): """Return a string representing the object\'s value in the format: Mar. 1, 1997 1:45 pm""" return '%s %s, %4.4d %s:%2.2d %s' % ( self._pmon,self._day,self._year,self._pmhour, self._minute,self._pm) def pCommonZ(self): """Return a string representing the object\'s value in the format: Mar. 1, 1997 1:45 pm US/Eastern""" return '%s %s, %4.4d %d:%2.2d %s %s' % ( self._pmon,self._day,self._year,self._pmhour, self._minute,self._pm,self._tz) def ISO(self): """Return the object in ISO standard format Dates are output as: YYYY-MM-DD HH:MM:SS """ return "%.4d-%.2d-%.2d %.2d:%.2d:%.2d" % ( self._year, self._month, self._day, self._hour, self._minute, self._second) def __add__(self,other): """A DateTime may be added to a number and a number may be added to a DateTime; two DateTimes cannot be added.""" if hasattr(other,'_t'): raise self.DateTimeError,'Cannot add two DateTimes' o=float(other) d,t,tz=(self._d+o),(self._t+(o*86400.0)),self._tz x=d+(self._tzinfo[tz].info(t)[0]/86400.0) yr,mo,dy=self._calendarday((x+jd1901)) s=(x-int(x))*86400.0 hr=int(s/3600) s=s-(hr*3600) mn=int(s/60) s=s-(mn*60) return self.__class__(yr,mo,dy,hr,mn,s,self._tz,t,d,(d-int(d))) __radd__=__add__ def __sub__(self,other): """Either a DateTime or a number may be subtracted from a DateTime, however, a DateTime may not be subtracted from a number.""" try: return self._d-other._d except: return self.__add__(-(other)) def __repr__(self): """Convert a DateTime to a string that looks like a Python expression.""" return '%s(\'%s\')' % (self.__class__.__name__,str(self)) def __str__(self): """Convert a DateTime to a string.""" y,m,d =self._year,self._month,self._day h,mn,s,t=self._hour,self._minute,self._second,self._tz if(h+mn+s): if (s-int(s))> 0.0001: return '%4.4d/%2.2d/%2.2d %2.2d:%2.2d:%g %s' % ( y,m,d,h,mn,s,t) else: return '%4.4d/%2.2d/%2.2d %2.2d:%2.2d:%2.2d %s' % ( y,m,d,h,mn,s,t) else: return '%4.4d/%2.2d/%2.2d' % (y,m,d) def __cmp__(self,obj): """Compare a DateTime with another DateTime object, or a float such as those returned by time.time(). NOTE: __cmp__ support is provided for backward compatibility only, and mixing DateTimes with ExtensionClasses could cause __cmp__ to break. You should use the methods lessThan, greaterThan, lessThanEqualTo, greaterThanEqualTo, equalTo and notEqualTo to avoid potential problems later!!""" try: return cmp(self._d,obj._d) except AttributeError: return cmp(self._t,obj) def __hash__(self): """Compute a hash value for a DateTime""" return int(((self._year%100*12+self._month)*31+ self._day+self.time)*100) def __int__(self): """Convert to an integer number of seconds since the epoch (gmt)""" return int(self._t) def __long__(self): """Convert to a long-int number of seconds since the epoch (gmt)""" return long(self._t) def __float__(self): """Convert to floating-point number of seconds since the epoch (gmt)""" return float(self._t) class strftimeFormatter: def __init__(self, dt, format): self._dt=dt self._f=format def __call__(self): return self._dt.strftime(self._f) # Module methods def Timezones(): """Return the list of recognized timezone names""" return _cache._zlst Zope-2.0.1-ZEO-nonbin/lib/python/DateTime/DateTimeZone.py100644 1007 1403 210175 6751650300 23041 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## _data={'US/Indiana-Starke': ('US/Indiana-Starke', 56, 4, [-1633276800, -1615136400, -1601827200, -1583686800, -880214400, -765392400, -84384000, -68662800, -52934400, -37213200, -21484800, -5763600, 9964800, 25686000, 41414400, 57740400, 73468800, 89190000, 104918400, 120639600, 126691200, 152089200, 162374400, 183538800, 199267200, 215593200, 230716800, 247042800, 262771200, 278492400, 294220800, 309942000, 325670400, 341391600, 357120000, 372841200, 388569600, 404895600, 420019200, 436345200, 452073600, 467794800, 483523200, 499244400, 514972800, 530694000, 544608000, 562143600, 576057600, 594198000, 607507200, 625647600, 638956800, 657097200, 671011200, 688546800], '\000\001\000\001\002\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\003', [(-18000, 1, 0), (-21600, 0, 4), (-18000, 1, 8), (-18000, 0, 12)], 'CDT\000CST\000CWT\000EST\000'), 'Japan': ('Japan', 0, 1, [], '', [(32400, 0, 0)], 'JST\000'), 'Cuba': ('Cuba', 118, 2, [290581200, 308721600, 322030800, 340171200, 358318800, 371620800, 389768400, 403070400, 421218000, 434520000, 453272400, 466574400, 484722000, 498024000, 516171600, 529473600, 547621200, 560923200, 579070800, 592372800, 611125200, 623822400, 642574800, 655876800, 674024400, 687326400, 705474000, 718776000, 736923600, 750225600, 768373200, 781675200, 800427600, 813124800, 831877200, 845179200, 863326800, 876628800, 894776400, 908078400, 926226000, 939528000, 958280400, 970977600, 989730000, 1003032000, 1021179600, 1034481600, 1052629200, 1065931200, 1084078800, 1097380800, 1115528400, 1128830400, 1147582800, 1160280000, 1179032400, 1192334400, 1210482000, 1223784000, 1241931600, 1255233600, 1273381200, 1286683200, 1304830800, 1318132800, 1336885200, 1350187200, 1368334800, 1381636800, 1399784400, 1413086400, 1431234000, 1444536000, 1462683600, 1475985600, 1494738000, 1507435200, 1526187600, 1539489600, 1557637200, 1570939200, 1589086800, 1602388800, 1620536400, 1633838400, 1651986000, 1665288000, 1684040400, 1696737600, 1715490000, 1728792000, 1746939600, 1760241600, 1778389200, 1791691200, 1809838800, 1823140800, 1841893200, 1854590400, 1873342800, 1886644800, 1904792400, 1918094400, 1936242000, 1949544000, 1967691600, 1980993600, 1999141200, 2012443200, 2031195600, 2043892800, 2062645200, 2075947200, 2094094800, 2107396800, 2125544400, 2138846400], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-14400, 1, 0), (-18000, 0, 4)], 'CDT\000CST\000'), 'Singapore': ('Singapore', 0, 1, [], '', [(28800, 0, 0)], 'SST\000'), 'Chile/Continental': ('Chile/Continental', 121, 2, [245217600, 258519600, 276667200, 289969200, 308721600, 321418800, 340171200, 352868400, 371620800, 384922800, 403070400, 416372400, 434520000, 447822000, 466574400, 479271600, 498024000, 510721200, 529473600, 542170800, 560923200, 574225200, 592372800, 605674800, 623822400, 637124400, 655876800, 668574000, 687326400, 700023600, 718776000, 732078000, 750225600, 763527600, 781675200, 794977200, 813124800, 826426800, 845179200, 857876400, 876628800, 889326000, 908078400, 921380400, 939528000, 952830000, 970977600, 984279600, 1003032000, 1015729200, 1034481600, 1047178800, 1065931200, 1079233200, 1097380800, 1110682800, 1128830400, 1142132400, 1160280000, 1173582000, 1192334400, 1205031600, 1223784000, 1236481200, 1255233600, 1268535600, 1286683200, 1299985200, 1318132800, 1331434800, 1350187200, 1362884400, 1381636800, 1394334000, 1413086400, 1425783600, 1444536000, 1457838000, 1475985600, 1489287600, 1507435200, 1520737200, 1539489600, 1552186800, 1570939200, 1583636400, 1602388800, 1615690800, 1633838400, 1647140400, 1665288000, 1678590000, 1696737600, 1710039600, 1728792000, 1741489200, 1760241600, 1772938800, 1791691200, 1804993200, 1823140800, 1836442800, 1854590400, 1867892400, 1886644800, 1899342000, 1918094400, 1930791600, 1949544000, 1962846000, 1980993600, 1994295600, 2012443200, 2025745200, 2043892800, 2057194800, 2075947200, 2088644400, 2107396800, 2120094000, 2138846400], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000', [(-10800, 1, 0), (-14400, 0, 4)], 'CDT\000CST\000'), 'Brazil/West': ('Brazil/West', 101, 2, [561967200, 571640400, 593416800, 603090000, 625557600, 634539600, 656920800, 665989200, 688370400, 697438800, 719820000, 729493200, 751269600, 760942800, 782719200, 792392400, 814860000, 823842000, 846223200, 855291600, 877672800, 887432400, 909122400, 918795600, 940572000, 950245200, 972712800, 981694800, 1004076000, 1013144400, 1035525600, 1044594000, 1066975200, 1076734800, 1098424800, 1108098000, 1129874400, 1139547600, 1162015200, 1170997200, 1193378400, 1202446800, 1224828000, 1234587600, 1256277600, 1265950800, 1287727200, 1297400400, 1319176800, 1328850000, 1351231200, 1360299600, 1382680800, 1391749200, 1414130400, 1423890000, 1445580000, 1455253200, 1477029600, 1486702800, 1509170400, 1518152400, 1540533600, 1549602000, 1571983200, 1581051600, 1603432800, 1613106000, 1634882400, 1644555600, 1666332000, 1676005200, 1698472800, 1707454800, 1729836000, 1738904400, 1761285600, 1771045200, 1792735200, 1802408400, 1824184800, 1833858000, 1856325600, 1865307600, 1887688800, 1896757200, 1919138400, 1928206800, 1950588000, 1960347600, 1982037600, 1991710800, 2013487200, 2023160400, 2045628000, 2054610000, 2076991200, 2086059600, 2108440800, 2118200400, 2139890400], '\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-14400, 0, 0), (-10800, 1, 4)], 'WST\000WDT\000'), 'GMT+2': ('GMT+2', 0, 1, [], '', [(7200, 0, 0)], 'GMT+0200\000'), 'Mexico/BajaSur': ('Mexico/BajaSur', 0, 1, [], '', [(-25200, 0, 0)], 'MST\000'), 'GMT+3': ('GMT+3', 0, 1, [], '', [(10800, 0, 0)], 'GMT+0300\000'), 'Israel': ('Israel', 42, 2, [609890400, 622587600, 640735200, 653432400, 670975200, 683672400, 704239200, 716936400, 735084000, 747781200, 765324000, 778021200, 798588000, 811285200, 829432800, 842130000, 862696800, 875394000, 892936800, 905634000, 923781600, 936478800, 957045600, 969742800, 987285600, 999982800, 1018130400, 1030827600, 1051394400, 1064091600, 1082239200, 1094936400, 1114898400, 1127595600, 1145743200, 1158440400, 1176588000, 1189285200, 1209247200, 1221944400, 1240092000, 1252789200], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(10800, 1, 0), (7200, 0, 4)], 'IDT\000IST\000'), 'GMT-6': ('GMT-6', 0, 1, [], '', [(-21600, 0, 0)], 'GMT-0600\000'), 'GMT+5': ('GMT+5', 0, 1, [], '', [(18000, 0, 0)], 'GMT+0500\000'), 'GMT+8': ('GMT+8', 0, 1, [], '', [(28800, 0, 0)], 'GMT+0800\000'), 'GMT+9': ('GMT+9', 0, 1, [], '', [(32400, 0, 0)], 'GMT+0900\000'), 'GMT+6': ('GMT+6', 0, 1, [], '', [(21600, 0, 0)], 'GMT+0600\000'), 'Canada/Newfoundland': ('Canada/Newfoundland', 138, 2, [-21493800, -5772600, 9955800, 25677000, 41405400, 57731400, 73459800, 89181000, 104909400, 120630600, 136359000, 152080200, 167808600, 183529800, 199258200, 215584200, 230707800, 247033800, 262762200, 278483400, 294211800, 309933000, 325661400, 341382600, 357111000, 372832200, 388560600, 404886600, 420010200, 436336200, 452064600, 467785800, 483514200, 499235400, 514963800, 530685000, 544599000, 562134600, 576048600, 594189000, 607498200, 625638600, 638947800, 657088200, 671002200, 688537800, 702451800, 719987400, 733901400, 752041800, 765351000, 783491400, 796800600, 814941000, 828855000, 846390600, 860304600, 877840200, 891754200, 909289800, 923203800, 941344200, 954653400, 972793800, 986103000, 1004243400, 1018157400, 1035693000, 1049607000, 1067142600, 1081056600, 1099197000, 1112506200, 1130646600, 1143955800, 1162096200, 1175405400, 1193545800, 1207459800, 1224995400, 1238909400, 1256445000, 1270359000, 1288499400, 1301808600, 1319949000, 1333258200, 1351398600, 1365312600, 1382848200, 1396762200, 1414297800, 1428211800, 1445747400, 1459661400, 1477801800, 1491111000, 1509251400, 1522560600, 1540701000, 1554615000, 1572150600, 1586064600, 1603600200, 1617514200, 1635654600, 1648963800, 1667104200, 1680413400, 1698553800, 1712467800, 1730003400, 1743917400, 1761453000, 1775367000, 1792902600, 1806816600, 1824957000, 1838266200, 1856406600, 1869715800, 1887856200, 1901770200, 1919305800, 1933219800, 1950755400, 1964669400, 1982809800, 1996119000, 2014259400, 2027568600, 2045709000, 2059018200, 2077158600, 2091072600, 2108608200, 2122522200, 2140057800], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-9000, 1, 0), (-12600, 0, 4)], 'NDT\000NST\000'), 'GMT-5': ('GMT-5', 0, 1, [], '', [(-18000, 0, 0)], 'GMT-0500\000'), 'GB-Eire': ('GB-Eire', 241, 4, [-1697238000, -1680476400, -1664146800, -1650150000, -1633906800, -1617490800, -1601852400, -1586041200, -1570402800, -1552172400, -1538348400, -1522537200, -1507503600, -1490569200, -1473634800, -1458342000, -1441321200, -1428879600, -1410735600, -1396220400, -1379286000, -1364770800, -1347836400, -1333321200, -1316386800, -1301266800, -1284332400, -1269817200, -1252882800, -1238367600, -1221433200, -1206918000, -1189983600, -1175468400, -1158534000, -1144018800, -1127084400, -1111964400, -1095030000, -1080514800, -1063580400, -1049065200, -1032130800, -1017615600, -1000681200, -986166000, -969231600, -950482800, -942015600, -904518000, -896050800, -875487600, -864601200, -844038000, -832546800, -812588400, -798073200, -781052400, -772066800, -764809200, -748479600, -733359600, -719449200, -717030000, -706748400, -699490800, -687999600, -668041200, -654735600, -636591600, -622076400, -605746800, -590626800, -574297200, -558572400, -542242800, -527122800, -512607600, -496278000, -481158000, -464223600, -449708400, -432774000, -417654000, -401324400, -386204400, -369270000, -354754800, -337820400, -323305200, -306975600, -291855600, -276735600, -257986800, -245286000, -226537200, -213231600, -195087600, -182386800, -163638000, -150937200, -132188400, -119487600, -100738800, -88038000, -68684400, -59007600, -37238400, 57715200, 69814800, 89168400, 101264400, 120618000, 132714000, 152067600, 164163600, 183517200, 196218000, 214966800, 227667600, 246416400, 259117200, 278470800, 290566800, 309920400, 322016400, 341370000, 354675600, 372819600, 386125200, 404269200, 417574800, 435718800, 449024400, 467773200, 481078800, 499222800, 512528400, 530672400, 543978000, 562122000, 575427600, 593571600, 606877200, 625626000, 638326800, 657075600, 670381200, 688525200, 701830800, 719974800, 733280400, 751424400, 764730000, 782874000, 796179600, 814928400, 828234000, 846378000, 859683600, 877827600, 891133200, 909277200, 922582800, 940726800, 954032400, 972781200, 985482000, 1004230800, 1017536400, 1035680400, 1048986000, 1067130000, 1080435600, 1098579600, 1111885200, 1130029200, 1143334800, 1162083600, 1174784400, 1193533200, 1206838800, 1224982800, 1238288400, 1256432400, 1269738000, 1287882000, 1301187600, 1319331600, 1332637200, 1351386000, 1364691600, 1382835600, 1396141200, 1414285200, 1427590800, 1445734800, 1459040400, 1477184400, 1490490000, 1509238800, 1521939600, 1540688400, 1553994000, 1572138000, 1585443600, 1603587600, 1616893200, 1635037200, 1648342800, 1666486800, 1679792400, 1698541200, 1711846800, 1729990800, 1743296400, 1761440400, 1774746000, 1792890000, 1806195600, 1824339600, 1837645200, 1856394000, 1869094800, 1887843600, 1901149200, 1919293200, 1932598800, 1950742800, 1964048400, 1982192400, 1995498000, 2013642000, 2026947600, 2045696400, 2058397200, 2077146000, 2090451600, 2108595600, 2121901200, 2140045200], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\002\000\002\000\002\000\002\000\002\000\001\000\001\000\002\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\003\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(3600, 1, 0), (0, 0, 4), (7200, 1, 8), (3600, 0, 0)], 'BST\000GMT\000DST\000'), 'GMT+1': ('GMT+1', 0, 1, [], '', [(3600, 0, 0)], 'GMT+0100\000'), 'GMT-8': ('GMT-8', 0, 1, [], '', [(-28800, 0, 0)], 'GMT-0800\000'), 'GMT-9': ('GMT-9', 0, 1, [], '', [(-32400, 0, 0)], 'GMT-0900\000'), 'GMT+4': ('GMT+4', 0, 1, [], '', [(14400, 0, 0)], 'GMT+0400\000'), 'GMT-7': ('GMT-7', 0, 1, [], '', [(-25200, 0, 0)], 'GMT-0700\000'), 'GMT-4': ('GMT-4', 0, 1, [], '', [(-14400, 0, 0)], 'GMT-0400\000'), 'GMT+7': ('GMT+7', 0, 1, [], '', [(25200, 0, 0)], 'GMT+0700\000'), 'GMT-2': ('GMT-2', 0, 1, [], '', [(-7200, 0, 0)], 'GMT-0200\000'), 'GMT-3': ('GMT-3', 0, 1, [], '', [(-10800, 0, 0)], 'GMT-0300\000'), 'GMT-1': ('GMT-1', 0, 1, [], '', [(-3600, 0, 0)], 'GMT-0100\000'), 'Hongkong': ('Hongkong', 0, 1, [], '', [(28800, 0, 0)], 'HKT\000'), 'Turkey': ('Turkey', 104, 2, [512517600, 528238800, 543967200, 559688400, 575416800, 591138000, 606866400, 622587600, 638316000, 654642000, 670370400, 686091600, 701820000, 717541200, 733269600, 748990800, 764719200, 780440400, 796168800, 811890000, 828223200, 843944400, 859672800, 875394000, 891122400, 906843600, 922572000, 938293200, 954021600, 969742800, 985471200, 1001797200, 1017525600, 1033246800, 1048975200, 1064696400, 1080424800, 1096146000, 1111874400, 1127595600, 1143324000, 1159045200, 1174773600, 1191099600, 1206828000, 1222549200, 1238277600, 1253998800, 1269727200, 1285448400, 1301176800, 1316898000, 1332626400, 1348952400, 1364680800, 1380402000, 1396130400, 1411851600, 1427580000, 1443301200, 1459029600, 1474750800, 1490479200, 1506200400, 1521928800, 1538254800, 1553983200, 1569704400, 1585432800, 1601154000, 1616882400, 1632603600, 1648332000, 1664053200, 1679781600, 1695502800, 1711836000, 1727557200, 1743285600, 1759006800, 1774735200, 1790456400, 1806184800, 1821906000, 1837634400, 1853355600, 1869084000, 1885410000, 1901138400, 1916859600, 1932588000, 1948309200, 1964037600, 1979758800, 1995487200, 2011208400, 2026936800, 2042658000, 2058386400, 2074712400, 2090440800, 2106162000, 2121890400, 2137611600], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(14400, 1, 0), (10800, 0, 8)], 'EET DST\000EET\000'), 'US/Samoa': ('US/Samoa', 2, 3, [-86878800, 439038000], '\001\002', [(-39600, 0, 0), (-39600, 0, 4), (-39600, 0, 8)], 'NST\000BST\000SST\000'), 'Iran': ('Iran', 100, 2, [575418600, 590535000, 606868200, 621984600, 638317800, 653434200, 670372200, 684883800, 701821800, 716938200, 733271400, 748387800, 764721000, 779837400, 796170600, 811287000, 828225000, 842736600, 859674600, 874791000, 891124200, 906240600, 922573800, 937690200, 954023400, 969139800, 985473000, 1000589400, 1017527400, 1032039000, 1048977000, 1064093400, 1080426600, 1095543000, 1111876200, 1126992600, 1143325800, 1158442200, 1174775400, 1189891800, 1206829800, 1221946200, 1238279400, 1253395800, 1269729000, 1284845400, 1301178600, 1316295000, 1332628200, 1347744600, 1364682600, 1379194200, 1396132200, 1411248600, 1427581800, 1442698200, 1459031400, 1474147800, 1490481000, 1505597400, 1521930600, 1537047000, 1553985000, 1568496600, 1585434600, 1600551000, 1616884200, 1632000600, 1648333800, 1663450200, 1679783400, 1694899800, 1711837800, 1726349400, 1743287400, 1758403800, 1774737000, 1789853400, 1806186600, 1821303000, 1837636200, 1852752600, 1869085800, 1884202200, 1901140200, 1915651800, 1932589800, 1947706200, 1964039400, 1979155800, 1995489000, 2010605400, 2026938600, 2042055000, 2058388200, 2073504600, 2090442600, 2105559000, 2121892200, 2137008600], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(16200, 1, 0), (12600, 0, 4)], 'IDT\000IST\000'), 'US/Pacific': ('US/Pacific', 148, 3, [-1633269600, -1615129200, -1601820000, -1583679600, -880207200, -765385200, -84376800, -68655600, -52927200, -37206000, -21477600, -5756400, 9972000, 25693200, 41421600, 57747600, 73476000, 89197200, 104925600, 120646800, 126698400, 152096400, 162381600, 183546000, 199274400, 215600400, 230724000, 247050000, 262778400, 278499600, 294228000, 309949200, 325677600, 341398800, 357127200, 372848400, 388576800, 404902800, 420026400, 436352400, 452080800, 467802000, 483530400, 499251600, 514980000, 530701200, 544615200, 562150800, 576064800, 594205200, 607514400, 625654800, 638964000, 657104400, 671018400, 688554000, 702468000, 720003600, 733917600, 752058000, 765367200, 783507600, 796816800, 814957200, 828871200, 846406800, 860320800, 877856400, 891770400, 909306000, 923220000, 941360400, 954669600, 972810000, 986119200, 1004259600, 1018173600, 1035709200, 1049623200, 1067158800, 1081072800, 1099213200, 1112522400, 1130662800, 1143972000, 1162112400, 1175421600, 1193562000, 1207476000, 1225011600, 1238925600, 1256461200, 1270375200, 1288515600, 1301824800, 1319965200, 1333274400, 1351414800, 1365328800, 1382864400, 1396778400, 1414314000, 1428228000, 1445763600, 1459677600, 1477818000, 1491127200, 1509267600, 1522576800, 1540717200, 1554631200, 1572166800, 1586080800, 1603616400, 1617530400, 1635670800, 1648980000, 1667120400, 1680429600, 1698570000, 1712484000, 1730019600, 1743933600, 1761469200, 1775383200, 1792918800, 1806832800, 1824973200, 1838282400, 1856422800, 1869732000, 1887872400, 1901786400, 1919322000, 1933236000, 1950771600, 1964685600, 1982826000, 1996135200, 2014275600, 2027584800, 2045725200, 2059034400, 2077174800, 2091088800, 2108624400, 2122538400, 2140074000], '\000\001\000\001\002\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-25200, 1, 0), (-28800, 0, 4), (-25200, 1, 8)], 'PDT\000PST\000PWT\000'), 'GMT-10': ('GMT-10', 0, 1, [], '', [(-36000, 0, 0)], 'GMT-1000\000'), 'GMT-11': ('GMT-11', 0, 1, [], '', [(-39600, 0, 0)], 'GMT-1100\000'), 'GMT-12': ('GMT-12', 0, 1, [], '', [(-43200, 0, 0)], 'GMT-1200\000'), 'GMT': ('GMT', 0, 1, [], '', [(0, 0, 0)], 'GMT\000'), 'Brazil/East': ('Brazil/East', 101, 2, [561963600, 571636800, 593413200, 603086400, 625554000, 634536000, 656917200, 665985600, 688366800, 697435200, 719816400, 729489600, 751266000, 760939200, 782715600, 792388800, 814856400, 823838400, 846219600, 855288000, 877669200, 887428800, 909118800, 918792000, 940568400, 950241600, 972709200, 981691200, 1004072400, 1013140800, 1035522000, 1044590400, 1066971600, 1076731200, 1098421200, 1108094400, 1129870800, 1139544000, 1162011600, 1170993600, 1193374800, 1202443200, 1224824400, 1234584000, 1256274000, 1265947200, 1287723600, 1297396800, 1319173200, 1328846400, 1351227600, 1360296000, 1382677200, 1391745600, 1414126800, 1423886400, 1445576400, 1455249600, 1477026000, 1486699200, 1509166800, 1518148800, 1540530000, 1549598400, 1571979600, 1581048000, 1603429200, 1613102400, 1634878800, 1644552000, 1666328400, 1676001600, 1698469200, 1707451200, 1729832400, 1738900800, 1761282000, 1771041600, 1792731600, 1802404800, 1824181200, 1833854400, 1856322000, 1865304000, 1887685200, 1896753600, 1919134800, 1928203200, 1950584400, 1960344000, 1982034000, 1991707200, 2013483600, 2023156800, 2045624400, 2054606400, 2076987600, 2086056000, 2108437200, 2118196800, 2139886800], '\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-10800, 0, 0), (-7200, 1, 4)], 'EST\000EDT\000'), 'Chile/EasterIsland': ('Chile/EasterIsland', 121, 2, [245224800, 258526800, 276674400, 289976400, 308728800, 321426000, 340178400, 352875600, 371628000, 384930000, 403077600, 416379600, 434527200, 447829200, 466581600, 479278800, 498031200, 510728400, 529480800, 542178000, 560930400, 574232400, 592380000, 605682000, 623829600, 637131600, 655884000, 668581200, 687333600, 700030800, 718783200, 732085200, 750232800, 763534800, 781682400, 794984400, 813132000, 826434000, 845186400, 857883600, 876636000, 889333200, 908085600, 921387600, 939535200, 952837200, 970984800, 984286800, 1003039200, 1015736400, 1034488800, 1047186000, 1065938400, 1079240400, 1097388000, 1110690000, 1128837600, 1142139600, 1160287200, 1173589200, 1192341600, 1205038800, 1223791200, 1236488400, 1255240800, 1268542800, 1286690400, 1299992400, 1318140000, 1331442000, 1350194400, 1362891600, 1381644000, 1394341200, 1413093600, 1425790800, 1444543200, 1457845200, 1475992800, 1489294800, 1507442400, 1520744400, 1539496800, 1552194000, 1570946400, 1583643600, 1602396000, 1615698000, 1633845600, 1647147600, 1665295200, 1678597200, 1696744800, 1710046800, 1728799200, 1741496400, 1760248800, 1772946000, 1791698400, 1805000400, 1823148000, 1836450000, 1854597600, 1867899600, 1886652000, 1899349200, 1918101600, 1930798800, 1949551200, 1962853200, 1981000800, 1994302800, 2012450400, 2025752400, 2043900000, 2057202000, 2075954400, 2088651600, 2107404000, 2120101200, 2138853600], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000', [(-18000, 1, 0), (-21600, 0, 4)], 'EDT\000EST\000'), 'Brazil/DeNoronha': ('Brazil/DeNoronha', 101, 2, [561960000, 571633200, 593409600, 603082800, 625550400, 634532400, 656913600, 665982000, 688363200, 697431600, 719812800, 729486000, 751262400, 760935600, 782712000, 792385200, 814852800, 823834800, 846216000, 855284400, 877665600, 887425200, 909115200, 918788400, 940564800, 950238000, 972705600, 981687600, 1004068800, 1013137200, 1035518400, 1044586800, 1066968000, 1076727600, 1098417600, 1108090800, 1129867200, 1139540400, 1162008000, 1170990000, 1193371200, 1202439600, 1224820800, 1234580400, 1256270400, 1265943600, 1287720000, 1297393200, 1319169600, 1328842800, 1351224000, 1360292400, 1382673600, 1391742000, 1414123200, 1423882800, 1445572800, 1455246000, 1477022400, 1486695600, 1509163200, 1518145200, 1540526400, 1549594800, 1571976000, 1581044400, 1603425600, 1613098800, 1634875200, 1644548400, 1666324800, 1675998000, 1698465600, 1707447600, 1729828800, 1738897200, 1761278400, 1771038000, 1792728000, 1802401200, 1824177600, 1833850800, 1856318400, 1865300400, 1887681600, 1896750000, 1919131200, 1928199600, 1950580800, 1960340400, 1982030400, 1991703600, 2013480000, 2023153200, 2045620800, 2054602800, 2076984000, 2086052400, 2108433600, 2118193200, 2139883200], '\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-7200, 0, 0), (-3600, 1, 4)], 'FST\000FDT\000'), 'US/Aleutian': ('US/Aleutian', 149, 5, [-1633262400, -1615122000, -1601812800, -1583672400, -880200000, -765378000, -84369600, -68648400, -52920000, -37198800, -21470400, -5749200, 9979200, 25700400, 41428800, 57754800, 73483200, 89204400, 104932800, 120654000, 126705600, 152103600, 162388800, 183553200, 199281600, 215607600, 230731200, 247057200, 262785600, 278506800, 294235200, 309956400, 325684800, 341406000, 357134400, 372855600, 388584000, 404910000, 420033600, 436359600, 439034400, 452088000, 467809200, 483537600, 499258800, 514987200, 530708400, 544622400, 562158000, 576072000, 594212400, 607521600, 625662000, 638971200, 657111600, 671025600, 688561200, 702475200, 720010800, 733924800, 752065200, 765374400, 783514800, 796824000, 814964400, 828878400, 846414000, 860328000, 877863600, 891777600, 909313200, 923227200, 941367600, 954676800, 972817200, 986126400, 1004266800, 1018180800, 1035716400, 1049630400, 1067166000, 1081080000, 1099220400, 1112529600, 1130670000, 1143979200, 1162119600, 1175428800, 1193569200, 1207483200, 1225018800, 1238932800, 1256468400, 1270382400, 1288522800, 1301832000, 1319972400, 1333281600, 1351422000, 1365336000, 1382871600, 1396785600, 1414321200, 1428235200, 1445770800, 1459684800, 1477825200, 1491134400, 1509274800, 1522584000, 1540724400, 1554638400, 1572174000, 1586088000, 1603623600, 1617537600, 1635678000, 1648987200, 1667127600, 1680436800, 1698577200, 1712491200, 1730026800, 1743940800, 1761476400, 1775390400, 1792926000, 1806840000, 1824980400, 1838289600, 1856430000, 1869739200, 1887879600, 1901793600, 1919329200, 1933243200, 1950778800, 1964692800, 1982833200, 1996142400, 2014282800, 2027592000, 2045732400, 2059041600, 2077182000, 2091096000, 2108631600, 2122545600, 2140081200], '\000\001\000\001\002\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003\004\003', [(-32400, 1, 0), (-36000, 0, 5), (-32400, 1, 10), (-36000, 0, 15), (-32400, 1, 20)], 'AHDT\000AHST\000AHWT\000HAST\000HADT\000'), 'Canada/Atlantic': ('Canada/Atlantic', 138, 2, [-21492000, -5770800, 9957600, 25678800, 41407200, 57733200, 73461600, 89182800, 104911200, 120632400, 136360800, 152082000, 167810400, 183531600, 199260000, 215586000, 230709600, 247035600, 262764000, 278485200, 294213600, 309934800, 325663200, 341384400, 357112800, 372834000, 388562400, 404888400, 420012000, 436338000, 452066400, 467787600, 483516000, 499237200, 514965600, 530686800, 544600800, 562136400, 576050400, 594190800, 607500000, 625640400, 638949600, 657090000, 671004000, 688539600, 702453600, 719989200, 733903200, 752043600, 765352800, 783493200, 796802400, 814942800, 828856800, 846392400, 860306400, 877842000, 891756000, 909291600, 923205600, 941346000, 954655200, 972795600, 986104800, 1004245200, 1018159200, 1035694800, 1049608800, 1067144400, 1081058400, 1099198800, 1112508000, 1130648400, 1143957600, 1162098000, 1175407200, 1193547600, 1207461600, 1224997200, 1238911200, 1256446800, 1270360800, 1288501200, 1301810400, 1319950800, 1333260000, 1351400400, 1365314400, 1382850000, 1396764000, 1414299600, 1428213600, 1445749200, 1459663200, 1477803600, 1491112800, 1509253200, 1522562400, 1540702800, 1554616800, 1572152400, 1586066400, 1603602000, 1617516000, 1635656400, 1648965600, 1667106000, 1680415200, 1698555600, 1712469600, 1730005200, 1743919200, 1761454800, 1775368800, 1792904400, 1806818400, 1824958800, 1838268000, 1856408400, 1869717600, 1887858000, 1901772000, 1919307600, 1933221600, 1950757200, 1964671200, 1982811600, 1996120800, 2014261200, 2027570400, 2045710800, 2059020000, 2077160400, 2091074400, 2108610000, 2122524000, 2140059600], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-10800, 1, 0), (-14400, 0, 4)], 'ADT\000AST\000'), 'Mexico/General': ('Mexico/General', 0, 1, [], '', [(-21600, 0, 0)], 'CST\000'), 'Greenwich': ('Greenwich', 0, 1, [], '', [(0, 0, 0)], 'GMT\000'), 'Egypt': ('Egypt', 152, 2, [-305164800, -291949200, -273628800, -260413200, -242092800, -228877200, -210556800, -197341200, -178934400, -165718800, -147398400, -134182800, -115862400, -102646800, -84326400, -71110800, -52704000, -39488400, -21168000, -7952400, 10368000, 23583600, 41904000, 55119600, 73526400, 86742000, 105062400, 118278000, 136598400, 149814000, 168134400, 181350000, 199756800, 212972400, 231292800, 244508400, 262828800, 276044400, 294364800, 307580400, 325987200, 339202800, 420595200, 433810800, 452217600, 465433200, 483753600, 496969200, 515289600, 528505200, 546825600, 560041200, 578448000, 591663600, 609984000, 623199600, 641520000, 654735600, 673056000, 686271600, 704678400, 717894000, 736214400, 749430000, 767750400, 780966000, 799286400, 812502000, 830908800, 844124400, 862444800, 875660400, 893980800, 907196400, 925516800, 938732400, 957139200, 970354800, 988675200, 1001890800, 1020211200, 1033426800, 1051747200, 1064962800, 1083369600, 1096585200, 1114905600, 1128121200, 1146441600, 1159657200, 1177977600, 1191193200, 1209600000, 1222815600, 1241136000, 1254351600, 1272672000, 1285887600, 1304208000, 1317423600, 1335830400, 1349046000, 1367366400, 1380582000, 1398902400, 1412118000, 1430438400, 1443654000, 1462060800, 1475276400, 1493596800, 1506812400, 1525132800, 1538348400, 1556668800, 1569884400, 1588291200, 1601506800, 1619827200, 1633042800, 1651363200, 1664578800, 1682899200, 1696114800, 1714521600, 1727737200, 1746057600, 1759273200, 1777593600, 1790809200, 1809129600, 1822345200, 1840752000, 1853967600, 1872288000, 1885503600, 1903824000, 1917039600, 1935360000, 1948575600, 1966982400, 1980198000, 1998518400, 2011734000, 2030054400, 2043270000, 2061590400, 2074806000, 2093212800, 2106428400, 2124748800, 2137964400], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(10800, 1, 0), (7200, 0, 8)], 'EET DST\000EET\000'), 'US/Eastern': ('US/Eastern', 148, 3, [-1633280400, -1615140000, -1601830800, -1583690400, -880218000, -765396000, -84387600, -68666400, -52938000, -37216800, -21488400, -5767200, 9961200, 25682400, 41410800, 57736800, 73465200, 89186400, 104914800, 120636000, 126687600, 152085600, 162370800, 183535200, 199263600, 215589600, 230713200, 247039200, 262767600, 278488800, 294217200, 309938400, 325666800, 341388000, 357116400, 372837600, 388566000, 404892000, 420015600, 436341600, 452070000, 467791200, 483519600, 499240800, 514969200, 530690400, 544604400, 562140000, 576054000, 594194400, 607503600, 625644000, 638953200, 657093600, 671007600, 688543200, 702457200, 719992800, 733906800, 752047200, 765356400, 783496800, 796806000, 814946400, 828860400, 846396000, 860310000, 877845600, 891759600, 909295200, 923209200, 941349600, 954658800, 972799200, 986108400, 1004248800, 1018162800, 1035698400, 1049612400, 1067148000, 1081062000, 1099202400, 1112511600, 1130652000, 1143961200, 1162101600, 1175410800, 1193551200, 1207465200, 1225000800, 1238914800, 1256450400, 1270364400, 1288504800, 1301814000, 1319954400, 1333263600, 1351404000, 1365318000, 1382853600, 1396767600, 1414303200, 1428217200, 1445752800, 1459666800, 1477807200, 1491116400, 1509256800, 1522566000, 1540706400, 1554620400, 1572156000, 1586070000, 1603605600, 1617519600, 1635660000, 1648969200, 1667109600, 1680418800, 1698559200, 1712473200, 1730008800, 1743922800, 1761458400, 1775372400, 1792908000, 1806822000, 1824962400, 1838271600, 1856412000, 1869721200, 1887861600, 1901775600, 1919311200, 1933225200, 1950760800, 1964674800, 1982815200, 1996124400, 2014264800, 2027574000, 2045714400, 2059023600, 2077164000, 2091078000, 2108613600, 2122527600, 2140063200], '\000\001\000\001\002\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-14400, 1, 0), (-18000, 0, 4), (-14400, 1, 8)], 'EDT\000EST\000EWT\000'), 'Brazil/Acre': ('Brazil/Acre', 101, 2, [561970800, 571644000, 593420400, 603093600, 625561200, 634543200, 656924400, 665992800, 688374000, 697442400, 719823600, 729496800, 751273200, 760946400, 782722800, 792396000, 814863600, 823845600, 846226800, 855295200, 877676400, 887436000, 909126000, 918799200, 940575600, 950248800, 972716400, 981698400, 1004079600, 1013148000, 1035529200, 1044597600, 1066978800, 1076738400, 1098428400, 1108101600, 1129878000, 1139551200, 1162018800, 1171000800, 1193382000, 1202450400, 1224831600, 1234591200, 1256281200, 1265954400, 1287730800, 1297404000, 1319180400, 1328853600, 1351234800, 1360303200, 1382684400, 1391752800, 1414134000, 1423893600, 1445583600, 1455256800, 1477033200, 1486706400, 1509174000, 1518156000, 1540537200, 1549605600, 1571986800, 1581055200, 1603436400, 1613109600, 1634886000, 1644559200, 1666335600, 1676008800, 1698476400, 1707458400, 1729839600, 1738908000, 1761289200, 1771048800, 1792738800, 1802412000, 1824188400, 1833861600, 1856329200, 1865311200, 1887692400, 1896760800, 1919142000, 1928210400, 1950591600, 1960351200, 1982041200, 1991714400, 2013490800, 2023164000, 2045631600, 2054613600, 2076994800, 2086063200, 2108444400, 2118204000, 2139894000], '\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-18000, 0, 0), (-14400, 1, 4)], 'AST\000ADT\000'), 'US/Mountain': ('US/Mountain', 148, 3, [-1633273200, -1615132800, -1601823600, -1583683200, -880210800, -765388800, -84380400, -68659200, -52930800, -37209600, -21481200, -5760000, 9968400, 25689600, 41418000, 57744000, 73472400, 89193600, 104922000, 120643200, 126694800, 152092800, 162378000, 183542400, 199270800, 215596800, 230720400, 247046400, 262774800, 278496000, 294224400, 309945600, 325674000, 341395200, 357123600, 372844800, 388573200, 404899200, 420022800, 436348800, 452077200, 467798400, 483526800, 499248000, 514976400, 530697600, 544611600, 562147200, 576061200, 594201600, 607510800, 625651200, 638960400, 657100800, 671014800, 688550400, 702464400, 720000000, 733914000, 752054400, 765363600, 783504000, 796813200, 814953600, 828867600, 846403200, 860317200, 877852800, 891766800, 909302400, 923216400, 941356800, 954666000, 972806400, 986115600, 1004256000, 1018170000, 1035705600, 1049619600, 1067155200, 1081069200, 1099209600, 1112518800, 1130659200, 1143968400, 1162108800, 1175418000, 1193558400, 1207472400, 1225008000, 1238922000, 1256457600, 1270371600, 1288512000, 1301821200, 1319961600, 1333270800, 1351411200, 1365325200, 1382860800, 1396774800, 1414310400, 1428224400, 1445760000, 1459674000, 1477814400, 1491123600, 1509264000, 1522573200, 1540713600, 1554627600, 1572163200, 1586077200, 1603612800, 1617526800, 1635667200, 1648976400, 1667116800, 1680426000, 1698566400, 1712480400, 1730016000, 1743930000, 1761465600, 1775379600, 1792915200, 1806829200, 1824969600, 1838278800, 1856419200, 1869728400, 1887868800, 1901782800, 1919318400, 1933232400, 1950768000, 1964682000, 1982822400, 1996131600, 2014272000, 2027581200, 2045721600, 2059030800, 2077171200, 2091085200, 2108620800, 2122534800, 2140070400], '\000\001\000\001\002\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-21600, 1, 0), (-25200, 0, 4), (-21600, 1, 8)], 'MDT\000MST\000MWT\000'), 'US/Central': ('US/Central', 148, 3, [-1633276800, -1615136400, -1601827200, -1583686800, -880214400, -765392400, -84384000, -68662800, -52934400, -37213200, -21484800, -5763600, 9964800, 25686000, 41414400, 57740400, 73468800, 89190000, 104918400, 120639600, 126691200, 152089200, 162374400, 183538800, 199267200, 215593200, 230716800, 247042800, 262771200, 278492400, 294220800, 309942000, 325670400, 341391600, 357120000, 372841200, 388569600, 404895600, 420019200, 436345200, 452073600, 467794800, 483523200, 499244400, 514972800, 530694000, 544608000, 562143600, 576057600, 594198000, 607507200, 625647600, 638956800, 657097200, 671011200, 688546800, 702460800, 719996400, 733910400, 752050800, 765360000, 783500400, 796809600, 814950000, 828864000, 846399600, 860313600, 877849200, 891763200, 909298800, 923212800, 941353200, 954662400, 972802800, 986112000, 1004252400, 1018166400, 1035702000, 1049616000, 1067151600, 1081065600, 1099206000, 1112515200, 1130655600, 1143964800, 1162105200, 1175414400, 1193554800, 1207468800, 1225004400, 1238918400, 1256454000, 1270368000, 1288508400, 1301817600, 1319958000, 1333267200, 1351407600, 1365321600, 1382857200, 1396771200, 1414306800, 1428220800, 1445756400, 1459670400, 1477810800, 1491120000, 1509260400, 1522569600, 1540710000, 1554624000, 1572159600, 1586073600, 1603609200, 1617523200, 1635663600, 1648972800, 1667113200, 1680422400, 1698562800, 1712476800, 1730012400, 1743926400, 1761462000, 1775376000, 1792911600, 1806825600, 1824966000, 1838275200, 1856415600, 1869724800, 1887865200, 1901779200, 1919314800, 1933228800, 1950764400, 1964678400, 1982818800, 1996128000, 2014268400, 2027577600, 2045718000, 2059027200, 2077167600, 2091081600, 2108617200, 2122531200, 2140066800], '\000\001\000\001\002\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-18000, 1, 0), (-21600, 0, 4), (-18000, 1, 8)], 'CDT\000CST\000CWT\000'), 'US/Hawaii': ('US/Hawaii', 9, 4, [-1633260600, -1615120200, -1601811000, -1583670600, -1157283000, -1157200200, -880198200, -765376200, -712150200], '\000\001\000\001\000\001\002\001\003', [(-34200, 1, 0), (-37800, 0, 4), (-34200, 1, 8), (-36000, 0, 4)], 'HDT\000HST\000HWT\000'), 'US/Arizona': ('US/Arizona', 6, 3, [-1633273200, -1615132800, -1601823600, -1583683200, -880210800, -765388800], '\000\001\000\001\002\001', [(-21600, 1, 0), (-25200, 0, 4), (-21600, 1, 8)], 'MDT\000MST\000MWT\000'), 'Jamaica': ('Jamaica', 148, 3, [-1633280400, -1615140000, -1601830800, -1583690400, -880218000, -765396000, -84387600, -68666400, -52938000, -37216800, -21488400, -5767200, 9961200, 25682400, 41410800, 57736800, 73465200, 89186400, 104914800, 120636000, 126687600, 152085600, 162370800, 183535200, 199263600, 215589600, 230713200, 247039200, 262767600, 278488800, 294217200, 309938400, 325666800, 341388000, 357116400, 372837600, 388566000, 404892000, 420015600, 436341600, 452070000, 467791200, 483519600, 499240800, 514969200, 530690400, 544604400, 562140000, 576054000, 594194400, 607503600, 625644000, 638953200, 657093600, 671007600, 688543200, 702457200, 719992800, 733906800, 752047200, 765356400, 783496800, 796806000, 814946400, 828860400, 846396000, 860310000, 877845600, 891759600, 909295200, 923209200, 941349600, 954658800, 972799200, 986108400, 1004248800, 1018162800, 1035698400, 1049612400, 1067148000, 1081062000, 1099202400, 1112511600, 1130652000, 1143961200, 1162101600, 1175410800, 1193551200, 1207465200, 1225000800, 1238914800, 1256450400, 1270364400, 1288504800, 1301814000, 1319954400, 1333263600, 1351404000, 1365318000, 1382853600, 1396767600, 1414303200, 1428217200, 1445752800, 1459666800, 1477807200, 1491116400, 1509256800, 1522566000, 1540706400, 1554620400, 1572156000, 1586070000, 1603605600, 1617519600, 1635660000, 1648969200, 1667109600, 1680418800, 1698559200, 1712473200, 1730008800, 1743922800, 1761458400, 1775372400, 1792908000, 1806822000, 1824962400, 1838271600, 1856412000, 1869721200, 1887861600, 1901775600, 1919311200, 1933225200, 1950760800, 1964674800, 1982815200, 1996124400, 2014264800, 2027574000, 2045714400, 2059023600, 2077164000, 2091078000, 2108613600, 2122527600, 2140063200], '\000\001\000\001\002\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-14400, 1, 0), (-18000, 0, 4), (-14400, 1, 8)], 'EDT\000EST\000EWT\000'), 'Poland': ('Poland', 104, 2, [512524800, 528249600, 543974400, 559699200, 575424000, 591148800, 606873600, 622598400, 638323200, 654652800, 670377600, 686102400, 701827200, 717552000, 733276800, 749001600, 764726400, 780451200, 796176000, 811900800, 828230400, 843955200, 859680000, 875404800, 891129600, 906854400, 922579200, 938304000, 954028800, 969753600, 985478400, 1001808000, 1017532800, 1033257600, 1048982400, 1064707200, 1080432000, 1096156800, 1111881600, 1127606400, 1143331200, 1159056000, 1174780800, 1191110400, 1206835200, 1222560000, 1238284800, 1254009600, 1269734400, 1285459200, 1301184000, 1316908800, 1332633600, 1348963200, 1364688000, 1380412800, 1396137600, 1411862400, 1427587200, 1443312000, 1459036800, 1474761600, 1490486400, 1506211200, 1521936000, 1538265600, 1553990400, 1569715200, 1585440000, 1601164800, 1616889600, 1632614400, 1648339200, 1664064000, 1679788800, 1695513600, 1711843200, 1727568000, 1743292800, 1759017600, 1774742400, 1790467200, 1806192000, 1821916800, 1837641600, 1853366400, 1869091200, 1885420800, 1901145600, 1916870400, 1932595200, 1948320000, 1964044800, 1979769600, 1995494400, 2011219200, 2026944000, 2042668800, 2058393600, 2074723200, 2090448000, 2106172800, 2121897600, 2137622400], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(7200, 1, 0), (3600, 0, 8)], 'MET DST\000MET\000'), 'Canada/East-Saskatchewan': ('Canada/East-Saskatchewan', 0, 1, [], '', [(-21600, 0, 0)], 'CST\000'), 'US/Alaska': ('US/Alaska', 148, 3, [-1633266000, -1615125600, -1601816400, -1583676000, -880203600, -765381600, -84373200, -68652000, -52923600, -37202400, -21474000, -5752800, 9975600, 25696800, 41425200, 57751200, 73479600, 89200800, 104929200, 120650400, 126702000, 152100000, 162385200, 183549600, 199278000, 215604000, 230727600, 247053600, 262782000, 278503200, 294231600, 309952800, 325681200, 341402400, 357130800, 372852000, 388580400, 404906400, 420030000, 436356000, 452084400, 467805600, 483534000, 499255200, 514983600, 530704800, 544618800, 562154400, 576068400, 594208800, 607518000, 625658400, 638967600, 657108000, 671022000, 688557600, 702471600, 720007200, 733921200, 752061600, 765370800, 783511200, 796820400, 814960800, 828874800, 846410400, 860324400, 877860000, 891774000, 909309600, 923223600, 941364000, 954673200, 972813600, 986122800, 1004263200, 1018177200, 1035712800, 1049626800, 1067162400, 1081076400, 1099216800, 1112526000, 1130666400, 1143975600, 1162116000, 1175425200, 1193565600, 1207479600, 1225015200, 1238929200, 1256464800, 1270378800, 1288519200, 1301828400, 1319968800, 1333278000, 1351418400, 1365332400, 1382868000, 1396782000, 1414317600, 1428231600, 1445767200, 1459681200, 1477821600, 1491130800, 1509271200, 1522580400, 1540720800, 1554634800, 1572170400, 1586084400, 1603620000, 1617534000, 1635674400, 1648983600, 1667124000, 1680433200, 1698573600, 1712487600, 1730023200, 1743937200, 1761472800, 1775386800, 1792922400, 1806836400, 1824976800, 1838286000, 1856426400, 1869735600, 1887876000, 1901790000, 1919325600, 1933239600, 1950775200, 1964689200, 1982829600, 1996138800, 2014279200, 2027588400, 2045728800, 2059038000, 2077178400, 2091092400, 2108628000, 2122542000, 2140077600], '\000\001\000\001\002\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-28800, 1, 0), (-32400, 0, 5), (-28800, 1, 10)], 'AKDT\000AKST\000AKWT\000'), 'Canada/Mountain': ('Canada/Mountain', 138, 2, [-21481200, -5760000, 9968400, 25689600, 41418000, 57744000, 73472400, 89193600, 104922000, 120643200, 136371600, 152092800, 167821200, 183542400, 199270800, 215596800, 230720400, 247046400, 262774800, 278496000, 294224400, 309945600, 325674000, 341395200, 357123600, 372844800, 388573200, 404899200, 420022800, 436348800, 452077200, 467798400, 483526800, 499248000, 514976400, 530697600, 544611600, 562147200, 576061200, 594201600, 607510800, 625651200, 638960400, 657100800, 671014800, 688550400, 702464400, 720000000, 733914000, 752054400, 765363600, 783504000, 796813200, 814953600, 828867600, 846403200, 860317200, 877852800, 891766800, 909302400, 923216400, 941356800, 954666000, 972806400, 986115600, 1004256000, 1018170000, 1035705600, 1049619600, 1067155200, 1081069200, 1099209600, 1112518800, 1130659200, 1143968400, 1162108800, 1175418000, 1193558400, 1207472400, 1225008000, 1238922000, 1256457600, 1270371600, 1288512000, 1301821200, 1319961600, 1333270800, 1351411200, 1365325200, 1382860800, 1396774800, 1414310400, 1428224400, 1445760000, 1459674000, 1477814400, 1491123600, 1509264000, 1522573200, 1540713600, 1554627600, 1572163200, 1586077200, 1603612800, 1617526800, 1635667200, 1648976400, 1667116800, 1680426000, 1698566400, 1712480400, 1730016000, 1743930000, 1761465600, 1775379600, 1792915200, 1806829200, 1824969600, 1838278800, 1856419200, 1869728400, 1887868800, 1901782800, 1919318400, 1933232400, 1950768000, 1964682000, 1982822400, 1996131600, 2014272000, 2027581200, 2045721600, 2059030800, 2077171200, 2091085200, 2108620800, 2122534800, 2140070400], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-21600, 1, 0), (-25200, 0, 4)], 'MDT\000MST\000'), 'Universal': ('Universal', 0, 1, [], '', [(0, 0, 0)], 'GMT\000'), 'US/East-Indiana': ('US/East-Indiana', 6, 3, [-1633280400, -1615140000, -1601830800, -1583690400, -880218000, -765396000], '\000\001\000\001\002\001', [(-14400, 1, 0), (-18000, 0, 4), (-14400, 1, 8)], 'EDT\000EST\000EWT\000'), 'GMT+12': ('GMT+12', 0, 1, [], '', [(43200, 0, 0)], 'GMT+1200\000'), 'GMT+13': ('GMT+13', 0, 1, [], '', [(46800, 0, 0)], 'GMT+1300\000'), 'GMT+10': ('GMT+10', 0, 1, [], '', [(36000, 0, 0)], 'GMT+1000\000'), 'GMT+11': ('GMT+11', 0, 1, [], '', [(39600, 0, 0)], 'GMT+1100\000'), 'Canada/Yukon': ('Canada/Yukon', 138, 2, [-21474000, -5752800, 9975600, 25696800, 41425200, 57751200, 73479600, 89200800, 104929200, 120650400, 136378800, 152100000, 167828400, 183549600, 199278000, 215604000, 230727600, 247053600, 262782000, 278503200, 294231600, 309952800, 325681200, 341402400, 357130800, 372852000, 388580400, 404906400, 420030000, 436356000, 452084400, 467805600, 483534000, 499255200, 514983600, 530704800, 544618800, 562154400, 576068400, 594208800, 607518000, 625658400, 638967600, 657108000, 671022000, 688557600, 702471600, 720007200, 733921200, 752061600, 765370800, 783511200, 796820400, 814960800, 828874800, 846410400, 860324400, 877860000, 891774000, 909309600, 923223600, 941364000, 954673200, 972813600, 986122800, 1004263200, 1018177200, 1035712800, 1049626800, 1067162400, 1081076400, 1099216800, 1112526000, 1130666400, 1143975600, 1162116000, 1175425200, 1193565600, 1207479600, 1225015200, 1238929200, 1256464800, 1270378800, 1288519200, 1301828400, 1319968800, 1333278000, 1351418400, 1365332400, 1382868000, 1396782000, 1414317600, 1428231600, 1445767200, 1459681200, 1477821600, 1491130800, 1509271200, 1522580400, 1540720800, 1554634800, 1572170400, 1586084400, 1603620000, 1617534000, 1635674400, 1648983600, 1667124000, 1680433200, 1698573600, 1712487600, 1730023200, 1743937200, 1761472800, 1775386800, 1792922400, 1806836400, 1824976800, 1838286000, 1856426400, 1869735600, 1887876000, 1901790000, 1919325600, 1933239600, 1950775200, 1964689200, 1982829600, 1996138800, 2014279200, 2027588400, 2045728800, 2059038000, 2077178400, 2091092400, 2108628000, 2122542000, 2140077600], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-28800, 1, 0), (-32400, 0, 4)], 'YDT\000YST\000'), 'Iceland': ('Iceland', 0, 1, [], '', [(0, 0, 0)], 'WET\000'), 'Canada/Eastern': ('Canada/Eastern', 138, 2, [-21488400, -5767200, 9961200, 25682400, 41410800, 57736800, 73465200, 89186400, 104914800, 120636000, 136364400, 152085600, 167814000, 183535200, 199263600, 215589600, 230713200, 247039200, 262767600, 278488800, 294217200, 309938400, 325666800, 341388000, 357116400, 372837600, 388566000, 404892000, 420015600, 436341600, 452070000, 467791200, 483519600, 499240800, 514969200, 530690400, 544604400, 562140000, 576054000, 594194400, 607503600, 625644000, 638953200, 657093600, 671007600, 688543200, 702457200, 719992800, 733906800, 752047200, 765356400, 783496800, 796806000, 814946400, 828860400, 846396000, 860310000, 877845600, 891759600, 909295200, 923209200, 941349600, 954658800, 972799200, 986108400, 1004248800, 1018162800, 1035698400, 1049612400, 1067148000, 1081062000, 1099202400, 1112511600, 1130652000, 1143961200, 1162101600, 1175410800, 1193551200, 1207465200, 1225000800, 1238914800, 1256450400, 1270364400, 1288504800, 1301814000, 1319954400, 1333263600, 1351404000, 1365318000, 1382853600, 1396767600, 1414303200, 1428217200, 1445752800, 1459666800, 1477807200, 1491116400, 1509256800, 1522566000, 1540706400, 1554620400, 1572156000, 1586070000, 1603605600, 1617519600, 1635660000, 1648969200, 1667109600, 1680418800, 1698559200, 1712473200, 1730008800, 1743922800, 1761458400, 1775372400, 1792908000, 1806822000, 1824962400, 1838271600, 1856412000, 1869721200, 1887861600, 1901775600, 1919311200, 1933225200, 1950760800, 1964674800, 1982815200, 1996124400, 2014264800, 2027574000, 2045714400, 2059023600, 2077164000, 2091078000, 2108613600, 2122527600, 2140063200], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-14400, 1, 0), (-18000, 0, 4)], 'EDT\000EST\000'), 'Canada/Pacific': ('Canada/Pacific', 138, 2, [-21477600, -5756400, 9972000, 25693200, 41421600, 57747600, 73476000, 89197200, 104925600, 120646800, 136375200, 152096400, 167824800, 183546000, 199274400, 215600400, 230724000, 247050000, 262778400, 278499600, 294228000, 309949200, 325677600, 341398800, 357127200, 372848400, 388576800, 404902800, 420026400, 436352400, 452080800, 467802000, 483530400, 499251600, 514980000, 530701200, 544615200, 562150800, 576064800, 594205200, 607514400, 625654800, 638964000, 657104400, 671018400, 688554000, 702468000, 720003600, 733917600, 752058000, 765367200, 783507600, 796816800, 814957200, 828871200, 846406800, 860320800, 877856400, 891770400, 909306000, 923220000, 941360400, 954669600, 972810000, 986119200, 1004259600, 1018173600, 1035709200, 1049623200, 1067158800, 1081072800, 1099213200, 1112522400, 1130662800, 1143972000, 1162112400, 1175421600, 1193562000, 1207476000, 1225011600, 1238925600, 1256461200, 1270375200, 1288515600, 1301824800, 1319965200, 1333274400, 1351414800, 1365328800, 1382864400, 1396778400, 1414314000, 1428228000, 1445763600, 1459677600, 1477818000, 1491127200, 1509267600, 1522576800, 1540717200, 1554631200, 1572166800, 1586080800, 1603616400, 1617530400, 1635670800, 1648980000, 1667120400, 1680429600, 1698570000, 1712484000, 1730019600, 1743933600, 1761469200, 1775383200, 1792918800, 1806832800, 1824973200, 1838282400, 1856422800, 1869732000, 1887872400, 1901786400, 1919322000, 1933236000, 1950771600, 1964685600, 1982826000, 1996135200, 2014275600, 2027584800, 2045725200, 2059034400, 2077174800, 2091088800, 2108624400, 2122538400, 2140074000], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-25200, 1, 0), (-28800, 0, 4)], 'PDT\000PST\000'), 'Mexico/BajaNorte': ('Mexico/BajaNorte', 102, 2, [544615200, 562150800, 576064800, 594205200, 607514400, 625654800, 638964000, 657104400, 671018400, 688554000, 702468000, 720003600, 733917600, 752058000, 765367200, 783507600, 796816800, 814957200, 828871200, 846406800, 860320800, 877856400, 891770400, 909306000, 923220000, 941360400, 954669600, 972810000, 986119200, 1004259600, 1018173600, 1035709200, 1049623200, 1067158800, 1081072800, 1099213200, 1112522400, 1130662800, 1143972000, 1162112400, 1175421600, 1193562000, 1207476000, 1225011600, 1238925600, 1256461200, 1270375200, 1288515600, 1301824800, 1319965200, 1333274400, 1351414800, 1365328800, 1382864400, 1396778400, 1414314000, 1428228000, 1445763600, 1459677600, 1477818000, 1491127200, 1509267600, 1522576800, 1540717200, 1554631200, 1572166800, 1586080800, 1603616400, 1617530400, 1635670800, 1648980000, 1667120400, 1680429600, 1698570000, 1712484000, 1730019600, 1743933600, 1761469200, 1775383200, 1792918800, 1806832800, 1824973200, 1838282400, 1856422800, 1869732000, 1887872400, 1901786400, 1919322000, 1933236000, 1950771600, 1964685600, 1982826000, 1996135200, 2014275600, 2027584800, 2045725200, 2059034400, 2077174800, 2091088800, 2108624400, 2122538400, 2140074000], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-25200, 1, 0), (-28800, 0, 4)], 'PDT\000PST\000'), 'Canada/Central': ('Canada/Central', 138, 2, [-21484800, -5763600, 9964800, 25686000, 41414400, 57740400, 73468800, 89190000, 104918400, 120639600, 136368000, 152089200, 167817600, 183538800, 199267200, 215593200, 230716800, 247042800, 262771200, 278492400, 294220800, 309942000, 325670400, 341391600, 357120000, 372841200, 388569600, 404895600, 420019200, 436345200, 452073600, 467794800, 483523200, 499244400, 514972800, 530694000, 544608000, 562143600, 576057600, 594198000, 607507200, 625647600, 638956800, 657097200, 671011200, 688546800, 702460800, 719996400, 733910400, 752050800, 765360000, 783500400, 796809600, 814950000, 828864000, 846399600, 860313600, 877849200, 891763200, 909298800, 923212800, 941353200, 954662400, 972802800, 986112000, 1004252400, 1018166400, 1035702000, 1049616000, 1067151600, 1081065600, 1099206000, 1112515200, 1130655600, 1143964800, 1162105200, 1175414400, 1193554800, 1207468800, 1225004400, 1238918400, 1256454000, 1270368000, 1288508400, 1301817600, 1319958000, 1333267200, 1351407600, 1365321600, 1382857200, 1396771200, 1414306800, 1428220800, 1445756400, 1459670400, 1477810800, 1491120000, 1509260400, 1522569600, 1540710000, 1554624000, 1572159600, 1586073600, 1603609200, 1617523200, 1635663600, 1648972800, 1667113200, 1680422400, 1698562800, 1712476800, 1730012400, 1743926400, 1761462000, 1775376000, 1792911600, 1806825600, 1824966000, 1838275200, 1856415600, 1869724800, 1887865200, 1901779200, 1919314800, 1933228800, 1950764400, 1964678400, 1982818800, 1996128000, 2014268400, 2027577600, 2045718000, 2059027200, 2077167600, 2091081600, 2108617200, 2122531200, 2140066800], '\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-18000, 1, 0), (-21600, 0, 4)], 'CDT\000CST\000'), 'US/Michigan': ('US/Michigan', 138, 3, [-1633280400, -1615140000, -1601830800, -1583690400, -880218000, -765396000, -84387600, -68666400, 104914800, 120636000, 126687600, 152085600, 162370800, 183535200, 199263600, 215589600, 230713200, 247039200, 262767600, 278488800, 294217200, 309938400, 325666800, 341388000, 357116400, 372837600, 388566000, 404892000, 420015600, 436341600, 452070000, 467791200, 483519600, 499240800, 514969200, 530690400, 544604400, 562140000, 576054000, 594194400, 607503600, 625644000, 638953200, 657093600, 671007600, 688543200, 702457200, 719992800, 733906800, 752047200, 765356400, 783496800, 796806000, 814946400, 828860400, 846396000, 860310000, 877845600, 891759600, 909295200, 923209200, 941349600, 954658800, 972799200, 986108400, 1004248800, 1018162800, 1035698400, 1049612400, 1067148000, 1081062000, 1099202400, 1112511600, 1130652000, 1143961200, 1162101600, 1175410800, 1193551200, 1207465200, 1225000800, 1238914800, 1256450400, 1270364400, 1288504800, 1301814000, 1319954400, 1333263600, 1351404000, 1365318000, 1382853600, 1396767600, 1414303200, 1428217200, 1445752800, 1459666800, 1477807200, 1491116400, 1509256800, 1522566000, 1540706400, 1554620400, 1572156000, 1586070000, 1603605600, 1617519600, 1635660000, 1648969200, 1667109600, 1680418800, 1698559200, 1712473200, 1730008800, 1743922800, 1761458400, 1775372400, 1792908000, 1806822000, 1824962400, 1838271600, 1856412000, 1869721200, 1887861600, 1901775600, 1919311200, 1933225200, 1950760800, 1964674800, 1982815200, 1996124400, 2014264800, 2027574000, 2045714400, 2059023600, 2077164000, 2091078000, 2108613600, 2122527600, 2140063200], '\000\001\000\001\002\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001\000\001', [(-14400, 1, 0), (-18000, 0, 4), (-14400, 1, 8)], 'EDT\000EST\000EWT\000'),'GMT+0': ('GMT+0', 0, 1, [], '', [(0, 0, 0)], 'GMT+0000\000'), 'GMT+0930': ('GMT+0930', 0, 1, [], '', [(34200, 0, 0)], 'GMT+0930\000')} Zope-2.0.1-ZEO-nonbin/lib/python/DateTime/Setup100644 1007 1403 62 6312315346 21053 0ustar petrillipetrilli# install DateTime.py # install DateTimeZone.py Zope-2.0.1-ZEO-nonbin/lib/python/DateTime/__init__.py100644 1007 1403 7370 6671334610 22215 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## from DateTime import DateTime Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/ 40755 1007 1403 0 6772126757 21573 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/.cvsignore100644 1007 1403 71 6676003530 23610 0ustar petrillipetrilliconfig.c sedscript Makefile Makefile.pre Makefile.pre.in Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_HTML.py100644 1007 1403 30614 6761251434 23406 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """HTML formated DocumentTemplates $Id: DT_HTML.py,v 1.22 1999/08/26 14:45:48 jim Exp $""" from DT_String import String, FileMixin import DT_String, regex from DT_Util import ParseError, str from string import strip, find, split, join, rfind class dtml_re_class: def search(self, text, start=0, name_match=regex.compile('[\0- ]*[a-zA-Z]+[\0- ]*').match, end_match=regex.compile('[\0- ]*\(/\|end\)', regex.casefold).match, start_search=regex.compile('[<&]').search, ent_name=regex.compile('[-a-zA-Z0-9_.]+').match, find=find, strip=strip ): while 1: s=start_search(text, start) if s < 0: return -1 if text[s:s+5] == '',n) if e < 0: return -1 en=3 l=end_match(text,n) if l > 0: end=strip(text[n:n+l]) n=n+l else: end='' elif text[s:s+6] == '',e+1) if e < 0: return -1 if len(split(text[n:e],'"'))%2: # check for even number of "s inside break en=1 end='' elif text[s:s+7] == '',e+1) if e < 0: return -1 if len(split(text[n:e],'"'))%2: # check for even number of "s inside break en=1 end='/' else: if text[s:s+6] == '&dtml-': n=s+6 while 1: e=find(text,';',n) if e < 0: break args=text[n:e] if ent_name(args) < 0: break d=self.__dict__ d[0]=text[s:e+1] d[1]=d['end']='' d[2]=d['name']='var' d[3]=d['args']=args+' html_quote' return s start=s+1 continue break l=name_match(text,n) if l < 0: return l a=n+l name=strip(text[n:a]) args=strip(text[a:e]) d=self.__dict__ d[0]=text[s:e+en] d[1]=d['end']=end d[2]=d['name']=name d[3]=d['args']=args return s def group(self, *args): get=self.__dict__.get if len(args)==1: return get(args[0]) return tuple(map(get, args)) class HTML(DT_String.String): """HTML Document Templates HTML Document templates use HTML server-side-include syntax, rather than Python format-string syntax. Here's a simple example: HTML document templates quote HTML tags in source when the template is converted to a string. This is handy when templates are inserted into HTML editing forms. """ def tagre(self): return dtml_re_class() def parseTag(self, tagre, command=None, sargs=''): """Parse a tag using an already matched re Return: tag, args, command, coname where: tag is the tag, args is the tag\'s argument string, command is a corresponding command info structure if the tag is a start tag, or None otherwise, and coname is the name of a continue tag (e.g. else) or None otherwise """ tag, end, name, args, =tagre.group(0, 'end', 'name', 'args') args=strip(args) if end: if not command or name != command.name: raise ParseError, ('unexpected end tag', tag) return tag, args, None, None if command and name in command.blockContinuations: if name=='else' and args: # Waaaaaah! Have to special case else because of # old else start tag usage. Waaaaaaah! l=len(args) if not (args==sargs or args==sargs[:l] and sargs[l:l+1] in ' \t\n'): return tag, args, self.commands[name], None return tag, args, None, name try: return tag, args, self.commands[name], None except KeyError: raise ParseError, ('Unexpected tag', tag) def SubTemplate(self, name): return HTML('', __name__=name) def varExtra(self,tagre): return 's' def manage_edit(self,data,REQUEST=None): 'edit a template' self.munge(data) if REQUEST: return self.editConfirmation(self,REQUEST) def quotedHTML(self, text=None, character_entities=( (('&'), '&'), (("<"), '<' ), ((">"), '>' ), (('"'), '"'))): #" if text is None: text=self.read_raw() for re,name in character_entities: if find(text, re) >= 0: text=join(split(text,re),name) return text errQuote=quotedHTML def __str__(self): return self.quotedHTML() def management_interface(self): '''Hook to allow public execution of management interface with everything else private.''' return self def manage_editForm(self, URL1, REQUEST): '''Display doc template editing form''' #" return self._manage_editForm( self, mapping=REQUEST, __str__=str(self), URL1=URL1 ) manage_editDocument=manage=manage_editForm class HTMLDefault(HTML): '''\ HTML document templates that edit themselves through copy. This is to make a distinction from HTML objects that should edit themselves in place. ''' copy_class=HTML def manage_edit(self,data,PARENTS,URL1,REQUEST): 'edit a template' newHTML=self.copy_class(data,self.globals,self.__name__) setattr(PARENTS[1],URL1[rfind(URL1,'/')+1:],newHTML) return self.editConfirmation(self,REQUEST) class HTMLFile(FileMixin, HTML): """\ HTML Document templates read from files. If the object is pickled, the file name, rather than the file contents is pickled. When the object is unpickled, then the file will be re-read to obtain the string. Note that the file will not be read until the document template is used the first time. """ def manage_default(self, REQUEST=None): 'Revert to factory defaults' if self.edited_source: self.edited_source='' self._v_cooked=self.cook() if REQUEST: return self.editConfirmation(self,REQUEST) def manage_editForm(self, URL1, REQUEST): '''Display doc template editing form''' return self._manage_editForm(mapping=REQUEST, document_template_edit_width= self.document_template_edit_width, document_template_edit_header= self.document_template_edit_header, document_template_form_header= self.document_template_form_header, document_template_edit_footer= self.document_template_edit_footer, URL1=URL1, __str__=str(self), FactoryDefaultString=FactoryDefaultString, ) manage_editDocument=manage=manage_editForm def manage_edit(self,data, PARENTS=[],URL1='',URL2='',REQUEST='', SUBMIT=''): 'edit a template' if SUBMIT==FactoryDefaultString: return self.manage_default(REQUEST) if find(data,'\r'): data=join(split(data,'\r\n'),'\n\r') data=join(split(data,'\n\r'),'\n') if self.edited_source: self.edited_source=data self._v_cooked=self.cook() else: __traceback_info__=self.__class__ newHTML=self.__class__() newHTML.__setstate__(self.__getstate__()) newHTML.edited_source=data setattr(PARENTS[1],URL1[rfind(URL1,'/')+1:],newHTML) if REQUEST: return self.editConfirmation(self,REQUEST) Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_If.py100644 1007 1403 16340 6671334613 23201 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Conditional insertion Conditional insertion is performed using 'if' and 'else' commands. To include text when an object is true using the EPFS format, use:: %(if name)[ text %(if name)] To include text when an object is true using the HTML format, use:: text where 'name' is the name bound to the object. To include text when an object is false using the EPFS format, use:: %(else name)[ text %(else name)] To include text when an object is false using the HTML format, use:: text Finally to include text when an object is true and to include different text when the object is false using the EPFS format, use:: %(if name)[ true text %(if name)] %(else name)[ false text %(else name)] and to include text when an object is true and to include different text when the object is false using the HTML format, use:: true text false text Notes: - if a variable is nor defined, it is considered to be false. - A variable if only evaluated once in an 'if' tag. If the value is used inside the tag, including in enclosed tags, the variable is not reevaluated. ''' __rcs_id__='$Id: DT_If.py,v 1.16 1999/03/10 00:15:07 klm Exp $' __version__='$Revision: 1.16 $'[11:-2] from DT_Util import ParseError, parse_params, name_param, str class If: blockContinuations='else','elif' name='if' elses=None expr='' def __init__(self, blocks): tname, args, section = blocks[0] args=parse_params(args, name='', expr='') name,expr=name_param(args,'if',1) self.__name__= name if expr is None: cond=name else: cond=expr.eval sections=[cond, section.blocks] if blocks[-1][0]=='else': tname, args, section = blocks[-1] del blocks[-1] args=parse_params(args, name='') if args: ename,expr=name_param(args,'else',1) if ename != name: raise ParseError, ('name in else does not match if', 'in') elses=section.blocks else: elses=None for tname, args, section in blocks[1:]: if tname=='else': raise ParseError, ( 'more than one else tag for a single if tag', 'in') args=parse_params(args, name='', expr='') name,expr=name_param(args,'elif',1) if expr is None: cond=name else: cond=expr.eval sections.append(cond) sections.append(section.blocks) if elses is not None: sections.append(elses) self.simple_form=tuple(sections) class Unless: name='unless' blockContinuations=() def __init__(self, blocks): tname, args, section = blocks[0] args=parse_params(args, name='', expr='') name,expr=name_param(args,'unless',1) if expr is None: cond=name else: cond=expr.eval self.simple_form=(cond,None,section.blocks) class Else(Unless): # The else tag is included for backward compatibility and is deprecated. name='else' Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_In.py100644 1007 1403 64501 6761523433 23213 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''Sequence insertion A sequence may be inserted using an 'in' command. The 'in' command specifies the name of a sequence object and text to be inserted for each element in the sequence. The EPFS syntax for the in command is:: %(in name)[ text %(in name)] The HTML syntax for the in command is:: text See the example below that shows how 'if', 'else', and 'in' commands may be combined to display a possibly empty list of objects. The text included within an 'in' command will be refered to as an 'in' block. Synopsis If the variable 'sequence' exists as a sequence, a simple case of the 'in' tag is used as follows:: some markup A more complete case is used as follows:: ) Attributes sort -- Define the sort order for sequence items. If an item in the sequence does not define reverse -- Reverse the sequence (may be combined with sort). Note that this can cause a huge memory use in lazy activation instances. Within an 'in' block, variables are substituted from the elements of the iteration. The elements may be either instance or mapping objects. In addition, the variables: 'sequence-item' -- The element. 'sequence-var-nnn' -- The value of a specific named attribute of the item, where 'nnn' is the name. For example, to get an items 'title' attribute, use 'sequence-var-title'. This construct is most useful in an 'if' tag to test whether an attribute is present, because the attribute lookup will be extended to the full document template namespace. 'sequence-key' -- The key associated with the element in an items list. See below. 'sequence-index' -- The index, starting from 0, of the element within the sequence. 'sequence-number' -- The index, starting from 1, of the element within the sequence. 'sequence-letter' -- The index, starting from 'a', of the element within the sequence. 'sequence-Letter' -- The index, starting from 'A', of the element within the sequence. 'sequence-roman' -- The index, starting from 'i', of the element within the sequence. 'sequence-Roman' -- The index, starting from 'I', of the element within the sequence. 'sequence-start' -- A variable that is true if the element being displayed is the first of the displayed elements, and false otherwise. 'sequence-end' -- A variable that is true if the element being displayed is the last of the displayed elements, and false otherwise. are defined for each element. Normally, 'in' blocks are used to iterate over sequences of instances. If the optional parameter 'mapping' is specified after the sequence name, then the elements of the sequence will be treated as mapping objects. An 'in' command may be used to iterate over a sequence of dictionary items. If the elements of the iteration are two-element tuples, then then the template code given in the 'in' block will be applied to the second element of each tuple and may use a variable, 'sequence-key' to access the first element in each tuple. Batch sequence insertion When displaying a large number of objects, it is sometimes desireable to display just a sub-sequence of the data. An 'in' command may have optional parameters, as in:: The parameter values may be either integer literals or variable names. Up to five parameters may be set: 'start' -- The number of the first element to be shown, where elements are numbered from 1. 'end' -- The number of the last element to be shown, where elements are numbered from 1. 'size' -- The desired number of elements to be shown at once. 'orphan' -- The desired minimum number of objects to be displayed. The default value for this parameter is 3. 'overlap' -- The desired overlap between batches. The default is no overlap. Typically, only 'start' and 'size' will be specified. When batch insertion is used, several additional variables are defined for use within the sequence insertion text: 'sequence-query' -- The original query string given in a get request with the form variable named in the 'start' attribute removed. This is extremely useful when building URLs to fetch another batch. To see how this is used, consider the following example:: ... display rows (Next results) If the original URL is: 'foo/bar?x=1&y=2', then the rendered text (after row data are displated) will be:: (Next 20 results) If the original URL is: 'foo/bar?batch_start=10&x=1&y=2', then the rendered text (after row data are displated) will be:: (Next 20 results) 'sequence-step-start-index' -- The index, starting from 0, of the start of the current batch. 'sequence-step-end-index' -- The index, starting from 0, of the end of the current batch. 'sequence-step-size' -- The batch size used. 'previous-sequence' -- This variable will be true when the first element is displayed and when the first element displayed is not the first element in the sequence. 'previous-sequence-start-index' -- The index, starting from 0, of the start of the batch previous to the current batch. 'previous-sequence-end-index' -- The index, starting from 0, of the end of the batch previous to the current batch. 'previous-sequence-size' -- The size of the batch previous to the current batch. 'previous-batches' -- A sequence of mapping objects containing information about all of the batches prior to the batch being displayed. Each of these mapping objects include the following variables: batch-start-index -- The index, starting from 0, of the beginning of the batch. batch-end-index -- The index, starting from 0, of the end of the batch. batch-size -- The size of the batch. 'next-sequence' -- This variable will be true when the last element is displayed and when the last element displayed is not the last element in the sequence. 'next-sequence-start-index' -- The index, starting from 0, of the start of the batch after the current batch. 'next-sequence-end-index' -- The index, starting from 0, of the end of the batch after the current batch. 'next-sequence-size' -- The size of the batch after the current batch. 'next-batches' -- A sequence of mapping objects containing information about all of the batches after the batch being displayed. Each of these mapping objects include the following variables: batch-start-index -- The index, starting from 0, of the beginning of the batch. batch-end-index -- The index, starting from 0, of the end of the batch. batch-size -- The size of the batch. For each of the variables listed above with names ending in "-index", there are variables with names ending in "-number", "-roman", "-Roman", "-letter", and "-Letter" that are indexed from 1, "i", "I", "a", and "A", respectively. In addition, for every one of these variables there are variables with names ending in "-var-xxx", where "xxx" is an element attribute name or key. Summary statistics When performing sequence insertion, special variables may be used to obtain summary statistics. To obtain a summary statistic for a variable, use the variable name: 'statistic-name', where 'statistic' is a statistic name and 'name' is the name of a data variable. Currently supported statistic names are: total -- The total of numeric values. count -- The total number of non-missing values. min -- The minimum of non-missing values. max -- The maximum of non-missing values. median -- The median of non-missing values. mean -- The mean of numeric values values. variance -- The variance of numeric values computed with a degrees of freedom qeual to the count - 1. variance-n -- The variance of numeric values computed with a degrees of freedom qeual to the count. standard-deviation -- The standard deviation of numeric values computed with a degrees of freedom qeual to the count - 1. standard-deviation-n -- The standard deviation of numeric values computed with a degrees of freedom qeual to the count. Missing values are either 'None' or the attribute 'Value' of the module 'Missing', if present. 'else' continuation tag within in An 'else' tag may be used as a continuation tag in the 'in' tag. The source after the 'else' tag is inserted if: - The sequence given to the 'in' tag is of zero length, or - The 'previous' attribute was used and their are no previous batches, or - The 'next' attribute was used and their are no next batches, or ''' #' __rcs_id__='$Id: DT_In.py,v 1.38 1999/08/27 14:56:27 petrilli Exp $' __version__='$Revision: 1.38 $'[11:-2] from DT_Util import ParseError, parse_params, name_param, str from DT_Util import render_blocks, InstanceDict, ValidationError from string import find, atoi, join import ts_regex from DT_InSV import sequence_variables, opt TupleType=type(()) class InFactory: blockContinuations=('else',) name='in' def __call__(self, blocks): i=InClass(blocks) if i.batch: return i.renderwb else: return i.renderwob In=InFactory() class InClass: elses=None expr=sort=batch=mapping=None start_name_re=None reverse=None def __init__(self, blocks): tname, args, section = blocks[0] args=parse_params(args, name='', start='1',end='-1',size='10', orphan='3',overlap='1',mapping=1, skip_unauthorized=1, previous=1, next=1, expr='', sort='', reverse=1) self.args=args has_key=args.has_key if has_key('sort'): self.sort=sort=args['sort'] if sort=='sequence-item': self.sort='' if has_key('reverse'): self.reverse=args['reverse'] if has_key('mapping'): self.mapping=args['mapping'] for n in 'start', 'size', 'end': if has_key(n): self.batch=1 for n in 'orphan','overlap','previous','next': if has_key(n) and not self.batch: raise ParseError, ( """ The %s attribute was used but neither of the start, end, or size attributes were used. """ % n, 'in') if has_key('start'): v=args['start'] if type(v)==type(''): try: atoi(v) except: self.start_name_re=ts_regex.compile( '&+'+ join(map(lambda c: "[%s]" % c, v),'')+ '=[0-9]+&+') name,expr=name_param(args,'in',1) if expr is not None: expr=expr.eval self.__name__, self.expr = name, expr self.section=section.blocks if len(blocks) > 1: if len(blocks) != 2: raise ParseError, ( 'too many else blocks', 'in') tname, args, section = blocks[1] args=parse_params(args, name='') if args: ename=name_param(args) if ename != name: raise ParseError, ( 'name in else does not match in', 'in') self.elses=section.blocks def renderwb(self, md): expr=self.expr name=self.__name__ if expr is None: sequence=md[name] cache={ name: sequence } else: sequence=expr(md) cache=None if not sequence: if self.elses: return render_blocks(self.elses, md) return '' if type(sequence) is type(''): raise 'InError', ( 'Strings are not allowed as input to the in tag.') section=self.section params=self.args mapping=self.mapping if self.sort is not None: sequence=self.sort_sequence(sequence) if self.reverse is not None: sequence=self.reverse_sequence(sequence) next=previous=0 try: start=int_param(params,md,'start',0) except: start=1 end=int_param(params,md,'end',0) size=int_param(params,md,'size',0) overlap=int_param(params,md,'overlap',0) orphan=int_param(params,md,'orphan','3') start,end,sz=opt(start,end,size,orphan,sequence) if params.has_key('next'): next=1 if params.has_key('previous'): previous=1 last=end-1 first=start-1 try: query_string=md['QUERY_STRING'] except: query_string='' vars=sequence_variables(sequence,'?'+query_string,self.start_name_re) kw=vars.data kw['mapping']=mapping kw['sequence-step-size']=sz kw['sequence-step-overlap']=overlap kw['sequence-step-start']=start kw['sequence-step-end']=end kw['sequence-step-start-index']=start-1 kw['sequence-step-end-index']=end-1 kw['sequence-step-orphan']=orphan push=md._push pop=md._pop render=render_blocks if cache: push(cache) push(vars) try: if previous: if first > 0: pstart,pend,psize=opt(0,first+overlap, sz,orphan,sequence) kw['previous-sequence']=1 kw['previous-sequence-start-index']=pstart-1 kw['previous-sequence-end-index']=pend-1 kw['previous-sequence-size']=pend+1-pstart result=render(section,md) elif self.elses: result=render(self.elses, md) else: result='' elif next: try: # The following line is a sneaky way to test whether # there are more items, without actually # computing a length: sequence[end] pstart,pend,psize=opt(end+1-overlap,0, sz,orphan,sequence) kw['next-sequence']=1 kw['next-sequence-start-index']=pstart-1 kw['next-sequence-end-index']=pend-1 kw['next-sequence-size']=pend+1-pstart result=render(section,md) except: if self.elses: result=render(self.elses, md) else: result='' else: result = [] append=result.append validate=md.validate for index in range(first,end): if index==first and index > 0: pstart,pend,psize=opt(0,index+overlap, sz,orphan,sequence) kw['previous-sequence']=1 kw['previous-sequence-start-index']=pstart-1 kw['previous-sequence-end-index']=pend-1 kw['previous-sequence-size']=pend+1-pstart else: kw['previous-sequence']=0 if index==last: try: # The following line is a sneaky way to # test whether there are more items, # without actually computing a length: sequence[end] pstart,pend,psize=opt(end+1-overlap,0, sz,orphan,sequence) kw['previous-sequence']=0 kw['next-sequence']=1 kw['next-sequence-start-index']=pstart-1 kw['next-sequence-end-index']=pend-1 kw['next-sequence-size']=pend+1-pstart except: pass if index==last: kw['sequence-end']=1 client=sequence[index] if validate is not None: try: vv=validate(sequence,sequence,index,client,md) except: vv=0 if not vv: if (params.has_key('skip_unauthorized') and params['skip_unauthorized']): if index==first: kw['sequence-start']=0 continue raise ValidationError, index kw['sequence-index']=index if type(client)==TupleType and len(client)==2: client=client[1] if mapping: push(client) else: push(InstanceDict(client, md)) try: append(render(section, md)) finally: pop(1) if index==first: kw['sequence-start']=0 result=join(result, '') finally: if cache: pop() pop() return result def renderwob(self, md): """RENDER WithOutBatch""" expr=self.expr name=self.__name__ if expr is None: sequence=md[name] cache={ name: sequence } else: sequence=expr(md) cache=None if not sequence: if self.elses: return render_blocks(self.elses, md) return '' if type(sequence) is type(''): raise 'InError', ( 'Strings are not allowed as input to the in tag.') section=self.section mapping=self.mapping if self.sort is not None: sequence=self.sort_sequence(sequence) if self.reverse is not None: sequence=self.reverse_sequence(sequence) vars=sequence_variables(sequence) kw=vars.data kw['mapping']=mapping l=len(sequence) last=l-1 push=md._push pop=md._pop render=render_blocks if cache: push(cache) push(vars) try: result = [] append=result.append validate=md.validate for index in range(l): if index==last: kw['sequence-end']=1 client=sequence[index] if validate is not None: try: vv=validate(sequence,sequence,index,client,md) except: vv=0 if not vv: if (self.args.has_key('skip_unauthorized') and self.args['skip_unauthorized']): if index==1: kw['sequence-start']=0 continue raise ValidationError, index kw['sequence-index']=index if type(client)==TupleType and len(client)==2: client=client[1] if mapping: push(client) else: push(InstanceDict(client, md)) try: append(render(section, md)) finally: pop() if index==0: kw['sequence-start']=0 result=join(result, '') finally: if cache: pop() pop() return result def sort_sequence(self, sequence): sort=self.sort mapping=self.mapping isort=not sort k=None s=[] for client in sequence: if type(client)==TupleType and len(client)==2: if isort: k=client[0] v=client[1] else: if isort: k=client v=client if sort: if mapping: k=v[sort] else: k=getattr(v, sort) if not basic_type(k): try: k=k() except: pass s.append((k,client)) s.sort() sequence=[] for k, client in s: sequence.append(client) return sequence def reverse_sequence(self, sequence): s=list(sequence) s.reverse() return s basic_type={type(''): 1, type(0): 1, type(0.0): 1, type(()): 1, type([]): 1 }.has_key def int_param(params,md,name,default=0, st=type('')): try: v=params[name] except: v=default if v: try: v=atoi(v) except: v=md[v] if type(v) is st: v=atoi(v) return v Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_InSV.py100644 1007 1403 35047 6761040675 23471 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Sequence variables support $Id: DT_InSV.py,v 1.14 1999/08/25 19:19:25 jim Exp $''' __version__='$Revision: 1.14 $'[11:-2] from string import lower, rfind from math import sqrt TupleType=type(()) try: import Missing mv=Missing.Value except: mv=None class sequence_variables: def __init__(self,items=None,query_string='',start_name_re=None): self.items=items self.query_string=query_string self.start_name_re=start_name_re self.data=data={ 'previous-sequence': 0, 'next-sequence': 0, 'sequence-start': 1, 'sequence-end': 0, } def number(self,index): return index+1 def even(self,index): return index%2 == 0 def odd(self,index): return index%2 def letter(self,index): return chr(ord('a')+index) def Letter(self,index): return chr(ord('A')+index) def key(self,index): return self.items[index][0] def item(self,index, tt=type(())): i=self.items[index] if type(i) is tt and len(i)==2: return i[1] return i def roman(self,index): return lower(self.Roman(index)) def Roman(self,num): # Force number to be an integer value num = int(num)+1 # Initialize roman as an empty string roman = '' while num >= 1000: num = num - 1000 roman = '%sM' % roman while num >= 500: num = num - 500 roman = '%sD' % roman while num >= 100: num = num - 100 roman = '%sC' % roman while num >= 50: num = num - 50 roman = '%sL' % roman while num >= 10: num = num - 10 roman = '%sX' % roman while num >= 5: num = num - 5 roman = '%sV' % roman while num < 5 and num >= 1: num = num - 1 roman = '%sI' % roman # Replaces special cases in Roman Numerals roman = sub('DCCCC', 'CM', roman) roman = sub('CCCC', 'CD', roman) roman = sub('LXXXX', 'XC', roman) roman = sub('XXXX', 'XL', roman) roman = sub('VIIII', 'IX', roman) roman = sub('IIII', 'IV', roman) return roman def value(self,index,name): data=self.data item=self.items[index] if type(item)==TupleType and len(item)==2: item=item[1] if data['mapping']: return item[name] return getattr(item,name) def first(self,name,key=''): data=self.data if data['sequence-start']: return 1 index=data['sequence-index'] return self.value(index,name) != self.value(index-1,name) def last(self,name,key=''): data=self.data if data['sequence-end']: return 1 index=data['sequence-index'] return self.value(index,name) != self.value(index+1,name) def length(self, ignored): l=self.data['sequence-length']=len(self.items) return l def query(self, *ignored): if self.start_name_re is None: raise KeyError, 'sequence-query' query_string=self.query_string while query_string and query_string[:1] in '?&': query_string=query_string[1:] while query_string[-1:] == '&': query_string=query_string[:-1] if query_string: query_string='&%s&' % query_string re=self.start_name_re l=re.search_group(query_string, (0,)) if l: v=l[1] l=l[0] query_string=(query_string[:l]+ query_string[l+len(v)-1:]) query_string='?'+query_string[1:] else: query_string='?' self.data['sequence-query']=query_string return query_string statistic_names=( 'total', 'count', 'min', 'max', 'median', 'mean', 'variance', 'variance-n','standard-deviation', 'standard-deviation-n', ) def statistics(self,name,key): items=self.items data=self.data mapping=data['mapping'] count=sum=sumsq=0 min=max=None scount=smin=smax=None values=[] svalues=[] for item in items: try: if mapping: item=item[name] else: item=getattr(item,name) try: s=item*item sum=sum+item sumsq=sumsq+s values.append(item) if min is None: min=max=item else: if item < min: min=item if item > max: max=item except: if item is not None and item is not mv: if smin is None: smin=smax=item else: if item < smin: smin=item if item > smax: smax=item svalues.append(item) except: pass # Initialize all stats to empty strings: for stat in self.statistic_names: data['%s-%s' % (stat,name)]='' count=len(values) try: # Numeric statistics n=float(count) mean=sum/n sumsq=sumsq/n - mean*mean data['mean-%s' % name]=mean data['total-%s' % name]=sum data['variance-n-%s' % name]=sumsq data['standard-deviation-n-%s' % name]=sqrt(sumsq) if count > 1: sumsq=sumsq*n/(n-1) data['variance-%s' % name]=sumsq data['standard-deviation-%s' % name]=sqrt(sumsq) else: data['variance-%s' % name]='' data['standard-deviation-%s' % name]='' except: if min is None: min,max,values=smin,smax,svalues else: if smin < min: min=smin if smax > max: max=smax values=values+svalues count=len(values) data['count-%s' % name]=count # data['_values']=values if min is not None: data['min-%s' % name]=min data['max-%s' % name]=max values.sort() if count==1: data['median-%s' % name]=min else: n=count+1 if n/2*2==n: data['median-%s' % name]=values[n/2-1] else: n=n/2 try: data['median-%s' % name]=(values[n]+values[n-1])/2 except: try: data['median-%s' % name]=( "between %s and %s" % (values[n],values[n-1])) except: pass return data[key] def next_batches(self, suffix='batches',key=''): if suffix != 'batches': raise KeyError, key data=self.data sequence=self.items try: if not data['next-sequence']: return () sz=data['sequence-step-size'] start=data['sequence-step-start'] end=data['sequence-step-end'] l=len(sequence) orphan=data['sequence-step-orphan'] overlap=data['sequence-step-overlap'] except: AttributeError, 'next-batches' r=[] while end < l: start,end,spam=opt(end+1-overlap,0,sz,orphan,sequence) v=sequence_variables(self.items, self.query_string,self.start_name_re) d=v.data d['batch-start-index']=start-1 d['batch-end-index']=end-1 d['batch-size']=end+1-start d['mapping']=data['mapping'] r.append(v) data['next-batches']=r return r def previous_batches(self, suffix='batches',key=''): if suffix != 'batches': raise KeyError, key data=self.data sequence=self.items try: if not data['previous-sequence']: return () sz=data['sequence-step-size'] start=data['sequence-step-start'] end=data['sequence-step-end'] l=len(sequence) orphan=data['sequence-step-orphan'] overlap=data['sequence-step-overlap'] except: AttributeError, 'previous-batches' r=[] while start > 1: start,end,spam=opt(0,start-1+overlap,sz,orphan,sequence) v=sequence_variables(self.items, self.query_string,self.start_name_re) d=v.data d['batch-start-index']=start-1 d['batch-end-index']=end-1 d['batch-size']=end+1-start d['mapping']=data['mapping'] r.append(v) r.reverse() data['previous-batches']=r return r special_prefixes={ 'first': first, 'last': last, 'previous': previous_batches, 'next': next_batches, # These two are for backward compatability with a missfeature: 'sequence-index': lambda self, suffix, key: self['sequence-'+suffix], 'sequence-index-is': lambda self, suffix, key: self['sequence-'+suffix], } for n in statistic_names: special_prefixes[n]=statistics def __getitem__(self,key, special_prefixes=special_prefixes, special_prefix=special_prefixes.has_key ): data=self.data if data.has_key(key): return data[key] l=rfind(key,'-') if l < 0: raise KeyError, key suffix=key[l+1:] prefix=key[:l] if hasattr(self, suffix): try: v=data[prefix+'-index'] except: pass else: return getattr(self,suffix)(v) if special_prefix(prefix): return special_prefixes[prefix](self, suffix, key) if prefix[-4:]=='-var': prefix=prefix[:-4] try: return self.value(data[prefix+'-index'],suffix) except: pass if key=='sequence-query': return self.query() raise KeyError, key def opt(start,end,size,orphan,sequence): if size < 1: if start > 0 and end > 0 and end >= start: size=end+1-start else: size=7 if start > 0: try: sequence[start-1] except: start=len(sequence) # if start > l: start=l if end > 0: if end < start: end=start else: end=start+size-1 try: sequence[end+orphan-1] except: end=len(sequence) # if l - end < orphan: end=l elif end > 0: try: sequence[end-1] except: end=len(sequence) # if end > l: end=l start=end+1-size if start - 1 < orphan: start=1 else: start=1 end=start+size-1 try: sequence[end+orphan-1] except: end=len(sequence) # if l - end < orphan: end=l return start,end,size Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_Let.py100755 1007 1403 15170 6750074655 23377 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## ''' The Let tag was contributed to Zope by and is copyright, 1999 Phillip J. Eby. Permission has been granted to release the Let tag under the Zope Public License. Let name=value... The 'let' tag is used to bind variables to values within a block. The text enclosed in the let tag is rendered using information from the given variables or expressions. For example:: foo() = , bar = Notice that both 'name' and 'expr' style attributes may be used to specify data. 'name' style attributes (e.g. my_bar=bar) will be rendered as they are for var/with/in/etc. Quoted attributes will be treated as Python expressions. Variables are processed in sequence, so later assignments can reference and/or overwrite the results of previous assignments, as desired. ''' from DT_Util import render_blocks, str, Eval, expr_globals, Eval, ParseError, regex, strip class Let: blockContinuations=() name='let' def __init__(self, blocks): tname, args, section = blocks[0] self.__name__ = args self.section = section.blocks self.args = args = parse_let_params(args) for i in range(len(args)): name,expr = args[i] if expr[:1]=='"' and expr[-1:]=='"' and len(expr) > 1: # expr shorthand expr=expr[1:-1] try: args[i] = name, Eval(expr, expr_globals).eval except SyntaxError, v: m,(huh,l,c,src) = v raise ParseError, ( 'Expression (Python) Syntax error:' '\n
    \n%s\n
    \n' % v[0], 'let') def render(self, md): d={}; md._push(d) try: for name,expr in self.args: if type(expr) is type(''): d[name]=md[expr] else: d[name]=expr(md) return render_blocks(self.section, md) finally: md._pop(1) __call__ = render def parse_let_params(text, result=None, tag='let', parmre=regex.compile( '\([\0- ]*\([^\0- =\"]+\)=\([^\0- =\"]+\)\)'), qparmre=regex.compile( '\([\0- ]*\([^\0- =\"]+\)="\([^"]*\)\"\)'), **parms): result=result or [] if parmre.match(text) >= 0: name=parmre.group(2) value=parmre.group(3) l=len(parmre.group(1)) elif qparmre.match(text) >= 0: name=qparmre.group(2) value='"%s"' % qparmre.group(3) l=len(qparmre.group(1)) else: if not text or not strip(text): return result raise ParseError, ('invalid parameter: "%s"' % text, tag) result.append((name,value)) text=strip(text[l:]) if text: return apply(parse_let_params,(text,result,tag),parms) else: return result Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_Raise.py100644 1007 1403 11604 6671334613 23704 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''Raising exceptions Errors can be raised from DTML using the 'raise' tag. For example:: The value you entered is not valid ''' __rcs_id__='$Id: DT_Raise.py,v 1.11 1999/03/10 00:15:07 klm Exp $' __version__='$Revision: 1.11 $'[11:-2] from DT_Util import parse_params, name_param, render_blocks, str class Raise: blockContinuations=() name='raise' expr='' def __init__(self, blocks): tname, args, section = blocks[0] self.section=section.blocks args=parse_params(args, type='', expr='') self.__name__, self.expr = name_param(args, 'raise', 1, attr='type') def render(self,md): expr=self.expr if expr is None: t=self.__name__ if t[-5:]=='Error' and __builtins__.has_key(t): t=__builtins__[t] else: try: t=expr.eval(md) except: t='Invalid Error Type Expression' try: v=render_blocks(self.section,md) except: v='Invalid Error Value' raise t, v __call__=render Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_Return.py100644 1007 1403 10615 6736421276 24125 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __version__='$Revision: 1.1 $'[11:-2] from DT_Util import parse_params, name_param, html_quote, str import regex, string, sys, regex from string import find, split, join, atoi, rfind class ReturnTag: name='return' expr=None def __init__(self, args): args = parse_params(args, name='', expr='') name, expr = name_param(args,'var',1) self.__name__, self.expr = name, expr def render(self, md): name=self.__name__ val=self.expr if val is None: val = md[name] else: val=val.eval(md) raise DTReturn(val) __call__=render class DTReturn: def __init__(self, v): self.v=v Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_String.py100644 1007 1403 46277 6756616235 24134 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## "$Id: DT_String.py,v 1.31 1999/08/18 20:50:37 jim Exp $" from string import split, strip import regex, ts_regex from DT_Util import ParseError, InstanceDict, TemplateDict, render_blocks, str from DT_Var import Var, Call, Comment from DT_Return import ReturnTag, DTReturn class String: """Document templates defined from strings. Document template strings use an extended form of python string formatting. To insert a named value, simply include text of the form: '%(name)x', where 'name' is the name of the value and 'x' is a format specification, such as '12.2d'. To intrduce a block such as an 'if' or an 'in' or a block continuation, such as an 'else', use '[' as the format specification. To terminate a block, ise ']' as the format specification, as in:: %(in results)[ %(name)s %(in results)] """ isDocTemp=1 # Document Templates masquerade as functions: class func_code: pass func_code=func_code() func_code.co_varnames='self','REQUEST' func_code.co_argcount=2 func_defaults=() def errQuote(self, s): return s def parse_error(self, mess, tag, text, start): raise ParseError, "%s, for tag %s, on line %s of %s

    " % ( mess, self.errQuote(tag), len(split(text[:start],'\n')), self.errQuote(self.__name__)) commands={ 'var': Var, 'call': Call, 'in': ('in', 'DT_In','In'), 'with': ('with', 'DT_With','With'), 'if': ('if', 'DT_If','If'), 'unless': ('unless', 'DT_If','Unless'), 'else': ('else', 'DT_If','Else'), 'comment': Comment, 'raise': ('raise', 'DT_Raise','Raise'), 'try': ('try', 'DT_Try','Try'), 'let': ('let', 'DT_Let', 'Let'), 'return': ReturnTag, } def SubTemplate(self, name): return String('', __name__=name) def tagre(self): return regex.symcomp( '%(' # beginning '\([a-zA-Z0-9_/.-]+\)' # tag name '\(' '[\0- ]+' # space after tag name '\(\([^)"]+\("[^"]*"\)?\)*\)' # arguments '\)?' ')\([0-9]*[.]?[0-9]*[a-z]\|[]![]\)' # end , regex.casefold) def _parseTag(self, tagre, command=None, sargs='', tt=type(())): tag, args, command, coname = self.parseTag(tagre,command,sargs) if type(command) is tt: cname, module, name = command d={} try: exec 'from %s import %s' % (module, name) in d except ImportError: exec 'from DocumentTemplate.%s import %s' % (module, name) in d command=d[name] self.commands[cname]=command return tag, args, command, coname def parseTag(self, tagre, command=None, sargs=''): """Parse a tag using an already matched re Return: tag, args, command, coname where: tag is the tag, args is the tag\'s argument string, command is a corresponding command info structure if the tag is a start tag, or None otherwise, and coname is the name of a continue tag (e.g. else) or None otherwise """ tag, name, args, fmt =tagre.group(0, 'name', 'args', 'fmt') args=args and strip(args) or '' if fmt==']': if not command or name != command.name: raise ParseError, ('unexpected end tag', tag) return tag, args, None, None elif fmt=='[' or fmt=='!': if command and name in command.blockContinuations: if name=='else' and args: # Waaaaaah! Have to special case else because of # old else start tag usage. Waaaaaaah! l=len(args) if not (args==sargs or args==sargs[:l] and sargs[l:l+1] in ' \t\n'): return tag, args, self.commands[name], None return tag, args, None, name try: return tag, args, self.commands[name], None except KeyError: raise ParseError, ('Unexpected tag', tag) else: # Var command args=args and ("%s %s" % (name, args)) or name return tag, args, Var, None def varExtra(self,tagre): return tagre.group('fmt') def parse(self,text,start=0,result=None,tagre=None): if result is None: result=[] if tagre is None: tagre=self.tagre() l=tagre.search(text,start) while l >= 0: try: tag, args, command, coname = self._parseTag(tagre) except ParseError, m: self.parse_error(m[0],m[1],text,l) s=text[start:l] if s: result.append(s) start=l+len(tag) if hasattr(command,'blockContinuations'): start=self.parse_block(text, start, result, tagre, tag, l, args, command) else: try: if command is Var: r=command(args, self.varExtra(tagre)) else: r=command(args) if hasattr(r,'simple_form'): r=r.simple_form result.append(r) except ParseError, m: self.parse_error(m[0],tag,text,l) l=tagre.search(text,start) text=text[start:] if text: result.append(text) return result def skip_eol(self, text, start, eol=regex.compile('[ \t]*\n')): # if block open is followed by newline, then skip past newline l=eol.match(text,start) if l > 0: start=start+l return start def parse_block(self, text, start, result, tagre, stag, sloc, sargs, scommand): start=self.skip_eol(text,start) blocks=[] tname=scommand.name sname=stag sstart=start sa=sargs while 1: l=tagre.search(text,start) if l < 0: self.parse_error('No closing tag', stag, text, sloc) try: tag, args, command, coname= self._parseTag(tagre,scommand,sa) except ParseError, m: self.parse_error(m[0],m[1], text, l) if command: start=l+len(tag) if hasattr(command, 'blockContinuations'): # New open tag. Need to find closing tag. start=self.parse_close(text, start, tagre, tag, l, command, args) else: # Either a continuation tag or an end tag section=self.SubTemplate(sname) section._v_blocks=section.blocks=self.parse(text[:l],sstart) section._v_cooked=None blocks.append((tname,sargs,section)) start=self.skip_eol(text,l+len(tag)) if coname: tname=coname sname=tag sargs=args sstart=start else: try: r=scommand(blocks) if hasattr(r,'simple_form'): r=r.simple_form result.append(r) except ParseError, m: self.parse_error(m[0],stag,text,l) return start def parse_close(self, text, start, tagre, stag, sloc, scommand, sa): while 1: l=tagre.search(text,start) if l < 0: self.parse_error('No closing tag', stag, text, sloc) try: tag, args, command, coname= self._parseTag(tagre,scommand,sa) except ParseError, m: self.parse_error(m[0],m[1], text, l) start=l+len(tag) if command: if hasattr(command, 'blockContinuations'): # New open tag. Need to find closing tag. start=self.parse_close(text, start, tagre, tag, l, command,args) elif not coname: return start shared_globals={} def __init__(self, source_string='', mapping=None, __name__='', **vars): """\ Create a document template from a string. The optional parameter, 'mapping', may be used to provide a mapping object containing defaults for values to be inserted. """ self.raw=source_string self.initvars(mapping, vars) self.setName(__name__) def name(self): return self.__name__ id=name def setName(self,v): self.__dict__['__name__']=v def default(self,name=None,**kw): """\ Change or query default values in a document template. If a name is specified, the value of the named default value before the operation is returned. Keyword arguments are used to provide default values. """ if name: name=self.globals[name] for key in kw.keys(): self.globals[key]=kw[key] return name def var(self,name=None,**kw): """\ Change or query a variable in a document template. If a name is specified, the value of the named variable before the operation is returned. Keyword arguments are used to provide variable values. """ if name: name=self._vars[name] for key in kw.keys(): self._vars[key]=kw[key] return name def munge(self,source_string=None,mapping=None,**vars): """\ Change the text or default values for a document template. """ if mapping is not None or vars: self.initvars(mapping, vars) if source_string is not None: self.raw=source_string self.cook() def manage_edit(self,data,REQUEST=None): self.munge(data) def read_raw(self,raw=None): return self.raw def read(self,raw=None): return self.read_raw() def cook(self, cooklock=ts_regex.allocate_lock(), ): cooklock.acquire() try: self._v_blocks=self.parse(self.read()) self._v_cooked=None finally: cooklock.release() def initvars(self, globals, vars): if globals: for k in globals.keys(): if k[:1] != '_' and not vars.has_key(k): vars[k]=globals[k] self.globals=vars self._vars={} def __call__(self,client=None,mapping={},**kw): '''\ Generate a document from a document template. The document will be generated by inserting values into the format string specified when the document template was created. Values are inserted using standard python named string formats. The optional argument 'client' is used to specify a object containing values to be looked up. Values will be looked up using getattr, so inheritence of values is supported. Note that names beginning with '_' will not be looked up from the client. The optional argument, 'mapping' is used to specify a mapping object containing values to be inserted. Values to be inserted may also be specified using keyword arguments. Values will be inserted from one of several sources. The sources, in the order in which they are consulted, are: o Keyword arguments, o The 'client' argument, o The 'mapping' argument, o The keyword arguments provided when the object was created, and o The 'mapping' argument provided when the template was created. ''' # print '============================================================' # print '__called__' # print self.raw # print kw # print client # print mapping # print '============================================================' if mapping is None: mapping = {} if not hasattr(self,'_v_cooked'): try: changed=self.__changed__() except: changed=1 self.cook() if not changed: self.__changed__(0) pushed=None try: if mapping.__class__ is TemplateDict: pushed=0 except: pass globals=self.globals if pushed is not None: # We were passed a TemplateDict, so we must be a sub-template md=mapping push=md._push if globals: push(self.globals) pushed=pushed+1 else: md=TemplateDict() push=md._push shared_globals=self.shared_globals if shared_globals: push(shared_globals) if globals: push(globals) if mapping: push(mapping) if hasattr(mapping,'AUTHENTICATED_USER'): md.AUTHENTICATED_USER=mapping['AUTHENTICATED_USER'] md.validate=self.validate if client is not None: if type(client)==type(()): md.this=client[-1] else: md.this=client pushed=0 level=md.level if level > 200: raise SystemError, ( 'infinite recursion in document template') md.level=level+1 if client is not None: if type(client)==type(()): # if client is a tuple, it represents a "path" of clients # which should be pushed onto the md in order. for ob in client: push(InstanceDict(ob, md)) # Circ. Ref. 8-| pushed=pushed+1 else: # otherwise its just a normal client object. push(InstanceDict(client, md)) # Circ. Ref. 8-| pushed=pushed+1 if self._vars: push(self._vars) pushed=pushed+1 if kw: push(kw) pushed=pushed+1 try: try: return render_blocks(self._v_blocks, md) except DTReturn, v: return v.v finally: if pushed: md._pop(pushed) # Get rid of circular reference! md.level=level # Restore previous level validate=None def __str__(self): return self.read() def __getstate__(self, _special=('_v_', '_p_')): # Waaa, we need _v_ behavior but we may not subclass Persistent d={} for k, v in self.__dict__.items(): if k[:3] in _special: continue d[k]=v return d class FileMixin: # Mix-in class to abstract certain file-related attributes edited_source='' def __init__(self, file_name='', mapping=None, __name__='', **vars): """\ Create a document template based on a named file. The optional parameter, 'mapping', may be used to provide a mapping object containing defaults for values to be inserted. """ self.raw=file_name self.initvars(mapping, vars) self.setName(__name__ or file_name) def read_raw(self): if self.edited_source: return self.edited_source if self.raw: return open(self.raw,'r').read() return '' class File(FileMixin, String): """\ Document templates read from files. If the object is pickled, the file name, rather than the file contents is pickled. When the object is unpickled, then the file will be re-read to obtain the string. Note that the file will not be read until the document template is used the first time. """ def manage_edit(self,data): raise TypeError, 'cannot edit files' Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_Try.py100644 1007 1403 16366 6736421365 23434 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import string, sys, traceback from cStringIO import StringIO from DT_Util import parse_params, render_blocks, namespace, InstanceDict from DT_Return import DTReturn class Try: """Zope DTML Exception handling usage: The DTML try tag functions quite like Python's try command. The main difference is that DTML does not have a finally or an else construct. The contents of the try tag are rendered. If an exception is raised, then control switches to the except blocks. The first except block to match the type of the error raised is rendered. If an except block has no name then it matches all raised errors. The try tag understands class-based exceptions, as well as string-based exceptions. Note: the 'raise' tag raises string-based exceptions. Inside the except blocks information about the error is available via three variables. 'error_type' -- This variable is the name of the exception caught. 'error_value' -- This is the caught exception's value. 'error_tb' -- This is a traceback for the caught exception. Original version by Jordan B. Baker. """ name = 'try' blockContinuations = 'except', def __init__(self, blocks): tname, args, section = blocks[0] self.args = parse_params(args) self.section = section.blocks # store handlers as tuples (name,block) self.handlers = [] for tname,nargs,nsection in blocks[1:]: for errname in string.split(nargs): self.handlers.append((errname,nsection.blocks)) if string.strip(nargs)=='': self.handlers.append(('',nsection.blocks)) def render(self, md): # first we try to render the first block try: return render_blocks(self.section, md) except DTReturn: raise except: # but an error occurs.. save the info. t,v = sys.exc_info()[:2] if type(t)==type(''): errname = t else: errname = t.__name__ handler = self.find_handler(t) if handler is None: # we didn't find a handler, so reraise the error raise # found the handler block, now render it try: f=StringIO() traceback.print_exc(100,f) error_tb=f.getvalue() ns = namespace(self, error_type=errname, error_value=v, error_tb=error_tb)[0] md._push(InstanceDict(ns,md)) return render_blocks(handler, md) finally: md._pop(1) def find_handler(self,exception): "recursively search for a handler for a given exception" if type(exception)==type(''): for e,h in self.handlers: if exception==e or e=='': return h else: return None for e,h in self.handlers: if e==exception.__name__ or e=='' or self.match_base(exception,e): return h return None def match_base(self,exception,name): for base in exception.__bases__: if base.__name__==name or self.match_base(base,name): return 1 return None __call__ = render Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_UI.py100644 1007 1403 14225 6675547771 23177 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Machinery to support through-the-web editing $Id: DT_UI.py,v 1.10 1999/03/22 23:19:21 jim Exp $''' __version__='$Revision: 1.10 $'[11:-2] from DT_HTML import HTML FactoryDefaultString="Factory Default" HTML.document_template_edit_header='

    Edit Document

    ' HTML.document_template_form_header='' HTML.document_template_edit_footer=( """ © 1997 Digital Creations, L.L.C.""") HTML.document_template_edit_width=58 HTML._manage_editForm = HTML( """ HTML Template Editor
    Document template source:



    """,) HTML.editConfirmation=HTML( """Change Successful

    has been changed.


    has been changed.
    """) Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_Util.py100644 1007 1403 41650 6760546353 23567 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''$Id: DT_Util.py,v 1.58 1999/08/24 16:48:43 jim Exp $''' __version__='$Revision: 1.58 $'[11:-2] import regex, string, math, os from string import strip, join, atoi, lower, split, find import VSEval str=__builtins__['str'] # Waaaaa, waaaaaaaa needed for pickling waaaaa ParseError='Document Template Parse Error' ValidationError='Unauthorized' def html_quote(v, name='(Unknown name)', md={}, character_entities=( (('&'), '&'), (("<"), '<' ), ((">"), '>' ), (('"'), '"'))): #" text=str(v) for re,name in character_entities: if find(text, re) >= 0: text=join(split(text,re),name) return text def int_param(params,md,name,default=0, st=type('')): try: v=params[name] except: v=default if v: try: v=atoi(v) except: v=md[v] if type(v) is st: v=atoi(v) return v or 0 def careful_getattr(md, inst, name): if name[:1]!='_': # Try to get the attribute normally so that we don't # accidentally acquire when we shouldn't. v=getattr(inst, name) validate=md.validate if validate is None: return v if hasattr(inst,'aq_acquire'): return inst.aq_acquire(name, validate, md) if validate(inst,inst,name,v,md): return v raise ValidationError, name _marker=[] def careful_hasattr(md, inst, name): v=getattr(inst, name, _marker) if v is not _marker: try: if name[:1]!='_': validate=md.validate if validate is None: return 1 if hasattr(inst,'aq_acquire'): inst.aq_acquire(name, validate, md) return 1 if validate(inst,inst,name,v,md): return 1 except: pass return 0 def careful_getitem(md, mapping, key): v=mapping[key] if type(v) is type(''): return v # Short-circuit common case validate=md.validate if validate is None or validate(mapping,mapping,key,v,md): return v raise ValidationError, key def careful_getslice(md, seq, *indexes): v=len(indexes) if v==2: v=seq[indexes[0]:indexes[1]] elif v==1: v=seq[indexes[0]:] else: v=seq[:] if type(seq) is type(''): return v # Short-circuit common case validate=md.validate if validate is not None: for e in v: if not validate(seq,seq,'',e,md): raise ValidationError, 'unauthorized access to slice member' return v def careful_range(md, iFirst, *args): # limited range function from Martijn Pieters RANGELIMIT = 1000 if not len(args): iStart, iEnd, iStep = 0, iFirst, 1 elif len(args) == 1: iStart, iEnd, iStep = iFirst, args[0], 1 elif len(args) == 2: iStart, iEnd, iStep = iFirst, args[0], args[1] else: raise AttributeError, 'range() requires 1-3 int arguments' if iStep == 0: raise ValueError, 'zero step for range()' iLen = int((iEnd - iStart) / iStep) if iLen < 0: iLen = 0 if iLen >= RANGELIMIT: raise ValueError, 'range() too large' return range(iStart, iEnd, iStep) import string, math, whrandom try: import ExtensionClass from cDocumentTemplate import InstanceDict, TemplateDict, render_blocks from cDocumentTemplate import cDocument except: from pDocumentTemplate import InstanceDict, TemplateDict, render_blocks d=TemplateDict.__dict__ for name in ('None', 'abs', 'chr', 'divmod', 'float', 'hash', 'hex', 'int', 'len', 'max', 'min', 'oct', 'ord', 'pow', 'round', 'str'): d[name]=__builtins__[name] d['string']=string d['math']=math d['whrandom']=whrandom try: import random d['random']=random except: pass try: import DateTime d['DateTime']=DateTime.DateTime except: pass def test(self, *args): l=len(args) for i in range(1, l, 2): if args[i-1]: return args[i] if l%2: return args[-1] d['test']=test def obsolete_attr(self, inst, name, md): return careful_getattr(md, inst, name) d['attr']=obsolete_attr d['getattr']=careful_getattr d['hasattr']=careful_hasattr d['range']=careful_range class namespace_: pass def namespace(self, **kw): """Create a tuple consisting of a single instance whos attributes are provided as keyword arguments.""" r=namespace_() d=r.__dict__ for k, v in kw.items(): d[k]=v return r, d['namespace']=namespace def render(self, v, simple={ type(''): 1, type(0): 1, type(0.0): 1, type([]): 1, type(()): 1, }.has_key): "Render an object in the way done be the 'name' attribute" if not simple(type(v)): if hasattr(v,'isDocTemp') and v.isDocTemp: v=v(None, self) else: try: v=v() except (AttributeError,TypeError): pass return v d['render']=render def reorder(self, s, with=None, without=()): if with is None: with=s d={} tt=type(()) for i in s: if type(i) is tt and len(i)==2: k, v = i else: k= v = i d[k]=v r=[] a=r.append h=d.has_key for i in without: if type(i) is tt and len(i)==2: k, v = i else: k= v = i if h(k): del d[k] for i in with: if type(i) is tt and len(i)==2: k, v = i else: k= v = i if h(k): a((k,d[k])) del d[k] return r d['reorder']=reorder expr_globals={ '__builtins__':{}, '__guarded_mul__': VSEval.careful_mul, '__guarded_getattr__': careful_getattr, '__guarded_getitem__': careful_getitem, '__guarded_getslice__': careful_getslice, } class Eval(VSEval.Eval): def eval(self, mapping): d={'_vars': mapping, '_': mapping} code=self.code globals=self.globals for name in self.used: try: d[name]=mapping.getitem(name,0) except KeyError: if name=='_getattr': d['__builtins__']=globals exec compiled_getattr in d return eval(code,globals,d) def name_param(params,tag='',expr=0, attr='name', default_unnamed=1): used=params.has_key __traceback_info__=params, tag, expr, attr #if expr and used('expr') and used('') and not used(params['']): # # Fix up something like: # params[params['']]=default_unnamed # del params[''] if used(''): v=params[''] if v[:1]=='"' and v[-1:]=='"' and len(v) > 1: # expr shorthand if used(attr): raise ParseError, ('%s and expr given' % attr, tag) if expr: if used('expr'): raise ParseError, ('two exprs given', tag) v=v[1:-1] try: expr=Eval(v, expr_globals) except SyntaxError, v: raise ParseError, ( 'Expression (Python) Syntax error:' '\n
    \n%s\n
    \n' % v[0], tag) return v, expr else: raise ParseError, ( 'The "..." shorthand for expr was used in a tag ' 'that doesn\'t support expr attributes.', tag) else: # name shorthand if used(attr): raise ParseError, ('Two %s values were given' % attr, tag) if expr: if used('expr'): # raise 'Waaaaaa', 'waaa' raise ParseError, ('%s and expr given' % attr, tag) return params[''],None return params[''] elif used(attr): if expr: if used('expr'): raise ParseError, ('%s and expr given' % attr, tag) return params[attr],None return params[attr] elif expr and used('expr'): name=params['expr'] expr=Eval(name, expr_globals) return name, expr raise ParseError, ('No %s given' % attr, tag) Expr_doc=""" Python expression support Several document template tags, including 'var', 'in', 'if', 'else', and 'elif' provide support for using Python expressions via an 'expr' tag attribute. Expressions may be used where a simple variable value is inadequate. For example, an expression might be used to test whether a variable is greater than some amount:: or to transform some basic data:: Objects available in the document templates namespace may be used. Subobjects of these objects may be used as well, although subobject access is restricted by the optional validation method. In addition, a special additional name, '_', is available. The '_' variable provides access to the document template namespace as a mapping object. This variable can be useful for accessing objects in a document template namespace that have names that are not legal Python variable names:: This variable also has attributes that provide access to standard utility objects. These attributes include: - The objects: 'None', 'abs', 'chr', 'divmod', 'float', 'hash', 'hex', 'int', 'len', 'max', 'min', 'oct', 'ord', 'pow', 'round', and 'str' from the standard Python builtin module. - Special security-aware versions of 'getattr' and 'hasattr', - The Python 'string', 'math', and 'whrandom' modules, and - A special function, 'test', that supports if-then expressions. The 'test' function accepts any number of arguments. If the first argument is true, then the second argument is returned, otherwise if the third argument is true, then the fourth argument is returned, and so on. If there is an odd number of arguments, then the last argument is returned in the case that none of the tested arguments is true, otherwise None is returned. For example, to convert a value to lower case:: """ ListType=type([]) def parse_params(text, result=None, tag='', unparmre=regex.compile( '\([\0- ]*\([^\0- =\"]+\)\)'), qunparmre=regex.compile( '\([\0- ]*\("[^"]*"\)\)'), parmre=regex.compile( '\([\0- ]*\([^\0- =\"]+\)=\([^\0- =\"]+\)\)'), qparmre=regex.compile( '\([\0- ]*\([^\0- =\"]+\)="\([^"]*\)\"\)'), **parms): """Parse tag parameters The format of tag parameters consists of 1 or more parameter specifications separated by whitespace. Each specification consists of an unnamed and unquoted value, a valueless name, or a name-value pair. A name-value pair consists of a name and a quoted or unquoted value separated by an '='. The input parameter, text, gives the text to be parsed. The keyword parameters give valid parameter names and default values. If a specification is not a name-value pair and it is not the first specification and it is a valid parameter name, then it is treated as a name-value pair with a value as given in the keyword argument. Otherwise, if it is not a name-value pair, it is treated as an unnamed value. The data are parsed into a dictionary mapping names to values. Unnamed values are mapped from the name '""'. Only one value may be given for a name and there may be only one unnamed value. """ result=result or {} if parmre.match(text) >= 0: name=lower(parmre.group(2)) value=parmre.group(3) l=len(parmre.group(1)) elif qparmre.match(text) >= 0: name=lower(qparmre.group(2)) value=qparmre.group(3) l=len(qparmre.group(1)) elif unparmre.match(text) >= 0: name=unparmre.group(2) l=len(unparmre.group(1)) if result: if parms.has_key(name): if parms[name] is None: raise ParseError, ( 'Attribute %s requires a value' % name, tag) result[name]=parms[name] else: raise ParseError, ( 'Invalid attribute name, "%s"' % name, tag) else: result['']=name return apply(parse_params,(text[l:],result),parms) elif qunparmre.match(text) >= 0: name=qunparmre.group(2) l=len(qunparmre.group(1)) if result: raise ParseError, ( 'Invalid attribute name, "%s"' % name, tag) else: result['']=name return apply(parse_params,(text[l:],result),parms) else: if not text or not strip(text): return result raise ParseError, ('invalid parameter: "%s"' % text, tag) if not parms.has_key(name): raise ParseError, ( 'Invalid attribute name, "%s"' % name, tag) if result.has_key(name): p=parms[name] if type(p) is not ListType or p: raise ParseError, ( 'Duplicate values for attribute "%s"' % name, tag) result[name]=value text=strip(text[l:]) if text: return apply(parse_params,(text,result),parms) else: return result Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_Var.py100644 1007 1403 35547 6751615573 23413 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Variable insertion parameters When inserting variables, parameters may be specified to control how the data will be formatted. In HTML source, the 'fmt' parameter is used to specify a C-style or custom format to be used when inserting an object. In EPFS source, the 'fmt' parameter is only used for custom formats, a C-style format is specified after the closing parenthesis. Custom formats A custom format is used when outputing user-defined objects. The value of a custom format is a method name to be invoked on the object being inserted. The method should return an object that, when converted to a string, yields the desired text. For example, the HTML source:: Inserts the result of calling the method 'DayOfWeek' of the object bound to the variable 'date', with no arguments. In addition to object methods, serveral additional custom formats are available: 'whole-dollars' -- Show a numeric value with a dollar symbol. 'dollars-and-cents' -- Show a numeric value with a dollar symbol and two decimal places. 'collection-length' -- Get the length of a collection of objects. Note that when using the EPFS source format, both a C-style and a custom format may be provided. In this case, the C-Style format is applied to the result of calling the custom formatting method. Null values In some applications, and especially in database applications, data variables may alternate between "good" and "null" or "missing" values. A format that is used for good values may be inappropriate for null values. For this reason, the 'null' parameter can be used to specify text to be used for null values. Null values are defined as values that: - Cannot be formatted with the specified format, and - Are either the special Python value 'None' or are false and yield an empty string when converted to a string. For example, when showing a monitary value retrieved from a database that is either a number or a missing value, the following variable insertion might be used:: String manipulation A number of special attributes are provided to transform the value after formatting has been applied. These parameters are supplied without arguments. 'lower' -- cause all upper-case letters to be converted to lower case. 'upper' -- cause all upper-case letters to be converted to lower case. 'capitalize' -- cause the first character of the inserted value to be converted to upper case. 'spacify' -- cause underscores in the inserted value to be converted to spaces. 'thousands_commas' -- cause commas to be inserted every three digits to the left of a decimal point in values containing numbers. For example, the value, "12000 widgets" becomes "12,000 widgets". 'html_quote' -- convert characters that have special meaning in HTML to HTML character entities. 'url_quote' -- convert characters that have special meaning in URLS to HTML character entities using decimal values. 'sql_quote' -- Convert single quotes to pairs of single quotes. This is needed to safely include values in Standard Query Language (SQL) strings. 'newline_to_br' -- Convert newlines and carriage-return and newline combinations to break tags. Truncation The attributes 'size' and 'etc' can be used to truncate long strings. If the 'size' attribute is specified, the string to be inserted is truncated at the given length. If a space occurs in the second half of the truncated string, then the string is further truncated to the right-most space. After truncation, the value given for the 'etc' attribute is added to the string. If the 'etc' attribute is not provided, then '...' is used. For example, if the value of spam is '"blah blah blah blah"', then the tag '' inserts '"blah blah ..."'. Evaluating expressions without rendering results A 'call' tag is provided for evaluating named objects or expressions without rendering the result. ''' # ' __rcs_id__='$Id: DT_Var.py,v 1.30 1999/08/03 16:40:27 jim Exp $' __version__='$Revision: 1.30 $'[11:-2] from DT_Util import parse_params, name_param, html_quote, str import regex, string, sys, regex from string import find, split, join, atoi, rfind class Var: name='var' expr=None def __init__(self, args, fmt='s'): if args[:4]=='var ': args=args[4:] args = parse_params(args, name='', lower=1, upper=1, expr='', capitalize=1, spacify=1, null='', fmt='s', size=0, etc='...', thousands_commas=1, html_quote=1, url_quote=1, sql_quote=1, newline_to_br=1) self.args=args self.modifiers=tuple( map(lambda t: t[1], filter(lambda m, args=args, used=args.has_key: used(m[0]) and args[m[0]], modifiers))) name, expr = name_param(args,'var',1) self.__name__, self.expr = name, expr self.fmt = fmt if len(args)==1 and fmt=='s': if expr is None: expr=name else: expr=expr.eval self.simple_form=expr, def render(self, md): name=self.__name__ val=self.expr if val is None: val = md[name] else: val=val.eval(md) args=self.args have_arg=args.has_key __traceback_info__=name, val, args if val is None and have_arg('null'): # Treat None as special case wrt null return args['null'] # handle special formats defined using fmt= first if have_arg('fmt'): fmt=args['fmt'] if have_arg('null') and not val and val != 0: try: if hasattr(val, fmt): val = getattr(val,fmt)() elif special_formats.has_key(fmt): val = special_formats[fmt](val, name, md) elif fmt=='': val='' else: val = fmt % val except: t, v= sys.exc_type, sys.exc_value if hasattr(sys, 'exc_info'): t, v = sys.exc_info()[:2] if val is None or not str(val): return args['null'] raise t, v else: # We duplicate the code here to avoid exception handler # which tends to screw up stack or leak if hasattr(val, fmt): val = getattr(val,fmt)() elif special_formats.has_key(fmt): val = special_formats[fmt](val, name, md) elif fmt=='': val='' else: val = fmt % val # finally, pump it through the actual string format... fmt=self.fmt if fmt=='s': val=str(val) else: val = ('%'+self.fmt) % (val,) # next, look for upper, lower, etc for f in self.modifiers: val=f(val) if have_arg('size'): size=args['size'] try: size=atoi(size) except: raise 'Document Error',( '''a size attribute was used in a var tag with a non-integer value.''') if len(val) > size: val=val[:size] l=rfind(val,' ') if l > size/2: val=val[:l+1] if have_arg('etc'): l=args['etc'] else: l='...' val=val+l return val __call__=render class Call: name='call' expr=None def __init__(self, args): args = parse_params(args, name='', expr='') name, expr = name_param(args,'call',1) if expr is None: expr=name else: expr=expr.eval self.simple_form=expr,None def url_quote(v, name='(Unknown name)', md={}): import urllib return urllib.quote(str(v)) def newline_to_br(v, name='(Unknown name)', md={}): v=str(v) if find(v,'\r') >= 0: v=join(split(v,'\r'),'') if find(v,'\n') >= 0: v=join(split(v,'\n'),'
    \n') return v def whole_dollars(v, name='(Unknown name)', md={}): try: return "$%d" % v except: return '' def dollars_and_cents(v, name='(Unknown name)', md={}): try: return "$%.2f" % v except: return '' def thousands_commas(v, name='(Unknown name)', md={}, thou=regex.compile( "\([0-9]\)\([0-9][0-9][0-9]\([,.]\|$\)\)").search): v=str(v) vl=split(v,'.') if not vl: return v v=vl[0] del vl[0] if vl: s='.'+join(vl,'.') else: s='' l=thou(v) while l >= 0: v=v[:l+1]+','+v[l+1:] l=thou(v) return v+s def whole_dollars_with_commas(v, name='(Unknown name)', md={}): try: v= "$%d" % v except: v='' return thousands_commas(v) def dollars_and_cents_with_commas(v, name='(Unknown name)', md={}): try: v= "$%.2f" % v except: v= '' return thousands_commas(v) def len_format(v, name='(Unknown name)', md={}): return str(len(v)) def len_comma(v, name='(Unknown name)', md={}): return thousands_commas(str(len(v))) StructuredText=None def structured_text(v, name='(Unknown name)', md={}): global StructuredText if StructuredText is None: import StructuredText return str(StructuredText.html_with_references(str(v), 3)) def sql_quote(v, name='(Unknown name)', md={}): """Quote single quotes in a string by doubling them. This is needed to securely insert values into sql string literals in templates that generate sql. """ if find(v,"'") >= 0: return join(split(v,"'"),"''") return v special_formats={ 'whole-dollars': whole_dollars, 'dollars-and-cents': dollars_and_cents, 'collection-length': len_format, 'structured-text': structured_text, # The rest are depricated: 'sql-quote': sql_quote, 'html-quote': html_quote, 'url-quote': url_quote, 'multi-line': newline_to_br, 'comma-numeric': thousands_commas, 'dollars-with-commas': whole_dollars_with_commas, 'dollars-and-cents-with-commas': dollars_and_cents_with_commas, } def spacify(val): if find(val,'_') >= 0: val=join(split(val,'_')) return val modifiers=(html_quote, url_quote, newline_to_br, string.lower, string.upper, string.capitalize, spacify, thousands_commas, sql_quote) modifiers=map(lambda f: (f.__name__, f), modifiers) class Comment: '''Comments The 'comment' tag can be used to simply include comments in DTML source. For example:: This text is not rendered. ''' name='comment' blockContinuations=() def __init__(self, args, fmt=''): pass def render(self, md): return '' __call__=render Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DT_With.py100644 1007 1403 13433 6671334614 23557 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''Nested namespace access The 'with' tag is used to introduce nested namespaces. The text enclosed in the with tag is rendered using information from the given variable or expression. For example, if the variable 'person' is bound to an object that has attributes 'name' and 'age', then a 'with' tag like the following can be used to access these attributes:: , Eather a 'name' or an 'expr' attribute may be used to specify data. A 'mapping' attribute may be used to indicate that the given data should be treated as mapping object, rather than as an object with named attributes. ''' __rcs_id__='$Id: DT_With.py,v 1.10 1999/03/10 00:15:08 klm Exp $' __version__='$Revision: 1.10 $'[11:-2] from DT_Util import parse_params, name_param, InstanceDict, render_blocks, str from DT_Util import TemplateDict class With: blockContinuations=() name='with' mapping=None only=0 def __init__(self, blocks): tname, args, section = blocks[0] args=parse_params(args, name='', expr='', mapping=1, only=1) name,expr=name_param(args,'with',1) if expr is None: expr=name else: expr=expr.eval self.__name__, self.expr = name, expr self.section=section.blocks if args.has_key('mapping') and args['mapping']: self.mapping=1 if args.has_key('only') and args['only']: self.only=1 def render(self, md): expr=self.expr if type(expr) is type(''): v=md[expr] else: v=expr(md) if not self.mapping: if type(v) is type(()) and len(v)==1: v=v[0] v=InstanceDict(v,md) if self.only: _md=md md=TemplateDict() if hasattr(_md, 'AUTHENTICATED_USER'): md.AUTHENTICATED_USER=_md.AUTHENTICATED_USER if hasattr(_md, 'validate'): md.validate=_md.validate md._push(v) try: return render_blocks(self.section, md) finally: md._pop(1) __call__=render Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DTtest.py100644 1007 1403 47613 6675550016 23473 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Document Template Tests """ __rcs_id__='$Id: DTtest.py,v 1.12 1999/03/22 23:19:42 jim Exp $' __version__='$Revision: 1.12 $'[11:-2] from DocumentTemplate import * import sys class Bruce: def __str__(self): return 'bruce' def __int__(self): return 42 def __float__(self): return 42.0 def keys(self): return ['bruce']*7 def values(self): return [self]*7 def items(self): return [('bruce',self)]*7 def __len__(self): return 7 def __getitem__(self,index): if (type(index) is type(1) and (index < 0 or index > 6)): raise IndexError, index return self isDocTemp=0 def __getattr__(self,name): if name[:1]=='_': raise AttributeError, name return self bruce=Bruce() class arg: def __init__(self,nn,aa): self.num, self.arg = nn, aa class argv: def __init__(self): import sys args=self.args=[] for aa in sys.argv[1:]: args.append(arg(len(args)+1,aa)) def items(self): return map(lambda a: ('spam%d' % a.num, a), self.args) def values(self): return self.args def test1(): aa=argv() ss=String( """\ %(comment)[ blah %(comment)] Test of documentation templates %(if args)[
    The arguments to this test program were:

      %(in args)[
    • Argument number %(num)d was %(arg)s %(in args)]

    %(if args)] %(else args)[ No arguments were given.

    %(else args)] And thats da trooth. """) print ss(aa) print 'num inaccessible:' # ss.names({'args':'args'}) print ss(aa) print 'quoted source:' print str(ss) try: ss(hello=1,world=2) print 'test if test failed' except: pass # Test nested templates a=arg(42,'bruce') a.header=HTML(" data :\n") print String("%(header)s number: %(num)d")(a) def test2(): # test1() aa=argv() print HTML( '''\ Test of documentation templates The arguments were: . Argument was No arguments were given.

    And I\'m 100% sure! ''')(aa) def test3(): test2() aa=argv() h=HTML( '''\ Test of documentation templates The arguments were: (- )

    .
    Argument was
    (- )
    No arguments were given.

    And I\'m 100% sure! ''') size,orphan=5,0 for end in range(20): end=end+1 print '='*60, '\n' print h(aa,size=size, orphan=orphan, end=end) def test3_okay(key, val): print 'Testing', key return 1 def test4(): def item(key,**kw): return (key,kw) def item2(key,**kw): return kw class item_class: def __init__(self,key,**kw): for k in kw.keys(): self.__dict__[k]=kw[k] items=( item( 1,dealer='Bay Chevy', make='Chevrolet', model='Caprice', year=96), item( 2,dealer='Bay Chevy', make='Chevrolet', model='Nova', year=96), item( 4,dealer='Bay Chevy', make='Chevrolet', model='Nova', year=96), item( 5,dealer='Bay Chevy', make='Chevrolet', model='Nova', year=96), item( 3,dealer='Bay Chevy', make='Chevrolet', model='Corvett', year=96), item( 6,dealer='Bay Chevy', make='Chevrolet', model='Lumina', year=96), item( 7,dealer='Bay Chevy', make='Chevrolet', model='Lumina', year=96), item( 8,dealer='Bay Chevy', make='Chevrolet', model='Lumina', year=95), item( 9,dealer='Bay Chevy', make='Chevrolet', model='Corsica', year=96), item(10,dealer='Bay Chevy', make='Chevrolet', model='Corsica', year=96), item(11,dealer='Bay Chevy', make='Toyota', model='Camry', year=95), item(12,dealer='Colman Olds', make='Olds', model='Ciera', year=96), item(12,dealer='Colman Olds', make='Olds', model='Ciera', year=96), item(12,dealer='Colman Olds', make='Olds', model='Ciera', year=96), item(12,dealer='Colman Olds', make='Olds', model='Cutlass', year=96), item(12,dealer='Colman Olds', make='Olds', model='Cutlas', year=95), item(12,dealer='Colman Olds', make='Dodge', model='Shadow', year=93), item(12,dealer='Colman Olds', make='Jeep', model='Cheroke', year=94), item(12,dealer='Colman Olds', make='Toyota', model='Previa', year=92), item(12,dealer='Colman Olds', make='Toyota', model='Celica', year=93), item(12,dealer='Colman Olds', make='Toyota', model='Camry', year=93), item(12,dealer='Colman Olds', make='Honda', model='Accord', year=94), item(12,dealer='Colman Olds', make='Honda', model='Accord', year=92), item(12,dealer='Colman Olds', make='Honda', model='Civic', year=94), item(12,dealer='Colman Olds', make='Honda', model='Civix', year=93), item( 1,dealer='Spam Chev', make='Chevrolet', model='Caprice', year=96), item( 2,dealer='Spam Chev', make='Chevrolet', model='Nova', year=96), item( 4,dealer='Spam Chev', make='Chevrolet', model='Nova', year=96), item( 5,dealer='Spam Chev', make='Chevrolet', model='Nova', year=96), item( 3,dealer='Spam Chev', make='Chevrolet', model='Corvett', year=96), item( 6,dealer='Spam Chev', make='Chevrolet', model='Lumina', year=96), item( 7,dealer='Spam Chev', make='Chevrolet', model='Lumina', year=96), item( 8,dealer='Spam Chev', make='Chevrolet', model='Lumina', year=95), item( 9,dealer='Spam Chev', make='Chevrolet', model='Corsica', year=96), item(10,dealer='Spam Chev', make='Chevrolet', model='Corsica', year=96), item(11,dealer='Spam Chevy', make='Toyota', model='Camry', year=95), item(12,dealer='Spam Olds', make='Olds', model='Ciera', year=96), item(12,dealer='Spam Olds', make='Olds', model='Ciera', year=96), item(12,dealer='Spam Olds', make='Olds', model='Ciera', year=96), item(12,dealer='Spam Olds', make='Olds', model='Cutlass', year=96), item(12,dealer='Spam Olds', make='Olds', model='Cutlas', year=95), item(12,dealer='Spam Olds', make='Dodge', model='Shadow', year=93), item(12,dealer='Spam Olds', make='Jeep', model='Cheroke', year=94), item(12,dealer='Spam Olds', make='Toyota', model='Previa', year=92), item(12,dealer='Spam Olds', make='Toyota', model='Celica', year=93), item(12,dealer='Spam Olds', make='Toyota', model='Camry', year=93), item(12,dealer='Spam Olds', make='Honda', model='Accord', year=94), item(12,dealer='Spam Olds', make='Honda', model='Accord', year=92), item(12,dealer='Spam Olds', make='Honda', model='Civic', year=94), item(12,dealer='Spam Olds', make='Honda', model='Civix', year=93), ) html=HTML( '''\ Inventory by Dealer

    ( - )

    ( - )
    ''') print html(inventory=items, first_ad=15) def test5(): html=HTML( '''\ Affiliate Manager Affiliate Menu
    Affiliate Manager Menu

    Select an affiliate to visit:

    Add an affiliate * Delete affiliates

    ''') print html(affiliates=[], URL1='www') def test6(): def d(**kw): return kw data=(d(name='jim', age=38), # d(name='kak', age=40), d(name='will', age=7), d(name='drew', age=4), d(name='ches', age=1), ) html=HTML( """Ages:\n --------------- for variable name: min: max: count: total: median: --------------- for variable age: min: max: count: total: median: mean: s.d. --------------- """) print html(data=data) def test7(): import DateTime html=HTML(""" is // """) html.names({'name':'name', 'date':'date'}) print html(date=DateTime.DateTime(), name='todays_date') def test8(): import DateTime html=String(""" %(name capitalize spacify)s is %(date fmt=year)s/%(date fmt=month)s/%(date fmt=day)s """) print html(date=DateTime.DateTime(), name='todays_date') def test9(): html=HTML( """ """) print html(spam=[[1,2,3],[4,5,6]]) def test9a(): html=HTML( """ """) print html(spam=[[1,2,3],[4,5,6]]) def test10(): #import Missing html=HTML( """ """) #' print html(spam=42) print html(spam=None) #print html(spam=Missing.Value) def test11(): #import Missing html=HTML( """ html: url: multi: dollars: cents: dollars,: cents,: """) print html(spam=4200000) print html(spam=None) print html(spam='\nfoo bar') # print html(spam=Missing.Value) class test12ob: def __init__(self,**kw): for k,v in kw.items(): self.__dict__[k]=v def puke(self): raise 'Puke', 'raaalf' def test12(): class foo: def __len__(self): return 9 def __getitem__(self,i): if i >= 9: raise IndexError, i return test12ob(index=i, value='item %s' % i) html=HTML( """ """) try: print html(spam=foo()) except: return raise 'DocumentTemplate bug', ( 'Puke error not properly propigated in test 12') def test13(): "Test automatic rendering of callable obnjects" class C: x=1 def y(self): return self.x*2 h=HTML("The h method, ") h2=HTML("The h2 method") print HTML(", , ")(C()) print HTML( """ , , """)(i=C()) def test14(): # test with tag class person: name='Jim' height_inches=73 print HTML(""" Hi, my name is My height is centimeters. """)(person=person) def test15(): # test raise tag try: print HTML(""" The raise tag test suceeded! """)() except IndexError, v: print v def main(): import traceback print 'Test 1', '='*60 try: test1() except: traceback.print_exc() print 'Test 2', '='*60 try: test2() except: traceback.print_exc() print 'Test 3', '='*60 try: test3() except: traceback.print_exc() print 'Test 4', '='*60 try: test4() except: traceback.print_exc() print 'Test 5', '='*60 try: test5() except: traceback.print_exc() print 'Test 6', '='*60 try: test6() except: traceback.print_exc() print 'Test 9', '='*60 try: test9() except: traceback.print_exc() print 'Test 9a', '='*60 try: test9a() except: traceback.print_exc() print 'Test 10', '='*60 try: test10() except: traceback.print_exc() print 'Test 11', '='*60 try: test11() except: traceback.print_exc() print 'Test 14', '='*60 try: test14() except: traceback.print_exc() print 'Test 15', '='*60 try: test15() except: traceback.print_exc() if __name__ == "__main__": try: command=sys.argv[1] except: command='main' globals()[command]() Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DTtestExpr.py100644 1007 1403 11222 6671334614 24315 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''short description $Id: DTtestExpr.py,v 1.6 1999/03/10 00:15:08 klm Exp $''' __version__='$Revision: 1.6 $'[11:-2] from DocumentTemplate import * import sys def test1(): print HTML('area code=')(phone='7035551212') def test2(): print HTML('area code=')(phone='7035551212') def test3(): print HTML('area code=')(phone='7035551212') def test4(): h=HTML( """ level was 1 level was 2 level was 3 level was something else """) for i in range(4): print '-' * 77 print i, h(level=i) print '-' * 77 if __name__ == "__main__": try: command=sys.argv[1] except: command='main' globals()[command]() Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DTtest_basicIn.py100644 1007 1403 11157 6671334614 25115 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## from DocumentTemplate import HTML, HTMLFile, String, File def d(**kw): return kw class D: def __init__(self, **kw): for k, v in kw.items(): self.__dict__[k]=v def __repr__(self): return "D(%s)" % `self.__dict__` xxx=(D(name=1), D(name=2), D(name=3)) data=( d(name='jim', age=39), d(name='kak', age=29), d(name='will', age=8), d(name='andrew', age=5), d(name='chessie',age=2), ) html=""" , Sorry, no data """ print '='*74 print HTML(html)(data=data, xxx=xxx) print '='*74 print HTML(html)(xxx=xxx) print '='*74 s=""" %(in data mapping)[ %(name)s, %(age)s %(else)[ %(in xxx)[ %(name)s %(in)] Sorry, no data %(in)] """ print '='*74 print String(s)(data=data, xxx=xxx) print '='*74 print String(s)(xxx=xxx) print '='*74 Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/DocumentTemplate.py100644 1007 1403 20356 6671334614 25531 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''Document templates with fill-in fields Document templates provide for creation of textual documents, such as HTML pages, from template source by inserting data from python objects and name-spaces. When a document template is created, a collection of default values to be inserted may be specified with a mapping object and with keyword arguments. A document templated may be called to create a document with values inserted. When called, an instance, a mapping object, and keyword arguments may be specified to provide values to be inserted. If an instance is provided, the document template will try to look up values in the instance using getattr, so inheritence of values is supported. If an inserted value is a function, method, or class, then an attempt will be made to call the object to obtain values. This allows instance methods to be included in documents. Document templates masquerade as functions, so the python object publisher (Bobo) will call templates that are stored as instances of published objects. Bobo will pass the object the template was found in and the HTTP request object. Two source formats are supported: Extended Python format strings (EPFS) -- This format is based on the insertion by name format strings of python with additional format characters, '[' and ']' to indicate block boundaries. In addition, parameters may be used within formats to control how insertion is done. For example: %%(date fmt=DayOfWeek upper)s causes the contents of variable 'date' to be inserted using custom format 'DayOfWeek' and with all lower case letters converted to upper case. HTML -- This format uses HTML server-side-include syntax with commands for inserting text. Parameters may be included to customize the operation of a command. For example: is used to insert the variable 'total' with the C format '12.2f'. Document templates support conditional and sequence insertion Document templates extend python string substitition rules with a mechanism that allows conditional insertion of template text and that allows sequences to be inserted with element-wise insertion of template text. Access Control Document templates provide a basic level of access control by preventing access to names beginning with an underscore. Addational control may be provided by providing document templates with a 'validate' method. This would typically be done by subclassing one or more of the DocumentTemplate classes. If provided, the the 'validate' method will be called when objects are accessed as accessed as instance attributes or when they are accessed through keyed access in an expression.. The 'validate' method will be called with five arguments: 1. The containing object that the object was accessed from, 2. The actual containing object that the object was found in, which may be different from the containing onject the object was accessed from, if the containing object supports acquisition, 3. The name used to acces the object, 4. The object, and 5. The namespace object used to render the document template. If a document template was called from Bobo, then the namespace object will have an attribute, AUTHENTICATED_USER that is the user object that was found if and when Bobo authenticated a user. Document Templates may be created 4 ways: DocumentTemplate.String -- Creates a document templated from a string using an extended form of python string formatting. DocumentTemplate.File -- Creates a document templated bound to a named file using an extended form of python string formatting. If the object is pickled, the file name, rather than the file contents is pickled. When the object is unpickled, then the file will be re-read to obtain the string. Note that the file will not be read until the document template is used the first time. DocumentTemplate.HTML -- Creates a document templated from a string using HTML server-side-include rather than python-format-string syntax. DocumentTemplate.HTMLFile -- Creates an HTML document template from a named file. ''' __version__='$Revision: 1.10 $'[11:-2] ParseError='Document Template Parse Error' from DT_String import String, File from DT_HTML import HTML, HTMLFile, HTMLDefault # import DT_UI # Install HTML editing from DT_Util import html_quote Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/Let.stx100644 1007 1403 2245 6736463440 23150 0ustar petrillipetrilliThe let tag: is a new tag that lets you create blocks like: * = Which yields: 1 * 0 = 0 2 * 1 = 2 3 * 2 = 6 4 * 3 = 12 The #let tag works like the #with tag, but is more flexible in that it allows you to make multiple assignments, and allows you to chain assignments, using earlier declarations in later assignments. Notice inthe ablove example, the 'result' variable is based on 'num' and 'index', both of which are assigned in the same #let expression. Syntacticly, each argument to be evalulated in the head of the let tag must be seperated by a newline. Enclosing an argument in double quotes causes it to be evaluated by the DTML expression machinery. Un-quoted arguments are referenced by name. Evaluation is in sequence with the result of earlier assignments available to later ones. Later assignments can also override earlier ones, which can be helpful for longer step-by-step calculations. The variables thus set are in effect for the life of the block. Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/Setup100644 1007 1403 124 6633067102 22650 0ustar petrillipetrilli*shared* cDocumentTemplate cDocumentTemplate.c -I../../Components/ExtensionClass Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/VSEval.py100644 1007 1403 16070 6751646136 23421 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Very Safe Python Expressions """ __rcs_id__='$Id: VSEval.py,v 1.22 1999/08/03 20:09:02 jim Exp $' __version__='$Revision: 1.22 $'[11:-2] from string import translate, strip import string gparse=None nltosp=string.maketrans('\r\n',' ') def default_slicer(env, s, *ind): l=len(ind) if l==2: return s[ind[0]:ind[1]] elif l==1: return s[ind[0]:] return s[:] def careful_mul(env, *factors): s=None r=1 for factor in factors: try: l=len(factor) s=1 except: l=factor if s and (l*r) > 1000: raise TypeError, 'Illegal sequence repeat' r=r*factor return r default_globals={ '__builtins__':{}, '__guarded_mul__': careful_mul, '__guarded_getattr__': lambda env, inst, name: getattr(inst, name), '__guarded_getitem__': lambda env, coll, key: coll[key], '__guarded_getslice__': default_slicer, } class Eval: """Provide a very-safe environment for evaluating expressions This class lets you overide operations, __power__, __mul__, __div__, __mod__, __add__, __sub__, __getitem__, __lshift__, __rshift__, __and__, __xor__, __or__,__pos__, __neg__, __not__, __repr__, __invert__, and __getattr__. For example, __mult__ might be overridden to prevent expressions like:: 'I like spam' * 100000000 or to disallow or limit attribute access. """ def __init__(self, expr, globals=default_globals): """Create a 'safe' expression where: expr -- a string containing the expression to be evaluated. globals -- A global namespace. """ global gparse if gparse is None: import gparse expr=strip(expr) self.__name__=expr expr=translate(expr,nltosp) self.expr=expr self.globals=globals co=compile(expr,'','eval') names=list(co.co_names) # Check for valid names, disallowing names that begin with '_' or # 'manage'. This is a DC specific rule and probably needs to be # made customizable! for name in names: if name[:1]=='_' and name not in ('_', '_vars', '_getattr'): raise TypeError, 'illegal name used in expression' used={} i=0 code=co.co_code l=len(code) LOAD_NAME=101 HAVE_ARGUMENT=90 def HAS_ARG(op): ((op) >= HAVE_ARGUMENT) while(i < l): c=ord(code[i]) if c==LOAD_NAME: name=names[ord(code[i+1])+256*ord(code[i+2])] used[name]=1 i=i+3 elif c >= HAVE_ARGUMENT: i=i+3 else: i=i+1 self.code=gparse.compile(expr,'','eval') self.used=tuple(used.keys()) def eval(self, mapping): d={'_vars': mapping} code=self.code globals=self.globals for name in self.used: try: d[name]=mapping.getitem(name,0) except KeyError: if name=='_getattr': d['__builtins__']=globals exec compiled_getattr in d return eval(code,globals,d) def __call__(self, **kw): return eval(self.code, self.globals, kw) compiled_getattr=compile( 'def _getattr(o,n): return __guarded_getattr__(_vars,o,n)', '','exec') Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/__init__.py100644 1007 1403 10166 6720040203 23773 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Package wrapper for Document Template This wrapper allows the (now many) document template modules to be segregated in a separate package. $Id: __init__.py,v 1.14 1999/05/17 16:14:59 jim Exp $''' __version__='$Revision: 1.14 $'[11:-2] import ExtensionClass # work-around for import bug. from DocumentTemplate import String, File, HTML, HTMLDefault, HTMLFile from DocumentTemplate import html_quote Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/cDocumentTemplate.c100644 1007 1403 64672 6762542471 25502 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ static char cDocumentTemplate_module_documentation[] = "" "\n$Id: cDocumentTemplate.c,v 1.29 1999/08/30 17:54:01 brian Exp $" ; #include "ExtensionClass.h" static PyObject *py_isDocTemp=0, *py_blocks=0, *py_=0, *join=0, *py_acquire; static PyObject *py___call__, *py___roles__, *py_AUTHENTICATED_USER; static PyObject *py_hasRole, *py__proxy_roles, *py_Unauthorized; static PyObject *py_Unauthorized_fmt, *py_validate; static PyObject *py__push, *py__pop, *py_aq_base; /* ----------------------------------------------------- */ static void PyVar_Assign(PyObject **v, PyObject *e) { Py_XDECREF(*v); *v=e;} #define ASSIGN(V,E) PyVar_Assign(&(V),(E)) #define UNLESS(E) if (!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E); UNLESS(V) #define OBJECT(O)(((PyObject*)O)) typedef struct { PyObject_HEAD PyObject *inst; PyObject *cache; PyObject *namespace; PyObject *validate; } InstanceDictobject; staticforward PyExtensionClass InstanceDictType; static PyObject * InstanceDict___init__(InstanceDictobject *self, PyObject *args) { self->validate=NULL; UNLESS(PyArg_ParseTuple(args, "OO|O", &(self->inst), &(self->namespace), &(self->validate))) return NULL; Py_INCREF(self->inst); Py_INCREF(self->namespace); if (self->validate) Py_INCREF(self->validate); else UNLESS(self->validate=PyObject_GetAttr(self->namespace, py_validate)) return NULL; UNLESS(self->cache=PyDict_New()) return NULL; Py_INCREF(Py_None); return Py_None; } static struct PyMethodDef InstanceDict_methods[] = { {"__init__", (PyCFunction)InstanceDict___init__, 1, ""}, {NULL, NULL} /* sentinel */ }; /* ---------- */ static void InstanceDict_dealloc(InstanceDictobject *self) { Py_XDECREF(self->inst); Py_XDECREF(self->cache); Py_XDECREF(self->namespace); Py_XDECREF(self->validate); Py_DECREF(self->ob_type); PyMem_DEL(self); } static PyObject * InstanceDict_getattr(InstanceDictobject *self, PyObject *name) { return Py_FindAttr((PyObject *)self, name); } static PyObject * InstanceDict_repr(InstanceDictobject *self) { return PyObject_Repr(self->inst); } /* Code to access InstanceDict objects as mappings */ static int InstanceDict_length( InstanceDictobject *self) { return 1; } static PyObject * InstanceDict_subscript( InstanceDictobject *self, PyObject *key) { PyObject *r, *v; char *name; /* Try to get value from the cache */ if (r=PyObject_GetItem(self->cache, key)) return r; PyErr_Clear(); /* Check for __str__ */ UNLESS(name=PyString_AsString(key)) return NULL; if (*name=='_') { UNLESS(strcmp(name,"__str__")==0) goto KeyError; return PyObject_Str(self->inst); } /* Do explicit acquisition with "roles" rule */ if (r=PyObject_GetAttr(self->inst, py_acquire)) { /* Sanity check in case of explicit Aq */ if (v=PyObject_GetAttr(self->inst, key)) Py_DECREF(v); else { Py_DECREF(r); goto KeyError; } if (self->validate != Py_None) { UNLESS_ASSIGN(r,PyObject_CallFunction( r, "OOO", key, self->validate, self->namespace)) { PyObject *tb; PyErr_Fetch(&r, &v, &tb); if (r != PyExc_AttributeError || PyObject_Compare(v,key)) { PyErr_Restore(r,v,tb); return NULL; } Py_XDECREF(r); Py_XDECREF(v); Py_XDECREF(tb); goto KeyError; } } else UNLESS_ASSIGN(r, PyObject_GetAttr(self->inst, key)) goto KeyError; } else { PyErr_Clear(); /* OK, use getattr */ UNLESS(r=PyObject_GetAttr(self->inst, key)) goto KeyError; if (self->validate != Py_None) { UNLESS(v=PyObject_CallFunction( self->validate,"OOOOO", self->inst, self->inst, key, r, self->namespace)) return NULL; Py_DECREF(v); } } if (r && PyObject_SetItem(self->cache, key, r) < 0) PyErr_Clear(); return r; KeyError: PyErr_SetObject(PyExc_KeyError, key); return NULL; } static int InstanceDict_ass_sub( InstanceDictobject *self, PyObject *v, PyObject *w) { PyErr_SetString(PyExc_TypeError, "InstanceDict objects do not support item assignment"); return -1; } static PyMappingMethods InstanceDict_as_mapping = { (inquiry)InstanceDict_length, /*mp_length*/ (binaryfunc)InstanceDict_subscript, /*mp_subscript*/ (objobjargproc)InstanceDict_ass_sub, /*mp_ass_subscript*/ }; /* -------------------------------------------------------- */ static char InstanceDicttype__doc__[] = "" ; static PyExtensionClass InstanceDictType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "InstanceDict", /*tp_name*/ sizeof(InstanceDictobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)InstanceDict_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*obsolete tp_getattr*/ (setattrfunc)0, /*obsolete tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)InstanceDict_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &InstanceDict_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)InstanceDict_getattr, /*tp_getattro*/ 0, /*tp_setattro*/ /* Space for future expansion */ 0L,0L, InstanceDicttype__doc__, /* Documentation string */ METHOD_CHAIN(InstanceDict_methods) }; typedef struct { PyObject_HEAD int level; PyObject *dict; PyObject *data; } MM; staticforward PyExtensionClass MMtype; static PyObject * MM_push(self, args) MM *self; PyObject *args; { PyObject *src; UNLESS(PyArg_Parse(args, "O", &src)) return NULL; UNLESS(-1 != PyList_Append(self->data,src)) return NULL; Py_INCREF(Py_None); return Py_None; } static PyObject * MM_pop(self, args) MM *self; PyObject *args; { int i=1, l; PyObject *r; if (args) UNLESS(PyArg_Parse(args, "i", &i)) return NULL; if ((l=PyList_Size(self->data)) < 0) return NULL; i=l-i; UNLESS(r=PySequence_GetItem(self->data,l-1)) return NULL; if (PyList_SetSlice(self->data,i,l,NULL) < 0) goto err; return r; err: Py_DECREF(r); return NULL; } static PyObject * MM__init__(self, args) MM *self; PyObject *args; { UNLESS(PyArg_Parse(args, "")) return NULL; UNLESS(self->data=PyList_New(0)) return NULL; self->dict=NULL; self->level=0; Py_INCREF(Py_None); return Py_None; } static PyObject * MM_cget(MM *self, PyObject *key, int call) { long i; int dt=0; PyObject *e, *t, *rr, *tb; UNLESS(-1 != (i=PyList_Size(self->data))) return NULL; while (--i >= 0) { e=PyList_GetItem(self->data,i); if (e=PyObject_GetItem(e,key)) { dt=0; if (PyCallable_Check(e)) { /* Decide whether we have a document template */ if (rr=PyObject_GetAttr(e,py_isDocTemp)) { if (PyObject_IsTrue(rr)) dt=1; Py_DECREF(rr); } else PyErr_Clear(); /* Try calling the object */ if (call) { if (dt) { ASSIGN(e,PyObject_CallFunction(e,"OO", Py_None, self)); UNLESS(e) return NULL; } else { rr=PyObject_CallObject(e,NULL); if (rr) ASSIGN(e,rr); else { PyErr_Fetch(&t, &rr, &tb); if (t!=PyExc_AttributeError || PyObject_Compare(rr,py___call__) != 0) { PyErr_Restore(t,rr,tb); Py_DECREF(e); return NULL; } /* Added by Brian on 08/30/99. We need to be sure to DECREF the exception in the event of an AttributeError to avoid leaking. */ else { Py_XDECREF(t); Py_XDECREF(rr); Py_XDECREF(tb); } } } } } return e; } PyErr_Fetch(&e, &rr, &tb); if (dt || e != PyExc_KeyError) { PyErr_Restore(e,rr,tb); return NULL; } Py_XDECREF(e); Py_XDECREF(rr); Py_XDECREF(tb); } PyErr_SetObject(PyExc_KeyError,key); return NULL; } static PyObject * MM_get(MM *self, PyObject *args) { PyObject *key, *call=Py_None; UNLESS(PyArg_ParseTuple(args,"O|O",&key,&call)) return NULL; return MM_cget(self, key, PyObject_IsTrue(call)); } static PyObject * MM_has_key(MM *self, PyObject *args) { PyObject *key; UNLESS(PyArg_ParseTuple(args,"O",&key)) return NULL; if ((key=MM_cget(self, key, 0))) { Py_DECREF(key); return PyInt_FromLong(1); } PyErr_Clear(); return PyInt_FromLong(0); } static struct PyMethodDef MM_methods[] = { {"__init__", (PyCFunction)MM__init__, 0, "__init__() -- Create a new empty multi-mapping"}, {"_push", (PyCFunction) MM_push, 0, "_push(mapping_object) -- Add a data source"}, {"_pop", (PyCFunction) MM_pop, 0, "_pop() -- Remove and return the last data source added"}, {"getitem", (PyCFunction) MM_get, METH_VARARGS, "getitem(key[,call]) -- Get a value\n\n" "Normally, callable objects that can be called without arguments are\n" "called during retrieval. This can be suppressed by providing a\n" "second argument that is false.\n" }, {"has_key", (PyCFunction) MM_has_key, METH_VARARGS, "has_key(key) -- Test whether the mapping has the given key" }, {NULL, NULL} /* sentinel */ }; static void MM_dealloc(self) MM *self; { Py_XDECREF(self->data); Py_XDECREF(self->dict); Py_DECREF(self->ob_type); PyMem_DEL(self); } static PyObject * MM_getattro(MM *self, PyObject *name) { if (PyString_Check(name)) { if (strcmp(PyString_AsString(name),"level")==0) return PyInt_FromLong(self->level); } if (self->dict) { PyObject *v; if (v=PyDict_GetItem(self->dict, name)) { Py_INCREF(v); return v; } } return Py_FindAttr((PyObject *)self, name); } static int MM_setattro(MM *self, PyObject *name, PyObject *v) { if (v && PyString_Check(name)) { if (strcmp(PyString_AsString(name),"level")==0) { self->level=PyInt_AsLong(v); if (PyErr_Occurred()) return -1; return 0; } } if (! self->dict && ! (self->dict=PyDict_New())) return -1; if (v) return PyDict_SetItem(self->dict, name, v); else return PyDict_DelItem(self->dict, name); } static int MM_length(self) MM *self; { long l=0, el, i; PyObject *e=0; UNLESS(-1 != (i=PyList_Size(self->data))) return -1; while (--i >= 0) { e=PyList_GetItem(self->data,i); UNLESS(-1 != (el=PyObject_Length(e))) return -1; l+=el; } return l; } static PyObject * MM_subscript(MM *self, PyObject *key) { return MM_cget(self, key, 1); } typedef struct { PyObject_HEAD PyObject *data; } DictInstance; static void DictInstance_dealloc(DictInstance *self) { Py_DECREF(self->data); PyMem_DEL(self); } static PyObject * DictInstance_getattr(DictInstance *self, PyObject *name) { PyObject *r; if ((r=PyObject_GetItem(self->data, name))) return r; PyErr_SetObject(PyExc_AttributeError, name); return NULL; } static PyTypeObject DictInstanceType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "DictInstance", /*tp_name*/ sizeof(DictInstance), /*tp_basicsize*/ 0, /*tp_itemsize*/ (destructor)DictInstance_dealloc, (printfunc)0, (getattrfunc)0, (setattrfunc)0, (cmpfunc)0, (reprfunc)0, 0, 0, 0, (hashfunc)0, (ternaryfunc)0, (reprfunc)0, (getattrofunc)DictInstance_getattr, (setattrofunc)0, 0L,0L, "Wrap a mapping object to look like an instance" }; static DictInstance * newDictInstance(PyObject *data) { DictInstance *self; UNLESS(self = PyObject_NEW(DictInstance, &DictInstanceType)) return NULL; self->data=data; Py_INCREF(data); return self; } static PyObject * MM_call(MM *self, PyObject *args, PyObject *kw) { PyObject *r; int i, l=0; if (args && (l=PyTuple_Size(args)) < 0) return NULL; if (l) { UNLESS(r=PyObject_CallObject(OBJECT(self->ob_type), NULL)) return NULL; for (i=0; i < l; i++) if (PyList_Append(((MM*)r)->data, PyTuple_GET_ITEM(args, i)) < 0) goto err; if (kw && PyList_Append(((MM*)r)->data, kw) < 0) goto err; } else { if (!kw) { Py_INCREF(Py_None); return Py_None; } r=kw; Py_INCREF(r); } ASSIGN(r, OBJECT(newDictInstance(r))); return r; err: Py_XDECREF(r); return NULL; } static PyMappingMethods MM_as_mapping = { (inquiry)MM_length, /*mp_length*/ (binaryfunc)MM_subscript, /*mp_subscript*/ (objobjargproc)NULL, /*mp_ass_subscript*/ }; /* -------------------------------------------------------- */ static char MMtype__doc__[] = "TemplateDict -- Combine multiple mapping objects for lookup" ; static PyExtensionClass MMtype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "TemplateDict", /*tp_name*/ sizeof(MM), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)MM_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &MM_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)MM_call, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)MM_getattro, /*tp_getattro*/ (setattrofunc)MM_setattro, /*tp_setattro*/ /* Space for future expansion */ 0L,0L, MMtype__doc__, /* Documentation string */ METHOD_CHAIN(MM_methods) }; static struct PyMethodDef TemplateDict_methods[] = { {NULL, NULL} /* sentinel */ }; /* List of methods defined in the module */ static int if_finally(PyObject *md, int err) { PyObject *t, *v, *tb; if (err) PyErr_Fetch(&t, &v, &tb); md=PyObject_GetAttr(md,py__pop); if (md) ASSIGN(md, PyObject_CallObject(md,NULL)); if (err) PyErr_Restore(t,v,tb); if (md) { Py_DECREF(md); return -1; } else return -2; } static int render_blocks_(PyObject *blocks, PyObject *rendered, PyObject *md, PyObject *mda) { PyObject *block; int l, i, k=0, append; if ((l=PyList_Size(blocks)) < 0) return -1; for (i=0; i < l; i++) { block=PyList_GET_ITEM(((PyListObject*)blocks), i); append=1; if (PyTuple_Check(block)) { int bs; bs=((PyTupleObject*)block)->ob_size; if (bs==1) { /* Simple var */ block=PyTuple_GET_ITEM(block,0); if (PyString_Check(block)) block=PyObject_GetItem(md,block); else block=PyObject_CallObject(block,mda); if (block) ASSIGN(block, PyObject_Str(block)); UNLESS(block) return -1; } else { /* if */ int icond, m; PyObject *cond, *n, *cache; UNLESS(cache=PyDict_New()) return -1; cond=PyObject_GetAttr(md,py__push); if (cond) ASSIGN(cond, PyObject_CallFunction(cond,"O",cache)); Py_DECREF(cache); if (cond) Py_DECREF(cond); else return -1; append=0; m=bs-1; for (icond=0; icond < m; icond += 2) { cond=PyTuple_GET_ITEM(block,icond); if (PyString_Check(cond)) { /* We have to be careful to handle key errors here */ n=cond; if (cond=PyObject_GetItem(md,cond)) { if (PyDict_SetItem(cache, n, cond) < 0) { Py_DECREF(cond); return if_finally(md,1); } } else { PyObject *t, *v, *tb; PyErr_Fetch(&t, &v, &tb); if (t != PyExc_KeyError || PyObject_Compare(v,n)) { PyErr_Restore(t,v,tb); return if_finally(md,1); } Py_XDECREF(t); Py_XDECREF(v); Py_XDECREF(tb); cond=Py_None; Py_INCREF(cond); } } else UNLESS(cond=PyObject_CallObject(cond,mda)) return if_finally(md,1); if (PyObject_IsTrue(cond)) { Py_DECREF(cond); block=PyTuple_GET_ITEM(block,icond+1); if (block!=Py_None && render_blocks_(block, rendered, md, mda) < 0) return if_finally(md,1); m=-1; break; } else Py_DECREF(cond); } if (icond==m) { block=PyTuple_GET_ITEM(block,icond); if (block!=Py_None && render_blocks_(block, rendered, md, mda) < 0) return if_finally(md,1); } if (if_finally(md,0) == -2) return -1; } } else if (PyString_Check(block)) { Py_INCREF(block); } else { UNLESS(block=PyObject_CallObject(block,mda)) return -1; } if (append && PyObject_IsTrue(block)) { k=PyList_Append(rendered,block); Py_DECREF(block); if (k < 0) return -1; } } return 0; } static PyObject * render_blocks(PyObject *self, PyObject *args) { PyObject *md, *blocks, *mda=0, *rendered=0; int l; UNLESS(PyArg_ParseTuple(args,"OO", &blocks, &md)) return NULL; UNLESS(rendered=PyList_New(0)) goto err; UNLESS(mda=Py_BuildValue("(O)",md)) goto err; if (render_blocks_(blocks, rendered, md, mda) < 0) goto err; Py_DECREF(mda); l=PyList_Size(rendered); if (l==0) { Py_INCREF(py_); ASSIGN(rendered, py_); } else if (l==1) ASSIGN(rendered, PySequence_GetItem(rendered,0)); else ASSIGN(rendered, PyObject_CallFunction(join,"OO",rendered,py_)); return rendered; err: Py_XDECREF(mda); Py_XDECREF(rendered); return NULL; } static struct PyMethodDef Module_Level__methods[] = { {"render_blocks", (PyCFunction)render_blocks, METH_VARARGS, ""}, {NULL, (PyCFunction)NULL, 0, NULL} /* sentinel */ }; static PyObject * validate(PyObject *self, PyObject *args) { PyObject *inst, *parent, *name, *value, *md, *__roles__, *i, *p; char *cname; long ir; /* def validate(self, inst, parent, name, value, md): */ UNLESS(PyArg_ParseTuple(args,"OOOOO",&inst,&parent,&name,&value,&md)) return NULL; if (PyString_Check(name)) { UNLESS(cname=PyString_AsString(name)) return NULL; if (*cname=='a' && cname[1]=='q' && cname[2]=='_' && strcmp(cname, "aq_explicit") && strcmp(cname, "aq_parent")) /* We disallow names beginning with "aq_" unless they are aq_parent or aq_explicit */ return PyInt_FromLong(0); } /* if hasattr(value, '__roles__'): roles=value.__roles__ else: if hasattr(parent,'__roles__'): roles=parent.__roles__ elif hasattr(parent, 'aq_acquire'): try: roles=parent.aq_acquire('__roles__') except AttributeError: if hasattr(inst, 'aq_base'): inst=inst.aq_base if hasattr(parent, 'aq_base'): parent=parent.aq_base return inst is parent else: if hasattr(inst, 'aq_base'): inst=inst.aq_base if hasattr(parent, 'aq_base'): parent=parent.aq_base return inst is parent value=parent */ UNLESS(__roles__=PyObject_GetAttr(value,py___roles__)) { PyErr_Clear(); UNLESS(__roles__=PyObject_GetAttr(parent,py___roles__)) { PyErr_Clear(); if (__roles__=PyObject_GetAttr(parent,py_acquire)) { ASSIGN(__roles__, PyObject_CallFunction(__roles__, "O", py___roles__)); } } value=parent; } if (! __roles__) { PyErr_Clear(); /* Waaaa, check for wrapped objects, waaaaa! */ UNLESS(i=PyObject_GetAttr(inst, py_aq_base)) { PyErr_Clear(); Py_INCREF(inst); i=inst; } UNLESS(p=PyObject_GetAttr(parent, py_aq_base)) { PyErr_Clear(); Py_INCREF(parent); p=parent; } ir = i==p; Py_DECREF(i); Py_DECREF(p); return PyInt_FromLong(ir); } /* if roles is None: return 1 */ if (__roles__==Py_None) { Py_DECREF(__roles__); return PyInt_FromLong(1); } /* try: if md.AUTHENTICATED_USER.hasRole(value, roles): return 1 except AttributeError: pass */ if (md=PyObject_GetAttr(md,py_AUTHENTICATED_USER)) { ASSIGN(md,PyObject_GetAttr(md,py_hasRole)); if (md) ASSIGN(md,PyObject_CallFunction(md,"OO",value,__roles__)); if (md) { if (PyObject_IsTrue(md)) { Py_DECREF(__roles__); return md; } Py_DECREF(md); } else PyErr_Clear(); } else PyErr_Clear(); /* for r in self._proxy_roles: if r in roles: return 1 */ if (PyObject_IsTrue(__roles__)) if ((md=PyObject_GetAttr(self, py__proxy_roles))) { int i,l, isIn; PyObject *role; if ((l=PyObject_Length(md)) < 0) PyErr_Clear(); else { for (i=0; i < l; i++) { UNLESS(role=PySequence_GetItem(md,i)) { PyErr_Clear(); break; } isIn=PySequence_In(__roles__,role); Py_DECREF(role); if (isIn < 0) { PyErr_Clear(); break; } if (isIn) { Py_DECREF(md); return __roles__; /* Any true object would do. */ } } } Py_DECREF(md); } else PyErr_Clear(); Py_DECREF(__roles__); /* raise 'Unauthorized', ( 'You are not authorized to access %s.' % name) */ if (name=PyString_Format(py_Unauthorized_fmt, name)) { PyErr_SetObject(py_Unauthorized, name); Py_DECREF(name); } return NULL; } static struct PyMethodDef Document_methods[] = { {"validate", (PyCFunction)validate, METH_VARARGS, ""}, {NULL, (PyCFunction)NULL, 0, NULL} /* sentinel */ }; /* Initialization function for the module (*must* be called initcDocumentTemplate) */ void initcDocumentTemplate() { PyObject *m, *d; char *rev="$Revision: 1.29 $"; PURE_MIXIN_CLASS(cDocument, "Base class for documents that adds fast validation method", Document_methods); UNLESS(py_isDocTemp=PyString_FromString("isDocTemp")) return; UNLESS(py_blocks=PyString_FromString("blocks")) return; UNLESS(py_acquire=PyString_FromString("aq_acquire")) return; UNLESS(py___call__=PyString_FromString("__call__")) return; UNLESS(py___roles__=PyString_FromString("__roles__")) return; UNLESS(py__proxy_roles=PyString_FromString("_proxy_roles")) return; UNLESS(py_hasRole=PyString_FromString("hasRole")) return; UNLESS(py_validate=PyString_FromString("validate")) return; UNLESS(py__push=PyString_FromString("_push")) return; UNLESS(py__pop=PyString_FromString("_pop")) return; UNLESS(py_aq_base=PyString_FromString("aq_base")) return; UNLESS(py_Unauthorized=PyString_FromString("Unauthorized")) return; UNLESS(py_Unauthorized_fmt=PyString_FromString( "You are not authorized to access %s.")) return; UNLESS(py_AUTHENTICATED_USER=PyString_FromString("AUTHENTICATED_USER")) return; UNLESS(py_=PyString_FromString("")) return; UNLESS(join=PyImport_ImportModule("string")) return; ASSIGN(join,PyObject_GetAttrString(join,"join")); UNLESS(join) return; UNLESS(ExtensionClassImported) return; m = Py_InitModule4("cDocumentTemplate", Module_Level__methods, cDocumentTemplate_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); d = PyModule_GetDict(m); PyExtensionClass_Export(d,"cDocument",cDocumentType); PyExtensionClass_Export(d,"InstanceDict",InstanceDictType); PyExtensionClass_Export(d,"TemplateDict",MMtype); PyDict_SetItemString(d, "__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); if (PyErr_Occurred()) Py_FatalError("can't initialize module cDocumentTemplate"); } Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/gparse.py100644 1007 1403 25342 6674213227 23537 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## "$Id: gparse.py,v 1.10 1999/03/18 15:07:03 brian Exp $" import sys, parser, symbol, token from symbol import test, suite, argument, arith_expr, shift_expr from symbol import subscriptlist, subscript, comparison, trailer, xor_expr from symbol import term, not_test, factor, atom, expr, arglist from symbol import power, and_test, and_expr from token import STAR, NAME, RPAR, LPAR, NUMBER, DOT, STRING, COMMA from token import ISTERMINAL, LSQB, COLON from parser import sequence2ast, compileast, ast2list ParseError='Expression Parse Error' def munge(ast, STAR=STAR, DOT=DOT, LSQB=LSQB, COLON=COLON, trailer=trailer): ast0=ast[0] if ISTERMINAL(ast0): return else: if ast0==term and len(ast) > 2: keep_going=1 while keep_going: keep_going=0 start=2 for i in range(start,len(ast)-1): if ast[i][0]==STAR: ast[i-1:i+2]=[multi_munge(ast[i-1:i+2])] keep_going=1 break for a in ast[1:]: munge(a) elif ast0==power: keep_going=1 while keep_going: keep_going=0 start=2 for i in range(start,len(ast)): a=ast[i] if a[0]==trailer: if a[1][0]==DOT: ast[:i+1]=dot_munge(ast,i) keep_going=1 start=3 break if a[1][0]==LSQB: if (a[2][0] != subscriptlist or a[2][1][0] != subscript): raise ParseError, ( 'Unexpected form after left square brace') slist=a[2] if len(slist)==2: # One subscript, check for range and ... sub=slist[1] if sub[1][0]==DOT: raise ParseError, ( 'ellipses are not supported') l=len(sub) if l < 3 and sub[1][0] != COLON: ast[:i+1]=item_munge(ast, i) elif l < 5: ast[:i+1]=slice_munge(ast, i) else: raise ParseError, 'Invalid slice' else: ast[:i+1]=item_munge(ast, i) keep_going=1 start=3 break for a in ast[1:]: munge(a) else: for a in ast[1:]: munge(a) return ast def slice_munge(ast, i): # Munge a slice access into a function call # Note that we must account for a[:], a[b:], a[:b], and a[b:c] name=ast[i][2][1] args=[arglist] append=args.append a=(factor, (power, (atom, (NAME, '_vars')))) a=(argument, (test, (and_test, (not_test, (comparison, (expr, (xor_expr, (and_expr, (shift_expr, (arith_expr, (term, a))))))))))) append(a) append([COMMA,',']) a=ast[:i] a=(argument, (test, (and_test, (not_test, (comparison, (expr, (xor_expr, (and_expr, (shift_expr, (arith_expr, (term, (factor, a)))))))))))) append(a) sub=ast[i][2][1] l=len(sub) if sub[1][0]==COLON: if l==3: append([COMMA,',']) a=(argument, (test, (and_test, (not_test, (comparison, (expr, (xor_expr, (and_expr, (shift_expr, (arith_expr, (term, (factor, (power, (atom, (NUMBER, '0'))))))))))))))) append(a) append([COMMA,',']) append([argument, sub[2]]) else: append([COMMA,',']) append([argument, sub[1]]) if l==4: append([COMMA,',']) append([argument, sub[3]]) return [power, [atom, [NAME, '__guarded_getslice__']], [trailer, [LPAR, '('], args, [RPAR, ')'], ] ] def item_munge(ast, i): # Munge an item access into a function call name=ast[i][2][1] args=[arglist] append=args.append a=(factor, (power, (atom, (NAME, '_vars')))) a=(argument, (test, (and_test, (not_test, (comparison, (expr, (xor_expr, (and_expr, (shift_expr, (arith_expr, (term, a))))))))))) append(a) append([COMMA,',']) a=ast[:i] a=(argument, (test, (and_test, (not_test, (comparison, (expr, (xor_expr, (and_expr, (shift_expr, (arith_expr, (term, (factor, a)))))))))))) append(a) append([COMMA,',']) for sub in ast[i][2][1:]: if sub[0]==COMMA: append(sub) else: if len(sub) != 2: raise ParseError, 'Invalid slice in subscript' append([argument, sub[1]]) return [power, [atom, [NAME, '__guarded_getitem__']], [trailer, [LPAR, '('], args, [RPAR, ')'], ] ] def dot_munge(ast, i): # Munge an attribute access into a function call name=ast[i][2][1] args=[arglist] append=args.append a=(factor, (power, (atom, (NAME, '_vars')))) a=(argument, (test, (and_test, (not_test, (comparison, (expr, (xor_expr, (and_expr, (shift_expr, (arith_expr, (term, a))))))))))) append(a) append([COMMA,',']) a=ast[:i] a=(argument, (test, (and_test, (not_test, (comparison, (expr, (xor_expr, (and_expr, (shift_expr, (arith_expr, (term, (factor, a)))))))))))) append(a) append([COMMA,',']) a=(factor, (power, (atom, (STRING, `name`)))) a=(argument, (test, (and_test, (not_test, (comparison, (expr, (xor_expr, (and_expr, (shift_expr, (arith_expr, (term, a))))))))))) append(a) return [power, [atom, [NAME, '__guarded_getattr__']], [trailer, [LPAR, '('], args, [RPAR, ')']], ] def multi_munge(ast): # Munge a multiplication into a function call: __guarded_mul__ args=[arglist] append=args.append a=(factor, (power, (atom, (NAME, '_vars')))) a=(argument, (test, (and_test, (not_test, (comparison, (expr, (xor_expr, (and_expr, (shift_expr, (arith_expr, (term, a))))))))))) append(a) append([COMMA,',']) for a in ast: if a[0]==STAR: args.append([COMMA,',']) else: a=(argument, (test, (and_test, (not_test, (comparison, (expr, (xor_expr, (and_expr, (shift_expr, (arith_expr, (term, a))))))))))) append(a) return [factor, [power, [atom, [NAME, '__guarded_mul__']], [trailer, [LPAR, '('], args, [RPAR, ')'], ]]] def compile(src, file_name, ctype): if ctype=='eval': ast=parser.expr(src) elif ctype=='exec': ast=parser.suite(src) l=ast2list(ast) l=munge(l) ast=sequence2ast(l) return parser.compileast(ast, file_name) Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/gparse_test.py100644 1007 1403 14505 6671334614 24576 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## "$Id: gparse_test.py,v 1.3 1999/03/10 00:15:08 klm Exp $" import sys, parser, symbol, token from symbol import * from token import * from parser import sequence2ast, compileast, ast2list from gparse import * def pretty(s): l=ast2list(parser.expr(s)) print l pret(l) def astl(s): return parser.ast2list(parser.expr(s)) def pret(ast, level=0): if ISTERMINAL(ast[0]): print ' '*level, ast[1] else: print ' '*level, sym_name[ast[0]], '(%s)' % ast[0] for a in ast[1:]: pret(a,level+1) def tpretty(): print 60*'=' for arg in sys.argv[1:]: print print arg pretty(arg) print 60*'=' def check(expr1=None, expr2=None): ok=1 expr1=expr1 or sys.argv[1] expr2=expr2 or sys.argv[2] l1=munge(astl(expr1)) l2=astl(expr2) try: c1=compileast(sequence2ast(l1)) except: traceback.print_exc c1=None c2=compileast(sequence2ast(l2)) if c1 !=c2: ok=0 print 'test failed', expr1, expr2 print print l1 print print l2 print ast=parser.sequence2ast(l1) c=parser.compileast(ast) pretty(expr1) pret(l1) pret(l2) return ok def spam(): # Regression test import traceback ok=1 for expr1, expr2 in ( ("a*b", "__guarded_mul__(_vars, a, b)"), ("a*b*c", "__guarded_mul__(_vars, __guarded_mul__(_vars, a, b), c)" ), ("a.b", "__guarded_getattr__(_vars, a, 'b')"), ("a[b]", "__guarded_getitem__(_vars, a, b)"), ("a[b,c]", "__guarded_getitem__(_vars, a, b, c)"), ("a[b:c]", "__guarded_getslice__(_vars, a, b, c)"), ("a[:c]", "__guarded_getslice__(_vars, a, 0, c)"), ("a[b:]", "__guarded_getslice__(_vars, a, b)"), ("a[:]", "__guarded_getslice__(_vars, a)"), ("_vars['sequence-index'] % 2", "__guarded_getitem__(_vars, _vars, 'sequence-index') % 2" ), ): l1=munge(astl(expr1)) l2=astl(expr2) try: c1=compileast(sequence2ast(l1)) except: traceback.print_exc c1=None c2=compileast(sequence2ast(l2)) if c1 !=c2: ok=0 print 'test failed', expr1, expr2 print print l1 print print l2 print ast=parser.sequence2ast(l1) c=parser.compileast(ast) if ok: print 'all tests succeeded' if __name__=='__main__': try: c=sys.argv[1] del sys.argv[1] globals()[c]() except: spam() Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/pDocumentTemplate.py100644 1007 1403 22110 6671334614 25677 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Python implementations of document template some features $Id: pDocumentTemplate.py,v 1.23 1999/03/10 00:15:08 klm Exp $''' __version__='$Revision: 1.23 $'[11:-2] import string, sys, types from string import join StringType=type('') TupleType=type(()) isFunctionType={} for name in ['BuiltinFunctionType', 'BuiltinMethodType', 'ClassType', 'FunctionType', 'LambdaType', 'MethodType', 'UnboundMethodType']: try: isFunctionType[getattr(types,name)]=1 except: pass try: # Add function and method types from Extension Classes import ExtensionClass isFunctionType[ExtensionClass.PythonMethodType]=1 isFunctionType[ExtensionClass.ExtensionMethodType]=1 except: pass isFunctionType=isFunctionType.has_key isSimpleType={} for n in dir(types): if (n[-4:]=='Type' and n != 'InstanceType' and not isFunctionType(getattr(types, n))): isSimpleType[getattr(types, n)]=1 isSimpleType=isSimpleType.has_key class InstanceDict: validate=None def __init__(self,o,namespace,validate=None): self.self=o self.cache={} self.namespace=namespace if validate is None: self.validate=namespace.validate else: self.validate=validate def has_key(self,key): return hasattr(self.self,key) def keys(self): return self.self.__dict__.keys() def __repr__(self): return 'InstanceDict(%s)' % str(self.self) def __getitem__(self,key): cache=self.cache if cache.has_key(key): return cache[key] inst=self.self if key[:1]=='_': if key != '__str__': raise KeyError, key # Don't divuldge private data r=str(inst) else: try: r=getattr(inst,key) except AttributeError: raise KeyError, key v=self.validate if v is not None: v(inst,inst,key,r,self.namespace) self.cache[key]=r return r class MultiMapping: def __init__(self): self.dicts=[] def __getitem__(self, key): for d in self.dicts: try: return d[key] except KeyError, AttributeError: pass raise KeyError, key def push(self,d): self.dicts.insert(0,d) def pop(self,n=1): del self.dicts[:n] def keys(self): kz = [] for d in self.dicts: kz = kz + d.keys() return kz class TemplateDict: level=0 def _pop(self, n=1): return self.dicts.pop(n) def _push(self, d): return self.dicts.push(d) def __init__(self): m=self.dicts=MultiMapping() self._pop=m.pop self._push=m.push try: self.keys=m.keys except: pass def __getitem__(self,key,call=1, simple=isSimpleType, isFunctionType=isFunctionType, ): v=self.dicts[key] if call and not simple(type(v)): if hasattr(v,'isDocTemp') and v.isDocTemp: return v(None, self) elif isFunctionType(type(v)): return v() else: try: return v() except AttributeError, ev: try: tb=sys.exc_traceback if hasattr(sys, 'exc_info'): tb=sys.exc_info()[2] if hasattr(v,'__call__'): raise AttributeError, ev, tb finally: tb=None except TypeError: pass return v def has_key(self,key): try: v=self.dicts[key] except KeyError: return 0 return 1 getitem=__getitem__ def render_blocks(blocks, md): rendered = [] append=rendered.append for section in blocks: if type(section) is TupleType: l=len(section) if l==1: # Simple var section=section[0] if type(section) is StringType: section=md[section] else: section=section(md) section=str(section) else: # if cache={} md._push(cache) try: i=0 m=l-1 while i < m: cond=section[i] if type(cond) is StringType: n=cond try: cond=md[cond] cache[n]=cond except KeyError, v: v=str(v) if n != v: raise KeyError, v, sys.exc_traceback cond=None else: cond=cond(md) if cond: section=section[i+1] if section: section=render_blocks(section,md) else: section='' m=0 break i=i+2 if m: if i==m: section=render_blocks(section[i],md) else: section='' finally: md._pop() elif type(section) is not StringType: section=section(md) if section: rendered.append(section) l=len(rendered) if l==0: return '' elif l==1: return rendered[0] return join(rendered, '') return rendered Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/release.fl100644 1007 1403 367 6577315771 23620 0ustar petrillipetrilliDT_HTML.py DT_If.py DT_In.py DT_String.py DT_UI.py DT_Util.py DT_Var.py DT_Raise.py DTtest.py DTtestExpr.py DTtest_basicIn.py DocumentTemplate.py VSEval.py __init__.py pDocumentTemplate.py release_notes gparse.py DT_With.py DT_InSV.py ts_regex.py Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/release.sh100644 1007 1403 742 6577311210 23606 0ustar petrillipetrilli#!/bin/sh R=$1 M=DocumentTemplate # StructuredText < $M.stx > $M.html StructuredText -t < release_notes > DocumentTemplate-rn.html cp DocumentTemplate-rn.html .. rm -rf "$M-$R" mkdir "$M-$R" "$M-$R/$M" echo for f in `cat pyfiles`; do python1.5 -c "import sys; sys.path.append('..'); from tabnanny import *; f='$f'; check(f)" done echo tar -c -T release.fl -f - | (cd "$M-$R/$M"; tar xvf -) cp INSTALL "$M-$R"/ tar cvf "$M-$R.tar" "$M-$R" rm -f "$M-$R.tar.gz" gzip "$M-$R.tar" Zope-2.0.1-ZEO-nonbin/lib/python/DocumentTemplate/ts_regex.py100644 1007 1403 15647 6756611134 24105 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Provide a thread-safe interface to regex """ import regex, regsub #, Sync from regex import * from regsub import split, sub, gsub, splitx, capwords try: import thread except: class allocate_lock: def acquire(*args): pass def release(*args): pass else: class SafeFunction: _l=thread.allocate_lock() _a=_l.acquire _r=_l.release def __init__(self, f): self._f=f def __call__(self, *args, **kw): self._a() try: return apply(self._f, args, kw) finally: self._r() split=SafeFunction(split) sub=SafeFunction(sub) gsub=SafeFunction(gsub) splitx=SafeFunction(splitx) capwords=SafeFunction(capwords) allocate_lock=thread.allocate_lock class compile: _r=None groupindex=None def __init__(self, *args): self._r=r=apply(regex.compile,args) self._init(r) def _init(self, r): lock=allocate_lock() self.__a=lock.acquire self.__r=lock.release self.translate=r.translate self.givenpat=r.givenpat self.realpat=r.realpat def match(self, string, pos=0): self.__a() try: return self._r.match(string, pos) finally: self.__r() def search(self, string, pos=0): self.__a() try: return self._r.search(string, pos) finally: self.__r() def search_group(self, str, group, pos=0): """Search a string for a pattern. If the pattern was not found, then None is returned, otherwise, the location where the pattern was found, as well as any specified group are returned. """ self.__a() try: r=self._r l=r.search(str, pos) if l < 0: return None return l, apply(r.group, group) finally: self.__r() def match_group(self, str, group, pos=0): """Match a pattern against a string If the string does not match the pattern, then None is returned, otherwise, the length of the match, as well as any specified group are returned. """ self.__a() try: r=self._r l=r.match(str, pos) if l < 0: return None return l, apply(r.group, group) finally: self.__r() def search_regs(self, str, pos=0): """Search a string for a pattern. If the pattern was not found, then None is returned, otherwise, the 'regs' attribute of the expression is returned. """ self.__a() try: r=self._r r.search(str, pos) return r.regs finally: self.__r() def match_regs(self, str, pos=0): """Match a pattern against a string If the string does not match the pattern, then None is returned, otherwise, the 'regs' attribute of the expression is returned. """ self.__a() try: r=self._r r.match(str, pos) return r.regs finally: self.__r() class symcomp(compile): def __init__(self, *args): self._r=r=apply(regex.symcomp,args) self._init(r) self.groupindex=r.groupindex Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/ 40755 1007 1403 0 6772126757 17710 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/HelpSys/images/ 40755 1007 1403 0 6772126757 21155 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/HelpSys/images/hs_cbook.gif100755 1007 1403 1604 6631571137 23522 0ustar petrillipetrilliGIF89aPPP@@@@@!,aH,A :tĉ+0Əvb#IRH1%I'[z,(g&|͌v|1P 04iDN80 ;Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/images/hs_darrow.gif100755 1007 1403 1503 6631571137 23721 0ustar petrillipetrilliGIF89a 111p!,  8 ÆB\(1!Ŋ1J ;Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/images/hs_dnode.gif100755 1007 1403 1604 6631571137 23516 0ustar petrillipetrilliGIF89aPPP@@@@@!,a@AxჅ*tpÄ)f8" A"\dIR鱡J&c"x@`eǖ(mNiΌ-k9SMF'92ӧ/J5 ;Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/images/hs_larrow.gif100755 1007 1403 1503 6631571137 23731 0ustar petrillipetrilliGIF89a 111p!,  ( L!Ç:|HA /b ;Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/images/hs_obook.gif100755 1007 1403 1624 6631571137 23540 0ustar petrillipetrilliGIF89aPPP@@@@@!,qH *D B<0"B d!BrI"H!I6x!.$leʚ+?ft kN@N@]@":5FjU*U= ;Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/images/hs_rarrow.gif100755 1007 1403 1503 6631571137 23737 0ustar petrillipetrilliGIF89a 111p!,  Hp  DHpC#FbB/;Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/images/hs_uarrow.gif100755 1007 1403 1504 6631571137 23743 0ustar petrillipetrilliGIF89a 111p!, ! $`AXpaA Ň f\;Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/HelpSys.py100644 1007 1403 11621 6712130470 21744 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Help system implementation""" __version__='$Revision: 1.7 $'[11:-2] import sys, os, string, Globals, Acquisition from HelpUtil import HelpBase from ObjectRef import ObjectRef from App.ImageFile import ImageFile from Globals import HTMLFile class HelpSys(HelpBase): """ """ __names__=None __roles__=None hs_index=HTMLFile('helpsys', globals()) hs_menu =HTMLFile('helpsys_menu', globals()) hs_main =HTMLFile('helpsys_main', globals()) hs_cicon='HelpSys/hs_cbook' hs_eicon='HelpSys/hs_obook' # Images used by the help system hs_uarrow=ImageFile('images/hs_uarrow.gif', globals()) hs_darrow=ImageFile('images/hs_darrow.gif', globals()) hs_rarrow=ImageFile('images/hs_rarrow.gif', globals()) hs_larrow=ImageFile('images/hs_larrow.gif', globals()) hs_dnode=ImageFile('images/hs_dnode.gif', globals()) hs_obook=ImageFile('images/hs_obook.gif', globals()) hs_cbook=ImageFile('images/hs_cbook.gif', globals()) hs_id='HelpSys' hs_title='Z Help Online' ObjectRef=ObjectRef() hs_objectvalues__roles__=None def hs_objectvalues(self): return [self.ObjectRef] def __len__(self): return 1 Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/HelpUtil.py100644 1007 1403 35252 6743405031 22113 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Help system support module""" __version__='$Revision: 1.6 $'[11:-2] import Globals, Acquisition import StructuredText.StructuredText import sys, os, string, regex stx_class=StructuredText.StructuredText.HTML class HelpBase(Acquisition.Implicit): """ """ def __bobo_traverse__(self, REQUEST, name=None): # A sneaky trick - we cant really _have_ an index_html # because that would often hide the index_html of a # wrapped object ;( if name=='index_html': return self.hs_index return getattr(self, name) def __len__(self): return 1 class object(Acquisition.Implicit): def __init__(self, name, ob, op=None): self._name=name self._obj_=ob self._obp_=op def __getattr__(self, name): return getattr(self.__dict__['_obj_'], name) def __len__(self): return 1 def get_id(self): return id(self._obj_) def get_name(self): return self._name def get_type(self): return type(self._obj_).__name__ def get_value(self): return self._obj_ def get_docstring(self): if hasattr(self._obj_, '__doc__'): doc=self._obj_.__doc__ if not doc: doc='' return doc return '' def get_docstring_html(self): doc=self.get_docstring() if string.find(doc, '\n\n') > -1: doc=string.split(doc, '\n\n') if len(doc) > 1: doc[1]=string.strip(doc[1]) doc=string.join(doc, '\n\n') return str(stx_class(doc)) def version(self): if hasattr(self._obj_, '__version__'): return self._obj_.__version__ tpId =get_name tpURL =get_name __str__=get_name class moduleobject(object): def get_file(self): if hasattr(self._obj_, '__file__'): return self._obj_.__file__ def get_modules(self): data=[] for name, ob in self._obj_.__dict__.items(): if is_module(ob) and _chModule(name, ob): data.append(moduleobject(name, ob, self)) return data def get_classes(self): data=[] for name, ob in self._obj_.__dict__.items(): if is_class(ob) and _chClass(name, ob): data.append(classobject(name, ob, self)) return data class classobject(object): def get_metatype(self): try: return self._obj_.meta_type except: return '%s %s' % (`sys.exc_type`, `sys.exc_value`) def get_module(self): if hasattr(self._obj_, '__module__'): module=sys.modules[self._obj_.__module__] return moduleobject(module.__name__, module) def get_file(self): return self.get_module().get_file() def get_bases(self): bases=[] if hasattr(self._obj_, '__bases__'): for base in self._obj_.__bases__: bases.append(classobject(base.__name__, base)) return bases def get_base_list(self, list=None): if list is None: list=[] list.append(self) for base in self.get_bases(): list=base.get_base_list(list) return list def get_methods(self): keys=self._obj_.__dict__.keys() dict=self._obj_.__dict__ keys.sort() methods=[] for name in keys: ob=dict[name] if is_method(ob) and _chMethod(name, ob): methods.append(methodobject(name, ob, self)) return methods def get_method_dict(self, dict=None): if dict is None: dict={} dup=dict.has_key for method in self.get_methods(): name=method.get_name() if not dup(name): dict[name]=method for base in self.get_bases(): dict=base.get_method_dict(dict) return dict def get_method_list(self): dict=self.get_method_dict() keys=dict.keys() keys.sort() list=[] for key in keys: list.append(dict[key]) del dict return list ## def obAttributes(self): ## # Return list of class attributes ## keys=self._obj_.__dict__.keys() ## dict=self._obj_.__dict__ ## keys.sort() ## attrs=[] ## for name in keys: ## ob=dict[name] ## if _isAttribute(ob) and _chAttribute(name, ob): ## attrs.append(AttributeObject(name, ob, self)) ## return attrs ## def obAttributeDict(self, dict=None): ## # Return dict of attrs in class and superclasses ## if dict is None: ## dict={} ## root=1 ## else: root=0 ## dup=dict.has_key ## for attr in self._obj_Attributes(): ## name=attr.obName() ## if not dup(name): ## dict[name]=attr ## for base in self._obj_Bases(): ## dict=base.obAttributeDict(dict) ## return dict ## def obAttributeList(self): ## # Return list of attrs in class and superclasses ## dict=self._obj_AttributeDict() ## keys=dict.keys() ## keys.sort() ## list=[] ## append=list.append ## for name in keys: ## append(dict[name]) ## del dict ## return list pre_match=regex.compile('[A-Za-z0-9_]*([^)]*)[ -]*').match #TS sig_match=regex.compile('[A-Za-z0-9_]*([^)]*)').match #TS class methodobject(object): def get_class(self): return self._obp_ def get_module(self): return self.get_class().get_module() def get_file(self): return self.get_module().get_file() def get_docstring(self): func=self._obj_ doc='' if hasattr(func, 'im_func'): func=func.im_func if hasattr(func, '__doc__'): doc=func.__doc__ if not doc: doc='' doc=string.strip(doc) if hasattr(func, 'func_code'): if hasattr(func.func_code, 'co_varnames'): return doc n=pre_match(doc) if n > -1: return doc[n:] return doc def get_signaturex(self): name=self._name func=self._obj_ method=None if hasattr(func, 'im_func'): method=1 func=func.im_func # Normal functions if hasattr(func, 'func_code'): if hasattr(func.func_code, 'co_varnames'): args=map(lambda x: x, func.func_code.co_varnames[:func.func_code.co_argcount]) ndefaults=func.func_defaults ndefaults=ndefaults and len(ndefaults) or 0 if '__ick__' in args: nick=len(args)-args.index('__ick__') args=args[:-nick] ndefaults=ndefaults-nick if ndefaults > 0: args[-ndefaults]='['+args[-ndefaults] args[-1]=args[-1]+']' if method: args=args[1:] if name=='__call__': name='Call Operation' return '%s(%s)' % (name, string.join(args,', ')) # Other functions - look for something that smells like # a signature at the beginning of the docstring. if hasattr(func, '__doc__'): doc=func.__doc__ if not doc: doc='' doc=string.strip(doc) n=sig_match(doc) if n > -1: return doc[:n] return '%s()' % name def get_signature(self): try: return self.get_signaturex() except: return '%s %s' % (sys.exc_type, sys.exc_value) ## class AttributeObject(_ob_): ## def obClass(self): ## return self.op ## def obModule(self): ## return self.obClass().obModule() ## def obFile(self): ## return self.obModule().obFile() ## class InstanceObject(_ob_): ## def obClass(self): ## # Return the class for this instance ## c=self._obj_.__class__ ## return ClassObject(c.__name__, c) ## def obClassList(self): ## # Return list of all superclasses ## return self._obj_Class().obClassList() ## def obMethods(self): ## # Return list of instance methods ## keys=self._obj_.__dict__.keys() ## dict=self._obj_.__dict__ ## keys.sort() ## methods=[] ## for name in keys: ## ob=dict[name] ## if _isMethod(ob) and _chMethod(name, ob): ## methods.append(MethodObject(name, ob)) ## return methods ## def obMethodDict(self): ## # Return dict of instance and superclass methods ## dict=self._obj_Class().obMethodDict() ## for method in self._obj_Methods(): ## dict[method.obName()]=method ## return dict ## def obMethodList(self): ## # Return list of instance and superclass methods ## dict=self._obj_MethodDict() ## keys=dict.keys() ## keys.sort() ## list=[] ## append=list.append ## for name in keys: ## append(dict[name]) ## return list ## def obAttributes(self): ## # Return list of instance attributes ## keys=self._obj_.__dict__.keys() ## dict=self._obj_.__dict__ ## keys.sort() ## attrs=[] ## for name in keys: ## ob=dict[name] ## if _isAttribute(ob) and _chAttribute(name, ob): ## attrs.append(AttributeObject(name, ob, self)) ## return attrs ## def obAttributeDict(self): ## # Return dict of instance and superclass attributes ## dict=self._obj_Class().obAttributeDict() ## for attr in self._obj_Attributes(): ## dict[attr.obName()]=attr ## return dict ## def obAttributeList(self): ## # Return list of instance and superclass attributes ## dict=self._obj_AttributeDict() ## keys=dict.keys() ## keys.sort() ## list=[] ## append=list.append ## for name in keys: ## append(dict[name]) ## return list _classtypes=(type(Globals.HTML), type(Globals.Persistent), ) _methodtypes=(type([].sort), type(Globals.default__class_init__), type(Globals.HTML.manage_edit), type(Globals.HTML.__changed__), type(Globals.MessageDialog.manage_edit), ) def is_module(ob): return type(ob)==type(sys) def is_class(ob): return type(ob) in _classtypes def is_method(ob): if type(ob) in _methodtypes or hasattr(ob, 'func_code'): return 1 return 0 def is_attribute(ob): return not is_method(ob) def _chModule(name, ob): if name[0]=='_': return 0 return 1 def _chClass(name, ob): if name[0]=='_': return 0 return 1 def _chMethod(name, ob): if name[0]=='_': return 0 return 1 def _chAttribute(name, ob): if name[0]=='_': return 0 return 1 Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/ObjectRef.py100644 1007 1403 16577 6704511275 22246 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Object Reference implementation""" __version__='$Revision: 1.5 $'[11:-2] import sys, os, string, Globals, Acquisition from HelpUtil import HelpBase, classobject from HelpUtil import is_class, is_module from Globals import HTMLFile from urllib import quote class ObjectItem(HelpBase, classobject): """ """ __roles__=None hs_main=HTMLFile('objectitem', globals()) hs_cicon='HelpSys/hs_dnode' hs_eicon='HelpSys/hs_dnode' def hs_id(self): return self._obj_.meta_type def hs_url(self): return quote(self._obj_.meta_type) hs_title=hs_id def __getattr__(self, name): if name in ('isDocTemp', '__call__'): raise AttributeError, name return getattr(self.__dict__['_obj_'], name) def get_method_list(self): rdict=classobject.get_method_dict(self) perms=self.__ac_permissions__ mdict={} mlist=[] for p in self.__ac_permissions__: pname=p[0] fnames=p[1] for fname in fnames: if rdict.has_key(fname): fn=rdict[fname] fn.permission=pname mdict[fname]=fn keys=mdict.keys() keys.sort() for key in keys: fn=mdict[key] if not hasattr(fn._obj_, '__doc__'): continue doc=fn._obj_.__doc__ if hasattr(fn._obj_, '__class__') and \ fn._obj_.__class__.__doc__ is doc: continue mlist.append(mdict[key]) del rdict del mdict return mlist hs_objectvalues__roles__=None def hs_objectvalues(self): return [] class ObjectRef(HelpBase): """ """ __names__=None __roles__=None hs_main=HTMLFile('objectref', globals()) hs_cicon='HelpSys/hs_cbook' hs_eicon='HelpSys/hs_obook' hs_id ='ObjectRef' hs_title='Object Reference' hs_url =hs_id def hs_deferred__init__(self): # This is necessary because we want to wait until all # products have been installed (imported). dict={} for k, v in sys.modules.items(): if v is not None and k != '__builtins__': dict=self.hs_search_mod(v, dict) keys=dict.keys() keys.sort() __traceback_info__=(`dict`,) for key in keys: setattr(self, key, dict[key]) self.__names__=keys def hs_search_mod(self, mod, dict): # Root through a module for things that look like # createable object classes. hidden=('Control Panel', 'Principia Draft', 'simple item', 'Broken Because Product is Gone') for k, v in mod.__dict__.items(): if is_class(v) and hasattr(v, 'meta_type') and \ hasattr(v, '__ac_permissions__'): if callable(v.meta_type): try: meta_type=v.meta_type() except: # Ack. probably a ZClass :( meta_type=None else: meta_type=v.meta_type if (meta_type is not None) and (meta_type not in hidden): dict[meta_type]=ObjectItem(k, v) if is_module(v) and hasattr(v, '__path__'): dict=self.hs_search_mod(v, dict) return dict hs_objectvalues__roles__=None def hs_objectvalues(self): if self.__names__ is None: self.hs_deferred__init__() items=[] for id in self.__names__: items.append(getattr(self, id)) return items def __getitem__(self, key): return self.__dict__[key].__of__(self) Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/__init__.py100644 1007 1403 7332 6671334617 22115 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/helpsys.dtml100644 1007 1403 716 6632012535 22321 0ustar petrillipetrilli Z Object Publishing Environment Help This item requires the use of a <em>frames-capable</em> web browser. Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/helpsys_main.dtml100644 1007 1403 3455 6747673377 23400 0ustar petrillipetrilli Z Object Publishing Environment Help

    Z Object Publishing Environment Help

    The Z online help system provides links to in-depth product guides, programming references and other resources.

    General Documentation

    General documentation for the use and management of built-in and add-on products, as well as an extensive DTML manual are available on the Zope website at http://www.zope.org.

    The Zope Guides are a great place to start learning Zope.

    Programming References

    There is currently an online object reference that documents the services provided by high-level objects such as Documents and Folders. Other references will be added soon.

    Other Resources

    One of the best resources available is the Zope mailing list. You can subscribe to the mailing list by sending an email to zope-request@zope.org and including the word "subscribe" in the subject line.

    There is also a Zope documentation project working on a Zope FAQ

    Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/helpsys_menu.dtml100644 1007 1403 1664 6632012535 23370 0ustar petrillipetrilli Z Object Publishing Environment Help
    Z Online Help Z Online Help
    click to view this item click to view this item Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/objectitem.dtml100644 1007 1403 3423 6632012535 22775 0ustar petrillipetrilli Object Reference

    Object Reference

    methods
    Permission:

    No documentation for this method

     top

    Back to Object Reference

    Zope-2.0.1-ZEO-nonbin/lib/python/HelpSys/objectref.dtml100644 1007 1403 1402 6632012535 22606 0ustar petrillipetrilli Object Reference

    Object Reference

    The object reference documents the interfaces of objects which are built in to the system or have been installed as add-on products. This reference focuses on those object services useful in DTML scripting.

    Back to Help

    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/ 40755 1007 1403 0 6772126757 16750 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/OFS/www/ 40755 1007 1403 0 6772126757 17574 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/OFS/www/ControlPanel_icon.gif100644 1007 1403 1645 6715551363 23766 0ustar petrillipetrilliGIF89aPPP@@@@@!,H A,( hb‹,xG&>XdE@(Oi8,2&7q$zA?Fe)P;WU(Gu*ShӞ )۷n;Zope-2.0.1-ZEO-nonbin/lib/python/OFS/www/Help_icon.gif100644 1007 1403 1532 6376063276 22255 0ustar petrillipetrilliGIF89aPPP@@@@@!,@7HA 40!C#:QÊ bpć ;r)QcI'Qn(r;Zope-2.0.1-ZEO-nonbin/lib/python/OFS/www/Properties_icon.gif100644 1007 1403 1610 6714415452 23507 0ustar petrillipetrilliGIF89aPPP@@@@@!,@nH@Æ @"D"D|1"6V(cIGBXcCȜ9SI/]D0@#`葠ϠBbL1Ӣ>4KxZZope-2.0.1-ZEO-nonbin/lib/python/OFS/www/UpFolder_icon.gif100644 1007 1403 1623 6372640463 23101 0ustar petrillipetrilliGIF89aPPP@@@@@!,@pH@, @Åŋ-JD#D 08($qb… W~(`͛8m)`$Ƀ{ y2DxeʇK*D1QNXu'֯N;Zope-2.0.1-ZEO-nonbin/lib/python/OFS/www/broken.gif100744 1007 1403 1576 6461507605 21640 0ustar petrillipetrilliGIF89aPPP@@@@@!,[Hp *\PaB".|bċ3XĎAɑ!Ń6"`J UDycɑ)+f\sNYR|fÖ>OZi;Zope-2.0.1-ZEO-nonbin/lib/python/OFS/www/check.gif100744 1007 1403 1546 6432124325 21422 0ustar petrillipetrilliGIF89aPPP@@@@@!,CH`*L(p 4tbĉ-"l@Ǎ=ZHERLqeH ͛8m;Zope-2.0.1-ZEO-nonbin/lib/python/OFS/www/locked.gif100744 1007 1403 1565 6477306016 21617 0ustar petrillipetrilliGIF89aPPP@@@@@!,R @PX!B :bÉ#^  R`ɉDJȜ93̑5)M>&̀;Zope-2.0.1-ZEO-nonbin/lib/python/OFS/www/modified.gif100744 1007 1403 1520 6432124325 22115 0ustar petrillipetrilliGIF89a PPP@@@@@!, -H (0 Q"E):$p CI@@;Zope-2.0.1-ZEO-nonbin/lib/python/OFS/www/new.gif100744 1007 1403 1536 6432124326 21136 0ustar petrillipetrilliGIF89a PPP@@@@@!, ;`A DpH| D+jlbCR9$I—0c ;Zope-2.0.1-ZEO-nonbin/lib/python/OFS/www/properties.jpg100755 1007 1403 5360 6366203222 22554 0ustar petrillipetrilliJFIFHH^Photoshop 3.08BIMxHH@[ (hht @h0 @CN' dVe9CV+SR8BIMHH8BIM8BIM 8BIM' 8BIMH/fflff/ff2Z5-8BIMp8BIM 8BIM8BIM@@8BIM 2JFIFHH'File written by Adobe Photoshop 4.0Adobed            "?   3!1AQa"q2B#$Rb34rC%Scs5&DTdE£t6UeuF'Vfv7GWgw5!1AQaq"2B#R3$brCScs4%&5DTdEU6teuFVfv'7GWgw ?I]^dǏ]ۭjc'%^L]Җ ZN)$b-$-$WWru+N=.pˆI.hdZ]Umc EkeUݺ{ptKIyJs $8Ag*jڰTUe%)$JNʫχKu~u{񾖒D_wu~i/4I/wW7BqZ Q_R[K5XIOU®xx).=jv IX8VHqֵO#,uuPq^ȼm%L|uSc=/Ou_dIxIwHȒTzSﮢ,DE.M:.1.]D,*xOEWjTI$$I)I$JR[+%>eI^\JlZ2bz=^.s_lx+w_ uaL|$IJI$RI$V2J} keѤd\R4xurpqwt $^1L٪W^S)/FY))]Ұ=D^$ʢL+JuVZQi-d$CVS%5T֊2JsQ8BIM'File written by Adobe Photoshop 4.0Adobed           s!1AQa"q2B#R3b$r%C4Scs5D'6Tdt& EFVU(eufv7GWgw8HXhx)9IYiy*:JZjzm!1AQa"q2#BRbr3$4CS%cs5DT &6E'dtU7()󄔤euFVfvGWgw8HXhx9IYiy*:JZjz ?Pk_.ko6MtIiWi$QK $+^,Cc1I~'TOTa>Nqg O$,QOI3{[>៉)Z֏_C5H.}&݀k ̷&5y >df zK g{y1[Y;$gb'Jݪ\f:_Zope-2.0.1-ZEO-nonbin/lib/python/OFS/Application.py100644 1007 1403 44367 6746073061 21706 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Application support $Id: Application.py,v 1.112 1999/07/23 14:03:29 cathi Exp $''' __version__='$Revision: 1.112 $'[11:-2] import Globals,Folder,os,sys,App.Product, App.ProductRegistry, misc_ import time, traceback, os, string, Products from string import strip, lower, find, rfind, join from DateTime import DateTime from AccessControl.User import UserFolder from HelpSys.HelpSys import HelpSys from App.ApplicationManager import ApplicationManager from webdav.NullResource import NullResource from FindSupport import FindSupport from urllib import quote from cStringIO import StringIO from AccessControl.PermissionRole import PermissionRole from App.ProductContext import ProductContext from misc_ import Misc_ import ZDOM from zLOG import LOG, ERROR _standard_error_msg='''\
    Zope

    Zope Error

    Zope has encountered an error while publishing this resource.

    Error Type:
    Error Value:

    Troubleshooting Suggestions

    • This resource may be trying to reference a nonexistent object or variable .
    • The URL may be incorrect.
    • The parameters passed to this resource may be incorrect.
    • A resource that this resource relies on may be encountering an error.

    For more detailed information about the error, please refer to the HTML source for this page.

    If the error persists please contact the site maintainer. Thank you for your patience.

    Here, events like logging and other actions may also be performed, such as sending mail automatically to the administrator. ''' class Application(Globals.ApplicationDefaultPermissions, ZDOM.Root, Folder.Folder, App.ProductRegistry.ProductRegistry, FindSupport): """Top-level system object""" title ='Zope' __roles__=['Manager', 'Anonymous'] __defined_roles__=('Manager','Anonymous','Owner') web__form__method='GET' isTopLevelPrincipiaApplicationObject=1 _isBeingUsedAsAMethod_=0 # Create the help system object HelpSys=HelpSys() p_=misc_.p_ misc_=misc_.misc_ _reserved_names=('standard_html_header', 'standard_html_footer', 'standard_error_message', 'Control_Panel') # This class-default __allow_groups__ ensures that the # superuser can still access the system if the top-level # UserFolder is deleted. This is necessary to allow people # to replace the top-level UserFolder object. __allow_groups__=UserFolder() def __init__(self): # Initialize users self.__allow_groups__=UserFolder() self._setObject('acl_users', self.__allow_groups__) # Initialize control panel cpl=ApplicationManager() cpl._init() self._setObject('Control_Panel', cpl) # Note that this may happen before products are # installed, so we have to use addDocument as stand-alone. import Document Document.manage_addDocument( self, 'standard_html_header', 'Standard Html Header', '<!--#var title_or_id-->' \ '') Document.manage_addDocument( self, 'standard_html_footer', 'Standard Html Footer', '') Document.manage_addDocument( self, 'standard_error_message', 'Standard Error Message', _standard_error_msg) def id(self): try: return self.REQUEST['SCRIPT_NAME'][1:] except: return self.title def __class_init__(self): Globals.default__class_init__(self) def PrincipiaRedirect(self,destination,URL1): """Utility function to allow user-controlled redirects""" if find(destination,'//') >= 0: raise 'Redirect', destination raise 'Redirect', ("%s/%s" % (URL1, destination)) Redirect=ZopeRedirect=PrincipiaRedirect def __bobo_traverse__(self, REQUEST, name=None): if hasattr(Globals,'VersionBase'): # BoboPOS 2 if name is None and REQUEST.has_key(Globals.VersionNameName): pd=Globals.VersionBase[REQUEST[Globals.VersionNameName]] alternate_self=pd.jar[self._p_oid] if hasattr(self, 'aq_parent'): alternate_self=alternate_self.__of__(self.aq_parent) return alternate_self try: self._p_jar.cache.incrgc() # Perform incremental GC except: pass try: return getattr(self, name) except AttributeError: pass try: return self[name] except KeyError: pass method=REQUEST.get('REQUEST_METHOD', 'GET') if not method in ('GET', 'POST'): return NullResource(self, name, REQUEST).__of__(self) REQUEST.RESPONSE.notFoundError("%s\n%s" % (name, method)) def PrincipiaTime(self, *args): """Utility function to return current date/time""" return apply(DateTime, args) ZopeTime=PrincipiaTime def ZopeAttributionButton(self): """Returns an HTML fragment that displays the 'powered by zope' button along with a link to the Zope site.""" return 'Powered by Zope' % self.REQUEST.BASE1 def DELETE(self, REQUEST, RESPONSE): """Delete a resource object.""" self.dav__init(REQUEST, RESPONSE) raise 'Forbidden', 'This resource cannot be deleted.' def MOVE(self, REQUEST, RESPONSE): """Move a resource to a new location.""" self.dav__init(REQUEST, RESPONSE) raise 'Forbidden', 'This resource cannot be moved.' test_url___allow_groups__=None test_url=ZopeAttributionButton class Expired(Globals.Persistent): icon='p_/broken' def __setstate__(self, s={}): dict=self.__dict__ if s.has_key('id'): dict['id']=s['id'] elif s.has_key('__name__'): dict['id']=s['__name__'] else: dict['id']='Unknown' dict['title']='** Expired **' def __save__(self): pass __inform_commit__=__save__ def initialize(app): # Open the application database product_dir=os.path.join(SOFTWARE_HOME,'Products') # The following items marked b/c are backward compatibility hacks # which make sure that expected system objects are added to the # bobobase. This is required because the bobobase in use may pre- # date the introduction of certain system objects such as those # which provide Lever support. # b/c: Ensure that Control Panel exists. if not hasattr(app, 'Control_Panel'): cpl=ApplicationManager() cpl._init() app._setObject('Control_Panel', cpl) get_transaction().note('Added Control_Panel') get_transaction().commit() # b/c: Ensure that a ProductFolder exists. if not hasattr(app.Control_Panel.aq_base, 'Products'): app.Control_Panel.Products=App.Product.ProductFolder() get_transaction().note('Added Control_Panel.Products') get_transaction().commit() # b/c: Ensure that std err msg exists. if not hasattr(app, 'standard_error_message'): import Document Document.manage_addDocument( app, 'standard_error_message', 'Standard Error Message', _standard_error_msg) get_transaction().note('Added standard_error_message') get_transaction().commit() # b/c: Ensure that Owner role exists. if hasattr(app, '__ac_roles__') and not ('Owner' in app.__ac_roles__): app.__ac_roles__=app.__ac_roles__ + ('Owner',) get_transaction().note('Added Owner role') get_transaction().commit() # Make sure we have Globals try: root=app._p_jar.root() except: pass # BoboPOS 2 else: if not root.has_key('ZGlobals'): import BTree app._p_jar.root()['ZGlobals']=BTree.BTree() get_transaction().note('Added Globals') get_transaction().commit() install_products(app) def import_products(_st=type('')): # Try to import each product, checking for and catching errors. path_join=os.path.join isdir=os.path.isdir exists=os.path.exists DictType=type({}) global_dict=globals() silly=('__doc__',) modules=sys.modules have_module=modules.has_key done={} for product_dir in Products.__path__: product_names=os.listdir(product_dir) product_names.sort() for product_name in product_names: if done.has_key(product_name): continue done[product_name]=1 package_dir=path_join(product_dir, product_name) if not isdir(package_dir): continue if not exists(path_join(package_dir, '__init__.py')): if not exists(path_join(package_dir, '__init__.pyc')): continue pname="Products.%s" % product_name try: product=__import__(pname, global_dict, global_dict, silly) if hasattr(product, '__module_aliases__'): for k, v in product.__module_aliases__: if not have_module(k): if type(v) is _st and have_module(v): v=modules[v] modules[k]=v except: f=StringIO() traceback.print_exc(100,f) f=f.getvalue() try: modules[pname].__import_error__=f except: pass def install_products(app): # Install a list of products into the basic folder class, so # that all folders know about top-level objects, aka products path_join=os.path.join isdir=os.path.isdir exists=os.path.exists DictType=type({}) from Folder import Folder folder_permissions={} for p in Folder.__ac_permissions__: permission, names = p[:2] folder_permissions[permission]=names meta_types=[] global_dict=globals() silly=('__doc__',) done={} get_transaction().note('Prior to product installs') get_transaction().commit() for product_dir in Products.__path__: product_names=os.listdir(product_dir) product_names.sort() for product_name in product_names: if done.has_key(product_name): continue done[product_name]=1 package_dir=path_join(product_dir, product_name) __traceback_info__=product_name if not isdir(package_dir): continue if not exists(path_join(package_dir, '__init__.py')): if not exists(path_join(package_dir, '__init__.pyc')): continue try: product=__import__("Products.%s" % product_name, global_dict, global_dict, silly) misc_=pgetattr(product, 'misc_', {}) if misc_: if type(misc_) is DictType: misc_=Misc_(product_name, misc_) Application.misc_.__dict__[product_name]=misc_ # Set up dynamic project information. productObject=App.Product.initializeProduct( product, product_name, package_dir, app) pgetattr(product, 'initialize', lambda context: None)( ProductContext(productObject, app, product)) permissions={} new_permissions={} for p in pgetattr(product, '__ac_permissions__', ()): permission, names, default = (tuple(p)+('Manager',))[:3] if names: for name in names: permissions[name]=permission elif not folder_permissions.has_key(permission): new_permissions[permission]=() for meta_type in pgetattr(product, 'meta_types', ()): if product_name=='OFSP': meta_types.insert(0,meta_type) else: meta_types.append(meta_type) for name,method in pgetattr(product, 'methods', {}).items(): if not hasattr(Folder, name): setattr(Folder, name, method) if name[-9:]!='__roles__': # not Just setting roles if (permissions.has_key(name) and not folder_permissions.has_key( permissions[name])): permission=permissions[name] if new_permissions.has_key(permission): new_permissions[permission].append(name) else: new_permissions[permission]=[name] if new_permissions: new_permissions=new_permissions.items() for permission, names in new_permissions: folder_permissions[permission]=names new_permissions.sort() Folder.__dict__['__ac_permissions__']=tuple( list(Folder.__ac_permissions__)+new_permissions) get_transaction().note('Installed product '+product_name) get_transaction().commit() except: LOG('Zope',ERROR,'Couldn\'t install %s' % product_name, error=sys.exc_info()) get_transaction().abort() Products.meta_types=Products.meta_types+tuple(meta_types) Globals.default__class_init__(Folder) def pgetattr(product, name, default=install_products, __init__=0): if not __init__ and hasattr(product, name): return getattr(product, name) if hasattr(product, '__init__'): product=product.__init__ if hasattr(product, name): return getattr(product, name) if default is not install_products: return default raise AttributeError, name Zope-2.0.1-ZEO-nonbin/lib/python/OFS/CopySupport.py100644 1007 1403 43456 6763235042 21746 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__="""Copy interface""" __version__='$Revision: 1.44 $'[11:-2] import sys, string, Globals, Moniker, tempfile, ExtensionClass from marshal import loads, dumps from urllib import quote, unquote from zlib import compress, decompress from App.Dialogs import MessageDialog CopyError='Copy Error' _marker=[] class CopyContainer(ExtensionClass.Base): """Interface for containerish objects which allow cut/copy/paste""" __ac_permissions__=( ('View management screens', ('manage_cutObjects', 'manage_copyObjects', 'manage_pasteObjects', 'manage_renameForm', 'manage_renameObject',)), ) # The following three methods should be overridden to store sub-objects # as non-attributes. def _setOb(self, id, object): setattr(self, id, object) def _delOb(self, id): delattr(self, id) def _getOb(self, id, default=_marker): if hasattr(self, 'aq_base'): self=self.aq_base if default is _marker: return getattr(self, id) try: return getattr(self, id) except: return default def manage_CopyContainerFirstItem(self, REQUEST): return self._getOb(REQUEST['ids'][0]) def manage_cutObjects(self, ids, REQUEST=None): """Put a reference to the objects named in ids in the clip board""" if type(ids) is type(''): ids=[ids] oblist=[] for id in ids: ob=self._getOb(id) if not ob.cb_isMoveable(): raise CopyError, eNotSupported % id m=Moniker.Moniker(ob) oblist.append((m.jar, m.ids)) cp=(1, oblist) cp=_cb_encode(cp) if REQUEST is not None: resp=REQUEST['RESPONSE'] resp.setCookie('__cp', cp, path='%s' % REQUEST['SCRIPT_NAME']) return self.manage_main(self, REQUEST, cb_dataValid=1) return cp def manage_copyObjects(self, ids, REQUEST=None, RESPONSE=None): """Put a reference to the objects named in ids in the clip board""" if type(ids) is type(''): ids=[ids] oblist=[] for id in ids: ob=self._getOb(id) if not ob.cb_isCopyable(): raise CopyError, eNotSupported % id m=Moniker.Moniker(ob) oblist.append((m.jar, m.ids)) cp=(0, oblist) cp=_cb_encode(cp) if REQUEST is not None: resp=REQUEST['RESPONSE'] resp.setCookie('__cp', cp, path='%s' % REQUEST['SCRIPT_NAME']) return self.manage_main(self, REQUEST, cb_dataValid=1) return cp def _get_id(self, id): # Allow containers to override the generation of # object copy id by attempting to call its _get_id # method, if it exists. n=0 if (len(id) > 8) and (id[8:]=='copy_of_'): n=1 orig_id=id while 1: if self._getOb(id, None) is None: return id id='copy%s_of_%s' % (n and n+1 or '', orig_id) n=n+1 def manage_pasteObjects(self, cb_copy_data=None, REQUEST=None): """Paste previously copied objects into the current object. If calling manage_pasteObjects from python code, pass the result of a previous call to manage_cutObjects or manage_copyObjects as the first argument.""" cp=None if cb_copy_data is not None: cp=cb_copy_data else: if REQUEST and REQUEST.has_key('__cp'): cp=REQUEST['__cp'] if cp is None: raise CopyError, eNoData try: cp=_cb_decode(cp) except: raise CopyError, eInvalid oblist=[] m=Moniker.Moniker() op=cp[0] for j, d in cp[1]: m.jar=j m.ids=d try: ob=m.bind(self._p_jar) except: raise CopyError, eNotFound self._verifyObjectPaste(ob, REQUEST) oblist.append(ob) if op==0: # Copy operation for ob in oblist: if not ob.cb_isCopyable(): raise CopyError, eNotSupported % absattr(ob.id) ob=ob._getCopy(self) ob.manage_afterClone(ob) id=self._get_id(absattr(ob.id)) ob._setId(id) self._setObject(id, ob) if REQUEST is not None: return self.manage_main(self, REQUEST, update_menu=1, cb_dataValid=1) if op==1: # Move operation for ob in oblist: id=absattr(ob.id) if not ob.cb_isMoveable(): raise CopyError, eNotSupported % id if not sanity_check(self, ob): raise CopyError, 'This object cannot be pasted into itself' ob.aq_parent._delObject(id) if hasattr(ob, 'aq_base'): ob=ob.aq_base id=self._get_id(id) ob._setId(id) self._setObject(id, ob) if REQUEST is not None: REQUEST['RESPONSE'].setCookie('cp_', 'deleted', path='%s' % REQUEST['SCRIPT_NAME'], expires='Wed, 31-Dec-97 23:59:59 GMT') return self.manage_main(self, REQUEST, update_menu=1, cb_dataValid=0) return '' manage_renameForm=Globals.HTMLFile('renameForm', globals()) def manage_renameObject(self, id, new_id, REQUEST=None): """Rename a particular sub-object""" try: self._checkId(new_id) except: raise CopyError, MessageDialog( title='Invalid Id', message=sys.exc_value, action ='manage_main') ob=self._getOb(id) if not ob.cb_isMoveable(): raise CopyError, eNotSupported % id self._verifyObjectPaste(ob, REQUEST) try: ob._notifyOfCopyTo(self, op=1) except: raise CopyError, MessageDialog( title='Rename Error', message=sys.exc_value, action ='manage_main') self._delObject(id) if hasattr(ob, 'aq_base'): ob=ob.aq_base ob._setId(new_id) self._setObject(new_id, ob) #ob=ob.__of__(self) #ob._postCopy(self, op=1) if REQUEST is not None: return self.manage_main(self, REQUEST, update_menu=1) return None # Why did we give this a manage_ prefix if its really # supposed to be public since it does its own auth ? # # Because it's still a "management" function. manage_clone__roles__=None def manage_clone(self, ob, id, REQUEST=None): """Clone an object, creating a new object with the given id.""" if not ob.cb_isCopyable(): raise CopyError, eNotSupported % absattr(ob.id) try: self._checkId(id) except: raise CopyError, MessageDialog( title='Invalid Id', message=sys.exc_value, action ='manage_main') self._verifyObjectPaste(ob, REQUEST) try: ob._notifyOfCopyTo(self, op=0) except: raise CopyError, MessageDialog( title='Rename Error', message=sys.exc_value, action ='manage_main') ob=ob._getCopy(self) ob._setId(id) self._setObject(id, ob) #ob=ob.__of__(self) #ob._postCopy(self, op=0) return ob def cb_dataValid(self): "Return true if clipboard data seems valid." try: cp=_cb_decode(self.REQUEST['__cp']) except: return 0 return 1 def cb_dataItems(self): "List of objects in the clip board" try: cp=_cb_decode(self.REQUEST['__cp']) except: return [] oblist=[] m=Moniker.Moniker() op=cp[0] for j, d in cp[1]: m.jar=j m.ids=d oblist.append(m.bind(self._p_jar)) return oblist validClipData=cb_dataValid def _verifyObjectPaste(self, ob, REQUEST): if not hasattr(ob, 'meta_type'): raise CopyError, MessageDialog( title='Not Supported', message='The object %s does not support this ' \ 'operation' % absattr(ob.id), action='manage_main') mt=ob.meta_type if not hasattr(self, 'all_meta_types'): raise CopyError, MessageDialog( title='Not Supported', message='Cannot paste into this object.', action='manage_main') method_name=None meta_types=absattr(self.all_meta_types) for d in meta_types: if d['name']==mt: method_name=d['action'] break if method_name is not None: meth=None if hasattr(self, method_name): meth=getattr(self, method_name) else: # Handle strange names that come from the Product # machinery ;( mn=string.split(method_name, '/') if len(mn) > 1: pname= mn[1] product=self.manage_addProduct[pname] fname=mn[2] factory=getattr(product, fname) try: meth=getattr(factory, factory.initial) except: meth=factory # if we still have a factory, get the add method try: meth=getattr(meth, meth.initial) except: pass if hasattr(meth, '__roles__'): roles=meth.__roles__ user=REQUEST.get('AUTHENTICATED_USER', None) if (not hasattr(user, 'has_role') or not user.has_role(roles, self)): raise 'Unauthorized', ( """You are not authorized to perform this operation.""" ) return raise CopyError, MessageDialog( title='Not Supported', message='The object %s does not support this ' \ 'operation' % absattr(ob.id), action='manage_main') Globals.default__class_init__(CopyContainer) class CopySource: """Interface for objects which allow themselves to be copied.""" def _canCopy(self, op=0): """Called to make sure this object is copyable. The op var is 0 for a copy, 1 for a move.""" return 1 def _notifyOfCopyTo(self, container, op=0): """Overide this to be pickly about where you go! If you dont want to go there, raise an exception. The op variable is 0 for a copy, 1 for a move.""" pass def _getCopy(self, container): # Ask an object for a new copy of itself. f=tempfile.TemporaryFile() self._p_jar.exportFile(self._p_oid,f) f.seek(0) ob=container._p_jar.importFile(f) f.close() return ob def _postCopy(self, container, op=0): # Called after the copy is finished to accomodate special cases. # The op var is 0 for a copy, 1 for a move. pass def _setId(self, id): # Called to set the new id of a copied object. self.id=id def cb_isCopyable(self): """Is object copyable? Returns 0 or 1""" if not (hasattr(self, '_canCopy') and self._canCopy(0)): return 0 if hasattr(self, '_p_jar') and self._p_jar is None: return 0 return 1 def cb_isMoveable(self): """Is object moveable? Returns 0 or 1""" if not (hasattr(self, '_canCopy') and self._canCopy(1)): return 0 if hasattr(self, '_p_jar') and self._p_jar is None: return 0 try: n=self.aq_parent._reserved_names except: n=() if absattr(self.id) in n: return 0 return 1 def sanity_check(c, ob): # This is called on cut/paste operations to make sure that # an object is not cut and pasted into itself or one of its # subobjects, which is an undefined situation. ob=getattr(ob, 'aq_base', ob) while 1: if getattr(c, 'aq_base', c) is ob: return 0 if not hasattr(c, 'aq_parent'): return 1 c=c.aq_parent def absattr(attr): if callable(attr): return attr() return attr def _cb_encode(d): return quote(compress(dumps(d), 9)) def _cb_decode(s): return loads(decompress(unquote(s))) fMessageDialog=Globals.HTML(""" <!--#var title-->
    TARGET="" >

    !

    """, target='', action='manage_main', title='Changed') eNoData=MessageDialog( title='No Data', message='No clipboard data found.', action ='manage_main',) eInvalid=MessageDialog( title='Clipboard Error', message='The data in the clipboard could not be read, possibly due ' \ 'to cookie data being truncated by your web browser. Try copying ' \ 'fewer objects.', action ='manage_main',) eNotFound=MessageDialog( title='Item Not Found', message='One or more items referred to in the clipboard data was ' \ 'not found. The item may have been moved or deleted after you ' \ 'copied it.', action ='manage_main',) eNotSupported=fMessageDialog( title='Not Supported', message='The item %s does not support this operation.', action ='manage_main',) Zope-2.0.1-ZEO-nonbin/lib/python/OFS/DTMLDocument.py100644 1007 1403 20417 6752100502 21654 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """DTML Document objects.""" __version__='$Revision: 1.30 $'[11:-2] from DocumentTemplate.DT_Util import InstanceDict, TemplateDict from ZPublisher.Converters import type_converters from Globals import HTML, HTMLFile, MessageDialog from OFS.content_types import guess_content_type from DTMLMethod import DTMLMethod, decapitate from PropertyManager import PropertyManager from webdav.common import rfc1123_date from sgmllib import SGMLParser from string import find from urllib import quote import Globals done='done' class DTMLDocument(PropertyManager, DTMLMethod): """DTML Document objects are DocumentTemplate.HTML objects that act as methods whose 'self' is the DTML Document itself.""" meta_type='DTML Document' icon ='p_/dtmldoc' manage_options=({'label':'Edit', 'action':'manage_main'}, {'label':'Upload', 'action':'manage_uploadForm'}, {'label':'Properties', 'action':'manage_propertiesForm'}, {'label':'View', 'action':''}, {'label':'Proxy', 'action':'manage_proxyForm'}, {'label':'Security', 'action':'manage_access'}, ) __ac_permissions__=( ('Change DTML Documents', ('manage_edit', 'manage_upload', 'PUT')), ) def manage_edit(self,data,title,SUBMIT='Change',dtpref_cols='50', dtpref_rows='20',REQUEST=None): """ Replaces a Documents contents with Data, Title with Title. The SUBMIT parameter is also used to change the size of the editing area on the default Document edit screen. If the value is "Smaller", the rows and columns decrease by 5. If the value is "Bigger", the rows and columns increase by 5. If any other or no value is supplied, the data gets checked for DTML errors and is saved. """ self._validateProxy(REQUEST) if self._size_changes.has_key(SUBMIT): return self._er(data,title,SUBMIT,dtpref_cols,dtpref_rows,REQUEST) self.title=title if type(data) is not type(''): data=data.read() self.munge(data) if REQUEST: message="Content changed." return self.manage_main(self,REQUEST,manage_tabs_message=message) def manage_upload(self,file='', REQUEST=None): """Replace the contents of the document with the text in file.""" self._validateProxy(REQUEST) if type(file) is not type(''): file=file.read() self.munge(file) if REQUEST: return MessageDialog( title ='Success!', message='Your changes have been saved', action ='manage_main') def __call__(self, client=None, REQUEST={}, RESPONSE=None, **kw): """Render the document given a client object, REQUEST mapping, Response, and key word arguments.""" kw['document_id'] =self.id kw['document_title']=self.title if hasattr(self, 'aq_explicit'): bself=self.aq_explicit else: bself=self if client is None: # Called as subtemplate, so don't need error propigation! r=apply(HTML.__call__, (self, bself, REQUEST), kw) if RESPONSE is None: return r return decapitate(r, RESPONSE) r=apply(HTML.__call__, (self, (client, bself), REQUEST), kw) if type(r) is not type(''): return r if RESPONSE is None: return r hh=RESPONSE.headers.has_key if not (hh('content-type') or hh('Content-Type')): if self.__dict__.has_key('content_type'): c=self.content_type else: c, e=guess_content_type(self.__name__, r) RESPONSE.setHeader('Content-Type', c) return r Globals.default__class_init__(DTMLDocument) default_dd_html="""

    This is the Document.

    """ addForm=HTMLFile('documentAdd', globals()) def addDTMLDocument(self, id, title='', file='', REQUEST=None, submit=None): """Add a DTML Document object with the contents of file. If 'file' is empty, default document text is used. """ if type(file) is not type(''): file=file.read() if not file: file=default_dd_html ob=DTMLDocument(file, __name__=id) ob.title=title id=self._setObject(id, ob) if REQUEST is not None: try: u=self.DestinationURL() except: u=REQUEST['URL1'] if submit==" Add and Edit ": u="%s/%s" % (u,quote(id)) REQUEST.RESPONSE.redirect(u+'/manage_main') return '' Zope-2.0.1-ZEO-nonbin/lib/python/OFS/DTMLMethod.py100644 1007 1403 35263 6762541605 21341 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """DTML Method objects.""" __version__='$Revision: 1.33 $'[11:-2] from Globals import HTML, HTMLFile, MessageDialog from string import join,split,strip,rfind,atoi,lower from SimpleItem import Item_w__name__, pretty_tb from OFS.content_types import guess_content_type from DocumentTemplate.DT_Util import cDocument from PropertyManager import PropertyManager from AccessControl.Role import RoleManager from webdav.common import rfc1123_date from ZDOM import ElementWithTitle from DateTime.DateTime import DateTime from urllib import quote import ts_regex, Globals, sys, Acquisition class DTMLMethod(cDocument, HTML, Acquisition.Implicit, RoleManager, ElementWithTitle, Item_w__name__): """DTML Method objects are DocumentTemplate.HTML objects that act as methods of their containers.""" meta_type='DTML Method' _proxy_roles=() index_html=None # Prevent accidental acquisition # Documents masquerade as functions: class func_code: pass func_code=func_code() func_code.co_varnames='self','REQUEST','RESPONSE' func_code.co_argcount=3 manage_options=({'label':'Edit', 'action':'manage_main'}, {'label':'Upload', 'action':'manage_uploadForm'}, {'label':'View', 'action':''}, {'label':'Proxy', 'action':'manage_proxyForm'}, {'label':'Security', 'action':'manage_access'}, ) __ac_permissions__=( ('View management screens', ('manage_editForm', 'manage', 'manage_main', 'manage_uploadForm', 'document_src', 'PrincipiaSearchSource')), ('Change DTML Methods', ('manage_edit', 'manage_upload', 'PUT')), ('Change proxy roles', ('manage_proxyForm', 'manage_proxy')), ('View', ('__call__', '')), ('FTP access', ('manage_FTPstat','manage_FTPget','manage_FTPlist')), ) def __call__(self, client=None, REQUEST={}, RESPONSE=None, **kw): """Render the document given a client object, REQUEST mapping, Response, and key word arguments.""" kw['document_id'] =self.id kw['document_title']=self.title if client is None: # Called as subtemplate, so don't need error propigation! r=apply(HTML.__call__, (self, client, REQUEST), kw) if RESPONSE is None: return r return decapitate(r, RESPONSE) r=apply(HTML.__call__, (self, client, REQUEST), kw) if type(r) is not type(''): return r if RESPONSE is None: return r # Ick. I don't like this. But someone can override it with # a header if they have to. hh=RESPONSE.headers.has_key if not (hh('content-type') or hh('Content-Type')): c, e=guess_content_type(self.__name__, r) RESPONSE.setHeader('Content-Type', c) return decapitate(r, RESPONSE) def get_size(self): return len(self.raw) getSize=get_size def oldvalidate(self, inst, parent, name, value, md): ################################################################# # Note that this method is not used normally. It is simply a # Python rendition of the validate method implemented in # DocumentTemplate.cDocumentTemplate. The Python version # serves the role of a requirements spec for the C version and # can also be useful (if temporarily renamed to validate) for # debugging. ################################################################# try: if (name[:3]=='aq_' and name != 'aq_parent' and name != 'aq_explicit'): return 0 except: pass # name might not be a string! # Try to get roles if hasattr(value, '__roles__'): roles=value.__roles__ else: if hasattr(parent,'__roles__'): roles=parent.__roles__ elif hasattr(parent, 'aq_acquire'): try: roles=parent.aq_acquire('__roles__') except AttributeError: if hasattr(inst, 'aq_base'): inst=inst.aq_base if hasattr(parent, 'aq_base'): parent=parent.aq_base return inst is parent else: if hasattr(inst, 'aq_base'): inst=inst.aq_base if hasattr(parent, 'aq_base'): parent=parent.aq_base return inst is parent value=parent if roles is None: return 1 try: if md.AUTHENTICATED_USER.hasRole(value, roles): return 1 except AttributeError: pass for r in self._proxy_roles: if r in roles: return 1 if inst is parent: raise 'Unauthorized', ( 'You are not authorized to access %s.' % name) return 0 manage_editForm=HTMLFile('documentEdit', globals()) manage_uploadForm=HTMLFile('documentUpload', globals()) manage=manage_main=manage_editDocument=manage_editForm manage_proxyForm=HTMLFile('documentProxy', globals()) _size_changes={ 'Bigger': (5,5), 'Smaller': (-5,-5), 'Narrower': (0,-5), 'Wider': (0,5), 'Taller': (5,0), 'Shorter': (-5,0), } def _er(self,data,title,SUBMIT,dtpref_cols,dtpref_rows,REQUEST): dr,dc = self._size_changes[SUBMIT] rows=max(1,atoi(dtpref_rows)+dr) cols=max(40,atoi(dtpref_cols)+dc) e=(DateTime('GMT') + 365).rfc822() resp=REQUEST['RESPONSE'] resp.setCookie('dtpref_rows',str(rows),path='/',expires=e) resp.setCookie('dtpref_cols',str(cols),path='/',expires=e) return self.manage_main( self,REQUEST,title=title,__str__=self.quotedHTML(data), dtpref_cols=cols,dtpref_rows=rows) def manage_edit(self,data,title,SUBMIT='Change',dtpref_cols='50', dtpref_rows='20',REQUEST=None): """ Replaces a Documents contents with Data, Title with Title. The SUBMIT parameter is also used to change the size of the editing area on the default Document edit screen. If the value is "Smaller", the rows and columns decrease by 5. If the value is "Bigger", the rows and columns increase by 5. If any other or no value is supplied, the data gets checked for DTML errors and is saved. """ self._validateProxy(REQUEST) if self._size_changes.has_key(SUBMIT): return self._er(data,title,SUBMIT,dtpref_cols,dtpref_rows,REQUEST) self.title=title if type(data) is not type(''): data=data.read() self.munge(data) if REQUEST: message="Content changed." return self.manage_main(self,REQUEST,manage_tabs_message=message) def manage_upload(self,file='', REQUEST=None): """Replace the contents of the document with the text in file.""" self._validateProxy(REQUEST) if type(file) is not type(''): file=file.read() self.munge(file) if REQUEST: return MessageDialog( title ='Success!', message='Your changes have been saved', action ='manage_main') def manage_haveProxy(self,r): return r in self._proxy_roles def _validateProxy(self, request, roles=None): if roles is None: roles=self._proxy_roles if not roles: return user=u=request.get('AUTHENTICATED_USER',None) if user is not None: user=user.hasRole for r in roles: if r and not user(None, (r,)): user=None break if user is not None: return raise 'Forbidden', ( 'You are not authorized to change %s because you ' 'do not have proxy roles.\n' % (self.__name__, u, roles)) def manage_proxy(self, roles=(), REQUEST=None): "Change Proxy Roles" self._validateProxy(REQUEST, roles) self._validateProxy(REQUEST) self._proxy_roles=tuple(roles) if REQUEST: return MessageDialog( title ='Success!', message='Your changes have been saved', action ='manage_main') def PrincipiaSearchSource(self): "Support for searching - the document's contents are searched." return self.read() def document_src(self, REQUEST, RESPONSE): """Return unprocessed document source.""" RESPONSE.setHeader('Content-Type', 'text/plain') return self.read() ## Protocol handlers def PUT(self, REQUEST, RESPONSE): """Handle HTTP PUT requests.""" self.dav__init(REQUEST, RESPONSE) body=REQUEST.get('BODY', '') self._validateProxy(REQUEST) self.munge(body) RESPONSE.setStatus(204) return RESPONSE def manage_FTPget(self): "Get source for FTP download" return self.read() def decapitate(html, RESPONSE=None, header_re=ts_regex.compile( '\(\(' '[^\n\0\- <>:]+:[^\n]*\n' '\|' '[ \t]+[^\0\- ][^\n]*\n' '\)+\)[ \t]*\n\([\0-\377]+\)' ), space_re=ts_regex.compile('\([ \t]+\)'), name_re=ts_regex.compile('\([^\0\- <>:]+\):\([^\n]*\)'), ): ts_results = header_re.match_group(html, (1,3)) if not ts_results: return html headers, html = ts_results[1] headers=split(headers,'\n') i=1 while i < len(headers): if not headers[i]: del headers[i] continue ts_results = space_re.match_group(headers[i], (1,)) if ts_results: headers[i-1]="%s %s" % (headers[i-1], headers[i][len(ts_results[1]):]) del headers[i] continue i=i+1 for i in range(len(headers)): ts_results = name_re.match_group(headers[i], (1,2)) if ts_results: k, v = ts_results[1] v=strip(v) else: raise ValueError, 'Invalid Header (%d): %s ' % (i,headers[i]) RESPONSE.setHeader(k,v) return html default_dm_html="""

    This is the Document in the Folder.

    """ addForm=HTMLFile('methodAdd', globals()) def addDTMLMethod(self, id, title='', file='', REQUEST=None, submit=None): """Add a DTML Method object with the contents of file. If 'file' is empty, default document text is used. """ if type(file) is not type(''): file=file.read() if not file: file=default_dm_html ob=DTMLMethod(file, __name__=id) ob.title=title id=self._setObject(id, ob) if REQUEST is not None: try: u=self.DestinationURL() except: u=REQUEST['URL1'] if submit==" Add and Edit ": u="%s/%s" % (u,quote(id)) REQUEST.RESPONSE.redirect(u+'/manage_main') return '' Zope-2.0.1-ZEO-nonbin/lib/python/OFS/Document.py100644 1007 1403 7603 6700211535 21157 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Deprecated - use DTMLMethod""" __version__='$Revision: 1.74 $'[11:-2] import DTMLMethod Document=DTMLMethod.DTMLMethod manage_addDocument=DTMLMethod.addDTMLMethod Zope-2.0.1-ZEO-nonbin/lib/python/OFS/FTPInterface.py100644 1007 1403 11747 6671334623 21712 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """FTP Support for Zope classes. Preliminary FTP support interface. Note, most FTP functions are provided by existing methods such as PUT and manage_delObjects. All FTP methods should be governed by a single permission: 'FTP access'. """ class FTPInterface: "Interface for FTP objects" # XXX The stat and list marshal format should probably # be XML, not marshal, maybe Andrew K's xml-marshal. # This will probably be changed later. def manage_FTPstat(self,REQUEST): """Returns a stat-like tuple. (marshalled to a string) Used by FTP for directory listings, and MDTM and SIZE""" def manage_FTPlist(self,REQUEST): """Returns a directory listing consisting of a tuple of (id,stat) tuples, marshaled to a string. Note, the listing it should include '..' if there is a Folder above the current one. In the case of non-foldoid objects it should return a single tuple (id,stat) representing itself.""" # Optional method to support FTP download. # Should not be implemented by Foldoid objects. def manage_FTPget(self): """Returns the source content of an object. For example, the source text of a Document, or the data of a file.""" Zope-2.0.1-ZEO-nonbin/lib/python/OFS/FindSupport.py100644 1007 1403 21616 6770035435 21710 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__="""Principia Find support""" __version__='$Revision: 1.12 $'[11:-2] import sys, os, string, time, Globals, ExtensionClass from DocumentTemplate.DT_Util import Eval, expr_globals from AccessControl.Permission import name_trans from Globals import HTMLFile from DocumentTemplate.DT_Util import InstanceDict, TemplateDict, cDocument from DateTime import DateTime from string import find class FindSupport(ExtensionClass.Base): """Find support for Zope Folders""" manage_findFrame=HTMLFile('findFrame', globals()) manage_findForm=HTMLFile('findForm', globals()) manage_findAdv=HTMLFile('findAdv', globals()) manage_findResult=HTMLFile('findResult', globals()) __ac_permissions__=( ('View management screens', ('manage_findFrame', 'manage_findForm', 'manage_findAdv', 'manage_findResult')), ) def ZopeFind(self, obj, obj_ids=None, obj_metatypes=None, obj_searchterm=None, obj_expr=None, obj_mtime=None, obj_mspec=None, obj_permission=None, obj_roles=None, search_sub=0, REQUEST=None, result=None, pre=''): """Zope Find interface""" if result is None: result=[] if obj_metatypes and 'all' in obj_metatypes: obj_metatypes=None if obj_mtime and type(obj_mtime)==type('s'): obj_mtime=DateTime(obj_mtime).timeTime() if obj_permission: obj_permission=p_name(obj_permission) if obj_roles and type(obj_roles) is type('s'): obj_roles=[obj_roles] if obj_expr: # Setup expr machinations md=td() if hasattr(REQUEST, 'AUTHENTICATED_USER'): md.AUTHENTICATED_USER=REQUEST.AUTHENTICATED_USER obj_expr=(Eval(obj_expr, expr_globals), md, md._push, md._pop) base=obj if hasattr(obj, 'aq_base'): base=obj.aq_base if not hasattr(base, 'objectItems'): return result try: items=base.objectItems() except: return result try: add_result=result.append except: raise AttributeError, `result` for id, ob in items: if pre: p="%s/%s" % (pre, id) else: p=id dflag=0 if hasattr(ob, '_p_changed') and (ob._p_changed == None): dflag=1 if hasattr(ob, 'aq_base'): bs=ob.aq_base else: bs=ob if ( (not obj_ids or absattr(bs.id) in obj_ids) and (not obj_metatypes or (hasattr(bs, 'meta_type') and bs.meta_type in obj_metatypes)) and (not obj_searchterm or (hasattr(ob, 'PrincipiaSearchSource') and find(ob.PrincipiaSearchSource(), obj_searchterm) >= 0 )) and (not obj_expr or expr_match(ob, obj_expr)) and (not obj_mtime or mtime_match(ob, obj_mtime, obj_mspec)) and ( (not obj_permission or not obj_roles) or \ role_match(ob, obj_permission, obj_roles) ) ): add_result((p, ob)) dflag=0 if search_sub and hasattr(bs, 'objectItems'): self.ZopeFind(ob, obj_ids, obj_metatypes, obj_searchterm, obj_expr, obj_mtime, obj_mspec, obj_permission, obj_roles, search_sub, REQUEST, result, p) if dflag: ob._p_deactivate() return result PrincipiaFind=ZopeFind class td(TemplateDict, cDocument): pass def expr_match(ob, ed, c=InstanceDict, r=0): e, md, push, pop=ed push(c(ob, md)) try: r=e.eval(md) finally: pop() return r def mtime_match(ob, t, q, fn=hasattr): if not fn(ob, '_p_mtime'): return 0 return q=='<' and (ob._p_mtime < t) or (ob._p_mtime > t) def role_match(ob, permission, roles, lt=type([]), tt=type(())): pr=[] fn=pr.append while 1: if hasattr(ob, permission): p=getattr(ob, permission) if type(p) is lt: map(fn, p) if hasattr(ob, 'aq_parent'): ob=ob.aq_parent continue break if type(p) is tt: map(fn, p) break if p is None: map(fn, ('Manager', 'Anonymous')) break if hasattr(ob, 'aq_parent'): ob=ob.aq_parent continue break for role in roles: if not (role in pr): return 0 return 1 # Helper functions def absattr(attr): if callable(attr): return attr() return attr def p_name(name): return '_' + string.translate(name, name_trans) + '_Permission' Globals.default__class_init__(FindSupport) Zope-2.0.1-ZEO-nonbin/lib/python/OFS/Folder.py100644 1007 1403 14455 6767465520 20661 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Folder object Folders are the basic container objects and are analogous to directories. $Id: Folder.py,v 1.83 1999/09/14 15:35:44 brian Exp $""" __version__='$Revision: 1.83 $'[11:-2] import Globals, SimpleItem from ObjectManager import ObjectManager from PropertyManager import PropertyManager from AccessControl.Role import RoleManager from webdav.Collection import Collection from FindSupport import FindSupport from Globals import HTMLFile manage_addFolderForm=HTMLFile('folderAdd', globals()) def manage_addFolder(self, id, title='', createPublic=0, createUserF=0, REQUEST=None): """Add a new Folder object with id *id*. If the 'createPublic' and 'createUserF' parameters are set to any true value, an 'index_html' and a 'UserFolder' objects are created respectively in the new folder. """ ob=Folder() ob.id=id ob.title=title self._setObject(id, ob) try: user=REQUEST['AUTHENTICATED_USER'] except: user=None if createUserF: if (user is not None) and not ( user.has_permission('Add User Folders', self)): raise 'Unauthorized', ( 'You are not authorized to add User Folders.' ) ob.manage_addUserFolder() if createPublic: if (user is not None) and not ( user.has_permission('Add Documents, Images, and Files', self)): raise 'Unauthorized', ( 'You are not authorized to add DTML Documents.' ) ob.manage_addDTMLDocument(id='index_html', title='') if REQUEST is not None: return self.manage_main(self, REQUEST, update_menu=1) class Folder(ObjectManager, PropertyManager, RoleManager, Collection, SimpleItem.Item, FindSupport): """ Folders are basic container objects that provide a standard interface for object management. Folder objects also implement a management interface and can have arbitrary properties. """ meta_type='Folder' _properties=({'id':'title', 'type': 'string'},) manage_options=( {'label':'Contents', 'action':'manage_main'}, {'label':'View', 'action':'index_html'}, {'label':'Properties', 'action':'manage_propertiesForm'}, {'label':'Import/Export', 'action':'manage_importExportForm'}, {'label':'Security', 'action':'manage_access'}, {'label':'Undo', 'action':'manage_UndoForm'}, {'label':'Find', 'action':'manage_findFrame', 'target':'manage_main'}, ) __ac_permissions__=() Globals.default__class_init__(Folder) Zope-2.0.1-ZEO-nonbin/lib/python/OFS/Image.py100644 1007 1403 45215 6762564412 20461 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Image object""" __version__='$Revision: 1.84 $'[11:-2] import Globals, string, struct, content_types from OFS.content_types import guess_content_type from Globals import HTMLFile, MessageDialog from PropertyManager import PropertyManager from AccessControl.Role import RoleManager from webdav.common import rfc1123_date from SimpleItem import Item_w__name__ from cStringIO import StringIO from Globals import Persistent from Acquisition import Implicit from DateTime import DateTime StringType=type('') manage_addFileForm=HTMLFile('imageAdd', globals(),Kind='File',kind='file') def manage_addFile(self,id,file,title='',precondition='', content_type='', REQUEST=None): """Add a new File object. Creates a new File object 'id' with the contents of 'file'""" id, title = cookId(id, title, file) self=self.this() # First, we create the file without data: self._setObject(id, File(id,title,'',content_type, precondition)) # Now we "upload" the data. By doing this in two steps, we # can use a database trick to make the upload more efficient. self._getOb(id).manage_upload(file) if REQUEST is not None: REQUEST['RESPONSE'].redirect(self.absolute_url()+'/manage_main') class File(Persistent,Implicit,PropertyManager, RoleManager,Item_w__name__): """A File object is a content object for arbitrary files.""" meta_type='File' precondition='' size=None manage_editForm =HTMLFile('fileEdit',globals(),Kind='File',kind='file') manage_uploadForm=HTMLFile('imageUpload',globals(),Kind='File',kind='file') manage=manage_main=manage_editForm manage_options=({'label':'Edit', 'action':'manage_main'}, {'label':'Upload', 'action':'manage_uploadForm'}, {'label':'Properties', 'action':'manage_propertiesForm'}, {'label':'View', 'action':''}, {'label':'Security', 'action':'manage_access'}, ) __ac_permissions__=( ('View management screens', ('manage', 'manage_main', 'manage_uploadForm',)), ('Change Images and Files', ('manage_edit','manage_upload','PUT')), ('View', ('index_html', 'tag', 'view_image_or_file', 'getSize', 'getContentType', '')), ('FTP access', ('manage_FTPstat','manage_FTPget','manage_FTPlist')), ('Delete objects', ('DELETE',)), ) _properties=({'id':'title', 'type': 'string'}, {'id':'content_type', 'type':'string'}, ) def __init__(self, id, title, file, content_type='', precondition=''): self.__name__=id self.title=title self.precondition=precondition data, size = self._read_data(file) content_type=self._get_content_type(file, data, id, content_type) self.update_data(data, content_type, size) def id(self): return self.__name__ def index_html(self, REQUEST, RESPONSE): """ The default view of the contents of a File or Image. Returns the contents of the file or image. Also, sets the Content-Type HTTP header to the objects content type. """ # Attempt to handle If-Modified-Since headers. ms=REQUEST.get_header('If-Modified-Since', None) if ms is not None: ms=string.split(ms, ';')[0] ms=DateTime(ms).timeTime() if self._p_mtime > ms: RESPONSE.setStatus(304) return RESPONSE if self.precondition and hasattr(self,self.precondition): # Grab whatever precondition was defined and then # execute it. The precondition will raise an exception # if something violates its terms. c=getattr(self,self.precondition) if hasattr(c,'isDocTemp') and c.isDocTemp: c(REQUEST['PARENTS'][1],REQUEST) else: c() RESPONSE.setHeader('Last-Modified', rfc1123_date(self._p_mtime)) RESPONSE.setHeader('Content-Type', self.content_type) return self.data def view_image_or_file(self, URL1): """ The default view of the contents of the File or Image. """ raise 'Redirect', URL1 def update_data(self, data, content_type=None, size=None): if content_type is not None: self.content_type=content_type if size is None: size=len(data) self.size=size self.data=data def manage_edit(self, title, content_type, precondition='', REQUEST=None): """ Changes the title and content type attributes of the File or Image. """ self.title=title self.content_type=content_type if precondition: self.precondition=precondition elif self.precondition: del self.precondition if REQUEST: return MessageDialog( title ='Success!', message='Your changes have been saved', action ='manage_main') def manage_upload(self,file='',REQUEST=None): """ Replaces the current contents of the File or Image object with file. The file or images contents are replaced with the contents of 'file'. """ data, size = self._read_data(file) content_type=self._get_content_type(file, data, self.__name__, self.content_type) self.update_data(data, content_type, size) if REQUEST: return MessageDialog( title ='Success!', message='Your changes have been saved', action ='manage_main') def _get_content_type(self, file, body, id, content_type=None): headers=getattr(file, 'headers', None) if headers and headers.has_key('content-type'): content_type=headers['content-type'] else: if type(body) is not type(''): body=body.data content_type, enc=guess_content_type( getattr(file, 'filename',id), body, content_type) return content_type def _read_data(self, file): n=1<<16 if type(file) is StringType: size=len(file) if size < n: return file, size return Pdata(file), size seek=file.seek read=file.read seek(0,2) size=end=file.tell() if size <= 2*n: seek(0) if size < n: return read(size), size return Pdata(read(size)), size # Make sure we have an _p_jar, even if we are a new object, by # doing a sub-transaction commit. get_transaction().commit(1) jar=self._p_jar if jar is None: # Ugh seek(0) return Pdata(read(size)), size # Now we're going to build a linked list from back # to front to minimize the number of database updates # and to allow us to get things out of memory as soon as # possible. next=None while end > 0: pos=end-n if pos < n: pos=0 # we always want at least n bytes seek(pos) data=Pdata(read(end-pos)) # Woooop Woooop Woooop! This is a trick. # We stuff the data directly into our jar to reduce the # number of updates necessary. data._p_jar=jar # This is needed and has side benefit of getting # the thing registered: data.next=next # Now make it get saved in a sub-transaction! get_transaction().commit(1) # Now make it a ghost to free the memory. We # don't need it anymore! data._p_changed=None next=data end=pos return next, size def PUT(self, REQUEST, RESPONSE): """Handle HTTP PUT requests""" self.dav__init(REQUEST, RESPONSE) type=REQUEST.get_header('content-type', None) file=REQUEST['BODYFILE'] data, size = self._read_data(file) content_type=self._get_content_type(file, data, self.__name__, type or self.content_type) self.update_data(data, content_type, size) RESPONSE.setStatus(204) return RESPONSE def getSize(self): """Get the size of a file or image. Returns the size of the file or image. """ size=self.size if size is None: size=len(self.data) return size get_size=getSize def getContentType(self): """Get the content type of a file or image. Returns the content type (MIME type) of a file or image. """ return self.content_type size=getSize def __str__(self): return str(self.data) def __len__(self): return 1 def manage_FTPget(self): "Get data for FTP download" return self.data manage_addImageForm=HTMLFile('imageAdd',globals(),Kind='Image',kind='image') def manage_addImage(self, id, file, title='', precondition='', content_type='', REQUEST=None): """ Add a new Image object. Creates a new Image object 'id' with the contents of 'file'. """ id, title = cookId(id, title, file) self=self.this() # First, we create the image without data: self._setObject(id, Image(id,title,'',content_type, precondition)) # Now we "upload" the data. By doing this in two steps, we # can use a database trick to make the upload more efficient. self._getOb(id).manage_upload(file) if REQUEST is not None: try: url=self.DestinationURL() except: url=REQUEST['URL1'] REQUEST.RESPONSE.redirect('%s/manage_main' % url) return id class Image(File): """Image objects can be GIF, PNG or JPEG and have the same methods as File objects. Images also have a string representation that renders an HTML 'IMG' tag. """ meta_type='Image' height=0 width=0 _properties=({'id':'title', 'type': 'string'}, {'id':'content_type', 'type':'string'}, {'id':'height', 'type':'string'}, {'id':'width', 'type':'string'}, ) manage_options=({'label':'Edit', 'action':'manage_main'}, {'label':'Upload', 'action':'manage_uploadForm'}, {'label':'Properties', 'action':'manage_propertiesForm'}, {'label':'View', 'action':'view_image_or_file'}, {'label':'Security', 'action':'manage_access'}, ) manage_editForm =HTMLFile('imageEdit',globals(),Kind='Image',kind='image') view_image_or_file =HTMLFile('imageView',globals()) manage_uploadForm=HTMLFile('imageUpload',globals(),Kind='Image', kind='image') manage=manage_main=manage_editForm def update_data(self, data, content_type=None, size=None): if content_type is not None: self.content_type=content_type if size is None: size=len(data) self.size=size self.data=data data=str(data) # handle GIFs if (size >= 10) and data[:6] in ('GIF87a', 'GIF89a'): w, h = struct.unpack("= 2) and (data[:2] == '\377\330'): jpeg=StringIO(data) jpeg.read(2) b=jpeg.read(1) try: while (b and ord(b) != 0xDA): while (ord(b) != 0xFF): b = jpeg.read(1) while (ord(b) == 0xFF): b = jpeg.read(1) if (ord(b) >= 0xC0 and ord(b) <= 0xC3): jpeg.read(3) h, w = struct.unpack(">HH", jpeg.read(4)) break else: jpeg.read(int(struct.unpack(">H", jpeg.read(2))[0])-2) b = jpeg.read(1) self.width=str(int(w)) self.height=str(int(h)) except: pass # handle PNGs # Someone says this is the right thing: # Re: PNG v1.2 spec (http://www.cdrom.com/pub/png/spec/) # Bytes 0-7 are below, 4-byte chunk length, then 'IHDR' # and finally the 4-byte width, height elif (size >= 24) and (data[:8] == '\211PNG\r\n\032\n') \ and (data[12:16] == 'IHDR'): w, h = struct.unpack(">LL", data[16:24]) # But we had this before. I have no clue, so I'll keep both. :) # Maybe this is for an older PNG version. elif (size >= 16) and (data[:8] == '\x89PNG\r\n\x1a\n'): w, h = struct.unpack(">LL", data[8:16]) self.width=str(int(w)) self.height=str(int(h)) def __str__(self): width=self.width and ('width="%s" ' % self.width) or '' height=self.height and ('height="%s" ' % self.height) or '' return '' % ( self.absolute_url(), width, height, self.title_or_id() ) def tag(self, height=None, width=None, alt=None, **args): """ Generate an HTML IMG tag for this image, with customization. Arguments to self.tag() can be any valid attributes of an IMG tag. 'src' will always be an absolute pathname, to prevent redundant downloading of images. Defaults are applied intelligently for 'height', 'width', and 'alt'. """ string='=None:' def cookId(id, title, file): if not id and hasattr(file,'filename'): filename=file.filename title=title or filename id=filename[max(string.rfind(filename, '/'), string.rfind(filename, '\\'), string.rfind(filename, ':'), )+1:] return id, title class Pdata(Persistent, Implicit): # Wrapper for possibly large data next=None def __init__(self, data): self.data=data def __getslice__(self, i, j): return self.data[i:j] def __len__(self): return len(self.data) def __str__(self): next=self.next if next is None: return self.data r=[self.data] while next is not None: self=next r.append(self.data) next=self.next return string.join(r,'') Zope-2.0.1-ZEO-nonbin/lib/python/OFS/Moniker.py100644 1007 1403 12421 6743416763 21040 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Object monikers An object moniker is an intelligent reference to a persistent object. A moniker can be turned back into a real object that retains its correct version context and aquisition relationships via a simple interface. """ __version__='$Revision: 1.12 $'[11:-2] import Globals class Moniker: """An object moniker is an intelligent reference to a persistent object. A moniker can be turned back into a real object that retains its correct version context and aquisition relationships via a simple interface.""" def __init__(self, ob=None): if ob is None: return self.jar=ob._p_jar.getVersion() self.ids=[] while 1: if not hasattr(ob, '_p_oid'): break self.ids.append(ob._p_oid) if not hasattr(ob, 'aq_parent'): break ob=ob.aq_parent self.ids.reverse() def id(self): return absattr(self.bind().id) def mtype(self): return absattr(self.bind().meta_type) def bind(self, jar): "Return the real object named by this moniker" ob=None for n in self.ids: o=jar[n] if ob is not None: o=o.__of__(ob) ob=o return ob def exact(self, ob): """Check against another moniker to see if it refers to the exact same object in the exact same acquisition context.""" return self.jar==ob.jar and self.ids==ob.ids def absattr(attr): if callable(attr): return attr() return attr Zope-2.0.1-ZEO-nonbin/lib/python/OFS/ObjectManager.py100644 1007 1403 50524 6745667272 22150 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__="""Object Manager $Id: ObjectManager.py,v 1.80 1999/07/22 19:19:22 jim Exp $""" __version__='$Revision: 1.80 $'[11:-2] import App.Management, Acquisition, App.Undo, Globals, CopySupport, Products import os, App.FactoryDispatcher, ts_regex, Products from Globals import HTMLFile, HTMLFile, Persistent from Globals import MessageDialog, default__class_init__ from webdav.NullResource import NullResource from webdav.Collection import Collection from urllib import quote from cStringIO import StringIO import marshal import App.Common bad_id=ts_regex.compile('[^a-zA-Z0-9-_~\,\. ]').match #TS _marker=[] class ObjectManager( CopySupport.CopyContainer, App.Management.Navigation, App.Management.Tabs, Acquisition.Implicit, Persistent, App.Undo.UndoSupport, Collection, ): """Generic object manager This class provides core behavior for collections of heterogeneous objects. """ __ac_permissions__=( ('View management screens', ('manage_main','manage_menu')), ('Access contents information', ('objectIds', 'objectValues', 'objectItems',''), ('Anonymous', 'Manager'), ), ('Delete objects', ('manage_delObjects',)), ('FTP access', ('manage_FTPstat','manage_FTPlist')), ('Import/Export objects', ('manage_importObject','manage_importExportForm', 'manage_exportObject') ), ) meta_type ='Object Manager' meta_types=() # Sub-object types that are specific to this object _objects =() manage_main=HTMLFile('main', globals()) manage_options=( {'label':'Contents', 'action':'manage_main'}, ) isAnObjectManager=1 isPrincipiaFolderish=1 def __class_init__(self): try: mt=list(self.meta_types) except: mt=[] for b in self.__bases__: try: for t in b.meta_types: if t not in mt: mt.append(t) except: pass mt.sort() self.meta_types=tuple(mt) default__class_init__(self) def all_meta_types(self): pmt=() if hasattr(self, '_product_meta_types'): pmt=self._product_meta_types elif hasattr(self, 'aq_acquire'): try: pmt=self.aq_acquire('_product_meta_types') except: pass return self.meta_types+Products.meta_types+pmt def _subobject_permissions(self): return (Products.__ac_permissions__+ self.aq_acquire('_getProductRegistryData')('ac_permissions') ) def filtered_meta_types(self, user): "Those meta types for which a user has adequite permissions." meta_types=[] if callable(self.all_meta_types): all=self.all_meta_types() else: all=self.all_meta_types for meta_type in all: if meta_type.has_key('permission'): if user.has_permission(meta_type['permission'],self): meta_types.append(meta_type) else: meta_types.append(meta_type) return meta_types def _checkId(self, id, allow_dup=0): # If allow_dup is false, an error will be raised if an object # with the given id already exists. If allow_dup is true, # only check that the id string contains no illegal chars. if not id: raise 'Bad Request', 'No id was specified' if bad_id(id) != -1: raise 'Bad Request', ( 'The id %s contains characters illegal in URLs.' % id) if id[0]=='_': raise 'Bad Request', ( 'The id %s is invalid - it begins with an underscore.' % id) if not allow_dup: if hasattr(self, 'aq_base'): self=self.aq_base if hasattr(self, id): raise 'Bad Request', ( 'The id %s is invalid - it is already in use.' % id) def _setOb(self, id, object): setattr(self, id, object) def _delOb(self, id): delattr(self, id) def _getOb(self, id, default=_marker): if hasattr(self, 'aq_base'): base=self.aq_base else: base=self if not hasattr(base, id): if default is _marker: raise AttributeError, id return default return getattr(self, id) def _setObject(self,id,object,roles=None,user=None): v=self._checkId(id) if v is not None: id=v try: t=object.meta_type except: t=None self._objects=self._objects+({'id':id,'meta_type':t},) self._setOb(id,object) object=self._getOb(id) object.manage_afterAdd(object, self) # Try to give user the local role "Owner". if hasattr(self, 'REQUEST') and hasattr(object, '__ac_local_roles__'): user=self.REQUEST['AUTHENTICATED_USER'] name=user.getUserName() if name != 'Anonymous User': object.manage_setLocalRoles(name, ['Owner']) return id def manage_afterAdd(self, item, container): for object in self.objectValues(): try: s=object._p_changed except: s=0 object.manage_afterAdd(item, container) if s is None: object._p_deactivate() def manage_afterClone(self, item): for object in self.objectValues(): try: s=object._p_changed except: s=0 object.manage_afterClone(item) if s is None: object._p_deactivate() def manage_beforeDelete(self, item, container): for object in self.objectValues(): try: s=object._p_changed except: s=0 object.manage_beforeDelete(item, container) if s is None: object._p_deactivate() def _delObject(self, id, dp=1): object=self._getOb(id) object.manage_beforeDelete(object, self) self._objects=tuple(filter(lambda i,n=id: i['id']!=n, self._objects)) self._delOb(id) def objectIds(self, spec=None): """Return a list of subobject ids. Returns a list of subobject ids of the current object. If 'spec' is specified, returns objects whose meta_type matches 'spec'. """ if spec is not None: if type(spec)==type('s'): spec=[spec] set=[] for ob in self._objects: if ob['meta_type'] in spec: set.append(ob['id']) return set return map(lambda i: i['id'], self._objects) def objectValues(self, spec=None): """Return a list of the actual subobjects. Returns a list of actual subobjects of the current object. If 'spec' is specified, returns only objects whose meta_type match 'spec' """ return map(self._getOb, self.objectIds(spec)) def objectItems(self, spec=None): """Return a list of (id, subobject) tuples. Returns a list of (id, subobject) tuples of the current object. If 'spec' is specified, returns only objects whose meta_type match 'spec' """ r=[] a=r.append g=self._getOb for id in self.objectIds(spec): a((id, g(id))) return r def objectMap(self): # Return a tuple of mappings containing subobject meta-data return self._objects def objectIds_d(self,t=None): if hasattr(self, '_reserved_names'): n=self._reserved_names else: n=() if not n: return self.objectIds(t) r=[] a=r.append for id in self.objectIds(t): if id not in n: a(id) return r def objectValues_d(self,t=None): return map(self._getOb, self.objectIds_d(t)) def objectItems_d(self,t=None): r=[] a=r.append g=self._getOb for id in self.objectIds_d(t): a((id, g(id))) return r def objectMap_d(self,t=None): if hasattr(self, '_reserved_names'): n=self._reserved_names else: n=() if not n: return self._objects r=[] a=r.append for d in self._objects: if d['id'] not in n: a(d) return r def superValues(self,t): """Return all of the objects of a given type The search is performed in this folder and in folders above. """ if type(t)==type('s'): t=(t,) obj=self seen={} vals=[] have=seen.has_key x=0 while x < 100: if not hasattr(obj,'_getOb'): break get=obj._getOb if hasattr(obj,'_objects'): for i in obj._objects: try: id=i['id'] if (not have(id)) and (i['meta_type'] in t): vals.append(get(id)) seen[id]=1 except: pass if hasattr(obj,'aq_parent'): obj=obj.aq_parent else: return vals x=x+1 return vals manage_addProduct=App.FactoryDispatcher.ProductDispatcher() def manage_delObjects(self, ids=[], REQUEST=None): """Delete a subordinate object The objects specified in 'ids' get deleted. """ if type(ids) is type(''): ids=[ids] if not ids: return MessageDialog(title='No items specified', message='No items were specified!', action ='./manage_main',) try: p=self._reserved_names except: p=() for n in ids: if n in p: return MessageDialog(title='Not Deletable', message='%s cannot be deleted.' % n, action ='./manage_main',) while ids: id=ids[-1] v=self._getOb(id, self) if v is self: raise 'BadRequest', '%s does not exist' % ids[-1] self._delObject(id) del ids[-1] if REQUEST is not None: return self.manage_main(self, REQUEST, update_menu=1) def tpValues(self): """Returns a list of the folder's sub-folders, used by tree tag.""" r=[] if hasattr(self.aq_base,'tree_ids'): for id in self.aq_base.tree_ids: if hasattr(self, id): r.append(self._getOb(id)) else: for id in self._objects: o=self._getOb(id['id']) try: if o.isPrincipiaFolderish: r.append(o) except: pass return r # The Following methods are short-term measures to get Paul off my back;) def manage_exportHack(self, id=None): """Exports a folder and its contents to /var/export.bbe This file can later be imported by using manage_importHack""" if id is None: o=self else: o=self._getOb(id) f=Globals.data_dir+'/export.bbe' o._p_jar.exportFile(o._p_oid,f) return f def manage_importHack(self, REQUEST=None): "Imports a previously exported object from /var/export.bbe" f=Globals.data_dir+'/export.bbe' o=self._p_jar.importFile(f) id=o.id if hasattr(id,'im_func'): id=id() self._setObject(id,o) return 'OK, I imported %s' % id # These methods replace manage_importHack and manage_exportHack def manage_exportObject(self, id='', download=None, toxml=None, RESPONSE=None): """Exports an object to a file and returns that file.""" if not id: id=self.id if callable(id): id=id() ob=self else: ob=self._getOb(id) suffix=toxml and 'xml' or 'zexp' if download: f=StringIO() if toxml: ob._p_jar.exportXML(ob._p_oid, f) else: ob._p_jar.exportFile(ob._p_oid, f) RESPONSE.setHeader('Content-type','application/data') RESPONSE.setHeader('Content-Disposition', 'inline;filename=%s.%s' % (id, suffix)) return f.getvalue() f=Globals.data_dir+'/%s.%s' % (id, suffix) if toxml: ob._p_jar.exportXML(ob._p_oid, f) else: ob._p_jar.exportFile(ob._p_oid, f) if RESPONSE is not None: return MessageDialog( title="Object exported", message="%s sucessfully\ exported to 
    %s
    ." % (id, f), action="manage_main") manage_importExportForm=HTMLFile('importExport',globals()) def manage_importObject(self, file, REQUEST=None): """Import an object from a file""" dirname, file=os.path.split(file) if dirname: raise 'Bad Request', 'Invalid file name %s' % file file=os.path.join(INSTANCE_HOME, 'import', file) if not os.path.exists(file): raise 'Bad Request', 'File does not exist: %s' % file ob=self._p_jar.importFile(file) if REQUEST: self._verifyObjectPaste(ob, REQUEST) id=ob.id if hasattr(id, 'im_func'): id=id() self._setObject(id, ob) if REQUEST is not None: return MessageDialog( title='Object imported', message='%s sucessfully imported' % id, action='manage_main' ) # FTP support methods def manage_FTPlist(self,REQUEST): "Directory listing for FTP" out=() # check to see if we are being acquiring or not ob=self while 1: if App.Common.is_acquired(ob): raise ValueError('FTP List not supported on acquired objects') if not hasattr(ob,'aq_parent'): break ob=ob.aq_parent files=self.objectItems() if not (hasattr(self,'isTopLevelPrincipiaApplicationObject') and self.isTopLevelPrincipiaApplicationObject): files.insert(0,('..',self.aq_parent)) for k,v in files: stat=marshal.loads(v.manage_FTPstat(REQUEST)) out=out+((k,stat),) return marshal.dumps(out) def manage_FTPstat(self,REQUEST): "Psuedo stat used for FTP listings" mode=0040000 from AccessControl.User import nobody # check to see if we are acquiring our objectValues or not if not (len(REQUEST.PARENTS) > 1 and self.objectValues() == REQUEST.PARENTS[1].objectValues()): if REQUEST['AUTHENTICATED_USER'].allowed( self.manage_FTPlist, self.manage_FTPlist.__roles__): mode=mode | 0770 if nobody.allowed( self.manage_FTPlist, self.manage_FTPlist.__roles__): mode=mode | 0007 mtime=self.bobobase_modification_time().timeTime() # get owner and group owner=group='Zope' for r in self.get_local_roles(): user,roles=r if 'Owner' in roles: owner=user break return marshal.dumps((mode,0,0,1,owner,group,0,mtime,mtime,mtime)) def __getitem__(self, key): v=self._getOb(key, None) if v is not None: return v if hasattr(self, 'REQUEST'): request=self.REQUEST method=request.get('REQUEST_METHOD', 'GET') if not method in ('GET', 'POST'): return NullResource(self, key, request).__of__(self) raise KeyError, key Globals.default__class_init__(ObjectManager) class PUTer(Acquisition.Explicit): """Class to support the HTTP PUT protocol.""" def __init__(self, parent, id): self.id=id self.__parent__=parent self.__roles__ =parent.PUT__roles__ def PUT(self, REQUEST, RESPONSE): """Adds a document, image or file to the folder when a PUT request is received.""" name=self.id type=REQUEST.get_header('content-type', None) body=REQUEST.get('BODY', '') if type is None: type, enc=mimetypes.guess_type(name) if type is None: if content_types.find_binary(body) >= 0: type='application/octet-stream' else: type=content_types.text_type(body) type=lower(type) if type in ('text/html', 'text/xml', 'text/plain'): self.__parent__.manage_addDTMLDocument(name, '', body) elif type[:6]=='image/': ob=Image(name, '', body, content_type=type) self.__parent__._setObject(name, ob) else: ob=File(name, '', body, content_type=type) self.__parent__._setObject(name, ob) RESPONSE.setStatus(201) RESPONSE.setBody('') return RESPONSE def __str__(self): return self.id Zope-2.0.1-ZEO-nonbin/lib/python/OFS/PropertyManager.py100644 1007 1403 32315 6747407140 22550 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Property management""" __version__='$Revision: 1.17 $'[11:-2] import ExtensionClass, Globals import ZDOM from PropertySheets import DefaultPropertySheets, vps from ZPublisher.Converters import type_converters from Globals import HTMLFile, MessageDialog from string import find,join,lower,split from DocumentTemplate import html_quote from Acquisition import Implicit from Globals import Persistent from DateTime import DateTime class PropertyManager(ExtensionClass.Base, ZDOM.ElementWithAttributes): """ The PropertyManager mixin class provides an object with transparent property management. An object which wants to have properties should inherit from PropertyManager. An object may specify that it has one or more predefined properties, by specifying an _properties structure in its class:: _properties=({'id':'title', 'type': 'string', 'mode': 'w'}, {'id':'color', 'type': 'string', 'mode': 'w'}, ) The _properties structure is a sequence of dictionaries, where each dictionary represents a predefined property. Note that if a predefined property is defined in the _properties structure, you must provide an attribute with that name in your class or instance that contains the default value of the predefined property. Each entry in the _properties structure must have at least an 'id' and a 'type' key. The 'id' key contains the name of the property, and the 'type' key contains a string representing the object's type. The 'type' string must be one of the values: 'float', 'int', 'long', 'string', 'lines', 'text', 'date' or 'tokens'. Each entry in the _properties structure may *optionally* provide a 'mode' key, which specifies the mutability of the property. The 'mode' string, if present, must contain 0 or more characters from the set 'w','d'. A 'w' present in the mode string indicates that the value of the property may be changed by the user. A 'd' indicates that the user can delete the property. An empty mode string indicates that the property and its value may be shown in property listings, but that it is read-only and may not be deleted. Entries in the _properties structure which do not have a 'mode' key are assumed to have the mode 'wd' (writeable and deleteable). To fully support property management, including the system-provided tabs and user interfaces for working with properties, an object which inherits from PropertyManager should include the following entry in its manage_options structure:: {'label':'Properties', 'action':'manage_propertiesForm',} to ensure that a 'Properties' tab is displayed in its management interface. Objects that inherit from PropertyManager should also include the following entry in its __ac_permissions__ structure:: ('Manage properties', ('manage_addProperty', 'manage_editProperties', 'manage_delProperties', 'manage_changeProperties',)), """ manage_propertiesForm=HTMLFile('properties', globals(), property_extensible_schema__=1) title='' _properties=({'id':'title', 'type': 'string', 'mode':'w'},) _reserved_names=() __ac_permissions__=( ('Manage properties', ('manage_addProperty', 'manage_editProperties', 'manage_delProperties', 'manage_changeProperties', 'manage_propertiesForm', )), ('Access contents information', ('hasProperty', 'propertyIds', 'propertyValues','propertyItems',''), ('Anonymous', 'Manager'), ), ) __propsets__=() propertysheets=vps(DefaultPropertySheets) def valid_property_id(self, id): if not id or id[:1]=='_' or (' ' in id) \ or hasattr(self.aq_base, id): return 0 return 1 def getProperty(self, id, d=None): """Get the property 'id', returning the optional second argument or None if no such property is found.""" if self.hasProperty(id): return getattr(self, id) return d def getPropertyType(self, id): """Get the type of property 'id', returning None if no such property exists""" for md in self._properties: if md['id']==id: return md.get('type', 'string') return None def _setPropValue(self, id, value): setattr(self,id,value) def _delPropValue(self, id): delattr(self,id) def _setProperty(self, id, value, type='string'): if not self.valid_property_id(id): raise 'Bad Request', 'Invalid or duplicate property id' self._properties=self._properties+({'id':id,'type':type},) self._setPropValue(id, value) def _updateProperty(self, id, value): # Update the value of an existing property. If value # is a string, an attempt will be made to convert # the value to the type of the existing property. if not self.hasProperty(id): raise 'Bad Request', 'The property %s does not exist' % id if type(value)==type(''): proptype=self.getPropertyType(id) or 'string' if type_converters.has_key(proptype): value=type_converters[proptype](value) self._setPropValue(id, value) def hasProperty(self, id): """Return true if object has a property 'id'""" for p in self._properties: if id==p['id']: return 1 return 0 def _delProperty(self, id): if not self.hasProperty(id): raise ValueError, 'The property %s does not exist' % id delattr(self,id) self._properties=tuple(filter(lambda i, n=id: i['id'] != n, self._properties)) def propertyIds(self): """Return a list of property ids """ return map(lambda i: i['id'], self._properties) def propertyValues(self): """Return a list of actual property objects """ return map(lambda i,s=self: getattr(s,i['id']), self._properties) def propertyItems(self): """Return a list of (id,property) tuples """ return map(lambda i,s=self: (i['id'],getattr(s,i['id'])), self._properties) def propertyMap(self): """Return a tuple of mappings, giving meta-data for properties """ return self._properties def propertyLabel(self, id): """Return a label for the given property id """ return id def propdict(self): dict={} for p in self._properties: dict[p['id']]=p return dict # Web interface def manage_addProperty(self, id, value, type, REQUEST=None): """Add a new property via the web. Sets a new property with the given id, type, and value.""" if type_converters.has_key(type): value=type_converters[type](value) self._setProperty(id, value, type) if REQUEST is not None: return self.manage_propertiesForm(self, REQUEST) def manage_editProperties(self, REQUEST): """Edit object properties via the web.""" for p in self._properties: n=p['id'] self._setPropValue(n, REQUEST.get(n, '')) return MessageDialog( title ='Success!', message='Your changes have been saved', action ='manage_propertiesForm') def manage_changeProperties(self, REQUEST=None, **kw): """Change existing object properties. Change object properties by passing either a mapping object of name:value pairs {'foo':6} or passing name=value parameters """ if REQUEST is None: props={} else: props=REQUEST if kw: for name, value in kw.items(): props[name]=value propdict=self.propdict() for name, value in props.items(): if self.hasProperty(name): if not 'w' in propdict[name].get('mode', 'wd'): raise 'BadRequest', '%s cannot be changed' % name self._setPropValue(name, value) if REQUEST is not None: return MessageDialog( title ='Success!', message='Your changes have been saved', action ='manage_propertiesForm') def manage_delProperties(self, ids=None, REQUEST=None): """Delete one or more properties specified by 'ids'.""" if ids is None: return MessageDialog( title='No property specified', message='No properties were specified!', action ='./manage_propertiesForm',) propdict=self.propdict() nd=self._reserved_names for id in ids: if not hasattr(self.aq_base, id): raise 'BadRequest', ( 'The property %s does not exist' % id) if (not 'd' in propdict[id].get('mode', 'wd')) or (id in nd): return MessageDialog( title ='Cannot delete %s' % id, message='The property %s cannot be deleted.' % id, action ='manage_propertiesForm') self._delProperty(id) if REQUEST is not None: return self.manage_propertiesForm(self, REQUEST) Globals.default__class_init__(PropertyManager) Zope-2.0.1-ZEO-nonbin/lib/python/OFS/PropertySheets.py100644 1007 1403 57603 6722343056 22436 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Property sheets""" __version__='$Revision: 1.43 $'[11:-2] import time, string, App.Management, Globals from ZPublisher.Converters import type_converters from DocumentTemplate.DT_Util import html_quote from Globals import HTMLFile, MessageDialog from string import find,join,lower,split,rfind from Acquisition import Implicit, Explicit from App.Common import rfc1123_date from webdav.common import urlbase from ExtensionClass import Base from Globals import Persistent class View(App.Management.Tabs, Base): """A view of an object, typically used for management purposes """ def manage_workspace(self, URL1, RESPONSE): '''Implement a "management" interface ''' RESPONSE.redirect(URL1+'/manage') def tpURL(self): return self.id def manage_options(self): """Return a manage option data structure for me instance """ try: r=self.REQUEST except: r=None if r is None: pre='../../' else: pre=r['URL'] for i in (1,2,3): l=rfind(pre,'/') if l >= 0: pre=pre[:l] pre=pre+'/' r=[] for d in self.aq_parent.aq_parent.manage_options: path=d['action'] r.append({'label': d['label'], 'action': pre+path, 'path': '../../'+path}) return r def tabs_path_info(self, script, path): l=rfind(path,'/') if l >= 0: path=path[:l] l=rfind(path,'/') if l >= 0: path=path[:l] return View.inheritedAttribute('tabs_path_info')( self, script, path) def meta_type(self): try: return self.aq_parent.aq_parent.meta_type except: return '' class PropertySheet(Persistent, Implicit): """A PropertySheet is a container for a set of related properties and metadata describing those properties. PropertySheets may or may not provide a web interface for managing its properties.""" _properties=() _extensible=1 icon='p_/Properties_icon' def property_extensible_schema__(self): return self._extensible def __init__(self, id, md=None): # Create a new property set, using the given id and namespace # string. The namespace string should be usable as an xml name- # space identifier. self.id=id self._md=md or {} def xml_namespace(self): # Return a namespace string usable as an xml namespace # for this property set. return self._md.get('xmlns', '') def v_self(self): return self def p_self(self): return self.v_self() def valid_property_id(self, id): # Return a true value if the given id is valid to use as # a property id. Note that this method does not consider # factors other than the actual value of the id, such as # whether the given id is already in use. if not id or (id[:1]=='_') or (' ' in id): return 0 return 1 def hasProperty(self, id): # Return a true value if a property exists with the given id. for prop in self.propertyMap(): if id==prop['id']: return 1 return 0 def getProperty(self, id, default=None): # Return the property with the given id, returning the optional # second argument or None if no such property is found. if self.hasProperty(id): return getattr(self.v_self(), id) return default def _setProperty(self, id, value, type='string', meta=None): # Set a new property with the given id, value and optional type. # Note that different property sets may support different typing # systems. if not self.valid_property_id(id): raise 'Bad Request', 'Invalid property id, %s.' % id if not self.property_extensible_schema__(): raise 'Bad Request', ( 'Properties cannot be added to this property sheet') pself=self.p_self() self=self.v_self() if hasattr(aq_base(self),id): if not (id=='title' and not self.__dict__.has_key(id)): raise 'Bad Request', ( 'Invalid property id, %s. It is in use.' % id) if meta is None: meta={} prop={'id':id, 'type':type, 'meta':meta} pself._properties=pself._properties+(prop,) if type in ('selection', 'multiple selection'): if not value: raise 'Bad Request', ( 'The value given for a new selection property ' 'must be a variable name

    ') prop['select_variable']=value if type=='selection': value=None else: value=[] setattr(self, id, value) def _updateProperty(self, id, value, meta=None): # Update the value of an existing property. If value is a string, # an attempt will be made to convert the value to the type of the # existing property. If a mapping containing meta-data is passed, # it will used to _replace_ the properties meta data. if not self.hasProperty(id): raise 'Bad Request', 'The property %s does not exist.' % id propinfo=self.propertyInfo(id) if not 'w' in propinfo.get('mode', 'wd'): raise 'Bad Request', '%s cannot be changed.' % id if type(value)==type(''): proptype=propinfo.get('type', 'string') if type_converters.has_key(proptype): value=type_converters[proptype](value) if meta is not None: props=[] pself=self.p_self() for prop in pself._properties: if prop['id']==id: prop['meta']=meta props.append(prop) pself._properties=tuple(props) setattr(self.v_self(), id, value) def _delProperty(self, id): # Delete the property with the given id. If a property with the # given id does not exist, a ValueError is raised. if not self.hasProperty(id): raise 'Bad Request', 'The property %s does not exist.' % id vself=self.v_self() if hasattr(vself, '_reserved_names'): nd=vself._reserved_names else: nd=() if (not 'd' in self.propertyInfo(id).get('mode', 'wd')) or (id in nd): raise 'Bad Request', '%s cannot be deleted.' % id delattr(vself, id) pself=self.p_self() pself._properties=tuple(filter(lambda i, n=id: i['id'] != n, pself._properties)) def propertyIds(self): # Return a list of property ids. return map(lambda i: i['id'], self.propertyMap()) def propertyValues(self): # Return a list of property values. return map(lambda i, s=self: s.getProperty(i['id']), self.propertyMap()) def propertyItems(self): # Return a list of (id, property) tuples. return map(lambda i, s=self: (i['id'], s.getProperty(i['id'])), self.propertyMap()) def propertyInfo(self, id): # Return a mapping containing property meta-data for p in self.propertyMap(): if p['id']==id: return p raise ValueError, 'The property %s does not exist.' % id def propertyMap(self): # Return a tuple of mappings, giving meta-data for properties. # Some ZClass instances dont seem to have an _properties, so # we have to fake it... return self.p_self()._properties def _propdict(self): dict={} for p in self.propertyMap(): dict[p['id']]=p return dict propstat='\n' \ ' \n' \ '%s\n' \ ' \n' \ ' HTTP/1.1 %s\n%s' \ '\n' propdesc=' \n' \ ' %s\n' \ ' \n' def dav__allprop(self, propstat=propstat, join=string.join): # DAV helper method - return one or more propstat elements # indicating property names and values for all properties. result=[] for item in self.propertyMap(): name, type=item['id'], item.get('type','string') value=self.getProperty(name) if type=='tokens': value=join(value, ' ') elif type=='lines': value=join(value, '\n') # check for xml property attrs=item.get('meta', {}).get('__xml_attrs__', None) if attrs is not None: attrs=map(lambda n: ' %s="%s"' % n, attrs.items()) attrs=join(attrs, '') else: # Quote non-xml items here? attrs='' prop=' %s' % (name, attrs, value, name) result.append(prop) if not result: return '' result=join(result, '\n') return propstat % (self.xml_namespace(), result, '200 OK', '') def dav__propnames(self, propstat=propstat, join=string.join): # DAV helper method - return a propstat element indicating # property names for all properties in this PropertySheet. result=[] for name in self.propertyIds(): result.append(' ' % name) if not result: return '' result=join(result, '\n') return propstat % (self.xml_namespace(), result, '200 OK', '') def dav__propstat(self, name, result, propstat=propstat, propdesc=propdesc, join=string.join): # DAV helper method - return a propstat element indicating # property name and value for the requested property. xml_id=self.xml_namespace() propdict=self._propdict() if not propdict.has_key(name): prop='\n' % (name, xml_id) code='404 Not Found' if not result.has_key(code): result[code]=[prop] else: result[code].append(prop) return else: item=propdict[name] name, type=item['id'], item.get('type','string') value=self.getProperty(name) if type=='tokens': value=join(value, ' ') elif type=='lines': value=join(value, '\n') # allow for xml properties attrs=item.get('meta', {}).get('__xml_attrs__', None) if attrs is not None: attrs=map(lambda n: ' %s="%s"' % n, attrs.items()) attrs=join(attrs, '') else: # quote non-xml items here? attrs='' prop='%s\n' % ( name, attrs, xml_id, value, name) code='200 OK' if not result.has_key(code): result[code]=[prop] else: result[code].append(prop) return del propstat del propdesc # Web interface manage=HTMLFile('properties', globals()) def manage_propertiesForm(self, URL1): " " raise 'Redirect', URL1+'/manage' def manage_addProperty(self, id, value, type, REQUEST=None): """Add a new property via the web. Sets a new property with the given id, type, and value.""" if type_converters.has_key(type): value=type_converters[type](value) self._setProperty(id, value, type) if REQUEST is not None: return self.manage(self, REQUEST) def manage_changeProperties(self, REQUEST=None, **kw): """Change existing object properties by passing either a mapping object of name:value pairs {'foo':6} or passing name=value parameters.""" if REQUEST is None: props={} else: props=REQUEST if kw: for name, value in kw.items(): props[name]=value propdict=self._propdict() for name, value in props.items(): if self.hasProperty(name): self._updateProperty(name, value) if REQUEST is not None: return MessageDialog( title ='Success!', message='Your changes have been saved.', action ='manage') def manage_editProperties(self, REQUEST): """Edit object properties via the web.""" for p in self.propertyMap(): n=p['id'] self._updateProperty(n, REQUEST.get(n, '')) return MessageDialog( title ='Success!', message='Your changes have been saved', action ='manage') def manage_delProperties(self, ids=None, REQUEST=None): """Delete one or more properties specified by 'ids'.""" if ids is None: return MessageDialog( title='No property specified', message='No properties were specified!', action ='./manage',) for id in ids: self._delProperty(id) if REQUEST is not None: return self.manage(self, REQUEST) class Virtual: def __init__(self): pass def v_self(self): return self.aq_parent.aq_parent class DefaultProperties(Virtual, PropertySheet, View): """The default property set mimics the behavior of old-style Zope properties -- it stores its property values in the instance of its owner.""" id='default' _md={'xmlns': 'http://www.zope.org/propsets/default'} class DAVProperties(Virtual, PropertySheet, View): """WebDAV properties""" id='webdav' _md={'xmlns': 'DAV:'} pm=({'id':'creationdate', 'mode':'r'}, {'id':'displayname', 'mode':'r'}, {'id':'resourcetype', 'mode':'r'}, {'id':'getlastmodified', 'mode':'r'}, {'id':'getcontenttype', 'mode':'r'}, {'id':'getcontentlength', 'mode':'r'}, {'id':'source', 'mode':'r'}, ) def getProperty(self, id, default=None): method='dav__%s' % id if not hasattr(self, method): return default return getattr(self, method)() def _setProperty(self, id, value, type='string', meta=None): raise ValueError, '%s cannot be set.' % id def _updateProperty(self, id, value): raise ValueError, '%s cannot be updated.' % id def _delProperty(self, id): raise ValueError, '%s cannot be deleted.' % id def propertyMap(self): return self.pm def dav__creationdate(self): return '' def dav__displayname(self): return absattr(self.v_self().id) def dav__resourcetype(self): vself=self.v_self() if hasattr(aq_base(vself), 'isAnObjectManager') and \ vself.isAnObjectManager: return '' return '' def dav__getlastmodified(self): vself=self.v_self() if hasattr(vself, '_p_mtime'): return rfc1123_date(vself._p_mtime) return '' def dav__getcontenttype(self): vself=self.v_self() if hasattr(vself, 'content_type'): return vself.content_type return '' def dav__getcontentlength(self): vself=self.v_self() if hasattr(vself, 'get_size'): return vself.get_size() return '' def dav__source(self): vself=self.v_self() if hasattr(vself, 'document_src'): url=urlbase(vself.absolute_url()) return '\n \n' \ ' %s\n' \ ' %s/document_src\n' \ ' \n ' % (url, url) return '' def dav__supportedlock(self): return '\n \n' \ ' \n' \ ' \n' \ ' \n ' class PropertySheets(Implicit, App.Management.Tabs): """A tricky container to keep property sets from polluting an object's direct attribute namespace.""" id='propertysheets' webdav =DAVProperties() def _get_defaults(self): return (self.webdav,) def __propsets__(self): propsets=self.aq_parent.__propsets__ __traceback_info__= propsets, type(propsets) return self._get_defaults() + propsets def __bobo_traverse__(self, REQUEST, name=None): for propset in self.__propsets__(): if propset.id==name: return propset.__of__(self) return getattr(self, name) def __getitem__(self, n): return self.__propsets__()[n].__of__(self) def values(self): propsets=self.__propsets__() return map(lambda n, s=self: n.__of__(s), propsets) def items(self): propsets=self.__propsets__() r=[] for n in propsets: if hasattr(n,'id'): id=n.id else: id='' r.append((id, n.__of__(self))) return r def get(self, name, default=None): for propset in self.__propsets__(): if propset.id==name or propset.xml_namespace()==name: return propset.__of__(self) return default def manage_addPropertySheet(self, id, ns): """ """ md={'xmlns':ns} ps=PropertySheet(id, md) self.addPropertySheet(ps) return 'OK' def addPropertySheet(self, propset): propsets=self.aq_parent.__propsets__ propsets=propsets+(propset,) self.aq_parent.__propsets__=propsets def delPropertySheet(self, name): result=[] for propset in self.aq_parent.__propsets__: if propset.id != name and propset.xml_namespace() != name: result.append(propset) self.parent.__propsets__=tuple(result) # Why? #def __del__(self): # self.parent=None def __len__(self): return len(self.__propsets__()) # Management interface: manage=Globals.HTMLFile('propertysheets', globals()) def manage_options(self): """Return a manage option data structure for me instance """ try: r=self.REQUEST except: r=None if r is None: pre='../' else: pre=r['URL'] for i in (1,2): l=rfind(pre,'/') if l >= 0: pre=pre[:l] pre=pre+'/' r=[] for d in self.aq_parent.manage_options: r.append({'label': d['label'], 'action': pre+d['action']}) return r def tabs_path_info(self, script, path): l=rfind(path,'/') if l >= 0: path=path[:l] return PropertySheets.inheritedAttribute('tabs_path_info')( self, script, path) class DefaultPropertySheets(PropertySheets): """A PropertySheets container that contains a default property sheet for compatibility with the arbitrary property mgmt design of Zope PropertyManagers.""" default=DefaultProperties() webdav =DAVProperties() def _get_defaults(self): return (self.default, self.webdav) class FixedSchema(PropertySheet): def __init__(self, id, base, md=None): FixedSchema.inheritedAttribute('__init__')(self, id, md) self._base=base def propertyMap(self): # Return a tuple of mappings, giving meta-data for properties. r=[] for d in self._base.propertyMap(): mode=d.get('mode', 'wd') if 'd' in mode: dd={} dd.update(d) d=dd d['mode']=filter(lambda c: c != 'd', mode) r.append(d) return tuple(r) def property_extensible_schema__(self): return 0 return self._base._extensible class vps(Base): # The vps object implements a "computed attribute" - it ensures # that a PropertySheets instance is returned when the propertysheets # attribute of a PropertyManager is accessed. def __init__(self, c=PropertySheets): self.c=c def __of__(self, parent): return self.c().__of__(parent) def absattr(attr): if callable(attr): return attr() return attr def aq_base(ob): if hasattr(ob, 'aq_base'): return ob.aq_base return ob Zope-2.0.1-ZEO-nonbin/lib/python/OFS/SimpleItem.py100644 1007 1403 33767 6746072403 21514 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''This module implements a simple item mix-in for objects that have a very simple (e.g. one-screen) management interface, like documents, Aqueduct database adapters, etc. This module can also be used as a simple template for implementing new item types. $Id: SimpleItem.py,v 1.62 1999/07/23 13:58:27 cathi Exp $''' __version__='$Revision: 1.62 $'[11:-2] import regex, sys, Globals, App.Management, Acquisition from webdav.Resource import Resource from ExtensionClass import Base from DateTime import DateTime from CopySupport import CopySource from string import join, lower, find, split from types import InstanceType, StringType from ComputedAttribute import ComputedAttribute from urllib import quote import App.Common import marshal import ZDOM HTML=Globals.HTML class Item(Base, Resource, CopySource, App.Management.Tabs, ZDOM.Element): """A simple Principia object. Not Folderish.""" isPrincipiaFolderish=0 isTopLevelPrincipiaApplicationObject=0 def manage_afterAdd(self, item, container): pass def manage_beforeDelete(self, item, container): pass def manage_afterClone(self, item): pass # The name of this object and the name used to traverse to thie # object in a URL: id='' # Alias id to __name__, which will make tracebacks a good bit nicer: __name__=ComputedAttribute(lambda self: self.id) # Name, relative to SOFTWARE_URL of icon used to display item # in folder listings. icon='' # Meta type used for selecting all objects of a given type. meta_type='simple item' # Default title. title='' # Default propertysheet info: __propsets__=() manage_options=() def title_or_id(self, st=type('')): """ Utility that returns the title if it is not blank and the id otherwise. """ title=self.title if type(title) is not st: title=title() if title: return title id=self.id if type(id) is not st: id=id() return id def title_and_id(self, st=type('')): """ Utility that returns the title if it is not blank and the id otherwise. If the title is not blank, then the id is included in parens. """ title=self.title if type(title) is not st: title=title() id=self.id if type(id) is not st: id=id() return title and ("%s (%s)" % (title,id)) or id def this(self): "Handy way to talk to ourselves in document templates." return self def tpURL(self): "My URL as used by tree tag" url=self.id if hasattr(url,'im_func'): url=url() return url def tpValues(self): "My sub-objects as used by the tree tag" return () _manage_editedDialog=Globals.HTMLFile('editedDialog', globals()) def manage_editedDialog(self, REQUEST, **args): return apply(self._manage_editedDialog,(self, REQUEST), args) def raise_standardErrorMessage( self, client=None, REQUEST={}, error_type=None, error_value=None, tb=None, error_tb=None, error_message='', tagSearch=regex.compile('[a-zA-Z]>').search): try: if error_type is None: error_type =sys.exc_info()[0] if error_value is None: error_value=sys.exc_info()[1] # turn error_type into a string if hasattr(error_type, '__name__'): error_type=error_type.__name__ # allow for a few different traceback options if tb is None and error_tb is None: tb=sys.exc_info()[2] if type(tb) is not type('') and (error_tb is None): error_tb=pretty_tb(error_type, error_value, tb) elif type(tb) is type('') and not error_tb: error_tb=tb if hasattr(self, '_v_eek'): raise error_type, error_value, tb self._v_eek=1 if lower(str(error_type)) in ('redirect',): raise error_type, error_value, tb if not error_message: if type(error_value) is InstanceType: s=str(error_value) if tagSearch(s) >= 0: error_message=error_value elif (type(error_value) is StringType and tagSearch(error_value) >= 0): error_message=error_value if client is None: client=self if not REQUEST: REQUEST=self.aq_acquire('REQUEST') try: if hasattr(client, 'standard_error_message'): s=getattr(client, 'standard_error_message') else: client = client.aq_parent s=getattr(client, 'standard_error_message') v=HTML.__call__(s, client, REQUEST, error_type=error_type, error_value=error_value, error_tb=error_tb,error_traceback=error_tb, error_message=error_message) except: v = error_value or "Sorry, an error occurred" raise error_type, v, tb finally: if hasattr(self, '_v_eek'): del self._v_eek tb=None def manage(self, URL1): " " raise 'Redirect', "%s/manage_main" % URL1 # This keeps simple items from acquiring their parents # objectValues, etc., when used in simple tree tags. def objectValues(self, spec=None): return () objectIds=objectItems=objectValues # FTP support methods def manage_FTPstat(self,REQUEST): "psuedo stat, used by FTP for directory listings" from AccessControl.User import nobody mode=0100000 # check read permissions if hasattr(self.aq_base,'manage_FTPget') and \ hasattr(self.manage_FTPget, '__roles__'): if REQUEST['AUTHENTICATED_USER'].allowed(self.manage_FTPget, self.manage_FTPget.__roles__): mode=mode | 0440 if nobody.allowed(self.manage_FTPget, self.manage_FTPget.__roles__): mode=mode | 0004 # check write permissions if hasattr(self.aq_base,'PUT') and hasattr(self.PUT, '__roles__'): if REQUEST['AUTHENTICATED_USER'].allowed(self.PUT, self.PUT.__roles__): mode=mode | 0220 if nobody.allowed(self.PUT, self.PUT.__roles__): mode=mode | 0002 # get size if hasattr(self,'manage_FTPget'): size=len(self.manage_FTPget()) else: size=0 # get modification time mtime=self.bobobase_modification_time().timeTime() # get owner and group owner=group='Zope' for r in self.get_local_roles(): user,roles=r if 'Owner' in roles: owner=user break return marshal.dumps((mode,0,0,1,owner,group,size,mtime,mtime,mtime)) def manage_FTPlist(self,REQUEST): """Directory listing for FTP. In the case of non-Foldoid objects, the listing should contain one object, the object itself.""" # check to see if we are being acquiring or not ob=self while 1: if App.Common.is_acquired(ob): raise ValueError('FTP List not supported on acquired objects') if not hasattr(ob,'aq_parent'): break ob=ob.aq_parent stat=marshal.loads(self.manage_FTPstat(REQUEST)) if callable(self.id): id=self.id() else: id=self.id return marshal.dumps((id,stat)) def absolute_url(self, relative=0): """Return an absolute url to the object. Note that the url will reflect the acquisition path of the object if the object has been acquired.""" obj=self url=[] while hasattr(obj, 'aq_parent') and hasattr(obj.aq_parent, 'id'): id=callable(obj.id) and obj.id() or str(obj.id) url.append(quote(id)) obj=obj.aq_parent if not relative: url.append(self.aq_acquire('REQUEST').script) url.reverse() return join(url, '/') def __len__(self): return 1 Globals.default__class_init__(Item) class Item_w__name__(Item): """Mixin class to support common name/id functions""" def title_or_id(self): """Utility that returns the title if it is not blank and the id otherwise.""" return self.title or self.__name__ def title_and_id(self): """Utility that returns the title if it is not blank and the id otherwise. If the title is not blank, then the id is included in parens.""" t=self.title return t and ("%s (%s)" % (t,self.__name__)) or self.__name__ def _setId(self, id): self.__name__=id def format_exception(etype,value,tb,limit=None): import traceback result=['Traceback (innermost last):'] if limit is None: if hasattr(sys, 'tracebacklimit'): limit = sys.tracebacklimit n = 0 while tb is not None and (limit is None or n < limit): f = tb.tb_frame lineno = tb.tb_lineno co = f.f_code filename = co.co_filename name = co.co_name locals=f.f_locals result.append(' File %s, line %d, in %s' % (filename,lineno,name)) try: result.append(' (Object: %s)' % locals[co.co_varnames[0]].__name__) except: pass try: result.append(' (Info: %s)' % str(locals['__traceback_info__'])) except: pass tb = tb.tb_next n = n+1 result.append(join(traceback.format_exception_only(etype, value),' ')) # sys.exc_type,sys.exc_value,sys.exc_traceback=etype,value,tb return result def pretty_tb(t,v,tb): tb=format_exception(t,v,tb,200) tb=join(tb,'\n') return tb import AccessControl.Role class SimpleItem(Item, Globals.Persistent, Acquisition.Implicit, AccessControl.Role.RoleManager, ): # Blue-plate special, Zope Masala """Mix-in class combining the most common set of basic mix-ins """ manage_options=( {'label':'Security', 'action':'manage_access'}, ) __ac_permissions__=(('View', ()),) Zope-2.0.1-ZEO-nonbin/lib/python/OFS/Uninstalled.py100644 1007 1403 12551 6751655501 21714 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ Objects for packages that have been uninstalled. """ import string, SimpleItem, Globals, Acquisition import Persistence broken_klasses={} class BrokenClass(Acquisition.Explicit, SimpleItem.Item, Persistence.Persistent): _p_changed=0 meta_type='Broken Because Product is Gone' icon='p_/broken' product_name='unknown' id='broken' def __getstate__(self): raise SystemError, ( """This object was originally created by a product that is no longer installed. It cannot be updated. """) def __getattr__(self, name): if name[:3]=='_p_': return BrokenClass.inheritedAttribute('__getattr__')(self, name) raise AttributeError, name manage=manage_main=Globals.HTMLFile('brokenEdit',globals()) manage_workspace=manage def Broken(self, oid, klass): if broken_klasses.has_key(klass): klass=broken_klasses[klass] else: module, klass = klass d={'BrokenClass': BrokenClass} exec ("class %s(BrokenClass): ' '; __module__=%s" % (klass, `module`)) in d broken_klasses[klass]=d[klass] klass=d[klass] module=string.split(module,'.') if len(module) > 2 and module[0]=='Products': klass.product_name= module[1] klass.title=( 'This object from the %s product ' 'is broken!' % klass.product_name) klass.info=( 'This object\'s class was %s in module %s.' % (klass.__name__, klass.__module__)) if oid is None: return klass i=klass() i._p_oid=oid i._p_jar=self return i Zope-2.0.1-ZEO-nonbin/lib/python/OFS/ZDOM.py100644 1007 1403 46617 6763236217 20217 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ DOM implementation in ZOPE : Read-Only methods All standard Zope objects support DOM to a limited extent. """ import string import Acquisition # Node type codes # --------------- ELEMENT_NODE = 1 ATTRIBUTE_NODE = 2 TEXT_NODE = 3 CDATA_SECTION_NODE = 4 ENTITY_REFERENCE_NODE = 5 ENTITY_NODE = 6 PROCESSING_INSTRUCTION_NODE = 7 COMMENT_NODE = 8 DOCUMENT_NODE = 9 DOCUMENT_TYPE_NODE = 10 DOCUMENT_FRAGMENT_NODE = 11 NOTATION_NODE = 12 # Exception codes # --------------- INDEX_SIZE_ERR = 1 DOMSTRING_SIZE_ERR = 2 HIERARCHY_REQUEST_ERR = 3 WRONG_DOCUMENT_ERR = 4 INVALID_CHARACTER_ERR = 5 NO_DATA_ALLOWED_ERR = 6 NO_MODIFICATION_ALLOWED_ERR = 7 NOT_FOUND_ERR = 8 NOT_SUPPORTED_ERR = 9 INUSE_ATTRIBUTE_ERR = 10 # Exceptions # ---------- class DOMException(Exception): pass class IndexSizeException(DOMException): code = INDEX_SIZE_ERR class DOMStringSizeException(DOMException): code = DOMSTRING_SIZE_ERR class HierarchyRequestException(DOMException): code = HIERARCHY_REQUEST_ERR class WrongDocumentException(DOMException): code = WRONG_DOCUMENT_ERR class InvalidCharacterException(DOMException): code = INVALID_CHARACTER_ERR class NoDataAllowedException(DOMException): code = NO_DATA_ALLOWED_ERR class NoModificationAllowedException(DOMException): code = NO_MODIFICATION_ALLOWED_ERR class NotFoundException(DOMException): code = NOT_FOUND_ERR class NotSupportedException(DOMException): code = NOT_SUPPORTED_ERR class InUseAttributeException(DOMException): code = INUSE_ATTRIBUTE_ERR # Node classes # ------------ class Node: """ Node Interface """ __ac_permissions__=( ('Access contents information', ('getNodeName', 'getNodeValue', 'getParentNode', 'getChildNodes', 'getFirstChild', 'getLastChild', 'getPreviousSibling', 'getNextSibling', 'getOwnerDocument', 'getAttributes', 'hasChildNodes'), ), ) # DOM attributes # -------------- def getNodeName(self): """The name of this node, depending on its type""" return None def getNodeValue(self): """The value of this node, depending on its type""" return None def getParentNode(self): """The parent of this node. All nodes except Document DocumentFragment and Attr may have a parent""" return None def getChildNodes(self): """Returns a NodeList that contains all children of this node. If there are no children, this is a empty NodeList""" return NodeList() def getFirstChild(self): """The first child of this node. If there is no such node this returns None.""" return None def getLastChild(self): """The last child of this node. If there is no such node this returns None.""" return None def getPreviousSibling(self): """The node immediately preceding this node. If there is no such node, this returns None.""" return None def getNextSibling(self): """The node immediately preceding this node. If there is no such node, this returns None.""" return None def getAttributes(self): """Returns a NamedNodeMap containing the attributes of this node (if it is an element) or None otherwise.""" return None def getOwnerDocument(self): """The Document object associated with this node. When this is a document this is None""" node = self if hasattr(node, 'aq_parent'): node = self.aq_parent return node.getOwnerDocument() return node # DOM Methods # ----------- def hasChildNodes(self): """Returns true if the node has any children, false if it doesn't. """ return len(self.objectIds()) class Document(Acquisition.Explicit, Node): """ Document Interface """ __ac_permissions__=( ('Access contents information', ('getImplementation', 'getDoctype', 'getDocumentElement'), ), ) # Document Methods # ---------------- def getImplementation(self): """ The DOMImplementation object that handles this document. """ return DOMImplementation() def getDoctype(self): """ The Document Type Declaration associated with this document. For HTML documents as well as XML documents without a document type declaration this returns null. """ return None def getDocumentElement(self): """ This is a convenience attribute that allows direct access to the child node that is the root element of the document. """ return self.aq_parent # Node Methods # ------------ def getNodeName(self): """The name of this node, depending on its type""" return '#document' def getNodeType(self): """A code representing the type of the node.""" return DOCUMENT_NODE def getOwnerDocument(self): """The Document object associated with this node. When this is a document this is None""" return self def getChildNodes(self): """Returns a NodeList that contains all children of this node. If there are no children, this is a empty NodeList""" return NodeList([self.aq_parent]) def getFirstChild(self): """The first child of this node. If there is no such node this returns None.""" return self.aq_parent def getLastChild(self): """The last child of this node. If there is no such node this returns None.""" return self.aq_parent def hasChildNodes(self): """Returns true if the node has any children, false if it doesn't. """ return 1 class DOMImplementation: """ DOMImplementation Interface """ __ac_permissions__=( ('Access contents information', ('hasFeature'), ), ) def hasFeature(self, feature, version = None): """ hasFeature - Test if the DOM implementation implements a specific feature. Parameters: feature The package name of the feature to test. In Level 1, the legal values are "HTML" and "XML" (case-insensitive). version This is the version number of the package name to test. In Level 1, this is the string "1.0". If the version is not specified, supporting any version of the feature will cause the method to return true. Return Value true if the feature is implemented in the specified version, false otherwise. """ feature=string.lower(feature) if feature == 'html': return 0 if feature == 'xml': if version is None: return 1 if version == '1.0': return 1 return 0 class Element(Node): """ Element interface """ __ac_permissions__=( ('Access contents information', ('getTagName', 'getAttribute', 'getAttributeNode', 'getElementsByTagName'), ), ) # Element Attributes # ------------------ def getTagName(self): """The name of the element""" return self.__class__.__name__ # Node Attributes # --------------- def getNodeName(self): """The name of this node, depending on its type""" return self.getTagName() def getNodeType(self): """A code representing the type of the node.""" return ELEMENT_NODE def getParentNode(self): """The parent of this node. All nodes except Document DocumentFragment and Attr may have a parent""" return getattr(self, 'aq_parent', None) def getChildNodes(self): """Returns a NodeList that contains all children of this node. If there are no children, this is a empty NodeList""" return NodeList(self.objectValues()) def getFirstChild(self): """The first child of this node. If there is no such node this returns None""" children = self.getChildNodes() if children: return children._data[0] return None def getLastChild(self): """The last child of this node. If there is no such node this returns None.""" children = self.getChildNodes() if children: return children._data[-1] return None def getPreviousSibling(self): """The node immediately preceding this node. If there is no such node, this returns None.""" if hasattr(self, 'aq_parent'): parent = self.aq_parent ids=list(parent.objectIds()) id=self.id if type(id) is not type(''): id=id() try: index=ids.index(id) except: return None if index < 1: return None return parent.objectValues()[index-1] return None def getNextSibling(self): """The node immediately preceding this node. If there is no such node, this returns None.""" if hasattr(self, 'aq_parent'): parent = self.aq_parent ids=list(parent.objectIds()) id=self.id if type(id) is not type(''): id=id() try: index=ids.index(id) except: return None if index >= len(ids)-1: return None return parent.objectValues()[index+1] return None # Element Methods # --------------- def getAttribute(self, name): """Retrieves an attribute value by name.""" return None def getAttributeNode(self, name): """ Retrieves an Attr node by name or None if there is no such attribute. """ return None def getElementsByTagName(self, tagname): """ Returns a NodeList of all the Elements with a given tag name in the order in which they would be encountered in a preorder traversal of the Document tree. Parameter: tagname The name of the tag to match (* = all tags). Return Value: A new NodeList object containing all the matched Elements. """ nodeList = [] for child in self.objectValues(): if (child.getNodeType()==ELEMENT_NODE and \ child.getTagName()==tagname or tagname== '*'): nodeList.append(child) if hasattr(child, 'getElementsByTagName'): n1 = child.getElementsByTagName(tagname) nodeList = nodeList + n1._data return NodeList(nodeList) class ElementWithAttributes(Element): """ Elements that allow DOM access to Zope properties of type 'string'. Note: This sub-class should only be used by PropertyManagers """ def getAttributes(self): """Returns a NamedNodeMap containing the attributes of this node (if it is an element) or None otherwise.""" attribs={} for p in self._properties: if p['type'] == 'string': name=p['id'] attrib=Attr(name, self.getProperty(name,'')).__of__(self) attribs[name]=attrib return NamedNodeMap(attribs) def getAttribute(self, name): """Retrieves an attribute value by name.""" if self.getPropertyType(name) == 'string': return self.getProperty(name,'') def getAttributeNode(self, name): """Retrieves an Attr node by name or None if there is no such attribute. """ if self.getPropertyType(name) == 'string': return Attr(name, self.getProperty(name,'')).__of__(self) return None class ElementWithTitle(Element): """ Elements that allow DOM access to Zope 'title' property. Note: Don't use this sub-class for PropertyManagers """ def getAttributes(self): """Returns a NamedNodeMap containing the attributes of this node (if it is an element) or None otherwise.""" title = self.getAttributeNode('title') if title is not None: return NamedNodeMap({'title':title}) return NamedNodeMap() def getAttribute(self, name): """Retrieves an attribute value by name.""" if name=='title' and hasattr(self.aq_base, 'title'): return self.title return '' def getAttributeNode(self, name): """Retrieves an Attr node by name or None if there is no such attribute. """ value=self.getAttribute(name) if value: return Attr(name, value).__of__(self) return None class Root(ElementWithAttributes): """ The top-level Zope object. """ def getOwnerDocument(self): """ """ return Document().__of__(self) class NodeList: """NodeList interface - Provides the abstraction of an ordered collection of nodes. Python extensions: can use sequence-style 'len', 'getitem', and 'for..in' constructs. """ def __init__(self,list=None): self._data = list or [] def __getitem__(self, index): return self._data[index] def item(self, index): """Returns the index-th item in the collection""" try: return self._data[index] except IndexError: return None def getLength(self): """The length of the NodeList""" return len(self._data) __len__=getLength class NamedNodeMap: """ NamedNodeMap interface - Is used to represent collections of nodes that can be accessed by name. NamedNodeMaps are not maintained in any particular order. Python extensions: can use sequence-style 'len', 'getitem', and 'for..in' constructs, and mapping-style 'getitem'. """ def __init__(self, data=None): if data is None : data = {} self._data = data def item(self, index): """Returns the index-th item in the map""" try: return self._data.values()[index] except IndexError: return None def __getitem__(self, key): if type(key)==type(1): return self._data.values()[key] else: return self._data[key] def getLength(self): """The length of the NodeList""" return len(self._data) __len__ = getLength def getNamedItem(self, name): """Retrieves a node specified by name. Parameters: name Name of a node to retrieve. Return Value A Node (of any type) with the specified name, or None if the specified name did not identify any node in the map. """ if self._data.has_key(name): return self._data[name] return None class Attr(Acquisition.Implicit, Node): """ Attr interface - The Attr interface represents an attriubte in an Element object. Attr objects inherit the Node Interface """ def __init__(self, name, value): self.name = name self.value = value self.specified = 1 def getNodeName(self): """The name of this node, depending on its type""" return self.name def getName(self): """Returns the name of this attribute.""" return self.name def getNodeValue(self): """The value of this node, depending on its type""" return self.value def getNodeType(self): """A code representing the type of the node.""" return ATTRIBUTE_NODE def getSpecified(self): """If this attribute was explicitly given a value in the original document, this is true; otherwise, it is false.""" return self.specified Zope-2.0.1-ZEO-nonbin/lib/python/OFS/__init__.py100644 1007 1403 7332 6671334624 21153 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## Zope-2.0.1-ZEO-nonbin/lib/python/OFS/brokenEdit.dtml100644 1007 1403 1000 6523704222 21763 0ustar petrillipetrilli Edit This object is broken because the product that created it is no longer installed or is installed incorrectly. Please contact your product vendor for assistance.

    Note that the data associated with this product has not been lost, and will be accessible again if the product is reinstalled. --> Zope-2.0.1-ZEO-nonbin/lib/python/OFS/content_types.py100644 1007 1403 14736 6752321435 22334 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """A utility module for content-type handling.""" __version__='$Revision: 1.7 $'[11:-2] src=""" htm, html: text/html gif: image/gif jpg, jpe, jpeg: image/jpeg pdf: application/pdf aiff, aif, aifc: audio/aiff au, snd: audio/basic xbm: application/x-bitmap ra, ram: audio/x-pn-realaudio txt, py, c, h, pl, bat, sh, ksh: text/plain avi: video/avi wav: audio/wav tar: application/x-tar zip: application/x-zip """ from string import split, strip, lower import ts_regex, mimetypes content_type={} for l in filter(lambda s: s and s[:1] != '#', map(strip, split(src,'\n'))): [e, t]=split(l, ':') t=strip(t) for e in map(strip, split(e, ',')): content_type[e]=t find_binary=ts_regex.compile('[\0-\7]').search html_re=ts_regex.compile('', ts_regex.casefold) def text_type(s): return "text/" + (html_re.search(s) >= 0 and 'html' or 'plain') # This gives us a hook to add content types that # aren't currently listed in the mimetypes module. _addtypes=( ('.cdf', 'application-x-cdf'), ('.doc', 'application/msword'), ('.dot', 'application/msword'), ('.wiz', 'application/msword'), ('.xlb', 'application/vnd.ms-excel'), ('.xls', 'application/vnd.ms-excel'), ('.ppa', 'application/vnd.ms-powerpoint'), ('.ppt', 'application/vnd.ms-powerpoint'), ('.pps', 'application/vnd.ms-powerpoint'), ('.pot', 'application/vnd.ms-powerpoint'), ('.pwz', 'application/vnd.ms-powerpoint'), ('.eml', 'message/rfc822'), ('.nws', 'message/rfc822'), ('.mht', 'message/rfc822'), ('.mhtml', 'message/rfc822'), ('.css', 'text/css'), ('.p7c', 'application/pkcs7-mime'), ('.p12', 'application/x-pkcs12'), ('.pfx', 'application/x-pkcs12'), ('.js', 'application/x-javascript'), ('.pct', 'image/pict'), ('.pic', 'image/pict'), ('.pict', 'image/pict'), ('.m1v', 'video/mpeg'), ('.mpa', 'video/mpeg'), ('.vcf', 'text/x-vcard'), ('.xml', 'text/xml'), ('.xsl', 'text/xsl'), ('.xul', 'text/xul'), ) for name, val in _addtypes: mimetypes.types_map[name]=val def guess_content_type(name='', body='', default=None): # Attempt to determine the content type (and possibly # content-encoding) based on an an object's name and # entity body. type, enc=mimetypes.guess_type(name) if type is None: if body: if find_binary(body) >= 0: type='application/octet-stream' else: type=(text_type(body) or default or 'text/x-unknown-content-type') else: type=default or 'text/x-unknown-content-type' return lower(type), enc and lower(enc) or None if __name__=='__main__': items=content_type.items() items.sort() for item in items: print "%s:\t%s" % item Zope-2.0.1-ZEO-nonbin/lib/python/OFS/documentAdd.dtml100644 1007 1403 2606 6707216106 22144 0ustar petrillipetrilli Add DTML Document

    Add DTML Document

    A DTML Document is used to hold text content. It can contain HTML, XML, plain text, structured-text, etcetera. A DTML document can contain DTML scripting tags. A DTML Document differs from a DTML Method in that it has properties and does not call methods on its container object.

    You may create a new DTML Document using the form below. You may also choose to upload an existing html file from your local computer by clicking the Browse button.

    Id
    Title
    File
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/documentEdit.dtml100644 1007 1403 3272 6761252733 22347 0ustar petrillipetrilli Edit
    Id
    Title
    Size bytes
    Last modified
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/documentProxy.dtml100644 1007 1403 2774 6707216106 22603 0ustar petrillipetrilli Edit

    Proxy Roles allow a DTML Document or Method to access restricted Zope resources. Normally a DTML Method or Document can only access resources for which the user is authorized. By adding Proxy Roles, you allow the DTML Document or Method to act with additional roles, beyond what the user may have.

    Use the form below to select which roles this DTML document or Method will have.

    Id
    Title
    Proxy Roles
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/documentUpload.dtml100644 1007 1403 1220 6662300475 22672 0ustar petrillipetrilli Upload

    You may upload the source for using the form below. Choose an existing html file from your local computer by clicking the Browse button.

    File

    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/editedDialog.dtml100644 1007 1403 1107 6664340633 22273 0ustar petrillipetrilliChanged: <!--#var title_or_id-->

    !

    has been successfully edited.
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/fileEdit.dtml100644 1007 1403 2637 6761246442 21454 0ustar petrillipetrilli Edit
    Id
    Title
    Content Type
    Precondition
    Size bytes
    Last modified

    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/findAdv.dtml100644 1007 1403 4665 6761246442 21305 0ustar petrillipetrilli Advanced Find

    Find objects of type:
    with ids:
    containing:
    expr:
    modified:
    where the roles:
    have permission:
    Search only in this folder
    Search all subfolders
    Simple...
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/findForm.dtml100644 1007 1403 3452 6761246442 21467 0ustar petrillipetrilli Find

    Find allows you to locate Zope objects based on different criteria. For more find choices choose the Advanced find option.

    Find objects of type:
    with ids:
    containing:
    modified:
    Search only in this folder
    Search all subfolders
    Advanced...
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/findFrame.dtml100644 1007 1403 1023 6770035435 21604 0ustar petrillipetrilli Find MARGINWIDTH="2" MARGINHEIGHT="2" SCROLLING="auto"> Management interfaces require the use of a <B>frames-capable</B> web browser. Zope-2.0.1-ZEO-nonbin/lib/python/OFS/findOpt.dtml100644 1007 1403 3345 6562144705 21325 0ustar petrillipetrilli Find Options



    Your preferences have been saved.

    Find Options

    CHECKED> -->
    Open results in new window
    CHECKED> Always use advanced find
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/findResult.dtml100644 1007 1403 3304 6664340702 22032 0ustar petrillipetrilli Find Results

    Found items.
    Click to open this item ()
    No items were found matching this query.
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/folderAdd.dtml100644 1007 1403 3271 6765273102 21603 0ustar petrillipetrilli Add Folder

    Add Folder

    A Folder contains other objects. Use Folders to organize your web objects in to logical groups.

    The form below allows you to create a Folder. The Create public interface option creates an index_html DTML Method inside the Folder to give the Folder a default HTML representation. The Create user folder option creates a User Folder inside the Folder to hold authorization information for the Folder.

    Id
    Title


    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/imageAdd.dtml100644 1007 1403 2150 6707216106 21402 0ustar petrillipetrilli Add <!--#var Kind-->

    Add

    You can create a new in the system using the form below. Select an from your local computer by clicking the Browse button. The you select will be uploaded to the application.

    Id
    Title

    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/imageEdit.dtml100644 1007 1403 2253 6761246442 21611 0ustar petrillipetrilli Edit
    Id
    Title
    Content Type
    Size bytes
    Last modified

    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/imageUpload.dtml100644 1007 1403 1442 6662301224 22135 0ustar petrillipetrilli Upload

    You can update data in the using the form below. Select a data file from your local computer by clicking the Browse button. The file you select will be uploaded to the application.

    Id
    Data

    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/imageView.dtml100644 1007 1403 510 6761271336 21610 0ustar petrillipetrilli View

    width="" height="" ALT="">

    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/importExport.dtml100644 1007 1403 3467 6761246442 22445 0ustar petrillipetrilli Import Object

    You can export Zope objects to a file in order to transfer them to a different Zope installation. You can either choose to download the export file to your local machine, or save it in the "var" directory of your Zope installation on the server.

    Export object id ">
    Export to Download to local machine
    Save to file on server
    XML format?

    You may import Zope objects which have been previously exported to a file, by placing the file in the "import" directory of your Zope installation on the server. You should create the "import" directory in the root of your Zope installation if it does not yet exist.

    Import file name
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/main.dtml100644 1007 1403 7274 6761246442 20655 0ustar petrillipetrilli Contents

    [<!--#var meta_type-->] () This item has been modified in this version This item has been modified in another version ()
    There are currently no items in

    To add a new item, select an item type .
    To add a new item click "Add". ">
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/methodAdd.dtml100644 1007 1403 2736 6707216106 21612 0ustar petrillipetrilli Add DTML Method

    Add DTML Method

    A DTML Method is used to hold scripting tags and text content. It can contain HTML, XML, plain text, structured-text, etcetera. A DTML Method can contain DTML scripting tags which operate in the context of the DTML Method's containing object. A DTML Method differs from a DTML Document in that it does not have properties and calls methods on its container object.

    You may create a new DTML Method object using the form below. You may also choose to upload an existing html file from your local computer by clicking the Browse button.

    Id
    Title
    File
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/misc_.py100644 1007 1403 13043 6745344167 20527 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## from App.ImageFile import ImageFile class misc_: "Miscellaneous product information" __roles__=None class p_: "Shared system information" __roles__=None broken=ImageFile('www/broken.gif', globals()) User_icon =ImageFile('AccessControl/www/User_icon.gif') locked=ImageFile('www/modified.gif', globals()) lockedo=ImageFile('www/locked.gif', globals()) pl=ImageFile('TreeDisplay/www/Plus_icon.gif') mi=ImageFile('TreeDisplay/www/Minus_icon.gif') rtab=ImageFile('App/www/rtab.gif') ltab=ImageFile('App/www/ltab.gif') sp =ImageFile('App/www/sp.gif') ControlPanel_icon=ImageFile('OFS/www/ControlPanel_icon.gif') ApplicationManagement_icon=ImageFile('App/www/cpSystem.gif') DatabaseManagement_icon=ImageFile('App/www/dbManage.gif') VersionManagement_icon=ImageFile('App/www/vManage.gif') InstalledProduct_icon=ImageFile('App/www/installedProduct.gif') BrokenProduct_icon=ImageFile('App/www/brokenProduct.gif') Product_icon=ImageFile('App/www/product.gif') Factory_icon=ImageFile('App/www/factory.gif') Permission_icon=ImageFile('App/www/permission.gif') ProductFolder_icon=ImageFile('App/www/productFolder.gif') PyPoweredSmall_Gif=ImageFile('App/www/PythonPoweredSmall.gif') ZopeButton=ImageFile('App/www/zope_button.jpg') ZButton=ImageFile('App/www/z_button.jpg') Properties_icon=ImageFile('OFS/www/Properties_icon.gif') Methods_icon=ImageFile('ZClasses/methods.gif') Propertysheets_icon=ImageFile('ZClasses/propertysheets.gif') class Misc_: "Miscellaneous product information" __roles__=None def __init__(self, name, dict): self._d=dict self.__name__=name def __str__(self): return self.__name__ def __getitem__(self, name): return self._d[name] def __setitem__(self, name, v): self._d[name]=v Zope-2.0.1-ZEO-nonbin/lib/python/OFS/pasteDialog.dtml100644 1007 1403 1455 6761246442 22160 0ustar petrillipetrilli Paste Item

    Paste

    An item with the specified id exists. Please specify another id. Please specify the id to use for this .
    Id

    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/properties.dtml100644 1007 1403 12224 6761246442 22134 0ustar petrillipetrilli Properties

    You are currently working in version

    Properties allow you to assign simple values to Zope objects.

    The following properties are defined for this item. To add a new property, enter a name, type and value for the new property and click the "Add" button. To change property values, edit the values and click "Save Changes".

    "> "> "> CHECKED> "> No value for Unknown property type

    There are currently no properties defined for this item. To add a property, click the "Add..." button.

    To add a new property, enter a name, type and value for the new property and click the "Add" button.

    Id Type
    Value
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/propertysheets.dtml100644 1007 1403 2235 6675500230 23011 0ustar petrillipetrilli PropertySheets

    () /p_/locked" ALT="This item has been modified in this session"> /p_/lockedo" ALT="This item has been modified in another session">
    Zope-2.0.1-ZEO-nonbin/lib/python/OFS/rPickle.py100644 1007 1403 10530 6671334624 21017 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Restricted unpickler""" __version__='$Revision: 1.4 $'[11:-2] import pickle reg={} class Unpickler(pickle.Unpickler): def find_class(self, module, name): try: return reg[(module,name)] except: raise SystemError, 'Class not registered' def load_string(self): raise 'BadPickle', 'Non binstring' # Public interface from cStringIO import StringIO def loads(s): """Unpickle a string""" return Unpickler(StringIO(s)).load() def register(mod, cls, obj): """Register a class""" reg[(mod,cls)]=obj def unregister(mod, cls): """Unregister a class""" del reg[(mod,cls)] Zope-2.0.1-ZEO-nonbin/lib/python/OFS/renameForm.dtml100644 1007 1403 2673 6761246442 22022 0ustar petrillipetrilli Rename Item

    Rename

    to:


    The item does not support this operation.



    You must select an item to rename.

    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ 40755 1007 1403 0 6772126757 20124 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/ExternalMethod/ 40755 1007 1403 0 6772126760 23041 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/ExternalMethod/release/ 40755 1007 1403 0 6772126760 24461 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/ExternalMethod/CHANGES.txt100644 1007 1403 2573 6531312023 24734 0ustar petrillipetrilliExternal Method Changes External Method 1.3 Features - Permissions have been updated to work with the Principia 1.2 and later permission-management enhancements. External Method 1.2 Bug Fixes - TypeError exceptions in external methods were reported incorrectly. Features - ExternalMethods now use standard_error_message to report errors. External Method 1.1 This release changes the way that ExternalMethods are bound to folders. ExternalMethods now bind themselves to their acquisition parents, rather than to REQUEST['PARENTS'][0]. This is needed to make ExternalMethods useful in trees and exprs. The 1.1 release of Principia is needed for this release of ExternalMethod to function correctly. External Method 1.0.3 Bugs Fixed - A new copy of an external method was written the first time it was used after being loaded from the database. In addition to database bloat, this could also cause strange session/locking behavior. External Method 1.0.2 Bugs Fixed - Add permissions were not editable. Features - If an ExternalMethod takes a single argument, named self, and is called with no arguments, then the folder in which the method is accessed is passed. This is handy when the method is called from a document. Zope-2.0.1-ZEO-nonbin/lib/python/Products/ExternalMethod/ExternalMethod.py100644 1007 1403 24403 6771675467 26472 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """External Method Product This product provides support for external methods, which allow domain-specific customization of web environments. """ __version__='$Revision: 1.33 $'[11:-2] from Globals import Persistent, HTMLFile, MessageDialog, HTML import OFS.SimpleItem, Acquisition from string import split, join, find, lower import AccessControl.Role, sys, os, stat, traceback from OFS.SimpleItem import pretty_tb from App.Extensions import getObject, getPath, FuncCode from Globals import DevelopmentMode manage_addExternalMethodForm=HTMLFile('methodAdd', globals()) def manage_addExternalMethod(self, id, title, module, function, REQUEST=None): """Add an external method to a folder Un addition to the standard Principia object-creation arguments, 'id' and title, the following arguments are defined: function -- The name of the python function. This can be a an ordinary Python function, or a bound method. module -- The name of the file containing the function definition. The module normally resides in the 'Extensions' directory, however, the file name may have a prefix of 'product.', indicating that it should be found in a product directory. For example, if the module is: 'ACMEWidgets.foo', then an attempt will first be made to use the file 'lib/python/Products/ACMEWidgets/Extensions/foo.py'. If this failes, then the file 'Extensions/ACMEWidgets.foo.py' will be used. """ i=ExternalMethod(id,title,module,function) self._setObject(id,i) return self.manage_main(self,REQUEST) class ExternalMethod(OFS.SimpleItem.Item, Persistent, Acquisition.Explicit, AccessControl.Role.RoleManager): """Web-callable functions that encapsulate external python functions. The function is defined in an external file. This file is treated like a module, but is not a module. It is not imported directly, but is rather read and evaluated. The file must reside in the 'Extensions' subdirectory of the Principia installation, or in an 'Extensions' subdirectory of a product directory. Due to the way ExternalMethods are loaded, it is not *currently* possible to use Python modules that reside in the 'Extensions' directory. It is possible to load modules found in the 'lib/python' directory of the Principia installation, or in packages that are in the 'lib/python' directory. """ meta_type='External Method' func_defaults=() func_code=None ZopeTime=Acquisition.Acquired manage_options=( {'label':'Properties', 'action':'manage_main'}, {'label':'Try It', 'action':''}, {'label':'Security', 'action':'manage_access'}, ) __ac_permissions__=( ('View management screens', ('manage_main',)), ('Change External Methods', ('manage_edit',)), ('View', ('__call__','')), ) def __init__(self, id, title, module, function): self.id=id self.manage_edit(title, module, function) manage_main=HTMLFile('methodEdit', globals()) def manage_edit(self, title, module, function, REQUEST=None): """Change the external method See the description of manage_addExternalMethod for a descriotion of the arguments 'module' and 'function'. Note that calling 'manage_edit' causes the "module" to be effectively reloaded. This is useful during debugging to see the effects of changes, but can lead to problems of functions rely on shared global data. """ self.title=title if module[-3:]=='.py': module=module[:-3] elif module[-4:]=='.py': module=module[:-4] self._module=module self._function=function self.getFunction(1,1) if REQUEST: return MessageDialog( title ='Changed %s' % self.id, message='%s has been updated' % self.id, action =REQUEST['URL1']+'/manage_main', target ='manage_main') def getFunction(self, check=0, reload=0): f=getObject(self._module, self._function, reload) if hasattr(f,'im_func'): ff=f.im_func else: ff=f if check: # Check to make sure function signature is the same. # Otherwise, we may end up causing an unwanted change. if self.func_defaults != ff.func_defaults: self.func_defaults = ff.func_defaults func_code=FuncCode(ff,f is not ff) if func_code != self.func_code: self.func_code=func_code self._v_f=f return f def __call__(self, *args, **kw): """Call an ExternalMethod Calling an External Method is roughly equivalent to calling the original actual function from Python. Positional and keyword parameters can be passed as usual. Note however that unlike the case of a normal Python method, the "self" argument must be passed explicitly. An exception to this rule is made if: - The supplied number of arguments is one less than the required number of arguments, and - The name of the function\'s first argument is 'self'. In this case, the URL parent of the object is supplied as the first argument. """ if DevelopmentMode: # If the file has been modified since last loaded, force a reload. ts=os.stat(self.filepath())[stat.ST_MTIME] if (not hasattr(self, '_v_last_read') or (ts != self._v_last_read)): self._v_f=self.getFunction(1,1) self._v_last_read=ts if hasattr(self, '_v_f'): f=self._v_f else: f=self.getFunction() __traceback_info__=args, kw, self.func_defaults try: return apply(f,args,kw) except TypeError, v: tb=sys.exc_traceback try: if ((self.func_code.co_argcount- len(self.func_defaults or ()) - 1 == len(args)) and self.func_code.co_varnames[0]=='self'): return apply(f,(self.aq_parent.this(),)+args,kw) raise TypeError, v, tb finally: tb=None def function(self): return self._function def module(self): return self._module def filepath(self): if not hasattr(self, '_v_filepath'): self._v_filepath=getPath('Extensions', self._module, suffixes=('','py','pyc','pyp')) return self._v_filepath Zope-2.0.1-ZEO-nonbin/lib/python/Products/ExternalMethod/README.txt100755 1007 1403 243 6654147104 24610 0ustar petrillipetrilliExternal Methods The External Method product provides support for external Python methods, exposing them as callable objects within the Zope environment. Zope-2.0.1-ZEO-nonbin/lib/python/Products/ExternalMethod/__init__.py100644 1007 1403 10407 6700222533 25253 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''External Method Product Initialization $Id: __init__.py,v 1.11 1999/03/30 19:26:19 jim Exp $''' __version__='$Revision: 1.11 $'[11:-2] import ExternalMethod # This is the new way to initialize products. It is hoped # that this more direct mechanism will be more understandable. def initialize(context): context.registerClass( ExternalMethod.ExternalMethod, constructors=(ExternalMethod.manage_addExternalMethodForm, ExternalMethod.manage_addExternalMethod), icon='extmethod.gif', ) Zope-2.0.1-ZEO-nonbin/lib/python/Products/ExternalMethod/extmethod.gif100755 1007 1403 1613 6700223537 25621 0ustar petrillipetrilliGIF89aPPP@@@@@!,hH\XPB FTDЀĄ D# 4QaJ+ |iLFig98p0p(JH jTQ*2L ;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ExternalMethod/methodAdd.dtml100644 1007 1403 2653 6713410762 25710 0ustar petrillipetrilli Add External Method

    Add External Method

    External Methods allow you to add functionality to Zope by writing Python functions which are exposed as callable Zope objects.

    Use the form below to add and External Method. The Python module file should give the name of the Python module without ".py" Normally the Python module should be located in the Zope Extensions directory. You may also place the Python module inside a Extensions directory inside a Product directory, in which case the Python module file should be the name of the Product followed by a dot followed by the name of the Python module file.

    Id
    Title
    Function name
    Python module file

    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ExternalMethod/methodEdit.dtml100644 1007 1403 1744 6761246452 26113 0ustar petrillipetrilli Edit <!--#var title_or_id-->

    Edit

    Id
    Title
    Function name
    Python module file (without suffix)

    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ExternalMethod/www/ 40755 1007 1403 0 6772126760 23665 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/ExternalMethod/www/function.gif100744 1007 1403 1577 6461472213 26301 0ustar petrillipetrilliGIF89aPPP@@@@@!,\ 4A(TxA &lHaB("D`F.d8d(MJ,0%˕%0s͓7G.i#F= 2P?ozDSϛ;Zope-2.0.1-ZEO-nonbin/lib/python/Products/__init__.py100644 1007 1403 7360 6745344251 22327 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __ac_permissions__=() Zope-2.0.1-ZEO-nonbin/lib/python/Products/MIMETools/ 40755 1007 1403 0 6772126760 21666 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/MIMETools/MIMETag.py100644 1007 1403 14404 6720665472 23544 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __rcs_id__='$Id: MIMETag.py,v 1.3 1999/05/20 01:54:02 michel Exp $' __version__='$Revision: 1.3 $'[11:-2] from DocumentTemplate.DT_Util import * from DocumentTemplate.DT_String import String from MimeWriter import MimeWriter from cStringIO import StringIO import string, mimetools MIMEError = "MIME Tag Error" class MIMETag: ''' ''' name='mime' blockContinuations=('boundary',) encode=None def __init__(self, blocks): self.sections = [] for tname, args, section in blocks: args = parse_params(args, type=None, disposition=None, encode=None, name=None) has_key=args.has_key if has_key('type'): type = args['type'] else: type = 'application/octet-stream' if has_key('disposition'): disposition = args['disposition'] else: disposition = '' if has_key('encode'): encode = args['encode'] else: encode = 'base64' if has_key('name'): name = args['name'] else: name = '' if encode not in \ ('base64', 'quoted-printable', 'uuencode', 'x-uuencode', 'uue', 'x-uue', '7bit'): raise MIMEError, ( 'An unsupported encoding was specified in tag') self.sections.append((type, disposition, encode, name, section.blocks)) def render(self, md): contents=[] mw = MimeWriter(StringIO()) outer = mw.startmultipartbody('mixed') for x in self.sections: inner = mw.nextpart() t, d, e, n, b = x if d: inner.addheader('Content-Disposition', d) inner.addheader('Content-Transfer-Encoding', e) if n: plist = [('name', n)] else: plist = [] innerfile = inner.startbody(t, plist, 1) output = StringIO() if e == '7bit': innerfile.write(render_blocks(b, md)) else: mimetools.encode(StringIO(render_blocks(b, md)), output, e) output.seek(0) innerfile.write(output.read()) if x is self.sections[-1]: mw.lastpart() outer.seek(0) return outer.read() __call__=render String.commands['mime'] = MIMETag Zope-2.0.1-ZEO-nonbin/lib/python/Products/MIMETools/README.txt100644 1007 1403 7232 6701172235 23453 0ustar petrillipetrilliThe MIMETools Product The MIMETools product is alpha quality software. It may not work as documented or at all. If you encounter bugs in MIMETools, please report your problem to support@digicool.com or discuss it on the Zope mailing list, zope@zope.org. Currently, the MIMETools product's only function is to provide the DTML tag. The tag is used to construct MIME containers. The syntax of the tag is: Contents of first part Contents of second part Contents of nth part The area of data between tags, called a block, is encoded into whatever is specified with the 'encode' tag attribute for that block. If no encoding is specified, 'base64' is defaulted. Valid encoding options include 'base64', 'quoted-printable', 'uuencode', 'x-uuencode', 'uue' and 'x-uue'. If the 'encode' attribute is set to '7bit' no encoding is done on the block and the data is assumed to be in a valid MIME format. If the 'disposition' attribute is not specified for a certain block, then the 'Content-Disposition:' MIME header is not included in that block's MIME part. The entire MIME container, from the opening mime tag to the closing, has it's 'Content-Type:' MIME header set to 'multipart/mixed'. For example, the following DTML: This is the first part. This is the second. Is rendered to the following text: Content-Type: multipart/mixed; boundary="216.164.72.30.501.1550.923070182.795.22531" --216.164.72.30.501.1550.923070182.795.22531 Content-Type: text/plain Content-Transfer-Encoding: 7bit This is the first part. --216.164.72.30.501.1550.923070182.795.22531 Content-Type: text/plain Content-Transfer-Encoding: base64 VGhpcyBpcyB0aGUgc2Vjb25kLgo= --216.164.72.30.501.1550.923070182.795.22531-- The #mime tag is particulary handy in conjunction with the #sendmail tag. This allows Zope to send attachments along with email. Here is an example: Create a DTML method called 'input' with the following code:

    Send to:
    Create another DTML Method called 'send' with the following code: From: michel@digicool.com To: Hi , someone sent you this attachment. Mail with attachment was sent. Notice that there is no blank line between the 'To:' header and the starting #mime tag. If a blank line is inserted between them then the message will not be interpreted as multipart by the recieving mailreader. Also notice that there is no newline between the #boundary tag and the #var tag, or the end of the #var tag and the closing #mime tag. This is important, if you break the tags up with newlines then they will be encoded and included in the MIME part, which is probably not what you're after. As per the MIME spec, #mime tags may be nested within #mime tags arbitrarily. Zope-2.0.1-ZEO-nonbin/lib/python/Products/MIMETools/__init__.py100644 1007 1403 7574 6701172235 24077 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''MIMETools Product Initialization $Id: __init__.py,v 1.1 1999/04/02 16:47:25 michel Exp $''' __version__='$Revision: 1.1 $'[11:-2] import MIMETag Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/ 40755 1007 1403 0 6772126760 21636 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/release/ 40755 1007 1403 0 6772126760 23256 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/release/MailHost-1.0.1.rn100644 1007 1403 635 6675525233 26053 0ustar petrillipetrilliMailHost 1.0.1 Release Notes Features Added - MailHost objects now have an adjustable 'timeout' parameter that sets how long to wait to connect to the SMTP server before timing out. MailHost 1.0.1 Release Notes Features Added - MailHost objects now have an adjustable 'timeout' parameter that sets how long to wait to connect to the SMTP server before timing out. Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/release/MailHost-1.1.0.rn100644 1007 1403 1167 6675525233 26074 0ustar petrillipetrilliMailHost 1.1.0 Release Notes Features Added - Sendmail tag now has optional encode attribute, which results in the body of the email message being encoded using the designated encoding, and the proper headers being added. Choices are: base64, quoted-printable and uuencode. Bugs Fixed - MailHost object permissions now show op in the security list of Folder objects. MailHost 1.0.1 Release Notes Features Added - MailHost objects now have an adjustable 'timeout' parameter that sets how long to wait to connect to the SMTP server before timing out. Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/MailHost.py100644 1007 1403 31556 6745354170 24055 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """MailHost, a Principia SMTP object""" from Globals import Persistent, HTMLFile, HTML, MessageDialog from socket import *; from select import select from AccessControl.Role import RoleManager from operator import truth import Acquisition, sys, string, types, mimetools import OFS.SimpleItem, re, quopri, rfc822 import Globals from cStringIO import StringIO #$Id: MailHost.py,v 1.44 1999/07/21 14:26:00 jeffrey Exp $ __version__ = "$Revision: 1.44 $"[11:-2] smtpError = "SMTP Error" MailHostError = "MailHost Error" addForm=HTMLFile('addMailHost_form', globals(), localhost=gethostname()) def add(self, id, title='', smtp_host=None, localhost='localhost', smtp_port=25, timeout=1.0, REQUEST=None): ' add a MailHost into the system ' i=MailHost() #create new mail host i.id=id #give it id i.title=title #title i._init(localHost=localhost, smtpHost=smtp_host, smtpPort=smtp_port, timeout=timeout) self._setObject(id,i) #register it if REQUEST: return self.manage_main(self,REQUEST) class MailBase(Acquisition.Implicit, OFS.SimpleItem.Item, RoleManager): 'a mailhost...?' meta_type='Mail Host' manage=manage_main=HTMLFile('manageMailHost', globals()) index_html=None icon='misc_/MailHost/MHIcon' timeout=1.0 manage_options=({'icon':'', 'label':'Edit', 'action':'manage_main', 'target':'manage_main'}, {'icon':'', 'label':'Security', 'action':'manage_access', 'target':'manage_main'}, ) __ac_permissions__=( ('View management screens', ('manage',)), ('Change configuration', ('manage_makeChanges',)), ('Use mailhost services',('',)), ) def __init__(self): 'nothing yet' pass def _init(self, localHost, smtpHost, smtpPort, timeout=1): self.localHost=localHost self.smtpHost=smtpHost self.smtpPort=smtpPort self.timeout=timeout def manage_makeChanges(self,title,localHost,smtpHost,smtpPort, timeout, REQUEST=None): 'make the changes' self.title=title self.localHost=localHost self.smtpHost=smtpHost self.smtpPort=smtpPort self.timeout=timeout if REQUEST: return MessageDialog( title ='Changed %s' % self.__name__, message='%s has been updated' % self.id, action =REQUEST['URL2']+'/manage_main', target ='manage_main') def sendTemplate(trueself, self, messageTemplate, statusTemplate=None, mto=None, mfrom=None, encode=None, REQUEST=None): 'render a mail template, then send it...' mtemplate = getattr(self, messageTemplate) messageText = mtemplate(self, trueself.REQUEST) messageText=_encode(messageText, encode) headers, message = decapitate(messageText) if mto: headers['to'] = mto if mfrom: headers['from'] = mfrom for requiredHeader in ('to', 'from'): if not headers.has_key(requiredHeader): raise MailHostError,"Message missing SMTP Header '%s'"\ % requiredHeader Send(trueself.smtpHost, trueself.smtpPort, trueself.localHost, trueself.timeout, headers['from'], headers['to'], headers['subject'] or 'No Subject', messageText ) if not statusTemplate: return "SEND OK" try: stemplate=getattr(self, statusTemplate) return stemplate(self, trueself.REQUEST) except: return "SEND OK" def send(self, messageText, mto=None, mfrom=None, subject=None, encode=None): headers, message = decapitate(messageText) if not headers['subject']: messageText="subject: %s\n%s" % (subject or '[No Subject]', messageText) if mto: if type(mto) is type('s'): mto=map(string.strip, string.split(mto,',')) headers['to'] = filter(truth, mto) if mfrom: headers['from'] = mfrom for requiredHeader in ('to', 'from'): if not headers.has_key(requiredHeader): raise MailHostError,"Message missing SMTP Header '%s'"\ % requiredHeader messageText=_encode(messageText, encode) sm=SendMail(self.smtpHost, self.smtpPort, self.localHost, self.timeout) sm.send(mfrom=headers['from'], mto=headers['to'], subj=headers['subject'] or 'No Subject', body=messageText) def scheduledSend(self, messageText, mto=None, mfrom=None, subject=None, encode=None): headers, message = decapitate(messageText) if not headers['subject']: messageText="subject: %s\n%s" % (subject or '[No Subject]', messageText) if mto: if type(mto) is type('s'): mto=map(string.strip, string.split(mto,',')) headers['to'] = filter(truth, mto) if mfrom: headers['from'] = mfrom for requiredHeader in ('to', 'from'): if not headers.has_key(requiredHeader): raise MailHostError,"Message missing SMTP Header '%s'"\ % requiredHeader messageText=_encode(messageText, encode) Send(self.smtpHost, self.smtpPort, self.localHost, self.timeout, headers['from'], headers['to'], headers['subject'] or 'No Subject', messageText ) def simple_send(self, mto, mfrom, subject, body): body="subject: %s\n\n%s" % (subject, body) SendMail(self.smtpHost, self.smtpPort, self.localHost, self.timeout).send( mfrom=mfrom, mto=mto, subj=subject, body=body ) class MailHost(Persistent, MailBase): "persistent version" def Send(host, port, localhost, timeout, from_, to, subject, body): SendMail(host, port, localhost, timeout).send(from_, to, subject, body) class SendMail: singledots=re.compile('^\.$', re.M) def __init__(self, smtpHost, smtpPort, localHost="localhost", timeout=1): self.conn = socket(AF_INET, SOCK_STREAM) self.conn.connect(smtpHost, smtpPort) self.timeout=timeout self.fd=self.conn.fileno() self.conn.send("helo "+localHost+"\015\012") while 1: if not self._check(): break def __del__(self): self._close() def getLine(self): line='' tm=self.timeout while 1: if not select([self.fd],[],[],tm)[0]: #check the socket break data=self.conn.recv(1) if (not data) or (data == '\n'): break line=line+data return line def _check(self, lev='250'): line = self.getLine() if not line: return 0 try: code=string.atoi(line[:3]) except: raise smtpError, \ "Cannot convert line from SMTP: %s" % line if code > 400: raise smtpError, \ "Recieved error code %s from SMTP: %s"\ % (code, line) return 1 def send(self, mfrom, mto, subj='No Subject', body='Blank Message'): self.conn.send("mail from:<%s>\015\012" % mfrom) self._check() if type(mto) in [types.ListType, types.TupleType]: for person in mto: self.conn.send("rcpt to:<%s>\015\012" % person) self._check() else: self.conn.send("rcpt to:<%s>\015\012" % mto) self._check() self.conn.send("data\015\012") self._check() body=self.singledots.sub('..', body) body=string.replace(body, '\r\n', '\n') body=string.replace(body, '\r', '\n') body=string.replace(body, '\n', '\015\012') self.conn.send(body) self.conn.send("\015\012.\015\012") self._check('354') def _close(self): self.conn.send("quit\015\012") self.conn.close() def _encode(body, encode=None): if encode is None: return body mfile=StringIO(body) mo=mimetools.Message(mfile) if mo.getencoding() != '7bit': raise MailHostError, 'Message already encoded' newmfile=StringIO() newmfile.write(string.joinfields(mo.headers, '')) newmfile.write('Content-Transfer-Encoding: %s\n' % encode) if not mo.has_key('Mime-Version'): newmfile.write('Mime-Version: 1.0\n') newmfile.write('\n') mimetools.encode(mfile, newmfile, encode) return newmfile.getvalue() def decapitate(message): # split message into headers / body mfile=StringIO(message) mo=rfc822.Message(mfile) hd={} hd['to']=[] for header in (mo.getaddrlist('to'), mo.getaddrlist('cc'), mo.getaddrlist('bcc')): if not header: continue for name, addr in header: hd['to'].append(addr) hd['from']=mo.getaddr('from')[1] hd['subject']=mo.getheader('subject') or "No Subject" return hd, mfile.read() Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/README.txt100755 1007 1403 334 6675525231 23412 0ustar petrillipetrilliMailHost The MailHost product provides support for sending email from within the Zope environment using MailHost objects. Email can optionally be encoded using Base64, Quoted-Printable or UUEncode encoding. Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/SendMailTag.py100644 1007 1403 16471 6675525231 24464 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __rcs_id__='$Id: SendMailTag.py,v 1.6 1999/03/22 20:39:53 brian Exp $' __version__='$Revision: 1.6 $'[11:-2] from MailHost import MailBase from DocumentTemplate.DT_Util import * from DocumentTemplate.DT_String import String from socket import gethostname import string class SendMailTag: '''the send mail tag, used like thus: to: person@their.machine.com from: me@mymachine.net subject: just called to say... boy howdy! Text between the sendmail and /sendmail tags is processed by the MailHost machinery and delivered. There must be at least one blank line seperating the headers (to/from/etc..) from the body of the message. Instead of specifying a MailHost, an smtphost may be specified ala 'smtphost="mail.mycompany.com" port=25' (port defaults to 25 automatically). Other parameters are * mailto -- person (or comma-seperated list of persons) to send the mail to. If not specified, there **must** be a to: header in the message. * mailfrom -- person sending the mail (basically who the recipient can reply to). If not specified, there **must** be a from: header in the message. * subject -- optional subject. If not specified, there **must** be a subject: header in the message. * encode -- optional encoding. Possible values are: 'base64', 'quoted-printable' and 'uuencode'. ''' name='sendmail' blockContinuations=() encode=None def __init__(self, blocks): tname, args, section=blocks[0] args=parse_params(args, mailhost=None, mailto=None, mailfrom=None, subject=None, smtphost=None, port='25', encode=None) for key in ('mailto', 'mailfrom', 'subject', 'smtphost', 'port'): if not args.has_key(key):args[key]='' smtphost=None has_key=args.has_key if has_key('mailhost'): mailhost=args['mailhost'] elif has_key('smtphost'): mailhost=smtphost=args['smtphost'] elif has_key(''): mailhost=args['mailhost']=args[''] else: raise MailHostError, 'No mailhost was specified in tag' if has_key('encode') and args['encode'] not in \ ('base64', 'quoted-printable', 'uuencode', 'x-uuencode', 'uue', 'x-uue'): raise MailHostError, ( 'An unsupported encoding was specified in tag') if not smtphost: self.__name__=self.mailhost=mailhost self.smtphost=None else: self.__name__=self.smtphost=smtphost self.mailhost=None self.section=section self.args=args self.mailto=args['mailto'] self.mailfrom=args['mailfrom'] self.subject=None or args['subject'] if args['port'] and type(args['port']) is type('s'): self.port=args['port']=string.atoi(args['port']) elif args['port']=='': self.port=args['port']=25 else: self.port=args['port'] if has_key('encode'): self.encode=args['encode'] else: self.encode=None def render(self, md): args=self.args has_key=args.has_key if self.mailhost: mhost=md[self.mailhost] elif self.smtphost: mhost=MailBase() mhost._init(localHost=gethostname(), smtpHost=self.smtphost, smtpPort=self.port) mhost.send(self.section(md.this, md), self.mailto, self.mailfrom, self.subject, self.encode) return ' ' __call__=render String.commands['sendmail']=SendMailTag Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/Setup100644 1007 1403 232 6517156731 22731 0ustar petrillipetrilli*shared* # install MailHost.py # install SendMailTag.py # install __init__.py # install addMailHost_form.dtml # install manageMailHost.dtml # install www Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/__init__.py100644 1007 1403 10362 6750147164 24063 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''MailHost Product Initialization $Id: __init__.py,v 1.16 1999/07/29 21:58:12 amos Exp $''' __version__='$Revision: 1.16 $'[11:-2] import MailHost import SendMailTag def initialize(context): context.registerClass( MailHost.MailHost, permission='Add MailHost objects', constructors=(MailHost.addForm, MailHost.add), icon='www/MailHost_icon.gif', legacy=( ('manage_addMailHost_form', MailHost.addForm), ('manage_addMailHost', MailHost.add), ) ) Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/addMailHost_form.dtml100644 1007 1403 3123 6761246460 26026 0ustar petrillipetrilli Add MailHost

    Add MailHost

    A Mail Host allows Zope to send email.

    Use the form below to specify the options for your Mail Host. Local Host is the name of the machine Zope is running on. SMTP Host is the name of the mail server machine. SMTP Port is the port on which the mail server is running the SMTP service. Max. Timeout is how long Zope should wait before giving up when trying to send mail.

    Id
    Title
    Local Host
    SMTP Host
    SMTP Port
    Max. Timeout
     
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/manageMailHost.dtml100644 1007 1403 2414 6761246460 25505 0ustar petrillipetrilli Edit
    Id
    Title
    Local Host
    SMTP Host
    SMTP Port
    Max. Timeout

    Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/version.txt100644 1007 1403 20 6675525231 24107 0ustar petrillipetrilliMailHost-1-1-0 Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/sample/ 40755 1007 1403 0 6772126760 23117 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/sample/Setup100644 1007 1403 11 6312353423 24153 0ustar petrillipetrilli*shared* Zope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/www/ 40755 1007 1403 0 6772126760 22462 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/MailHost/www/MailHost_icon.gif100644 1007 1403 1600 6405340615 25761 0ustar petrillipetrilliGIF89aPPP@@@@@!,@]H@*\@"JHbB0jjd@lJbʜ)#ț8 "$%Op(Qw}ӧO;Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/ 40755 1007 1403 0 6772126760 20665 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/images/ 40755 1007 1403 0 6772126760 22132 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/images/File_icon.gif100644 1007 1403 1615 6700212304 24565 0ustar petrillipetrilliGIF89aPPP@@@@@!,j@AxჅ*tpÄ)f8A= pa< dǓ A$r"L*iH1ʚ&{ӡO/G~s̙?RlTӫ-* ;Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/images/Folder_icon.gif100644 1007 1403 1607 6700212304 25122 0ustar petrillipetrilliGIF89aPPP@@@@@!,@dH@,PpXŋ#"laD aG%&4FbʜD8G숳gN-YDEMpI6HJU*;Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/images/Image_icon.gif100644 1007 1403 1623 6700212304 24727 0ustar petrillipetrilliGIF89aPPP@@@@@!,@p@AxCpa ظbƏBNZ!?> —8s$J i]$IC<6tɌ/iZ*q)B`;Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/images/UserFolder_icon.gif100644 1007 1403 1625 6700212304 25761 0ustar petrillipetrilliGIF89aPPP@@@@@!,@rH@,Bŋ-JD0F:cCLJaȫX;Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/images/dtmlmethod.gif100755 1007 1403 1561 6700212304 25042 0ustar petrillipetrilliGIF89aPPP@@@@@!,NH`$0B6hp"D 4@#E t|QI Ҡ_,$kęs̔= 0: version=version[:l] self._version="%s/%s" % (version, id) self.users__draft__=uf=AccessControl.User.UserFolder() self.__allow_groups__=uf def icon(self): try: return getattr(self.aq_parent.aq_base,self._refid).icon except: return 'p_/broken' def manage_options(self): try: return getattr(self.aq_parent.aq_base,self._refid).manage_options except: return () def title(self): return 'draft of '+self._refid def title_and_id(self): nonempty=self.nonempty() if nonempty: return ('draft of %s (%s)' '     [Users]' ' [Approve]' % (self._refid, self.id, self.id, self.id, )) else: return ('draft of %s (%s)' ' [Users]' % (self._refid, self.id, self.id, )) def __bobo_traverse__(self, REQUEST, name): if name[-9:]=='__draft__': return getattr(self, name) try: db=self._p_jar.db() except: # BoboPOS 2 jar=Globals.VersionBase[self._version].jar else: # ZODB 3 jar=db.open(self._version) cleanup=Cleanup() cleanup.__del__=jar.close REQUEST[Cleanup]=cleanup dself=getdraft(self, jar) ref=getattr(dself.aq_parent.aq_base,dself._refid).aq_base.__of__(dself) if hasattr(ref, name): return dself, ref, getattr(ref, name) return getattr(self, name) def nonempty(self): try: db=self._p_jar.db() except: # BoboPOS 2 return Globals.VersionBase[self._version].nonempty() else: # ZODB 3 return not db.versionEmpty(self._version) manage_approve__draft__=Globals.HTMLFile('draftApprove', globals()) def manage_Save__draft__(self, remark, REQUEST=None): """Make version changes permanent""" try: db=self._p_jar.db() except: # BoboPOS 2 Globals.VersionBase[self._version].commit(remark) else: # ZODB 3 s=self._version d=self._p_jar.getVersion() if d==s: d='' db.commitVersion(s, d) if REQUEST: REQUEST['RESPONSE'].redirect(REQUEST['URL2']+'/manage_main') def manage_Discard__draft__(self, REQUEST=None): 'Discard changes made during the version' try: db=self._p_jar.db() except: # BoboPOS 2 Globals.VersionBase[self._version].abort() else: # ZODB 3 db.abortVersion(self._version) if REQUEST: REQUEST['RESPONSE'].redirect(REQUEST['URL2']+'/manage_main') def manage_afterClone(self, item): self._version='' def manage_afterAdd(self, item, container): if not self._version: self._version=self.absolute_url(1) def manage_beforeDelete(self, item, container): if self.nonempty(): raise 'Version Error', ( 'Attempt to %sdelete a non-empty version.

    ' ((self is not item) and 'indirectly ' or '')) Globals.default__class_init__(Draft) def getdraft(ob, jar): if hasattr(ob,'aq_parent'): return getdraft(ob.aq_self, jar).__of__(getdraft(ob.aq_parent, jar)) if hasattr(ob,'_p_oid'): ob=jar[ob._p_oid] return ob class Cleanup: pass Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/README.txt100755 1007 1403 70 6671043157 22414 0ustar petrillipetrilliOFSP ODFS Providers Draft Folders and Versions. Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/Session.py100644 1007 1403 7445 6700221351 22750 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Backward compatability! """ from Version import Version Session=Version Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/Setup100644 1007 1403 320 6602515720 21746 0ustar petrillipetrilli# install __init__.py # install Draft.py # install draftAdd.dtml # install draftApprove.dtml # install Session.py # install session.dtml # install sessionAdd.dtml # install sessionEdit.dtml # install images Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/Version.py100644 1007 1403 24047 6751635631 23007 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Version object""" __version__='$Revision: 1.36 $'[11:-2] import Globals, time from AccessControl.Role import RoleManager from Globals import MessageDialog from Globals import Persistent from Acquisition import Implicit from OFS.SimpleItem import Item from string import rfind from Globals import HTML from App.Dialogs import MessageDialog manage_addVersionForm=Globals.HTMLFile('versionAdd', globals()) def manage_addVersion(self, id, title, REQUEST=None): """ """ self=self.this() self._setObject(id, Version(id,title,REQUEST)) if REQUEST is not None: REQUEST['RESPONSE'].redirect(self.absolute_url()+'/manage_main') class Version(Persistent,Implicit,RoleManager,Item): """ """ meta_type='Version' manage_options=( {'label':'Join/Leave', 'action':'manage_main'}, {'label':'Save/Discard', 'action':'manage_end'}, {'label':'Properties', 'action':'manage_editForm'}, {'label':'Security', 'action':'manage_access'}, ) __ac_permissions__=( ('View management screens', ('manage','manage_editForm', '')), ('Change Versions', ('manage_edit',)), ('Join/leave Versions', ('manage_main', 'enter','leave','leave_another')), ('Save/discard Version changes', ('manage_end', 'save','discard')), ) cookie='' index_html=None # Ugh. def __init__(self, id, title, REQUEST): self.id=id self.title=title manage_main=Globals.HTMLFile('version', globals()) manage_end=Globals.HTMLFile('versionEnd', globals()) manage_editForm =Globals.HTMLFile('versionEdit', globals()) def title_and_id(self): r=Version.inheritedAttribute('title_and_id')(self) try: db=self._p_jar.db() except: # BoboPOS 2 if Globals.VersionBase[self.cookie].nonempty(): return '%s *' % r else: # ZODB 3 if not db.versionEmpty(self.cookie): return '%s *' % r return r def manage_edit(self, title, REQUEST=None): """ """ self.title=title if REQUEST: return MessageDialog( title ='Success!', message='Your changes have been saved', action ='manage_main') def enter(self, REQUEST, RESPONSE): """Begin working in a version""" RESPONSE.setCookie( Globals.VersionNameName, self.cookie, path=REQUEST['SCRIPT_NAME'], ) if (REQUEST.has_key('SERVER_SOFTWARE') and REQUEST['SERVER_SOFTWARE'][:9]=='Microsoft'): # IIS doesn't handle redirect headers correctly return MessageDialog( action=REQUEST['URL1']+'/manage_main', message=('If cookies are enabled by your browser, then ' 'you should have joined version %s.' % self.id) ) return RESPONSE.redirect(REQUEST['URL1']+'/manage_main') def leave(self, REQUEST, RESPONSE): """Temporarily stop working in a version""" RESPONSE.setCookie( Globals.VersionNameName,'No longer active', expires="Mon, 25-Jan-1999 23:59:59 GMT", path=REQUEST['SCRIPT_NAME'], ) if (REQUEST.has_key('SERVER_SOFTWARE') and REQUEST['SERVER_SOFTWARE'][:9]=='Microsoft'): # IIS doesn't handle redirect headers correctly return MessageDialog( action=REQUEST['URL1']+'/manage_main', message=('If cookies are enabled by your browser, then ' 'you should have left version %s.' % self.id) ) return RESPONSE.redirect(REQUEST['URL1']+'/manage_main') def leave_another(self, REQUEST, RESPONSE): """Leave a version that may not be the current version""" return self.leave(REQUEST, RESPONSE) def save(self, remark, REQUEST=None): """Make version changes permanent""" try: db=self._p_jar.db() except: # BoboPOS 2 Globals.VersionBase[self.cookie].commit(remark) else: # ZODB 3 s=self.cookie d=self._p_jar.getVersion() if d==s: d='' get_transaction().note(remark) db.commitVersion(s, d) if REQUEST is not None: REQUEST['RESPONSE'].redirect(REQUEST['URL1']+'/manage_main') def discard(self, remark='', REQUEST=None): 'Discard changes made during the version' try: db=self._p_jar.db() except: # BoboPOS 2 Globals.VersionBase[self.cookie].abort() else: # ZODB 3 get_transaction().note(remark) db.abortVersion(self.cookie) if REQUEST is not None: REQUEST['RESPONSE'].redirect(REQUEST['URL1']+'/manage_main') def nonempty(self): try: db=self._p_jar.db() except: # BoboPOS 2 return Globals.VersionBase[self.cookie].nonempty() else: # ZODB 3 return not db.versionEmpty(self.cookie) def manage_afterClone(self, item): self.cookie='' def manage_afterAdd(self, item, container): if not self.cookie: self.cookie=self.absolute_url(1) def manage_beforeDelete(self, item, container): if self.nonempty(): raise 'Version Error', ( 'Attempt to %sdelete a non-empty version.

    ' ((self is not item) and 'indirectly ' or '')) try: REQUEST=self.REQUEST except: pass else: v=self.cookie if REQUEST.get(Globals.VersionNameName, '') == v: raise 'Version error', ( 'An attempt was made to delete a version, %s, or an\n' 'object containing %s while\n working in the\n' 'version %s. This would lead to a "version\n' 'paradox". The object containing the deleted\n' 'object would be locked and it would be impossible\n' 'to clear the lock by saving or discarding the\n' 'version, because the version would no longer\n' 'be accessable.

    \n' % (v,v,v)) Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/__init__.py100644 1007 1403 15500 6754276777 23132 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Base Principia $Id: __init__.py,v 1.31 1999/08/11 13:43:27 jim Exp $''' __version__='$Revision: 1.31 $'[11:-2] import Version, OFS.Image, OFS.Folder, AccessControl.User import OFS.DTMLMethod, OFS.DTMLDocument, ZClasses.ObjectManager # This is the new way to initialize products. It is hoped # that this more direct mechanism will be more understandable. def initialize(context): perm='Add Documents, Images, and Files' context.registerClass( OFS.DTMLMethod.DTMLMethod, permission=perm, constructors=(OFS.DTMLMethod.addForm, OFS.DTMLMethod.addDTMLMethod,), icon='images/dtmlmethod.gif', legacy=( ('manage_addDocument', OFS.DTMLMethod.addDTMLMethod), ('manage_addDTMLMethod', OFS.DTMLMethod.addDTMLMethod), ) ) context.registerBaseClass(OFS.DTMLMethod.DTMLMethod, 'DTML Method') context.registerClass( OFS.DTMLDocument.DTMLDocument, permission=perm, constructors=(OFS.DTMLDocument.addForm, OFS.DTMLDocument.addDTMLDocument), icon='images/dtmldoc.gif', legacy=(('manage_addDTMLDocument', OFS.DTMLDocument.addDTMLDocument),), ) context.registerBaseClass(OFS.DTMLDocument.DTMLDocument, 'DTML Document') context.registerClass( OFS.Image.Image, permission=perm, constructors=(('imageAdd',OFS.Image.manage_addImageForm), OFS.Image.manage_addImage), icon='images/Image_icon.gif', legacy=(OFS.Image.manage_addImage,), ) context.registerBaseClass(OFS.Image.Image, 'Image') context.registerClass( OFS.Image.File, permission=perm, constructors=(('fileAdd',OFS.Image.manage_addFileForm), OFS.Image.manage_addFile), icon='images/File_icon.gif', legacy=(OFS.Image.manage_addFile,), ) context.registerBaseClass(OFS.Image.File, 'File') context.registerClass( OFS.Folder.Folder, constructors=(OFS.Folder.manage_addFolderForm, OFS.Folder.manage_addFolder), icon='images/Folder_icon.gif', legacy=(OFS.Folder.manage_addFolder,), ) context.registerBaseClass(OFS.Folder.Folder, 'Folder') context.registerClass( AccessControl.User.UserFolder, constructors=(AccessControl.User.manage_addUserFolder,), icon='images/UserFolder_icon.gif', legacy=(AccessControl.User.manage_addUserFolder,), ) context.registerBaseClass(AccessControl.User.UserFolder, 'User Folder') context.registerBaseClass(AccessControl.User.User) context.registerClass( Version.Version, constructors=(Version.manage_addVersionForm, Version.manage_addVersion), icon='images/version.gif' ) #context.registerClass( # Draft.Draft, # constructors=(Draft.manage_addPrincipiaDraftForm, # Draft.manage_addPrincipiaDraft), # icon='images/draft.gif' # ) context.registerZClass(ZClasses.ObjectManager.ZObjectManager) Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/draftAdd.dtml100644 1007 1403 2057 6761246465 23364 0ustar petrillipetrilli Add Draft

    Add Draft Object

    A Draft allows you to make a working copy of a Zope object./ After you change the Draft, you can commit the changes to the original object.

    Id
    Base Object
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/draftApprove.dtml100644 1007 1403 1477 6602515721 24301 0ustar petrillipetrilli <!--#var title_or_id-->

    Approve

    You can make work done in () permanent by entering a remark in the space below and then clicking on the "Approve" button.

    Discard

    You can throw away work done in () by clicking on the "Discard" button.
    There is nothing to approve. Nothing has been changed yet. Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/version.dtml100644 1007 1403 2653 6761246465 23342 0ustar petrillipetrilli <!--#var title_or_id-->

    Another version is active!

    You cannot start working in this version while another version, is active. Leave first and then you may work in this version.

    Active Version Operations

    You are currently working in the version. To quit working in this version click on this button:

    Inactive Version Operations

    You are not currently working in the version. To start working in this version click on this button:
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/versionAdd.dtml100644 1007 1403 1373 6707216162 23740 0ustar petrillipetrilli Add Version

    Add Version

    A Version allows you to make changes to Zope in a private session. After you review the changes you can make them live.

    Id
    Title

    Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/versionEdit.dtml100644 1007 1403 1171 6761246465 24142 0ustar petrillipetrilli Edit
    Id
    Title

    Zope-2.0.1-ZEO-nonbin/lib/python/Products/OFSP/versionEnd.dtml100644 1007 1403 1632 6751607274 23763 0ustar petrillipetrilli<dtml-var title_or_id>

    Save or discard work done in a sesssion

    To save work done in version to version , click on the "Save" button. To discard work done in version , click on the "Discard" button. In either case, enter a comment to document the reason for saving or discarding the version.

    No unsaved work has been done in this version.
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/ 40755 1007 1403 0 6772126760 21622 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/www/ 40755 1007 1403 0 6772126760 22446 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/www/ZCatalog.gif100644 1007 1403 265 6733715167 24723 0ustar petrillipetrilliGIF89aƄ!,@bPHBmFOE0E"h"b[JI,Ljq9ieA8XL!FB/TRMxz/R0›a:#JOP |zT6V1;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/CHANGES.txt100644 1007 1403 450 6734677777 23530 0ustar petrillipetrilliCatalog Changes This file gives information about changes made to this product over time, things that need to be done before the next release and future plans. Releases Catalog 1.0.0a1 Features Added - Initial release Bugs Fixed - Initial release Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/Catalog.gif100644 1007 1403 265 6714567700 23742 0ustar petrillipetrilliGIF89aƄ!,@bPHBmFOE0E"h"b[JI,Ljq9ieA8XL!FB/TRMxz/R0›a:#JOP |zT6V1;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/Catalog.py100644 1007 1403 43134 6772077631 23672 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## from Persistence import Persistent import Acquisition import BTree, OIBTree, IOBTree, IIBTree IIBucket=IIBTree.Bucket from intSet import intSet from SearchIndex import UnIndex, UnTextIndex, UnKeywordIndex, Query import regex, pdb from string import lower import Record from Missing import MV from Lazy import LazyMap, LazyFilter, LazyCat class NoBrainer: """ This is the default class that gets instantiated for records returned by a __getitem__ on the Catalog. By default, no special methods or attributes are defined. """ pass def orify(seq, query_map={ type(regex.compile('')): Query.Regex, type(''): Query.String, }): subqueries=[] for q in seq: try: q=query_map[type(q)](q) except: q=Query.Cmp(q) subqueries.append(q) return apply(Query.Or,tuple(subqueries)) class Catalog(Persistent, Acquisition.Implicit): """ An Object Catalog An Object Catalog maintains a table of object metadata, and a series of manageable indexes to quickly search for objects (references in the metadata) that satisfy a search query. This class is not Zope specific, and can be used in any python program to build catalogs of objects. """ _v_brains = NoBrainer _v_result_class = NoBrainer def __init__(self, brains=None): self.schema = {} # mapping from attribute name to column number self.names = () # sequence of column names self.indexes = {} # maping from index name to index object # The catalog maintains a BTree of object meta_data for # convenient display on result pages. meta_data attributes # are turned into brain objects and returned by # searchResults. The indexing machinery indexes all records # by an integer id (rid). self.data is a mapping from the # integer id to the meta_data, self.uids is a mapping of the # object unique identifier to the rid, and self.paths is a # mapping of the rid to the unique identifier. self.data = BTree.BTree() # mapping of rid to meta_data self.uids = OIBTree.BTree() # mapping of uid to rid self.paths = IOBTree.BTree() # mapping of rid to uid if brains is not None: self._v_brains = brains self.useBrains(self._v_brains) def __getitem__(self, index, ttype=type(())): """ Returns instances of self._v_brains, or whatever is passed into self.useBrains. """ if type(index) is ttype: normalized_score, score, key = index r=self._v_result_class(self.data[key]).__of__(self.aq_parent) r.data_record_id_ = key r.data_record_score_ = score r.data_record_normalized_score_ = normalized_score else: r=self._v_result_class(self.data[index]).__of__(self.aq_parent) r.data_record_id_ = index r.data_record_score_ = 1 r.data_record_normalized_score_ = 1 return r def __setstate__(self, state): Persistent.__setstate__(self, state) self.useBrains(self._v_brains) def useBrains(self, brains): """ Sets up the Catalog to return an object (ala ZTables) that is created on the fly from the tuple stored in the self.data Btree. """ class mybrains(Record.Record, Acquisition.Implicit, brains): __doc__ = 'Data record' def has_key(self, key): return self.__record_schema__.has_key(key) scopy={} scopy = self.schema.copy() scopy['data_record_id_']=len(self.schema.keys()) scopy['data_record_score_']=len(self.schema.keys())+1 scopy['data_record_normalized_score_']=len(self.schema.keys())+2 mybrains.__record_schema__ = scopy self._v_brains = brains self._v_result_class=mybrains def addColumn(self, name, default_value=None): """ adds a row to the meta data schema """ schema = self.schema names = list(self.names) if schema.has_key(name): raise 'Column Exists', 'The column exists' if not schema.has_key(name): if schema.values(): schema[name] = max(schema.values())+1 else: schema[name] = 0 names.append(name) if default_value is None or default_value == '': default_value = MV for key in self.data.keys(): rec = list(self.data[key]) rec.append(default_value) self.data[key] = tuple(rec) self.names = tuple(names) self.schema = schema self.useBrains(self._v_brains) self.__changed__(1) #why? def delColumn(self, name): """ deletes a row from the meta data schema """ names = list(self.names) _index = names.index(name) if not self.schema.has_key(name): return names.remove(name) # rebuild the schema i=0; schema = {} for name in names: schema[name] = i i = i + 1 self.schema = schema self.names = tuple(names) self.useBrains(self._v_brains) # remove the column value from each record for key in self.data.keys(): rec = list(self.data[key]) rec.remove(rec[_index]) self.data[key] = tuple(rec) def addIndex(self, name, type): """ adds an index """ if self.indexes.has_key(name): raise 'Index Exists', 'The index specified allready exists' indexes = self.indexes if type == 'FieldIndex': indexes[name] = UnIndex.UnIndex(name) elif type == 'TextIndex': indexes[name] = UnTextIndex.UnTextIndex(name) elif type == 'KeywordIndex': indexes[name] = UnKeywordIndex.UnKeywordIndex(name) self.indexes = indexes def delIndex(self, name): """ deletes an index """ if not self.indexes.has_key(name): raise 'No Index', 'The index specified does not exist' indexes = self.indexes del indexes[name] self.indexes = indexes # the cataloging API def catalogObject(self, object, uid, threshold=None): """ Adds an object to the Catalog by iteratively applying it all indexes. 'object' is the object to be cataloged 'uid' is the unique Catalog identifier for this object """ data = self.data if self.uids.has_key(uid): i = self.uids[uid] elif data: i = data.keys()[-1] + 1 # find the next available rid else: i = 0 self.uids[uid] = i self.paths[i] = uid # meta_data is stored as a tuple for efficiency data[i] = self.recordify(object) total = 0 for x in self.indexes.values(): if hasattr(x, 'index_object'): blah = x.index_object(i, object, threshold) total = total + blah self.data = data return total def uncatalogObject(self, uid): """ Uncatalog and object from the Catalog. and 'uid' is a unique Catalog identifier Note, the uid must be the same as when the object was catalogued, otherwise it will not get removed from the catalog """ if uid not in self.uids.keys(): return rid = self.uids[uid] for x in self.indexes.values(): if hasattr(x, 'unindex_object'): try: x.unindex_object(rid) except KeyError: pass #fugedaboudit # I think if your data gets out of sync due to crashes or # ZClass problems, some items might not be here. The try's # catch any inconsistencies and lets 'Update Catalog' sanify # the situation del self.data[rid] del self.uids[uid] del self.paths[rid] def clear(self): """ clear catalog """ self.data = BTree.BTree() self.uids = OIBTree.BTree() self.paths = IOBTree.BTree() for x in self.indexes.values(): x.clear() def uniqueValuesFor(self, name): """ return unique values for FieldIndex name """ return self.indexes[name].uniqueValues() def hasuid(self, uid): """ return the rid if catalog contains an object with uid """ if uid in self.uids.keys(): return self.uids[uid] else: return None def recordify(self, object): """ turns an object into a record tuple """ record = [] # the unique id is allways the first element for x in self.names: try: attr = getattr(object, x) if(callable(attr)): attr = attr() except: attr = MV record.append(attr) return tuple(record) def instantiate(self, record): r=self._v_result_class(record[1]) r.data_record_id_ = record[0] return r.__of__(self) ## Searching engine def _indexedSearch(self, args, sort_index, append, used, IIBType=type(IIBucket()), intSType=type(intSet())): ## import pdb ## pdb.set_trace() ## I use this so much I'm just leaving it commented out rs=None data=self.data if used is None: used={} for i in self.indexes.keys(): try: index = self.indexes[i] if hasattr(index,'_apply_index'): r=index._apply_index(args) if r is not None: r, u = r for name in u: used[name]=1 if rs is None: rs = r else: if type(rs) is intSType and type(r) is IIBType: rs=r.intersection(rs) else: rs=rs.intersection(r) except: return used if rs is None: if sort_index is None: rs=data.items() append(LazyMap(self.instantiate, rs)) else: for k, intset in sort_index._index.items(): append((k,LazyMap(self.__getitem__, intset))) elif rs: if type(rs) is IIBType: rset = [] for key, score in rs.items(): rset.append((score, key)) rset.sort() rset.reverse() max = float(rset[0][0]) rs = [] for score, key in rset: rs.append(( int((score/max)*100), score, key)) append(LazyMap(self.__getitem__, rs)) elif sort_index is None and type(rs) is intSType: append(LazyMap(self.__getitem__, rs)) else: for k, intset in sort_index._index.items(): intset=intset.intersection(rs) if intset: append((k,LazyMap(self.__getitem__, intset))) return used def searchResults(self, REQUEST=None, used=None, query_map={ type(regex.compile('')): Query.Regex, type([]): orify, type(''): Query.String, }, **kw): ################################################################# # Get search arguments: if REQUEST is None and not kw: try: REQUEST=self.REQUEST except: pass if kw: if REQUEST: m=KWMultiMapping() m.push(REQUEST) m.push(kw) kw=m elif REQUEST: kw=REQUEST ################################################################# # Make sure batch size is set if REQUEST and not REQUEST.has_key('batch_size'): try: batch_size=self.default_batch_size except: batch_size=20 REQUEST['batch_size']=batch_size ################################################################# # Compute "sort_index", which is a sort index, or none: if kw.has_key('sort-on'): sort_index=kw['sort-on'] elif hasattr(self, 'sort-on'): sort_index=getattr(self, 'sort-on') elif kw.has_key('sort_on'): sort_index=kw['sort_on'] else: sort_index=None sort_order='' if sort_index is not None and sort_index in self.indexes.keys(): sort_index=self.indexes[sort_index] ################################################################# # Perform searches with indexes and sort_index r=[] used=self._indexedSearch(kw, sort_index, r.append, used) if not r: return r ################################################################# # Sort/merge sub-results if len(r)==1: if sort_index is None: r=r[0] else: r=r[0][1] else: if sort_index is None: r=LazyCat(r) else: r.sort() if kw.has_key('sort-order'): so=kw['sort-order'] elif hasattr(self, 'sort-order'): so=getattr(self, 'sort-order') elif kw.has_key('sort_order'): so=kw['sort_order'] else: so=None if (type(so) is type('') and lower(so) in ('reverse', 'descending')): r.reverse() r=LazyCat(map(lambda i: i[1], r)) return r __call__ = searchResults Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/CatalogAwareness.py100644 1007 1403 17515 6767475207 25554 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ZCatalog Findable class""" import urllib, string from Globals import HTMLFile class CatalogAware: """ This is a Mix-In class to make objects automaticly catalog and uncatalog themselves in Zope, and to provide some other basic attributes that are useful to catalog. Note that if your class or ZClass subclasses CatalogAware, it will only catalog itself when it is added or copied in Zope. If you make changes to your own object, you are responsible for calling your object's index_object method. """ meta_type='CatalogAware' default_catalog='Catalog' manage_editCatalogerForm=HTMLFile('editCatalogerForm', globals()) def manage_editCataloger(self, default, REQUEST): """ """ self.default_catalog=default message = "Your changes have been saved" return self.manage_main(self, REQUEST, manage_tabs_message=message) def manage_afterAdd(self, item, container): self.index_object() for object in self.objectValues(): try: s=object._p_changed except: s=0 object.manage_afterAdd(item, container) if s is None: object._p_deactivate() def manage_afterClone(self, item): self.index_object() for object in self.objectValues(): try: s=object._p_changed except: s=0 object.manage_afterClone(item) if s is None: object._p_deactivate() def manage_beforeDelete(self, item, container): self.unindex_object() for object in self.objectValues(): try: s=object._p_changed except: s=0 object.manage_beforeDelete(item, container) if s is None: object._p_deactivate() def creator(self): """Return a sequence of user names who have the local Owner role on an object. The name creator is used for this method to conform to Dublin Core.""" users=[] for user, roles in self.get_local_roles(): if 'Owner' in roles: users.append(user) return string.join(users, ', ') def onDeleteObject(self): """Object delete handler. I think this is obsoleted by manage_beforeDelete """ self.unindex_object() def url(self, ftype=urllib.splittype, fhost=urllib.splithost): """Return a SCRIPT_NAME-based url for an object.""" if hasattr(self, 'DestinationURL') and \ callable(self.DestinationURL): url='%s/%s' % (self.DestinationURL(), self.id) else: url=self.absolute_url() type, uri=ftype(url) host, uri=fhost(uri) script_name=self.REQUEST['SCRIPT_NAME'] __traceback_info__=(`uri`, `script_name`) if script_name: uri=filter(None, string.split(uri, script_name))[0] uri=uri or '/' if uri[0]=='/': uri=uri[1:] return uri def summary(self, num=200): """Return a summary of the text content of the object.""" if not hasattr(self, 'text_content'): return '' attr=getattr(self, 'text_content') if callable(attr): text=attr() else: text=attr n=min(num, len(text)) return text[:n] def index_object(self): """A common method to allow Findables to index themselves.""" if hasattr(self, self.default_catalog): getattr(self, self.default_catalog).catalog_object(self, self.url()) def unindex_object(self): """A common method to allow Findables to unindex themselves.""" if hasattr(self, self.default_catalog): getattr(self, self.default_catalog).uncatalog_object(self.url()) def reindex_object(self): """ Suprisingly useful """ self.unindex_object() self.index_object() def reindex_all(self, obj=None): """ """ if obj is None: obj=self if hasattr(aq_base(obj), 'index_object'): obj.index_object() if hasattr(aq_base(obj), 'objectValues'): sub=obj.objectValues() for item in obj.objectValues(): reindex_all(self, item) return 'done!' Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/Lazy.py100644 1007 1403 20567 6733715127 23240 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 0.9.7 # --------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''$Id: Lazy.py,v 1.1 1999/06/22 14:14:47 michel Exp $''' __version__='$Revision: 1.1 $'[11:-2] class Lazy: def __repr__(self): return `list(self)` def __len__(self): try: return self._len except AttributeError: pass l=len(self._data) while 1: try: self[l] l=l+1 except: self._len=l return l def __getslice__(self,i1,i2): r=[] for i in range(i1,i2): try: r.append(self[i]) except IndexError: return r return r slice=__getslice__ class LazyCat(Lazy): # Lazy concatenation of one or more sequences. Should be handy # for accessing small parts of big searches. def __init__(self, sequences): self._seq=sequences self._data=[] self._sindex=0 self._eindex=-1 def __getitem__(self,index): data=self._data try: seq=self._seq except AttributeError: return data[index] i=index if i < 0: i=len(self)+i if i < 0: raise IndexError, index ind=len(data) if i < ind: return data[i] ind=ind-1 sindex=self._sindex try: s=seq[sindex] except: raise IndexError, index eindex=self._eindex while i > ind: try: eindex=eindex+1 v=s[eindex] data.append(v) ind=ind+1 except IndexError: self._sindex=sindex=sindex+1 try: s=self._seq[sindex] except: del self._seq del self._sindex del self._eindex raise IndexError, index self._eindex=eindex=-1 self._eindex=eindex return data[i] class LazyMap(Lazy): # Act like a sequence, but get data from a filtering process. # Don't access data until necessary def __init__(self,func,seq): self._seq=seq self._len=len(seq) self._data=[] self._func=func def __getitem__(self,index): data=self._data try: s=self._seq except AttributeError: return data[index] i=index if i < 0: i=len(self)+i if i < 0: raise IndexError, index ind=len(data) if i < ind: return data[i] ind=ind-1 func=self._func while i > ind: try: ind=ind+1 data.append(func(s[ind])) except IndexError: del self._func del self._seq raise IndexError, index return data[i] class LazyFilter(Lazy): # Act like a sequence, but get data from a filtering process. # Don't access data until necessary def __init__(self,test,seq): self._seq=seq self._data=[] self._eindex=-1 self._test=test def __getitem__(self,index): data=self._data try: s=self._seq except AttributeError: return data[index] i=index if i < 0: i=len(self)+i if i < 0: raise IndexError, index ind=len(data) if i < ind: return data[i] ind=ind-1 test=self._test e=self._eindex while i > ind: try: e=e+1 v=s[e] if test(v): data.append(v) ind=ind+1 except IndexError: del self._test del self._seq del self._eindex raise IndexError, index self._eindex=e return data[i] class LazyMop(Lazy): # Act like a sequence, but get data from a filtering process. # Don't access data until necessary def __init__(self,test,seq): self._seq=seq self._data=[] self._eindex=-1 self._test=test def __getitem__(self,index): data=self._data try: s=self._seq except AttributeError: return data[index] i=index if i < 0: i=len(self)+i if i < 0: raise IndexError, index ind=len(data) if i < ind: return data[i] ind=ind-1 test=self._test e=self._eindex while i > ind: try: e=e+1 v=s[e] try: v=test(v) data.append(v) ind=ind+1 except: pass except IndexError: del self._test del self._seq del self._eindex raise IndexError, index self._eindex=e return data[i] Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/README.txt100644 1007 1403 570 6734715053 23374 0ustar petrillipetrilliZCatalog This is the ZCatalog product for the Z Object Publishing Environment. ****** IMPORTANT ****** This product contains no binaries, and should install identically on all platforms. Installation o Extract the distribution file into the top-level directory of your Zope installation. o Restart your Zope installation. Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/ZCatalog.py100644 1007 1403 40245 6770245124 24014 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ZCatalog product""" from Globals import HTMLFile, MessageDialog import Globals from OFS.Folder import Folder from OFS.FindSupport import FindSupport from DateTime import DateTime from SearchIndex import Query import string, regex, urlparse, urllib, os, sys, time import Products from Acquisition import Implicit from Persistence import Persistent from Catalog import Catalog, orify from SearchIndex import UnIndex, UnTextIndex import IOBTree manage_addZCatalogForm=HTMLFile('addZCatalog',globals()) def manage_addZCatalog(self,id,title,REQUEST=None): """Add a ZCatalog object """ c=ZCatalog(id,title) self._setObject(id,c) if REQUEST is not None: return self.manage_main(self,REQUEST) class ZCatalog(Folder, FindSupport, Persistent, Implicit): """ZCatalog object A ZCatalog contains arbirary index like references to Zope objects. ZCatalog's can index either 'Field' values of object, or 'Text' values. ZCatalog does not store references to the objects themselves, but rather to a unique identifier that defines how to get to the object. In Zope, this unique idenfier is the object's relative path to the ZCatalog (since two Zope object's cannot have the same URL, this is an excellent unique qualifier in Zope). Most of the dirty work is done in the _catalog object, which is an instance of the Catalog class. An interesting feature of this class is that it is not Zope specific. You can use it in any Python program to catalog objects. """ meta_type = "ZCatalog" icon='misc_/ZCatalog/ZCatalog.gif' manage_options=( {'label': 'Contents', 'action': 'manage_main', 'target': 'manage_main'}, {'label': 'Cataloged Objects', 'action': 'manage_catalogView', 'target': 'manage_main'}, {'label': 'Find Items to ZCatalog', 'action': 'manage_catalogFind', 'target':'manage_main'}, {'label': 'MetaData Table', 'action': 'manage_catalogSchema', 'target':'manage_main'}, {'label': 'Indexes', 'action': 'manage_catalogIndexes', 'target':'manage_main'}, {'label': 'Status', 'action': 'manage_catalogStatus', 'target':'manage_main'}, ) __ac_permissions__=( ('Manage ZCatalog Entries', ['manage_catalogObject', 'manage_uncatalogObject', 'catalog_object', 'uncatalog_object', 'manage_catalogView', 'manage_catalogFind', 'manage_catalogSchema', 'manage_catalogIndexes', 'manage_catalogStatus', 'manage_catalogReindex', 'manage_catalogFoundItems', 'manage_catalogClear', 'manage_addColumn', 'manage_delColumns', 'manage_addIndex', 'manage_delIndexes', 'manage_main',], ['Manager']), ('Search ZCatalog', ['searchResults', '__call__', 'uniqueValuesFor', 'getpath', 'schema', 'indexes', 'index_objects', 'all_meta_types', 'valid_roles', 'resolve_url', 'getobject'], ['Anonymous', 'Manager']), ) manage_catalogAddRowForm = HTMLFile('catalogAddRowForm', globals()) manage_catalogView = HTMLFile('catalogView',globals()) manage_catalogFind = HTMLFile('catalogFind',globals()) manage_catalogSchema = HTMLFile('catalogSchema', globals()) manage_catalogIndexes = HTMLFile('catalogIndexes', globals()) manage_catalogStatus = HTMLFile('catalogStatus', globals()) threshold=10000 _v_total=0 def __init__(self,id,title=''): self.id=id self.title=title self.threshold = 10000 self._v_total = 0 self._catalog = Catalog() self._catalog.addColumn('id') self._catalog.addIndex('id', 'FieldIndex') self._catalog.addColumn('title') self._catalog.addIndex('title', 'TextIndex') self._catalog.addColumn('meta_type') self._catalog.addIndex('meta_type', 'FieldIndex') self._catalog.addColumn('bobobase_modification_time') self._catalog.addIndex('bobobase_modification_time', 'FieldIndex') self._catalog.addColumn('summary') self._catalog.addIndex('PrincipiaSearchSource', 'TextIndex') def manage_edit(self, RESPONSE, URL1, threshold=1000, REQUEST=None): """ edit the catalog """ self.threshold = threshold RESPONSE.redirect(URL1 + '/manage_main?manage_tabs_message=Catalog%20Changed') def manage_subbingToggle(self, REQUEST, RESPONSE, URL1): """ toggle subtransactions """ if self.threshold: self.threshold = None else: self.threshold = 10000 RESPONSE.redirect(URL1 + '/manage_catalogStatus?manage_tabs_message=Catalog%20Changed') def manage_catalogObject(self, REQUEST, RESPONSE, URL1, urls=None): """ index all Zope objects that 'urls' point to """ if urls: for url in urls: obj = self.resolve_url(url, REQUEST) if obj is not None: self.catalog_object(obj, url) RESPONSE.redirect(URL1 + '/manage_catalogView?manage_tabs_message=Object%20Cataloged') def manage_uncatalogObject(self, REQUEST, RESPONSE, URL1, urls=None): """ removes Zope object 'urls' from catalog """ if urls: for url in urls: self.uncatalog_object(url) RESPONSE.redirect(URL1 + '/manage_catalogView?manage_tabs_message=Object%20Uncataloged') def manage_catalogReindex(self, REQUEST, RESPONSE, URL1): """ clear the catalog, then re-index everything """ elapse = time.time() c_elapse = time.clock() paths = tuple(self._catalog.paths.values()) self._catalog.clear() for p in paths: obj = self.resolve_url(p, REQUEST) if obj is not None: self.catalog_object(obj, p) elapse = time.time() - elapse c_elapse = time.clock() - c_elapse RESPONSE.redirect(URL1 + '/manage_catalogView?manage_tabs_message=' + urllib.quote('Catalog Updated
    Total time: %s
    Total CPU time: %s' % (`elapse`, `c_elapse`))) def manage_catalogClear(self, REQUEST, RESPONSE, URL1): """ clears the whole enchelada """ self._catalog.clear() RESPONSE.redirect(URL1 + '/manage_catalogView?manage_tabs_message=Catalog%20Cleared') def manage_catalogFoundItems(self, REQUEST, RESPONSE, URL2, URL1, obj_metatypes=None, obj_ids=None, obj_searchterm=None, obj_expr=None, obj_mtime=None, obj_mspec=None, obj_roles=None, obj_permission=None): """ Find object according to search criteria and Catalog them """ elapse = time.time() c_elapse = time.clock() words = 0 results = self.ZopeFind(REQUEST.PARENTS[1], obj_metatypes=obj_metatypes, obj_ids=obj_ids, obj_searchterm=obj_searchterm, obj_expr=obj_expr, obj_mtime=obj_mtime, obj_mspec=obj_mspec, obj_permission=obj_permission, obj_roles=obj_roles, search_sub=1, REQUEST=REQUEST) for n in results: if REQUEST.script != "": abs_path = string.split((URL2 +'/'+n[0]), REQUEST.script)[1][1:] self.catalog_object(n[1], abs_path) elapse = time.time() - elapse c_elapse = time.clock() - c_elapse RESPONSE.redirect(URL1 + '/manage_catalogView?manage_tabs_message=' + urllib.quote('Catalog Updated
    Total time: %s
    Total CPU time: %s' % (`elapse`, `c_elapse`))) def manage_addColumn(self, name, REQUEST, RESPONSE, URL1): """ add a column """ self._catalog.addColumn(name) RESPONSE.redirect(URL1 + '/manage_catalogSchema?manage_tabs_message=Column%20Added') def manage_delColumns(self, names, REQUEST, RESPONSE, URL1): """ del a column """ for name in names: self._catalog.delColumn(name) RESPONSE.redirect(URL1 + '/manage_catalogSchema?manage_tabs_message=Column%20Deleted') def manage_addIndex(self, name, type, REQUEST, RESPONSE, URL1): """ add an index """ self._catalog.addIndex(name, type) RESPONSE.redirect(URL1 + '/manage_catalogIndexes?manage_tabs_message=Index%20Added') def manage_delIndexes(self, names, REQUEST, RESPONSE, URL1): """ del an index """ for name in names: self._catalog.delIndex(name) RESPONSE.redirect(URL1 + '/manage_catalogIndexes?manage_tabs_message=Index%20Deleted') def catalog_object(self, obj, uid): """ wrapper around catalog """ self._v_total = (self._v_total + self._catalog.catalogObject(obj, uid, self.threshold)) if self.threshold is not None: if self._v_total > self.threshold: # commit a subtransaction get_transaction().commit(1) # kick the chache self._p_jar.cacheFullSweep(1) self._v_total = 0 def uncatalog_object(self, uid): """ wrapper around catalog """ self._catalog.uncatalogObject(uid) def uniqueValuesFor(self, name): """ returns the unique values for a given FieldIndex """ return self._catalog.uniqueValuesFor(name) def getpath(self, rid): """ Return the path to a cataloged object given a 'data_record_id_' """ return self._catalog.paths[rid] def getobject(self, rid, REQUEST=None): """ Return a cataloged object given a 'data_record_id_' """ if REQUEST is None: REQUEST=self.REQUEST return self.resolve_url(self.getpath(rid), REQUEST) def schema(self): return self._catalog.schema.keys() def indexes(self): return self._catalog.indexes.keys() def index_objects(self): return self._catalog.indexes.values() def _searchable_arguments(self): r = {} n={'optional':1} for name in self._catalog.indexes.keys(): r[name]=n return r def _searchable_result_columns(self): r = [] for name in self._catalog.indexes.keys(): i = {} i['name'] = name i['type'] = 's' i['parser'] = str i['width'] = 8 r.append(i) return r def searchResults(self, REQUEST=None, used=None, query_map={ type(regex.compile('')): Query.Regex, type([]): orify, type(''): Query.String, }, **kw): """ Search the catalog according to the ZTables search interface. Search terms can be passed in the REQUEST or as keyword arguments. """ return apply(self._catalog.searchResults, (REQUEST,used, query_map), kw) __call__=searchResults ## this stuff is so the find machinery works meta_types=() # Sub-object types that are specific to this object def all_meta_types(self): pmt=() if hasattr(self, '_product_meta_types'): pmt=self._product_meta_types elif hasattr(self, 'aq_acquire'): try: pmt=self.aq_acquire('_product_meta_types') except: pass return self.meta_types+Products.meta_types+pmt def valid_roles(self): "Return list of valid roles" obj=self dict={} dup =dict.has_key x=0 while x < 100: if hasattr(obj, '__ac_roles__'): roles=obj.__ac_roles__ for role in roles: if not dup(role): dict[role]=1 if not hasattr(obj, 'aq_parent'): break obj=obj.aq_parent x=x+1 roles=dict.keys() roles.sort() return roles def resolve_url(self, path, REQUEST): """ Attempt to resolve a url into an object in the Zope namespace. The url may be absolute or a catalog path style url. If no object is found, None is returned. No exceptions are raised. """ script=REQUEST.script if string.find(path, script) != 0: path='%s/%s' % (script, path) try: return REQUEST.resolve_url(path) except: return None Globals.default__class_init__(ZCatalog) Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/ZCatalog.txt100755 1007 1403 42712 6756115345 24214 0ustar petrillipetrilliZCatalog Tutorial This document provides a tutorial for 'ZCatalog', the new search engine machinery in Zope. The audience for the document is content managers. Contents o What is it? What's it for? Why's it so cool? o Installing ZCatalog o ZCatalog Objects o Example using ZCatalog o Creating Search Forms And Result Reports o Using ZCatalog In A Zope Site o ZCatalog vs. Catalog What is it? What's it for? Why's it so cool? The 'ZCatalog' provides powerful indexing and searching on a Zope database using a Zope management interface. A 'ZCatalog' is a Zope object that can be added to a Folder, managed through the web, and extended in many ways. The 'ZCatalog' is a very significant project, providing a number of compelling features: o **Searches are fast**. The data structures used by the index provide extremely quick searches without consuming much memory. o **Searches are robust**. The 'ZCatalog' supports boolean search terms, proximity searches, synonyms and stopwords. o **Indexing is wildly flexible**. A 'ZCatalog' can catalog custom properties and track unique values. Since 'ZCatalog' catalogs objects instead of file handles, you can index any content that can have a Python object wrapped around it. This also lets objects participate in how they are cataloged, e.g. de-HTML-ifying contents or extracting PDF properties. o **Usable outside of Zope**. The software is broken into a Python 'Catalog' which wrapped by a 'ZCatalog'. The Python 'Catalog' can be used in any Python program; all it requires is the Z object database and the indexing machinery from Zope. o **Transactional**. An indexing operation is part of a Zope transaction. If something goes wrong after content is indexed, the index is restored to its previous condition. This also means that Undo will restore an index to its previous condition. Finally, a 'ZCatalog' can be altered privately in a Version, meaning no one else can see the changes to the index. o **Cache-friendly**. The index is internally broken into different "buckets", with each bucket being a separate Zope database object. Thus, only the part of the index that is needed is loaded into memory. Alternatively, an un-needed part of the index can be removed from memory. o **Results are lazy**. A search that returns a tremendous number of matches won't return a large result set. Only the part of the results, such as the second batch of twenty, are returned. The 'ZCatalog' is a free, Open Source part of the Zope software repository and thus is covered under the same license as Zope. It is being developed in conjunction with the Zope Portal Toolkit effort. However, the 'ZCatalog' product is managed as its own module in CVS. Installing ZCatalog 'ZCatalog' can be downloaded from the Zope download area and is also a module in the public CVS for Zope. Untar it while in the root directory of your Zope installation:: $ cd Zope-2.0.0a3-src/ $ tar xzf ../ZCatalog-x.x.tgz Windows users can use WinZip or a similar utility to accomplish the same thing. Also, Zope 2.0.0a3 does not have the latest version of UnIndex and UnTextIndex which fix a couple of bugs in the alpha 3 versions. The latest CVS of the SearchIndex packages *must* be used. Remember, you have to restart your Zope server before you will see 'ZCatalog'. ZCatalog Objects A 'ZCatalog' performs two activities: indexing information and performing searches. Most the work is done in the first step, which is getting objects into the index. This is done in two ways. First, if your objects are ZCatalog-aware they automatically update the index when they are added, edited or directly deleted. A ZCatalog-aware object is one that is an instance of a 'Z Class' that informs the 'ZCatalog' of changes. *Directly deleted* means the object was deleted from a Folder, not the deletion of a containing Folder. The second way that site contents get updated is by "finding" information "into" the 'ZCatalog'. An operation based on Zope's Find view traverses Folders looking for objects matching the criterion. The objects are then registered with the Catalog. Objects in the index but no longer in the site are removed from the Catalog. Either way -- automatically updating or walking the Folders -- 'ZCatalog' indexes the objects it finds. The 'ZCatalog' is set up to look for properties, each of which are added to the index. There are two kinds of indexes, called FieldIndex and TextIndex. FieldIndex indexes treat data atomically. The entire contents of a FieldIndex-indexed property is treated as a unit. With a TextIndex index, it is broken into words which are indexed individually. A TextIndex is also known as *full-text index*. Note that the 'ZCatalog' doesn't track ZCatalog-unaware objects after it has indexed them. This means that the 'ZCatalog' must reindex its objects occasionally when the objects have been changed. Out of date indexes can be prevented by inheriting from a ZCatalog-aware class which can tell the 'ZCatalog' to reindex it whenever a change is made. Just such a class will be included with the Portal toolkit. ZCatalogs are "searchable objects", meaning they cooperate with Z Search Interfaces documented in Z SQL Methods. Creating a search form for a 'ZCatalog' is a simple matter of adding a Z Search Interface from the management screen and filling in a form. ZCatalogs can also be queried directly from DTML, as shown in the example below. Example using Z Classes The first example shows how to give your Zope site a long-desired feature: full text-searches of your content. The example assumes you already have a number of DTML Methods/Documents to catalog. o Install 'ZCatalog' as instructed above o In the root folder of your Zope server, add a 'ZCatalog'. o Type in the id 'catalog' and hit 'Add'. You now have a brand new 'ZCatalog' named 'catalog' in your root folder. o Click on it. Now you are looking at the 'ZCatalog' 'Contents' view. It says the catalog is empty. We'll catalog some objects in a moment, but first we have to tell it what portions of objects we are specifically interested in. o Click on 'Indexes'. This management view is where the attributes to be indexed are defined. o In the 'Add index' field, type 'raw'. o Click 'Add'. Now that the indexes are defined, a set of objects can be selected for cataloging. o Click on 'Find items to ZCatalog'. For this example, we are only interested in DTML Documents and Methods. o Deselect 'All type'. o Select 'DTML Method' and 'DTML Document'. o Click 'Find'. ZCatalog will report how many items it found, and then present an interface for excluding specific objects. o Click 'Catalog Items'. Great, now that the catalog is stocked, we can create a user interface to it. o Return to the root folder's management view. o Add a 'Z Search Interface'. 'ZCatalog' participates in the Zope Search architecture. You simply have to fill in this form, and a basic user interface will be created. o Select 'catalog' in the list beside 'Select one or more searchable objects'. o Beside 'Report Id', type 'report'. o Beside 'Search Input Id', type 'search'. 'report' and 'search' are the Ids of two DTML Methods which will be created in your root folder. o Click 'Add'. Congratulations, if all has gone well, you can now find references to any word in your DTML pages. Try it by viewing 'search'. Type a common word in the 'Raw' field, and you should be presented with a list of hits. However, none of the results returned can be clicked on. To fix this, go to the management view of 'report'. 'report' is called by 'search' to display the results from 'catalog'. 'report' is just a simple '' loop with a few refinements. 'catalog' knows which results to return by looking at the REQUEST variable, which contains the input from the 'search' form. o In the source of 'report', find the following line:: o Replace it with this::     "> This is a little confusing at first. Keep in mind that ZCatalog does not return a list of your database objects. What it returns are actually fairly unintelligent instances of a Record subclass. These record objects contain copies of data from attributes of catalog objects. The 'ZCatalog' 'MetaData Table' view defines which attributes are copied. (By default, these record objects are just SLIGHTLY more intelligent than a raw tuple. 'Catalog' can be told to use a custom, intelligent class for results. Please see the 'Catalog' __init__ method in 'lib/python/Products/ZCatalog/Catalog.py' for more information.) Fortunately, ZCatalog provides a utility function for going from result objects to the object's path. It is called, aptly enough, 'getpath'. 'getpath' expects to be passed the unique integer identifier of the cataloged object. Results store that id as 'data_record_id_'. Commit this change, and perform another search. Now the title can be clicked on to take you to the full page. Example cataloging custom objects As if full-text searches of your entire site weren't good enough, ZCatalog can also catalog Z Classes, Products, and in fact any Python object you can put in a ZODB. Here is an example using a Z Class, but the principles apply to any kind of object. First, we're going to need something to catalog. Follow the 'Z Class' tutorial to create the CD 'Z Class'. Back? Good. o Create a folder, 'CDs', and create a number of instances of the CD Z Class in it. 'cd1' through 'cd5' should be plenty. Remember to fill each of them in from their Properties view. Now we want to create a searchable catalog of CDs. o Go to the 'CDs' folder and create a 'ZCatalog' with an ID 'cd_cat'. o Click on the objects Indexes view. This screen shows that, by default, 'ZCatalog' is interested in an object's 'id','title', 'meta_type', and 'bobobase_modification_time'. You will almost always want to index additional information. In this case, we would also like to index the artist and description of CDs. o Type 'artist' into the 'Add Index' field. For the sake of example, we're going to use a FieldIndex index for artist. This will give us the option of putting an HTML SELECT box for artists on the search form. o Select FieldIndex from the Index type drop down, and click 'Add'. o Also add an index for 'description', but leave TextIndex selected. This will allow us to search for individual words within the description. o Click on 'MetaData Table'. This is where we tell the 'ZCatalog' what attributes of cataloged objects to cache. These cached values are available from search results without having to look up the actual indexed object. The tradeoff for the speed is extra memory, as information from the content is duplicated in the 'ZCatalog'. You will probably want to keep the schema light-weight, so we're not going to add 'description' to it. Type 'artist' in the 'Add column' field and click 'Add'. o Click on the 'Find Items to Catalog' view. This is the interface you use to tell the 'ZCatalog' which items to index. Right now, beside 'Find objects of type:', 'All types' is selected. o Deselect 'All types'. O Scroll down and select CD. You could use the rest of the form to be more specific, but since we want to catalog all the CDs, o Click 'Find'. 'ZCatalog' will report 'Found 5 items.' It is now giving you an opportunity to exclude some of the matched items from the index. Again, we want all of them, so, o Click 'Catalog Items'. You should at this point see a list of the indexed objects. Also of note is the 'Update Catalog' button. You have to use it whenever you want your 'ZCatalog' to notice changes you've made to the objects it's indexed. Creating Search Forms And Result Reports This catalog isn't much good without some way of querying it. o Go back to your 'CDs' folder's management screen and add a Z Search Interface. The search add form will automatically detect your cd_cat 'ZCatalog' and offer it as a searchable document. Make sure it is selected. o Fill in 'cd_report' for 'Report ID' and 'cd_search' for 'Search Input ID'. Those are the ids of two DTML methods that will be generated in the 'CDs' folder. o Click 'Add'. o View the 'cd_search' Catalog (at, for example, http://localhost:9673/CDs/cd_search). You will see a basic search interface, with fields for searching on 'title', modification date, 'id', 'artist', 'meta type' and 'description'. If you fill in one more more of the fields and click 'Submit Query', cd_report will be displayed. It is passed the search criteria and uses it to get a list from cd_cat to iterate over. It is merely displaying the information from the ZCatalog's MetaData table, but of course it can be enriched. Try a few more searches. You'll find that you can type any single word from the title or description and get a match, but for artist you must type the exact string. That's because artist was indexed as a FieldIndex, which gives us an opportunity to present a more convenient interface. Go back to the 'cd_search' management interface, and change it's source to look like this:: <!--#var standard_html_header--> <form action="cd_report" method="get"> <h2><!--#var document_title--></h2> Enter query parameters:<br><table> <tr><th>Title</th> <td><input name="title" width=30 value=""></td></tr> <tr><th>Artist</th> <td> <select name="artist"> <option value="">All</option> <!--#in expr="cd_cat.uniqueValuesFor('artist')"--> <option value="<!--#var sequence-item-->"> <!--#var sequence-item--> </option> <!--#/in--> </select> </td> </tr> <tr><th>Description</th> <td><input name="description" width=30 value=""></td></tr> <tr><td colspan=2 align=center> <input type="SUBMIT" name="SUBMIT" value="Submit Query"> </td></tr> </table> </form> <!--#var standard_html_footer--> This is a search form somewhat more appropriate for the CD 'Z Class'. Unrelated fields have been removed, and the 'artist' field has been changed to a drop-down menu. Let's augment the output of 'cd_report' to make the title a link to the actual CD object. Taking a look at 'cd_report', note that the search results are obtained with a simple '' tag. The search criteria is automatically obtained by the 'ZCatalog' from the form input. The line we're interested in is this one:: Change it to read:: "> Now, assuming you have added the index_html document template to your CD 'Z Class', clicking on a search result will take you to the CD's detailed display. Using 'ZCatalog' In A Zope Site The 'ZCatalog' provides high-speed access to what is on your site. Thus, the 'ZCatalog' can be used to re-engineer the way your site is laid out. For instance, a Slashdot-style presentation is simple. Just insert some DTML that asks the 'ZCatalog' for recent items. Alternatively, a Site Map is nothing more than presenting the contents of the catalog. A page with tree-based browsing of software packages by category is also easy. Perhaps you'd like to provide a link that lists all the packages the current user has authored. Thus, the 'ZCatalog' isn't just about searching. It can be used as the DTML-scriptable engine for browsing a site as well. Since the 'ZCatalog' is a normal Zope folderish object, you can also create DTML Methods inside it to present the catalog contents. For instance, perhaps you'd like to dump the contents of the site as an RDF stream, or do content syndication with RSS. These are just DTML Methods that change the 'Content-Type:' and send back XML. All without actually waking up any of the content objects in the site. ZCatalog vs. Catalog The real star of this package is the 'Catalog' module. All the heavy lifting is done by 'Catalog'. 'ZCatalog' is basically a Zope-aware wrapper around Catalog, which can be used on it's own outside the Zope framework. The only requirement is that you are using ZODB as your object store. Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/__init__.py100644 1007 1403 10231 6747644120 24042 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """ZCatalog product""" import ZCatalog, Catalog, CatalogAwareness def initialize(context): context.registerClass( ZCatalog.ZCatalog, permission='Add ZCatalogs', constructors=(ZCatalog.manage_addZCatalogForm, ZCatalog.manage_addZCatalog), icon='www/ZCatalog.gif', ) context.registerBaseClass(ZCatalog.ZCatalog) context.registerBaseClass(CatalogAwareness.CatalogAware) Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/addZCatalog.dtml100755 1007 1403 1172 6733715127 24760 0ustar petrillipetrilli Add Catalog

    Add Catalog

    Id
    Title

    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/catalogAddRowForm.dtml100644 1007 1403 272 6733715127 26117 0ustar petrillipetrilli View Catalog Records
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/catalogFind.dtml100755 1007 1403 4321 6761246473 25021 0ustar petrillipetrilli Advanced Find

    Use this form to locate objects to be cataloged.

    Find objects of type:
    with ids:
    containing:
    expr:
    modified:
    where the roles:
    have permission:
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/catalogIndexes.dtml100644 1007 1403 2404 6770245124 25525 0ustar petrillipetrilli View Catalog Records

    This list defines what indexes the Catalog will contain. When objects get cataloged, the values of any attributes they may have which match an index in this list will get indexed. Indexes come in two flavors, TextIndexes and FieldIndexes. TextIndexes break text up into individual words, and are often refered to as 'full text indexes'. Field indexes treat the value of an objects attribute atomically, and can be used, for example, to track only a certain subset of object values, such as 'meta_type'.



    Add Index:
    of Index Type:
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/catalogSchema.dtml100644 1007 1403 3130 6761246473 25333 0ustar petrillipetrilli View Catalog Records

    This list defines what per object meta data the Catalog will store. When objects get cataloged, the values of any attributes they may have which match a name in this list will get stored in a table in the Catalog. The Catalog then uses this information to create result objects that are returned whenever the catalog is searched. It is important to understand that when the Catalog is searched, it returns a list of result objects, not the cataloged objects themselves, so if you want to use the value of an object's attribute in the result of a search, that attribute must be in this list

    It is generally a good idea to keep this list lightweight. It is useful, for example, to keep the 'summary' meta data of a text document (like the first 200 characters) but not the text content in it's entirety (it is useful in this example to index the text contents, which is configured in the Indexes View tab). This way, the summary data may be shown in the search results.


    column from Meta Data table.

    Add column to the Meta Data table:
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/catalogStatus.dtml100644 1007 1403 4164 6770245124 25416 0ustar petrillipetrilli View Catalog Records

    Subtransactions allow Zope to commit small parts of a transaction over a period of time instead of all at once. For ZCatalog, this means using subtransactions can signficantly reduce the memory requirements needed to index huge amounts of text all at once.

    If enabled, subtransactions will reduce the memory requirements of ZCatalog, but at the expense of speed. If you choose to enable subtransactions, you can adjust how often ZCatalog commits a subtransactions by adjusting the threshold below.

    If you are using ZCatalog and ZSQL Methods in the same transaction, you must disable subtransactions, they are not compatible with ZSQL Methods.

    Subtransactions are Enabled Disabled


    The Subtransaction threshold is the number of words the catalog will index before it commits a subtransaction. If this number is low, the Catalog will take much to index but consume much less memory. If this number is higher, the Catalog will index quickly but consume much more memory.

    Subtransaction threshold:

    Index Status

    • object are indexed in
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/catalogView.dtml100755 1007 1403 5013 6763044457 25052 0ustar petrillipetrilli View Catalog Records

    Updating the catalog will update all catalog records and remove invalid records. Clearing the catalog will remove all entries. You can also remove or update individual catalog records.

    contains record(s).

    [Previous entries] [Next entries]

    " /manage_main"> ()
    [Previous entries] [Next entries]

    There are no objects in the Catalog.

     Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/editCatalogerForm.dtml100644 1007 1403 662 6761246473 26162 0ustar petrillipetrilli View Catalog Records

    This element controls which Catalog this object will try index and unindex itself to.

    Edit default Catalog:
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZCatalog/version.txt100644 1007 1403 16 6750113205 24064 0ustar petrillipetrilliCatalog-1-0-0 Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/ 40755 1007 1403 0 6772126760 21663 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/DABase.py100644 1007 1403 21751 6712130474 23426 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Database Connection $Id: DABase.py,v 1.8 1999/04/29 19:21:32 jim Exp $''' __version__='$Revision: 1.8 $'[11:-2] from db import manage_DataSources import Shared.DC.ZRDB.Connection, sys from Globals import HTMLFile from ExtensionClass import Base import Acquisition class Connection(Shared.DC.ZRDB.Connection.Connection): _isAnSQLConnection=1 manage_options=Shared.DC.ZRDB.Connection.Connection.manage_options+( {'label': 'Browse', 'action':'manage_browse'}, # {'label': 'Design', 'action':'manage_tables'}, ) manage_tables=HTMLFile('tables',globals()) manage_browse=HTMLFile('browse',globals()) info=None def tpValues(self): #if hasattr(self, '_v_tpValues'): return self._v_tpValues r=[] # self._v_tables=tables=TableBrowserCollection() #tables=tables.__dict__ c=self._v_database_connection try: for d in c.tables(rdb=0): try: name=d['TABLE_NAME'] b=TableBrowser() b.__name__=name b._d=d b._c=c # b._columns=c.columns(name) try: b.icon=table_icons[d['TABLE_TYPE']] except: pass r.append(b) # tables[name]=b except: # print d['TABLE_NAME'], sys.exc_type, sys.exc_value pass finally: pass #print sys.exc_type, sys.exc_value #self._v_tpValues=r return r def __getitem__(self, name): if name=='tableNamed': if not hasattr(self, '_v_tables'): self.tpValues() return self._v_tables.__of__(self) raise KeyError, name def manage_wizard(self, tables): " " def manage_join(self, tables, select_cols, join_cols, REQUEST=None): """Create an SQL join""" def manage_insert(self, table, cols, REQUEST=None): """Create an SQL insert""" def manage_update(self, table, keys, cols, REQUEST=None): """Create an SQL update""" class TableBrowserCollection(Acquisition.Implicit): "Helper class for accessing tables via URLs" class Browser(Base): def __getattr__(self, name): try: return self._d[name] except KeyError: raise AttributeError, name class TableBrowser(Browser, Acquisition.Implicit): icon='what' Description=check='' info=HTMLFile('table_info',globals()) menu=HTMLFile('table_menu',globals()) def tpValues(self): r=[] tname=self.__name__ for d in self._c.columns(tname): b=ColumnBrowser() b._d=d try: b.icon=field_icons[d['Type']] except: pass b.TABLE_NAME=tname r.append(b) return r def tpId(self): return self._d['TABLE_NAME'] def tpURL(self): return "Table/%s" % self._d['TABLE_NAME'] def Name(self): return self._d['TABLE_NAME'] def Type(self): return self._d['TABLE_TYPE'] manage_designInput=HTMLFile('designInput',globals()) def manage_buildInput(self, id, source, default, REQUEST=None): "Create a database method for an input form" args=[] values=[] names=[] columns=self._columns for i in range(len(source)): s=source[i] if s=='Null': continue c=columns[i] d=default[i] t=c['Type'] n=c['Name'] names.append(n) if s=='Argument': values.append("'" % (n, vartype(t))) a='%s%s' % (n, boboType(t)) if d: a="%s=%s" % (a,d) args.append(a) elif s=='Property': values.append("'" % (n, vartype(t))) else: if isStringType(t): if find(d,"\'") >= 0: d=join(split(d,"\'"),"''") values.append("'%s'" % d) elif d: values.append(str(d)) else: raise ValueError, ( 'no default was given for %s' % n) class ColumnBrowser(Browser): icon='field' def check(self): return ('\t' % (self.TABLE_NAME, self._d['Name'])) def tpId(self): return self._d['Name'] def tpURL(self): return "Column/%s" % self._d['Name'] def Description(self): d=self._d if d['Scale']: return " %(Type)s(%(Precision)s,%(Scale)s) %(Nullable)s" % d else: return " %(Type)s(%(Precision)s) %(Nullable)s" % d table_icons={ 'TABLE': 'table', 'VIEW':'view', 'SYSTEM_TABLE': 'stable', } field_icons={ 'BIGINT': 'int', 'BINARY': 'bin', 'BIT': 'bin', 'CHAR': 'text', 'DATE': 'date', 'DECIMAL': 'float', 'DOUBLE': 'float', 'FLOAT': 'float', 'INTEGER': 'int', 'LONGVARBINARY': 'bin', 'LONGVARCHAR': 'text', 'NUMERIC': 'float', 'REAL': 'float', 'SMALLINT': 'int', 'TIME': 'time', 'TIMESTAMP': 'datetime', 'TINYINT': 'int', 'VARBINARY': 'bin', 'VARCHAR': 'text', } Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/DA.py100644 1007 1403 14671 6745641134 22644 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## database_type='Gadfly' __doc__='''%s Database Connection $Id: DA.py,v 1.8 1999/07/22 16:10:04 jim Exp $''' % database_type __version__='$Revision: 1.8 $'[11:-2] from db import DB, manage_DataSources import sys, DABase, Globals import Shared.DC.ZRDB.Connection, ThreadLock _Connection=Shared.DC.ZRDB.Connection.Connection _connections={} _connections_lock=ThreadLock.allocate_lock() data_sources=manage_DataSources addConnectionForm=Globals.HTMLFile('connectionAdd',globals()) def manage_addZGadflyConnection( self, id, title, connection, check=None, REQUEST=None): """Add a DB connection to a folder""" self._setObject(id, Connection( id, title, connection, check)) if REQUEST is not None: return self.manage_main(self,REQUEST) return self.manage_main(self,REQUEST) class Connection(DABase.Connection): " " database_type=database_type id='%s_database_connection' % database_type meta_type=title='Z %s Database Connection' % database_type icon='misc_/Z%sDA/conn' % database_type manage_properties=Globals.HTMLFile('connectionEdit', globals(), data_sources=data_sources) def connected(self): if hasattr(self, '_v_database_connection'): return self._v_database_connection.opened return '' def title_and_id(self): s=_Connection.inheritedAttribute('title_and_id')(self) if (hasattr(self, '_v_database_connection') and self._v_database_connection.opened): s="%s, which is connected" % s else: s="%s, which is not connected" % s return s def title_or_id(self): s=_Connection.inheritedAttribute('title_and_id')(self) if (hasattr(self, '_v_database_connection') and self._v_database_connection.opened): s="%s (connected)" % s else: s="%s ( not connected)" % s return s def connect(self,s): _connections_lock.acquire() try: c=_connections if c.has_key(s): c=self._v_database_connection=c[s] if not c.opened: c.open() return self try: try: self._v_database_connection=c[s]=DB(s) except: t, v, tb = sys.exc_info() raise 'BadRequest', ( 'Invalid connection string: ' '%s
    \n' '\n' % (s,t,v)), tb finally: tb=None return self finally: _connections_lock.release() Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/ 40755 1007 1403 0 6772126760 23131 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/COPYRIGHT100644 1007 1403 2553 6747630565 24533 0ustar petrillipetrilli The following copyright is modified from the python copyright. Copyright Notice ---------------- The kjParsing source is copyrighted, but you can freely use and copy it as long as you don't change or remove the copyright: Copyright Aaron Robert Watters, 1994 All Rights Reserved Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appears in all copies and that both that copyright notice and this permission notice appear in supporting documentation. AARON ROBERT WATTERS DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL AARON ROBERT WATTERS BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. Signature --------- Aaron Robert Watters Department of Computer and Information Sciences New Jersey Institute of Technology University Heights Newark, NJ 07102 phone (201)596-2666 fax (201)596-5777 home phone (908)545-3367 email: aaron@vienna.njit.edu Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/DLispShort.py100644 1007 1403 11700 6747630565 25657 0ustar petrillipetrilli# Grammar generation # for lisp lists with strings, ints, vars, print, and setq # set this variable to regenerate the grammar on each load REGENERATEONLOAD = 1 import string GRAMMARSTRING =""" Value :: ## indicates Value is the root nonterminal for the grammar @R SetqRule :: Value >> ( setq var Value ) @R ListRule :: Value >> ( ListTail @R TailFull :: ListTail >> Value ListTail @R TailEmpty :: ListTail >> ) @R Varrule :: Value >> var @R Intrule :: Value >> int @R Strrule :: Value >> str @R PrintRule :: Value >> ( print Value ) """ COMPILEDFILENAME = "TESTLispG.py" MARSHALLEDFILENAME = "TESTLispG.mar" LISPCOMMENTREGEX = ";.*" INTREGEX = "["+string.digits+"]+" STRREGEX = '"[^\n"]*"' VARREGEX = "["+string.letters+"]["+string.letters+string.digits+"]*" ### declare interpretation functions and regex's for terminals def intInterp( str ): return string.atoi(str) def stripQuotes( str ): return str[1:len(str)-1] def echo(string): return string def DeclareTerminals(Grammar): Grammar.Addterm("int", INTREGEX, intInterp) Grammar.Addterm("str", STRREGEX, stripQuotes) Grammar.Addterm("var", VARREGEX, echo) ### declare the rule reduction interpretation functions. def EchoValue( list, Context ): return list[0] def VarValue( list, Context ): varName = list[0] if Context.has_key(varName): return Context[varName] else: raise NameError, "no such lisp variable in context "+varName def NilTail( list, Context ): return [] def AddToList( list, Context ): return [ list[0] ] + list[1] def MakeList( list, Context ): return list[1] def DoSetq( list, Context): Context[ list[2] ] = list[3] return list[3] def DoPrint( list, Context ): print list[2] return list[2] def BindRules(Grammar): Grammar.Bind( "Intrule", EchoValue ) Grammar.Bind( "Strrule", EchoValue ) Grammar.Bind( "Varrule", VarValue ) Grammar.Bind( "TailEmpty", NilTail ) Grammar.Bind( "TailFull", AddToList ) Grammar.Bind( "ListRule", MakeList ) Grammar.Bind( "SetqRule", DoSetq ) Grammar.Bind( "PrintRule", DoPrint ) # This function generates the grammar and dumps it to a file. def GrammarBuild(): import kjParseBuild LispG = kjParseBuild.NullCGrammar() LispG.SetCaseSensitivity(0) # grammar is not case sensitive for keywords DeclareTerminals(LispG) LispG.Keywords("setq print") LispG.punct("().") LispG.Nonterms("Value ListTail") LispG.comments([LISPCOMMENTREGEX]) LispG.Declarerules(GRAMMARSTRING) LispG.Compile() print "dumping as python to "+COMPILEDFILENAME outfile = open(COMPILEDFILENAME, "w") LispG.Reconstruct("LispG",outfile,"GRAMMAR") outfile.close() print "dumping as binary to "+MARSHALLEDFILENAME outfile = open(MARSHALLEDFILENAME, "w") LispG.MarshalDump(outfile) outfile.close() BindRules(LispG) return LispG # this function initializes the compiled grammar from the generated file. def LoadLispG(): import TESTLispG # reload to make sure we get the most recent version! # (only needed when debugging the grammar). reload(TESTLispG) LispG = TESTLispG.GRAMMAR() DeclareTerminals(LispG) BindRules(LispG) return LispG def unMarshalLispG(): import kjParser infile = open(MARSHALLEDFILENAME, "r") LispG = kjParser.UnMarshalGram(infile) infile.close() DeclareTerminals(LispG) BindRules(LispG) return LispG ########## test the grammar generation if REGENERATEONLOAD: print "(re)generating the LispG grammar in file TESTLispG.py" Dummy = GrammarBuild() print "(re)generation done." print "loading grammar as python" LispG = LoadLispG() ### declare an initial context, and do some tests. Context = { 'x':3 } test1 = LispG.DoParse1( '()', Context) test2 = LispG.DoParse1( '(123)', Context) test3 = LispG.DoParse1( '(x)', Context) test4 = LispG.DoParse1( '" a string "', Context) test5 = LispG.DoParse1( '(setq y (1 2 3) )', Context ) test6 = LispG.DoParse1( '(SeTq x ("a string" "another" 0))', Context ) test7str = """ ; this is a lisp comment (setq abc (("a" x) ("b" (setq d 12)) ("c" y) ) ; another lisp comment ) """ test7 = LispG.DoParse1( test7str, Context) test8 = LispG.DoParse1( '(print (1 x d))', Context) print "unmarshalling the grammar" LispG2 = unMarshalLispG() ### declare an initial context, and do some tests. Context = { 'x':3 } test1 = LispG2.DoParse1( '()', Context) test2 = LispG2.DoParse1( '(123)', Context) test3 = LispG2.DoParse1( '(x)', Context) test4 = LispG2.DoParse1( '" a string "', Context) test5 = LispG2.DoParse1( '(setq y (1 2 3) )', Context ) test6 = LispG2.DoParse1( '(SeTq x ("a string" "another" 0))', Context ) test7str = """ ; this is a lisp comment (setq abc (("a" x) ("b" (setq d 12)) ("c" y) ) ; another lisp comment ) """ test7 = LispG2.DoParse1( test7str, Context) test8 = LispG2.DoParse1( '(print (1 x d))', Context) Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/DumbLispGen.py100644 1007 1403 15457 6747630565 26012 0ustar petrillipetrilli # # test for kjParseBuild module automatic parser generation # # lisp lists with strings, ints, vars, and setq import string ### The string representation for the grammar. ### Since this is used only by GrammarBuild() ### it could be put in a separate file with GrammarBuild() ### to save space/load time after Grammar compilation. ### GRAMMARSTRING =""" Value :: ## indicates Value is the root nonterminal for the grammar @R SetqRule :: Value >> ( setq var Value ) @R ListRule :: Value >> ( ListTail @R TailFull :: ListTail >> Value ListTail @R TailEmpty :: ListTail >> ) @R Varrule :: Value >> var @R Intrule :: Value >> int @R Strrule :: Value >> str """ ### the name of the file in which to create the compiled ### grammar declarations COMPILEDFILENAME = "TESTLispG2.py" ### declare comment form(s) as regular expressions LISPCOMMENTREGEX = ";.*" ### declare regular expression string constants for terminals #integer terminal::::::: INTREGEX = "["+string.digits+"]+" #string terminal:::::::: STRREGEX = '"[^\n"]*"' #var terminal:::::::: VARREGEX = "["+string.letters+"]["+string.letters+string.digits+"]*" ### declare interpretation functions for terminals # int interpretation function: translates string to int: # Could use string.atoi without the extra level of indirection # but for demo purposes here it is. # def intInterp( str ): return string.atoi(str) # interpretation function for strings strips off the surrounding quotes. def stripQuotes( str ): if len(str)<2: TypeError, "string too short?" return str[1:len(str)-1] # interpretation function for vars just returns the recognized string def echo(string): return string # This function declares the nonterminals both in the # "grammar generation phase" and in loading the compiled # grammar after generation # def DeclareTerminals(Grammar): Grammar.Addterm("int", INTREGEX, intInterp) Grammar.Addterm("str", STRREGEX, stripQuotes) Grammar.Addterm("var", VARREGEX, echo) ### declare the rule reduction interpretation functions. # EchoValue() serves for Intrule and Strrule, since # we just want to echo the value returned by the # respective terminal interpretation functions. # # Parser delivers list of form [ interpreted_value ] def EchoValue( list, Context ): if len(list)!=1: raise TypeError, "this shouldn't happen! (1)" return list[0] # for Varrule interpreter must try to look up the value # in the Context dictionary # # Parser delivers list of form [ var_name ] def VarValue( list, Context ): if len(list)!=1: raise TypeError, "Huh? (2)" varName = list[0] if Context.has_key(varName): return Context[varName] else: raise NameError, "no such lisp variable in context "+varName # for an empty tail, return the empty list # # Parser delivers list of form [")"] def NilTail( list, Context ): if len(list) != 1 or list[0] != ")": return TypeError, "Bad reduction?" return [] # For a full tail, add the new element to the front of the list # # Parser delivers list of form [Value, TailValue] def AddToList( list, Context ): if len(list) !=2: return TypeError, "Bad reduction?" return [ list[0] ] + list[1] # For a list, simply return the list determined by the tail # # Parser delivers list of form ["(", TailValue ] def MakeList( list, Context ): if len(list)!=2 or list[0]!="(": raise TypeError, "Bad reduction? (3)" return list[1] # For a setq, declare a new variable in the Context dictionary # # Parser delivers list of form # ["(", "setq", varName, Value, ")"] def DoSetq( list, Context): if len(list) != 5\ or list[0] != "("\ or list[1] != "setq"\ or list[4] != ")": print list raise TypeError, "Bad reduction? (4)" VarName = list[2] if type(VarName) != type(''): raise TypeError, "Bad var name? (5)" Value = list[3] # add or set the variable in the Context dictionary Context[ VarName ] = Value return Value # This function Binds the named rules of the Grammar string to their # interpretation functions in a Grammar. # def BindRules(Grammar): Grammar.Bind( "Intrule", EchoValue ) Grammar.Bind( "Strrule", EchoValue ) Grammar.Bind( "Varrule", VarValue ) Grammar.Bind( "TailEmpty", NilTail ) Grammar.Bind( "TailFull", AddToList ) Grammar.Bind( "ListRule", MakeList ) Grammar.Bind( "SetqRule", DoSetq ) # This function generates the grammar and dumps it to a file. # Since it will be used only once (after debugging), # it probably should be put in another file save memory/load-time. # # the result returned is a Grammar Object that can be used # for testing/debugging purposes. # # (maybe this should be made into a generic function?) def GrammarBuild(): import kjParseBuild # initialize a Null compilable grammar to define LispG = kjParseBuild.NullCGrammar() # declare terminals for the grammar DeclareTerminals(LispG) # declare the keywords for the grammar # defun is not used, included here for demo purposes only LispG.Keywords("setq defun") # Declare punctuations # dot is not used here LispG.punct("().") # Declare Nonterms LispG.Nonterms("Value ListTail") # Declare comment forms LispG.comments([LISPCOMMENTREGEX]) # Declare rules LispG.Declarerules(GRAMMARSTRING) # Compile the grammar LispG.Compile() # Write the grammar to a file except for # the function bindings (which must be rebound) outfile = open(COMPILEDFILENAME, "w") LispG.Reconstruct("LispG",outfile,"GRAMMAR") outfile.close() # for debugging purposes only, bind the rules # in the generated grammar BindRules(LispG) # return the generated Grammar return LispG # this function initializes the compiled grammar from # generated file. def LoadLispG(): import TESTLispG2 # make sure we have most recent version (during debugging) reload(TESTLispG2) # evaluate the grammar function from generated file LispG = TESTLispG2.GRAMMAR() # bind the semantics functions DeclareTerminals(LispG) BindRules(LispG) return LispG ########## test grammar generation # do generation Dummy = GrammarBuild() # load the grammar from the file as LispG LispG = LoadLispG() # declare an initial context, and do some tests. Context = { "x":3 } test1 = LispG.DoParse1( "()", Context) test2 = LispG.DoParse1( "(123)", Context) test3 = LispG.DoParse1( "(x)", Context) test4 = LispG.DoParse1( '" a string "', Context) test5 = LispG.DoParse1( "(setq y (1 2 3) )", Context ) test6 = LispG.DoParse1( '(setq x ("a string" "another" 0))', Context ) test7str = """ ; this is a lisp comment (setq abc (("a" x) ("b" (setq d 12)) ("c" y) ) ; another lisp comment ) """ test7 = LispG.DoParse1( test7str, Context) Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/SQLTESTG.py100644 1007 1403 4203 6747630566 25053 0ustar petrillipetrilli# this was used for debugging null productions (a nearly full sql grammar # is available on request). #set this to automatically rebuild the grammar. REBUILD = 1 MARSHALFILE = "SQLTEST.mar" SELECTRULES = """ ## highest level for select statement (not select for update) select-statement :: @R selectR :: select-statement >> SELECT from-clause where-clause group-by-clause having-clause ## generalized to allow null from clause eg: select 2+2 @R fromNull :: from-clause >> @R fromFull :: from-clause >> FROM @R whereNull :: where-clause >> @R whereFull :: where-clause >> WHERE @R groupNull :: group-by-clause >> @R groupFull :: group-by-clause >> GROUP BY @R havingNull :: having-clause >> @R havingFull :: having-clause >> HAVING @R unionNull :: union-clause >> @R unionFull :: union-clause >> UNION """ SELECTNONTERMS = """ select-statement all-distinct select-list table-reference-list where-clause group-by-clause having-clause union-clause maybe-order-by search-condition column-list maybe-all order-by-clause column-name from-clause """ # of these the following need resolution # (select-list) (table-reference-list) # (search-condition) order-by-clause (column-name) SELECTKEYWORDS = """ SELECT FROM WHERE GROUP BY HAVING UNION DISTINCT ALL AS """ # test generation of the grammar def BuildSQLG(): import kjParseBuild SQLG = kjParseBuild.NullCGrammar() SQLG.SetCaseSensitivity(0) SQLG.Keywords(SELECTKEYWORDS) SQLG.Nonterms(SELECTNONTERMS) # no comments yet SQLG.Declarerules(SELECTRULES) print "building" SQLG.Compile() print "marshaling" outfile = open( MARSHALFILE, "w") SQLG.MarshalDump(outfile) outfile.close() return SQLG # load function def LoadSQLG(): import kjParser print "unmarshalling" infile = open(MARSHALFILE, "r") SQLG = kjParser.UnMarshalGram(infile) infile.close() return SQLG #### for testing if REBUILD: SQLG0 = BuildSQLG() print " rebuilt SQLG0 as compilable grammar" SQLG = LoadSQLG() print " build SQLG as reloaded grammar"Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/__init__.py100644 1007 1403 533 6747630566 25326 0ustar petrillipetrilli# Package handling monstrocities import os import sqlwhere # Stuff filename into the namespace so that you don't have to hard code # this information ahead of time. Should be portable across platforms. sqlwhere.filename = filename = __path__[0] + os.sep + 'sql.mar' # Yank the previous namespace in so that nothing breaks from gadfly import * Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gadfly.html100644 1007 1403 54404 6747630566 25417 0ustar petrillipetrilli Gadfly: SQL Relational Database in Python, 1.0

    Gadfly: SQL Relational Database in Python, 1.0

    Gadfly is a simple relational database system implemented in Python based on the SQL Structured Query Language.

    The package requires installation before use, please see the section on installation.

    In addition to this general documentation, please see the Gadfly frequently asked questions

    What is it?

    Gadfly is a collection of python modules that provides relational database functionality entirely implemented in Python. It supports a subset of the intergalactic standard RDBMS Structured Query Language SQL.

    One of the most compelling aspects of Gadfly is that it runs whereever Python runs and supports client/server on any platform that supports the standard Python socket interface. Even the file formats used by Gadfly for storage are cross-platform -- a gadfly database directory can be moved from Win95 to Linux using a binary copying mechanism and gadfly will read and run the database.

    It supports persistent databases consisting of a collection of structured tables with indices, and a large subset of SQL for accessing and modifying those tables. It supports a log based recovery protocol which allows committed operations of a database to be recovered even if the database was not shut down in a proper manner (ie, in the event of a CPU or software crash, [but not in the event of a disk crash]). It also supports a TCP/IP Client/Server mode where remote clients can access a Gadfly database over a TCP/IP network (such as the Internet) subject to configurable security mechanisms.

    Because it lacks (at this time) true concurrency control, and file-system based indexing it is not appropriate for very large multiprocess transaction based systems.

    Since Gadfly depends intimately on the kwParsing package it is distributed as part of the kwParsing package, under the same generous copyright.

    Why?

    Gadfly allows Python programs a convenient way to store, retrieve and query tabular data without having to rely on any external database engine or package. That is, Gadfly provides a simple, easy, and relatively efficient in-memory relational database style engine for Python programs, complete with a notion of a "committed, recoverable transaction" and "aborts".

    Looking at the /etc directory in unix or at the Registry under win32 or at the buzzillions of configuration files one find sitting around file systems it becomes apparent that modern programs depend heavily on tabular data. Furthermore as memory prices continue to drop and inexpensive machines keep growing larger and larger memory capacity it is clear that more and more database-style work can be done on largish data sets in memory, and hence a simple in-memory SQL implementation like Gadfly may be useful for serious work.

    Gadfly uses relational style representations and the SQL query language primarily because these are widely understood and familiar to many programmers. SQL can't do everything, but it is successful in part because it can do a lot of important things easily and well. (Python can do everything else...)

    Use

    The main "gadfly.py" module attempts to faithfully adhere to Greg Stein's Python Database API, as discussed and certified by the Python DB-SIG. That said, some of the API that I didn't really understand is not implemented yet. Please look to gadfly.py to determine exactly what parts of the interface are implemented or stubbed.

    Concurrent database updates are not supported. The "databases" are currently designed to be written/modified by one process in isolation. Multiple processes can access a Gadfly database when accesses are arbitrated by a tcp/ip Gadfly server process.

    Creating a new database

    Unlike most Python/database-engine interfaces you must create a Gadfly database using Python (whereas with Oracle you'd use other tools, for example). To accomplish this use 

    import gadfly
connection = gadfly.gadfly()
    with no arguments and then startup a database using the startup method. 
    connection.startup("mydatabase", "mydirectory")
    Here "mydirectory" must be a directory which exists and which can be written to in order to store the database files. The startup will create some files in "mydirectory". This will have the effect of clobbering any existing Gadfly database called "mydatabase" in the directory "mydirectory". Gadfly will prevent you from starting up the same connection twice, however.

    Note that the first "import gadfly" reads in and initializes some rather large data structures used for parsing SQL, and thus may take longer than other module imports.

    Now with your new database you can create tables, populate them, and commit the result when you are happy. 

    cursor = connection.cursor()
cursor.execute("create table ph (nm varchar, ph varchar)")
cursor.execute("insert into ph(nm, ph) values ('arw', '3367')")
cursor.execute("select * from ph")
for x in cursor.fetchall(): 
    print x
# prints ('arw', '3367')
connection.commit()

    Reconnecting to an existing database

    Once a database exists you can reconnect to it as follows: 
    import gadfly
connection = gadfly.gadfly("mydatabase", "mydirectory")
    This will read in the database tables with the most recently committed values. The initialized database may now be queried and updated. 
    cursor = connection.cursor()
cursor.execute("update ph set nm='aaron' where nm='arw'")
cursor.execute("select * from ph")
for x in cursor.fetchall():
    print x
# prints ('aaron', '3367')
    If you do not wish to commit updates you may simply not execute a commit on the connection object (which writes out the tables). If you wish to restore the old values from the existing database use 
    connection.abort()
    Updates are only stored upon a connection.commit(). [Actually, if autocheckpoint is disabled, updates are only stored to table files on checkpoint -- see the documentation on the recovery mechanism.]

    Use 

    print cursor.pp()
    to "pretty print" the result of any evaluation (which might be None for a non-select).

    Features

    In this version all tables are read into memory upon "connecting" to the database and "touched" tables are written out upon checkpoint. Each table is represented as a separate file in the destination directory, and there is a "data definition" file as well (a list of data definition declarations). During active use a log file appears int the active directory as well, and if the process crashes this log file is used to recover committed operations.

    The SELECT statement

    At this point Gadfly supports quite a lot of the SQL semantics requested in the ODBC 2.0 specification. Please see the SQL constructs page for a more detailed presentation. SQL statements supported include the SELECT: 
    SELECT [DISTINCT|ALL] expressions or *
FROM tables
[WHERE condition]
[GROUP BY group-expressions]
[HAVING aggregate-condition]
[union-clause]
[ORDER BY columns]
    This statement is quite powerful. It reads intuitively as follows: 
    1) Make all combinations of rows from the tables (FROM line)
2) Eliminate those combinations not satisfying condition (WHERE line)
3) (if GROUP present) form aggregate groups that match on group-expressions
4) (if HAVING present) eliminate aggregate groups that don't satisfy
   the aggregate-condition.
5) compute the columns to keep (SELECT line).
6) (if union-clause present) combine (union, difference, intersect)
   the result with the result of another select statement.
7) if DISTINCT, throw out redundant entries.
8) (if ORDER present) order the result by the columns (ascending
   or descending as specified, with precedence as listed).
    The actual implementation in gadfly is much more optimal than the intuitive reading, particularly at steps 1 and 2 (which are combined via optimizing transformations and hash join algorithms).

    Conditions may include equalities, and inequalities of expressions. Conditions may also be combined using AND, OR, NOT. Expressions include column names, constants, and standard arithmetic operations over them.

    Embedded queries supported include subquery expressions, expr IN (subselect), quantified comparisons, and the EXISTS (subselect) predicate.

    Aggregate tests and computations can only be applied after the GROUPing and before the columns are selected (steps 3,4,5). Aggregate operations include COUNT(*), COUNT(expression), AVG(expression), SUM(expression), MAX(expression), MIN(expression), and the non-standard MEDIAN(expression). These may be applied to DISTINCT values (throwing out redundancies, as in COUNT(DISTINCT drinker). if no GROUPing is present the aggregate computations apply to the entire result after step 2.

    There is much more to know about the SELECT statement. The test suite (gftest.py) gives numerous examples of SELECT statements, including: 

    select * from frequents
   where drinker = 'norm'

select drinker from likes
   union
   select drinker from frequents

select drinker from likes
   except
   select drinker from frequents

select * from frequents
   where drinker>'norm' or drinker<'b'

select *
   from frequents as f, serves as s
   where f.bar = s.bar

select *
   from frequents as f, serves as s
   where f.bar = s.bar and
     not exists(
       select l.drinker, l.beer
       from likes l
       where l.drinker=f.drinker and s.beer=l.beer)

select sum(quantity), avg(quantity), count(*), sum(quantity)/count(quantity)
   from serves

select bar, sum(quantity), avg(quantity), count(*), sum(quantity)/count(quantity)
   from serves
   where beer<>'bud'
   group by bar
   having sum(quantity)>500 or count(*)>3
   order by 2 desc

select l.drinker, l.beer, count(*), sum(l.perday*f.perweek)
   from likes l, frequents f
   where l.drinker=f.drinker
   group by l.drinker, l.beer
   order by 4 desc, l.drinker, l.beer
    Please examine sqlgram.py for a precise definition of the supported syntax. Please find any of the 500 books on SQL for a description of the meaning of these constructs. Please inform me if any of them give the wrong result when executed in Gadfly!

    Table creation and "data types"

    Create tables using the CREATE TABLE statement 
    CREATE TABLE name (colname datatype [, colname datatype...])
    Data types currently "supported" are integer, float, and varchar. They are ignored by the implementation, anything that is hashable and marshallable can currently go in any column (but that is likely to change). For example 
    create table frequents 
  (drinker varchar, 
   bar varchar, 
   perweek integer)
    At present you can put tuples, complexes, or anything else into a column specified as "varchar". Don't count on that always being true, please.

    Other supported statements

    Gadfly also supports the searched DELETE and UPDATE; INSERT VALUES and INSERT subselect; CREATE/DROP INDEX, and DROP TABLE. These have the informal syntax 
    DELETE FROM table WHERE condition

UPDATE table SET col=expr [, col=expr...] WHERE condition

INSERT INTO table [(column [, column...])] values (value [, value...])

INSERT INTO table [(column [, column...])] subselect

CREATE [UNIQUE] INDEX name ON table (column [, column...])

DROP TABLE table

DROP INDEX name
    For example 
    delete from templikes where be='rollingrock' 

update templikes set dr='norman' where dr='norm' 

insert into ph(nm,ph) values ('nan', '0356')

insert into templikes(dr, be)
   select drinker, beer from likes

create index sbb on serves (beer, bar)

drop table templikes

drop index tdindex
    Multiple statements may be executed in one cursor.execute(S) by separating the statements with semicolons in S, for example S might have the string value 
    drop index tdindex;
drop table templikes
    (no final semicolon please!).

    Please see gftest.py for examples of most of these. Remember that SQL is case insensitive (capitalization of keywords doesn't matter). Please see sqlgram.py for a precise definition of all supported constructs

    Dynamic Values

    Expressions also include the special expression '?' (the ODBC-style dynamic expression) as in 
    insertstat = "insert into ph(nm,ph) values (?, ?)"
cursor.execute(insertstat, ('nan', "0356"))
cursor.execute(insertstat, ('bill', "2356"))
cursor.execute(insertstat, ('tom', "4356"))
    Dynamic values allow the cursor to use the same parsed expression many times for a similar operation. Above the insertstat is parsed and bound to the database only once. Using dynamic attributes should speed up accesses. Thus the above should run much faster than the equivalent 
    cursor.execute("insert into ph(nm,ph) values ('nan', '0356')");
cursor.execute("insert into ph(nm,ph) values ('bill', '2356')");
cursor.execute("insert into ph(nm,ph) values ('tom', '4356')");
    Dynamic attributes can appear in other statements containing expressions (such as SELECTs, UPDATEs and DELETEs too).

    For SELECT, UPDATE, and DELETE the dynamic expression substitutions must consist of a single tuple, as in 

    stat = "select * from ph where nm=?"
cursor.execute(stat, ("nan",))
...
cursor.execute(stat, ("bob",))
...
    Since the dynamic substitution eliminates the need for parsing and binding (expensive operations!) the above should run faster than the equivalent 
    cursor.execute("select * from ph where nm='nan'")
...
cursor.execute("select * from ph where nm='bob'")
...
    If you repeat several similar queries multiple times, associate each query "template string" with a unique cursor object so that each template must be parsed and bound only once. Note that some relatively complex queries from the test suite run 2 to 3 times faster after they have been parsed and bound, even without the kjbuckets builtin. With kjbuckets the same ran 5 to 10 times faster.

    Multiple Batch Inserts and Dynamic Values

    For the special case of INSERT VALUES a list of substitution tuples allows the query engine to perform the inserts in optimized batch mode. Thus the fastest way to perform the three inserts given earlier is 
    data = [('nan', "0356")), ('bill', "2356"), ('tom', "4356")]
stat = "insert into ph(nm,ph) values (?, ?)"
cursor.execute(stat, data)
    ...and it would be even faster if the cursor had previously executed the stat with different data (since then no parsing or binding would occur).

    Introspection

    By default a gadfly database now automatically includes "introspective" tables which allow a gadfly query to "query the shape of the database" -- for example to view table names and names of rows in tables. 
    >>> g = gadfly()
>>> g.startup("dbtest", "dbtest")
>>> c = g.cursor()

>>> c.execute("select * from __table_names__")
>>> print c.pp()
IS_VIEW | TABLE_NAME
=========================
1       | __TABLE_NAMES__
1       | DUAL
1       | __DATADEFS__
1       | __COLUMNS__
1       | __INDICES__
1       | __INDEXCOLS__
    Here DUAL is a standard one row/one column test table (from the Oracle tradition) and the other tables provide information about the database schema. 
    >>> c.execute("create table t1 (a varchar, b varchar)")
>>> c.execute("create table t2 (b varchar, c varchar)")
>>> c.execute("create unique index t1a on t1(a)")
>>> c.execute("create index t1b on t1(b)")

>>> c.execute("select * from __table_names__")
>>> print c.pp()
IS_VIEW | TABLE_NAME
=========================
0       | T1
1       | __DATADEFS__
1       | __INDICES__
0       | T2
1       | __TABLE_NAMES__
1       | __COLUMNS__
1       | DUAL
1       | __INDEXCOLS__

>>> c.execute("select * from __columns__")
>>> print c.pp()
COLUMN_NAME | TABLE_NAME
=============================
A           | T1
B           | T1
NAME        | __DATADEFS__
DEFN        | __DATADEFS__
INDEX_NAME  | __INDICES__
TABLE_NAME  | __INDICES__
IS_UNIQUE   | __INDICES__
TABLE_NAME  | __TABLE_NAMES__
IS_VIEW     | __TABLE_NAMES__
B           | T2
C           | T2
COLUMN1     | DUAL
TABLE_NAME  | __COLUMNS__
COLUMN_NAME | __COLUMNS__
INDEX_NAME  | __INDEXCOLS__
COLUMN_NAME | __INDEXCOLS__

>>> c.execute("select * from __indices__")
>>> print c.pp()
IS_UNIQUE | TABLE_NAME | INDEX_NAME
===================================
0         | T1         | T1B
1         | T1         | T1A

>>> c.execute("select * from __indexcols__")
>>> print c.pp()
COLUMN_NAME | INDEX_NAME
========================
B           | T1B
A           | T1A

>>> c.execute("select * from dual")
>>> print c.pp()
COLUMN1
=======
0

    Installation

     To guarantee correct installation, please follow the following procedure. Of course you must have Python in order to use this package!

    Unpack the package into a directory on the Python search path.

    Install: In the installation directory run the command 

    % python gfinstall.py
    This creates sqlwhere.py, which aides in the location of the parser data file required for parsing SQL. In some circumstances this may create the data file also. If it does the parser generation process may take several minutes, but you only need to run it during installation.

    If you think there is a problem Use 

    % python gfinstall.py force
    to force regeneration of the parser structures (for example if you modify the grammar or suspect the grammar data file sql.mar is corrupt).

    Test/compile: Now (possibly in a different directory) run 

    % mkdir dbtest
% python gftest.py dbtest
    This will create a test database and exercise the system to make sure it works. It also should have the side effect of byte compiling all *.py files required by gadfly. Run gftest.py as a user with write permission to the installation directory in order to guarantee byte compilation. It should just work ;c).

    Interactive testing

    After installation, you may interactively test the created database from the same directory using the interactive interpreter, for example, as in 
    Python 1.4 (Feb  4 1997) [MSC 32 bit (Intel)]
Copyright 1991-1995 Stichting Mathematisch Centrum, Amsterdam
>>> from gadfly import gadfly
>>> connection = gadfly("test", "dbtest")
>>> cursor = connection.cursor()
>>> cursor.execute("select * from frequents")
>>> cursor.description
(('DRINKER', None, None, None, None, None, None), ('PERWEEK', None, None, None,
None, None, None), ('BAR', None, None, None, None, None, None))
>>> print cursor.pp()
DRINKER | PERWEEK | BAR
============================
adam    | 1       | lolas
woody   | 5       | cheers
sam     | 5       | cheers
norm    | 3       | cheers
wilt    | 2       | joes
norm    | 1       | joes
lola    | 6       | lolas
norm    | 2       | lolas
woody   | 1       | lolas
pierre  | 0       | frankies
>>>

    Architecture

    The SQL grammar is described in sqlgram.py, the binding of the grammar constructs to semantic objects is performed in sqlbind.py, the semantic objects and their execution strategies is defined in sqlsem.py. The semantics uses a lot of classical and non-classical logic (cylindric logic, to be precise) as well as optimization heuristics to define a relatively efficient and hopefully correct implementation of SQL. I recommend the brave have a look at sqlsem.py for a look into the 12 years of research into databases, logic, and programming languages that contributed bits to this work. The underlying logic (in a different framework) is given in 
    A. Watters, "Interpreting a Reconstructed Relational Calculus",
ACM SIGMOD Proceedings, 1993, Washington DC, pp. 367-376.
    The most basic data structures of the implementation are given in either kjbuckets0.py or the faster kjbucketsmodule.c, which implement the same data type signatures in Python and in a C extension to Python respectively.

    The gadfly.py module is a simple wrapper that provides a standard DBAPI interface to the system. The installation script gfinstall.py attempts to install the system, creating the grammar file sql.mar if needed (or if "forced"). The test suite gftest.py (which requires a writeable directory argument) attempts to provide a regression test and a demonstration of the system. The SQL parser also requires the kwParsing parser generation package, which consists of a number of additional python modules.

    Comments

    Please find bugs and report them to me.

    The query engine should run faster if you have the builtin module kjbuckets installed. Otherwise it will use a "python imitation" kjbuckets0.py. In one test the test suite ran two times faster using kjbuckets. I suspect it will have a higher payoff for larger data sets.

    feedback
    home
    Gadfly home Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gadfly.py100644 1007 1403 32034 6747630566 25076 0ustar petrillipetrilli """main entry point for gadfly sql.""" import sqlgen, sqlbind sql = sqlgen.getSQL() sql = sqlbind.BindRules(sql) error = "gadfly_error" verbosity = 0 class gadfly: """as per the DBAPI spec "gadfly" is the connection object.""" closed = 0 verbose = verbosity # debug! def __init__(self, databasename=None, directory=None, forscratch=0, autocheckpoint=1, verbose=0): verbose = self.verbose = self.verbose or verbose # checkpoint on each commit if set self.autocheckpoint = autocheckpoint if verbose: print "initializing gadfly instance", (\ databasename, directory, forscratch, verbose) self.is_scratch = forscratch self.databasename=databasename self.directory = directory self.fs = None self.database = None # db global transaction id self.transid = 0 if databasename is not None: self.open() def transaction_log(self): from gfdb0 import Transaction_Logger if self.verbose: print "new transaction log for", self.transid return Transaction_Logger(self.database.log, self.transid, self.is_scratch) # causes problems in 1.5? #def __del__(self): # """clear database on deletion, just in case of circularities""" # # implicit checkpoint # if self.verbose: # print "deleting gadfly instance", self.databasename # if not self.closed: # self.close() def checkpoint(self): """permanently record committed updates""" # note: No transactions should be active at checkpoint for this implementation! # implicit abort of active transactions! verbose = self.verbose if verbose: print "checkpointing gadfly instance", self.databasename db = self.database log = db.log # dump committed db to fs fs = self.fs if fs and db and not db.is_scratch: # flush the log if log: if verbose: print "gadfly: committing log" log.commit() elif verbose: print "gadfly: no log to commit" if verbose: print "gadfly: dumping mutated db structures" fs.dump(db) elif verbose: print "gadfly: no checkpoint required" if verbose: print "gadfly: new transid, reshadowing" self.transid = self.transid+1 self.working_db.reshadow(db, self.transaction_log()) def startup(self, databasename, directory, scratch=0, verbose=0): from gfdb0 import Database0, File_Storage0 verbose = self.verbose if verbose: print "gadfly: starting up new ", databasename if self.database: raise error, "cannot startup, database bound" self.databasename=databasename self.directory = directory db = self.database = Database0() db.is_scratch = scratch or self.is_scratch self.fs = File_Storage0(databasename, directory) self.working_db = Database0(db, self.transaction_log()) # commit initializes database files and log structure self.commit() # for now: all transactions serialized # working db shared among all transactions/cursors self.transid = self.transid+1 self.working_db = Database0(db, self.transaction_log()) def restart(self): """reload and rerun committed updates from log, discard uncommitted""" # mainly for testing recovery. if self.verbose: print "gadfly: restarting database", self.databasename self.database.clear() self.working_db.clear() self.working_db = None self.database = None self.open() def open(self): """(re)load existing database""" if self.verbose: print "gadfly: loading database", self.databasename from gfdb0 import File_Storage0, Database0 if self.directory: directory = self.directory else: directory = "." fs = self.fs = File_Storage0(self.databasename, directory) db = self.database = fs.load(sql) self.transid = self.transid+1 self.working_db = Database0(db, self.transaction_log()) def add_remote_view(self, name, definition): """add a remote view to self. Must be redone on each reinitialization! Must not recursively reenter the query evaluation process for this database! "Tables" added in this manner cannot be update via SQL. """ self.database[name] = definition self.working_db[name] = definition def close(self): """checkpoint and clear the database""" if self.closed: return if self.verbose: print "gadfly: closing database", self.databasename db = self.database if not db.is_scratch: self.checkpoint() if db: db.clear() wdb = self.working_db if wdb: wdb.clear() self.working_db = None self.closed = 1 def commit(self): """commit the working database+transaction, flush log, new transid""" verbose = self.verbose autocheckpoint = self.autocheckpoint if self.verbose: print "gadfly: committing", self.transid, self.databasename self.transid = self.transid+1 fs = self.fs db = self.database wdb = self.working_db wdblog = wdb.log if wdblog: wdblog.commit() wdb.commit() if fs and db and not db.is_scratch: if autocheckpoint: if verbose: print "gadfly: autocheckpoint" # skips a transid? self.checkpoint() else: if verbose: print "gadfly: no autocheckpoint" wdb.reshadow(db, self.transaction_log()) else: if verbose: print "gadfly: scratch db, no logging, just reshadow" wdb.reshadow(db, self.transaction_log()) def rollback(self): """discard the working db, new transid, recreate working db""" verbose = self.verbose if verbose: print "gadfly: rolling back", self.transid, self.databasename if not (self.fs or self.database): raise error, "unbound, cannot rollback" # discard updates in working database self.working_db.clear() self.transid = self.transid+1 self.working_db.reshadow(self.database, self.transaction_log()) #self.open() def cursor(self): if self.verbose: print "gadfly: new cursor", self.databasename db = self.database if db is None: raise error, "not bound to database" return GF_Cursor(self) def dumplog(self): log = self.database.log if log: log.dump() else: print "no log to dump" def table_names(self): return self.working_db.relations() def DUMP_ALL(self): print "DUMPING ALL CONNECTION DATA", self.databasename, self.directory print print "***** BASE DATA" print print self.database print print "***** WORKING DATA" print print self.working_db class GF_Cursor: verbose = verbosity arraysize = None description = None EVAL_DUMP = 0 # only for extreme debugging! def __init__(self, gadfly_instance): verbose = self.verbose = self.verbose or gadfly_instance.verbose if verbose: print "GF_Cursor.__init__", id(self) self.connection = gadfly_instance self.results = None self.resultlist = None self.statement = None # make a shadow of the shadow db! (in case of errors) from gfdb0 import Database0 self.shadow_db = Database0() self.reshadow() self.connection = gadfly_instance def reshadow(self): if self.verbose: print "GF_Cursor.reshadow", id(self) db = self.connection.working_db shadow = self.shadow_db shadow.reshadow(db, db.log) if self.verbose: print "rels", shadow.rels.keys() def close(self): if self.verbose: print "GF_Cursor.close", id(self) self.connection = None def reset_results(self): if self.verbose: print "GF_Cursor.reset_results", id(self) rs = self.results if rs is None: raise error, "must execute first" if len(rs)!=1: raise error, "cannot retrieve multiple results" rel = rs[0] rows = rel.rows() atts = rel.attributes() tupatts = tuple(atts) resultlist = list(rows) if len(tupatts)==1: att = tupatts[0] for i in xrange(len(resultlist)): resultlist[i] = (resultlist[i][att],) else: for i in xrange(len(resultlist)): resultlist[i] = resultlist[i].dump(tupatts) self.resultlist = resultlist def fetchone(self): if self.verbose: print "GF_Cursor.fetchone", id(self) r = self.resultlist if r is None: self.reset_results() r = self.resultlist if len(r)<1: raise error, "no more results" result = r[0] del r[0] return result def fetchmany(self, size=None): if self.verbose: print "GF_Cursor.fetchmany", id(self) r = self.resultlist if r is None: self.reset_results() r = self.resultlist if size is None: size = len(r) result = r[:size] del r[:size] return result def fetchall(self): if self.verbose: print "GF_Cursor.fetchall", id(self) return self.fetchmany() def execute(self, statement=None, params=None): """execute operations, commit results if no error""" success = 0 verbose = self.verbose if verbose: print "GF_Cursor.execute", id(self) if statement is None and self.statement is None: raise error, "cannot execute, statement not bound" if statement!=self.statement: if verbose: print "GF_cursor: new statement: parsing" # only reparse on new statement. self.statement=statement from sqlsem import Parse_Context context = Parse_Context() cs = self.commands = sql.DoParse1(statement, context) else: if verbose: print "GF_cursor: old statment, not parsing" cs = self.commands # always rebind! (db may have changed) if verbose: print "GF_Cursor: binding to temp db" # make a new shadow of working db # (should optimize?) self.reshadow() # get shadow of working database database = self.shadow_db if self.EVAL_DUMP: print "***" print "*** dumping connection parameters before eval" print "***" print "*** eval scratch db..." print print database print print "*** connection data" print self.connection.DUMP_ALL() print "********** end of eval dump" for i in xrange(len(cs)): if verbose: print "GFCursor binding\n", cs[i] print database.rels.keys() cs[i] = cs[i].relbind(database) cs = self.commands self.results = results = list(cs) # only unshadow results on no error try: for i in xrange(len(cs)): results[i] = cs[i].eval(params) success = 1 finally: #print "in finally", success # only on no error... if success: # commit updates in shadow of working db (not in real db) if verbose: print "GFCursor: successful eval, storing results in wdb" database.log.flush() # database commit does not imply transaction commit. database.commit() else: if verbose: print \ "GFCursor: UNSUCCESSFUL EVAL, discarding results and log entries" self.statement = None self.results = None self.resultlist = None database.log.reset() # handle curs.description self.description = None if len(results)==1: result0 = results[0] try: atts = result0.attributes() except: pass else: descriptions = list(atts) fluff = (None,) * 6 for i in xrange(len(atts)): descriptions[i] = (atts[i],) + fluff self.description = tuple(descriptions) self.resultlist = None def setoutputsize(self, *args): # not implemented pass def setinputsizes(self, *args): # not implemented pass def pp(self): """return pretty-print string rep of current results""" from string import join stuff = map(repr, self.results) return join(stuff, "\n\n") Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gfSQL.html100644 1007 1403 22120 6747630566 25113 0ustar petrillipetrilli Gadfly SQL constructs

    Gadfly SQL constructs

    This document describes SQL constructs supported by Gadfly. The presentation does not define the complete syntax -- see sqlgram.py for the precise syntax as BNF -- nor the complete semantics -- see a good book on SQL for more detailed coverage of semantic (or use the source, Luke ;c) ). Also, please have a look at my evolving database course notes for more coverage of SQL. Examples of all supported constructs are also shown in the test suite source file gftest.py. This document is only a very brief guide, primarily of use to those who already understand something about SQL -- it is neither a tutorial nor a detailed discussion of syntax and semantics.

    The Standard, with omissions

    Gadfly supports a large subset of ODBC 2.0 SQL. The reason ODBC 2.0 is chosen is because it provides a fairly strong set of constructs, but does not include some of the more obscure features of other SQL standards which would be extremely difficult and complex to implement correctly (and perhaps, not used very frequently (?)).

    Supported features include views, groupings, aggregates, subquery expressions, quantified subquery comparisons, EXISTS, IN, UNION, EXCEPT, INTERSECT, searched mutations and Indices, among others (see below).

    Some important omissions from ODBC 2.0 at this point are 

    Nulls.
Outer joins.
CHECK conditions.
Enforced data type constraints.
Alter table (can't implement until NULLs arrive).
Date, Time, and Interval data types
    It is hoped these will be implemented at some future time.

    Less important omissions include 

    Cursor based updates and deletes
  (justification: if you really need them the db design
   is flawed, and it's possible to use python instead).
LIKE string predicate
  (justification: use Python regexes in python code).
Users and permissions
  (justification: Gadfly is not intended for full multiuser
   use at this time).
    These may or may not be implemented at some future time.

    Statements

    All interaction with SQL databases is mediated by SQL statements, or statement sequences. Statement sequences are statements separated by semicolons. SQL keywords and user defined names are not case sensitive (but string values are, of course).

    SQL statements include the following.

    Select Statement

    The select statement derives a table from tables in the database. It's general form is 
    sub_query
     optorder_by
    Where sub_query is given by 
    SELECT alldistinct select_list
     FROM table_reference_list
     optwhere 
     optgroup 
     opthaving 
     optunion
    Read the statement: 
    SELECT [DISTINCT|ALL] expressions or *
FROM tables
[WHERE condition]
[GROUP BY group-expressions]
[HAVING aggregate-condition]
[union-clause]
[ORDER BY columns]
    as follows: 
    1) Make all combinations of rows from the tables (FROM line)
2) Eliminate those combinations not satisfying condition (WHERE line)
3) (if GROUP present) form aggregate groups that match on group-expressions
4) (if HAVING present) eliminate aggregate groups that don't satisfy
   the aggregate-condition.
5) compute the columns to keep (SELECT line).
6) (if union-clause present) combine (union, except, intersect)
   the result with the result of another select statement.
7) if DISTINCT, throw out redundant entries.
8) (if ORDER present) order the result by the columns (ascending
   or descending as specified, with precedence as listed).
    This reading has little to do with the actual implementation, but the answer produced should match this intuitive reading.

    Create and drop table

    The create and drop table constructs initialize and destroy a table structure, respectively. 
    CREATE TABLE user_defined_name ( colelts )

DROP TABLE user_defined_name
    The colelts declare the names of the columns for the table and their data types. The data types are not checked or enforced in any way at this time.

    Table mutations (INSERT, UPDATE, DELETE)

    Insert, Update, and Delete statements insert rows into tables, modify rows in tables in place, or remove rows from tables respectively. 
    INSERT INTO table_name optcolids insert_spec

DELETE FROM user_defined_name optwhere

UPDATE user_defined_name
     SET assns
     optwhere
    The insert statement has two variants (in this implementation) INSERT sub-select and INSERT VALUES. 
    insert into r (a,b,c) select a,b,c from s

insert into r (a,b,c) values (1,2,3)
    The first inserts the result of a SELECT statement into the target table and the other inserts explicit values (which may be dynamic parameters, see below).

    Cursor based updates are not supported at the SQL level, eg 

      update r set a=1 where current of curs
    is not supported.

    Indices

    The create and drop index statements initialize and destroy index structures respectively. 
    CREATE INDEX user_defined_name
     ON user_defined_name
     ( namelist )

DROP INDEX user_defined_name
    Indices allow fast access to a table, based on values for the indexed columns in the namelist.

    Indices can be UNIQUE, meaning that the attributes of the index cannot take on the same values in the table twice. 

    CREATE UNIQUE INDEX user_defined_name 
  ON user_defined_name ( namelist )
    Unique indices can be used to enforce primary and secondary key constraints. After a UNIQUE index on a table is created inserts that attempt to insert repeat values for the indexed columns will be rejected.

    Views

    Create view and drop view statements initialize and drop views, respectively. 
    CREATE VIEW user_defined_name optnamelist 
  AS select_statement

DROP VIEW user_defined_name
    Views are "derived tables" which are defined as stored SELECT statements. They can be used as tables, except that they cannot be directly mutated.

    It is possible to "implement your own views in Python". Please see remotetest.py, gfintrospect and the FAQ for discussion.

    Conditions

    Conditions are truth valued boolean expressions formed from basic conditions possibly combined using NOT, AND, OR (where NOT has highest precedence and OR has lowest precedence) and parentheses.

    Basic conditions include simple comparisons 

    expression = expression
expression < expression
expression > expression
expression <= expression
expression >= expression
expression <> expression
    Variants of the simple comparisons are the quantified subquery comparisons 
    expression = ANY ( subquery )
expression = ALL ( subquery )
    (and similarly for the other comparison operators). The IN predicate tests membership (like =ANY) 
    expression IN ( subquery )
expression NOT IN ( subquery )
    For all the quantified comparisons and IN the subquery must generate a single column table.

    Also included are the the BETWEEN and NOT BETWEEN predicates 

    expression BETWEEN expression AND expression
expression NOT BETWEEN expression AND expression

    The most general subquery predicate is EXISTS and NOT EXISTS which places no restriction on the subquery: 

    EXISTS (subquery)
NOT EXISTS (subquery)

    Expressions

    Expressions occur in conditions (WHERE, HAVING, etc.), in UPDATE searched assignments, and in the select list of select statements.

    Expressions are formed from primary expressions, possibly combined using the standard arithmetic operators and parentheses with the normal precedence.

    Primary expressions include numeric and string literals. Numeric literals supported are the Python numeric literals. String constants are set off by apostrophies, where two apostrophe's in sequence represent an apostrophy in the string: 

    'SQL string literals ain''t pretty'
    Column name expressions may be unqualified if they are unambiguous, or may be qualified with a table name or table alias 
    bar
frequents.bar
f.bar
    The rules for scoping of column names are not covered here. Column names in subqueries may refer to bindings in the query (or queries) that contain the sub-query.

    Subquery expressions of form 

    ( select_statement )
    must produce a single column and single row table.

    Aggregate operations are only permitted in the select list or in the HAVING condition of SELECT statements (including subselects). 

    COUNT(*)
COUNT(expression)
AVG(expression)
MAX(expression)
SUM(expression)
MIN(expression)
    and also including the non-standard extension MEDIAN 
    MEDIAN(expression)
    Aggregate operations can be applied to distinct values as in 
    COUNT(DISTINCT expression)
    The Dynamic expression "?" is a placeholder for a value bound at evaluation time (from Python values). See the API discussions (Use) for more details on the use of dynamic parameters.

    feedback
    home
    Gadfly home Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gfclient.py100644 1007 1403 14636 6747630567 25434 0ustar petrillipetrilli """client access to gadfly server. (gfserve.py) Imported as a module this module provides interfaces that remotely access a gadfly database server. Remote connections: gfclient connection = gfclient.gfclient( policy, # the name of the connection policy ["admin" for admin] port, # the port number the server is running on password,# the password of the policy [machine]) # (optional) the machine where server is running # (defaults to localhost) methods for gfclient connections: gfclient.checkpoint() checkpoint the server (fails silently if connection is not "admin"). gfclient.restart() restart the server (fails silently if connection is not "admin"). gfclient.shutdown() shutdown the server (fails silently if connection is not "admin"). cursor = gfclient.cursor() returns a cursor on this connection methods for cursor objects: cursor.execute(statement, dynamic_parameters=None) execute the statement with optional dynamic parameters. Dynamic parameters can be a list of tuples for INSERT VALUES statements, otherwise they must be a tuple of values. cursor.execute_prepared(name, dynamic_parameters=None) execute a named statement configured for this connection policy, with optional dynamic parameters. Dynamic parameters permitted as for execute depending on the statement the name refers to. cursor.fetchall() return results of the last executed statement (None for non-queries, or list of tuples). See gfstest.py for example usage. SCRIPT INTERPRETATION: Server maintenance utilities COMMAND LINE: python gfclient.py action port admin_password [machine] TEST EXAMPLE: python gfclient.py shutdown 2222 admin action: one of shutdown: shut down the server with no checkpoint restart: restart the server (re-read the database and recover) checkpoint: force a database checkpoint now port: the port the server is running on admin_password: the administrative password for the server machine: [optional] the machine the server runs on. """ import gfsocket def main(): import sys try: done=0 argv = sys.argv [action, port, admin_password] = argv[1:4] from string import atoi port = atoi(port) if len(argv)>4: machine = argv[4] else: machine = None print action, port, admin_password, machine if action not in ["shutdown", "restart", "checkpoint"]: print "bad action", action print return dosimple(action, port, admin_password, machine) done=1 finally: if not done: print __doc__ def dosimple(action, port, pw, machine=None): import socket if machine is None: machine = socket.gethostname() conn = gfclient("admin", port, pw, machine) action = getattr(conn, action) print action() # copied from gfserve # shut down the server (admin policy only) # arguments = () # shutdown the server with no checkpoint SHUTDOWN = "SHUTDOWN" # restart the server (admin only) # arguments = () # restart the server (recover) # no checkpoint RESTART = "RESTART" # checkpoint the server (admin only) # arguments = () # checkpoint the server CHECKPOINT = "CHECKPOINT" # exec prepared statement # arguments = (prepared_name_string, dyn=None) # execute the prepared statement with dynamic args. # autocommit. EXECUTE_PREPARED = "EXECUTE_PREPARED" # exec any statement (only if not disabled) # arguments = (statement_string, dyn=None) # execute the statement with dynamic args. # autocommit. EXECUTE_STATEMENT = "EXECUTE_STATEMENT" class gfclient: closed = 0 def __init__(self, policy, port, password, machine=None): import socket self.policy = policy self.port = port self.password = password if machine is None: machine = socket.gethostname() self.machine = machine def open_connection(self): import socket sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM) #print type(sock), sock sock.connect(self.machine, self.port) return sock def send_action(self, action, arguments, socket): gfsocket.send_certified_action( self.policy, action, arguments, self.password, socket) def checkpoint(self): return self.simple_action(CHECKPOINT) def simple_action(self, action, args=()): """only valid for admin policy: force a server checkpoint""" sock = self.open_connection() self.send_action(action, args, sock) data = gfsocket.recv_data(sock) data = gfsocket.interpret_response(data) return data def restart(self): """only valid for admin policy: force a server restart""" return self.simple_action(RESTART) def shutdown(self): """only valid for admin policy: shut down the server""" return self.simple_action(SHUTDOWN) def close(self): self.closed = 1 def commit(self): # right now all actions autocommit pass # cannot rollback, autocommit on success rollback = commit def cursor(self): """return a cursor to this policy""" if self.closed: raise ValueError, "connection is closed" return gfClientCursor(self) class gfClientCursor: statement = None results = None description = None def __init__(self, connection): self.connection = connection # should add fetchone fetchmany def fetchall(self): return self.results def execute(self, statement=None, params=None): con = self.connection data = con.simple_action(EXECUTE_STATEMENT, (statement, params)) (self.description, self.results) = data def execute_prepared(self, name, params=None): con = self.connection data = con.simple_action(EXECUTE_PREPARED, (name, params)) if data is None: self.description = self.results = None else: (self.description, self.results) = data def setoutputsizes(self, *args): pass # not implemented def setinputsizes(self): pass # not implemented if __name__=="__main__": main() Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gfdb0.py100644 1007 1403 133606 6747630567 24642 0ustar petrillipetrilli"""storage objects""" verbosity = 0 import os # use whatever kjbuckets sqlsem is using #from sqlsem import kjbuckets, maketuple # error on checking of data integrity StorageError = "StorageError" # use md5 checksum (stub if md5 unavailable?) def checksum(string): from md5 import new return new(string).digest() def recursive_dump(data, prefix="["): """for debugging""" from types import StringType if type(data) is StringType: #print prefix, data return p2 = prefix+"[" try: for x in data: recursive_dump(x, p2) except: print prefix, data def checksum_dump(data, file): """checksum and dump marshallable data to file""" #print "checksum_dump", file #recursive_dump(data) from marshal import dumps, dump #print "data\n",data storage = dumps(data) checkpair = (checksum(storage), storage) dump(checkpair, file) def checksum_undump(file): """undump marshallable data from file, checksum""" from marshal import load, loads checkpair = load(file) (check, storage) = checkpair if checksum(storage)!=check: raise StorageError, "data load checksum fails" data = loads(storage) return data def backup_file(filename, backupname): """backup file, if unopenable ignore""" try: f = open(filename, "rb") except: return data = f.read() f.close() f = open(backupname, "wb") f.write(data) f.close() def del_file(filename): """delete file, ignore errors""" from os import unlink try: unlink(filename) except: pass class Database0: """quick and dirty in core database representation.""" # db.log is not None == use db.log to log modifications # set for verbose prints verbose = verbosity # set for read only copy readonly = 0 # set for temp/scratch db copy semantics is_scratch = 0 # set to add introspective tables introspect = 1 def __init__(self, shadowing=None, log=None): """dictionary of relations.""" verbose = self.verbose self.shadowing = shadowing self.log = log self.touched = 0 if log: self.is_scratch = log.is_scratch if shadowing and not log: raise ValueError, "shadowing db requires log" if verbose: print "Database0 init" if log: log.verbose = 1 if shadowing: # shadow structures of shadowed db self.rels = shadow_dict(shadowing.rels, Relation0.unshadow) self.datadefs = shadow_dict(shadowing.datadefs) self.indices = shadow_dict(shadowing.indices) else: self.rels = {} self.datadefs = {} self.indices = {} if self.introspect: self.set_introspection() def set_introspection(self): import gfintrospect self["dual"] = gfintrospect.DualView() self["__table_names__"] = gfintrospect.RelationsView() self["__datadefs__"] = gfintrospect.DataDefsView() self["__indices__"] = gfintrospect.IndicesView() self["__columns__"] = gfintrospect.ColumnsView() self["__indexcols__"] = gfintrospect.IndexAttsView() def reshadow(self, db, dblog): """(re)make self into shadow of db with dblog""" self.shadowing = db self.log = dblog self.rels = shadow_dict(db.rels, Relation0.unshadow) self.datadefs = shadow_dict(db.datadefs) self.indices = shadow_dict(db.indices) def clear(self): """I'm not sure if database has circular structure, so this added""" self.shadowing = None self.log = None self.rels = {} self.datadefs = {} self.indices = {} def commit(self): """commit shadowed changes""" verbose = self.verbose if self.shadowing and self.touched: # log commit handled elsewhere #log = self.log #if log and not log.is_scratch: #if verbose: print "committing log" #self.log.commit(verbose) if verbose: print "committing rels" self.rels.commit(verbose) if verbose: print "committing datadefs" self.datadefs.commit(verbose) if verbose: print "committing indices" self.indices.commit(verbose) st = self.shadowing.touched if not st: if verbose: "print setting touched", self.touched self.shadowing.touched = self.touched elif verbose: print "shadowed database is touched" elif verbose: print "db0: commit on nonshadow instance" def __setitem__(self, name, relation): """bind a name (uppercased) to tuples as a relation.""" from string import upper if self.indices.has_key(name): raise NameError, "cannot set index" self.rels[ upper(name) ] = relation if self.verbose: print "db0 sets rel", name def add_index(self, name, index): if self.rels.has_key(name): raise NameError, `name`+": is relation" self.indices[name] = index if self.verbose: print "db0 sets index", name def drop_index(self, name): if self.verbose: print "db0 drops index", name del self.indices[name] def __getitem__(self, name): if self.verbose: print "db0 gets rel", name from string import upper return self.rels[upper(name)] def get_for_update(self, name): """note: does not imply updates, just possibility of them""" verbose = self.verbose if verbose: print "db0 gets rel for update", name shadowing = self.shadowing gotit = 0 from string import upper name = upper(name) rels = self.rels if shadowing: if rels.is_shadowed(name): test = rels[name] # do we really have a shadow or a db copy? if test.is_shadow: gotit = 1 if not gotit: if shadowing.has_relation(name): test = shadowing.get_for_update(name) else: # uncommitted whole relation test = rels[name] gotit = 1 else: test = rels[name] gotit = 1 if self.readonly: raise ValueError, "cannot update, db is read only" elif test.is_view: raise ValueError, "VIEW %s cannot be updated" % name elif shadowing and not gotit: if verbose: print "db0: making shadow for", name if test.is_shadow: return test shadow = Relation0(()) shadow = shadow.shadow(test, self.log, name, self) rels[name] = shadow return shadow else: return test def __delitem__(self, name): if self.verbose: print "db0 drops rel", name from string import upper del self.rels[upper(name)] def relations(self): return self.rels.keys() def has_relation(self, name): return self.rels.has_key(name) def getdatadefs(self): result = self.datadefs.values() # sort to make create tables first, eg result.sort() return result def add_datadef(self, name, defn, logit=1): """only log the datadef if logit is set, else ignore redefinitions""" dd = self.datadefs if logit and dd.has_key(name): raise KeyError, `name`+": already defined" if logit: self.touched = 1 dd[name] = defn def has_datadef(self, name): return self.datadefs.has_key(name) def drop_datadef(self, name): if self.verbose: print "db0 drops datadef",name dd = self.datadefs #print dd.keys() if not dd.has_key(name): raise KeyError, `name`+": no such element" del dd[name] def __repr__(self): l = [] from string import join l.append("INDICES: "+`self.indices.keys()`) for (name, ddef) in self.datadefs.items(): l.append("data definition %s::\n%s" % (name, ddef)) for (name, rel) in self.rels.items(): l.append(name + ":") l.append(rel.irepr()) return join(l, "\n\n") def bindings(self, fromlist): """return (attdict, reldict, amb, ambatts) from fromlist = [(name,alias)...] where reldict: alias --> tuplelist attdict: attribute_name --> unique_relation amb: dict of dottedname --> (rel, att) ambatts: dict of ambiguous_name --> witness_alias """ from string import upper rels = self.rels ambiguous_atts = {} ambiguous = {} relseen = {} attbindings = {} relbindings = {} for (name,alias) in fromlist: name = upper(name) alias = upper(alias) if relseen.has_key(alias): raise NameError, `alias` + ": bound twice in from list" relseen[alias]=alias try: therel = rels[name] except KeyError: raise NameError, `name` + " no such relation in DB" relbindings[alias] = therel for attname in therel.attributes(): if not ambiguous_atts.has_key(attname): if attbindings.has_key(attname): oldrel = attbindings[attname] oldbind = (oldrel, attname) ambiguous[ "%s.%s" % oldbind] = oldbind del attbindings[attname] ambiguous_atts[attname]=alias newbind = (alias, attname) ambiguous[ "%s.%s" % newbind ] = newbind else: attbindings[attname] = alias else: newbind = (alias, attname) ambiguous[ "%s.%s" % newbind ] = newbind return (attbindings, relbindings, ambiguous, ambiguous_atts) class File_Storage0: """quick and dirty file storage mechanism. relation names in directory/dbname.gfd contains a white separated list of relation names relations in directory/relname.grl contains sequence of marshalled tuples reps prefixed by marshalled list of atts """ verbose = verbosity def __init__(self, dbname, directory): """directory must exist.""" if self.verbose: print "fs0 init:", dbname, directory self.dbname = dbname self.directory = directory self.relation_implementation = Relation0 self.recovery_mode = 0 def load(self, parser=None, forscratch=0): # if logfile is present, need to recover # error condition: fail to load relation, ddf, but no log file! logfile = self.logfilename() blogfile = self.backup_logfilename() verbose = self.verbose if verbose: print "fs0 load, checking", logfile try: testlog = open(logfile, "rb") if verbose: print "fs0: opened", testlog testlog.close() testlog = open(blogfile, "rb") testlog.close() testlog = None except: recovery_mode = self.recovery_mode = 0 if verbose: print "recovery not needed" else: recovery_mode = self.recovery_mode = 1 if verbose: print "FS0 RECOVERY MODE LOAD!" resultdb = Database0() resultdb.is_scratch = forscratch commands = self.get_initstatements() #commands = parser.DoParse1(initstatements) for command in commands: if verbose: print "fs0 evals", command command.relbind(resultdb) command.eval() for name in resultdb.relations(): if verbose: print "fs0 loads rel", name rel = resultdb[name] if rel.is_view: # don't need to load views continue rel.set_empty() try: data = self.get_relation(name) except StorageError, detail: raise StorageError, "load failure %s: %s" % (name, detail) attsin = tuple(data.attributes()) attsout = tuple(rel.attributes()) if attsin!=attsout: raise StorageError, "rel %s: atts %s don't match %s" % ( name, attsin, attsout) rel.add_tuples( data.rows() ) # in sync! rel.touched = 0 # db in sync resultdb.touched = 0 # do recovery, if needed if recovery_mode: if verbose: print "fs0 recovering from logfile", logfile # restart the log file only if db is not scratch restart = not forscratch Log = DB_Logger(logfile, blogfile) if verbose: Log.verbose=1 Log.recover(resultdb, restart) # do a checkpoint self.recovery_mode = 0 if restart and not forscratch: Log.shutdown() Log = None del_file(logfile) if verbose: print "FS0: dumping database" self.dump(resultdb) Log = resultdb.log = DB_Logger(logfile, blogfile) Log.startup() elif not forscratch: Log = DB_Logger(logfile, blogfile) Log.startup() resultdb.log = Log return resultdb def relfilename(self, name): #return "%s/%s.grl" % (self.directory, name) return os.path.join(self.directory, name+".grl") def backup_relfilename(self, name): #return "%s/%s.brl" % (self.directory, name) return os.path.join(self.directory, name+".brl") def relfile(self, name, mode="rb"): if self.recovery_mode: return self.getfile_fallback( self.backup_relfilename(name), self.relfilename(name), mode) else: name = self.relfilename(name) return open(name, mode) def getfile_fallback(self, first, second, mode): try: return open(first, mode) except: return open(second, mode) def get_relation(self, name): f = self.relfile(name, "rb") rel = self.relation_implementation(()) try: rel.load(f) except StorageError: if self.recovery_mode: f = open(self.relfilename(name), "rb") rel.load(f) else: raise StorageError, \ "fs: could not unpack backup rel file or rel file in recovery mode: "+name return rel def dbfilename(self): #return "%s/%s.gfd" % (self.directory, self.dbname) return os.path.join(self.directory, self.dbname+".gfd") def backup_dbfilename(self): #return "%s/%s.bfd" % (self.directory, self.dbname) return os.path.join(self.directory, self.dbname+".bfd") def logfilename(self): #return "%s/%s.gfl" % (self.directory, self.dbname) return os.path.join(self.directory, self.dbname+".gfl") def backup_logfilename(self): #return "%s/%s.glb" % (self.directory, self.dbname) return os.path.join(self.directory, self.dbname+".glb") def get_initstat_file(self, mode): if self.recovery_mode: return self.getfile_fallback( self.backup_dbfilename(), self.dbfilename(), mode) else: return open(self.dbfilename(), mode) def get_initstatements(self): f = self.get_initstat_file("rb") if self.verbose: print "init statement from file", f try: data = checksum_undump(f) except StorageError: if self.recovery_mode: f = open(self.dbfilename, "rb") data = checksum_undump(f) else: raise StorageError, \ "could not unpack ddf backup or ddf file in recovery mode: "+self.dbname f.close() from sqlsem import deserialize stats = map(deserialize, data) return stats def dump(self, db): """perform a checkpoint (no active transactions!)""" # db should be non-shadowing db # first thing: back up the log backup_file(self.logfilename(), self.backup_logfilename()) verbose = self.verbose if verbose: print "fs0: checkpointing db" if db.is_scratch or db.readonly: # don't need to do anything. if verbose: print "fs0: scratch or readonly, returning" return log = db.log if log: log.commit() if verbose: print "DEBUG LOG TRACE" log.dump() log.shutdown() if db.touched: if verbose: print "fs0: db touched, backing up ddf file" backup_file(self.dbfilename(), self.backup_dbfilename()) relations = db.relations() for r in relations: rel = db[r] #print r if rel.touched: if verbose: print "fs0: backing up touched rel", r backup_file(self.relfilename(r), self.backup_relfilename(r)) for r in relations: if verbose: print "fs0: dumping relations now" self.dumprelation(r, db[r]) if verbose: print "fs0: dumping datadefs now" self.dumpdatadefs(db) # del of logfile signals successful commit. if verbose: print "fs0: successful dump, deleting log file" logfilename = self.logfilename() blogfilename = self.backup_logfilename() del_file(logfilename) del_file(blogfilename) if db.touched: if verbose: print "fs0: deleting backup ddf file" del_file(self.backup_dbfilename()) db.touched = 0 for r in relations: rel = db[r] if rel.touched: if verbose: print "fs0: deleting rel backup", r del_file(self.backup_relfilename(r)) rel.touched = 0 if verbose: print "fs0: restarting db log" log = db.log = DB_Logger(logfilename, blogfilename) log.startup() if verbose: print "fs0: dump complete" self.recovery_mode = 0 def dumprelation(self, name, rel, force=0): """set force to ignore the "touch" flag.""" # ignore self.backup_mode if (force or rel.touched) and not rel.is_view: fn = self.relfilename(name) if self.verbose: print "dumping touched rel", name, "to", fn f = open(fn, "wb") rel.dump(f) def dumpdatadefs(self, db, force=0): """set force to ignore the touch flag""" # ignore self.backup_mode if not (force or db.touched): return #from marshal import dump, dumps fn = self.dbfilename() f = open(fn, "wb") datadefs = db.getdatadefs() from sqlsem import serialize datadefsd = map(serialize, datadefs) #for (defn, ser) in map(None, datadefs, datadefsd): #print defn #print ser #dumps(ser) ### debug test checksum_dump(datadefsd, f) f.close() class Relation0: """quick and dirty in core relation representation. self.tuples contains tuples or 0 if erased. tuples must not move (to preserve indices) unless indices regenerate. """ is_view = 0 # Relation0 is not a view def __init__(self, attribute_names, tuples=None, filter=None): from sqlsem import kjbuckets self.indices = kjbuckets.kjGraph() self.index_list = [] self.attribute_names = attribute_names if tuples is None: tuples = [] self.filter = filter self.set_empty() self.add_tuples(tuples) # indices map attname --> indices containing att # relation to shadow and log (if non-null) self.log = None self.name = None # anonymous by default self.is_shadow = 0 self.touched = 0 def shadow(self, otherrelation, log, name, inshadowdb): """return structural replica of otherrelation (as self) for non-updatable relation (eg, view) may return otherrelation""" if otherrelation.is_view: # for now, assume VIEWS CANNOT BE UPDATED return otherrelation self.is_shadow = 1 self.shadow_of_shadow = otherrelation.is_shadow self.log = log self.name = name # don't make any updates permanent if set. self.tuples = otherrelation.tuples[:] self.attribute_names = otherrelation.attribute_names self.filter = otherrelation.filter for index in otherrelation.index_list: copy = index.copy() name = copy.name self.add_index(copy, recordtuples=0) # record in shadowdb, but don't log it inshadowdb.add_index(name, copy) #inshadowdb.add_datadef(name, copy, logit=0) self.touched = otherrelation.touched return self def unshadow(self): """make self into a replacement for shadowed, return self.""" if self.is_shadow: self.log = None self.is_shadow = self.shadow_of_shadow return self def dump(self, file): attributes = tuple(self.attributes()) rows = self.rows() newrows = rows[:] count = 0 tt = type from types import IntType for i in xrange(len(rows)): this = rows[i] if this is not None and tt(this) is not IntType: newrows[count] = rows[i].dump(attributes) count = count + 1 newrows = newrows[:count] newrows.append(attributes) checksum_dump(newrows, file) def load(self, file): """checksum must succeed.""" rows = checksum_undump(file) attributes = rows[-1] self.attribute_names = attributes rows = rows[:-1] from sqlsem import kjbuckets undump = kjbuckets.kjUndump for i in xrange(len(rows)): rows[i] = undump(attributes, rows[i]) self.set_empty() self.add_tuples(rows) # in sync with disk copy! self.touched = 0 def add_index(self, index, recordtuples=1): """unset recordtuples if the index is initialized already.""" # does not "touch" the relation index_list = self.index_list indices = self.indices atts = index.attributes() for a in atts: indices[a] = index if recordtuples: (tuples, seqnums) = self.rows(1) index.clear() if tuples: index.add_tuples(tuples, seqnums) index_list.append(index) def drop_index(self, index): # does not "touch" the relation name = index.name if verbosity: print "rel.drop_index", index print "...", self.indices, self.index_list indices = self.indices for a in index.attributes(): # contorted since one index be clone of the other. aindices = indices.neighbors(a) for ind in aindices: if ind.name == name: indices.delete_arc(a, ind) theind = ind # the (non-clone) index ought to have been found above... self.index_list.remove(theind) def choose_index(self, attributes): """choose an index including subset of attributes or None""" from sqlsem import kjbuckets kjSet = kjbuckets.kjSet atts = kjSet(attributes) #print "choosing index", atts indices = (atts * self.indices).values() choice = None for index in indices: indexatts = index.attributes() #print "index atts", indexatts iatts = kjSet(indexatts) if iatts.subset(atts): if choice is None: #print "chosen", index.name choice = index lchoice = len(choice.attributes()) else: if index.unique or lchoice tuples self.index = {} self.dseqnums = {} def __repr__(self): un = "" if self.unique: un="UNIQUE " return "%sindex %s on %s" % (un, self.name, self.atts) def copy(self): """make a fast structural copy of self""" result = Index(self.name, self.atts, unique=self.unique) rindex = result.index rdseqnums = result.dseqnums myindex = self.index mydseqnums = self.dseqnums for k in myindex.keys(): rindex[k] = myindex[k][:] for k in mydseqnums.keys(): rdseqnums[k] = mydseqnums[k][:] return result def attributes(self): return self.atts def matches(self, tuple, translate=None): """return (tuples, seqnums) for tuples matching tuple (with possible translations""" if translate: tuple = translate * tuple atts = self.atts dump = tuple.dump(atts) index = self.index if index.has_key(dump): return (index[dump], self.dseqnums[dump]) else: return ((), ()) def clear(self): self.index = {} self.dseqnums = {} def add_tuples(self, tuples, seqnums): unique = self.unique atts = self.atts index = self.index dseqnums = self.dseqnums test = index.has_key for i in xrange(len(tuples)): tup = tuples[i] seqnum = seqnums[i] dump = tup.dump(atts) #print self.name, dump if test(dump): bucket = index[dump] #print "self", self #print "unique", unique #print "bucket", bucket if unique and bucket: raise StorageError, "uniqueness violation: %s %s" %( dump, self) bucket.append(tup) dseqnums[dump].append(seqnum) else: index[dump] = [tup] dseqnums[dump] = [seqnum] def erase_tuples(self, seqnums, all_tuples): # all_tuples must be internal rel tuple list atts = self.atts index = self.index dseqnums = self.dseqnums for seqnum in seqnums: tup = all_tuples[seqnum] dump = tup.dump(atts) index[dump].remove(tup) dseqnums[dump].remove(seqnum) class shadow_dict: """shadow dictionary. defer & remember updates.""" verbose = verbosity def __init__(self, shadowing, value_transform=None): self.shadowed = shadowing shadow = self.shadow = {} self.touched = {} for key in shadowing.keys(): shadow[key] = shadowing[key] self.value_transform = value_transform # defeats inheritance! careful! self.values = shadow.values self.items = shadow.items self.keys = shadow.keys self.has_key = shadow.has_key def is_shadowed(self, name): return self.touched.has_key(name) def __len__(self): return len(self.shadow) def commit(self, verbose=0): """apply updates to shadowed.""" import sys verbose = verbose or self.verbose if self.touched: shadowed = self.shadowed shadow = self.shadow value_transform = self.value_transform keys = shadowed.keys() if verbose: print "shadowdict oldkeys", keys for k in keys: del shadowed[k] keys = shadow.keys() if verbose: print "shadowdict newkeys", keys for k in shadow.keys(): value = shadow[k] if value_transform is not None: try: value = value_transform(value) except: raise "transform fails", (sys.exc_type, sys.exc_value, k, value) shadowed[k] = value self.touched = {} def __getitem__(self, key): return self.shadow[key] def __setitem__(self, key, item): from types import StringType if type(key) is not StringType: raise "nonstring", key if item is None: raise "none set", (key, item) self.touched[key] = 1 self.shadow[key] = item def __delitem__(self, key): self.touched[key] = 1 del self.shadow[key] # stored mutations on relations class Add_Tuples: """stored rel.add_tuples(tuples)""" def __init__(self, name): self.to_rel = name self.indb = None def initargs(self): return (self.to_rel,) def set_data(self, tuples, rel): """store self.data as tuple with tuple[-1] as to_rel, rest data""" attributes = tuple(rel.attributes()) ltuples = len(tuples) data = list(tuples) for i in xrange(ltuples): tdata = tuples[i].dump(attributes) data[i] = tdata self.data = tuple(data) def __repr__(self): from string import join datarep = map(repr, self.data) datarep = join(datarep, "\n ") return "add tuples to %s\n %s\n\n" % (self.to_rel, datarep) def marshaldata(self): return self.data def demarshal(self, data): self.data = data def relbind(self, db): self.indb = db def eval(self, dyn=None): """apply operation to db""" db = self.indb data = self.data name = self.to_rel rel = db[name] attributes = tuple(rel.attributes()) tuples = list(data) from sqlsem import kjbuckets undump = kjbuckets.kjUndump for i in xrange(len(tuples)): tuples[i] = undump(attributes, tuples[i]) rel.add_tuples(tuples) class Erase_Tuples(Add_Tuples): """stored rel.erase_tuples(seqnums)""" def set_data(self, seqnums, rel): seqnums = list(seqnums) self.data = tuple(seqnums) def __repr__(self): return "Erase seqnums in %s\n %s\n\n" % (self.to_rel, self.data) def eval(self, dyn=None): db = self.indb seqnums = self.data name = self.to_rel rel = db[name] rel.erase_tuples(seqnums) class Reset_Tuples(Add_Tuples): """stored rel.reset_tuples(tups, seqnums)""" def set_data(self, tups, seqnums, rel): attributes = tuple(rel.attributes()) dtups = list(tups) for i in xrange(len(dtups)): dtups[i] = dtups[i].dump(attributes) self.data = (tuple(dtups), tuple(seqnums)) def __repr__(self): (dtups, seqnums) = self.data pairs = map(None, seqnums, dtups) from string import join datarep = map(repr, pairs) datarep = join(datarep, " \n") return "Reset tuples in %s\n %s\n\n" % (self.to_rel, datarep) def eval(self, dyn=None): db = self.indb (dtups, seqnums) = self.data tups = list(dtups) rel = db[self.to_rel] attributes = tuple(rel.attributes()) from sqlsem import kjbuckets undump = kjbuckets.kjUndump for i in xrange(len(dtups)): tups[i] = undump(attributes, dtups[i]) rel.reset_tuples(tups, seqnums) # Log entry tags START = "START" COMMIT = "COMMIT" ABORT = "ABORT" UNREADABLE = "UNREADABLE" class Transaction_Logger: """quick and dirty Log implementation per transaction.""" verbose = verbosity def __init__(self, db_log, transactionid, is_scratch=0): self.db_log = db_log self.transactionid = transactionid # ignore all operations if set self.is_scratch = is_scratch self.dirty = 0 self.deferred = [] def reset(self): self.deferred = [] def __repr__(self): return "Transaction_Logger(%s, %s, %s)" % ( self.db_log, self.transactionid, self.is_scratch) def log(self, operation): verbose = self.verbose tid = self.transactionid if not self.is_scratch: self.deferred.append(operation) if verbose: print "tid logs", tid, operation def flush(self): verbose = self.verbose if not self.is_scratch: tid = self.transactionid deferred = self.deferred self.deferred = [] db_log = self.db_log if db_log: for operation in deferred: db_log.log(operation, tid) self.dirty = 1 elif verbose: print "scratch log ignored", tid, operation def commit(self, verbose=0): verbose = self.verbose or verbose tid = self.transactionid if verbose: print "committing trans log", tid if self.is_scratch: if verbose: print "scratch commit ignored", tid return if not self.dirty: if verbose: print "nondirty commit", tid return self.flush() db_log = self.db_log db_log.commit(verbose, tid) if verbose: print "transaction is considered recoverable", tid class DB_Logger: """quick and dirty global db logger.""" verbose = verbosity is_scratch = 0 def __init__(self, filename, backupname): self.filename = filename # backup name is never kept open: existence indicates log in use. self.backupname = backupname self.file = None self.dirty = 0 if self.verbose: print id(self), "created DB_Logger on", self.filename def __repr__(self): return "DB_Logger(%s)" % self.filename def startup(self): if self.verbose: print id(self), "preparing", self.filename # open happens automagically #self.file = open(self.filename, "wb") self.clear() self.dirty = 0 def shutdown(self): if self.verbose: print id(self), "shutting down log", self.filename file = self.file if file: file.close() self.file = None def clear(self): if self.verbose: print id(self), "clearing" self.shutdown() del_file(self.filename) def restart(self): if self.verbose: print id(self), "restarting log file", self.filename if self.file is not None: self.file.close() self.file = open(self.filename, "ab") dummy = open(self.backupname, "ab") dummy.close() self.dirty = 0 def clear_log_file(self): if self.verbose: print id(self), "clearing logfile", self.filename if self.file is not None: self.file.close() self.file = None del_file(self.filename) del_file(self.backupname) self.dirty = 0 def log(self, operation, transactionid=None): """transactionid of None means no transaction: immediate.""" file = self.file if file is None: self.restart() file = self.file verbose = self.verbose from sqlsem import serialize serial = serialize(operation) data = (transactionid, serial) if verbose: print id(self), "logging:", transactionid print operation checksum_dump(data, file) self.dirty = 1 def commit(self, verbose=0, transactionid=None): """add commit, if appropriate, flush.""" verbose = self.verbose or verbose if not self.dirty and transactionid is None: if verbose: print "commit not needed", transactionid return elif verbose: print "attempting commit", transactionid if transactionid is not None: self.log( COMMIT, transactionid ) if verbose: print "committed", transactionid if verbose: print "flushing", self.filename self.file.flush() self.dirty = 0 def recover(self, db, restart=1): import sys verbose = self.verbose filename = self.filename if verbose: print "attempting recovery from", self.filename file = self.file if file is not None: if verbose: print "closing file" self.file.close() self.file = None if verbose: print "opens should generate an error if no recovery needed" try: file = open(filename, "rb") file2 = open(self.backupname, "rb") except: if verbose: print "no recovery needed:", filename print sys.exc_type, sys.exc_value sys.exc_traceback = None return file2.close() if verbose: print "log found, recovering from", filename records = self.read_records(file) if verbose: print "scan for commit records" commits = {} for (i, (tid, op)) in records: if op==COMMIT: if verbose: print "transaction", tid, "commit at", i commits[tid] = i elif verbose: print i, tid, "operation\n", op if verbose: print commits, "commits total" if verbose: print "applying commited operations, in order" committed = commits.has_key from types import StringType for (i, (tid, op)) in records: if tid is None or (committed(tid) and commits[tid]>i): if type(op) is StringType: if verbose: print "skipping marker", tid, op if verbose: print "executing for", tid, i print op #### Note: silently eat errors unless verbose ### (eg in case of table recreation...) ### There should be a better way to do this!!! import sys try: op.relbind(db) op.eval() except: if verbose: print "error", sys.exc_type, sys.exc_value print "binding or evaluating logged operation:" print op elif verbose: print "uncommitted operation", tid, i op if verbose: print "recovery successful: clearing log file" self.clear() if restart: if verbose: print "recreating empty log file" self.startup() def read_records(self, file): """return log record as (index, (tid, op)) list""" verbose = self.verbose if verbose: print "reading log records to error" import sys records = {} from sqlsem import deserialize count = 0 while 1: try: data = checksum_undump(file) except: if verbose: print "record read terminated with error", len(records) print sys.exc_type, sys.exc_value break (transactionid, serial) = data operation = deserialize(serial) records[count] = (transactionid, operation) if verbose: print count, ": read for", transactionid print operation count = count+1 if verbose: print len(records), "records total" records = records.items() records.sort() return records def dump(self): verbose = self.verbose self.shutdown() print "dumping log" self.verbose = 1 try: file = open(self.filename, "rb") except: print "DUMP FAILED, cannot open", self.filename else: self.read_records(file) self.verbose = verbose self.restart() Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gffaq.html100644 1007 1403 56723 6747630567 25244 0ustar petrillipetrilli Chordate Solutions Gadfly FAQ
    Chordate Chordate Systems
    Solutions     		General information
    Installation
    Use
    feedback
    home
    Gadfly home
    Gadfly FAQ (Frequently asked questions)

    General information

    Installation
    Use

    Gadfly Frequently Asked Questions

    General information


    The following topics are of a general nature.

    • What is gadfly?

      Gadfly is a relational database management system which uses a large subset of very standard SQL as its query language and Python modules and optional Python/C extension modules as its underlying engine. Gadfly stores the active database in memory, with recovery logging to a file system. It supports an optional TCP/IP based client server mode and log based failure recovery for system or software failures (but not for disk failures).

    • What is the current version?

      The current version is Gadfly 1.0. To be sure you have the current version, please consult the version number that comes in the documentation.

      Gadfly 1.0 attempts to fix all known bugs in previous versions and adds a small number of features (hopefully without adding too many new bugs).

    • Where can I get it?

      Please get it from http://www.chordate.com

    • Why SQL and the relational model?

      Gadfly is based in SQL and the relational model primarily because the SQL query language and the relational model have been highly successful, are highly standard, and are well understood by a large number of programmers. If you understand standard SQL you already know how to use Gadfly -- and this distinguishes Gadfly from many similar database systems out there -- even ones which aren't "really free."

    • Why Python?

      Gadfly is based in Python because Python made the development of such a relatively sophisticated and standard SQL implementation feasible for one programmer, in his spare time, and also because it automatically made Gadfly portable to almost any computing platform. In addition, Gadfly can be used with Python to develop sophisticated data manipulation applications easily.

    • What is the License? Is it Free? Why?

      Gadfly can be used and modified in source form for any purpose, including commercial purposes. There is no explicit or implied warrantee for Gadfly, even though it is intended to be useful. Gadfly is free because I wanted people to use it, and I suspected they wouldn't if it wasn't free and highly standard, and furthermore I didn't want to risk the possibility of legal responsibility if people did use it and had problems.

    • You mean I can bundle it into my own product for free? Really?

      Yes. Please do. Several organizations have done so already.

    • Where does it run?

      To run Gadfly you need (1) a file system and (2) Python. If Python runs on your platform Gadfly should run there too. I have not been able to verify that this version runs on the Macintosh yet (since the Mac apparently has some fairly nonstandard file system conventions), but even if it doesn't it should run after a few trivial adjustments. Please let me know if Gadfly doesn't run on any of your platforms.

      Gadfly is expected to run "out of the box" on Windows 95/98, Windows NT, all Unices or unix like platforms (Solaris, IX, BSD, Irix, Linux) and anywhere else where Python runs and there is a filesystem (Windows CE, QNX, Mac, etcetera).

      Furthermore the Gadfly database storage format (based in the Python marshal format) is binary compatible between all these systems -- you can create a database on any one of the systems and use a binary transfer mechanism to any other system and the database should load and run.

    • What are the software/hardware requirements?

      Gadfly requires a Python installation and sufficient memory and disk on the target machine to store the live databases in question. Since live Gadfly databases are kept in memory during active use Gadfly is not appropriate for databases that approach the size of virtual memory. In practice this means that on modern inexpensive machines Gadfly can store and manipulate databases with tens of thousands of rows without difficulty. Unless your machine is large databases with millions of rows might be infeasible -- and even if memory is sufficient the loading and storing of the database might make startup and shutdown speed an issue. Many interesting database instances never approach this size.

    • Is there a query optimizer?

      Yes, Gadfly automatically optimizes queries using some relatively sophisticated methods that attempt to take advantage of any available indices, among other methods. Technically all optimization uses only "equality predicates" at this time, so queries involving many inequalities (eg, BETWEEN) and few or no equalities might be slow, or might create very large intermediate results. Most standard database applications use equality constraints extensively (eg, as foriegn keys or relationships) but if your application is, say, a scientific application that requires many inequality comparisons across multiple tables among floating point data, the Gadfly optimizer may not help much -- you may want to load the data into your own structures and hand optimize the access and combination methods.

      On the other hand, if your application uses equality predicates often enough you may find that the Gadfly optimizer does pretty well, perhaps better than a "hand coded home grown database" would do without a lot of work.

    • Is it fast?

      You probably want a benchmark comparison. I have none to offer. The query evaluation and load/store facilities for Gadfly seem to be pretty fast for non-huge databases -- particularly if you make intelligent use of indices. At this point the slowest part is the SQL parser itself. If you use a lot of similar SQL statements please consult the documentation on how to avoid reparsing statements by use of multiple cursors and dynamic parameters.

      Unverified anecdotal reports suggest that Gadfly is not noticably slower than other free or freeish portable database systems; some have suggested it can even be faster, at least for certain types of use.

      The entire query engine is designed to use the kjbuckets Python C extension module, and use of kjbuckets should speed the performance of Gadfly considerably -- Gadfly will run without it, but noticably slower (2x slower for even small databases, more for larger ones).

    • Are there data size limitations?

      There are no intrinsic limitations. For example a "varchar" can be of any size. That said, remember that a gadfly database, in the absense of hackery (eg, storing a filename instead of a value) stores all data in memory, so at some point large values may fill up virtual memory and the load/store operations can get slowish.

    • What about recovery after crashes?

      Gadfly supports a log with deferred updates recovery procedure, together with commits and rollbacks. This means that if your program crashes or if your computer crashes it should be able to restore a Gadfly database to the state of the database at the point of the last "commit". Any remaining bugs in this area are likely to have to do with data definition statements ("create" or "drop") so be careful to commit and checkpoint after modifying the data definitions. Of course, there are no known bugs, but it is possibly that not all possible combinations have been tested (this area is quite subtle, unfortunately :( ). Please see the recovery documentation for more information.

    • What about client/server based access?

      Gadfly supports a TCP/IP based client/server mode, together with a non-standard but highly flexible security paradigm for the server. Please see the client/server mode documentation.

    • What about concurrency control?

      Gadfly does not have true concurrency control. The only safe way to allow two concurrent agents to modify a single database is to have both of them communicate with the database via a gadfly server that arbitrates database accesses. The server will serve each agent serially -- one at a time -- in separate transactions each committed immediately.

      Of course, two programs can have read-only access to the same database in separate memory instances without any problems.

    • Is there a mailing list?

      Yes. Please go http://www.egroups.com/list/gadfly-rdbms/ for more information on the gadfly-rdbms mailing list, hosted by egroups.com.

    • Who uses it?

      My email suggests that quite a few people have been using Gadfly, including professional and industrial organizations of various sorts. From my vantage point it is not clear how serious all of these uses have been -- but some of them appear quite serious. Gadfly has been included in a number of CD-rom publications, such as Linux distributions.

    • Is support available?

      Yes, please contact Chordate for paid support. Unpaid support is more popular, but less reliable. Please report bugs and suggestions even if you don't want to pay ;).

    • What are the plans for Gadfly?

      At this point the current plan is to maintain the current implementation and fix any bugs that arise. Some time in the distant future (several months maybe) a new release with major new features might arrive, but only if the new features allow existing applications to run. Gadfly will support backwards compatibility of existing databases.

    • How do I contribute some code that uses Gadfly?

      There is no formal mechanism. One possible approach would be to join the Python Software Association and then get a starship account and then put your contributed code there. Chordate may add links to contributed code to the Gadfly documentation at their discretion.

    Installation

    This section relates to the installation of Gadfly and connecting Gadfly to other software.

    • Where is sqlwhere?

      If you have problems with the sqlwhere module you probably have not installed gadfly or have installed it incorrectly. Gadfly requires an installation procedure. Please see the documentation.

    • I get an ImportError!

      The gadfly modules must all be on the Python Path for a given application to use gadfly. 

      import sys
gadflydirectory = "C:\\gadfly" # edit as appropriate
sys.path.append(gadflydirectory)
      Or if you don't understand that please look to your Python documentation.

    • Why not use hierarchical packages?

      Gadfly doesn't use the standard Python package mechanism due to the need to support Python1.4 and to be backwards compatibly to existing applications. Please suggest a way to use packages that won't break existing applications.

    • Does Gadfly support ODBC or JDBC?

      Although the Gadfly SQL subset is based on the ODBC 2.0 SQL definition Gadfly does not support the C-level ODBC calling mechanism. All direct accesses to Gadfly must use Python modules at this time.

    • How can I move a Gadfly database instance from one location/machine to another?

      A gadfly database instance as stored in a file system directory may be copied to another directory even on another machine using any binary file copy mechanism. You must copy all files relating to the database instance in the gadfly database directory to the destination, and be sure that if you are copying across different platforms to use a binary copy mechanism (eg, ftp in binary mode).

    • How can I access gadfly from another program?

      The only supported API (applications program interface) for gadfly at this writing is the Python Database API either using direct access or via the client/server mechanism. Although you must use Python to access a gadfly database at this time it is possible to embed a Python instance in another program. Please see the Python documentation.

    • What database size limits are there?

      As mentioned there are no intrinsic limits (eg, a varchar can be of any size) except for the limitations of memory and the possibility that the load/store mechanism may get too slow if the database grows too large.

    • What are the file types in the gadfly database directory? 

      *.grl -- a relation representation where * is the relation name.
*.brl -- a back-up relation representation (for possible recovery).
*.gfd -- a data definitions file where * is the database name.
*.bfd -- a back-up data definitions file (for possible recovery).
*.gfl -- a log file where * is the database name
*.glb -- a back-up log file (for possible recovery).

    Use


    The following section relates to the use of gadfly.

    • Does Gadfly support virtual tables (VIEWS)? Quantifiers? EXISTS? Aggregates? Groupings? Indices?

      Of course it does! Gadfly supports a very large SQL subset. See the additional documentation for more detailed information.

    • How standard is the SQL subset supported?

      Gadfly SQL is based on ODBC 2.0 SQL which in turn is based on an SQL standard draft. This means that Gadfly SQL adheres closely to the SQL you find in many other database products and documented in many books and other documentation. A number of people have implemented Gadfly databases and transferred the SQL with few to no modifications from the implementation directly to Oracle or MS-Access, for example.

    • Are BLOBS (binary large objects) and arbitrary string values supported?

      Yes, varchars have no intrinsic size limit and can be used to store marshalled or pickled Python BLOBS -- but the application using gadfly will have to know when to "deserialize" the objects (using marshal or pickle or other mechanisms). For example it is even possible to store Python byte code objects in a gadfly database in this way. In particular gadfly stores all strings, including strings with null bytes and newlines, but for such strings you must use dynamic parameters (or other mechanisms that avoid embedding the string directly into the SQL syntax), like: 

         s = chr(0)+chr(10)
   cursor.insert("insert into table x(v) values (?)", (s,))
      NOT 
         s = chr(0)+chr(10)
   cursor.insert("insert into table x(v) values ('%s')" % (s,))
      Since the SQL parser will choke on the latter.

    • How can I find the column names in a "select *"?

      The nasty answer is "don't use select *", but if you really want to you can get the order of names for the columns from the description attribute for a cursor. 

      >>> from gadfly import gadfly
>>> g = gadfly("test", "dbtest")
>>> c = g.cursor()
>>> c.execute("select * from work")
>>> c.description
(('RATE', None, None, None, None, None, None), ('NAME', None, None, None, None,
None, None), ('HOURS', None, None, None, None, None, None))
>>> print c.pp()
RATE  | NAME    | HOURS
=======================
40.2  | sam     | 30
10.2  | norm    | 45
5.4   | woody   | 80
4.4   | diane   | 3
12.9  | rebecca | 120
200.0 | cliff   | 26
3.5   | carla   | 9
      IE, c.description[i][0] gives the name of the ith column. The query mechanism essentially randomizes the order of the columns in a select * and you cannot rely on the engine producing columns in any specific order unless you specify the order in the query explicitly.

    • Can I add my own table implementation?

      Yes you can, to a limited extent. Use the remote view protocol in gfintrospect.py. The table you add can extract information from any source but must not recursively query the same database instance (using a Python implementation) and place it into a Gadfly database either only once on first usage or once per query. The table added cannot be updated via SQL and you cannot load "only the part of the table you need for this query." The table added must be explicitly re-added during the database initialization on each usage, and if you implement the table incorrectly you may cause some gadfly queries to crash. Use with caution: this is an advanced feature. See remotetest.py.

    • Why can't I update my own table implementation via SQL?

      Although it is possible to create a protocol which allows non standard table implementations to be updated and optimized via SQL, the implications to the query optimization mechanism and the crash recovery strategy are not clear and may be quite subtle. At this time the implementation opts to avoid possible bugs by not supporting such features, although programmers are welcome to experiment at their own risk, with the understanding that their experimental modifications may not be supported in future releases.

      It is perfectly possible to change the number of rows or values in the rows of your own table implementations without using SQL or gadfly, however and have the updates automatically reflected in the table instance in the database. [You should not, however, change the number or names of the columns.]

      For example gfintrospect.DictKeyValueView will "wrap" a Python dictionary as a gadfly table and automatically reflect modifications made by an external Python program to the dictionary.

    • How do you define a primary key?

      New in 1.0 you can get the effect of a primary key by defining a unique index on the primary key columns 

      create unique index pkey on person(firstname, lastname)
      Effectively will enforce a primary key constraint for (firstname, lastname) on the person table.

    • What about NULLs, Triggers and other missing stuff?

      The present release opted not to add missing standard or non-standard features that were likely to cause major modifications to large sections of the implementation, and therefore were likely to introduce bugs.

    • Where is the LIKE predicate?

      The LIKE predicate for string matching is still not supported at the SQL level. For what it's worth, it is easy to use Python's string matching (regex, re, string.search, etcetera) facilities on the result of a query. Also, for what it's worth, since the gadfly optimizer won't easily be able to optimize for string matching the "by hand" method would essentially be what gadfly would do anyway, without major modifications to the implementation.

    • After a crash Gadfly won't recover! Help!

      This shouldn't happen, but did happen (at least once) for a previous release. If it happens again, you can explicitly delete the log files from the database directory in order to recover the database to a state which may or may not correspond to the state of the database at the second to last commit/checkpoint operation. It is possible, but not likely, that the database state will include some but not all updates from the last commit, but, to repeat, it shouldn't happen. Please report the problem if it occurs again.

    feedback
    home
    Gadfly home Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gfinstall.py100644 1007 1403 2760 6747630570 25571 0ustar petrillipetrilli#!/usr/local/bin/python """Gadfly installation script. Build the sql grammar. usage python for a simple install or python force for a full rebuild (with grammar regeneration). In the current directory find or create sql.mar and sqlwhere.py where sql.mar has the marshalled grammar data structures for parsing sql and sqlwhere.py is a module that indicates where the grammar file is as value of sqlwhere.filename. """ marfile = "sql.mar" modfile = "sqlwhere.py" print __doc__ from os import getcwd, path cwd = getcwd() modtemplate =""" '''this module indicates where the sql datastructures are marshalled Auto generated on install: better not touch! ''' filename = %s """ #wheremod = cwd + "/" + modfile #where = cwd + "/" + marfile wheremod = path.join(cwd, modfile) where = path.join(cwd, marfile) print print "now creating", wheremod f = open(wheremod, "w") f.write( modtemplate % (`where`,) ) f.close() from sqlgen import BuildSQL, getSQL import sys argv = sys.argv force = 0 #print argv if len(argv)>1 and argv[1]=="force": force = 1 if not force: try: sql = getSQL() except: print "exception", sys.exc_type, sys.exc_value print "during load of SQL grammar structures." print "Apparently the SQL grammar requires regeneration" force = 1 if force: print "now generating parser structures (this might take a while)..." #where = cwd + "/" + marfile print "building in", where sql = BuildSQL(where) print print "done." Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gfintrospect.py100644 1007 1403 11613 6747630570 26332 0ustar petrillipetrilli""" View based introspection and extension views """ import gfdb0 class RemoteView(gfdb0.View): """Virtual superclass. See text for methods and members to define.""" # Usually redefine __init__ def __init__(self): pass # set static (static=1) or dynamic (static=0) # for static tuple seq is generated once per load # for non-static tuple seq is regenerated once per query # which uses the view. static = 0 # define the column_names column_names = ['Column1'] # define the row generator def listing(self): """return list of values (1 column) or list of tuples of values (>1 column). size of elts should match number of columns.""" return [0] # possibly redefine __repr__ and irepr def __repr__(self): return "" % (self.__class__, id(self)) irepr = __repr__ # for introspective methods possibly redefine relbind def relbind(self, db, atts): return self ### don't touch the following unless you are a guru! cached_rows = None def uncache(self): if self.static: return self.cached_rows = None def attributes(self): from string import upper return map(upper, self.column_names) def rows(self, andseqs=0): cached_rows = self.cached_rows if cached_rows is None: tups = list(self.listing()) from sqlsem import kjbuckets undump = kjbuckets.kjUndump attributes = tuple(self.attributes()) for i in xrange(len(tups)): tups[i] = undump(attributes, tups[i]) cached_rows = self.cached_rows = tups tups = cached_rows[:] if andseqs: return (tups, range(len(tups))) else: return tups class DualView(RemoteView): """static one row one column view for testing. (Inspired by Oracle DUAL relation).""" # trivial example extension view static = 1 column_names = ['Column1'] def listing(self): return [0] class DictKeyValueView(RemoteView): """Less trivial example. Dict keys/values converted to strings""" static = 0 # regenerate in case dict changes column_names = ["key", "value"] mapstring = 1 def __init__(self, dict=None): if dict is None: dict = {} self.dict = dict def listing(self): items = self.dict.items() if self.mapstring: def mapper(item): return tuple(map(str, item)) return map(mapper, items) else: return items class RelationsView(DictKeyValueView): """list of relations and whether they are views.""" column_names = ["table_name", "is_view"] mapstring = 0 def relbind(self, db, atts): rels = db.rels dict = {} for relname in rels.keys(): dict[relname] = rels[relname].is_view self.dict = dict return self class IndicesView(DictKeyValueView): """list of indices and relations they index""" column_names = ["index_name", "table_name", "is_unique"] mapstring = 0 def relbind(self, db, atts): rels = db.rels dict = {} for relname in rels.keys(): rel = rels[relname] if not rel.is_view: index_list = rels[relname].index_list for index in index_list: dict[index.name] = (relname, index.unique) self.dict = dict return self def listing(self): L = [] dict = self.dict keys = dict.keys() for k in keys: L.append( (k,) + dict[k] ) return L class DataDefsView(DictKeyValueView): """Data defs (of non-special views) and definition dumps.""" column_names = ["name", "defn"] mapstring = 1 def relbind(self, db, atts): self.dict = db.datadefs return self class ColumnsView(RemoteView): """table_names and columns therein.""" column_names = ["table_name", "column_name"] def relbind(self, db, atts): rels = db.rels pairs = [] for relname in rels.keys(): for att in rels[relname].attributes(): pairs.append( (relname, att) ) self.pairs = pairs return self def listing(self): return self.pairs class IndexAttsView(ColumnsView): """indices and attributes.""" column_names = ["index_name", "column_name"] def relbind(self, db, atts): indices = db.indices pairs = [] for iname in indices.keys(): for att in indices[iname].attributes(): pairs.append( (iname, att) ) self.pairs = pairs return self Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gfrecover.html100644 1007 1403 14641 6747630570 26125 0ustar petrillipetrilli Gadfly: recovery

    Gadfly Recovery

    In the event of a software glitch or crash Gadfly may terminate without having stored committed updates. A recovery strategy attempts to make sure that the unapplied commited updates are applied when the database restarts. It is always assumed that there is only one primary (server) process controlling the database (possibly with multiple clients).

    Gadfly uses a simple LOG with deferred updates recovery mechanism. Recovery should be possible in the presence of non-disk failures (server crash, system crash). Recovery after a disk crash is not available for Gadfly as yet, sorry.

    Due to portability problems Gadfly does not prevent multiple processes from "controlling" the database at once. For read only access multiple instances are not a problem, but for access with modification, the processes may collide and corrupt the database. For a read-write database, make sure only one (server) process controls the database at any given time.

    The only concurrency control mechanism that provides serializability for Gadfly as yet is the trivial one -- the server serves all clients serially. This will likely change for some variant of the system at some point.

    This section explains the basic recovery mechanism.

    Normal operation

    Precommit

    During normal operations any active tables are in memory in the process. Uncommitted updates for a transaction are kept in "shadow tables" until the transaction commits using 

       connection.commit()
    The shadow tables remember the mutations that have been applied to them. The permanent table copies are only modified after commit time. A commit commits all updates for all cursors for the connection. Unless the autocommit feature is disabled (see below) a commit normally always triggers a checkpoint too.

    A rollback 
       connection.rollback()
    explicitly discards all uncommitted updates and restores the connection to the previously committed state.

    There is a 3rd level of shadowing for statement sequences executed by a cursor. In particular the design attempts to make sure that if 

      cursor.execute(statement)
    fails with an error, then the shadow database will contain no updates from the partially executed statement (which may be a sequence of statements) but will reflect other completed updates that may have not been committed.

    Commit

    At commit, operations applied to shadow tables are written out in order of application to a log file before being permanently applied to the active database. Finally a commit record is written to the log and the log is flushed. At this point the transaction is considered committed and recoverable, and a new transaction begins. Finally the values of the shadow tables replace the values of the permanent tables in the active database, (but not in the database disk files until checkpoint, if autocheckpoint is disabled).

    Checkpoint

    A checkpoint operation brings the persistent copies of the tables on disk in sync with the in-memory copies in the active database. Checkpoints occur at server shut down or periodically during server operation. The checkpoint operation runs in isolation (with no database access allowed during checkpoint).

    Note: database connections normally run a checkpoint after every commit, unless you set 

        connection.autocheckpoint = 0
    which asks that checkpoints be done explicitly by the program using 
        connection.commit() # if appropriate
    connection.checkpoint()
    Explicit checkpoints should make the database perform better, since the disk files are written less frequently, but in order to prevent unneeded (possibly time consuming) recovery operations after a database is shutdown and restarted it is important to always execute an explicit checkpoint at server shutdown, and periodically during long server runs.

    Note that if any outstanding operations are uncommitted at the time of a checkpoint (when autocheckpoint is disabled) the updates will be lost (ie, it is equivalent to a rollback).

    At checkpoint the old persistent value of each table that has been updated since the last checkpoint is copied to a back up file, and the currently active value is written to the permanent table file. Finally if the data definitions have changed the old definitions are stored to a backup file and the new definitions are written to the permanent data definition file. To signal successful checkpoint the log file is then deleted.

    At this point (after log deletion) the database is considered quiescent (no recovery required). Finally all back up table files are deleted. [Note, it might be good to keep old logs around... Comments?]

    Each table file representation is annotated with a checksum, so the recovery system can check that the file was stored correctly.

    Recovery

    When a database restarts it automatically determines whether the last active instance shut down normally and whether recovery is required. Gadfly discovers the need for recovery by detecting a non-empty current log file.

    To recover the system Gadfly first scans the log file to determine committed transactions. Then Gadfly rescans the log file applying the operations of committed transactions to the in memory table values in the order recorded. When reading in table values for the purpose of recovery Gadfly looks for a backup file for the table first. If the backup is not corrupt, its value is used, otherwise the permanent table file is used.

    After recovery Gadfly runs a normal checkpoint before resuming normal operation.

    Please note: Although I have attempted to provide a robust implementation for this software I do not guarantee its correctness. I hope it will work well for you but I do not assume any legal responsibility for problems anyone may have during use of these programs.

    feedback
    home
    Gadfly home Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gfserve.py100644 1007 1403 46076 6747630570 25277 0ustar petrillipetrilli"""gadfly server mode script usage python gfserve.py port database directory password [startup] test example python gfserve.py 2222 test dbtest admin gfstest port is the port to listen to database is the database to start up. (must exist!) directory is the directory the database is in. password is the administrative access password. startup if present should be the name of a module to use for startup. The Startup module must contain a function Dict = startup(admin_policy, connection, Server_instance) which performs any startup actions on the database needed and returns either None or a Dictionary of name --> policy objects where the policy objects describe policies beyond the admin policy. The startup function may also modify the admin_policy (disabling queries for example). The arguments passed to startup are: admin_policy: the administrative policy eg you could turn queries off for admin, using admin only for server maintenance, or you could add prepared queries to the admin_policy. connection: the database connection eg you could perform some inserts before server start also needed to make policies. Server_instance Included for additional customization. Create policies using P = gfserve.Policy(name, password, connection, queries=0) -- for a "secure" policy with only prepared queries allowed, or P = gfserve.Policy(name, password, connection, queries=1) -- for a policy with full access arbitrary statement execution. add a "named prepared statement" to a policy using P[name] = statement for example P["updatenorm"] = ''' update frequents set bar=?, perweek=? where drinker='norm' ''' in this case 'updatenorm' requires 2 dynamic parameters when invoked from a client. Script stdout lists server logging information. Some server administration services (eg shutdown) are implemented by the script interpretion of gfclient.py. """ import socket, gadfly from gfsocket import \ reply_exception, reply_success, Packet_Reader, certify def main(): """start up the server.""" import sys try: done = 0 argv = sys.argv nargs = len(argv) #print nargs, argv if nargs<5: sys.stderr.write("gfserve: not enough arguments: %s\n\n" % argv) sys.stderr.write(__doc__) return [port, db, dr, pw] = argv[1:5] print "gfserve startup port=%s db=%s, dr=%s password omitted" % ( port, db, dr) from string import atoi port = atoi(port) startup = None if nargs>5: startup = argv[5] print "gfserve: load startup module %s" % startup S = Server(port, db, dr, pw, startup) S.init() print "gfserve: server initialized, setting stderr=stdout" sys.stderr = sys.stdout print "gfserve: starting the server" S.start() done = 1 finally: if not done: print __doc__ # general error ServerError = "ServerError" # no such prepared name PreparedNameError = "PreparedNameError" # actions # shut down the server (admin policy only) # arguments = () # shutdown the server with no checkpoint SHUTDOWN = "SHUTDOWN" # restart the server (admin only) # arguments = () # restart the server (recover) # no checkpoint RESTART = "RESTART" # checkpoint the server (admin only) # arguments = () # checkpoint the server CHECKPOINT = "CHECKPOINT" # exec prepared statement # arguments = (prepared_name_string, dyn=None) # execute the prepared statement with dynamic args. # autocommit. EXECUTE_PREPARED = "EXECUTE_PREPARED" # exec any statement (only if not disabled) # arguments = (statement_string, dyn=None) # execute the statement with dynamic args. # autocommit. EXECUTE_STATEMENT = "EXECUTE_STATEMENT" ACTIONS = [SHUTDOWN, RESTART, CHECKPOINT, EXECUTE_PREPARED, EXECUTE_STATEMENT] class Server: """database server: listen for commands""" verbose = 1 # wait X minutes on each server loop select_timeout = 60*5 # do a checkpoint each X times thru server loop check_loop = 5 # for now works like finger/http # == each command is a separate connection. # all sql commands constitute separate transactions # which are automatically committed upon success. # for now commands come in as # 1 length (marshalled int) # 2 (password, data) (marshalled tuple) # responses come back as # 1 length (marshalled int) # 2 results (marshalled value) def __init__(self, port, db, dr, pw, startup=None): self.port = port self.db = db self.dr = dr self.pw = pw self.startup = startup self.connection = None self.socket = None # prepared cursors dictionary. self.cursors = {} self.policies = {} self.admin_policy = None def start(self): """after init, listen for commands.""" from gfsocket import READY, ERROR, unpack_certified_data import sys verbose = self.verbose socket = self.socket connection = self.connection policies = self.policies admin_policy = self.admin_policy from select import select pending_connects = {} while 1: try: # main loop if self.check_loop<0: self.check_loop=5 for i in xrange(self.check_loop): if verbose: print "main loop on", socket, connection # checkpoint loop sockets = [socket] if pending_connects: sockets = sockets + pending_connects.keys() # wait for availability if verbose: print "server: waiting for connection(s)" (readables, dummy, errors) = select(\ sockets, [], sockets[:], self.select_timeout) if socket in errors: raise ServerError, \ "listening socket in error state: aborting" # clean up error connection sockets for s in errors: del pending_connects[s] s.close() # get a new connection, if available if socket in readables: readables.remove(socket) (conn, addr) = socket.accept() if 1 or verbose: print "connect %s" % (addr,) reader = Packet_Reader(conn) pending_connects[conn] = reader # poll readable pending connections, if possible for conn in readables: reader = pending_connects[conn] mode = reader.mode if not mode==READY: if mode == ERROR: # shouldn't happen try: conn.close() del pending_connects[conn] except: pass continue else: try: reader.poll() finally: pass # AFTER DEBUG CHANGE THIS! # in blocking mode, service ready request, # commit on no error for conn in pending_connects.keys(): reader = pending_connects[conn] mode = reader.mode if mode == ERROR: try: del pending_connects[conn] conn.close() except: pass elif mode == READY: try: del pending_connects[conn] data = reader.data (actor_name, cert, md) = \ unpack_certified_data(data) # find the policy for this actor if not policies.has_key(actor_name): if verbose: print "no such policy: "+actor_name reply_exception(NameError, "no such policy: "+actor_name, conn) policy = None else: if verbose: print "executing for", actor_name policy = policies[actor_name] policy.action(cert, md, conn) except SHUTDOWN: if policy is admin_policy: print \ "shutdown on admin policy: terminating" connection.close() socket.close() # NORMAL TERMINATION: return except RESTART: if policy is admin_policy: print \ "restart from admin policy: restarting connection" connection.restart() except CHECKPOINT: if policy is admin_policy: print \ "checkpoint from admin policy: checkpointing now." connection.checkpoint() except: tb = sys.exc_traceback info = "%s %s" % (sys.exc_type, str(sys.exc_value)) if verbose: from traceback import print_tb print_tb(tb) print "error in executing action: "+info reply_exception( ServerError, "exception: "+info, conn) #break # stop after first request serviced! except: # except of main while 1 try statement tb = sys.exc_traceback ty = sys.exc_type va = sys.exc_value print "UNEXPECTED EXCEPTION ON MAINLOOP" from traceback import print_tb print_tb(tb) print "exception:", ty, va if not pending_connects: pending_connects = {} print "server: checkpointing" connection.checkpoint() def init(self): self.getconnection() self.startup_load() # get socket last in case of failure earlier self.getsocket() HOST = "" BACKLOG = 5 def getsocket(self): """get the listening socket""" verbose = self.verbose import socket, sys if verbose: print "initializing listener socket" sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM) try: if verbose: print "trying to set REUSEADDR",\ sock.getsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR) sock.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, 1) except: if verbose: print "set of REUSEADDR failed", sys.exc_type, sys.exc_value pass sock.bind(self.HOST, self.port) sock.listen(self.BACKLOG) self.socket = sock return sock def getconnection(self): """get the db connection""" from gadfly import gadfly c = self.connection = gadfly(self.db, self.dr) # don't automatically checkpoint upon commit c.autocheckpoint = 0 def startup_load(self): """setup the policies and load startup module""" admin_policy = self.get_admin_policy() module_name = self.startup if module_name: module = __import__(module_name) # startup(admin_policy, connection, Server_instance) test = module.startup(admin_policy, self.connection, self) if test is not None: self.policies = test self.policies["admin"] = admin_policy def get_admin_policy(self): """return the admin policy for priviledged access.""" p = self.admin_policy = Policy( "admin", self.pw, self.connection, queries=1) return p class Policy: """security policy""" verbose = 0 # allow arbitrary sql statments general_queries = 0 # dictionary of named accesses as strings named_accesses = None # dictionary of prepared named accesses prepared_cursors = None def __init__(self, name, password, connection, queries=0): """create a policy (name, password, connection) name is the name of the policy password is the access policy (None for no password) connection is the database connection. set queries to allow general accesses (unrestricted) """ if self.verbose: print "policy.__init__", name self.general_queries = queries self.name = name self.password = password self.connection = connection self.socket = None self.named_accesses = {} self.prepared_cursors = {} def __setitem__(self, name, value): if self.verbose: print "policy", self.name, ":", (name, value) from types import StringType if type(name) is not StringType or type(value) is not StringType: raise ValueError, "cursor names and contents must be strings" self.named_accesses[name] = value def execute_named(self, name, params=None): """execute a named (prepared) sql statement""" if self.verbose: print "policy", self.name, "executes", name, params na = self.named_accesses pc = self.prepared_cursors con = self.connection if not na.has_key(name): raise PreparedNameError, "unknown access name: %s" % name stat = na[name] if pc.has_key(name): # get prepared query cursor = pc[name] else: # prepare a new cursor pc[name] = cursor = con.cursor() return self.execute(cursor, stat, params) def execute(self, cursor, statement, params=None): """execute a statement in a cursor""" if self.verbose: print "policy", self.name, "executes", statement, params cursor.execute(statement, params) # immediate commit! self.connection.commit() try: result = cursor.fetchall() description = cursor.description result = (description, result) except: result = None return result def execute_any_statement(self, statement, params=None): """execute any statement.""" if self.verbose: print "policy", self.name, "executes", statement, params con = self.connection cursor = con.cursor() return self.execute(cursor, statement, params) def action(self, certificate, datastring, socket): """perform a database/server action after checking certificate""" verbose = self.verbose if verbose: print "policy", self.name, "action..." # make sure the certificate checks out if not self.certify(datastring, certificate, self.password): raise ServerError, "password certification failure" # unpack the datastring from marshal import loads test = loads(datastring) #if verbose: #print "data is", test (action, moredata) = test import sys if action in ACTIONS: action = "policy_"+action myaction = getattr(self, action) try: data = apply(myaction, moredata+(socket,)) #self.reply_success(data) # pass up server level requests as exceptions except SHUTDOWN, detail: raise SHUTDOWN, detail except RESTART, detail: raise RESTART, detail except CHECKPOINT, detail: raise CHECKPOINT, detail except: tb = sys.exc_traceback exceptiondata = "%s\n%s" %(sys.exc_type, str(sys.exc_value)) if verbose: from traceback import print_tb print_tb(tb) self.reply_exception(ServerError, "unexpected exception: "+exceptiondata, socket) raise ServerError, exceptiondata else: raise ServerError, "unknown action: "+`action` def certify(self, datastring, certificate, password): # hook for subclassing return certify(datastring, certificate, password) def policy_SHUTDOWN(self, socket): self.reply_success("attempting server shutdown", socket) raise SHUTDOWN, "please shut down the server" def policy_RESTART(self, socket): self.reply_success("attempting server restart", socket) raise RESTART, "please restart the server" def policy_CHECKPOINT(self, socket): self.reply_success("attempting server checkpoint", socket) raise CHECKPOINT, "please checkpoint the server" def policy_EXECUTE_PREPARED(self, name, dyn, socket): try: result = self.execute_named(name, dyn) self.reply_success(result, socket) except PreparedNameError, detail: self.reply_exception(PreparedNameError, "no such prepared statement: "+name, socket) def policy_EXECUTE_STATEMENT(self, stat, dyn, socket): if not self.general_queries: self.reply_exception(ServerError, "general statements disallowed on this policy", socket) raise ServerError, "illegal statement attempt for: "+self.name result = self.execute_any_statement(stat, dyn) self.reply_success(result, socket) def reply_exception(self, exc, info, socket): # hook for subclassing reply_exception(exc, info, socket) def reply_success(self, data, socket): # hook for subclassing reply_success(data, socket) if __name__=="__main__": main() Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gfsocket.py100644 1007 1403 15627 6747630570 25441 0ustar petrillipetrilli """socket interactions for gadfly client and server""" from select import select # responses SUCCESS = "SUCCESS" EXCEPTION = "EXCEPTION" def reply_exception(exception, info, socket): """send an exception back to the client""" # any error is invisible to client from gfserve import ServerError import sys try: reply( (EXCEPTION, (exception, info)), socket) except: #info = "%s %s" % (sys.exc_type, sys.exc_value) socket.close() #raise ServerError, "reply_exception failed: "+`info` def reply_success(data, socket): """report success with data back to client""" reply( (SUCCESS, data), socket) def reply(data, socket): from marshal import dumps marshaldata = dumps(data) send_packet(socket, marshaldata) socket.close() def send_packet(socket, data): """blast out a length marked packet""" send_len(data, socket) socket.send(data) def send_len(data, socket): """send length of data as cr terminated int rep""" info = `len(data)`+"\n" socket.send(info) def send_certified_action(actor_name, action, arguments, password, socket): from marshal import dumps marshaldata = dumps( (action, arguments) ) cert = certificate(marshaldata, password) #print actor_name, cert, marshaldata marshaldata = dumps( (actor_name, cert, marshaldata) ) send_packet(socket, marshaldata) def unpack_certified_data(data): from marshal import loads # sanity check unpack = (actor_name, certificate, marshaldata) = loads(data) return unpack def recv_data(socket, timeout=10): """receive data or time out""" from time import time endtime = time() + timeout reader = Packet_Reader(socket) done = 0 while not done: timeout = endtime - time() if timeout<0: raise IOError, "socket time out (1)" (readable, dummy, error) = select([socket], [], [socket], timeout) if error: raise IOError, "socket in error state" if not readable: raise IOError, "socket time out (2)" reader.poll() done = (reader.mode==READY) return reader.data def interpret_response(data): """interpret response data, raise exception if needed""" from marshal import loads (indicator, data) = loads(data) if indicator==SUCCESS: return data elif indicator==EXCEPTION: # ??? raise EXCEPTION, data else: raise ValueError, "unknown indicator: "+`indicator` # packet reader modes LEN = "LEN" DATA = "DATA" READY = "READY" ERROR = "ERROR" BLOCK_SIZE = 4028 LEN_LIMIT = BLOCK_SIZE * 10 class Packet_Reader: """nonblocking pseudo-packet reader.""" # packets come in as decimal_len\ndata # (note: cr! not crlf) # kick too large requests if set limit_len = LEN_LIMIT def __init__(self, socket): self.socket = socket self.length = None self.length_remaining = None self.len_list = [] self.data_list = [] self.received = "" self.data = None self.mode = LEN def __len__(self): if self.mode is LEN: raise ValueError, "still reading length" return self.length def get_data(self): if self.mode is not READY: raise ValueError, "still reading" return self.data def poll(self): mode = self.mode if mode is READY: raise ValueError, "data is ready" if mode is ERROR: raise ValueError, "socket error previously detected" socket = self.socket (readable, dummy, error) = select([socket], [], [socket], 0) if error: self.socket.close() self.mode = ERROR raise ValueError, "socket is in error state" if readable: if mode is LEN: self.read_len() # note: do not fall thru automatically elif mode is DATA: self.read_data() def read_len(self): """assume socket is readable now, read length""" socket = self.socket received = self.received len_list = self.len_list if not received: # 10 bytes at a time until len is read. received = socket.recv(10) while received: # consume, test one char input = received[0] received = received[1:] if input == "\n": # done reading length from string import join, atoi try: length = self.length = atoi(join(len_list, "")) except: self.mode = ERROR socket.close() raise ValueError, "bad len string? "+`len_list` self.received = received self.length_remaining = length self.mode = DATA limit_len = self.limit_len if limit_len and length>limit_len: raise ValueError, "Length too big: "+`(length, limit_len)` return if len(len_list)>10: self.mode = ERROR socket.close() raise ValueError, "len_list too long: "+`len_list` len_list.append(input) if not received: (readable, dummy, error) = select(\ [socket], [], [socket], 0) if error: self.mode = ERROR socket.close() raise ValueError, "socket in error state" if readable: received = socket.recv(10) # remember extra data received. self.received = received def read_data(self): # assume socket is readable socket = self.socket received = self.received length_remaining = self.length_remaining data_list = self.data_list if received: data_list.append(received) self.received = "" length_remaining = length_remaining - len(received) recv_len = max(length_remaining, BLOCK_SIZE) received = socket.recv(recv_len) if received: data_list.append(received) length_remaining = length_remaining - len(received) if length_remaining<1: self.mode = READY from string import join self.data = join(data_list, "") self.length_remaining = length_remaining def certificate(String, password): """generate a certificate for a string, using a password""" from md5 import new if not String: raise ValueError, "cannot generate certificate for empty string" taggedstring = password + String return new(taggedstring).digest() def certify(String, cert, password): """check a certificate for a string""" return certificate(String, password) == cert Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gfstest.py100644 1007 1403 15507 6747630571 25311 0ustar petrillipetrilli """test script for gadfly client and server Usage: This script interacts with the test database generated by gftest.py. To start the server from the directory containing the dbtest directory use: python gfstest.py start THIS WILL ONLY WORK IF YOU CREATED THE test DATABASE IN DIRECTORY dbtest FIRST USING python gftest.py dbtest UNLESS YOU RUN THE SERVER IN THE BACKGROUND THE SERVER WILL HOG THE WINDOW YOU STARTED IT IN AND YOU WILL HAVE TO USE ANOTHER WINDOW UNTIL THE SERVER IS SHUT DOWN (SEE BELOW). Then from *anywhere* (on the same machine) access the database using python gfstest.py restart - restart the server (reread the database) python gfstest.py checkpoint - force checkpoint the server python gfstest.py queries - run some example queries and updates python gfstest.py policy_test - test the policies test and test1 created by the startup function in this module. python gfstest.py bogusshutdown - attempt to shut down the server with a bogus password [should generate an exception] ...and finally python gfstest.py shutdown - shut down the server for real. As mentioned the startup function of this module illustrates how to create a "startup" function for a server and initialize policy objects with named, prepared queries. """ PORT = 2222 DB = "test" DBDIR = "dbtest" PW = "admin" STARTUP = "gfstest" import sys, socket def main(): argv = sys.argv command = argv[1] if command=="start": print "attempting to start the server" from gfserve import Server print "making a server on", PORT, DB, DBDIR, PW, STARTUP S = Server(PORT, DB, DBDIR, PW, STARTUP) print "initializing the server" S.init() print "starting the server", S.connection S.start() elif command=="shutdown": dosimple("shutdown", PW) elif command=="bogusshutdown": print "BOGUS shutdown attempt" dosimple("shutdown", "bad password") elif command=="restart": dosimple("restart", PW) elif command=="checkpoint": dosimple("checkpoint", PW) elif command=="queries": doqueries() elif command=="policy_test": policy_test() else: print "unknown command", command print __doc__ def policy_test(): """test the test1 and test policies""" print "testing non-admin policies test and test1" from gfclient import gfclient import sys machine = socket.gethostname() conn = gfclient("test", PORT, "test", machine) cursor = conn.cursor() print "testing test policy: nan values before:" cursor.execute_prepared("getnan") for x in cursor.fetchall(): print x print "updating nan" cursor.execute_prepared("updatenan", ("pabst", 4)) print "nan after" cursor.execute_prepared("getnan") for x in cursor.fetchall(): print x print "updating nan again" cursor.execute_prepared("updatenan", ("rollingrock", 1)) print "trying an illegal update" try: cursor.execute("delete from frequents") except: print "exception", sys.exc_type, sys.exc_value print "as expected" else: raise "DAMN!", "illegal query apparently completed!!!" print; print "testing policy test1"; print conn = gfclient("test1", PORT, "test1", machine) cursor = conn.cursor() print "getting norm" cursor.execute_prepared("qlike", ("norm",)) print cursor.description for x in cursor.fetchall(): print x print "trying an illegal query again" try: cursor.execute("create table test(name varchar)") except: print "exception", sys.exc_type, sys.exc_value print "as expected" else: raise "Damn!(2)", "illegal query apparently completed" def startup(admin_policy, connection, Server_instance): """example startup script. add a policies test and test1 passwords same test1 is allowed to query the frequents table by name test is allowed to update likes where drinker='nan' also add prepared query dumpwork to admin_policy. """ from gfserve import Policy admin_policy["dumpwork"] = "select * from work" test1 = Policy("test1", "test1", connection, queries=0) test = Policy("test", "test", connection, queries=0) test1["qlike"] = "select * from likes where drinker=?" test["updatenan"] = """ update likes set beer=?, perday=? where drinker='nan' """ test["getnan"] = """ select * from likes where drinker='nan' """ return {"test": test, "test1": test1} def doqueries(): print "executing queries and updates" from gfclient import gfclient import sys machine = socket.gethostname() conn = gfclient("admin", PORT, PW, machine) cursor = conn.cursor() for q in admin_queries: print;print;print q;print try: cursor.execute(q) except: print "exception in execute" print sys.exc_type v = sys.exc_value from types import TupleType, ListType if type(v) in (TupleType, ListType): for x in v: print x else: print v else: print "executed" #print q print "description" print cursor.description print "results" try: r = cursor.fetchall() if r is None: print "no results" else: for x in r: print x except: print "exception in results" print sys.exc_type, sys.exc_value print dir(cursor) # try dumpwork print; print; print "dumpwork"; print cursor.execute_prepared("dumpwork") for x in cursor.fetchall(): print x # try dynamic parameters stat = """ select distinct drinker from likes l, serves s where l.beer = s.beer and s.bar=? """ print; print stat; print "dynamic query ?=cheers" cursor.execute(stat, ("cheers",)) for x in cursor.fetchall(): print x admin_queries = [ """select count(*) from work""", """select * from frequents""", """select count(*) from frequents""", """select count(drinker) from frequents""", """insert into frequents(drinker, bar, perweek) values ('sally', 'cheers', 2)""", """select * from frequents""", """select syntax error from work""", """select drinker, count(bar) from frequents group by drinker""", ] def dosimple(command, pw): print "attempting remote %s (%s) for server on local machine" % (command, pw) from gfclient import gfclient machine = socket.gethostname() conn = gfclient("admin", PORT, pw, machine) action = getattr(conn, command) print action() if __name__=="__main__": main()Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/gftest.py100644 1007 1403 50160 6747630571 25120 0ustar petrillipetrilli"""test script for gadfly usage gftest.py run in current directory creates a database in files test.dfs LIKES.grl SERVES.grl FREQUENTS.grl """ def test(directory): print "testing" from gadfly import gadfly connect = gadfly() connect.startup("test", directory) curs = connect.cursor() print print "TABLE CREATES" for x in table_creates: print x curs.execute(x) curs.execute("create table empty (nothing varchar)") C = """ CREATE TABLE work ( name VARCHAR, hours INTEGER, rate FLOAT) """ print C curs.execute(C) print C = """ CREATE TABLE accesses ( page VARCHAR, hits INTEGER, month INTEGER) """ print C curs.execute(C) print print "INSERTS" C = """ INSERT INTO work(name, hours, rate) VALUES (?, ?, ?) """ D = [ ("sam", 30, 40.2), ("norm", 45, 10.2), ("woody", 80, 5.4), ("diane", 3, 4.4), ("rebecca", 120, 12.9), ("cliff", 26, 200.00), ("carla", 9, 3.5), ] for x in D: print x curs.execute(C, D) C = "create unique index wname on work(name)" print "Unique index:", C curs.execute(C) print "trying bad insert into unique field" C = "insert into work(name, hours, rate) values ('sam', 0, 0)" import sys try: curs.execute(C) except: print "exception as expected %s(%s)" %(sys.exc_type, sys.exc_value) else: raise "stop!", "unique index permits nonunique field" print; print "testing introspection" itests = ["select 10*4 from dual", "select * from __table_names__", #"select * from __datadefs__", # needs formatting "select * from __indices__", "select * from __columns__", "select * from __indexcols__", """ select i.index_name, is_unique, table_name, column_name from __indexcols__ c, __indices__ i where c.index_name = i.index_name""", ] for C in itests: print C print curs.execute(C) print curs.pp() print print "testing complex, neg literals in insert" curs.execute("insert into work(name, hours, rate) values ('jo', -1, 3.1e-44-1e26j)") curs.execute("select * from work") print curs.pp() print "deleting jo"; print curs.execute("delete from work where name='jo'") C = """ INSERT INTO accesses(page, month, hits) VALUES (?, ?, ?) """ D = [ ("index.html", 1, 2100), ("index.html", 2, 3300), ("index.html", 3, 1950), ("products.html", 1, 15), ("products.html", 2, 650), ("products.html", 3, 98), ("people.html", 1, 439), ("people.html", 2, 12), ("people.html", 3, 665), ] for x in D: print x curs.execute(C, D) for (table, stuff) in dpairs: ins = "insert into %s values (?, ?, ?)" % table if table!="frequents": for parameters in dataseq(stuff): print "singleinsert", table, parameters curs.execute(ins, parameters) else: print print "multiinsert", table parameters = dataseq(stuff) for p in parameters: print p print "multiinsert..." curs.execute(ins, parameters) print;print print print "INDICES" for ci in indices: print ci curs.execute(ci) print print "QUERIES" for x in workqueries: print;print print x curs.execute(x) print curs.pp() statement = """select name, hours from work""" curs.execute(statement) print "Hours worked this week" print for (name,hours) in curs.fetchall(): print "worker", name, "worked", hours, "hours" print print "end of work report" #return for x in queries: print; print print x curs.execute(x) #for x in curs.commands: # print x all = curs.fetchall() if not all: print "empty!" else: print curs.pp() #for t in all: #print t #return print print "DYNAMIC QUERIES" for (x,y) in dynamic_queries: print; print print x print "dynamic=", y curs.execute(x, y) #for x in curs.commands: # print x all = curs.fetchall() if not all: print "empty!" else: for t in all: print t print "repeat test" from time import time for x in repeats: print "repeating", x now = time() curs.execute(x) print time()-now, "first time" now = time() curs.execute(x) print time()-now, "second time" now = time() curs.execute(x) print time()-now, "third time" print "*** committing work" connect.commit() connect.close() print; print return connect table_creates = [ "create table frequents (drinker varchar, bar varchar, perweek integer)", "create table likes (drinker varchar, beer varchar, perday integer)", "create table serves (bar varchar, beer varchar, quantity integer)", """Create view nondrinkers(d, b) as select drinker, bar from frequents where drinker not in (select drinker from likes)""", ] fdata = """\ adam lolas 1 woody cheers 5 sam cheers 5 norm cheers 3 wilt joes 2 norm joes 1 lola lolas 6 norm lolas 2 woody lolas 1 pierre frankies 0""" sdata = """\ cheers bud 500 cheers samaddams 255 joes bud 217 joes samaddams 13 joes mickies 2222 lolas mickies 1515 lolas pabst 333 winkos rollingrock 432 frankies snafu 5""" ldata = """\ adam bud 2 wilt rollingrock 1 sam bud 2 norm rollingrock 3 norm bud 2 nan sierranevada 1 woody pabst 2 lola mickies 5""" dpairs = [ ("frequents", fdata), ("serves", sdata), ("likes", ldata), ] def dataseq(s): from string import split l = split(s, "\n") result = map(split, l) from string import atoi for l in result: l[2] = atoi(l[2]) result = map(tuple, result) return result indices = [ """create index fd on frequents (drinker)""", """create index sbb on serves (beer, bar)""", """create index lb on likes (beer)""", """create index fb on frequents (bar)""", ] repeats = [ """-- drinkers bars and beers -- where the drinker likes the beer -- the bar serves the beer -- and the drinker frequents the bar select f.drinker, l.beer, s.bar from frequents f, serves s, likes l where f.drinker=l.drinker and s.bar=f.bar and s.beer=l.beer""", """select * from frequents as f, serves as s where f.bar = s.bar and not exists( select l.drinker, l.beer from likes l where l.drinker=f.drinker and s.beer=l.beer)""", """select * from frequents where drinker = 'norm'""", ] workqueries = [ """-- everything from work select * from work""", # stupid tests """select median(hours) from work""", """select * from work where name='carla' -- just carla""", """select name, ' ain''t worth ', rate from work -- the works table has more columns where name='carla'""", """select name, -- name of worker hours -- hours worked from work""", """select name, hours*rate as pay from work order by name""", """select name, rate from work where rate>=20 and rate<=100""", """select name, rate from work where rate between 20 and 100""", """select name, rate from work where rate not between 20 and 100""", """select name, rate, hours, hours*rate as pay from work""", """select name, rate, hours, hours*rate as pay from work where hours*rate>500 and (rate<100 or hours>5)""", """select name, rate, hours, hours*rate as pay from work where hours*rate>500 and rate<100 or hours>5""", """select avg(rate), min(hours), max(hours), sum(hours*rate) as expenses from work""", """select * from accesses""", """select month, sum(hits) as totalhits from accesses where month<>1 group by month order by 2""", """select month, sum(hits) as totalhits from accesses group by month order by 2 desc""", """select month, sum(hits) as totalhits from accesses group by month having sum(hits)<3000 order by 2 desc""", """select count(distinct month), count(distinct page) from accesses""", """select month, hits, page from accesses order by month, hits desc""", ] queries = [ """select * from nondrinkers""", """select drinker as x from likes union select beer as x from serves union select drinker as x from frequents""", """select f.drinker, s.bar, l.beer from frequents f, serves s, likes l where f.drinker=l.drinker and s.beer=l.beer and s.bar=f.bar""", """select * from likes where beer in ('bud', 'pabst')""", """select l.beer, l.drinker, count(distinct s.bar) from likes l, serves s where l.beer=s.beer group by l.beer, l.drinker order by 3 desc""", """select l.beer, l.drinker, count(distinct s.bar) as nbars from likes l, serves s where l.beer=s.beer group by l.beer, l.drinker union distinct select beer, drinker, 0 as nbars from likes where beer not in (select beer from serves) order by 3 desc""", """select avg(perweek) from frequents""", """select * from frequents where perweek <= (select avg(perweek) from frequents)""", """select * from serves""", """select bar, avg(quantity) from serves group by bar""", """select * from serves s1 where quantity <= (select avg(quantity) from serves s2 where s1.bar=s2.bar)""", """select * from frequents where perweek > (select avg(perweek) from frequents)""", """select * from frequents f1 where perweek > ( select avg(perweek) from frequents f2 where f1.drinker = f2.drinker)""", """select * from frequents where perweek < any (select perweek from frequents)""", """select * from frequents where perweek >= all (select perweek from frequents)""", """select * from frequents where perweek <= all (select perweek from frequents)""", """select * from frequents f1 where perweek < any (select perweek from frequents f2 where f1.drinker = f2.drinker)""", """select * from frequents f1 where perweek = all (select perweek from frequents f2 where f1.drinker = f2.drinker)""", """select * from frequents f1 where perweek <> all (select perweek from frequents f2 where f1.drinker <> f2.drinker)""", """select beer from serves where beer = any (select beer from likes)""", """select beer from serves where beer <> all (select beer from likes)""", """select beer from serves where beer in (select beer from likes)""", """select beer from serves where beer not in (select beer from likes)""", #"""select f1.drinker, f2.drinker # from frequents f1, frequents f2 # where f1.drinker<>f2.drinker""", #"""select * # from frequents f1 # where not exists # (select f2.drinker # from frequents f2 # where f1.drinker<>f2.drinker and f1.bar=f2.bar)""", """select * from frequents where perweek between 2 and (select avg(perweek) from frequents)""", """select * from frequents where perweek not between 2 and 5""", # "stop", """select f.drinker, l.beer, s.bar from frequents f, serves s, likes l where f.drinker=l.drinker and s.bar=f.bar and s.beer=l.beer""", #"stop!", """select * from serves""", """select * from likes""", """select * from frequents where drinker = 'norm'""", """select drinker from likes union select drinker from frequents""", """select drinker from likes union distinct select drinker from frequents""", """select drinker from likes except select drinker from frequents""", """select drinker from likes intersect select drinker from frequents""", # "stop!", """select * from frequents where drinker>'norm'""", """select * from frequents where drinker<='norm'""", """select * from frequents where drinker>'norm' or drinker<'b'""", """select * from frequents where drinker<>'norm' and 'pierre'<>drinker""", """select * from frequents where drinker<>'norm'""", """select (drinker+' ')*2+bar from frequents where drinker>bar""", """select * from frequents as f, serves as s where f.bar = s.bar""", """select * from frequents as f, serves as s where f.bar = s.bar and not exists( select l.drinker, l.beer from likes l where l.drinker=f.drinker and s.beer=l.beer)""", """select * from likes l, frequents f where f.bar='cheers' and l.drinker=f.drinker and l.beer='bud'""", """select * from serves s where not exists ( select * from likes l, frequents f where f.bar = s.bar and f.drinker=l.drinker and s.beer=l.beer)""", """select 'nonbeer drinker '+f.drinker from frequents f where not exists (select l.drinker, l.beer from likes l where l.drinker=f.drinker)""", """select l.drinker+' likes '+l.beer+' but goes to no bar' from likes l where not exists (select f.drinker from frequents f where f.drinker=l.drinker)""", """select bar from frequents""", """select distinct bar from frequents""", """select sum(quantity), avg(quantity), count(*), sum(quantity)/count(quantity) from serves""", """select beer, sum(quantity), avg(quantity), count(*), sum(quantity)/count(quantity) from serves group by beer""", """select sum(quantity), avg(quantity), count(*), sum(quantity)/count(quantity) from serves where beer<>'bud' """, """select bar, sum(quantity), avg(quantity), count(*), sum(quantity)/count(quantity) from serves where beer<>'bud' group by bar having sum(quantity)>500 or count(*)>3 order by 2 desc """, """select beer, sum(quantity), avg(quantity), count(*) from serves where beer<>'bud' group by beer having sum(quantity)>100 order by 4 desc, beer """, """select l.drinker, l.beer, count(*), sum(l.perday*f.perweek) from likes l, frequents f where l.drinker=f.drinker group by l.drinker, l.beer order by 4 desc, l.drinker, l.beer """, """select l.drinker, l.beer, f.bar, l.perday, f.perweek from likes l, frequents f where l.drinker=f.drinker order by l.drinker, l.perday desc, f.perweek desc """, ] dynamic_queries = [ ( "select bar from frequents where drinker=?", ("norm",) ), ( "select * from frequents where drinker=? or bar=?", ("norm", "cheers") ) ] updates = [ """select * from frequents""", """select * from likes""", """select * from serves""", """select bar, sum(quantity), avg(quantity), count(*), sum(quantity)/count(quantity) from serves where beer<>'bud' group by bar having sum(quantity)>500 or count(*)>3 order by 2 desc """, """select count(*), d from nondrinkers group by d""", """insert into frequents (drinker, perweek, bar) values ('billybob', 4, 'cheers')""", """select * from nondrinkers""", """create table templikes (dr varchar, be varchar)""", """select * from templikes""", """insert into templikes(dr, be) select drinker, beer from likes""", """create index tdindex on templikes(dr)""", """create index tbindex on templikes(be)""", """select * from templikes""", """delete from templikes where be='rollingrock' """, """select * from templikes""", """update templikes set dr=dr+'an' where dr='norm' """, """drop index tdindex""", """delete from templikes where dr=(select min(dr) from templikes)""", """insert into templikes (dr, be) select max(dr), min(be) from templikes""", """select * from templikes""", """select * from frequents""", """update frequents set perweek=(select max(perweek) from frequents where drinker='norm') where drinker='woody'""", """select * from frequents""", """create view lazy as select drinker, sum(perweek) as wasted from frequents group by drinker having sum(perweek)>4 order by drinker""", """select * from lazy""", """drop view lazy""", """drop table templikes""", ] trace_updates = [ """drop index tdindex""", ] rollback_queries = [ """select * from likes""", """select * from frequents""", """select * from nondrinkers""", """select * from alldrinkers""", """select * from dummy""", ] rollback_updates = [ """create table dummy (nothing varchar)""", """insert into frequents(drinker, bar, perweek) values ('nobody', 'nobar', 0)""", """insert into likes(drinker, beer, perday) values ('wally', 'nobar', 0)""", """drop view alldrinkers""", ] keep_updates = [ """insert into frequents(drinker, bar, perweek) values ('peter', 'pans', 1)""", """create view alldrinkers as select drinker from frequents union select drinker from likes""", ] def rollbacktest(directory): print "*" * 30 print "*** recovery test ***" print; print; print import sys from gadfly import gadfly print "*** connecting" connect = gadfly("test", directory) cursor = connect.cursor() connect.autocheckpoint = 0 print "*** executing updates to commit" for x in keep_updates: print x cursor.execute(x) connect.verbose=1 print "*** COMMITTING OPERATIONS (connection set to verbose)" connect.commit() print "*** DUMP LOG" connect.dumplog() print; print "*** RUNNING OPS TO ROLL BACK" preresults = [] for s in rollback_queries: print; print; print s try: cursor.execute(s) preresults.append(cursor.fetchall()) print cursor.pp() except: d = sys.exc_type print "exception", d preresults.append(d) print; print "*** now updating with ops to rollback" for s in rollback_updates: print; print; print s cursor.execute(s) print; print; print "*** testing noncommitted results" for dummy in (1,2): postresults = [] for s in rollback_queries: print s try: cursor.execute(s) postresults.append(cursor.fetchall()) print cursor.pp() except: d = sys.exc_type print "*** exception", d postresults.append(d) if preresults==postresults: print "*** same results as before uncommitted updates" else: print "*** differing results from before uncommitted updates" if dummy==1: print; print "*** ROLLING BACK!" connect.rollback() print; print "*** EMULATING RECOVERY" for s in rollback_updates: print; print; print s cursor.execute(s) for dummy in (1,2): postresults = [] for s in rollback_queries: print s try: cursor.execute(s) postresults.append(cursor.fetchall()) print cursor.pp() except: d = sys.exc_type print "*** exception", d postresults.append(d) if preresults==postresults: print "*** same results as before uncommitted updates" else: print "*** differing results from before uncommitted updates" if dummy==1: print "*** RESTART: DUMPLOG" connect.dumplog() print "*** RESTARTING (RECOVER FROM LOG, DISCARD UNCOMMITTED)" connect.restart() def retest(directory): print "*" * 30 print "*** reconnect test" from gadfly import gadfly connect = gadfly("test", directory) cursor = connect.cursor() for s in updates: print; print print s if s in trace_updates: cursor.EVAL_DUMP = 1 cursor.execute(s) cursor.EVAL_DUMP = 0 print cursor.pp() #print; print "CONNECTION DATA BEFORE COMMIT" #connect.DUMP_ALL() connect.commit() #print; print "CONNECTION DATA AFTER COMMIT" #connect.DUMP_ALL() connect.close() return connect if __name__=="__main__": import sys argv = sys.argv if len(argv)<2: print "USAGE: python " print " please provide a directory for test database!" else: directory = argv[1] test(directory) rollbacktest(directory) retest(directory) Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/idl.py100644 1007 1403 27725 6747630571 24407 0ustar petrillipetrilli # idl grammar # # Note, this grammar requires a special hack at the lexical # level in order to parse the fragment # # ... # case abc::def: jjj::www: whatever... # # (Yuck!) # Some would argue this is a language design flaw, but whatever... # It causes a shift/reduce problem without special handling for :: # below coloncolon is a 'fake' keyword that parses as two colons. idlgramstring = """ specification :: ## 1 @R r1a :: specification >> definition speclist @R r1b :: speclist >> specification @R r1c :: speclist >> ## 2 punct ; @R r2a :: definition >> type_dcl ; @R r2b :: definition >> const_dcl ; @R r2c :: definition >> except_dcl ; @R r2d :: definition >> interface_nt ; @R r2e :: definition >> module_nt ; ## 3 identifier=term, module=kw puncts {} @R r3 :: module_nt >> module identifier { specification } ## 4 @R r4a :: interface_nt >> interface_dcl @R r4b :: interface_nt >> forward_dcl ## 5 @R r5 :: interface_dcl >> interface_header { interface_body } ## 6 interface=kw @R r6 :: forward_dcl >> interface identifier ## 7 puncts [] @R r7 :: interface_header >> interface identifier [ inheritance_spec ] ## 8 @R r8a :: interface_body >> @R r8b :: interface_body >> export interface_body ## 9 @R r9a :: export >> type_dcl @R r9b :: export >> const_dcl @R r9c :: export >> except_dcl @R r9d :: export >> attr_dcl @R r9e :: export >> op_dcl ## 10 punct ,: @R r10a :: inheritance_spec >> : scoped_name_list @R r10b :: scoped_name_list >> scoped_name @R r10c :: scoped_name_list >> scoped_name_list , scoped_name ## 11 @R r11a :: scoped_name >> identifier @R r11b :: scoped_name >> colon_colon identifier @R r11d :: scoped_name >> scoped_name coloncolon identifier ## 12 const=kw punct = @R r12 :: const_dcl >> const const_type identifier = const_expr ## 13 @R r13a :: const_type >> integer_type @R r13b :: const_type >> char_type @R r13c :: const_type >> boolean_type @R r13d :: const_type >> floating_type @R r13e :: const_type >> string_type @R r13f :: const_type >> scoped_name ## 14 @R r14 :: const_expr >> or_expr ##15 punct | @R r15a :: or_expr >> xor_expr @R r15b :: or_expr >> or_expr | xor_expr ##16 punct ^ @R r16a :: xor_expr >> and_expr @R r16b :: xor_expr >> xor_expr ^ and_expr ##17 punct & @R r17a :: and_expr >> shift_expr @R r17b :: and_expr >> and_expr & shift_expr ##18 punct > < @R r18a :: shift_expr >> add_expr @R r18b :: shift_expr >> shift_expr > > add_expr @R r18c :: shift_expr >> shift_expr < < add_expr ##19 punct +- @R r19a :: add_expr >> mult_expr @R r19b :: add_expr >> add_expr + mult_expr @R r19c :: add_expr >> add_expr - mult_expr ##20 punct */% @R r20a :: mult_expr >> unary_expr @R r20b :: mult_expr >> mult_expr * unary_expr @R r20c :: mult_expr >> mult_expr / unary_expr @R r20d :: mult_expr >> mult_expr % unary_expr ##21 @R r21a :: unary_expr >> unary_operator primary_expr @R r21b :: unary_expr >> primary_expr ##22 @R r22a :: unary_operator >> - @R r22b :: unary_operator >> + @R r22c :: unary_operator >> ~ ##23 punct () @R r23a :: primary_expr >> scoped_name @R r23b :: primary_expr >> literal @R r23c :: primary_expr >> ( const_expr ) ##24 terms = *_literal (?) except boolean @R r24a :: literal >> integer_literal @R r24b :: literal >> string_literal @R r24c :: literal >> character_literal @R r24d :: literal >> floating_pt_literal @R r24e :: literal >> boolean_literal ##25 kw TRUE FALSE @R r25a :: boolean_literal >> TRUE @R r25b :: boolean_literal >> FALSE ##26 @R r26 :: positive_int_literal >> const_expr ##27 kw typedef @R r27a :: type_dcl >> typedef type_declarator @R r27b :: type_dcl >> struct_type @R r27c :: type_dcl >> union_type @R r27d :: type_dcl >> enum_type ##28 @R r28 :: type_declarator >> type_spec declarators ##29 @R r29a :: type_spec >> simple_type_spec @R r29b :: type_spec >> constr_type_spec ##30 @R r30a :: simple_type_spec >> base_type_spec @R r30b :: simple_type_spec >> template_type_spec @R r30c :: simple_type_spec >> scoped_name ##31 @R r31a :: base_type_spec >> floating_pt_type @R r31b :: base_type_spec >> integer_type @R r31c :: base_type_spec >> char_type @R r31d :: base_type_spec >> boolean_type @R r31e :: base_type_spec >> octet_type @R r31f :: base_type_spec >> any_type ## 32 @R r32a :: template_type_spec >> sequence_type @R r32b :: template_type_spec >> string_type ##33 @R r33a :: constr_type_spec >> struct_type @R r33b :: constr_type_spec >> union_type @R r33c :: constr_type_spec >> enum_type ##34 @R r34a :: declarators >> declarator @R r34b :: declarators >> declarators , declarator ##35 @R r35a :: declarator >> simple_declarator @R r35b :: declarator >> complex_declarator ##36 @R r36 :: simple_declarator >> identifier ##37 @R r37 :: complex_declarator >> array_declarator ##38 kw float double @R r38a :: floating_pt_type >> float @R r38b :: floating_pt_type >> double ##39 @R r39a :: integer_type >> signed_int @R r39b :: integer_type >> unsigned_int ##40 @R r40 :: signed_int >> signed_long_int @R r40 :: signed_int >> signed_short_int ##41 kw long @R r41 :: signed_long_int >> long ##42 kw short @R r42 :: signed_short_int >> short ##43 @R r43 :: unsigned_int >> unsigned_long_int @R r43 :: unsigned_int >> unsigned_short_int ##44 kw unsigned @R r44 :: unsigned_long_int >> unsigned long ##45 @R r45 :: unsigned_short_int >> unsigned short ##46 kw char @R r46 :: char_type >> char ##47 kw boolean @R r47 :: boolean_type >> boolean ##48 kw octet @R r48 :: octet_type >> octet ##49 kw any @R r49 :: any_type >> any ##50 kw struct @R r50 :: struct_type >> struct identifier { member_list } ##51 @R r51a :: member_list >> member @R r51b :: member_list >> member_list member ##52 @R r52 :: member >> type_spec declarators ; ##53 kw union switch @R r53 :: union_type >> union identifier switch ( switch_type_spec ) { switch_body } ##54 @R r54a :: switch_type_spec >> integer_type @R r54b :: switch_type_spec >> char_type @R r54c :: switch_type_spec >> boolean_type @R r54d :: switch_type_spec >> enum_type @R r54e :: switch_type_spec >> scoped_name ##55 @R r55a :: switch_body >> case_nt @R r55b :: switch_body >> switch_body case_nt ##56 @R r56a :: case_nt >> case_labels element_spec ; @R r56b :: case_labels >> case_label @R r56c :: case_labels >> case_labels case_label ##57 kw default case @R r57a :: case_label >> case const_expr : @R r57b :: case_label >> default : ##58 @R r58 :: element_spec >> type_spec declarator ##59 kw enum @R r59a :: enum_type >> enum identifier { enumerators } @R r59b :: enumerators >> enumerator @R r59c :: enumerators >> enumerators , enumerator ##60 @R r60 :: enumerator >> identifier ##61 kw sequence @R r61 :: sequence_type >> sequence < simple_type_spec , positive_int_const > ##62 kw string @R r62a :: string_type >> string < positive_int_const > @R r62b :: string_type >> string ##63 @R r63a :: array_declarator >> identifier fixed_array_sizes @R r63b :: fixed_array_sizes >> fixed_array_size @R r63c :: fixed_array_sizes >> fixed_array_sizes fixed_array_size ##64 @R r64 :: fixed_array_size >> [ positive_int_const ] ##65 kw attribute readonly @R r65a :: attr_dcl >> maybe_readonly attribute param_type_spec simple_declarators @R r65b :: maybe_readonly >> readonly @R r65c :: maybe_readonly >> @R r65d :: simple_declarators >> simple_declarator @R r65e :: simple_declarators >> simple_declarators , simple_declarator ##66 kw exception @R r66a :: except_dcl >> exception identifier { members } @R r66b :: members >> @R r66c :: members >> member_list ##67 @R r67a :: op_dcl >> maybe_op_attribute op_type_spec identifier parameter_dcls maybe_raises_expr maybe_context_expr @R r67b :: maybe_op_attribute >> @R r67c :: maybe_op_attribute >> op_attribute @R r67d :: maybe_raises_expr >> @R r67e :: maybe_raises_expr >> raises_expr @R r67f :: maybe_context_expr >> @R r67g :: maybe_context_expr >> context_expr ##68 kw oneway @R r68a :: op_attribute >> oneway ##69 kw void @R r69a :: op_type_spec >> param_type_spec @R r69b :: op_type_spec >> void ##70 @R r70a :: parameter_dcls >> ( parameterlist ) @R r70b :: parameter_dcls >> ( ) @R r70c :: parameterlist >> param_dcl @R r70d :: parameterlist >> parameterlist , param_dcl ##71 @R r71 :: param_dcl >> param_attribute param_type_spec simple_declarator ##72 kw in out inout @R r72 :: param_attribute >> in @R r72 :: param_attribute >> out @R r72 :: param_attribute >> inout ##73 kw raises @R r73 :: raises_expr >> raises ( scoped_name_list ) ##74 kw context @R r74 :: context_expr >> context ( string_literal_list ) @R r74b :: string_literal_list >> string_literal @R r74c :: string_literal_list >> string_literal_list , string_literal @R r75 :: param_type_spec >> base_type_spec @R r75 :: param_type_spec >> string_type @R r75 :: param_type_spec >> scoped_name """ nonterms = """ colon_colon param_attribute unsigned_long_int unsigned_short_int param_dcl parameterlist string_literal_list members maybe_op_attribute maybe_raises_expr maybe_context_expr op_type_spec parameter_dcls op_attribute raises_expr context_expr maybe_readonly param_type_spec simple_declarators simple_declarator fixed_array_sizes fixed_array_size element_spec enumerator enumerators switch_type_spec switch_body case_nt case_labels case_label member_list member signed_int unsigned_int signed_long_int signed_short_int simple_declarator complex_declarator array_declarator declarator sequence_type string_type floating_pt_type integer_type char_type boolean_type octet_type any_type base_type_spec template_type_spec simple_type_spec constr_type_spec type_spec declarators type_declarator struct_type union_type enum_type literal boolean_literal positive_int_literal mult_expr unary_expr unary_operator primary_expr or_expr xor_expr and_expr shift_expr add_expr integer_type char_type boolean_type floating_type string_type const_type const_expr scoped_name_list scoped_name attr_dcl op_dcl inheritance_spec export interface_header interface_body interface_dcl forward_dcl type_dcl const_dcl except_dcl interface_nt module_nt specification definition speclist """ keywords = """ exception oneway void in out inout raises context interface module const TRUE FALSE typedef float double long unsigned short char boolean octet any struct union switch enum string attribute readonly default case sequence :: """ # NOTE: FOR NECESSARY HACKERY REASONS :: IS A KEYWORD! punctuations = ";{}()[],:|^&<>+-*/%~=" # dummy regexen identifierre = "identifier" integer_literalre = "123" positive_int_constre = "999" string_literalre = "'string'" character_literalre= "'c'" floating_pt_literalre = "1.23" # dummy interp fun for all terminals def echo (str): return str def DeclareTerminals(Grammar): Grammar.Addterm("identifier", identifierre, echo) Grammar.Addterm("integer_literal", integer_literalre, echo) Grammar.Addterm("string_literal", string_literalre, echo) Grammar.Addterm("character_literal", character_literalre, echo) Grammar.Addterm("floating_pt_literal", floating_pt_literalre, echo) Grammar.Addterm("positive_int_const", positive_int_constre, echo) ## we need to override LexDictionary to recognize :: as a SINGLE punctuation. ## (not possible using standard kjParsing, requires a special override) import kjParser class myLexDictionary(kjParser.LexDictionary): def __init__(self): kjParser.LexDictionary.__init__(self) map = ((kjParser.KEYFLAG, "coloncolon"), "coloncolon") self.keywordmap["::"] = map self.keywordmap["coloncolon"] = map def Token(self, String, StartPosition): if String[StartPosition:StartPosition+2] == "::": tok = self.keywordmap["::"] return (tok, 2) # default: return kjParseBuild.LexDictionary.Token(self, String, StartPosition) # default bind all rules def GrammarBuild(): import kjParseBuild idl = kjParseBuild.NullCGrammar() idl.LexD = myLexDictionary() #idl.SetCaseSensitivity(0) # grammar is not case sensitive for keywords DeclareTerminals(idl) idl.Keywords(keywords) idl.punct(punctuations) idl.Nonterms(nonterms) #idl.comments([LISPCOMMENTREGEX]) idl.Declarerules(idlgramstring) print "now compiling" idl.Compile() return idl if __name__=="__main__": GrammarBuild()Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/index.html100755 1007 1403 20006 6747630571 25246 0ustar petrillipetrilli Gadfly/kwParsing Downloads and Documentation

    Gadfly 1.0: An SQL Database in Python

    Gadfly/kwParsing downloads and documentation.

    Gadfly requires the kwParsing parser/parser generator package. The "two packages" are released as one distribution (kwP) with the same generous copyright.

    Download kwP.tar.gz in tar-gz format with tar.gz extension.

    Download kwP.tgz in tar-gz format with tgz extension.

    Separately download kjbuckets.pyd data structure accellerator extension module for Python 1.5 on Windows NT or Windows 95/98 only.

    [The tar.gz extension doesn't always work for MSIE browsers.]

    Gadfly frequently asked questions (FAQ).

    General information with links to other documentation, including installation instructions.


    gadfly.py main module
    gfserve.py main TCP/IP server mode
    gfclient.py main TCP/IP client mode
    gfsocket.py client/server support module
    gfstest.py client/server test module
    gfinstall.py installation script
    gftest.py test suite
    sqlbind.py grammar bindings
    sqlgen.py grammar generation
    sqlgram.py SQL grammar
    sqlgtest.py grammar tests
    sqlsem.py main semantic objects
    sqlmod.py update semantic objects
    gfdb0.py data and file archiving
    gfintrospect.py introspection and remote table support
    remotetest.py remote table implementation demo and test
    relalg.py relational algebra interpreter (toy)
    kjbuckets0.py base data structures (python version)
    		 These are the core files to the Gadfly SQL database engine A relational database query engine that supports the Structured Query Language (SQL), implemented entirely in Python (with optional builtin support from the kjbuckets builtin data structure accelerator).
    Gadfly has been tested on Windows 95, Windows NT, Linux, and Unix (solaris), and it should run anywhere that Python runs (bebox, maybe Palm Pilot/WinCE eventually...)
    Supports transactions and recovery
    Supports a LARGE subset of SQL
    Supports client/server access via TCP/IP sockets.
    Many thanks to users who have used Gadfly in previous releases and who have offered suggestions and bug reports!
    Gadfly source modules and documentation

    kwParser, Python lint, IDL, etc...

    kwParser is a parser generator for Python. It transforms an abstract specification of a language grammar (for example the CORBA Interface Definition Language) together with "interpretation functions" that define the semantics of the language into a compiler or translator or interpreter. In the case of CORBA IDL a python program using kwParser could generate stubs and support code (in Python or some other language) to talk to a CORBA interface.

    The release given here has had some micro-optimizations (26 June 1997) which with luck don't break anything. In particular regexen are used more intelligently and the generation phase will use kjbuckets if it's available.

    This is moderately heavy computer science. Not for the timid.

    COPYRIGHT Do what you like, just don't sue me (roughly translated).
    DLispShort.py A very simple example language specification.
    DumbLispGen.py Another example specification
    arefize.py (not related: simple program used to generate this page)
    idl.py A very complex example: CORBA IDL parser generator. This is a good example of a complex grammar. The interpretation functions and terminal regexes are all stubbed.
    pygram.py A very complex example: The python grammar. This module uses a hand written lexer to handle Python's beautiful peculiarities. Used by kypylint.py.
    Look at the top of the module for editable parameters.
    kjpylint.py An attempt to use the pygram parser to do simple checking on python source files. Reports references not set, assignments not used, etcetera. not all warnings indicate real problems of course. Used like this: 
    % python kjpylint.py /home/app/arw/Python-1.5a1/Lib/SocketServer.py
setup
loading
now parsing
(verify_request) 'request' defined before 225 not used
(verify_request) 'self' defined before 225 not used
(verify_request) 'client_address' defined before 225 not used
(handle_error) 'request' defined before 245 not used
(handle_error) 'self' defined before 245 not used
(collect_children) 'status' defined before 293 not used
(setup) 'self' defined before 368 not used
(__del__) 'self' defined before 371 not used
(handle) 'self' defined before 374 not used
(finish) 'self' defined before 377 not used
() '__version__' defined before 104 not used
269: (qref) 'max_packet_size' not defined in module?
    Here only the last line indicates a possible real bug in SocketServer.py
    Bugs/Features:
    Barfs on inconsistent indentation (ie space-tab is not the same as tab).
    Grumpy about one line for loops and lambdas.
    For very weird cases may not parse strings correctly.
    See top of module for more info.
    Right now kjpylint might like to see an extra newline at the end of the file. I'll look into this, sorry.
    Latest: Thu Jul 17 13:50:03 EDT 1997
    kjParseBuild.py The Parser generator module, used only to generate the data structures required for parsing.
    kjParser.py The Parser module, used both during the generation phase and also after generation when the generated parser is used.
    kwParsing.html HTML documentation for the package.
    kjSet.py support module for parser generation. (uses kjbuckets builtin if available, or uses a straight Python implementation if not.)
    kwP.tar.gz The package (tarred, gzipped)
    kwParsing parser generator related files.
    feedback
    home Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/kjParseBuild.py100644 1007 1403 132354 6747630572 26232 0ustar petrillipetrilli# # python code for building a parser from a grammar # Copyright Aaron Robert Watters, 1994 # # BUGS: # A bad grammar that has no derivations for # the root nonterminal may cause a name error # on the variable "GoodStartingPlace" # this needs to be modified so the RULEGRAM is loaded from a # compiled representation if available. import string import kjSet import kjParser import regex # import some constants from kjParser import \ TERMFLAG, NOMATCHFLAG, MOVETOFLAG, REDUCEFLAG, TRANSFLAG, KEYFLAG, \ NONTERMFLAG, TERMFLAG, EOFFLAG, ENDOFFILETOKEN PMODULE = kjParser.THISMODULE # errors raised here TokenError = "TokenError" # may happen on autogen with bad grammar NotSLRError = "NotSLRError" # may happen for nonSLR grammar # set this flag for regression testing at each load RUNTESTS = 0 # set this flag to abort automatic generation on Errors ABORTONERROR = 0 # token used to mark null productions NULLTOKEN = (None,None) # a derived FSM class, with closure computation methods defined # (compilable FSMachine) # class CFSMachine(kjParser.FSMachine): def __init__(self, nonterm): kjParser.FSMachine.__init__(self, nonterm) # return the epsilon closure of the FSM as a new FSM # # DoNullMap, if set, will map unexpected tokens to # the "empty" state (usually creating a really big fsm) # def Eclosure(self, Epsilon, DoNullMaps=0): Closure = CFSMachine( self.root_nonTerminal ) # compute the Epsilon Graph between states EGraph = kjSet.NewDG([]) for State in range(0,self.maxState+1): # every state is E-connected to self kjSet.AddArc( EGraph, State, State ) # add possible transition on epsilon (ONLY ONE SUPPORTED!) key = (State, Epsilon) if self.StateTokenMap.has_key(key): keymap = self.StateTokenMap[key] if keymap[0][0] != MOVETOFLAG: raise TypeError, "unexpected map type in StateTokenMap" for (Flag,ToState) in keymap: kjSet.AddArc( EGraph, State, ToState ) #endfor # transitively close EGraph kjSet.TransClose( EGraph ) # Translate EGraph into a dictionary of lists EMap = {} for State in range(0,self.maxState+1): EMap[State] = kjSet.Neighbors( EGraph, State ) # make each e-closure of each self.state a state of the closure FSM. # here closure states assumed transient -- reset elsewhere. # first do the initial state Closure.States[ Closure.initial_state ] = \ [TRANSFLAG, kjSet.NewSet(EMap[self.initial_state]) ] # do all other states (save initial and successful final states) #for State in range(0,self.maxState+1): # if State != self.initial_state \ # and State != self.successful_final_state: # Closure.NewSetState(TRANSFLAG, kjSet.NewSet(EMap[State]) ) ##endfor # compute set of all known tokens EXCEPT EPSILON Tokens = kjSet.NewSet( [] ) for (State, Token) in self.StateTokenMap.keys(): if Token != Epsilon: kjSet.addMember(Token, Tokens) # tranform it into a list Tokens = kjSet.get_elts(Tokens) # for each state of the the closure FSM (past final) add transitions # and add new states as needed until all states are processed # (uses convention that states are allocated sequentially) ThisClosureState = 1 while ThisClosureState <= Closure.maxState: MemberStates = kjSet.get_elts(Closure.States[ThisClosureState][1]) # for each possible Token, compute the union UTrans of all # e-closures for all transitions for all member states, # on the Token, make UTrans a new state (if needed), # and transition ThisClosureState to UTrans on Token for Token in Tokens: UTrans = kjSet.NewSet( [] ) for MState in MemberStates: # if MState has a transition on Token, include # EMap for the destination state key = (MState, Token) if self.StateTokenMap.has_key(key): DStateTup = self.StateTokenMap[key] if DStateTup[0][0] != MOVETOFLAG: raise TypeError, "unknown map type" for (DFlag, DState) in DStateTup: for EDState in EMap[DState]: kjSet.addMember(EDState, UTrans) #endif #endfor MState # register UTrans as a new state if needed UTState = Closure.NewSetState(TRANSFLAG, UTrans) # record transition from # ThisClosureState to UTState on Token if DoNullMaps: Closure.SetMap( ThisClosureState, Token, UTState) else: if not kjSet.Empty(UTrans): Closure.SetMap( ThisClosureState, Token, UTState) #endfor Token ThisClosureState = ThisClosureState +1 #endwhile return Closure #enddef Eclosure # add an set-marked state to self if not present # uses self.States[s][1] as the set marking the state s # # only used by Eclosure above # def NewSetState(self, kind, InSet): # return existing state if one is present that matches the set LastState= self.maxState # skip state 0 (successful final state)??? for State in range(1,LastState+1): MarkSet = self.States[State][1] if kjSet.Same(InSet,MarkSet): return State # nonlocal #endfor # if not exited then allocate a new state LastState = LastState + 1 self.States[LastState] = [ kind , InSet ] self.maxState = LastState return LastState #enddef newSetState #endclass CFSMachine # Ruleset class, used to compute NFA and then DFA for # parsing based on a list of rules. # class ruleset: def __init__(self, StartNonterm, Rulelist): # initialize the ruleset self.StartNonterm = StartNonterm self.Rules = Rulelist # method to compute prefixes and First sets for nonterminals def CompFirst(self): # uses the special null production token NULLTOKEN # snarfed directly from Aho+Ullman (terminals glossed) First = kjSet.NewDG( [] ) # repeat the while loop until no change is made to First done = 0 while not done: done = 1 # assume we're done until a change is made to First # iterate through all rules looking for a new arc to add # indicating Terminal --> possible first token derivation # for R in self.Rules: GoalNonterm = R.Nonterm Bodylength = len(R.Body) # look through the body of the rule up to the token with # no epsilon production (yet seen) Bodyindex = 0 Processindex = 1 while Processindex: # unless otherwise indicated below, don't go to next token Processindex = 0 # if index is past end of body then record # an epsilon production for this nonterminal if Bodyindex >= Bodylength: if not kjSet.HasArc(First, GoalNonterm, NULLTOKEN ): kjSet.AddArc( First, GoalNonterm, NULLTOKEN ) done = 0 # change made to First else: # otherwise try to add firsts of this token # to firsts of the Head of the rule. Token = R.Body[Bodyindex] (type, name) = Token if type in (KEYFLAG,TERMFLAG): # try to add this terminal to First for GoalNonterm if not kjSet.HasArc(First, GoalNonterm, Token): kjSet.AddArc( First, GoalNonterm, Token) done = 0 elif type == NONTERMFLAG: # try to add each First entry for nonterminal # to First entry for GoalNonterm for FToken in kjSet.Neighbors( First, Token ): if not kjSet.HasArc(First, GoalNonterm, FToken): kjSet.AddArc( First, GoalNonterm, FToken) done = 0 # does this nonterminal have a known e production? if kjSet.HasArc( First, Token, NULLTOKEN ): # if so, process next token in rule Processindex = 1 else: raise TokenError, "unknown token type in rule body" #endif Bodyindex = Bodyindex + 1 #endwhile Processindex #endfor R in self.Rules #endwhile not done self.First = First #enddef CompFirst # computing the Follow set for the ruleset # the good news: I think it's correct. # the bad news: It's slower than it needs to be for epsilon cases. def CompFollow(self): Follow = kjSet.NewDG( [] ) # put end marker on follow of start nonterminal kjSet.AddArc(Follow, self.StartNonterm, kjParser.ENDOFFILETOKEN) # now compute other follows using the rules; # repeat the loop until no change to Follow. done = 0 while not done: done = 1 # assume done unless Follow changes for R in self.Rules: #print R # work backwards in the rule body to # avoid retesting for epsilon nonterminals Bodylength = len(R.Body) EpsilonTail = 1 # the tail of rule may expand to null BodyIndex = Bodylength - 1 Last = 1 # loop starts at the last from types import TupleType while BodyIndex >= 0: Token = R.Body[BodyIndex] (Ttype,Tname) = Token if Ttype in (KEYFLAG,TERMFLAG): # keywords etc cancel epsilon tail, otherwise ignore EpsilonTail = 0 elif Ttype == NONTERMFLAG: # if the tail expands to epsilon, map # follow for the goal nonterminal to this token # and also follow for the tail nonterms if EpsilonTail: # add follow for goal for FToken in kjSet.Neighbors(Follow,R.Nonterm): if not kjSet.HasArc(Follow,Token,FToken): kjSet.AddArc(Follow,Token,FToken) #if type(FToken[0])==TupleType: # raise ValueError, "bad FToken"+`FToken` #print "new", Token, FToken done = 0 # follow changed, loop again # add follow for tail members #for Index2 in range(BodyIndex+1, Bodylength): # TailToken = R.Body[Index2] # for FToken in kjSet.Neighbors(Follow,TailToken): # if not kjSet.HasArc(Follow,Token,FToken): # kjSet.AddArc(Follow,Token,FToken) # done = 0 #endif EpsilonTail # if we are not at the end use First set for next token if not Last: NextToken = R.Body[BodyIndex+1] (NTtype, NTname) = NextToken if NTtype in (KEYFLAG,TERMFLAG): if not kjSet.HasArc(Follow,Token,NextToken): kjSet.AddArc(Follow,Token,NextToken) #print "next", Token, NextToken done = 0 elif NTtype == NONTERMFLAG: for FToken in kjSet.Neighbors(self.First, NextToken): if FToken != NULLTOKEN: if not kjSet.HasArc(Follow,Token,FToken): kjSet.AddArc(Follow,Token,FToken) #print "neighbor", Token, FToken done = 0 else: # next token expands to epsilon: # add its follow, unless already done above #if not EpsilonTail: for FToken in kjSet.Neighbors(Follow,NextToken): if not kjSet.HasArc(Follow,Token,FToken): kjSet.AddArc(Follow,Token,FToken) #print "epsilon", Token, FToken done = 0 else: raise TokenError, "unknown token type in rule body" #endif not Last # finally, check whether next iteration has epsilon tail if not kjSet.HasArc(self.First, Token, NULLTOKEN): EpsilonTail = 0 else: raise TokenError, "unknown token type in rule body" BodyIndex = BodyIndex - 1 Last = 0 # no longer at the last token of the rule #endwhile #endfor #endwhile self.Follow = Follow #enddef CompFollow def DumpFirstFollow(self): First = self.First Follow = self.Follow print "First:" for key in First.keys(): name = key[1] print name," :: ", for (flag2,name2) in First[key].keys(): print name2,", ", print print "Follow:" for key in Follow.keys(): name = key[1] print name," :: ", for (flag2,name2) in Follow[key].keys(): print name2,", ", print # computing the "first" of the tail of a rule followed by an # optional terminal # doesn't include NULLTOKEN # requires self.First to be computed # def FirstOfTail(self, Rule, TailIndex, Token=None): Result = kjSet.NewSet( [] ) # go through all tokens in rule tail so long as there is a # null derivation for the remainder Nullprefix = 1 BodyLength = len(Rule.Body) ThisIndex = TailIndex while Nullprefix and ThisIndex < BodyLength: RToken = Rule.Body[ThisIndex] (RTtype, RTname) = RToken if RTtype == NONTERMFLAG: for FToken in kjSet.Neighbors(self.First, RToken): if FToken != NULLTOKEN: kjSet.addMember(FToken, Result) #endfor # check whether this symbol might have a null production if not kjSet.HasArc(self.First, RToken, NULLTOKEN): Nullprefix = 0 elif RTtype in [KEYFLAG, TERMFLAG]: kjSet.addMember(RToken, Result) Nullprefix = 0 else: raise TokenError, "unknown token type in rule body" ThisIndex = ThisIndex + 1 #endwhile # add the optional token if given and Nullprefix still set if Nullprefix and Token != None: kjSet.addMember(Token, Result) return Result #enddef FirstOfTail # compute an SLR NFA for the ruleset with states for each SLR "item" # and transitions, eg: # X --> .AB # on A maps to X --> A.B # on epsilon maps to A --> .ZC # and A --> .WK # an item is a pair (rulenumber, bodyposition) # where body position 0 is interpreted to point before the # beginning of the body. # # SLR = "simple LR" in Aho+Ullman terminology # def CompSLRNFA(self): NFA = CFSMachine(self.StartNonterm) Nrules = len(self.Rules) itemStateMap = {} for Ruleindex in range(0,Nrules): Rule = self.Rules[Ruleindex] # make an item for each "dot" position in the body for DotPos in range(0, len(Rule.Body) + 1): item = (Ruleindex, DotPos) itemState = NFA.NewState(TRANSFLAG, [item]) itemStateMap[item] = itemState #endfor DotPos #endfor Ruleindex # now that the states are initialized # compute transitions except for the last item of a rule # (which has none) for Ruleindex in range(0,Nrules): Rule = self.Rules[Ruleindex] for DotPos in range(0, len(Rule.Body)): item = (Ruleindex, DotPos) CurrentToken = Rule.Body[DotPos] ThisState = itemStateMap[item] NextState = itemStateMap[ (Ruleindex, DotPos + 1) ] NFA.SetMap( ThisState, CurrentToken, NextState ) # if the current token is a nonterminal # ad epsilon transitions to first item for any # rule that derives this nonterminal (CTtype, CTname) = CurrentToken if CTtype == NONTERMFLAG: for Rule2index in range(0,Nrules): Rule2 = self.Rules[Rule2index] Head = Rule2.Nonterm if Head == CurrentToken: NextState = itemStateMap[( Rule2index, 0 )] NFA.SetMap( ThisState, NULLTOKEN, NextState ) #endfor Rule2index #endif CTtype == NONTERMFLAG #endfor DotPos #endfor Ruleindex # must handle the initial state properly here! # Make a dummy state with e-transitions to all first items # for rules that derive the initial nonterminal ThisState = NFA.initial_state GoodStartingPlace = None for Ruleindex in range(0,Nrules): Rule = self.Rules[Ruleindex] Head = Rule.Nonterm if Head == self.StartNonterm: GoodStartingPlace= (Ruleindex, 0) NextState = itemStateMap[ GoodStartingPlace ] NFA.SetMap( ThisState, NULLTOKEN, NextState ) # fix the NFA.States entry if GoodStartingPlace == None: raise NotSLRError, "No derivation for root nonterminal." NFA.States[ NFA.initial_state ] = \ [ 'transient', GoodStartingPlace ] self.SLRNFA = NFA #enddef CompSLRNFA # dump an item def ItemDump(self, item): (ruleindex, position) = item Rule = self.Rules[ruleindex] print Rule.Nonterm[1],' >> ', for bindex in range(0, len(Rule.Body)): if position == bindex: print " (*) ", print Rule.Body[bindex][1], if position == len(Rule.Body): print " (*) " else: print # utility function -- returns true if an item is a final item def SLRItemIsFinal(self, item): (ruleindex, position) = item Rule = self.Rules[ruleindex] if position == len(Rule.Body): return 1 else: return 0 # dump the NFA def DumpSLRNFA(self): NFA = self.SLRNFA print "root: ", NFA.root_nonTerminal for key in NFA.StateTokenMap.keys(): map = NFA.StateTokenMap[key] (fromstate, token) = key fromitem = NFA.States[ fromstate ][1] self.ItemDump(fromitem) print " on ", token[1], " maps " for Tostate in map: Toitem = NFA.States[Tostate][1] print " ", self.ItemDump(Toitem) # compute DFA for ruleset by computing the E-closure of the # NFA def CompDFA(self): self.DFA = self.SLRNFA.Eclosure(NULLTOKEN) def DumpDFAsets(self): DFA = self.DFA print "root: ", DFA.root_nonTerminal for State in range(1, len(DFA.States) ): self.DumpItemSet(State) def DumpItemSet(self,State): DFA = self.DFA NFA = self.SLRNFA print print "STATE ", State, " *******" fromNFAindices = kjSet.get_elts(DFA.States[State][1]) for NFAindex in fromNFAindices: item = NFA.States[NFAindex][1] print " ", NFAindex, ": ", self.ItemDump(item) # this function completes the computation of an SLR DFA # by adding reduction states for each DFA state S containing # item H --> B. # which reduces rule H --> B # for each token T in Follow of H. # if S already has a transition for T then there is a conflict! # # assumes DFA and SLRNFA and Follow have been computed. # def SLRFixDFA(self): DFA = self.DFA NFA = self.SLRNFA # look through the states (except 0=success) of the DFA # initially don't add any new states, just record # actions to be done # uses convention that 0 is successful final state # ToDo is a dictionary which maps # (State, Token) to a item to reduce ToDo = {} Error = None for State in range(1, len(DFA.States) ): # look for a final item for a rule in this state fromNFAindices = kjSet.get_elts(DFA.States[State][1]) for NFAindex in fromNFAindices: item = NFA.States[NFAindex][1] # if the item is final remember to do the reductions... if self.SLRItemIsFinal(item): (ruleindex, position) = item Rule = self.Rules[ruleindex] Head = Rule.Nonterm Following = kjSet.Neighbors( self.Follow, Head ) for Token in Following: key = (State, Token) if not ToDo.has_key(key): ToDo[ key ] = item else: # it might be okay if the items are identical? item2 = ToDo[key] if item != item2: print "reduce/reduce conflict on ",key self.ItemDump(item) self.ItemDump(item2) Error = " apparent reduce/reduce conflict" #endif #endfor #endif #endfor NFAindex #endfor State # for each (State,Token) pair which indicates a reduction # record the reduction UNLESS the map is already set for the pair for key in ToDo.keys(): (State,Token) = key item = ToDo[key] (rulenum, dotpos) = item ExistingMap = DFA.map( State, Token ) if ExistingMap[0] == NOMATCHFLAG: DFA.SetReduction( State, Token, rulenum ) else: print "apparent shift/reduce conflict" print "reduction: ", key, ": " self.ItemDump(item) print "existing map ", ExistingMap Error = " apparent shift/reduce conflict" #endfor if Error and ABORTONERROR: raise NotSLRError, Error #enddef SLRfixDFA() # do complete SLR DFA creation starting after initialization def DoSLRGeneration(self): self.CompFirst() self.CompFollow() self.CompSLRNFA() self.CompDFA() self.SLRFixDFA() #endclass ruleset ################ the following are interpretation functions ################ used by RULEGRAM meta grammar # some constants used here COMMENTFORM = "##.*\n" RSKEY = "@R" COLKEY = "::" LTKEY = ">>" IDNAME = "ident" # an identifier in the meta grammar is any nonwhite string # except the keywords @R :: >> or comment flag ## IDFORM = "[^" + string.whitespace + "]+" # for identifiers simply return the string def IdentFun(string): return string # RootReduction should receive list of form # [ nontermtoken, keyword COLKEY, RuleList ] def RootReduction(list, ObjectGram): if len(list) != 3 or list[1] != COLKEY: raise FlowError, "unexpected metagrammar root reduction" return (list[0], list[2]) # NullRuleList should receive list of form # [] def NullRuleList(list, ObjectGram): if list != []: raise FlowError, "unexpected null RuleList form" return [] # FullRuleList should receive list of form # [ Rule, RuleList ] def FullRuleList(list, ObjectGram): if type(list) != type([]) or len(list)!=2: raise FlowError, "unexpected full RuleList form" NewRule = list[0] OldRules = list[1] return [NewRule] + OldRules # InterpRule should receive list of form # [keyword RSKEY, # RuleNameStr, # keyword COLKEY, # Nontermtoken, # keyword LTKEY, # Bodylist] # def InterpRule(list, ObjectGram): # check keywords: if len(list) != 6 or \ list[0] != RSKEY or \ list[2] != COLKEY or \ list[4] != LTKEY: raise FlowError, "unexpected meta rule reduction form" ruleName = list[1] ruleNonterm = list[3] ruleBody = list[5] # upcase the the representation of keywords if needed if not ObjectGram.LexD.isCaseSensitive(): for i in range(0,len(ruleBody)): (flag, name) = ruleBody[i] if flag == KEYFLAG: ruleBody[i] = (KEYFLAG, string.upper(name)) elif not flag in (TERMFLAG, NONTERMFLAG): raise FlowError, "unexpected rule body member" rule = kjParser.ParseRule( ruleNonterm, ruleBody ) rule.Name = ruleName return rule # InterpRuleName should receive # [ string ] def InterpRuleName(list, ObjectGram): #print list # add error checking? return list[0] # InterpNonTerm should receive # [ string ] def InterpNonTerm(list, ObjectGram): #print list if type(list)!=type([]) or len(list)!=1: raise FlowError, "unexpected rulename form" Name = list[0] # determine whether this is a valid nonterminal if not ObjectGram.NonTermDict.has_key(Name): #print Name raise TokenError, "LHS of Rule must be nonterminal: "+Name return ObjectGram.NonTermDict[Name] # NullBody should receive [] def NullBody(list, ObjectGram): #print list if list != []: raise FlowError, "unexpected null Body form" return [] # FullBody should receive # [ string, Bodylist] # must determine whether the string represents # a keyword, a nonterminal, or a terminal of the object # grammar. # returns (KEYFLAG, string) (TERMFLAG, string) or # (NONTERMFLAG, string) respectively # def FullBody(list,ObjectGram): #print list if type(list)!=type([]) or len(list)!=2: raise FlowError, "unexpected body form" Name = list[0] # Does the Name rep a nonterm, keyword or term # of the object grammar (in that order). if ObjectGram.NonTermDict.has_key(Name): kind = NONTERMFLAG elif ObjectGram.LexD.keywordmap.has_key(Name): kind = KEYFLAG elif ObjectGram.TermDict.has_key(Name): kind = TERMFLAG else: raise TokenError, "Rule body contains unregistered string: "+Name restOfBody = list[1] return [(kind, Name)] + restOfBody # function to generate a grammar for parsing grammar rules # def ruleGrammar(): LexD = kjParser.LexDictionary() # use SQL/Ansi style comments LexD.comment( COMMENTFORM ) # declare keywords RStart = LexD.keyword( RSKEY ) TwoColons = LexD.keyword( COLKEY ) LeadsTo = LexD.keyword( LTKEY ) # declare terminals ident = LexD.terminal(IDNAME, IDFORM, IdentFun ) # declare nonterminals Root = kjParser.nonterminal("Root") Rulelist = kjParser.nonterminal("RuleList") Rule = kjParser.nonterminal("Rule") RuleName = kjParser.nonterminal("RuleName") NonTerm = kjParser.nonterminal("NonTerm") Body = kjParser.nonterminal("Body") # declare rules # Root >> NonTerm :: Rulelist InitRule = kjParser.ParseRule( Root, \ [NonTerm, TwoColons, Rulelist], RootReduction ) # Rulelist >> RLNull = kjParser.ParseRule( Rulelist, [], NullRuleList) # Rulelist >> Rule Rulelist RLFull = kjParser.ParseRule( Rulelist, [Rule,Rulelist], FullRuleList) # Rule >> "@R :: NonTerm >> Body RuleR = kjParser.ParseRule( Rule, \ [RStart, RuleName, TwoColons, NonTerm, LeadsTo, Body],\ InterpRule) # Rulename >> ident RuleNameR = kjParser.ParseRule( RuleName, [ident], InterpRuleName) # NonTerm >> ident NonTermR = kjParser.ParseRule( NonTerm, [ident], InterpNonTerm) # Body >> BodyNull = kjParser.ParseRule( Body, [], NullBody) # Body >> ident Body BodyFull = kjParser.ParseRule( Body, [ident,Body], FullBody) # declare Rules list and Associated Name dictionary Rules = [RLNull, RLFull, RuleR, RuleNameR, NonTermR,\ BodyNull, BodyFull, InitRule] RuleDict = \ { "RLNull":0, "RLFull":1, "RuleR":2, "RuleNameR":3, \ "NonTermR":4, "BodyNull":5, "BodyFull":6 , "InitRule":7 } # make the RuleSet and compute the associate DFA RuleSet = ruleset( Root, Rules ) RuleSet.DoSLRGeneration() # construct the Grammar object Result = kjParser.Grammar( LexD, RuleSet.DFA, Rules, RuleDict ) return Result #enddef RuleGrammar() # this is the rule grammar object for # parsing RULEGRAM = ruleGrammar() # a derived grammar class (object oriented programming is cool!) # this is a compilable grammar for automatic parser generation. # class CGrammar(kjParser.Grammar): # initialization is handled by the base class # insert a white separated list of keywords into the LexD # THIS SHOULD CHECK FOR KEYWORD/NONTERMINAL/PUNCT NAME # COLLISIONS (BUT DOESN'T YET). def Keywords(self, Stringofkeys): keywordlist = string.split(Stringofkeys) for keyword in keywordlist: self.LexD.keyword( keyword ) # insert a string of punctuations into the LexD def punct(self, Stringofpuncts): for p in Stringofpuncts: self.LexD.punctuation(p) # register a list of regular expression strings # to represent comments in LexD def comments(self, listOfCommentStrings): for str in listOfCommentStrings: self.LexD.comment(str) # register a white separated list of nonterminal strings def Nonterms(self, StringofNonterms): nonTermlist = string.split(StringofNonterms) for NonTerm in nonTermlist: self.NonTermDict[NonTerm] = kjParser.nonterminal(NonTerm) # initialize or add more rules to the RuleString def Declarerules(self, StringWithRules): self.RuleString = self.RuleString + "\n" + StringWithRules # The compilation function assumes # NonTermDict # RuleString # LexD # TermDict # have all been set up properly # (at least if the default MetaGrammar is used). # On successful completion it will set up # DFA # RuleL # RuleNameToIndex def Compile(self, MetaGrammar=RULEGRAM): # the following should return a list of rules # with punctuations of self.LexD interpreted as trivial keywords # keywords of seld.LexD interpreted as keywords # and nonterminals registered in NonTermDict interpreted as # nonterms. # ParseResult should be of form ( (rootNT, RuleL), self ) ParseResult = MetaGrammar.DoParse1( self.RuleString, self ) (RootNonterm, Rulelist) = ParseResult # make a ruleset and compute its DFA RuleS = ruleset( RootNonterm, Rulelist ) RuleS.DoSLRGeneration() # make the rulename to index map to allow future bindings for i in range(0,len(Rulelist)): Rule = Rulelist[i] self.RuleNameToIndex[ Rule.Name ] = i # fill in the blanks self.DFA = RuleS.DFA self.RuleL = Rulelist # FOR DEBUG AND TESTING self.Ruleset = RuleS # DON'T clean up the grammar (misc structures are used) # in future bindings #enddef Compile # Write a reconstructable representation for this grammar # to a file #EXCEPT: # - rule associations to reduction functions # will be lost (must be reset elsewhere) # - terminals in the lexical dictionary # will not be initialized # # IND is used for indentation, should be whitespace (add check!) # # FName if given will cause the reconstructed to be placed # inside a function `FName`+"()" returning the grammar object # # NOTE: this function violates information hiding principles; # in particular it "knows" the guts of the FSM and LexD classes # def Reconstruct(self, VarName, Tofile, FName=None, indent=""): Reconstruction = codeReconstruct(VarName, Tofile, self, FName, indent) GrammarDumpSequence(Reconstruction) #enddef Reconstruct # marshalling of a grammar to a file def MarshalDump(self, Tofile): Reconstruction = marshalReconstruct(self, Tofile) GrammarDumpSequence(Reconstruction) #endclass CGrammar # general procedure for different types of archiving for grammars def GrammarDumpSequence(ReconstructObj): # assume an initialized Reconstruct Object with appropriate grammar etc. # put the lexical part ReconstructObj.PutLex() # put the rules ReconstructObj.PutRules() # put transitions ReconstructObj.PutTransitions() # finish up ReconstructObj.Cleanup() # function to create a "null CGrammar" def NullCGrammar(): return CGrammar(None,None,None,{}) # utility classes -- Grammar reconstruction objects # encapsulate the process of grammar archiving. # class Reconstruct: # this "virtual class" is only for common behaviors of subclasses. def MakeTokenArchives(self): # make a list of all tokens and # initialize token --> int dictionary keys = self.Gram.DFA.StateTokenMap.keys() tokenToInt = {} tokenSet = kjSet.NewSet([]) for k in keys: kjSet.addMember(k[1], tokenSet) tokens = kjSet.get_elts(tokenSet) for i in range(0,len(tokens)): tokenToInt[ tokens[i] ] = i self.keys = keys self.tokens = tokens # global sub self.tokInt = tokenToInt # global sub # grammar reconstruction to a file class codeReconstruct(Reconstruct): def __init__(self, VarName, Tofile, Grammar, FName=None, indent =""): # do global subs for each of these self.Var = VarName self.File = Tofile self.FName = FName self.Gram = Grammar # put the reconstruction in a function if FName is given if FName != None: Tofile.write("\n\n") Tofile.write(indent+"def "+FName+"():\n") IND = indent+" " else: IND = indent self.I = IND # global sub! Tofile.write("\n\n") Tofile.write(IND+"# ******************************BEGIN RECONSTRUCTION\n") Tofile.write(IND+"# Python declaration of Grammar variable "+VarName+".\n") Tofile.write(IND+"# automatically generated by module "+PMODULE+".\n") Tofile.write(IND+"# Altering this sequence by hand will probably\n") Tofile.write(IND+"# leave it unusable.\n") Tofile.write(IND+"#\n") Tofile.write(IND+"import "+PMODULE+"\n\n") Tofile.write(IND+"# variable declaration:\n") Tofile.write(IND+VarName+"= "+PMODULE+".NullGrammar()\n\n") # make self.keys list of dfa keys, # self.tokens list of grammar tokens, # self.tokInt inverted dictionary for self.tokens self.MakeTokenArchives() Tofile.write("\n\n"+IND+"# case sensitivity behavior for keywords.\n") if self.Gram.LexD.isCaseSensitive(): Tofile.write(IND+VarName+".SetCaseSensitivity(1)\n") else: Tofile.write(IND+VarName+".SetCaseSensitivity(0)\n") #enddef __init__ def PutLex(self): IND = self.I Tofile = self.File VarName = self.Var LexD = self.Gram.LexD tokens = self.tokens Tofile.write("\n\n"+IND+"# declaration of lexical dictionary.\n") Tofile.write(IND+"# EXCEPT FOR TERMINALS\n") Tofile.write(IND+VarName+".LexD.punctuationlist = ") Tofile.write(`LexD.punctuationlist`+"\n") Tofile.write(IND+"# now comment patterns\n") for comment in LexD.commentstrings: Tofile.write(IND+VarName+".LexD.comment("+`comment`+")\n") Tofile.write(IND+"# now define tokens\n") for i in range(0,len(tokens)): tok = tokens[i] (kind, name) = tok if kind == TERMFLAG: # put warning at end! # nonterminal not installed in lexical dictionary here! Tofile.write(IND+VarName+".IndexToToken["+`i`+"] = ") Tofile.write(PMODULE+".termrep("+`name`+")\n") elif kind == KEYFLAG: Tofile.write(IND+VarName+".IndexToToken["+`i`+"] = ") Tofile.write(VarName+".LexD.keyword("+`name`+")\n") elif kind == NONTERMFLAG: Tofile.write(IND+VarName+".IndexToToken["+`i`+"] = ") Tofile.write(PMODULE+".nonterminal("+`name`+")\n") else: raise FlowError, "unknown token type" #enddef PutLex def PutRules(self): IND = self.I VarName = self.Var Rules = self.Gram.RuleL Tofile = self.File Root = self.Gram.DFA.root_nonTerminal Tofile.write("\n\n"+IND+"# declaration of rule list with names.\n") Tofile.write(IND+"# EXCEPT FOR INTERP FUNCTIONS\n") nrules = len(Rules) Tofile.write(IND+VarName+".RuleL = [None] * "+`nrules`+"\n") for i in range(0,nrules): # put warning at end: # rule reduction function not initialized here! rule = Rules[i] name = rule.Name Tofile.write(IND+"rule = "+`rule`+"\n") Tofile.write(IND+"name = "+`name`+"\n") Tofile.write(IND+"rule.Name = name\n") Tofile.write(IND+VarName+".RuleL["+`i`+"] = rule\n") Tofile.write(IND+VarName+".RuleNameToIndex[name] = "+`i`+"\n") Tofile.write("\n\n"+IND+"# DFA root nonterminal.\n") Tofile.write(IND+VarName+".DFA.root_nonTerminal =") Tofile.write(`Root`+"\n") #enddef PutRules def PutTransitions(self): IND = self.I Tofile = self.File VarName = self.Var maxState = self.Gram.DFA.maxState tokenToInt = self.tokInt StateTokenMap = self.Gram.DFA.StateTokenMap keys = self.keys Tofile.write("\n\n"+IND+"# DFA state declarations.\n") for state in range(1, maxState+1): Tofile.write(IND+VarName+".DFA.States["+`state`+"] = ") Tofile.write('['+`TRANSFLAG`+']\n') Tofile.write(IND+VarName+".DFA.maxState = "+`maxState`+"\n") Tofile.write("\n\n"+IND+"# DFA transition declarations.\n") for key in keys: (fromState, TokenRep) = key TokenIndex = tokenToInt[TokenRep] TokenArg = VarName+".IndexToToken["+`TokenIndex`+"]" TMap = StateTokenMap[key] TMaptype = TMap[0][0] if TMaptype == REDUCEFLAG: # reduction rulenum = TMap[0][1] Args = "("+`fromState`+","+TokenArg+","+`rulenum`+")" Tofile.write(IND+VarName+".DFA.SetReduction"+Args+"\n") elif TMaptype == MOVETOFLAG: # MoveTo Args = "("+`fromState`+","+TokenArg+","+`TMap[0][1]`+")" Tofile.write(IND+VarName+".DFA.SetMap"+Args+"\n") else: raise FlowError, "unexpected else (2)" #enddef def Cleanup(self): Tofile = self.File RuleL = self.Gram.RuleL tokens = self.tokens VarName = self.Var IND = self.I FName = self.FName Tofile.write("\n\n"+IND+"# Clean up the grammar.\n") Tofile.write(IND+VarName+".CleanUp()\n") # if the Fname was given return the grammar as function result if FName != None: Tofile.write("\n\n"+IND+"# return the grammar.\n") Tofile.write(IND+"return "+VarName+"\n") Tofile.write("\n\n"+IND+"# WARNINGS ****************************** \n") Tofile.write(IND+"# You must bind the following rule names \n") Tofile.write(IND+"# to reduction interpretation functions \n") for R in RuleL: Tofile.write(IND+"# "+VarName+".Bind("+`R.Name`+", ??function??)\n") Tofile.write(IND+"#(last rule)\n") Tofile.write("\n\n"+IND+"# WARNINGS ****************************** \n") Tofile.write(IND+"# You must bind the following terminals \n") Tofile.write(IND+"# to regular expressions and interpretation functions \n") warningPrinted = 0 for tok in tokens: (kind, name) = tok if kind == TERMFLAG and tok != ENDOFFILETOKEN: Tofile.write(IND+"# "+VarName+\ ".Addterm("+`name`+", ??regularExp??, ??function??)\n") warningPrinted = 1 if not warningPrinted: Tofile.write(IND+"# ***NONE** \n") Tofile.write(IND+"#(last terminal)\n") Tofile.write(IND+"# ******************************END RECONSTRUCTION\n") #enddef #endclass # reconstruction using marshalling to a file # encodes internal structures for grammar using marshal-able # objects. Final marshalling to the file is done at CleanUp() # storing one big tuple. # class marshalReconstruct(Reconstruct): def __init__(self, Grammar, Tofile): self.Gram = Grammar self.File = Tofile # should archive self.tokens structure self.MakeTokenArchives() # archive this self.CaseSensitivity = Grammar.LexD.isCaseSensitive() def PutLex(self): LexD = self.Gram.LexD # archive these self.punct = LexD.punctuationlist self.comments = LexD.commentstrings def PutRules(self): # archive this self.Root = self.Gram.DFA.root_nonTerminal # make a list of tuples that can be used with # rule = apply(ParseRule, tuple[1]) # rule.Name = tuple[0] Rules = self.Gram.RuleL nrules = len(Rules) RuleTuples = [None] * nrules for i in range(nrules): rule = Rules[i] RuleTuples[i] = (rule.Name, rule.components()) #archive this self.RuleTups = RuleTuples def PutTransitions(self): keys = self.keys tokenToInt = self.tokInt StateTokenMap = self.Gram.DFA.StateTokenMap # archive this self.MaxStates = self.Gram.DFA.maxState # create two lists, # one for reductions with contents (fromState, tokennumber, rulenum) # one for movetos with contents (fromstate, tokennumber, tostate) # (note: token number not token itself to allow sharing) # to allow arbitrary growing, first use dicts: reductDict = {} nreducts = 0 moveToDict = {} nmoveTos = 0 for key in self.keys: (fromState, TokenRep) = key TokenIndex = tokenToInt[TokenRep] TMap = StateTokenMap[key] TMaptype = TMap[0][0] if TMaptype == REDUCEFLAG: rulenum = TMap[0][1] reductDict[nreducts] = (fromState, TokenIndex, rulenum) nreducts = nreducts + 1 elif TMaptype == MOVETOFLAG: ToState = TMap[0][1] moveToDict[nmoveTos] = (fromState, TokenIndex, ToState) nmoveTos = nmoveTos + 1 else: raise FlowError, "unexpected else" #endfor # translate dicts to lists reducts = [None] * nreducts for i in range(nreducts): reducts[i] = reductDict[i] moveTos = [None] * nmoveTos for i in range(nmoveTos): moveTos[i] = moveToDict[i] # archive these self.reducts = reducts self.moveTos = moveTos # this is the function that does the marshalling def Cleanup(self): import marshal # make the big list to marshal BigList = [None] * 9 BigList[0] = self.tokens BigList[1] = self.punct BigList[2] = self.comments BigList[3] = self.RuleTups BigList[4] = self.MaxStates BigList[5] = self.reducts BigList[6] = self.moveTos BigList[7] = self.Root BigList[8] = self.CaseSensitivity # dump the big list to the file marshal.dump( BigList, self.File ) #end class #######################testing stuff if RUNTESTS: def echo(x): return x # simple grammar stolen from a text LD0 = kjParser.LexDictionary() id = LD0.terminal("id","id",echo) plus = LD0.punctuation("+") star = LD0.punctuation("*") oppar = LD0.punctuation("(") clpar = LD0.punctuation(")") equals = LD0.punctuation("=") E = kjParser.nonterminal("E") T = kjParser.nonterminal("T") Tp = kjParser.nonterminal("Tp") Ep = kjParser.nonterminal("Ep") F = kjParser.nonterminal("F") rule1 = kjParser.ParseRule( E, [ T, Ep ] ) rule2 = kjParser.ParseRule( Ep, [ plus, T, Ep ] ) rule3 = kjParser.ParseRule( Ep, [ ] ) rule4 = kjParser.ParseRule( T, [ F, Tp ] ) rule5 = kjParser.ParseRule( Tp, [ star, F, Tp ] ) rule6 = kjParser.ParseRule( Tp, [ ] ) rule7 = kjParser.ParseRule( F, [ oppar, E, clpar ] ) rule8 = kjParser.ParseRule( F, [ id ] ) rl0 = [ rule1, rule2, rule3, rule4, rule5, rule6, rule7,rule8] rs0 = ruleset(E, rl0) rs0.CompFirst() Firstpairs = kjSet.GetPairs(rs0.First) rs0.CompFollow() Followpairs = kjSet.GetPairs(rs0.Follow) rs0.CompSLRNFA() NFA0 = rs0.SLRNFA rs0.CompDFA() rs0.SLRFixDFA() DFA0 = rs0.DFA class dummy: pass ttt0 = dummy() def TESTDFA( STRING , ttt, DFA, Rulelist, DOREDUCTIONS = 1): ttt.STRING = STRING #ttt.List = kjParser.LexList(LD0, ttt.STRING) ttt.Stream = kjParser.LexStringWalker( ttt.STRING, LD0 ) ttt.Stack = {-1:0}# Walkers.SimpleStack() ttt.ParseObj = kjParser.ParserObj( Rulelist, \ ttt.Stream, DFA, ttt.Stack,DOREDUCTIONS) ttt.RESULT = ttt.ParseObj.GO() #ttt.Stack.Dump(10) return ttt.RESULT def TESTDFA0( STRING , DOREDUCTIONS = 1): return TESTDFA( STRING, ttt0, DFA0, rl0, DOREDUCTIONS ) TESTDFA0( " id + id * id ") # an even simpler grammar S = kjParser.nonterminal("S") M = kjParser.nonterminal("M") A = kjParser.nonterminal("A") rr1 = kjParser.ParseRule( S, [M] ) #rr2 = kjParser.ParseRule( A, [A, plus, M]) #rr3 = kjParser.ParseRule( A, [M], echo) #rr4 = kjParser.ParseRule( M, [M, star, M]) rr5 = kjParser.ParseRule( M, [oppar, M, clpar]) rr6 = kjParser.ParseRule( M, [id]) rl1 = [rr1,rr5,rr6] rs1 = ruleset(S, rl1) rs1.CompFirst() rs1.CompFollow() rs1.CompSLRNFA() rs1.CompDFA() rs1.SLRFixDFA() DFA1 = rs1.DFA ttt1=dummy() def TESTDFA1( STRING , DOREDUCTIONS = 1): return TESTDFA( STRING, ttt1, DFA1, rl1, DOREDUCTIONS ) X = kjParser.nonterminal("X") Y = kjParser.nonterminal("Y") RX = kjParser.ParseRule( X, [ oppar, Y, clpar ] ) RY = kjParser.ParseRule( Y, [] ) rl2 = [RX,RY] rs2 = ruleset(X, rl2) rs2.CompFirst() rs2.CompFollow() rs2.CompSLRNFA() rs2.CompDFA() rs2.SLRFixDFA() DFA2 = rs2.DFA ttt2 = dummy() def TESTDFA2( STRING, DOREDUCTIONS = 1): return TESTDFA( STRING, ttt2, DFA2, rl2, DOREDUCTIONS ) # the following grammar should fail to be slr # (Aho,Ullman p. 213) S = kjParser.nonterminal("S") L = kjParser.nonterminal("L") R = kjParser.nonterminal("R") RS1 = kjParser.ParseRule( S, [L, equals, R] ) RS2 = kjParser.ParseRule( S, [R], echo ) RL1 = kjParser.ParseRule( L, [star, R]) RL2 = kjParser.ParseRule( L, [id]) RR1 = kjParser.ParseRule( R, [L] ) rs3 = ruleset(S, [RS1,RS2,RL1,RL2,RR1]) rs3.CompFirst() rs3.CompFollow() rs3.CompSLRNFA() rs3.CompDFA() #rs3.SLRFixDFA() # should fail and does. # testing RULEGRAM ObjG = NullCGrammar() ObjG.Addterm("id","id",echo) ObjG.Nonterms("T E Ep F Tp") ObjG.Keywords("begin end") ObjG.punct("+*()") ObjG.comments(["--.*\n"]) # PROBLEM WITH COMMENTS??? Rulestr = """ ## what a silly grammar! T :: @R One :: T >> begin E end @R Three :: E >> @R Two :: E >> E + T @R Four :: E >> ( T ) """ RL = RULEGRAM.DoParse1( Rulestr, ObjG ) Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/kjParser.py100644 1007 1403 131054 6747630573 25431 0ustar petrillipetrilli# # python for parser interpretation # Copyright Aaron Robert Watters, 1994 # # BUGS: # Lexical error handling is not nice # Parse error handling is not nice # # Lex analysis may be slow for big grammars # Setting case sensitivity for keywords MUST happen BEFORE # declaration of keywords. import kjSet import string import regex import regsub import string # set this flag for regression testing at each load RUNTESTS = 0 # set this flag to enable warning for default reductions WARNONDEFAULTS = 0 # some local constants TERMFLAG = -1 # FLAG FOR TERMINAL NOMATCHFLAG = -2 # FLAG FOR NO MATCH IN FSM MOVETOFLAG = -3 # FLAG FOR "SHIFT" IN SN FSM REDUCEFLAG = -4 # FLAG FOR REDUCTION IN FSM TRANSFLAG = -5 # FLAG FOR TRANSIENT STATE IN FSM KEYFLAG = -6 # FLAG FOR KEYWORD NONTERMFLAG = -7 # FLAG FOR NONTERMINAL TERMFLAG = -8 # FLAG FOR TERMINAL EOFFLAG = "*" # FLAG for End of file # set this string to the Module name (filename) # used for dumping reconstructable objects THISMODULE = "kjParser" # regular expression for matching whitespace WHITERE = "["+string.whitespace+"]+" WHITEREGEX = regex.compile(WHITERE) # local errors LexTokenError = "LexTokenError" # may happen on bad string UnkTermError = "UnkTermError" # ditto BadPunctError= "BadPunctError" # if try to make whitespace a punct ParseInitError = "ParseInitError" # shouldn't happen? #EOFError # may happen on bad string FlowError = "FlowError" # shouldn't happen!!! (bug) #SyntaxError # may happen on bad string #TypeError ReductError = "ReductError" # shouldn't happen? NondetError = "NondetError" # shouldn't happen? # the end of file is interpreted in the lexical stream as # a terminal... # this should be appended to the lexical stream: ENDOFFILETOKEN = (TERMFLAG, EOFFLAG) # in FSM use the following terminal to indicate eof ENDOFFILETERM = (ENDOFFILETOKEN, EOFFLAG) # utility function for error diagnostics def DumpStringWindow(Str, Pos, Offset=15): L = [] L.append("near ::") start = Pos-Offset end = Pos+Offset if start<0: start = 0 if end>len(Str): end = len(Str) L.append(`Str[start:Pos]`+"*"+`Str[Pos:end]`) from string import join return join(L, "\n") # lexical dictionary class # this data structure is used by lexical parser below. # # basic operations: # LD.punctuation(string) # registers a string as a punctuation # EG: LD.punctuation(":") # Punctuations are treated as a special kind of keyword # that is recognized even when not surrounded by whitespace. # IE, "xend" will not be recognized as "x end", but "x;" will be # recognized as "x ;" if "end" is a regular keyword but # ";" is a punctuation. Only single character punctuations # are supported (now), ie, ":=" must be recognized as # ":" "=" above the lexical level. # # LD.comment(compiled_reg_expression) # registers a comment pattern # EG LD.comment(regex.compile("--.*\n")) # asks to recognize ansi/sql comments like "-- correct?\n" # # LD.keyword(keyword_string, canonicalstring) # specifies a keyword string that should map to the canonicalstring # when translated to the lexical stream. # EG: LD.keyword("begin","BEGIN"); LD.keyword("BEGIN","BEGIN") # will recognize upcase or downcase begins, not mixed case. # (automatic upcasing is allowed below at parser level). # # LD[compiled_reg_expression] = (TerminalFlag, Function) # assignment! # specifies a regular expression that should be associated # with the lexical terminal marker TerminalFlag # EG: LD[regex.compile("[0-9]+")] = ("integer",string.atoi) # the Function should be a function on one string argument # that interprets the matching string as a value. if None is # given, just the string itself will be used as the # interpretation. (a better choice above would be a function # which "tries" atoi first and uses atol on overflow). # NOTE: ambiguity among regular expressions will be decided # arbitrarily (fix?). # # LD[string] # retrieval! # returns ((KEYFLAG, Keywordstring), Keywordstring) # if the (entire) string matches a keyword or a # punctuation Keywordstring. # otherwise returns ((TERMFLAG, Terminalname), value) # if the (entire) string matches the regular expression for # a terminal flaged by Terminalname; value is the interpreted # value. TerminalFlag better be something other than # KEYFLAG! # otherwise raises an error! # comments not filtered here! # # the following additional functions are used for autodocumentation # in declaring rules, etcetera. # begin = LD.keyword("begin") # sets variable "begin" to (KEYFLAG, "BEGIN") if # "begin" maps to keyword "BEGIN" in LD # integer = LD.terminal("integer") # sets variable integer to ("integer", Function) # if "integer" is a registered terminal Function is # its associated interpretation function. # class LexDictionary: def __init__(self): # commentpatterns is simply a list of compiled regular expressions # that represent comments self.commentpatterns = [] # commentstrings is used for debugging/dumping/reconstruction etc. self.commentstrings = [] # punctuationlist is a string of punctuations self.punctuationlist = "" # keywordmap is a dictionary mapping recognized keyword strings # and punctuations to their constant representations. self.keywordmap = KeywordDict() # regexprlist is a list of triples (regex,Flag,function) mapping # regular expressions to their flag and interpreter function. self.regexprlist = [] def Dump(self): print "comments = ", self.commentstrings print "punctuations = ", self.punctuationlist print "keywordmap =" self.keywordmap.Dump() print "regexprlist =", self.regexprlist def __getitem__(self,key): # try to match string to a keyword try: return self.keywordmap[key] except KeyError: # try to match a regular expression found = 0 # so far not found length = len(key) for triple in self.regexprlist: (regexpr, Flag, Function) = triple index = regexpr.match(key) if index == length: found = 1 # use the function to interpret the string, if given if Function != None: value = Function(key) else: value = key # NONLOCAL RETURN return (Flag, value) #endfor raise LexTokenError, "no match for string: " + `key` #enddef __getitem__ # LD.keyword("this") will make a new keyword "this" if not found # def keyword(self,str): # upcase the string, if needed if self.keywordmap.caseInsensitive: str = string.upper(str) if not self.keywordmap.has_key(str): # redundancy for to avoid excess construction during parsing token = (KEYFLAG,str) self.keywordmap[str] = (token,str) else: (token, str2) = self.keywordmap[str] return token # LD.terminal("this") will just look for "this" # LD.terminal("this", RE, F) will register a new terminal # RE must be a compiled regular expression or string reg ex # F must be an interpretation function # def terminal(self, string, RegExpr=None, Function=None): if RegExpr != None and Function != None: if type(RegExpr) == type(""): RegExpr = regex.compile(RegExpr) self[ RegExpr ] = ( string, Function) for triple in self.regexprlist: (regexpr,token,Function) = triple if token[1] == string: # nonlocal exit return token #endfor # error if no exit by now raise UnkTermError, "no such terminal" def __setitem__(self,key,value): if type(key) == type(''): # if it's a string it must be a keyword if self.keywordmap.caseInsensitive: value = string.upper(value) key = string.upper(key) self.keywordmap[key] = ( (KEYFLAG, value), value) else: # otherwise it better be a compiled regular expression (not #verified) (Name, Function) = value Flag = (TERMFLAG, Name) regexpr = key self.regexprlist = self.regexprlist + \ [ (regexpr, Flag, Function) ] # register a regular expression as a comment def comment(self, string): # regexpr better be a uncompiled string regular expression! (not verified) regexpr = regex.compile(string) self.commentpatterns = self.commentpatterns + [ regexpr ] self.commentstrings = self.commentstrings + [ string ] # register a string as a punctuation def punctuation(self,Instring): if type(Instring) != type("") or len(Instring)!=1: raise BadPunctError, "punctuation must be string of length 1" if Instring in string.whitespace: raise BadPunctError, "punctuation may not be whitespace" self.punctuationlist = self.punctuationlist + Instring return self.keyword(Instring) # testing and altering case sensitivity behavior def isCaseSensitive(self): return not self.keywordmap.caseInsensitive # setting case sensitivity MUST happen before keyword # declarations! def SetCaseSensitivity(self, Boolean): self.keywordmap.caseInsensitive = not Boolean # function to do same as __getitem__ above but looking _inside_ a string # instead of at the whole string # returns (token,skip) # where token is one of # ((KEYFLAG,name),name) or ((TERMFLAG,termname),value) # and skip is the length of substring of string that matches thetoken def Token(self, String, StartPosition): finished = 0 # dummy, exit should be nonlocal totalOffset = 0 while not finished: # flag EOF if past end of string? if len(String) <= StartPosition: return (ENDOFFILETERM, 0) # skip whitespace whitespacefound = 0 skip = WHITEREGEX.match(String, StartPosition) if skip > 0: StartPosition = StartPosition + skip totalOffset = totalOffset + skip whitespacefound = 1 # try to find comment, keyword, term in that order: # looking for comment commentfound = 0 for commentexpr in self.commentpatterns: offset = commentexpr.match(String,StartPosition) if offset != -1: if offset<1: info = DumpStringWindow(String,StartPosition) raise LexTokenError, "zero length comment "+info commentfound = 1 StartPosition = StartPosition + offset totalOffset = totalOffset + offset # looking for a keyword keypair = self.keywordmap.hasPrefix(String,StartPosition, self.punctuationlist) if keypair != 0: return ( keypair[0], keypair[1] + totalOffset) # looking for terminal for (regexpr, Flag, Function) in self.regexprlist: offset = regexpr.match(String,StartPosition) if offset != -1: matchstring = String[StartPosition : offset+StartPosition] if Function != None: value = Function(matchstring) else: value = matchstring return ((Flag, value) , offset + totalOffset) if not (commentfound or whitespacefound): info = DumpStringWindow(String,StartPosition) raise LexTokenError, "Lexical parse failure "+info #endwhile #enddef #endclass LexDictionary # alternate, experimental implementation class lexdictionary: def __init__(self): self.skip = "" self.commentstrings = [] self.punctuationlist = "" self.keywordmap = KeywordDict() self.termlist = [] # list of (term, regex, flag, interpret_fn) self.uncompiled = 1 # only compile after full initialization. self.laststring= self.lastindex= self.lastresult = None def Dump(self, *k): raise "sorry", "not implemented" __getitem__ = Dump def keyword(self, str): kwm = self.keywordmap if kwm.caseInsensitive: str = string.upper(str) try: (token, str2) = kwm[str] except: token = (KEYFLAG, str) self.keywordmap[str] = (token,str) return token def terminal(self, str, regexstr=None, Function=None): if regexstr is not None: flag = (TERMFLAG, str) self.termlist.append( (str, regexstr, flag, Function) ) return flag else: for (s,fl,fn) in self.termlist: if fl[1]==str: return fl else: raise UnkTermError, "no such terminal" __setitem__ = Dump def comment(self, str): self.commentstrings.append(str) def punctuation(self, Instring): if type(Instring) != type("") or len(Instring)!=1: raise BadPunctError, "punctuation must be string of length 1" if Instring in string.whitespace: raise BadPunctError, "punctuation may not be whitespace" self.punctuationlist = self.punctuationlist + Instring return self.keyword(Instring) def SetCaseSensitivity(self, Boolean): self.keywordmap.caseInsensitive = not Boolean def Token(self, String, StartPosition): # shortcut for reductions. if self.laststring is String and self.lastindex == StartPosition: #print "lastresult", self.lastresult return self.lastresult self.lastindex = StartPosition self.laststring = String #print `String[StartPosition: StartPosition+60]` if self.uncompiled: self.compile() self.uncompiled = None finished = 0 totalOffset = 0 skipprog = self.skipprog keypairfn = self.keywordmap.hasPrefix punctlist = self.punctuationlist termregex = self.termregex while not finished: #print String[StartPosition:] if len(String) <= StartPosition: result = self.lastresult = (ENDOFFILETERM, 0) return result # skip ws and comments skip = skipprog.match(String, StartPosition) if skip>0: if skip==0: info = DumpStringWindow(String, StartPosition) raise LexTokenError, \ "zero length whitespace or comment "+info #print "skipping", `String[StartPosition: StartPosition+skip]` StartPosition = StartPosition + skip totalOffset = totalOffset + skip continue # look for keyword keypair = keypairfn(String, StartPosition, punctlist) if keypair!=0: #print "keyword", keypair result = self.lastresult = (keypair[0], keypair[1]+totalOffset) return result # look for terminal offset = termregex.match(String, StartPosition) if (offset>0): g = termregex.group for (term, regex, flag, fn) in self.termlist: test = g(term) if test: #print "terminal", test if fn is not None: value = fn(test) else: value = test result = self.lastresult = ( (flag, value), offset + totalOffset) return result # error if we get here info = DumpStringWindow(String, StartPosition) raise LexTokenError, "Lexical token not found "+info def isCaseSensitive(self): return not self.keywordmap.caseInsensitive def compile(self): from string import joinfields, whitespace import regex skipregexen = self.commentstrings + [WHITERE] skipregex = "\(" + joinfields(skipregexen, "\)\|\(") + "\)" #print skipregex; import sys; sys.exit(1) self.skipprog = regex.compile(skipregex) termregexen = [] termnames = [] for (term, rgex, flag, fn) in self.termlist: fragment = "\(<%s>%s\)" % (term, rgex) termregexen.append(fragment) termnames.append(term) termregex = joinfields(termregexen, "\|") self.termregex = regex.symcomp(termregex) self.termnames = termnames LexDictionary = lexdictionary ##### test! # a utility class: dictionary of prefixes # should be generalized to allow upcasing of keyword matches class KeywordDict: def __init__(self, caseInsensitive = 0): self.FirstcharDict = {} self.KeyDict = {} self.caseInsensitive = caseInsensitive def Dump(self): if self.caseInsensitive: print " case insensitive" else: print " case sensitive" keys = self.KeyDict.keys() print " keyDict has ", len(keys), " elts" for key in keys: print " ", key," maps to ",self.KeyDict[key] firstchars = self.FirstcharDict.keys() print " firstcharDict has ", len(firstchars), " elts" for char in firstchars: print " ", char," maps to ",self.FirstcharDict[char] # set item assumes value has correct case already, if case sensitive def __setitem__(self, key, value): if len(key)<1: raise LexTokenError, "Keyword of length 0" if self.caseInsensitive: KEY = string.upper(key) else: KEY = key firstchar = KEY[0:1] if self.FirstcharDict.has_key(firstchar): self.FirstcharDict[firstchar] = \ self.FirstcharDict[firstchar] + [(KEY, value)] else: self.FirstcharDict[firstchar] = [(KEY, value)] self.KeyDict[KEY] = value # if String has a registered keyword at start position # return its canonical representation and offset, else 0 # keywords that are not punctuations should be # recognized only if followed # by a punctuation or whitespace char # def hasPrefix(self,String,StartPosition,punctuationlist): First = String[StartPosition:StartPosition+1] fcd = self.FirstcharDict caseins = self.caseInsensitive if caseins: First = string.upper(First) if fcd.has_key(First): Keylist = fcd[First] else: return 0 for (key,value) in Keylist: offset = len(key) EndPosition = StartPosition+offset match = String[StartPosition : EndPosition] if caseins: match = string.upper(match) if key == match: if len(key)==1 and key in punctuationlist: # punctuations are recognized regardless of nextchar return (value,offset) else: # nonpuncts must have punct or whitespace following #(uses punct as single char convention) if EndPosition == len(String): return (value, offset) else: nextchar = String[EndPosition] if nextchar in string.whitespace\ or nextchar in punctuationlist: return (value, offset) return 0 # if no exit inside for loop, fail def __getitem__(self,key): if self.caseInsensitive: key = string.upper(key) return self.KeyDict[key] def has_key(self,key): if self.caseInsensitive: key = string.upper(key) return self.KeyDict.has_key(key) #endclass KeywordDict: # LexStringWalker walks through a string looking for # substrings recognized by a lexical dictionary # # ERROR REPORTING NEEDS IMPROVEMENT class LexStringWalker: def __init__(self, String, LexDict): self.Position = 0 self.NextPosition = 0 self.String = String self.LexDict = LexDict self.PastEOF = 0 self.Done = 0 def DUMP(self): return DumpStringWindow(self.String,self.Position) #reset not defined def more(self): return not self.PastEOF def getmember(self): (Token,skip) = self.LexDict.Token(self.String, self.Position) self.NextPosition = self.Position + skip if Token == ENDOFFILETERM: self.PastEOF = 1 return Token def next(self): if self.Done: data = self.DUMP() raise LexTokenError, "no next past end of file "+data elif self.PastEOF: self.Done=1 elif self.NextPosition > self.Position: self.Position = self.NextPosition else: dummy = self.getmember() if self.NextPosition <= self.Position: data = self.DUMP() raise LexTokenError, "Lexical walker not advancing "+data self.Position = self.NextPosition #endclass LexStringWalker # the parse class: # Based loosely on Aho+Ullman, Principles of Compiler Design, Ch.6. # except that they don't describe how to handle boundary # conditions, I made them up myself. # # Note: This could be implemented using just functions; it's implemented # as a class to facilitate diagnostics and debugging in case of # failures of various sorts. # # a parse accepts # a rule list # # a lexically analysed stream with methods # stream.getmember() returns the current token on the stream # stream.next() moves on to next token # stream.more() returns false if current token is the last token # # and a FSM (finite state machine) with methods # FSM.root_nonTerminal # the nonterminal at which to start parsing # FSM.initial_state # the initial state to start at # FSM.successful_final_state # the final state to go to upon successful parse # FSM.map(Current_State,Current_Token) # returns either # (TERMFLAG, 0) # if Current_State is terminal (final or reduction). # (NOMATCHFLAG, 0) # if Current_State is nonterminal, but the Current_Token # and Next_Token do not lead to a valid state in the FSM # (MOVETOFLAG, Next_State) # if Current_State is nonterminal and Current_Token, # Next_token map to Next_State from Current_State. # (REDUCEFLAG, Rulenum) # if Current_State indicates a reduction at Current_Token # for rule Rule number Rule # # and a Stack with methods (replaced with dictionary) # (init: {-1:0} ) # Stack.Top() returns top of stack (no pop) # ( Stack[Stack[-1]] ) # Stack.Push(Object) # ( Stack[-1]=Stack[-1]+1; Stack[Stack[-1]]=Object ) # Stack.MakeEmpty() # ( Stack[-1]=0 ) # Stack.IsEmpty() # ( Stack[-1] == 0 ) # Stack.Pop() # ( Stack[-1] = Stack[-1]-1 ) # stack contents created by Parser will be of form (State,Value) # where Value was inserted at FSM state State. # Value of form either (KEYFLAG, Name) # (NontermName, reductionvalue) # or (TerminalName, value) # # and an optional parameter Evaluate which if 0 indicates that # rules should be evaluated, otherwise indicates that rules # should just be reduced and the reduction structure should # be used as the result of the rule # # rule objects must support methods # Rule.reduce(Stack) # pops off the elements corresponding to the body of the Rule # from the stack and returns (NewStack,Red) where NewStack is # the stack minus the body and Red is the result of evaluating the # reduction function on this instance of the rule. # Rule.Nonterm # the nonterminal at the head of the rule class ParserObj: # Evaluate determines whether rules should be evaluated # after reductions. Context is an argument passed to the # list reduction function # def __init__(self, Rulelist, Stream, FSM, Stack, \ Evaluate=1, \ Context=None): self.Rules = Rulelist self.LexStream = Stream self.FSM = FSM self.Stack = Stack self.Context = Context # start with empty stack, initial_state, no nonterminal #self.Stack[-1] = 0# self.Stack.MakeEmpty() self.Stack[:] = [] self.State = FSM.initial_state self.currentNonterm = None self.Evaluate = Evaluate # DoOneReduction accepts tokens from the stream and pushes # them onto the stack until a reduction state is reached. # # Resolve the reduction # def DoOneReduction(self): current=self.State FSM=self.FSM Stack = self.Stack Context = self.Context Stream = self.LexStream # the internal FSM.StateTokenMap dictionary is used directly here. STMap = FSM.StateTokenMap #if FSM.final_state(current): # raise ParseInitError, 'trying to reduce starting at final state' tokenVal = Stream.getmember() #print "tokenVal", tokenVal token = tokenVal[0] # push the token and traverse FSM until terminal state is reached #(flag, nextThing) = FSM.map(current, token) key = (current, token) try: (flag, nextThing) = STMap[key][0] except KeyError: flag = NOMATCHFLAG while flag == MOVETOFLAG: nextState = nextThing #print current, " shift ", token, # no sanity check, possible infinite loop # push current token and next state ThingToPush = (nextState, tokenVal) #print "pushing ", ThingToPush #Stack[-1]=Stack[-1]+1; Stack[Stack[-1]]=ThingToPush Stack.append(ThingToPush) #Stack.Push( ThingToPush ) # move to next token, next state Stream.next() # error if end of stream if not Stream.more(): # optimized Stream.PastEOF (?) data = Stream.DUMP() raise EOFError, 'end of stream during parse '+data current = nextState tokenVal = Stream.getmember() token = tokenVal[0] #MAP = FSM.map(current,token) key = (current, token) try: (flag, nextThing) = STMap[key][0] except KeyError: flag = NOMATCHFLAG # at end of while loop we should be at a reduction state if flag == REDUCEFLAG: rulenum = nextThing #print current, " reduce ", token, self.Rules[rulenum] # normal case # perform reduction rule = self.Rules[rulenum] Nonterm = rule.Nonterm self.currentNonterm = Nonterm (Stack, reduct) = rule.reduce( Stack , Context ) # self.Stack = Stack #not needed, unless stack rep changes GotoState = self.GotoState(rule) # push the Gotostate and result of rule reduction on stack ThingToPush = (GotoState, (Nonterm, reduct) ) # push the result of the reduction and exit normally #print "pushing ", ThingToPush #Stack[-1]=Stack[-1]+1; Stack[Stack[-1]]=ThingToPush Stack.append(ThingToPush) #Stack.Push(ThingToPush) self.State=GotoState return 1 # normal successful completion # some error cases elif flag == NOMATCHFLAG: self.ParseError(current,tokenVal, "nomatch1") #elif FSM.final_state(current): # raise BadFinalError, 'unexpected final state reached in reduction' else: data = Stream.DUMP() s = """ flag = %s map = %s """ % (flag, FSM.map(current,token)) data = data + s raise FlowError, 'unexpected else '+data #enddef DoOneReduction # compute the state to goto after a reduction is performed # on a rule. # Algorithm: determine the state at beginning of reduction # and the next state indicated by the head nonterminal of the rule. # special case: empty stack and root nonterminal --> success. # def GotoState(self, rule): FSM = self.FSM Stack = self.Stack Head = rule.Nonterm if len(Stack)==0: #Stack[-1]==0: #Stack.IsEmpty(): BeforeState = FSM.initial_state else: BeforeState = Stack[-1][0] #Stack[Stack[-1]][0] #Stack.Top()[0] # is this right? if the stack is empty and the Head # is the root nonterm, then goto is final state if len(Stack)==0 and Head == FSM.root_nonTerminal:#Stack.isEmpty() Result = FSM.successful_final_state else: # consider eliminating the call to .map here? (efficiency) (flag, Result) = FSM.map(BeforeState, Head) if flag != MOVETOFLAG: #FSM.DUMP() self.ParseError(BeforeState, Head, "notmoveto") return Result def ParseError( self, State, Token, *rest): # make this parse error nicer (add diagnostic methods?) L = [""] L.append("*******************************") L.append("current state = "+`State`) L.append("expects: ") expects = "" for (flag,name) in self.FSM.Expects(State): if flag in (TERMFLAG, KEYFLAG): expects = expects + `name`+ ", " L.append(expects) L.append(`rest`) L.append("current token = " + `Token`) #print "Stack =", #self.StackDump(5) #print from string import join data = self.LexStream.DUMP() + join(L, "\n") raise SyntaxError, 'unexpected token sequence.' + data def StackDump(self, N): Stack = self.Stack Topkey = len(Stack) if Topkey>N: Start = Topkey - N else: Start = 1 for i in range(Start,Topkey+1): print " :: ", Stack[i], # execute parsing until done: def GO(self): while self.State != self.FSM.successful_final_state: #self.FSM.final_state(self.State): self.DoOneReduction() # should I check that stack has only one elt here? # return result of last reduction return self.Stack[-1][1] #self.Stack.Top()[1] #endclass ParserObj # function for declaring a variable to represent a nonterminal: # eg Program = nonterminal("program") # included for convenient autodocumentation # def nonterminal(string): return (NONTERMFLAG, string) # declaring a terminal WITHOUT INSTALLING IT IN A LexDict def termrep(string): return (TERMFLAG, string) # the rule class # a rule is defined by a goal nonterminal marker of form # (NONTERMFLAG, Name) # and a list defining the body which must contain elts of form # (KEYFLAG, Name) or (NONTERMFLAG, Name) of (TERMFLAG, Name) # and a reduction function which takes a list of the same size # as the BodyList (consisting of the results of the evaluations of # the previous reductions) # and returns an interpretation for the body # the following function is used as a default reduction function # for rules def DefaultReductFun( RuleResultsList, Context ): if WARNONDEFAULTS: print "warn: default reduction." print " ", RuleResultsList return RuleResultsList class ParseRule: def __init__(self, goalNonTerm, BodyList, \ ReductFunction = DefaultReductFun): #print BodyList # check some of the arguments (very limited!) if len(goalNonTerm) != 2 or goalNonTerm[0] != NONTERMFLAG: raise TypeError, "goal of rule must be nonterminal" for m in BodyList: #print m if len(m) != 2: raise TypeError, "invalid body form for rule" self.Nonterm = goalNonTerm self.Body = BodyList self.ReductFun = ReductFunction # for dumping/reconstruction: LOSES THE INTERPRETATION FUNCTION! def __repr__(self): return THISMODULE + ".ParseRule" + `self.components()` # marshal-able components of a rule def components(self): return (self.Nonterm, self.Body) # rule.reduce(Stack) pops of the stack elements corresponding # to the body of the rule and prepares the appropriate reduction # object for evaluation (or not) at higher levels # def reduce(self, Stack, Context=None): #print "reducing", Stack Blength = len(self.Body) #print Blength, len(self.Body) # pop off previous results from stack corresponding to body BodyResults = [None] * Blength #BodyNames = [None] * Blength # for debug #print "popping: " for i in range(1,Blength+1): Bindex = Blength - i # stack contents pop off in reverse order # get and destructure the rule body entry RuleEntry = self.Body[Bindex] ( REkind , REname ) = RuleEntry # get and destructure the stack entry PoppedValue = Stack[-i] #Stack.Top() #print PoppedValue, #del Stack[-1]# = Stack[-1]-1 #Stack.Pop() SETokVal = PoppedValue[1] SEvalue = SETokVal[1] SEname = SETokVal[0][1] # the names from rule and stack must match (?) if SEname != REname: print SEname, REname print self raise ReductError, " token names don't match" # store the values for the reduction BodyResults[Bindex] = SEvalue #BodyNames[Bindex] = SEname # debug #endfor del Stack[len(Stack)-Blength:] #print "reduced", Stack #print # evaluate the reduction, in context reduct = self.ReductFun(BodyResults, Context) if WARNONDEFAULTS and self.ReductFun is DefaultReductFun: # should check whether name is defined before this... print " default used on ", self.Name #Reduction( self.ReductFun, BodyResults, BodyNames ) return (Stack, reduct) #enddef ParseRule.reduce #endclass ParseRule # for debugging: look through a rule list # and print names of rules that have default binding # def PrintDefaultBindings(rulelist): for r in rulelist: if r.ReductFun is DefaultReductFun: print r.Name # the FSM class # class FSMachine: def __init__(self, rootNonTerm): # start and success state conventions startState=1 successState=0 self.root_nonTerminal = rootNonTerm self.initial_state = startState self.successful_final_state = successState # the list of states of the FSM, implemented as a dictionary # entries are identified by their index # content is # a list whose first elt is either TRANSFLAG, or TERMFLAG # other list elts may be added by other layers (parse generator) # indicating the kind of the state. self.States = {} # allocate start and success states self.States[startState]=[TRANSFLAG] self.States[successState]=[TERMFLAG] # the most recently allocated state self.maxState= startState # the map of current token+state number to next state #with entries of form (tokenname,state):nextstate_sequence # self.StateTokenMap = {} #enddef FSM() # ForbiddenMark is for filtering out maps to an error state def DUMP(self, DumpMapData=1, DumpStateData=1, ForbiddenMark={}): print "root nonterminal is ", self.root_nonTerminal print "start at ", self.initial_state print "end at ", self.successful_final_state print "number of states: ", self.maxState if DumpStateData: print for State in range(0,self.maxState+1): Data = self.States[State] print State, ": ", Data if DumpMapData: print for key in self.StateTokenMap.keys(): map = self.StateTokenMap[key] if map[0][0] == MOVETOFLAG: ToStateData = self.States[map[0][1]] if len(ToStateData) < 2: Mark = None else: Mark = ToStateData[1] if Mark != ForbiddenMark: print key, " --> ", map, " = ", ToStateData else: print key, " --> reduction to rule number ", map[0][1] # what tokens does a state expect? def Expects(self, State): keys = self.StateTokenMap.keys() Tokens = kjSet.NewSet( [] ) for (state1,token) in keys: if State == state1: kjSet.addMember(token,Tokens) return kjSet.get_elts(Tokens) # "allocate" a new state of specified kind # kind must either be TRANSFLAG, TERMFLAG or a rule object # returns the number of the new state def NewState(self, kind, AdditionalInfo = []): if not kind in (TRANSFLAG,TERMFLAG,REDUCEFLAG): raise TypeError, "unknown state kind" available = self.maxState+1 self.States[available] = [kind] + AdditionalInfo self.maxState = available return available # Install a reduction transition in the FSM: # a reduction is represented by mapping to a rule index # no nondeterminism is allowed. def SetReduction(self, fromState, TokenRep, Rulenum): key = (fromState, TokenRep) if not self.StateTokenMap.has_key(key): self.StateTokenMap[ key ] = ((REDUCEFLAG, Rulenum),) else: raise ReductError, "attempt to set ambiguous reduction" # Install a "shift" or "goto transition in the FSM: # supports nondeterminism by storing a sequence of possible transitions # def SetMap(self, fromState, TokenRep, toState): key = (fromState, TokenRep) if self.StateTokenMap.has_key(key): Old = self.StateTokenMap[key] if Old[0][0] != MOVETOFLAG: # if the old value was not an integer, not a "normal state": # complain: raise NondetError, \ "attempt to make inappropriate transition ambiguous" self.StateTokenMap[ key ] = Old + ((MOVETOFLAG,toState),) else: self.StateTokenMap[ key ] = ((MOVETOFLAG,toState),) # Find the action indicated by fsm on # (current_state, current_token) input. # # note: in the event of nondeterministic choice this chooses # the first possibility listed. # ParseObj.DoOneReduction() currently uses the internal structure # of StateTokenMap directly, rather than using this function. # def map(self, current_state, current_token): StateEntry = self.States[current_state][0] if StateEntry == TERMFLAG: return (TERMFLAG, 0) elif StateEntry == TRANSFLAG: # try to find a transition for this token and state key = (current_state, current_token) try: TMap = self.StateTokenMap[key] #print "TMap ", TMap #print "key ", key #print return TMap[0] except KeyError: return (NOMATCHFLAG, 0) else: raise FlowError, "unexpected else (2)" #enddef map #endclass FSMachine # the grammar class: # a grammar consists of # - a LexDict lexical dictionary; # - a deterministic FSMachine; # - a Rulelist # and optionally a dictionary that maps Rulenames # to Rulelist indices (used for dumping and externally) # class Grammar: def __init__(self, LexD, DFA, RuleL, RuleNameDict = None): # for auto initialization set LexD,DFA,RuleL to None if LexD == None and DFA == None and RuleL == None: self.LexD = LexDictionary() # use a dummy root nonterminal -- must fix elsewhere! self.DFA = FSMachine("ERROR") self.RuleL = [] else: self.LexD = LexD self.DFA = DFA self.RuleL = RuleL if RuleNameDict != None: self.AddNameDict(RuleNameDict) self.CleanUp() #enddef __init__ # look for default bindings def PrintDefaults(self): print "Default bindings on:" PrintDefaultBindings(self.RuleL) # setting case sensitivity: must happen before keyword installation # in LexD. def SetCaseSensitivity( self, Boolean ): self.LexD.SetCaseSensitivity( Boolean ) # this may be silly, but to save some space in construction # a token dictionary may be used that facilitates sharing of # token representations. This method either initializes # the dictionary or disposes of it if it exists def CleanUp(self): self.IndexToToken = {} # this dictionary is used by automatically # generated grammars to determine whether # a string represents a nonterminal self.NonTermDict = {} # similarly for terminals self.TermDict = {} # this string may be used to keep a printable # representation of the rules of the grammar # (usually in automatic grammar generation self.RuleString = "" # to associate a token to an integer use # self.IndexToToken[int] = tokenrep # this method associates rules to names using a # RuleNameDict dictionary which maps names to rule indices. # after invocation # self.RuleNameToIndex[ name ] gives the index # in self.RuleL for the rule associated with name, and # self.RuleL[index].Name gives the name associated # with the rule self.RuleL[index] # def AddNameDict(self, RuleNameDict): self.RuleNameToIndex = RuleNameDict # add a Name attribute to the rules of the rule list for ruleName in RuleNameDict.keys(): index = RuleNameDict[ ruleName ] self.RuleL[ index ].Name = ruleName # parse a string using the grammar, return result and context def DoParse( self, String, Context = None, DoReductions = 1 ): # construct the ParserObj Stream = LexStringWalker( String, self.LexD ) Stack = [] # {-1:0} #Walkers.SimpleStack() ParseOb = ParserObj( self.RuleL, Stream, self.DFA, Stack, \ DoReductions, Context ) # do the parse ParseResult = ParseOb.GO() # return final result of reduction and the context return (ParseResult[1], Context) #enddef DoParse # parse a string using the grammar, but only return # the result of the last reduction, without the context def DoParse1( self, String, Context=None, DoReductions=1 ): return self.DoParse(String, Context, DoReductions)[0] # if the Name dictionary has been initialized # this method will (re)bind a reduction function to # a rule associated with Rulename # def Bind( self, Rulename, NewFunction ): ruleindex = self.RuleNameToIndex[ Rulename ] rule = self.RuleL[ ruleindex ] rule.ReductFun = NewFunction #enddef Bind # bind a terminal to a regular expression and interp function # in the lexical dictionary (convenience) def Addterm( self, termname, regexpstr, funct ): self.TermDict[ termname ] =\ self.LexD.terminal( termname, regexpstr, funct ) #endclass Grammar # function to create a "null grammar" def NullGrammar(): return Grammar(None,None,None,{}) # unmarshalling a marshalled grammar created by # buildmodule.CGrammar.MarshalDump(Tofile) # tightly coupled with buildmodule code... # file should be open and "pointing to" the marshalled rep. # # warning: doesn't bind semantics! # def UnMarshalGram(file): Grammar = NullGrammar() UnMarshal = UnMarshaller(file, Grammar) UnMarshal.MakeLex() UnMarshal.MakeRules() UnMarshal.MakeTransitions() UnMarshal.Cleanup() return UnMarshal.Gram # unmarshalling object for unmarshalling grammar from a file # class UnMarshaller: def __init__(self, file, Grammar): import marshal self.Gram = Grammar BigList = marshal.load(file) if type(BigList) != type([]): raise FlowError, "bad type for unmarshalled list" if len(BigList) != 9: raise FlowError, "unmarshalled list of wrong size" self.tokens = BigList[0] self.punct = BigList[1] self.comments = BigList[2] self.RuleTups = BigList[3] self.MaxStates = BigList[4] self.reducts = BigList[5] self.moveTos = BigList[6] self.Root = BigList[7] self.CaseSensitivity = BigList[8] Grammar.SetCaseSensitivity( self.CaseSensitivity ) def MakeLex(self): Grammar=self.Gram LexD = Grammar.LexD # punctuations LexD.punctuationlist = self.punct # comments for commentregex in self.comments: LexD.comment(commentregex) #LexD.commentstring = self.comments # keywords, terminals, nonterms # rewrite the tokens list for sharing and extra safety LexTokens = {} tokens = self.tokens for tokenindex in range(len(tokens)): (kind,name) = tokens[tokenindex] if kind == KEYFLAG: tokens[tokenindex] = LexD.keyword(name) elif not kind in [TERMFLAG, NONTERMFLAG]: raise FlowError, "unknown token type" # not needed self.tokens = tokens def MakeRules(self): Grammar = self.Gram Grammar.DFA.root_nonTerminal = self.Root NameIndex = Grammar.RuleNameToIndex RuleTuples = self.RuleTups nRules = len(RuleTuples) RuleList = [None] * nRules for index in range(nRules): (Name, Components) = RuleTuples[index] rule = apply(ParseRule, Components) rule.Name = Name RuleList[index] = rule NameIndex[Name] = index Grammar.RuleL = RuleList def MakeTransitions(self): Grammar = self.Gram DFA = Grammar.DFA StateTokenMap = DFA.StateTokenMap tokens = self.tokens # record the state number DFA.maxState = self.MaxStates # this is historical, unfortunately... CLEAN IT UP SOMEDAY! # THE DFA.States DICT IS NOT NEEDED (?) (here) for state in range(1, self.MaxStates+1): DFA.States[state] = [TRANSFLAG] # record the reductions for (fromState, TokenIndex, rulenum) in self.reducts: DFA.SetReduction(fromState, tokens[TokenIndex], rulenum) # record the transitions for (fromState, TokenIndex, ToState) in self.moveTos: DFA.SetMap(fromState, tokens[TokenIndex], ToState) def Cleanup(self): Grammar = self.Gram Grammar.CleanUp() ################# FOLLOWING CODE IS FOR REGRESSION TESTING ONLY ################# DELETE IT IF YOU WANT/NEED #### All tests for this module deleted, since #### ParseBuild module tests are sufficient. Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/kjSet.py100644 1007 1403 14177 6747630573 24716 0ustar petrillipetrilli # # sets implemented using mappings # Copyright Aaron Robert Watters, 1994 # # these only work for "immutable" elements. # probably not terribly efficient, but easy to implement # and not as slow as concievably possible. def NewSet(Sequence): Result = {} for Elt in Sequence: Result[Elt] = 1 return Result def Empty(Set): if Set == {}: return 1 else: return 0 def get_elts(Set): return Set.keys() def member(Elt,Set): return Set.has_key(Elt) # in place mutators: # returns if no change otherwise 1 def addMember(Elt,Set): change = 0 if not Set.has_key(Elt): Set[Elt] = 1 change = 1 return change def Augment(Set, OtherSet): change = 0 for Elt in OtherSet.keys(): if not Set.has_key(Elt): Set[Elt] = 1 change = 1 return change def Mask(Set, OtherSet): change = 0 for Elt in OtherSet.keys(): if Set.has_key(Elt): del Set[Elt] change = 1 return change # side effect free functions def Intersection(Set1, Set2): Result = {} for Elt in Set1.keys(): if Set2.has_key(Elt): Result[Elt] = 1 return Result def Difference(Set1, Set2): Result = {} for Elt in Set1.keys(): if not Set2.has_key(Elt): Result[Elt] = 1 return Result def Union(Set1,Set2): Result = {} Augment(Result,Set1) Augment(Result,Set2) return Result def Subset(Set1,Set2): Result = 1 for Elt in Set1.keys(): if not Set2.has_key(Elt): Result = 0 return Result # nonlocal return Result def Same(Set1,Set2): if Subset(Set1,Set2) and Subset(Set2,Set1): return 1 else: return 0 # directed graphs as Dictionaries of Sets # also only works for immutable nodes def NewDG(pairlist): Result = {} for (source,dest) in pairlist: AddArc(Result, source, dest) return Result def GetPairs(Graph): result = [] Sources = Graph.keys() for S in Sources: Dests = get_elts( Graph[S] ) ThesePairs = [None] * len(Dests) for i in range(0,len(Dests)): D = Dests[i] ThesePairs[i] = (S, D) result = result + ThesePairs return result def AddArc(Graph, Source, Dest): change = 0 if Graph.has_key(Source): Adjacent = Graph[Source] if not member(Dest,Adjacent): addMember(Dest,Adjacent) change = 1 else: Graph[Source] = NewSet( [ Dest ] ) change = 1 return change def Neighbors(Graph,Source): if Graph.has_key(Source): return get_elts(Graph[Source]) else: return [] def HasArc(Graph, Source, Dest): result = 0 if Graph.has_key(Source) and member(Dest, Graph[Source]): result = 1 return result def Sources(Graph): return Graph.keys() # when G1, G2 and G3 are different graphs this results in # G1 = G1 U ( G2 o G3 ) # If G1 is identical to one of G2,G3 the result is somewhat # nondeterministic (depends on dictionary implementation). # However, guaranteed that AddComposition(G,G,G) returns # G1 U (G1 o G1) <= G <= TC(G1) # where G1 is G's original value and TC(G1) is its transitive closure # hence this function can be used for brute force transitive closure # def AddComposition(G1, G2, G3): change = 0 for G2Source in Sources(G2): for Middle in Neighbors(G2,G2Source): for G3Dest in Neighbors(G3, Middle): if not HasArc(G1, G2Source, G3Dest): change = 1 AddArc(G1, G2Source, G3Dest) return change # in place transitive closure of a graph def TransClose(Graph): change = AddComposition(Graph, Graph, Graph) somechange = change while change: change = AddComposition(Graph, Graph, Graph) if not somechange: somechange = change return somechange ########### SQueue stuff # # A GrabBag should be used to hold objects temporarily for future # use. You can put things in and take them out, with autodelete # that's all! # make a new baggy with nothing in it # BG[0] is insert cursor BG[1] is delete cursor, others are elts # OLD = 1 NEW = 0 START = 2 def NewBG(): B = [None]*8 #default size B[OLD] = START B[NEW] = START return B def BGempty(B): # other ops must maintain this: old == new iff empty return B[OLD] == B[NEW] # may return new, larger structure # must be used with assignment... B = BGadd(e,B) def BGadd(elt, B): cursor = B[NEW] oldlen = len(B) # look for an available position while B[cursor] != None: cursor = cursor+1 if cursor >= oldlen: cursor = START if cursor == B[NEW]: #back to beginning break # resize if wrapped if B[cursor] != None: B = B + [None] * oldlen cursor = oldlen B[OLD] = START if B[cursor] != None: raise IndexError, "can't insert?" # add the elt B[cursor] = (elt,) B[NEW] = cursor # B nonempty so OLD and NEW should differ. if B[OLD] == cursor: B[NEW] = cursor + 1 if B[NEW]<=len(B): B[NEW] = START return B def BGgetdel(B): # find something to delete: cursor = B[OLD] blen = len(B) while B[cursor]==None: cursor = cursor+1 if cursor>=blen: cursor = START if cursor == B[OLD]: break # wrapped if B[cursor] == None: raise IndexError, "delete from empty grabbag(?)" # test to see if bag is empty (position cursor2 at nonempty slot) cursor2 = cursor+1 if cursor2>=blen: cursor2 = START while B[cursor2]==None: cursor2 = cursor2+1 if cursor2>=blen: cursor2 = START # since B[cursor] not yet deleted while will terminate # get and delete the elt (result,) = B[cursor] B[cursor] = None # cursor == cursor2 iff bag is empty B[OLD] = cursor2 if B[NEW] == cursor2: B[NEW] = cursor return result def BGtest(n): B = NewBG() rn = range(n) rn2 = range(n-2) for i in rn: for j in rn: B = BGadd( (i,j), B) B = BGadd( (j,i), B) x = BGgetdel(B) for j in rn2: y = BGgetdel(B) print (i, x, y) return B Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/kjbuckets0.py100644 1007 1403 70225 6747630574 25700 0ustar petrillipetrilli # kjbuckets in pure python ### needs more thorough testing! #import sys # for debug def kjtabletest(x): #print "kjtabletest" try: return x.is_kjtable except: return 0 unhashable = "unhashable key error" class kjGraph: is_kjtable = 1 def __init__(self, *args): #print "kjGraph.__init__", args key_to_list = self.key_to_list = {} self.dirty = 0 self.hashed = None #print args if args: if len(args)>1: raise ValueError, "only 1 or 0 argument supported" from types import IntType, ListType, TupleType arg = args[0] targ = type(arg) test = key_to_list.has_key if type(arg) is IntType: return # ignore int initializer (presize not implemented) elif type(arg) is ListType or type(arg) is TupleType: for (x,y) in arg: if test(x): key_to_list[x].append(y) else: key_to_list[x] = [y] return aclass = arg.__class__ if aclass is kjGraph: aktl = arg.key_to_list for k in aktl.keys(): key_to_list[k] = aktl[k][:] return if aclass is kjDict or aclass is kjSet: adict = arg.dict for k in adict.keys(): key_to_list[k] = [ adict[k] ] return raise ValueError, "arg for kjGraph must be tuple, list, or kjTable" def __repr__(self): return "%s(%s)" % (self.__class__.__name__, self.items()) def _setitems(self, thing): #print "kjGraph._setitem", thing #print "setitems", thing if self.hashed is not None: raise ValueError, "table has been hashed, it is immutable" try: for (k,v) in thing: #print k,v, "going" #inlined __setitem__ try: klist = self.key_to_list[k] #print "klist gotten" except KeyError: try: klist = self.key_to_list[k] = [] except TypeError: raise unhashable if v not in klist: klist.append(v) except (TypeError, KeyError): #print sys.exc_type, sys.exc_value if kjtabletest(thing): self._setitems(thing._pairs()) self.dirty = thing.dirty else: raise ValueError, "cannot setitems with %s" % type(thing) except unhashable: raise TypeError, "unhashable type" def __setitem__(self, item, value): ktl = self.key_to_list if ktl.has_key(item): l = ktl[item] if value not in l: l.append(value) else: ktl[item] = [value] def __getitem__(self, item): return self.key_to_list[item][0] def __delitem__(self, item): self.dirty = 1 del self.key_to_list[item] def choose_key(self): return self.key_to_list.keys()[0] def _pairs(self, justtot=0): myitems = self.key_to_list.items() tot = 0 for (k, v) in myitems: tot = tot + len(v) if justtot: return tot else: result = [None]*tot i = 0 for (k,v) in myitems: for x in v: result[i] = (k,x) i = i+1 return result def __len__(self): v = self.key_to_list.values() lv = map(len, v) from operator import add return reduce(add, lv, 0) def items(self): return self._pairs() def values(self): v = self.key_to_list.values() from operator import add tot = reduce(add, map(len, v), 0) result = [None] * tot count = 0 for l in v: next = count + len(l) result[count:next] = l count = next return result def keys(self): return self.key_to_list.keys() def member(self, k, v): ktl = self.key_to_list if ktl.has_key(k): return v in ktl[k] return 0 _member = member # because member redefined for kjSet def add(self, k, v): ktl = self.key_to_list if ktl.has_key(k): l = ktl[k] if v not in l: l.append(v) else: ktl[k] = [v] def delete_arc(self, k, v): self.dirty = 1 if self.hashed is not None: raise ValueError, "table has been hashed, it is immutable" try: l = self.key_to_list[k] i = l.index(v) del l[i] if not l: del self.key_to_list[k] except: raise KeyError, "not in table"# % (k,v) def has_key(self, k): return self.key_to_list.has_key(k) def subset(self, other): oc = other.__class__ if oc is kjGraph: oktl = other.key_to_list sktl = self.key_to_list otest = oktl.has_key for k in sktl.keys(): if otest(k): l = sktl[k] ol = oktl[k] for x in l: if x not in ol: return 0 else: return 0 return 1 elif oc is kjSet or oc is kjDict: sktl = self.key_to_list odict = other.dict otest = odict.has_key for k in sktl.keys(): if otest(k): l = sktl[k] ov = odict[k] for x in l: if ov!=x: return 0 else: return 0 return 1 def neighbors(self, k): try: return self.key_to_list[k][:] except: return [] def reachable(self, k): try: horizon = self.key_to_list[k] except: return kjSet() else: if not horizon: return [] d = {} for x in horizon: d[x] = 1 done = 0 while horizon: newhorizon = [] for n in horizon: for n2 in self.neighbors(n): if not d.has_key(n2): newhorizon.append(n2) d[n2] = 1 horizon = newhorizon return kjSet(d.keys()) def items(self): return self._pairs() # ???? def ident(self): result = kjDict(self) result.dirty = self.dirty or result.dirty return result def tclosure(self): # quick and dirty try: raise self except (kjSet, kjDict): raise ValueError, "tclosure only defined on graphs" except kjGraph: pass except: raise ValueError, "tclosure only defined on graphs" result = kjGraph(self) result.dirty = self.dirty addit = result.add while 1: #print result more = result*result if more.subset(result): return result for (x,y) in more.items(): addit(x,y) def Clean(self): if self.dirty: return None return self def Wash(self): self.dirty = 0 def Soil(self): self.dirty = 1 def remap(self, X): # really only should be defined for kjdict, but whatever return kjDict(X*self).Clean() def dump(self, seq): result = map(None, seq) for i in range(len(result)): result[i] = self[result[i]] if len(seq) == 1: return result[0] return tuple(result) def __hash__(self): # should test better """in conformance with kjbuckets, permit unhashable keys""" if self.hashed is not None: return self.hashed items = self._pairs() for i in xrange(len(items)): (a,b) = items[i] try: b = hash(b) except: b = 1877777 items[i] = hash(a)^~b items.sort() result = self.hashed = hash(tuple(items)) return result def __cmp__(self, other): #print "kjGraph.__cmp__" ls = len(self) lo = len(other) test = cmp(ls, lo) if test: return test si = self._pairs() oi = other._pairs() si.sort() oi.sort() return cmp(si, oi) def __nonzero__(self): if self.key_to_list: return 1 return 0 def __add__(self, other): result = kjGraph(self) rktl = result.key_to_list rtest = rktl.has_key result.dirty = self.dirty or other.dirty oc = other.__class__ if oc is kjGraph: oktl = other.key_to_list for k in oktl.keys(): l = oktl[k] if rtest(k): rl = rktl[k] for x in l: if x not in rl: rl.append(x) else: rktl[k] = l[:] elif oc is kjSet or oc is kjDict: odict = other.dict for k in odict.keys(): ov = odict[k] if rtest(k): rl = rktl[k] if ov not in rl: rl.append(ov) else: rktl[k] = [ov] else: raise ValueError, "kjGraph adds only with kjTable" return result __or__ = __add__ def __sub__(self, other): result = kjGraph() rktl = result.key_to_list sktl = self.key_to_list oc = other.__class__ if oc is kjGraph: oktl = other.key_to_list otest = oktl.has_key for k in sktl.keys(): l = sktl[k][:] if otest(k): ol = oktl[k] for x in ol: if x in l: l.remove(x) if l: rktl[k] = l else: rktl[k] = l elif oc is kjSet or oc is kjDict: odict = other.dict otest = odict.has_key for k in sktl.keys(): l = sktl[k][:] if otest(k): ov = odict[k] if ov in l: l.remove(ov) if l: rktl[k] = l else: raise ValueError, "kjGraph diffs only with kjTable" return result def __mul__(self, other): result = kjGraph() rktl = result.key_to_list sktl = self.key_to_list oc = other.__class__ if oc is kjGraph: oktl = other.key_to_list otest = other.has_key for sk in sktl.keys(): sklist = [] for sv in sktl[sk]: if otest(sv): sklist[0:0] = oktl[sv] if sklist: rktl[sk] = sklist elif oc is kjSet or oc is kjDict: odict = other.dict otest = odict.has_key for sk in sktl.keys(): sklist=[] for sv in sktl[sk]: if otest(sv): sklist.append(odict[sv]) if sklist: rktl[sk] = sklist else: raise ValueError, "kjGraph composes only with kjTable" return result def __invert__(self): result = self.__class__() pairs = self._pairs() for i in xrange(len(pairs)): (k,v) = pairs[i] pairs[i] = (v,k) result._setitems(pairs) result.dirty = self.dirty or result.dirty return result def __and__(self, other): sktl = self.key_to_list oc = other.__class__ if oc is kjGraph: result = kjGraph() rktl = result.key_to_list oktl = other.key_to_list otest = oktl.has_key for k in self.keys(): if otest(k): l = sktl[k] ol = oktl[k] rl = [] for x in l: if x in ol: rl.append(x) if rl: rktl[k] = rl elif oc is kjSet or oc is kjDict: result = oc() # less general! rdict = result.dict odict = other.dict stest = sktl.has_key for k in odict.keys(): if stest(k): v = odict[k] l = sktl[k] if v in l: rdict[k] = v else: raise ValueError, "kjGraph intersects only with kjTable" result.dirty = self.dirty or other.dirty return result def __coerce__(self, other): return (self, other) # ?is this sufficient? class kjDict(kjGraph): def __init__(self, *args): #print "kjDict.__init__", args self.hashed = None dict = self.dict = {} self.dirty = 0 if not args: return if len(args)==1: from types import TupleType, ListType, IntType arg0 = args[0] targ0 = type(arg0) if targ0 is IntType: return if targ0 is ListType or targ0 is TupleType: otest = dict.has_key for (a,b) in arg0: if otest(a): if dict[a]!=b: self.dirty = 1 dict[a] = b return argc = arg0.__class__ if argc is kjGraph: ktl = arg0.key_to_list for k in ktl.keys(): l = ktl[k] if len(l)>1: self.dirty=1 for v in l: dict[k] = v return if argc is kjSet or argc is kjDict: adict = arg0.dict for (k,v) in adict.items(): dict[k]=v return raise ValueError, "kjDict initializes only from list, tuple, kjTable, or int" def _setitems(self, thing): #print "kjDict._setitem", thing if self.hashed is not None: raise KeyError, "table hashed, cannot modify" dict = self.dict try: for (k,v) in thing: if dict.has_key(k) and dict[k]!=v: self.dirty = 1 dict[k] = v except: self._setitems(thing._pairs()) # maybe too tricky! def dump(self, dumper): ld = len(dumper) if ld==1: return self.dict[dumper[0]] else: sdict = self.dict result = [None] * ld for i in xrange(ld): result[i] = sdict[ dumper[i] ] return tuple(result) def __setitem__(self, item, value): if self.hashed is not None: raise ValueError, "table has been hashed, it is immutable" d = self.dict if d.has_key(item): if d[item]!=value: self.dirty = 1 self.dict[item]=value def __getitem__(self, item): return self.dict[item] def __delitem__(self, item): if self.hashed is not None: raise ValueError, "table has been hashed, it is immutable" self.dirty = 1 del self.dict[item] def choose_key(self): return self.dict.keys()[0] def __len__(self): return len(self.dict) def _pairs(self, justtot=0): if justtot: return len(self.dict) return self.dict.items() def values(self): return self.dict.values() def keys(self): return self.dict.keys() def items(self): return self.dict.items() def remap(self, X): if X.__class__ is kjGraph: if self.dirty or X.dirty: return None result = kjDict() resultd = result.dict selfd = self.dict inself = selfd.has_key inresult = resultd.has_key ktl = X.key_to_list for k in ktl.keys(): for v in ktl[k]: if inself(v): map = selfd[v] if inresult(k): if resultd[k]!=map: return None else: resultd[k]=map return result else: return (kjDict(X*self)).Clean() def __cmp__(s,o): from types import InstanceType if type(o) is not InstanceType: return -1 oc = o.__class__ if oc is kjDict or oc is kjSet: return cmp(s.dict, o.dict) return kjGraph.__cmp__(s, o) def __hash__(s): h = s.hashed if h is not None: return h return kjGraph.__hash__(s) def __add__(s,o): oc = o.__class__ if oc is kjDict or oc is kjSet: result = kjDict() result.dirty = s.dirty or o.dirty rdict = result.dict rtest = result.has_key sdict = s.dict for k in sdict.keys(): rdict[k] = sdict[k] odict = o.dict for k in odict.keys(): if rtest(k): if rdict[k]!=odict[k]: result.dirty=1 else: rdict[k] = odict[k] return result if oc is kjGraph: return kjGraph.__add__(o,s) else: raise ValueError, "kjDict unions only with kjTable" __or__ = __add__ def __and__(s,o): oc = o.__class__ if oc is kjDict or oc is kjSet: result = oc() result.dirty = s.dirty or o.dirty rdict = result.dict odict = o.dict sdict = s.dict stest = sdict.has_key for k in odict.keys(): v = odict[k] if stest(k) and sdict[k]==v: rdict[k] = v return result elif oc is kjGraph: return kjGraph.__and__(o,s) def __sub__(s,o): oc = o.__class__ result = kjDict() result.dirty = s.dirty or o.dirty sdict = s.dict rdict = result.dict if oc is kjDict: odict = o.dict otest = odict.has_key for k in sdict.keys(): v = sdict[k] if otest(k): if odict[k]!=v: rdict[k] = v else: rdict[k] = v return result if oc is kjGraph: oktl = o.key_to_list otest = oktl.has_key for k in sdict.keys(): v = sdict[k] if otest(k): if v not in oktl[k]: rdict[k] = v else: rdict[k] = v return result raise ValueError, "kjDict only diffs with kjGraph, kjDict" def __mul__(s,o): oc = o.__class__ sdict = s.dict if oc is kjDict or oc is kjSet: result = kjDict() result.dirty = s.dirty or o.dirty rdict = result.dict odict = o.dict otest = odict.has_key for k in sdict.keys(): kv = sdict[k] if otest(kv): rdict[k] = odict[kv] return result elif oc is kjGraph: return kjGraph(s) * o else: raise ValueError, "kjDict only composes with kjTable" def member(self, k, v): d = self.dict try: return d[k] == v except: return 0 _member = member def delete_arc(self, k, v): if self.dict[k] == v: del self.dict[k] else: raise KeyError, "pair not in table" def has_key(self, k): return self.dict.has_key(k) def neighbors(self, k): try: return [ self.dict[k] ] except: return [] def reachable(self, k): result = {} d = self.dict try: while 1: next = d[k] if result.has_key(next): break result[next] = 1 k = next except KeyError: pass return kjSet(result.keys()) def __invert__(self): result = kjDict() dr = result.dict drtest = dr.has_key ds = self.dict for (a,b) in ds.items(): if drtest(b): result.dirty=1 dr[b]=a result.dirty = self.dirty or result.dirty return result def __nonzero__(self): if self.dict: return 1 return 0 def subset(s, o): oc = o.__class__ sdict = s.dict if oc is kjDict or oc is kjSet: odict = o.dict otest = odict.has_key for k in sdict.keys(): v = sdict[k] if otest(k): if odict[k]!=v: return 0 else: return 0 elif oc is kjGraph: oktl = o.key_to_list otest = oktl.has_key for k in sdict.keys(): v = sdict[k] if otest(k): if v not in oktl[k]: return 0 else: return 0 else: raise ValueError, "kjDict subset test only for kjTable" return 1 def add(s, k, v): if s.hashed is not None: raise ValueError, "table has been hashed, immutable" sdict = s.dict if sdict.has_key(k): if sdict[k]!=v: s.dirty = 1 sdict[k] = v class kjSet(kjDict): def __init__(self, *args): #print "kjSet.__init__", args # usual cases first dict = self.dict = {} self.hashed = None self.dirty = 0 largs = len(args) if largs<1: return if largs>1: raise ValueError, "at most one argument supported" from types import IntType, TupleType, ListType arg0 = args[0] targ0 = type(arg0) if targ0 is IntType: return if targ0 is TupleType or targ0 is ListType: for x in arg0: dict[x] = x return argc = arg0.__class__ if argc is kjDict or argc is kjSet: stuff = arg0.dict.keys() elif argc is kjGraph: stuff = arg0.key_to_list.keys() else: raise ValueError, "kjSet from kjTable, int, list, tuple only" for x in stuff: dict[x] = x def __add__(s,o): oc = o.__class__ if oc is kjSet: result = kjSet() result.dirty = s.dirty or o.dirty rdict = result.dict for x in s.dict.keys(): rdict[x]=x for x in o.dict.keys(): rdict[x]=x return result elif oc is kjDict: return kjDict.__add__(o,s) elif oc is kjGraph: return kjGraph.__add__(o,s) __or__ = __add__ def __sub__(s,o): if o.__class__ is kjSet: result = kjSet() result.dirty = s.dirty or o.dirty rdict = result.dict otest = o.dict.has_key for x in s.dict.keys(): if not otest(x): rdict[x] = x return result else: return kjDict.__sub__(s,o) def __and__(s,o): oc = o.__class__ if oc is kjSet or oc is kjDict: result = kjSet() result.dirty = s.dirty or o.dirty rdict = result.dict odict = o.dict otest = odict.has_key for x in s.dict.keys(): if otest(x) and odict[x]==x: rdict[x] = x return result elif oc is kjGraph: return kjGraph.__and__(o,s) raise ValueError, "kjSet only intersects with kjTable" # illegal methods values = keys = remap = None def __repr__(self): return "kjSet(%s)" % self.items() def _setelts(self, items): #print "kjSet.setelts", items try: items = items._pairs() except: items = list(items) for i in xrange(len(items)): items[i] = (items[i], items[i]) self._setitems(items) else: items = list(items) for i in xrange(len(items)): items[i] = (items[i][0], items[i][0]) self._setitems(items) # hack! #D = self.dict #for x in D.keys(): # D[x] = x def _pairs(self, justtot=0): if justtot: return kjDict._pairs(self, justtot=1) pairs = kjDict.keys(self) for i in xrange(len(pairs)): pairs[i] = (pairs[i], pairs[i]) return pairs member = kjDict.has_key items = kjDict.keys #def neighbors(self, x): # raise ValueError, "operation on kjSet undefined" #reachable = neighbors def __getitem__(self, item): test = self.dict.has_key(item) if test: return 1 raise KeyError, "item not in set" def __setitem__(self, item, ignore): d = self.dict if self.hashed: raise ValueError, "table hashed, immutable" d[item] = item def add(self, elt): if self.hashed: raise ValueError, "table hashed, immutable" self.dict[elt] = elt def __mul__(s,o): oc = o.__class__ if oc is kjSet: return s.__and__(o) else: return kjDict.__mul__(s, o) def more_general(t1, t2): try: raise t1 except kjSet: try: raise t2 except (kjGraph, kjDict, kjSet): return t2.__class__ except kjDict: try: raise t2 except kjSet: return t1.__class__ except (kjDict, kjGraph): return t2.__class__ except kjGraph: return t1.__class__ except: raise ValueError, "cannot coerce, not kjtable" def less_general(t1,t2): try: raise t1 except kjSet: return t1.__class__ except kjDict: try: raise t2 except kjSet: return t2.__class__ except (kjDict, kjGraph): return t1.__class__ except kjGraph: return t2.__class__ except: raise ValueError, "cannot coerce, not kjtable" def kjUndump(t1, t2): result = kjDict() rdict = result.dict lt1 = len(t1) if lt1 == 1: rdict[t1[0]] = t2 else: # tightly bound to implementation for i in xrange(lt1): rdict[t1[i]] = t2[i] return result def test(): global S, D, G G = kjGraph() r3 = range(3) r = map(None, r3, r3) for i in range(3): G[i] = i+1 D = kjDict(G) D[9]=0 G[0]=10 S = kjSet(G) S[-1] = 5 print "%s.remap(%s) = %s" % (D, G, D.remap(G)) print "init test" for X in (S, D, G, r, tuple(r), 1): print "ARG", X for C in (kjGraph, kjSet, kjDict): print "AS", C T = C(X) T2 = C() print X, T, T2 ALL = (S, D, G) for X in ALL: print "X=", X print "key", X.choose_key() print "len", len(X) print "items", X.items() print X, "Clean before", X.Clean() del X[2] print X, "Clean after", X.Clean() if not X.subset(X): raise "trivial subset fails", X if not X==X: raise "trivial cmp fails", X if not X: raise "nonzero fails", X if X is S: if not S.member(0): raise "huh 1?" if S.member(123): raise "huh 2?", S S.add(999) del S[1] if not S.has_key(999): raise "huh 3?", S else: print "values", X.values() print "keys", X.keys() print X, "inverted", ~X if not X.member(0,1): raise "member test fails (0,1)", X print "adding to", X X.add(999,888) print "added", X X.delete_arc(999,888) print "deleted", X if X.member(999,888): raise "member test fails (999,888)", X if X.has_key(999): raise "has_key fails 999", X if not X.has_key(0): raise "has_key fails 0", X for Y in ALL: print "Y", Y if (X!=S and Y!=S): print "diff", X, Y print "%s-%s=%s" % (X,Y,X-Y) elif X==S: D = kjSet(Y) print "diff", X, D print "%s-%s=%s" % (X,D,X-D) print "%s+%s=%s" % (X,Y,X+Y) print "%s&%s=%s" % (X,Y,X&Y) print "%s*%s=%s" % (X,Y,X*Y) x,y = cmp(X,Y), cmp(Y,X) if x!=-y: raise "bad cmp!", (X, Y) print "cmp(X,Y), -cmp(Y,X)", x,-y print "X.subset(Y)", X.subset(Y) Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/kjpylint.py100644 1007 1403 36370 6747630574 25502 0ustar petrillipetrilli#!/usr/local/bin/python """python lint using kwParsing The goal of this module/filter is to help find programming errors in python source files. As a filter use thusly: % python kjpylint.py source_file.py As an internal tool use like this: import kjpylint (pyg, context) = kjpylint.setup() kjpylint.lint(data, pyg, context) where data is the text of a python program. You can build your own context structure by subclassing GlobalContext, and redefining GlobalContext.complain(string) for example. You could do a lot more than that too... Also, to lint all *.py files recursively contained in a directory hierarchy use kjpylint.lintdir("/usr/local/lib/python") # for example FEATURES: Lint expects 1) a newline or two at the end of the data; 2) consistent indenting (and inconsistency may be invisible) [eg " \t" and "\t" are not the same indent to Lint, but Python sees them the same.] If (1) or (2) are not satisfied Lint will raise an exception. Buglets: lambdas and for loops on one line generate extraneous warnings. Notes: ====== The lint process works, in outline, like this. Scan over a python program x = 1 def f(a): a = x d.x, y = b z = w and build annotations like [ set("x", 1), [ get("x", 4) set("a", 4) get("b", 5) get("d", 5) set("y", 5) pop_local() ] get("w", 7) set("z", 7) ] from this stream conclude warning on line 5: b used before set warning on line 5: d used before set warning on line 5: y set, never used etc. using simple one pass approximate flow analysis. """ pyg = context = None #import pygram from pygram import newlineresult # reduction rules: # only need to consider # expressions, assignments, def, class, global, import, from, for # # expressions return a list of unqualified names, not known set # qualified names are automatically put in context as refs # # assignments set left names, ref right names # # def sets new name for function and args, # refs other names # # class adds new name for class # refs other names # # global forces global interpretation for name # # import adds FIRST names # from sets names # for sets names # # related rules # ASSIGNMENT REQUIRES SPECIAL TREATMENT #@R assn1 :: assn >> testlist = testlist def assn1(list, context): [t1, e, t2] = list return assn(t1, t2) #@R assnn :: assn >> testlist = assn def assnn(list, context): [t1, e, a1] = list return assn(t1, a1) # @R assn1c :: assn >> testlist , = testlist def assn1c(list, context): [t1, c, e, t2] = list return assn(t1, t2) # @R assn1c2 :: assn >> testlist , = testlist , def assn1c2(list, context): del list[-1] return assn1c(list, context) # @R assnnc :: assn >> testlist , = assn def assnnc(list, context): return assn1c(list, context) def assn(left, right): result = right for x in left: (ln, ri, op, name) = x if op == "ref": result.append( (ln, ri, "set", name) ) else: result.append(x) return result #@R except2 :: except_clause >> except test , test def except2(list, context): [e, t1, c, t2] = list result = t1 for (ln, ri, op, name) in t2: result.append( (ln, ri, "set", name) ) return result #@R smassn :: small_stmt >> assn # ignored #@R rfrom :: import_stmt >> from dotted_name import name_list #@R rfromc :: import_stmt >> from dotted_name import name_list , def rfrom(list, context): #print rfrom, list [f, d, i, n] = list # ignore d return n def rfromc(list, context): return rfrom(list[:-1]) def mark(kind, thing, context): L = context.LexD lineno = L.lineno # are we reducing on a newline? if L.lastresult==newlineresult: lineno = lineno-1 return (lineno, -L.realindex, kind, thing) #@R dn1 :: dotted_name >> NAME def dn1(list, context): #print "dn1", list #L = context.LexD return [ mark("set", list[0], context) ] #return [ (L.lineno, -L.realindex, "set", list[0]) ] # handles import case, make name set local #@R nlistn :: name_list >> name_list , NAME def nlistn(list, context): #print "nlistn", list [nl, c, n] = list #L = context.LexD #nl.append( (L.lineno, -L.realindex, "set", n) ) nl.append( mark("set", n, context) ) return nl #@R nlist1 :: name_list >> NAME def nlist1(list, context): #print "nlist1", list #L = context.LexD #return [ (L.lineno, -L.realindex, "set", list[0]) ] return [ mark("set", list[0], context) ] # ignore lhs in calls with keywords. #@R namearg :: argument >> test = test def namearg(list, context): [t1, e, t2] = list return t2 # handles from case, make names set local #@R global1 :: global_stmt >> global NAME def global1(list, context): #print "global1", list #L = context.LexD #return [ (L.lineno, -L.realindex, "global", list[1]) ] return [ mark("global", list[1], context) ] #@R globaln :: global_stmt >> global_stmt , NAME # handles global, make names global (not set or reffed) def globaln(list, context): #print "globaln", list [g, c, n] = list #L = context.LexD #g.append( (L.lineno, -L.realindex, "global", n) ) g.append( mark("global", n, context) ) return g #@R for1 :: for_stmt >> #for exprlist in testlist : # suite def for1(list, context): #print "for1", list [f, e, i, t, c, s] = list refs = t + s return assn(e, refs) #@R for2 :: for_stmt >> #for exprlist in testlist : # suite #else : # suite def for2(list,context): #print "for2", list [f, e, i, t, c1, s1, el, c2, s2] = list refs = t + s1 + s2 return assn(e, refs) ### #@R class1 :: classdef >> class NAME : suite def class1(list, context): [c, n, cl, s] = list return Class(n, [], s, context) #@R class2 :: classdef >> class NAME ( testlist ) : suite def class2(list, context): [c, n, opn, t, cls, cl, s] = list return Class(n, t, s, context) def Class(name, testlist, suite, context): globals = analyse_scope(name, suite, context, unused_ok=1) context.defer_globals(globals) result = testlist L = context.LexD # try to correct lineno lineno = L.lineno realindex = L.realindex for (ln, ri, op, n) in testlist+suite: lineno = min(lineno, ln) result.append((lineno, -realindex, "set", name)) #result.append( mark("set", name, context) ) # supress complaints about unreffed classes result.append((lineno+1, -realindex, "qref", name)) #result.append( mark("qref", name, context) ) return result # vararsglist requires special treatment. # return (innerscope, outerscope) pair of lists # @R params1 :: parameters >> ( varargslist ) def params1(l, c): return l[1] params1c = params1 #@R params2 :: varargslist >> def params2(l, c): return ([], []) #@R params3 :: varargslist >> arg def params3(l, c): return l[0] #@R params4 :: varargslist >> varargslist , arg def params4(l, c): #print "params4", l [v, c, a] = l v[0][0:0] = a[0] v[1][0:0] = a[1] return v #@R argd :: arg >> NAME = test def argd(l, c): [n, e, t] = l #L = c.LexD #return ([(L.lineno, -L.realindex, "set", n)], t) return ([ mark("set", n, c) ], t) #@R arg2 :: arg >> fpdef def arg2(l, c): return l[0] #@R arg3 :: arg >> * NAME def arg3(l, c): del l[0] return fpdef1(l, c) #@R arg4 :: arg >> ** NAME def arg4(l, c): #del l[0] return arg3(l, c) #@R fpdef1 :: fpdef >> NAME def fpdef1(l, c): [n] = l #LexD = c.LexD return ([ mark("set", n, c) ], []) #@R fpdef2 :: fpdef >> ( fplist ) def fpdef2(l, c): return l[1] ## @R fpdef2c :: fpdef >> ( fplist , ) #fpdef2c = fpdef2 ##31 #@R fplist1 :: fplist >> fpdef def fplist1(l, c): #print l return l[0] #@R fplistn :: fplist >> fplist , fpdef fplistn = params4 #@R rdef :: funcdef >> def NAME parameters : suite def rdef(list, context): #print "rdef", list [ddef, name, parameters, c, suite] = list (l, g) = parameters globals = analyse_scope(name, l + suite, context) # for embedded function defs global internal refs must be deferred. context.defer_globals(globals) result = g L = context.LexD # try to steal a lineno from other declarations: lineno = L.lineno index = L.realindex for (ln, ri, op, n) in l+g+suite: lineno = min(lineno, ln) if name is not None: result.append((lineno, -index, "set", name)) # Note: this is to prevent complaints about unreffed functions result.append((lineno+1, -index, "qref", name)) return result #@R testlambda1 :: test >> lambda varargslist : test def testlambda1(list, context): [l, v, c, t] = list return rdef(["def", None, v, ":", t], context) def analyse_scope(sname, var_accesses, context, unused_ok=0): var_accesses.sort() result = [] globals = {} locals = {} # scan for globals for x in var_accesses: (ln, ri, op, name) = x if op == "global": globals[name] = ln #result.append(x) (ignore global sets in local context) # scan for locals for (ln, ri, op, name) in var_accesses: if op == "set" and not locals.has_key(name): if globals.has_key(name): context.complain( "Warning: set of global %s in local context %s" % (`name`, `sname`)) result.append( (ln, ri, op, name) ) pass # ignore global set in local context else: locals[name] = [ln, 0] # line assigned, #refs # scan for use before assign, etc. for x in var_accesses: (ln, ri, op, name) = x if locals.has_key(name): if op in ["ref", "qref"]: set = locals[name] set[1] = set[1] + 1 assnln = set[0] if (ln <= assnln): context.complain( "(%s) local %s ref at %s before assign at %s" % ( sname, `name`, ln, `assnln`)) elif op not in ("global", "set"): # ignore global sets in local context. result.append(x) # scan for no use if not unused_ok: for (name, set) in locals.items(): [where, count] = set if count<1: context.complain( "(%s) %s defined before %s not used" % (sname, `name`, where)) return result ### note, need to make special case for qualified names #@R powera :: power >> atom trailerlist def powera(list, context): #print "powera", list [a, (t, full)] = list if a and full: # atom is a qualified name (ln, ri, op, n) = a[0] result = [ (ln, ri, "qref", n) ] else: result = a result = result + t #print "returning", result return result #@R trailerlist0 :: trailerlist >> def trailerlist0(list, context): return ([], 0) # empty trailerlist #@R trailerlistn :: trailerlist >> trailer trailerlist def trailerlistn(list, context): #print "trailerlistn", list result = list[0] + list[1][0] for i in xrange(len(result)): (a, b, op, d) = result[i] result[i] = (a, b, "qref", d) return (result, 1) # make name+parameters set local reduce suite... def default_reduction(list, context): # append all lists from types import ListType #print "defred", list #return result = [] for x in list: if type(x)==ListType: if result == []: if len(x)>0 and type(x[0])==ListType: raise "oops", x result = x else: for y in x: result.append(y) return result def aname(list, context): #print "aname", list, context L = context.LexD # note -L.realindex makes rhs of assignment seem before lhs in sort. return [ (L.lineno, -L.realindex, "ref", list[0]) ] # the highest level reduction! # all1 :: all >> file_input DEDENT def all1(list, context): stuff = list[0] context.when_done(stuff) # first test def BindRules(pyg): for name in pyg.RuleNameToIndex.keys(): pyg.Bind(name, default_reduction) pyg.Bind("all1", all1) pyg.Bind("testlambda1", testlambda1) pyg.Bind("except2", except2) pyg.Bind("namearg", namearg) pyg.Bind("rfrom", rfrom) pyg.Bind("rfromc", rfromc) pyg.Bind("class1", class1) pyg.Bind("class2", class2) pyg.Bind("aname", aname) pyg.Bind("assn1", assn1) pyg.Bind("assnn", assnn) pyg.Bind("assn1c", assn1c) pyg.Bind("assn1c2", assn1c2) pyg.Bind("assnnc", assnnc) pyg.Bind("dn1", dn1) pyg.Bind("nlistn", nlistn) pyg.Bind("nlist1", nlist1) pyg.Bind("global1", global1) pyg.Bind("globaln", globaln) pyg.Bind("for1", for1) pyg.Bind("for2", for2) pyg.Bind("powera", powera) pyg.Bind("trailerlist0", trailerlist0) pyg.Bind("trailerlistn", trailerlistn) pyg.Bind("params1", params1) pyg.Bind("params1c", params1c) pyg.Bind("params2", params2) pyg.Bind("params3", params3) pyg.Bind("params4", params4) pyg.Bind("argd", argd) pyg.Bind("arg2", arg2) pyg.Bind("arg3", arg3) pyg.Bind("arg4", arg4) pyg.Bind("fpdef1", fpdef1) pyg.Bind("fpdef2", fpdef2) # pyg.Bind("fpdef2c", fpdef2c) pyg.Bind("fplist1" , fplist1 ) pyg.Bind("fplistn" , fplistn) pyg.Bind("rdef" , rdef) # pyg.Bind( , ) class globalContext: def __init__(self, lexd): self.deferred = [] self.LexD = lexd def complain(self, str): print str def defer_globals(self, globals): self.deferred[0:0] = globals def when_done(self, list): stuff = list + self.deferred + self.patch_globals() globals = analyse_scope("", stuff, self) seen = {} for (ln, ri, op, name) in globals: if not seen.has_key(name) and op!="set": seen[name] = name self.complain( "%s: (%s) %s not defined in module?" % (ln, op, `name`)) self.deferred = [] # reset state. def patch_globals(self): # patch in global names import __builtin__ names = dir(__builtin__) list = names[:] list2 = names[:] for i in xrange(len(list)): list[i] = (-2, -900, "set", names[i]) list2[i] = (-1, -900, "qref", names[i]) return list + list2 teststring = """ class x(y,z): ''' a doc string blah ''' def test(this, that): w = that+this+x, n x = 1 return w """ def go(): import sys try: file = sys.argv[1] except IndexError: print "required input file missing, defaulting to test string" data = teststring else: data = open(file).read() print "setup" (pyg, context) = setup() print "now parsing" lint(data, pyg, context) def setup(): global pyg, context import pygram pyg = pygram.unMarshalpygram() BindRules(pyg) context = globalContext(pyg.LexD) return (pyg, context) def lint(data, pygin=None, contextin=None): if pygin is None: pygin = pyg if contextin is None: contextin = context pygin.DoParse1(data, contextin) def lintdir(directory_name): """lint all files recursively in directory""" from find import find print "\n\nrecursively linting %s\n\n" % directory_name (pyg, context) = setup() python_files = find("*.py", directory_name) for x in python_files: print "\n\n [ %s ]\n\n" % x lint( open(x).read(), pyg, context ) print "\014" if __name__=="__main__": go() Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/kwParsing.html100644 1007 1403 125403 6747630574 26133 0ustar petrillipetrilli A parser generator in Python

    A parser generator in Python: kwParsing

    Aaron Watters
    This is the documentation for the kjParsing package, an experimental parser generator implemented in Python which generates parsers implemented in Python. It won't serve as a complete reference on programming language syntax and interpretation, but it will review terminology for the knowledgable and I hope it will pique the interest of the less experienced.

    Introduction

    The kjParsing package is a parser generator written in Python which generates parsers for use in Python.

    These modules and their documentation and demo files may be of use for classes on parsing, compiling, or formal languages, and may also be helpful to people who like to create experimental interpreters or translators or compilers.

    The package consists of three Python modules: kjParser, kjParseBuild, and kjSet. Together these modules are called the kjParsing package. The package also includes some documentation and demo files and a COPYRIGHT file which explains the conditions for copying and propagating this code and the fact that the author assumes no responsibility for any difficulties resulting from the use of this package by anyone (including himself).

    What a Parser Does

    Parsers can be part of a lot of different things: compilers, interpreters, translators, or code generators, among others. Nevertheless, at an abstract level parsers all translate expressions of a language into computational actions.

    Parsers generated by the kjParseBuild module may do three different sorts of actions:

    Value Computation
    The parser may build a data structure as the result of the expression. For example the silly LispG grammar from the file ``DLispShort.py'' can construct integers, strings and lists from string representations. 
    >>> from DLispShort import LispG, Context
>>> LispG.DoParse1( ' ("list with string and int" 23) ', Context)
['list with string and int', 23]
>>>
    Environment Modification
    The parser may modify the context of the computation. For example the LispG grammar allows the assignment of values to internal variable names. 
    >>> LispG.DoParse1( '(setq Variable (4 5 9))', Context)
[4, 5, 9]
>>> Context['Variable']
[4, 5, 9]
>>>
    (Here the second result indicates that the string 'Variable' has been associated with the value [4,5,9] in the Context structure, which in this case is a simple python dictionary.)
    External Side Effects
    The parser may also perform external actions. For example the LispG grammar has the ability to print values to the terminal. 
    >>> LispG.DoParse1( '( (print Variable) (print "bye bye")  )', Context )
[4, 5, 9]
bye bye
[[4, 5, 9], 'bye bye']
>>>
    (Here the first two lines are the results of printing and the last is the value of the expression.)
    More realistic parsers will perform more interesting actions, of course.

    To implement a parser using kjParseBuild you must define the grammar to parse and associate each rule and terminal of the grammar with an action which defines the computational meaning of each language construct.

    The grammar generation process consists of two phases

    Generation
    During this phase you must define the syntax of the language and function bindings that define the semantics of the language. When you've debugged the syntax and semantics you can dump the grammar object representing the syntax only to a grammar file which can be reloaded without re-analyzing the language syntax. For large grammars each regeneration may require significant time and computational resources.
    Use
    During this phase you may load the grammar file without re-analyzing the grammar on each use. However, the semantics functions must still be rebound on each load. The reloaded grammar object augmented with interpretation functions may be used to parse strings of the language.
    Note that the functions that define the semantics of the language are must be bound in both phases. 

               # from file DLispShort.py (with small differences)
     ( 1)  def GrammarBuild():
     ( 2)      import kjParseBuild
     ( 3)      LispG = kjParseBuild.NullCGrammar()
     ( 4)      LispG.SetCaseSensitivity(0) 
     ( 5)      DeclareTerminals(LispG)
     ( 6)      LispG.Keywords("setq print")
     ( 7)      LispG.punct("().")
     ( 8)      LispG.Nonterms("Value ListTail")
     ( 9)      LispG.comments([LISPCOMMENTREGEX])
     (10)      LispG.Declarerules(GRAMMARSTRING)
     (11)      LispG.Compile()
               print "dumping as binary to TESTLispG.mar"
     (12)      outfile = open("TESTLispG.mar", "w")
     (13)      LispG.MarshalDump(outfile)
     (14)      outfile.close()
     (15)      BindRules(LispG)
     (16)      return LispG
    A function for building simple grammar (GrammarBuild)

    Defining a Grammar

    A programming language grammar is conventionally divided into several components:
    Keywords
    These are special strings that ``highlight'' a language construct. Familiar keywords from Python and Pascal and C are ``if'', ``else'', and ``while''.
    Terminals
    These are special patterns of characters that indicate a value in the language. For example many programming languages will classify the string 123 as an instance of the integer nonterminal and the string snark (not contained in quotes) as an instance of the nonterminal identifier or variable. Terminals are usually restricted to very simple constructs like identifiers, numbers, and strings. More complex things (such as a ``date'' data type) might be better handled by nonterminals and rules.
    Nonterminals
    These are ``place holders'' for language constructs of the grammar. They represent parts of the grammar which sometimes expand to great size and complexity. For instance the C language grammar presented by Kernigan and Ritchie has a nonterminal translationUnit which represents a complete C language module, a nonterminal conditionalExpression which represents a truth valued expression of the language.
    Punctuations
    These are special characters or strings which are recognized as separate entities even if they aren't physically separated from other strings by white space. For example, most languages would ``see'' the string if0 as a single token (probably an identifier) even if if is a keyword, whereas if(0) would be recognized the same as if ( 0 ) because parentheses are normally considered punctuations. Except for the special treatment at recognition, punctuations are similar to keywords.
    The syntax of a language describes how to recognize the components of the language. To define a language syntax using kjParseBuild you must create a null compilable grammar object to contain the grammar (in Figure GrammarBuild this is done on line 3 using the class constructor kjParseBuild.NullCGrammar() creating the grammar object LispG) and define the components of the grammar and the rules for recognizing the components. The component definitions and rule declarations, as well as the specification of case sensitivity and comment patterns, are performed on lines 4 through 10 of Figure GrammarBuild for the LispG grammar.

    Declaring Case Sensitivity and Comments

    There are two nuances to parsing not yet mentioned: case sensitivity and comments.

    Some grammars are not case sensitive in recognizing keywords or identifiers. For example ANSI standard SQL (which is not case sensitive for keywords or identifiers) recognizes Select, select, SELECT, and SeLect all as the keyword SELECT. To specify the case sensitivity of the grammar for keywords only use 

         GRAMMAROBJECT.SetCaseSensitivity(TrueOrFalse)
    where TrueOrFalse is 0 for no case sensitivity or 1 for case sensitivity. This must be done before any keyword declarations for the grammar. All other syntax declarations may be done in any order before the compilation of the grammar object. In Figure GrammarBuild the LispG grammar object is declared to be case insensitive on line 4.

    Comments are patterns in the input string which are ignored (or more precisely interpreted as white space) by the language. To declare a sequence of regular expressions to be interpreted as a comment in a grammar use 

        GRAMMAROBJECT.comments(LIST_OF_COMMENT_REGULAR_EXPR_STRINGS)
    For example, line 9 or Figure GrammarBuild declares the constant string previously declared as 
        LISPCOMMENTREGEX = ";.*"
    to represent a comment of the grammar LispG. For the syntax of regular expression strings you must look elsewhere, but as a hint ";.*" represents any string commencing with a semicolon, followed by any sequence of characters up to, but not including, a newline.

    Declaring Keywords, Punctuations, and Terminals

    To declare keywords for your grammar use 
          GRAMMAROBJECT.Keywords( STRING )
    where STRING is a white space separated string of keywords. Line 6 of Figure GrammarBuild declares setq and print as keywords of LispG.

    To declare nonterminals for your grammar, similarly, use 

          GRAMMAROBJECT.Nonterms( STRING )
    where STRING is a white space separated string of nonterminal names. Line 8 of Figure GrammarBuild declares Value and ListTail as nonterminals of the LispG.

    Similarly, use 

          GRAMMAROBJECT.punct( STRING )
    to declare a sequence of punctuations for the grammar, except that in this case the string must not contain any white space. Line 7 of Figure GrammarBuild declares parentheses and dot to be punctuations of the LispG.

    If you have a lot of keywords, punctuations, or nonterminals you can make many separate calls to the appropriate declaration methods with different strings.

    These declarations will cause the grammar to recognize the declared keyword strings (when separated from other strings by white space or punctuations) and punctuations as special tokens of the grammar at the lowest level of parsing. The parsing process derives nonterminals of the grammar at a higher level as discussed below.

    A small difficulty with kjParseBuild is that the strings @R, ::, >>, and ## cannot be used as names of keywords for the grammar because they are used to specify rule syntax in the ``metagrammar''. If you need these in your grammar they may be implemented as ``trivial'' terminals. For example,

    Grammar.Addterm("poundpound", "##", echo)
    I'm unsure whether this patch is good enough. Does anyone have any advice for me? If this is a bad problem for some grammar the keywords of the meta grammar can be changed of course, but this is a hack.

    Declaring Terminals

            # from DLispShort.py
        def DeclareTerminals(Grammar):
   (1)      Grammar.Addterm("int", INTREGEX, intInterp)
   (2)      Grammar.Addterm("str", STRREGEX, stripQuotes)
   (3)      Grammar.Addterm("var", VARREGEX, echo)
    Defining the terminals of a grammar. (TermDef)

    Figure TermDef shows the declarations for installing the int, str, and var terminals in the grammar. This is given as a separate function because the declarations define both the syntax and semantics for the terminals, and therefore must be called both during grammar generation and after loading the generated grammar object. To declare a terminal for a grammar use 

          GRAMMAROBJECT.Addterm(NAMESTR, REGEXSTR, FUNCTION)
    This declaration associates both a regular expression string REGEXSTR and an interpretation function FUNCTION to the terminal of the grammar named by the string NAMESTR. The FUNCTION defines the semantics of the terminal as describe below and the REGEXSTR specifies a regular expression for recognizing the string. For example on line 2 of Figure TermDef the var terminal is associated with the regular expression string 
          STRREGEX = '"[^\n"]*"'
    which matches any string starting with double quotes and ending with double quotes which contains neither double quotes nor a newline.

    Declaring Rules of the Grammar

    # from DLispShort.py
GRAMMARSTRING ="""
       Value ::  ## indicates Value is the root nonterminal for the grammar
         @R SetqRule :: Value >> ( setq var Value )
         @R ListRule :: Value >> ( ListTail
         @R TailFull :: ListTail >> Value ListTail
         @R TailEmpty :: ListTail >> )
         @R Varrule :: Value >> var
         @R Intrule :: Value >> int
         @R Strrule :: Value >> str
         @R PrintRule :: Value >> ( print Value )
"""
    A grammar definition string.

    To declare the rules of a grammar use the simple rule definition language which comes with kjParseBuild, for example as shown in Figure GramStr. Line 10 of Figure GrammarBuild uses the string defined in Figure GramStr to associate the rules with the grammar using 

          GRAMMAROBJECT.DeclareRules(RULE_DEFINITION_STRING)
    This declaration does not analyse the string; analysis and syntax/semantics errors are reported by *.Compile() described below.

    The rule definition language allows you to identify the root nonterminal of your grammar and specify a sequence of named derivation rules for the grammar. It also allows comments which start with ## and end with a newline. An acceptible string for the rule definition language looks like

    RootNonterminalName :: NamedRule1 NamedRule2 ...
    Here the Root nonterminal name should be the nonterminal that ``stands for'' any complete string of the language. Furthermore, each named rule looks like
    @R NameString :: GoalNonterm >> RuleBody
    where the name string for the rule is a string without whitespace, the goal nonterminal is the nonterminal that the rule derives, and the rule body is a sequence of keywords, punctuations and nonterminals separated by white space. Rule names are used for mapping rules to semantic interpretations and should be unique.

    Note that punctuations for the grammar you are defining are not punctuations for the rule definition language (which has none), so they must be separated from other tokens by white space. The keyword for the rule definition language @R, ::, >> must also be separated from other tokens by whitespace in the rule definition string. Furthermore, all punctuations, keywords, nonterminals, and terminals used in the rules must be declared for the grammar before the grammar is compiled (if one isn't the compilation will fail with an error).

    As a bit of sugar you may break up the declarations of rules. 

        LispG.DeclareRules("Value::\n")
    LispG.DeclareRules("  @R SetqRule :: Value >> ( setq var Value )\n")
    LispG.DeclareRules("  @R ListRule :: Value >> ( ListTail\n")
    ...
    This might be useful for larger grammars.

    A Brief Discussion of Derivations

    The rules for a grammar don't really describe how to parse a string of the language, they actually describe how to derive a string of the grammar. For this reason it is possible to create a grammar which derives the same string in two different ways; such grammars are termed ambiguous. If you try to generate a parser for an ambiguous grammar the parse generation process will cause the parser generation process to complain.

    For a more precise definition of the derivation of a language string from a grammar see the ``further readings'' below. For illustrative purposes, and to help explain how to define semantics functions, consider the following derivation of the string

    ( 123 ( setq x "this" ) )
    using the rules declared in Figure GramStr.
    Derivation Rule used
    Value1 >> ( ListTail1 ListRule
    ListTail1 >> Value2 ListTail2 TailFull
    Value2 >> [int = 123] Intrule
    ListTail2 >> Value3 ListTail3 TailFull
    Value3 >> (setq [var='x'] Value4) SetqRule
    Value4 >> [string='this'] StrRule
    ListTail3 >> ) TailEmpty
    To obtain the string derived we simply substitute the representations derived for each of the numbered nonterminals and terminals of the derivation as shown in Figure Derive. 
    (1)    Value1 
(2)    ( ListTail1                        (ListRule)
(3)    ( Value2 ListTail2                 (TailFull)
(4)    ( 123 ListTail2                    (Intrule)
(5)    ( 123 Value3 ListTail3             (TailFull)
(6)    ( 123 ( setq x Value4 ) ListTail3  (SetqRule)
(7)    ( 123 ( setq x "this" ) ListTail3  (StrRule)
(8)    ( 123 ( setq x "this" ) )          (TailEmpty)
    Right-to-left derivation steps for (123 (setq x "this")). (Derive)

    Compiling the Grammar Syntax, and Storing the Compilation

    Once you have defined all the keywords, comments, terminals, nonterminals, punctuations, and rules of your grammer you may create the datastructures needed for parsing by compiling the grammar using 
          GRAMMAROBJECT.Compile()
    Line 11 of Figure GrammarBuild performs the compilation for the LispG grammar.

    If the compilation succeeds you may use 

          GRAMMAROBJECT.MarshalDump( OUTPUTFILE )
    to store the compiled grammar structure to a file that may be later loaded without recompiling the grammar. Here MarshalDump will create a binary ``marshalled'' representation for the grammar in the OUTPUTFILE. For example line 13 of figure GrammarBuild marshalls a representation for LispG to the file TESTLispG.mar. TESTLisp.GRAMMAR() will then reconstruct the internal structure of LispG as a grammar object and return the grammar object as the result of the function.

    Nevertheless, compilation of the grammar by itself does not yeild a grammar that will do any useful parsing [Actually, it will do ``parsing'' using default actions (implemented as a function which simply return the list argument).] Rules must be associated with computational actions before useful parsing can be done.

    Defining a Semantics

    Two sorts of objects require semantic actions that define their meaning: rules and terminals. All semantic actions must be defined as Python functions and bound in the grammar before parsing can be performed.

    Before you can define the semantics of your language in Python you better have a pretty good idea of what the components of the language are supposed to represent, of course. Using your intuitive understanding of the language you can:

    Decide what the context of the computation should be and how it should be implemented as a Python structure. If the process of Parsing must modify the context, then then the context structure must be a ``mutable'' python structure. In the case of LispG the context is simply a structure that maps ``internal'' variable names to values, implemented as a simple Python dictionary mapping name strings to the appropriate value.
    Decide what kind of Python value each terminal of the grammar represents. In the case of LispG
    str
    should represent a string value corresponding to the string recognized (minus the surrounding quotes).
    int
    should represent an integer value corresponding to the string recognized.
    var
    should represent the string representing the variable name recognized (the name must be translated to a corresponding value at a higher level since the terminal interpretation functions don't have access to the context structure).
    Decide what kind of Python structure or value each nonterminal represents. In the case of the LispG grammar:
    Value
    represents a Python integer, string, or list.
    ListTail
    represents a Python list containing the members of the tail of a list.
    Decide how each rule should derive a structure corresponding to the Goal (left hand side) of the rule based on the values corresponding to the terminals and nonterminals on the right hand side of the rule. In the case of the LispG grammar (refer to Figure GramStr for rule definitions):
    SetqRule
    should return whatever the Value terminal in the body represents.
    ListRule
    should return the list represented by the ListTail nonterminal of the body.
    TailFull
    should return the result of adding the value corresponding to the Value nonterminal of the list to the front of the list corresponding to the Listtail nonterminal of the body.
    Varrule
    should return the value from the computational context that corresponds to the variable name represented by the var terminal of the body.
    Intrule
    should return the integer corresponding to the int terminal of the body.
    Strrule
    should return the string corresponding to the str terminal of the body.
    PrintRule
    should return the value represented by the Value nonterminal of the body.
    Decide what side effects, if any, each rule should have on the computational context or externally. In the case of the LispG grammar:
    SetqRule
    should associate the variable name represented by var to the value represented by Value in the body.
    PrintRule
    should print the value corresponding to the Value nonterminal to the screen.
    The other rules of LispG should have no internal or external side effects.
    More complex languages may require much more complex contexts, values and side effects, including function definitions, modules, database table accesses, user authorization verifications, and/or file creation, among other possibilities.

    Having determined the intuitive semantics of the language you may now specify implement the semantic functions and bind them in your grammar.

    Semantics for Terminals

    To define the meaning of a terminal you must create a Python function that translates a string (which the parser has recognized as an instance of the terminal) into an appropriate value. For instance, when the LispG grammar recognizes a string 

          "this is a string"
    the interpretation function should translate the recognized string into the Python string it represents: namely, the same string but with the double quotes stripped off. The following ``string intepretation function'' will perform this simple interpretation. 
            # from DLispShort.py
        def stripQuotes( str ):
            return str[1:len(str)-1]
    Similarly, when the parser recognizes a string as an integer, the associated interpretation function should translate the string into a Python integer.

    The binding of interpretation functions to terminal names is performed by the Addterm method previously mentioned. For example, line 2 of Figure TermDef associates the stripQuotes function to the nonterminal named str.

    All functions passed to Addterm should take a single string argument which represents the recognized string, and return a value which represents the semantic interpretation for the input string.

    Semantics for Rules

    The semantics of rules is more interesting since they may have side effects and require the kind of recursive thinking that gives most people headaches. The semantics for rules are specified by functions. To perform the semantic action associated with a rule, the ``reduction function'' should perform any side effects (to the computational context or externally) and return a result value that represents the interpretation for the nonterminal at the head of the rule. 

          # from DLispShort.py
      def EchoValue( list, Context ):
          return list[0]
      
      def VarValue( list, Context ):
          varName = list[0]
          if Context.has_key(varName):
             return Context[varName]
          else:
             raise NameError, "no such lisp variable in context "+varName
      
      def NilTail( list, Context ):
          return []
      
      def AddToList( list, Context ):
          return [ list[0] ] + list[1]
      
      def MakeList( list, Context ):
          return list[1]
      
      def DoSetq( list, Context):
          Context[ list[2] ] = list[3]
          return list[3]
      
      def DoPrint( list, Context ):
          print list[2]
          return list[2]
    The reduction functions for the rules. (RedFun) 
            # from DLispShort.py
        def BindRules(LispG):
            LispG.Bind( "Intrule", EchoValue )
            LispG.Bind( "Strrule", EchoValue )
            LispG.Bind( "Varrule", VarValue )
            LispG.Bind( "TailEmpty", NilTail )
            LispG.Bind( "TailFull", AddToList )
            LispG.Bind( "ListRule", MakeList )
            LispG.Bind( "SetqRule", DoSetq )
            LispG.Bind( "PrintRule", DoPrint )
    Binding named rules to interpretation functions. (ruleBind)
    The Python functions that define the semantics of the rules of LispG appear in Figure RedFun and the declarations that bind the rule names to the functions in the grammar object LispG appear in Figure ruleBind.

    Each ``reduction function'' for a rule must take two arguments: a list representing the body of the rule and a context structure which represents the computational context of the computation. The list argument will have the same length as the body of the rule, counting the keywords and punctuations as well as the terminals and nonterminals.

    For example the SetqRule has a body with five tokens, 

          @R SetqRule :: Value >> ( setq var Value )
    so the DoSetq function should expect the parser to deliver a Python list argument with five elements of form 
          list = [ '(', 'SETQ', VARIABLE_NAME, VALUE_RESULT, ')' ]
    note that the ``names'' of keywords and punctuations appear in the appropriate positions (0, 1, and 4) of the list corresponding to their positions in SetqRule. Furthermore, the position occupied by the terminal var in SetqRule has been replaced by a string representing a variable name in the list and the position occupied by the nonterminal Value in SetqRule has been replaced by a Python value.

    More generally, the parser will call reduction functions for rules with a list representing the ``interpreted body of the rule'' where

    keywords and punctuations
    are interpreted as themselves (i.e., their names), except that letters will be in upper case if the grammar is not case sensitive;
    terminals
    are interpreted as values previously returned by a call to the appropriate terminal interpretation function; and
    nonterminals
    are interpreted as values previously returned by a reduction function for a rule that derived this terminal.
    Although, the occurrence of the keyword names in the list may seem useless, it may have its purposes. For example, a careful programmer might check them during debugging to make sure the right function was bound to the right rule.

    To determine how to implement the semantics of a rule you must refer to the semantic decisions you made earlier. For example, above we specified that the setq construct should bind the variable name recieved ( list[2]) to the value ( list[3]) in the Context, and return the value ( list[3]) as the result of the expression. Translated into the more concise language of Python this is exactly what DoSetq shown in Figure RedFun does.

    To bind a rule name to a (previously declared) reduction function use 

          GRAMMAROBJECT.Bind( RULENAME, FUNCTION )
    where RULENAME is the string name for the rule previously declared for the grammar GRAMMAROBJECT and FUNCTION is the appropriate reduction function for the rule. These bindings for LispG are shown in Figure ruleBind.

    A Bit on the Parsing Process

    The following is not a precise definition of the actions of a Parser, but it may help you understand how the parsing process works and the order in which rules are recognized and functions are evaluated.

    Tokens seen S input remaining rule R and function call
    0 (123 (setq x "this"))
    1 ( 123 (setq x "this")) Intrule
    Value2 = EchoValue([123],C))
    2 ( Value2 ( setq x "this" )) StrRule
    Value4 = EchoValue(['this'],C)
    3 ( Value2 ( setq x Value4 ) ) SetqRule
    Value3 = DoSetq(['(','SETQ','x',Value4,')'],C)
    4 ( Value2 Value3 ) TailEmpty
    ListTail3 = NilTail([')'],C)
    5 ( Value2 Value3 ListTail3 TailFull
    ListTail2 = AddToList([Value3,ListTail3],C)
    6 ( Value2 ListTail2 TailFull
    ListTail3 = AddToList([Value2,ListTail2],C)
    7 ( ListTail3 ListRule
    Value1 = MakeList(['(',Value1],C)
    8 Value1
    Parsing (123 (setq x "this")) (Parse)
    Technically, each entry of S is tagged with the kind of token it represents (keyword, nonterminal, or terminal) and the name of the token it represents (e.g., Value, str) as well as the values shown.

    Figure Parse illustrates the sequence of reduction actions performed by LispG when parsing the input string (123 (setq x "this")). We can think of this parse as ``reversing'' the derivation process shown in Figure Derive using the rule reduction functions to obtain semantic interpretations for the nonterminals.

    At the lowest level of parsing a lexical analyser examines the unread portion of the input string tries to match a prefix of the input string with a keyword or a regular expression for a terminal (ignoring comments and whitespace, except as separators). The analyser ``passes'' the recognized token to the higher level parser together with its interpreted value. The interpreted value of a terminal is determined by using the appropriate interpretation function and the interpreted value of a keyword is simply its name (in upper case, if the grammer is not case sensitive). For example the LispG lexical analyser recognizes '(' as a keyword with the value '(' and "this" as an instance of the nonterminal str with the value 'this'.

    The higher level parser accepts tokens T from the lexical analyser and does one of two things with them

    If the most recent token values V the parser has saved on its ``tokens seen'' stack S ``looks like'' the body B of a rule R and the current token is a token that could follow the nonterminal N at the head of R, then the parser evaluates the reduction function F associated with R, using the values V from the stack S that match the body B together with the computational context C. The resulting value F(V,C) replaces the values V
    Otherwise the current token is shifted onto the ``tokens seen'' stack S and the parser moves on to the next token.
    The above is a lie. Actually, the parsing process is much smarter than this, but from a users perspective this simplification may be helpful.

    Figure Parse shows ``reduction'' steps and not the ``shifts'', and glosses over the lexical analysis and other nuances, but it illustrates the idea of the parsing process nonetheless. For example at step 2 the parse recognizes the last token on the stack S (an instance of the "str" terminal with value "this") as matching the body of StrRule, and replaces it with the an instance of the nonterminal Value with value determined by the reduction of StrRule. In this case StrRule is associated with the reduction function EchoValue, so the result of the reduction is given by EchoValue( 'this', C ) where C is the context structure for the Parse.

    At Step 3 the most recent entries of S 

          V = ['(', 'SETQ', 'x', Value4, ')']
    match the body of the rule SetqRule, so they are replaced on S by an instance of the Value nonterminal with value determined by 
          Value3 = DoSet( V, C )
    Finally, at step 8, the interpretation associated with Value1 (an instance of the root nonterminal for LispG) is considered the result of the computation.

    Parsing with a Grammar

    Before you can perform a parse you probably must create a computational context for the parse. In the case of LispG the context is simply a dictionary so we may initialize 

          Context = {}
    To create a context for Parsing.

    There are two methods which provide the primary interfaces for the parsing process for a grammar. 

          RESULT = GRAMMAROBJECT.Parse1(STRING, CONTEXT)
      (RESULT, CONTEXT) = GRAMMAROBJECT.Parse(STRING, CONTEXT)
    The second allows you to make explicit in code that uses parsing the possibility that a parse may alter the context of the parse -- aside from that the two functions are identical. Example usage for Parse1 using LispG were given earlier.

    Storing and Reloading a Grammar Object

    The process of compiling a grammar may take significant time and consume significant quantities of memory. To free up memory from structures in a compilable grammar object that aren't needed after compilation use GRAMMAR.CleanUp().

    Once you have debugged the syntax and semantics of your grammar you may store syntactic information for the grammar using the Reconstruct method already mentioned. The declarations created by Reconstruct only defines the syntax for the grammar. The semantics must be rebound separately. But it is much better to use UnMarshalGram as shown below, which stores the grammar in a binary format.

    For example, lines 12 through 14 of Figure GrammarBuild create a file TESTLispG.py containing a function GRAMMAR() which will reconstruct the syntax for the LispG grammar. 

            # from DLispShort.py

def unMarshalLispG():
    import kjParser
    infile = open("TESTLispG.mar", "r")
    LispG = kjParser.UnMarshalGram(infile)
    infile.close()
    DeclareTerminals(LispG)
    BindRules(LispG)
    return LispG
    This function can then be used in another file, provided DLispShort.GrammarBuild() has been executed at some point in the past, thusly: 
            import DLispShort
        LGrammar = DLispShort.unMarshalLispG()
    Loading a precomputed grammar object.

    Figure Load shows a function LoadLispG that reloads the syntactic portion of LispG from TESTLispG.mar. To rebind the semantics as well the function re-declares the terminals and re-binds the rules to make the reconstructed LispG suitable for use in parsing.

    Errors raised

    You may see the following errors:

    LexTokenError
    This usually means the lowest level of the parser ran into a string it couldn't recognize.
    BadPunctError
    You tried to make a whitespace character a punctuation. This is not currently allowed.
    EOFError, SyntaxError
    You tried to parse a string that is not valid for the grammar.
    TokenError
    During parser generation you used a string in the rule definitions that wasn't previously registered as a terminal, nonterminal, or punctuation.
    NotSLRError
    You attempted to build a grammar that is not ``SLR'' according to the definition of Aho and Ullman. Either the grammar is ambiguous, or it doesn't have a derivation for the root nonterminal, or it is too tricky for the generator.
    Furthermore NondetError, ReductError, FlowError, ParseInitError, UnkTermError or errors raised by other modules shouldn't happen. If an error that shouldn't happen happens there are two possibilities (1) you have fiddled with the code or data structures and you broke something, or (2) there is a serious bug in the module.

    Possible Gotchas

    This package has a number of known deficiencies, and there are probably many that are yet to be discovered.

    Syntax errors are not reported nicely. Sorry.

    Currently, there is no way to to resolve grammar ambiguities. For example a C construct 

    if (x)
   if (y)
      x = 0;
   else
      y = 1;
    could have the else associated with either the first or second if; the grammar doesn't indicate which. This is normally resolved by informing the parser generator to prefer one binding or the other. No method for providing a preference is implemented here, yet. Let me know if you need such a method or if you have any suggestions.

    Keywords of the meta-grammar cannot name tokens of the object grammar (see footnote above).

    If you want keywords to be recognized without case sensitivity you must declare G.SetCaseSensitivity(0) before any keyword declarations.

    Name and regular expression collisions are not always checked and reported. If you name two rules the same, for example, you may get undefined behavior.

    The lexical analysis implementation is not as fast as it could be (of course). It also sees all white space as a `single space' so, for example, if indentation is significant in your grammar (as in Python) you'll need a different lexical analyzer. Also if x=+y means something different from x = + y (as it did in the original C, I believe) you may have trouble. Happily the lexical component can be easily ``plug replaced'' by another implementation if needed.

    Also, the system currently only handles SLR grammars (as defined by Aho and Ullman), as mentioned above. If you get a NonSLRError during grammar compilation you need a better parser generator. I may provide one, if I have motivation and time.

    I know of no outright bugs. Trust me, they're there. Please find them for me and tell me about them. I'm not a big expert on parsing so I'm sure I've made some errors, particularly at the lexical level.

    Further Reading

    A standard reference for parsing and compiler, interpreter, and translator implementation is Principles of Compiler Design, by Aho and Ullman (Addison Wesley).

    feedback
    home
    Gadfly home Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/pygram.py100644 1007 1403 76223 6747630575 25137 0ustar petrillipetrilli# rules for python # based on grammar given in Programming Python by Mark Lutz # EDIT THIS: THE DIRECTORY IN WHICH TO MARSHAL THE # GRAMMAR DATA STRUCTURES. # ARCHIVE = "." marshalfilename = ARCHIVE + "/pygram.mar" pyrules = """ all :: ## input terminates with "fake" dedent (forces read of all file) @R all1 :: all >> file_input DEDENT ## 1 term newline ##@R lead_blank :: file_input >> NEWLINE file_input @R top_stmt :: file_input >> file_input stmt @R file_input :: file_input >> stmt ## 2 @R simple :: stmt >> simple_stmt @R compound :: stmt >> compound_stmt ## 3 punct ; term NEWLINE @R one_small :: simple_stmt >> small_stmt NEWLINE @R more_small :: simple_stmt >> small_stmt ; simple_stmt @R small_semi :: simple_stmt >> small_stmt ; NEWLINE ## 4 kw pass @R smexpr :: small_stmt >> expr_stmt @R smassn :: small_stmt >> assn @R smprint :: small_stmt >> print_stmt @R smdel :: small_stmt >> del_stmt @R smpass :: small_stmt >> pass @R smflow :: small_stmt >> flow_stmt @R smimport :: small_stmt >> import_stmt @R smglobal :: small_stmt >> global_stmt ## access ignored @R smexec :: small_stmt >> exec_stmt ## 5 @R cmif :: compound_stmt >> if_stmt @R cmwhile :: compound_stmt >> while_stmt @R cmfor :: compound_stmt >> for_stmt @R cmtry :: compound_stmt >> try_stmt @R cmdef :: compound_stmt >> funcdef @R cmclass :: compound_stmt >> classdef ##6 @R exprlist :: expr_stmt >> testlist ##@R assignment :: expr_stmt >> assn @R assn1 :: assn >> testlist = testlist @R assnn :: assn >> testlist = assn @R assn1c :: assn >> testlist , = testlist @R assn1c2 :: assn >> testlist , = testlist , @R assnnc :: assn >> testlist , = assn ##testing @R exprassn :: expr_stmt >> expr_stmt = testlist @R exprlistc :: expr_stmt >> testlist , ##testing @R exprassnc :: expr_stmt >> expr_stmt = testlist , ##7 kw print @R rprint0 :: print_stmt >> print @R rprint :: print_stmt >> print testlist @R rprintc :: print_stmt >> print testlist , ##8 kw del @R rdel :: del_stmt >> del exprlist ##9 trivially handled in #4 ##10 kw raise continue break return ## eliminates 11 12 13 14 @R rbreak :: flow_stmt >> break @R rcontinue :: flow_stmt >> continue @R rreturn0 :: flow_stmt >> return @R rreturn :: flow_stmt >> return testlist @R rreturnc :: flow_stmt >> return testlist , @R rraise1 :: flow_stmt >> raise test @R rraise2 :: flow_stmt >> raise test , test @R rraise3 :: flow_stmt >> raise test , test , test ## 11 12 13 14 skipped ## 15 kw import from @R rimport :: import_stmt >> import dotted_name_list @R rimportc :: import_stmt >> import dotted_name_list , @R dnlist1 :: dotted_name_list >> dotted_name @R dnlistn :: dotted_name_list >> dotted_name_list , dotted_name @R rfrom :: import_stmt >> from dotted_name import name_list @R rfroms :: import_stmt >> from dotted_name import * @R rfromc :: import_stmt >> from dotted_name import name_list , @R nlistn :: name_list >> name_list , NAME @R nlist1 :: name_list >> NAME ##16 nt NAME @R dn1 :: dotted_name >> NAME @R dnn :: dotted_name >> dotted_name . NAME ##17 kw global @R global1 :: global_stmt >> global NAME @R globaln :: global_stmt >> global_stmt , NAME ## 18 19 ignored ##20 kw exec in @R exec1 :: exec_stmt >> exec expr @R exec2 :: exec_stmt >> exec expr in test @R exec3 :: exec_stmt >> exec expr in test , test ##21 kw if elif else punct : @R ifr :: if_stmt >> if test : suite elifs @R elifs0 :: elifs >> @R relse :: elifs >> else : suite @R elifsn :: elifs >> elif test : suite elifs ##22 kw while @R while1 :: while_stmt >> while test : suite @R while2 :: while_stmt >> while test : suite else : suite ##23 kw for @R for1 :: for_stmt >> for exprlist in testlist : suite @R for2 :: for_stmt >> for exprlist in testlist : suite else : suite ##24 kw try @R tryr :: try_stmt >> try : suite excepts @R excepts1 :: excepts >> except_clause : suite @R excepts2 :: excepts >> except_clause : suite else : suite @R exceptsn :: excepts >> except_clause : suite excepts @R tryf :: try_stmt >> try : suite finally : suite ##25 kw except @R except0 :: except_clause >> except @R except1 :: except_clause >> except test @R except2 :: except_clause >> except test , test ##26 @R class1 :: classdef >> class NAME : suite @R class2 :: classdef >> class NAME ( testlist ) : suite ##27 kw def @R rdef :: funcdef >> def NAME parameters : suite ##28, 29 punct = * ## (modified from grammar presented) @R params1 :: parameters >> ( varargslist ) @R params1c :: parameters >> ( varargslist , ) @R params2 :: varargslist >> ## this is way too permissive: fix at semantic level @R params3 :: varargslist >> arg @R params4 :: varargslist >> varargslist , arg @R argd :: arg >> NAME = test @R arg2 :: arg >> fpdef @R arg3 :: arg >> * NAME @R arg4 :: arg >> ** NAME ## 30 @R fpdef1 :: fpdef >> NAME @R fpdef2 :: fpdef >> ( fplist ) @R fpdef2c :: fpdef >> ( fplist , ) ##31 @R fplist1 :: fplist >> fpdef @R fplistn :: fplist >> fplist , fpdef ##32 t INDENT DEDENT @R ssuite :: suite >> simple_stmt @R csuite :: suite >> NEWLINE INDENT stmtseq DEDENT @R stmtseq1 :: stmtseq >> stmt @R stmtseqn :: stmtseq >> stmtseq stmt ##33 kw or cancels 53 @R testor :: test >> or_test @R testand :: or_test >> and_test @R testor1 :: or_test >> or_test or and_test ## @R testlambda0 :: test >> lambda : test REDUNDANT @R testlambda1 :: test >> lambda varargslist : test ##34 kw and @R andnot :: and_test >> not_test @R andand :: and_test >> and_test and not_test ##35 kw not @R notnot :: not_test >> not not_test @R notcmp :: not_test >> comparison ##36 NOTE KWS == >= <= <> != @R cmpexpr :: comparison >> expr @R cmplt :: comparison >> comparison < expr @R cmpgt :: comparison >> comparison > expr @R cmpeq :: comparison >> comparison == expr @R cmpge :: comparison >> comparison >= expr @R cmple :: comparison >> comparison <= expr @R cmpnep :: comparison >> comparison <> expr @R cmpne :: comparison >> comparison != expr @R cmpin :: comparison >> comparison in expr @R cmpnotin :: comparison >> comparison not in expr @R cmpis :: comparison >> comparison is expr @R cmpisnot :: comparison >> comparison is not expr ##37 kw is not punct > < ! (eliminated) ##38 p | @R expr_xor :: expr >> xor_expr @R expr_lor :: expr >> expr | xor_expr ##39 p ^ @R xor_and :: xor_expr >> and_expr @R xor_xor :: xor_expr >> xor_expr ^ and_expr ##40 @R and_shift :: and_expr >> shift_expr @R and_and :: and_expr >> and_expr & shift_expr ##41 note kw's << >x> note goofy x to avoid confusing the grammar @R shift_arith :: shift_expr >> arith_expr @R shift_left :: shift_expr >> shift_expr << arith_expr @R shift_right :: shift_expr >> shift_expr >x> arith_expr ##42 @R arith_term :: arith_expr >> term @R arith_plus :: arith_expr >> arith_expr + term @R arith_minus :: arith_expr >> arith_expr - term ##43 p */% @R termfactor :: term >> factor @R termmul :: term >> term * factor @R termdiv :: term >> term / factor @R termmod :: term >> term % factor ## stuff for power @R factorpower :: factor >> power @R factorexp :: factor >> factor ** power ##44 p ~ @R powera :: power >> atom trailerlist @R trailerlist0 :: trailerlist >> @R trailerlistn :: trailerlist >> trailer trailerlist @R powerp :: power >> + power @R powerm :: power >> - power @R poweri :: power >> ~ power ##45 t NUMBER STRING @R nulltup :: atom >> ( ) @R parens :: atom >> ( testlist ) @R parensc :: atom >> ( testlist , ) @R nulllist :: atom >> [ ] @R list :: atom >> [ testlist ] @R listc :: atom >> [ testlist , ] @R nulldict :: atom >> { } @R dict :: atom >> { dictmaker } @R dictc :: atom >> { dictmaker , } @R repr :: atom >> ` testlist ` ## @R reprc :: atom >> ` testlist , ` doesn't work, apparently @R aname :: atom >> NAME ## note number to be broken out into FLOAT OCTINT HEXINT INT @R anumber :: atom >> NUMBER @R astring :: atom >> stringseq @R stringseq0 :: stringseq >> STRING @R stringseqn :: stringseq >> stringseq STRING ##46 @R nullcall :: trailer >> ( ) @R call :: trailer >> ( arglist ) @R callc :: trailer >> ( arglist , ) @R index :: trailer >> [ subscriptdots ] @R getattr :: trailer >> . NAME ##47 @R arg1 :: arglist >> argument @R argn :: arglist >> arglist , argument ##@R argn1 :: arglist >> arglist , NAME = test ##48 ( !!!! is this wrong in PP?) @R posarg :: argument >> test ## here the left test should be a NAME always, but parser doesn't like it @R namearg :: argument >> test = test ##49 this IS wrong in PP (numeric ext) @R nodots :: subscriptdots >> subscriptseq @R yesdots :: subscriptdots >> subscriptseq , . . . , subscriptseq @R subscript1 :: subscriptseq >> subscript @R subscriptn :: subscriptseq >> subscriptseq , subscript @R subscriptt :: subscript >> test @R subscripts0 :: subscript >> : @R subscriptsL :: subscript >> test : @R subscriptsR :: subscript >> : test @R subscripts :: subscript >> test : test ##50 @R exprlist1 :: exprlist >> expr @R exprlistn :: exprlist >> exprlist , expr ##51 @R testlist0 :: testlist >> test @R testlistn :: testlist >> testlist , test ##52 @R dictmaker1 :: dictmaker >> test : test @R dictmaker2 :: dictmaker >> dictmaker , test : test """ nonterms = """ subscriptdots subscript arg argument arglist subscriptseq params trailerlist factor atom trailer dictmaker stringseq power xor_expr and_expr shift_expr arith_expr term and_test or_test not_test comparison comp_op expr fplist stmtseq varargslist assn expr elifs suite excepts parameters pbasic pdefault pspecial testlist exprlist test dotted_name_list dotted_name name_list if_stmt while_stmt for_stmt try_stmt funcdef classdef expr_stmt print_stmt del_stmt flow_stmt import_stmt global_stmt small_stmt compound_stmt stmt simple_stmt exec_stmt file_input except_clause fpdef cmp_op all """ import string # python needs special handling for the lexical stuff NAMEre = "[" + string.letters + "_][" + string.letters+string.digits +"]*" NUMBERre = "[" + string.digits + "]+" # temporary! STRINGre = '"[^"\n]*"' # to be overridden in lexdict #NEWLINEre = "\n" # to be overridden in lexdict INDENTre = "#" # a fake! to be overridden DEDENTre = "#" # a fake! to be overridden def echo(str): return str def DeclareTerminals(Grammar): Grammar.Addterm("NAME", NAMEre, echo) Grammar.Addterm("NUMBER", NUMBERre, echo) Grammar.Addterm("STRING", STRINGre, echo) #Grammar.Addterm("NEWLINE", NEWLINEre, echo) # newline is kw! Grammar.Addterm("INDENT", INDENTre, echo) Grammar.Addterm("DEDENT", DEDENTre, echo) # not >x> is a fake! keywords = """ and break class continue def del elif else except exec finally for from global if import in is lambda not or pass print raise return try while == >= <= <> != >x> << NEWLINE ** """ import kjParser, string, regex from kjParser import KEYFLAG, ENDOFFILETERM alphanumunder = string.letters+string.digits+"_" alpha = string.letters + "_" # components that are part of a identifier (cannot be next to kw). id_letters = map(None, alphanumunder) # terminator re for names nametermre = "[^" + alphanumunder + "]" nameterm = regex.compile(nametermre) # terminator re for numbers (same as above but allow "." in num). numtermre = "[^" + alphanumunder + "\.]" numterm = regex.compile(numtermre) parseerror = "parseerror" pycommentre = "\(#.*\)" # whitespace regex outside of brackets # white followed by (comment\n maybe repeated) # DON'T EAT NEWLINE!! pywhiteoutre = "\([ \t\r\014]\|\\\\\n\)*%s?" % pycommentre pywhiteout = regex.compile(pywhiteoutre) # whitespace regex inside brackets # white or newline possibly followed by comment, all maybe repeated pywhiteinre = pywhiteoutre #"[ \t\r]*\(\\\\\n\)*%s?" % pycommentre pywhitein = regex.compile(pywhiteinre) # totally blank lines (only recognize if next char is newline) #allblankre = "\n" + pywhiteinre #allblank = regex.compile(allblankre) # re for indentation (might accept empty string) indentp = regex.compile("[\t ]*") # two char kws and puncts char2kw = ["if", "or", "in", "is"] punct2 = ["<>", "<<", ">>", "<=", ">=", "!=", "**", "=="] # >two char kws as map of first 3 chars to others char3k_data = """ and break class continue def del elif else except finally for from global import lambda not pass print raise return try while exec """ char3kw = string.split(char3k_data) char3kwdict = {} for x in char3kw: char3kwdict[x[:3]] = x # NOTE: newline is treated same as a punctuation # NOTE: "' ARE NOT PUNCTS punct = "~!#%^&*()-+=|{}<>,.;:/[]{}\n`" punctlist = map(None, punct) kwmap = {} for x in char2kw + punct2 + char3kw + map(None, punct): # everything parses as length 1 to the outer world. kwmap[x] = (((KEYFLAG, x), x), 1) # special hack kwmap[">>"] = (((KEYFLAG, ">x>"), ">x>"), 1) newlineresult = kwmap["\n"] = (((KEYFLAG, "NEWLINE"), "NEWLINE"), 1) #finaldedent = (((TERMFLAG, "DEDENT"), ""), 1) # Python lexical dictionary. ### MUST HANDLE WHOLELY BLANK LINES CORRECTLY! class pylexdict(kjParser.LexDictionary): def __init__(self): kjParser.LexDictionary.__init__(self) # need to add special map for >> self.brackets = 0 # count of active brackets self.realindex = 0 # where to start self.indents = [""] # stack of indents (start with a fake one) self.lineno = 0 self.atdedent = 0 ### handle multiple dedents correctly!!! ### translate tabs to 8 spaces... from kjParser import TERMFLAG self.NAMEflag = (TERMFLAG, "NAME") self.STRINGflag = (TERMFLAG, "STRING") self.NEWLINEflag = (TERMFLAG, "NEWLINE") self.INDENTflag = (TERMFLAG, "INDENT") self.DEDENTflag = (TERMFLAG, "DEDENT") self.NUMBERflag = (TERMFLAG, "NUMBER") def endoffile(self, String): # pop off all indentations! indents = self.indents #lastresult = self.lastresult self.realindex = len(String) if not indents: # pop indents #print "eof after dedent" result = self.lastresult = (ENDOFFILETERM, 0) else: #print "eof as dedent after", self.lastresult del indents[-1] if indents: dedent = indents[-1] else: dedent = "" result = self.lastresult = ((self.DEDENTflag, dedent), 1) #print "returning eof", result, "after", lastresult return result def Token(self, String, StartPosition): #print "Token", (StartPosition, # `String[self.realindex:self.realindex+20]`, self.lastresult) # HAVE TO FAKE OUT LEXER FOR DEDENTS # STARTPOSITION COUNTS # OF TOKEN, NOT STRING POSITION # STRING POSITION IS MAINTAINED IN LexDict object. lastindex = self.lastindex lastresult = self.lastresult if self.laststring is not String: #print "parsing new string" self.laststring = String # special hack: skip lead whitespace cursor = 0 self.lineno = 1 while 1: test = pywhitein.match(String, cursor) if test<0: break next = cursor + test #print "lead skip:", next, String[cursor:next] if String[next]!="\n": break #skipped = String[cursor:next] #if "\n" in skipped: # self.lineno = ( # self.lineno + len(string.splitfields(skipped, "\n"))) #self.lineno = self.lineno+1 cursor = next + 1 self.realindex = cursor self.saveindex = 0 self.indents = [""] # stack of indents (start with a fake one) # pretend we saw a newline self.lastresult = newlineresult if StartPosition!=0: self.laststring = None raise ValueError, "python lexical parsing must start at zero" lastindex = self.lastindex lastresult = None elif lastindex == StartPosition: #print "returning lastresult ", lastresult return lastresult elif lastindex != StartPosition-1: raise ValueError, "python lexer can't skip tokens" #print "parsing", StartPosition, lastresult # do newline counting here! delta = String[self.saveindex: self.realindex] #print "delta", `delta` if "\n" in delta: #print self.lineno, self.saveindex, self.realindex, `delta` self.lineno = self.lineno + len( string.splitfields(delta, "\n")) - 1 realindex = self.saveindex = self.realindex self.lastindex = StartPosition # skip whitespace (including comments) ### needs to be improved to parse blank lines, count line numbers... # skip all totally blank lines (don't eat last newline) atlineend = (String[realindex:realindex+1] == "\n" or lastresult is newlineresult or self.atdedent) skipnewlines = (lastresult is newlineresult or self.atdedent or self.brackets>0) if atlineend: #String[realindex:realindex+1]=="\n": #print "trying to skip blank lines", String[realindex:realindex+10] while 1: #if String[realindex:realindex+1]=="\n": # start = realindex+1 # move past current newline # self.lineno = self.lineno + 1 #else: # start = realindex start = realindex if skipnewlines: while String[start:start+1]=="\n": start = start+1 #self.lineno = self.lineno+1 #print "matching", `String[start:start+10]` skip = pywhitein.match(String, start) #print "skip=", skip if skip<0: break rs = skip + realindex + (start-realindex) if rs==realindex: break #print "at", rs, `String[rs]` if (rs0: # rs = rs + 1 #skipped = String[start:rs] #if "\n" in skipped: #self.lineno = self.lineno + len( # string.splitfields(skipped, "\n")) self.realindex = realindex = rs #self.lineno = self.lineno+1 else: if skipnewlines: self.realindex = realindex = start break #print "after skipping blank lines", `String[realindex:realindex+20]` skipto = realindex skip = 0 if self.brackets>0: while 1: #print "skipping white in brackets", skipto if realindex>len(String): break if String[skipto]=="\n": #self.lineno = self.lineno+1 skipto = skipto + 1 self.realindex = realindex = skipto continue skip = pywhiteout.match(String, skipto) nextskipto = skipto+skip #skipped = String[skipto:nextskipto] #if "\n" in skipped: # self.lineno = self.lineno+len( # string.splitfields(skipped, "\n")) if skip>0: skipto = nextskipto else: break skip = skipto - realindex elif not atlineend: skip = pywhitein.match(String, realindex) if skip<=0: skip = 0 else: #print "skipping", skip nextri = realindex + skip #skipped = String[realindex:nextri] #if "\n" in skipped: # self.lineno = self.lineno + len( # string.splitfields(skipped, "\n")) realindex = self.realindex = nextri if realindex>=len(String): return self.endoffile(String) # now look for a keyword, name, number, punctuation, # INDENT, DEDENT, NEWLINE first = String[realindex] #if last parse was newline and not in brackets: # look for indent/dedent if (self.brackets<=0 and (lastresult is newlineresult or self.atdedent) and first != "\n"): #print "looking for dent", realindex, `String[realindex:realindex+20]` match = indentp.match(String, realindex) if match>=0: dent = String[realindex: realindex+match] #print "dent match", match, `dent` oldindex = realindex self.realindex = realindex = realindex+match # replace tabs with 8 spaces dent = string.joinfields(string.splitfields(dent, "\t"), " ") dents = self.indents lastdent = dents[-1] ldl = len(lastdent) dl = len(dent) #print "last", ldl, dents if ldldl: self.realindex = oldindex # back up, may have to see it again! self.atdedent = 1 result = self.lastresult = ((self.DEDENTflag, dent), 1) del dents[-1] #print "dedent ", result, dl, dents return result # otherwise, indentation is same, keep looking # might be at eof now: if realindex>=len(String): #print "returning eof" return self.endoffile(String) first = String[realindex] self.atdedent = 0 from string import digits #, letters if (first in punctlist and # special case for .123 numbers (yuck!) (first!="." or String[realindex+1] not in digits)): # is it a 2 char punct? first2 = String[realindex:realindex+2] if first2 in punct2: result = self.lastresult = kwmap[first2] self.realindex = realindex+2 #print "2 digit punct", result return result # otherwise, just return normal punct result = self.lastresult = kwmap[first] self.realindex = self.realindex + 1 ### special bookkeeping if first=="\n": result = newlineresult #print "newline!" #self.lineno = self.lineno+1 elif first in "[{(": #print "bracket!" self.brackets = self.brackets + 1 elif first in "]})": #print "close bracket!" self.brackets = self.brackets - 1 #print "1 digit punct", result return result if first in digits or first==".": # parse a number... skip = numterm.search(String, realindex) if skip<=realindex: raise parseerror, "number length<1 (!)" thenumber = String[realindex:skip] self.realindex = skip ### note don't interpret number here!! result = self.lastresult = ((self.NUMBERflag, thenumber), 1) #print "number", result return result if first in alpha: # try keyword... first2 = String[realindex: realindex+2] if first2 in char2kw: if String[realindex+2:realindex+3] not in id_letters: # parse a 2 char kw first2 result = self.lastresult = kwmap[first2] self.realindex = self.realindex+2 #print "keyword 2", result return result first3 = String[realindex: realindex+3] if char3kwdict.has_key(first3): the_kw = char3kwdict[first3] the_end = realindex+len(the_kw) if ((the_endsanity: raise parseerror, "failed to terminate single quotes" if String[last-1:last]=="\\": # are we at the end of an odd number of backslashes? (yuck!) bplace = last-1 while String[bplace:bplace+1]=="\\": bplace = bplace-1 if (last-bplace)%2==1: break # the end quote is real! place = last+1 else: break the_string = String[start:last] self.realindex = last+1 result = self.lastresult = ((self.STRINGflag, the_string), 1) #print "1q string", result return result #print (String[realindex-20:realindex-1], String[realindex], # String[realindex+1:realindex+20]) raise parseerror, "invalid first: " + `first` # use a modified lexstringwalker class pylexstringwalker(kjParser.LexStringWalker): def DUMP(self): kjParser.DumpStringWindow(self.String, self.LexDict.realindex) ## a HORRIBLE HACK! of a hack: override the DoParse of Grammar ## to give Python line numbers. RELIES ON GLOBAL pyg ## def hackDoParse(String, Context=None, DoReductions=1): import sys, kjParser try: # construct the ParserObj # add a newline to front to avoid problem with leading comment #String = "\n%s\n" % String Stream = pylexstringwalker( String, pyg.LexD ) Stack = [] # {-1:0} #Walkers.SimpleStack() ParseOb = kjParser.ParserObj( pyg.RuleL, Stream, pyg.DFA, Stack, \ DoReductions, Context ) # do the parse ParseResult = ParseOb.GO() # return final result of reduction and the context return (ParseResult[1], Context) #return kjParser.Grammar.DoParse(pyg, String, Context, DoReductions) except: ### for testing!! t, v = sys.exc_type, sys.exc_value v = ("near line", pyg.LexD.lineno, v) raise t, v buildinfo = """ Please edit the ARCHIVE parameter of this module (%s) to place the python grammar archive in a standard directory to prevent the module from rebuilding the python grammar over and over and over... """ % __name__ def GrammarBuild(): global pyg import kjParseBuild pyg = kjParseBuild.NullCGrammar() pyg.DoParse = hackDoParse # override lexical dict here pyg.LexD = pylexdict() DeclareTerminals(pyg) pyg.Keywords(keywords) pyg.punct("~!#%^&*()-+=|{}'`<>,.;:/[]{}") pyg.Nonterms(nonterms) pyg.Declarerules(pyrules) print buildinfo print "compiling... this may take a while..." pyg.Compile() print "dumping" outfile = open(marshalfilename, "wb") pyg.MarshalDump(outfile) outfile.close() print "self testing the grammar" test(pyg) print "\n\ndone with regeneration" return pyg def unMarshalpygram(): global pyg import kjParser print "loading" try: infile = open(marshalfilename, "rb") except IOError: print marshalfilename, "not found, attempting creation" pyg = GrammarBuild() else: pyg = kjParser.UnMarshalGram(infile) infile.close() pyg.DoParse = hackDoParse # lexical override pyg.LexD = pylexdict() DeclareTerminals(pyg) # BindRules(pyg) if dotest: print "self testing the grammar" test(pyg) return pyg # not used, commented #### interpretation rules/classes # #def zeroth(list, Context): # return list[0] # eg, for all1, ignore all but first # ## file_input, stmt, simple_stmt, compound_stmt give list of statement_ob #def append(list, Context): # "eg, for top_stmt, conjoin two smt lists" # return list[0] + list[1] # ## file_input -->zeroth # ## simple, compound, one_small, small_semi: echol #def echol(list, Context): # return list # ## more_small --> seq_sep #def seq_sep(list, Context): # list[0].append(list[2]) # return list[0] # ## smexpr, smassn, smpring, smdel, smflow, smimport, smglobal, smexec ## --> zeroth # ## cmif, cmwhile, cmfor, cmtry, cmdef, cmclass --> zeroth # # #def BindRules(pyg): # for name in string.split(""" # all1 file_input cmif cmwhile cmfor cmtry cmdef cmclass # smexpr smassn smprint smdel smflow smimport smglobal smexec # """): # pyg.Bind(name, zeroth) # for name in string.split(""" # simple compound one_small small_semi # """): # pyg.Bind(name, echol) # pyg.Bind("top_stmt", append) # pyg.Bind("more_small", seq_sep) teststring = """# # # a test string # from string import join, split ''' import regex for a in l: a.attr, a[x], b = c else: d = b ''' class zzz: ''' #doc string ''' ''' global regex, join d = {} for i in range(10): d[i] = i ''' def test(c,s): return "this" while not done: print done break list = [1,2,3] # comment return 5 n,x = 89 >> 90 + 6 / 7 % x + z << 6 + 2 ** 8 if x==5: while y: for i in range(6): raise SystemError, "oops" """ #teststring ="""\ ## comment #if x in y: print z #elif 1: print w #""" ''' teststring=""" exec "print 1" """ ''' def test(grammar, context=None, teststring=teststring): from time import time now = time() x = grammar.DoParse1(teststring, context) elapsed = time()-now print x print elapsed return x regen = 0 dotest = 0 if __name__ == "__main__" : if regen: GrammarBuild() unMarshalpygram() Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/relalg.py100644 1007 1403 27717 6747630576 25113 0ustar petrillipetrilli """Simple relational algebra interpreter. usage: To make the grammar python relalg.py make To run some relatoinal algebra expressions python relalg.py < expressions_file """ # EDIT INSTALLDIR TO BE ABLE TO LOAD UNDER ANY CWD INSTALLDIR = "." ## simple relational algebra using only the equality predicate ## note: string values cannot contain ; ## statement sequencing using ; handled at higher level relalg_rules = """ statement :: @R statementassn :: statement >> assignment @R statementexpr :: statement >> rexpr @R assignment1 :: assignment >> name = rexpr @R assignmentn :: assignment >> name = assignment @R union :: rexpr >> rexpr U rterm @R rterm :: rexpr >> rterm @R minus :: rexpr >> rexpr - rterm @R intersect :: rterm >> rterm intersect rfactor @R join :: rterm >> rterm join rfactor @R rfactor :: rterm >> rfactor @R projection :: rfactor >> projection [ names ] rfactor @R names0 :: names >> @R namesn :: names >> names1 @R names11 :: names1 >> name @R names1n :: names1 >> names1 name @R selection :: rfactor >> selection ( condition ) rfactor @R conditionor :: condition >> condition | boolfactor @R condfactor :: condition >> boolfactor @R factorand :: boolfactor >> boolfactor & boolprimary @R factorprime :: boolfactor >> boolprimary @R notprimary :: boolprimary >> ~ boolprimary @R primarycondition :: boolprimary >> ( condition ) @R primaryeq :: boolprimary >> expression = expression @R expname :: expression >> name @R expvalue :: expression >> value @R rename :: rfactor >> rename [ names ] to [ names ] rfactor @R named :: rfactor >> name @R factorexpr :: rfactor >> ( rexpr ) @R relationval :: rfactor >> [ names ] ( rows ) @R rows0 :: rows >> @R rowsn :: rows >> somerows @R somerows1 :: somerows >> row @R somerowsn :: somerows >> somerows , row @R emptyrow :: row >> NIL @R row1 :: row >> value @R rown :: row >> row value @R valuenum :: value >> number @R valuestr :: value >> string """ keywords = """ selection intersect rename projection to NIL U join """ puncts = """=^~|,-[]()&""" nonterms = """ statement assignment rexpr rterm value rfactor names names1 condition boolfactor boolprimary expression rows somerows row """ try: from kjbuckets import * except ImportError: from kjbuckets0 import * class relation: def __init__(self, names, rows): #print "relation init", names, rows names = self.names = tuple(names) nameset = self.nameset = kjSet(names) for r in rows: if nameset != kjSet(r.keys()): raise ValueError, \ "bad names: "+`(names, r.items())` self.rows = kjSet(rows) def __repr__(self): from string import join names = self.names rows = self.rows.items() if not rows: nns = join(names) replist = [nns, "="*len(nns), " ----"] return join(replist, "\n") #print names, rows nnames = len(names) if nnames==1: replist = [names[0]] else: replist = [names] for r in rows: elt = r.dump(names) replist.append(r.dump(names)) #print replist if nnames==1: replist = maxrep(replist) else: transpose = apply(map, tuple([None] + replist)) adjusted = map(maxrep, transpose) replist = apply(map, tuple([None] + adjusted)) replist = map(join, replist) replist.insert(1, "=" * len(replist[0])) #print replist return join(replist, "\n") def maxrep(list): list = map(str, list) maxlen = max( map(len, list) ) for i in range(len(list)): item = list[i] litem = len(item) list[i] = item + (" " * (maxlen-litem)) return list # context is a simple dictionary of named relations def elt0(l, c): return l[0] statementassn = elt0 def statementexpr(l, c): from string import split, join print print " --- expression result ---" print data = str(l[0]) print " "+ join(split(data, "\n"), "\n ") def assignment1(l, c): [name, eq, val] = l c[name] = val return val assignmentn = assignment1 def check_compat(v1, v2): names1, names2 = v1.names, v2.names if names1 != names2: raise ValueError, \ "operands not union compatible "+`(names1, names2)` return names1, v1.rows, v2.rows def union(l, c): [v1, U, v2] = l names1, r1, r2 = check_compat(v1, v2) return relation(names1, (r1+r2).items()) rterm = elt0 def minus(l, c): [v1, m, v2] = l names1, r1, r2 = check_compat(v1, v2) return relation(names1, (r1-r2).items()) def intersect(l, c): [v1, i, v2] = l names1, r1, r2 = check_compat(v1, v2) return relation(names1, (r1&r2).items()) def join(l, c): [v1, j, v2] = l n1, n2 = v1.names, v2.names r1, r2 = v1.rows.items(), v2.rows.items() n1s, n2s = kjSet(n1), kjSet(n2) common = tuple((n1s&n2s).items()) result = kjSet() if common: # simple hashjoin G = kjGraph() for a in r1: G[a.dump(common)] = a for b in r2: for a in G.neighbors(b.dump(common)): result[a+b] = 1 else: for a in r1: for b in r2: result[a+b] = 1 return relation( (n1s+n2s).items(), result.items() ) rfactor = elt0 def projection(l, c): [p, b1, names, b2, val] = l proj = kjSet(names) result = kjSet() for row in val.rows.items(): result[ proj * row ] = 1 return relation( names, result.items()) def emptylist(l, c): return [] names0 = emptylist namesn = elt0 def names11(l, c): return l def names1n(l, c): [ns, n] = l ns.append(n) return ns def selection(l, c): [sel, p1, cond, p2, val] = l return cond.filter(val) ## conditions are not optimized at all! class conditionor: def __init__(self, l, c): [self.c1, op, self.c2] = l def filter(self, val): v1 = self.c1.filter(val) v2 = self.c2.filter(val) return relation(v1.names, (v1.rows+v2.rows).items()) condfactor = elt0 class factorand(conditionor): def filter(self, val): v1 = self.c1.filter(val) v2 = self.c2.filter(val) return relation(v1.names, (v1.rows&v2.rows).items()) factorprime = elt0 class notprimary: def __init__(self, l, c): [n, self.c1] = l def filter(self, val): v1 = self.c1.filter(val) return relation(v1.names, (val.rows-v1.rows).items()) def elt1(l, c): return l[1] primarycondition = elt1 class primaryeq: def __init__(self, l, c): [self.e1, eq, self.e2] = l def filter(self, val): rows = val.rows.items() e1v = self.e1.value(rows) e2v = self.e2.value(rows) result = kjSet() for (r, v1, v2) in map(None, rows, e1v, e2v): if v1==v2: result[r] = 1 return relation(val.names, result.items()) class expname: def __init__(self, l, c): self.name = l[0] def value(self, rows): name = self.name r = list(rows) for i in xrange(len(r)): r[i] = r[i][name] return r class expvalue(expname): def value(self, rows): return [self.name] * len(rows) def rename(l, c): [ren, b1, names, b2, to, b3, names2, b4, val] = l if len(names)!=len(names2): raise ValueError, "names lengths must match"+`(names1, names2)` remap = kjDict(map(None, names2, names)) oldnames = kjSet(val.names) addnames = kjSet(names2) remnames = kjSet(names) keepnames = oldnames - remnames remap = remap + keepnames if not remnames.subset(oldnames): #print remnames, oldnames raise ValueError, "old names not present"+`(names, val.names)` newnames = keepnames+addnames rows = val.rows.items() for i in range(len(rows)): rows[i] = remap*rows[i] return relation(newnames.items(), rows) def named(l, c): [name] = l return c[name] def relationval(l, c): [b1, names, b2, p1, rows, p2] = l names = tuple(names) ln = len(names) for i in xrange(len(rows)): this = rows[i] lt = len(this) if lt!=ln: raise ValueError, "names, vals don't match"+`(names,this)` if len(this)==1: this = this[0] else: this = tuple(this) rows[i] = kjUndump(names, this) return relation(names, rows) rows0 = emptylist rowsn = elt0 def somerows1(l, c): #print "somerows1", l return l def somerowsn(l, c): #print "somerowsn", l [sr, c, r] = l sr.append(r) return sr emptyrow = emptylist row1 = somerows1 def factorexpr(l, c): return l[1] def rown(l, c): #print "rows", l [r, v] = l r.append(v) return r valuenum = valuestr = elt0 ## snarfed from sqlbind # note: all reduction function defs must precede this assign VARS = vars() class punter: def __init__(self, name): self.name = name def __call__(self, list, context): print "punt:", self.name, list return list class tracer: def __init__(self, name, fn): self.name = name self.fn = fn def __call__(self, list, context): print "tracing", self.name, list test = self.fn(list, context) print self.name, "returns", test return test def BindRules(sqlg): for name in sqlg.RuleNameToIndex.keys(): if VARS.has_key(name): #print "binding", name sqlg.Bind(name, VARS[name]) # nondebug #sqlg.Bind(name, tracer(name, VARS[name]) ) # debug else: print "unbound", name sqlg.Bind(name, punter(name)) return sqlg ## snarfed from sqlgen MARSHALFILE = "relalg.mar" import string alphanum = string.letters+string.digits + "_" userdefre = "[%s][%s]*" % (string.letters +"_", alphanum) RACOMMENTREGEX = "COMMENT .*" def userdeffn(str): return str charstre = "'[^\n']*'" def charstfn(str): return str[1:-1] numlitre = "[%s][%s\.]*" % (string.digits, alphanum) # not really... def numlitfn(str): """Note: this is "safe" because regex filters out dangerous things.""" return eval(str) def DeclareTerminals(Grammar): Grammar.Addterm("name", userdefre, userdeffn) Grammar.Addterm("string", charstre, charstfn) Grammar.Addterm("number", numlitre, numlitfn) def Buildrelalg(filename=MARSHALFILE): import kjParseBuild SQLG = kjParseBuild.NullCGrammar() #SQLG.SetCaseSensitivity(0) DeclareTerminals(SQLG) SQLG.Keywords(keywords) SQLG.punct(puncts) SQLG.Nonterms(nonterms) # should add comments SQLG.comments([RACOMMENTREGEX]) SQLG.Declarerules(relalg_rules) print "working..." SQLG.Compile() filename = INSTALLDIR+"/"+filename print "dumping to", filename outfile = open(filename, "wb") SQLG.MarshalDump(outfile) outfile.close() return SQLG def reloadrelalg(filename=MARSHALFILE): import kjParser filename = INSTALLDIR+"/"+filename infile = open(filename, "rb") SQLG = kjParser.UnMarshalGram(infile) infile.close() DeclareTerminals(SQLG) BindRules(SQLG) return SQLG def runfile(f): from string import split, join ragram = reloadrelalg() context = {} #f = open(filename, "r") data = f.read() #f.close() from string import split, strip commands = split(data, ";") for c in commands: if not strip(c): continue print " COMMAND:" data = str(c) pdata = " "+join(split(c, "\n"), "\n ") print pdata test = ragram.DoParse1(c, context) print # c:\python\python relalg.py ratest.txt if __name__=="__main__": try: done = 0 import sys argv = sys.argv if len(argv)>1: command = argv[1] if command=="make": print "building relational algebra grammar" Buildrelalg() done = 1 else: runfile(sys.stdin) done = 1 finally: if not done: print __doc__ Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/remotetest.py100644 1007 1403 4544 6747630576 26011 0ustar petrillipetrilli"""Demonstration of the Remote View protocol for adding specially implemented Views in an application.""" from gadfly import gadfly # create the database g = gadfly() g.startup("dbtest", "dbtest") # assume directory "dbtest" exists # define a remote view class import gfintrospect class myTable(gfintrospect.RemoteView): """A remote view must define self.column_names to return a (fixed) list of string column names and self.listing() to return a possibly varying list of row values. If there is a single column the listing() list must return a list of values, but for multiple columns it must return a list of tuples with one entry for each column. The remote view implementation may optionally redefine __init__ also, please see gfintrospect.py """ # static: don't reconstruct internal structure for each query # for more interesting views static will generally be 0 static = 1 def __init__(self, column_names=None, rowlist=None): """do whatever needed for initialization""" if column_names is None: column_names = ['a', 'b', 'c'] if rowlist is None: rowlist = [(1,2,3), (4,5,6), (7,8,9)] self.column_names = column_names self.rowlist = rowlist def listing(self): """return list of tuples of right sizes to match column_names. for more interesting views this will do something more complex ;). """ return self.rowlist # create a table using default cols and rows ### Python code adding ANY remote views must be EXECUTED ### EACH TIME THE DATABASE LOADS! g.add_remote_view("test", myTable()) # create a table using specified cols and rows # NOTE: for single column give list of values # NOT list of tuples of values! g.add_remote_view("test2", myTable(["x"], [1,6,7])) print g.database c = g.cursor() c.execute("select * from test") print "test::" print c.pp() print c.execute("select * from test2") print "test2::" print c.pp() print c.execute("select * from test, test2 where x=a") print "join" print c.pp() print g.add_remote_view("test3", myTable(["z", "w"], [(2,3), (7,8), (4,6)])) c.execute("select * from test3") print "test3::" print c.pp() print c.execute( "select * from test, test2, test3 where x=a and z=b and w=c") print "join 2::" print c.pp() print Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/server.html100644 1007 1403 24210 6747630576 25450 0ustar petrillipetrilli Gadfly: server operations

    Gadfly Server Operations

    To permit multiple processes to access and modify a single database instance, and to reduce the overhead per process of connecting to a Gadfly database a Gadfly database may be run in server mode. A Gadfly server can use a DBA (data base administrator) configured start-up script to set up optimized query accesses and certain forms of security.

    For example to startup a server for the test database "test" in directory "dbtest" (created by gftest.py) use: 

       python gfserve.py 2222 test dbtest admin
    or to start up the same server with some non-priviledged policies and some named prepared queries (as initialized in gfstest.startup(...)) use 
       python gfserve.py 2222 test dbtest admin gfstest
    In both cases the admin password for the server is "admin" and the server runs on port 2222. See the doc string for gfserve.py for more information on the command line arguments.

    Only one process should directly access a gadfly database at once (not mediated by a server), so if a server is running, no other server for that database should be started and no other process should connect in "non-server" mode to that database.

    Motivation

    There are several reasons to run a server: to allow multiple processes to access the same database; to allow password protected restricted access to the database by non-priviledged agents; and to permit faster access to the database by providing globally shared prepared statements. Using a server also eliminates the need to start up and load the database many times -- and startup time could be considerable if the database is large.

    For example I imagine that simple Gadfly servers may be of use to implement database enabled CGI scripts, whereas the "non-server" Gadfly will only run with CGI scripts that do not modify the database, and the startup time for Gadfly might make those scripts unacceptibly slow if the database is large. Furthermore, by using the security features a Gadfly server could be configured to allow restricted data distribution across a network without compromising the integrity of the database.

    Security

    The primary goal of Gadfly server security is to prevent accidental or malicious destruction of a database.

    Security is arbitrated by policies. Policies have passwords that are never transmitted in clear text. However, a "captured" command could potentially be repeated by a hostile program even without knowing the password. It is not a good idea to run admin or other unrestricted commands on a network that may have hostile parties sniffing the network. As with the rest of the system I provide no guarantees, but for many purposes the level of security provided may be acceptible. To be specific passwords are used to generate md5 certificates for all server accesses (please see gfsocket.py for implementation details).

    A server always has an "admin" policy that is permitted to shutdown, restart, or force a checkpoint on the server. By default the admin policy also has the ability to run arbitrary SQL statements such as "drop table x". This ability can be disabled in a startup function if needed. 

    admin_policy.general_queries=0

    Other policies can be created that have very restricted access. For example the following startup function initializes two policies beyond the admin policy that can only access certain tables in specific ways (from gfstest.py): 

    def startup(admin_policy, connection, Server_instance):
    """example startup script.

       add a policies test and test1 passwords same
         test1 is allowed to query the likess table by name
         test is allowed to update likes where drinker='nan'
       also add prepared query dumpwork to admin_policy.
    """
    from gfserve import Policy
    admin_policy["dumpwork"] = "select * from work"
    test1 = Policy("test1", "test1", connection, queries=0)
    test = Policy("test", "test", connection, queries=0)
    test1["qlike"] = "select * from likes where drinker=?"
    test["updatenan"] = """
      update likes
      set beer=?, perday=?
      where drinker='nan'
    """
    test["getnan"] = """
      select * from likes where drinker='nan'
    """
    return {"test": test, "test1": test1}
    Please see the doc string for gfserve.py for more information on creating startup functions.

    A policy with queries disabled (queries=0) can only execute named queries. By using such policies a DBA can configure a server such that client programs can only read certain tables, can only update certain rows of certain tables in certain ways, and so forth.

    Even policies with "unrestricted access" (queries=1) can provide performance benefits if they have associated named, prepared queries (like "dumpwork" above). At the moment the SQL parser slows down gadfly a bit, and prepared queries will only be parsed once for all clients. After the first access subsequent accesses may be noticably faster (10x faster in some cases), especially if the server has the kjbuckets builtin C module. However, with queries=1 the policy can execute any SQL statement.

    NOTE: The server runs all accesses (once the complete message has been read from the network) serially -- there is no concurrent access permitted to a Gadfly instance at this time. For this reason a "large query" may cause the server to "freeze" and delay other accesses. Incomplete requests due to network delays or other problems will not freeze the server, however (sockets are polled using select.select).

    NOTE: All server accesses run in "autocommit mode" at this time. A successful access automatically triggers a database commit (but an unsuccessful access will rollback).

    As an optimization, however, checkpoints only occur occasionally, once per a given number of accesses, configurable by setting: 

    Server_instance.check_loop = 100

    Start up

    Servers can be started from the command line using the gfserve.py script interpretation (as shown above) or using gfserve.Server(...) from another program. See the doc strings and source for gfserve.py and gfstest.py for more information.

    Shut down

    Servers can be shut down from the command line interpretation of gfclient.py or from another program using the gfclient(...) class shutdown() method, but only using the admin policy with the admin password. For example to shut down the server started above: 
    python gfclient.py shutdown 2222 admin
    See the doc strings and source for gfserve.py and gfstest.py for more information.

    Client Access

    Client access to a gadfly server is similar to the normal Python DB-SIG DBAPI access to gadfly, except that it is sometimes faster and can potentially be run from any machine reachable on the network (if the client program knows the password).

    To access a gadfly server from a remote machine the only python modules required (in addition to the standard libraries) are gfclient.py and gfsocket.py.

    Initialize a connection with a given "POLICY" with "PASSWORD" to a running server on "machine.domain.com" using port number 2222 with: 

       from gfclient import gfclient
   conn = gfclient("POLICY", 2222, "PASSWORD", "machine.domain.com")
    Note that policy names and passwords are case sensitive.

    Queries and other statements are normally executed via cursors. Obtain a cursor from a connection using: 

       cursor = connection.cursor()
    Execute a statement in a cursor using: 
       cursor.execute(statement)
    or to provide dynamic parameters: 
       cursor.execute(statement, dynamic_parameters)
    For example 
       cursor.execute("select * from work")
   ...
   cursor.execute("select * from work where name=?", ("carla",))
    The dynamic parameters work the same as described in the the main gadfly documentation page. In particular INSERT VALUES can insert several rows at once by using a list of tuples for the rows.

    If there is any problem (bad policy name, bad password, server not running, queries not allowed for this policy) the execute will generate an exception.

    To run a named/prepared query (initialized at startup) use execute_prepared, which takes a prepared statement name rather than a query string: 

    cursor.execute_prepared("updatenan", ("rollingrock", 1))
...
cursor.execute_prepared("getnan")
    The execute_prepared method works just like the execute method except that the "name" must be the name of a query initialized by the startup(...) function at server startup.

    NOTE: by default any execution that sends or recieves "too much data" will be aborted. Edit gfsocket.py (both on the client end and on the server end if different) if you wish to disable this sanity check feature. 

    LEN_LIMIT=10e8

    As with other dbapi cursors the results of a query can be extracted as a list of tuples using (after execute): 

       result_list = cursor.fetchall()
    The other fetches (fetchone and fetchmany) have not been implemented yet (partially since they don't make much sense in this context).

    Both named and unnamed statements may be semicolon separated sequences of several SQL statements, but if they are they will return no results.

    Implementation Comments

    For your information the server/client interaction is much like "finger" or "http" -- each client access is a separate TCP/Stream connection where the client sends a request and the server sends a response. After each access the connection is closed and the next access generates a new connection. I did it that way, because it was a simple and robust strategy (witness the success of HTTP).

    Please note: Although I have attempted to provide a robust implementation for this software I do not guarantee its correctness. I hope it will work well for you but I do not assume any legal responsibility for problems anyone may have during use of these programs.

    feedback
    home
    Gadfly home Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/sql.mar100644 1007 1403 215347 6750353112 24567 0ustar petrillipetrilli[ [~(isINTO(isboolean_factor(isprimary(iscolumn_constraint_definition(isdrop_index_statement(isCOUNT(isEXISTS(isCREATE(is sortspeclist(isINSERT(isDESC(is optorder_by(isINTEGER(iscolumn_definition(isIN(is INTERSECT(issearch_condition(isHAVING(issliteral(isAND(isUPDATE(ischaracter_string_type(ischaracter_string_literal(isFROM(isAVG(is column_name(isNOT(isANY(is statement(isfactor(isliteral(isset_function_reference(istable_reference_list(isORDER(isstatement_list(isFLOAT(iscreate_view_statement(is insert_spec(isINDEX(isselect_sublist(is predicate(isterm(isboolean_primary(isGROUP(is?(isinsert_statement(isSELECT(isdrop_table_statement(iscomparison_predicate(isDROP(isselect_statement(is+(is)(is/(isUNION(is-(isDISTINCT(is data_type(iscolids(isassn(isdelete_statement_searched(isVARCHAR(is;(isopt_ord(isupdate_statement_searched(islitlist(isVIEW(is=(is table_name(iscreate_table_statement(isexists_predicate(iscreate_index_statement(is boolean_term(isassns(isoptgroup(isapproximate_numeric_type(iscolelts(isWHERE(is alldistinct(isoptunion(isBETWEEN(isTABLE(isuser_defined_name(isMAX(isexact_numeric_type(isALL(isON(isBY(is opthaving(is column_alias(isUNIQUE(isAS(isDELETE(isOR(is optdefault(is selectsubs(issort_specification(isVALUES(is,(isSUM(isoptwhere(isdrop_view_statement(is sub_query(isMIN(isoptcolconstraints(isnamelist(isnumeric_literal(is aggregate(is optcolids(is*(is((is.(isEXCEPT(isMEDIAN(isSET(isallany(is colnamelist(iscolelt(is*(is expression(iscolumn_identifier(is>(is<(isASC(is select_list(is optnamelists.,*;=<>{}()?+-/[s--.*[(sstat1((isstatement_list[(is statement(sstatn((isstatement_list[(is statement(is;(isstatement_list(s dropindexstat((is statement[(isdrop_index_statement(screateindexstat((is statement[(iscreate_index_statement(sselstat((is statement[(isselect_statement(sinsstat((is statement[(isinsert_statement(screatetablestat((is statement[(iscreate_table_statement(s droptablestat((is statement[(isdrop_table_statement(sdelstat((is statement[(isdelete_statement_searched(s updatestat((is statement[(isupdate_statement_searched(screateviewstat((is statement[(iscreate_view_statement(s dropviewstat((is statement[(isdrop_view_statement(sdropview((isdrop_view_statement[(isDROP(isVIEW(isuser_defined_name(s createview((iscreate_view_statement[(isCREATE(isVIEW(isuser_defined_name(is optnamelist(isAS(isselect_statement(s optnamelist0((is optnamelist[(s optnamelistn((is optnamelist[(is((isnamelist(is)(s dropindex((isdrop_index_statement[(isDROP(isINDEX(isuser_defined_name(s createindex((iscreate_index_statement[(isCREATE(isINDEX(isuser_defined_name(isON(isuser_defined_name(is((isnamelist(is)(screateuniqueindex((iscreate_index_statement[ (isCREATE(isUNIQUE(isINDEX(isuser_defined_name(isON(isuser_defined_name(is((isnamelist(is)(snames1((isnamelist[(isuser_defined_name(snamesn((isnamelist[(isnamelist(is,(isuser_defined_name(supdate((isupdate_statement_searched[(isUPDATE(isuser_defined_name(isSET(isassns(isoptwhere(sassn1((isassns[(isassn(sassnn((isassns[(isassns(is,(isassn(sassn((isassn[(iscolumn_identifier(is=(is expression(s deletefrom((isdelete_statement_searched[(isDELETE(isFROM(isuser_defined_name(isoptwhere(s droptable((isdrop_table_statement[(isDROP(isTABLE(isuser_defined_name(s createtable((iscreate_table_statement[(isCREATE(isTABLE(isuser_defined_name(is((iscolelts(is)(scolelts1((iscolelts[(iscolelt(scoleltsn((iscolelts[(iscolelts(is,(iscolelt(scoleltid((iscolelt[(iscolumn_definition(scoleltconstraint((iscolelt[(iscolumn_constraint_definition(scoldef((iscolumn_definition[(iscolumn_identifier(is data_type(is optdefault(isoptcolconstraints(soptdef0((is optdefault[(s optcolconstr0((isoptcolconstraints[(s stringtype((is data_type[(ischaracter_string_type(s exnumtype((is data_type[(isexact_numeric_type(s appnumtype((is data_type[(isapproximate_numeric_type(sinteger((isexact_numeric_type[(isINTEGER(sfloat((isapproximate_numeric_type[(isFLOAT(svarchar((ischaracter_string_type[(isVARCHAR(svarcharn((ischaracter_string_type[(isVARCHAR(is((isnumeric_literal(is)(sinsert1((isinsert_statement[(isINSERT(isINTO(is table_name(is optcolids(is insert_spec(s optcolids0((is optcolids[(s optcolids1((is optcolids[(is((iscolids(is)(scolids1((iscolids[(iscolumn_identifier(scolidsn((iscolids[(iscolids(is,(iscolumn_identifier(s insert_values((is insert_spec[(isVALUES(is((islitlist(is)(s insert_query((is insert_spec[(is sub_query(slitlist1((islitlist[(issliteral(slitlistn((islitlist[(islitlist(is,(issliteral(s sliteral0((issliteral[(isliteral(s sliteralp((issliteral[(is+(isliteral(s sliterals((issliteral[(issliteral(is+(isliteral(s sliterald((issliteral[(issliteral(is-(isliteral(s sliteralm((issliteral[(is-(isliteral(s subselect((is sub_query[ (isSELECT(is alldistinct(is select_list(isFROM(istable_reference_list(isoptwhere(isoptgroup(is opthaving(isoptunion(sselectx((isselect_statement[(is sub_query(is optorder_by(sad0((is alldistinct[(sadall((is alldistinct[(isALL(s addistinct((is alldistinct[(isDISTINCT(swhere0((isoptwhere[(swhere1((isoptwhere[(isWHERE(issearch_condition(sgroup0((isoptgroup[(sgroup1((isoptgroup[(isGROUP(isBY(is colnamelist(s colnames1((is colnamelist[(is column_name(s colnamesn((is colnamelist[(is colnamelist(is,(is column_name(shaving0((is opthaving[(shaving1((is opthaving[(isHAVING(issearch_condition(sunion0((isoptunion[(sunion1((isoptunion[(isUNION(is alldistinct(is sub_query(sexcept1((isoptunion[(isEXCEPT(is sub_query(s intersect1((isoptunion[(is INTERSECT(is sub_query(sorder0((is optorder_by[(sorder1((is optorder_by[(isORDER(isBY(is sortspeclist(s sortspec1((is sortspeclist[(issort_specification(s sortspecn((is sortspeclist[(is sortspeclist(is,(issort_specification(ssortint((issort_specification[(isnumeric_literal(isopt_ord(ssortcol((issort_specification[(is column_name(isopt_ord(soptord0((isopt_ord[(s optordasc((isopt_ord[(isASC(s optorddesc((isopt_ord[(isDESC(strl1((istable_reference_list[(isuser_defined_name(strln((istable_reference_list[(isuser_defined_name(is,(istable_reference_list(strl1a((istable_reference_list[(isuser_defined_name(isuser_defined_name(strlna((istable_reference_list[(isuser_defined_name(isuser_defined_name(is,(istable_reference_list(strl1as((istable_reference_list[(isuser_defined_name(isAS(isuser_defined_name(strlnas((istable_reference_list[(isuser_defined_name(isAS(isuser_defined_name(is,(istable_reference_list(s selectstar((is select_list[(is*(s selectsome((is select_list[(is selectsubs(sselect1((is selectsubs[(isselect_sublist(sselectn((is selectsubs[(is selectsubs(is,(isselect_sublist(sselectit((isselect_sublist[(is expression(s selectname((isselect_sublist[(is expression(isAS(is column_alias(scolalias((is column_alias[(isuser_defined_name(ssearch1((issearch_condition[(is boolean_term(ssearchn((issearch_condition[(is boolean_term(isOR(issearch_condition(sbool1((is boolean_term[(isboolean_factor(sbooln((is boolean_term[(isboolean_factor(isAND(is boolean_term(sbf1((isboolean_factor[(isboolean_primary(snotbf((isboolean_factor[(isNOT(isboolean_primary(sbp1((isboolean_primary[(is predicate(sbps((isboolean_primary[(is((issearch_condition(is)(s predicate1((is predicate[(iscomparison_predicate(s predicateeq((iscomparison_predicate[(is expression(is=(is expression(s predicatelt((iscomparison_predicate[(is expression(is<(is expression(s predicategt((iscomparison_predicate[(is expression(is>(is expression(s predicatele((iscomparison_predicate[(is expression(is<(is=(is expression(s predicatege((iscomparison_predicate[(is expression(is>(is=(is expression(s predicatene((iscomparison_predicate[(is expression(is<(is>(is expression(s predbetween((iscomparison_predicate[(is expression(isBETWEEN(is expression(isAND(is expression(sprednotbetween((iscomparison_predicate[(is expression(isNOT(isBETWEEN(is expression(isAND(is expression(s predexists((is predicate[(isexists_predicate(sexists((isexists_predicate[(isEXISTS(is((is sub_query(is)(spredqeq((is predicate[(is expression(is=(isallany(is((is sub_query(is)(spredqne((is predicate[(is expression(is<(is>(isallany(is((is sub_query(is)(spredqlt((is predicate[(is expression(is<(isallany(is((is sub_query(is)(spredqgt((is predicate[(is expression(is>(isallany(is((is sub_query(is)(spredqle((is predicate[(is expression(is<(is=(isallany(is((is sub_query(is)(spredqge((is predicate[(is expression(is>(is=(isallany(is((is sub_query(is)(snnall((isallany[(isALL(snnany((isallany[(isANY(spredin((is predicate[(is expression(isIN(is((is sub_query(is)(s prednotin((is predicate[(is expression(isNOT(isIN(is((is sub_query(is)(s predinlits((is predicate[(is expression(isIN(is((islitlist(is)(s prednotinlits((is predicate[(is expression(isNOT(isIN(is((islitlist(is)(ssubqexpr((is expression[(is((is sub_query(is)(sexp1((is expression[(isterm(sexpplus((is expression[(is expression(is+(isterm(sexpminus((is expression[(is expression(is-(isterm(sterm1((isterm[(isfactor(s termtimes((isterm[(isterm(is*(isfactor(stermdiv((isterm[(isterm(is/(isfactor(sfactor1((isfactor[(isprimary(s plusfactor((isfactor[(is+(isfactor(s minusfactor((isfactor[(is-(isfactor(sprimary1((isprimary[(is column_name(s primarylit((isprimary[(isliteral(s primaryexp((isprimary[(is((is expression(is)(s primaryset((isprimary[(isset_function_reference(s stringlit((isliteral[(ischaracter_string_literal(s stringstring((isliteral[(isliteral(ischaracter_string_literal(snumlit((isliteral[(isnumeric_literal(s countstar((isset_function_reference[(isCOUNT(is((is*(is)(s distinctcount((isset_function_reference[(isCOUNT(is((isDISTINCT(is expression(is)(sallcount((isset_function_reference[(isCOUNT(is((is expression(is)(s distinctset((isset_function_reference[(is aggregate(is((isDISTINCT(is expression(is)(sallset((isset_function_reference[(is aggregate(is((is expression(is)(saverage((is aggregate[(isAVG(smaximum((is aggregate[(isMAX(sminimum((is aggregate[(isMIN(s summation((is aggregate[(isSUM(smedian((is aggregate[(isMEDIAN(sdynamic((isliteral[(is?(s columnname1((is column_name[(iscolumn_identifier(s columnname2((is column_name[(is table_name(is.(iscolumn_identifier(s tablename1((is table_name[(isuser_defined_name(s columnid1((iscolumn_identifier[(isuser_defined_namei8[(iXiMi(iiviN(iIiai+(ii4ih(ii]i(iivi/(iiie(iiia(i~imi(iiyi(ii+iW(iiyi(i9ii(ikibiK(i3i]i(ii4i~(iipip(iii~(i[i4i(iici:(ii4iz(iiCi(i[ii(iiiU(iipiA(iOi3i(i+i4i(ii[i(ii3i~(i3i]iu(iiiz(i*i4iG(ii3i<(i i!im(ii!i(iDibi\(iiCi(iibi(iivi(iiMi(ii.i:(iii(iigi;(ii3i6(iii(iMii(ii>i@(iipic(ii7i(i3iCi(iipii(iiif(iii(ii+i(i0i3i(ii4i(iXii(ii6ig(i]ii(ii]i(iii(iii(ii4i@(iMi4i(ii4i)(ii6iD(iivi(iXi+i(iii<(i5i]i(iici:(i9imi(iii(ii]ih(i0i5i(iXivi(iiMiW(iJioi(iipi`(i9ii(i8iyi(i ivi(iiik(ii>i(i6iviv(iii~(ii6ik(i2iMi(i.i+ir(iibi(ii>i(i3izi(i.iCi(iOii(imiviO(iii(i?iyi(i,ii{(i3ipi(i.ivir(ii7i;(i0iit(iiiT(i9i6i(ii4i1(ii4i$(i9i3i(ii>iR(iiii(iKi>i=(i?iPi(iipiC(i i>il(iibi7(ii4i(iiMi(iivi(i+ipi(i8iPi(i+i+i(i2i5i(iii|(iivij(iimi(i9iai(i;ii(i8i4i(ii4i4(i2ivi(iiiV(iiPi(i1i!i(ioi>i(i2ii(i1ii(iiqi;(i-i]io(i]i3i(i+ii}(iii(i2i+i(i8ii(i1izi(iii|(ii[i(ii4iV(iii~(ii[i(i?ii(ii+i(ii4i%(i+i4i}(iipi(ii7i(i?ii(iiyi(i;i+i(i.ipir(ii+iS(iizi(i1i]i(i i]il(ii5i(ii>ic(iipi@(ii]i(ii!ig(iipi(ii+i(i3i>iu(i9ii(iXi]i(iii_(iGivi(iii|(iii(i~iyi(iiMi(ii!i(iibi(ii+ig(ii3i;(iii(iXi!i(iivi (iiii(i.i6i(iii;(i9i7i(iipig(i8i]iw(i~iPi(i0iyi(iiij(i>ini(ii7i3(ii7i<(i?imi(ii!i(i0i7i(iqibi(ii4i_(iibi (ii6ic(i3ii(iiPi(ii]ie(iii>(iibi'(ii!ih(iii<(iii(ii4i'(i iim(i]iPi(i2i[i(iiviL(iiiq(i.ii(i~i4i(i+ii(i1ii(i3iviu(i]i7i(i[imi(iMivi(i ivim(ii>iD(iivi(i8ipiw(iipi(iOibi(iivii(ii>iP(i i>i(ii>iA(iiCi(i+ivi}(ii5i(iivi (iibi~(i8ii(i i+im(ii+ia(iui4i(iXi5i(i6i4iv(iOi4i(i1i+i(ii4i(i;i]i(ii6i(i8imi(ii>i=(i4i6iB(iibi4(iOii(ii5i(ii[i~(iizi(ii[i(i-iio(iii~(i1ivi(i0i+i(i5i4i(i2i]i(iivib(i-i+io(ii4ig(i5ii(i[i6i(ii>i(iOi7i(i2i!i(iii(i1ii(i5ii(ii!if(i4i>iB(i-ivio(ii!ii(i+ibi(ii.i,(ii7i(ixibi(iii(iii(ii>i(i.i!ir(iXi[i(ii4i(iini:(ii>i`(iibi5(ii4i(ii+i(i5iyi(i3i>i(ii[i(ii3i(i6iiv(i]ii(ii>i(i5ii(i(i>iH(iipi(ii!iS(ii7i(i+i3i(iipiR(iiPi~(ii[i(ii>iC(iKipi=(i3i6i(i,ii{(i9ibi(i8ii(ii4if(ii,i:(iimi(i.i5i(i?ii(ii>i~(iivi`(iii(ii[i(iimi<(i ivi(iiPi(i2ii(iHivi (i3i!iu(i-i>io(iiiR(i,i!i{(i i>i(iKii=(iNii=(i5i>iF(i9i i(iribi(ii>iM(i0ii(iii~(ii4i(iivip(ii4i(i5i4iF(iiviT(i~i{i(i?i5i(ii+ik(iqi4i(iibi(ii4iR(iKi4i=(ii+i~(iiMi(i.iir(ii.i<(ii!i(ii4i=(iivi0(i.i>i(iJiai(iiii(ii4i(iivi~(iii(i8i4iw(iivik(iFivi(iNi>i=(i/ini(i,i]i{(i0i>it(ii3i(ii+i>(i8i>i(iipi(iiMi~(ii+i(i2ii(iii:(ii7i:(iOiMi(iXii(iii:(i5izi(iiyi(i9i#i(i1i[i(i3ii(iivi (i5ipi(iibi2(i?i>i(i~iCi(iivi(i?i6i(iiMiT(iiPi(iii(i9ioi(iivi?(iiRi<(iOiyi(ii3i(iibi^(iOi5i(iivi (ii3i5(i8i6i(iXi3i(iji>iJ(i9i5i(iOi[i(i+i>i}(iibiQ(i!ipin(iibi&(iii(ii+ii(i!i>in(ii!i(i+i!i(iii(i8i[i(i0ii(iOi i(i8i!iw(i,ivi{(iNi!i=(i0imi(iiie(ii]iq(iigi:(iii(iipi|(iMi>i(iii?(i]iMi(ii7i(iibi(ii7i7(ii.i;(i9ivi(iXipi(ii6iz(ii]i(ii+ie(iii^(ii6ih(iizi(iiiW(i5iPi(i0ibi(i.ii(ii4i-(iipi=(iXii(i]i+i(ii4i7(iibiA(iii(ii6if(i0iPi(iici;(i+ii(ii>i(ii>ig(i9iMi(iii(ii6ip(ii4i((ii]ic(i1ibi(iipij(iiic(iiPi(i-i!io(ii7i(iivi(iizi(iivi8(i i4il(ii6i(iii@(i.izi(iiyi(ii>i*(ii6i@(ilibiO(i1ipi(ii>if(i+ivi(iigi:(i]ii(iipi_(ii4ii(i?ivi(i~ii(i8izi(ii4i!(iiMi(iii(iibi%(i0i[i(i8ipi(iivi(ii>i(iiviW(i!i6in(i?ipi(i5i3i(i3iyi(iii>i(i?izi(i*i>iG(iivi(ii4i6(iii(ii!iC(i9i{i(iiib(iii:(i0ivit(iOi i(iipiV(i.i6ir(iii;(ii3i(i1ii(iivi(i5i6i(ii>i (iibi(iiSi:(ii!i?(iibi](iiid(i+ipi}(ii4i(iXibi(i4i4iB(i3i4iu(iibi(i!iin(iOii(ii>i(ii>i(ii!iU(i0izi(iOi]i(ii4i`(iibiN(i.i4i(iiPi(iiid(iiPi(iii(i+i[i(iiCi(i;ii(i]ibi(i;ibi(i(i4iH(iivi(i2ii(iipiT(ii4iD(i*ivi(i3i4i(ii]i~(ii]ik(iiiS(iiSi:(iii(ii3i(i]i[i(i]ivi(ii>iV(ixi4i(i[ii(ii6ij(i,i+i{(ii+i(ii!ik(i;i7i(ii!iT(iivi(i,ii{(i2i7i(i0ipit(ii!iD(i#ivi9(iii:(iizi(iNivi=(iivi(iibiL(ii4i"(i]i!i(ii6i(ii6i_(i9i[i(ii6i|(ii4ic(i<ini(ii!ij(iizi(ii4i#(ii>ij(i?i!i(iipi(iipi(ii>iN(i7ipis(iii~(i+i]i(ii4iU(i9i i(i+ii(iibi#(ii+iR(iMipi(iiic(i6ipiv(iiMi(iiviz(ii>i_(ii!i8(ii!i>(i.ii(ii6i=(i2ibi(i]i]i(iiCi(iiMiV(iipif(i i>i(i8iCi(ii7i(iipih(i1iyi(iiyi~(iiji;(iiCi(iivi(iii(iAiiX(i;i[i(iiij(i6i6iv(ikiviK(i~ii(iiSi;(iivi(i.iyi(i[iPi(i9i>i(iizi(imibiO(iiiq(i?iCi(i~i>i(i]i5i(iii:(i0i]i(iXii(i4ipiB(i8ii(i~i6i(ii+iq(i.ibi(ii4iA(i.iPi(i3iiu(iipia(iiviE(iipiD(iipid(i0i!i(ii7i(iOimi(iiviq(iii(i~ii(iiip(i.iMi(i9i!i(iii(i+i5i(i8i6iw(iii:(iXi7i(ii7i5(i[iCi(ii6i~(ii>iI(i ivi(i2iPi(iMi6i(ii]i(iimi:(ii4iq(iibi[(i0iit(ii!iR(iii(i;iPi(i,ipi{(iii(iiiT(ii>iT(iibi6(i iil(iiMiU(i1i5i(iKii=(i]imi(iiviS(iiiR(ii>ii(i;i>i(ii>i0(i3iMi(iiniy(i0i+it(iOi>i(iimi(ii6ii(i+iMi(ii3i(iii(i?iMi(iivi(iOizi(ii6iT(i~i[i(iivi(i~i i(i8iMi(i.iir(i5i!iF(ii7i(i+iyi(i9ii(iii=(i.iir(iFi>i(i2imi(ii>ik(iipi(ii+ib(i5i!i(iKi+i=(ii>i(ii6i(i;i{i(i~iMi(i;ii(i2ii(i*i!iG(ii!id(ii>ih(i;i3i(iiviI(i;ii(i1imi(i7i6is(ii>i(ii>i(iiCi(ii6i?(i3i7i(ii>i (i2ii(i5ii(ii>i>(i8i+i(ii!i(ii>i?(iiRi;(iimi:(i+i+i}(iiviV(iiMi(iiviM(iinix(i!i!in(i8ii(ijiviJ(ii+iV(i2i4i(iiRi:(i i>im(ii!iE(i1i3i(i8i>iw(i3ii(iipiU(iiie(iNi+i=(ii+iz(i[i+i(ii4iW(i~i!i(ii]ii(iipi(i-iio(iOivi(i6i]iv(iizi(ii3i4(i3ibi(iii(ii3i(ii>iE(iMiMi(ii5i(iXiPi(iibiM(iiih(ii[i(i6i!iv(i1ii(iiviD(ii4ie(ii,i:(ii]id(ii+iU(iiiW(iii(iipiq(i9i.i(ii6iq(i[ii(iiSi<(ii6iR(iiviU(iipi?(iiiz(iiMiS(ii+ih(ii6i`(iiPi(i.ii(i.i]ir(iiPi(ii4i&(iiqi:(iii(iXii(i7i+is(iiiU(ii+i(i.i!i(iimi(ii3i3(i3iiu(iXii(i~i5i(iii(i~ibi(i iil(i]i>i(ii]i|(iii(ii6i>(iiif(ii7i6(i+imi(i7ivis(ii!i=(ii]ib(i5i7i(iivi*(iiMi(i[iMi(ii!ip(iii[(iii(i]i6i(ii]ij(iii(i;ipi(iibi(iiyi(i2iyi(i4ibiB(iii@(ii4i5(i1iPi(i7iis(i+i>i(iivif(iii(iiviC(i4iiB(iibi-(iivi(i1iMi(iibi"(iOipi(i0i6i(i3i!i(i?i7i(ii>i(i*iviG(iki>iK(i8i!i(iDii\(ii+i(iiivi(i.i3i(i!iin(i5ivi(ii7i(i;iMi(ii>id(iipi(i-iio(i+i]i}(ii4ib(i9iCi(iii](ii4iS(i!i+in(i;imi(i5iMi(i+i!i}(i ipil(iipi~(ii5i(ili>iO(ii>i(iiib(i?i]i(i i6im(ii]i(ii!iV(i0iCi(i3iiu(i!ivin(iii(iiiD(ii4ia(i!i4in(i0i6it(iivi(i8i5i(ii6i(iii(iiiC(ii4ij(i]iCi(i0i4it(iiviQ(ii]i(i.imi(ii6ia(iOii(i0i]it(i,i>i{(i;ii(ii!i_(ii6i(iibi(i,i6i{(ii!i(iibiP(i3iPi(i0i!it(iiCi(i3imi(iipik(iii(i4ibiZ(ii>i|(iizi~(iii`(i9i=i(i[iyi(iiMi(ii!i(i4iiB(iii(iivid(ii!ie(i7i!is(iivi=(i=iiY(i7i4is(iOi#i(ii+ij(iibi3(iOi!i(iiyi(ii+i=(iiviP(i]izi(ii4i2(i?i4i(i4iiZ(i]ipi(i[i5i(iOiCi(iXiyi(i+ii(i.ii(i8i]i(iii;(iipi>(iiyi(iOi=i(iimi(ii+i_(ii]i(i7i]is(ii3i(i3i[i(iXimi(ii]if(i7iis(iivi_(iiji<(iMi!i(iiij(iibi.(i~ipi(i;i5i(iiai,(ii!iz(i.ipi(iiyi(i[i!i(iiCi~(ii5i(i8iviw(i+izi(i+i6i(ii4i(i]ii(ii]ia(ii!i(i~ivi(iii(i3i3i(i6iiv(ii>i(iXii(i8i+iw(iii(iini:(i]ii(i i4im(ii+id(iOi{i(i~i]i(iiip(ii3i(iMii(i6i+iv(i8iiw(i7iis(i?i[i(i?i+i(i~ii(i0ipi(i[i]i(iNi6i=(iii(ii>i(ii!ia(iOii(ii>i/(iii<(ii[i(i0ii(i+iPi(iiiq(ii>iW(iii(i9iyi(ii6id(iimi(i]iyi(iHi>i (ii,i;(ii6iW(iii(i3ipiu(ii6ie(i9ii(i0ii(i1iCi(ii5i(i ipim(iiiz(ii>ie(i[ii(iii(iivi(i0iMi(ii>iL(ii6iU(i9i4i(ii>i(iizi(iivi|(i0ii(i?ii(ii+i(i0i4i(ii!iA(i~ii(i[i>i(ii4i(ii4i.(ii>iq(iii(iii>(i0ii(iiif(iivi@(i~i+i(i6i>iv(iibi(ii>i(iXi6i(iiig(ii>i (i+ii(i;i4i(i+iCi(i.ii(i+i6i}(ii6i(iibi((i?i3i(i~i7i(i5iCi(ii4i (iiih(iivie(i9iPi(ii!ic(ii4i|(iJi.i(i5ibi(ii6i(i+ii(i]i4i(ii>i8(i8ii(ii+if(i~izi(iii(i7i>is(ii>i(iibi(ii4i>(ii4i8(iivig(ii[i(i4iviB(i2i3i(ii6i(iXi>i(i.i]i(i0ivi(i~ii(iIi.i+(i)i[i(iOii(i[izi(iipiz(iiiA(iJini(i1ii(ii>ib(i(i!iH(i9i]i(iiiS(ii+i(i.i>ir(i iim(i iim(iibi(ii!i`(i5iviF(ii>iU(i[i3i(ii4iT(ii>ia(iiviR(ii!ib(i ivil(i.i[i(iNipi=(ii!iq(iKivi=(i iil(i9i+i(ii!i|(iiic(i;i!i(iibi(ii4id(ii4i3(iOi6i(i[ii(i3i+iu(ii4ik(iuibi(i5ii(iiyi(iii?(iiiA(i2i6i(iibi1(iri4i(i1i4i(ii>ip(i+i7i(i.i7i(iOiPi(iiiV(ii6iA(iivia(ii3i(i;i6i(ii]i(iipib(iiRi:(iimi;(i4i!iB(iliviO(iiMi(i0iit(iipi(i0i>i(iipiS(ii4i?(i9ini(i9ii(imi>iO(ii!i(iii(ii]ig(iini<(ii[i(iii(i3ivi(i#i>i9(iici<(i2i>i(i i!il(ioivi(i3i5i(iii_(ii7i:(i8ibi(i5i[i(iizi(iivic(i.i+i(i?ibi(i i]im(i[ivi(i i+il(i+ii}(iibi!(iKi6i=(i.ivi(ii+ic(iiig(ii!i@(i?ii(i[i7i(iGi>i(ii4ip(ii]ip(ii5i(iii(ii6i(iii(iipi(iXizi(ii>i (i!i]in(ii>iQ(iiih(ii7i~(i[ii(iii=(ii,i<(i6iiv(i9ipi(iipiW(iiMiR(iii(ii4i(i8i3i(iiMi(iiji:(ii]i(ii+ip(ii6i(ii4i(ii>iz(ii!iW(iini;(iXi4i(iiig(i9izi(iiik(iibi$(i;iCi(ii+iT(iiviA(i3i6iu(ii4iE(iipie(iii(iigi<(i;ii(i1i7i(i3ii(ii4iC(i?ii(i-i4io(ii6iV(ii3i:(i8iiw(ii3i7(iiip(iii(i2iCi(ii!i(iimi(ii3i:(i!iin(i[ipi(i-i6io(ii!i~(ii+i(iiqi:(iimi(i;iyi(iivih(iii(ii6iS(i1i>i(ii+i(iivi>(ii>iS(i5ii(i1i6i(iMibi(i[i[i(i;izi(iibi(iibi)(i3ii(i:ini(ii7i4(ii6ib(iii(i8iiw(iivi(iii(i.i4ir(i;i i(i2ipi(i i6il(iiid(i5i+i(iCini(ii.i:(i2izi(i8ivi(ii+i|(ii!i(ii6iC(i.ii(i8i7i(iiCi(iiPi(iiMi(i3i+i(iiji:(i~i3i(i]ii(i(iviH(ii]iz(ii+i`(iii`(i,i4i{(iii(i5i>i(i[ibi(i;ivi(iNii=(iiCi(iii(iNi4i=(iiik(i+ii}(i8ii(iXiCi(iiia(iMi+i(i?ii(i-ipio(ii6i(iOi+i(i3ii(ii4i(iiqi<(iKi!i=[(iiki@(i_i8i(iii(i^ii/(i^i'i(iii.(i7igi>(iii/(ii(i(iiji?(i^ii+(iii+(iiji?(ii3ic(i_ii2(iixi;(isi#i(iciki@(iici<(iZii.(ihii2(iiSi:(iciSi:(i%i;iM(iici<(iiki@(iYiRi9(ii)i5(iii/(i)i.i(i{ici<(imi i(iVi8i{(iii+(iBiRi9(iii(iii(ii3ic(iixi;(i\iqiC(i6ini\(isi=i(ihiHi(ici3i6(ipigi>(iii+(iii.(i"ifi/(iii,(iyibi(iii1(iixi;(iYiDi-(i\ii0(i%iRiO(iIilif(ii7i(iii(iii(ii5iY(iifi(i{ii/(iLi`ik(ii)i5(iWiRiO(icii,(iEiie(iUi[iz(ifi%i(iii1(idiji?(iii,(i{ii+(i\i7i7(iii(ii3i6(iniRiO(iNibin(ii<i (iiji?(iiniB(ii3i6(iisi(iii(ipi7i7(i7iqiC(iai4i(iiSi:(ii,i8(iii,(iici<(iiqiC(i\igi>(iZi,i8(iiniB(i6ixi;(iiji?(ipii0(ili?i(iii(igi:i(ii-i(iii+(iiki@(iii,(iifia(iici<(iii1(iidi(iii(ipiqiC(i_iji?(i5imiZ(iini(iiRiG(iii/(ii0i(iibi(iii/(icii1(iPiCip(i^ici<(i)iniT(iici<(iiSi:(i-ioiW(iViji?(i7ii0(ihiwi(iii+(iii(ifi.i(ii3i6(iVii/(iici<(ili i(iZii,(igixi(ii,i8(iini(ii7i7(iiji?(ipi3i6(iiUi(iii(icigi>(iiji?(ii)i5(iVii+(ii,i8(ipii,(ii ir(iiRi(iixi;(iigi>(i_ii/(iiDi-(iiji?(i(iRiS(i_ii+(iii.(iii0(iQiRiO(isii(ihiDi-(iii.(i7iSi:(ihiFi(iii(ii5iY(iizi(ii$i(iii2(ipiki@(ihiRi9(iini(iiqiC(i\ii1(iBi.i(iihi(iii.(ii)i5(iii0(iii(iii(iii(iibi(iiui(i7i3i6(iBii2(iBii3(iii3(iii+(iixi;(i7ii,(iibi(idici<(ipiSi:(ii)i5(iYii3(i6i,i8(iii.(ii(i(iii(ii4i(ii7i7(i{ii1(iii/(iciqiC(iiCi(iici<(iBiwi`(i ini%(idii/(iifi(ii,i8(idii+(iiji?(i{iji?(ii.i(i'iRi9(ii,i8(i\iSi:(imi?i(ii8i(i7i7i7(i\iki@(iigi>(iiji?(iini(ii7id(ipii1(i`i4i(iiqiC(ii/i (ici7i7(ii2i (iigi>(iifi (i\ii,(iiAi(ii8i(iiRi'(i ifi&(i_ici<(iii(iii0(iiji?(ihi0i(i6ii.(ii3i(ii7id(iiiq(ii3i6(iini(iii+(ii*i(icii0(iii(i'iDi-(iQi ir(iiniB(iiRiO(ii7id(i7ii](iiUi(ii,i8(i^iji?(iiji?(iZini\(ii4i(iii+(ii7i7(ihici<(i\i3i6(ii3i6(iiqiC(i_i3i6(i"i.i(iijim(ijibi(iiqiC(iiXi(iiki@(i}i4i(idii1(ii)i5(iiwi(iiwi(iti4i(i{igi>(iViwi}(iigi>(i iRiH(ipii+(iiji?(iii3(ii.i(iVi3i6(i'ixi;(i\ici<(ii,i8(iiUi(i-i7id(i_ii,(iiSi:(ii`i(iiwi!(ipii/(iii+(iiDi-(ii7i7(iiRi(iBi,i8(i&iniQ(iixi(iibi(ii7i7(iiji?(iViSi:(iiRi(i6ii2(i6ii3(iiwi(ii3i6(iigi>(i_iki@(iii0(ii\i(iii1(i_iSi:(iii,(iii0(i)ifi5(ii,i8(iii0(iii(ii^i(ii3i(ififi(ihini(iigi>(iViki@(i7ii/(iiAi(iii1(iii,(ii+i(iVii1(ii7i7(iii+(ihii(i^ii0(iLiDi-(iii0(iiki@(iQixis(i{iqiC(i7ici<(ii4i(iiti(ii-i(iiki@(idii,(iigi>(i ii!(iciji?(ii7i(iigi>(iii.(ii7i7(ii0i(iigi>(iiDi-(idi3i6(iii(iiji?(iii0(iiSi:(i_ii1(iiniB(ipiDi-(iii2(iiqiC(iiSi:(iZiDi-(igiRiO(iii(iii(ii3ic(iiqiC(iiyi(iiyi(ipici<(iii.(ii7i(iei i(ii3i6(i{i7i7(i\ii+(iiRi9(ii0i(ii3i6(ipii3(iiQi(iii2(ii<i (iii+(iii0(iiqiC(iiFi(i i7id(iii,(i^iqiC(iii(i{ii0(i i&i(iiki@(iii(iiHi(iSiViw(iiPi(iiNi)(ii7i7(idiki@(ihixi;(iini (iii1(iiiX(i^ii3(iii3(iii2(iYii.(ii,i8(ii3i6(iQiuiu(i6iRi9(iii(iiji?(i&i4i3(idii0(isi9i(iiqiC(iBiniB(ii_i=(ii"i*(ii,i8(ii i(iiqiC(i^ii,(iiSi:(i{iki@(iiRi(ii3i(iBifia(ii$i(i^i3i6(ii3i6(i\iji?(iiwi(iiii(iiki@(i{iSi:(i|i4i(i\i)i5(iLiij(inixiP(iii,(iLixi;(ihi,i8(iii.(iii,(ii,i8(iii(ii3i(i{i3i6(ii7i7(iii+(ii!i$(ii3ic(iii(iii/(iii1(iiki@(iiAi(iiSi:(i i3ic(iii0(iiwi(iii1(iiiX(icii/(idiqiC(iii1(iiUi(icii+(i6iDi-(iQiLit(ii3i6(i{ii,(iiki@(iii2(iici<(i/i4i6(i^iki@(iifi(iKidii(iii0(i_i7i7(iii3(iigi>(iVii0(i7iji?(iBixi;(ii.i(i^ii1(iiwi(iii1(iiki@(iYixi;(ii2i (iZii2(iZii3(iiqiC(ihii.(ibiYi(iiDi-(ii/i (iiki@(iigi>(i i.i(ii3ic(iiHi(iiSi:(iii+(ifiai(iii/(iiSi:(i_ii0(iii1(iiHi(iici<(i^igi>(iiRi9(iVi7i7(iNiMih(i-i3ic(ihi)i5(iini(ii4i(iii/(ii,i8(iii(iii/(iii.(i_iqiC(ii.i(ii3i6(iiRi(iWixi~(ii i(ii3i6(ipiji?(iii"(iiil(ii7i7(ii7i7(ii)i5(iii/(iRiRiv(ii*i(iii1(iiDi-(ieiRi(iiJi(ii,i8(iiRi9(iii.(i%ixiP(iiSi:(ii7i(iViqiC(ii3i6(idigi>(ii4i(iiDi-(iii0(iii,(iiDi-(ibiRi(i'iViR(icii.(ihii,(iii(ii&i(i\iniB(iiji?(ii,i8(i iQi(iYigi>(iisi (iiniB(iBigi>(ihii(iiyi(iixi;(i7iRi9(iii(ii,i8(i^i,i8(iiji?(ihi3i6(iiRi(iiwi(iifi(iibi(i\ii2(iici<(iwiRi(ii,i8(i_iniB(iiji?(i{i,i8(iiji?(ii)i5(ihiSi:(iii2(idixi;(i7iDi-(iii.(iiqiC(i$i.i(ii(i(iiwi(ii4i(iii.(ihiki@(ipiRi9(ii'i4(iii.(iViniB(icii3(icii2(izi.i(ii)i5(iiCi(iiRi(iii3(iii(iiSi:(ii,i8(iici<(i\iRi9(iiEi(iii.(iii/(ii@i(i^ii.(ii)i5(iZii+(iini(iiiX(iBiqiC(i}i3ic(iVigi>(ihii(iZii/(iisi(iii3(iYiqiC(ihii1(iixi;(iii+(iLiRi9(iimiZ(i6iji?(i^i)i5(iii.(i i3ic(iipi(i iBi (ii3ic(i!iDiI(i5i5iY(iizi(iiei(iiwiD(iii3(iii2(iii(ii,i8(i!iRiJ(iii/(i_ixi;(i{i)i5(iBi7i7(iii.(iii3(iii2(ii]i(iYi7i7(iii+(iYici<(idini\(iiRi9(iVixi;(iBii0(i{ii.(ii7i(iii.(iYii0(ii)i5(i\iDi-(isiKi(iii(i%ifi2(iii(ii,i8(iici<(iiRi9(iixi;(iYiki@(idii.(iibi'(iixi;(i_i,i8(iiqiC(i{iniB(i}i7id(iBiki@(i_ii3(ii i#(ii[i(iii(iIinig(iici<(i i7id(idi)i(ihi*i(iVi,i8(i`i7id(isiTi(iBiSi:(ii|iE(ii7id(iisi (iiniB(iiji?(iYiSi:(ipii2(ihii3(iixi;(iciRi9(iiniB(iici<(ii)i5(i@ini_(iciDi-(i6ii+(iBi3i6(i'ii4(iDi[ib(i2iiX(ii)i5(iZici<(i6ii/(iiGi(iYi3i6(iii(ii,i8(ii(i(iLijim(ii i (i^iniB(iiniB(iZiji?(i\ii/(ihigi>(iii.(iiZi(iici<(iYii,(i=ibi^(ii3i(iii.(i7ii3(i7ii2(iiDi-(iiji?(ii>i(iBii,(iixis(iii(iiRi9(iimiZ(i{ixi;(i_i)i5(iixi;(ii4i(iVii.(ii4i(ii7id(iBiDi-(ii.i(i^iSi:(iiDi-(iTiRix(i,iniV(i$iWiL(ihii0(iBii.(iiDi-(iiRi9(i_ii.(idi,i8(iVi)i5(iii+(i6ici<(iii/(ihi7i7(iiniB(iii(iixi;(iii+(ii.i(ii,i8(iixi;(iii.(i ini$(ii)i5(iZixi;(iiWi(iiDi-(iii(ii4i(itibi(ii6i(ii@i(iii/(ipiwi(ii,i8(ii,i8(iiiX(iibi(i"iRiK(iBii1(i^ixi;(iixi;(iVimi|(iiRi9(ii7id(iiRi9(iiFi(iii(iYii(iiRix(iii/(iii,(iiMih(i)i}iU(ii i(icini\(iVii2(iVii3(ipixi;(iii0(iiRi9(iiDi-(iZii0(iQiiq(iixi;(i$ifi1(ii7id(i6iSi:(iiwi(ipi,i8(iici<(i6iki@(iiqiC(ii7i7(iiDi-(iLiil(i^i7i7(i{iRi9(iiUi(ii.i(iixi;(iii1(iibi(iZi7i7(iii(ii7id(izifi(iiRiF(iii(i{iDi-(ii4i,(iii0(iii(i6ii,(iiCi(i%iIiN(i7i,i8(i\ii.(iBi)i5(iixi;(iici<(iiRi9(ii3i(iii1(i^iRi9(iigi>(iZiRi9(idi7i7(iBii/(iibi(iYii+(ii(i(ihii(ii7i7(iiqiC(iYii/(ii7id(i i4i.(izi2i(ii.i(iiNi(ihi(i(iii3(iii2(iiBi(iZiqiC(iiDi-(ili{i(iii.(iii1(i6i3i6(iiRi9(iini(iBii+(ii0i(ii3ic(icixi;(iiRi9(iiRi9(idii2(idii3(ipi)i5(iiSi:(iii(iii(iiji?(iNidio(iiniB(iBici<(iiwi (iii(iiDi-(iiki@(iiOi(ii4i(iiri%(iii,(ii\i(isi i(iiSi:(ipii.(iii(iiRi9(iixi;(i%i.i(iigi>(iisi(iiji(iiHi(iini(i!i7id(iVici<(ini;i(iiji?(iiFi(iiDi-(i\iwi`(iii,(iiRiO(i_iwi(iiDi-(ii3i6(i6ii[(iiniB(iisi(iiEi(iiki@(i7ii+(iKiMih(iii/(iiei(iii2(iii3(iii,(ihiji?(iZigi>(ii3ic(ii3i6(i{ii2(iDi3ic(i\i,i8(i2i4i8(iigi>(i7ii.(iii3(ii*i(iiSi:(ihii+(iiwi(iii1(iiGi(iiPi(ii7id(iiwi(ii i (iii(iii3(iii2(i^ii2(i_iDi-(iiqiC(ii)i5(i^iDi-(iZii(ihii/(ii7i7(ii1i (i7ini\(iii2(iViDi-(iibi(iiUi(ii4i(i7iki@(iiRi9(i6igi>(ivini(ii,i8(iii3(iii2(ii7id(iiqiC(ii1i (iii0(iiRi&(iii.(i\ixi;(iiniB(i!i3ic(iTiiiy(i\ii3(i`i3ic(iiRi)(ihiqiC(iii1(iii(iiUi(ici,i8(iiPi(ii.i(ii7i7(iViRi9(ipiniB(iiki@(iixi;(iii.(iii2(iii3(iii0(imi{i(iiDi-(iiCi(iiii(i{ii3(ii*i(iii(iYi,i8(iiiX(iifi*(iDi7id(ii7i7(ii7id(iini(iVii,(iifi#(iii0(ii)i5(iiFi(i_iRi9(ii4i+(icici<(iYiji?(i{iwi(ii4i(iigi>(iini(iifi(iyi4i(iiki@(iii,(ii&i((ii*i(iiSi:(iii(iiUi(iYini\(i_igi>(i1i4i7(i7ixi;(iBiji?(ii,i8(ii3ic(iii,(iii,(iigi>(iiRi9(idiDi-(ii3i6(ii7i7(iiRi9(ii3ic(iiki@(iiji?(iii(iiRi9(iZi3i6(iiwi (iimiA(i6iqiC(iiDi-(iiFi(iini(iini(ici)i(iiwi(iigi>(iYii2(iiSi:(i6ii0(ii.i(iii.(iii2(iii3(iZiSi:(idiRi9(ii7i(iifi((idiSi:(i#i4i0(iiji?(iZiki@(iii2(iii3(iiRix(i^iwiD(iiwi-(ii4i(iii2(iii3(ii3ic(ii0i(ii)i5(iii(iii/(ii3ic(iini"(i6i7i7(isstatement_listiZope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/sqlbind.py100644 1007 1403 33236 6747630576 25272 0ustar petrillipetrilli"""rule bindings for sql grammar.""" def elt0(list, context): """return first member of reduction""" return list[0] def elt1(list, context): """return second member""" return list[1] def elt2(list, context): return list[2] def returnNone(list, context): return None def stat1(list, context): """return list of len 1 of statements""" return list #def statn(list, context): # """return a list of statement reductions""" # [stat, semi, statlist] = list # statlist.insert(0, stat) # return statlist def thingcommalist(l, c): [thing, comma, list] = l list.insert(0, thing) return list def listcommathing(l, c): [list, comma, thing] = l list.append(thing) return list statn = thingcommalist selstat = elt0 insstat = elt0 createtablestat = elt0 droptablestat = elt0 delstat = elt0 updatestat = elt0 createindexstat = elt0 dropindexstat = elt0 createviewstat = elt0 dropviewstat = elt0 # drop view statement stuff def dropview(l, c): [drop, view, name] = l from sqlsem import DropView return DropView(name) # create view statement stuff def createview(l, c): [create, view, name, namelist, as, selection] = l from sqlsem import CreateView return CreateView(name, namelist, selection) optnamelist0 = returnNone optnamelistn = elt1 # drop index statement stuff def dropindex(l, c): [drop, index, name] = l from sqlsem import DropIndex return DropIndex(name) # create index statement stuff def createindex(l, c): [create, index, name, on, table, op, namelist, cp] = l from sqlsem import CreateIndex return CreateIndex(name, table, namelist) def createuniqueindex(l, c): [create, unique, index, name, on, table, op, namelist, cp] = l from sqlsem import CreateIndex return CreateIndex(name, table, namelist, unique=1) names1 = stat1 namesn = listcommathing # update statement stuff def update(l, c): [upd, name, set, assns, condition] = l from sqlsem import UpdateOp return UpdateOp(name, assns, condition) def assn(l, c): [col, eq, exp] = l return (col, exp) def assn1(l, c): [ (col, exp) ] = l from sqlsem import TupleCollector result = TupleCollector() result.addbinding(col, exp) return result def assnn(l, c): [ result, comma, (col, exp) ] = l result.addbinding(col, exp) return result # delete statement stuff def deletefrom(l, c): [delete, fromkw, name, where] = l from sqlsem import DeleteOp return DeleteOp(name, where) # drop table stuff def droptable(l, c): [drop, table, name] = l from sqlsem import DropTable return DropTable(name) # create table statement stuff def createtable(list, context): [create, table, name, p1, colelts, p2] = list from sqlsem import CreateTable return CreateTable(name, colelts) colelts1 = stat1 coleltsn = listcommathing #def coleltsn(list, c): # [c1, cc, ce] = list # c1.append(ce) # return c1 coleltid = elt0 coleltconstraint = elt0 def coldef(l, c): [colid, datatype, default, constraints] = l from sqlsem import ColumnDef return ColumnDef(colid, datatype, default, constraints) optdef0 = returnNone optcolconstr0 = returnNone stringtype = exnumtype = appnumtype = integer = float = varchar = elt0 varcharn = elt0 # insert statement stuff def insert1(l, c): [insert, into, name, optcolids, insert_spec] = l from sqlsem import InsertOp return InsertOp(name, optcolids, insert_spec) optcolids0 = returnNone optcolids1 = elt1 colids1 = stat1 colidsn = listcommathing def insert_values(l, c): from sqlsem import InsertValues return InsertValues(l[2]) def insert_query(l, c): from sqlsem import InsertSubSelect return InsertSubSelect(l[0]) litlist1 = stat1 litlistn = listcommathing sliteral0 = elt0 def sliteralp(l, c): [p, v] = l return +v def sliterald(l, c): [l1, m, l2] = l return l1 - l2 def sliterals(l, c): [l1, p, l2] = l return l1 + l2 def sliteralm(l, c): [m, v] = l return -v # select statement stuff def selectx(list, context): [sub, optorder_by] = list #sub.union_select = optunion sub.order_by = optorder_by # number of dynamic parameters in this parse. sub.ndynamic = context.ndynamic() return sub psubselect = elt1 def subselect(list, context): [select, alldistinct, selectlist, fromkw, trlist, optwhere, optgroup, opthaving, optunion] = list from sqlsem import Selector sel = Selector( alldistinct, selectlist, trlist, optwhere, optgroup, opthaving, # store # of dynamic parameters seen in this parse. ndynamic = context.ndynamic() ) sel.union_select = optunion return sel def ad0(list, context): return "ALL" adall = ad0 def addistinct(list, context): return "DISTINCT" def where0(list, context): from sqlsem import BTPredicate return BTPredicate() # true where1 = elt1 group0 = returnNone group1 = elt2 colnames1 = stat1 colnamesn = listcommathing having0 = returnNone having1 = elt1 union0 = returnNone def union1(l, c): [union, alldistinct, selection] = l from sqlsem import Union return Union(alldistinct, selection) def except1(l, c): [union, selection] = l alldistinct = "DISTINCT" from sqlsem import Except return Except(alldistinct, selection) def intersect1(l, c): [union, selection] = l alldistinct = "DISTINCT" from sqlsem import Intersect return Intersect(alldistinct, selection) order0 = returnNone order1 = elt2 #orderby = elt2 sortspec1 = stat1 sortspecn = listcommathing def sortint(l, c): from sqlsem import PositionedSort [num, ord] = l from types import IntType if type(num)!=IntType or num<=0: raise ValueError, `num`+': col position not positive int' return PositionedSort(num, ord) def sortcol(l, c): from sqlsem import NamedSort [name, ord] = l return NamedSort(name, ord) def optord0(l, c): return "ASC" optordasc = optord0 def optorddesc(l, c): return "DESC" ## table reference list returns list of (name, name) or (name, alias) def trl1(l, c): [name] = l return [(name, name)] def trln(l,c): [name, comma, others] = l others.insert(0, (name, name)) return others def trl1a(l,c): [name, alias] = l return [(name, alias)] def trlna(l,c): [name, alias, comma, others] = l others.insert(0, (name, alias)) return others def trl1as(l,c): [name, as, alias] = l return [(name, alias)] def trlnas(l,c): [name, as, alias, comma, others] = l others.insert(0, (name, alias)) return others tablename1 = elt0 columnid1 = elt0 def columnname1(list, context): [ci] = list return columnname2([None, None, ci], context) def columnname2(list, context): [table, ignore, col] = list from sqlsem import BoundAttribute return BoundAttribute(table, col) def dynamic(list, context): from sqlsem import BoundAttribute # return a new dynamic parameter int = context.param() return BoundAttribute(0, int) # expression stuff def literal(list, context): [lit] = list from sqlsem import Constant return Constant(lit) def stringstring(l, c): """two strings in sequence = apostrophe""" [l1, l2] = l from sqlsem import Constant value = "%s'%s" % (l1.value0, l2) return Constant(value) numlit = literal stringlit = literal primarylit = elt0 primary1 = elt0 factor1 = elt0 term1 = elt0 exp1 = elt0 def expplus(list, context): [exp, plus, term] = list return exp + term def expminus(list, context): [exp, minus, term] = list return exp - term def termtimes(list, context): [exp, times, term] = list return exp * term def termdiv(list, context): [exp, div, term] = list return exp / term plusfactor = elt1 def minusfactor(list, context): [minus, factor] = list return -factor primaryexp = elt1 primaryset = elt0 def countstar(l, c): from sqlsem import Count return Count("*") def distinctset(l, c): [agg, p1, distinct, exp, p2] = l return set(agg, exp, 1) distinctcount = distinctset def allset(l, c): [agg, p1, exp, p2] = l return set(agg, exp, 0) allcount = allset def set(agg, exp, distinct): import sqlsem if agg=="AVG": return sqlsem.Average(exp, distinct) if agg=="COUNT": return sqlsem.Count(exp, distinct) if agg=="MAX": return sqlsem.Maximum(exp, distinct) if agg=="MIN": return sqlsem.Minimum(exp, distinct) if agg=="SUM": return sqlsem.Sum(exp, distinct) if agg=="MEDIAN": return sqlsem.Median(exp, distinct) raise NameError, `agg`+": unknown aggregate" average = count = maximum = minimum = summation = median = elt0 def predicateeq(list, context): [e1, eq, e2] = list return e1.equate(e2) def predicatene(list, context): [e1, lt, gt, e2] = list return ~(e1.equate(e2)) def predicatelt(list, context): [e1, lt, e2] = list return e1.lt(e2) def predicategt(list, context): [e1, lt, e2] = list return e2.lt(e1) def predicatele(list, context): [e1, lt, eq, e2] = list return e1.le(e2) def predicatege(list, context): [e1, lt, eq, e2] = list return e2.le(e1) def predbetween(list, context): [e1, between, e2, andkw, e3] = list from sqlsem import BetweenPredicate return BetweenPredicate(e1, e2, e3) def prednotbetween(list, context): [e1, notkw, between, e2, andkw, e3] = list from sqlsem import BetweenPredicate return ~BetweenPredicate(e1, e2, e3) predicate1 = elt0 bps = elt1 bp1 = elt0 # exists predicate stuff predexists = elt0 def exists(l, c): [ex, paren1, subquery, paren2] = l from sqlsem import ExistsPred return ExistsPred(subquery) def notbf(list, context): [ notst, thing ] = list return ~thing # quantified predicates nnall = elt0 nnany = elt0 def predqeq(list, context): [exp, eq, allany, p1, subq, p2] = list from sqlsem import QuantEQ, QuantNE if allany=="ANY": return QuantEQ(exp, subq) else: return ~QuantNE(exp, subq) def predqne(list, context): [exp, lt, gt, allany, p1, subq, p2] = list from sqlsem import QuantEQ, QuantNE if allany=="ANY": return QuantNE(exp, subq) else: return ~QuantEQ(exp, subq) def predqlt(list, context): [exp, lt, allany, p1, subq, p2] = list from sqlsem import QuantLT, QuantGE if allany=="ANY": return QuantLT(exp, subq) else: return ~QuantGE(exp, subq) def predqgt(list, context): [exp, gt, allany, p1, subq, p2] = list from sqlsem import QuantGT, QuantLE if allany=="ANY": return QuantGT(exp, subq) else: return ~QuantLE(exp, subq) def predqle(list, context): [exp, less, eq, allany, p1, subq, p2] = list from sqlsem import QuantGT, QuantLE if allany=="ANY": return QuantLE(exp, subq) else: return ~QuantGT(exp, subq) def predqge(list, context): [exp, gt, eq, allany, p1, subq, p2] = list from sqlsem import QuantGE, QuantLT if allany=="ANY": return QuantGE(exp, subq) else: return ~QuantLT(exp, subq) # subquery expression def subqexpr(list, context): [p1, subq, p2] = list from sqlsem import SubQueryExpression return SubQueryExpression(subq) def predin(list, context): [exp, inkw, p1, subq, p2] = list from sqlsem import InPredicate return InPredicate(exp, subq) def prednotin(list, context): [exp, notkw, inkw, p1, subq, p2] = list from sqlsem import InPredicate return ~InPredicate(exp, subq) def predinlits(list, context): [exp, inkw, p1, lits, p2] = list from sqlsem import InLits return InLits(exp, lits) def prednotinlits(list, context): [exp, notkw, inkw, p1, lits, p2] = list from sqlsem import InLits return ~InLits(exp, lits) bf1 = elt0 def booln(list, context): [ e1, andst, e2 ] = list return e1&e2 bool1 = elt0 def searchn(list, context): [ e1, orst, e2 ] = list return e1 | e2 search1 = elt0 colalias = elt0 # select list stuff def selectstar(l,c): return "*" selectsome = elt0 select1 = elt0 # selectsub returns (expression, asname) def select1(list, context): [ (exp, name) ] = list from sqlsem import TupleCollector result = TupleCollector() result.addbinding(name, exp) return result def selectn(list, context): [ selectsubs, comma, select_sublist ] = list (exp, name) = select_sublist selectsubs.addbinding(name, exp) return selectsubs def selectit(list, context): [exp] = list return (exp, None) # no binding! def selectname(list, context): [exp, as, alias] = list return (exp, alias) colalias = elt0 #### do the bindings. # note: all reduction function defs must precede this assign VARS = vars() class punter: def __init__(self, name): self.name = name def __call__(self, list, context): print "punt:", self.name, list return list class tracer: def __init__(self, name, fn): self.name = name self.fn = fn def __call__(self, list, context): print self.name, list return self.fn(list, context) def BindRules(sqlg): for name in sqlg.RuleNameToIndex.keys(): if VARS.has_key(name): #print "binding", name sqlg.Bind(name, VARS[name]) # nondebug #sqlg.Bind(name, tracer(name, VARS[name]) ) # debug else: print "unbound", name sqlg.Bind(name, punter(name)) return sqlg Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/sqlgen.py100644 1007 1403 4064 6747630576 25104 0ustar petrillipetrilli"""grammar generation stuff for sql. This module does not bind any rule semantics, it just generates the parser data structures. """ ### interpretation functions and regexen for terminals MARSHALFILE = "sql.mar" import string alphanum = string.letters+string.digits + "_" userdefre = "[%s][%s]*" % (string.letters +"_", alphanum) commentre = "--.*" def userdeffn(str): from string import upper return upper(str) charstre = "'[^\n']*'" def charstfn(str): return str[1:-1] #numlitre = "[%s][%s\.]*" % (string.digits, alphanum) # not really... digits = string.digits # rely in python to filter out the good/bad/ugly intre = "[%s][%s.jJ]*" % (digits,digits) numlitre = "%s\([Ee][+-]?%s\)?" % (intre, intre) def numlitfn(str): """Note: this is "safe" because regex filters out dangerous things.""" return eval(str) def DeclareTerminals(Grammar): Grammar.Addterm("user_defined_name", userdefre, userdeffn) Grammar.Addterm("character_string_literal", charstre, charstfn) Grammar.Addterm("numeric_literal", numlitre, numlitfn) def BuildSQL(filename=MARSHALFILE): import kjParseBuild from sqlgram import sqlrules, nonterms, keywords, puncts SQLG = kjParseBuild.NullCGrammar() SQLG.SetCaseSensitivity(0) DeclareTerminals(SQLG) SQLG.Keywords(keywords) SQLG.punct(puncts) SQLG.Nonterms(nonterms) SQLG.comments([commentre]) # should add comments SQLG.Declarerules(sqlrules) print "working..." SQLG.Compile() print "testing" from sqlgtest import test for x in test: print SQLG.DoParse1(x) print "dumping to", filename outfile = open(filename, "wb") SQLG.MarshalDump(outfile) outfile.close() return SQLG def reloadSQLG(filename=MARSHALFILE): """does not bind any interpretation functions.""" import kjParser infile = open(filename, "rb") SQLG = kjParser.UnMarshalGram(infile) infile.close() DeclareTerminals(SQLG) return SQLG def getSQL(): from sqlwhere import filename return reloadSQLG(filename) Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/sqlgram.py100644 1007 1403 25147 6747630576 25306 0ustar petrillipetrilli # sql grammar, partial, based on ODBC 2.0 programmer's ref ## someday add subquery precedence to allow more general selects. sqlrules = """ statement_list :: @R stat1 :: statement_list >> statement @R statn :: statement_list >> statement ; statement_list @R dropindexstat :: statement >> drop_index_statement @R createindexstat :: statement >> create_index_statement @R selstat :: statement >> select_statement @R insstat :: statement >> insert_statement @R createtablestat :: statement >> create_table_statement @R droptablestat :: statement >> drop_table_statement @R delstat :: statement >> delete_statement_searched @R updatestat :: statement >> update_statement_searched @R createviewstat :: statement >> create_view_statement @R dropviewstat :: statement >> drop_view_statement ## drop view statement @R dropview :: drop_view_statement >> DROP VIEW user_defined_name ## create view statement @R createview :: create_view_statement >> CREATE VIEW user_defined_name optnamelist AS select_statement @R optnamelist0 :: optnamelist >> @R optnamelistn :: optnamelist >> ( namelist ) ## drop index statement @R dropindex :: drop_index_statement >> DROP INDEX user_defined_name ## create index statement @R createindex :: create_index_statement >> CREATE INDEX user_defined_name ON user_defined_name ( namelist ) @R createuniqueindex :: create_index_statement >> CREATE UNIQUE INDEX user_defined_name ON user_defined_name ( namelist ) @R names1 :: namelist >> user_defined_name @R namesn :: namelist >> namelist , user_defined_name ## update statement @R update :: update_statement_searched >> UPDATE user_defined_name SET assns optwhere @R assn1 :: assns >> assn @R assnn :: assns >> assns , assn @R assn :: assn >> column_identifier = expression ##### ## delete statement @R deletefrom :: delete_statement_searched >> DELETE FROM user_defined_name optwhere ## drop table @R droptable :: drop_table_statement >> DROP TABLE user_defined_name ## create table statement ( restricted ) @R createtable :: create_table_statement >> CREATE TABLE user_defined_name ( colelts ) @R colelts1 :: colelts >> colelt @R coleltsn :: colelts >> colelts , colelt @R coleltid :: colelt >> column_definition @R coleltconstraint :: colelt >> column_constraint_definition ## column constraints deferred @R coldef :: column_definition >> column_identifier data_type optdefault optcolconstraints ## optdefault deferred @R optdef0 :: optdefault >> ## optcolconstraint deferred @R optcolconstr0 :: optcolconstraints >> @R stringtype :: data_type >> character_string_type @R exnumtype :: data_type >> exact_numeric_type @R appnumtype :: data_type >> approximate_numeric_type @R integer :: exact_numeric_type >> INTEGER @R float :: approximate_numeric_type >> FLOAT @R varchar :: character_string_type >> VARCHAR @R varcharn :: character_string_type >> VARCHAR ( numeric_literal ) ## insert statement @R insert1 :: insert_statement >> INSERT INTO table_name optcolids insert_spec @R optcolids0 :: optcolids >> @R optcolids1 :: optcolids >> ( colids ) @R colids1 :: colids >> column_identifier @R colidsn :: colids >> colids , column_identifier @R insert_values :: insert_spec >> VALUES ( litlist ) @R insert_query :: insert_spec >> sub_query @R litlist1 :: litlist >> sliteral @R litlistn :: litlist >> litlist , sliteral @R sliteral0 :: sliteral >> literal @R sliteralp :: sliteral >> + literal ## hack to permit complexes @R sliterals :: sliteral >> sliteral + literal @R sliterald :: sliteral >> sliteral - literal @R sliteralm :: sliteral >> - literal ## select statement @R subselect :: sub_query >> SELECT alldistinct select_list FROM table_reference_list optwhere optgroup opthaving optunion ## @R psubselect :: sub_query >> ( sub_query ) @R selectx :: select_statement >> sub_query optorder_by @R ad0 :: alldistinct >> @R adall :: alldistinct >> ALL @R addistinct :: alldistinct >> DISTINCT @R where0 :: optwhere >> @R where1 :: optwhere >> WHERE search_condition @R group0 :: optgroup >> @R group1 :: optgroup >> GROUP BY colnamelist @R colnames1 :: colnamelist >> column_name @R colnamesn :: colnamelist >> colnamelist , column_name @R having0 :: opthaving >> @R having1 :: opthaving >> HAVING search_condition @R union0 :: optunion >> @R union1 :: optunion >> UNION alldistinct sub_query @R except1 :: optunion >> EXCEPT sub_query @R intersect1 :: optunion >> INTERSECT sub_query @R order0 :: optorder_by >> @R order1 :: optorder_by >> ORDER BY sortspeclist ##@R orderby :: order_by_clause >> ORDER BY sortspeclist @R sortspec1 :: sortspeclist >> sort_specification @R sortspecn :: sortspeclist >> sortspeclist , sort_specification ## really, should be unsigned int @R sortint :: sort_specification >> numeric_literal opt_ord @R sortcol :: sort_specification >> column_name opt_ord @R optord0 :: opt_ord >> @R optordasc :: opt_ord >> ASC @R optorddesc :: opt_ord >> DESC ## table reference list (nasty hack alert) @R trl1 :: table_reference_list >> user_defined_name @R trln :: table_reference_list >> user_defined_name , table_reference_list @R trl1a :: table_reference_list >> user_defined_name user_defined_name @R trlna :: table_reference_list >> user_defined_name user_defined_name , table_reference_list @R trl1as :: table_reference_list >> user_defined_name AS user_defined_name @R trlnas :: table_reference_list >> user_defined_name AS user_defined_name , table_reference_list ## select list @R selectstar :: select_list >> * @R selectsome :: select_list >> selectsubs @R select1 :: selectsubs >> select_sublist @R selectn :: selectsubs >> selectsubs , select_sublist @R selectit :: select_sublist >> expression @R selectname :: select_sublist >> expression AS column_alias @R colalias :: column_alias >> user_defined_name ## search condition @R search1 :: search_condition >> boolean_term @R searchn :: search_condition >> boolean_term OR search_condition @R bool1 :: boolean_term >> boolean_factor @R booln :: boolean_term >> boolean_factor AND boolean_term @R bf1 :: boolean_factor >> boolean_primary @R notbf :: boolean_factor >> NOT boolean_primary @R bp1 :: boolean_primary >> predicate @R bps :: boolean_primary >> ( search_condition ) ## predicate (simple for now!!!) @R predicate1 :: predicate >> comparison_predicate ## comparison predicate (simple for now!!!) @R predicateeq :: comparison_predicate >> expression = expression @R predicatelt :: comparison_predicate >> expression < expression @R predicategt :: comparison_predicate >> expression > expression @R predicatele :: comparison_predicate >> expression < = expression @R predicatege :: comparison_predicate >> expression > = expression @R predicatene :: comparison_predicate >> expression < > expression @R predbetween :: comparison_predicate >> expression BETWEEN expression AND expression @R prednotbetween :: comparison_predicate >> expression NOT BETWEEN expression AND expression ## exists predicate @R predexists :: predicate >> exists_predicate @R exists :: exists_predicate >> EXISTS ( sub_query ) ## quantified predicate @R predqeq :: predicate >> expression = allany ( sub_query ) @R predqne :: predicate >> expression < > allany ( sub_query ) @R predqlt :: predicate >> expression < allany ( sub_query ) @R predqgt :: predicate >> expression > allany ( sub_query ) @R predqle :: predicate >> expression < = allany ( sub_query ) @R predqge :: predicate >> expression > = allany ( sub_query ) @R nnall :: allany >> ALL @R nnany :: allany >> ANY ## in predicate @R predin :: predicate >> expression IN ( sub_query ) @R prednotin :: predicate >> expression NOT IN ( sub_query ) @R predinlits :: predicate >> expression IN ( litlist ) @R prednotinlits :: predicate >> expression NOT IN ( litlist ) ## subquery expression @R subqexpr :: expression >> ( sub_query ) ## expression (simple for now!!!) @R exp1 :: expression >> term @R expplus :: expression >> expression + term @R expminus :: expression >> expression - term @R term1 :: term >> factor @R termtimes :: term >> term * factor @R termdiv :: term >> term / factor @R factor1 :: factor >> primary @R plusfactor :: factor >> + factor @R minusfactor :: factor >> - factor @R primary1 :: primary >> column_name @R primarylit :: primary >> literal @R primaryexp :: primary >> ( expression ) @R primaryset :: primary >> set_function_reference @R stringlit :: literal >> character_string_literal @R stringstring :: literal >> literal character_string_literal @R numlit :: literal >> numeric_literal ## set functions (nasty hack!) @R countstar :: set_function_reference >> COUNT ( * ) @R distinctcount :: set_function_reference >> COUNT ( DISTINCT expression ) @R allcount :: set_function_reference >> COUNT ( expression ) @R distinctset :: set_function_reference >> aggregate ( DISTINCT expression ) @R allset :: set_function_reference >> aggregate ( expression ) @R average :: aggregate >> AVG ##@R count :: aggregate >> COUNT @R maximum :: aggregate >> MAX @R minimum :: aggregate >> MIN @R summation :: aggregate >> SUM @R median :: aggregate >> MEDIAN ## dynamic parameter (varies quite a bit from ODBC spec) @R dynamic :: literal >> ? ## column name @R columnname1 :: column_name >> column_identifier @R columnname2 :: column_name >> table_name . column_identifier @R tablename1 :: table_name >> user_defined_name @R columnid1 :: column_identifier >> user_defined_name """ nonterms = """ sliteral exists_predicate set_function_reference aggregate sortspeclist sort_specification opt_ord drop_table_statement delete_statement_searched update_statement_searched assns assn insert_statement litlist colelt optcolconstraints optdefault optcolids insert_spec create_table_statement colids colelts column_constraint_definition column_definition data_type character_string_type exact_numeric_type approximate_numeric_type expression term factor primary literal comparison_predicate column_alias column_identifier table_name boolean_term boolean_factor boolean_primary predicate selectsubs expression alias sub_query statement_list statement select_statement alldistinct subselect select_list table_reference_list optwhere optgroup opthaving order_by_clause select_sublist optunion optorder_by search_condition colnamelist column_name table_reference table_name create_index_statement namelist drop_index_statement allany create_view_statement drop_view_statement optnamelist """ keywords = """ INDEX ON ANY IN VIEW AS EXCEPT INTERSECT EXISTS AVG COUNT MAX MIN SUM MEDIAN UPDATE DROP DELETE FROM SET INSERT INTO VALUES CREATE TABLE INTEGER FLOAT VARCHAR AND OR NOT SELECT FROM WHERE HAVING GROUP BY UNION ALL DISTINCT AS ORDER ASC DESC BETWEEN UNIQUE """ puncts = """.,*;=<>{}()?+-/""" # terminals user_defined_name, character_string_literal, # numeric_literal Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/sqlgtest.py100644 1007 1403 1006 6747630577 25453 0ustar petrillipetrilli"test parses for sql grammar" test = [ "select a from x where b=c", "select distinct x.a from x where x.b=c", "select all a from x where b=c", "select a from x, y where b=c or x.d=45", "select a as k from x d, y as m where b=c", "select 1 as n, a from x where b=c", "select * from x", "select a from x where b=c", "select a from x where not b=c or d=1 and e=5", "select a from x where a=1 and (x.b=3 or not b=c)", "select -1 from x", "select -1e6j from x", "insert into table1 (a,b,c) values (-1e6+3j, -34e10, 56j)" ]Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/sqlmod.py100644 1007 1403 54236 6747630577 25141 0ustar petrillipetrilli"""Database modification statement semantics""" import sqlsem # ordering of ddef storage is important so, eg, index defs # follow table defs. class Ordered_DDF: """mixin for DDF statement sorting, subclass defines s.cmp(o)""" def __cmp__(self, other): try: #print "comparing", self.name, other.name try: sc = self.__class__ oc = other.__class__ #print sc, oc except: #print "punting 1", -1 return -1 if sc in ddf_order and oc in ddf_order: test = cmp(ddf_order.index(sc), ddf_order.index(oc)) #print "ddforder", test if test: return test return self.cmp(other) else: test = cmp(sc, oc) #print "punting 2", test return test except: #import sys #print "exception!" #print sys.exc_type, sys.exc_value return -1 def __coerce__(self, other): return (self, other) def cmp(self, other): """redefine if no name field""" return cmp(self.name, other.name) CTFMT = """\ CREATE TABLE %s ( %s )""" class CreateTable(Ordered_DDF): """create table operation""" def __init__(self, name, colelts): self.name = name self.colelts = colelts self.indb = None # db in which to create def initargs(self): return (self.name, []) def marshaldata(self): from sqlsem import serialize return map(serialize, self.colelts) def demarshal(self, args): from sqlsem import deserialize self.colelts = map(deserialize, args) def __repr__(self): from string import join elts = list(self.colelts) elts = map(repr, elts) return CTFMT % (self.name, join(elts, ",\n ")) def relbind(self, db): """check that table doesn't already exist""" if db.has_relation(self.name): raise NameError, "cannot create %s, exists" % (self.name,) self.indb = db return self def eval(self, dyn=None): "create the relation now" # datatypes currently happily ignored :) db = self.indb if db is None: raise ValueError, "unbound or executed" self.indb = None name = self.name if db.has_relation(self.name): raise NameError, "relation %s exists, cannot create" % (self.name,) db.touched = 1 attnames = [] for x in self.colelts: attnames.append(x.colid) from gfdb0 import Relation0 r = Relation0(attnames) # must store if new (unset for reloads) r.touched = 1 db[name] = r db.add_datadef(name, self) log = db.log if log is not None: log.log(self) viewfmt = """\ CREATE VIEW %s (%s) AS %s""" class CreateView(sqlsem.SimpleRecursive, Ordered_DDF): """CREATE VIEW name (namelist) AS selection""" # note: no check for cross-references on drops! def __init__(self, name, namelist, selection): self.name = name self.namelist = namelist self.selection = selection self.indb = None def __repr__(self): return viewfmt % (self.name, self.namelist, self.selection) def initargs(self): return (self.name, self.namelist, self.selection) def relbind(self, db): self.indb = db name = self.name if db.has_datadef(name): raise NameError, "(view) datadef %s exists" % name # don't bind the selection yet return self def eval(self, dyn=None): "create the view" db = self.indb name = self.name if db is None: raise ValueError, "create view %s unbound or executed" % name self.indb = None if db.has_relation(name): raise ValueError, "create view %s, name exists" % name db.touched = 1 from gfdb0 import View v = View(self.name, self.namelist, self.selection, db) db[name] = v db.add_datadef(name, self) log = db.log if log is not None: log.log(self) CREATEINDEXFMT = """\ CREATE %sINDEX %s ON %s ( %s )""" class CreateIndex(sqlsem.SimpleRecursive, Ordered_DDF): """create index operation""" def __init__(self, name, tablename, atts, unique=0): self.name = name self.tablename=tablename self.atts = atts self.indb = None self.target = None self.unique = unique def initargs(self): return (self.name, self.tablename, self.atts, self.unique) def __cmp__(self, other): oc = other.__class__ if oc is CreateTable: return 1 # after all create tables sc = self.__class__ if oc is not sc: return cmp(sc, oc) else: return cmp(self.name, other.name) def __coerce__(self, other): return (self, other) def __repr__(self): from string import join un = "" if self.unique: un="UNIQUE " innards = join(self.atts, ",\n ") return CREATEINDEXFMT % (un, self.name, self.tablename, innards) def relbind(self, db): name = self.name self.indb = db if db.has_datadef(name): raise NameError, `name`+": data def exists" try: self.target = db.get_for_update(self.tablename) #db[self.tablename] except: raise NameError, `self.tablename`+": no such relation" return self def eval(self, dyn=None): from gfdb0 import Index db = self.indb if db is None: raise ValueError, "create index unbound or executed" self.indb = None rel = self.target if rel is None: raise ValueError, "create index not bound to relation" db.touched = 1 self.the_index = the_index = Index(self.name, self.atts, unique=self.unique) rel.add_index(the_index) name = self.name db.add_datadef(name, self) db.add_index(name, the_index) log = db.log if log is not None: log.log(self) class DropIndex(sqlsem.SimpleRecursive): def __init__(self, name): self.name = name self.indb = None def initargs(self): return (self.name,) def __repr__(self): return "DROP INDEX %s" % (self.name,) def relbind(self, db): self.indb = db if not db.has_datadef(self.name): raise NameError, `self.name`+": no such index" return self def eval(self, dyn=None): db = self.indb self.indb=None if db is None: raise ValueError, "drop index executed or unbound" db.touched = 1 indexname = self.name createindex = db.datadefs[indexname] index = createindex.the_index relname = createindex.tablename rel = db[relname] rel.drop_index(index) db.drop_datadef(indexname) db.drop_index(indexname) log = db.log if log is not None: log.log(self) class DropTable(sqlsem.SimpleRecursive): def __init__(self, name): self.name = name self.indb = None def initargs(self): return (self.name,) def __repr__(self): return "DROP TABLE %s" % (self.name,) def relbind(self, db): self.indb = db name = self.name if not db.has_relation(name): raise NameError, `self.name` + ": cannot delete, no such table/view" self.check_kind(name, db) return self def check_kind(self, name, db): if db[name].is_view: raise ValueError, "%s is VIEW, can't DROP TABLE" % name def eval(self, dyn): db = self.indb if db is None: raise ValueError, "unbound or executed" db.touched = 1 self.indb = None self.relbind(db) name = self.name rel = db[name] rel.drop_indices(db) db.drop_datadef(name) del db[name] log = db.log if log is not None: log.log(self) class DropView(DropTable): """DROP VIEW name""" def __repr__(self): return "DROP VIEW %s" % self.name def check_kind(self, name, db): if not db[name].is_view: raise ValueError, "%s is TABLE, can't DROP VIEW" % name COLDEFFMT = "%s %s %s %s" class ColumnDef(sqlsem.SimpleRecursive): def __init__(self, colid, datatype, defaults, constraints): self.colid = colid self.datatype = datatype self.defaults = defaults self.constraints = constraints def initargs(self): return (self.colid, self.datatype, self.defaults, self.constraints) def __repr__(self): defaults = self.defaults if defaults is None: defaults="" constraints = self.constraints if constraints is None: constraints = "" return COLDEFFMT % (self.colid, self.datatype, defaults, constraints) def evalcond(cond, eqs, target, dyn, rassns, translate, invtrans): """factored out shared op between Update and Delete.""" if dyn: #print "dyn", dyn from sqlsem import dynamic_binding dynbind = dynamic_binding(len(dyn), dyn) if len(dynbind)>1: raise ValueError, "only one dynamic binding allowed for UPDATE" dynbind1 = dynbind = dynbind[0] if eqs is not None: dynbind1 = dynbind.remap(eqs) if dynbind1 is None: # inconsistent return dynbind = dynbind1 + dynbind if rassns is not None: rassns = rassns + invtrans * dynbind if rassns.Clean() is None: # inconsistent return else: rassns = invtrans * dynbind #print "dynbind", dynbind #print "rassn", rassns else: dynbind = None # get tuple set, try to use an index index = None if rassns is not None: known = rassns.keys() index = target.choose_index(known) if index is None: (tuples, seqnums) = target.rows(1) else: #print "using index", index.name (tuples, seqnums) = index.matches(rassns) ltuples = len(tuples) buffer = [0] * ltuples rtups = range(ltuples) for i in rtups: tup = tuples[i] #print tup ttup = translate * tup if dynbind: ttup = (ttup + dynbind).Clean() if ttup is not None: buffer[i] = ttup #print "buffer", buffer #print "cond", cond #for x in buffer: #print "before", x test = cond(buffer) #print "test", test return (test, rtups, seqnums, tuples) UPDFMT = """\ UPDATE %s SET %s WHERE %s""" # optimize to use indices and single call to "cond" class UpdateOp(sqlsem.SimpleRecursive): def __init__(self, name, assns, condition): self.name = name self.assns = assns self.condition = condition def initargs(self): return (self.name, self.assns, self.condition) def __repr__(self): return UPDFMT % (self.name, self.assns, self.condition) def relbind(self, db): self.indb = db name = self.name target = self.target = db.get_for_update(name) (attb, relb, amb, ambatts) = db.bindings( [ (name, name) ] ) assns = self.assns = self.assns.relbind(attb, db) cond = self.condition = self.condition.relbind(attb, db) constraints = cond.constraints if constraints is not None: eqs = self.eqs = constraints.eqs cassns = constraints.assns else: cassns = eqs = self.eqs = None #print constraints, eqs # check that atts of assns are atts of target #print dir(assns) resultatts = assns.attorder from sqlsem import kjbuckets kjSet = kjbuckets.kjSet kjGraph = kjbuckets.kjGraph resultatts = kjSet(resultatts) allatts = kjSet(target.attribute_names) self.preserved = allatts - resultatts huh = resultatts - allatts if huh: raise NameError, "%s lacks %s attributes" % (name, huh.items()) # compute projection assnsatts = kjGraph(assns.domain().items()).neighbors(name) condatts = kjGraph(cond.domain().items()).neighbors(name) condatts = condatts+assnsatts #print "condatts", condatts translate = kjbuckets.kjDict() for att in condatts: translate[ (name, att) ] = att self.translate = translate invtrans= self.invtrans = ~translate if cassns is not None: self.rassns = invtrans * cassns else: self.rassns = None #print "cassns,rassns", cassns, self.rassns #print translate # compute domain of self.assns # (do nothing with it, should add sanity check!) assns_domain = self.assns.domain() return self def eval(self, dyn=None): indb = self.indb name = self.name cond = self.condition cond.uncache() assns = self.assns assns.uncache() translate = self.translate preserved = self.preserved target = self.target rassns = self.rassns eqs = self.eqs invtrans = self.invtrans #print "assns", assns, assns.__class__ #print "cond", cond #print "eqs", eqs #print "target", target #print "dyn", dyn #print "rassns", rassns #print "translate", translate #print "invtrans", invtrans (test, rtups, seqnums, tuples) = evalcond( cond, eqs, target, dyn, rassns, translate, invtrans) # shortcut if not test: return self.indb.touched = 1 tt = type from types import IntType #print test (tps, attorder) = assns.map(test) count = 0 newseqs = list(rtups) newtups = list(rtups) for i in rtups: new = tps[i] if tt(new) is not IntType and new is not None: seqnum = seqnums[i] old = tuples[i] if preserved: new = new + preserved*old newtups[count] = new newseqs[count] = seqnum count = count + 1 if count: newseqs = newseqs[:count] newtups = newtups[:count] target.reset_tuples(newtups, newseqs) log = indb.log if log is not None and not log.is_scratch: from sqlsem import Reset_Tuples op = Reset_Tuples(self.name) op.set_data(newtups, newseqs, target) log.log(op) class DeleteOp(sqlsem.SimpleRecursive): def __init__(self, name, where): self.name = name self.condition = where def initargs(self): return (self.name, self.condition) def __repr__(self): return "DELETE FROM %s WHERE %s" % (self.name, self.condition) def relbind(self, db): self.indb = db name = self.name target = self.target = db.get_for_update(name) (attb, relb, amb, ambatts) = db.bindings( [ (name, name) ] ) cond = self.condition = self.condition.relbind(attb, db) # compute domain of cond # do nothing with it (should add sanity check) cond_domain = cond.domain() constraints = cond.constraints if constraints is not None: cassns = constraints.assns self.eqs = constraints.eqs else: self.eqs = cassns = None # compute projection/rename from sqlsem import kjbuckets condatts = kjbuckets.kjGraph(cond.domain().items()).neighbors(name) translate = kjbuckets.kjDict() for att in condatts: translate[(name, att)] = att self.translate = translate invtrans = self.invtrans = ~translate if cassns is not None: self.rassns = invtrans * cassns else: self.rassns = None return self def eval(self, dyn=None): # note, very similar to update case... indb = self.indb name = self.name target = self.target tuples = target.tuples eqs = self.eqs rassns = self.rassns cond = self.condition cond.uncache() translate = self.translate invtrans = self.invtrans (test, rtups, seqnums, tuples) = evalcond( cond, eqs, target, dyn, rassns, translate, invtrans) # shortcut if not test: return indb.touched = 1 tt = type from types import IntType count = 0 newseqs = list(rtups) #print "rtups", rtups for i in rtups: new = test[i] if tt(new) is not IntType and new is not None: seqnum = seqnums[i] newseqs[count] = seqnum count = count + 1 #print "newseqs", newseqs #print "count", count if count: newseqs = newseqs[:count] target.erase_tuples(newseqs) log = indb.log if log is not None and not log.is_scratch: from sqlsem import Erase_Tuples op = Erase_Tuples(self.name) op.set_data(newseqs, target) log.log(op) INSFMT = """\ INSERT INTO %s %s %s""" class InsertOp(sqlsem.SimpleRecursive): def __init__(self, name, optcolids, insertspec): self.name = name self.optcolids = optcolids self.insertspec = insertspec self.target = None # target relation self.collector = None # name map for attribute translation def initargs(self): return (self.name, self.optcolids, self.insertspec) def __repr__(self): return INSFMT % (self.name, self.optcolids, self.insertspec) def relbind(self, db): self.indb = db name = self.name # determine target relation target = self.target = db.get_for_update(name) targetatts = target.attributes() from sqlsem import kjbuckets kjSet = kjbuckets.kjSet targetset = kjSet(targetatts) # check or set colid bindings colids = self.optcolids if colids is None: colids = self.optcolids = target.attributes() colset = kjSet(colids) ### for now all attributes must be in colset cdiff = colset-targetset if cdiff: raise NameError, "%s: no such attributes in %s" % (cdiff.items(), name) cdiff = targetset-colset ### temporary!!! if cdiff: raise NameError, "%s: not set in insert on %s" % (cdiff.items(), name) # bind the insertspec insertspec = self.insertspec self.insertspec = insertspec = insertspec.relbind(db) # create a collector for result from sqlsem import TupleCollector collector = self.collector = TupleCollector() # get ordered list of expressions to eval on bound attributes of insertspec resultexps = insertspec.resultexps() if len(resultexps)!=len(colset): raise ValueError, "result and colset of differing length %s:%s" % (colset,resultexps) pairs = map(None, colids, resultexps) for (col,exp) in pairs: collector.addbinding(col, exp) return self def eval(self, dyn=None): resultbts = self.insertspec.eval(dyn) #print "resultbts", resultbts # shortcut if not resultbts: return indb = self.indb indb.touched = 1 (resulttups, resultatts) = self.collector.map(resultbts) #print "resulttups", resulttups if resulttups: target = self.target target.add_tuples(resulttups) #target.regenerate_indices() log = indb.log if log is not None and not log.is_scratch: from sqlsem import Add_Tuples op = Add_Tuples(self.name) op.set_data(resulttups, target) log.log(op) Insert_dummy_arg = [ ( (1,1), 1 ) ] class InsertValues(sqlsem.SimpleRecursive): def __init__(self, List): self.list = List def initargs(self): return (self.list,) def __repr__(self): return "VALUES " +` tuple(self.list) ` def resultexps(self): return self.list def relbind(self, db): l = self.list bindings = {} for i in xrange(len(self.list)): li = l[i] l[i] = li.relbind(bindings, db) # do nothing with domain, for now li_domain = li.domain() return self def eval(self, dyn=None): if dyn: from sqlsem import dynamic_binding dynbt = dynamic_binding(len(dyn), dyn) else: # dummy value to prevent triviality from sqlsem import kjbuckets dynbt = [kjbuckets.kjDict(Insert_dummy_arg)] #print "bindings", dynbt.assns return dynbt # ?? class InsertSubSelect(sqlsem.SimpleRecursive): def __init__(self, subsel): self.subsel = subsel def initargs(self): return (self.subsel,) def __repr__(self): return "[subsel] %s" % (self.subsel,) def resultexps(self): # get list of result bindings subsel = self.subsel atts = self.subsel.attributes() # bind each as "result.name" exps = [] from sqlsem import BoundAttribute for a in atts: exps.append( BoundAttribute("result", a) ) return exps # temp def relbind(self, db): subsel = self.subsel self.subsel = subsel.relbind(db) # do nothing with domain for now #subsel_domain = subsel.domain() return self def eval(self, dyn=None): subsel = self.subsel subsel.uncache() rel = subsel.eval(dyn) tups = rel.rows() from sqlsem import BoundTuple ### temp from sqlsem import kjbuckets kjDict = kjbuckets.kjDict for i in xrange(len(tups)): tupsi = tups[i] new = kjDict() for k in tupsi.keys(): new[ ("result", k) ] = tupsi[k] tups[i] = new return tups # ordering for archiving datadefs ddf_order = [CreateTable, CreateIndex, CreateView] Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/sqlsem.py100644 1007 1403 266767 6747630600 25167 0ustar petrillipetrilli """ sql semantics """ ### trim unused methods. ### make assns use equivalence classes. ### maybe eventually implement disj-conj-eq optimizations ### note: for multithreading x.relbind(...) should ALWAYs return ### a fresh copy of structure (sometimes in-place now). ### note: binding of order by is dubious with archiving, ### should not bind IN PLACE, leave unbound elts alone! ### need to fix serialization/deserialization of btand and btor ### # use kjbuckets builtin if available try: import kjbuckets except ImportError: import kjbuckets0 kjbuckets = kjbuckets0 Tuple = kjbuckets.kjDict Graph = kjbuckets.kjGraph Set = kjbuckets.kjSet import sys, traceback ### debug #sys.stderr = sys.stdin # operations on simple tuples, mostly from kjbuckets #def maketuple(thing): # """try to make a tuple from thing. # thing should be a dictionary or sequence of (name, value) # or other tuple.""" # from types import DictType # if type(thing)==DictType: # return Tuple(thing.items() ) # else: return Tuple(thing) def no_ints_nulls(list): """in place remove all ints, Nones from a list (for null handling)""" tt = type nn = None from types import IntType count = 0 for x in list: if tt(x) is not IntType and x is not nn: list[count] = x count = count+1 del list[count:] return list # stuff for bound tuples. class HashJoiner: def __init__(self, bt, relname, attributes, relation, witness): self.relname = relname self.attributes = attributes self.relation = relation self.witness = witness self.bt = bt eqs = bt.eqs #print "relname", relname #print "attributes", attributes #print "relation", relation #print "witness", witness #print "bt", bt transform = self.transform = kjbuckets.kjDict() rbindings = self.rbindings = kjbuckets.kjSet() for a in attributes: b = (relname, a) transform[b] = a rbindings[b] = b self.eqs = eqs = eqs + kjbuckets.kjGraph(rbindings) witness = witness.remap(eqs) known = kjbuckets.kjSet(witness.keys()) & rbindings batts = tuple(known.items()) if not batts: atts = () elif len(batts)==1: atts = ( transform[batts[0]], ) else: atts = transform.dump(batts) self.atts = atts self.batts = batts self.transform = transform eqs = bt.eqs #eqs = (rbindings * eqs) self.eqs = eqs = eqs + kjbuckets.kjGraph(rbindings) self.transformG = transformG = eqs * transform assns = self.assns = bt.assns self.rassns = assns.remap( ~transformG ) def relbind(self, db, atts): rel = self.relation #print "rel is ", rel, type(rel) #print dir(rel) if rel.is_view: self.relation = rel.relbind(db, atts) return self def uncache(self): rel = self.relation if rel.is_view: self.relation.uncache() def join(self, subseq): relname = self.relname result = [] assns = self.assns if not subseq: return result # apply equalities to unitary subseq (embedded subq) if len(subseq)==1: subseq0 = subseq[0] subseq0r = subseq0.remap(self.eqs) if subseq0r is None: return [] # inconsistent subseq0 = subseq0 + subseq0r + assns if subseq0.Clean() is None: return [] # inconsistent subseq = [subseq0] rassns = self.rassns #print "rassns", rassns #print "subseq", subseq if rassns is None: #print "inconsistent btup" return [] relation = self.relation #print "assns", assns transformG = self.transformG #print "transformG", transformG transform = self.transform atts = self.atts batts = self.batts #print "batts, atts", batts, atts if not batts: #print "cross product", relname tuples = relation.rows() for t in tuples: #print "t is", t if rassns: t = (t + rassns).Clean() if t is None: #print "preselect fails" continue new = t.remap(transformG) #print "new is", new if new is None: #print "transform fails" continue for subst in subseq: #print "subst", subst if subst: add = (subst + new).Clean() else: add = new #print "add is", add if add is not None: result.append(add) else: # hash join #print "hash join" # first try to use an index index = relation.choose_index(atts) #print transform if index is not None: #print "index join", index.name, relname #print index.index.keys() #print "rassns", rassns atts = index.attributes() invtransform = ~transform if len(atts)==1: batts = (invtransform[atts[0]],) else: batts = invtransform.dump(atts) hash_tups = 1 tindex = index.index # memoize converted tuples tindex0 = {} test = tindex.has_key test0 = tindex0.has_key for i in xrange(len(subseq)): subst = subseq[i] #print "substs is", subst its = subst.dump(batts) #print "its", its othersubsts = [] if test0(its): othersubsts = tindex0[its] elif test(its): tups = tindex[its] for t in tups: #print "t before", t t = (t+rassns).Clean() #print "t after", t if t is None: continue new = t.remap(transformG) #print "new", new if new is None: continue othersubsts.append(new) tindex0[its] = othersubsts for other in othersubsts: #print "adding", other, subst add = (other + subst).Clean() if add is not None: result.append(add) # hash join #print "hash join" else: tuples = relation.rows() if len(subseq)simpletuple associations.""" self.eqs = Graph() self.assns = Tuple() for (name, simpletuple) in bindings.items(): self.bind(name, simpletuple) def initargs(self): return () def marshaldata(self): #print "btp marshaldata", self return (self.eqs.items(), self.assns.items(), self.clean, self.closed) def demarshal(self, args): (eitems, aitems, self.clean, self.closed) = args self.eqs = kjbuckets.kjGraph(eitems) self.assns = kjbuckets.kjDict(aitems) def relbind(self, dict, db): """return bindings of self wrt dict rel-->att""" result = BoundTuple() e2 = result.eqs a2 = result.assns for ((a,b), (c,d)) in self.eqs.items(): if a is None: try: a = dict[b] except KeyError: raise NameError, `b`+": ambiguous or unknown attribute" if c is None: try: c = dict[d] except KeyError: raise NameError, `d`+": ambiguous or unknown attribute" e2[(a,b)] = (c,d) for ((a,b), v) in self.assns.items(): if a is None: try: a = dict[b] except KeyError: raise NameError, `b`+": ambiguous or unknown attribute" a2[(a,b)] = v result.closed = self.closed result.clean = self.clean return result #def known(self, relname): # """return ([(relname, a1), ...], [a1, ...]) # for attributes ai of relname known in self.""" # atts = [] # batts = [] # for x in self.assns.keys(): # (r,a) = x # if r==relname: # batts.append(x) # atts.append(a) # return (batts, atts) def relorder(self, db, allrels): """based on known constraints, pick an ordering for materializing relations. db is database (ignored currently) allrels is names of all relations to include (list).""" ### not very smart about indices yet!!! if len(allrels)<2: # doesn't matter return allrels order = [] eqs = self.eqs assns = self.assns kjSet = kjbuckets.kjSet kjGraph = kjbuckets.kjGraph pinned = kjSet() has_index = kjSet() needed = kjSet(allrels) akeys = assns.keys() for (r,a) in akeys: pinned[r]=r # pinned if some value known known_map = kjGraph(akeys) for r in known_map.keys(): rknown = known_map.neighbors(r) if db.has_key(r): rel = db[r] index = rel.choose_index(rknown) if index is not None: has_index[r] = r # has an index! if pinned: pinned = pinned & needed if has_index: has_index = has_index & needed related = kjGraph() for ( (r1, a1), (r2, a2) ) in eqs.items(): related[r1]=r2 # related if equated to other related[r2]=r1 # redundant if closed. if related: related = needed * related * needed chosen = kjSet() pr = kjSet(related) & pinned # choose first victim if has_index: choice = has_index.choose_key() elif pr: choice = pr.choose_key() elif pinned: choice = pinned.choose_key() elif related: choice = related.choose_key() else: return allrels[:] # give up! while pinned or related or has_index: order.append(choice) chosen[choice] = 1 if pinned.has_key(choice): del pinned[choice] if related.has_key(choice): del related[choice] if has_index.has_key(choice): del has_index[choice] nexts = related * chosen if nexts: # prefer a relation related to chosen choice = nexts.choose_key() elif pinned: # otherwise one that is pinned choice = pinned.choose_key() elif related: # otherwise one that relates to something... choice = related.choose_key() others = kjSet(allrels) - chosen if others: order = order + others.items() return order def domain(self): kjSet = kjbuckets.kjSet return kjSet(self.eqs) + kjSet(self.assns) def __repr__(self): from string import join result = [] for ( (name, att), value) in self.assns.items(): result.append( "%s.%s=%s" % (name, att, `value`) ) for ( (name, att), (name2, att2) ) in self.eqs.items(): result.append( "%s.%s=%s.%s" % (name, att, name2, att2) ) if self.clean: if not result: return "TRUE" else: result.insert(0, "FALSE") result.sort() return join(result, " & ") def equate(self, equalities): """add equalities to self, only if not closed. equalities should be seq of ( (name, att), (name, att) ) """ if self.closed: raise ValueError, "cannot add equalities! Closed!" e = self.eqs for (a, b) in equalities: e[a] = b def close(self): """infer equalities, if consistent. only recompute equality closure if not previously closed. return None on inconsistency. """ neweqs = self.eqs if not self.closed: self.eqs = neweqs = (neweqs + ~neweqs).tclosure() # sym, trans closure self.closed = 1 # add trivial equalities to self for x in self.assns.keys(): if not neweqs.member(x,x): neweqs[x] = x newassns = self.assns.remap(neweqs) if newassns is not None and self.clean: self.assns = newassns #self.clean = 1 return self else: self.clean = 0 return None def share_eqs(self): """make clone of self that shares equalities, closure. note: will share future side effects to eqs too.""" result = BoundTuple() result.eqs = self.eqs result.closed = self.closed return result def __add__(self, other): """combine self with other, return closure.""" result = self.share_eqs() se = self.eqs oe = other.eqs if (se is not oe) and (se != oe): result.eqs = se + oe result.closed = 0 ra= result.assns = self.assns + other.assns result.clean = result.clean and (ra.Clean() is not None) return result.close() def __and__(self, other): """return closed constraints common to self and other.""" result = BoundTuple() se = self.eqs oe = other.eqs if (se is oe) or (se == oe): result.eqs = self.eqs result.closed = self.closed else: result.eqs = self.eqs & other.eqs result.assns = self.assns & other.assns result.clean = self.clean and other.clean return result.close() def __hash__(self): # note: equalities don't enter into hash computation! # (some may be spurious) self.close() return hash(self.assns)# ^ hash(self.eqs) def __cmp__(self, other): test = cmp(self.__class__, other.__class__) if test: return test sa = self.assns oa = other.assns test = cmp(sa, oa) if test: return test kjSet = kjbuckets.kjSet kjGraph = kjbuckets.kjSet se = self.eqs se = kjGraph(se) - kjGraph(kjSet(se)) oe = other.eqs oe = kjGraph(oe) - kjGraph(kjSet(oe)) return cmp(se, oe) class BoundExpression(SimpleRecursive): """superclass for all bound expressions. except where overloaded expressions are binary with self.left and self.right """ contains_aggregate = 0 # default def __init__(self, left, right): self.left = left self.right = right self.contains_aggregate = left.contains_aggregate or right.contains_aggregate def initargs(self): return (self.left, self.right) def uncache(self): """prepare for execution, clear cached data.""" self.left.uncache() self.right.uncache() # eventually add converters... def equate(self,other): """return predicate equating self and other. Overload for special cases, please!""" return NontrivialEqPred(self, other) def attribute(self): return (None, `self`) def le(self, other): """predicate self<=other""" return LessEqPred(self, other) # these should be overridden for 2 const case someday... def lt(self, other): """predicate self list of subtuple""" lexprs = len(exprlist) if lexprs<1: raise ValueError, "aggregate on no expressions?" lassns = len(assignments) pairs = list(exprlist) for i in xrange(lexprs): expr = exprlist[i] attributes = [expr.attribute()]*lassns values = expr.value(assignments) pairs[i] = map(None, attributes, values) #for x in pairs: #print "pairs", x if lexprs>1: newassnpairs = apply(map, (None,)+tuple(pairs)) else: newassnpairs = pairs[0] #for x in newassnpairs: #print "newassnpairs", x xassns = range(lassns) dict = {} test = dict.has_key for i in xrange(lassns): thesepairs = newassnpairs[i] thissubassn = assignments[i] if test(thesepairs): dict[thesepairs].append(thissubassn) else: dict[thesepairs] = [thissubassn] items = dict.items() result = list(items) kjDict = kjbuckets.kjDict if lexprs>1: for i in xrange(len(items)): (pairs, subassns) = items[i] #print "pairs", pairs #print "subassns", subassns D = kjDict(pairs) D[None] = subassns result[i] = D else: for i in xrange(len(items)): (pair, subassns) = items[i] #print "pair", pair #print "subassns", subassns result[i] = kjDict( [pair, (None, subassns)] ) return result ### stuff for order_by class DescExpr(BoundMinus): """special wrapper used only for order by descending for things with no -thing operation (eg, strings)""" def __init__(self, thing): self.thing = thing self.contains_aggregate = thing.contains_aggregate def value(self, contexts): from types import IntType, StringType tt = type result = self.thing.value(contexts) allwrap = None allnowrap = None for i in xrange(len(contexts)): if tt(contexts[i]) is not IntType: resulti = result[i] # currently assume only value needing wrapping is string if tt(resulti) is StringType: if allnowrap is not None: raise ValueError, "(%s, %s) cannot order desc" % (allnowrap, resulti) allwrap = resulti result[i] = descOb(resulti) else: if allwrap is not None: raise ValueError, "(%s, %s) cannot order desc" % (allwrap, resulti) allnowrap = resulti result[i] = -resulti return result def __repr__(self): return "DescExpr(%s)" % (self.thing,) def orderbind(self, order): """order is list of (att, expr).""" Class = self.__class__ return Class(self.thing.orderbind(order)) class SimpleColumn(SimpleRecursive): """a simple column name for application to a list of tuples""" contains_aggregate = 0 def __init__(self, name): self.name = name def relbind(self, dict, db): # already bound! return self def orderbind(self, whatever): # already bound! return self def initargs(self): return (self.name,) def value(self, simpletuples): from types import IntType tt = type name = self.name result = list(simpletuples) for i in xrange(len(result)): ri = result[i] if tt(ri) is not IntType: result[i] = ri[name] else: result[i] = None # ??? return result def __repr__(self): return "" % (self.name,) class NumberedColumn(BoundMinus): """order by column number""" contains_aggregate = 0 def __init__(self, num): self.thing = num def __repr__(self): return "" % (self.thing,) def relbind(self, dict, db): from types import IntType if type(self.thing)!=IntType: raise ValueError, `self.thing`+": not a numbered column" return self def orderbind(self, order): return SimpleColumn( order[self.thing-1][0] ) class OrderExpr(BoundMinus): """order by expression.""" def orderbind(self, order): expratt = self.thing.attribute() for (att, exp) in order: if exp.attribute()==expratt: return SimpleColumn(att) else: raise NameError, `self`+": invalid ordering specification" def __repr__(self): return "" % (self.thing,) class descOb: """special wrapper only used for sorting in descending order should only be compared with other descOb instances. should only wrap items that cannot be easily "order inverted", (eg, strings). """ def __init__(self, ob): self.ob = ob def __cmp__(self, other): #test = cmp(self.__class__, other.__class__) #if test: return test return -cmp(self.ob,other.ob) def __coerce__(self, other): return (self, other) def __hash__(self): return hash(self.ob) def __repr__(self): return "descOb(%s)" % (self.ob,) def PositionedSort(num, ord): nc = NumberedColumn(num) if ord=="DESC": return DescExpr(nc) return nc def NamedSort(name, ord): oe = OrderExpr(name) if ord=="DESC": return DescExpr(oe) return oe def relbind_sequence(order_list, dict, db): result = list(order_list) for i in xrange(len(order_list)): result[i] = result[i].relbind(dict,db) return result def orderbind_sequence(order_list, order): result = list(order_list) for i in xrange(len(order_list)): result[i] = result[i].orderbind(order) return result def order_tuples(order_list, tuples): lorder_list = len(order_list) ltuples = len(tuples) if lorder_list<1: raise ValueError, "order on empty list?" order_map = list(order_list) for i in xrange(lorder_list): order_map[i] = order_list[i].value(tuples) if len(order_map)>1: order_vector = apply(map, (None,)+tuple(order_map) ) else: order_vector = order_map[0] #G = kjbuckets.kjGraph() pairs = map(None, range(ltuples), tuples) ppairs = map(None, order_vector, pairs) G = kjbuckets.kjGraph(ppairs) #for i in xrange(ltuples): # G[ order_vector[i] ] = (i, tuples[i]) Gkeys = G.keys() Gkeys.sort() result = list(tuples) index = 0 for x in Gkeys: #print x for (i, y) in G.neighbors(x): #print " ", y result[index]=y index = index+1 if index!=ltuples: raise ValueError, \ "TUPLE LOST IN ORDERING COMPUTATION! (%s,%s)" % (ltuples, index) return result class BoundAddition(BoundExpression): """promised addition.""" op = "+" def value(self, contexts): from types import IntType tt = type lvs = self.left.value(contexts) rvs = self.right.value(contexts) for i in xrange(len(contexts)): if tt(contexts[i]) is not IntType: lvs[i] = lvs[i] + rvs[i] return lvs class BoundSubtraction(BoundExpression): """promised subtraction.""" op = "-" def value(self, contexts): from types import IntType tt = type lvs = self.left.value(contexts) rvs = self.right.value(contexts) for i in xrange(len(contexts)): if tt(contexts[i]) is not IntType: lvs[i] = lvs[i] - rvs[i] return lvs class BoundMultiplication(BoundExpression): """promised multiplication.""" op = "*" def value(self, contexts): from types import IntType tt = type lvs = self.left.value(contexts) rvs = self.right.value(contexts) #print lvs for i in xrange(len(contexts)): if tt(contexts[i]) is not IntType: lvs[i] = lvs[i] * rvs[i] return lvs class BoundDivision(BoundExpression): """promised division.""" op = "/" def value(self, contexts): from types import IntType tt = type lvs = self.left.value(contexts) rvs = self.right.value(contexts) for i in xrange(len(contexts)): if tt(contexts[i]) is not IntType: lvs[i] = lvs[i] / rvs[i] return lvs class BoundAttribute(BoundExpression): """bound attribute: initialize with relname=None if implicit.""" contains_aggregate = 0 def __init__(self, rel, name): self.rel = rel self.name = name def initargs(self): return (self.rel, self.name) def relbind(self, dict, db): if self.rel is not None: return self name = self.name try: rel = dict[name] except KeyError: raise NameError, `name` + ": unknown or ambiguous" return BoundAttribute(rel, name) def uncache(self): pass def __repr__(self): return "%s.%s" % (self.rel, self.name) def attribute(self): """return (rename, attribute) for self.""" return (self.rel, self.name) def domain(self): return kjbuckets.kjSet([ (self.rel, self.name) ]) def value(self, contexts): """return value of self in context (bound tuple).""" #print "value of ", self, "in", contexts from types import IntType tt = type result = list(contexts) ra = (self.rel, self.name) for i in xrange(len(result)): if tt(result[i]) is not IntType: result[i] = contexts[i][ra] return result def equate(self, other): oc = other.__class__ if oc==BoundAttribute: result = BoundTuple() result.equate([(self.attribute(), other.attribute())]) return BTPredicate(result) elif oc==Constant: result = BoundTuple() result.assns[ self.attribute() ] = other.value([1])[0] return BTPredicate(result) else: return NontrivialEqPred(self, other) class Constant(BoundExpression): contains_aggregate = 0 def __init__(self, value): self.value0 = value def __hash__(self): return hash(self.value0) def initargs(self): return (self.value0,) def domain(self): return kjbuckets.kjSet() def __add__(self, other): if other.__class__==Constant: return Constant(self.value0 + other.value0) return BoundAddition(self, other) def __sub__(self, other): if other.__class__==Constant: return Constant(self.value0 - other.value0) return BoundSubtraction(self, other) def __mul__(self, other): if other.__class__==Constant: return Constant(self.value0 * other.value0) return BoundMultiplication(self, other) def __neg__(self): return Constant(-self.value0) def __div__(self, other): if other.__class__==Constant: return Constant(self.value0 / other.value0) return BoundDivision(self, other) def relbind(self, dict, db): return self def uncache(self): pass def value(self, contexts): """return the constant value associated with self.""" return [self.value0] * len(contexts) def equate(self,other): if other.__class__==Constant: if other.value0 == self.value0: return BTPredicate() #true else: return ~BTPredicate() #false else: return other.equate(self) def attribute(self): """invent a pair to identify a constant""" return ('unbound', `self`) def __repr__(self): return "" % (`self.value0`, id(self)) class TupleCollector: """Translate a sequence of assignments to simple tuples. (for implementing the select list of a SELECT). """ contains_aggregate = 0 contains_nonaggregate = 0 def __init__(self): self.final = None self.order = [] self.attorder = [] self.exporder = [] def initargs(self): return () def marshaldata(self): exps = map(serialize, self.exporder) return (self.attorder, exps, self.contains_aggregate, self.contains_nonaggregate) def demarshal(self, args): (self.attorder, exps, self.contains_aggregate, self.contains_nonaggregate) = args exporder = self.exporder = map(deserialize, exps) self.order = map(None, self.attorder, exporder) def uncache(self): for exp in self.exporder: exp.uncache() def domain(self): all=[] for e in self.exporder: all = all+e.domain().items() return kjbuckets.kjSet(all) def __repr__(self): l = [] for (att, exp) in self.order: l.append( "%s as %s" % (exp, att) ) from string import join return join(l, ", ") def addbinding(self, attribute, expression): """bind att-->expression.""" self.order.append((attribute, expression) ) self.attorder.append(attribute ) self.exporder.append(expression) if expression.contains_aggregate: self.contains_aggregate = 1 else: self.contains_nonaggregate = 1 def map(self, assnlist): """remap btlist by self. return (tuplelist, attorder)""" # DON'T eliminate nulls from types import IntType tt = type values = [] for exp in self.exporder: values.append(exp.value(assnlist)) if len(values)>1: valtups = apply(map, (None,) + tuple(values) ) else: valtups = values[0] kjUndump = kjbuckets.kjUndump undumper = tuple(self.attorder) for i in xrange(len(valtups)): test = assnlist[i] if tt(test) is IntType or test is None: valtups[i] = 0 # null/false else: tup = valtups[i] valtups[i] = kjUndump(undumper, tup) return (valtups, self.attorder) def relbind(self, dict, db): """disambiguate missing rel names if possible. also choose output names appropriately.""" # CURRENTLY THIS IS AN "IN PLACE" OPERATION order = self.order attorder = self.attorder exporder = self.exporder known = {} for i in xrange(len(order)): (att, exp) = order[i] #print exp exp = exp.relbind(dict, db) if att is None: # choose a name for this column #print exp (rname, aname) = exp.attribute() if known.has_key(aname): both = rname+"."+aname att = both count = 0 while known.has_key(att): # crank away! count = count+1 att = both+"."+`count` else: att = aname else: if known.has_key(att): raise NameError, `att`+" ambiguous in select list" order[i] = (att, exp) exporder[i] = exp attorder[i] = att known[att] = att return self class BTPredicate(SimpleRecursive): """superclass for bound tuple predicates. Eventually should be modified to use "compile" for speed to generate an "inlined" evaluation function. self(bt) returns bt with additional equality constraints (possible) or None if predicate fails.""" false = 0 constraints = None contains_aggregate = 0 def __init__(self, constraints=None): """default interpretation: True.""" if constraints is not None: self.constraints = constraints.close() def initargs(self): return (self.constraints,) def relbind(self, dict, db): c = self.constraints if c is None: return self return BTPredicate( self.constraints.relbind(dict, db) ) def uncache(self): pass #def evaluate(self, db, relnames): #"""evaluate the predicate over database bindings.""" # pretty simple strategy right now... ### need to do something about all/distinct... #c = self.constraints #if c is None: # c = BoundTuple() #order = c.relorder(db, relnames) #if not order: # raise ValueError, "attempt to evaluate over no relations: "+`relnames` #result = [c] #for r in order: # result = hashjoin(result, r, db[r]) #if self.__class__==BTPredicate: # # if it's just equality conjunction, we're done # return result #else: # # apply additional constraints # return self(result) def domain(self): c = self.constraints kjSet = kjbuckets.kjSet if c is None: return kjSet() return c.domain() def __repr__(self): if self.false: return "FALSE" c = self.constraints if c is None: c = "true" return "[pred](%s)" % c def detrivialize(self): """hook added to allow elimination of trivialities return None if completely true, or simpler form or self, if no simplification is possible.""" if self.false: return self if not self.constraints: return None return self def negated_constraints(self): """equality constraints always false of satisfactory tuple.""" return BoundTuple() # there aren't any def __call__(self, assignments, toplevel=0): """apply self to sequence of assignments return copy of asssignments with false results replaced by 0! Input may have 0's!""" # optimization # if toplevel, the btpred has been evaluated during join. if toplevel: return list(assignments) from types import IntType tt = type lbt = len(assignments) if self.false: return [0] * lbt c = self.constraints if c is None or not c: result = assignments[:] # no constraints else: assns = c.assns eqs = c.eqs eqsinteresting = 0 for (a,b) in eqs.items(): if a!=b: eqsinteresting = 1 result = assignments[:] for i in xrange(lbt): this = assignments[i] #print "comparing", self, "to", this if type(this) is IntType: continue this = (this + assns).Clean() if this is None: result[i] = 0 elif eqsinteresting: this = this.remap(eqs) if this is None: result[i] = 0 return result def __and__(self, other): """NOTE: all subclasses must define an __and__!!!""" #print "BTPredicate.__and__", (self, other) if self.__class__==BTPredicate and other.__class__==BTPredicate: c = self.constraints o = other.constraints if c is None: return other if o is None: return self if self.false: return self if other.false: return other # optimization for simple constraints all = (c+o) result = BTPredicate( all ) # all constraints if all is None: result.false = 1 else: result = other & self return result def __or__(self, other): if self.__class__==BTPredicate and other.__class__==BTPredicate: c = self.constraints o = other.constraints if c is None: return self # true dominates if o is None: return other if other.false: return self if self.false: return other if self == other: return self result = BTor_pred([self, other]) return result def __invert__(self): if self.false: return BTPredicate() if not self.constraints: result = BTPredicate() result.false = 1 return result return BTnot_pred(self) def __cmp__(self, other): test = cmp(other.__class__, self.__class__) if test: return test if self.false and other.false: return 0 return cmp(self.constraints, other.constraints) def __hash__(self): if self.false: return 11111 return hash(self.constraints) class BTor_pred(BTPredicate): def __init__(self, members, *othermembers): # replace any OR in members with its members #print "BTor_pred", members members = list(members) + list(othermembers) for m in members[:]: if m.__class__==BTor_pred: members.remove(m) members = members + m.members #print "before", members members = self.members = kjbuckets.kjSet(members).items() #print members for m in members[:]: if m.false: members.remove(m) self.constraints = None # common constraints for m in members: if m.contains_aggregate: self.contains_aggregate = 1 if members: # common constraints are those in all members constraints = members[0].constraints for m in members[1:]: mc = m.constraints if not constraints or not mc: constraints = None break constraints = constraints & mc self.constraints = constraints #print members def initargs(self): return ((),) + tuple(self.members) def relbind(self, dict, db): ms = [] for m in self.members: ms.append( m.relbind(dict, db) ) return BTor_pred(ms) def uncache(self): for m in self.members: m.uncache() def domain(self): all = BTPredicate.domain(self).items() for x in self.members: all = all + x.domain().items() return kjbuckets.kjSet(all) def __repr__(self): c = self.constraints m = self.members mr = map(repr, m) from string import join mr.sort() mr = join(mr, " | ") if not mr: mr = "FALSE_OR" if c: mr = "[disj](%s and %s)" % (c, mr) return mr def detrivialize(self): """hook added to allow elimination of trivialities return None if completely true, or simpler form or self, if no simplification is possible.""" ms = self.members for i in xrange(len(ms)): ms[i] = ms[i].detrivialize() # now suck out subordinate ors someor = None for m in ms: if m.__class__== BTor_pred: someor = m ms.remove(m) break if someor is not None: result = someor for m in ms: result = result + m return result.detrivialize() allfalse = 1 for m in ms: if m is None: allfalse=0; break # true member allfalse = allfalse & m.false if allfalse: return ~BTPredicate() # boundary case ms[:] = filter(None, ms) if not ms: return None # all true. ms[:] = kjbuckets.kjSet(ms).items() if len(ms)==1: return ms[0] # or of 1 return self def __call__(self, boundtuples, toplevel=0): # apply common constraints first lbt = len(boundtuples) # boundary case for or is false members = self.members if not members: return [0] * lbt current = BTPredicate.__call__(self, boundtuples, toplevel) # now apply first alternative alt1 = members[0](current) # determine questionables questionables = current[:] rng = xrange(len(current)) from types import IntType tt = type for i in rng: if tt(alt1[i]) is not IntType: questionables[i]=0 # now test other alternatives #print "alt1", members[0] #for x in alt1: #print x for m in self.members[1:]: #print "questionables", m #for x in questionables: #print x passm = m(questionables) for i in rng: test = passm[i] if tt(test) is not IntType: questionables[i] = 0 alt1[i] = test return alt1 def negated_constraints(self): """the negated constraints of an OR are the negated constraints of *all* members""" ms = self.members result = ms.negated_constraints() for m in ms[1:]: if not result: return result mc = m.negated_constraints() if not mc: return mc result = result & mc return result def __and__(self, other): """push "and" down""" newmembers = self.members[:] for i in xrange(len(newmembers)): newmembers[i] = newmembers[i] & other return BTor_pred(newmembers) def __or__(self, other): """collapse two ors, otherwise just add new member""" if self.__class__==BTor_pred and other.__class__==BTor_pred: return BTor_pred(self.members+other.members) return BTor_pred(self.members + [other]) def __invert__(self): """translate to and-not""" ms = self.members if not ms: return BTPredicate() # boundary case result = ~ms[0] for m in ms[1:]: result = result & ~m return result def __cmp__(self, other): test = cmp(self.__class__, other.__class__) if test: return test kjSet = kjbuckets.kjSet test = cmp(kjSet(self.members), kjSet(other.members)) if test: return test return BTPredicate.__cmp__(self, other) def __hash__(self): return hash(kjbuckets.kjSet(self.members)) class BTnot_pred(BTPredicate): def __init__(self, thing): self.negated = thing self.contains_aggregate = thing.contains_aggregate self.constraints = thing.negated_constraints() def initargs(self): return (self.negated,) def relbind(self, dict, db): return BTnot_pred( self.negated.relbind(dict, db) ) def uncache(self): self.negated.uncache() def domain(self): result = BTPredicate.domain(self) + self.negated.domain() #print "neg domain is", `self`, result return result def __repr__(self): c = self.constraints n = self.negated r = "(NOT %s)" % n if c: r = "[neg](%s & %s)" % (c, r) return r def detrivialize(self): """hook added to allow elimination of trivialities return None if completely true, or simpler form or self, if no simplification is possible.""" # first, fix or/and/not precedence thing = self.negated if thing.__class__ == BTnot_pred: return thing.negated.detrivialize() if thing.__class__ == BTor_pred: # translate to and_not members = thing.members[:] for i in xrange(len(members)): members[i] = ~members[i] result = BTand_pred(members) return result.detrivialize() if thing.__class__ == BTand_pred: # translate to or_not members = thing.members[:] c = thing.constraints # precondition if c is not None: members.append(BTPredicate(c)) for i in xrange(len(members)): members[i] = ~members[i] result = BTor_pred(members) return result.detrivialize() self.negated = thing = self.negated.detrivialize() if thing is None: return ~BTPredicate() # uniquely false if thing.false: return None # uniquely true return self def __call__(self, boundtuples, toplevel=0): from types import IntType tt = type current = BTPredicate.__call__(self, boundtuples, toplevel) omit = self.negated(current) for i in xrange(len(current)): if tt(omit[i]) is not IntType: current[i]=0 return current def negated_constraints(self): """the negated constraints of a NOT are the negated constraints of the thing negated.""" return self.negated.constraints def __and__(self, other): """do the obvious thing.""" return BTand_pred([self, other]) def __or__(self, other): """do the obvious thing""" return BTor_pred([self, other]) def __invert__(self): return self.negated def __cmp__(self, other): test = cmp(self.__class__, other.__class__) if test: return test test = cmp(self.negated,other.negated) if test: return test return BTPredicate.__cmp__(self,other) def __hash__(self): return hash(self.negated)^787876^hash(self.constraints) class BTand_pred(BTPredicate): def __init__(self, members, precondition=None, *othermembers): #print "BTand_pred", (members, precondition) members = list(members) + list(othermembers) members = self.members = kjbuckets.kjSet(members).items() self.constraints = precondition # common constraints if members: # common constraints are those in any member if precondition is not None: constraints = precondition else: constraints = BoundTuple() for i in xrange(len(members)): m = members[i] mc = m.constraints if mc: #print "constraints", constraints constraints = constraints + mc if constraints is None: break if m.__class__==BTPredicate: members[i] = None # subsumed above members = self.members = filter(None, members) for m in members: if m.contains_aggregate: self.contains_aggregate=1 ### consider propagating constraints down? self.constraints = constraints if constraints is None: self.false = 1 def initargs(self): #print "self.members", self.members #print "self.constraints", self.constraints #return (list(self.members), self.constraints) return ((), self.constraints) + tuple(self.members) def relbind(self, dict, db): ms = [] for m in self.members: ms.append( m.relbind(dict, db) ) c = self.constraints.relbind(dict, db) return BTand_pred(ms, c) def uncache(self): for m in self.members: m.uncache() def domain(self): all = BTPredicate.domain(self).items() for x in self.members: all = all + x.domain().items() return kjbuckets.kjSet(all) def __repr__(self): m = self.members c = self.constraints r = map(repr, m) if self.false: r.insert(0, "FALSE") from string import join r = join(r, " AND ") r = "(%s)" % r if c: r = "[conj](%s and %s)" % (c, r) return r def detrivialize(self): """hook added to allow elimination of trivialities return None if completely true, or simpler form or self, if no simplification is possible.""" # first apply demorgan's law to push ands down # (exponential in worst case). #print "detrivialize" #print self ms = self.members some_or = None c = self.constraints for m in ms: if m.__class__==BTor_pred: some_or = m ms.remove(m) break if some_or is not None: result = some_or if c is not None: some_or = some_or & BTPredicate(c) for m in ms: result = result & m # preserves or/and precedence if result.__class__!=BTor_pred: raise "what the?" result = result.detrivialize() #print "or detected, returning" #print result return result for i in xrange(len(ms)): ms[i] = ms[i].detrivialize() ms[:] = filter(None, ms) if not ms: #print "returning boundary case of condition" if c is None: return None else: return BTPredicate(c).detrivialize() ms[:] = kjbuckets.kjSet(ms).items() if len(ms)==1 and c is None: #print "and of 1, returning" #print ms[0] return ms[0] # and of 1 return self def __call__(self, boundtuples, toplevel=0): # apply common constraints first current = BTPredicate.__call__(self, boundtuples, toplevel) for m in self.members: current = m(current) return current def negated_constraints(self): """the negated constraints of an AND are the negated constraints of *any* member""" ms = self.members result = BoundTuple() for m in ms: mc = m.negated_constraints() if mc: result = result + mc return result def __and__(self, other): """push "and" down if other is an or""" if other.__class__==BTor_pred: return other & self c = self.constraints # merge in other and if other.__class__==BTand_pred: allmem = self.members+other.members oc = other.constraints if c is None: c = oc elif oc is not None: c = c+oc return BTand_pred(allmem, c) return BTand_pred(self.members + [other], c) def __or__(self, other): """do the obvious thing.""" return BTor_pred([self, other]) def __invert__(self): """translate to or-not""" ms = self.members if not ms: return ~BTPredicate() # boundary case result = ~ms[0] for m in ms[1:]: result = result | ~m return result def __cmp__(self, other): test = cmp(self.__class__, other.__class__) if test: return test kjSet = kjbuckets.kjSet test = cmp(kjSet(self.members), kjSet(other.members)) if test: return test return BTPredicate.__cmp__(self, other) def __hash__(self): return hash(kjbuckets.kjSet(self.members)) class NontrivialEqPred(BTPredicate): """equation of nontrivial expressions.""" def __init__(self, left, right): #print "making pred", self.__class__, left, right # maybe should used reflexivity... self.left = left self.right = right self.contains_aggregate = left.contains_aggregate or right.contains_aggregate def initargs(self): return (self.left, self.right) def __cmp__(self, other): test = cmp(self.__class__, other.__class__) if test: return test test = cmp(self.right, other.right) if test: return test return cmp(other.left, other.left) def hash(self, other): return hash(self.left) ^ hash(self.right) def relbind(self, dict, db): Class = self.__class__ return Class(self.left.relbind(dict,db), self.right.relbind(dict,db) ) def uncache(self): self.left.uncache() self.right.uncache() def domain(self): return self.left.domain() + self.right.domain() op = "==" def __repr__(self): return "(%s)%s(%s)" % (self.left, self.op, self.right) def detrivialize(self): return self def __call__(self, assigns, toplevel=0): from types import IntType tt = type lv = self.left.value(assigns) rv = self.right.value(assigns) result = assigns[:] for i in xrange(len(assigns)): t = assigns[i] if type(t) is not IntType and lv[i]!=rv[i]: result[i] = 0 return result def negated_constraints(self): return None def __and__(self, other): return BTand_pred( [self, other] ) def __or__(self, other): return BTor_pred( [self, other] ) def __invert__(self): return BTnot_pred(self) class BetweenPredicate(NontrivialEqPred): """e1 BETWEEN e2 AND e3""" def __init__(self, middle, lower, upper): self.middle = middle self.lower = lower self.upper = upper def initargs(self): return (self.middle, self.lower, self.upper) def domain(self): return ( self.middle.domain() + self.lower.domain() + self.upper.domain()) def relbind(self, dict, db): self.middle = self.middle.relbind(dict, db) self.lower = self.lower.relbind(dict, db) self.upper = self.upper.relbind(dict, db) return self def uncache(self): self.middle.uncache() self.upper.uncache() self.lower.uncache() def __repr__(self): return "(%s BETWEEN %s AND %s)" % ( self.middle, self.lower, self.upper) def __hash__(self): return hash(self.middle)^~hash(self.lower)^hash(self.upper)^55 def __cmp__(self, other): test = cmp(self.__class__, other.__class__) if test: return test test = cmp(self.lower, other.lower) if test: return test test = cmp(self.middle, other.middle) if test: return test return cmp(self.upper, other.upper) def __call__(self, assigns, toplevel=0): from types import IntType tt = type lowv = self.lower.value(assigns) upv = self.upper.value(assigns) midv = self.middle.value(assigns) result = assigns[:] for i in xrange(len(assigns)): t = assigns[i] if tt(t) is not IntType: midvi = midv[i] if lowv[i]>midvi or upv[i]1: raise ValueError, \ "Quantified predicate requires unit select list: %s" % atts self.att = atts[0] return self fmt = "(%s %s ANY %s)" op = "=" def __repr__(self): return self.fmt % (self.expr, self.op, self.subq) def __call__(self, assigns, toplevel=0): cached_column = self.cached_column cachable = self.cachable expr = self.expr subq = self.subq att = self.att if cachable: if cached_column is None: subqr = subq.eval().rows() cc = self.cached_column = dump_single_column(subqr, att) #print self, "cached", self.cached_column exprvals = expr.value(assigns) kjDict = kjbuckets.kjDict compare = self.compare tt = type from types import IntType result = assigns[:] for i in xrange(len(assigns)): assignsi = assigns[i] if tt(assignsi) is IntType: continue thisval = exprvals[i] testbtup = BoundTuple() testbtup.assns = kjDict(assignsi) if not cachable: subqr = subq.eval(outerboundtuple=testbtup).rows() cc = dump_single_column(subqr, att) #print self, "uncached", cc, thisval if not compare(thisval, cc): #print "eliminated", assignsi result[i] = 0 return result def compare(self, value, column): return value in column def __hash__(self): return hash(self.subq) ^ ~hash(self.expr) def __cmp__(self, other): test = cmp(self.__class__, other.__class__) if test: return test test = cmp(self.expr, other.expr) if test: return test return cmp(self.subq, other.subq) # "expr IN (subq)" same as "expr = ANY (subq)" InPredicate = QuantEQ class InLits(NontrivialEqPred): """expr IN literals, support dynamic bindings.""" def __init__(self, expr, lits): self.expr = expr self.lits = lits self.cached_lits = None def initargs(self): return (self.expr, self.lits) def uncache(self): self.cached_lits = None def domain(self): d = [] for l in self.lits: d0 = l.domain() if d0: d = d + d0.items() d0 = self.expr.domain() if d: kjSet = kjbuckets.kjSet return d0 + kjSet(d) else: return d0 def relbind(self, dict, db): newlits = [] for l in self.lits: newlits.append(l.relbind(dict, db)) self.lits = newlits self.expr = self.expr.relbind(dict, db) return self fmt = "(%s IN %s)" def __repr__(self): return self.fmt % (self.expr, self.lits) def __call__(self, assigns, toplevel=0): # LITERALS ARE CONSTANT! NEED ONLY LOOK FOR ONE ASSIGN. tt = type from types import IntType litvals = self.cached_lits if litvals is None: assigns0 = [] for asn in assigns: if tt(asn) is not IntType: assigns0.append(asn) break if not assigns0: # all false/unknown return assigns litvals = [] for lit in self.lits: value = lit.value(assigns0) litvals.append(value[0]) self.cached_lits = litvals expr = self.expr exprvals = expr.value(assigns) result = assigns[:] for i in xrange(len(assigns)): assignsi = assigns[i] if tt(assignsi) is IntType: continue thisval = exprvals[i] if thisval not in litvals: #print "eliminated", assignsi result[i] = 0 return result def compare(self, value, column): return value in column def __hash__(self): return 10 ^ hash(self.expr) def __cmp__(self, other): test = cmp(self.__class__, other.__class__) if test: return test test = cmp(self.expr, other.expr) if test: return test return cmp(self.lits, other.lits) class QuantNE(QuantEQ): """Quantified not equal any predicate""" op = "<>" def compare(self, value, column): for x in column: if value!=x: return 1 return 0 ### note: faster NOT IN using QuantNE? class QuantLT(QuantEQ): """Quantified less than any predicate""" op = "<" def uncache(self): self.testval = self.cached = self.cached_column = None def compare(self, value, column): if self.cachable: if self.cached: testval = self.testval else: testval = self.testval = max(column) self.cached = 1 else: testval = max(column) return value < testval class QuantLE(QuantLT): """Quantified less equal any predicate""" op = "<=" def compare(self, value, column): if self.cachable: if self.cached: testval = self.testval else: testval = self.testval = max(column) self.cached = 1 else: testval = max(column) return value <= testval class QuantGE(QuantLT): """Quantified greater equal any predicate""" op = ">=" def compare(self, value, column): if self.cachable: if self.cached: testval = self.testval else: testval = self.testval = min(column) self.cached = 1 else: testval = min(column) return value >= testval class QuantGT(QuantLT): """Quantified greater than any predicate""" op = ">" def compare(self, value, column): if self.cachable: if self.cached: testval = self.testval else: self.testval = testval = min(column) self.cached = 1 else: testval = min(column) return value > testval def dump_single_column(assigns, att): """dump single column assignment""" result = assigns[:] for i in xrange(len(result)): result[i] = result[i][att] return result class LessPred(NontrivialEqPred): op = "<" def __call__(self, assigns, toplevel=0): from types import IntType tt = type lv = self.left.value(assigns) rv = self.right.value(assigns) result = assigns[:] for i in xrange(len(assigns)): t = assigns[i] if tt(t) is not IntType and lv[i]>=rv[i]: result[i] = 0 return result def __inv__(self): return LessEqPred(self.right, self.left) def __hash__(self): return hash(self.left)^hash(self.right) class LessEqPred(LessPred): op = "<=" def __call__(self, assigns, toplevel=0): from types import IntType tt = type lv = self.left.value(assigns) rv = self.right.value(assigns) result = assigns[:] for i in xrange(len(assigns)): t = assigns[i] if tt(t) is not IntType and lv[i]>rv[i]: result[i] = 0 return result def __inv__(self): return LessPred(self.right, self.left) class SubQueryExpression(BoundMinus, SimpleRecursive): """sub query expression (subq), must eval to single column, single value""" def __init__(self, subq): self.subq = subq self.att = self.cachable = self.cached = self.cached_value = None def initargs(self): return (self.subq,) def uncache(self): self.cached = self.cached_value = None def domain(self): result = self.subq.unbound() if not result: self.cachable = 1 #print "expr subq domain", result return result def relbind(self, dict, db): subq = self.subq = self.subq.relbind(db, dict) # test that subquery is single column and determine att sl = subq.select_list atts = sl.attorder if len(atts)<>1: raise ValueError, \ "Quantified predicate requires unit select list: %s" % atts self.att = atts[0] return self def __repr__(self): return "(%s)" % self.subq def value(self, contexts): subq = self.subq att = self.att if self.cachable: if self.cached: cached_value = self.cached_value else: self.cached = 1 seval = subq.eval().rows() lse = len(seval) if lse<>1: raise ValueError, \ "const subquery expression must return 1 result: got %s" % lse self.cached_value = cached_value = seval[0][att] #print "const subq cached", cached_value return [cached_value] * len(contexts) from types import IntType tt = type result = contexts[:] kjDict = kjbuckets.kjDict for i in xrange(len(contexts)): contextsi = contexts[i] if tt(contextsi) is not IntType: testbtup = BoundTuple() testbtup.assns = kjDict(contextsi) #print "subq exp", testbtup seval = subq.eval(outerboundtuple=testbtup).rows() lse = len(seval) if lse<>1: raise ValueError, \ "dynamic subquery expression must return 1 result: got %s" % lse result[i] = seval[0][att] #print "nonconst subq uncached", result[i], contextsi return result SELECT_TEMPLATE = """\ SELECT %s %s FROM %s WHERE %s GROUP BY %s HAVING %s %s ORDER BY %s %s """ def dynamic_binding(ndynamic, dynamic): """create bindings from dynamic tuple for ndynamic parameters if a tuple is given create one if a list is given create many """ from types import ListType, TupleType if not dynamic: if ndynamic>0: raise ValueError, `ndynamic`+" dynamic parameters unbound" return [kjbuckets.kjDict()] ldyn = len(dynamic) undumper = map(None, [0]*ndynamic, range(ndynamic)) undumper = tuple(undumper) tdyn = type(dynamic) if tdyn is TupleType: ldyn = len(dynamic) if len(dynamic)!=ndynamic: raise ValueError, "%s,%s: wrong number of dynamics" % (ldyn,ndynamic) dynamic = [dynamic] elif tdyn is not ListType: raise TypeError, "dynamic parameters must be list or tuple" else: lens = map(len, dynamic) ndynamic = max(lens) if ndynamic!=min(lens): raise ValueError, "dynamic parameters of inconsistent lengths" undumper = map(None, [0]*ndynamic, range(ndynamic)) undumper = tuple(undumper) result = list(dynamic) kjUndump = kjbuckets.kjUndump for i in xrange(len(dynamic)): dyn = dynamic[i] ldyn = len(dyn) #print undumper, dyn if ldyn==1: dynresult = kjUndump(undumper, dyn[0]) else: dynresult = kjUndump(undumper, dyn) result[i] = dynresult return result class Selector: """For implementing, eg the SQL SELECT statement.""" def __init__(self, alldistinct, select_list, table_reference_list, where_pred, group_list, having_cond, union_select =None, order_by_spec =None, ndynamic=0, # number of dyn params expected ): self.ndynamic = ndynamic self.alldistinct = alldistinct self.select_list = select_list self.table_list = table_reference_list self.where_pred = where_pred self.group_list = group_list self.having_cond = having_cond self.union_select = union_select self.order_by = order_by_spec #self.union_spec = "DISTINCT" # default union mode self.relbindings = None # binding of relations self.unbound_set = None # unbound attributes self.rel_atts = None # graph of alias-->attname bound in self self.all_aggregate = 0 if select_list!="*" and not group_list: if select_list.contains_aggregate: ### should restore this check somewhere else! #if select_list.contains_nonaggregate: #raise ValueError, "aggregates/nonaggregates don't mix without grouping" self.all_aggregate = 1 if where_pred and where_pred.contains_aggregate: raise ValueError, "aggregate in WHERE" self.query_plan = None def initargs(self): #print self.alldistinct #print self.select_list #print self.table_list #print self.where_pred #print self.having_cond #print self.union_select #print self.group_list #print self.order_by #print self.ndynamic # note: order by requires special handling return (self.alldistinct, self.select_list, self.table_list, self.where_pred, None, self.having_cond, self.union_select, None, self.ndynamic) def marshaldata(self): order_by = self.order_by if order_by: order_by = map(serialize, order_by) group_list = self.group_list if group_list: group_list = map(serialize, group_list) #print "marshaldata" #print order_by #print group_list return (order_by, group_list) def demarshal(self, data): (order_by, group_list) = data if order_by: order_by = map(deserialize, order_by) if group_list: group_list = map(deserialize, group_list) #print "demarshal" #print order_by #print group_list self.order_by = order_by self.group_list = group_list def unbound(self): result = self.unbound_set if result is None: raise ValueError, "binding not available" return result def uncache(self): wp = self.where_pred hc = self.having_cond sl = self.select_list if wp is not None: wp.uncache() if hc is not None: hc.uncache() sl.uncache() qp = self.query_plan if qp: for joiner in qp: joiner.uncache() def relbind(self, db, outerbindings=None): ad = self.alldistinct sl = self.select_list tl = self.table_list wp = self.where_pred gl = self.group_list hc = self.having_cond us = self.union_select ob = self.order_by test = db.bindings(tl) #print len(test) #for x in test: #print x (attbindings, relbindings, ambiguous, ambiguousatts) = test if outerbindings: # bind in outerbindings where unambiguous for (a,r) in outerbindings.items(): if ((not attbindings.has_key(a)) and (not ambiguousatts.has_key(a)) ): attbindings[a] = r # fix "*" select list if sl=="*": sl = TupleCollector() for (a,r) in attbindings.items(): sl.addbinding(None, BoundAttribute(r,a)) for (dotted, (r,a)) in ambiguous.items(): sl.addbinding(dotted, BoundAttribute(r,a)) sl = sl.relbind(attbindings, db) wp = wp.relbind(attbindings, db) if hc is not None: hc = hc.relbind(attbindings, db) if us is not None: us = us.relbind(db, attbindings) # bind grouping if present if gl: gl = relbind_sequence(gl, attbindings, db) # bind ordering list if present #print ob if ob: ob = relbind_sequence(ob, attbindings, db) ob = orderbind_sequence(ob, sl.order) result = Selector(ad, sl, tl, wp, gl, hc, us, ob) result.relbindings = relbindings result.ndynamic = self.ndynamic result.check_domains() result.plan_query() query_plan = result.query_plan for i in range(len(query_plan)): query_plan[i] = query_plan[i].relbind(db, attbindings) return result def plan_query(self): """generate a query plan (sequence of join operators).""" rel_atts = self.rel_atts # rel-->attname where_pred = self.where_pred.detrivialize() #select_list = self.select_list # shortcut if where_pred is None: bt = BoundTuple() else: bt = self.where_pred.constraints if bt is None: bt = BoundTuple() eqs = kjbuckets.kjGraph(bt.eqs) witness = kjbuckets.kjDict() # set all known and unbound atts as witnessed for att in bt.assns.keys(): witness[att] = 1 #print self, "self.unbound_set", self.unbound_set for att in self.unbound_set.items(): witness[att] = 1 relbindings = self.relbindings allrels = relbindings.keys() #print relbindings allrels = bt.relorder(relbindings, allrels) #print allrels rel_atts = self.rel_atts plan = [] for rel in allrels: relation = relbindings[rel] ratts = rel_atts.neighbors(rel) h = HashJoiner(bt, rel, ratts, relation, witness) plan.append(h) for a in ratts: ra = (rel, a) witness[ra] = 1 eqs[ra] = ra witness = witness.remap(eqs) self.query_plan = plan def check_domains(self): """determine set of unbound names in self. """ relbindings = self.relbindings sl = self.select_list wp = self.where_pred gl = self.group_list hc = self.having_cond us = self.union_select all = sl.domain().items() if wp is not None: all = all + wp.domain().items() # ignore group_list ??? if hc is not None: all = all + hc.domain().items() kjSet = kjbuckets.kjSet kjGraph = kjbuckets.kjGraph alldomain = kjSet(all) rel_atts = self.rel_atts = kjGraph(all) allnames = kjSet() #print "relbindings", relbindings.keys() for name in relbindings.keys(): rel = relbindings[name] for att in rel.attributes(): allnames[ (name, att) ] = 1 # union compatibility check if us is not None: us.check_domains() myatts = self.attributes() thoseatts = us.attributes() if myatts!=thoseatts: if len(myatts)!=len(thoseatts): raise IndexError, "outer %s, inner %s: union select lists lengths differ"\ % (len(myatts), len(thoseatts)) for p in map(None, myatts, thoseatts): (x,y)=p if x!=y: raise NameError, "%s union names don't match" % (p,) self.unbound_set = alldomain - allnames def attributes(self): return self.select_list.attorder def eval(self, dynamic=None, outerboundtuple=None): """leaves a lot to be desired. dynamic and outerboundtuple are mutually exclusive. dynamic is only pertinent to top levels, outerboundtuple to subqueries""" #print "select eval", dynamic, outerboundtuple from gfdb0 import Relation0 # only uncache if outerboundtuple is None (not subquery) # ??? if outerboundtuple is None: self.uncache() query_plan = self.query_plan where_pred = self.where_pred.detrivialize() select_list = self.select_list # shortcut if where_pred is not None and where_pred.false: return Relation0(select_list.attorder, []) #print "where_pred", where_pred if where_pred is None or where_pred.constraints is None: assn0 = assn1 = kjbuckets.kjDict() else: assn1 = self.where_pred.constraints.assns assn0 = assn1 = kjbuckets.kjDict(assn1) # erase stored results from possible previous evaluation ndynamic = self.ndynamic if outerboundtuple is not None: assn1 = assn1 + outerboundtuple.assns elif ndynamic: dyn = dynamic_binding(ndynamic, dynamic) if len(dyn)!=1: raise ValueError, "only one dynamic subst for selection allowed" dyn = dyn[0] assn1 = assn1 + dyn #print "dynamic", bt #print "assn1", assn1 # check unbound names unbound_set = self.unbound_set #print "unbound", unbound_set #print unbound_set #print self.rel_atts for pair in unbound_set.items(): if not assn1.has_key(pair): raise KeyError, `pair`+": unbound in selection" assn1 = (unbound_set * assn1) + assn0 #print "assn1 now", assn1 substseq = [assn1] for h in query_plan: #print "***" #for x in substseq: #print x #print "***" substseq = h.join(substseq) if not substseq: break #print "***" #for x in substseq: #print x #print "***" # apply the rest of the where predicate at top level if substseq and where_pred is not None: #where_pred.uncache() substseq = where_pred(substseq, 1) # eliminate zeros/nulls substseq = no_ints_nulls(substseq) # apply grouping if present group_list = self.group_list if substseq and group_list: substseq = aggregate(substseq, group_list) having_cond = self.having_cond #print having_cond if having_cond is not None: #having_cond.uncache() substseq = no_ints_nulls(having_cond(substseq)) elif self.all_aggregate: # universal group substseq = [kjbuckets.kjDict( [(None, substseq)] ) ] (tups, attorder) = select_list.map(substseq) # do UNION if present union_select = self.union_select if union_select is not None: tups = union_select.eval(tups, dynamic, outerboundtuple) # apply DISTINCT if appropriate if self.alldistinct=="DISTINCT": tups = kjbuckets.kjSet(tups).items() # apply ordering if present ob = self.order_by if ob: tups = order_tuples(ob, tups) return Relation0(attorder, tups) def __repr__(self): ndyn = "" if self.ndynamic: ndyn = "\n[%s dynamic parameters]" % self.ndynamic result = SELECT_TEMPLATE % ( self.alldistinct, self.select_list, self.table_list, self.where_pred, self.group_list, self.having_cond, #union_spec, self.union_select, self.order_by, ndyn ) return result class Union(SimpleRecursive): """union clause.""" def __init__(self, alldistinct, selection): self.alldistinct = alldistinct self.selection = selection def initargs(self): return (self.alldistinct, self.selection) def unbound(self): return self.selection.unbound() def relbind(self, db, outer=None): self.selection = self.selection.relbind(db, outer) return self def check_domains(self): self.selection.check_domains() def attributes(self): return self.selection.attributes() def eval(self, assns, dyn=None, outer=None): r = self.selection.eval(dyn, outer) rows = r.rows() allrows = rows + assns if self.alldistinct=="DISTINCT": allrows = kjbuckets.kjSet(allrows).items() return allrows def __repr__(self): return "\nUNION %s %s " % (self.alldistinct, self.selection) class Intersect(Union): def eval(self, assns, dyn=None, outer=None): r = self.selection.eval(dyn, outer) rows = r.rows() kjSet = kjbuckets.kjSet allrows = (kjSet(assns) & kjSet(rows)).items() return allrows op = "INTERSECT" def __repr__(self): return "\n%s %s" % (self.op, self.selection) class Except(Union): def eval(self, assns, dyn=None, outer=None): r = self.selection.eval(dyn, outer) rows = r.rows() kjSet = kjbuckets.kjSet allrows = (kjSet(assns) - kjSet(rows)).items() return allrows op = "EXCEPT" class Parse_Context: """contextual information for parsing p.param() returns a new sequence number for external parameter. """ # not serializable parameter_index = 0 # no __init__ yet def param(self): temp = self.parameter_index self.parameter_index = temp+1 return temp def ndynamic(self): return self.parameter_index # update/delete/insert statements import sqlmod CreateTable = sqlmod.CreateTable CreateIndex = sqlmod.CreateIndex DropIndex = sqlmod.DropIndex DropTable = sqlmod.DropTable UpdateOp = sqlmod.UpdateOp DeleteOp = sqlmod.DeleteOp InsertOp = sqlmod.InsertOp InsertValues = sqlmod.InsertValues InsertSubSelect = sqlmod.InsertSubSelect ColumnDef = sqlmod.ColumnDef CreateView = sqlmod.CreateView DropView = sqlmod.DropView # update storage structures from gfdb0 import gfdb0 Add_Tuples = gfdb0.Add_Tuples Erase_Tuples = gfdb0.Erase_Tuples Reset_Tuples = gfdb0.Reset_Tuples ####### testing # test helpers #def tp(**kw): # return maketuple(kw) #def st(**kw): # return BTPredicate(BoundTuple(r=kw)) Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/gadfly/sqlwhere.py100644 1007 1403 172 6747630601 25406 0ustar petrillipetrilli '''this module indicates where the sql datastructures are marshalled Auto generated on install: better not touch! ''' Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/README.txt100755 1007 1403 751 6667535712 23450 0ustar petrillipetrilliZGadflyDA The ZGadflyDA product provides support for Gadfly database adapter objects in the Zope environment. Using Multiple Databases with ZGadflyDA The ZGadflyDA is intended mainly for demonstration purposes. It automatically creates a 'gadfly' directory in your Zope var directory with a 'demo' subdirectory, which provides a demo database. To add or use additional databases, simply add (or link) additional directories to your 'var/gadfly' directory. Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/Setup100755 1007 1403 362 6531050131 22744 0ustar petrillipetrilli#install DA.py #install DABase.py #install __init__.py #install browse.dtml #install connectionAdd.dtml #install db.py #install gadfly #install icons #install table_info.dtml #install table_menu.dtml #install tables.dtml #install CHANGES.txt Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/__init__.py100644 1007 1403 12770 6712130474 24107 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Generic Database Adapter Package Registration $Id: __init__.py,v 1.10 1999/04/29 19:21:32 jim Exp $''' __version__='$Revision: 1.10 $'[11:-2] import Globals, os classes=('DA.Connection',) database_type='Gadfly' misc_={'conn': Globals.ImageFile('Shared/DC/ZRDB/www/DBAdapterFolder_icon.gif')} for icon in ('table', 'view', 'stable', 'what', 'field', 'text','bin','int','float', 'date','time','datetime'): misc_[icon]=Globals.ImageFile('icons/%s.gif' % icon, globals()) meta_types=( {'name':'Z %s Database Connection' % database_type, 'action':'manage_addZ%sConnectionForm' % database_type, }, ) DA=None def getDA(): global DA if DA is None: home=Globals.package_home(globals()) from gadfly import sqlwhere sqlwhere.filename="%s/gadfly/sql.mar" % home import DA return DA getDA() __module_aliases__=( ('Products.AqueductGadfly.DA', DA), ) def manage_addZGadflyConnectionForm(self, REQUEST, *args, **kw): " " DA=getDA() return DA.addConnectionForm( self,REQUEST, database_type=database_type, data_sources=DA.data_sources) def manage_addZGadflyConnection( self, id, title, connection, check=None, REQUEST=None): " " return getDA().manage_addZGadflyConnection( self, id, title, connection, check, REQUEST) methods={ 'manage_addZGadflyConnection': manage_addZGadflyConnection, 'manage_addZGadflyConnectionForm': manage_addZGadflyConnectionForm, } __ac_permissions__=( ('Add Z Gadfly Database Connections', ('manage_addZGadflyConnectionForm', 'manage_addZGadflyConnection')), ) j=os.path.join d=j(j(INSTANCE_HOME,'var'),'gadfly') if not os.path.exists(d): os.mkdir(d) os.mkdir(j(d,'demo')) Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/browse.dtml100644 1007 1403 617 6635516173 24126 0ustar petrillipetrilli <!--#var title_or_id--> tables <!--#var Type--> Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/connectionAdd.dtml100644 1007 1403 10027 6761246501 25424 0ustar petrillipetrilli Add Z <!--#var database_type--> Database Connection

    Add Z Database Connection

    See the note below.

    Id
    Title
    Select a Data Source
    Additional data sources may be created by making additional directories in the var/gadfly subdirectory of your Principia installation.
    Connect immediately

    Sorry, you cannot create any Zope Database Connections because no databases exist, or all of the existing databases are in use.

    Note: The Zope Gadfly product is a free Zope database adapter intended for demonstration purposes only. It is only suitable for learning about Zope SQL Methods. Database operations are performed in memory, so it should not be used to create large databases. This installation is using a non-optimized version of Gadfly and should not be used to assess the performance of either Gadfly or Zope.

    The Zope Gadfly Product uses the Gadfly SQL Database Engine by Aaron Waters. See the Gadfly copyright below.

    Gadfly Copyright Notice

    The kjParsing source is copyrighted, but you can freely use and copy it as long as you don't change or remove the copyright:

    Copyright Aaron Robert Watters, 1994

    All Rights Reserved

    Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appears in all copies and that both that copyright notice and this permission notice appear in supporting documentation.

    AARON ROBERT WATTERS DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL AARON ROBERT WATTERS BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.

    Signature

            Aaron Robert Watters
        Department of Computer and Information Sciences
        New Jersey Institute of Technology
        University Heights
        Newark, NJ 07102
                phone (201)596-2666
		fax (201)596-5777
		home phone (908)545-3367
		email: aaron@vienna.njit.edu
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/connectionEdit.dtml100644 1007 1403 3255 6761246501 25606 0ustar petrillipetrilli Edit <!--#var title_or_id-->

    Edit

    Id
    Title
    Select a Data Source
    Additional data sources may be created by making additional directories in the var/gadfly subdirectory of your Principia installation.
    Connect immediately

    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/db.py100644 1007 1403 17114 6770204355 22736 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''$Id: db.py,v 1.11 1999/09/16 15:12:45 jim Exp $''' __version__='$Revision: 1.11 $'[11:-2] import os from string import strip, split import gadfly import Globals, Shared.DC.ZRDB.THUNK from DateTime import DateTime data_dir=os.path.join(Globals.data_dir,'gadfly') def manage_DataSources(): if not os.path.exists(data_dir): try: os.mkdir(data_dir) os.mkdir(os.path.join(data_dir,'demo')) except: raise 'Gadfly Error', ( """ The Zope Gadfly Database Adapter requires the existence of the directory, %s. An error occurred while trying to create this directory. """ % data_dir) if not os.path.isdir(data_dir): raise 'Gadfly Error', ( """ The Zope Gadfly Database Adapter requires the existence of the directory, %s. This exists, but is not a directory. """ % data_dir) return map( lambda d: (d,''), filter(lambda f, i=os.path.isdir, d=data_dir, j=os.path.join: i(j(d,f)), os.listdir(data_dir)) ) class DB(Shared.DC.ZRDB.THUNK.THUNKED_TM): database_error=gadfly.error opened='' def tables(self,*args,**kw): if self.db is None: self.open() return map( lambda name: { 'TABLE_NAME': name, 'TABLE_TYPE': 'TABLE', }, filter(self.db.database.datadefs.has_key, self.db.table_names()) ) def columns(self, table_name): if self.db is None: self.open() return map(lambda col: { 'Name': col.colid, 'Type': col.datatype, 'Precision': 0, 'Scale': 0, 'Nullable': 'with Null' }, self.db.database.datadefs[table_name].colelts) def open(self): connection=self.connection path=os.path dir=path.join(data_dir,connection) if not path.isdir(dir): raise self.database_error, 'invalid database error, ' + connection if not path.exists(path.join(dir,connection+".gfd")): db=gadfly.gadfly() db.startup(connection,dir) else: db=gadfly.gadfly(connection,dir) self.db=db self.opened=DateTime() def close(self): self.db=None del self.opened def __init__(self,connection): self.connection=connection self.open() def query(self,query_string, max_rows=9999999): if self.db is None: self.open() self._register() c=self.db.cursor() queries=filter(None, map(strip,split(query_string, '\0'))) if not queries: raise 'Query Error', 'empty query' desc=None result=[] for qs in queries: c.execute(qs) d=c.description if d is None: continue if desc is None: desc=d elif d != desc: raise 'Query Error', ( 'Multiple incompatible selects in ' 'multiple sql-statement query' ) if not result: result=c.fetchmany(max_rows) elif len(result) < max_rows: result=result+c.fetchmany(max_rows-len(result)) if desc is None: return (),() items=[] for name, type, width, ds, p, scale, null_ok in desc: if type=='NUMBER': if scale==0: type='i' else: type='n' elif type=='DATE': type='d' else: type='s' items.append({ 'name': name, 'type': type, 'width': width, 'null': null_ok, }) return items, result # Gadfly needs the extra checkpoint call. def _abort(self): self.db.rollback() self.db.checkpoint() Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/table_info.dtml100644 1007 1403 322 6515146762 24720 0ustar petrillipetrilli owned by
    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/table_menu.dtml100644 1007 1403 455 6515146762 24740 0ustar petrillipetrilli Design Input * Design Update * Design Delete Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/tables.dtml100644 1007 1403 2306 6761246501 24107 0ustar petrillipetrilli <!--#var title_or_id--> tables

    tables

    Available tables
    Statement type

    Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/ 40755 1007 1403 0 6772126760 22776 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/bin.gif100755 1007 1403 1634 6515147057 24336 0ustar petrillipetrilliGIF89a PPP@@@@@!, @yHXB !>3jܸʼn 8"“( ReH-+zrdM8Mbȓ̔@OJQ'| qiə7TN݊ubզ2: ٳ-;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/date.gif100755 1007 1403 1642 6515147060 24474 0ustar petrillipetrilliGIF89a PPP@@@@@!, @H@†2tHB!VȱŌ Ji1dE\yFIM ]zLY3Ϙ4Y UѣH gNKQ6M'MTș@v*iӧbk&]˖!;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/datetime.gif100755 1007 1403 1635 6515147061 25356 0ustar petrillipetrilliGIF89a PPP@@@@@!, @zH @B6QB)>ȱcG6qI\yPǗ/A$IȊ2a O JThƝHIHs͇SɊ8X*՜Xv5dѳh;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/field.gif100755 1007 1403 1623 6515147061 24642 0ustar petrillipetrilliGIF89a PPP@@@@@!, @pHXȐ†6\@`ĉ3fƏycD' #E0CvIS&ɛ"ɳϟ:-bPgQ*j4ҡM_} 1ʥT%V:#Я`;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/float.gif100755 1007 1403 1641 6515147062 24665 0ustar petrillipetrilliGIF89a PPP@@@@@!, @~HXpC F(3jbE#Niɓ"X"ɖ*=|q͘jrO+ JhP%dRHubYjΖX,fHU* ʴȧ]@@;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/int.gif100755 1007 1403 1626 6515147062 24355 0ustar petrillipetrilliGIF89a PPP@@@@@!, @sHXȐ† 28Q E3bD`1ċ7"I H!#:(E _ѥƛ8Yϟ@ qcLɔRFz,%TTc&Q)VCÊE ;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/stable.gif100755 1007 1403 1564 6515147063 25037 0ustar petrillipetrilliGIF89aPPP@@@@@!,@QH *\B:q"E/*̨GC)&QLrʗ*WG0kl&L:}$I4d@;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/table.gif100755 1007 1403 1556 6515147064 24656 0ustar petrillipetrilliGIF89aPPP@@@@@!,@KH@ Tpƒ #2lqB j,xQ"Ɗ'>2ȍ\ɒ0Ur&͕6of$'Ϟ;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/text.gif100755 1007 1403 1626 6515147064 24551 0ustar petrillipetrilliGIF89a PPP@@@@@!, @sHXÅB@3jܘŎ `IFS48cKQ$ə1?rϕ JTN8uɳR#F=t՝2O ڐbNEÊ ;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/time.gif100755 1007 1403 1636 6515147065 24525 0ustar petrillipetrilliGIF89a PPP@@@@@!, @{HXPB (Q3jF|“(VDH%=fYrMhr3O, JhP5?|!R;'Bƥ0VS*I JltEhӲ;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/view.gif100755 1007 1403 1575 6515147065 24543 0ustar petrillipetrilliGIF89aPPP@@@@@!,@ZH "$aB<`B(@ǎ-*IbÅ'+`#0cʄHp̓r &N<}*t΢FsL`@;Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZGadflyDA/icons/what.gif100755 1007 1403 1576 6515147066 24536 0ustar petrillipetrilliGIF89aPPP@@@@@!,@[(ThBXذ`ÅL|ć /bQG;fXPeA]4@dŃ(;̸ÇAdd a SQL Method

    Add a SQL Method

    A SQL Method allows you to access a SQL database. For more information see the Z SQL Methods User's Guide.

    In the form below Connection id is the name of the SQL Database Connection to use. Arguments is a list of variables which the SQL Method accepts. Query template is a template of the SQL statement which the SQL Method will execute.

    Id
    Title
    Connection id
    Arguments
    Query template
    Warning: There are no SQL database connections. You need to add a Zope SQL database connection before you can use a Zope SQL Method.     Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZSQLMethods/edit.dtml100644 1007 1403 4651 6771447755 24156 0ustar petrillipetrilliEdit <!--#var title_or_id-->

    Edit

    Warning: The database connection used by this method is currently not open. Warning: The database connection for this method cannot be found!
    ID
    Title
    Connection id
    Arguments
    Query template
    Warning: There are no SQL database connections. You need to add a Zope SQL database connection before you can use an Zope SQL Method. Zope-2.0.1-ZEO-nonbin/lib/python/Products/ZSQLMethods/sqlmethod.gif100755 1007 1403 1621 6700223433 25004 0ustar petrillipetrilliGIF89aPPP@@@@@!,nH(\ #BDPDjhC (#HFeʑbʔieD ``Ȟf sTJQ24T`UUZs I;Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/ 40755 1007 1403 0 6772126760 20510 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/.cvsignore100644 1007 1403 71 6676003533 22536 0ustar petrillipetrilliconfig.c sedscript Makefile Makefile.pre Makefile.pre.in Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/Index.py100644 1007 1403 23711 6716621325 22245 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Simple column indices""" __version__='$Revision: 1.26 $'[11:-2] from Globals import Persistent from BTree import BTree from intSet import intSet import operator from Missing import MV import string ListType=type([]) StringType=type('s') def nonEmpty(s): "returns true if a non-empty string or any other (nonstring) type" if type(s) is StringType: if s: return 1 else: return 0 else: return 1 class Index(Persistent): """Index object interface""" def __init__(self, data=None, schema=None, id=None, ignore_ex=None, call_methods=None): """Create an index The arguments are: 'data' -- a mapping from integer object ids to objects or records, 'schema' -- a mapping from item name to index into data records. If 'data' is a mapping to objects, then schema should ne 'None'. 'id' -- the name of the item attribute to index. This is either an attribute name or a record key. """ ###################################################################### # For b/w compatability, have to allow __init__ calls with zero args if not data==schema==id==ignore_ex==call_methods==None: self._data = data self._schema = schema self.id = id self.ignore_ex=ignore_ex self.call_methods=call_methods self._index = BTree() self._reindex() else: pass # for b/w compatability _init = __init__ def dpHasUniqueValuesFor(self, name): ' has unique values for column NAME ' if name == self.id: return 1 else: return 0 def dpUniqueValues(self, name=None, withLengths=0): """\ returns the unique values for name if withLengths is true, returns a sequence of tuples of (value, length) """ if name is None: name = self.id elif name != self.id: return [] if not withLengths: return tuple( filter(nonEmpty,self._index.keys()) ) else: rl=[] for i in self._index.keys(): if not nonEmpty(i): continue else: rl.append((i, len(self._index[i]))) return tuple(rl) def clear(self): self._index = BTree() def _reindex(self, start=0): """Recompute index data for data with ids >= start.""" index=self._index get=index.get if not start: index.clear() id = self.id if self._schema is None: f=getattr else: f = operator.__getitem__ id = self._schema[id] for i,row in self._data.items(start): k=f(row,id) if k is None or k == MV: continue set=get(k) if set is None: index[k] = set = intSet() set.insert(i) def index_item(self, i, obj=None): """Recompute index data for data with ids >= start.""" index = self._index id = self.id if (self._schema is None) or (obj is not None): f = getattr else: f = operator.__getitem__ id = self._schema[id] if obj is None: obj = self._data[i] try: k=f(obj, id) except: return if self.call_methods: k=k() if k is None or k == MV: return set = index.get(k) if set is None: index[k] = set = intSet() set.insert(i) def unindex_item(self, i, obj=None): """Recompute index data for data with ids >= start.""" index = self._index id = self.id if self._schema is None: f = getattr else: f = operator.__getitem__ id = self._schema[id] if obj is None: obj = self._data[i] try: k=f(obj, id) except: return if self.call_methods: k=k() if k is None or k == MV: return set = index.get(k) if set is not None: set.remove(i) def _apply_index(self, request, cid=''): """Apply the index to query parameters given in the argument, request The argument should be a mapping object. If the request does not contain the needed parameters, then None is returned. If the request contains a parameter with the name of the column + '_usage', it is sniffed for information on how to handle applying the index. Otherwise two objects are returned. The first object is a ResultSet containing the record numbers of the matching records. The second object is a tuple containing the names of all data fields used. """ id = self.id #name of the column cidid = "%s/%s" % (cid,id) has_key = request.has_key if has_key(cidid): keys = request[cidid] elif has_key(id): keys = request[id] else: return None if type(keys) is not ListType: keys=[keys] index = self._index r = None anyTrue = 0 opr = None if request.has_key(id+'_usage'): # see if any usage params are sent to field opr=string.split(string.lower(request[id+"_usage"]),':') opr, opr_args=opr[0], opr[1:] if opr=="range": if 'min' in opr_args: lo = min(keys) else: lo = None if 'max' in opr_args: hi = max(keys) else: hi = None anyTrue=1 try: if hi: setlist = index.items(lo,hi) else: setlist = index.items(lo) for k,set in setlist: if r is None: r = set else: r = r.union(set) except KeyError: pass else: #not a range get = index.get for key in keys: if key: anyTrue = 1 set=get(key) if set is not None: if r is None: r = set else: r = r.union(set) if r is None: if anyTrue: r=intSet() else: return None return r, (id,) Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/Lexicon.py100644 1007 1403 31565 6771512353 22606 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import string, regex, ts_regex import regsub __doc__=""" Module breaks out Zope specific methods and behavior. In addition, provides the Lexicon class which defines a word to integer mapping. """ from Splitter import Splitter from Persistence import Persistent from Acquisition import Implicit import OIBTree OIBTree=OIBTree.BTree class Lexicon(Persistent, Implicit): """ maps words to word ids and then some The Lexicon object is an attempt to abstract voacbularies out of Text indexes. This abstraction is not totally cooked yet, this module still includes the parser for the 'Text Index Query Language' and a few other hacks. """ def __init__(self): self._lexicon = OIBTree() self.counter = 0 def __getitem__(self, key): """ overload mapping behavior """ return self._lexicon[key] def set(self, word): """ return the word id of 'word' """ if self._lexicon.has_key(word): return self._lexicon[word] else: self._lexicon[intern(word)] = self.counter self.counter = self.counter + 1 return self.counter def Splitter(self, astring, words): """ wrap the splitter """ return Splitter(astring, words) AndNot = 'andnot' And = 'and' Or = 'or' Near = '...' QueryError='TextIndex.QueryError' def query(s, index, default_operator = Or, ws = (string.whitespace,)): # First replace any occurences of " and not " with " andnot " s = ts_regex.gsub('[%s]+and[%s]*not[%s]+' % (ws * 3), ' andnot ', s) q = parse(s) q = parse2(q, default_operator) return evaluate(q, index) def parse(s): '''Parse parentheses and quotes''' l = [] tmp = string.lower(s) while (1): p = parens(tmp) if (p is None): # No parentheses found. Look for quotes then exit. l = l + quotes(tmp) break else: # Look for quotes in the section of the string before # the parentheses, then parse the string inside the parens l = l + quotes(tmp[:(p[0] - 1)]) l.append(parse(tmp[p[0] : p[1]])) # continue looking through the rest of the string tmp = tmp[(p[1] + 1):] return l def parse2(q, default_operator, operator_dict = {AndNot: AndNot, And: And, Or: Or, Near: Near}, ListType=type([]), ): '''Find operators and operands''' i = 0 isop=operator_dict.has_key while (i < len(q)): if (type(q[i]) is ListType): q[i] = parse2(q[i], default_operator) # every other item, starting with the first, should be an operand if ((i % 2) != 0): # This word should be an operator; if it is not, splice in # the default operator. if type(q[i]) is not ListType and isop(q[i]): q[i] = operator_dict[q[i]] else: q[i : i] = [ default_operator ] i = i + 1 return q def parens(s, parens_re = regex.compile('(\|)').search): index=open_index=paren_count = 0 while 1: index = parens_re(s, index) if index < 0 : break if s[index] == '(': paren_count = paren_count + 1 if open_index == 0 : open_index = index + 1 else: paren_count = paren_count - 1 if paren_count == 0: return open_index, index else: index = index + 1 if paren_count == 0: # No parentheses Found return None else: raise QueryError, "Mismatched parentheses" def quotes(s, ws = (string.whitespace,)): # split up quoted regions splitted = ts_regex.split(s, '[%s]*\"[%s]*' % (ws * 2)) split=string.split if (len(splitted) > 1): if ((len(splitted) % 2) == 0): raise QueryError, "Mismatched quotes" for i in range(1,len(splitted),2): # split the quoted region into words splitted[i] = filter(None, split(splitted[i])) # put the Proxmity operator in between quoted words for j in range(1, len(splitted[i])): splitted[i][j : j] = [ Near ] for i in range(len(splitted)-1,-1,-2): # split the non-quoted region into words splitted[i:i+1] = filter(None, split(splitted[i])) splitted = filter(None, splitted) else: # No quotes, so just split the string into words splitted = filter(None, split(s)) return splitted def get_operands(q, i, index, ListType=type([]), StringType=type('')): '''Evaluate and return the left and right operands for an operator''' try: left = q[i - 1] right = q[i + 1] except IndexError: raise QueryError, "Malformed query" t=type(left) if t is ListType: left = evaluate(left, index) elif t is StringType: left=index[left] t=type(right) if t is ListType: right = evaluate(right, index) elif t is StringType: right=index[right] return (left, right) def evaluate(q, index,ListType=type([])): '''Evaluate a parsed query''' if (len(q) == 1): if (type(q[0]) is ListType): return evaluate(q[0], index) return index[q[0]] i = 0 while (i < len(q)): if q[i] is AndNot: left, right = get_operands(q, i, index) val = left.and_not(right) q[(i - 1) : (i + 2)] = [ val ] else: i = i + 1 i = 0 while (i < len(q)): if q[i] is And: left, right = get_operands(q, i, index) val = left & right q[(i - 1) : (i + 2)] = [ val ] else: i = i + 1 i = 0 while (i < len(q)): if q[i] is Or: left, right = get_operands(q, i, index) val = left | right q[(i - 1) : (i + 2)] = [ val ] else: i = i + 1 i = 0 while (i < len(q)): if q[i] is Near: left, right = get_operands(q, i, index) val = left.near(right) q[(i - 1) : (i + 2)] = [ val ] else: i = i + 1 if (len(q) != 1): raise QueryError, "Malformed query" return q[0] stop_words=( 'am', 'ii', 'iii', 'per', 'po', 're', 'a', 'about', 'above', 'across', 'after', 'afterwards', 'again', 'against', 'all', 'almost', 'alone', 'along', 'already', 'also', 'although', 'always', 'am', 'among', 'amongst', 'amoungst', 'amount', 'an', 'and', 'another', 'any', 'anyhow', 'anyone', 'anything', 'anyway', 'anywhere', 'are', 'around', 'as', 'at', 'back', 'be', 'became', 'because', 'become', 'becomes', 'becoming', 'been', 'before', 'beforehand', 'behind', 'being', 'below', 'beside', 'besides', 'between', 'beyond', 'bill', 'both', 'bottom', 'but', 'by', 'can', 'cannot', 'cant', 'con', 'could', 'couldnt', 'cry', 'describe', 'detail', 'do', 'done', 'down', 'due', 'during', 'each', 'eg', 'eight', 'either', 'eleven', 'else', 'elsewhere', 'empty', 'enough', 'even', 'ever', 'every', 'everyone', 'everything', 'everywhere', 'except', 'few', 'fifteen', 'fifty', 'fill', 'find', 'fire', 'first', 'five', 'for', 'former', 'formerly', 'forty', 'found', 'four', 'from', 'front', 'full', 'further', 'get', 'give', 'go', 'had', 'has', 'hasnt', 'have', 'he', 'hence', 'her', 'here', 'hereafter', 'hereby', 'herein', 'hereupon', 'hers', 'herself', 'him', 'himself', 'his', 'how', 'however', 'hundred', 'i', 'ie', 'if', 'in', 'inc', 'indeed', 'interest', 'into', 'is', 'it', 'its', 'itself', 'keep', 'last', 'latter', 'latterly', 'least', 'less', 'made', 'many', 'may', 'me', 'meanwhile', 'might', 'mill', 'mine', 'more', 'moreover', 'most', 'mostly', 'move', 'much', 'must', 'my', 'myself', 'name', 'namely', 'neither', 'never', 'nevertheless', 'next', 'nine', 'no', 'nobody', 'none', 'noone', 'nor', 'not', 'nothing', 'now', 'nowhere', 'of', 'off', 'often', 'on', 'once', 'one', 'only', 'onto', 'or', 'other', 'others', 'otherwise', 'our', 'ours', 'ourselves', 'out', 'over', 'own', 'per', 'perhaps', 'please', 'pre', 'put', 'rather', 're', 'same', 'see', 'seem', 'seemed', 'seeming', 'seems', 'serious', 'several', 'she', 'should', 'show', 'side', 'since', 'sincere', 'six', 'sixty', 'so', 'some', 'somehow', 'someone', 'something', 'sometime', 'sometimes', 'somewhere', 'still', 'such', 'take', 'ten', 'than', 'that', 'the', 'their', 'them', 'themselves', 'then', 'thence', 'there', 'thereafter', 'thereby', 'therefore', 'therein', 'thereupon', 'these', 'they', 'thick', 'thin', 'third', 'this', 'those', 'though', 'three', 'through', 'throughout', 'thru', 'thus', 'to', 'together', 'too', 'toward', 'towards', 'twelve', 'twenty', 'two', 'un', 'under', 'until', 'up', 'upon', 'us', 'very', 'via', 'was', 'we', 'well', 'were', 'what', 'whatever', 'when', 'whence', 'whenever', 'where', 'whereafter', 'whereas', 'whereby', 'wherein', 'whereupon', 'wherever', 'whether', 'which', 'while', 'whither', 'who', 'whoever', 'whole', 'whom', 'whose', 'why', 'will', 'with', 'within', 'without', 'would', 'yet', 'you', 'your', 'yours', 'yourself', 'yourselves', ) stop_word_dict={} for word in stop_words: stop_word_dict[word]=None Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/Query.c100644 1007 1403 64116 6671334650 22103 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ #include "Python.h" #define UNLESS(E) if(!(E)) #define ASSIGN(V,E) { PyObject *__e; __e = (E); Py_XDECREF(V); (V) = __e; } #define UNLESS_ASSIGN(V,E) ASSIGN(V, E) if (!(V)) static PyTypeObject *RegexType; static PyObject *string_lower; #define Regex_Check(ob) (ob->ob_type == RegexType) typedef struct { PyObject_HEAD PyObject *key; PyObject *tests; } FieldTestobject; staticforward PyTypeObject AttrTesttype, CompAttrTesttype, MethodTesttype; staticforward PyTypeObject ItemTesttype; typedef struct { PyObject_HEAD PyObject *tests; } Testobject; staticforward PyTypeObject Andtype, Ortype, Cmptype, Regextype, Stringtype; typedef struct { PyObject_HEAD PyObject *low; PyObject *high; } Rangeobject; staticforward PyTypeObject Rangetype; static PyObject *reprformat=NULL; static PyObject * Field_repr(FieldTestobject *self) { PyObject *r; UNLESS(reprformat) UNLESS(reprformat=PyString_FromString("%s%s")) return NULL; UNLESS(r=Py_BuildValue("s(OO)", self->ob_type->tp_name, self->key, self->tests)) return NULL; ASSIGN(r,PyString_Format(reprformat,r)); return r; } static PyObject * Test_repr(Testobject *self) { PyObject *r; UNLESS(reprformat) UNLESS(reprformat=PyString_FromString("%s%s")) return NULL; UNLESS(r=Py_BuildValue("s(O)", self->ob_type->tp_name, self->tests)) return NULL; ASSIGN(r,PyString_Format(reprformat,r)); return r; } static PyObject * Range_repr(Rangeobject *self) { PyObject *r; UNLESS(reprformat) UNLESS(reprformat=PyString_FromString("%s%s")) return NULL; UNLESS(r=Py_BuildValue("s(OO)", self->ob_type->tp_name, self->low, self->high)) return NULL; ASSIGN(r,PyString_Format(reprformat,r)); return r; } FieldTestobject * new_FieldTestobject(PyObject *key, PyObject *tests, PyTypeObject *type) { FieldTestobject *self; if (!(self = PyObject_NEW(FieldTestobject, type))) return NULL; Py_INCREF(self->key = key); Py_INCREF(self->tests = tests); return self; } static void FieldTest_dealloc(FieldTestobject *self) { Py_XDECREF(self->key); Py_XDECREF(self->tests); PyMem_DEL(self); } Testobject * new_Testobject(PyObject *tests, PyTypeObject *type) { Testobject *self; if (!(self = PyObject_NEW(Testobject, type))) return NULL; Py_INCREF(self->tests = tests); return self; } static void Test_dealloc(Testobject *self) { Py_XDECREF(self->tests); PyMem_DEL(self); } Rangeobject * new_Rangeobject(PyObject *low, PyObject *high) { Rangeobject *self; if (!(self = PyObject_NEW(Rangeobject, &Rangetype))) return NULL; Py_INCREF(self->high = high); Py_INCREF(self->low = low); return self; } static void Range_dealloc(Rangeobject *self) { Py_XDECREF(self->high); Py_XDECREF(self->low); PyMem_DEL(self); } static PyObject * Query__call__(PyObject *self, PyObject *args, PyObject *kw) { PyObject *arg; if (!(PyArg_ParseTuple(args, "O", &arg))) return NULL; return PyObject_GetItem(self, arg); } static PyObject * AttrTest__getitem__(FieldTestobject *self, PyObject *key) { PyObject *ob; UNLESS(ob=PyObject_GetAttr(key, self->key)) return NULL; ASSIGN(ob, PyObject_GetItem(self->tests, ob)); return ob; } static PyObject * CompAttrTest__getitem__(FieldTestobject *self, PyObject *key) { PyObject *ob; UNLESS(ob=PyObject_GetAttr(key, self->key)) return NULL; UNLESS_ASSIGN(ob, PyObject_CallObject(ob, NULL)) return NULL; ASSIGN(ob, PyObject_GetItem(self->tests, ob)); return ob; } static PyObject * MethodTest__getitem__(FieldTestobject *self, PyObject *key) { PyObject *ob; UNLESS(ob=PyObject_GetAttr(key, self->key)) return NULL; ASSIGN(ob,PyObject_CallObject(ob, self->tests)); return ob; } static PyObject * meaningless_len(PyObject *self) { return PyInt_FromLong(1); /* Use one so we are considered "true" */ } static PyMappingMethods AttrTest_as_mapping = { (inquiry)meaningless_len, /*mp_length*/ (binaryfunc)AttrTest__getitem__, /*mp_subscript*/ (objobjargproc)0, /*mp_ass_subscript*/ }; static PyMappingMethods CompAttrTest_as_mapping = { (inquiry)meaningless_len, /*mp_length*/ (binaryfunc)CompAttrTest__getitem__, /*mp_subscript*/ (objobjargproc)0, /*mp_ass_subscript*/ }; static PyMappingMethods MethodTest_as_mapping = { (inquiry)meaningless_len, /*mp_length*/ (binaryfunc)MethodTest__getitem__, /*mp_subscript*/ (objobjargproc)0, /*mp_ass_subscript*/ }; static PyObject * AttrTest(PyObject *self, PyObject *args) { PyObject *key, *test; if (!PyArg_ParseTuple(args, "OO", &key, &test)) return NULL; return (PyObject *)new_FieldTestobject(key, test, &AttrTesttype); } static PyObject * CompAttrTest(PyObject *self, PyObject *args) { PyObject *key, *test; if (!PyArg_ParseTuple(args, "OO", &key, &test)) return NULL; return (PyObject *)new_FieldTestobject(key, test, &CompAttrTesttype); } static PyObject * MethodTest(PyObject *self, PyObject *args) { PyObject *key, *test; if (!PyArg_ParseTuple(args, "OO", &key, &test)) return NULL; UNLESS(PyTuple_Check(test)) { PyErr_SetString(PyExc_TypeError, "second argument to MethodTest must be an " "argument tuple"); return NULL; } self=(PyObject *)new_FieldTestobject(key, test, &MethodTesttype); return self; } static PyTypeObject AttrTesttype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "AttrTest", /*tp_name*/ sizeof(FieldTestobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)FieldTest_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)Field_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &AttrTest_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)Query__call__, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, "Test objects that apply sub-tests to attribute values", }; static PyTypeObject CompAttrTesttype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "CompAttrTest", /*tp_name*/ sizeof(FieldTestobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)FieldTest_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)Field_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &CompAttrTest_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)Query__call__, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, "Test objects that apply sub-tests to computed attribute values", }; static PyTypeObject MethodTesttype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "MethodTest", /*tp_name*/ sizeof(FieldTestobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)FieldTest_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)Field_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &MethodTest_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)Query__call__, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, "Test objects that call test methods", }; static PyObject * ItemTest__getitem__(FieldTestobject *self, PyObject *key) { PyObject *ob; UNLESS(ob=PyObject_GetItem(key, self->key)) return NULL; UNLESS_ASSIGN(ob, PyObject_GetItem(self->tests, ob)) return NULL; return ob; } static PyMappingMethods ItemTest_as_mapping = { (inquiry)meaningless_len, /*mp_length*/ (binaryfunc)ItemTest__getitem__, /*mp_subscript*/ (objobjargproc)0, /*mp_ass_subscript*/ }; static PyObject * ItemTest(PyObject *self, PyObject *args) { PyObject *key, *test; if (!PyArg_ParseTuple(args, "OO", &key, &test)) return NULL; return (PyObject *)new_FieldTestobject(key, test, &ItemTesttype); } static char ItemTesttype__doc__[] = ""; static PyTypeObject ItemTesttype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "ItemTest", /*tp_name*/ sizeof(FieldTestobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)FieldTest_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)Field_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &ItemTest_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)Query__call__, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, ItemTesttype__doc__ /* Documentation string */ }; static PyObject * FieldTest(PyObject *self, PyObject *args) { PyObject *key, *test; if (!PyArg_ParseTuple(args, "OO", &key, &test)) return NULL; return (PyObject *)new_FieldTestobject(key, test, (PyString_Check(key) ? &AttrTesttype : &ItemTesttype)); } static PyObject * And__getitem__(Testobject *self, PyObject *key) { int len, i; PyObject *val=0; if ((len = PySequence_Length(self->tests)) < 0) return NULL; for (i = 0; i < len; i++) { UNLESS_ASSIGN(val,PySequence_GetItem(self->tests, i)) return NULL; UNLESS_ASSIGN(val, PyObject_GetItem(val, key)) return NULL; if (!PyObject_IsTrue(val)) return val; /* No need to convert to 0 */ } if(val) return val; else return PyInt_FromLong(1); } static PyMappingMethods And_as_mapping = { (inquiry)meaningless_len, /* mp_length */ (binaryfunc)And__getitem__, /* mp_subscript */ (objobjargproc)0, /* mp_ass_subscript */ }; static PyObject * And(PyObject *self, PyObject *args) { return (PyObject *)new_Testobject(args, &Andtype); } static char Andtype__doc__[] = ""; static PyTypeObject Andtype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "And", /*tp_name*/ sizeof(Testobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Test_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)Test_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &And_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)Query__call__, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, Andtype__doc__ /* Documentation string */ }; static PyObject * Or__getitem__(Testobject *self, PyObject *key) { int len, i; PyObject *val=0; if ((len = PySequence_Length(self->tests)) < 0) return NULL; for (i = 0; i < len; i++) { UNLESS_ASSIGN(val, PySequence_GetItem(self->tests, i)) return NULL; UNLESS_ASSIGN(val, PyObject_GetItem(val, key)) return NULL; if (PyObject_IsTrue(val)) return val; } if(val) return val; else return PyInt_FromLong(0); } static PyMappingMethods Or_as_mapping = { (inquiry)meaningless_len, /*mp_length*/ (binaryfunc)Or__getitem__, /*mp_subscript*/ (objobjargproc)0, /*mp_ass_subscript*/ }; static PyObject * Or(PyObject *self, PyObject *args) { return (PyObject *)new_Testobject(args, &Ortype); } static char Ortype__doc__[] = ""; static PyTypeObject Ortype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Or", /*tp_name*/ sizeof(Testobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Test_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)Test_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &Or_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)Query__call__, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, Ortype__doc__ /* Documentation string */ }; static PyObject * Range__getitem__(Rangeobject *self, PyObject *key) { if ((self->low ==Py_None || PyObject_Compare(key, self->low) >= 0) && (self->high==Py_None || PyObject_Compare(key, self->high) <= 0)) { return PyInt_FromLong(1); } return PyInt_FromLong(0); } static PyMappingMethods Range_as_mapping = { (inquiry)meaningless_len, /*mp_length*/ (binaryfunc)Range__getitem__, /*mp_subscript*/ (objobjargproc)0, /*mp_ass_subscript*/ }; static PyObject * Range(PyObject *self, PyObject *args) { PyObject *high, *low; if (!PyArg_ParseTuple(args, "OO", &low, &high)) return NULL; return (PyObject *)new_Rangeobject(low, high); } static PyTypeObject Rangetype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Range", /*tp_name*/ sizeof(Rangeobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Range_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)Range_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &Range_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)Query__call__, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, "Range test", /* Documentation string */ }; static PyObject * Cmp__getitem__(Testobject *self, PyObject *key) { if (PyObject_Compare(self->tests, key) == 0) { return PyInt_FromLong(1); } return PyInt_FromLong(0); } static PyMappingMethods Cmp_as_mapping = { (inquiry)meaningless_len, /*mp_length*/ (binaryfunc)Cmp__getitem__, /*mp_subscript*/ (objobjargproc)0, /*mp_ass_subscript*/ }; static PyObject * Cmp(PyObject *self, PyObject *args) { return (PyObject *)new_Testobject(args, &Cmptype); } static char Cmptype__doc__[] = ""; static PyTypeObject Cmptype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Cmp", /*tp_name*/ sizeof(Testobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Test_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)Test_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &Cmp_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)Query__call__, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, Cmptype__doc__ /* Documentation string */ }; static PyObject * Regex__getitem__(Testobject *self, PyObject *key) { PyObject *t, *search_res, *ret = NULL; if (!(t = PyTuple_New(1))) return NULL; PyTuple_SET_ITEM(t, 0, key); Py_INCREF(key); if (!(search_res = PyObject_CallObject(self->tests, t))) goto finally; if (!PyInt_Check(search_res)) { PyErr_SetString(PyExc_TypeError, "search method of regular " "expression must return an integer"); goto finally; } if (PyInt_AS_LONG((PyIntObject *)search_res) >= 0) { ret = PyInt_FromLong(1); goto finally; } ret = PyInt_FromLong(0); finally: Py_XDECREF(t); Py_XDECREF(search_res); return ret; } static PyMappingMethods Regex_as_mapping = { (inquiry)meaningless_len, /*mp_length*/ (binaryfunc)Regex__getitem__, /*mp_subscript*/ (objobjargproc)0, /*mp_ass_subscript*/ }; static PyObject * Regex(PyObject *self, PyObject *args) { PyObject *search, *r; static PyObject *search_str = 0; if (!search_str) if (!(search_str = PyString_FromString("search"))) return NULL; if (!Regex_Check(args)) { PyErr_SetString(PyExc_TypeError, "argument must be compiled regular" " expression"); return NULL; } if (!(search = PyObject_GetAttr(args, search_str))) return NULL; r = (PyObject *)new_Testobject(search, &Regextype); Py_DECREF(search); return r; } static char Regextype__doc__[] = ""; static PyTypeObject Regextype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Regex", /*tp_name*/ sizeof(Testobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Test_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)Test_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &Regex_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)Query__call__, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, Regextype__doc__ /* Documentation string */ }; static PyObject * String__getitem__(Testobject *self, PyObject *key) { char *ckey, *ctests; int lkey, ltests, k; if (!PyString_Check(key)) { PyErr_SetString(PyExc_TypeError, "argument must be string"); return NULL; } UNLESS(ckey=PyString_AsString(key)) return NULL; if((lkey=PyString_Size(key)) < 0) return NULL; UNLESS(ctests=PyString_AsString(self->tests)) return NULL; if((ltests=PyString_Size(self->tests)) < 0) return NULL; if(lkey != ltests) return PyInt_FromLong(0); while(lkey--) { k=*ckey++; if(tolower(k) != *ctests++) return PyInt_FromLong(0); } return PyInt_FromLong(1); } static PyMappingMethods String_as_mapping = { (inquiry)meaningless_len, /*mp_length*/ (binaryfunc)String__getitem__, /*mp_subscript*/ (objobjargproc)0, /*mp_ass_subscript*/ }; static PyObject * String(PyObject *self, PyObject *args) { UNLESS(args=PyObject_CallObject(string_lower,args)) return NULL; UNLESS_ASSIGN(args,(PyObject *)new_Testobject(args, &Stringtype)); return args; } static char Stringtype__doc__[] = ""; static PyTypeObject Stringtype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "String", /*tp_name*/ sizeof(Testobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Test_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)Test_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &String_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)Query__call__, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, Stringtype__doc__ /* Documentation string */ }; static struct PyMethodDef Query_methods[] = { {"AttrTest", (PyCFunction)AttrTest, 1, "AttrTest(name,subtest) -- Define a test on an attribute."}, {"CompAttrTest", (PyCFunction)CompAttrTest, 1, "CompAttrTest(name,subtest) -- Define a test on a computed attribute."}, {"MethodTest", (PyCFunction)MethodTest, 1, "MethodTest(method,arg) -- Define a test on method and argument.\n\n" "Matches occur for those objects for which: o.method(arg)\n" "is true." }, {"ItemTest", (PyCFunction)ItemTest, 1, "ItemTest(key,subtest) -- Define a test on an item."}, {"FieldTest", (PyCFunction)FieldTest, 1, "FieldTest(index,subtest) -- Define a test on an item or attribute.\n" "\n" "If 'index' is an integer, then an item test will be done, otherwise\n" "an attribute test will be done." }, {"And", (PyCFunction)And, 1, "And(*subtests) -- Create a test that is an and of several sub-tests"}, {"Or", (PyCFunction)Or, 1, "Or(*subtests) -- Create a test that is an or of several sub-tests"}, {"Range", (PyCFunction)Range, 1, "Range(min,max) -- Create a range test"}, {"Cmp", (PyCFunction)Cmp, 0, "Cmp(value) -- Define a straight comparison test with the given value"}, {"Regex", (PyCFunction)Regex, 0, "Regex(compiled_regex) -- Define a Regular-expression test"}, {"String", (PyCFunction)String, 1, "String(str) -- Define a case-insensitive test"}, {NULL, NULL} /* sentinel */ }; static char Query_module_documentation[] = "Query blocks for composing complex queries without execing Python code\n" "\n" "This module provides a number of simple types that can be used to\n" "compose complex queries that execute in a reasonable effiecient manner\n" "against objects. Each object type define objects that can be called\n" "with a single argument or with 'getitem' to check whether an object,\n" "such as a database record or a collection item satisfies a query.\n" "\n$Id: Query.c,v 1.8 1999/03/10 00:15:36 klm Exp $" ; void initQuery() { PyObject *m, *d, *regex, *string; char *rev="$Revision: 1.8 $"; AttrTesttype.ob_type =&PyType_Type; CompAttrTesttype.ob_type =&PyType_Type; MethodTesttype.ob_type =&PyType_Type; ItemTesttype.ob_type =&PyType_Type; Andtype.ob_type =&PyType_Type; Ortype.ob_type =&PyType_Type; Rangetype.ob_type =&PyType_Type; Cmptype.ob_type =&PyType_Type; Regextype.ob_type =&PyType_Type; Stringtype.ob_type =&PyType_Type; UNLESS(regex = PyImport_ImportModule("regex")) return; UNLESS_ASSIGN(regex, PyObject_CallMethod(regex, "compile", "s", "a")) return; RegexType = regex->ob_type; Py_DECREF(regex); UNLESS(string = PyImport_ImportModule("string")) return; UNLESS(string_lower = PyObject_GetAttrString(string, "lower")) return; Py_DECREF(string); /* Create the module and add the functions */ m = Py_InitModule4("Query", Query_methods, Query_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); /* Add some symbolic constants to the module */ d = PyModule_GetDict(m); PyDict_SetItemString(d, "__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); /* Check for errors */ if (PyErr_Occurred()) Py_FatalError("can't initialize module BTree"); } Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/ResultList.py100644 1007 1403 14070 6770526005 23305 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## class ResultList: def __init__(self, d, words, index, TupleType=type(())): self._index = index self._words = words if (type(d) is TupleType): self._dict = { d[0] : d[1] } else: self._dict = d def __len__(self): return len(self._dict) def __getitem__(self, key): return self._dict[key] def keys(self): return self._dict.keys() def has_key(self, key): return self._dict.has_key(key) def items(self): return self._dict.items() def __and__(self, x): result = {} dict = self._dict xdict = x._dict xhas = xdict.has_key for id, score in dict.items(): if xhas(id): result[id] = xdict[id]+score return self.__class__(result, self._words+x._words, self._index) def and_not(self, x): result = {} dict = self._dict xdict = x._dict xhas = xdict.has_key for id, score in dict.items(): if not xhas(id): result[id] = xdict[id]+score return self.__class__(result, self._words, self._index) def __or__(self, x): result = {} dict = self._dict has = dict.has_key xdict = x._dict xhas = xdict.has_key for id, score in dict.items(): if xhas(id): result[id] = xdict[id]+score else: result[id] = score for id, score in xdict.items(): if not has(id): result[id] = score return self.__class__(result, self._words+x._words, self._index) def near(self, x): result = {} dict = self._dict xdict = x._dict xhas = xdict.has_key positions = self._index.positions for id, score in dict.items(): if not xhas(id): continue p=(map(lambda i: (i,0), positions(id,self._words))+ map(lambda i: (i,1), positions(id,x._words))) p.sort() d = lp = 9999 li = None lsrc = None for i,src in p: if i is not li and src is not lsrc and li is not None: d = min(d,i-li) li = i lsrc = src if d==lp: score = min(score,xdict[id]) # synonyms else: score = (score+xdict[id])/d result[id] = score return self.__class__(result, self._words+x._words, self._index) Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/Setup100644 1007 1403 53 6740734746 21572 0ustar petrillipetrilli*shared* Splitter Splitter.c Query Query.c Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/Splitter.c100644 1007 1403 32741 6671334650 22603 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ #include "Python.h" #include #define ASSIGN(V,E) {PyObject *__e; __e=(E); Py_XDECREF(V); (V)=__e;} #define UNLESS(E) if(!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E) UNLESS(V) static PyObject *next_word(); typedef struct { PyObject_HEAD PyObject *text, *synstop; char *here, *end; int index; } Splitter; static void Splitter_reset(Splitter *self) { self->here = PyString_AsString(self->text); self->index = -1; } static void Splitter_dealloc(Splitter *self) { Py_XDECREF(self->text); Py_XDECREF(self->synstop); PyMem_DEL(self); } static int Splitter_length(Splitter *self) { PyObject *res=0; Splitter_reset(self); while(1) { UNLESS_ASSIGN(res,next_word(self,NULL,NULL)) return -1; UNLESS(PyString_Check(res)) { Py_DECREF(res); break; } } return self->index+1; } static PyObject * Splitter_concat(Splitter *self, PyObject *other) { PyErr_SetString(PyExc_TypeError, "Cannot concatenate Splitters."); return NULL; } static PyObject * Splitter_repeat(Splitter *self, long n) { PyErr_SetString(PyExc_TypeError, "Cannot repeat Splitters."); return NULL; } /* Map an input word to an output word by applying standard filtering/mapping words, including synonyms/stop words. Input is a word. Output is: None -- The word is a stop word sometext -- A replacement for the word */ static PyObject * check_synstop(Splitter *self, PyObject *word) { PyObject *value; char *cword; int len; cword = PyString_AsString(word); len = PyString_Size(word) - 1; len = PyString_Size(word); if(len < 2) /* Single-letter words are stop words! */ { Py_INCREF(Py_None); return Py_None; } /************************************************************* Test whether a word has any letters. * */ for (; --len >= 0 && ! isalpha(cword[len]); ); if (len < 0) { Py_INCREF(Py_None); return Py_None; } /* * If no letters, treat it as a stop word. *************************************************************/ Py_INCREF(word); if (self->synstop == NULL) return word; while ((value = PyObject_GetItem(self->synstop, word)) && PyString_Check(value)) { ASSIGN(word,value); if(len++ > 100) break; /* Avoid infinite recurssion */ } if (value == NULL) { PyErr_Clear(); return word; } return value; /* Which must be None! */ } #define MAX_WORD 64 /* Words longer than MAX_WORD are stemmed */ static PyObject * next_word(Splitter *self, char **startpos, char **endpos) { char wbuf[MAX_WORD]; char *end, *here, *b; int i = 0, c; PyObject *pyword, *res; here=self->here; end=self->end; b=wbuf; while (here < end) { /* skip hyphens */ if ((i > 0) && (*here == '-')) { here++; while (isspace(*here) && (here < end)) here++; continue; } c=tolower(*here); /* Check to see if this character is part of a word */ if(isalnum(c) || c=='/') { /* Found a word character */ if(startpos && i==0) *startpos=here; if(i++ < MAX_WORD) *b++ = c; } else if (i != 0) { /* We've found the end of a word */ if(i >= MAX_WORD) i=MAX_WORD; /* "stem" the long word */ UNLESS(pyword = PyString_FromStringAndSize(wbuf, i)) { self->here=here; return NULL; } UNLESS(res = check_synstop(self, pyword)) { self->here=here; Py_DECREF(pyword); return NULL; } if (res != Py_None) { if(endpos) *endpos=here; self->here=here; Py_DECREF(pyword); self->index++; return res; } /* The word is a stopword, so ignore it */ Py_DECREF(res); Py_DECREF(pyword); i = 0; b=wbuf; } here++; } self->here=here; /* We've reached the end of the string */ if(i >= MAX_WORD) i=MAX_WORD; /* "stem" the long word */ if (i == 0) { /* No words */ self->here=here; Py_INCREF(Py_None); return Py_None; } UNLESS(pyword = PyString_FromStringAndSize(wbuf, i)) return NULL; if(endpos) *endpos=here; res = check_synstop(self, pyword); Py_DECREF(pyword); if(PyString_Check(res)) self->index++; return res; } static PyObject * Splitter_item(Splitter *self, int i) { PyObject *word = NULL; if (i <= self->index) Splitter_reset(self); while(self->index < i) { Py_XDECREF(word); UNLESS(word = next_word(self,NULL,NULL)) return NULL; if (word == Py_None) { Py_DECREF(word); PyErr_SetString(PyExc_IndexError, "Splitter index out of range"); return NULL; } } return word; } static PyObject * Splitter_slice(Splitter *self, int i, int j) { PyErr_SetString(PyExc_TypeError, "Cannot slice Splitters."); return NULL; } static PySequenceMethods Splitter_as_sequence = { (inquiry)Splitter_length, /*sq_length*/ (binaryfunc)Splitter_concat, /*sq_concat*/ (intargfunc)Splitter_repeat, /*sq_repeat*/ (intargfunc)Splitter_item, /*sq_item*/ (intintargfunc)Splitter_slice, /*sq_slice*/ (intobjargproc)0, /*sq_ass_item*/ (intintobjargproc)0, /*sq_ass_slice*/ }; static PyObject * Splitter_pos(Splitter *self, PyObject *args) { char *start, *end, *ctext; PyObject *res; int i; UNLESS(PyArg_Parse(args, "i", &i)) return NULL; if (i <= self->index) Splitter_reset(self); while(self->index < i) { UNLESS(res=next_word(self, &start, &end)) return NULL; if(PyString_Check(res)) { self->index++; Py_DECREF(res); continue; } Py_DECREF(res); PyErr_SetString(PyExc_IndexError, "Splitter index out of range"); return NULL; } ctext=PyString_AsString(self->text); return Py_BuildValue("(ii)", start - ctext, end - ctext); } static PyObject * Splitter_indexes(Splitter *self, PyObject *args) { PyObject *word, *r, *w=0, *index=0; int i=0; UNLESS(PyArg_ParseTuple(args,"O",&word)) return NULL; UNLESS(r=PyList_New(0)) return NULL; UNLESS(word=check_synstop(self, word)) goto err; Splitter_reset(self); while(1) { UNLESS_ASSIGN(w,next_word(self, NULL, NULL)) goto err; UNLESS(PyString_Check(w)) break; if(PyObject_Compare(word,w)==0) { UNLESS_ASSIGN(index,PyInt_FromLong(i)) goto err; if(PyList_Append(r,index) < 0) goto err; } i++; } Py_XDECREF(w); Py_XDECREF(index); return r; err: Py_DECREF(r); Py_XDECREF(index); return NULL; } static struct PyMethodDef Splitter_methods[] = { { "pos", (PyCFunction)Splitter_pos, 0, "pos(index) -- Return the starting and ending position of a token" }, { "indexes", (PyCFunction)Splitter_indexes, METH_VARARGS, "indexes(word) -- Return al list of the indexes of word in the sequence", }, { NULL, NULL } /* sentinel */ }; static PyObject * Splitter_getattr(Splitter *self, char *name) { return Py_FindMethod(Splitter_methods, (PyObject *)self, name); } static char SplitterType__doc__[] = ""; static PyTypeObject SplitterType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Splitter", /*tp_name*/ sizeof(Splitter), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Splitter_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)Splitter_getattr, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ &Splitter_as_sequence, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, SplitterType__doc__ /* Documentation string */ }; static PyObject * get_Splitter(PyObject *modinfo, PyObject *args) { Splitter *self; PyObject *doc, *synstop = NULL; UNLESS(PyArg_ParseTuple(args,"O|O",&doc,&synstop)) return NULL; UNLESS(self = PyObject_NEW(Splitter, &SplitterType)) return NULL; if(synstop) { self->synstop=synstop; Py_INCREF(synstop); } else self->synstop=NULL; UNLESS(self->text = PyObject_Str(doc)) goto err; UNLESS(self->here=PyString_AsString(self->text)) goto err; self->end = self->here + PyString_Size(self->text); self->index = -1; return (PyObject*)self; err: Py_DECREF(self); return NULL; } static struct PyMethodDef Splitter_module_methods[] = { { "Splitter", (PyCFunction)get_Splitter, METH_VARARGS, "Splitter(doc[,synstop]) -- Return a word splitter" }, { NULL, NULL } }; static char Splitter_module_documentation[] = "Parse source strings into sequences of words\n" "\n" "for use in an inverted index\n" "\n" "$Id: Splitter.c,v 1.12 1999/03/10 00:15:36 klm Exp $\n" ; void initSplitter() { PyObject *m, *d; char *rev="$Revision: 1.12 $"; /* Create the module and add the functions */ m = Py_InitModule4("Splitter", Splitter_module_methods, Splitter_module_documentation, (PyObject*)NULL,PYTHON_API_VERSION); /* Add some symbolic constants to the module */ d = PyModule_GetDict(m); PyDict_SetItemString(d, "__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); if (PyErr_Occurred()) Py_FatalError("can't initialize module Splitter"); } Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/TextIndex.py100644 1007 1403 35007 6770526005 23112 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Text Index Notes on a new text index design The current inverted index algoirthm works well enough for our needs. Speed of the algorithm does not seem to be a problem, however, data management *is* a significant problem. In particular: - Process size grows unacceptably *during mass indexing*. - Data load and store seems to take too long. For example, clearing an inverted index and committing takes a significant amount of time. - The current trie data structure contributes significantly to the number of objects in the system. - Removal/update of documents is especially problematic. We have to either: - Unindex old version of an object before updating it. This is a real hassle for apps like sws. - Tool through entire index looking for object references. This is *totally* impractical. Some observations of competition: - Xerox system can index "5-million word document in 256k". What does this mean? - Does the system save word positions as we do? - What is the index indexing? - What was the vocabulary of the system? Let\'s see. Assume a 10,000 word vocabulary. Then we use 25-bytes per entry. Hm..... - Verity has some sense of indexing in phases and packing index. Verity keeps the index in multiple chunks and a search may operate on multiple chunks. This means that we can add data without updating large records. This may be especially handy for mass updates, like we do in cv3. In a sense we do this in cv3 and sws. We index a large batch of documents to a temporary index and then merge changes in. If "temporary" index was integral to system, then maybe merger could be done as a background task.... Tree issues Tree structures benefit small updates, because an update to an entry does not cause update of entire tree, however, each node in tree introduces overhead. Trie structure currently introduces an excessive number of nodes. Typically, a node per two or three words. Trie has potential to reduce storage because key storage is shared between words. Maybe an alternative to a Trie is some sort of nested BTree. Or maybe a Trie with some kind of binary-search-based indexing. Suppose that: - database objects were at leaves of tree - vocabulary was finite - we don\'t remove a leaf when it becomes empty Then: - After some point, tree objects no longer change If this is case, then it doesn\'t make sense to optimize tree for change. Additional notes Stemming reduces the number of words substantially. Proposal -- new TextIndex TextIndex -- word -> textSearchResult Implemented with: InvertedIndex -- word -> idSet ResultIndex -- id -> docData where: word -- is a token, typically a word, but could be a name or a number textSearchResult -- id -> (score, positions) id -- integer, say 4-byte. positions -- sequence of integers. score -- numeric measure of relevence, f(numberOfWords, positions) numberOfWords -- number of words in source document. idSet -- set of ids docData -- numberOfWords, word->positions Note that ids and positions are ints. We will build C extensions for efficiently storing and pickling structures with lots of ints. This should significantly improve space overhead and storage/retrieveal times, as well as storeage space. """ __version__='$Revision: 1.24 $'[11:-2] from Globals import Persistent import BTree, IIBTree BTree=BTree.BTree IIBTree=IIBTree.Bucket from intSet import intSet import operator from Splitter import Splitter from string import strip import string, ts_regex, regex from Lexicon import * from ResultList import ResultList class TextIndex(Persistent): def __init__(self, data=None, schema=None, id=None, ignore_ex=None, call_methods=None): """Create an index The arguments are: 'data' -- a mapping from integer object ids to objects or records, 'schema' -- a mapping from item name to index into data records. If 'data' is a mapping to objects, then schema should ne 'None'. 'id' -- the name of the item attribute to index. This is either an attribute name or a record key. 'ignore_ex' -- Tells the indexer to ignore exceptions that are rasied when indexing an object. 'call_methods' -- Tells the indexer to call methods instead of getattr or getitem to get an attribute. """ ###################################################################### # For b/w compatability, have to allow __init__ calls with zero args if not data==schema==id==ignore_ex==call_methods==None: self._data=data self._schema=schema self.id=id self.ignore_ex=ignore_ex self.call_methods=call_methods self._index=BTree() self._syn=stop_word_dict self._reindex() else: pass # for backwards compatability _init = __init__ def clear(self): self._index = BTree() def positions(self, docid, words): """Return the positions in the document for the given document id of the word, word.""" id = self.id if self._schema is None: f = getattr else: f = operator.__getitem__ id = self._schema[id] row = self._data[docid] if self.call_methods: doc = str(f(row, id)()) else: doc = str(f(row, id)) r = [] for word in words: r = r+Splitter(doc, self._syn).indexes(word) return r def index_item(self, i, obj=None, un=0): """Recompute index data for data with ids >= start. if 'obj' is passed in, it is indexed instead of _data[i]""" id = self.id if (self._schema is None) or (obj is not None): f = getattr else: f = operator.__getitem__ id = self._schema[id] if obj is None: obj = self._data[i] try: if self.call_methods: k = str(f(obj, id)()) else: k = str(f(obj, id)) self._index_document(k, i ,un) except: pass def unindex_item(self, i, obj=None): return self.index_item(i, obj, 1) def _reindex(self, start=0): """Recompute index data for data with ids >= start.""" for i in self._data.keys(start): self.index_item(i) def _index_document(self, document_text, id, un=0, tupleType=type(()), dictType=type({}), ): src = Splitter(document_text, self._syn) d = {} old = d.has_key last = None for s in src: if s[0] == '\"': last=self.subindex(s[1:-1], d, old, last) else: if old(s): if s != last: d[s] = d[s]+1 else: d[s] = 1 index = self._index get = index.get if un: for word,score in d.items(): r = get(word) if r is not None: if type(r) is tupleType: del index[word] else: if r.has_key(id): del r[id] if type(r) is dictType: if len(r) < 2: if r: for k, v in r.items(): index[word] = k,v else: del index[word] else: index[word] = r else: for word,score in d.items(): r = get(word) if r is not None: r = index[word] if type(r) is tupleType: r = {r[0]:r[1]} r[id] = score index[word] = r elif type(r) is dictType: if len(r) > 4: b = IIBTree() for k, v in r.items(): b[k] = v r = b r[id] = score index[word] = r else: r[id] = score else: index[word] = id, score def _subindex(self, isrc, d, old, last): src = Splitter(isrc, self._syn) for s in src: if s[0] == '\"': last=self.subindex(s[1:-1],d,old,last) else: if old(s): if s != last: d[s] = d[s]+1 else: d[s] = 1 return last def __getitem__(self, word): """Return an InvertedIndex-style result "list" """ src = tuple(Splitter(word, self._syn)) if not src: return ResultList({}, (word,), self) if len(src) == 1: src=src[0] if src[:1]=='"' and src[-1:]=='"': return self[src] r = self._index.get(word,None) if r is None: r = {} return ResultList(r, (word,), self) r = None for word in src: rr = self[word] if r is None: r = rr else: r = r.near(rr) return r def _apply_index(self, request, cid='', ListType=[]): """ Apply the index to query parameters given in the argument, request The argument should be a mapping object. If the request does not contain the needed parameters, then None is returned. Otherwise two objects are returned. The first object is a ResultSet containing the record numbers of the matching records. The second object is a tuple containing the names of all data fields used. """ id = self.id cidid = "%s/%s" % (cid, id) has_key = request.has_key if has_key(cidid): keys = request[cidid] elif has_key(id): keys =request[id] else: return None if type(keys) is type(''): if not keys or not strip(keys): return None keys = [keys] r = None for key in keys: key = strip(key) if not key: continue rr = intSet() try: for i,score in query(key,self).items(): if score: rr.insert(i) except KeyError: pass if r is None: r = rr else: # Note that we *and*/*narrow* multiple search terms. r = r.intersection(rr) if r is not None: return r, (id,) return intSet(), (id,) Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/UnIndex.py100644 1007 1403 23444 6743434362 22556 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Simple column indices""" __version__='$Revision: 1.9 $'[11:-2] from Globals import Persistent import BTree import IOBTree from intSet import intSet import operator from Missing import MV import string, pdb ListType=type([]) StringType=type('s') def nonEmpty(s): "returns true if a non-empty string or any other (nonstring) type" if type(s) is StringType: if s: return 1 else: return 0 else: return 1 class UnIndex(Persistent): """UnIndex object interface""" def __init__(self, id=None, ignore_ex=None, call_methods=None): """Create an unindex UnIndexes are indexes that contain two index components, the forward index (like plain index objects) and an inverted index. The inverted index is so that objects can be unindexed even when the old value of the object is not known. The arguments are: 'id' -- the name of the item attribute to index. This is either an attribute name or a record key. 'ignore_ex' -- should be set to true if you want the index to ignore exceptions raised while indexing instead of propagating them. 'call_methods' -- should be set to true if you want the index to call the attribute 'id' (note: 'id' should be callable!) You will also need to pass in an object in the index and uninded methods for this to work. """ ###################################################################### # For b/w compatability, have to allow __init__ calls with zero args if not id==ignore_ex==call_methods==None: self.id = id self.ignore_ex=ignore_ex # currently unimplimented self.call_methods=call_methods self._index = BTree.BTree() self._unindex = IOBTree.BTree() else: pass def __len__(self): return len(self._unindex) def index_object(self, i, obj, threshold=None): """ index and object 'obj' with integer id 'i'""" index = self._index unindex = self._unindex id = self.id try: k=getattr(obj, id) if callable(k): k = k() except: k = MV ## if k is None or k == MV: ## return 0 set = index.get(k) if set is None: index[k] = set = intSet() set.insert(i) unindex[i] = k self._index = index self._unindex = unindex return 1 def unindex_object(self, i): """ Unindex the object with integer id 'i' """ index = self._index unindex = self._unindex k = unindex[i] if k is None: return None set = index.get(k) if set is not None: set.remove(i) del unindex[i] self._index = index self._unindex = unindex def _apply_index(self, request, cid=''): """Apply the index to query parameters given in the argument, request The argument should be a mapping object. If the request does not contain the needed parameters, then None is returned. If the request contains a parameter with the name of the column + '_usage', it is sniffed for information on how to handle applying the index. Otherwise two objects are returned. The first object is a ResultSet containing the record numbers of the matching records. The second object is a tuple containing the names of all data fields used. """ id = self.id #name of the column cidid = "%s/%s" % (cid,id) has_key = request.has_key if has_key(cidid): keys = request[cidid] elif has_key(id): keys = request[id] else: return None if type(keys) is not ListType: keys=[keys] index = self._index r = None anyTrue = 0 opr = None if request.has_key(id+'_usage'): # see if any usage params are sent to field opr=string.split(string.lower(request[id+"_usage"]),':') opr, opr_args=opr[0], opr[1:] if opr=="range": if 'min' in opr_args: lo = min(keys) else: lo = None if 'max' in opr_args: hi = max(keys) else: hi = None anyTrue=1 try: if hi: setlist = index.items(lo,hi) else: setlist = index.items(lo) for k, set in setlist: if r is None: r = set else: r = r.union(set) except KeyError: pass else: #not a range get = index.get for key in keys: if key: anyTrue = 1 set=get(key) if set is not None: if r is None: r = set else: r = r.union(set) if r is None: if anyTrue: r=intSet() else: return None return r, (id,) def hasUniqueValuesFor(self, name): ' has unique values for column NAME ' if name == self.id: return 1 else: return 0 def uniqueValues(self, name=None, withLengths=0): """\ returns the unique values for name if withLengths is true, returns a sequence of tuples of (value, length) """ if name is None: name = self.id elif name != self.id: return [] if not withLengths: return tuple( filter(nonEmpty,self._index.keys()) ) else: rl=[] for i in self._index.keys(): if not nonEmpty(i): continue else: rl.append((i, len(self._index[i]))) return tuple(rl) def clear(self): self._index = BTree.BTree() self._unindex = IOBTree.BTree() Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/UnKeywordIndex.py100644 1007 1403 2554 6771462513 24102 0ustar petrillipetrillifrom UnIndex import UnIndex, MV, intSet from types import ListType, TupleType class UnKeywordIndex(UnIndex): """ Like an UnIndex only it indexs sequences of items Searches match any keyword. This should have an _apply_index that returns a relevance score """ def index_object(self, i, obj, threshold=None): """ index an object 'obj' with integer id 'i'""" index = self._index unindex = self._unindex id = self.id try: kws=getattr(obj, id) if callable(kws): kws = kws() except: kws = [MV] # index each item in the sequence for kw in kws: set = index.get(kw) if set is None: index[kw] = set = intSet() set.insert(i) unindex[i] = kws self._index = index self._unindex = unindex return 1 def unindex_object(self, i): """ Unindex the object with integer id 'i' """ index = self._index unindex = self._unindex kws = unindex[i] if kws is None: return None for kw in kws: set = index.get(kw) if set is not None: set.remove(i) del unindex[i] self._index = index self._unindex = unindex Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/UnTextIndex.py100644 1007 1403 30635 6771512353 23421 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Text Index The UnTextIndex falls under the 'I didnt have a better name for it' excuse. It is an 'Un' Text index because it stores a little bit of undo information so that objects can be unindexed when the old value is no longer known. """ __version__='$Revision: 1.14 $'[11:-2] from Globals import Persistent import BTree, IIBTree, IOBTree, OIBTree BTree=BTree.BTree IOBTree=IOBTree.BTree IIBucket=IIBTree.Bucket OIBTree=OIBTree.BTree from intSet import intSet import operator from Splitter import Splitter from string import strip import string, regex, regsub, pdb from Lexicon import * from ResultList import ResultList class UnTextIndex(Persistent): def __init__(self, id=None, ignore_ex=None, call_methods=None, lexicon=None): """Create an index The arguments are: 'id' -- the name of the item attribute to index. This is either an attribute name or a record key. 'ignore_ex' -- Tells the indexer to ignore exceptions that are rasied when indexing an object. 'call_methods' -- Tells the indexer to call methods instead of getattr or getitem to get an attribute. 'lexicon' is the lexicon object to specify, if None, the index will use a private lexicon. There is a ZCatalog UML model that sheds some light on what is going on here. '_index' is a BTree which maps word ids to mapping from document id to score. Something like: {'bob' : {1 : 5, 2 : 3, 42 : 9}} {'uncle' : {1 : 1}} The '_unindex' attribute is a mapping from document id to word ids. This mapping allows the catalog to unindex an object: {42 : ('bob', 'is', 'your', 'uncle') This isn't exactly how things are represented in memory, many optimizations happen along the way. """ if not id==ignore_ex==call_methods==None: self.id=id self.ignore_ex=ignore_ex self.call_methods=call_methods self._index=IOBTree() self._unindex=IOBTree() self._syn=stop_word_dict else: pass if not lexicon: self._lexicon=Lexicon() else: self._lexicon=lexicon def __len__(self): return len(self._unindex) def clear(self): self._index = IOBTree() self._unindex = IOBTree() def index_object(self, i, obj, threshold=None, tupleType=type(()), dictType=type({}), strType=type(""), callable=callable): """ Index an object: 'i' is the integer id of the document 'obj' is the objects to be indexed 'threshold' is the number of words to process between commiting subtransactions. If 'None' subtransactions are not used. the next four arguments are default optimizations. """ id = self.id try: ## sniff the object for our 'id', the 'document source' of ## the index is this attribute. If it smells callable, ## call it. k = getattr(obj, id) if callable(k): k = str(k()) else: k = str(k) except: return 0 d = OIBTree() old = d.has_key last = None ## The Splitter should now be european compliant at least. ## Someone should test this. src = self._lexicon.Splitter(k, self._syn) ## This returns a tuple of stemmed words. Stopwords have been ## stripped. for s in src: if s[0] == '\"': last=self.subindex(s[1:-1], d, old, last) else: if old(s): if s != last: d[s] = d[s]+1 else: d[s] = 1 index = self._index unindex = self._unindex lexicon = self._lexicon get = index.get unindex[i] = [] times = 0 for word, score in d.items(): if threshold is not None: if times > threshold: # commit a subtransaction hack get_transaction().commit(1) # kick the cache self._p_jar.cacheFullSweep(1) times = 0 word_id = lexicon.set(word) r = get(word_id) if r is not None: r = index[word_id] if type(r) is tupleType: r = {r[0]:r[1]} r[i] = score index[word_id] = r unindex[i].append(word_id) elif type(r) is dictType: if len(r) > 4: b = IIBucket() for k, v in r.items(): b[k] = v r = b r[i] = score index[word_id] = r unindex[i].append(word_id) else: r[i] = score else: index[word_id] = i, score unindex[i].append(word_id) times = times + 1 unindex[i] = tuple(unindex[i]) l = len(unindex[i]) self._index = index self._unindex = unindex ## return the number of words you indexed return times def unindex_object(self, i, tt=type(()) ): """ unindex object 'obj' with iteger id 'i' from the text index """ index = self._index for n in self._unindex[i]: v = index[n] if type(v) is tt: del index[n] else: del index[n][i] del self._unindex[i] self._index = index def __getitem__(self, word): """Return an InvertedIndex-style result "list" """ src = tuple(self._lexicon.Splitter(word, self._syn)) if not src: return ResultList({}, (word,), self) if len(src) == 1: src=src[0] if src[:1]=='"' and src[-1:]=='"': return self[src] r = self._index.get(self._lexicon[word], None) if r is None: r = {} return ResultList(r, (word,), self) r = None for word in src: rr = self[word] if r is None: r = rr else: r = r.near(rr) return r def _apply_index(self, request, cid='', ListType=[]): """ Apply the index to query parameters given in the argument, request The argument should be a mapping object. If the request does not contain the needed parameters, then None is returned. Otherwise two objects are returned. The first object is a ResultSet containing the record numbers of the matching records. The second object is a tuple containing the names of all data fields used. """ id = self.id if request.has_key(id): keys = request[id] else: return None if type(keys) is type(''): if not keys or not strip(keys): return None keys = [keys] r = None for key in keys: key = strip(key) if not key: continue rr = IIBucket() try: for i, score in query(key,self).items(): if score: rr[i] = score except KeyError: pass if r is None: r = rr else: # Note that we *and*/*narrow* multiple search terms. r = r.intersection(rr) if r is not None: return r, (id,) return IIBucket(), (id,) def positions(self, docid, words, obj): """Return the positions in the document for the given document id of the word, word.""" id = self.id if self._schema is None: f = getattr else: f = operator.__getitem__ id = self._schema[id] if self.call_methods: doc = str(f(obj, id)()) else: doc = str(f(obj, id)) r = [] for word in words: r = r+self._lexicon.Splitter(doc, self._syn).indexes(word) return r def _subindex(self, isrc, d, old, last): src = self._lexicon.Splitter(isrc, self._syn) for s in src: if s[0] == '\"': last=self.subindex(s[1:-1],d,old,last) else: if old(s): if s != last: d[s] = d[s]+1 else: d[s] = 1 return last Zope-2.0.1-ZEO-nonbin/lib/python/SearchIndex/__init__.py100644 1007 1403 7605 6671334650 22723 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Collected utilities to support database indexing. $Id: __init__.py,v 1.6 1999/03/10 00:15:36 klm Exp $''' __version__='$Revision: 1.6 $'[11:-2] import Query Zope-2.0.1-ZEO-nonbin/lib/python/Shared/ 40755 1007 1403 0 6772126760 17521 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ 40755 1007 1403 0 6772126760 20007 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/Record/ 40755 1007 1403 0 6772126760 21225 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/__init__.py100644 1007 1403 7503 6671334655 22224 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''$Id: __init__.py,v 1.7 1999/03/10 00:15:41 klm Exp $''' __version__='$Revision: 1.7 $'[11:-2] Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/ 40755 1007 1403 0 6772126760 20550 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/www/ 40755 1007 1403 0 6772126760 21374 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/www/DBAdapterFolder_icon.gif100755 1007 1403 1601 6441061431 26075 0ustar petrillipetrilliGIF89aPPP@@@@@!,^ :X #`H1C4 100: raise AttributeError, id i=i+1 o=o.aq_parent def myQueryIds(self): return map( lambda k, queries=self.queries: {'id': k, 'selected': k in queries}, self.ZQueryIds()) def default_input_form(id,arguments,action='query', tabs=''): if arguments: items=arguments.items() return ( "%s\n%s%s" % ( '%s Input Data\n%s\n' '
    \n' '

    %s Input Data

    \n' 'Enter query parameters:
    ' '\n' % (id,tabs,action,id), string.joinfields( map( lambda a: ('\n' ' ' % (nicify(a[0]), ( a[1].has_key('type') and ("%s:%s" % (a[0],a[1]['type'])) or a[0] ), a[1].has_key('default') and a[1]['default'] or '' )) , items ), '\n'), '\n\n
    %s' '
    \n' '\n' '\n' ' \n' ' \n' '\n' '
    \n
    \n\n\n' ) ) else: return ( '%s Input Data\n%s\n' '
    \n' '

    %s Input Data

    \n' 'This query requires no input.

    \n' '\n' '\n' ' \n' ' \n' '\n' '\n\n

    \n\n\n' % (id, tabs, action, id) ) custom_default_report_src=DocumentTemplate.File( os.path.join(dtml_dir,'customDefaultReport.dtml')) def custom_default_report(id, result, action='', no_table=0, goofy=regex.compile('[^a-zA-Z0-9_]').search ): columns=result._searchable_result_columns() __traceback_info__=columns heading=('\n%s ' % string.joinfields( map(lambda c: ' %s\n' % nicify(c['name']), columns), '' ) ) if no_table: tr, _tr, td, _td, delim = '

    ', '

    ', '', '', ',\n' else: tr, _tr, td, _td, delim = '', '', '', '', '\n' row=[] for c in columns: n=c['name'] if goofy(n) >= 0: n='expr="_[\'%s]"' % (`'"'+n`[2:]) row.append(' %s%s' % (td,n,c['type']!='s' and ' null=""' or '',_td)) row=(' %s\n%s\n %s' % (tr,string.joinfields(row,delim), _tr)) return custom_default_report_src( id=id,heading=heading,row=row,action=action,no_table=no_table) def detypify(arg): l=string.find(arg,':') if l > 0: arg=arg[:l] return arg def decode(input,output): while 1: line = input.readline() if not line: break s = binascii.a2b_base64(line[:-1]) output.write(s) def decodestring(s): f = StringIO(s) g = StringIO() decode(f, g) return g.getvalue() class Args: def __init__(self, data, keys): self._data=data self._keys=keys def items(self): return map(lambda k, d=self._data: (k,d[k]), self._keys) def values(self): return map(lambda k, d=self._data: d[k], self._keys) def keys(self): return list(self._keys) def has_key(self, key): return self._data.has_key(key) def __getitem__(self, key): return self._data[key] def __setitem__(self, key, v): self._data[key]=v def __delitem__(self, key): del self._data[key] def __len__(self): return len(self._data) def parse(text, result=None, keys=None, unparmre=ts_regex.compile( '\([\0- ]*\([^\0- =\"]+\)\)'), parmre=ts_regex.compile( '\([\0- ]*\([^\0- =\"]+\)=\([^\0- =\"]+\)\)'), qparmre=ts_regex.compile( '\([\0- ]*\([^\0- =\"]+\)="\([^"]*\)\"\)'), ): if result is None: result = {} keys=[] __traceback_info__=text ts_results = parmre.match_group(text, (1,2,3)) if ts_results: start, grps = ts_results name=grps[1] value={'default':grps[2]} l=len(grps[0]) else: ts_results = qparmre.match_group(text, (1,2,3)) if ts_results: start, grps = ts_results name=grps[1] value={'default':grps[2]} l=len(grps[0]) else: ts_results = unparmre.match_group(text, (1,2)) if ts_results: start, grps = ts_results name=grps[1] l=len(grps[0]) value={} else: if not text or not strip(text): return Args(result,keys) raise InvalidParameter, text lt=string.find(name,':') if lt > 0: value['type']=name[lt+1:] name=name[:lt] result[name]=value keys.append(name) return parse(text[l:],result,keys) def quotedHTML(text, character_entities=( ('&', '&'), ("<", '<' ), (">", '>' ), ('"', '"'))): #" for re,name in character_entities: text=replace(text,re,name) return text def nicify(name): name=replace(string.strip(name), '_',' ') return string.upper(name[:1])+name[1:] def decapitate(html, RESPONSE=None, header_re=ts_regex.compile( '\(\(' '[^\0- <>:]+:[^\n]*\n' '\|' '[ \t]+[^\0- ][^\n]*\n' '\)+\)[ \t]*\n\([\0-\377]+\)' ), space_re=ts_regex.compile('\([ \t]+\)'), name_re=ts_regex.compile('\([^\0- <>:]+\):\([^\n]*\)'), ): ts_results = header_re.match_group(html, (1,3)) if not ts_results: return html headers, html = ts_results[1] headers=string.split(headers,'\n') i=1 while i < len(headers): if not headers[i]: del headers[i] else: ts_results = space_re.match_group(headers[i], (1,)) if ts_results: headers[i-1]="%s %s" % (headers[i-1], headers[i][len(ts_reults[1]):]) del headers[i] else: i=i+1 for i in range(len(headers)): ts_results = name_re.match_group(headers[i], (1,2)) if ts_reults: k, v = ts_reults[1] v=string.strip(v) else: raise ValueError, 'Invalid Header (%d): %s ' % (i,headers[i]) RESPONSE.setHeader(k,v) return html def delimited_output(results,REQUEST,RESPONSE): delim=REQUEST['output-delimiter'] try: output_type=REQUEST['output-type'] except: output_type='text/plain' RESPONSE.setHeader('content-type', output_type) join=string.join return "%s\n%s\n" % ( join(results.names(),delim), join(map(lambda row, delim=delim, join=join: join(map(str,row),delim), results), '\n') ) Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/Connection.py100644 1007 1403 21665 6771723626 23353 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Generic Database Connection Support $Id: Connection.py,v 1.19 1999/09/21 15:43:18 jeffrey Exp $''' __version__='$Revision: 1.19 $'[11:-2] import Globals, OFS.SimpleItem, AccessControl.Role, Acquisition, sys from DateTime import DateTime from App.Dialogs import MessageDialog from Globals import HTMLFile from string import find, join, split from Aqueduct import custom_default_report from Results import Results import DocumentTemplate class Connection( Globals.Persistent, AccessControl.Role.RoleManager, OFS.SimpleItem.Item, Acquisition.Implicit, ): # Specify definitions for tabs: manage_options=( {'label':'Status', 'action':'manage_main'}, {'label':'Properties', 'action':'manage_properties'}, {'label':'Test', 'action':'manage_testForm'}, {'label':'Security', 'action':'manage_access'}, ) # Specify how individual operations add up to "permissions": __ac_permissions__=( ('View management screens', ('manage_main',)), ('Change Database Connections', ('manage_edit',)), ('Test Database Connections', ('manage_testForm','manage_test')), ('Open/Close Database Connection', ('manage_open_connection', 'manage_close_connection')), ) _v_connected='' connection_string='' def __init__(self, id, title, connection_string, check=None): self.id=id self.edit(title, connection_string, check) def __setstate__(self, state): Globals.Persistent.__setstate__(self, state) if self.connection_string: try: self.connect(self.connection_string) except: pass def title_and_id(self): s=Connection.inheritedAttribute('title_and_id')(self) if hasattr(self, '_v_connected') and self._v_connected: s="%s, which is connected" % s else: s="%s, which is not connected" % s return s def title_or_id(self): s=Connection.inheritedAttribute('title_or_id')(self) if hasattr(self, '_v_connected') and self._v_connected: s="%s (connected)" % s else: s="%s ( not connected)" % s return s def connected(self): return self._v_connected def edit(self, title, connection_string, check=1): self.title=title self.connection_string=connection_string if check: self.connect(connection_string) manage_properties=HTMLFile('connectionEdit', globals()) def manage_edit(self, title, connection_string, check=None, REQUEST=None): """Change connection """ self.edit(title, connection_string, check) if REQUEST is not None: return MessageDialog( title='Edited', message='%s has been edited.' % self.id, action ='./manage_main', ) manage_testForm=HTMLFile('connectionTestForm', globals()) def manage_test(self, query, REQUEST=None): "Executes the SQL in parameter 'query' and returns results" dbc=self() #get our connection res=dbc.query(query) result=Results(res) if REQUEST is None: return result #return unadulterated result objects if result._searchable_result_columns(): r=custom_default_report(self.id, result) else: r='This was not a query.' report=DocumentTemplate.HTML( '\n' '\n
    \n%s\n\n' '

    SQL Used:
    \n
    \n%s\n
    \n
    \n' '' % (r, query)) report=apply(report,(self,REQUEST),{self.id:result}) return report manage_main=HTMLFile('connectionStatus', globals()) def manage_close_connection(self, REQUEST): " " try: self._v_database_connection.close() except: pass self._v_connected='' return self.manage_main(self, REQUEST) def manage_open_connection(self, REQUEST=None): " " self.connect(self.connection_string) return self.manage_main(self, REQUEST) def __call__(self, v=None): try: return self._v_database_connection except AttributeError: s=self.connection_string if s: return self.connect(s) raise 'Database Not Connected',( '''The database connection is not connected''') def connect(self,s): try: self._v_database_connection.close() except: pass self._v_connected='' DB=self.factory() try: try: self._v_database_connection=DB(s) except: t, v, tb = sys.exc_type, sys.exc_value, sys.exc_traceback raise 'BadRequest', ( 'Invalid connection string: %s
    \n' '\n' % (s,t,v)), tb finally: tb=None self._v_connected=DateTime() return self def sql_quote__(self, v): if find(v,"\'") >= 0: v=join(split(v,"\'"),"''") return "'%s'" % v Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/DA.py100644 1007 1403 42271 6762543345 21532 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Generic Database adapter $Id: DA.py,v 1.72 1999/08/30 18:01:09 jim Exp $''' __version__='$Revision: 1.72 $'[11:-2] import OFS.SimpleItem, Aqueduct, RDB import DocumentTemplate, marshal, md5, base64, Acquisition, os from Aqueduct import decodestring, parse from Aqueduct import custom_default_report, default_input_form from Globals import HTMLFile, MessageDialog from cStringIO import StringIO import sys, Globals, OFS.SimpleItem, AccessControl.Role from string import atoi, find, join, split import DocumentTemplate, sqlvar, sqltest, sqlgroup from time import time from zlib import compress, decompress from DateTime.DateTime import DateTime md5new=md5.new import ExtensionClass import DocumentTemplate.DT_Util from cPickle import dumps, loads from Results import Results from App.Extensions import getBrain try: from IOBTree import Bucket except: Bucket=lambda:{} class SQL(DocumentTemplate.HTML): commands={} for k, v in DocumentTemplate.HTML.commands.items(): commands[k]=v commands['sqlvar' ]=sqlvar.SQLVar commands['sqltest']=sqltest.SQLTest commands['sqlgroup' ]=sqlgroup.SQLGroup class DA( Aqueduct.BaseQuery,Acquisition.Implicit, Globals.Persistent, AccessControl.Role.RoleManager, OFS.SimpleItem.Item, ): 'Database Adapter' _col=None max_rows_=1000 cache_time_=0 max_cache_=100 class_name_=class_file_='' allow_simple_one_argument_traversal=None manage_options=( {'label':'Edit', 'action':'manage_main'}, {'label':'Test', 'action':'manage_testForm'}, {'label':'Advanced', 'action':'manage_advancedForm'}, {'label':'Security', 'action':'manage_access'}, ) # Specify how individual operations add up to "permissions": __ac_permissions__=( ('View management screens', ( 'manage_main', 'index_html', 'manage_advancedForm', 'PrincipiaSearchSource' )), ('Change Database Methods', ('manage_edit','manage_advanced', 'manage_testForm','manage_test')), ('Use Database Methods', ('__call__',''), ('Anonymous','Manager')), ) def __init__(self, id, title, connection_id, arguments, template): self.id=id self.manage_edit(title, connection_id, arguments, template) manage_advancedForm=HTMLFile('advanced', globals()) test_url___roles__=None def test_url_(self): 'Method for testing server connection information' return 'PING' _size_changes={ 'Bigger': (5,5), 'Smaller': (-5,-5), 'Narrower': (0,-5), 'Wider': (0,5), 'Taller': (5,0), 'Shorter': (-5,0), } def _er(self,title,connection_id,arguments,template, SUBMIT,sql_pref__cols,sql_pref__rows,REQUEST): dr,dc = self._size_changes[SUBMIT] rows=max(1,atoi(sql_pref__rows)+dr) cols=max(40,atoi(sql_pref__cols)+dc) e=(DateTime('GMT') + 365).rfc822() resp=REQUEST['RESPONSE'] resp.setCookie('sql_pref__rows',str(rows),path='/',expires=e) resp.setCookie('sql_pref__cols',str(cols),path='/',expires=e) return self.manage_main( self,REQUEST, title=title, arguments_src=arguments, connection_id=connection_id, src=template, sql_pref__cols=cols,sql_pref__rows=rows) def manage_edit(self,title,connection_id,arguments,template, SUBMIT='Change',sql_pref__cols='50', sql_pref__rows='20', REQUEST=None): """Change database method properties The 'connection_id' argument is the id of a database connection that resides in the current folder or in a folder above the current folder. The database should understand SQL. The 'arguments' argument is a string containing an arguments specification, as would be given in the SQL method cration form. The 'template' argument is a string containing the source for the SQL Template. """ if self._size_changes.has_key(SUBMIT): return self._er(title,connection_id,arguments,template, SUBMIT,sql_pref__cols,sql_pref__rows,REQUEST) self.title=title self.connection_id=connection_id self.arguments_src=arguments self._arg=parse(arguments) self.src=template self.template=t=SQL(template) t.cook() self._v_cache={}, Bucket() if REQUEST: if SUBMIT=='Change and Test': return self.manage_testForm(REQUEST) return self.manage_editedDialog(REQUEST) return '' def manage_advanced(self, max_rows, max_cache, cache_time, class_name, class_file, direct=None, REQUEST=None): """Change advanced properties The arguments are: max_rows -- The maximum number of rows to be returned from a query. max_cache -- The maximum number of results to cache cache_time -- The maximum amound of time to use a cached result. class_name -- The name of a class that provides additional attributes for result record objects. This class will be a base class of the result record class. class_file -- The name of the file containing the class definition. The class file normally resides in the 'Extensions' directory, however, the file name may have a prefix of 'product.', indicating that it should be found in a product directory. For example, if the class file is: 'ACMEWidgets.foo', then an attempt will first be made to use the file 'lib/python/Products/ACMEWidgets/Extensions/foo.py'. If this failes, then the file 'Extensions/ACMEWidgets.foo.py' will be used. """ self.max_rows_ = max_rows self.max_cache_, self.cache_time_ = max_cache, cache_time self._v_cache={}, Bucket() self.class_name_, self.class_file_ = class_name, class_file self._v_brain=getBrain(self.class_file_, self.class_name_, 1) self.allow_simple_one_argument_traversal=direct if REQUEST is not None: return self.manage_editedDialog(REQUEST) #def getFindContent(self): # """Return content for use by the Find machinery.""" # return '%s\n%s' % (self.arguments_src, self.src) def PrincipiaSearchSource(self): """Return content for use by the Find machinery.""" return '%s\n%s' % (self.arguments_src, self.src) def manage_testForm(self, REQUEST): " " input_src=default_input_form(self.title_or_id(), self._arg, 'manage_test', '') return DocumentTemplate.HTML(input_src)(self, REQUEST, HTTP_REFERER='') def manage_test(self, REQUEST): ' ' src="Could not render the query template!" result=() t=v=tb=None try: try: src=self(REQUEST, src__=1) if find(src,'\0'): src=join(split(src,'\0'),'\n'+'-'*60+'\n') result=self(REQUEST, test__=1) if result._searchable_result_columns(): r=custom_default_report(self.id, result) else: r='This was not a query.' except: t, v, tb = sys.exc_info() r='Error, %s: %s' % (t, v) report=DocumentTemplate.HTML( '\n' '\n
    \n%s\n\n' '
    SQL used:
    \n
    \n%s\n
    \n
    \n' '' % (r,src)) report=apply(report,(self,REQUEST),{self.id:result}) if tb is not None: self.raise_standardErrorMessage( None, REQUEST, t, v, tb, None, report) return report finally: tb=None def index_html(self, URL1): " " raise 'Redirect', ("%s/manage_testForm" % URL1) def _searchable_arguments(self): return self._arg def _searchable_result_columns(self): return self._col def _cached_result(self, DB__, query): # Try to fetch from cache if hasattr(self,'_v_cache'): cache=self._v_cache else: cache=self._v_cache={}, Bucket() cache, tcache = cache max_cache=self.max_cache_ now=time() t=now-self.cache_time_ if len(cache) > max_cache / 2: keys=tcache.keys() keys.reverse() while keys and (len(keys) > max_cache or keys[-1] < t): key=keys[-1] q=tcache[key] del tcache[key] del cache[q] del keys[-1] if cache.has_key(query): k, r = cache[query] if k > t: return r result=apply(DB__.query, query) if self.cache_time_ > 0: tcache[int(now)]=query cache[query]= now, result return result def __call__(self, REQUEST=None, __ick__=None, src__=0, test__=0, **kw): """Call the database method The arguments to the method should be passed via keyword arguments, or in a single mapping object. If no arguments are given, and if the method was invoked through the Web, then the method will try to acquire and use the Web REQUEST object as the argument mapping. The returned value is a sequence of record objects. """ if REQUEST is None: if kw: REQUEST=kw else: if hasattr(self, 'REQUEST'): REQUEST=self.REQUEST else: REQUEST={} try: dbc=getattr(self, self.connection_id) except AttributeError: raise AttributeError, ( "The database connection, %s, cannot be found.") try: DB__=dbc() except: raise 'Database Error', ( '%s is not connected to a database' % self.id) if hasattr(self, 'aq_parent'): p=self.aq_parent else: p=None argdata=self._argdata(REQUEST) argdata['sql_delimiter']='\0' argdata['sql_quote__']=dbc.sql_quote__ query=apply(self.template, (p,), argdata) if src__: return query if self.cache_time_ > 0 and self.max_cache_ > 0: result=self._cached_result(DB__, (query, self.max_rows_)) else: result=DB__.query(query, self.max_rows_) if hasattr(self, '_v_brain'): brain=self._v_brain else: brain=self._v_brain=getBrain(self.class_file_, self.class_name_) if type(result) is type(''): f=StringIO() f.write(result) f.seek(0) result=RDB.File(f,brain,p) else: result=Results(result, brain, p) columns=result._searchable_result_columns() if test__ and columns != self._col: self._col=columns return result def da_has_single_argument(self): return len(self._arg)==1 def __getitem__(self, key): args=self._arg if self.allow_simple_one_argument_traversal and len(args)==1: results=self({args.keys()[0]: key}) if results: if len(results) > 1: raise KeyError, key else: raise KeyError, key r=results[0] # if hasattr(self, 'aq_parent'): r=r.__of__(self.aq_parent) return r self._arg[key] # raise KeyError if not an arg return Traverse(self,{},key) def connectionIsValid(self): return (hasattr(self, self.connection_id) and hasattr(getattr(self, self.connection_id), 'connected')) def connected(self): return getattr(getattr(self, self.connection_id), 'connected')() Globals.default__class_init__(DA) ListType=type([]) class Traverse(ExtensionClass.Base): """Helper class for 'traversing' searches during URL traversal """ _r=None _da=None def __init__(self, da, args, name=None): self._da=da self._args=args self._name=name def __bobo_traverse__(self, REQUEST, key): name=self._name da=self.__dict__['_da'] args=self._args if name: if args.has_key(name): v=args[name] if type(v) is not ListType: v=[v] v.append(key) key=v args[name]=key if len(args) < len(da._arg): return self.__class__(da, args) key=self # "consume" key elif da._arg.has_key(key): return self.__class__(da, args, key) results=da(args) if results: if len(results) > 1: try: return results[atoi(key)].__of__(da) except: raise KeyError, key else: raise KeyError, key r=results[0] # if hasattr(da, 'aq_parent'): r=r.__of__(da.aq_parent) self._r=r if key is self: return r if hasattr(r,'__bobo_traverse__'): try: return r.__bobo_traverse__(REQUEST, key) except: pass try: return getattr(r,key) except AttributeError, v: if str(v) != key: raise AttributeError, v return r[key] def __getattr__(self, name): r=self.__dict__['_r'] if hasattr(r, name): return getattr(r,name) return getattr(self.__dict__['_da'], name) Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/RDB.py100644 1007 1403 23271 6671334660 21651 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Class for reading RDB files $Id: RDB.py,v 1.23 1999/03/10 00:15:44 klm Exp $''' __version__='$Revision: 1.23 $'[11:-2] import regex, regsub from string import split, strip, lower, upper, atof, atoi, atol, find, join import DateTime from Missing import MV from array import array from Record import Record from Acquisition import Implicit import ExtensionClass def parse_text(s): if find(s,'\\') < 0 and (find(s,'\\t') < 0 and find(s,'\\n') < 0): return s r=[] for x in split(s,'\\\\'): x=join(split(x,'\\n'),'\n') r.append(join(split(x,'\\t'),'\t')) return join(r,'\\') Parsers={'n': atof, 'i': atoi, 'l': atol, 'd': DateTime.DateTime, 't': parse_text, } record_classes={} class SQLAlias(ExtensionClass.Base): def __init__(self, name): self._n=name def __of__(self, parent): return getattr(parent, self._n) class NoBrains: pass class DatabaseResults: """Class for reading RDB files """ _index=None def __init__(self,file,brains=NoBrains, parent=None): self._file=file readline=file.readline line=readline() self._parent=parent comment_pattern=regex.compile('#') while line and comment_pattern.match(line) >= 0: line=readline() line=line[:-1] if line and line[-1:] in '\r\n': line=line[:-1] self._names=names=split(line,'\t') if not names: raise ValueError, 'No column names' aliases=[] self._schema=schema={} i=0 for name in names: name=strip(name) if not name: raise ValueError, 'Empty column name, %s' % name if schema.has_key(name): raise ValueError, 'Duplicate column name, %s' % name schema[name]=i n=lower(name) if n != name: aliases.append((n, SQLAlias(name))) n=upper(name) if n != name: aliases.append((n, SQLAlias(name))) i=i+1 self._nv=nv=len(names) line=readline() line=line[:-1] if line[-1:] in '\r\n': line=line[:-1] self._defs=defs=split(line,'\t') if not defs: raise ValueError, 'No column definitions' if len(defs) != nv: raise ValueError, ( """The number of column names and the number of column definitions are different.""") i=0 self._parsers=parsers=[] defre=regex.compile('\([0-9]*\)\([a-zA-Z]\)?') self._data_dictionary=dd={} self.__items__=items=[] for _def in defs: _def=strip(_def) if not _def: raise ValueError, ('Empty column definition for %s' % names[i]) if defre.match(_def) < 0: raise ValueError, ( 'Invalid column definition for, %s, for %s' % _def, names[i]) type=lower(defre.group(2)) width=defre.group(1) if width: width=atoi(width) else: width=8 try: parser=Parsers[type] except: parser=str name=names[i] d={'name': name, 'type': type, 'width': width, 'parser': parser} items.append(d) dd[name]=d parsers.append(i,parser) i=i+1 # Create a record class to hold the records. names=tuple(names) if record_classes.has_key((names,brains)): r=record_classes[names,brains] else: class r(Record, Implicit, brains): 'Result record class' r.__record_schema__=schema for k in filter(lambda k: k[:2]=='__', Record.__dict__.keys()): setattr(r,k,getattr(Record,k)) record_classes[names,brains]=r # Add SQL Aliases d=r.__dict__ for k, v in aliases: if not hasattr(r,k): d[k]=v if hasattr(brains, '__init__'): binit=brains.__init__ if hasattr(binit,'im_func'): binit=binit.im_func def __init__(self, data, parent, binit=binit): Record.__init__(self,data) binit(self.__of__(parent)) r.__dict__['__init__']=__init__ self._class=r # OK, we've read meta data, now get line indexes p=file.tell() save=self._lines=array('i') save=save.append l=readline() while l: save(p) p=p+len(l) l=readline() def _searchable_result_columns(self): return self.__items__ def names(self): return self._names def data_dictionary(self): return self._data_dictionary def __len__(self): return len(self._lines) def __getitem__(self,index): if index==self._index: return self._row file=self._file file.seek(self._lines[index]) line=file.readline() line=line[:-1] if line and line[-1:] in '\r\n': line=line[:-1] fields=split(line,'\t') l=len(fields) nv=self._nv if l != nv: if l < nv: fields=fields+['']*(nv-l) else: raise ValueError, ( """The number of items in record %s is invalid 
    %s\n%s\n%s\n%s
    """ % (index, ('='*40), line, ('='*40), fields)) for i, parser in self._parsers: try: v=parser(fields[i]) except: if fields[i]: raise ValueError, ( """Invalid value, %s, for %s in record %s""" % (fields[i], self._names[i], index)) else: v=MV fields[i]=v parent=self._parent fields=self._class(fields, parent) self._index=index self._row=fields if parent is None: return fields return fields.__of__(parent) File=DatabaseResults Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/Results.py100644 1007 1403 20036 6736431202 22667 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import ExtensionClass import string from string import strip, lower, upper, join from Acquisition import Implicit from Record import Record record_classes={} class SQLAlias(ExtensionClass.Base): def __init__(self, name): self._n=name def __of__(self, parent): return getattr(parent, self._n) class NoBrains: pass class Results: """Class for providing a nice interface to DBI result data """ _index=None def __init__(self,(items,data),brains=NoBrains, parent=None): self._data=data self.__items__=items self._parent=parent self._names=names=[] self._schema=schema={} self._data_dictionary=dd={} aliases=[] i=0 for item in items: name=item['name'] name=strip(name) if not name: raise ValueError, 'Empty column name, %s' % name if schema.has_key(name): raise ValueError, 'Duplicate column name, %s' % name schema[name]=i n=lower(name) if n != name: aliases.append((n, SQLAlias(name))) n=upper(name) if n != name: aliases.append((n, SQLAlias(name))) dd[name]=item names.append(name) i=i+1 self._nv=nv=len(names) # Create a record class to hold the records. names=tuple(names) if record_classes.has_key((names,brains)): r=record_classes[names,brains] else: class r(Record, Implicit, brains): 'Result record class' r.__record_schema__=schema for k in filter(lambda k: k[:2]=='__', Record.__dict__.keys()): setattr(r,k,getattr(Record,k)) record_classes[names,brains]=r # Add SQL Aliases d=r.__dict__ for k, v in aliases: if not hasattr(r,k): d[k]=v if hasattr(brains, '__init__'): binit=brains.__init__ if hasattr(binit,'im_func'): binit=binit.im_func def __init__(self, data, parent, binit=binit): Record.__init__(self,data) if parent is not None: self=self.__of__(parent) binit(self) r.__dict__['__init__']=__init__ self._class=r # OK, we've read meta data, now get line indexes def _searchable_result_columns(self): return self.__items__ def names(self): return self._names def data_dictionary(self): return self._data_dictionary def __len__(self): return len(self._data) def __getitem__(self,index): if index==self._index: return self._row parent=self._parent fields=self._class(self._data[index], parent) self._index=index self._row=fields if parent is None: return fields return fields.__of__(parent) def tuples(self): return map(tuple, self) def dictionaries(self): r=[] a=r.append names=self.names() for row in self: d={} for n in names: d[n]=row[n] a(d) return r def asRDB(self): # Waaaaa r=[] append=r.append strings=[] nstrings=[] items=self.__items__ indexes=range(len(items)) join=string.join for i in indexes: item=items[i] t=lower(item['type']) if t=='s' or t=='t': t=='t' strings.append(i) else: nstrings.append(i) if item.has_key('width'): append('%s%s' % (item['width'], t)) else: r.append(t) r=[join(self._names, '\t'), join(r,'\t')] append=r.append find=string.find split=string.split row=['']*len(items) tostr=str for d in self._data: for i in strings: v=tostr(d[i]) if v: if find(v,'\\') > 0: v=join(split(v,'\\'),'\\\\') if find(v,'\t') > 0: v=join(split(v,'\t'),'\\t') if find(v,'\n') > 0: v=join(split(v,'\n'),'\\n') row[i]=v for i in nstrings: row[i]=tostr(d[i]) append(join(row,'\t')) append('') return join(r,'\n') Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/Search.py100644 1007 1403 21442 6754346447 22455 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Search Interface Wizard $Id: Search.py,v 1.12 1999/08/11 19:21:11 jim Exp $''' __version__='$Revision: 1.12 $'[11:-2] from Globals import HTMLFile from Aqueduct import custom_default_report, nicify, Args from string import join addForm=HTMLFile('searchAdd', globals()) def manage_addZSearch(self, report_id, report_title, report_style, input_id, input_title, queries=[], REQUEST=None): 'add a report' if not queries: raise ValueError, ( 'No searchable objects were selected') if not report_id: raise ValueError, ( 'No report id were specified') if input_title and not input_id: raise ValueError, ( 'No input id were specified') qs=map(lambda q, self=self: _getquery(self, q), queries) arguments={} keys=[] for q in qs: id=q.id if input_id: for name, arg in q._searchable_arguments().items(): if len(qs) > 1: key="%s/%s" % (id,name) else: key=name arguments[key]=arg keys.append(key) if q._searchable_result_columns() is None: raise 'Unusable Searchable Error',( """The input searchable object, %s, has not been tested. Until it has been tested, it\'s output schema is unknown, and a report cannot be generated. Before creating a report from this query, you must try out the query. To try out the query, click here. """ % (q.title_and_id(), id)) if input_id: arguments=Args(arguments, keys) self.manage_addDocument( input_id,input_title, default_input_form(arguments, report_id)) self.manage_addDocument( report_id,report_title, ('\n%s\n' '' % join(map(lambda q, report_style=report_style: custom_default_report(q.id, q, no_table=report_style), qs), '\n
    \n'))) if REQUEST: return self.manage_main(self,REQUEST) def ZQueryIds(self): # Note that report server configurations will expend on this t=[] ids={} old=ids.has_key o=self n=0 while 1: # Look for queries try: map=o.objectMap() except AttributeError: map=() for i in map: try: id=i['id'] if (not old(id) and hasattr(getattr(o,id),'_searchable_arguments') ): t.append(i['id']) ids[id]=1 except: pass # Now extend search to parent try: o=o.aq_parent except: return t if n > 100: return t # Seat belt n=n+1 def _getquery(self,id): o=self i=0 while 1: __traceback_info__=o q=getattr(o,id) try: if hasattr(q,'_searchable_arguments'): try: q=q.__of__(self.aq_parent) except: pass return q except: pass if i > 100: raise AttributeError, id i=i+1 o=o.aq_parent def default_input_form(arguments,action='query', tabs=''): if arguments: items=arguments.items() return ( "%s\n%s%s" % ( '\n%s\n' '
    \n' '

    \n' 'Enter query parameters:
    ' '\n' % (tabs,action), join( map( lambda a: ('\n' ' ' % (nicify(a[0]), ( a[1].has_key('type') and ("%s:%s" % (a[0],a[1]['type'])) or a[0] ), a[1].has_key('default') and a[1]['default'] or '' )) , items ), '\n'), '\n\n
    %s' '
    \n' '\n' '
    \n
    \n' '\n' ) ) else: return ( '\n%s\n' '
    \n' '

    \n' 'This query requires no input.

    \n' '\n' '\n\n

    \n' '\n' % (tabs, action) ) Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/THUNK.py100644 1007 1403 11130 6770200037 22110 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import TM, ThreadLock from TM import Surrogate thunk_lock=ThreadLock.allocate_lock() class THUNKED_TM(TM.TM): """A big heavy hammer for handling non-thread safe DAs """ def _register(self): if not self._registered: thunk_lock.acquire() try: get_transaction().register(Surrogate(self)) self._begin() except: thunk_lock.release() raise else: self._registered=1 def tpc_finish(self, *ignored): if self._registered: try: self._finish() finally: thunk_lock.release() self._registered=0 def abort(self, *ignored): if self._registered: try: self._abort() finally: thunk_lock.release() self._registered=0 Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/TM.py100644 1007 1403 11552 6770204417 21555 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Provide support for linking an external transaction manager with Zope's """ class TM: """Mix-in class that provides transaction management support A base class should call self._register() whenever it performs any transaction-dependent operations (e.g. sql statements). The base class may need to override tpc_finish and tpc_abort. """ _registered=None def _begin(self): pass def _register(self): if not self._registered: try: get_transaction().register(Surrogate(self)) self._begin() self._registered=1 except: pass def tpc_begin(self, *ignored): pass commit=tpc_abort=tpc_begin def _finish(self): self.db.commit() def _abort(self): self.db.rollback() def tpc_finish(self, *ignored): try: self._finish() finally: self._registered=0 def abort(self, *ignored): try: self._abort() finally: self._registered=0 class Surrogate: def __init__(self, db): self._p_jar=db self.__inform_commit__=db.tpc_finish self.__inform_abort__=db.tpc_abort Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/__init__.py100644 1007 1403 7332 6671334660 22761 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/advanced.dtml100644 1007 1403 3666 6761246513 23304 0ustar petrillipetrilli<!--#var title_or_id--> Advanced Options

    Advanced Options

    ID
    Title
    Maximum number of rows retrieved
    Maximum number of results in the cache
    Maximum time (seconds) to cache results
    Allow direct traversal CHECKED >


    You may specify a class for the data records. This class must be defined in a file that resides in the Extensions directory of this Zope installation.
    Class name
    Class file
    Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/connectionAdd.dtml100644 1007 1403 2355 6761246513 24301 0ustar petrillipetrilli Add <!--#var default_title-->

    Add

    Id
    Title
    Database Connection String
    Connect immediately

    Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/connectionEdit.dtml100644 1007 1403 2257 6761246513 24477 0ustar petrillipetrilli Edit <!--#var title_or_id-->

    Edit

    Id
    Title
    Database Connection String
    Connect immediately

    Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/connectionStatus.dtml100644 1007 1403 2116 6454726346 25075 0ustar petrillipetrilli <!--#var title_or_id--> Status

    Status

    Id
    Title
    Database Connection String
    The database connection is open.
    The database connection is not open.
    Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/connectionTestForm.dtml100644 1007 1403 1142 6771723626 25353 0ustar petrillipetrilli Test &dtml-title_or_id;

    Test query on

    Query:
     
    Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/customDefaultReport.dtml100644 1007 1403 1667 6642231625 25545 0ustar petrillipetrilli (Previous results) %(else no_table)[ %(heading)s %(else)] %(row)s %(else no_table)[
    %(else)] (Next results) There was no data matching this query. Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/dbi_db.py100644 1007 1403 17641 6671334660 22451 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''short description $Id: dbi_db.py,v 1.7 1999/03/10 00:15:44 klm Exp $''' # Copyright # # Copyright 1997 Digital Creations, Inc, 910 Princess Anne # Street, Suite 300, Fredericksburg, Virginia 22401 U.S.A. All # rights reserved. # __version__='$Revision: 1.7 $'[11:-2] import string, sys from string import strip, split, find, join failures=0 calls=0 nonselect_desc=[ ('Query', 'STRING', 62, 62, 0, 0, 1), ('Status', 'STRING', 12, 12, 0, 0, 1), ('Calls', 'STRING', 12, 12, 0, 0, 1), ] class DB: _p_oid=_p_changed=_registered=None defs={'STRING':'s', 'NUMBER':'n', 'DATE':'d'} def Database_Connection(self, string): # Create a dbi-compatible database connection raise 'ImplementedBySubclass', ( 'attempt to create a database connection for an abstract dbi') Database_Error='Should be overriden by subclass' def __init__(self,connection): self.connection=connection db=self.db=self.Database_Connection(connection) self.cursor=db.cursor() def str(self,v, StringType=type('')): if v is None: return '' r=str(v) if r[-1:]=='L' and type(v) is not StringType: r=r[:-1] return r def __inform_commit__(self, *ignored): self._registered=None self.db.commit() def __inform_abort__(self, *ignored): self._registered=None self.db.rollback() def register(self): if self._registered: return get_transaction().register(self) self._registered=1 def query(self,query_string, max_rows=9999999): global failures, calls calls=calls+1 try: c=self.cursor self.register() queries=filter(None, map(strip,split(query_string, '\0'))) if not queries: raise 'Query Error', 'empty query' if len(queries) > 1: result=[] for qs in queries: r=c.execute(qs) if r is None: raise 'Query Error', ( 'select in multiple sql-statement query' ) result.append((qs, str(`r`), calls)) desc=nonselect_desc else: query_string=queries[0] r=c.execute(query_string) if r is None: result=c.fetchmany(max_rows) desc=c.description else: result=((query_string, str(`r`), calls),) desc=nonselect_desc failures=0 c.close() except self.Database_Error, mess: c.close() self.db.rollback() failures=failures+1 if ((find(mess,": invalid") < 0 and find(mess,"PARSE") < 0) or # DBI IS stupid find(mess, "Error while trying to retrieve text for error") > 0 or # If we have a large number of consecutive failures, # our connection is probably dead. failures > 100 ): # Hm. maybe the db is hosed. Let's try once to restart it. failures=0 c.close() self.db.close() db=self.db=self.Database_Connection(self.connection) self.cursor=db.cursor() c=self.cursor c.execute(query_string) result=c.fetchall() desc=c.description else: raise sys.exc_type, sys.exc_value, sys.exc_traceback if result: result=join( map( lambda row, self=self: join(map(self.str,row),'\t'), result), '\n')+'\n' else: result='' return ( "%s\n%s\n%s" % ( join(map(lambda d: d[0],desc), '\t'), join( map( lambda d, defs=self.defs: "%d%s" % (d[2],defs[d[1]]), desc), '\t'), result, ) ) Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/searchAdd.dtml100644 1007 1403 3354 6707223356 23407 0ustar petrillipetrilliAdd a Search Interface

    Add a Search Interface

    A Search Interface allows you to search Zope databases. The Search Interface will create a search-input form and a report for displaying the search results.

    In the form below, seachable objects are the objects (usually Z SQL Methods) to be searched. Report Id and Search Input Id are the ids of the report and search form objects that will be created. Report Style indicates the type of report to generate.

    Select one
    or more
    searchable objects
    Report Id
    Report Title
    Report Style
    Search Input Id
    Search Input Title
    Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/sqlgroup.py100644 1007 1403 16520 6671334660 23115 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''Inserting optional tests with 'sqlgroup' It is sometimes useful to make inputs to an SQL statement optinal. Doing so can be difficult, because not only must the test be inserted conditionally, but SQL boolean operators may or may not need to be inserted depending on whether other, possibly optional, comparisons have been done. The 'sqlgroup' tag automates the conditional insertion of boolean operators. The 'sqlgroup' tag is a block tag. It can have any number of 'and' and 'or' continuation tags. The 'sqlgroup' tag has an optional attribure, 'required' to specify groups that must include at least one test. This is useful when you want to make sure that a query is qualified, but want to be very flexible about how it is qualified. Suppose we want to find people with a given first or nick name, city or minimum and maximum age. Suppose we want all inputs to be optional, but want to require *some* input. We can use DTML source like the following:: age >= age <= This example illustrates how groups can be nested to control boolean evaluation order. It also illustrates that the grouping facility can also be used with other DTML tags like 'if' tags. The 'sqlgroup' tag checks to see if text to be inserted contains other than whitespace characters. If it does, then it is inserted with the appropriate boolean operator, as indicated by use of an 'and' or 'or' tag, otherwise, no text is inserted. ''' ############################################################################ # Copyright # # Copyright 1996 Digital Creations, L.C., 910 Princess Anne # Street, Suite 300, Fredericksburg, Virginia 22401 U.S.A. All # rights reserved. # ############################################################################ __rcs_id__='$Id: sqlgroup.py,v 1.6 1999/03/10 00:15:44 klm Exp $' __version__='$Revision: 1.6 $'[11:-2] from DocumentTemplate.DT_Util import parse_params str=__builtins__['str'] from string import strip, join import sys class SQLGroup: blockContinuations='and','or' name='sqlgroup' required=None where=None def __init__(self, blocks): self.blocks=blocks tname, args, section = blocks[0] self.__name__="%s %s" % (tname, args) args = parse_params(args, required=1, where=1) if args.has_key(''): args[args['']]=1 if args.has_key('required'): self.required=args['required'] if args.has_key('where'): self.where=args['where'] def render(self,md): r=[] for tname, args, section in self.blocks: __traceback_info__=tname s=strip(section(None, md)) if s: if r: r.append(tname) r.append("%s\n" % s) if r: if len(r) > 1: r="(%s)\n" % join(r,' ') else: r=r[0] if self.where: r="where\n"+r return r if self.required: raise 'Input Error', 'Not enough input was provided!

    ' return '' __call__=render Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/sqltest.py100644 1007 1403 21367 6761300210 22725 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''Inserting optional tests with 'sqlgroup' It is sometimes useful to make inputs to an SQL statement optinal. Doing so can be difficult, because not only must the test be inserted conditionally, but SQL boolean operators may or may not need to be inserted depending on whether other, possibly optional, comparisons have been done. The 'sqlgroup' tag automates the conditional insertion of boolean operators. The 'sqlgroup' tag is a block tag that has no attributes. It can have any number of 'and' and 'or' continuation tags. Suppose we want to find all people with a given first or nick name and optionally constrain the search by city and minimum and maximum age. Suppose we want all inputs to be optional. We can use DTML source like the following:: age >= age <= This example illustrates how groups can be nested to control boolean evaluation order. It also illustrates that the grouping facility can also be used with other DTML tags like 'if' tags. The 'sqlgroup' tag checks to see if text to be inserted contains other than whitespace characters. If it does, then it is inserted with the appropriate boolean operator, as indicated by use of an 'and' or 'or' tag, otherwise, no text is inserted. ''' __rcs_id__='$Id: sqltest.py,v 1.10 1999/08/26 17:59:36 jim Exp $' ############################################################################ # Copyright # # Copyright 1996 Digital Creations, L.C., 910 Princess Anne # Street, Suite 300, Fredericksburg, Virginia 22401 U.S.A. All # rights reserved. # ############################################################################ __version__='$Revision: 1.10 $'[11:-2] import sys from DocumentTemplate.DT_Util import ParseError, parse_params, name_param str=__builtins__['str'] from string import find, split, join, atoi, atof from types import ListType, TupleType, StringType class SQLTest: name='sqltest' optional=multiple=None def __init__(self, args): args = parse_params(args, name='', type=None, column=None, multiple=1, optional=1) self.__name__ = name_param(args,'sqlvar') has_key=args.has_key if not has_key('type'): raise ParseError, ('the type attribute is required', 'dtvar') self.type=t=args['type'] if not valid_type(t): raise ParseError, ('invalid type, %s' % t, 'dtvar') if has_key('optional'): self.optional=args['optional'] if has_key('multiple'): self.multiple=args['multiple'] if has_key('column'): self.column=args['column'] else: self.column=self.__name__ def render(self, md): name=self.__name__ t=self.type try: v = md[name] except KeyError, key: if str(key)==name and self.optional: return '' raise KeyError, key, sys.exc_traceback if type(v) in (ListType, TupleType): if len(v) > 1 and not self.multiple: raise 'Multiple Values', ( 'multiple values are not allowed for %s' % name) else: v=[v] vs=[] for v in v: if not v and type(v) is StringType and t != 'string': continue if t=='int': try: if type(v) is StringType: atoi(v) else: v=str(int(v)) except: raise ValueError, ( 'Invalid integer value for %s' % name) elif t=='float': if not v and type(v) is StringType: continue try: if type(v) is StringType: atof(v) else: v=str(float(v)) except: raise ValueError, ( 'Invalid floating-point value for %s' % name) else: v=str(v) v=md.getitem('sql_quote__',0)(v) #if find(v,"\'") >= 0: v=join(split(v,"\'"),"''") #v="'%s'" % v vs.append(v) if not vs: if self.optional: return '' raise 'Missing Input', ( 'No input was provided for %s' % name) if len(vs) > 1: vs=join(map(str,vs),', ') return "%s in (%s)" % (self.column,vs) return "%s=%s" % (self.column,vs[0]) __call__=render valid_type={'int':1, 'float':1, 'string':1, 'nb': 1}.has_key Zope-2.0.1-ZEO-nonbin/lib/python/Shared/DC/ZRDB/sqlvar.py100644 1007 1403 17306 6703433062 22544 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''Inserting values with the 'sqlvar' tag The 'sqlvar' tag is used to type-safely insert values into SQL text. The 'sqlvar' tag is similar to the 'var' tag, except that it replaces text formatting parameters with SQL type information. The sqlvar tag has the following attributes: name -- The name of the variable to insert. As with other DTML tags, the 'name=' prefix may be, and usually is, ommitted. type -- The data type of the value to be inserted. This attribute is required and may be one of 'string', 'int', 'float', or 'nb'. The 'nb' data type indicates a string that must have a length that is greater than 0. optional -- A flag indicating that a value is optional. If a value is optional and is not provided (or is blank when a non-blank value is expected), then the string 'null' is inserted. For example, given the tag:: ') doubledash = re.compile('--') attrfind = re.compile( _S + '(?P' + _Name + ')' '(' + _opS + '=' + _opS + '(?P\'[^\']*\'|"[^"]*"|[-a-zA-Z0-9.:+*%?!()_#=~]+))') attrtrans = string.maketrans(' \r\n\t', ' ') # XML parser base class -- find tags and call handler functions. # Usage: p = XMLParser(); p.feed(data); ...; p.close(). # The dtd is defined by deriving a class which defines methods with # special names to handle tags: start_foo and end_foo to handle # and , respectively. The data between tags is passed to the # parser by calling self.handle_data() with some data as argument (the # data may be split up in arbutrary chunks). Entity references are # passed by calling self.handle_entityref() with the entity reference # as argument. class XMLParser: # Interface -- initialize and reset this instance def __init__(self, verbose=0): self.verbose = verbose self.reset() # Interface -- reset this instance. Loses all unprocessed data def reset(self): self.rawdata = '' self.stack = [] self.nomoretags = 0 self.literal = 0 self.lineno = 1 self.__at_start = 1 self.__seen_doctype = None self.__seen_starttag = 0 # For derived classes only -- enter literal mode (CDATA) till EOF def setnomoretags(self): self.nomoretags = self.literal = 1 # For derived classes only -- enter literal mode (CDATA) def setliteral(self, *args): self.literal = 1 # Interface -- feed some data to the parser. Call this as # often as you want, with as little or as much text as you # want (may include '\n'). (This just saves the text, all the # processing is done by goahead().) def feed(self, data): self.rawdata = self.rawdata + data self.goahead(0) # Interface -- handle the remaining data def close(self): self.goahead(1) # Interface -- translate references def translate_references(self, data, all = 1): i = 0 while 1: res = amp.search(data, i) if res is None: return data res = ref.match(data, res.start(0)) if res is None: self.syntax_error("bogus `&'") i =i+1 continue i = res.end(0) if data[i - 1] != ';': self.syntax_error("`;' missing after entity/char reference") i = i-1 str = res.group(1) pre = data[:res.start(0)] post = data[i:] if str[0] == '#': if str[1] == 'x': str = chr(string.atoi(str[2:], 16)) else: str = chr(string.atoi(str[1:])) data = pre + str + post i = res.start(0)+len(str) elif all: if self.entitydefs.has_key(str): data = pre + self.entitydefs[str] + post i = res.start(0) # rescan substituted text else: self.syntax_error('reference to unknown entity') # can't do it, so keep the entity ref in data = pre + '&' + str + ';' + post i = res.start(0) + len(str) + 2 else: # just translating character references pass # i is already postioned correctly # Internal -- handle data as far as reasonable. May leave state # and data to be processed by a subsequent call. If 'end' is # true, force handling all data as if followed by EOF marker. def goahead(self, end): rawdata = self.rawdata i = 0 n = len(rawdata) while i < n: if i > 0: self.__at_start = 0 if self.nomoretags: data = rawdata[i:n] self.handle_data(data) self.lineno = self.lineno + string.count(data, '\n') i = n break res = interesting.search(rawdata, i) if res: j = res.start(0) else: j = n if i < j: if self.__at_start: self.syntax_error('illegal data at start of file') self.__at_start = 0 data = rawdata[i:j] if not self.stack and not space.match(data): self.syntax_error('data not in content') if illegal.search(data): self.syntax_error('illegal character in content') self.handle_data(data) self.lineno = self.lineno + string.count(data, '\n') i = j if i == n: break if rawdata[i] == '<': if starttagopen.match(rawdata, i): if self.literal: data = rawdata[i] self.handle_data(data) self.lineno = self.lineno + string.count(data, '\n') i = i+1 continue k = self.parse_starttag(i) if k < 0: break self.__seen_starttag = 1 self.lineno = self.lineno + string.count(rawdata[i:k], '\n') i = k continue if endtagopen.match(rawdata, i): k = self.parse_endtag(i) if k < 0: break self.lineno = self.lineno + string.count(rawdata[i:k], '\n') i = k self.literal = 0 continue if commentopen.match(rawdata, i): if self.literal: data = rawdata[i] self.handle_data(data) self.lineno = self.lineno + string.count(data, '\n') i = i+1 continue k = self.parse_comment(i) if k < 0: break self.lineno = self.lineno + string.count(rawdata[i:k], '\n') i = k continue if cdataopen.match(rawdata, i): k = self.parse_cdata(i) if k < 0: break self.lineno = self.lineno + string.count(rawdata[i:i], '\n') i = k continue res = xmldecl.match(rawdata, i) if res: if not self.__at_start: self.syntax_error(" declaration not at start of document") version, encoding, standalone = res.group('version', 'encoding', 'standalone') if version[1:-1] != '1.0': raise RuntimeError, 'only XML version 1.0 supported' if encoding: encoding = encoding[1:-1] if standalone: standalone = standalone[1:-1] self.handle_xml(encoding, standalone) i = res.end(0) continue res = procopen.match(rawdata, i) if res: k = self.parse_proc(i) if k < 0: break self.lineno = self.lineno + string.count(rawdata[i:k], '\n') i = k continue res = doctype.match(rawdata, i) if res: if self.literal: data = rawdata[i] self.handle_data(data) self.lineno = self.lineno + string.count(data, '\n') i = i+1 continue if self.__seen_doctype: self.syntax_error('multiple DOCTYPE elements') if self.__seen_starttag: self.syntax_error('DOCTYPE not at beginning of document') k = self.parse_doctype(res) if k < 0: break self.__seen_doctype = res.group('name') self.lineno = self.lineno + string.count(rawdata[i:k], '\n') i = k continue elif rawdata[i] == '&': res = charref.match(rawdata, i) if res is not None: i = res.end(0) if rawdata[i-1] != ';': self.syntax_error("`;' missing in charref") i = i-1 if not self.stack: self.syntax_error('data not in content') self.handle_charref(res.group('char')[:-1]) self.lineno = self.lineno + string.count(res.group(0), '\n') continue res = entityref.match(rawdata, i) if res is not None: i = res.end(0) if rawdata[i-1] != ';': self.syntax_error("`;' missing in entityref") i = i-1 name = res.group('name') if self.entitydefs.has_key(name): self.rawdata = rawdata = rawdata[:res.start(0)] + self.entitydefs[name] + rawdata[i:] n = len(rawdata) i = res.start(0) else: self.syntax_error('reference to unknown entity') self.unknown_entityref(name) self.lineno = self.lineno + string.count(res.group(0), '\n') continue elif rawdata[i] == ']': if n-i < 3: break if cdataclose.match(rawdata, i): self.syntax_error("bogus `]]>'") self.handle_data(rawdata[i]) i = i+1 continue else: raise RuntimeError, 'neither < nor & ??' # We get here only if incomplete matches but # nothing else break # end while if i > 0: self.__at_start = 0 if end and i < n: data = rawdata[i] self.syntax_error("bogus `%s'" % data) if illegal.search(data): self.syntax_error('illegal character in content') self.handle_data(data) self.lineno = self.lineno + string.count(data, '\n') self.rawdata = rawdata[i+1:] return self.goahead(end) self.rawdata = rawdata[i:] if end: if not self.__seen_starttag: self.syntax_error('no elements in file') if self.stack: self.syntax_error('missing end tags') while self.stack: self.finish_endtag(self.stack[-1]) # Internal -- parse comment, return length or -1 if not terminated def parse_comment(self, i): rawdata = self.rawdata if rawdata[i:i+4] <> '

    This is the Document in the Folder.

    ''' methodattr='_ZClassMethodPermissionMapperMethod_' class MW(ExtensionClass.Base): def __init__(self, meth): self.__dict__[methodattr]=meth def __of__(self, parent): m=getattr(self, methodattr) m=self.__dict__[methodattr] wrapper=getattr(m, '_permissionMapper', None) if wrapper is None: wrapper=PermissionMapper() if hasattr(m,'__of__'): return aqwrap(m, wrapper, parent) return m def findMethodIds(klass): r=[] for k, v in klass.__dict__.items(): if type(v) is W or type(v) is MW: r.append(k) return r # Backward compat. Waaaaa class W(Globals.Persistent, MW): _View_Permission='_View_Permission' def __getattr__(self, name): # We want to make sure that any non-explicitly set methods are # private! try: # Oh this sucks return W.inheritedAttribute('__getattr__')(self, name) except: pass if name[:1]=='_' and name[-11:]=="_Permission": return '' raise AttributeError, name def __of__(self, parent): m=getattr(self, methodattr) m=self.__dict__[methodattr] if hasattr(m,'__of__'): return aqwrap(m, self, parent) return m Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/ObjectManager.py100644 1007 1403 12567 6700733476 23244 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Object-manager mix-in for ZClasses """ import OFS.ObjectManager, Globals, Products class SubobjectsSheet(OFS.PropertySheets.PropertySheet, OFS.PropertySheets.View): """Provide management view for selecting sub-objects. """ manage=Globals.HTMLFile('subobjects', globals()) def possible_meta_types(self): return self.aq_acquire('_product_meta_types')+Products.meta_types def selected_meta_types(self): return map(lambda v: v['name'], self.getClassAttr('meta_types',())) def manage_edit(self, meta_types=(), isFolderish=None, REQUEST=None): "Edit object management properties" self.setClassAttr('meta_types', filter( lambda d, m=meta_types: d['name'] in m, self.possible_meta_types() )) self.setClassAttr('isPrincipiaFolderish', isFolderish) if REQUEST is not None: return self.manage( self, REQUEST, manage_tabs_message='Changes were applied' ) def isFolderish(self): return self.getClassAttr('isPrincipiaFolderish', 0, 1) class ZObjectManagerPropertySheets(OFS.PropertySheets.PropertySheets): subobjects=SubobjectsSheet('subobjects') class ObjectManager(OFS.ObjectManager.ObjectManager): _zclass_method_meta_types=() def all_meta_types(self): return self.meta_types+self._zclass_method_meta_types class ZObjectManager: """Mix-in for Object Management """ _zclass_=ObjectManager propertysheets=ZObjectManagerPropertySheets() manage_options=( {'label': 'Subobjects', 'action' :'propertysheets/subobjects/manage'}, ) Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/Property.py100644 1007 1403 35054 6754661516 22367 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Provide management of common instance property sheets """ import OFS.PropertySheets, Globals, OFS.SimpleItem, OFS.PropertyManager import Acquisition from string import join, upper from AccessControl.Permission import pname class ClassCaretaker: def __init__(self, klass): self.__dict__['_k']=klass def __getattr__(self, name): return getattr(self._k, name) def __setattr__(self, name, v): klass=self._k setattr(klass, name, v) if not getattr(klass,'_p_changed',None): get_transaction().register(klass) klass._p_changed=1 def __delattr__(self, name): klass=self._k delattr(klass, name) if not getattr(klass,'_p_changed',None): get_transaction().register(klass) klass._p_changed=1 class ZCommonSheet(OFS.PropertySheets.PropertySheet, OFS.SimpleItem.Item): "Property Sheet that has properties common to all instances" meta_type="Common Instance Property Sheet" _properties=() manage_options=( {'label':'Properties', 'action':'manage'}, {'label':'Define Permissions', 'action':'manage_security'}, ) __ac_permissions__=( ('Manage Z Classes', ('', 'manage')), ) def __init__(self, id, title): self.id=id self.title=title self._md={} def manage_afterAdd(self,item,container): if item is not self: return if self._properties: raise ValueError, ( 'Non-empty propertysheets cannot currently be ' 'added (or copied).

    ') def v_self(self): klass=self.aq_inner.aq_parent.aq_parent.aq_parent._zclass_ return ClassCaretaker(klass) def p_self(self): return self def _view_widget_for_type(self, t, id): if t not in ('lines', 'tokens'): return '' % id return """ """ % (id, id) def manage_createView(self, id, title='', ps_view_type=None, REQUEST=None): """Create a view of a property sheet """ if ps_view_type == 'Edit': return self.manage_createEditor(id, title, REQUEST) r=['', ''] a=r.append for p in self.propertyMap(): pid=p['id'] pid=upper(pid[:1])+pid[1:] a(' ' % pid) a(' ' % self._view_widget_for_type(p['type'], p['id']) ) a(' ') a('
    %s%s
    ') a('') r=join(r,'\n') self.aq_parent.aq_parent.methods.manage_addDTMLMethod(id, title, r) if REQUEST is not None: REQUEST['RESPONSE'].redirect(REQUEST['URL3']+'/methods/manage') def _edit_widget_for_type(self, t, id, p): if t in ('int', 'long', 'float', 'date', 'string'): if t=='string': q=' html_quote' else: q='' return (''' ''' % (id, t, id, q) ) if t=='boolean': return (''' CHECKED>''' % (id, id) ) if t=='tokens': return (''' ''' % (id, id) ) if t=='text': return (''' ''' % (id, id) ) if t=='lines': return (''' ''' % (id, id) ) if t=='selection': return (''' No value for %(id)s ''' % p ) return '' def manage_beforeDelete(self, item, container): if self is item: for d in self._properties: self.delClassAttr(d['id']) def manage_createEditor(self, id, title='', REQUEST=None): """Create an edit interface for a property sheet """ r=['<!--#var title_or_id-->', '', '', '

    ' % self.id] a=r.append for p in self.propertyMap(): a(' ' % p['id']) a(' ' % self._edit_widget_for_type(p['type'], p['id'], p) ) a(' ') a(' ') a('
    %s%s
    ') a(' ') a(' ') a('
    ') a('') r=join(r,'\n') self.aq_parent.aq_parent.methods.manage_addDTMLMethod(id, title, r) if REQUEST is not None: REQUEST['RESPONSE'].redirect(REQUEST['URL3']+'/methods/manage') def permissionMappingPossibleValues(self): return self.classDefinedAndInheritedPermissions() manage_security=Globals.HTMLFile('AccessControl/methodAccess') def manage_getPermissionMapping(self): ips=self.getClassAttr('propertysheets') ips=getattr(ips, self.id) # ugh perms={} for p in self.classDefinedAndInheritedPermissions(): perms[pname(p)]=p r=[] for p in property_sheet_permissions: v=getattr(ips, pname(p)) r.append( {'permission_name': p, 'class_permission': perms.get(v,'') }) return r def manage_setPermissionMapping(self, permission_names=[], class_permissions=[], REQUEST=None): "Change property sheet permissions" ips=self.getClassAttr('propertysheets') ips=getattr(ips, self.id) perms=self.classDefinedAndInheritedPermissions() for i in range(len(permission_names)): name=permission_names[i] p=class_permissions[i] if p and (p not in perms): __traceback_info__=perms, p, i raise 'Invalid class permission' if name not in property_sheet_permissions: continue setattr(ips, pname(name), pname(p)) if REQUEST is not None: return self.manage_security( self, REQUEST, manage_tabs_message='The permission mapping has been updated') property_sheet_permissions=( # 'Access contents information', 'Manage properties', ) class ZInstanceSheet(OFS.PropertySheets.FixedSchema, OFS.PropertySheets.View, ): "Waaa this is too hard" _Manage_properties_Permission='_Manage_properties_Permission' _Access_contents_information_Permission='_View_Permission' __ac_permissions__=( ('Manage properties', ('manage_addProperty', 'manage_editProperties', 'manage_delProperties', 'manage_changeProperties', 'manage', )), ('Access contents information', ('hasProperty', 'propertyIds', 'propertyValues','propertyItems',''), ), ) def v_self(self): return self.aq_inner.aq_parent.aq_parent Globals.default__class_init__(ZInstanceSheet) def rclass(klass): if not getattr(klass, '_p_changed', 0): get_transaction().register(klass) klass._p_changed=1 class ZInstanceSheetsSheet(OFS.PropertySheets.View, OFS.ObjectManager.ObjectManager): "Manage common property sheets" # Note that we need to make sure we add and remove # instance sheets. id='common' isPrincipiaFolderish=1 icon="p_/Propertysheets_icon" dontAllowCopyAndPaste=1 def tpURL(self): return 'propertysheets/common' def _setOb(self, id, value): setattr(self, id, value) pc=self.aq_inner.aq_parent.aq_parent._zclass_propertysheets_class setattr(pc,id,ZInstanceSheet(id,value)) pc.__propset_attrs__=tuple(map(lambda o: o['id'], self._objects)) rclass(pc) def _delOb(self, id): delattr(self, id) pc=self.aq_inner.aq_parent.aq_parent._zclass_propertysheets_class try: delattr(pc,id) except: pass pc.__propset_attrs__=tuple(map(lambda o: o['id'], self._objects)) rclass(pc) meta_types=( Globals.Dictionary(name=ZCommonSheet.meta_type, action='manage_addCommonSheetForm'), ) def all_meta_types(self): return self.meta_types manage=Globals.HTMLFile('OFS/main') manage_addCommonSheetForm=Globals.HTMLFile('addCommonSheet', globals()) def manage_addCommonSheet(self, id, title, REQUEST=None): "Add a property sheet" o=ZCommonSheet(id, title) self._setObject(id, o) if REQUEST is not None: return self.manage_main(self, REQUEST) def klass_sequence(klass,attr,result=None): if result is None: result={} if hasattr(klass,attr): for i in getattr(klass,attr): result[i]=1 for klass in klass.__bases__: klass_sequence(klass, attr, result) return result class ZInstanceSheets(OFS.PropertySheets.PropertySheets, Globals.Persistent): " " __propset_attrs__=() _implements_the_notional_subclassable_propertysheet_class_interface=1 def __propsets__(self): propsets=ZInstanceSheets.inheritedAttribute('__propsets__')(self) r=[] for id in klass_sequence(self.__class__,'__propset_attrs__').keys(): r.append(getattr(self, id)) return propsets+tuple(r) Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/ZClass.py100755 1007 1403 51430 6754315347 21737 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Zope Classes """ import Globals, string, OFS.SimpleItem, OFS.PropertySheets, Products import Method, Basic, Property, AccessControl.Role from ZPublisher.mapply import mapply from ExtensionClass import Base from App.FactoryDispatcher import FactoryDispatcher from ComputedAttribute import ComputedAttribute from OFS.misc_ import p_ p_.ZClass_Icon=Globals.ImageFile('class.gif', globals()) class PersistentClass(Base): def __class_init__(self): pass manage_addZClassForm=Globals.HTMLFile( 'addZClass', globals(), default_class_='OFS.SimpleItem Item', CreateAFactory=1) def find_class(ob, name): # Walk up the aq hierarchy, looking for a ZClass # with the given name. while 1: if hasattr(ob, name): return getattr(ob, name) elif hasattr(ob, '_getOb'): try: return ob._getOb(name) except: pass if hasattr(ob, 'aq_parent'): ob=ob.aq_parent continue raise AttributeError, name def dbVersionEquals(ver): # A helper function to isolate db version checking. return hasattr(Globals, 'DatabaseVersion') and \ Globals.DatabaseVersion == ver def manage_addZClass(self, id, title='', baseclasses=[], meta_type='', CreateAFactory=0, REQUEST=None): """Add a Z Class """ bases=[] for b in baseclasses: if Products.meta_classes.has_key(b): bases.append(Products.meta_classes[b]) else: base=find_class(self, b) bases.append(base) Z=ZClass(id,title,bases) if meta_type: Z._zclass_.meta_type=meta_type self._setObject(id, Z) if CreateAFactory and meta_type: self.manage_addDTMLMethod( id+'_addForm', id+' constructor input form', addFormDefault % {'id': id, 'meta_type': meta_type}, ) self.manage_addDTMLMethod( id+'_add', id+' constructor', addDefault % {'id': id}, ) self.manage_addPermission( id+'_add_permission', id+' constructor permission', 'Add %ss' % meta_type ) self.manage_addPrincipiaFactory( id+'_factory', id+' factory', meta_type, id+'_addForm', 'Add %ss' % meta_type ) Z=self._getOb(id) Z.propertysheets.permissions.manage_edit( selected=['Add %ss' % id]) Z.manage_setPermissionMapping( permission_names=['Create class instances'], class_permissions=['Add %ss' % meta_type] ) if REQUEST is not None: return self.manage_main(self,REQUEST, update_menu=1) def manage_subclassableClassNames(self): r={} r.update(Products.meta_class_info) while 1: if not hasattr(self, 'objectItems'): break for k, v in self.objectItems(): if hasattr(v,'_zclass_') and not r.has_key(k): r[k]=v.title_and_id() if not hasattr(self, 'aq_parent'): break self=self.aq_parent r=r.items() r.sort() return r class Template: _p_oid=_p_jar=__module__=None _p_changed=0 icon='' def PersistentClassDict(doc=None, meta_type=None): # Build new class dict dict={} dict.update(Template.__dict__) if meta_type is not None: dict['meta_type']=dict['__doc__']=meta_type if doc is not None: dict['__doc__']=doc return dict _marker=[] class ZClass(OFS.SimpleItem.SimpleItem): """Zope Class """ meta_type="Z Class" icon="p_/ZClass_Icon" instance__meta_type='instance' instance__icon='' __propsets__=() isPrincipiaFolderish=1 __ac_permissions__=( ('Create class instances', ('', '__call__', 'index_html', 'createInObjectManager')), ) def __init__(self, id, title, bases): """Build a Zope class A Zope class is *really* a meta-class that manages an actual extension class that is instantiated to create instances. """ self.id=id self.title=title # Set up base classes for new class, the meta class prop # sheet and the class(/instance) prop sheet. base_classes=[PersistentClass] zsheets_base_classes=[PersistentClass] isheets_base_classes=[PersistentClass] zbases=[ZStandardSheets] for z in bases: base_classes.append(z._zclass_) zbases.append(z) try: zsheets_base_classes.append(z.propertysheets.__class__) except AttributeError: pass try: psc=z._zclass_.propertysheets.__class__ if getattr(psc, '_implements_the_notional' '_subclassable_propertysheet' '_class_interface', 0): isheets_base_classes.append(psc) except AttributeError: pass base_classes.append(OFS.SimpleItem.SimpleItem) zsheets_base_classes.append(ZClassSheets) isheets_base_classes.append(Property.ZInstanceSheets) # Create the meta-class property sheet zsheets_class=type(PersistentClass)( id+'_ZPropertySheetsClass', tuple(zsheets_base_classes)+(Globals.Persistent,), PersistentClassDict(id+'_ZPropertySheetsClass')) self.propertysheets=sheets=zsheets_class() # Create the class self._zclass_=c=type(PersistentClass)( id, tuple(base_classes), PersistentClassDict(title or id)) c.__ac_permissions__=() # Create the class(/instance) prop sheet *class* isheets_class=type(PersistentClass)( id+'_PropertySheetsClass', tuple(isheets_base_classes), PersistentClassDict(id+' Property Sheets')) # Record the class property sheet class in the meta-class so # that we can manage it: self._zclass_propertysheets_class=isheets_class # Finally create the new classes propertysheets by instantiating the # propertysheets class. c.propertysheets=isheets_class() # Save base meta-classes: self._zbases=zbases def cb_isCopyable(self): pass # for now, we don't allow ZClasses to be copied. cb_isMovable=cb_isCopyable def _setBasesHoldOnToYourButts(self, bases): # Eeeek copy=self.__class__(self.id, self.title, bases) copy._zclass_.__dict__.update( self._zclass_.__dict__) get_transaction().register( copy._zclass_) self._p_jar.exchange(self._zclass_, copy._zclass_) self._zclass_=copy._zclass_ copy._zclass_propertysheets_class.__dict__.update( self._zclass_propertysheets_class.__dict__) get_transaction().register( copy._zclass_propertysheets_class) self._p_jar.exchange(self._zclass_propertysheets_class, copy._zclass_propertysheets_class) self._zclass_propertysheets_class=copy._zclass_propertysheets_class if hasattr(self.propertysheets.__class__, '_p_oid'): copy.propertysheets.__class__.__dict__.update( self.propertysheets.__class__.__dict__) get_transaction().register( copy.propertysheets.__class__) self._p_jar.exchange(self.propertysheets.__class__, copy.propertysheets.__class__) self._zbases=copy._zbases def _new_class_id(self): import md5, base64, time id=md5.new() id.update(self.absolute_url()) id.update(str(time.time())) id=id.digest() id=string.strip(base64.encodestring(id)) return '*'+id def changeClassId(self, newid=None): if not dbVersionEquals('3'): return if newid is None: newid=self._new_class_id() self._unregister() if newid: if not newid[:1] == '*': newid='*'+newid self.setClassAttr('__module__', newid) self._register() def _waaa_getJar(self): # Waaa, we need our jar to register, but we may not have one yet when # we need to register, so we'll walk our acquisition tree looking # for one. jar=None while 1: if hasattr(self, '_p_jar'): jar=self._p_jar if jar is not None: return jar if not hasattr(self, 'aq_parent'): return jar self=self.aq_parent def _register(self): if not dbVersionEquals('3'): return z=self._zclass_ class_id=z.__module__ if not class_id: return jar=self._waaa_getJar() globals=jar.root()['ZGlobals'] if globals.has_key(class_id): raise 'Duplicate Class Ids' globals[class_id]=z def _unregister(self): if not dbVersionEquals('3'): return class_id=self._zclass_.__module__ if not class_id: return globals=self._p_jar.root()['ZGlobals'] if globals.has_key(class_id): del globals[class_id] def manage_afterClone(self, item): self.setClassAttr('__module__', None) self.propertysheets.methods.manage_afterClone(item) def manage_afterAdd(self, item, container): if not dbVersionEquals('3'): return if not self._zclass_.__module__: self.setClassAttr('__module__', self._new_class_id()) self._register() self.propertysheets.methods.manage_afterAdd(item, container) def manage_beforeDelete(self, item, container): if not dbVersionEquals('3'): return self._unregister() self.propertysheets.methods.manage_beforeDelete(item, container) def manage_options(self): r=[] d={} have=d.has_key for z in self._zbases: for o in z.manage_options: label=o['label'] if have(label): continue d[label]=1 r.append(o) return r manage_options=ComputedAttribute(manage_options) def createInObjectManager(self, id, REQUEST, RESPONSE=None): """ Create Z instance. If called with a RESPONSE, the RESPONSE will be redirected to the management screen of the new instance's parent Folder. Otherwise, the instance will be returned. """ i=mapply(self._zclass_, (), REQUEST) if not hasattr(i, 'id') or not i.id: i.id=id folder=durl=None if hasattr(self, 'Destination'): d=self.Destination if d.im_self.__class__ is FactoryDispatcher: folder=d() if folder is None: folder=self.aq_parent if not hasattr(folder,'_setObject'): folder=folder.aq_parent folder._setObject(id, i) if RESPONSE is not None: try: durl=self.DestinationURL() except: durl=REQUEST['URL3'] RESPONSE.redirect(durl+'/manage_workspace') else: return getattr(folder, id) index_html=createInObjectManager def fromRequest(self, id=None, REQUEST={}): i=mapply(self._zclass_, (), REQUEST) if id is not None and (not hasattr(i, 'id') or not i.id): i.id=id return i def __call__(self, *args, **kw): return apply(self._zclass_, args, kw) def zclass_candidate_view_actions(self): r={} zclass=self._zclass_ # Step one, look at all of the methods. # We can cheat (hee hee) and and look in the _zclass_ # dict for wrapped objects. for id in Method.findMethodIds(zclass): r[id]=1 # OK, now lets check out the inherited views: findActions(zclass, r) # OK, now add our property sheets. for id in self.propertysheets.common.objectIds(): r['propertysheets/%s/manage' % id]=1 r=r.keys() r.sort() return r def getClassAttr(self, name, default=_marker, inherit=0): if default is _marker: if inherit: return getattr(self._zclass_, name) else: return self._zclass_.__dict__[name] try: if inherit: return getattr(self._zclass_, name) else: return self._zclass_.__dict__[name] except: return default def setClassAttr(self, name, value): c=self._zclass_ setattr(c, name, value) if not c._p_changed: get_transaction().register(c) c._p_changed=1 def delClassAttr(self, name): c=self._zclass_ delattr(c, name) if not c._p_changed: get_transaction().register(c) c._p_changed=1 def classDefinedPermissions(self): c=self._zclass_ r=[] a=r.append for p in c.__ac_permissions__: a(p[0]) r.sort() return r def classInheritedPermissions(self): c=self._zclass_ d={} for p in c.__ac_permissions__: d[p[0]]=None r=[] a=r.append for p in AccessControl.Role.gather_permissions(c, [], d): a(p[0]) r.sort() return r def classDefinedAndInheritedPermissions(self): return (self.classDefinedPermissions()+ self.classInheritedPermissions()) def ziconImage(self, REQUEST, RESPONSE): "Display a class icon" return self._zclass_.ziconImage.index_html(REQUEST, RESPONSE) ziconImage__roles__=None def tpValues(self): return self.propertysheets.common, self.propertysheets.methods def ZClassBaseClassNames(self): r=[] for c in self._zbases: if hasattr(c, 'id'): r.append(c.id) elif hasattr(c, '__name__'): r.append(c.__name__) return r def _getZClass(self): return self class ZClassSheets(OFS.PropertySheets.PropertySheets): "Manage a collection of property sheets that provide ZClass management" #isPrincipiaFolderish=1 #def tpValues(self): return self.methods, self.common #def tpURL(self): return 'propertysheets' def manage_workspace(self, URL2): "Emulate standard interface for use with navigation" raise 'Redirect', URL2+'/manage_workspace' views = Basic.ZClassViewsSheet('views') basic = Basic.ZClassBasicSheet('basic') permissions = Basic.ZClassPermissionsSheet('permissions') def __init__(self): self.methods=Method.ZClassMethodsSheet('methods') self.common=Property.ZInstanceSheetsSheet('common') class ZObject: manage_options=( {'label': 'Methods', 'action' :'propertysheets/methods/manage'}, {'label': 'Basic', 'action' :'propertysheets/basic/manage'}, {'label': 'Views', 'action' :'propertysheets/views/manage'}, {'label': 'Property Sheets', 'action' :'propertysheets/common/manage'}, {'label': 'Permissions', 'action' :'propertysheets/permissions/manage'}, {'label': 'Security', 'action' :'manage_access'}, ) ZStandardSheets=ZObject def findActions(klass, found): for b in klass.__bases__: try: for d in b.manage_options: found[d['action']]=1 findActions(b, found) except: pass addFormDefault=""" Add %(meta_type)s

    Add %(meta_type)s

    Id
    """ addDefault=""" Add %(id)s We add the new object by calling the class in a with tag. Not only does this get the thing added, it adds the new thing's attributes to the DTML name space, so we can call methods to initialize the object. You can ad code that modifies the new instance here. For example, if you have a property sheet that you want to update from form values, you can call it here: Now we need to return something. We do this via a redirect so that the URL is correct. Unfortunately, the way we do this depends on whether we live in a product or in a class. If we live in a product, we need to use DestinationURL to decide where to go. If we live in a class, DestinationURL won't be available, so we use URL2. """ Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/ZClassOwner.py100644 1007 1403 11375 6742213454 22744 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Zope Classes """ import ExtensionClass, Globals, ZClass, Products class ZClassOwner(ExtensionClass.Base): manage_addZClassForm=Globals.HTMLFile( 'addZClass', globals(), default_class_='OFS.SimpleItem Item', CreateAFactory=1) def manage_addZClass(self, id, title='', baseclasses=[], meta_type='', CreateAFactory=0, REQUEST=None): "Add a ZClass" return ZClass.manage_addZClass( self, id, title, baseclasses, meta_type, CreateAFactory, REQUEST) def manage_subclassableClassNames(self): r={} r.update(Products.meta_class_info) while 1: if not hasattr(self, 'objectItems'): break for k, v in self.objectItems(): if hasattr(v,'_zclass_') and not r.has_key(k): r[k]=v.title_and_id() if not hasattr(self, 'aq_parent'): break self=self.aq_parent r=r.items() r.sort() return r Globals.default__class_init__(ZClassOwner) Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/__init__.py100644 1007 1403 2454 6712130476 22246 0ustar petrillipetrilli############################################################################## # # Copyright # # Copyright 1996 Digital Creations, L.C., 910 Princess Anne # Street, Suite 300, Fredericksburg, Virginia 22401 U.S.A. All # rights reserved. # ############################################################################## __doc__='''Sample product initialization module The job of this module is to provide any run-time initialization needed by a product and to define product meta data. This sample product publishes a folder-ish and a simple object. $Id: __init__.py,v 1.4 1999/04/29 19:21:34 jim Exp $''' __version__='$Revision: 1.4 $'[11:-2] import ZClass # Names of objects added by this product: meta_types=( {'name': ZClass.ZClass.meta_type, 'action':'manage_addZClassForm'}, ) # Attributes (usually "methods") to be added to folders to support # creating objects: methods={ 'manage_addZClassForm': ZClass.manage_addZClassForm, 'manage_addZClass': ZClass.manage_addZClass, 'manage_subclassableClassNames': ZClass.manage_subclassableClassNames, } # Permission to be added to folders: __ac_permissions__=( # To add items: ('Add Zope Class', ('manage_addZClassForm', 'manage_addZClass', 'manage_subclassableClassNames')), ) misc_={} Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/addCommonSheet.dtml100644 1007 1403 1320 6675500701 23700 0ustar petrillipetrilli Add Common Instance Property Sheet

    Add Common Instance Property Sheet

    Id
    Title


    Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/addIcon.dtml100644 1007 1403 2376 6664341372 22370 0ustar petrillipetrilli Add Icon

    Add Instance Icon

    Instance Icons are displayed with images in management interfaces. Select an image file from your local computer by clicking the Browse button. The image you select will be uploaded to the class for use by instances.

    The instance icon property will be set to give a path to the image. The path will be based on the current location of this class and will need to be adjusted if the class is moved.

    Id
    Title
    Icon image

    Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/addPropertyInterface.dtml100644 1007 1403 2334 6761246517 25142 0ustar petrillipetrilliAdd Property Sheet Interface

    Add Property Sheet Interface

    Id
    Title
    Property Sheet
    Type
    Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/addZClass.dtml100755 1007 1403 5350 6761246517 22700 0ustar petrillipetrilli Add ZClass

    Add ZClass

    Id
    Title
    Meta type
    CHECKED> Create constructor objects.
    Base classes Unselected:

    		Selected:

    Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/class.gif100755 1007 1403 1545 6676463274 21752 0ustar petrillipetrilliGIF89aPPP@@@@@!,BH*TxÇhD 3&X#~ #ɏ3 9ĕ[D;Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/classPermissions.dtml100644 1007 1403 2017 6745344377 24370 0ustar petrillipetrilliSecurity

    Use this view to select permissions used by this class. When setting permissions for individual methods or property sheets, you will be able to select from class permissions and inherited permissions.

    Class permissions Inherited permissions


    Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/contents.dtml100755 1007 1403 5321 6761246517 22663 0ustar petrillipetrilli Contents

    [<!--#var meta_type-->] () This item has been modified in this version This item has been modified in another version
    There are currently no items in

    To add a new item, select an item type and click "Add".

    Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/itemProp.dtml100644 1007 1403 4027 6761246517 22624 0ustar petrillipetrilliBasic Instance Properties

    Instance Icons are displayed with images in management interfaces. Select an image file from your local computer by clicking the Browse button. The image you select will be uploaded to the class for use by instances.

    The instance icon property will be set to give a path to the image. The path will be based on the current location of this class and will need to be adjusted if the class is moved.

    Base classes
    title
    meta type
    class id
    icon
    Icon image

    Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/methods.gif100755 1007 1403 1570 6703431722 22266 0ustar petrillipetrilliGIF89aPPP@@@@@!,UH`A0@ 4|PE Dlq!A(‐'nTy%Y"ɐ&E1L ["͡F1;Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/propertysheets.gif100755 1007 1403 1535 6703431721 23723 0ustar petrillipetrilliGIF89aPPP@@@@@!,:H aÄ>DD&q"Ə .(#ɄOBTy#ː0 ;Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/subobjects.dtml100644 1007 1403 1655 6676463274 23202 0ustar petrillipetrilli<!--#var title_or_id-->
    Select the kinds of things
    that can be added to objects
    of this kind:
    Objects should appear in folder lists? CHECKED >
    Zope-2.0.1-ZEO-nonbin/lib/python/ZClasses/views.dtml100644 1007 1403 2542 6761246517 22162 0ustar petrillipetrilli<!--#var title_or_id-->
    New:
    Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/ 40755 1007 1403 0 6772126760 17051 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/ZODB/BaseStorage.py100644 1007 1403 16754 6754277313 21755 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Handy standard storage machinery """ __version__='$Revision: 1.4 $'[11:-2] import time, bpthread from POSException import UndoError from TimeStamp import TimeStamp z64='\0'*8 class BaseStorage: _transaction=None _serial=z64 def __init__(self, name, base=None): self.__name__=name # Allocate locks: l=bpthread.allocate_lock() self._lock_acquire=l.acquire self._lock_release=l.release l=bpthread.allocate_lock() self._commit_lock_acquire=l.acquire self._commit_lock_release=l.release t=time.time() t=self._ts=apply(TimeStamp,(time.gmtime(t)[:5]+(t%60,))) self._serial=`t` if base is None: self._oid='\0\0\0\0\0\0\0\0' else: self._oid=base._oid def abortVersion(self, src, transaction): if transaction is not self._transaction: raise POSException.StorageTransactionError(self, transaction) return [] def close(self): pass commitVersion=abortVersion def getName(self): return self.__name__ def getSize(self): return len(self)*300 # WAG! def history(self, oid, version, length=1): pass def modifiedInVersion(self, oid): return '' def new_oid(self, last=None): if last is None: self._lock_acquire() try: last=self._oid d=ord(last[-1]) if d < 255: last=last[:-1]+chr(d+1) else: last=self.new_oid(last[:-1]) self._oid=last return last finally: self._lock_release() else: d=ord(last[-1]) if d < 255: return last[:-1]+chr(d+1)+'\0'*(8-len(last)) else: return self.new_oid(last[:-1]) def registerDB(self, db, limit): pass # we don't care def supportsUndo(self): return 0 def supportsVersions(self): return 0 def tpc_abort(self, transaction): self._lock_acquire() try: if transaction is not self._transaction: return self._clear_temp() self._transaction=None self._commit_lock_release() finally: self._lock_release() def tpc_begin(self, transaction): self._lock_acquire() try: if self._transaction is transaction: return self._lock_release() self._commit_lock_acquire() self._lock_acquire() self._transaction=transaction self._clear_temp() user=transaction.user desc=transaction.description ext=transaction._extension if ext: ext=dumps(ext,1) else: ext="" self._ude=user, desc, ext t=time.time() t=apply(TimeStamp,(time.gmtime(t)[:5]+(t%60,))) self._ts=t=t.laterThan(self._ts) self._serial=`t` self._begin(self._serial, user, desc, ext) finally: self._lock_release() def _begin(self, tid, u, d, e): pass def tpc_finish(self, transaction, f=None): self._lock_acquire() try: if transaction is not self._transaction: return if f is not None: f() u,d,e=self._ude self._finish(self._serial, u, d, e) self._clear_temp() finally: self._ude=None self._transaction=None self._commit_lock_release() self._lock_release() def _finish(self, tid, u, d, e): pass def undo(self, transaction_id): raise UndoError, 'non-undoable transaction' def undoLog(self, first, last, filter=None): return () def versionEmpty(self, version): return 1 def versions(self, max=None): return () def pack(self, t, referencesf): pass Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/Connection.py100644 1007 1403 40360 6767742371 21650 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Database connection support $Id: Connection.py,v 1.25 1999/09/15 16:10:33 jim Exp $""" __version__='$Revision: 1.25 $'[11:-2] from cPickleCache import PickleCache from POSException import ConflictError, ExportError from cStringIO import StringIO from cPickle import Unpickler, Pickler from ExtensionClass import Base from time import time import Transaction, string, ExportImport, sys, traceback, TmpStore from zLOG import LOG, ERROR from coptimizations import new_persistent_id ExtensionKlass=Base.__class__ class HelperClass: pass ClassType=type(HelperClass) class Connection(ExportImport.ExportImport): """Object managers for individual object space. An object space is a version of collection of objects. In a multi-threaded application, each thread get's it's own object space. The Connection manages movement of objects in and out of object storage. """ _tmp=None _debug_info=() _opened=None def __init__(self, version='', cache_size=400, cache_deactivate_after=60): """Create a new Connection""" self._version=version self._cache=cache=PickleCache(self, cache_size, cache_deactivate_after) self._incrgc=self.cacheGC=cache.incrgc self._invalidated=d={} self._invalid=d.has_key self._committed=[] def _breakcr(self): try: del self._cache except: pass try: del self._incrgc except: pass try: del self.cacheGC except: pass def __getitem__(self, oid, tt=type(()), ct=type(HelperClass)): cache=self._cache if cache.has_key(oid): return cache[oid] __traceback_info__=oid p, serial = self._storage.load(oid, self._version) file=StringIO(p) unpickler=Unpickler(file) unpickler.persistent_load=self._persistent_load object = unpickler.load() klass, args = object if type(klass) is tt: module, name = klass klass=self._db._classFactory(self, module, name) if (args is None or not args and not hasattr(klass,'__getinitargs__')): object=klass.__basicnew__() else: object=apply(klass,args) if klass is not ExtensionKlass: object.__dict__.clear() object._p_oid=oid object._p_jar=self object._p_changed=None object._p_serial=serial cache[oid]=object if oid=='\0\0\0\0\0\0\0\0': self._root_=object # keep a ref return object def _persistent_load(self,oid, d={'__builtins__':{}}, tt=type(()), st=type(''), ct=type(HelperClass)): __traceback_info__=oid cache=self._cache if type(oid) is tt: # Quick instance reference. We know all we need to know # to create the instance wo hitting the db, so go for it! oid, klass = oid if cache.has_key(oid): return cache[oid] if type(klass) is tt: module, name = klass try: klass=self._db._classFactory(self, module, name) except: # Eek, we couldn't get the class. Hm. # Maybe their's more current data in the # object's actual record! return self[oid] object=klass.__basicnew__() object._p_oid=oid object._p_jar=self object._p_changed=None cache[oid]=object return object if cache.has_key(oid): return cache[oid] return self[oid] def _setDB(self, odb): """Begin a new transaction. Any objects modified since the last transaction are invalidated. """ self._db=odb self._storage=s=odb._storage self.new_oid=s.new_oid self._cache.invalidate(self._invalidated) self._opened=time() return self def abort(self, object, transaction): """Abort the object in the transaction. This just deactivates the thing. """ self._cache.invalidate(object._p_oid) def cacheFullSweep(self, dt=0): self._cache.full_sweep(dt) def cacheMinimize(self, dt=0): self._cache.minimize(dt) def close(self): self._incrgc() db=self._db self._db=self._storage=self._tmp=self.new_oid=self._opened=None self._debug_info=() db._closeConnection(self) def commit(self, object, transaction): oid=object._p_oid if oid is None or object._p_jar is not self: oid = self.new_oid() object._p_jar=self object._p_oid=oid elif object._p_changed: invalid=self._invalid if invalid(oid) or invalid(None): raise ConflictError, oid self._invalidating.append(oid) else: # Nothing to do return stack=[object] # Create a special persistent_id that passes T and the subobject # stack along: # # def persistent_id(object, # self=self, # stackup=stackup, new_oid=self.new_oid): # if (not hasattr(object, '_p_oid') or # type(object) is ClassType): return None # # oid=object._p_oid # # if oid is None or object._p_jar is not self: # oid = self.new_oid() # object._p_jar=self # object._p_oid=oid # stackup(object) # # klass=object.__class__ # # if klass is ExtensionKlass: return oid # # if hasattr(klass, '__getinitargs__'): return oid # # module=getattr(klass,'__module__','') # if module: klass=module, klass.__name__ # # return oid, klass file=StringIO() seek=file.seek pickler=Pickler(file,1) pickler.persistent_id=new_persistent_id(self, stack.append) dbstore=self._storage.store file=file.getvalue cache=self._cache dump=pickler.dump clear_memo=pickler.clear_memo version=self._version while stack: object=stack[-1] del stack[-1] oid=object._p_oid serial=getattr(object, '_p_serial', '\0\0\0\0\0\0\0\0') if invalid(oid): raise ConflictError, oid klass = object.__class__ if klass is ExtensionKlass: # Yee Ha! dict={} dict.update(object.__dict__) del dict['_p_jar'] args=object.__name__, object.__bases__, dict state=None else: if hasattr(klass, '__getinitargs__'): args = object.__getinitargs__() len(args) # XXX Assert it's a sequence else: args = None # New no-constructor protocol! module=getattr(klass,'__module__','') if module: klass=module, klass.__name__ __traceback_info__=klass, oid, self._version state=object.__getstate__() seek(0) clear_memo() dump((klass,args)) dump(state) p=file(1) object._p_serial=dbstore(oid,serial,p,version,transaction) object._p_changed=0 try: cache[oid]=object except: # Dang, I bet its wrapped: if hasattr(object, 'aq_base'): cache[oid]=object.aq_base def commit_sub(self, t): tmp=self._tmp if tmp is None: return src=self._storage self._storage=tmp self._tmp=None tmp.tpc_begin(t) load=src.load store=tmp.store dest=self._version get=self._cache.get oids=src._index.keys() invalidating=self._invalidating invalidating[len(invalidating):]=oids for oid in oids: data, serial = load(oid, src) s=store(oid, serial, data, dest, t) o=get(oid, None) if o is not None: o._p_serial=s def abort_sub(self, t): tmp=self._tmp if tmp is None: return src=self._storage self._tmp=None self._storage=tmp self._cache.invalidate(src._index.keys()) def db(self): return self._db def getVersion(self): return self._version def invalidate(self, oid): """Invalidate a particular oid This marks the oid as invalid, but doesn't actually invalidate it. The object data will be actually invalidated at certain transaction boundaries. """ self._invalidated[oid]=1 def modifiedInVersion(self, oid): try: return self._db.modifiedInVersion(oid) except KeyError: return self._version def root(self): return self['\0\0\0\0\0\0\0\0'] def setstate(self,object): # Note, we no longer mess with the object's state # flag, _p_changed. This is the object's job. oid=object._p_oid invalid=self._invalid if invalid(oid) or invalid(None): raise ConflictError, oid p, serial = self._storage.load(oid, self._version) file=StringIO(p) unpickler=Unpickler(file) unpickler.persistent_load=self._persistent_load try: unpickler.load() state = unpickler.load() except: t, v =sys.exc_info()[:2] LOG('ZODB',ERROR, "Couldn't unnpickle %s" % `oid`, error=sys.exc_info()) raise if hasattr(object, '__setstate__'): object.__setstate__(state) else: d=object.__dict__ for k,v in state.items(): d[k]=v object._p_serial=serial def setklassstate(self, object, tt=type(()), ct=type(HelperClass)): try: oid=object._p_oid __traceback_info__=oid p, serial = self._storage.load(oid, self._version) file=StringIO(p) unpickler=Unpickler(file) unpickler.persistent_load=self._persistent_load copy = unpickler.load() klass, args = copy if klass is not ExtensionKlass: LOG('ZODB',ERROR, "Unexpected klass when setting class state on %s" % getattr(object,'__name__','(?)')) return copy=apply(klass,args) object.__dict__.clear() object.__dict__.update(copy.__dict__) object._p_oid=oid object._p_jar=self object._p_changed=0 object._p_serial=serial except: LOG('ZODB',ERROR, 'setklassstate failed', error=sys.exc_info) raise def tpc_abort(self, transaction): self._storage.tpc_abort(transaction) cache=self._cache cache.invalidate(self._invalidated) cache.invalidate(self._invalidating) def tpc_begin(self, transaction, sub=None): if self._invalid(None): # Some nitwit invalidated everything! raise ConflictError, oid self._invalidating=[] if sub: # Sub-transaction! _tmp=self._tmp if _tmp is None: _tmp=TmpStore.TmpStore(self._version) self._tmp=self._storage self._storage=_tmp _tmp.registerDB(self._db, 0) self._storage.tpc_begin(transaction) def tpc_finish(self, transaction): self._storage.tpc_finish(transaction, self.tpc_finish_) self._cache.invalidate(self._invalidated) def tpc_finish_(self): invalidate=self._db.invalidate for oid in self._invalidating: invalidate(oid, self) def sync(self): get_transaction().abort() self._cache.invalidate(self._invalidated) def getDebugInfo(self): return self._debug_info def setDebugInfo(self, *args): self._debug_info=self._debug_info+args ###################################################################### # Just plain weird. Don't try this at home kids. def exchange(self, old, new): oid=old._p_oid new._p_oid=oid new._p_jar=self new._p_changed=1 get_transaction().register(new) self._cache[oid]=new class tConnection(Connection): def close(self): self._breakcr() Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/DB.py100644 1007 1403 47135 6761573453 20042 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Database objects $Id: DB.py,v 1.16 1999/08/27 20:38:03 jim Exp $""" __version__='$Revision: 1.16 $'[11:-2] import cPickle, cStringIO, sys, POSException from Connection import Connection from bpthread import allocate_lock from Transaction import Transaction from referencesf import referencesf from time import time, ctime StringType=type('') class DB: """The Object Database The Object database coordinates access to and interaction of one or more connections, which manage object spaces. Most of the actual work of managing objects is done by the connections. """ def __init__(self, storage, pool_size=7, cache_size=400, cache_deactivate_after=60, version_pool_size=3, version_cache_size=100, version_cache_deactivate_after=10, ): """Create an object database. The storage for the object database must be passed in. Optional arguments are: pool_size -- The size of the pool of object spaces. """ self._storage=storage storage.registerDB(self, None) try: storage.load('\0\0\0\0\0\0\0\0','') except: import PersistentMapping file=cStringIO.StringIO() p=cPickle.Pickler(file,1) p.dump((PersistentMapping.PersistentMapping,None)) p.dump({'_container': {}}) t=Transaction() t.description='initial database creation' storage.tpc_begin(t) storage.store('\0\0\0\0\0\0\0\0', None, file.getvalue(), '', t) storage.tpc_finish(t) # Allocate locks: l=allocate_lock() self._a=l.acquire self._r=l.release self._pools={},[] self._temps=[] self._pool_size=pool_size self._cache_size=cache_size self._cache_deactivate_after=cache_deactivate_after self._version_pool_size=version_pool_size self._version_cache_size=version_cache_size self._version_cache_deactivate_after=version_cache_deactivate_after self._miv_cache={} # Pass through methods: for m in ('history', 'supportsUndo', 'supportsVersions', 'undoLog', 'versionEmpty', 'versions'): setattr(self, m, getattr(storage, m)) def _cacheMean(self, attr): m=[0,0] def f(con, m=m): t=getattr(con._cache,attr) m[0]=m[0]+t m[1]=m[1]+1 self._connectionMap(f) if m[1]: m=m[0]/m[1] else: m=None return m def _classFactory(self, connection, location, name, _silly=('__doc__',), _globals={}): return getattr(__import__(location, _globals, _globals, _silly), name) def _closeConnection(self, connection): """Return a connection to the pool""" self._a() try: version=connection._version pools,pooll=self._pools pool, allocated, pool_lock = pools[version] pool.append(connection) if len(pool)==1: # Pool now usable again, unlock it. pool_lock.release() finally: self._r() def _connectionMap(self, f): self._a() try: pools,pooll=self._pools for pool, allocated in pooll: for cc in allocated: f(cc) temps=self._temps if temps: t=[] rc=sys.getrefcount for cc in temps: if rc(cc) > 3: f(cc) self._temps=t finally: self._r() def abortVersion(self, version): AbortVersion(self, version) def cacheDetail(self): """Return information on objects in the various caches Organized by class.""" detail={} def f(con,detail=detail,have_detail=detail.has_key): for oid, ob in con._cache.items(): c="%s.%s" % (ob.__class__.__module__, ob.__class__.__name__) if have_detail(c): detail[c]=detail[c]+1 else: detail[c]=1 self._connectionMap(f) detail=detail.items() detail.sort() return detail def cacheExtremeDetail(self): detail=[] def f(con, detail=detail, rc=sys.getrefcount): for oid, ob in con._cache.items(): id=oid if hasattr(ob,'__dict__'): d=ob.__dict__ if d.has_key('id'): id="%s (%s)" % (oid, d['id']) elif d.has_key('__name__'): id="%s (%s)" % (oid, d['__name__']) detail.append({ 'oid': id, 'klass': "%s.%s" % (ob.__class__.__module__, ob.__class__.__name__), 'rc': rc(ob)-4, 'references': con.references(oid), }) self._connectionMap(f) return detail def cacheFullSweep(self, value): self._connectionMap(lambda c, v=value: c._cache.full_sweep(v)) def cacheLastGCTime(self): m=[0] def f(con, m=m): t=con._cache.cache_last_gc_time if t > m[0]: m[0]=t self._connectionMap(f) return m[0] def cacheMinimize(self, value): self._connectionMap(lambda c, v=value: c._cache.minimize(v)) def cacheMeanAge(self): return self._cacheMean('cache_mean_age') def cacheMeanDeac(self): return self._cacheMean('cache_mean_deac') def cacheMeanDeal(self): return self._cacheMean('cache_mean_deal') def cacheSize(self): m=[0] def f(con, m=m): m[0]=m[0]+len(con._cache) self._connectionMap(f) return m[0] def close(self): self._storage.close() def commitVersion(self, source, destination=''): CommitVersion(self, source, destination) def exportFile(self, oid, file=None): raise 'Not yet implemented' def getCacheDeactivateAfter(self): return self._cache_deactivate_after def getCacheSize(self): return self._cache_size def getName(self): return self._storage.getName() def getPoolSize(self): return self._pool_size def getSize(self): return self._storage.getSize() def getVersionCacheDeactivateAfter(self): return self._version_cache_deactivate_after def getVersionCacheSize(self): return self._version_cache_size def getVersionPoolSize(self): return self._version_pool_size def importFile(self, file): raise 'Not yet implemented' def invalidate(self, oid, connection=None, version='', rc=sys.getrefcount): """Invalidate references to a given oid. This is used to indicate that one of the connections has committed a change to the object. The connection commiting the change should be passed in to prevent useless (but harmless) messages to the connection. """ if connection is not None: version=connection._version self._a() try: # Update modified in version cache h=hash(oid)%131 cache=self._miv_cache o=cache.get(h, None) if o and o[0]==oid: del cache[h] # Notify connections pools,pooll=self._pools for pool, allocated in pooll: for cc in allocated: if (cc is not connection and (not version or cc._version==version)): if rc(cc) <= 3: cc.close() cc.invalidate(oid) temps=self._temps if temps: t=[] for cc in temps: if rc(cc) > 3: if cc is not connection and cc._version==version: cc.invalidate(oid) t.append(cc) else: cc.close() self._temps=t finally: self._r() def invalidateMany(self, oids=None, version=''): if oids is None: self.invalidate(None, version=version) else: for oid in oids: self.invalidate(oid, version=version) def modifiedInVersion(self, oid): h=hash(oid)%131 cache=self._miv_cache o=cache.get(h, None) if o and o[0]==oid: return o[1] v=self._storage.modifiedInVersion(oid) cache[h]=oid, v return v def objectCount(self): return len(self._storage) def open(self, version='', transaction=None, temporary=0, force=None, waitflag=1): """Return a object space (AKA connection) to work in The optional version argument can be used to specify that a version connection is desired. The optional transaction argument can be provided to cause the connection to be automatically closed when a transaction is terminated. In addition, connections per transaction are reused, if possible. Note that the connection pool is managed as a stack, to increate the likelihood that the connection's stack will include useful objects. """ if type(version) is not StringType: raise POSException.Unimplemented, 'temporary versions' self._a() try: if transaction is not None: connections=transaction._connections if connections: if connections.has_key(version) and not temporary: return connections[version] else: transaction._connections=connections={} transaction=transaction._connections if temporary: # This is a temporary connection. # We won't bother with the pools. This will be # a one-use connection. c=Connection( version=version, cache_size=self._version_cache_size, cache_deactivate_after= self._version_cache_deactivate_after) c._setDB(self) self._temps.append(c) if transaction is not None: transaction[id(c)]=c return c pools,pooll=self._pools # pools is a mapping object: # # {version -> (pool, allocated, lock) # # where: # # pool is the connection pool for the version, # allocated is a list of all of the allocated # connections, and # lock is a lock that is used to block when a pool is # empty and no more connections can be allocated. # # pooll is a list of all of the pools and allocated for # use in cases where we need to iterate over all # connections or all inactive connections. # Pool locks are tricky. Basically, the lock needs to be # set whenever the pool becomes empty so that threads are # forced to wait until the pool gets a connection it it. # The lock is acquired when the (empty) pool is # created. The The lock is acquired just prior to removing # the last connection from the pool and just after adding # a connection to an empty pool. if pools.has_key(version): pool, allocated, pool_lock = pools[version] else: pool, allocated, pool_lock = pools[version] = ( [], [], allocate_lock()) pooll.append((pool, allocated)) pool_lock.acquire() if not pool: c=None if version: if self._version_pool_size > len(allocated) or force: c=Connection( version=version, cache_size=self._version_cache_size, cache_deactivate_after= self._version_cache_deactivate_after) allocated.append(c) pool.append(c) elif self._pool_size > len(allocated) or force: c=Connection( version=version, cache_size=self._cache_size, cache_deactivate_after= self._cache_deactivate_after) allocated.append(c) pool.append(c) if c is None: if waitflag: self._r() pool_lock.acquire() self._a() else: return elif len(pool)==1: # Taking last one, lock the pool # Note that another thread might grab the lock # before us, so we might actually block, however, # when we get the lock back, there *will* be a # connection in the pool. self._r() pool_lock.acquire() self._a() c=pool[-1] del pool[-1] c._setDB(self) for pool, allocated in pooll: for cc in pool: cc._incrgc() if transaction is not None: transaction[version]=c return c finally: self._r() def connectionDebugInfo(self): r=[] pools,pooll=self._pools t=time() for version, (pool, allocated, lock) in pools.items(): for c in allocated: o=c._opened d=c._debug_info if d: if len(d)==1: d=d[0] else: d='' d="%s (%s)" % (d, len(c._cache)) r.append({ 'opened': o and ("%s (%.2fs)" % (ctime(o), t-o)), 'info': d, 'version': version, }) return r def pack(self, t): self._storage.pack(t,referencesf) def setCacheDeactivateAfter(self, v): self._cache_deactivate_after=v def setCacheSize(self, v): self._cache_size=v def setClassFactory(self, factory): self._classFactory=factory def setPoolSize(self, v): self._pool_size=v def setVersionCacheDeactivateAfter(self, v): self._version_cache_deactivate_after=v def setVersionCacheSize(self, v): self._version_cache_size=v def setVersionPoolSize(self, v): self._version_pool_size=v def cacheStatistics(self): return () # :( def undo(self, id): for oid in self._storage.undo(id): self.invalidate(oid) def versionEmpty(self, version): return self._storage.versionEmpty(version) class CommitVersion: """An object that will see to version commit in cooperation with a transaction manager. """ def __init__(self, db, version, dest=''): self._db=db s=db._storage self._version=version self._dest=dest self.tpc_abort=s.tpc_abort self.tpc_begin=s.tpc_begin self.tpc_finish=s.tpc_finish get_transaction().register(self) def abort(self, reallyme, t): pass def commit(self, reallyme, t): db=self._db dest=self._dest for oid in db._storage.commitVersion(self._version, dest, t): db.invalidate(oid, version=dest) class AbortVersion(CommitVersion): """An object that will see to version abortion in cooperation with a transaction manager. """ def commit(self, reallyme, t): db=self._db version=self._version for oid in db._storage.abortVersion(version, t): db.invalidate(oid, version=version) Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/DemoStorage.py100644 1007 1403 50502 6752117301 21740 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Demo ZODB storage The Demo storage serves two purposes: - Provide an example implementation of a full storage without distracting storage details, - Provide a volatile storage that is useful for giving demonstrations. The demo strorage can have a "base" storage that is used in a read-only fashion. The base storage must not not to contain version data. There are three main data structures: _data -- Transaction logging information necessary for undo This is a mapping from transaction id to transaction, where a transaction is simply a 4-tuple: packed, user, description, extension_data, records where extension_data is a dictionary or None and records are the actual records in chronological order. Packed is a flag indicating whethe the transaction has been packed or not _index -- A mapping from oid to record _vindex -- A mapping from version name to version data where version data is a mapping from oid to record A record is a tuple: oid, serial, pre, vdata, p, where: oid -- object id serial -- object serial number pre -- The previous record for this object (or None) vdata -- version data None if not a version, ortherwise: version, non-version-record p -- the pickle data or None The pickle data will be None for a record for an object created in an aborted version. It is instructive to watch what happens to the internal data structures as changes are made. Foe example, in Zope, you can create an external method:: import Zope def info(RESPONSE): RESPONSE['Content-type']= 'text/plain' return Zope.DB._storage._splat() and call it to minotor the storage. """ __version__='$Revision: 1.4 $'[11:-2] import base64, POSException, BTree, BaseStorage, time, string, utils from TimeStamp import TimeStamp from cPickle import loads class DemoStorage(BaseStorage.BaseStorage): def __init__(self, name='Demo Storage', base=None, quota=None): BaseStorage.BaseStorage.__init__(self, name, base) # We use a BTree because the items are sorted! self._data=BTree.BTree() self._index={} self._vindex={} self._base=base self._size=0 self._quota=quota self._clear_temp() if base is not None and base.versions(): raise POSException.StorageError, ( "Demo base storage has version data") def __len__(self): base=self._base return (base and len(base) or 0) + len(self._index) def getSize(self): s=100 for tid, (p, u, d, e, t) in self._data.items(): s=s+16+24+12+4+16+len(u)+16+len(d)+16+len(e)+16 for oid, serial, pre, vdata, p in t: s=s+16+24+24+4+4+(p and (16+len(p)) or 4) if vdata: s=s+12+16+len(vdata[0])+4 s=s+16*len(self._index) for v in self._vindex.values(): s=s+32+16*len(v) self._size=s return s def abortVersion(self, src, transaction): if transaction is not self._transaction: raise POSException.StorageTransactionError(self, transaction) self._lock_acquire() try: v=self._vindex.get(src, None) if not v: return tindex=self._tindex oids=[] for r in v.values(): oid, serial, pre, (version, nv), p = r if nv: oids.append(oid) oid, serial, pre, vdata, p = nv tindex.append([oid, serial, r, None, p]) else: # effectively, delete the thing tindex.append([oid, None, r, None, None]) return oids finally: self._lock_release() def commitVersion(self, src, dest, transaction): if transaction is not self._transaction: raise POSException.StorageTransactionError(self, transaction) self._lock_acquire() try: v=self._vindex.get(src, None) if v is None: return tindex=self._tindex oids=[] for r in v.values(): oid, serial, pre, vdata, p = r oids.append(oid) tindex.append([oid, serial, r, None, p]) return oids finally: self._lock_release() def load(self, oid, version): self._lock_acquire() try: try: oid, serial, pre, vdata, p = self._index[oid] except: if self._base: return self._base.load(oid, '') raise KeyError, oid if vdata: oversion, nv = vdata if oversion != version: if nv: oid, serial, pre, vdata, p = nv else: raise KeyError, oid if p is None: raise KeyError, oid return p, serial finally: self._lock_release() def modifiedInVersion(self, oid): self._lock_acquire() try: try: oid, serial, pre, vdata, p = self._index[oid] if vdata: return vdata[0] return '' except: return '' finally: self._lock_release() def store(self, oid, serial, data, version, transaction): if transaction is not self._transaction: raise POSException.StorageTransactionError(self, transaction) self._lock_acquire() try: old=self._index.get(oid, None) if old is None: # Hm, nothing here, check the base version: try: p, oserial = self._base.load(oid, '') except: pass else: old= oid, oserial, None, None, p nv=None if old: oid, oserial, pre, vdata, p = old if vdata: if vdata[0] != version: raise POSException.VersionLockError, oid nv=vdata[1] else: nv=old if serial != oserial: raise POSException.ConflictError serial=self._serial r=[oid, serial, old, version and (version,nv) or None, data] self._tindex.append(r) s=self._tsize s=s+72+(data and (16+len(data)) or 4) if version: s=s+32+len(version) if s > self._quota: raise POSException.StorageError, ( '''Quota Exceeded
    The maximum quota for this demonstration storage has been exceeded.
    Have a nice day.''') finally: self._lock_release() return serial def supportsUndo(self): return 1 def supportsVersions(self): return 1 def _clear_temp(self): self._tindex=[] self._tsize=self._size+160 def _begin(self, tid, u, d, e): self._tsize=self._size+120+len(u)+len(d)+len(e) def _finish(self, tid, user, desc, ext): index=self._index tindex=self._tindex vindex=self._vindex self._size=self._tsize self._data[tid]=None, user, desc, ext, tuple(tindex) for r in tindex: oid, serial, pre, vdata, p = r old=index.get(oid, None) if old is not None: oldvdata=old[3] if oldvdata: v=vindex[oldvdata[0]] del v[oid] if not v: del vindex[oldvdata[0]] index[oid]=r if vdata: version=vdata[0] v=vindex.get(version, None) if v is None: v=vindex[version]={} v[oid]=r def undo(self, transaction_id): self._lock_acquire() try: transaction_id=base64.decodestring(transaction_id+'\n') try: t=self._data[transaction_id][4] except KeyError: raise UndoError, 'Invalid undo transaction id' index=self._index vindex=self._vindex vindex_get=self._vindex.get for r in t: if index[r[0]] is not r: raise POSException.UndoError, 'Undoable transaction' oids=[] for r in t: oid, serial, pre, vdata, p = r if pre: index[oid] = pre oids.append(oid) # Delete old version data if vdata: version=vdata[0] v=vindex.get(version, None) if v: del v[oid] # Add new version data (from pre): oid, serial, prepre, vdata, p = pre if vdata: version=vdata[0] v=vindex.get(version, None) if v is None: v=vindex[version]={} v[oid]=pre else: del index[oid] if vdata: version=vdata[0] v=vindex.get(version, None) if v: del v[oid] if not v: del vindex[version] del self._data[transaction_id] return oids finally: self._lock_release() def undoLog(self, first, last, filter=None): self._lock_acquire() try: transactions=self._data.items() pos=len(transactions) encode=base64.encodestring r=[] append=r.append i=0 while i < last and pos: pos=pos-1 if i < first: i = i+1 continue tid, (p, u, d, e, t) = transactions[pos] if p: continue d={'id': encode(tid)[:-1], 'time': TimeStamp(tid).timeTime(), 'user_name': u, 'description': d} if e: d.update(loads(e)) if filter is None or filter(d): append(d) i=i+1 return r finally: self._lock_release() def versionEmpty(self, version): return not self._vindex.get(version, None) def versions(self, max=None): r=[] a=r.append for version in self._vindex.keys()[:max]: if self.versionEmpty(version): continue a(version) if max and len(r) >= max: return r return r def _build_indexes(self, stop='\377\377\377\377\377\377\377\377'): # Rebuild index structures from transaction data index={} vindex={} _data=self._data for tid, (p, u, d, e, t) in _data.items(): if tid >= stop: break for r in t: oid, serial, pre, vdata, p = r old=index.get(oid, None) if old is not None: oldvdata=old[3] if oldvdata: v=vindex[oldvdata[0]] del v[oid] if not v: del vindex[oldvdata[0]] index[oid]=r if vdata: version=vdata[0] v=vindex.get(version, None) if v is None: v=vindex[version]={} vindex[vdata[0]][oid]=r return index, vindex def pack(self, t, referencesf): # Packing is hard, at least when undo is supported. # Even for a simple storage like this one, packing # is pretty complex. self._lock_acquire() try: stop=`apply(TimeStamp, time.gmtime(t)[:5]+(t%60,))` _data=self._data # Build indexes up to the pack time: index, vindex = self._build_indexes(stop) # Now build an index of *only* those objects reachable # from the root. rootl=['\0\0\0\0\0\0\0\0'] pop=rootl.pop pindex={} referenced=pindex.has_key while rootl: oid=pop() if referenced(oid): continue # Scan non-version pickle for references r=index.get(oid, None) if r is None: # Base storage p, s = self._base.load(oid, '') referencesf(p, rootl) else: pindex[oid]=r oid, serial, pre, vdata, p = r referencesf(p, rootl) if vdata: nv=vdata[1] if nv: oid, serial, pre, vdata, p = nv referencesf(p, rootl) # Now we're ready to do the actual packing. # We'll simply edit the transaction data in place. # We'll defer deleting transactions till the end # to avoid messing up the BTree items. deleted=[] for tid, (p, u, d, e, t) in _data.items(): if tid >= stop: break o=[] for r in t: c=pindex.get(r[0]) if c is None: # GC this record, no longer referenced continue elif c is not r: # This record is not the indexed record, # so it may not be current. Let's see. oid, serial, pre, vdata, p = r if vdata: # Version record are current *only* if they # are indexed continue else: # OK, this isn't a version record, so it may be the # non-version record for the indexed record. oid, serial, pre, vdata, p = c if vdata: if vdata[1] != r: # This record is not the non-version # record for the indexed record continue else: # The indexed record is not a version record, # so this record can not be the non-version # record for it. continue o.append(r) if o: if len(o) != len(t): _data[tid]=1, u, d, e, tuple(o) # Reset data else: deleted.append(tid) # Now delete empty transactions for tid in deleted: del _data[tid] # Now reset previous pointers for "current" records: for r in pindex.values(): r[2]=None # Previous record if r[3]: # vdata r[3][1][2]=None pindex=None # Finally, rebuild indexes from transaction data: self._index, self._vindex = self._build_indexes() finally: self._lock_release() self.getSize() def _splat(self): """Spit out a string showing state. """ o=[] o.append('Transactions:') for tid, (p, u, d, e, t) in self._data.items(): o.append(" %s %s" % (TimeStamp(tid), p)) for r in t: oid, serial, pre, vdata, p = r oid=utils.u64(oid) if serial is not None: serial=str(TimeStamp(serial)) pre=id(pre) if vdata and vdata[1]: vdata=vdata[0], id(vdata[1]) if p: p='' o.append(' %s: %s' % (id(r), `(oid, serial, pre, vdata, p)`)) o.append('\nIndex:') items=self._index.items() items.sort() for oid, r in items: if r: r=id(r) o.append(' %s: %s' % (utils.u64(oid), r)) o.append('\nVersion Index:') items=self._vindex.items() items.sort() for version, v in items: o.append(' '+version) vitems=v.items() vitems.sort() for oid, r in vitems: if r: r=id(r) o.append(' %s: %s' % (utils.u64(oid), r)) return string.join(o,'\n') Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/ExportImport.py100644 1007 1403 25553 6746171336 22226 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import POSException, string from utils import p64, u64 from referencesf import referencesf from cStringIO import StringIO from cPickle import Pickler, Unpickler import Shared.DC.xml.ppml ppml=Shared.DC.xml.ppml TupleType=type(()) from base64 import encodestring def save_record(self, tag, data): file=self.file write=file.write pos=file.tell() file.seek(pos) a=data[1] if a.has_key('id'): oid=a['id'] oid=ppml.p64(string.atoi(oid)) v='' for x in data[2:]: v=v+x l=ppml.p64(len(v)) v=oid+l+v return v class zopedata: def __init__(self, parser, tag, attrs): self.file=parser.file write=self.file.write write('ZEXP') def append(self, data): file=self.file write=file.write pos=file.tell() file.seek(pos) write(data) def start_zopedata(self, tag, data): return zopedata(self, tag, data) def save_zopedata(self, tag, data): file=self.file write=file.write pos=file.tell() file.seek(pos) write(export_end_marker) class ExportImport: def exportFile(self, oid, file=None): if file is None: file=TemporaryFile() elif type(file) is StringType: file=open(file,'w+b') write=file.write write('ZEXP') version=self._version ref=referencesf oids=[oid] done_oids={} done=done_oids.has_key load=self._storage.load while oids: oid=oids[0] del oids[0] if done(oid): continue done_oids[oid]=1 try: p, serial = load(oid, version) except: pass # Ick, a broken reference else: ref(p, oids) write(oid) write(p64(len(p))) write(p) write(export_end_marker) return file def XMLrecord(self, oid, len, p): q=ppml.ToXMLUnpickler f=StringIO(p) u=q(f) id=ppml.u64(oid) aka=encodestring(oid)[:-1] u.idprefix=str(id)+'.' p=u.load().__str__(4) if f.tell() < len: p=p+u.load().__str__(4) String=' \n%s \n' % (id, aka, p) return String def exportXML(self, oid, file=None): if file is None: file=TemporaryFile() elif type(file) is StringType: file=open(file,'w+b') write=file.write write('\012\012') version=self._version ref=referencesf oids=[oid] done_oids={} done=done_oids.has_key load=self._storage.load while oids: oid=oids[0] del oids[0] if done(oid): continue done_oids[oid]=1 try: p, serial = load(oid, version) except: pass # Ick, a broken reference else: ref(p, oids) write(self.XMLrecord(oid,len(p),p)) write('\n') return file def importFile(self, file, clue=''): # This is tricky, because we need to work in a transaction! if type(file) is StringType: file_name=file file=open(file,'rb') else: try: file_name=file.name except: file_name='(unknown)' read=file.read if read(4) == ' 0) # # ? 8-byte position of previous record in this version # (if version length > 0) # # ? version string # (if version length > 0) # # ? data # (data length > 0) # # ? 8-byte position of data record containing data # (data length == 0) # # Note that the lengths and positions are all big-endian. # Also, the object ids time stamps are big-endian, so comparisons # are meaningful. # # Version handling # # There isn't a separate store for versions. Each record has a # version field, indicating what version it is in. The records in a # version form a linked list. Each record that has a non-empty # version string has a pointer to the previous record in the version. # Version back pointers are retained *even* when versions are # committed or aborted or when transactions are undone. # # There is a notion of "current" version records, which are the # records in a version that are the current records for their # respective objects. When a version is comitted, the current records # are committed to the destination version. When a version is # aborted, the current records are aborted. # # When committing or aborting, we search backward through the linked # list until we find a record for an object that does not have a # current record in the version. If we find a record for which the # non-version pointer is the same as the previous pointer, then we # forget that the corresponding object had a current record in the # version. This strategy allows us to avoid searching backward through # previously committed or aborted version records. # # Of course, we ignore records in undone transactions when committing # or aborting. # # Backpointers # # When we commit or abort a version, we don't copy (or delete) # and data. Instead, we write records with back pointers. # # A version record *never* has a back pointer to a non-version # record, because we never abort to a version. A non-version record # may have a back pointer to a version record or to a non-version # record. # __version__='$Revision: 1.27 $'[11:-2] import struct, time, os, bpthread, string, base64, sys from struct import pack, unpack from cPickle import loads import POSException from TimeStamp import TimeStamp from lock_file import lock_file from utils import t32, p64, u64, cp from zLOG import LOG, WARNING, ERROR, PANIC, register_subsystem register_subsystem('ZODB FS') import BaseStorage z64='\0'*8 def warn(message, *data): LOG('ZODB FS',WARNING, "%s warn: %s\n" % (packed_version, (message % data))) def error(message, *data): LOG('ZODB FS',ERROR,"%s ERROR: %s\n" % (packed_version, (message % data))) def nearPanic(message, *data): LOG('ZODB FS',PANIC,"%s ERROR: %s\n" % (packed_version, (message % data))) def panic(message, *data): message=message%data LOG('ZODB FS',PANIC,"%s ERROR: %s\n" % (packed_version, message)) raise CorruptedTransactionError, message class FileStorageError(POSException.StorageError): pass class FileStorageFormatError(FileStorageError): """Invalid file format The format of the given file is not valid """ class CorruptedFileStorageError(FileStorageError, POSException.StorageSystemError): """Corrupted file storage """ class CorruptedTransactionError(CorruptedFileStorageError): pass class CorruptedDataError(CorruptedFileStorageError): pass class FileStorageQuotaError(FileStorageError, POSException.StorageSystemError): """File storage quota exceeded """ packed_version='FS21' class FileStorage(BaseStorage.BaseStorage): _packt=z64 def __init__(self, file_name, create=0, read_only=0, stop=None, quota=None): if not os.path.exists(file_name): create = 1 if read_only: if create: raise ValueError, "can\'t create a read-only file" elif stop is not None: raise ValueError, "time-travel is only supported in read-only mode" if stop is None: stop='\377'*8 # Lock the database and set up the temp file. if not read_only: try: f=open(file_name+'.lock', 'r+') except: f=open(file_name+'.lock', 'w+') lock_file(f) try: f.write(str(os.getpid())) f.flush() except: pass self._lock_file=f # so it stays open self._tfile=open(file_name+'.tmp','w+b') else: self._tfile=None BaseStorage.BaseStorage.__init__(self, file_name) index, vindex, tindex, tvindex = self._newIndexes() self._initIndex(index, vindex, tindex, tvindex) # Now open the file if create: if os.path.exists(file_name): os.remove(file_name) file=open(file_name,'w+b') file.write(packed_version) else: file=open(file_name, read_only and 'rb' or 'r+b') self._file=file self._pos, self._oid, tid = read_index( file, file_name, index, vindex, tindex, stop) self._ts=tid=TimeStamp(tid) t=time.time() t=apply(TimeStamp,(time.gmtime(t)[:5]+(t%60,))) if tid > t: warn("%s Database records in the future", file_name); if tid.timeTime() - t.timeTime() > 86400*30: # a month in the future? This is bogus, use current time self._ts=t self._quota=quota def _initIndex(self, index, vindex, tindex, tvindex): self._index=index self._vindex=vindex self._tindex=tindex self._tvindex=tvindex self._index_get=index.get self._vindex_get=vindex.get self._tappend=tindex.append def __len__(self): return len(self._index) def _newIndexes(self): return {}, {}, [], {} def abortVersion(self, src, transaction): return self.commitVersion(src, '', transaction, abort=1) def close(self): self._file.close() # Eventuallly, we should save_index def commitVersion(self, src, dest, transaction, abort=None): # We are going to commit by simply storing back pointers. if dest and abort: raise 'VersionCommitError', ( 'Internal error, can\'t abort to a version') if transaction is not self._transaction: raise POSException.StorageTransactionError(self, transaction) self._lock_acquire() try: file=self._file read=file.read seek=file.seek tfile=self._tfile write=tfile.write tappend=self._tappend index=self._index srcpos=self._vindex_get(src, 0) spos=p64(srcpos) middle=struct.pack(">8sH8s", p64(self._pos), len(dest), z64) if dest: sd=p64(self._vindex_get(dest, 0)) heredelta=66+len(dest) else: sd='' heredelta=50 here=tfile.tell()+self._pos+self._thl oids=[] appoids=oids.append tvindex=self._tvindex current_oids={} current=current_oids.has_key t=None tstatus=' ' while srcpos: seek(srcpos) h=read(58) # oid, serial, prev(oid), tloc, vlen, plen, pnv, pv oid=h[:8] pnv=h[-16:-8] if index[oid]==srcpos: # This is a current record! tappend((oid,here)) appoids(oid) write(h[:16] + spos + middle) if dest: tvindex[dest]=here write(pnv+sd+dest) sd=p64(here) write(abort and pnv or spos) # data backpointer to src data here=here+heredelta if h[16:24] != pnv: # This is not the first current record, so mark it current_oids[oid]=1 else: # Hm. This is a non-current record. Is there a # current record for this oid? if not current(oid): # Nope. We're done *if* this transaction wasn't undone. tloc=h[24:32] if t != tloc: # We haven't checked this transaction before, # get it's status. t=tloc seek(u64(t)+16) tstatus=read(1) if tstatus != 'u': # Yee ha! We can quit break elif h[16:24] == pnv: # This is the first current record, so unmark it. # Note that we don't need to check if this was # undone. If it *was* undone, then there must # be a later record that is the first record, or # there isn't a current record. In either case, # we can't be in this branch. :) del current_oids[oid] spos=h[-8:] srcpos=u64(spos) return oids finally: self._lock_release() def getSize(self): return self._pos def _loada(self, oid, _index, file): "Read any version and return the version" pos=_index[oid] file.seek(pos) read=file.read h=read(42) doid,serial,prev,tloc,vlen,plen = unpack(">8s8s8s8sH8s", h) if vlen: nv = read(8) != z64 file.seek(8,1) # Skip previous version record pointer version=read(vlen) else: version='' nv=0 if plen != z64: return read(u64(plen)), version, nv return _loadBack(file, oid, read(8))[0], version, nv def _load(self, oid, version, _index, file): pos=_index[oid] file.seek(pos) read=file.read h=read(42) doid,serial,prev,tloc,vlen,plen = unpack(">8s8s8s8sH8s", h) if doid != oid: raise CorruptedDataError, h if vlen: pnv=read(8) # Read location of non-version data if (not version or len(version) != vlen or (read(8) # skip past version link and version != read(vlen)) ): return _loadBack(file, oid, pnv) # If we get here, then either this was not a version record, # or we've already read past the version data! if plen != z64: return read(u64(plen)), serial pnv=read(8) # We use the current serial, since that is the one that # will get checked when we store. return _loadBack(file, oid, pnv)[0], serial def load(self, oid, version, _stuff=None): self._lock_acquire() try: return self._load(oid, version, self._index, self._file) finally: self._lock_release() def modifiedInVersion(self, oid): self._lock_acquire() try: pos=self._index[oid] file=self._file seek=file.seek seek(pos) doid,serial,prev,tloc,vlen = unpack(">8s8s8s8sH", file.read(34)) if doid != oid: raise CorruptedDataError, pos if vlen: seek(24,1) # skip plen, pnv, and pv return file.read(vlen) return '' finally: self._lock_release() def store(self, oid, serial, data, version, transaction): if transaction is not self._transaction: raise POSException.StorageTransactionError(self, transaction) self._lock_acquire() try: old=self._index_get(oid, 0) pnv=None if old: file=self._file file.seek(old) read=file.read h=read(42) doid,oserial,sprev,stloc,vlen,splen = unpack(">8s8s8s8sH8s", h) if doid != oid: raise CorruptedDataError, h if vlen: pnv=read(8) # non-version data pointer read(8) # skip past version link locked_version=read(vlen) if version != locked_version: raise POSException.VersionLockError, ( `oid`, locked_version) if serial != oserial: raise POSException.ConflictError, ( serial, oserial) tfile=self._tfile write=tfile.write pos=self._pos here=tfile.tell()+pos+self._thl self._tappend(oid, here) serial=self._serial write(pack(">8s8s8s8sH8s", oid,serial,p64(old),p64(pos), len(version),p64(len(data)) ) ) if version: if pnv: write(pnv) else: write(p64(old)) # Link to last record for this version: tvindex=self._tvindex pv=tvindex.get(version, 0) or self._vindex_get(version, 0) write(p64(pv)) tvindex[version]=here write(version) write(data) # Check quota quota=self._quota if quota is not None and tfile.tell()+pos+self._thl > quota: raise FileStorageQuotaError, ( 'The storage quota has been exceeded.') return serial finally: self._lock_release() def supportsUndo(self): return 1 def supportsVersions(self): return 1 def _clear_temp(self): del self._tindex[:] self._tvindex.clear() self._tfile.seek(0) def _begin(self, tid, u, d, e): self._thl=23+len(u)+len(d)+len(e) def _finish(self, tid, u, d, e): file=self._file write=file.write tfile=self._tfile dlen=tfile.tell() tfile.seek(0) id=self._serial user, desc, ext = self._ude tlen=self._thl pos=self._pos file.seek(pos) tl=tlen+dlen stl=p64(tl) try: # Note that we use a status of 'c', for checkpoint. # If this flag isn't cleared, anything after this is # suspect. write(pack( ">8s" "8s" "c" "H" "H" "H" ,id, stl, 'c', len(user), len(desc), len(ext), )) if user: write(user) if desc: write(desc) if ext: write(ext) cp(tfile, file, dlen) write(stl) # OK, not clear the checkpoint flag file.seek(pos+16) write(' ') file.flush() except: # Hm, an error occured writing out the data. Maybe the # disk is full. We don't want any turd at the end. file.truncate(pos) self._pos=pos+tl+8 index=self._index for oid, pos in self._tindex: index[oid]=pos self._vindex.update(self._tvindex) def undo(self, transaction_id): self._lock_acquire() try: transaction_id=base64.decodestring(transaction_id+'==\n') tid, tpos = transaction_id[:8], u64(transaction_id[8:]) packt=self._packt if packt is None or packt > tid: raise POSException.UndoError, ( 'Undo is currently disabled for database maintenance.

    ') file=self._file seek=file.seek read=file.read index_get=self._index_get unpack=struct.unpack seek(tpos) h=read(23) if len(h) != 23 or h[:8] != tid: raise POSException.UndoError, 'Invalid undo transaction id' if h[16] == 'u': return if h[16] != ' ': raise POSException.UndoError, 'Undoable transaction' tl=u64(h[8:16]) ul,dl,el=unpack(">HHH", h[17:23]) tend=tpos+tl pos=tpos+23+ul+dl+el t={} while pos < tend: # Read the data records for this transaction seek(pos) h=read(42) oid,serial,sprev,stloc,vlen,splen = unpack(">8s8s8s8sH8s", h) plen=u64(splen) prev=u64(sprev) dlen=42+(plen or 8) if vlen: dlen=dlen+16+vlen if index_get(oid,0) != pos: raise POSException.UndoError, 'Undoable transaction' pos=pos+dlen if pos > tend: raise POSException.UndoError, 'Undoable transaction' t[oid]=prev seek(tpos+16) file.write('u') index=self._index for oid, pos in t.items(): index[oid]=pos return t.keys() finally: self._lock_release() def undoLog(self, first, last, filter=None): self._lock_acquire() try: packt=self._packt if packt is None: raise POSException.UndoError, ( 'Undo is currently disabled for database maintenance.

    ') pos=self._pos if pos < 39: return [] file=self._file seek=file.seek read=file.read unpack=struct.unpack strip=string.strip encode=base64.encodestring r=[] append=r.append i=0 while i < last and pos > 39: seek(pos-8) pos=pos-u64(read(8))-8 if i < first: i = i+1 continue seek(pos) h=read(23) tid, tl, status, ul, dl, el = unpack(">8s8scHHH", h) if tid < packt: break if status != ' ': continue u=ul and read(ul) or '' d=dl and read(dl) or '' d={'id': encode(tid+p64(pos))[:22], 'time': TimeStamp(tid).timeTime(), 'user_name': u, 'description': d} if el: try: e=loads(read(el)) d.update(e) except: pass if filter is None or filter(d): append(d) i=i+1 return r finally: self._lock_release() def versionEmpty(self, version): self._lock_acquire() try: index=self._index file=self._file seek=file.seek read=file.read srcpos=self._vindex_get(version, 0) t=tstatus=None while srcpos: seek(srcpos) oid=read(8) if index[oid]==srcpos: return 0 h=read(50) # serial, prev(oid), tloc, vlen, plen, pnv, pv tloc=h[16:24] if t != tloc: # We haven't checked this transaction before, # get it's status. t=tloc seek(u64(t)+16) tstatus=read(1) if tstatus != 'u': return 1 spos=h[-8:] srcpos=u64(spos) return 1 finally: self._lock_release() def versions(self, max=None): r=[] a=r.append keys=self._vindex.keys() if max is not None: keys=keys[:max] for version in keys: if self.versionEmpty(version): continue a(version) if max and len(r) >= max: return r return r def pack(self, t, referencesf): """Copy data from the current database file to a packed file Non-current records from transactions with time-stamp strings less than packtss are ommitted. As are all undone records. Also, data back pointers that point before packtss are resolved and the associated data are copied, since the old records are not copied. """ # Ugh, this seems long packing=1 # are we in the packing phase (or the copy phase) locked=0 _lock_acquire=self._lock_acquire _lock_release=self._lock_release index, vindex, tindex, tvindex = self._newIndexes() name=self.__name__ file=open(name, 'r+b') stop=`apply(TimeStamp, time.gmtime(t)[:5]+(t%60,))` if stop==z64: raise FileStorageError, 'Invalid pack time' try: ################################################################## # Step 1, get index as of pack time that # includes only referenced objects. # Record pack time so we don't undo while packing _lock_acquire() locked=1 if self._packt != z64: raise FileStorageError, 'Already packing' self._packt=stop _lock_release() locked=0 packpos, maxoid, ltid = read_index( file, name, index, vindex, tindex, stop) rootl=[z64] pop=rootl.pop pindex={} referenced=pindex.has_key _load=self._load _loada=self._loada v=None while rootl: oid=pop() if referenced(oid): continue try: p, v, nv = _loada(oid, index, file) referencesf(p, rootl) if nv: p, serial = _load(oid, '', index, file) referencesf(p, rootl) pindex[oid]=index[oid] except: pindex[oid]=0 error('Bad reference to %s', `(oid,v)`) spackpos=p64(packpos) ################################################################## # Step 2, copy data and compute new index based on new positions. index, vindex, tindex, tvindex = self._newIndexes() ofile=open(name+'.pack', 'w+b') # Index for non-version data. This is a temporary structure # to reduce I/O during packing nvindex={} # Cache a bunch of methods seek=file.seek read=file.read oseek=ofile.seek write=ofile.write tappend=tindex.append index_get=index.get vindex_get=vindex.get pindex_get=pindex.get # Initialize, pv=z64 offset=0 # the amount of spaec freed by packing pos=opos=4 oseek(0) write(packed_version) # Copy the data in two stages. In the packing stage, # we skip records that are non-current or that are for # unreferenced objects. We also skip undone transactions. # # After the packing stage, we copy everything but undone # transactions, however, we have to update various back pointers. # We have to have the storage lock in the second phase to keep # data from being changed while we're copying. pnv=None while 1: # Check for end of packed records if packing and pos >= packpos: # OK, we're done with the old stuff, now we have # to get the lock so we can copy the new stuff! offset=pos-opos if offset <= 0: # we didn't free any space, there's no point in # continuing ofile.close() file.close() os.remove(name+'.pack') return packing=0 _lock_acquire() locked=1 self._packt=None # Prevent undo until we're done # Read the transaction record seek(pos) h=read(23) if len(h) < 23: break tid, stl, status, ul, dl, el = unpack(">8s8scHHH",h) if status=='c': # Oops. we found a checkpoint flag. break if el < 0: el=t32-el tl=u64(stl) tpos=pos tend=tpos+tl if status=='u': # Undone transaction, skip it pos=tend+8 continue otpos=opos # start pos of output trans # write out the transaction record status=packing and 'p' or ' ' write(h[:16]+status+h[17:]) thl=ul+dl+el h=read(thl) if len(h) != thl: raise 'Pack Error', opos write(h) thl=23+thl pos=tpos+thl opos=otpos+thl while pos < tend: # Read the data records for this transaction seek(pos) h=read(42) oid,serial,sprev,stloc,vlen,splen = unpack( ">8s8s8s8sH8s", h) plen=u64(splen) dlen=42+(plen or 8) if vlen: dlen=dlen+16+vlen if packing and pindex_get(oid,0) != pos: # This is not the most current record, or # the oid is no longer referenced so skip it. pos=pos+dlen continue pnv=u64(read(8)) # skip position of previous version record seek(8,1) version=read(vlen) pv=p64(vindex_get(version, 0)) vindex[version]=opos else: if packing: ppos=pindex_get(oid, 0) if ppos != pos: if not ppos: # This object is no longer referenced # so skip it. pos=pos+dlen continue # This is not the most current record # But maybe it's the most current committed # record. seek(ppos) ph=read(42) pdoid,ps,pp,pt,pvlen,pplen = unpack( ">8s8s8s8sH8s", ph) if not pvlen: # The most current record is committed, so # we can toss this one pos=pos+dlen continue pnv=read(8) pnv=_loadBackPOS(file, oid, pnv) if pnv > pos: # The current non version data is later, # so this isn't the current record pos=pos+dlen continue # Ok, we've gotten this far, so we have # the current record and we're ready to # read the pickle, but we're in the wrong # place, after wandering around to figure # out is we were current. Seek back # to pickle data: seek(pos+42) nvindex[oid]=opos tappend((oid,opos)) opos=opos+dlen pos=pos+dlen if plen: p=read(plen) else: p=read(8) if packing: # When packing we resolve back pointers! p, serial = _loadBack(file, oid, p) plen=len(p) opos=opos+plen-8 splen=p64(plen) else: p=u64(p) if p < packpos: # We have a backpointer to a # non-packed record. We have to be # careful. If we were pointing to a # current record, then we should still # point at one, otherwise, we should # point at the last non-version record. if pindex[oid]==p: # we were pointing to the # current record p=index[oid] else: p=nvindex[oid] else: # This points back to a non-packed record. # Just adjust for the offset p=p-offset p=p64(p) sprev=p64(index_get(oid,0)) write(pack(">8s8s8s8sH8s", oid,serial,sprev,p64(otpos),vlen,splen)) if vlen: if not pnv: write(z64) else: if pnv < packpos: # we need to point to the packed # non-version rec pnv=nvindex[oid] else: # we just need to adjust the pointer # with the offset pnv=pnv-offset write(p64(pnv)) write(pv) write(version) write(p) # skip the (intentionally redundant) transaction length pos=pos+8 if locked: # temporarily release the lock to give other threads # a chance to do some work! _lock_release() locked=0 for oid, p in tindex: index[oid]=p # Record the position del tindex[:] # Now, maybe we need to hack or delete the transaction otl=opos-otpos if otl != tl: # Oops, what came out is not what came in! # Check for empty: if otl==thl: # Empty, slide back over the header: opos=otpos oseek(opos) else: # Not empty, but we need to adjust transaction length # and update the status oseek(otpos+8) otl=p64(otl) write(otl+status) oseek(opos) write(otl) opos=opos+8 else: write(p64(otl)) opos=opos+8 if not packing: # We are in the copying phase. Lets update the # pack time and release the lock so others can write. _lock_acquire() locked=1 # OK, we've copied everything. Now we need to wrap things # up. # Hack the files around. name=self.__name__ ofile.flush() ofile.close() file.close() self._file.close() try: if os.path.exists(name+'.old'): os.remove(name+'.old') os.rename(name, name+'.old') except: # Waaa self._file=open(name,'r+b') raise # OK, we're beyond the point of no return os.rename(name+'.pack', name) self._file=open(name,'r+b') self._initIndex(index, vindex, tindex, tvindex) self._pos=opos finally: if locked: _lock_release() _lock_acquire() self._packt=z64 _lock_release() def read_index(file, name, index, vindex, tindex, stop='\377'*8): index_get=index.get vndexpos=vindex.get tappend=tindex.append read=file.read seek=file.seek seek(0,2) file_size=file.tell() seek(0) if file_size: if file_size < 4: raise FileStorageFormatError, file.name if read(4) != packed_version: raise FileStorageFormatError, name else: file.write(packed_version) pos=4 unpack=struct.unpack tpos=0 maxoid=ltid=z64 tid='\0'*7+'\1' while 1: # Read the transaction record h=read(23) if not h: break if len(h) != 23: warn('%s truncated at %s', name, pos) seek(pos) file.truncate() break tid, stl, status, ul, dl, el = unpack(">8s8scHHH",h) if el < 0: el=t32-el if tid <= ltid: warn("%s time-stamp reduction at %s", name, pos) ltid=tid tl=u64(stl) if tl+pos+8 > file_size or status=='c': # Hm, the data were truncated or the checkpoint flag wasn't # cleared. They may also be corrupted, # in which case, we don't want to totally lose the data. warn("%s truncated, possibly due to damaged records at %s", name, pos) _truncate(file, name, pos) break if status not in ' up': warn('%s has invalid status, %s, at %s', name, status, pos) if ul > tl or dl > tl or el > tl or tl < (23+ul+dl+el): # We're in trouble. Find out if this is bad data in the # middle of the file, or just a turd that Win 9x dropped # at the end when the system crashed. # Skip to the end and read what should be the transaction length # of the last transaction. seek(-8, 2) rtl=u64(read(8)) # Now check to see if the redundant transaction length is # reasonable: if file_size - rtl < pos or rtl < 23: nearPanic('%s has invalid transaction header at %s', name, pos) warn("It appears that there is invalid data at the end of the " "file, possibly due to a system crash. %s truncated " "to recover from bad data at end." % name) _truncate(file, name, pos) break else: panic('%s has invalid transaction header at %s', name, pos) if tid >= stop: break tpos=pos tend=tpos+tl if status=='u': # Undone transaction, skip it seek(tend) h=read(8) if h != stl: panic('%s has inconsistent transaction length at %s', name, pos) pos=tend+8 continue pos=tpos+23+ul+dl+el while pos < tend: # Read the data records for this transaction seek(pos) h=read(42) oid,serial,sprev,stloc,vlen,splen = unpack(">8s8s8s8sH8s", h) prev=u64(sprev) tloc=u64(stloc) plen=u64(splen) dlen=42+(plen or 8) tappend((oid,pos)) if vlen: dlen=dlen+16+vlen seek(8,1) pv=u64(read(8)) version=read(vlen) # Jim says: "It's just not worth the bother." #if vndexpos(version, 0) != pv: # panic("%s incorrect previous version pointer at %s", # name, pos) vindex[version]=pos if pos+dlen > tend or tloc != tpos: panic("%s data record exceeds transaction record at %s", name, pos) if index_get(oid,0) != prev: panic("%s incorrect previous pointer at %s", name, pos) pos=pos+dlen if pos != tend: panic("%s data records don't add up at %s",name,tpos) # Read the (intentionally redundant) transaction length seek(pos) h=read(8) if h != stl: panic("%s redundant transaction length check failed at %s", name, pos) pos=pos+8 for oid, p in tindex: maxoid=max(maxoid,oid) index[oid]=p # Record the position del tindex[:] return pos, maxoid, ltid def _loadBack(file, oid, back): seek=file.seek read=file.read while 1: old=u64(back) if not old: raise KeyError, oid seek(old) h=read(42) doid,serial,prev,tloc,vlen,plen = unpack(">8s8s8s8sH8s", h) if vlen: seek(vlen+16,1) if plen != z64: return read(u64(plen)), serial back=read(8) # We got a back pointer! def _loadBackPOS(file, oid, back): seek=file.seek read=file.read while 1: old=u64(back) if not old: raise KeyError, oid seek(old) h=read(42) doid,serial,prev,tloc,vlen,plen = unpack(">8s8s8s8sH8s", h) if vlen: seek(vlen+16,1) if plen != z64: return old back=read(8) # We got a back pointer! def _truncate(file, name, pos): seek=file.seek seek(0,2) file_size=file.tell() try: i=0 while 1: oname='%s.tr%s' % (name, i) if os.path.exists(oname): i=i+1 else: warn("Writing truncated data from %s to %s", name, oname) o=open(oname,'wb') seek(pos) cp(file, o, file_size-pos) o.close() break except: error("couldn\'t write truncated data for %s", name) raise POSException.StorageSystemError, ( "Couldn't save truncated data") seek(pos) file.truncate() Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/MappingStorage.py100644 1007 1403 21127 6742210756 22457 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Very Simple Mapping ZODB storage The Mapping storage provides an extremely simple storage implementation that doesn't provide undo or version support. It is meant to illustrate the simplest possible storage. The Mapping storage uses a single data structure to map object ids to data. The Demo storage serves two purposes: - Provide an example implementation of a full storage without distracting storage details, - Provide a volatile storage that is useful for giving demonstrations. The demo strorage can have a "base" storage that is used in a read-only fashion. The base storage must not not to contain version data. There are three main data structures: _data -- Transaction logging information necessary for undo This is a mapping from transaction id to transaction, where a transaction is simply a 4-tuple: packed, user, description, extension_data, records where extension_data is a dictionary or None and records are the actual records in chronological order. Packed is a flag indicating whethe the transaction has been packed or not _index -- A mapping from oid to record _vindex -- A mapping from version name to version data where version data is a mapping from oid to record A record is a tuple: oid, serial, pre, vdata, p, where: oid -- object id serial -- object serial number pre -- The previous record for this object (or None) vdata -- version data None if not a version, ortherwise: version, non-version-record p -- the pickle data or None The pickle data will be None for a record for an object created in an aborted version. It is instructive to watch what happens to the internal data structures as changes are made. Foe example, in Zope, you can create an external method:: import Zope def info(RESPONSE): RESPONSE['Content-type']= 'text/plain' return Zope.DB._storage._splat() and call it to minotor the storage. """ __version__='$Revision: 1.3 $'[11:-2] import POSException, BaseStorage, string, utils from TimeStamp import TimeStamp class MappingStorage(BaseStorage.BaseStorage): def __init__(self, name='Mapping Storage'): BaseStorage.BaseStorage.__init__(self, name) self._index={} self._tindex=[] # Note: # If you subclass this and use a persistent mapping facility # (e.g. a dbm file), you will need to get the maximum key and # save it as self._oid. See dbmStorage. def __len__(self): return len(self._index) def getSize(self): s=32 index=self._index for oid in index.keys(): p=index[oid] s=s+56+len(p) return s def load(self, oid, version): self._lock_acquire() try: p=self._index[oid] return p[8:], p[:8] # pickle, serial finally: self._lock_release() def store(self, oid, serial, data, version, transaction): if transaction is not self._transaction: raise POSException.StorageTransactionError(self, transaction) if version: raise POSException.Unsupported, "Versions aren't supported" self._lock_acquire() try: if self._index.has_key(oid): old=self._index[oid] oserial=old[:8] if serial != oserial: raise POSException.ConflictError serial=self._serial self._tindex.append((oid,serial+data)) finally: self._lock_release() return serial def _clear_temp(self): self._tindex=[] def _finish(self, tid, user, desc, ext): index=self._index for oid, p in self._tindex: index[oid]=p def pack(self, t, referencesf): self._lock_acquire() try: # Build an index of *only* those objects reachable # from the root. index=self._index rootl=['\0\0\0\0\0\0\0\0'] pop=rootl.pop pindex={} referenced=pindex.has_key while rootl: oid=pop() if referenced(oid): continue # Scan non-version pickle for references r=index[oid] pindex[oid]=r p=r[8:] referencesf(p, rootl) # Now delete any unreferenced entries: for oid in index.keys(): if not referenced(oid): del index[oid] finally: self._lock_release() def _splat(self): """Spit out a string showing state. """ o=[] o.append('Index:') index=self._index keys=index.keys() keys.sort() for oid in keys: r=index[oid] o.append(' %s: %s, %s' % (utils.u64(oid),TimeStamp(r[:8]),`r[8:]`)) return string.join(o,'\n') Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/POSException.py100644 1007 1403 12220 6720306536 22047 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''BoboPOS-defined exceptions $Id: POSException.py,v 1.3 1999/05/18 15:55:10 jim Exp $''' __version__='$Revision: 1.3 $'[11:-2] class POSError(Exception): """Persistent object system error """ class TransactionError(POSError): """An error occured due to normal transaction processing """ class ConflictError(TransactionError): """Two transactions tried to modify the same object at once This transaction should be resubmitted. """ class VersionError(POSError): """An error in handling versions occurred """ class VersionCommitError(VersionError): """An invalid combination of versions was used in a version commit """ class VersionLockError(VersionError, TransactionError): """An attempt was made to modify an object that has been modified in an unsaved version""" class UndoError(POSError): """An attempt was made to undo an undoable transaction. """ class StorageError(POSError): pass class StorageTransactionError(StorageError): """An operation was invoked for an invalid transaction or state """ class StorageSystemError(StorageError): """Panic! Internal storage error! """ class ExportError(POSError): """An export file doesn't have the right format. """ pass class Unimplemented(POSError): """An unimplemented feature was used """ pass class Unsupported(POSError): """An feature that is unsupported bt the storage was used. """ Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/PersistentMapping.py100644 1007 1403 12757 6715664254 23232 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Python implementation of persistent base types $Id: PersistentMapping.py,v 1.5 1999/05/10 23:15:56 jim Exp $''' __version__='$Revision: 1.5 $'[11:-2] import Persistence class PersistentMapping(Persistence.Persistent): """A persistent wrapper for mapping objects. This class allows wrapping of mapping objects so that object changes are registered. As a side effect, mapping objects may be subclassed. """ def __init__(self,container=None): if container is None: container={} self._container=container def __delitem__(self, key): del self._container[key] try: del self._v_keys except: pass self.__changed__(1) def __getitem__(self, key): return self._container[key] def __len__(self): return len(self._container) def __setitem__(self, key, v): self._container[key]=v try: del self._v_keys except: pass self.__changed__(1) def clear(self): self._container.clear() self._p_changed=1 if hasattr(self,'_v_keys'): del self._v_keys def copy(self): return self.__class__(self._container.copy()) def get(self, key, default): return self._container.get(key, default) def has_key(self,key): return self._container.has_key(key) def items(self): return map(lambda k, d=self: (k,d[k]), self.keys()) def keys(self): try: return self._v_keys except: pass keys=self._v_keys=filter( lambda k: k[:1]!='_', self._container.keys()) keys.sort() return keys def update(self, b): a=self._container for k, v in b.items(): a[k] = v self._p_changed=1 def values(self): return map(lambda k, d=self: d[k], self.keys()) Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/Setup100644 1007 1403 643 6767565020 20154 0ustar petrillipetrilli*shared* cPersistence cPersistence.c -I../../Components/ExtensionClass cPickleCache cPickleCache.c -I../../Components/ExtensionClass TimeStamp TimeStamp.c -I../../Components/ExtensionClass -DUSE_EXTENSION_CLASS coptimizations coptimizations.c -I../../Components/ExtensionClass # This is an auxilary file that provides file locking on windows. # It is essentially null on any other platform. winlock winlock.c Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/TimeStamp.c100644 1007 1403 32042 6742725726 21242 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ static char TimeStamp_module_documentation[] = "" "\n$Id: TimeStamp.c,v 1.5 1999/07/13 21:12:54 jim Exp $" ; #include #include #ifdef USE_EXTENSION_CLASS #include "ExtensionClass.h" #else #include "Python.h" #endif static PyObject *ErrorObject; /* ----------------------------------------------------- */ static void PyVar_Assign(PyObject **v, PyObject *e) { Py_XDECREF(*v); *v=e;} #define ASSIGN(V,E) PyVar_Assign(&(V),(E)) #define UNLESS(E) if(!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E); UNLESS(V) #define OBJECT(O) ((PyObject*)(O)) /* Declarations for objects of type TimeStamp */ typedef struct { PyObject_HEAD unsigned char data[8]; } TimeStamp; static double TimeStamp_yad(int y) { double d, s; d=(y-1)*365; if (y > 0) { s=1.0; y=y-1; } else { s=-1.0; y = -y; } return d+s*(y/4-y/100+(y+300)/400); } static char month_len[2][12]={ {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}, {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31} }; static short joff[2][12] = { {0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334}, {0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335} }; static double TimeStamp_abst(int y, int mo, int d, int m, int s) { int l; l = y%4==0 && (y%100 != 0 || y%400==0); return (TimeStamp_yad(y)+ joff[l][mo]+d)*86400 + m*60 + s; } static double gmoff=0, sconv=0; static int TimeStamp_init_gmoff() { struct tm *t; time_t z=0; t=gmtime(&z); if (! t) { PyErr_SetString(PyExc_SystemError, "gmtime failed"); return -1; } gmoff=TimeStamp_abst( t->tm_year, t->tm_mon, t->tm_mday-1, t->tm_hour*60+t->tm_min, t->tm_sec); sconv=((double)60)/((double)(1<<16))/((double)(1<<16)); return 0; } static PyObject * TimeStamp___init__(TimeStamp *self, PyObject *args) { int y, mo, d, h=0, m=0; double sec=0; char *s; unsigned int v; if (PyArg_ParseTuple(args, "s#", &s, &m)) { if (m != 8) { PyErr_SetString(ErrorObject, "8-character string expected"); return NULL; } memcpy(self->data, s, 8); } else { PyErr_Clear(); if (PyArg_ParseTuple(args, "iii|iid", &y, &mo, &d, &h, &m, &sec)) { s=self->data; v=((((y-1900)*12+mo-1)*31+d-1)*24+h)*60+m; s[0]=v/16777216; s[1]=(v%16777216)/65536; s[2]=(v%65536)/256; s[3]=v%256; sec /= sconv; v=(unsigned int)sec; s[4]=v/16777216; s[5]=(v%16777216)/65536; s[6]=(v%65536)/256; s[7]=v%256; } else { return NULL; } } Py_INCREF(Py_None); return Py_None; } static int TimeStamp_y, TimeStamp_m, TimeStamp_d, TimeStamp_mi; static void TimeStamp_parts(TimeStamp *self) { unsigned long v; v=self->data[0]*16777216+self->data[1]*65536+self->data[2]*256+self->data[3]; TimeStamp_y=v/535680+1900; TimeStamp_m=(v%535680)/44640+1; TimeStamp_d=(v%44640)/1440+1; TimeStamp_mi=v%1440; } static double TimeStamp_sec(TimeStamp *self) { unsigned int v; v=self->data[4]*16777216+self->data[5]*65536+self->data[6]*256+self->data[7]; return sconv*v; } static PyObject * TimeStamp_year(TimeStamp *self, PyObject *args) { TimeStamp_parts(self); return PyInt_FromLong(TimeStamp_y); } static PyObject * TimeStamp_month(TimeStamp *self, PyObject *args) { TimeStamp_parts(self); return PyInt_FromLong(TimeStamp_m); } static PyObject * TimeStamp_day(TimeStamp *self, PyObject *args) { TimeStamp_parts(self); return PyInt_FromLong(TimeStamp_d); } static PyObject * TimeStamp_hour(TimeStamp *self, PyObject *args) { TimeStamp_parts(self); return PyInt_FromLong(TimeStamp_mi/60); } static PyObject * TimeStamp_minute(TimeStamp *self, PyObject *args) { TimeStamp_parts(self); return PyInt_FromLong(TimeStamp_mi%60); } static PyObject * TimeStamp_second(TimeStamp *self, PyObject *args) { return PyFloat_FromDouble(TimeStamp_sec(self)); } static PyObject * TimeStamp_timeTime(TimeStamp *self, PyObject *args) { TimeStamp_parts(self); return PyFloat_FromDouble( TimeStamp_abst(TimeStamp_y-1900, TimeStamp_m-1, TimeStamp_d-1, TimeStamp_mi, 0)+ TimeStamp_sec(self)-gmoff ); } static PyObject * TimeStamp_laterThan(TimeStamp *self, PyObject *args) { TimeStamp *o=NULL; unsigned char *s; PyObject *a; int i; UNLESS(PyArg_ParseTuple(args, "O!", self->ob_type, &o)) return NULL; if (memcmp(self->data, o->data, 8) > 0) { Py_INCREF(self); return OBJECT(self); } self=o; UNLESS(a=PyString_FromStringAndSize(self->data, 8)) return NULL; s=(unsigned char *)PyString_AsString(a); for (i=7; i > 3; i--) { if (s[i] == 255) s[i]=0; else { s[i]++; return PyObject_CallFunction(OBJECT(self->ob_type), "O", a); } } TimeStamp_parts(self); if (TimeStamp_mi >= 1439) { TimeStamp_mi=0; i = TimeStamp_y%4==0 && (TimeStamp_y%100 != 0 || TimeStamp_y%400==0); if (TimeStamp_d == month_len[i][TimeStamp_m-1]) { TimeStamp_d=1; if (TimeStamp_m == 12) { TimeStamp_m=1; TimeStamp_y++; } else TimeStamp_m++; } else TimeStamp_d++; } else TimeStamp_mi++; return PyObject_CallFunction(OBJECT(self->ob_type), "iiiii", TimeStamp_y, TimeStamp_m, TimeStamp_d, TimeStamp_mi/60, TimeStamp_mi%60); } static struct PyMethodDef TimeStamp_methods[] = { {"year", (PyCFunction)TimeStamp_year, METH_VARARGS, ""}, {"minute", (PyCFunction)TimeStamp_minute, METH_VARARGS, ""}, {"month", (PyCFunction)TimeStamp_month, METH_VARARGS, ""}, {"day", (PyCFunction)TimeStamp_day, METH_VARARGS, ""}, {"hour", (PyCFunction)TimeStamp_hour, METH_VARARGS, ""}, {"second", (PyCFunction)TimeStamp_second, METH_VARARGS, ""}, {"seconds", (PyCFunction)TimeStamp_second, METH_VARARGS, ""}, {"timeTime", (PyCFunction)TimeStamp_timeTime, METH_VARARGS, ""}, {"laterThan", (PyCFunction)TimeStamp_laterThan, METH_VARARGS, ""}, #ifdef USE_EXTENSION_CLASS {"__init__", (PyCFunction)TimeStamp___init__, METH_VARARGS, ""}, #endif {NULL, NULL} /* sentinel */ }; #ifndef USE_EXTENSION_CLASS static TimeStampobject * newTimeStamp(PyObject *ignored, PyObject *args) { TimeStamp *self; UNLESS(self = PyObject_NEW(TimeStamp, &TimeStampType)) return NULL; ignored=__init__(self, args); if (! ignored) return NULL; Py_DECREF(ignored); return self; } #endif static void TimeStamp_dealloc(TimeStamp *self) { #ifdef USE_EXTENSION_CLASS Py_DECREF(self->ob_type); #endif PyMem_DEL(self); } static PyObject * TimeStamp_repr(TimeStamp *self) { return PyString_FromStringAndSize(self->data, 8); } static PyObject * TimeStamp_str(TimeStamp *self) { char buf[128]; int l; TimeStamp_parts(self); l=sprintf(buf, "%4.4d-%2.2d-%2.2d %2.2d:%2.2d:%lf", TimeStamp_y, TimeStamp_m, TimeStamp_d, TimeStamp_mi/60, TimeStamp_mi%60, TimeStamp_sec(self)); return PyString_FromStringAndSize(buf, l); } static int TimeStamp_compare(TimeStamp *v, TimeStamp *w) { return memcmp(v->data, w->data, 8); } static long TimeStamp_hash(TimeStamp *self) { return self->data[0]+self->data[1]+self->data[2]+self->data[3] +self->data[4]+self->data[5]+self->data[6]+self->data[7]; } static PyObject * TimeStamp_getattro(TimeStamp *self, PyObject *name) { #ifndef USE_EXTENSION_CLASS char *s; if (! (s=PyString_AsString(name))) return NULL; return Py_FindMethod(TimeStamp_methods, self, s); #else return Py_FindAttr(OBJECT(self), name); #endif } #ifdef USE_EXTENSION_CLASS static PyExtensionClass #else static PyTypeObject #endif TimeStampType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "TimeStamp", /*tp_name*/ sizeof(TimeStamp), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)TimeStamp_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*obsolete tp_getattr*/ (setattrfunc)0, /*obsolete tp_setattr*/ (cmpfunc)TimeStamp_compare, /*tp_compare*/ (reprfunc)TimeStamp_repr, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)TimeStamp_hash, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)TimeStamp_str, /*tp_str*/ (getattrofunc)TimeStamp_getattro, (setattrofunc)0, /* Space for future expansion */ 0L,0L, "Simple time stamps" #ifdef USE_EXTENSION_CLASS , METHOD_CHAIN(TimeStamp_methods), #endif }; static struct PyMethodDef Module_Level__methods[] = { #ifndef USE_EXTENSION_CLASS {"TimeStamp", (PyCFunction)newTimeStamp, METH_VARARGS, ""}, #endif {NULL, (PyCFunction)NULL, 0, NULL} /* sentinel */ }; void initTimeStamp() { PyObject *m, *d; char *rev="$Revision: 1.5 $"; if (TimeStamp_init_gmoff() < 0) return; if (! ExtensionClassImported) return; /* Create the module and add the functions */ m = Py_InitModule4("TimeStamp", Module_Level__methods, "Simple time stamps", (PyObject*)NULL,PYTHON_API_VERSION); /* Add some symbolic constants to the module */ d = PyModule_GetDict(m); #ifndef USE_EXTENSION_CLASS TimeStampType.ob_type=&PyType_Type; #else PyExtensionClass_Export(d, "TimeStamp", TimeStampType); #endif PyDict_SetItemString(d,"TimeStampType", OBJECT(&TimeStampType)); ErrorObject = PyString_FromString("TimeStamp.error"); PyDict_SetItemString(d, "error", ErrorObject); PyDict_SetItemString(d, "__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); /* Check for errors */ if (PyErr_Occurred()) Py_FatalError("can't initialize module TimeStamp"); } Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/TmpStore.py100644 1007 1403 14445 6736210275 21320 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import POSException from utils import p64, u64 class TmpStore: _transaction=_isCommitting=None def __init__(self, base_version, file=None): if file is None: import tempfile file=tempfile.TemporaryFile() self._file=file self._index={} self._pos=self._tpos=0 self._bver=base_version self._tindex=[] self._db=None def __del__(self): self.close() def close(self): self._file.close() del self._file del self._index del self._db def getName(self): return self._db.getName() def getSize(self): return self._pos def load(self, oid, version): #if version is not self: raise KeyError, oid pos=self._index.get(oid, None) if pos is None: return self._storage.load(oid, self._bver) file=self._file file.seek(pos) h=file.read(24) if h[:8] != oid: raise POSException.StorageSystemError, 'Bad temporary storage' return file.read(u64(h[16:])), h[8:16] def modifiedInVersion(self, oid): if self._index.has_key(oid): return 1 return self._db._storage.modifiedInVersion(oid) def new_oid(self): return self._db._storage.new_oid() def registerDB(self, db, limit): self._db=db self._storage=db._storage def store(self, oid, serial, data, version, transaction): if transaction is not self._transaction: raise POSException.StorageTransactionError(self, transaction) file=self._file pos=self._pos file.seek(pos) l=len(data) file.write(oid+serial+p64(l)) file.write(data) self._tindex.append((oid,pos)) self._pos=pos+l+24 return serial def tpc_abort(self, transaction): if transaction is not self._transaction: return del self._tindex[:] self._transaction=None self._pos=self._tpos def tpc_begin(self, transaction): if self._transaction is transaction: return self._transaction=transaction del self._tindex[:] # Just to be sure! self._pos=self._tpos def tpc_finish(self, transaction, f=None): if transaction is not self._transaction: return if f is not None: f() index=self._index tindex=self._tindex for oid, pos in tindex: index[oid]=pos del tindex[:] self._tpos=self._pos def undoLog(self, first, last, filter=None): return () def versionEmpty(self, version): if version is self: return len(self._index) Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/Transaction.py100644 1007 1403 27743 6754333174 22041 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Transaction management $Id: Transaction.py,v 1.15 1999/08/11 17:44:28 jim Exp $""" __version__='$Revision: 1.15 $'[11:-2] import time, sys, struct, POSException from struct import pack from string import split, strip, join from zLOG import LOG, ERROR, PANIC from POSException import ConflictError # Flag indicating whether certain errors have occurred. hosed=0 class Transaction: 'Simple transaction objects for single-threaded applications.' user='' description='' _connections=None _extension=None _sub=None # This is a subtrasaction flag def __init__(self, id=None): self._id=id self._objects=[] self._append=self._objects.append def _init(self): self._objects=[] self._append=self._objects.append self.user=self.description='' if self._connections: for c in self._connections.values(): c.close() del self._connections def sub(self): # Create a manually managed subtransaction for internal use r=self.__class__() r.user=self.user r.description=self.description r._extention=self._extension return r def __str__(self): return "%.3f\t%s" % (self._id, self.user) def __del__(self): if self._objects: self.abort(freeme=0) def abort(self, subtransaction=0, freeme=1): '''Abort the transaction. This is called from the application. This means that we haven\'t entered two-phase commit yet, so no tpc_ messages are sent. ''' t=v=tb=None subj=self._sub subjars=() if not subtransaction: if subj is not None: # Abort of top-level transaction after commiting # subtransactions. subjars=subj.values() self._sub=None try: # Abort the objects for o in self._objects: try: j=getattr(o, '_p_jar', o) if j is not None: j.abort(o, self) except: if t is None: t,v,tb=sys.exc_info() # Ugh, we need to abort work done in sub-transactions. while subjars: j=subjars.pop() j.abort_sub(self) # This should never fail if t is not None: raise t,v,tb finally: tb=None if subtransaction: del self._objects[:] # make sure it's empty (shouldn't need) elif freeme: if self._id is not None: free_transaction() else: self._init() def begin(self, info=None, subtransaction=None): '''Begin a new transaction. This aborts any transaction in progres. ''' if self._objects: self.abort(subtransaction, 0) if info: info=split(info,'\t') self.user=strip(info[0]) self.description=strip(join(info[1:],'\t')) def commit(self, subtransaction=None): 'Finalize the transaction' objects=self._objects jars={} subj=self._sub subjars=() if subtransaction: if subj is None: self._sub=subj={} else: if subj is not None: if objects: # Do an implicit sub-transaction commit: self.commit(1) objects=() subjars=subj.values() self._sub=None t=v=tb=None if (objects or subjars) and hosed: # Something really bad happened and we don't # trust the system state. raise POSException.TransactionError, ( """A serious error, which was probably a system error, occurred in a previous database transaction. This application may be in an invalid state and must be restarted before database updates can be allowed. Beware though that if the error was due to a serious system problem, such as a disk full condition, then the application may not come up until you deal with the system problem. See your application log for information on the error that lead to this problem. """) try: try: while objects: o=objects[-1] j=getattr(o, '_p_jar', o) if j is None: continue i=id(j) if not jars.has_key(i): jars[i]=j if subtransaction: subj[i]=j j.tpc_begin(self, subtransaction) else: j.tpc_begin(self) j.commit(o,self) del objects[-1] # Commit work done in subtransactions while subjars: j=subjars.pop() i=id(j) if not jars.has_key(i): jars[i]=j j.commit_sub(self) except: t,v,tb=sys.exc_info() # Ugh, we got an got an error during commit, so we # have to clean up. # First, we have to abort any uncommitted objects. for o in objects: try: j=getattr(o, '_p_jar', o) if j is not None: j.abort(o, self) except: pass # Then, we unwind TPC for the jars that began it. for j in jars.values(): try: j.tpc_abort(self) # This should never fail except: pass # Ugh, we need to abort work done in sub-transactions. while subjars: j=subjars.pop() j.abort_sub(self) # This should never fail raise t,v,tb for j in jars.values(): try: j.tpc_finish(self) # This should never fail except: # Bug if it does, we need to keep track of it and not allow # any more work without at least a restart! global hosed hosed=1 LOG('ZODB', PANIC, "An storage error occurred in the last phase of a " "two-phase commit. This shouldn\'t happen. " "The application may be in a hosed state, so " "we will not allow transactions to commit from " "here on", error=sys.exc_info()) if t is None: t,v,tb=sys.exc_info() if t is not None: raise t,v,tb finally: tb=None if subtransaction: del self._objects[:] # make sure it's empty (shouldn't need) elif self._id is not None: free_transaction() def register(self,object): 'Register the given object for transaction control.' self._append(object) def note(self, text): if self.description: self.description = "%s\n\n%s" % (self.description, strip(text)) else: self.description = strip(text) def setUser(self, user_name, path='/'): self.user="%s %s" % (path, user_name) def setExtendedInfo(self, name, value): ext=self._extension if ext is None: ext=self._extension={} ext[name]=value ############################################################################ # install get_transaction: try: import thread except: _t=Transaction(None) def get_transaction(_t=_t): return _t def free_transaction(_t=_t): _t.__init__() else: _t={} def get_transaction(_id=thread.get_ident, _t=_t): id=_id() try: t=_t[id] except KeyError: _t[id]=t=Transaction(id) return t def free_transaction(_id=thread.get_ident, _t=_t): id=_id() try: del _t[id] except KeyError: pass del thread del _t import __main__ __main__.__builtins__.get_transaction=get_transaction Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/ZApplication.py100644 1007 1403 13204 6761607221 22127 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Implement an bobo_application object that is BoboPOS3 aware This module provides a wrapper that causes a database connection to be created and used when bobo publishes a bobo_application object. """ __version__='$Revision: 1.7 $'[11:-2] StringType=type('') class ZApplicationWrapper: def __init__(self, db, name, klass= None, klass_args= (), version_cookie_name=None): self._stuff = db, name, version_cookie_name if klass is not None: conn=db.open() root=conn.root() if not root.has_key(name): root[name]=klass() get_transaction().commit() conn.close() self._klass=klass # This hack is to overcome a bug in Bobo! def __getattr__(self, name): return getattr(self._klass, name) def __bobo_traverse__(self, REQUEST=None, name=None): db, aname, version_support = self._stuff if version_support is not None and REQUEST is not None: version=REQUEST.get(version_support,'') else: version='' conn=db.open(version) # arrange for the connection to be closed when the request goes away cleanup=Cleanup() cleanup.__del__=conn.close REQUEST._hold(cleanup) conn.setDebugInfo(REQUEST.environ, REQUEST.other) v=conn.root()[aname] if name is not None: if hasattr(v, '__bobo_traverse__'): return v.__bobo_traverse__(REQUEST, name) if hasattr(v,name): return getattr(v,name) return v[name] return v def __call__(self, connection=None): db, aname, version_support = self._stuff if connection is None: connection=db.open() elif type(connection) is StringType: connection=db.open(connection) return connection.root()[aname] class Cleanup: pass Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/__init__.py100644 1007 1403 11344 6743106022 21265 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import sys, ExtensionClass, TimeStamp, cPersistence, Persistence import cStringIO, cPickle from zLOG import register_subsystem register_subsystem('ZODB') # This is lame. Don't look. :( sys.modules['cPersistence']=cPersistence Persistent=cPersistence.Persistent del cPersistence # Install Persistent and PersistentMapping in Persistence if not hasattr(Persistence, 'Persistent'): Persistence.Persistent=Persistent Persistent.__module__='Persistence' if not hasattr(Persistence, 'PersistentMapping'): import PersistentMapping sys.modules['PersistentMapping']=PersistentMapping sys.modules['BoboPOS']=sys.modules['ZODB'] sys.modules['BoboPOS.PersistentMapping']=PersistentMapping PersistentMapping=PersistentMapping.PersistentMapping from PersistentMapping import PersistentMapping Persistence.PersistentMapping=PersistentMapping PersistentMapping.__module__='Persistence' del PersistentMapping from DB import DB import Transaction del Transaction Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/bpthread.py100644 1007 1403 10030 6715664254 21325 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Thread abstraction module With this, we can run with or wothout threads. $Id: bpthread.py,v 1.2 1999/05/10 23:15:56 jim Exp $""" try: from thread import * except: class allocate_lock: def acquire(self, *args): return args and 1 or None def release(self): pass start_new_thread=apply Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/cPersistence.c100644 1007 1403 47417 6767510066 21776 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ static char *what_string = "$Id: cPersistence.c,v 1.33 1999/09/14 18:13:10 jim Exp $"; #include #include "cPersistence.h" #define ASSIGN(V,E) {PyObject *__e; __e=(E); Py_XDECREF(V); (V)=__e;} #define UNLESS(E) if(!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E) UNLESS(V) #define OBJECT(V) ((PyObject*)(V)) static PyObject *py_keys, *py_setstate, *py___dict__, *py_timeTime; static PyObject *py__p_changed, *py__p_deactivate; static PyObject *TimeStamp; #ifdef DEBUG_LOG static PyObject *debug_log=0; static int idebug_log=0; static void * call_debug(char *event, cPersistentObject *self) { PyObject *r; /* printf("%s %p\n",event,self->ob_type->tp_name); */ r=PyObject_CallFunction(debug_log,"s(sOi)",event, self->ob_type->tp_name, self->oid, self->state); Py_XDECREF(r); } #endif static void init_strings() { #define INIT_STRING(S) py_ ## S = PyString_FromString(#S) INIT_STRING(keys); INIT_STRING(setstate); INIT_STRING(timeTime); INIT_STRING(__dict__); INIT_STRING(_p_changed); INIT_STRING(_p_deactivate); #undef INIT_STRING } static PyObject * callmethod(PyObject *self, PyObject *name) { if(self=PyObject_GetAttr(self,name)) ASSIGN(self,PyObject_CallObject(self,NULL)); return self; } static PyObject * callmethod1(PyObject *self, PyObject *name, PyObject *arg) { if((self=PyObject_GetAttr(self,name)) && (name=PyTuple_New(1))) { PyTuple_SET_ITEM(name, 0, arg); ASSIGN(self,PyObject_CallObject(self,name)); PyTuple_SET_ITEM(name, 0, NULL); Py_DECREF(name); } return self; } static PyObject * callmethod2(PyObject *self, PyObject *name, PyObject *arg, PyObject *arg2) { if((self=PyObject_GetAttr(self,name)) && (name=PyTuple_New(2))) { PyTuple_SET_ITEM(name, 0, arg); PyTuple_SET_ITEM(name, 1, arg2); ASSIGN(self,PyObject_CallObject(self,name)); PyTuple_SET_ITEM(name, 0, NULL); PyTuple_SET_ITEM(name, 1, NULL); Py_DECREF(name); } return self; } static PyObject * callmethod3(PyObject *self, PyObject *name, PyObject *arg, PyObject *arg2, PyObject *arg3) { if((self=PyObject_GetAttr(self,name)) && (name=PyTuple_New(3))) { PyTuple_SET_ITEM(name, 0, arg); PyTuple_SET_ITEM(name, 1, arg2); PyTuple_SET_ITEM(name, 2, arg3); ASSIGN(self,PyObject_CallObject(self,name)); PyTuple_SET_ITEM(name, 0, NULL); PyTuple_SET_ITEM(name, 1, NULL); PyTuple_SET_ITEM(name, 2, NULL); Py_DECREF(name); } return self; } #define UPDATE_STATE_IF_NECESSARY(self, ER) \ if(self->state < 0 && self->jar) \ { \ PyObject *r; \ \ self->state=cPersistent_STICKY_STATE; \ UNLESS(r=callmethod1(self->jar,py_setstate,(PyObject*)self)) \ { \ self->state=cPersistent_GHOST_STATE; \ return ER; \ } \ self->state=cPersistent_UPTODATE_STATE; \ Py_DECREF(r); \ } static PyObject * #ifdef HAVE_STDARG_PROTOTYPES /* VARARGS 2 */ PyString_BuildFormat(char *stringformat, char *format, ...) #else /* VARARGS */ PyString_BuildFormat(va_alist) va_dcl #endif { va_list va; PyObject *args=0, *retval=0, *v=0; #ifdef HAVE_STDARG_PROTOTYPES va_start(va, format); #else PyObject *ErrType; char *stringformat, *format; va_start(va); ErrType = va_arg(va, PyObject *); stringformat = va_arg(va, char *); format = va_arg(va, char *); #endif args = Py_VaBuildValue(format, va); va_end(va); if(! args) return NULL; if(!(retval=PyString_FromString(stringformat))) return NULL; v=PyString_Format(retval, args); Py_DECREF(retval); Py_DECREF(args); return v; } /****************************************************************************/ staticforward PyExtensionClass Pertype; staticforward PyExtensionClass TPertype; static int changed(cPersistentObject *self) { static PyObject *builtins=0, *get_transaction=0, *py_register=0; PyObject *T; if ((self->state == cPersistent_UPTODATE_STATE || self->state == cPersistent_STICKY_STATE) && self->jar) { UNLESS (get_transaction) { UNLESS (py_register=PyString_FromString("register")) return -1; UNLESS (T=PyImport_ImportModule("__main__")) return -1; ASSIGN(T,PyObject_GetAttrString(T,"__builtins__")); UNLESS (T) return -1; builtins=T; UNLESS (get_transaction=PyObject_GetAttrString(builtins, "get_transaction")) PyErr_Clear(); } if (get_transaction) { UNLESS (T=PyObject_CallObject(get_transaction,NULL)) return -1; ASSIGN(T,PyObject_GetAttr(T,py_register)); UNLESS (T) return -1; ASSIGN(T, PyObject_CallFunction(T,"O",self)); if (T) Py_DECREF(T); else return -1; } self->state=cPersistent_CHANGED_STATE; } return 0; } static PyObject * Per___changed__(cPersistentObject *self, PyObject *args) { PyObject *v=0; if (args && ! PyArg_ParseTuple(args, "|O",&v)) return NULL; if (! v) return PyObject_GetAttr(OBJECT(self), py__p_changed); if (PyObject_IsTrue(v)) { if (changed(self) < 0) return NULL; } else if (self->state >= 0) self->state=cPersistent_UPTODATE_STATE; Py_INCREF(Py_None); return Py_None; } static PyObject * Per__p_deactivate(cPersistentObject *self, PyObject *args) { PyObject *init=0, *dict; #ifdef DEBUG_LOG if (idebug_log < 0) call_debug("reinit",self); #endif if (args && ! PyArg_ParseTuple(args,"")) return NULL; if (self->state==cPersistent_UPTODATE_STATE && self->jar && HasInstDict(self) && (dict=INSTANCE_DICT(self))) { PyDict_Clear(dict); /* Note that we need to set to ghost state unless we are called directly. Methods that override this need to do the same! */ self->state=cPersistent_GHOST_STATE; } Py_INCREF(Py_None); return Py_None; } /* Load the object's state if necessary and become sticky */ static int Per_setstate(cPersistentObject *self) { UPDATE_STATE_IF_NECESSARY(self, -1); self->state=cPersistent_STICKY_STATE; return 0; } static PyObject * Per__getstate__(self,args) cPersistentObject *self; PyObject *args; { PyObject *__dict__, *d=0; UNLESS(PyArg_ParseTuple(args, "")) return NULL; #ifdef DEBUG_LOG if(idebug_log < 0) call_debug("get",self); #endif UPDATE_STATE_IF_NECESSARY(self, NULL); if(HasInstDict(self) && (__dict__=INSTANCE_DICT(self))) { PyObject *k, *v; int pos; char *ck; for(pos=0; PyDict_Next(__dict__, &pos, &k, &v); ) { if(PyString_Check(k) && (ck=PyString_AsString(k)) && (*ck=='_' && ck[1]=='v' && ck[2]=='_')) { UNLESS(d=PyDict_New()) goto err; for(pos=0; PyDict_Next(__dict__, &pos, &k, &v); ) UNLESS(PyString_Check(k) && (ck=PyString_AsString(k)) && (*ck=='_' && ck[1]=='v' && ck[2]=='_')) if(PyDict_SetItem(d,k,v) < 0) goto err; return d; } } } else __dict__=Py_None; Py_INCREF(__dict__); return __dict__; err: Py_DECREF(__dict__); Py_XDECREF(d); } static PyObject * Per__setstate__(self,args) cPersistentObject *self; PyObject *args; { PyObject *__dict__, *v, *keys=0, *key=0, *e=0; int l, i; if(HasInstDict(self)) { UNLESS(PyArg_ParseTuple(args, "O", &v)) return NULL; #ifdef DEBUG_LOG if(idebug_log < 0) call_debug("set",self); #endif if(v!=Py_None) { __dict__=INSTANCE_DICT(self); if(PyDict_Check(v)) { for(i=0; PyDict_Next(v,&i,&key,&e);) if(PyObject_SetItem(__dict__,key,e) < 0) return NULL; } else { UNLESS(keys=callmethod(v,py_keys)) goto err; UNLESS(-1 != (l=PyObject_Length(keys))) goto err; for(i=0; i < l; i++) { UNLESS_ASSIGN(key,PySequence_GetItem(keys,i)) goto err; UNLESS_ASSIGN(e,PyObject_GetItem(v,key)) goto err; UNLESS(-1 != PyObject_SetItem(__dict__,key,e)) goto err; } Py_XDECREF(key); Py_XDECREF(e); Py_DECREF(keys); } } } Py_INCREF(Py_None); return Py_None; err: Py_XDECREF(key); Py_XDECREF(e); Py_XDECREF(keys); return NULL; } static struct PyMethodDef Per_methods[] = { {"__changed__", (PyCFunction)Per___changed__, METH_VARARGS, "DEPRECATED: use self._p_changed=1"}, {"_p_deactivate", (PyCFunction)Per__p_deactivate, METH_VARARGS, "_p_deactivate(oid) -- Deactivate the object"}, {"__getstate__", (PyCFunction)Per__getstate__, METH_VARARGS, "__getstate__() -- Return the state of the object" }, {"__setstate__", (PyCFunction)Per__setstate__, METH_VARARGS, "__setstate__(v) -- Restore the saved state of the object from v" }, {NULL, NULL} /* sentinel */ }; /* ---------- */ static void Per_dealloc(self) cPersistentObject *self; { #ifdef DEBUG_LOG if(idebug_log < 0) call_debug("del",self); #endif Py_XDECREF(self->jar); Py_XDECREF(self->oid); Py_DECREF(self->ob_type); PyMem_DEL(self); } static PyObject * orNothing(PyObject *v) { if (! v) v=Py_None; Py_INCREF(v); return v; } static PyObject * Per_getattr(cPersistentObject *self, PyObject *oname, char *name, PyObject *(*getattrf)(PyObject *, PyObject*)) { char *n=name; if(n && *n++=='_') if(*n++=='p' && *n++=='_') { switch(*n++) { case 'o': if(*n++=='i' && *n++=='d' && ! *n) return orNothing(self->oid); break; case 'j': if(*n++=='a' && *n++=='r' && ! *n) return orNothing(self->jar); break; case 'c': if(strcmp(n,"hanged")==0) { if(self->state < 0) { Py_INCREF(Py_None); return Py_None; } return PyInt_FromLong(self->state == cPersistent_CHANGED_STATE); } break; case 's': if(strcmp(n,"erial")==0) return PyString_FromStringAndSize(self->serial, 8); if(strcmp(n,"elf")==0) return orNothing(OBJECT(self)); break; case 'm': if(strcmp(n,"time")==0) { UPDATE_STATE_IF_NECESSARY(self, NULL); self->atime=((long)(time(NULL)/3))%65536; if (self->serial[7]=='\0' && self->serial[6]=='\0' && self->serial[5]=='\0' && self->serial[4]=='\0' && self->serial[3]=='\0' && self->serial[2]=='\0' && self->serial[1]=='\0' && self->serial[0]=='\0') { Py_INCREF(Py_None); return Py_None; } oname=PyString_FromStringAndSize(self->serial, 8); if (! oname) return oname; ASSIGN(oname, PyObject_CallFunction(TimeStamp, "O", oname)); if (! oname) return oname; ASSIGN(oname, PyObject_GetAttr(oname, py_timeTime)); if (! oname) return oname; ASSIGN(oname, PyObject_CallObject(oname, NULL)); return oname; } break; } return getattrf((PyObject *)self, oname); } if(! (name && *name++=='_' && *name++=='_' && (strcmp(name,"dict__")==0 || strcmp(name,"class__")==0 || strcmp(name, "of__")==0))) { UPDATE_STATE_IF_NECESSARY(self, NULL); self->atime=((long)(time(NULL)/3))%65536; } return getattrf((PyObject *)self, oname); } static PyObject* Per_getattro(cPersistentObject *self, PyObject *name) { char *s=NULL; if (PyString_Check(name)) UNLESS(s=PyString_AsString(name)) return NULL; return Per_getattr(self, name, s, PyExtensionClassCAPI->getattro); } static int bad_delattr() { PyErr_SetString(PyExc_AttributeError, "delete undeletable attribute"); return -1; } static int _setattro(cPersistentObject *self, PyObject *oname, PyObject *v, int (*setattrf)(PyObject *, PyObject*, PyObject*)) { char *name=""; UNLESS(oname) return -1; if(PyString_Check(oname)) UNLESS(name=PyString_AsString(oname)) return -1; if(*name=='_' && name[1]=='p' && name[2]=='_') { if(name[3]=='o' && name[4]=='i' && name[5]=='d' && ! name[6]) { Py_XINCREF(v); ASSIGN(self->oid, v); return 0; } if(name[3]=='j' && name[4]=='a' && name[5]=='r' && ! name[6]) { Py_XINCREF(v); ASSIGN(self->jar, v); return 0; } if(name[3]=='s' && strcmp(name+4,"erial")==0) { if (v) { if (PyString_Check(v) && PyString_Size(v)==8) memcpy(self->serial, PyString_AS_STRING(v), 8); else { PyErr_SetString(PyExc_ValueError, "_p_serial must be an 8-character string"); return -1; } } else memset(self->serial, 0, 8); return 0; } if(name[3]=='c' && strcmp(name+4,"hanged")==0) { if (! v) { /* delatter is used to invalidate the object *even* if it has changed. */ if (self->state != cPersistent_GHOST_STATE) self->state = cPersistent_UPTODATE_STATE; v=Py_None; } if (v==Py_None) { v=PyObject_GetAttr(OBJECT(self), py__p_deactivate); if (v) ASSIGN(v, PyObject_CallObject(v, NULL)); if (v) Py_DECREF(v); self->state=cPersistent_GHOST_STATE; return 0; } if (PyObject_IsTrue(v)) return changed(self); if (self->state >= 0) self->state=cPersistent_UPTODATE_STATE; return 0; } } else { UPDATE_STATE_IF_NECESSARY(self, -1); /* Record access times */ self->atime=((long)(time(NULL)/3))%65536; if(! (*name=='_' && name[1]=='v' && name[2]=='_') && self->state != cPersistent_CHANGED_STATE && self->jar) if(changed(self) < 0) return -1; } return setattrf((PyObject*)self,oname,v); } static int Per_setattro(cPersistentObject *self, PyObject *oname, PyObject *v) { return _setattro(self,oname, v, PyExtensionClassCAPI->setattro); } static PyExtensionClass Pertype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "Persistent", /*tp_name*/ sizeof(cPersistentObject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)Per_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*tp_getattr*/ (setattrfunc)0, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)Per_getattro, /*tp_getattr with object key*/ (setattrofunc)Per_setattro, /*tp_setattr with object key*/ /* Space for future expansion */ 0L,0L,"", METHOD_CHAIN(Per_methods), EXTENSIONCLASS_BASICNEW_FLAG | PERSISTENT_TYPE_FLAG, }; /* End of code for Persistent objects */ /* -------------------------------------------------------- */ /* List of methods defined in the module */ #ifdef DEBUG_LOG static PyObject * set_debug_log(PyObject *ignored, PyObject *args) { Py_INCREF(args); ASSIGN(debug_log, args); if(debug_log) idebug_log=-1; else idebug_log=0; Py_INCREF(Py_None); return Py_None; } #endif static struct PyMethodDef cP_methods[] = { #ifdef DEBUG_LOG {"set_debug_log", (PyCFunction)set_debug_log, METH_VARARGS, "set_debug_log(callable) -- Provide a function to log events\n" "\n" "The function will be called with an event name and a persistent object.\n" }, #endif {NULL, NULL} /* sentinel */ }; /* Initialization function for the module (*must* be called initcPersistence) */ typedef int (*intfunctionwithpythonarg)(PyObject*); static cPersistenceCAPIstruct truecPersistenceCAPI = { &(Pertype.methods), (getattrofunc)Per_getattro, /*tp_getattr with object key*/ (setattrofunc)Per_setattro, /*tp_setattr with object key*/ changed, (intfunctionwithpythonarg)Per_setstate, (pergetattr)Per_getattr, (persetattr)_setattro, }; void initcPersistence() { PyObject *m, *d; char *rev="$Revision: 1.33 $"; TimeStamp=PyString_FromString("TimeStamp"); if (! TimeStamp) return; ASSIGN(TimeStamp, PyImport_Import(TimeStamp)); if (! TimeStamp) return; ASSIGN(TimeStamp, PyObject_GetAttrString(TimeStamp, "TimeStamp")); if (! TimeStamp) return; m = Py_InitModule4("cPersistence", cP_methods, "", (PyObject*)NULL,PYTHON_API_VERSION); init_strings(); d = PyModule_GetDict(m); PyDict_SetItemString(d,"__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); PyExtensionClass_Export(d,"Persistent",Pertype); cPersistenceCAPI=&truecPersistenceCAPI; PyDict_SetItemString(d, "CAPI", PyCObject_FromVoidPtr(cPersistenceCAPI,NULL)); if (PyErr_Occurred()) Py_FatalError("can't initialize module cDocumentTemplate"); } Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/cPersistence.h100644 1007 1403 12432 6770174140 21761 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ #ifndef CPERSISTENCE_H #define CPERSISTENCE_H #include "ExtensionClass.h" #include #define cPersistent_HEAD PyObject_HEAD PyObject *jar, *oid; char serial[8]; unsigned short atime; signed char state; unsigned char reserved; #define cPersistent_GHOST_STATE -1 #define cPersistent_UPTODATE_STATE 0 #define cPersistent_CHANGED_STATE 1 #define cPersistent_STICKY_STATE 2 typedef struct { cPersistent_HEAD } cPersistentObject; typedef int (*persetattr)(PyObject *, PyObject*, PyObject *, setattrofunc); typedef PyObject *(*pergetattr)(PyObject *, PyObject*, char *, getattrofunc); typedef struct { PyMethodChain *methods; getattrofunc getattro; setattrofunc setattro; int (*changed)(cPersistentObject*); int (*setstate)(PyObject*); pergetattr pergetattro; persetattr persetattro; } cPersistenceCAPIstruct; static cPersistenceCAPIstruct *cPersistenceCAPI; #define cPersistanceModuleName "cPersistence" #define PERSISTENT_TYPE_FLAG EXTENSIONCLASS_USER_FLAG8 #define PER_USE_OR_RETURN(O,R) {if((O)->state==cPersistent_GHOST_STATE && cPersistenceCAPI->setstate((PyObject*)(O)) < 0) return (R); else if ((O)->state==cPersistent_UPTODATE_STATE) (O)->state=cPersistent_STICKY_STATE;} #define PER_CHANGED(O) (cPersistenceCAPI->changed((cPersistentObject*)(O))) #define PER_ALLOW_DEACTIVATION(O) ((O)->state==cPersistent_STICKY_STATE && ((O)->state=cPersistent_UPTODATE_STATE)) #define PER_PREVENT_DEACTIVATION(O) ((O)->state==cPersistent_UPTODATE_STATE && ((O)->state=cPersistent_STICKY_STATE)) #define PER_DEL(O) Py_XDECREF((O)->jar); Py_XDECREF((O)->oid); #endif Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/cPickleCache.c100644 1007 1403 42723 6745144426 21637 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ static char *what_string = "$Id: cPickleCache.c,v 1.28 1999/07/20 19:08:06 jim Exp $"; #define ASSIGN(V,E) {PyObject *__e; __e=(E); Py_XDECREF(V); (V)=__e;} #define UNLESS(E) if(!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E) UNLESS(V) #define OBJECT(O) ((PyObject*)O) #include "cPersistence.h" #include #undef Py_FindMethod static PyObject *py_reload, *py__p_jar, *py__p_changed; typedef struct { PyObject_HEAD PyObject *data; PyObject *jar; PyObject *setklassstate; int position; int cache_size; int cache_age; /* Cache statistics */ int sum_deal; int sum_deac; double sum_age; int n, na; time_t last_check; /* Time of last gc */ double mean_age; double mean_deal; double mean_deac; double df, dfa; /* Degees of freedom for above stats */ } ccobject; #define WEIGHTING_PERIOD 600 /* How to compute weighted means? Assume we have two means, a current mean, M, and a mean as of some time d seconds in the past, Md. The means have effective degrees of freedom, N, and Nd. Where Nd is adjusted by d is some fashion. The combined mean is (M*N+Md*Nd)/(N+Nd). The degrees of freedom of the combined mean, Nc, is N+Nd. Nd is computed by weighting an old degree of freedom with the weight: I/(I+d), where I is some suitably chosen constant, which we will call a "weighting period". */ staticforward PyTypeObject Cctype; /* ---------------------------------------------------------------- */ static int gc_item(ccobject *self, PyObject *key, PyObject *v, long now, int dt) { if (v && key) { self->n++; if(v->ob_refcnt <= 1) { self->sum_deal++; return PyDict_DelItem(self->data, key); } if (dt && (! PyExtensionClass_Check(v)) && ((cPersistentObject*)v)->jar==self->jar /* I'm paranoid */ && ((cPersistentObject*)v)->state==cPersistent_UPTODATE_STATE ) { now -= ((cPersistentObject*)v)->atime; if (now < 0) now += 65536; self->na++; self->sum_age += now; if (now > dt) { /* We have a cPersistent object that hasn't been used in a while. Reinitialize it, hopefully freeing it's state. */ self->sum_deac++; if (PyObject_SetAttr(v,py__p_changed,Py_None) < 0) PyErr_Clear(); } } } return 0; } static void update_stats(ccobject *self, time_t now) { double d, deal, deac; d=now-self->last_check; if(d < 1) return; self->df *= WEIGHTING_PERIOD/(WEIGHTING_PERIOD+d); self->dfa *= WEIGHTING_PERIOD/(WEIGHTING_PERIOD+d); self->mean_age=((self->mean_age*self->dfa+self->sum_age)/ (self->dfa+self->na))*3; self->sum_age=0; deac=self->sum_deac/d; self->sum_deac=0; self->mean_deac=((self->mean_deac*self->dfa+deac)/ (self->dfa+self->na)); self->sum_deac=0; self->dfa += self->na; self->na=0; deal=self->sum_deal/d; self->sum_deal=0; self->mean_deal=((self->mean_deal*self->df +deal)/ (self->df +self->n)); self->sum_deal=0; self->df += self->n; self->n=0; self->last_check=now; } static int fullgc(ccobject *self, int idt) { PyObject *key, *v; int i, dt; long now; if (self->cache_size < 1) return 0; if ((i=PyDict_Size(self->data)) < 1) return 0; now=((long)(time(NULL)/3))%65536; if (idt) dt=idt*3; else { i=PyDict_Size(self->data)-3/self->cache_size; if(i < 3) i=3; dt=self->cache_age*3/i; if(dt < 10) dt=10; } for(i=0; PyDict_Next(self->data, &i, &key, &v); ) if(gc_item(self,key,v,now,dt) < 0) return -1; self->position=0; if(now-self->last_check > 1) update_stats(self, now); return 0; } static int reallyfullgc(ccobject *self, int dt) { PyObject *key, *v; int i, l, last; time_t now; if((last=PyDict_Size(self->data)) < 0) return -1; now=time(NULL); /* First time through should get refcounts to 1 */ for(i=0; PyDict_Next(self->data, &i, &key, &v); ) if(gc_item(self,key,v,now,dt) < 0) return -1; if((l=PyDict_Size(self->data)) < 0) return -1; while(l < last) { for(i=0; PyDict_Next(self->data, &i, &key, &v); ) if(gc_item(self,key,v,now,dt) < 0) return -1; last=l; if((l=PyDict_Size(self->data)) < 0) return -1; } if(now-self->last_check > 1) update_stats(self, now); self->position=0; return 0; } static int maybegc(ccobject *self, PyObject *thisv) { int n, s, size, dt; long now; PyObject *key=0, *v=0; if (self->cache_size < 1) return 0; s=PyDict_Size(self->data); if (s < 1) return s; now=((long)(time(NULL)/3))%65536; size=self->cache_size; self->cache_size=0; n=(s-size)/10; if (n < 3) n=3; s=8*size/s; if (s > 100) s=100; dt=(long)(self->cache_age*(0.2+0.1*s)); if (dt < 10) dt=10; while (--n >= 0) { if (PyDict_Next(self->data, &(self->position), &key, &v)) { if (v != thisv && gc_item(self,key,v,now,dt) < 0) { self->cache_size=size; return -1; } } else self->position=0; } self->cache_size=size; if (now-self->last_check > 1) update_stats(self, now); return 0; } static PyObject * cc_full_sweep(ccobject *self, PyObject *args) { int dt=0; UNLESS(PyArg_ParseTuple(args, "|i", &dt)) return NULL; UNLESS(-1 != fullgc(self,dt)) return NULL; Py_INCREF(Py_None); return Py_None; } static PyObject * cc_reallyfull_sweep(ccobject *self, PyObject *args) { int dt=0; UNLESS(PyArg_ParseTuple(args, "|i", &dt)) return NULL; UNLESS(-1 != reallyfullgc(self,dt)) return NULL; Py_INCREF(Py_None); return Py_None; } static PyObject * cc_incrgc(ccobject *self, PyObject *args) { if(maybegc(self,NULL) < 0) return NULL; Py_INCREF(Py_None); return Py_None; } static void _invalidate(ccobject *self, PyObject *key) { PyObject *v; if ((v=PyDict_GetItem(self->data, key))) { if (PyExtensionClass_Check(v)) if(v->ob_refcnt <= 1) { self->sum_deal++; if (PyDict_DelItem(self->data, key) < 0) PyErr_Clear(); } else { v=PyObject_CallFunction(self->setklassstate, "O", v); if (v) Py_DECREF(v); else PyErr_Clear(); } else if (PyObject_DelAttr(v,py__p_changed) < 0) PyErr_Clear(); } else PyErr_Clear(); } static PyObject * cc_invalidate(ccobject *self, PyObject *args) { PyObject *inv, *key, *v; int i; if (PyArg_ParseTuple(args, "O!", &PyDict_Type, &inv)) { for (i=0; PyDict_Next(inv, &i, &key, &v); ) if (key==Py_None) { /* Eek some nitwit invalidated everything! */ for (i=0; PyDict_Next(self->data, &i, &key, &v); ) _invalidate(self, key); break; } else _invalidate(self, key); PyDict_Clear(inv); } else { PyErr_Clear(); UNLESS (PyArg_ParseTuple(args, "O", &inv)) return NULL; if (PyString_Check(inv)) _invalidate(self, inv); else if (inv==Py_None) /* All */ for (i=0; PyDict_Next(self->data, &i, &key, &v); ) _invalidate(self, key); else { int l; PyErr_Clear(); if ((l=PyObject_Length(inv)) < 0) return NULL; for(i=l; --i >= 0; ) { UNLESS (key=PySequence_GetItem(inv, i)) return NULL; _invalidate(self, key); Py_DECREF(key); } PySequence_DelSlice(inv, 0, l); } } Py_INCREF(Py_None); return Py_None; } static PyObject * cc_get(ccobject *self, PyObject *args) { PyObject *r, *key, *d=0; UNLESS (PyArg_ParseTuple(args,"O|O", &key, &d)) return NULL; UNLESS (r=PyDict_GetItem(self->data, key)) { if (d) { PyErr_Clear(); r=d; } else { PyErr_SetObject(PyExc_KeyError, key); return NULL; } } if (maybegc(self,r) < 0) return NULL; Py_INCREF(r); return r; } static struct PyMethodDef cc_methods[] = { {"full_sweep", (PyCFunction)cc_full_sweep, METH_VARARGS, "full_sweep([age]) -- Perform a full sweep of the cache\n\n" "Make a single pass through the cache, removing any objects that are no\n" "longer referenced, and deactivating objects that have not been\n" "accessed in the number of seconds given by 'age'. " "'age defaults to the cache age.\n" }, {"minimize", (PyCFunction)cc_reallyfull_sweep, METH_VARARGS, "minimize([age]) -- Remove as many objects as possible\n\n" "Make multiple passes through the cache, removing any objects that are no\n" "longer referenced, and deactivating objects that have not been\n" "accessed in the number of seconds given by 'age'. 'age defaults to 0.\n" }, {"incrgc", (PyCFunction)cc_incrgc, METH_VARARGS, "incrgc() -- Perform incremental garbage collection"}, {"invalidate", (PyCFunction)cc_invalidate, METH_VARARGS, "invalidate(oids) -- invalidate one, many, or all ids"}, {"get", (PyCFunction)cc_get, METH_VARARGS, "get(key [, default]) -- get an item, or a default"}, {NULL, NULL} /* sentinel */ }; static ccobject * newccobject(PyObject *jar, int cache_size, int cache_age) { ccobject *self; UNLESS(self = PyObject_NEW(ccobject, &Cctype)) return NULL; self->setklassstate=self->jar=NULL; if(self->data=PyDict_New()) { self->jar=jar; Py_INCREF(jar); UNLESS (self->setklassstate=PyObject_GetAttrString(jar, "setklassstate")) return NULL; self->position=0; self->cache_size=cache_size; self->cache_age=cache_age < 1 ? 1 : cache_age; self->sum_deal=0; self->sum_deac=0; self->sum_age=0; self->mean_deal=0; self->mean_deac=0; self->mean_age=0; self->df=1; self->dfa=1; self->n=0; self->na=0; self->last_check=time(NULL); return self; } Py_DECREF(self); return NULL; } static void cc_dealloc(ccobject *self) { Py_XDECREF(self->data); Py_XDECREF(self->jar); Py_XDECREF(self->setklassstate); PyMem_DEL(self); } static PyObject * cc_getattr(ccobject *self, char *name) { PyObject *r; if(*name=='c') { if(strcmp(name,"cache_age")==0) return PyInt_FromLong(self->cache_age); if(strcmp(name,"cache_size")==0) return PyInt_FromLong(self->cache_size); if(strcmp(name,"cache_mean_age")==0) return PyFloat_FromDouble(self->mean_age); if(strcmp(name,"cache_mean_deal")==0) return PyFloat_FromDouble(self->mean_deal); if(strcmp(name,"cache_mean_deac")==0) return PyFloat_FromDouble(self->mean_deac); if(strcmp(name,"cache_df")==0) return PyFloat_FromDouble(self->df); if(strcmp(name,"cache_dfa")==0) return PyFloat_FromDouble(self->dfa); if(strcmp(name,"cache_last_gc_time")==0) return PyFloat_FromDouble(self->last_check); if(strcmp(name,"cache_data")==0) { Py_INCREF(self->data); return self->data; } } if( *name=='h' && strcmp(name, "has_key")==0 || *name=='i' && strcmp(name, "items")==0 || *name=='k' && strcmp(name, "keys")==0 ) return PyObject_GetAttrString(self->data, name); if(r=Py_FindMethod(cc_methods, (PyObject *)self, name)) return r; PyErr_Clear(); return PyObject_GetAttrString(self->data, name); } static int cc_setattr(ccobject *self, char *name, PyObject *value) { if(value) { int v; if(strcmp(name,"cache_age")==0) { UNLESS(PyArg_Parse(value,"i",&v)) return -1; if(v > 0)self->cache_age=v; return 0; } if(strcmp(name,"cache_size")==0) { UNLESS(PyArg_Parse(value,"i",&v)) return -1; self->cache_size=v; return 0; } } PyErr_SetString(PyExc_AttributeError, name); return -1; } static int cc_length(ccobject *self) { return PyObject_Length(self->data); } static PyObject * cc_subscript(ccobject *self, PyObject *key) { PyObject *r; UNLESS (r=PyDict_GetItem(self->data, key)) { PyErr_SetObject(PyExc_KeyError, key); return NULL; } if (maybegc(self,r) < 0) return NULL; Py_INCREF(r); return r; } static int cc_ass_sub(ccobject *self, PyObject *key, PyObject *v) { if(v) { if (PyExtensionClass_Check(v) || (PyExtensionInstance_Check(v) && (((PyExtensionClass*)(v->ob_type))->class_flags & PERSISTENT_TYPE_FLAG) && (v->ob_type->tp_basicsize >= sizeof(cPersistentObject)) ) ) return PyDict_SetItem(self->data, key, v); PyErr_SetString(PyExc_ValueError, "Cache values must be persistent objects or classes."); return -1; } return PyDict_DelItem(self->data, key); } static PyMappingMethods cc_as_mapping = { (inquiry)cc_length, /*mp_length*/ (binaryfunc)cc_subscript, /*mp_subscript*/ (objobjargproc)cc_ass_sub, /*mp_ass_subscript*/ }; static PyTypeObject Cctype = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "cPickleCache", /*tp_name*/ sizeof(ccobject), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)cc_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)cc_getattr, /*tp_getattr*/ (setattrfunc)cc_setattr, /*tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ &cc_as_mapping, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)0, /*tp_call*/ (reprfunc)0, /*tp_str*/ /* Space for future expansion */ 0L,0L,0L,0L, "" }; static PyObject * cCM_new(PyObject *self, PyObject *args) { int cache_size=100, cache_age=1000; PyObject *jar; UNLESS(PyArg_ParseTuple(args, "O|ii", &jar, &cache_size, &cache_age)) return NULL; return (PyObject*)newccobject(jar, cache_size,cache_age); } static struct PyMethodDef cCM_methods[] = { {"PickleCache",(PyCFunction)cCM_new, METH_VARARGS, ""}, {NULL, NULL} /* sentinel */ }; void initcPickleCache() { PyObject *m, *d; char *rev="$Revision: 1.28 $"; Cctype.ob_type=&PyType_Type; UNLESS(ExtensionClassImported) return; m = Py_InitModule4("cPickleCache", cCM_methods, "", (PyObject*)NULL,PYTHON_API_VERSION); d = PyModule_GetDict(m); py_reload=PyString_FromString("reload"); py__p_jar=PyString_FromString("_p_jar"); py__p_changed=PyString_FromString("_p_changed"); PyDict_SetItemString(d,"__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); if (PyErr_Occurred()) Py_FatalError("can't initialize module cCache"); } Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/conversionhack.py100644 1007 1403 10142 6732542442 22545 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import PersistentMapping class fixer: def __of__(self, parent): def __setstate__(state, self=parent): self._container=state del self.__setstate__ return __setstate__ fixer=fixer() class hack: pass hack=hack() def __basicnew__(): r=PersistentMapping.PersistentMapping() r.__setstate__=fixer return r hack.__basicnew__=__basicnew__ Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/coptimizations.c100644 1007 1403 22553 6767565020 22415 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ #include "Python.h" #include "cPersistence.h" static void PyVar_Assign(PyObject **v, PyObject *e) { Py_XDECREF(*v); *v=e;} #define ASSIGN(V,E) PyVar_Assign(&(V),(E)) #define UNLESS(E) if(!(E)) #define UNLESS_ASSIGN(V,E) ASSIGN(V,E); UNLESS(V) #define OBJECT(O) ((PyObject*)(O)) static PyObject *py__p_oid, *py__p_jar, *py___getinitargs__, *py___module__; static PyObject *py_new_oid; typedef struct { PyObject_HEAD PyObject *jar, *stackup, *new_oid; } persistent_id; staticforward PyTypeObject persistent_idType; static persistent_id * newpersistent_id(PyObject *ignored, PyObject *args) { persistent_id *self; PyObject *jar, *stackup; UNLESS (PyArg_ParseTuple(args, "OO", &jar, &stackup)) return NULL; UNLESS(self = PyObject_NEW(persistent_id, &persistent_idType)) return NULL; Py_INCREF(jar); self->jar=jar; Py_INCREF(stackup); self->stackup=stackup; self->new_oid=NULL; return self; } static void persistent_id_dealloc(persistent_id *self) { Py_DECREF(self->jar); Py_DECREF(self->stackup); Py_XDECREF(self->new_oid); PyMem_DEL(self); } static PyObject * persistent_id_call(persistent_id *self, PyObject *args, PyObject *kwargs) { PyObject *object, *oid, *jar=NULL, *r=NULL, *klass; /* def persistent_id(object, self=self,stackup=stackup): */ UNLESS (PyArg_ParseTuple(args, "O", &object)) return NULL; /* if (not hasattr(object, '_p_oid') or type(object) is ClassType): return None */ /* Filter out most objects with low-level test. Yee ha! */ UNLESS (PyExtensionClass_Check(object) || (PyExtensionInstance_Check(object) && (((PyExtensionClass*)(object->ob_type))->class_flags & PERSISTENT_TYPE_FLAG) ) ) goto not_persistent; UNLESS (oid=PyObject_GetAttr(object, py__p_oid)) { PyErr_Clear(); goto not_persistent; } /* if oid is None or object._p_jar is not self: */ if (oid != Py_None) UNLESS (jar=PyObject_GetAttr(object, py__p_jar)) PyErr_Clear(); if (oid == Py_None || jar != self->jar) { /* oid = self.new_oid() object._p_jar=self object._p_oid=oid stackup(object) */ UNLESS (self->new_oid || (self->new_oid=PyObject_GetAttr(self->jar, py_new_oid))) goto err; ASSIGN(oid, PyObject_CallObject(self->new_oid, NULL)); UNLESS (oid) goto err; if (PyObject_SetAttr(object, py__p_jar, self->jar) < 0) goto err; if (PyObject_SetAttr(object, py__p_oid, oid) < 0) goto err; UNLESS (r=PyTuple_New(1)) goto err; PyTuple_SET_ITEM(r, 0, object); Py_INCREF(object); ASSIGN(r, PyObject_CallObject(self->stackup, r)); UNLESS (r) goto err; Py_DECREF(r); } Py_XDECREF(jar); /* klass=object.__class__ if klass is ExtensionKlass: return oid */ if (PyExtensionClass_Check(object)) return oid; /* if hasattr(klass, '__getinitargs__'): return oid */ klass=OBJECT(object->ob_type); if ((r=PyObject_GetAttr(klass, py___getinitargs__))) { Py_DECREF(r); return oid; } PyErr_Clear(); /* module=getattr(klass,'__module__','') if module: klass=module, klass.__name__ */ if ((jar=PyObject_GetAttr(klass, py___module__))) { UNLESS (r=PyTuple_New(2)) goto err; PyTuple_SET_ITEM(r, 0, jar); Py_INCREF(klass); PyTuple_SET_ITEM(r, 1, klass); klass=r; } else { PyErr_Clear(); Py_INCREF(klass); } /* return oid, klass */ if ((r=PyTuple_New(2))) { PyTuple_SET_ITEM(r, 0, oid); PyTuple_SET_ITEM(r, 1, klass); } else { Py_DECREF(oid); Py_DECREF(klass); } return r; not_persistent: Py_INCREF(Py_None); return Py_None; err: Py_DECREF(oid); Py_XDECREF(jar); return NULL; } static PyTypeObject persistent_idType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "persistent_id", /*tp_name*/ sizeof(persistent_id), /*tp_basicsize*/ 0, /*tp_itemsize*/ /* methods */ (destructor)persistent_id_dealloc, /*tp_dealloc*/ (printfunc)0, /*tp_print*/ (getattrfunc)0, /*obsolete tp_getattr*/ (setattrfunc)0, /*obsolete tp_setattr*/ (cmpfunc)0, /*tp_compare*/ (reprfunc)0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ (hashfunc)0, /*tp_hash*/ (ternaryfunc)persistent_id_call, /*tp_call*/ (reprfunc)0, /*tp_str*/ (getattrofunc)0, /*tp_getattro*/ (setattrofunc)0, /*tp_setattro*/ /* Space for future expansion */ 0L,0L, "C implementation of the persistent_id function defined in Connection.py" }; /* End of code for persistent_id objects */ /* -------------------------------------------------------- */ /* List of methods defined in the module */ static struct PyMethodDef Module_Level__methods[] = { {"new_persistent_id", (PyCFunction)newpersistent_id, METH_VARARGS, "new_persistent_id(jar, stackup, new_oid)" " -- get a new persistent_id function"}, {NULL, (PyCFunction)NULL, 0, NULL} /* sentinel */ }; void initcoptimizations() { PyObject *m, *d; char *rev="$Revision: 1.1 $"; #define make_string(S) if (! (py_ ## S=PyString_FromString(#S))) return make_string(_p_oid); make_string(_p_jar); make_string(__getinitargs__); make_string(__module__); make_string(new_oid); UNLESS (ExtensionClassImported) return; m = Py_InitModule4("coptimizations", Module_Level__methods, "C optimizations", (PyObject*)NULL,PYTHON_API_VERSION); d = PyModule_GetDict(m); persistent_idType.ob_type=&PyType_Type; PyDict_SetItemString(d,"persistent_idType", OBJECT(&persistent_idType)); PyDict_SetItemString(d, "__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); } Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/dbmStorage.py100644 1007 1403 15106 6742211574 21625 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Very Simple dbm-based ZODB storage This storage provides for use of dbm files as storages that don't support versions or Undo. This may be useful when implementing objects like hit counters that don't need or want to participate in undo or versions. """ __version__='$Revision: 1.1 $'[11:-2] import base64, POSException, time, string, utils from MappingStorage import MappingStorage from BaseStorage import BaseStorage import anydbm, os class anydbmStorage(MappingStorage): def __init__(self, filename, flag='r', mode=0666): BaseStorage.__init__(self, filename) self._index=anydbm.open(filename, flag, mode) self._tindex=[] keys=self._index.keys() if keys: self._oid=max(keys) def getSize(self): # This is a little iffy, since we aren't entirely sure what the file is self._lock_acquire() try: try: return (os.stat(self.__name__+'.data')[6] + os.stat(self.__name__+'.dir')[6] ) except: try: return os.stat(self.__name__)[6] except: return 0 finally: self._lock_release() class gdbmStorage(anydbmStorage): def __init__(self, filename, flag='r', mode=0666): BaseStorage.__init__(self, filename) import gdbm self._index=index=gdbm.open(filename, flag[:1]+'f', mode) self._tindex=[] m='\0\0\0\0\0\0\0\0' oid=index.firstkey() while oid != None: m=max(m, oid) oid=index.nextkey(oid) self._oid=m def getSize(self): self._lock_acquire() try: return os.stat(self.__name__)[6] finally: self._lock_release() def pack(self, t, referencesf): self._lock_acquire() try: # Build an index of *only* those objects reachable # from the root. index=self._index rootl=['\0\0\0\0\0\0\0\0'] pop=rootl.pop pindex={} referenced=pindex.has_key while rootl: oid=pop() if referenced(oid): continue # Scan non-version pickle for references r=index[oid] pindex[oid]=r p=r[8:] referencesf(p, rootl) # Now delete any unreferenced entries: deleted=[] oid=index.firstkey() while oid != None: if not referenced(oid): deleted.append(oid) oid=index.nextkey(oid) pindex=referenced=None for oid in deleted: del index[oid] index.sync() index.reorganize() finally: self._lock_release() def _finish(self, tid, user, desc, ext): index=self._index for oid, p in self._tindex: index[oid]=p index.sync() Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/lock_file.py100644 1007 1403 11605 6716322200 21453 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import POSException # Try to create a function that creates Unix file locks. On windows # this will fail. try: import fcntl, FCNTL lock_file_FLAG=FCNTL.LOCK_EX|FCNTL.LOCK_NB def lock_file(file, error=POSException.StorageSystemError): try: un=file.fileno() except: return # don't care if not a real file try: fcntl.flock(un,lock_file_FLAG) except: raise error, ( "Could not lock the database file. There must be\n" "another process that has opened the file.\n" "

    ") except: # Try windows-specific code: try: from winlock import LockFile def lock_file(file, error=POSException.StorageSystemError): try: un=file.fileno() except: return # don't care if not a real file try: LockFile(un,0,0,1,0) # just lock the first byte, who cares except: raise error, ( "Could not lock the database file. There must be\n" "another process that has opened the file.\n" "

    ") except: def lock_file(file, error=None): pass Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/referencesf.py100644 1007 1403 11133 6720306536 22020 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Provide a function that can find object references in pickles """ import cPickle, cStringIO def referencesf(p,rootl, Unpickler=cPickle.Unpickler, StringIO=cStringIO.StringIO, tt=type(()), type=type): u=Unpickler(StringIO(p)) l=len(rootl) u.persistent_load=rootl u.noload() try: u.noload() except: # Hm. We failed to do second load. Maybe there wasn't a # second pickle. Let's check: f=StringIO(p) u=Unpickler(f) u.persistent_load=[] u.noload() if len(p) > f.tell(): raise ValueError, 'Error unpickling, %s' % p # References may have class info, so we need to # check for wrapped references. for i in range(l, len(rootl)): v=rootl[i] if v: if type(v) is tt: v=v[0] rootl[i]=v Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/utils.py100644 1007 1403 10721 6754300337 20673 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import TimeStamp, time, struct t32 = 1L << 32 def p64(v, pack=struct.pack): if v < t32: h=0 else: h=v/t32 v=v%t32 return pack(">II", h, v) def u64(v, unpack=struct.unpack): h, v = unpack(">ii", v) if v < 0: v=t32-v if h: if h < 0: h=t32-h v=h*t32+v return v def cp(f1, f2, l): read=f1.read write=f2.write n=8192 while l > 0: if n > l: n=l d=read(n) if not d: break write(d) l = l - len(d) def newTimeStamp(old=None, TimeStamp=TimeStamp.TimeStamp, time=time.time, gmtime=time.gmtime): t=time() ts=TimeStamp(gmtime(t)[:5]+(t%60,)) if old is not None: return ts.laterThan(than) Zope-2.0.1-ZEO-nonbin/lib/python/ZODB/winlock.c100755 1007 1403 12626 6671334604 21006 0ustar petrillipetrilli/***************************************************************************** Zope Public License (ZPL) Version 1.0 ------------------------------------- Copyright (c) Digital Creations. All rights reserved. This license has been certified as Open Source(tm). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope in any manner possible. Zope includes a "Powered by Zope" button that is installed by default. While it is not a license violation to remove this button, it is requested that the attribution remain. A significant investment has been put into Zope, and this effort will continue if the Zope community continues to grow. This is one way to assure that growth. 4. All advertising materials and documentation mentioning features derived from or use of this software must display the following acknowledgement: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." In the event that the product being advertised includes an intact Zope distribution (with copyright and license included) then this clause is waived. 5. Names associated with Zope or Digital Creations must not be used to endorse or promote products derived from this software without prior written permission from Digital Creations. 6. Modified redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by Digital Creations for use in the Z Object Publishing Environment (http://www.zope.org/)." Intact (re-)distributions of any official Zope release do not require an external acknowledgement. 7. Modifications are encouraged but must be packaged separately as patches to official Zope releases. Distributions that do not clearly separate the patches from the original work must be clearly labeled as unofficial distributions. Modifications which do not carry the name Zope may be packaged in any form, as long as they conform to all of the clauses above. Disclaimer THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY EXPRESSED 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 DIGITAL CREATIONS OR ITS 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 software consists of contributions made by Digital Creations and many individuals on behalf of Digital Creations. Specific attributions are listed in the accompanying credits file. ****************************************************************************/ static char *what_string = "$Id: winlock.c,v 1.4 1999/03/10 00:15:00 klm Exp $"; #include "Python.h" static PyObject *Error; #ifdef MS_WIN32 #include #include static PyObject * winlock(PyObject *ignored, PyObject *args) { int fileno; long h, ol, oh, ll, lh; if (! PyArg_ParseTuple(args, "illll", &fileno, &ol, &oh, &ll, &lh)) return NULL; if ((h=_get_osfhandle(fileno))==-1) { PyErr_SetString(Error, "_get_osfhandle failed"); return NULL; } if (LockFile((HANDLE)h, ol, oh, ll, lh)) { Py_INCREF(Py_None); return Py_None; } PyErr_SetObject(Error, PyInt_FromLong(GetLastError())); return NULL; } static struct PyMethodDef methods[] = { {"LockFile", (PyCFunction)winlock, 1, "LockFile(fileno, offsetLow, offsetHigh, lengthLow, lengthHigh ) -- " "Lock the file associated with fileno"}, {NULL, NULL} /* sentinel */ }; #else static struct PyMethodDef methods[] = { {NULL, NULL} /* sentinel */ }; #endif /* Initialization function for the module (*must* be called initcStringIO) */ #ifndef DL_EXPORT /* declarations for DLL import/export */ #define DL_EXPORT(RTYPE) RTYPE #endif DL_EXPORT(void) initwinlock() { PyObject *m, *d; char *rev="$Revision: 1.4 $"; if (! (Error=PyString_FromString("winlock.error"))) return; /* Create the module and add the functions */ m = Py_InitModule4("winlock", methods, "lock files on windows", (PyObject*)NULL,PYTHON_API_VERSION); d = PyModule_GetDict(m); PyDict_SetItemString(d, "error", Error); PyDict_SetItemString(d,"__version__", PyString_FromStringAndSize(rev+11,strlen(rev+11)-2)); if (PyErr_Occurred()) Py_FatalError("can't initialize module winlock"); } Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/ 40755 1007 1403 0 6772126760 20402 5ustar petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/BaseRequest.py100644 1007 1403 44214 6756327177 23330 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __version__='$Revision: 1.16 $'[11:-2] from string import join, split, find, rfind, lower, upper from urllib import quote UNSPECIFIED_ROLES='' try: from ExtensionClass import Base class RequestContainer(Base): def __init__(self,**kw): for k,v in kw.items(): self.__dict__[k]=v def manage_property_types(self): return type_converters.keys() except: class RequestContainer: def __init__(self,**kw): for k,v in kw.items(): self.__dict__[k]=v _marker=[] class BaseRequest: """Provide basic ZPublisher request management This object provides access to request data. Request data may vary depending on the protocol used. Request objects are created by the object publisher and will be passed to published objects through the argument name, REQUEST. The request object is a mapping object that represents a collection of variable to value mappings. """ _file=None common={} # Common request data _auth=None _held=() def __init__(self, other=None, **kw): """The constructor is not allowed to raise errors """ if other is None: other=kw else: other.update(kw) self.other=other def close(self): self.other.clear() self._held=None def processInputs(self): """Do any input processing that could raise errors """ def __len__(self): return 1 def __setitem__(self,key,value): """Set application variables This method is used to set a variable in the requests "other" category. """ self.other[key]=value set=__setitem__ def __getitem__(self,key, default=_marker, # Any special internal marker will do ): """Get a variable value Return a value for the required variable name. The value will be looked up from one of the request data categories. The search order is environment variables, other variables, form data, and then cookies. """ if key=='REQUEST': return self v=self.other.get(key, _marker) if v is not _marker: return v v=self.common.get(key, default) if v is not _marker: return v if key=='BODY' and self._file is not None: p=self._file.tell() self._file.seek(0) v=self._file.read() self._file.seek(p) self.other[key]=v return v if key=='BODYFILE' and self._file is not None: v=self._file self.other[key]=v return v raise KeyError, key __getattr__=get=__getitem__ def has_key(self,key): return self.get(key, _marker) is not _marker def keys(self): keys = {} keys.update(self.common) keys.update(self.other) return keys.keys() def items(self): result = [] get=self.get for k in self.keys(): result.append((k, get(k))) return result def values(self): result = [] get=self.get for k in self.keys(): result.append(get(k)) return result def __str__(self): L1 = self.items() L1.sort() return join(map(lambda item: "%s:\t%s" % item, L1), "\n") __repr__=__str__ def traverse(self, path, response=None): """Traverse the object space The REQUEST must already have a PARENTS item with at least one object in it. This is typically the root object. """ request=self request_get=request.get if response is None: response=self.response debug_mode=response.debug_mode if path[:1] != '/': path='/'+path if path[-1:] != '/': path=path+'/' if find(path,'/.') >= 0: path=join(split(path,'/./'),'/') l=find(path,'/../',1) while l > 0: p1=path[:l] path=path[:rfind(p1,'/')+1]+path[l+4:] l=find(path,'/../',1) path=path[1:-1] path=split(path,'/') while path and not path[0]: path = path[1:] method=req_method=upper(request_get('REQUEST_METHOD', 'GET')) baseflag=0 if method=='GET' or method=='POST': method='index_html' else: baseflag=1 URL=request['URL'] parents=request['PARENTS'] object=parents[-1] del parents[:] try: # We build parents in the wrong order, so we # need to make sure we reverse it when we're doe. if hasattr(object,'__roles__'): roles=object.__roles__ else: roles=UNSPECIFIED_ROLES # if the top object has a __bobo_traverse__ method, then use it # to possibly traverse to an alternate top-level object. if hasattr(object,'__bobo_traverse__'): try: object=object.__bobo_traverse__(request) except: pass # Get default object if no path was specified: if not path: if not method: return response.forbiddenError(entry_name) entry_name=method try: if hasattr(object,entry_name): response.setBase(URL) path=[entry_name] else: try: if object.has_key(entry_name): path=[entry_name] except: pass except: pass # Traverse the URL to find the object: if hasattr(object, '__of__'): # Try to bind the top-level object to the request object=object.__of__(RequestContainer(REQUEST=request)) steps=self.steps path.reverse() while path: entry_name=path[-1] del path[-1] URL="%s/%s" % (URL,quote(entry_name)) got=0 if entry_name: if entry_name[:1]=='_': if debug_mode: return response.debugError( "Object name begins with an underscore at: %s" % URL) else: return response.forbiddenError(entry_name) if hasattr(object,'__bobo_traverse__'): request['URL']=URL subobject=object.__bobo_traverse__(request,entry_name) if type(subobject) is type(()) and len(subobject) > 1: while len(subobject) > 2: parents.append(subobject[0]) subobject=subobject[1:] object, subobject = subobject else: try: # Note - this is necessary to support # things like DAV. We have to make sure # that the target object is not acquired # if the request_method is other than GET # or POST. Otherwise, you could never use # PUT to add a new object named 'test' if # an object 'test' existed above it in the # heirarchy -- you'd always get the # existing object :( if baseflag and hasattr(object, 'aq_base'): if hasattr(object.aq_base, entry_name): subobject=getattr(object, entry_name) else: raise AttributeError, entry_name else: subobject=getattr(object, entry_name) except AttributeError: got=1 try: subobject=object[entry_name] except (KeyError, IndexError, TypeError, AttributeError): if debug_mode: return response.debugError( "Cannot locate object at: %s" %URL) else: return response.notFoundError(URL) try: try: doc=subobject.__doc__ except: doc=getattr(object, entry_name+'__doc__') if not doc: raise AttributeError, entry_name except: if debug_mode: return response.debugError( "Missing doc string at: %s" % URL) else: return response.notFoundError("%s" % (URL)) if hasattr(subobject,'__roles__'): roles=subobject.__roles__ else: if not got: roleshack=entry_name+'__roles__' if hasattr(object, roleshack): roles=getattr(object, roleshack) # Promote subobject to object parents.append(object) object=subobject steps.append(entry_name) # Check for method: if not path: if (method and hasattr(object,method) and entry_name != method and getattr(object, method) is not None ): request._hacked_path=1 path=[method] else: if (hasattr(object, '__call__') and hasattr(object.__call__,'__roles__')): roles=object.__call__.__roles__ if request._hacked_path: i=rfind(URL,'/') if i > 0: response.setBase(URL[:i]) finally: # We need to MAKE SURE this happens due to new error handling parents.reverse() # Do authorization checks user=groups=None i=0 if roles is not None: last_parent_index=len(parents) if hasattr(object, '__allow_groups__'): groups=object.__allow_groups__ inext=0 else: inext=None for i in range(last_parent_index): if hasattr(parents[i],'__allow_groups__'): groups=parents[i].__allow_groups__ inext=i+1 break if inext is not None: i=inext if hasattr(groups, 'validate'): v=groups.validate else: v=old_validation auth=request._auth if v is old_validation and roles is UNSPECIFIED_ROLES: # No roles, so if we have a named group, get roles from # group keys if hasattr(groups,'keys'): roles=groups.keys() else: try: groups=groups() except: pass try: roles=groups.keys() except: pass if groups is None: # Public group, hack structures to get it to validate roles=None auth='' if v is old_validation: user=old_validation(groups, request, auth, roles) elif roles is UNSPECIFIED_ROLES: user=v(request, auth) else: user=v(request, auth, roles) while user is None and i < last_parent_index: parent=parents[i] i=i+1 if hasattr(parent, '__allow_groups__'): groups=parent.__allow_groups__ else: continue if hasattr(groups,'validate'): v=groups.validate else: v=old_validation if v is old_validation: user=old_validation(groups, request, auth, roles) elif roles is UNSPECIFIED_ROLES: user=v(request, auth) else: user=v(request, auth, roles) if user is None and roles != UNSPECIFIED_ROLES: response.unauthorized() steps=join(steps[:-i],'/') if user is not None: request['AUTHENTICATED_USER']=user request['AUTHENTICATION_PATH']=steps # Remove http request method from the URL. request['URL']=URL return object retry_count=0 def supports_retry(self): return 0 def _hold(self, object): """Hold a reference to an object to delay it's destruction until mine """ self._held=self._held+(object,) def old_validation(groups, request, auth, roles=UNSPECIFIED_ROLES): if auth: auth=request._authUserPW() if auth: name,password = auth elif roles is None: return '' else: return None elif request.environ.has_key('REMOTE_USER'): name=request.environ['REMOTE_USER'] password=None else: if roles is None: return '' return None if roles is None: return name keys=None try: keys=groups.keys except: try: groups=groups() # Maybe it was a method defining a group keys=groups.keys except: pass if keys is not None: # OK, we have a named group, so apply the roles to the named # group. if roles is UNSPECIFIED_ROLES: roles=keys() g=[] for role in roles: if groups.has_key(role): g.append(groups[role]) groups=g for d in groups: if d.has_key(name) and (d[name]==password or password is None): return name if keys is None: # Not a named group, so don't go further raise 'Forbidden', ( """You are not authorized to access this resource""") return None Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/BaseResponse.py100644 1007 1403 17173 6752100346 23461 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''CGI Response Output formatter $Id: BaseResponse.py,v 1.4 1999/08/04 18:05:26 jim Exp $''' __version__='$Revision: 1.4 $'[11:-2] import string, types, sys, regex from string import find, rfind, lower, upper, strip, split, join, translate from types import StringType, InstanceType class BaseResponse: """Base Response Class What should be here? """ debug_mode=None _auth=None _error_format='text/plain' def __init__(self, stdout, stderr, body='', headers=None, status=None, cookies=None): self.stdout=stdout self.stderr=stderr self.body=body if headers is None: headers={} self.headers=headers self.status=status if cookies is None: cookies={} self.cookies=cookies def setStatus(self, status, reason=None): self.status=status def setHeader(self, name, value): self.headers[n]=value __setitem__=setHeader def setBody(self, body): self.body=body def getStatus(self): 'Returns the current HTTP status code as an integer. ' return self.status def setCookie(self,name,value,**kw): '''\ Set an HTTP cookie on the browser The response will include an HTTP header that sets a cookie on cookie-enabled browsers with a key "name" and value "value". This overwrites any previously set value for the cookie in the Response object. ''' cookies=self.cookies if cookies.has_key(name): cookie=cookies[name] else: cookie=cookies[name]={} for k, v in kw.items(): cookie[k]=v cookie['value']=value def appendBody(self, body): self.setBody(self.getBody() + body) def getHeader(self, name): '''\ Get a header value Returns the value associated with a HTTP return header, or "None" if no such header has been set in the response yet. ''' return self.headers.get(name, None) def __getitem__(self, name): 'Get the value of an output header' return self.headers[name] def getBody(self): 'Returns a string representing the currently set body. ' return self.body def __str__(self): return str(self.body) def __repr__(self): return '%s(%s)' % (self.__class__.__name__, `self.body`) def flush(self): pass def write(self,data): """\ Return data as a stream HTML data may be returned using a stream-oriented interface. This allows the browser to display partial results while computation of a response to proceed. The published object should first set any output headers or cookies on the response object. Note that published objects must not generate any errors after beginning stream-oriented output. """ self.body=self.body+data def exception(self, fatal=0, info=None): """Handle an exception. The fatal argument indicates whether the error is fatal. The info argument, if given should be a tuple with an error type, value, and traceback. """ def notFoundError(self, v=''): """Generate an error indicating that an object was not found. """ raise 'Not Found', v def debugError(self, v=''): """Raise an error with debigging info and in debugging mode""" raise 'Debug Error', v def badRequestError(self, v=''): """Raise an error indicating something wrong with the request""" raise 'Bad Request', v def forbiddenError(self, v=''): """Raise an error indicating that the request cannot be done""" raise 'Forbidden', v def unauthorized(self): """Raise an eror indicating that the user was not authizated Make sure to generate an appropriate challenge, as appropriate. """ raise 'Unauthorized' Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/Client.py100644 1007 1403 52203 6762563233 22310 0ustar petrillipetrilli#!/bin/sh """:" exec python $0 ${1+"$@"} """ #" ############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## """Bobo call interface This module provides tools for accessing web objects as if they were functions or objects with methods. It also provides a simple call function that allows one to simply make a single web request. Function -- Function-like objects that return both header and body data when called. Object -- Treat a URL as a web object with methods call -- Simple interface to call a remote function. The module also provides a command-line interface for calling objects. """ __version__='$Revision: 1.33 $'[11:-2] import sys, regex, socket, mimetools from httplib import HTTP from os import getpid from time import time from random import random from base64 import encodestring from urllib import urlopen, quote from types import FileType, ListType, DictType, TupleType from string import strip, split, atoi, join, rfind, translate, maketrans, replace from urlparse import urlparse class Function: username=None password=None method=None timeout=60 def __init__(self,url, arguments=(),method=None,username=None,password=None, timeout=None, **headers): while url[-1:]=='/': url=url[:-1] self.url=url self.headers=headers if not headers.has_key('Host') and not headers.has_key('host'): headers['Host']=split(urlparse(url)[1],':')[0] self.func_name=url[rfind(url,'/')+1:] self.__dict__['__name__']=self.func_name self.func_defaults=() self.args=arguments if method is not None: self.method=method if username is not None: self.username=username if password is not None: self.password=password if timeout is not None: self.timeout=timeout if urlregex.match(url) >= 0: host,port,rurl=urlregex.group(1,2,3) if port: port=atoi(port[1:]) else: port=80 self.host=host self.port=port rurl=rurl or '/' self.rurl=rurl else: raise ValueError, url def __call__(self,*args,**kw): method=self.method if method=='PUT' and len(args)==1 and not kw: query=[args[0]] args=() else: query=[] for i in range(len(args)): try: k=self.args[i] if kw.has_key(k): raise TypeError, 'Keyword arg redefined' kw[k]=args[i] except IndexError: raise TypeError, 'Too many arguments' headers={} for k, v in self.headers.items(): headers[translate(k,dashtrans)]=v method=self.method if headers.has_key('Content-Type'): content_type=headers['Content-Type'] if content_type=='multipart/form-data': return self._mp_call(kw) else: content_type=None if not method or method=='POST': for v in kw.values(): if hasattr(v,'read'): return self._mp_call(kw) can_marshal=type2marshal.has_key for k,v in kw.items(): t=type(v) if can_marshal(t): q=type2marshal[t](k,v) else: q='%s=%s' % (k,quote(v)) query.append(q) url=self.rurl if query: query=join(query,'&') method=method or 'POST' if method == 'PUT': headers['Content-Length']=str(len(query)) if method != 'POST': url="%s?%s" % (url,query) query='' elif not content_type: headers['Content-Type']='application/x-www-form-urlencoded' headers['Content-Length']=str(len(query)) else: method=method or 'GET' if (self.username and self.password and not headers.has_key('Authorization')): headers['Authorization']=( "Basic %s" % replace(encodestring('%s:%s' % (self.username,self.password)), '\012','')) try: h=HTTP() h.connect(self.host, self.port) h.putrequest(method, self.rurl) for hn,hv in headers.items(): h.putheader(translate(hn,dashtrans),hv) h.endheaders() if query: h.send(query) ec,em,headers=h.getreply() response =h.getfile().read() except: raise NotAvailable, RemoteException( NotAvailable,sys.exc_value,self.url,query) if ec==200: return (headers,response) self.handleError(query, ec, em, headers, response) def handleError(self, query, ec, em, headers, response): try: v=headers.dict['bobo-exception-value'] except: v=ec try: f=headers.dict['bobo-exception-file'] except: f='Unknown' try: l=headers.dict['bobo-exception-line'] except: l='Unknown' try: t=exceptmap[headers.dict['bobo-exception-type']] except: if ec >= 400 and ec < 500: t=NotFound elif ec == 503: t=NotAvailable else: t=ServerError raise t, RemoteException(t,v,f,l,self.url,query,ec,em,response) def _mp_call(self,kw, type2suffix={ type(1.0): ':float', type(1): ':int', type(1L): ':long', type([]): ':list', type(()): ':tuple', } ): # Call a function using the file-upload protcol # Add type markers to special values: d={} special_type=type2suffix.has_key for k,v in kw.items(): if ':' not in k: t=type(v) if special_type(t): d['%s%s' % (k,type2suffix[t])]=v else: d[k]=v else: d[k]=v rq=[('POST %s HTTP/1.0' % self.rurl),] for n,v in self.headers.items(): rq.append('%s: %s' % (n,v)) if self.username and self.password: c=replace(encodestring('%s:%s' % (self.username,self.password)),'\012','') rq.append('Authorization: Basic %s' % c) rq.append(MultiPart(d).render()) rq=join(rq,'\r\n') try: sock=socket.socket(socket.AF_INET,socket.SOCK_STREAM) sock.connect(self.host,self.port) sock.send(rq) reply=sock.makefile('rb') sock=None line=reply.readline() try: [ver, ec, em] = split(line, None, 2) except ValueError: raise 'BadReply','Bad reply from server: '+line if ver[:5] != 'HTTP/': raise 'BadReply','Bad reply from server: '+line ec=atoi(ec) em=strip(em) headers=mimetools.Message(reply,0) response=reply.read() finally: if 0: raise NotAvailable, ( RemoteException(NotAvailable,sys.exc_value, self.url,'')) if ec==200: return (headers,response) self.handleError('', ec, em, headers, response) class Object: """Surrogate object for an object on the web""" username=None password=None method=None timeout=None special_methods= 'GET','POST','PUT' def __init__(self, url, method=None,username=None,password=None, timeout=None, **headers): self.url=url self.headers=headers if not headers.has_key('Host') and not headers.has_key('host'): headers['Host']=split(urlparse(url)[1],':')[0] if method is not None: self.method=method if username is not None: self.username=username if password is not None: self.password=password if timeout is not None: self.timeout=timeout def __getattr__(self, name): if name in self.special_methods: method=name url=self.url else: method=self.method url="%s/%s" % (self.url, name) f=Function(url, method=method, username=self.username, password=self.password, timeout=self.timeout) f.headers=self.headers return f def call(url,username=None, password=None, **kw): return apply(Function(url,username=username, password=password), (), kw) ############################################################################## # Implementation details below here urlregex=regex.compile('http://\([^:/]+\)\(:[0-9]+\)?\(/.+\)?', regex.casefold) dashtrans=maketrans('_','-') def marshal_float(n,f): return '%s:float=%s' % (n,f) def marshal_int(n,f): return '%s:int=%s' % (n,f) def marshal_long(n,f): return ('%s:long=%s' % (n,f))[:-1] sample_regex=regex.compile('') def marshal_regex(n,r): if r.translate is sample_regex.translate: t='Regex' elif r.translate is regex.casefold: t='regex' else: raise ValueError, 'regular expression used unsupported translation' return "%s:%s=%s" % (n,t,quote(r.givenpat)) def marshal_list(n,l,tname='list', lt=type([]), tt=type(())): r=[] for v in l: t=type(v) if t is lt or t is tt: raise TypeError, 'Invalid recursion in data to be marshaled.' r.append(marshal_whatever("%s:%s" % (n,tname) ,v)) return join(r,'&') def marshal_tuple(n,l): return marshal_list(n,l,'tuple') type2marshal={ type(1.0): marshal_float, type(1): marshal_int, type(1L): marshal_long, type(regex.compile('')): marshal_regex, type([]): marshal_list, type(()): marshal_tuple, } def marshal_whatever(k,v): try: q=type2marshal[type(v)](k,v) except KeyError: q='%s=%s' % (k,quote(str(v))) return q def querify(items): query=[] for k,v in items: query.append(marshal_whatever(k,v)) return query and join(query,'&') or '' NotFound ='bci.NotFound' InternalError='bci.InternalError' BadRequest ='bci.BadRequest' Unauthorized ='bci.Unauthorized' ServerError ='bci.ServerError' NotAvailable ='bci.NotAvailable' exceptmap ={'AttributeError' :AttributeError, 'BadRequest' :BadRequest, 'EOFError' :EOFError, 'IOError' :IOError, 'ImportError' :ImportError, 'IndexError' :IndexError, 'InternalError' :InternalError, 'KeyError' :KeyError, 'MemoryError' :MemoryError, 'NameError' :NameError, 'NotAvailable' :NotAvailable, 'NotFound' :NotFound, 'OverflowError' :OverflowError, 'RuntimeError' :RuntimeError, 'ServerError' :ServerError, 'SyntaxError' :SyntaxError, 'SystemError' :SystemError, 'SystemExit' :SystemExit, 'TypeError' :TypeError, 'Unauthorized' :Unauthorized, 'ValueError' :ValueError, 'ZeroDivisionError':ZeroDivisionError} class RemoteException: def __init__(self,etype=None,evalue=None,efile=None,eline=None,url=None, query=None,http_code=None,http_msg=None, http_resp=None): """Contains information about an exception which occurs in a remote method call""" self.exc_type =etype self.exc_value =evalue self.exc_file =efile self.exc_line =eline self.url =url self.query =query self.http_code =http_code self.http_message=http_msg self.response =http_resp def __repr__(self): return '%s (File: %s Line: %s)\n%s %s for %s' % ( self.exc_value,self.exc_file,self.exc_line, self.http_code,self.http_message,self.url) class MultiPart: def __init__(self,*args): c=len(args) if c==1: name,val=None,args[0] elif c==2: name,val=args[0],args[1] else: raise ValueError, 'Invalid arguments' h={'Content-Type': {'_v':''}, 'Content-Transfer-Encoding': {'_v':''}, 'Content-Disposition': {'_v':''},} dt=type(val) b=t=None if dt==DictType: t=1 b=self.boundary() d=[] h['Content-Type']['_v']='multipart/form-data; boundary=%s' % b for n,v in val.items(): d.append(MultiPart(n,v)) elif (dt==ListType) or (dt==TupleType): raise ValueError, 'Sorry, nested multipart is not done yet!' elif dt==FileType or hasattr(val,'read'): if hasattr(val,'name'): fn=replace(val.name, '\\', '/') fn=fn[(rfind(fn,'/')+1):] ex=fn[(rfind(fn,'.')+1):] if self._extmap.has_key(ex): ct=self._extmap[ex] else: ct=self._extmap[''] else: fn='' ct=self._extmap[None] if self._encmap.has_key(ct): ce=self._encmap[ct] else: ce='' h['Content-Disposition']['_v'] ='form-data' h['Content-Disposition']['name'] ='"%s"' % name h['Content-Disposition']['filename']='"%s"' % fn h['Content-Transfer-Encoding']['_v']=ce h['Content-Type']['_v'] =ct d=[] l=val.read(8192) while l: d.append(l) l=val.read(8192) else: h['Content-Disposition']['_v']='form-data' h['Content-Disposition']['name']='"%s"' % name d=[str(val)] self._headers =h self._data =d self._boundary=b self._top =t def boundary(self): return '%s_%s_%s' % (int(time()), getpid(), int(random()*1000000000)) def render(self): h=self._headers s=[] if self._top: for n,v in h.items(): if v['_v']: s.append('%s: %s' % (n,v['_v'])) for k in v.keys(): if k != '_v': s.append('; %s=%s' % (k, v[k])) s.append('\r\n') p=[] t=[] b=self._boundary for d in self._data: p.append(d.render()) t.append('--%s\n' % b) t.append(join(p,'\n--%s\n' % b)) t.append('\n--%s--\n' % b) t=join(t,'') s.append('Content-Length: %s\r\n\r\n' % len(t)) s.append(t) return join(s,'') else: for n,v in h.items(): if v['_v']: s.append('%s: %s' % (n,v['_v'])) for k in v.keys(): if k != '_v': s.append('; %s=%s' % (k, v[k])) s.append('\r\n') s.append('\r\n') if self._boundary: p=[] b=self._boundary for d in self._data: p.append(d.render()) s.append('--%s\n' % b) s.append(join(p,'\n--%s\n' % b)) s.append('\n--%s--\n' % b) return join(s,'') else: return join(s+self._data,'') _extmap={'': 'text/plain', 'rdb': 'text/plain', 'html': 'text/html', 'dtml': 'text/html', 'htm': 'text/html', 'dtm': 'text/html', 'gif': 'image/gif', 'jpg': 'image/jpeg', 'exe': 'application/octet-stream', None : 'application/octet-stream', } _encmap={'image/gif': 'binary', 'image/jpg': 'binary', 'application/octet-stream': 'binary', } def ErrorTypes(code): if code >= 400 and code < 500: return NotFound if code >= 500 and code < 600: return ServerError return 'HTTP_Error_%s' % code usage=""" Usage: %s [-u username:password] url [name=value ...] where url is the web resource to call. The -u option may be used to provide a user name and password. Optional arguments may be provides as name=value pairs. In a name value pair, if a name ends in ":file", then the value is treated as a file name and the file is send using the file-upload protocol. If the file name is "-", then data are taken from standard input. The body of the response is written to standard output. The headers of the response are written to standard error. """ % sys.argv[0] def main(): import getopt from string import split user=None try: optlist, args = getopt.getopt(sys.argv[1:],'u:') url=args[0] u =filter(lambda o: o[0]=='-u', optlist) if u: [user, pw] = split(u[0][1],':') kw={} for arg in args[1:]: [name,v]=split(arg,'=') if name[-5:]==':file': name=name[:-5] if v=='-': v=sys.stdin else: v=open(v) kw[name]=v except: print usage sys.exit(1) # The "main" program for this module f=Function(url) if user: f.username, f.password = user, pw headers, body = apply(f,(),kw) sys.stderr.write(join(map(lambda h: "%s: %s\n" % h, headers.items()),"") +"\n\n") print body if __name__ == "__main__": main() Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/Converters.py100644 1007 1403 14044 6736433017 23222 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __version__='$Revision: 1.7 $'[11:-2] import regex from string import atoi, atol, atof, join, split, strip from types import ListType, TupleType def field2string(v): if hasattr(v,'read'): v=v.read() else: v=str(v) return v def field2text(v, nl=regex.compile('\r\n\|\n\r').search): if hasattr(v,'read'): v=v.read() else: v=str(v) l=nl(v) if l < 0: return v r=[] s=0 while l >= s: r.append(v[s:l]) s=l+2 l=nl(v,s) r.append(v[s:]) return join(r,'\n') def field2required(v): if hasattr(v,'read'): v=v.read() else: v=str(v) if strip(v): return v raise ValueError, 'No input for required field

    ' def field2int(v): if type(v) in (ListType, TupleType): return map(field2int, v) if hasattr(v,'read'): v=v.read() else: v=str(v) # we can remove the check for an empty string when we go to python 1.4 if v: return atoi(v) raise ValueError, 'Empty entry when integer expected' def field2float(v): if type(v) in (ListType, TupleType): return map(field2float, v) if hasattr(v,'read'): v=v.read() else: v=str(v) # we can remove the check for an empty string when we go to python 1.4 if v: return atof(v) raise ValueError, ( 'Empty entry when floating-point number expected') def field2long(v): if type(v) in (ListType, TupleType): return map(field2long, v) if hasattr(v,'read'): v=v.read() else: v=str(v) # we can remove the check for an empty string when we go to python 1.4 if v: return atol(v) raise ValueError, 'Empty entry when integer expected' def field2tokens(v): if hasattr(v,'read'): v=v.read() else: v=str(v) return split(v) def field2lines(v): return split(field2text(v),'\n') def field2date(v): from DateTime import DateTime if hasattr(v,'read'): v=v.read() else: v=str(v) return DateTime(v) def field2boolean(v): return v type_converters = { 'float': field2float, 'int': field2int, 'long': field2long, 'string': field2string, 'date': field2date, 'required': field2required, 'tokens': field2tokens, 'lines': field2lines, 'text': field2text, 'boolean': field2boolean, } get_converter=type_converters.get Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/HTTPRequest.py100644 1007 1403 107447 6763230005 23242 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __version__='$Revision: 1.25 $'[11:-2] import regex, sys, os, string from string import lower, atoi, rfind, split, strip, join, upper, find from BaseRequest import BaseRequest from HTTPResponse import HTTPResponse from cgi import FieldStorage from urllib import quote, unquote from Converters import get_converter from maybe_lock import allocate_lock xmlrpc=None # Placeholder for module that we'll import if we have to. isCGI_NAME = { 'SERVER_SOFTWARE' : 1, 'SERVER_NAME' : 1, 'GATEWAY_INTERFACE' : 1, 'SERVER_PROTOCOL' : 1, 'SERVER_PORT' : 1, 'REQUEST_METHOD' : 1, 'PATH_INFO' : 1, 'PATH_TRANSLATED' : 1, 'SCRIPT_NAME' : 1, 'QUERY_STRING' : 1, 'REMOTE_HOST' : 1, 'REMOTE_ADDR' : 1, 'AUTH_TYPE' : 1, 'REMOTE_USER' : 1, 'REMOTE_IDENT' : 1, 'CONTENT_TYPE' : 1, 'CONTENT_LENGTH' : 1, 'SERVER_URL': 1, }.has_key hide_key={'HTTP_AUTHORIZATION':1, 'HTTP_CGI_AUTHORIZATION': 1, }.has_key _marker=[] class HTTPRequest(BaseRequest): """\ Model HTTP request data. This object provides access to request data. This includes, the input headers, form data, server data, and cookies. Request objects are created by the object publisher and will be passed to published objects through the argument name, REQUEST. The request object is a mapping object that represents a collection of variable to value mappings. In addition, variables are divided into four categories: - Environment variables These variables include input headers, server data, and other request-related data. The variable names are as specified in the CGI specification - Form data These are data extracted from either a URL-encoded query string or body, if present. - Cookies These are the cookie data, if present. - Other Data that may be set by an application object. The form attribute of a request is actually a Field Storage object. When file uploads are used, this provides a richer and more complex interface than is provided by accessing form data as items of the request. See the FieldStorage class documentation for more details. The request object may be used as a mapping object, in which case values will be looked up in the order: environment variables, other variables, form data, and then cookies. """ _hacked_path=None args=() _file=None retry_max_count=3 def supports_retry(self): return self.retry_count < self.retry_max_count def retry(self): self.retry_count=self.retry_count+1 r=self.__class__(stdin=self.stdin, environ=self._orig_env, response=self.response.retry() ) return r def __init__(self, stdin, environ, response, clean=0): self._orig_env=environ # Avoid the overhead of scrubbing the environment in the # case of request cloning for traversal purposes. If the # clean flag is set, we know we can use the passed in # environ dict directly. if not clean: environ=sane_environment(environ) if environ.has_key('HTTP_AUTHORIZATION'): self._auth=environ['HTTP_AUTHORIZATION'] response._auth=1 del environ['HTTP_AUTHORIZATION'] self.stdin=stdin self.environ=environ have_env=environ.has_key get_env=environ.get self.response=response other=self.other={'RESPONSE': response} self.form={} self.steps=[] ################################################################ # Get base info first. This isn't likely to cause # errors and might be useful to error handlers. b=script=strip(get_env('SCRIPT_NAME','')) while b and b[-1]=='/': b=b[:-1] p = rfind(b,'/') if p >= 0: b=b[:p+1] else: b='' while b and b[0]=='/': b=b[1:] server_url=get_env('SERVER_URL',None) if server_url is not None: server_url=strip(server_url) else: if have_env('HTTPS') and ( environ['HTTPS'] == "on" or environ['HTTPS'] == "ON"): server_url='https://' elif (have_env('SERVER_PORT_SECURE') and environ['SERVER_PORT_SECURE'] == "1"): server_url='https://' else: server_url='http://' if have_env('HTTP_HOST'): server_url=server_url+strip(environ['HTTP_HOST']) else: server_url=server_url+strip(environ['SERVER_NAME']) server_port=environ['SERVER_PORT'] if server_port!='80': server_url=server_url+':'+server_port other['SERVER_URL']=server_url if server_url[-1:]=='/': server_url=server_url[:-1] if b: self.base="%s/%s" % (server_url,b) else: self.base=server_url while script[:1]=='/': script=script[1:] if script: script="%s/%s" % (server_url,script) else: script=server_url other['URL']=self.script=script ################################################################ # Cookie values should *not* be appended to existing form # vars with the same name - they are more like default values # for names not otherwise specified in the form. cookies={} k=get_env('HTTP_COOKIE','') if k: parse_cookie(k, cookies) for k,item in cookies.items(): if not other.has_key(k): other[k]=item self.cookies=cookies def processInputs( self, # "static" variables that we want to be local for speed SEQUENCE=1, DEFAULT=2, RECORD=4, RECORDS=8, REC=12, # RECORD|RECORDS EMPTY=16, CONVERTED=32, hasattr=hasattr, getattr=getattr, setattr=setattr, search_type=regex.compile(':[a-zA-Z][a-zA-Z0-9_]+$').search, rfind=string.rfind, ): """Process request inputs We need to delay input parsing so that it is done under publisher control for error handling purposes. """ response=self.response environ=self.environ method=environ.get('REQUEST_METHOD','GET') if method != 'GET': fp=self.stdin else: fp=None form=self.form other=self.other meth=None fs=FieldStorage(fp=fp,environ=environ,keep_blank_values=1) if not hasattr(fs,'list') or fs.list is None: # Hm, maybe it's an XML-RPC if (fs.headers.has_key('content-type') and fs.headers['content-type'] == 'text/xml' and method == 'POST'): # Ye haaa, XML-RPC! global xmlrpc if xmlrpc is None: import xmlrpc meth, self.args = xmlrpc.parse_input(fs.value) response=xmlrpc.response(response) other['RESPONSE']=self.response=response other['REQUEST_METHOD']='' # We don't want index_html! else: self._file=fs.file else: fslist=fs.list tuple_items={} lt=type([]) CGI_name=isCGI_NAME defaults={} converter=seqf=None for item in fslist: key=item.name if (hasattr(item,'file') and hasattr(item,'filename') and hasattr(item,'headers')): if (item.file and (item.filename is not None # RFC 1867 says that all fields get a content-type. # or 'content-type' in map(lower, item.headers.keys()) )): item=FileUpload(item) else: item=item.value flags=0 # Loop through the different types and set # the appropriate flags # We'll search from the back to the front. # We'll do the search in two steps. First, we'll # do a string search, and then we'll check it with # a regex search. l=rfind(key,':') if l >= 0: l=search_type(key,l) while l >= 0: type_name=key[l+1:] key=key[:l] c=get_converter(type_name, None) if c is not None: converter=c flags=flags|CONVERTED elif type_name == 'list': seqf=list flags=flags|SEQUENCE elif type_name == 'tuple': seqf=tuple tuple_items[key]=1 flags=flags|SEQUENCE elif type_name == 'method': if l: meth=key else: meth=item elif type_name == 'default_method': if not meth: if l: meth=key else: meth=item elif type_name == 'default': flags=flags|DEFAULT elif type_name == 'record': flags=flags|RECORD elif type_name == 'records': flags=flags|RECORDS elif type_name == 'ignore_empty': if not item: flags=flags|EMPTY l=rfind(key,':') if l < 0: break l=search_type(key,l) # Filter out special names from form: if CGI_name(key) or key[:5]=='HTTP_': continue if flags: # skip over empty fields if flags&EMPTY: continue #Split the key and its attribute if flags&REC: key=split(key,".") key, attr=join(key[:-1],"."), key[-1] # defer conversion if flags&CONVERTED: try: item=converter(item) except: if (not item and not (flags&DEFAULT) and defaults.has_key(key)): item = defaults[key] if flags&RECORD: item=getattr(item,attr) if flags&RECORDS: item.reverse() item = item[0] item=getattr(item,attr) else: raise #Determine which dictionary to use if flags&DEFAULT: mapping_object = defaults else: mapping_object = form #Insert in dictionary if mapping_object.has_key(key): if flags&RECORDS: #Get the list and the last record #in the list reclist = mapping_object[key] reclist.reverse() x=reclist[0] reclist.reverse() if not hasattr(x,attr): #If the attribute does not #exist, set it if flags&SEQUENCE: item=[item] reclist.remove(x) setattr(x,attr,item) reclist.append(x) mapping_object[key] = reclist else: if flags&SEQUENCE: # If the attribute is a # sequence, append the item # to the existing attribute reclist.remove(x) y = getattr(x, attr) y.append(item) setattr(x, attr, y) reclist.append(x) mapping_object[key] = reclist else: # Create a new record and add # it to the list n=record() setattr(n,attr,item) reclist.append(n) mapping_object[key]=reclist elif flags&RECORD: b=mapping_object[key] if flags&SEQUENCE: item=[item] if not hasattr(b,attr): # if it does not have the # attribute, set it setattr(b,attr,item) else: # it has the attribute so # append the item to it setattr(b,attr,getattr(b,attr)+item) else: # it is not a sequence so # set the attribute setattr(b,attr,item) else: # it is not a record or list of records found=mapping_object[key] if type(found) is lt: found.append(item) else: found=[found,item] mapping_object[key]=found else: # The dictionary does not have the key if flags&RECORDS: # Create a new record, set its attribute # and put it in the dictionary as a list a = record() if flags&SEQUENCE: item=[item] setattr(a,attr,item) mapping_object[key]=[a] elif flags&RECORD: # Create a new record, set its attribute # and put it in the dictionary if flags&SEQUENCE: item=[item] r = mapping_object[key]=record() setattr(r,attr,item) else: # it is not a record or list of records if flags&SEQUENCE: item=[item] mapping_object[key]=item else: # This branch is for case when no type was specified. mapping_object = form #Insert in dictionary if mapping_object.has_key(key): # it is not a record or list of records found=mapping_object[key] if type(found) is lt: found.append(item) else: found=[found,item] mapping_object[key]=found else: mapping_object[key]=item #insert defaults into form dictionary if defaults: for keys, values in defaults.items(): if not form.has_key(keys): # if the form does not have the key, # set the default form[keys]=values else: #The form has the key if getattr(values, '__class__',0) is record: # if the key is mapped to a record, get the # record r = form[keys] for k, v in values.__dict__.items(): # loop through the attributes and values # in the default dictionary if not hasattr(r, k): # if the form dictionary doesn't have # the attribute, set it to the default setattr(r,k,v) form[keys] = r elif values == type([]): # the key is mapped to a list l = form[keys] for x in values: # for each x in the list if getattr(x, '__class__',0) is record: # if the x is a record for k, v in x.__dict__.items(): # loop through each # attribute and value in # the record for y in l: # loop through each # record in the form # list if it doesn't # have the attributes # in the default # dictionary, set them if not hasattr(y, k): setattr(y, k, v) else: # x is not a record if not a in l: l.append(a) form[keys] = l else: # The form has the key, the key is not mapped # to a record or sequence so do nothing pass # Convert to tuples if tuple_items: for key in tuple_items.keys(): # Split the key and get the attr k=split(key, ".") k,attr=join(k[:-1], "."), k[-1] a = attr # remove any type_names in the attr while not a=='': a=split(a, ":") a,new=join(a[:-1], ":"), a[-1] attr = new if form.has_key(k): # If the form has the split key get its value item =form[k] if (hasattr(item, '__class__') and item.__class__ is record): # if the value is mapped to a record, check if it # has the attribute, if it has it, convert it to # a tuple and set it if hasattr(item,attr): value=tuple(getattr(item,attr)) setattr(item,attr,value) else: # It is mapped to a list of records for x in item: # loop through the records if hasattr(x, attr): # If the record has the attribute # convert it to a tuple and set it value=tuple(getattr(x,attr)) setattr(x,attr,value) else: # the form does not have the split key if form.has_key(key): # if it has the original key, get the item # convert it to a tuple item=form[key] item=tuple(form[key]) form[key]=item other.update(form) if meth: if environ.has_key('PATH_INFO'): path=environ['PATH_INFO'] while path[-1:]=='/': path=path[:-1] else: path='' other['PATH_INFO']=path="%s/%s" % (path,meth) self._hacked_path=1 def resolve_url(self, url): # Attempt to resolve a url into an object in the Zope # namespace. The url must be a fully-qualified url. The # method will return the requested object if it is found # or raise the same HTTP error that would be raised in # the case of a real web request. If the passed in url # does not appear to describe an object in the system # namespace (e.g. the host, port or script name dont # match that of the current request), a ValueError will # be raised. if find(url, self.script) != 0: raise ValueError, 'Different namespace.' path=url[len(self.script):] while path and path[0]=='/': path=path[1:] while path and path[-1]=='/': path=path[:-1] req=self.clone() rsp=req.response req['PATH_INFO']=path object=None # Try to traverse to get an object. Note that we call # the exception method on the response, but we don't # want to actually abort the current transaction # (which is usually the default when the exception # method is called on the response). try: object=req.traverse(path) except: rsp.exception(abort=0) if object is None: req.close() raise rsp.errmsg, sys.exc_value # The traversal machinery may return a "default object" # like an index_html document. This is not appropriate # in the context of the resolve_url method so we need # to ensure we are getting the actual object named by # the given url, and not some kind of default object. if hasattr(object, 'id'): if callable(object.id): name=object.id() else: name=object.id elif hasattr(object, '__name__'): name=object.__name__ else: name='' if name != os.path.split(path)[-1]: object=req.PARENTS[0] req.close() return object def clone(self): # Return a clone of the current request object # that may be used to perform object traversal. environ=self.environ.copy() environ['REQUEST_METHOD']='GET' if self._auth: environ['HTTP_AUTHORIZATION']=self._auth clone=HTTPRequest(None, environ, HTTPResponse(), clean=1) clone['PARENTS']=[self['PARENTS'][-1]] return clone def get_header(self, name, default=None): """Return the named HTTP header, or an optional default argument or None if the header is not found. Note that both original and CGI-ified header names are recognized, e.g. 'Content-Type', 'CONTENT_TYPE' and 'HTTP_CONTENT_TYPE' should all return the Content-Type header, if available. """ environ=self.environ name=upper(join(split(name,"-"),"_")) val=environ.get(name, None) if val is not None: return val if name[:5] != 'HTTP_': name='HTTP_%s' % name return environ.get(name, default) def __getitem__(self,key, default=_marker, # Any special internal marker will do URLmatch=regex.compile('URL[0-9]+$').match, BASEmatch=regex.compile('BASE[0-9]+$').match, ): """Get a variable value Return a value for the required variable name. The value will be looked up from one of the request data categories. The search order is environment variables, other variables, form data, and then cookies. """ #" other=self.other if other.has_key(key): if key=='REQUEST': return self return other[key] if key[:1]=='U' and URLmatch(key) >= 0: n=atoi(key[3:]) URL=other['URL'] for i in range(0,n): l=rfind(URL,'/') if l >= 0: URL=URL[:l] else: raise KeyError, key if len(URL) < len(self.base) and n > 1: raise KeyError, key other[key]=URL return URL if isCGI_NAME(key) or key[:5] == 'HTTP_': environ=self.environ if environ.has_key(key) and (not hide_key(key)): return environ[key] return '' if key=='REQUEST': return self if key[:1]=='B': if BASEmatch(key) >= 0: n=atoi(key[4:]) if n: n=n-1 if len(self.steps) < n: raise KeyError, key v=self.script while v[-1:]=='/': v=v[:-1] v=join([v]+self.steps[:n],'/') else: v=self.base while v[-1:]=='/': v=v[:-1] other[key]=v return v if key=='BODY' and self._file is not None: p=self._file.tell() self._file.seek(0) v=self._file.read() self._file.seek(p) self.other[key]=v return v if key=='BODYFILE' and self._file is not None: v=self._file self.other[key]=v return v v=self.common.get(key, default) if v is not _marker: return v raise KeyError, key __getattr__=get=__getitem__ def has_key(self, key): try: self[key] except: return 0 else: return 1 def keys(self): keys = {} keys.update(self.common) for key in self.environ.keys(): if (isCGI_NAME(key) or key[:5] == 'HTTP_') and \ (not hide_key(key)): keys[key] = 1 n=0 while 1: n=n+1 key = "URL%s" % n if not self.has_key(key): break n=0 while 1: n=n+1 key = "BASE%s" % n if not self.has_key(key): break keys.update(self.other) keys=keys.keys() keys.sort() return keys def __str__(self): result="

    form

    " row='' for k,v in self.form.items(): result=result + row % (k,v) result=result+"
    %s%s

    cookies

    " for k,v in self.cookies.items(): result=result + row % (k,v) result=result+"

    other

    " for k,v in self.other.items(): if k in ('PARENTS','RESPONSE'): continue result=result + row % (k,v) for n in "0123456789": key = "URL%s"%n try: result=result + row % (key,self[key]) except KeyError: pass for n in "0123456789": key = "BASE%s"%n try: result=result + row % (key,self[key]) except KeyError: pass result=result+"

    environ

    " for k,v in self.environ.items(): if not hide_key(k): result=result + row % (k,v) return result+"
    " __repr__=__str__ def _authUserPW(self): global base64 auth=self._auth if auth: if lower(auth[:6]) == 'basic ': if base64 is None: import base64 [name,password] = split( base64.decodestring(split(auth)[-1]), ':') return name, password base64=None def sane_environment(env): # return an environment mapping which has been cleaned of # funny business such as REDIRECT_ prefixes added by Apache # or HTTP_CGI_AUTHORIZATION hacks. dict={} for key, val in env.items(): while key[:9]=='REDIRECT_': key=key[9:] dict[key]=val if dict.has_key('HTTP_CGI_AUTHORIZATION'): dict['HTTP_AUTHORIZATION']=dict['HTTP_CGI_AUTHORIZATION'] try: del dict['HTTP_CGI_AUTHORIZATION'] except: pass return dict def str_field(v): if type(v) is ListType: return map(str_field,v) if hasattr(v,'__class__') and v.__class__ is FieldStorage: v=v.value elif type(v) is not StringType: if hasattr(v,'file') and v.file: v=v.file elif hasattr(v,'value'): v=v.value return v class FileUpload: '''\ File upload objects File upload objects are used to represent file-uploaded data. File upload objects can be used just like files. In addition, they have a 'headers' attribute that is a dictionary containing the file-upload headers, and a 'filename' attribute containing the name of the uploaded file. ''' def __init__(self, aFieldStorage): file=aFieldStorage.file if hasattr(file, '__methods__'): methods=file.__methods__ else: methods= ['close', 'fileno', 'flush', 'isatty', 'read', 'readline', 'readlines', 'seek', 'tell', 'truncate', 'write', 'writelines'] d=self.__dict__ for m in methods: if hasattr(file,m): d[m]=getattr(file,m) self.headers=aFieldStorage.headers self.filename=aFieldStorage.filename parse_cookie_lock=allocate_lock() def parse_cookie(text, result=None, qparmre=regex.compile( '\([\0- ]*' '\([^\0- ;,=\"]+\)="\([^"]*\)\"' '\([\0- ]*[;,]\)?[\0- ]*\)' ), parmre=regex.compile( '\([\0- ]*' '\([^\0- ;,=\"]+\)=\([^\0- ;,\"]*\)' '\([\0- ]*[;,]\)?[\0- ]*\)' ), acquire=parse_cookie_lock.acquire, release=parse_cookie_lock.release, ): if result is None: result={} already_have=result.has_key acquire() try: if qparmre.match(text) >= 0: # Match quoted correct cookies name=qparmre.group(2) value=qparmre.group(3) l=len(qparmre.group(1)) elif parmre.match(text) >= 0: # Match evil MSIE cookies ;) name=parmre.group(2) value=parmre.group(3) l=len(parmre.group(1)) else: # this may be an invalid cookie. # We'll simply bail without raising an error # if the cookie is invalid. return result finally: release() if not already_have(name): result[name]=value return apply(parse_cookie,(text[l:],result)) # add class class record: def __str__(self): L1 = self.__dict__.items() L1.sort() return join(map(lambda item: "%s: %s" %item, L1), ", ") __repr__ = __str__ # Flags SEQUENCE=1 DEFAULT=2 RECORD=4 RECORDS=8 REC=RECORD|RECORDS EMPTY=16 CONVERTED=32 Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/HTTPResponse.py100644 1007 1403 64042 6763071214 23366 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## '''CGI Response Output formatter $Id: HTTPResponse.py,v 1.20 1999/09/01 00:25:48 brian Exp $''' __version__='$Revision: 1.20 $'[11:-2] import string, types, sys, regex from string import find, rfind, lower, upper, strip, split, join, translate from types import StringType, InstanceType from BaseResponse import BaseResponse nl2sp=string.maketrans('\n',' ') status_reasons={ 100: 'Continue', 101: 'Switching Protocols', 102: 'Processing', 200: 'OK', 201: 'Created', 202: 'Accepted', 203: 'Non-Authoritative Information', 204: 'No Content', 205: 'Reset Content', 206: 'Partial Content', 207: 'Multi-Status', 300: 'Multiple Choices', 301: 'Moved Permanently', 302: 'Moved Temporarily', 303: 'See Other', 304: 'Not Modified', 305: 'Use Proxy', 307: 'Temporary Redirect', 400: 'Bad Request', 401: 'Unauthorized', 402: 'Payment Required', 403: 'Forbidden', 404: 'Not Found', 405: 'Method Not Allowed', 406: 'Not Acceptable', 407: 'Proxy Authentication Required', 408: 'Request Time-out', 409: 'Conflict', 410: 'Gone', 411: 'Length Required', 412: 'Precondition Failed', 413: 'Request Entity Too Large', 414: 'Request-URI Too Large', 415: 'Unsupported Media Type', 416: 'Requested range not satisfiable', 417: 'Expectation Failed', 422: 'Unprocessable Entity', 423: 'Locked', 424: 'Failed Dependency', 500: 'Internal Server Error', 501: 'Not Implemented', 502: 'Bad Gateway', 503: 'Service Unavailable', 504: 'Gateway Time-out', 505: 'HTTP Version not supported', 507: 'Insufficient Storage', } status_codes={} # Add mappings for builtin exceptions and # provide text -> error code lookups. for key, val in status_reasons.items(): status_codes[lower(join(split(val, ' '), ''))]=key status_codes[lower(val)]=key status_codes[key]=key en=filter(lambda n: n[-5:]=='Error', dir(__builtins__)) for name in map(lower, en): status_codes[name]=500 status_codes['nameerror']=503 status_codes['keyerror']=503 status_codes['redirect']=300 end_of_header_search=regex.compile('',regex.casefold).search accumulate_header={'set-cookie': 1}.has_key class HTTPResponse(BaseResponse): """\ An object representation of an HTTP response. The Response type encapsulates all possible responses to HTTP requests. Responses are normally created by the object publisher. A published object may recieve the response abject as an argument named 'RESPONSE'. A published object may also create it's own response object. Normally, published objects use response objects to: - Provide specific control over output headers, - Set cookies, or - Provide stream-oriented output. If stream oriented output is used, then the response object passed into the object must be used. """ #' accumulated_headers='' body='' realm='Zope' _error_format='text/html' def __init__(self,body='',status=200,headers=None, stdout=sys.stdout, stderr=sys.stderr,): '''\ Creates a new response. In effect, the constructor calls "self.setBody(body); self.setStatus(status); for name in headers.keys(): self.setHeader(name, headers[name])" ''' if headers is None: headers={} self.headers=headers if status==200: self.status=200 self.errmsg='OK' headers['status']="200 OK" else: self.setStatus(status) self.base='' if body: self.setBody(body) self.cookies={} self.stdout=stdout self.stderr=stderr def retry(self): """Return a response object to be used in a retry attempt """ # This implementation is a bit lame, because it assumes that # only stdout stderr were passed to the constructor. OTOH, I # think that that's all that is ever passed. return self.__class__(stdout=self.stdout, stderr=self.stderr) def setStatus(self, status, reason=None): '''\ Sets the HTTP status code of the response; the argument may either be an integer or a string from { OK, Created, Accepted, NoContent, MovedPermanently, MovedTemporarily, NotModified, BadRequest, Unauthorized, Forbidden, NotFound, InternalError, NotImplemented, BadGateway, ServiceUnavailable } that will be converted to the correct integer value. ''' if type(status) is types.StringType: status=lower(status) if status_codes.has_key(status): status=status_codes[status] else: status=500 self.status=status if reason is None: if status_reasons.has_key(status): reason=status_reasons[status] else: reason='Unknown' self.setHeader('Status', "%d %s" % (status,str(reason))) self.errmsg=reason def setHeader(self, name, value, literal=0): '''\ Sets an HTTP return header "name" with value "value", clearing the previous value set for the header, if one exists. If the literal flag is true, the case of the header name is preserved, otherwise word-capitalization will be performed on the header name on output.''' key=lower(name) if accumulate_header(key): self.accumulated_headers=( "%s%s: %s\n" % (self.accumulated_headers, name, value)) return name=literal and name or key self.headers[name]=value def addHeader(self, name, value): '''\ Set a new HTTP return header with the given value, while retaining any previously set headers with the same name.''' self.accumulated_headers=( "%s%s: %s\n" % (self.accumulated_headers, name, value)) __setitem__=setHeader def setBody(self, body, title='', is_error=0, bogus_str_search=regex.compile(" [a-fA-F0-9]+>$").search, ): '''\ Set the body of the response Sets the return body equal to the (string) argument "body". Also updates the "content-length" return header. You can also specify a title, in which case the title and body will be wrapped up in html, head, title, and body tags. If the body is a 2-element tuple, then it will be treated as (title,body) If is_error is true then the HTML will be formatted as a Zope error message instead of a generic HTML page. ''' if not body: return self if type(body) is types.TupleType and len(body) == 2: title,body=body if type(body) is not types.StringType: if hasattr(body,'asHTML'): body=body.asHTML() body=str(body) l=len(body) if (find(body,'>')==l-1 and body[:1]=='<' and l < 200 and bogus_str_search(body) > 0): self.notFoundError(body[1:-1]) else: if(title): if not is_error: self.body=self._html(str(title), str(body)) else: self.body=self._error_html(str(title), str(body)) else: self.body=str(body) self.insertBase() return self def setBase(self,base): 'Set the base URL for the returned document.' if base[-1:] != '/': base=base+'/' self.base=base self.insertBase() def insertBase(self, base_re_search=regex.compile('\(]+>\)', regex.casefold).search ): if (self.headers.has_key('content-type') and self.headers['content-type']!='text/html'): return if self.base: body=self.body if body: e=end_of_header_search(body) if e >= 0: b=base_re_search(body) if b < 0: self.body=('%s\t\n%s' % (body[:e],self.base,body[e:])) def appendCookie(self, name, value): '''\ Returns an HTTP header that sets a cookie on cookie-enabled browsers with a key "name" and value "value". If a value for the cookie has previously been set in the response object, the new value is appended to the old one separated by a colon. ''' cookies=self.cookies if cookies.has_key(name): cookie=cookies[name] else: cookie=cookies[name]={} if cookie.has_key('value'): cookie['value']='%s:%s' % (cookie['value'], value) else: cookie['value']=value def expireCookie(self, name, **kw): '''\ Cause an HTTP cookie to be removed from the browser The response will include an HTTP header that will remove the cookie corresponding to "name" on the client, if one exists. This is accomplished by sending a new cookie with an expiration date that has already passed. Note that some clients require a path to be specified - this path must exactly match the path given when creating the cookie. The path can be specified as a keyword argument. ''' dict={'max_age':0, 'expires':'Wed, 31-Dec-97 23:59:59 GMT'} for k, v in kw.items(): dict[k]=v apply(HTTPResponse.setCookie, (self, name, 'deleted'), dict) def setCookie(self,name,value,**kw): '''\ Set an HTTP cookie on the browser The response will include an HTTP header that sets a cookie on cookie-enabled browsers with a key "name" and value "value". This overwrites any previously set value for the cookie in the Response object. ''' cookies=self.cookies if cookies.has_key(name): cookie=cookies[name] else: cookie=cookies[name]={} for k, v in kw.items(): cookie[k]=v cookie['value']=value def appendHeader(self, name, value, delimiter=","): '''\ Append a value to a cookie Sets an HTTP return header "name" with value "value", appending it following a comma if there was a previous value set for the header. ''' headers=self.headers if headers.has_key(name): h=self.header[name] h="%s%s\n\t%s" % (h,delimiter,value) else: h=value self.setHeader(name,h) def isHTML(self,str): return lower(strip(str)[:6]) == '' or find(str,' 0 def quoteHTML(self,text, subs={'&':'&', "<":'<', ">":'>', '\"':'"'} ): for ent in '&<>\"': if find(text, ent) >= 0: text=join(split(text,ent),subs[ent]) return text def format_exception(self,etype,value,tb,limit=None): import traceback result=['Traceback (innermost last):'] if limit is None: if hasattr(sys, 'tracebacklimit'): limit = sys.tracebacklimit n = 0 while tb is not None and (limit is None or n < limit): f = tb.tb_frame lineno = tb.tb_lineno co = f.f_code filename = co.co_filename name = co.co_name locals=f.f_locals result.append(' File %s, line %d, in %s' % (filename,lineno,name)) try: result.append(' (Object: %s)' % locals[co.co_varnames[0]].__name__) except: pass try: result.append(' (Info: %s)' % str(locals['__traceback_info__'])) except: pass tb = tb.tb_next n = n+1 result.append(join(traceback.format_exception_only(etype, value), ' ')) return result def _traceback(self,t,v,tb): tb=self.format_exception(t,v,tb,200) tb=join(tb,'\n') tb=self.quoteHTML(tb) if self.debug_mode: _tbopen, _tbclose = '
    ', '
    ' else: _tbopen, _tbclose = '' return "\n%s\n%s\n%s" % (_tbopen, tb, _tbclose) def redirect(self, location): """Cause a redirection without raising an error""" self.status=302 headers=self.headers headers['status']='302 Moved Temporarily' headers['location']=location return location def _html(self,title,body): return ("\n" "\n%s\n\n" "\n%s\n\n" "\n" % (title,body)) def _error_html(self,title,body): # XXX could this try to use standard_error_message somehow? return ("""\ Zope Error
     

    Zope Error

    Zope has encountered an error while publishing this resource.

    """ + \ """

    %s

    %s""" %(title,body) + \ """

    Troubleshooting Suggestions

    • The URL may be incorrect.
    • The parameters passed to this resource may be incorrect.
    • A resource that this resource relies on may be encountering an error.

    For more detailed information about the error, please refer to the HTML source for this page.

    If the error persists please contact the site maintainer. Thank you for your patience.

    """) def notFoundError(self,entry='who knows!'): raise 'NotFound',self._error_html( "Resource not found", "Sorry, the requested Zope resource does not exist.

    " + "Check the URL and try again.

    " + "\n" % entry) forbiddenError=notFoundError # If a resource is forbidden, # why reveal that it exists? def debugError(self,entry): raise 'NotFound',self._error_html( "Debugging Notice", "Zope has encountered a problem publishing your object.

    " "\n%s" % entry) def badRequestError(self,name): if regex.match('^[A-Z_0-9]+$',name) >= 0: raise 'InternalError', self._error_html( "Internal Error", "Sorry, an internal error occurred in this Zope resource.") raise 'BadRequest',self._error_html( "Invalid request", "The parameter, %s, " % name + "was omitted from the request.

    " + "Make sure to specify all required parameters, " + "and try the request again." ) def _unauthorized(self): realm=self.realm if realm: self['WWW-authenticate']='basic realm="%s"' % realm def unauthorized(self): self._unauthorized() m="You are not authorized to access this resource." if self.debug_mode: if self._auth: m=m+'

    \nUsername and password are not correct.' else: m=m+'

    \nNo Authorization header found.' raise 'Unauthorized', m def exception(self, fatal=0, info=None, absuri_match=regex.compile( "^" "\(/\|\([a-zA-Z0-9+.-]+:\)\)" "[^\000- \"\\#<>]*" "\\(#[^\000- \"\\#<>]*\\)?" "$" ).match, tag_search=regex.compile('[a-zA-Z]>').search, abort=1 ): if type(info) is type(()) and len(info)==3: t,v,tb = info else: t,v,tb = sys.exc_info() if str(t)=='Unauthorized': self._unauthorized() stb=tb # Abort running transaction, if any if abort: try: get_transaction().abort() except: pass try: # Try to capture exception info for bci calls et=translate(str(t),nl2sp) self.setHeader('bobo-exception-type',et) ev=translate(str(v),nl2sp) if find(ev,'') >= 0: ev='bobo exception' self.setHeader('bobo-exception-value',ev[:255]) # Get the tb tail, which is the interesting part: while tb.tb_next is not None: tb=tb.tb_next el=str(tb.tb_lineno) ef=str(tb.tb_frame.f_code.co_filename) self.setHeader('bobo-exception-file',ef) self.setHeader('bobo-exception-line',el) except: # Dont try so hard that we cause other problems ;) pass tb=stb stb=None self.setStatus(t) if self.status >= 300 and self.status < 400: if type(v) == types.StringType and absuri_match(v) >= 0: if self.status==300: self.setStatus(302) self.setHeader('location', v) tb=None return self else: try: l,b=v if type(l) == types.StringType and absuri_match(l) >= 0: if self.status==300: self.setStatus(302) self.setHeader('location', l) self.setBody(b) tb=None return self except: pass b=v if isinstance(b,Exception): b=str(b) if fatal and t is SystemExit and v.code==0: tb=self.setBody( (str(t), 'Zope has exited normally.

    ' + self._traceback(t,v,tb)), is_error=1) #elif 1: self.setBody(v) elif type(b) is not types.StringType or tag_search(b) < 0: tb=self.setBody( (str(t), 'Sorry, a Zope error occurred.

    '+ self._traceback(t,v,tb)), is_error=1) elif lower(strip(b))[:6]=='' or lower(strip(b))[:14]=='',regex.casefold).search, ): if self._wrote: return '' # Streaming output was used. headers=self.headers body=self.body if body: isHTML=self.isHTML(body) if not headers.has_key('content-type'): if isHTML: c='text/html' else: c='text/plain' self.setHeader('content-type',c) else: isHTML = headers['content-type']=='text/html' if isHTML and end_of_header_search(self.body) < 0: lhtml=html_search(body) if lhtml >= 0: lhtml=lhtml+6 body='%s\n%s' % (body[:lhtml],body[lhtml:]) else: body='\n' + body self.setBody(body) body=self.body # if not headers.has_key('content-type') and self.status == 200: # self.setStatus('nocontent') if not headers.has_key('content-length') and \ not headers.has_key('transfer-encoding'): self.setHeader('content-length',len(body)) headersl=[] append=headersl.append # status header must come first. append("Status: %s" % headers.get('status', '200 OK')) append("X-Powered-By: Zope (www.zope.org), Python (www.python.org)") if headers.has_key('status'): del headers['status'] for key, val in headers.items(): if lower(key)==key: # only change non-literal header names key="%s%s" % (upper(key[:1]), key[1:]) start=0 l=find(key,'-',start) while l >= start: key="%s-%s%s" % (key[:l],upper(key[l+1:l+2]),key[l+2:]) start=l+1 l=find(key,'-',start) append("%s: %s" % (key, val)) if self.cookies: headersl=headersl+self._cookie_list() headersl[len(headersl):]=[self.accumulated_headers, body] return join(headersl,'\n') def write(self,data): """\ Return data as a stream HTML data may be returned using a stream-oriented interface. This allows the browser to display partial results while computation of a response to proceed. The published object should first set any output headers or cookies on the response object. Note that published objects must not generate any errors after beginning stream-oriented output. """ self.body=self.body+data headers=self.headers if headers.has_key('content-length'): del headers['content-length'] if not self.headers.has_key('content-type'): self.setHeader('content-type', 'text/html') self.insertBase() body=self.body self.body='' self.write=write=self.stdout.write try: self.flush=self.stdout.flush except: pass write(str(self)) self._wrote=1 write(body) Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/Publish.py100644 1007 1403 32537 6765474027 22515 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__="""Python Object Publisher -- Publish Python objects on web servers $Id: Publish.py,v 1.142 1999/09/08 14:52:07 brian Exp $""" __version__='$Revision: 1.142 $'[11:-2] import sys, os from string import lower, atoi, rfind, strip from Response import Response from Request import Request from maybe_lock import allocate_lock from mapply import mapply class Retry(Exception): """Raise this to retry a request """ def call_object(object, args, request): result=apply(object,args) # Type s to step into published object. return result def missing_name(name, request): if name=='self': return request['PARENTS'][0] request.response.badRequestError(name) def dont_publish_class(klass, request): request.response.forbiddenError("class %s" % klass.__name__) def publish(request, module_name, after_list, debug=0, # Optimize: call_object=call_object, missing_name=missing_name, dont_publish_class=dont_publish_class, mapply=mapply, ): (bobo_before, bobo_after, object, realm, debug_mode, err_hook, have_transactions)= get_module_info(module_name) parents=None try: request.processInputs() request_get=request.get response=request.response # First check for "cancel" redirect: cancel='' if lower(strip(request_get('SUBMIT','')))=='cancel': cancel=request_get('CANCEL_ACTION','') if cancel: raise 'Redirect', cancel after_list[0]=bobo_after if debug_mode: response.debug_mode=debug_mode if realm and not request.get('REMOTE_USER',None): response.realm=realm if bobo_before is not None: bobo_before(); # Get a nice clean path list: path=strip(request_get('PATH_INFO')) request['PARENTS']=parents=[object] if have_transactions: get_transaction().begin() object=request.traverse(path) # Record transaction meta-data if have_transactions: get_transaction().note(request_get('PATH_INFO')) auth_user=request_get('AUTHENTICATED_USER',None) if auth_user is not None: get_transaction().setUser(auth_user, request_get('AUTHENTICATION_PATH')) result=mapply(object, request.args, request, call_object,1, missing_name, dont_publish_class, request, bind=1) if result is not response: response.setBody(result) if have_transactions: get_transaction().commit() return response except: if err_hook is not None: if parents: parents=parents[0] try: return err_hook(parents, request, sys.exc_info()[0], sys.exc_info()[1], sys.exc_info()[2], ) except Retry: # We need to try again.... if not request.supports_retry(): return err_hook(parents, request, sys.exc_info()[0], sys.exc_info()[1], sys.exc_info()[2], ) newrequest=request.retry() try: return publish(newrequest, module_name, after_list, debug) finally: newrequest.close() else: raise def publish_module(module_name, stdin=sys.stdin, stdout=sys.stdout, stderr=sys.stderr, environ=os.environ, debug=0, request=None, response=None): must_die=0 status=200 after_list=[None] try: try: if response is None: response=Response(stdout=stdout, stderr=stderr) else: stdout=response.stdout if request is None: request=Request(stdin, environ, response) response = publish(request, module_name, after_list, debug=debug) except SystemExit, v: must_die=sys.exc_info() response.exception(must_die) except ImportError, v: if type(v) is type(()) and len(v)==3: must_die=v elif hasattr(sys, 'exc_info'): must_die=sys.exc_info() else: must_die = SystemExit, v, sys.exc_info()[2] response.exception(1, v) except: response.exception() status=response.getStatus() if response: response=str(response) if response: stdout.write(response) # The module defined a post-access function, call it if after_list[0] is not None: after_list[0]() finally: if request is not None: request.close() if must_die: try: raise must_die[0], must_die[1], must_die[2] finally: must_die=None return status _l=allocate_lock() def get_module_info(module_name, modules={}, acquire=_l.acquire, release=_l.release, ): if modules.has_key(module_name): return modules[module_name] if module_name[-4:]=='.cgi': module_name=module_name[:-4] acquire() tb=None try: try: module=__import__(module_name, globals(), globals(), ('__doc__',)) realm=module_name # Let the app specify a realm if hasattr(module,'__bobo_realm__'): realm=module.__bobo_realm__ elif os.environ.has_key('Z_REALM'): realm=os.environ['Z_REALM'] elif os.environ.has_key('BOBO_REALM'): realm=os.environ['BOBO_REALM'] else: realm=module_name # Check for debug mode if hasattr(module,'__bobo_debug_mode__'): debug_mode=not not module.__bobo_debug_mode__ elif (os.environ.has_key('Z_DEBUG_MODE') or os.environ.has_key('BOBO_DEBUG_MODE')): if os.environ.has_key('Z_DEBUG_MODE'): debug_mode=lower(os.environ['Z_DEBUG_MODE']) else: debug_mode=lower(os.environ['BOBO_DEBUG_MODE']) if debug_mode=='y' or debug_mode=='yes': debug_mode=1 else: try: debug_mode=atoi(debug_mode) except: debug_mode=None else: debug_mode=None if hasattr(module,'__bobo_before__'): bobo_before=module.__bobo_before__ else: bobo_before=None if hasattr(module,'__bobo_after__'): bobo_after=module.__bobo_after__ else: bobo_after=None if hasattr(module,'bobo_application'): object=module.bobo_application elif hasattr(module,'web_objects'): object=module.web_objects else: object=module error_hook=getattr(module,'zpublisher_exception_hook', None) try: get_transaction() except: have_transactions=0 else: have_transactions=1 info= (bobo_before, bobo_after, object, realm, debug_mode, error_hook, have_transactions) modules[module_name]=modules[module_name+'.cgi']=info return info except: t,v,tb=sys.exc_info() v=str(v) raise ImportError, (t, v), tb finally: tb=None release() # ZPublisher profiler support # --------------------------- if os.environ.get('PROFILE_PUBLISHER', None): import profile, pstats _pfile=os.environ['PROFILE_PUBLISHER'] _plock=allocate_lock() _pfunc=publish_module _pstat=None def pm(module_name, stdin, stdout, stderr, environ, debug, request, response): try: r=_pfunc(module_name, stdin=stdin, stdout=stdout, stderr=stderr, environ=environ, debug=debug, request=request, response=response) except: r=None sys._pr_=r def publish_module(module_name, stdin=sys.stdin, stdout=sys.stdout, stderr=sys.stderr, environ=os.environ, debug=0, request=None, response=None): _plock.acquire() try: if request is not None: path_info=request.get('PATH_INFO') else: path_info=environ.get('PATH_INFO') if path_info[-14:]=='manage_profile': return _pfunc(module_name, stdin=stdin, stdout=stdout, stderr=stderr, environ=environ, debug=debug, request=request, response=response) pobj=profile.Profile() pobj.runcall(pm, module_name, stdin, stdout, stderr, environ, debug, request, response) result=sys._pr_ pobj.create_stats() if _pstat is None: global _pstat _pstat=sys._ps_=pstats.Stats(pobj) else: _pstat.add(pobj) finally: _plock.release() if result is None: try: error=sys.exc_info() file=open(_pfile, 'w') sys.stdout=file _pstat.strip_dirs().sort_stats('cumulative').print_stats(250) _pstat.strip_dirs().sort_stats('time').print_stats(250) file.flush() file.close() except: pass raise error[0], error[1], error[2] return result Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/Request.py100644 1007 1403 7435 6671334670 22511 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import HTTPRequest Request=HTTPRequest.HTTPRequest del HTTPRequest Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/Response.py100644 1007 1403 7442 6671334670 22655 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## import HTTPResponse Response=HTTPResponse.HTTPResponse del HTTPResponse Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/Test.py100644 1007 1403 36014 6764040431 22003 0ustar petrillipetrilli#!/bin/sh """:" exec python $0 ${1+"$@"} """ #" Waaaa ############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __doc__='''Command-line Bobo Usage bobo [options] module_path [path_info] where: module_path -- is a full path to a published module path_info -- Is the information after the module name that would normally be specified in a GET URL, including a query string. Description The command-line interface to Bobo provides a handy way to test, debug, and profile Bobo without a web server. Options -u username:password -- Supply HTTP authorization information -e name=value -- Supply environment variables. Use a seperate -e option for each variable specified. -p profiler_data_file -- Run under profiler control, generating the profiler data file, profiler_data_file. -t -- Compute the time required to complete a request, in milliseconds. -r n -- Specify a repeat count for timing or profiling. -d -- Run in debug mode. With this option, bobo will run under Python debugger control. Two useful breakpoints are set. The first is at the beginning of the module publishing code. Steping through this code shows how bobo finds objects and obtains certain meta-data. The second breakpoint is at the point just before the published object is called. To jump to the second breakpoint, you must enter 's' followed by a carriage return to step into the module, then enter a 'c' followed by a carriage return to jump to the first breakpoint and then another 'c' followed by a carriage return to jump to the point where the object is called. Finally, enter 's' followed a carriage return. -s Don\'t generate any output Examples For example, to debug a published object (such as a method), spam, the following might be entered:: bobo -d /prj/lib/python/mymod container/spam s c c s $Id: Test.py,v 1.35 1999/09/03 21:43:53 jim Exp $ ''' __version__='$Revision: 1.35 $'[11:-2] import sys, traceback, profile, os, getopt, string from time import clock repeat_count=100 def main(): import sys, os, getopt, string global repeat_count try: optlist,args=getopt.getopt(sys.argv[1:], 'dtu:p:r:e:s') if len(args) < 1 or len(args) > 2: raise TypeError, None elif len(args)==1: args=args[0],'/' path_info=args[1] except: sys.stderr.write(__doc__) sys.exit(-1) silent=profile=u=debug=timeit=None env={} for opt,val in optlist: if opt=='-d': debug=1 if opt=='-s': silent=1 if opt=='-t': timeit=1 if opt=='-u': u=val elif opt=='-p': profile=val elif opt=='-r': repeat_count=string.atoi(val) elif opt=='-e': opt=string.find(val,'=') if opt <= 0: raise 'Invalid argument to -e', val env[val[:opt]]=val[opt+1:] if (debug or 0)+(timeit or 0)+(profile and 1 or 0) > 1: raise 'Invalid options', 'only one of -p, -t, and -d are allowed' module=args[0] publish(module,path_info,u=u,p=profile,d=debug,t=timeit,e=env, s=silent) def time(function,*args,**kwargs): repeat_range=range(repeat_count) apply(function,args,kwargs) t=clock() for i in repeat_range: apply(function,args,kwargs) t=(clock()-t)*1000.0 return float(t)/len(repeat_range) def run(statement, *args): import sys, profile, time prof = profile.Profile(time.time) try: prof = prof.run(statement) except SystemExit: pass if args: prof.dump_stats(args[0]) else: return prof.print_stats() def publish_module(module_name, stdin=sys.stdin, stdout=sys.stdout, stderr=sys.stderr, environ=os.environ, debug=0, request=None, response=None, extra={}): must_die=0 status=200 after_list=[None] from Response import Response from Request import Request from Publish import publish try: try: if response is None: response=Response(stdout=stdout, stderr=stderr) else: stdout=response.stdout if request is None: request=Request(stdin, environ, response) for k, v in extra.items(): request[k]=v response = publish(request, module_name, after_list, debug=debug) except SystemExit, v: if hasattr(sys, 'exc_info'): must_die=sys.exc_info() else: must_die = SystemExit, v, sys.exc_info()[2] response.exception(must_die) except ImportError, v: if type(v) is type(()) and len(v)==3: must_die=v elif hasattr(sys, 'exc_info'): must_die=sys.exc_info() else: must_die = SystemExit, v, sys.exc_info()[2] response.exception(1, v) except: response.exception() status=response.getStatus() if response: response=str(response) if response: stdout.write(response) # The module defined a post-access function, call it if after_list[0] is not None: after_list[0]() finally: if request is not None: request.close() if must_die: try: raise must_die[0], must_die[1], must_die[2] finally: must_die=None return status def publish_module_pm(module_name, stdin=sys.stdin, stdout=sys.stdout, stderr=sys.stderr, environ=os.environ, debug=0,extra={}): from Response import Response from Request import Request from Publish import publish after_list=[None] response=Response(stdout=stdout, stderr=stderr) request=Request(stdin, environ, response) for k, v in extra.items(): request[k]=v response = publish(request, module_name, after_list, debug=debug) try: from codehack import getlineno except: def getlineno(code): return code.co_firstlineno defaultModule='Main' def publish(script=None,path_info='/', u=None,p=None,d=None,t=None,e=None,s=None,pm=0, extra=None, request_method='GET', stdin=sys.stdin): profile=p debug=d timeit=t silent=s if e is None: e={} if extra is None: extra={} if script is None: script=defaultModule if script[0]=='+': script='../../lib/python/'+script[1:] env=e env['SERVER_NAME']='bobo.server' env['SERVER_PORT']='80' env['REQUEST_METHOD']=request_method env['REMOTE_ADDR']='204.183.226.81 ' env['REMOTE_HOST']='bobo.remote.host' env['HTTP_USER_AGENT']='Bobo/%s' % __version__ env['HTTP_HOST']='127.0.0.1' env['SERVER_SOFTWARE']='Bobo/%s' % __version__ env['SERVER_PROTOCOL']='HTTP/1.0 ' env['HTTP_ACCEPT']='image/gif, image/x-xbitmap, image/jpeg, */* ' env['SERVER_HOSTNAME']='bobo.server.host' env['GATEWAY_INTERFACE']='CGI/1.1 ' env['SCRIPT_NAME']=script p=string.split(path_info,'?') if len(p)==1: env['PATH_INFO'] = p[0] elif len(p)==2: [env['PATH_INFO'], env['QUERY_STRING']]=p else: raise TypeError, '' if u: import base64 env['HTTP_AUTHORIZATION']="Basic %s" % base64.encodestring(u) dir,file=os.path.split(script) cdir=os.path.join(dir,'Components') sys.path[0:0]=[dir,cdir,os.path.join(cdir,sys.platform)] # We delay import to here, in case Publish is part of the # application distribution. if profile: import __main__ __main__.publish_module=publish_module __main__.file=file __main__.env=env __main__.extra=extra print profile publish_module(file, environ=env, stdout=open('/dev/null','w'), extra=extra, stdin=stdin) c=("for i in range(%s): " "publish_module(file, environ=env, stdout=open('/dev/null','w')," "extra=extra)" % repeat_count ) if profile: run(c,profile) else: run(c) elif debug: import Publish from Publish import publish, call_object import pdb class Pdb(pdb.Pdb): def do_pub(self,arg): if hasattr(self,'done_pub'): print 'pub already done.' else: self.do_s('') self.do_s('') self.do_c('') self.done_pub=1 def do_ob(self,arg): if hasattr(self,'done_ob'): print 'ob already done.' else: self.do_pub('') self.do_c('') self.done_ob=1 db=Pdb() def fbreak(db,meth): try: meth=meth.im_func except AttributeError: pass code=meth.func_code lineno = getlineno(code) filename = code.co_filename db.set_break(filename,lineno) fbreak(db,publish) fbreak(db,call_object) dbdata={'breakpoints':(), 'env':env, 'extra': extra} b='' try: b=open('.bobodb','r').read() except: pass if b: exec b in dbdata for b in dbdata['breakpoints']: if type(b) is type(()): apply(db.set_break,b) else: fbreak(db,b) db.prompt='pdb> ' # db.set_continue() print ( '* Type "sc" to jump to beginning of real publishing process.\n' '* Then type c to jump to the beginning of the URL traversal\n' ' algorithm.\n' '* Then type c to jump to published object call.' ) db.run('publish_module(file,environ=env,debug=1,extra=extra,' ' stdin=stdin)', Publish.__dict__, {'publish_module': publish_module, 'file':file, 'env':env, 'extra': extra, 'stdin': stdin}) elif timeit: stdout=sys.stdout t= time(publish_module,file, stdout=open('/dev/null','w'), environ=env, extra=extra) stdout.write('%s milliseconds\n' % t) elif pm: stdout=sys.stdout publish_module_pm(file, environ=env, stdout=stdout, extra=extra) print '\n%s\n' % ('_'*60) else: if silent: stdout=open('/dev/null','w') else: stdout=sys.stdout publish_module(file, environ=env, stdout=stdout, extra=extra) print '\n%s\n' % ('_'*60) if __name__ == "__main__": main() Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/__init__.py100644 1007 1403 10242 6752100352 22612 0ustar petrillipetrilli############################################################################## # # Zope Public License (ZPL) Version 1.0 # ------------------------------------- # # Copyright (c) Digital Creations. All rights reserved. # # This license has been certified as Open Source(tm). # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope # in any manner possible. Zope includes a "Powered by Zope" # button that is installed by default. While it is not a license # violation to remove this button, it is requested that the # attribution remain. A significant investment has been put # into Zope, and this effort will continue if the Zope community # continues to grow. This is one way to assure that growth. # # 4. All advertising materials and documentation mentioning # features derived from or use of this software must display # the following acknowledgement: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # In the event that the product being advertised includes an # intact Zope distribution (with copyright and license included) # then this clause is waived. # # 5. Names associated with Zope or Digital Creations must not be used to # endorse or promote products derived from this software without # prior written permission from Digital Creations. # # 6. Modified redistributions of any form whatsoever must retain # the following acknowledgment: # # "This product includes software developed by Digital Creations # for use in the Z Object Publishing Environment # (http://www.zope.org/)." # # Intact (re-)distributions of any official Zope release do not # require an external acknowledgement. # # 7. Modifications are encouraged but must be packaged separately as # patches to official Zope releases. Distributions that do not # clearly separate the patches from the original work must be clearly # labeled as unofficial distributions. Modifications which do not # carry the name Zope may be packaged in any form, as long as they # conform to all of the clauses above. # # # Disclaimer # # THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY # EXPRESSED 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 DIGITAL CREATIONS OR ITS # 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 software consists of contributions made by Digital Creations and # many individuals on behalf of Digital Creations. Specific # attributions are listed in the accompanying credits file. # ############################################################################## __version__='$Revision: 1.8 $'[11:-2] from Publish import publish_module, Retry def test(*args, **kw): global test import Test test=Test.publish return apply(test, args, kw) def Main(*args, **kw): global test import Test test=Test.publish return apply(test, ('Main',)+args, kw) # What can we say. ;/ def Zope(*args, **kw): global test import Test test=Test.publish return apply(test, ('Zope',)+args, kw) Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/cgi.py100644 1007 1403 136320 6735747502 21662 0ustar petrillipetrilli#! /usr/local/bin/python """Support module for CGI (Common Gateway Interface) scripts. This module defines a number of utilities for use by CGI scripts written in Python. Introduction ------------ A CGI script is invoked by an HTTP server, usually to process user input submitted through an HTML

    or element. Most often, CGI scripts live in the server's special cgi-bin directory. The HTTP server places all sorts of information about the request (such as the client's hostname, the requested URL, the query string, and lots of other goodies) in the script's shell environment, executes the script, and sends the script's output back to the client. The script's input is connected to the client too, and sometimes the form data is read this way; at other times the form data is passed via the "query string" part of the URL. This module (cgi.py) is intended to take care of the different cases and provide a simpler interface to the Python script. It also provides a number of utilities that help in debugging scripts, and the latest addition is support for file uploads from a form (if your browser supports it -- Grail 0.3 and Netscape 2.0 do). The output of a CGI script should consist of two sections, separated by a blank line. The first section contains a number of headers, telling the client what kind of data is following. Python code to generate a minimal header section looks like this: print "Content-type: text/html" # HTML is following print # blank line, end of headers The second section is usually HTML, which allows the client software to display nicely formatted text with header, in-line images, etc. Here's Python code that prints a simple piece of HTML: print "CGI script output" print "

    This is my first CGI script

    " print "Hello, world!" It may not be fully legal HTML according to the letter of the standard, but any browser will understand it. Using the cgi module -------------------- Begin by writing "import cgi". Don't use "from cgi import *" -- the module defines all sorts of names for its own use or for backward compatibility that you don't want in your namespace. It's best to use the FieldStorage class. The other classes define in this module are provided mostly for backward compatibility. Instantiate it exactly once, without arguments. This reads the form contents from standard input or the environment (depending on the value of various environment variables set according to the CGI standard). Since it may consume standard input, it should be instantiated only once. The FieldStorage instance can be accessed as if it were a Python dictionary. For instance, the following code (which assumes that the Content-type header and blank line have already been printed) checks that the fields "name" and "addr" are both set to a non-empty string: form = cgi.FieldStorage() form_ok = 0 if form.has_key("name") and form.has_key("addr"): if form["name"].value != "" and form["addr"].value != "": form_ok = 1 if not form_ok: print "

    Error

    " print "Please fill in the name and addr fields." return ...further form processing here... Here the fields, accessed through form[key], are themselves instances of FieldStorage (or MiniFieldStorage, depending on the form encoding). If the submitted form data contains more than one field with the same name, the object retrieved by form[key] is not a (Mini)FieldStorage instance but a list of such instances. If you are expecting this possibility (i.e., when your HTML form comtains multiple fields with the same name), use the type() function to determine whether you have a single instance or a list of instances. For example, here's code that concatenates any number of username fields, separated by commas: username = form["username"] if type(username) is type([]): # Multiple username fields specified usernames = "" for item in username: if usernames: # Next item -- insert comma usernames = usernames + "," + item.value else: # First item -- don't insert comma usernames = item.value else: # Single username field specified usernames = username.value If a field represents an uploaded file, the value attribute reads the entire file in memory as a string. This may not be what you want. You can test for an uploaded file by testing either the filename attribute or the file attribute. You can then read the data at leasure from the file attribute: fileitem = form["userfile"] if fileitem.file: # It's an uploaded file; count lines linecount = 0 while 1: line = fileitem.file.readline() if not line: break linecount = linecount + 1 The file upload draft standard entertains the possibility of uploading multiple files from one field (using a recursive multipart/* encoding). When this occurs, the item will be a dictionary-like FieldStorage item. This can be determined by testing its type attribute, which should have the value "multipart/form-data" (or perhaps another string beginning with "multipart/"). It this case, it can be iterated over recursively just like the top-level form object. When a form is submitted in the "old" format (as the query string or as a single data part of type application/x-www-form-urlencoded), the items will actually be instances of the class MiniFieldStorage. In this case, the list, file and filename attributes are always None. Old classes ----------- These classes, present in earlier versions of the cgi module, are still supported for backward compatibility. New applications should use the FieldStorage class. SvFormContentDict: single value form content as dictionary; assumes each field name occurs in the form only once. FormContentDict: multiple value form content as dictionary (the form items are lists of values). Useful if your form contains multiple fields with the same name. Other classes (FormContent, InterpFormContentDict) are present for backwards compatibility with really old applications only. If you still use these and would be inconvenienced when they disappeared from a next version of this module, drop me a note. Functions --------- These are useful if you want more control, or if you want to employ some of the algorithms implemented in this module in other circumstances. parse(fp, [environ, [keep_blank_values, [strict_parsing]]]): parse a form into a Python dictionary. parse_qs(qs, [keep_blank_values, [strict_parsing]]): parse a query string (data of type application/x-www-form-urlencoded). Data are returned as a dictionary. The dictionary keys are the unique query variable names and the values are lists of vales for each name. parse_qsl(qs, [keep_blank_values, [strict_parsing]]): parse a query string (data of type application/x-www-form-urlencoded). Data are returned as a list of (name, value) pairs. parse_multipart(fp, pdict): parse input of type multipart/form-data (for file uploads). parse_header(string): parse a header like Content-type into a main value and a dictionary of parameters. test(): complete test program. print_environ(): format the shell environment in HTML. print_form(form): format a form in HTML. print_environ_usage(): print a list of useful environment variables in HTML. escape(): convert the characters "&", "<" and ">" to HTML-safe sequences. Use this if you need to display text that might contain such characters in HTML. To translate URLs for inclusion in the HREF attribute of an tag, use urllib.quote(). log(fmt, ...): write a line to a log file; see docs for initlog(). Caring about security --------------------- There's one important rule: if you invoke an external program (e.g. via the os.system() or os.popen() functions), make very sure you don't pass arbitrary strings received from the client to the shell. This is a well-known security hole whereby clever hackers anywhere on the web can exploit a gullible CGI script to invoke arbitrary shell commands. Even parts of the URL or field names cannot be trusted, since the request doesn't have to come from your form! To be on the safe side, if you must pass a string gotten from a form to a shell command, you should make sure the string contains only alphanumeric characters, dashes, underscores, and periods. Installing your CGI script on a Unix system ------------------------------------------- Read the documentation for your HTTP server and check with your local system administrator to find the directory where CGI scripts should be installed; usually this is in a directory cgi-bin in the server tree. Make sure that your script is readable and executable by "others"; the Unix file mode should be 755 (use "chmod 755 filename"). Make sure that the first line of the script contains #! starting in column 1 followed by the pathname of the Python interpreter, for instance: #! /usr/local/bin/python Make sure the Python interpreter exists and is executable by "others". Note that it's probably not a good idea to use #! /usr/bin/env python here, since the Python interpreter may not be on the default path given to CGI scripts!!! Make sure that any files your script needs to read or write are readable or writable, respectively, by "others" -- their mode should be 644 for readable and 666 for writable. This is because, for security reasons, the HTTP server executes your script as user "nobody", without any special privileges. It can only read (write, execute) files that everybody can read (write, execute). The current directory at execution time is also different (it is usually the server's cgi-bin directory) and the set of environment variables is also different from what you get at login. in particular, don't count on the shell's search path for executables ($PATH) or the Python module search path ($PYTHONPATH) to be set to anything interesting. If you need to load modules from a directory which is not on Python's default module search path, you can change the path in your script, before importing other modules, e.g.: import sys sys.path.insert(0, "/usr/home/joe/lib/python") sys.path.insert(0, "/usr/local/lib/python") This way, the directory inserted last will be searched first! Instructions for non-Unix systems will vary; check your HTTP server's documentation (it will usually have a section on CGI scripts). Testing your CGI script ----------------------- Unfortunately, a CGI script will generally not run when you try it from the command line, and a script that works perfectly from the command line may fail mysteriously when run from the server. There's one reason why you should still test your script from the command line: if it contains a syntax error, the python interpreter won't execute it at all, and the HTTP server will most likely send a cryptic error to the client. Assuming your script has no syntax errors, yet it does not work, you have no choice but to read the next section: Debugging CGI scripts --------------------- First of all, check for trivial installation errors -- reading the section above on installing your CGI script carefully can save you a lot of time. If you wonder whether you have understood the installation procedure correctly, try installing a copy of this module file (cgi.py) as a CGI script. When invoked as a script, the file will dump its environment and the contents of the form in HTML form. Give it the right mode etc, and send it a request. If it's installed in the standard cgi-bin directory, it should be possible to send it a request by entering a URL into your browser of the form: http://yourhostname/cgi-bin/cgi.py?name=Joe+Blow&addr=At+Home If this gives an error of type 404, the server cannot find the script -- perhaps you need to install it in a different directory. If it gives another error (e.g. 500), there's an installation problem that you should fix before trying to go any further. If you get a nicely formatted listing of the environment and form content (in this example, the fields should be listed as "addr" with value "At Home" and "name" with value "Joe Blow"), the cgi.py script has been installed correctly. If you follow the same procedure for your own script, you should now be able to debug it. The next step could be to call the cgi module's test() function from your script: replace its main code with the single statement cgi.test() This should produce the same results as those gotten from installing the cgi.py file itself. When an ordinary Python script raises an unhandled exception (e.g., because of a typo in a module name, a file that can't be opened, etc.), the Python interpreter prints a nice traceback and exits. While the Python interpreter will still do this when your CGI script raises an exception, most likely the traceback will end up in one of the HTTP server's log file, or be discarded altogether. Fortunately, once you have managed to get your script to execute *some* code, it is easy to catch exceptions and cause a traceback to be printed. The test() function below in this module is an example. Here are the rules: 1. Import the traceback module (before entering the try-except!) 2. Make sure you finish printing the headers and the blank line early 3. Assign sys.stderr to sys.stdout 3. Wrap all remaining code in a try-except statement 4. In the except clause, call traceback.print_exc() For example: import sys import traceback print "Content-type: text/html" print sys.stderr = sys.stdout try: ...your code here... except: print "\n\n
    "
                traceback.print_exc()

Notes: The assignment to sys.stderr is needed because the traceback
prints to sys.stderr.  The print "\n\n
    " statement is necessary to
disable the word wrapping in HTML.

If you suspect that there may be a problem in importing the traceback
module, you can use an even more robust approach (which only uses
built-in modules):

        import sys
        sys.stderr = sys.stdout
        print "Content-type: text/plain"
        print
        ...your code here...

This relies on the Python interpreter to print the traceback.  The
content type of the output is set to plain text, which disables all
HTML processing.  If your script works, the raw HTML will be displayed
by your client.  If it raises an exception, most likely after the
first two lines have been printed, a traceback will be displayed.
Because no HTML interpretation is going on, the traceback will
readable.

When all else fails, you may want to insert calls to log() to your
program or even to a copy of the cgi.py file.  Note that this requires
you to set cgi.logfile to the name of a world-writable file before the
first call to log() is made!

Good luck!


Common problems and solutions
-----------------------------

- Most HTTP servers buffer the output from CGI scripts until the
script is completed.  This means that it is not possible to display a
progress report on the client's display while the script is running.

- Check the installation instructions above.

- Check the HTTP server's log files.  ("tail -f logfile" in a separate
window may be useful!)

- Always check a script for syntax errors first, by doing something
like "python script.py".

- When using any of the debugging techniques, don't forget to add
"import sys" to the top of the script.

- When invoking external programs, make sure they can be found.
Usually, this means using absolute path names -- $PATH is usually not
set to a very useful value in a CGI script.

- When reading or writing external files, make sure they can be read
or written by every user on the system.

- Don't try to give a CGI script a set-uid mode.  This doesn't work on
most systems, and is a security liability as well.


History
-------

Michael McLay started this module.  Steve Majewski changed the
interface to SvFormContentDict and FormContentDict.  The multipart
parsing was inspired by code submitted by Andreas Paepcke.  Guido van
Rossum rewrote, reformatted and documented the module and is currently
responsible for its maintenance.


XXX The module is getting pretty heavy with all those docstrings.
Perhaps there should be a slimmed version that doesn't contain all those 
backwards compatible and debugging classes and functions?

"""

__version__ = "2.2"


# Imports
# =======

import string
import sys
import os
import urllib
import mimetools
import rfc822
from StringIO import StringIO


# Logging support
# ===============

logfile = ""            # Filename to log to, if not empty
logfp = None            # File object to log to, if not None

def initlog(*allargs):
    """Write a log message, if there is a log file.

    Even though this function is called initlog(), you should always
    use log(); log is a variable that is set either to initlog
    (initially), to dolog (once the log file has been opened), or to
    nolog (when logging is disabled).

    The first argument is a format string; the remaining arguments (if
    any) are arguments to the % operator, so e.g.
        log("%s: %s", "a", "b")
    will write "a: b" to the log file, followed by a newline.

    If the global logfp is not None, it should be a file object to
    which log data is written.

    If the global logfp is None, the global logfile may be a string
    giving a filename to open, in append mode.  This file should be
    world writable!!!  If the file can't be opened, logging is
    silently disabled (since there is no safe place where we could
    send an error message).

    """
    global logfp, log
    if logfile and not logfp:
        try:
            logfp = open(logfile, "a")
        except IOError:
            pass
    if not logfp:
        log = nolog
    else:
        log = dolog
    apply(log, allargs)

def dolog(fmt, *args):
    """Write a log message to the log file.  See initlog() for docs."""
    logfp.write(fmt%args + "\n")

def nolog(*allargs):
    """Dummy function, assigned to log when logging is disabled."""
    pass

log = initlog           # The current logging function


# Parsing functions
# =================

# Maximum input we will accept when REQUEST_METHOD is POST
# 0 ==> unlimited input
maxlen = 0

def parse(fp=None, environ=os.environ, keep_blank_values=0, strict_parsing=0):
    """Parse a query in the environment or from a file (default stdin)

        Arguments, all optional:

        fp              : file pointer; default: sys.stdin

        environ         : environment dictionary; default: os.environ

        keep_blank_values: flag indicating whether blank values in
            URL encoded forms should be treated as blank strings.  
            A true value inicates that blanks should be retained as 
            blank strings.  The default false value indicates that
            blank values are to be ignored and treated as if they were
            not included.

        strict_parsing: flag indicating what to do with parsing errors.
            If false (the default), errors are silently ignored.
            If true, errors raise a ValueError exception.
    """
    if not fp:
        fp = sys.stdin
    if not environ.has_key('REQUEST_METHOD'):
        environ['REQUEST_METHOD'] = 'GET'       # For testing stand-alone
    if environ['REQUEST_METHOD'] == 'POST':
        ctype, pdict = parse_header(environ['CONTENT_TYPE'])
        if ctype == 'multipart/form-data':
            return parse_multipart(fp, pdict)
        elif ctype == 'application/x-www-form-urlencoded':
            clength = string.atoi(environ['CONTENT_LENGTH'])
            if maxlen and clength > maxlen:
                raise ValueError, 'Maximum content length exceeded'
            qs = fp.read(clength)
        else:
            qs = ''                     # Unknown content-type
        if environ.has_key('QUERY_STRING'): 
            if qs: qs = qs + '&'
            qs = qs + environ['QUERY_STRING']
        elif sys.argv[1:]: 
            if qs: qs = qs + '&'
            qs = qs + sys.argv[1]
        environ['QUERY_STRING'] = qs    # XXX Shouldn't, really
    elif environ.has_key('QUERY_STRING'):
        qs = environ['QUERY_STRING']
    else:
        if sys.argv[1:]:
            qs = sys.argv[1]
        else:
            qs = ""
        environ['QUERY_STRING'] = qs    # XXX Shouldn't, really
    return parse_qs(qs, keep_blank_values, strict_parsing)


def parse_qs(qs, keep_blank_values=0, strict_parsing=0):
    """Parse a query given as a string argument.

        Arguments:

        qs: URL-encoded query string to be parsed

        keep_blank_values: flag indicating whether blank values in
            URL encoded queries should be treated as blank strings.  
            A true value inicates that blanks should be retained as 
            blank strings.  The default false value indicates that
            blank values are to be ignored and treated as if they were
            not included.

        strict_parsing: flag indicating what to do with parsing errors.
            If false (the default), errors are silently ignored.
            If true, errors raise a ValueError exception.
    """
    dict = {}
    for name, value in parse_qsl(qs, keep_blank_values, strict_parsing):
        if len(value) or keep_blank_values:
            if dict.has_key(name):
                dict[name].append(value)
            else:
                dict[name] = [value]
    return dict

def parse_qsl(qs, keep_blank_values=0, strict_parsing=0):
    """Parse a query given as a string argument.

        Arguments:

        qs: URL-encoded query string to be parsed

        keep_blank_values: flag indicating whether blank values in
            URL encoded queries should be treated as blank strings.  
            A true value inicates that blanks should be retained as 
            blank strings.  The default false value indicates that
            blank values are to be ignored and treated as if they were
            not included.

        strict_parsing: flag indicating what to do with parsing errors.
            If false (the default), errors are silently ignored.
            If true, errors raise a ValueError exception.

       Returns a list, as God intended.
    """
    name_value_pairs = string.splitfields(qs, '&')
    r=[]
    for name_value in name_value_pairs:
        nv = string.splitfields(name_value, '=')
        if len(nv) != 2:
            if strict_parsing:
                raise ValueError, "bad query field: %s" % `name_value`
            continue
        name = urllib.unquote(string.replace(nv[0], '+', ' '))
        value = urllib.unquote(string.replace(nv[1], '+', ' '))
        r.append(name, value)

    return r


def parse_multipart(fp, pdict):
    """Parse multipart input.

    Arguments:
    fp   : input file
    pdict: dictionary containing other parameters of conten-type header

    Returns a dictionary just like parse_qs(): keys are the field names, each 
    value is a list of values for that field.  This is easy to use but not 
    much good if you are expecting megabytes to be uploaded -- in that case, 
    use the FieldStorage class instead which is much more flexible.  Note 
    that content-type is the raw, unparsed contents of the content-type 
    header.
    
    XXX This does not parse nested multipart parts -- use FieldStorage for 
    that.
    
    XXX This should really be subsumed by FieldStorage altogether -- no 
    point in having two implementations of the same parsing algorithm.

    """
    if pdict.has_key('boundary'):
        boundary = pdict['boundary']
    else:
        boundary = ""
    nextpart = "--" + boundary
    lastpart = "--" + boundary + "--"
    partdict = {}
    terminator = ""

    while terminator != lastpart:
        bytes = -1
        data = None
        if terminator:
            # At start of next part.  Read headers first.
            headers = mimetools.Message(fp)
            clength = headers.getheader('content-length')
            if clength:
                try:
                    bytes = string.atoi(clength)
                except string.atoi_error:
                    pass
            if bytes > 0:
                if maxlen and bytes > maxlen:
                    raise ValueError, 'Maximum content length exceeded'
                data = fp.read(bytes)
            else:
                data = ""
        # Read lines until end of part.
        lines = []
        while 1:
            line = fp.readline()
            if not line:
                terminator = lastpart # End outer loop
                break
            if line[:2] == "--":
                terminator = string.strip(line)
                if terminator in (nextpart, lastpart):
                    break
            lines.append(line)
        # Done with part.
        if data is None:
            continue
        if bytes < 0:
            if lines:
                # Strip final line terminator
                line = lines[-1]
                if line[-2:] == "\r\n":
                    line = line[:-2]
                elif line[-1:] == "\n":
                    line = line[:-1]
                lines[-1] = line
                data = string.joinfields(lines, "")
        line = headers['content-disposition']
        if not line:
            continue
        key, params = parse_header(line)
        if key != 'form-data':
            continue
        if params.has_key('name'):
            name = params['name']
        else:
            continue
        if partdict.has_key(name):
            partdict[name].append(data)
        else:
            partdict[name] = [data]

    return partdict


def parse_header(line):
    """Parse a Content-type like header.

    Return the main content-type and a dictionary of options.

    """
    plist = map(string.strip, string.splitfields(line, ';'))
    key = string.lower(plist[0])
    del plist[0]
    pdict = {}
    for p in plist:
        i = string.find(p, '=')
        if i >= 0:
            name = string.lower(string.strip(p[:i]))
            value = string.strip(p[i+1:])
            if len(value) >= 2 and value[0] == value[-1] == '"':
                value = value[1:-1]
            pdict[name] = value
    return key, pdict


# Classes for field storage
# =========================

class MiniFieldStorage:

    """Like FieldStorage, for use when no file uploads are possible."""

    # Dummy attributes
    filename = None
    list = None
    type = None
    file = None
    type_options = {}
    disposition = None
    disposition_options = {}
    headers = {}

    def __init__(self, name, value):
        """Constructor from field name and value."""
        self.name = name
        self.value = value
        # self.file = StringIO(value)

    def __repr__(self):
        """Return printable representation."""
        return "MiniFieldStorage(%s, %s)" % (`self.name`, `self.value`)


class FieldStorage:

    """Store a sequence of fields, reading multipart/form-data.

    This class provides naming, typing, files stored on disk, and
    more.  At the top level, it is accessible like a dictionary, whose
    keys are the field names.  (Note: None can occur as a field name.)
    The items are either a Python list (if there's multiple values) or
    another FieldStorage or MiniFieldStorage object.  If it's a single
    object, it has the following attributes:

    name: the field name, if specified; otherwise None

    filename: the filename, if specified; otherwise None; this is the
        client side filename, *not* the file name on which it is
        stored (that's a temporary file you don't deal with)

    value: the value as a *string*; for file uploads, this
        transparently reads the file every time you request the value

    file: the file(-like) object from which you can read the data;
        None if the data is stored a simple string

    type: the content-type, or None if not specified

    type_options: dictionary of options specified on the content-type
        line

    disposition: content-disposition, or None if not specified

    disposition_options: dictionary of corresponding options

    headers: a dictionary(-like) object (sometimes rfc822.Message or a
        subclass thereof) containing *all* headers

    The class is subclassable, mostly for the purpose of overriding
    the make_file() method, which is called internally to come up with
    a file open for reading and writing.  This makes it possible to
    override the default choice of storing all files in a temporary
    directory and unlinking them as soon as they have been opened.

    """

    def __init__(self, fp=None, headers=None, outerboundary="",
                 environ=os.environ, keep_blank_values=0, strict_parsing=0):
        """Constructor.  Read multipart/* until last part.

        Arguments, all optional:

        fp              : file pointer; default: sys.stdin
            (not used when the request method is GET)

        headers         : header dictionary-like object; default:
            taken from environ as per CGI spec

        outerboundary   : terminating multipart boundary
            (for internal use only)

        environ         : environment dictionary; default: os.environ

        keep_blank_values: flag indicating whether blank values in
            URL encoded forms should be treated as blank strings.  
            A true value inicates that blanks should be retained as 
            blank strings.  The default false value indicates that
            blank values are to be ignored and treated as if they were
            not included.

        strict_parsing: flag indicating what to do with parsing errors.
            If false (the default), errors are silently ignored.
            If true, errors raise a ValueError exception.

        """
        method = 'GET'
        self.keep_blank_values = keep_blank_values
        self.strict_parsing = strict_parsing
        if environ.has_key('REQUEST_METHOD'):
            method = string.upper(environ['REQUEST_METHOD'])
        if method == 'GET' or method == 'HEAD':
            if environ.has_key('QUERY_STRING'):
                qs = environ['QUERY_STRING']
            elif sys.argv[1:]:
                qs = sys.argv[1]
            else:
                qs = ""
            fp = StringIO(qs)
            if headers is None:
                headers = {'content-type':
                           "application/x-www-form-urlencoded"}
        if headers is None:
            headers = {}
            if method == 'POST':
                # Set default content-type for POST to what's traditional
                headers['content-type'] = "application/x-www-form-urlencoded"
            if environ.has_key('CONTENT_TYPE'):
                headers['content-type'] = environ['CONTENT_TYPE']
            if environ.has_key('CONTENT_LENGTH'):
                headers['content-length'] = environ['CONTENT_LENGTH']
        self.fp = fp or sys.stdin
        self.headers = headers
        self.outerboundary = outerboundary

        # Process content-disposition header
        cdisp, pdict = "", {}
        if self.headers.has_key('content-disposition'):
            cdisp, pdict = parse_header(self.headers['content-disposition'])
        self.disposition = cdisp
        self.disposition_options = pdict
        self.name = None
        if pdict.has_key('name'):
            self.name = pdict['name']
        self.filename = None
        if pdict.has_key('filename'):
            self.filename = pdict['filename']

        # Process content-type header
        #
        # Honor any existing content-type header.  But if there is no
        # content-type header, use some sensible defaults.  Assume
        # outerboundary is "" at the outer level, but something non-false
        # inside a multi-part.  The default for an inner part is text/plain,
        # but for an outer part it should be urlencoded.  This should catch
        # bogus clients which erroneously forget to include a content-type
        # header.
        #
        # See below for what we do if there does exist a content-type header,
        # but it happens to be something we don't understand.
        if self.headers.has_key('content-type'):
            ctype, pdict = parse_header(self.headers['content-type'])
        elif self.outerboundary or method != 'POST':
            ctype, pdict = "text/plain", {}
        else:
            ctype, pdict = 'application/x-www-form-urlencoded', {}
        self.type = ctype
        self.type_options = pdict
        self.innerboundary = ""
        if pdict.has_key('boundary'):
            self.innerboundary = pdict['boundary']
        clen = -1
        if self.headers.has_key('content-length'):
            try:
                clen = string.atoi(self.headers['content-length'])
            except:
                pass
            if maxlen and clen > maxlen:
                raise ValueError, 'Maximum content length exceeded'
        self.length = clen

        self.list = self.file = None
        self.done = 0
        self.lines = []
        if ctype == 'application/x-www-form-urlencoded':
            self.read_urlencoded()
        elif ctype[:10] == 'multipart/':
            self.read_multi(environ, keep_blank_values, strict_parsing)
        else:
            self.read_single()

    def __repr__(self):
        """Return a printable representation."""
        return "FieldStorage(%s, %s, %s)" % (
                `self.name`, `self.filename`, `self.value`)

    def __getattr__(self, name):
        if name != 'value':
            raise AttributeError, name
        if self.file:
            self.file.seek(0)
            value = self.file.read()
            self.file.seek(0)
        elif self.list is not None:
            value = self.list
        else:
            value = None
        return value

    def __getitem__(self, key):
        """Dictionary style indexing."""
        if self.list is None:
            raise TypeError, "not indexable"
        found = []
        for item in self.list:
            if item.name == key: found.append(item)
        if not found:
            raise KeyError, key
        if len(found) == 1:
            return found[0]
        else:
            return found

    def keys(self):
        """Dictionary style keys() method."""
        if self.list is None:
            raise TypeError, "not indexable"
        keys = []
        for item in self.list:
            if item.name not in keys: keys.append(item.name)
        return keys

    def has_key(self, key):
        """Dictionary style has_key() method."""
        if self.list is None:
            raise TypeError, "not indexable"
        for item in self.list:
            if item.name == key: return 1
        return 0

    def __len__(self):
        """Dictionary style len(x) support."""
        return len(self.keys())

    def read_urlencoded(self):
        """Internal: read data in query string format."""
        qs = self.fp.read(self.length)
        self.list = list = []
        for key, value in parse_qsl(qs, self.keep_blank_values,
                                    self.strict_parsing):
            list.append(MiniFieldStorage(key, value))
        self.skip_lines()

    FieldStorageClass = None

    def read_multi(self, environ, keep_blank_values, strict_parsing):
        """Internal: read a part that is itself multipart."""
        self.list = []
        klass = self.FieldStorageClass or self.__class__
        part = klass(self.fp, {}, self.innerboundary,
                     environ, keep_blank_values, strict_parsing)
        # Throw first part away
        while not part.done:
            headers = rfc822.Message(self.fp)
            part = klass(self.fp, headers, self.innerboundary,
                         environ, keep_blank_values, strict_parsing)
            self.list.append(part)
        self.skip_lines()

    def read_single(self):
        """Internal: read an atomic part."""
        if self.length >= 0:
            self.read_binary()
            self.skip_lines()
        else:
            self.read_lines()
        self.file.seek(0)

    bufsize = 8*1024            # I/O buffering size for copy to file

    def read_binary(self):
        """Internal: read binary data."""
        self.file = self.make_file('b')
        todo = self.length
        if todo >= 0:
            while todo > 0:
                data = self.fp.read(min(todo, self.bufsize))
                if not data:
                    self.done = -1
                    break
                self.file.write(data)
                todo = todo - len(data)

    def read_lines(self):
        """Internal: read lines until EOF or outerboundary."""
        self.file = self.make_file('')
        if self.outerboundary:
            self.read_lines_to_outerboundary()
        else:
            self.read_lines_to_eof()

    def read_lines_to_eof(self):
        """Internal: read lines until EOF."""
        while 1:
            line = self.fp.readline()
            if not line:
                self.done = -1
                break
            self.lines.append(line)
            self.file.write(line)

    def read_lines_to_outerboundary(self):
        """Internal: read lines until outerboundary."""
        next = "--" + self.outerboundary
        last = next + "--"
        delim = ""
        while 1:
            line = self.fp.readline()
            if not line:
                self.done = -1
                break
            self.lines.append(line)
            if line[:2] == "--":
                strippedline = string.strip(line)
                if strippedline == next:
                    break
                if strippedline == last:
                    self.done = 1
                    break
            odelim = delim
            if line[-2:] == "\r\n":
                delim = "\r\n"
                line = line[:-2]
            elif line[-1] == "\n":
                delim = "\n"
                line = line[:-1]
            else:
                delim = ""
            self.file.write(odelim + line)

    def skip_lines(self):
        """Internal: skip lines until outer boundary if defined."""
        if not self.outerboundary or self.done:
            return
        next = "--" + self.outerboundary
        last = next + "--"
        while 1:
            line = self.fp.readline()
            if not line:
                self.done = -1
                break
            self.lines.append(line)
            if line[:2] == "--":
                strippedline = string.strip(line)
                if strippedline == next:
                    break
                if strippedline == last:
                    self.done = 1
                    break

    def make_file(self, binary=None):
        """Overridable: return a readable & writable file.

        The file will be used as follows:
        - data is written to it
        - seek(0)
        - data is read from it

        The 'binary' argument is unused -- the file is always opened
        in binary mode.

        This version opens a temporary file for reading and writing,
        and immediately deletes (unlinks) it.  The trick (on Unix!) is
        that the file can still be used, but it can't be opened by
        another process, and it will automatically be deleted when it
        is closed or when the current process terminates.

        If you want a more permanent file, you derive a class which
        overrides this method.  If you want a visible temporary file
        that is nevertheless automatically deleted when the script
        terminates, try defining a __del__ method in a derived class
        which unlinks the temporary files you have created.

        """
        import tempfile
        return tempfile.TemporaryFile("w+b")
        


# Backwards Compatibility Classes
# ===============================

class FormContentDict:
    """Basic (multiple values per field) form content as dictionary.

    form = FormContentDict()

    form[key] -> [value, value, ...]
    form.has_key(key) -> Boolean
    form.keys() -> [key, key, ...]
    form.values() -> [[val, val, ...], [val, val, ...], ...]
    form.items() ->  [(key, [val, val, ...]), (key, [val, val, ...]), ...]
    form.dict == {key: [val, val, ...], ...}

    """
    def __init__(self, environ=os.environ):
        self.dict = parse(environ=environ)
        self.query_string = environ['QUERY_STRING']
    def __getitem__(self,key):
        return self.dict[key]
    def keys(self):
        return self.dict.keys()
    def has_key(self, key):
        return self.dict.has_key(key)
    def values(self):
        return self.dict.values()
    def items(self):
        return self.dict.items() 
    def __len__( self ):
        return len(self.dict)


class SvFormContentDict(FormContentDict):
    """Strict single-value expecting form content as dictionary.

    IF you only expect a single value for each field, then form[key]
    will return that single value.  It will raise an IndexError if
    that expectation is not true.  IF you expect a field to have
    possible multiple values, than you can use form.getlist(key) to
    get all of the values.  values() and items() are a compromise:
    they return single strings where there is a single value, and
    lists of strings otherwise.

    """
    def __getitem__(self, key):
        if len(self.dict[key]) > 1: 
            raise IndexError, 'expecting a single value' 
        return self.dict[key][0]
    def getlist(self, key):
        return self.dict[key]
    def values(self):
        lis = []
        for each in self.dict.values(): 
            if len( each ) == 1 : 
                lis.append(each[0])
            else: lis.append(each)
        return lis
    def items(self):
        lis = []
        for key,value in self.dict.items():
            if len(value) == 1 :
                lis.append((key, value[0]))
            else:       lis.append((key, value))
        return lis


class InterpFormContentDict(SvFormContentDict):
    """This class is present for backwards compatibility only.""" 
    def __getitem__( self, key ):
        v = SvFormContentDict.__getitem__( self, key )
        if v[0] in string.digits+'+-.' : 
            try:  return  string.atoi( v ) 
            except ValueError:
                try:    return string.atof( v )
                except ValueError: pass
        return string.strip(v)
    def values( self ):
        lis = [] 
        for key in self.keys():
            try:
                lis.append( self[key] )
            except IndexError:
                lis.append( self.dict[key] )
        return lis
    def items( self ):
        lis = [] 
        for key in self.keys():
            try:
                lis.append( (key, self[key]) )
            except IndexError:
                lis.append( (key, self.dict[key]) )
        return lis


class FormContent(FormContentDict):
    """This class is present for backwards compatibility only.""" 
    def values(self, key):
        if self.dict.has_key(key) :return self.dict[key]
        else: return None
    def indexed_value(self, key, location):
        if self.dict.has_key(key):
            if len (self.dict[key]) > location:
                return self.dict[key][location]
            else: return None
        else: return None
    def value(self, key):
        if self.dict.has_key(key): return self.dict[key][0]
        else: return None
    def length(self, key):
        return len(self.dict[key])
    def stripped(self, key):
        if self.dict.has_key(key): return string.strip(self.dict[key][0])
        else: return None
    def pars(self):
        return self.dict


# Test/debug code
# ===============

def test(environ=os.environ):
    """Robust test CGI script, usable as main program.

    Write minimal HTTP headers and dump all information provided to
    the script in HTML form.

    """
    import traceback
    print "Content-type: text/html"
    print
    sys.stderr = sys.stdout
    try:
        form = FieldStorage()   # Replace with other classes to test those
        print_form(form)
        print_environ(environ)
        print_directory()
        print_arguments()
        print_environ_usage()
        def f():
            exec "testing print_exception() -- italics?"
        def g(f=f):
            f()
        print "
    What follows is a test, not an actual exception:
    "
        g()
    except:
        print_exception()

    # Second try with a small maxlen...
    global maxlen
    maxlen = 50
    try:
        form = FieldStorage()   # Replace with other classes to test those
        print_form(form)
        print_environ(environ)
        print_directory()
        print_arguments()
        print_environ_usage()
    except:
        print_exception()

def print_exception(type=None, value=None, tb=None, limit=None):
    if type is None:
        type, value, tb = sys.exc_info()
    import traceback
    print
    print "
    Traceback (innermost last):
    "
    list = traceback.format_tb(tb, limit) + \
           traceback.format_exception_only(type, value)
    print "
    %s%s
    " % (
        escape(string.join(list[:-1], "")),
        escape(list[-1]),
        )
    del tb

def print_environ(environ=os.environ):
    """Dump the shell environment as HTML."""
    keys = environ.keys()
    keys.sort()
    print
    print "
    Shell Environment:
    "
    print "
    "
    for key in keys:
        print "
    ", escape(key), "
    ", escape(environ[key])
    print "
    " 
    print

def print_form(form):
    """Dump the contents of a form as HTML."""
    keys = form.keys()
    keys.sort()
    print
    print "
    Form Contents:
    "
    print "
    "
    for key in keys:
        print "
    " + escape(key) + ":",
        value = form[key]
        print "" + escape(`type(value)`) + ""
        print "
    " + escape(`value`)
    print "
    "
    print

def print_directory():
    """Dump the current directory as HTML."""
    print
    print "
    Current Working Directory:
    "
    try:
        pwd = os.getcwd()
    except os.error, msg:
        print "os.error:", escape(str(msg))
    else:
        print escape(pwd)
    print

def print_arguments():
    print
    print "
    Command Line Arguments:
    "
    print
    print sys.argv
    print

def print_environ_usage():
    """Dump a list of environment variables used by CGI as HTML."""
    print """

    These environment variables could have been set:
    

      

    • AUTH_TYPE

    • CONTENT_LENGTH

    • CONTENT_TYPE

    • DATE_GMT

    • DATE_LOCAL

    • DOCUMENT_NAME

    • DOCUMENT_ROOT

    • DOCUMENT_URI

    • GATEWAY_INTERFACE

    • LAST_MODIFIED

    • PATH

    • PATH_INFO

    • PATH_TRANSLATED

    • QUERY_STRING

    • REMOTE_ADDR

    • REMOTE_HOST

    • REMOTE_IDENT

    • REMOTE_USER

    • REQUEST_METHOD

    • SCRIPT_NAME

    • SERVER_NAME

    • SERVER_PORT

    • SERVER_PROTOCOL

    • SERVER_ROOT

    • SERVER_SOFTWARE

    
In addition, HTTP headers sent by the server may be passed in the
environment as well.  Here are some common variable names:

      

    • HTTP_ACCEPT

    • HTTP_CONNECTION

    • HTTP_HOST

    • HTTP_PRAGMA

    • HTTP_REFERER

    • HTTP_USER_AGENT

    
"""


# Utilities
# =========

def escape(s, quote=None):
    """Replace special characters '&', '<' and '>' by SGML entities."""
    s = string.replace(s, "&", "&") # Must be done first!
    s = string.replace(s, "<", "<")
    s = string.replace(s, ">", ">",)
    if quote:
        s = string.replace(s, '"', """)
    return s


# Invoke mainline
# ===============

# Call test() when this file is run as a script (not imported as a module)
if __name__ == '__main__': 
    test()
Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/mapply.py100644   1007   1403       14125  6763236507  22377 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################
"""Provide an apply-like facility that works with any mapping object
"""

def default_call_object(object, args, context):
    result=apply(object,args) # Type s to step into published object.
    return result

def default_missing_name(name, context):
    raise TypeError, 'argument %s was ommitted' % name

def default_handle_class(klass, context):
    if hasattr(klass,'__init__'): 
        f=klass.__init__.im_func
        c=f.func_code
        names=c.co_varnames[1:c.co_argcount]
        return klass, names, f.func_defaults
    else:
        return klass, (), ()

def mapply(object, positional=(), keyword={},
           debug=None, maybe=None,
           missing_name=default_missing_name,
           handle_class=default_handle_class,
           context=None, bind=0,
           ):

    if hasattr(object,'__bases__'):
        f, names, defaults = handle_class(object, context)
    else:
        f=object
        im=0
        if hasattr(f, 'im_func'):
            im=1
        elif not hasattr(f,'func_defaults'):
            if hasattr(f, '__call__'):
                f=f.__call__
                if hasattr(f, 'im_func'):
                    im=1
                elif not hasattr(f,'func_defaults') and maybe: return object
            elif maybe: return object
    
        if im:
            f=f.im_func
            c=f.func_code
            defaults=f.func_defaults
            names=c.co_varnames[1:c.co_argcount]
        else:
            defaults=f.func_defaults
            c=f.func_code
            names=c.co_varnames[:c.co_argcount]

    nargs=len(names)
    if positional:
        positional=list(positional)
        if bind and nargs and names[0]=='self':
            positional.insert(0, missing_name('self', context))
        if len(positional) > nargs: raise TypeError, 'too many arguments'
        args=positional
    else:
        if bind and nargs and names[0]=='self':
            args=[missing_name('self', context)]
        else:
            args=[]

    get=keyword.get
    nrequired=len(names) - (len(defaults or ()))
    for index in range(len(args), len(names)):
        name=names[index]
        v=get(name, args)
        if v is args:
            if index < nrequired: v=missing_name(name, context)
            else: v=defaults[index-nrequired]
        args.append(v)

    args=tuple(args)
    if debug is not None: return debug(object,args,context)
    else: return apply(object,args)
Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/maybe_lock.py100644   1007   1403        7673  6671334670  23172 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################
__version__='$Revision: 1.2 $'[11:-2]

# Waaaa, I wish I didn't have to work this hard.
try: from thread import allocate_lock
except:
    class allocate_lock:
        def acquire(*args): pass
        def release(*args): pass
Zope-2.0.1-ZEO-nonbin/lib/python/ZPublisher/xmlrpc.py100644   1007   1403       20040  6733703453  22367 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################
"""XML-RPC support module

Written by Eric Kidd at UserLand software, with much help from Jim Fulton
at DC. This code hooks Zope up to Fredrik Lundh's Python XML-RPC library.

See http://www.xmlrpc.com/ and http://linux.userland.com/ for more
information about XML-RPC and Zope.
"""

import sys
from string import replace
from HTTPResponse import HTTPResponse
import xmlrpclib

def parse_input(data):
    """Parse input data and return a method path and argument tuple

    The data is a string.
    """
    # 
    # For example, with the input:
    #     
    #   
    #   
    #      examples.getStateName
    #      
    #         
    #            41
    #            
    #         
    #      
    # 
    # the function should return:
    # 
    #     ('examples.getStateName', (41,))
    params, method = xmlrpclib.loads(data)
    # Translate '.' to '/' in meth to represent object traversal.
    method = replace(method, '.', '/')
    return method, params

# See below
#
# def response(anHTTPResponse):
#     """Return a valid ZPublisher response object
# 
#     Use data already gathered by the existing response.
#     The new response will replace the existing response.
#     """
#     # As a first cut, lets just clone the response and
#     # put all of the logic in our refined response class below.
#     r=Response()
#     r.__dict__.update(anHTTPResponse.__dict__)
#     return r
    
    

########################################################################
# Possible implementation helpers:

class Response:
    """Customized Response that handles XML-RPC-specific details.

    We override setBody to marhsall Python objects into XML-RPC. We
    also override exception to convert errors to XML-RPC faults.

    If these methods stop getting called, make sure that ZPublisher is
    using the xmlrpc.Response object created above and not the original
    HTTPResponse object from which it was cloned.

    It's probably possible to improve the 'exception' method quite a bit.
    The current implementation, however, should suffice for now.
    """

    # Because we can't predict what kind of thing we're customizing,
    # we have to use delegation, rather than inheritence to do the
    # customization.

    def __init__(self, real): self.__dict__['_real']=real

    def __getattr__(self, name): return getattr(self._real, name)
    def __setattr__(self, name, v): return setattr(self._real, name, v)
    def __delattr__(self, name): return delattr(self._real, name)
    
    def setBody(self, body, title='', is_error=0, bogus_str_search=None):
        if isinstance(body, xmlrpclib.Fault):
            # Convert Fault object to XML-RPC response.
            body=xmlrpclib.dumps(body, methodresponse=1)
        else:
            # Marshall our body as an XML-RPC response. Strings will be sent
            # strings, integers as integers, etc. We do *not* convert
            # everything to a string first.
            body = xmlrpclib.dumps((body,), methodresponse=1)
        # Set our body to the XML-RPC message, and fix our MIME type.
        self._real.setBody(body)
        self._real.setHeader('content-type', 'text/xml')
        return self

    def exception(self, fatal=0, info=None,
                  absuri_match=None, tag_search=None):
        # Fetch our exception info. t is type, v is value and tb is the
        # traceback object.
        if type(info) is type(()) and len(info)==3: t,v,tb = info
        else: t,v,tb = sys.exc_info()

        # Abort running transaction, if any:
        try: get_transaction().abort()
        except: pass

        # Create an appropriate Fault object. Unfortunately, we throw away
        # most of the debugging information. More useful error reporting is
        # left as an exercise for the reader.
        Fault=xmlrpclib.Fault
        f=None
        try:
            if isinstance(v, Fault):
                f=v
            elif isinstance(v, Exception):
                f=Fault(-1, "Unexpected Zope exception: " + str(v))
            else:
                f=Fault(-2, "Unexpected Zope error value: " + str(v))
        except:
            f=Fault(-3, "Unknown Zope fault type")

        # Do the damage.
        self.setBody(f)
        self._real.setStatus(200)

        return tb

response=Response
Zope-2.0.1-ZEO-nonbin/lib/python/Zope/ 40755   1007   1403           0  6772126761  17231 5ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Zope/ZLogger/ 40755   1007   1403           0  6772126761  20602 5ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/Zope/ZLogger/FileLogger.py100644   1007   1403         541  6743662463  23252 0ustar  petrillipetrilliclass FileLogger:
    """ a File Logger

    This is just a stub, FileLogger should be smarter than
    stupidFileLogger, but for the moment it's completely brain dead.
    """
    
    def __init__(self):
        pass

    def __call__(self, sub, sev, sum, det, err):
        print 'syslogger %s, %s, %s, %s, %s, %s' % (self, sub, sev, sum, det, err)

Zope-2.0.1-ZEO-nonbin/lib/python/Zope/ZLogger/ZLogger.py100644   1007   1403         750  6743662463  22606 0ustar  petrillipetrilli
import stupidFileLogger
import syslogLogger

from zLOG import *

loggers = (stupidFileLogger.stupidFileLogger(), syslogLogger.syslogLogger(),)

def log_write(subsystem, severity, summary, detail, error):
    """ Hook into the logging system

    The actual logic to determine what log messages go where will go
    here.  For now, everything goes to all loggers.
    """
    if severity < 0: return

    for logger in loggers:
        logger(subsystem, severity, summary, detail, error)
Zope-2.0.1-ZEO-nonbin/lib/python/Zope/ZLogger/__init__.py100644   1007   1403        7352  6743662463  23021 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################

import ZLogger
Zope-2.0.1-ZEO-nonbin/lib/python/Zope/ZLogger/stupidFileLogger.py100644   1007   1403        6644  6745367242  24534 0ustar  petrillipetrilliimport time, sys, string, os


_stupid_dest=None
_no_stupid_log=[]
format_exception_only=None


# Standard severities
BLATHER=-100
INFO=0      
PROBLEM=WARNING=100             
ERROR=200   
PANIC=300

def severity_string(severity, mapping={
    -100: 'BLATHER',
    0: 'INFO',       
    100: 'PROBLEM', 
    200: 'ERROR',    
    300: 'PANIC', 
    }):
    """Convert a severity code to a string
    """
    s=int(severity)
    if mapping.has_key(s): s=mapping[s]
    else: s=''
    return "%s(%s)" % (s, severity)


class stupidFileLogger:

    """ a stupid File Logger """


    def __init__(self):
        pass

    def __call__(self, sub, sev, sum, det, err):
        stupid_log_write(sub, sev, sum, det, err)



def stupid_log_write(subsystem, severity, summary, detail, error):
    if severity < 0: return

    global _stupid_dest
    if _stupid_dest is None:
        import os
        if os.environ.has_key('STUPID_LOG_FILE'):
            f=os.environ['STUPID_LOG_FILE']
            if f: _stupid_dest=open(f,'a')
            else:
                import sys
                _stupid_dest=sys.stderr
        else:
            _stupid_dest=_no_stupid_log

    import os
    if os.environ.has_key('Z_DEBUG_MODE'):
        import sys
        sys.stderr.write(
            "------\n"
            "%s %s %s %s\n%s"
            %
            (log_time(),
             severity_string(severity),
             subsystem,
             summary,
             detail,
             )
            )
        sys.stderr.flush()

    if _stupid_dest is _no_stupid_log: return

    _stupid_dest.write(
        "------\n"
        "%s %s %s %s\n%s"
        %
        (log_time(),
         severity_string(severity),
         subsystem,
         summary,
         detail,
         )
        )



    _stupid_dest.flush()

    if error:
        try:
            _stupid_dest(format_exception(
                error[0], error[1], error[2],
                trailer='\n', limit=100))
        except:
            _stupid_dest("%s: %s\n" % error[:2])


def format_exception(etype,value,tb,limit=None, delimiter='\n',
                     header='', trailer=''):
    global format_exception_only
    if format_exception_only is None:
        import traceback
        format_exception_only=traceback.format_exception_only

    result=['Traceback (innermost last):']
    if header: result.insert(0,header)
    if limit is None:
        if hasattr(sys, 'tracebacklimit'):
            limit = sys.tracebacklimit
    n = 0
    while tb is not None and (limit is None or n < limit):
        f = tb.tb_frame
        lineno = tb.tb_lineno
        co = f.f_code
        filename = co.co_filename
        name = co.co_name
        locals=f.f_locals
        result.append('  File %s, line %d, in %s'
                      % (filename,lineno,name))
        try: result.append('    (Object: %s)' %
                           locals[co.co_varnames[0]].__name__)
        except: pass
        try: result.append('    (Info: %s)' %
                           str(locals['__traceback_info__']))
        except: pass
        tb = tb.tb_next
        n = n+1
    result.append(string.join(format_exception_only(etype, value),
                       ' '))
    if trailer: result.append(trailer)

    return string.join(result, delimiter)


def log_time():
    """Return a simple time string without spaces suitable for logging
    """
    return ("%4.4d-%2.2d-%2.2dT%2.2d:%2.2d:%2.2d"
            % time.gmtime(time.time())[:6])






Zope-2.0.1-ZEO-nonbin/lib/python/Zope/ZLogger/syslog.py100644   1007   1403       13356  6743662463  22623 0ustar  petrillipetrilli# -*- Mode: Python; tab-width: 4 -*-

# From: "Samual M. Rushing" 
# Date: Mon, 21 Apr 1997 16:10:42 -0500

# ======================================================================
# Copyright 1997 by Sam Rushing
# 
#                         All Rights Reserved
# 
# Permission to use, copy, modify, and distribute this software and
# its documentation for any purpose and without fee is hereby
# granted, provided that the above copyright notice appear in all
# copies and that both that copyright notice and this permission
# notice appear in supporting documentation, and that the name of Sam
# Rushing not be used in advertising or publicity pertaining to
# distribution of the software without specific, written prior
# permission.
# 
# SAM RUSHING DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
# INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN
# NO EVENT SHALL SAM RUSHING BE LIABLE FOR ANY SPECIAL, INDIRECT OR
# CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
# OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
# NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
# CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
# ======================================================================

"""socket interface to unix syslog.
On Unix, there are usually two ways of getting to syslog: via a
local unix-domain socket, or via the TCP service.

Usually "/dev/log" is the unix domain socket.  This may be different
for other systems.

>>> my_client = syslog_client ('/dev/log')

Otherwise, just use the UDP version, port 514.

>>> my_client = syslog_client (('my_log_host', 514))

On win32, you will have to use the UDP version.  Note that
you can use this to log to other hosts (and indeed, multiple
hosts).

This module is not a drop-in replacement for the python
 extension module - the interface is different.

Usage:

>>> c = syslog_client()
>>> c = syslog_client ('/strange/non_standard_log_location')
>>> c = syslog_client (('other_host.com', 514))
>>> c.log ('testing', facility='local0', priority='debug')

"""

# TODO: support named-pipe syslog.
# [see ftp://sunsite.unc.edu/pub/Linux/system/Daemons/syslog-fifo.tar.z]

# from :
# ===========================================================================
# priorities/facilities are encoded into a single 32-bit quantity, where the
# bottom 3 bits are the priority (0-7) and the top 28 bits are the facility
# (0-big number).  Both the priorities and the facilities map roughly
# one-to-one to strings in the syslogd(8) source code.  This mapping is
# included in this file.
#
# priorities (these are ordered)

LOG_EMERG		= 0		#  system is unusable 
LOG_ALERT		= 1		#  action must be taken immediately 
LOG_CRIT		= 2		#  critical conditions 
LOG_ERR			= 3		#  error conditions 
LOG_WARNING		= 4		#  warning conditions 
LOG_NOTICE		= 5		#  normal but significant condition 
LOG_INFO		= 6		#  informational 
LOG_DEBUG		= 7		#  debug-level messages 

#  facility codes 
LOG_KERN		= 0		#  kernel messages 
LOG_USER		= 1		#  random user-level messages 
LOG_MAIL		= 2		#  mail system 
LOG_DAEMON		= 3		#  system daemons 
LOG_AUTH		= 4		#  security/authorization messages 
LOG_SYSLOG		= 5		#  messages generated internally by syslogd 
LOG_LPR			= 6		#  line printer subsystem 
LOG_NEWS		= 7		#  network news subsystem 
LOG_UUCP		= 8		#  UUCP subsystem 
LOG_CRON		= 9		#  clock daemon 
LOG_AUTHPRIV	= 10	#  security/authorization messages (private) 

#  other codes through 15 reserved for system use 
LOG_LOCAL0		= 16		#  reserved for local use 
LOG_LOCAL1		= 17		#  reserved for local use 
LOG_LOCAL2		= 18		#  reserved for local use 
LOG_LOCAL3		= 19		#  reserved for local use 
LOG_LOCAL4		= 20		#  reserved for local use 
LOG_LOCAL5		= 21		#  reserved for local use 
LOG_LOCAL6		= 22		#  reserved for local use 
LOG_LOCAL7		= 23		#  reserved for local use 

priority_names = {
	"alert":	LOG_ALERT,
	"crit":		LOG_CRIT,
	"debug":	LOG_DEBUG,
	"emerg":	LOG_EMERG,
	"err":		LOG_ERR,
	"error":	LOG_ERR,		#  DEPRECATED 
	"info":		LOG_INFO,
	"notice":	LOG_NOTICE,
	"panic": 	LOG_EMERG,		#  DEPRECATED 
	"warn":		LOG_WARNING,		#  DEPRECATED 
	"warning":	LOG_WARNING,
	}

facility_names = {
	"auth":		LOG_AUTH,
	"authpriv":	LOG_AUTHPRIV,
	"cron": 	LOG_CRON,
	"daemon":	LOG_DAEMON,
	"kern":		LOG_KERN,
	"lpr":		LOG_LPR,
	"mail":		LOG_MAIL,
	"news":		LOG_NEWS,
	"security":	LOG_AUTH,		#  DEPRECATED 
	"syslog":	LOG_SYSLOG,
	"user":		LOG_USER,
	"uucp":		LOG_UUCP,
	"local0":	LOG_LOCAL0,
	"local1":	LOG_LOCAL1,
	"local2":	LOG_LOCAL2,
	"local3":	LOG_LOCAL3,
	"local4":	LOG_LOCAL4,
	"local5":	LOG_LOCAL5,
	"local6":	LOG_LOCAL6,
	"local7":	LOG_LOCAL7,
	}

import socket

class syslog_client:
	def __init__ (self, address='/dev/log'):
		self.address = address
		if type (address) == type(''):
			self.socket = socket.socket (socket.AF_UNIX, socket.SOCK_STREAM)
			self.socket.connect (address)
			self.unix = 1
		else:
			self.socket = socket.socket (socket.AF_INET, socket.SOCK_DGRAM)
			self.unix = 0

	# curious: when talking to the unix-domain '/dev/log' socket, a
	#   zero-terminator seems to be required.  this string is placed
	#   into a class variable so that it can be overridden if
	#   necessary.

	log_format_string = '<%d>%s\000'

	def log (self, message, facility=LOG_USER, priority=LOG_INFO):
		message = self.log_format_string % (
			self.encode_priority (facility, priority),
			message
			)
		if self.unix:
			self.socket.send (message)
		else:
			self.socket.sendto (message, self.address)

	def encode_priority (self, facility, priority):
		if type(facility) == type(''):
			facility = facility_names[facility]
		if type(priority) == type(''):
			priority = priority_names[priority]			
		return (facility<<3) | priority

	def close (self):
		if self.unix:
			self.socket.close()

Zope-2.0.1-ZEO-nonbin/lib/python/Zope/ZLogger/syslogLogger.py100644   1007   1403        1107  6745213561  23723 0ustar  petrillipetrillifrom syslog import syslog_client
import os, string

class syslogLogger:
    """ a syslog Logger """

    def __init__(self):
        if os.environ.has_key('ZSYSLOG_SERVER'):
            (addr, port) = string.split(os.environ['ZSYSLOG_SERVER'], ':')
            self.client = syslog_client((addr, int(port)))
            self.on = 1
        elif os.environ.has_key('ZSYSLOG'):
            self.client = syslog_client()
            self.on = 1
        else:
            self.on = 0

    def __call__(self, sub, sev, sum, det, err):
        if self.on:
            self.client.log(sum)
Zope-2.0.1-ZEO-nonbin/lib/python/Zope/ClassFactory.py100644   1007   1403       10311  6733546652  22313 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################
"""Zope Framework Class Finder
"""
from string import strip
import OFS.Uninstalled

def ClassFactory(jar, module, name,
                  _silly=('__doc__',), _globals={},
                  ):
    try:
        if module[:1]=='*':
            # ZCLass! Yee ha!
            return jar.root()['ZGlobals'][module]
        else:
            m=__import__(module, _globals, _globals, _silly)

        return getattr(m, name)
    except:
        return OFS.Uninstalled.Broken(jar, None, (module, name))
Zope-2.0.1-ZEO-nonbin/lib/python/Zope/__init__.py100644   1007   1403       16635  6761620240  21457 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################
"""Initialize the Zope Package and provide a published module
"""

#######################################################################
# We need to get the right BTree extensions loaded
import sys, os, App.FindHomes
sys.path.insert(0, os.path.join(SOFTWARE_HOME, 'ZopeZODB3'))
#######################################################################

import ZODB, ZODB.ZApplication, imp
import Globals, OFS.Application, sys

Globals.BobobaseName = '%s/Data.fs' % Globals.data_dir
Globals.DatabaseVersion='3'

# Import products
OFS.Application.import_products()

# Open the database
try:
    # Try to use custom storage
    m=imp.find_module('custom_zodb',[INSTANCE_HOME])
except:
    import ZODB.FileStorage
    DB=ZODB.FileStorage.FileStorage(Globals.BobobaseName)
else:
    m=imp.load_module('Zope.custom_zodb', m[0], m[1], m[2])
    DB=m.Storage
    Globals.BobobaseName = DB.getName()
    sys.modules['Zope.custom_zodb']=m

DB=ZODB.DB(DB)
Globals.DB=DB # Ick, this is temporary until we come up with some registry
Globals.opened.append(DB)
import ClassFactory
DB.setClassFactory(ClassFactory.ClassFactory)

# Set up the "application" object that automagically opens
# connections
app=bobo_application=ZODB.ZApplication.ZApplicationWrapper(
    DB, 'Application', OFS.Application.Application, (),
    Globals.VersionNameName)

# Initialize products:
c=app()
OFS.Application.initialize(c)
c._p_jar.close()
del c

# This is sneaky, but we don't want to play with Main:
sys.modules['Main']=sys.modules['Zope']

import ZODB.POSException, ZPublisher, string, ZPublisher, AccessControl.User
import ExtensionClass
from zLOG import LOG, INFO

def debug(*args, **kw):
    return apply(ZPublisher.test,('Zope',)+args, kw)

class RequestContainer(ExtensionClass.Base):
        def __init__(self,r): self.REQUEST=r

def zpublisher_exception_hook(
    published, REQUEST, t, v, traceback,
    # static
    StringType=type(''),
    lower=string.lower,
    ConflictError=ZODB.POSException.ConflictError,
    ListType=type([]),
    ):
    try:
        if ((type(t) is StringType and
             lower(t) in ('unauthorized', 'redirect'))
            or t is SystemExit):
            raise
        if t is ConflictError:
            # now what
            # First, we need to close the current connection. We'll
            # do this by releasing the hold on it. There should be
            # some sane protocol for this, but for now we'll use
            # brute force:
            LOG('Z2 CONFLICT', INFO,
                'Competing writes at, %s' % REQUEST.get('PATH_INFO', ''))
            raise ZPublisher.Retry

        if (getattr(REQUEST.get('RESPONSE', None), '_error_format', '')
            !='text/html'): raise

        if (published is None or published is app or
            type(published) is ListType):
            # At least get the top-lebel object
            published=app.__bobo_traverse__(REQUEST).__of__(
                RequestContainer(REQUEST))

        get_transaction().begin() # Just to be sure.

        published=getattr(published, 'im_self', published)
        while 1:
            f=getattr(published, 'raise_standardErrorMessage', None)
            if f is None:
                published=getattr(published, 'aq_parent', None)
                if published is None: raise
            else:
                break

        client=published
        while 1:
            if getattr(client, 'standard_error_message', None) is not None:
                break
            client=getattr(client, 'aq_parent', None)
            if client is None: raise

        if REQUEST.get('AUTHENTICATED_USER', None) is None:
            REQUEST['AUTHENTICATED_USER']=AccessControl.User.nobody


        f(client, REQUEST, t, v, traceback)
        
    finally: traceback=None
Zope-2.0.1-ZEO-nonbin/lib/python/webdav/ 40755   1007   1403           0  6772126761  17564 5ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/webdav/Collection.py100644   1007   1403       14666  6723265447  22364 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################

"""WebDAV support - collection objects."""

__version__='$Revision: 1.16 $'[11:-2]

import sys, os, string, Globals
from common import urlfix, rfc1123_date
from Resource import Resource
from urllib import unquote


class Collection(Resource):
    """The Collection class provides basic WebDAV support for
    collection objects. It provides default implementations 
    for all supported WebDAV HTTP methods. The behaviors of some
    WebDAV HTTP methods for collections are slightly different
    than those for non-collection resources."""

    __dav_collection__=1

    def dav__init(self, request, response):
        # We are allowed to accept a url w/o a trailing slash
        # for a collection, but are supposed to provide a
        # hint to the client that it should be using one.
        # [WebDAV, 5.2]
        pathinfo=request.get('PATH_INFO','')
        if pathinfo and pathinfo[-1] != '/':
            location='%s/' % request['URL1']
            response.setHeader('Content-Location', location)
        response.setHeader('Connection', 'close', 1)
        response.setHeader('Date', rfc1123_date(), 1)
        response.setHeader('MS-Author-Via', 'DAV')

    def HEAD(self, REQUEST, RESPONSE):
        """Retrieve resource information without a response body."""
        self.dav__init(REQUEST, RESPONSE)
        if hasattr(self, 'aq_base') and hasattr(self.aq_base, 'index_html'):
            if hasattr(self.index_html, 'HEAD'):
                return self.index_html.HEAD(REQUEST, RESPONSE)
            raise 'Method Not Allowed', (
                  'Method not supported for this resource.'
                  )
        raise 'Not Found', 'The requested resource does not exist.'

    def PUT(self, REQUEST, RESPONSE):
        """The PUT method has no inherent meaning for collection
        resources, though collections are not specifically forbidden
        to handle PUT requests. The default response to a PUT request
        for collections is 405 (Method Not Allowed)."""
        self.dav__init(REQUEST, RESPONSE)
        raise 'Method Not Allowed', 'Method not supported for collections.'

    def DELETE(self, REQUEST, RESPONSE):
        """Delete a collection resource. For collection resources, DELETE
        may return either 200 (OK) or 204 (No Content) to indicate total
        success, or may return 207 (Multistatus) to indicate partial
        success. Note that in Zope a DELETE currently never returns 207."""
        self.dav__init(REQUEST, RESPONSE)
        url=urlfix(REQUEST['URL'], 'DELETE')
        name=unquote(filter(None, string.split(url, '/'))[-1])
        # TODO: add lock checking here
        self.aq_parent._delObject(name)
        RESPONSE.setStatus(204)
        return RESPONSE


Globals.default__class_init__(Collection)
Zope-2.0.1-ZEO-nonbin/lib/python/webdav/NullResource.py100644   1007   1403       16505  6713362010  22664 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################

"""WebDAV support - null resource objects."""

__version__='$Revision: 1.22 $'[11:-2]

import sys, os, string, mimetypes, Globals
import Acquisition, OFS.content_types
from common import absattr, aq_base, urlfix
from AccessControl.Permission import Permission
from Resource import Resource
from Globals import Persistent


class NullResource(Persistent, Acquisition.Implicit, Resource):
    """Null resources are used to handle HTTP method calls on
    objects which do not yet exist in the url namespace."""

    __null_resource__=1

    __ac_permissions__=(
        ('View',                             ('HEAD',)),
        ('Add Documents, Images, and Files', ('PUT',)),
        ('Add Folders',                      ('MKCOL',)),
    )

    def __init__(self, parent, name, request=None):
        self.__name__=name
        self.__parent__=parent

    def __bobo_traverse__(self, REQUEST, name=None):
        # We must handle traversal so that we can recognize situations
        # where a 409 Conflict must be returned instead of the normal
        # 404 Not Found, per [WebDAV 8.3.1].
        try:    return getattr(self, name)
        except: pass
        method=REQUEST.get('REQUEST_METHOD', 'GET')
        if method in ('PUT', 'MKCOL'):
            raise 'Conflict', 'Collection ancestors must already exist.'
        raise 'Not Found', 'The requested resource was not found.'

    def HEAD(self, REQUEST, RESPONSE):
        """Retrieve resource information without a response message body."""
        self.dav__init(REQUEST, RESPONSE)
        raise 'Not Found', 'The requested resource does not exist.'

    # Most methods return 404 (Not Found) for null resources.
    DELETE=OPTIONS=TRACE=PROPFIND=PROPPATCH=COPY=MOVE=HEAD

    def PUT(self, REQUEST, RESPONSE):
        """Create a new non-collection resource."""
        self.dav__init(REQUEST, RESPONSE)
        type=REQUEST.get_header('content-type', None)
        body=REQUEST.get('BODY', '')
        name=self.__name__
        if type is None:
            type, enc=OFS.content_types.guess_content_type(name, body)
        from OFS.Image import Image, File
        if type in ('text/html', 'text/xml', 'text/plain'):
            self.__parent__.manage_addDTMLDocument(name, '', body)
        elif type[:6]=='image/':
            ob=Image(name, '', body, content_type=type)
            self.__parent__._setObject(name, ob)
        else:
            ob=File(name, '', body, content_type=type)
            self.__parent__._setObject(name, ob)
        RESPONSE.setStatus(201)
        RESPONSE.setBody('')
        return RESPONSE

    def MKCOL(self, REQUEST, RESPONSE):
        """Create a new collection resource."""
        self.dav__init(REQUEST, RESPONSE)
        if REQUEST.get('BODY', ''):
            raise 'Unsupported Media Type', 'Unknown request body.'
        parent=self.__parent__
        name=self.__name__
        if hasattr(aq_base(parent), name):
            raise 'Method Not Allowed', 'The name %s is in use.' % name
        if not hasattr(parent, '__dav_collection__'):
            raise 'Forbidden', 'Cannot create collection at this location.'
        parent.manage_addFolder(name)
        RESPONSE.setStatus(201)
        RESPONSE.setBody('')
        return RESPONSE

    def LOCK(self, REQUEST, RESPONSE):
        """Create a lock-null resource."""
        self.dav__init(REQUEST, RESPONSE)
        raise 'Method Not Allowed', 'Method not supported for this resource.'
    
    def UNLOCK(self):
        """Remove a lock-null resource."""
        self.dav__init(REQUEST, RESPONSE)
        raise 'Method Not Allowed', 'Method not supported for this resource.'



Globals.default__class_init__(NullResource)
Zope-2.0.1-ZEO-nonbin/lib/python/webdav/Resource.py100644   1007   1403       37156  6734504305  22046 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################

"""WebDAV support - resource objects."""

__version__='$Revision: 1.27 $'[11:-2]

import sys, os, string, mimetypes, davcmds, ExtensionClass
from common import absattr, aq_base, urlfix, rfc1123_date
from urllib import quote, unquote
import Globals

class Resource(ExtensionClass.Base):
    """The Resource mixin class provides basic WebDAV support for
    non-collection objects. It provides default implementations
    for most supported WebDAV HTTP methods, however certain methods
    such as PUT should be overridden to ensure correct behavior in
    the context of the object type."""

    __dav_resource__=1

    __http_methods__=('GET', 'HEAD', 'POST', 'PUT', 'DELETE', 'OPTIONS',
                      'TRACE', 'PROPFIND', 'PROPPATCH', 'MKCOL', 'COPY',
                      'MOVE',
                      )

    __ac_permissions__=(
        ('View',                             ('HEAD',)),
        ('Access contents information',      ('PROPFIND',)),
        ('Manage properties',                ('PROPPATCH',)),
        ('Delete objects',                   ('DELETE',)),
    )

    def dav__init(self, request, response):
        # Init expected HTTP 1.1 / WebDAV headers which are not
        # currently set by the response object automagically.
        # Note we set an borg-specific header for ie5 :(
        response.setHeader('Connection', 'close', 1)
        response.setHeader('Date', rfc1123_date(), 1)
        response.setHeader('MS-Author-Via', 'DAV')

    def dav__validate(self, object, methodname, REQUEST):
        msg='You are not authorized to access this resource.'
        method=None
        if hasattr(object, methodname):
            method=getattr(object, methodname)
        else:
            try:    method=object.aq_acquire(methodname)
            except: method=None
        if (method is not None) and hasattr(method, '__roles__'):
            roles=method.__roles__
            user=REQUEST.get('AUTHENTICATED_USER', None)
            __traceback_info__=methodname, str(roles), user
            if (not hasattr(user, 'hasRole') or not user.hasRole(None, roles)):
                raise 'Unauthorized', msg
            return 1
        raise 'Unauthorized', msg


    # WebDAV class 1 support

    def HEAD(self, REQUEST, RESPONSE):
        """Retrieve resource information without a response body."""
        self.dav__init(REQUEST, RESPONSE)
        if hasattr(self, 'content_type'):
            RESPONSE.setHeader('Content-Type', absattr(self.content_type))
        else:
            url=urlfix(REQUEST['URL'], 'HEAD')
            name=unquote(filter(None, string.split(url, '/'))[-1])
            ct, ce=mimetypes.guess_type(name)
            # Could try harder here...
            ct=ct or 'application/octet-stream'
            ct=string.lower(ct)
            RESPONSE.setHeader('Content-Type', ct)
        if hasattr(aq_base(self), 'get_size'):
            RESPONSE.setHeader('Content-Length', absattr(self.get_size))
        if hasattr(self, '_p_mtime'):
            mtime=rfc1123_date(self._p_mtime)
            RESPONSE.setHeader('Last-Modified', mtime)
        RESPONSE.setStatus(200)
        return RESPONSE

    def PUT(self, REQUEST, RESPONSE):
        """Replace the GET response entity of an existing resource.        
        Because this is often object-dependent, objects which handle
        PUT should override the default PUT implementation with an
        object-specific implementation. By default, PUT requests
        fail with a 405 (Method Not Allowed)."""
        self.dav__init(REQUEST, RESPONSE)
        raise 'Method Not Allowed', 'Method not supported for this resource.'

    OPTIONS__roles__=None
    def OPTIONS(self, REQUEST, RESPONSE):
        """Retrieve communication options."""
        self.dav__init(REQUEST, RESPONSE)
        RESPONSE.setHeader('Allow', string.join(self.__http_methods__,', '))
        RESPONSE.setHeader('Content-Length', 0)
        RESPONSE.setHeader('DAV', '1', 1)
        RESPONSE.setStatus(200)
        return RESPONSE

    TRACE__roles__=None
    def TRACE(self, REQUEST, RESPONSE):
        """Return the HTTP message received back to the client as the
        entity-body of a 200 (OK) response. This will often usually
        be intercepted by the web server in use. If not, the TRACE
        request will fail with a 405 (Method Not Allowed), since it
        is not often possible to reproduce the HTTP request verbatim
        from within the Zope environment."""
        self.dav__init(REQUEST, RESPONSE)
        raise 'Method Not Allowed', 'Method not supported for this resource.'

    def DELETE(self, REQUEST, RESPONSE):
        """Delete a resource. For non-collection resources, DELETE may
        return either 200 or 204 (No Content) to indicate success."""
        self.dav__init(REQUEST, RESPONSE)
        url=urlfix(REQUEST['URL'], 'DELETE')
        name=unquote(filter(None, string.split(url, '/'))[-1])
        # TODO: add lock checking here
        self.aq_parent._delObject(name)
        RESPONSE.setStatus(204)
        return RESPONSE

    def PROPFIND(self, REQUEST, RESPONSE):
        """Retrieve properties defined on the resource."""
        self.dav__init(REQUEST, RESPONSE)
        cmd=davcmds.PropFind(REQUEST)
        result=cmd.apply(self)
        RESPONSE.setStatus(207)
        RESPONSE.setHeader('Content-Type', 'text/xml; charset="utf-8"')
        RESPONSE.setBody(result)
        return RESPONSE

    def PROPPATCH(self, REQUEST, RESPONSE):
        """Set and/or remove properties defined on the resource."""
        self.dav__init(REQUEST, RESPONSE)
        if not hasattr(aq_base(self), 'propertysheets'):
            raise 'Method Not Allowed', (
                  'Method not supported for this resource.')
        # TODO: add lock checking here
        cmd=davcmds.PropPatch(REQUEST)
        result=cmd.apply(self)
        RESPONSE.setStatus(207)
        RESPONSE.setHeader('Content-Type', 'text/xml; charset="utf-8"')
        RESPONSE.setBody(result)
        return RESPONSE

    def MKCOL(self, REQUEST, RESPONSE):
        """Create a new collection resource. If called on an existing 
        resource, MKCOL must fail with 405 (Method Not Allowed)."""
        self.dav__init(REQUEST, RESPONSE)
        raise 'Method Not Allowed', 'The resource already exists.'

    def COPY(self, REQUEST, RESPONSE):
        """Create a duplicate of the source resource whose state
        and behavior match that of the source resource as closely
        as possible. Though we may later try to make a copy appear
        seamless across namespaces (e.g. from Zope to Apache), COPY 
        is currently only supported within the Zope namespace."""
        self.dav__init(REQUEST, RESPONSE)
        if not hasattr(aq_base(self), 'cb_isCopyable') or \
           not self.cb_isCopyable():
            raise 'Method Not Allowed', 'This object may not be copied.'
        depth=REQUEST.get_header('Depth', 'infinity')
        if not depth in ('0', 'infinity'):
            raise 'Bad Request', 'Invalid Depth header.'
        dest=REQUEST.get_header('Destination', '')
        while dest and dest[-1]=='/':
            dest=dest[:-1]
        if not dest:
            raise 'Bad Request', 'Invalid Destination header.'
        oflag=string.upper(REQUEST.get_header('Overwrite', 'F'))
        if not oflag in ('T', 'F'):
            raise 'Bad Request', 'Invalid Overwrite header.'
        path, name=os.path.split(dest)
        name=unquote(name)
        try: parent=REQUEST.resolve_url(path)
        except ValueError:
            raise 'Conflict', 'Attempt to copy to an unknown namespace.'
        except 'Not Found':
            raise 'Conflict', 'Object ancestors must already exist.'
        except: raise sys.exc_type, sys.exc_value
        if hasattr(parent, '__null_resource__'):
            raise 'Conflict', 'Object ancestors must already exist.'
        existing=hasattr(aq_base(parent), name)
        if existing and oflag=='F':
            raise 'Precondition Failed', 'Destination resource exists.'
        try: parent._checkId(name, allow_dup=1)
        except: raise 'Forbidden', sys.exc_value
        try: parent._verifyObjectPaste(self, REQUEST)
        except 'Unauthorized':
            raise 'Unauthorized', sys.exc_value
        except: raise 'Forbidden', sys.exc_value
        #try: self._notifyOfCopyTo(parent, op=0)
        #except: raise 'Forbidden', sys.exc_value
        ob=self._getCopy(parent)
        ob.manage_afterClone(ob)
        ob._setId(name)
        if depth=='0' and hasattr(ob, '__dav_collection__'):
            for id in ob.objectIds():
                ob._delObject(id)
        if existing:
            object=getattr(parent, name)
            self.dav__validate(object, 'DELETE', REQUEST)
            parent._delObject(name)
        parent._setObject(name, ob)
        #ob=ob.__of__(parent)
        #ob._postCopy(parent, op=0)
        RESPONSE.setStatus(existing and 204 or 201)
        if not existing:
            RESPONSE.setHeader('Location', dest)
        RESPONSE.setBody('')
        return RESPONSE

    def MOVE(self, REQUEST, RESPONSE):
        """Move a resource to a new location. Though we may later try to
        make a move appear seamless across namespaces (e.g. from Zope
        to Apache), MOVE is currently only supported within the Zope
        namespace."""
        self.dav__init(REQUEST, RESPONSE)
        self.dav__validate(self, 'DELETE', REQUEST)
        if not hasattr(aq_base(self), 'cb_isMoveable') or \
           not self.cb_isMoveable():
            raise 'Method Not Allowed', 'This object may not be moved.'
        dest=REQUEST.get_header('Destination', '')
        while dest and dest[-1]=='/':
            dest=dest[:-1]
        if not dest:
            raise 'Bad Request', 'No destination given'
        flag=REQUEST.get_header('Overwrite', 'F')
        flag=string.upper(flag)
        body=REQUEST.get('BODY', '')
        path, name=os.path.split(dest)
        name=unquote(name)
        try: parent=REQUEST.resolve_url(path)
        except ValueError:
            raise 'Conflict', 'Attempt to move to an unknown namespace.'
        except 'Not Found':
            raise 'Conflict', 'The resource %s must exist.' % path
        except: raise sys.exc_type, sys.exc_value
        if hasattr(parent, '__null_resource__'):
            raise 'Conflict', 'The resource %s must exist.' % path
        existing=hasattr(aq_base(parent), name)
        if existing and flag=='F':
            raise 'Precondition Failed', 'Resource %s exists.' % dest
        try: parent._checkId(name, allow_dup=1)
        except: raise 'Forbidden', sys.exc_value
        try: parent._verifyObjectPaste(self, REQUEST)
        except: raise 'Forbidden', sys.exc_value
        #try: self._notifyOfCopyTo(parent, op=1)
        #except: raise 'Forbidden', sys.exc_value        
        ob=aq_base(self._getCopy(parent))
        self.aq_parent._delObject(absattr(self.id))
        ob._setId(name)
        if existing:
            object=getattr(parent, name)
            self.dav__validate(object, 'DELETE', REQUEST)
            parent._delObject(name)            
        parent._setObject(name, ob)
        #ob=ob.__of__(parent)
        #ob._postCopy(parent, op=1)
        RESPONSE.setStatus(existing and 204 or 201)
        if not existing:
            RESPONSE.setHeader('Location', dest)
        RESPONSE.setBody('')
        return RESPONSE


    # WebDAV Class 2 support

    def LOCK(self, REQUEST, RESPONSE):
        """A write lock MUST prevent a principal without the lock from
        successfully executing a PUT, POST, PROPPATCH, LOCK, UNLOCK, MOVE,
        DELETE, or MKCOL on the locked resource.  All other current methods,
        GET in particular, function independently of the lock.
        """
        self.dav__init(REQUEST, RESPONSE)
        raise 'Method Not Allowed', 'Method not supported for this resource.'
    
    def UNLOCK(self):
        """Remove an existing lock on a resource."""
        self.dav__init(REQUEST, RESPONSE)
        raise 'Method Not Allowed', 'Method not supported for this resource.'


Globals.default__class_init__(Resource)
Zope-2.0.1-ZEO-nonbin/lib/python/webdav/__init__.py100644   1007   1403       11736  6671760126  22017 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################

"""The webdav package provides WebDAV capability for common Zope objects.

   Current WebDAV support in Zope provides for the correct handling of HTTP
   GET, HEAD, POST, PUT, DELETE, OPTIONS, TRACE, PROPFIND, PROPPATCH, MKCOL, 
   COPY and MOVE methods, as appropriate for the object that is the target
   of the operation. Objects which do not support a given operation should
   respond appropriately with a "405 Method Not Allowed" response.

   Note that the ability of a Zope installation to support WebDAV HTTP methods
   depends on the willingness of the web server to defer handling of those
   methods to the Zope process. In most cases, servers will allow the process
   to handle any request, so the Zope portion of your url namespace may well 
   be able to handle WebDAV operations even though your web server software 
   is not WebDAV-aware itself. Zope installations which use bundled server
   implementations such as ZopeHTTPServer or ZServer should fully support 
   WebDAV functions.


   References:
   
   [WebDAV] Y. Y. Goland, E. J. Whitehead, Jr., A. Faizi, S. R. Carter, D. 
   Jensen, "HTTP Extensions for Distributed Authoring - WebDAV." RFC 2518.  
   Microsoft, U.C. Irvine, Netscape, Novell.  February, 1999."""

__version__='$Revision: 1.5 $'[11:-2]
Zope-2.0.1-ZEO-nonbin/lib/python/webdav/client.py100644   1007   1403       47216  6743410037  21531 0ustar  petrillipetrilli"""HTTP 1.1 / WebDAV client library."""

__version__='$Revision: 1.10 $'[11:-2]

import sys, os, string, regex, time, types
import socket, httplib, mimetools
from types import FileType
from mimetypes import guess_type
from base64 import encodestring
from cStringIO import StringIO
from whrandom import random
from urllib import quote


    

class HTTP(httplib.HTTP):
    # A revised version of the HTTP class that can do basic
    # HTTP 1.1 connections, and also compensates for a bug
    # that occurs on some platforms in 1.5 and 1.5.1 with
    # socket.makefile().read()

    read_bug=sys.version[:5] in ('1.5 (','1.5.1')

    def putrequest(self, request, selector, ver='1.1'):
        selector=selector or '/'
        str = '%s %s HTTP/%s\r\n' % (request, selector, ver)
        self.send(str)

    def getreply(self):
        file=self.sock.makefile('rb')
        data=string.join(file.readlines(), '')
        file.close()
        self.file=StringIO(data)
        line = self.file.readline()
        try:
            [ver, code, msg] = string.split(line, None, 2)
        except ValueError:
          try:
              [ver, code] = string.split(line, None, 1)
              msg = ""
          except ValueError:
              return -1, line, None
        if ver[:5] != 'HTTP/':
            return -1, line, None
        code=string.atoi(code)
        msg =string.strip(msg)
        headers =mimetools.Message(self.file, 0)
        return ver, code, msg, headers


class Resource:
    """An object representing a web resource."""

    def __init__(self, url, username=None, password=None):
        self.username=username
        self.password=password
        self.url=url
        if urlregex.match(url) >= 0:
            host,port,uri=urlregex.group(1,2,3)
            self.host=host
            self.port=port and string.atoi(port[1:]) or 80
            self.uri=uri or '/'
        else: raise ValueError, url

    def __getattr__(self, name):
        url=os.path.join(self.url, name)
        return self.__class__(url, username=self.username,
                              password=self.password)

    def __get_headers(self, kw={}):
        headers={}
        headers=self.__set_authtoken(headers)
        headers['User-Agent']='WebDAV.client %s' % __version__
        headers['Host']=self.host
        headers['Connection']='close'
        headers['Accept']='*/*'
        if kw.has_key('headers'):
            for name, val in kw['headers'].items():
                headers[name]=val
            del kw['headers']
        return headers

    def __set_authtoken(self, headers, atype='Basic'):
        if not (self.username and self.password):
            return headers
        if headers.has_key('Authorization'):
            return headers
        if atype=='Basic':
            headers['Authorization']=(
                "Basic %s" % string.replace(encodestring('%s:%s' % (self.username,self.password)),
					    '\012',''))
            return headers
        raise ValueError, 'Unknown authentication scheme: %s' % atype

    def __enc_formdata(self, args={}):
        formdata=[]
        for key, val in args.items():
            n=string.rfind(key, '__')
            if n > 0:
                tag=key[n+2:]
                key=key[:n]
            else: tag='string'
            func=varfuncs.get(tag, marshal_string)
            formdata.append(func(key, val))
        return string.join(formdata, '&')

    def __enc_multipart(self, args={}):
        return MultiPart(args).render()

    def __snd_request(self, method, uri, headers={}, body='', eh=1):
        try:
            h=HTTP()
            h.connect(self.host, self.port)
            h.putrequest(method, uri)
            for n, v in headers.items():
                h.putheader(n, v)
            if eh: h.endheaders()
            if body: h.send(body)
            ver, code, msg, hdrs=h.getreply()
            data=h.getfile().read()
            h.close()
        except:
            raise 'NotAvailable', sys.exc_value
        return http_response(ver, code, msg, hdrs, data)
    
    # HTTP methods

    def get(self, **kw):
        headers=self.__get_headers(kw)
        query=self.__enc_formdata(kw)
        uri=query and '%s?%s' % (self.uri, query) or self.uri
        return self.__snd_request('GET', uri, headers)

    def head(self, **kw):
        headers=self.__get_headers(kw)
        query=self.__enc_formdata(kw)
        uri=query and '%s?%s' % (self.uri, query) or self.uri
        return self.__snd_request('HEAD', uri, headers)

    def post(self, **kw):
        headers=self.__get_headers(kw)
        content_type=None
        for key, val in kw.items():
            if (key[-6:]=='__file') or hasattr(val, 'read'):
                content_type='multipart/form-data'
                break
        if content_type=='multipart/form-data':
            body=self.__enc_multipart(kw)
            return self.__snd_request('POST', self.uri, headers, body, eh=0)
        else:
            body=self.__enc_formdata(kw)
            headers['Content-Type']='application/x-www-form-urlencoded'
            headers['Content-Length']=str(len(body))
            return self.__snd_request('POST', self.uri, headers, body)

    def put(self, file='', content_type='', content_enc='',
            isbin=regex.compile('[\0-\6\177-\277]').search,
            **kw):
        headers=self.__get_headers(kw)
        filetype=type(file)
        if filetype is type('') and (isbin(file) < 0) and \
           os.path.exists(file):
            ob=open(file, 'rb')
            body=ob.read()
            ob.close()
            c_type, c_enc=guess_type(file)
        elif filetype is FileType:
            body=file.read()
            c_type, c_enc=guess_type(file.name)
        elif filetype is type(''):
            body=file
            c_type, c_enc=guess_type(self.url)
        else:
            raise ValueError, 'File must be a filename, file or string.'
        content_type=content_type or c_type
        content_enc =content_enc or c_enc
        if content_type: headers['Content-Type']=content_type
        if content_enc:  headers['Content-Encoding']=content_enc
        headers['Content-Length']=str(len(body))
        return self.__snd_request('PUT', self.uri, headers, body)

    def options(self, **kw):
        headers=self.__get_headers(kw)
        return self.__snd_request('OPTIONS', self.uri, headers)

    def trace(self, **kw):
        headers=self.__get_headers(kw)
        return self.__snd_request('TRACE', self.uri, headers)

    def delete(self, **kw):
        headers=self.__get_headers(kw)
        return self.__snd_request('DELETE', self.uri, headers)

    def propfind(self, body='', depth=0, **kw):
        headers=self.__get_headers(kw)
        headers['Depth']=str(depth)
        headers['Content-Type']='text/xml; charset="utf-8"'
        headers['Content-Length']=str(len(body))
        return self.__snd_request('PROPFIND', self.uri, headers, body)

    def proppatch(self, body, **kw):
        headers=self.__get_headers(kw)
        if body: headers['Content-Type']='text/xml; charset="utf-8"'
        headers['Content-Length']=str(len(body))
        return self.__snd_request('PROPPATCH', self.uri, headers, body)

    def copy(self, dest, depth='infinity', overwrite=0, **kw):
        """Copy a resource to the specified destination."""
        headers=self.__get_headers(kw)
        headers['Overwrite']=overwrite and 'T' or 'F'
        headers['Destination']=dest
        headers['Depth']=depth
        return self.__snd_request('COPY', self.uri, headers)

    def move(self, dest, depth='infinity', overwrite=0, **kw):
        """Move a resource to the specified destination."""
        headers=self.__get_headers(kw)
        headers['Overwrite']=overwrite and 'T' or 'F'
        headers['Destination']=dest
        headers['Depth']=depth
        return self.__snd_request('MOVE', self.uri, headers)

    def mkcol(self, **kw):
        headers=self.__get_headers(kw)
        return self.__snd_request('MKCOL', self.uri, headers)

    # class 2 support

    def lock(self, scope='exclusive', type='write', owner='',
             depth='infinity', timeout='Infinite', **kw):
        """Create a lock with the specified scope, type, owner, depth
        and timeout on the resource. A locked resource prevents a principal
        without the lock from executing a PUT, POST, PROPPATCH, LOCK, UNLOCK,
        MOVE, DELETE, or MKCOL on the locked resource."""
        if not scope in ('shared', 'exclusive'):
            raise ValueError, 'Invalid lock scope.'
        if not type in ('write',):
            raise ValueError, 'Invalid lock type.'
        if not depth in ('0', 'infinity'):
            raise ValueError, 'Invalid depth.'
        headers=self.__get_headers(kw)
        body='\n' \
             '\n' \
             '  \n' \
             '  \n' \
             '  \n' \
             '  %s\n' \
             '  \n' \
             '' % (scope, type, owner)
        headers['Content-Type']='text/xml; charset="utf-8"'
        headers['Content-Length']=str(len(body))
        headers['Timeout']=timeout
        headers['Depth']=depth
        return self.__snd_request('LOCK', self.uri, headers, body)

    def unlock(self, token, **kw):
        """Remove the lock identified by token from the resource and all
        other resources included in the lock.  If all resources which have
        been locked under the submitted lock token can not be unlocked the
        unlock method will fail."""
        headers=self.__get_headers(kw)
        token='' % str(token)
        headers['Lock-Token']=token
        return self.__snd_request('UNLOCK', self.uri, headers, body)

    def allprops(self, depth=0):
        return self.propfind('', depth)

    def propnames(self, depth=0):
        body='\n' \
              '\n' \
              '  \n' \
              ''
        return self.propfind(body, depth)

    def getprops(self, *names):
        if not names: return self.propfind()
        tags=string.join(names, '/>\n  <')
        body='\n' \
              '\n' \
              '  \n' \
              '  <%s>\n' \
              '  \n' \
              '' % tags
        return self.propfind(body, 0)

    def setprops(self, **props):
        if not props:
            raise ValueError, 'No properties specified.'
        tags=[]
        for key, val in props.items():
            tags.append('  <%s>%s' % (key, val, key))
        tags=string.join(tags, '\n')
        body='\n' \
              '\n' \
              '\n' \
              '  \n' \
              '  %s\n' \
              '  \n' \
              '\n' \
              '' % tags
        return self.proppatch(body)

    def delprops(self, *names):
        if not names:
            raise ValueError, 'No property names specified.'
        tags=string.join(names, '/>\n  <')
        body='\n' \
              '\n' \
              '\n' \
              '  \n' \
              '  <%s>\n' \
              '  \n' \
              '\n' \
              '' % tags
        return self.proppatch(body)

    def __str__(self):
        return '' % self.url

    __repr__=__str__








class http_response:
    def __init__(self, ver, code, msg, headers, body):
        self.version=ver
        self.code=code
        self.msg=msg
        self.headers=headers
        self.body=body

    def get_status(self):
        return '%s %s' % (self.code, self.msg)

    def get_header(self, name, val=None):
        return self.headers.dict.get(string.lower(name), val)

    def get_headers(self):
        return self.headers.dict

    def get_body(self):
        return self.body

    def __str__(self):
        data=[]
        data.append('%s %s %s\r\n' % (self.version, self.code, self.msg))
        map(data.append, self.headers.headers)
        data.append('\r\n')
        data.append(self.body)
        return string.join(data, '')


set_xml="""
   
   
   
   Brian Lloyd
   My New Title
   
   
   
"""

funny="""
 
 
 
   Brian Lloyd
   blue
   72
   
     
       
         Brian Lloyd
       
     
   
   
     red
   
 
 

"""


rem_xml="""
   
   
   
   
   
   
   
   
"""

find_xml="""
   
     
          
          
          
     
   
"""



##############################################################################
# Implementation details below here

urlregex=regex.compile('http://\([^:/]+\)\(:[0-9]+\)?\(/.+\)?', regex.casefold)

def rfc1123_date(ts=None):
    # Return an RFC 1123 format date string, required for
    # use in HTTP Date headers per the HTTP 1.1 spec.
    if ts is None: ts=time.time()
    ts=time.asctime(time.gmtime(ts))
    ts=string.split(ts)
    return '%s, %s %s %s %s GMT' % (ts[0],ts[2],ts[1],ts[3],ts[4])

def marshal_string(name, val):
    return '%s=%s' % (name, quote(str(val)))

def marshal_float(name, val):
    return '%s:float=%s' % (name, val)

def marshal_int(name, val):
    return '%s:int=%s' % (name, val)

def marshal_long(name, val):
    return ('%s:long=%s' % (name, val))[:-1]

def marshal_list(name, seq, tname='list', lt=type([]), tt=type(())):
    result=[]
    for v in seq:
        tp=type(v)
        if tp in (lt, tt):
            raise TypeError, 'Invalid recursion in data to be marshaled.'
        result.append(marshal_var("%s:%s" % (name, tname), v))    
    return string.join(result, '&')

def marshal_tuple(name, seq):
    return marshal_list(name, seq, 'tuple')

varfuncs={}
vartypes=(('int',    type(1), marshal_int),
          ('float',  type(1.0), marshal_float),
          ('long',   type(1L), marshal_long),
          ('list',   type([]), marshal_list),
          ('tuple',  type(()), marshal_tuple),
          ('string', type(''), marshal_string),
          ('file',   types.FileType, None),
          )
for name, tp, func in vartypes:
    varfuncs[name]=func
    varfuncs[tp]=func

def marshal_var(name, val):
    return varfuncs.get(type(val), marshal_string)(name, val)



class MultiPart:
    def __init__(self,*args):
        c=len(args)
        if c==1:    name,val=None,args[0]
        elif c==2:  name,val=args[0],args[1]
        else:       raise ValueError, 'Invalid arguments'

        h={'Content-Type':              {'_v':''},
           'Content-Transfer-Encoding': {'_v':''},
           'Content-Disposition':       {'_v':''},
           }
        dt=type(val)
        b=t=None

        if dt==types.DictType:
            t=1
            b=self.boundary()
            d=[]
            h['Content-Type']['_v']='multipart/form-data; boundary=%s' % b
            for n,v in val.items():
                d.append(MultiPart(n,v))

        elif (dt==types.ListType) or (dt==types.TupleType):
            raise ValueError, 'Sorry, nested multipart is not done yet!'

        elif dt==types.FileType or hasattr(val,'read'):
            if hasattr(val,'name'):
                ct, enc=guess_type(val.name)
                if not ct: ct='application/octet-stream'
                fn=string.replace(val.name,'\\','/')
                fn=fn[(string.rfind(fn,'/')+1):]
            else:
                ct='application/octet-stream'
                enc=''
                fn=''

            enc=enc or (ct[:6] in ('image/', 'applic') and 'binary' or '')

            h['Content-Disposition']['_v']      ='form-data'
            h['Content-Disposition']['name']    ='"%s"' % name
            h['Content-Disposition']['filename']='"%s"' % fn
            h['Content-Transfer-Encoding']['_v']=enc
            h['Content-Type']['_v']             =ct
            d=[]
            l=val.read(8192)
            while l:
                d.append(l)
                l=val.read(8192)
        else:
            n=string.rfind(name, '__')
            if n > 0: name='%s:%s' % (name[:n], name[n+2:])
            h['Content-Disposition']['_v']='form-data'
            h['Content-Disposition']['name']='"%s"' % name
            d=[str(val)]

        self._headers =h
        self._data    =d
        self._boundary=b
        self._top     =t


    def boundary(self):
        return '%s_%s_%s' % (int(time.time()), os.getpid(), random())

    def render(self):
        join=string.join
        h=self._headers
        s=[]

        if self._top:
            for n,v in h.items():
                if v['_v']:
                    s.append('%s: %s' % (n,v['_v']))
                    for k in v.keys():
                        if k != '_v': s.append('; %s=%s' % (k, v[k]))
                    s.append('\n')
            p=[]
            t=[]
            b=self._boundary
            for d in self._data:
                p.append(d.render())
            t.append('--%s\n' % b)
            t.append(join(p,'\n--%s\n' % b))
            t.append('\n--%s--\n' % b)
            t=join(t,'')
            s.append('Content-Length: %s\n\n' % len(t))
            s.append(t)
            return join(s,'')

        else:
            for n,v in h.items():
                if v['_v']:
                    s.append('%s: %s' % (n,v['_v']))
                    for k in v.keys():
                        if k != '_v': s.append('; %s=%s' % (k, v[k]))
                    s.append('\n')
            s.append('\n')

            if self._boundary:
                p=[]
                b=self._boundary
                for d in self._data:
                    p.append(d.render())
                s.append('--%s\n' % b)
                s.append(join(p,'\n--%s\n' % b))
                s.append('\n--%s--\n' % b)
                return join(s,'')
            else:
                return join(s+self._data,'')


    _extmap={'':     'text/plain',
             'rdb':  'text/plain',
             'html': 'text/html',
             'dtml': 'text/html',
             'htm':  'text/html',
             'dtm':  'text/html',
             'gif':  'image/gif',
             'jpg':  'image/jpeg',
             'exe':  'application/octet-stream',
             None :  'application/octet-stream',
             }

    _encmap={'image/gif': 'binary',
             'image/jpg': 'binary',
             'application/octet-stream': 'binary',
             }


bri =Resource('http://tarzan.digicool.com/dev/brian3/',
              username='brian',
              password='123')
abri=Resource('http://tarzan.digicool.com/dev/brian3/')

dav =Resource('http://tarzan.digicool.com/dev/dav/',
              username='brian',
              password='123')
adav=Resource('http://tarzan.digicool.com/dev/dav/')

Zope-2.0.1-ZEO-nonbin/lib/python/webdav/common.py100644   1007   1403       12144  6744537110  21536 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################

"""Commonly used functions for WebDAV support modules."""

__version__='$Revision: 1.6 $'[11:-2]

import string, time, urllib



def absattr(attr):
    if callable(attr):
        return attr()
    return attr

def aq_base(ob):
    if hasattr(ob, 'aq_base'):
        return ob.aq_base
    return ob

def urlfix(url, s):
    n=len(s)
    if url[-n:]==s: url=url[:-n]
    if len(url) > 1 and url[-1]=='/':
        url=url[:-1]
    return url

def is_acquired(ob):
    # Return true if this object is not a direct
    # subobject of its aq_parent object.
    if not hasattr(ob, 'aq_parent'):
        return 0
    if hasattr(aq_base(ob.aq_parent), absattr(ob.id)):
        return 0
    if hasattr(aq_base(ob), 'isTopLevelPrincipiaApplicationObject') and \
            ob.isTopLevelPrincipiaApplicationObject:
        return 0
    return 1

def rfc1123_date(ts=None):
    # Return an RFC 1123 format date string, required for
    # use in HTTP Date headers per the HTTP 1.1 spec.
    if ts is None: ts=time.time()
    ts=time.asctime(time.gmtime(ts))
    ts=string.split(ts)
    return '%s, %s %s %s %s GMT' % (ts[0],ts[2],ts[1],ts[4],ts[3])


def urlbase(url, ftype=urllib.splittype, fhost=urllib.splithost):
    # Return a '/' based url such as '/foo/bar', removing
    # type, host and port information if necessary.
    if url[0]=='/': return url
    type, uri=ftype(url)
    host, uri=fhost(uri)
    return uri or '/'
Zope-2.0.1-ZEO-nonbin/lib/python/webdav/davcmds.py100644   1007   1403       34113  6723262675  21677 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################

"""WebDAV xml request objects."""

__version__='$Revision: 1.7 $'[11:-2]

import sys, os, string, regex
from common import absattr, aq_base, urlfix, urlbase
from OFS.PropertySheets import DAVProperties
from xmltools import XmlParser
from cStringIO import StringIO
from urllib import quote


class DAVProps(DAVProperties):
    """Emulate required DAV properties for objects which do
       not themselves support properties. This is mainly so
       that non-PropertyManagers can appear to support DAV
       PROPFIND requests."""
    def __init__(self, obj):
        self.__obj__=obj
    def v_self(self):
        return self.__obj__
    p_self=v_self



class PropFind:
    """Model a PROPFIND request."""
    def __init__(self, request):
        self.request=request
        self.depth='infinity'
        self.allprop=0
        self.propname=0
        self.propnames=[]
        self.parse(request)
        
    def parse(self, request, dav='DAV:'):
        self.depth=request.get_header('Depth', 'infinity')
        if not (self.depth in ('0','1','infinity')):
            raise 'Bad Request', 'Invalid Depth header.'
        body=request.get('BODY', '')
        self.allprop=(not len(body))
        if not body: return
        try:    root=XmlParser().parse(body)
        except: raise 'Bad Request', sys.exc_value
        e=root.elements('propfind', ns=dav)
        if not e: raise 'Bad Request', 'Invalid xml request.'
        e=e[0]
        if e.elements('allprop', ns=dav):
            self.allprop=1
            return
        if e.elements('propname', ns=dav):
            self.propname=1
            return
        prop=e.elements('prop', ns=dav)
        if not prop: raise 'Bad Request', 'Invalid xml request.'
        prop=prop[0]
        for val in prop.elements():
            self.propnames.append((val.name(), val.namespace()))
        if (not self.allprop) and (not self.propname) and \
           (not self.propnames):
            raise 'Bad Request', 'Invalid xml request.'
        return

    def apply(self, obj, url=None, depth=0, result=None, top=1):
        if result is None:
            result=StringIO()
            depth=self.depth
            url=urlfix(self.request['URL'], 'PROPFIND')
            url=urlbase(url)
            result.write('\n' \
                         '\n')
        iscol=hasattr(obj, '__dav_collection__')
        if iscol and url[-1] != '/': url=url+'/'
        result.write('\n%s\n' % quote(url))
        if hasattr(aq_base(obj), 'propertysheets'):
            propsets=obj.propertysheets.values()
            obsheets=obj.propertysheets
        else:
            davprops=DAVProps(obj)
            propsets=(davprops,)
            obsheets={'DAV:': davprops}
        if self.allprop:
            stats=[]
            for ps in propsets:
                if hasattr(aq_base(ps), 'dav__allprop'):
                    stats.append(ps.dav__allprop())
            stats=string.join(stats, '') or '200 OK\n'
            result.write(stats)            
        elif self.propname:
            stats=[]
            for ps in propsets:
                if hasattr(aq_base(ps), 'dav__propnames'):
                    stats.append(ps.dav__propnames())
            stats=string.join(stats, '') or '200 OK\n'
            result.write(stats)
        elif self.propnames:
            rdict={}
            for name, ns in self.propnames:
                ps=obsheets.get(ns, None)
                if ps is not None and hasattr(aq_base(ps), 'dav__propstat'):
                    stat=ps.dav__propstat(name, rdict)
                else:
                    prop='' % (name, ns)
                    code='404 Not Found'
                    if not rdict.has_key(code):
                        rdict[code]=[prop]
                    else: rdict[code].append(prop)
            keys=rdict.keys()
            keys.sort()
            for key in keys:
                result.write('\n' \
                             '  \n' \
                             )
                map(result.write, rdict[key])
                result.write('  \n' \
                             '  HTTP/1.1 %s\n' \
                             '\n' % key
                             )
        else: raise 'Bad Request', 'Invalid request'
        result.write('\n')        
        if depth in ('1', 'infinity') and iscol:
            for ob in obj.objectValues():
                dflag=hasattr(ob, '_p_changed') and (ob._p_changed == None)
                if hasattr(ob, '__dav_resource__'):
                    uri=os.path.join(url, absattr(ob.id))
                    depth=depth=='infinity' and depth or 0
                    self.apply(ob, uri, depth, result, top=0)
                    if dflag: ob._p_deactivate()
        if not top: return result
        result.write('')
        return result.getvalue()



class PropPatch:
    """Model a PROPPATCH request."""
    def __init__(self, request):
        self.request=request
        self.values=[]
        self.parse(request)

    def parse(self, request, dav='DAV:'):
        body=request.get('BODY', '')
        try:    root=XmlParser().parse(body)
        except: raise 'Bad Request', sys.exc_value
        vals=self.values
        e=root.elements('propertyupdate', ns=dav)
        if not e: raise 'Bad Request', 'Invalid xml request.'
        e=e[0]
        for ob in e.elements():
            if ob.name()=='set' and ob.namespace()==dav:
                proptag=ob.elements('prop', ns=dav)
                if not proptag: raise 'Bad Request', 'Invalid xml request.'
                proptag=proptag[0]
                for prop in proptag.elements():
                    # We have to ensure that all tag attrs (including
                    # an xmlns attr for all xml namespaces used by the
                    # element and its children) are saved, per rfc2518.
                    name, ns=prop.name(), prop.namespace()
                    e, attrs=prop.elements(), prop.attrs()
                    if (not e) and (not attrs):
                        # simple property
                        item=(name, ns, prop.strval(), {})
                        vals.append(item)
                    else:
                        # xml property
                        attrs={}
                        prop.remap({ns:'n'})
                        prop.del_attr('xmlns:n')
                        for attr in prop.attrs():
                            attrs[attr.qname()]=attr.value()
                        md={'__xml_attrs__':attrs}
                        item=(name, ns, prop.strval(), md)
                        vals.append(item)
            if ob.name()=='remove' and ob.namespace()==dav:
                proptag=ob.elements('prop', ns=dav)
                if not proptag: raise 'Bad Request', 'Invalid xml request.'
                proptag=proptag[0]
                for prop in proptag.elements():
                    item=(prop.name(), prop.namespace())
                    vals.append(item)

    def apply(self, obj):
        url=urlfix(self.request['URL'], 'PROPPATCH')
        if hasattr(obj, '__dav_collection__'):
            url=url+'/'
        result=StringIO()
        errors=[]
        result.write('\n' \
                     '\n' \
                     '\n' \
                     '%s\n' % quote(url))
        propsets=obj.propertysheets
        for value in self.values:
            status='200 OK'
            if len(value) > 2:
                name, ns, val, md=value
                propset=propsets.get(ns, None)
                if propset is None:
                    propsets.manage_addPropertySheet('', ns)
                    propset=propsets.get(ns)
                propdict=propset._propdict()
                if propset.hasProperty(name):
                    try: propset._updateProperty(name, val, meta=md)
                    except:
                        errors.append(str(sys.exc_value))
                        status='409 Conflict'
                else:
                    try: propset._setProperty(name, val, meta=md)
                    except:
                        errors.append(str(sys.exc_value))
                        status='409 Conflict'
            else:
                name, ns=value
                propset=propsets.get(ns, None)
                if propset is None or not propset.hasProperty(name):
                    errors.append('Property not found: %s' % name)
                    status='404 Not Found'
                else:
                    try: propset._delProperty(name)
                    except:
                        errors.append('%s cannot be deleted.' % name)
                        status='409 Conflict'
            if result != '200 OK': abort=1
            result.write('\n' \
                         '  \n' \
                         '  \n' \
                         '  \n' \
                         '  HTTP/1.1 %s\n' \
                         '\n' % (ns, name, status))
        errmsg=string.join(errors, '\n') or 'The operation succeded.'
        result.write('\n' \
                     '%s\n' \
                     '\n' \
                     '\n' \
                     '' % errmsg)
        result=result.getvalue()
        if not errors: return result
        # This is lame, but I cant find a way to keep ZPublisher
        # from sticking a traceback into my xml response :(
        get_transaction().abort()
        result=string.replace(result, '200 OK', '424 Failed Dependency')
        return result





class Lock:
    """Model a LOCK request."""
    def __init__(self, request):
        self.request=request
        data=request.get('BODY', '')
        self.scope='exclusive'
        self.type='write'
        self.owner=''
        self.parse(data)

    def parse(self, data, dav='DAV:'):
        root=XmlParser().parse(data)
        info=root.elements('lockinfo', ns=dav)[0]
        ls=info.elements('lockscope', ns=dav)[0]
        self.scope=ls.elements()[0].name()
        lt=info.elements('locktype', ns=dav)[0]
        self.type=lt.elements()[0].name()
        lo=info.elements('owner', ns=dav)
        if lo: self.owner=lo[0].toxml()




Zope-2.0.1-ZEO-nonbin/lib/python/webdav/xmltools.py100644   1007   1403       32176  6725036663  22144 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################

"""WebDAV XML parsing tools. Note that this module does just
   enough for the purposes of DAV - it is not intended as a
   general xml toolkit, and will probably eventually go away
   in favor of a standard xml package once some issues are
   worked out."""

__version__='$Revision: 1.7 $'[11:-2]

import sys, os, string
import Shared.DC.xml.xmllib
from Acquisition import Implicit
from cStringIO import StringIO


type_document=0
type_element=1
type_attribute=2
type_text=3
type_cdata=4
type_entityref=5
type_entity=6
type_procinst=7
type_comment=8
type_notation=9


class Node(Implicit):
    """Common base class for Node objects."""
    __name__=''
    __value__=''
    __attrs__=[]
    __nodes__=[]
    __nskey__=''

    def name(self):  return self.__name__
    def attrs(self): return self.__attrs__
    def value(self): return self.__value__
    def nodes(self): return self.__nodes__
    def nskey(self): return self.__nskey__
    
    def addNode(self, node):
        self.__nodes__.append(node.__of__(self))

    def namespace(self):
        nskey=self.__nskey__
        while 1:
            if hasattr(self, '__nsdef__'):
                val=self.__nsdef__.get(nskey, None)
                if val is not None: return val
            if not hasattr(self, 'aq_parent'):
                return ''
            self=self.aq_parent

    def elements(self, name=None, ns=None, lower=string.lower):
        nodes=[]
        name=name and lower(name)
        for node in self.__nodes__:
            if node.__type__==type_element and \
               ((name is None) or (lower(node.__name__)==name)) and \
               ((ns is None) or (node.namespace()==ns)):
                nodes.append(node)
        return nodes
    
    def __getitem__(self, n):
        return self.__nodes__[n]

    def qname(self):
        ns=self.__nskey__
        if ns: ns='%s:' % ns
        return '%s%s' % (ns, self.__name__)

    def toxml(self):
        return self.__value__

    def strval(self):
        return self.toxml()


class Document(Node):
    def __init__(self, encoding='utf-8', stdalone=''):
        self.__name__ ='document'
        self.__nodes__=[]
        self.encoding=encoding
        self.stdalone=stdalone
        self.document=self
        
    def toxml(self):
        result=['' % self.encoding]
        for node in self.__nodes__:
            result.append(node.toxml())
        return string.join(result, '')

    #def __del__(self):
    #    self.document=None
    #    print 'bye!'
        
class Element(Node):
    __type__=type_element
    
    def __init__(self, name, attrs={}):
        self.__name__ =name
        self.__attrs__=[]
        self.__nodes__=[]
        self.__nsdef__={}
        self.__nskey__=''
        for name, val in attrs.items():
            attr=Attribute(name, val)
            self.__attrs__.append(attr)
        self.ns_parse()
        parts=string.split(self.__name__, ':')
        if len(parts) > 1:
            self.__nskey__=parts[0]
            self.__name__=string.join(parts[1:], ':')
            
    def ns_parse(self):
        nsdef=self.__nsdef__={}
        for attr in self.attrs():
            name, val=attr.name(), attr.value()
            key=string.lower(name)
            if key[:6]=='xmlns:':
                nsdef[name[6:]]=val
            elif key=='xmlns':
                nsdef['']=val

    def fixup(self):
        self.__attrs__=map(lambda n, s=self: n.__of__(s), self.__attrs__)
        
    def get_attr(self, name, ns=None, default=None):
        for attr in self.__attrs__:
            if attr.name()==name and (ns is None) or (ns==attr.namespace()):
                return attr
        return default

    def del_attr(self, name):
        attrs=[]
        for attr in self.__attrs__:
            if attr.name() != name:
                attrs.append(attr)
        self.__attrs__=attrs

    def remap(self, dict, n=0, top=1):
        # The remap method effectively rewrites an element and all of its
        # children, consolidating namespace declarations into the element
        # on which the remap function is called and fixing up namespace
        # lookup structures.
        nsval=self.namespace()
        if not nsval: nsid=''
        elif not dict.has_key(nsval):
            nsid='ns%d' % n
            dict[nsval]=nsid
            n=n+1
        else: nsid=dict[nsval]
        for attr in self.__attrs__:
            dict, n=attr.remap(dict, n, 0)
        for node in self.elements():
            dict, n=node.remap(dict, n, 0)
        attrs=[]
        for attr in self.__attrs__:
            name=attr.__name__
            if not (((len(name) >= 6) and (name[:6]=='xmlns:')) or \
                    name=='xmlns'):
                attrs.append(attr)
        self.__attrs__=attrs
        self.__nsdef__={}
        self.__nskey__=nsid
        if top:
            attrs=self.__attrs__
            keys=dict.keys()
            keys.sort()
            for key in keys:
                attr=Attribute('xmlns:%s' % dict[key], key)
                attrs.append(attr.__of__(self))
            self.__attrs__=attrs
            self.ns_parse()
        return dict, n

    def toxml(self):
        qname=self.qname()
        result=['<%s' % qname]
        for attr in self.__attrs__:
            result.append(attr.toxml())
        if not self.__value__ and not self.__nodes__:
            result.append('/>')
        else:
            result.append('>')
            for node in self.__nodes__:
                result.append(node.toxml())
            result.append('' % qname)
        return string.join(result, '')

    def strval(self, top=1):
        if not self.__value__ and not self.__nodes__:
            return ''
        result=map(lambda n: n.toxml(), self.__nodes__)
        return string.join(result, '')

class Attribute(Node):
    __type__=type_attribute
    def __init__(self, name, val):
        self.__name__=name
        self.__value__=val
        self.__nskey__=''
        parts=string.split(name, ':')
        if len(parts) > 1:
            pre=string.lower(parts[0])
            if not (pre in ('xml', 'xmlns')):
                self.__nskey__=parts[0]
                self.__name__=string.join(parts[1:], ':')

    def remap(self, dict, n=0, top=1):
        nsval=self.namespace()
        if not nsval: nsid=''
        elif not dict.has_key(nsval):
            nsid='ns%d' % n
            dict[nsval]=nsid
            n=n+1
        else: nsid=dict[nsval]
        self.__nskey__=nsid
        return dict, n

    def toxml(self):
        ns=self.__nskey__
        if ns: ns='%s:' % ns
        return ' %s%s="%s"' % (ns, self.__name__, self.__value__)
        
class Text(Node):
    __name__='#text'
    __type__=type_text
    def __init__(self, val):
        self.__value__=val
    def toxml(self):
        return escape(self.__value__)

class CData(Node):
    __type__=type_cdata
    __name__='#cdata'
    def __init__(self, val):
        self.__value__=val
    def toxml(self):
        return '' % self.__value__

class EntityRef(Node):
    __name__='#entityref'
    __type__=type_entityref
    def __init__(self, val):
        self.__value__=val        
    def toxml(self):
        return '&%s;' % self.__value__

class Entity(Node):
    __name__='#entity'
    __type__=type_entity
    def __init__(self, name, pubid, sysid, nname):
        self.__value__=val
    def toxml(self):
        return ''

class ProcInst(Node):
    __type__=type_procinst
    def __init__(self, name, val):
        self.__name__=name
        self.__value__=val
    def toxml(self):
        return '' % (self.__name__, self.__value__)

class Comment(Node):
    __name__='#comment'
    __type__=type_comment
    def __init__(self, val):
        self.__value__=val
    def toxml(self):
        return '' % self.__value__





class XmlParser(Shared.DC.xml.xmllib.XMLParser):
    def __init__(self):
        Shared.DC.xml.xmllib.XMLParser.__init__(self)
        self.root=None
        self.node=None
        
    def parse(self, data):
        self.feed(data)
        self.close()
        return self.root
    
    def add(self, node):
        self.node.addNode(node)

    def push(self, node):
        self.node.addNode(node)
        self.node=self.node.__nodes__[-1]

    def pop(self):
        self.node=self.node.aq_parent

    def unknown_starttag(self, name, attrs):
        node=Element(name, attrs)
        self.push(node)
        # Fixup aq chain!
        self.node.fixup()

    def unknown_endtag(self, name):
        self.pop()

    def handle_xml(self, encoding, stdalone):
        self.root=Document(encoding, stdalone)
        self.node=self.root

    def handle_doctype(self, tag, pubid, syslit, data):
        pass

    def handle_entity(self, name, strval, pubid, syslit, ndata):
        self.add(Entity(name, strval, pubid, syslit, ndata))

    def handle_cdata(self, data):
        self.add(CData(data))

    def handle_proc(self, name, data):
        self.add(ProcInst(name, data))

    def handle_comment(self, data):
        self.add(Comment(data))

    def handle_data(self, data):
        self.add(Text(data))

    def unknown_entityref(self, data):
        self.add(EntityRef(data))



def escape(data, rmap={}, replace=string.replace):
    data=replace(data, "&", "&")
    data=replace(data, "<", "<")
    data=replace(data, ">", ">")
    for key, val in rmap.items():
        data=replace(data, key, val)
    return data

def remap(data, dict={'DAV:': 'd'}):
    root=XmlParser().parse(data)
    root.elements()[0].remap(dict, 0)
    return root.toxml()
Zope-2.0.1-ZEO-nonbin/lib/python/ZEO/ 40755   1007   1403           0  6772126761  16751 5ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/ZEO/ClientCache.py100644   1007   1403       17232  6752077611  21604 0ustar  petrillipetrilli"""Implement a client cache

The cache is managed as two files, var/c0.zec and var/c1.zec.

Each cache file is a sequence of records of the form:

  oid -- 8-byte object id

  status -- 1-byte status v': valid, 'n': non-version valid, 'i': invalid

  tlen -- 4-byte (unsigned) record length

  vlen -- 2-bute (unsigned) version length

  dlen -- 4-byte length of non-version data

  serial -- 8-byte non-version serial (timestamp)

  data -- non-version data

  version -- Version string (if vlen > 0)

  vdlen -- 4-byte length of version data (if vlen > 0)

  vdata -- version data (if vlen > 0)

  vserial -- 8-byte version serial (timestamp)

  tlen -- 4-byte (unsigned) record length (for redundancy and backward
          traversal)

There is a cache size limit.

The cache is managed as follows:

  - Data are written to file 0 until file 0 exceeds limit/2 in size.

  - Data are written to file 1 until file 1 exceeds limit/2 in size.

  - File 0 is truncated to size 0 (or deleted and recreated).

  - Data are written to file 0 until file 0 exceeds limit/2 in size.

  - File 1 is truncated to size 0 (or deleted and recreated).

  - Data are written to file 1 until file 1 exceeds limit/2 in size.

and so on.

On startup, index information is read from file 0 and file 1.
Current serial numbers are sent to the server for verification.
If any serial numbers are not valid, then the server will send back
invalidation messages and the cache entries will be invalidated.

When a cache record is invalidated, the data length is overwritten
with '\0\0\0\0'.

If var is not writable, then temporary files are used for
file 0 and file 1.

"""

import os, tempfile
from struct import pack, unpack

magic='ZEC0'

class ClientCache:

    def __init__(self, storage='', size=20000000, client=None):
        var=os.path.join(INSTANCE_HOME,'var')
        if client:
            self._p=p=map(lambda i, p=storage, var=var, c=client:
                          os.path.join(var,'c%s-%s-%s.zec' % (p, c, i)),
                          (0,1))
            self._f=f=[None, None]
            s=['\0\0\0\0\0\0\0\0', '\0\0\0\0\0\0\0\0']
            for i in 0,1:
                if os.path.exists(p[i]):
                    fi=open(p[i],'r+b')
                    if fi.read(4)==magic: # Minimal sanity
                        fi.seek(0,2)
                        if fi.tell() > 30:
                            fi.seek(22)
                            s[i]=fi.read(8)
                    if s[i]!='\0\0\0\0\0\0\0\0': f[i]=fi
                    fi=None

            if s[1] > s[0]: current=1
            elif s[0] > s[1]: current=0
            else:
                if f[0] is None:
                    f[0]=open(p[0], 'w+b')
                    f[0].write(magic)
                current=0
                f[1]=None
        else:
            self._p=p=map(
                lambda i, p=storage:
                tempfile.mktemp('.zec'),
                (0,1))
            self._f=f=[open(p[0],'w+b'), None]
            f[0].write(magic)
            current=0

        self._limit=size/2
        self._current=current

    def open(self):
        self._index=index={}
        self._get=index.get
        serial={}
        f=self._f
        current=self._current
        if f[not current] is not None:
            read_index(index, serial, f[not current], not current)
        self._pos=read_index(index, serial, f[current], current)

        return serial.items()

    def invalidate(self, oid, version):
        p=self._get(oid, None)
        if p is None: return None
        f=self._f[p < 0]
        ap=abs(p)
        f.seek(ap)
        h=f.read(8)
        if h != oid: return
        f.write(version and 'n' or 'i')

    def load(self, oid, version):
        p=self._get(oid, None)
        if p is None: return None
        f=self._f[p < 0]
        ap=abs(p)
        seek=f.seek
        read=f.read
        seek(ap)
        h=read(27)
        if len(h)==27 and h[8] in 'nv' and h[:8]==oid:
            tlen, vlen, dlen = unpack(">iHi", h[9:19])
        else: tlen=-1
        if tlen <= 0 or vlen < 0 or dlen <= 0 or vlen+dlen > tlen:
            del self._index[oid]
            return None

        if version and h[8]=='n': return None
        
        if not vlen or not version:
            return read(dlen), h[19:]

        seek(dlen, 1)
        v=read(vlen)
        if version != v: 
            seek(-dlen-vlen, 1)
            return read(dlen), h[19:]

        dlen=unpack(">i", read(4))[0]
        return read(dlen), read(8)

    def update(self, oid, serial, version, data):
        if version:
            # We need to find and include non-version data
            p=self._get(oid, None)
            if p is None: return None
            f=self._f[p < 0]
            ap=abs(p)
            seek=f.seek
            read=f.read
            seek(ap)
            h=read(27)
            if len(h)==27 and h[8] in 'nv' and h[:8]==oid:
                tlen, vlen, dlen = unpack(">iHi", h[9:19])
            else: tlen=-1
            if tlen <= 0 or vlen < 0 or dlen <= 0 or vlen+dlen > tlen:
                del self._index[oid]
                return None

            p=read(dlen)
            s=h[19:]

            self.store(oid, p, s, version, data, serial)
        else:
            # Simple case, just store new data:
            self.store(oid, data, serial, '', None, None)

    def modifiedInVersion(self, oid):
        p=self._get(oid, None)
        if p is None: return None
        f=self._f[p < 0]
        ap=abs(p)
        seek=f.seek
        read=f.read
        seek(ap)
        h=read(27)
        if len(h)==27 and h[8] in 'nv' and h[:8]==oid:
            tlen, vlen, dlen = unpack(">iHi", h[9:19])
        else: tlen=-1
        if tlen <= 0 or vlen < 0 or dlen <= 0 or vlen+dlen > tlen:
            del self._index[oid]
            return None

        if h[8]=='n': return None
        
        if not vlen: return ''
        seek(dlen, 1)
        return read(vlen)

    def store(self, oid, p, s, version, pv, sv):
        tlen=31+len(p)
        if version:
            tlen=tlen+len(version)+12+len(pv)
            vlen=len(version)
        else:
            vlen=0
        
        pos=self._pos
        current=self._current
        if pos+tlen > self._limit:
            current=not current
            self._current=current
            self._f[current]=open(self._p[current],'w+b')
            self._f[current].write(magic)
            self._pos=pos=4

        f=self._f[current]
        f.seek(pos)
        stlen=pack(">I",tlen)
        write=f.write
        write(oid+'v'+stlen+pack(">HI", vlen, len(p))+s)
        write(p)
        if version:
            write(pack(">I", len(pv)))
            write(pv)
            write(sv+stlen)

        if current: self._index[oid]=-pos
        else: self._index[oid]=pos

        self._pos=pos+tlen

def read_index(index, serial, f, current):
    seek=f.seek
    read=f.read
    pos=4
    seek(0,2)
    size=f.tell()

    while 1:
        f.seek(pos)
        h=read(27)
        
        if len(h)==27 and h[8] in 'vni':
            tlen, vlen, dlen = unpack(">iHi", h[9:19])
        else: tlen=-1
        if tlen <= 0 or vlen < 0 or dlen <= 0 or vlen+dlen > tlen:
            break

        oid=h[:8]

        if h[8]=='v' and vlen:
            seek(dlen+vlen, 1)
            vdlen=read(4)
            if len(vdlen) != 4: break
            vdlen=unpack(">i", vdlen)[0]
            if vlen+dlen+42+vdlen > tlen: break
            seek(vdlen, 1)
            vs=read(8)
            if read(4) != h[9:13]: break
        else: vs=None

        if h[8] in 'vn':
            if current: index[oid]=-pos
            else: index[oid]=pos
            serial[oid]=h[-8:], vs
            
        pos=pos+tlen

    f.seek(pos)
    try: f.truncate()
    except: pass
    
    return pos
Zope-2.0.1-ZEO-nonbin/lib/python/ZEO/ClientStorage.py100644   1007   1403       24432  6761025422  22176 0ustar  petrillipetrilli##############################################################################
#
# Copyright (c) 1996-1998, Digital Creations, Fredericksburg, VA, USA.
# All rights reserved.
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
#   o Redistributions of source code must retain the above copyright
#     notice, this list of conditions, and the disclaimer that follows.
# 
#   o 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.
# 
#   o Neither the name of Digital Creations 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 DIGITAL CREATIONS 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 DIGITAL
# CREATIONS 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 you have questions regarding this software, contact:
#
#   Digital Creations, L.C.
#   910 Princess Ann Street
#   Fredericksburge, Virginia  22401
#
#   info@digicool.com
#
#   (540) 371-6909
#
##############################################################################
"""Network ZODB storage client
"""
__version__='$Revision: 1.4 $'[11:-2]

import struct, time, os, socket, cPickle, string, Sync, zrpc, ClientCache
import tempfile
now=time.time
from struct import pack, unpack
from ZODB import POSException, BaseStorage
from ZODB.TimeStamp import TimeStamp

TupleType=type(())

class UnrecognizedResult(POSException.StorageError):
    """A server call returned an unrecognized result
    """

class ClientStorage(BaseStorage.BaseStorage):

    def __init__(self, connection, async=0, storage='1', cache_size=20000000,
                 name=''):

        # Decide whether to use non-temporary files
        client=os.environ.get('ZEO_CLIENT','')
        if client: async=1
        
        if async:
            import asyncore
            def loop(timeout=30.0, use_poll=0,
                     self=self, asyncore=asyncore, loop=asyncore.loop):
                self.becomeAsync()
                asyncore.loop=loop
                loop(timeout, use_poll)
            asyncore.loop=loop

        self._call=zrpc.sync(connection)
        self.__begin='tpc_begin_sync'

        self._call._write(str(storage))
        info=self._call('get_info')
        self._len=info.get('length',0)
        self._size=info.get('size',0)
        name=name or ("%s %s" % (info.get('name', ''), str(connection)))
        self._supportsUndo=info.get('supportsUndo',0)
        self._supportsVersions=info.get('supportsVersions',0)


        self._tfile=tempfile.TemporaryFile()
        

        self._cache=ClientCache.ClientCache(storage, cache_size, client=client)
        if async:
            for oid, (s, vs) in self._cache.open():
                self._call.queue('zeoVerify', oid, s, vs)
        else:
            for oid, (s, vs) in self._cache.open():
                self._call.send('zeoVerify', oid, s, vs)

        BaseStorage.BaseStorage.__init__(self, name)

    def becomeAsync(self):
        self._call=zrpc.async(self._call)
        self.__begin='tpc_begin'

    def registerDB(self, db, limit):

        def invalidate(code, args,
                       dinvalidate=db.invalidate,
                       limit=limit,
                       release=self._commit_lock_release,
                       cinvalidate=self._cache.invalidate
                       ):
            if code == 'I':
                for oid, serial, version in args:
                    cinvalidate(oid, version=version)
                    dinvalidate(oid, version=version)
            elif code == 'U':
                release()

        self._call.setOutOfBand(invalidate)
        

    def __len__(self): return self._len

    def abortVersion(self, src, transaction):
        if transaction is not self._transaction:
            raise POSException.StorageTransactionError(self, transaction)
        self._lock_acquire()
        try: return self._call('abortVersion', src, self._serial)
        finally: self._lock_release()

    def close(self):
        self._lock_acquire()
        try: self._call.close()
        finally: self._lock_release()
        
    def commitVersion(self, src, dest, transaction):
        if transaction is not self._transaction:
            raise POSException.StorageTransactionError(self, transaction)
        self._lock_acquire()
        try: return self._call('commitVersion', src, dest, self._serial)
        finally: self._lock_release()

    def getName(self): return self.__name__

    def getSize(self): return self._size
                  
    def history(self, oid, version, length=1):
        self._lock_acquire()
        try: return self._call('history', oid, version, length)     
        finally: self._lock_release()       

    def load(self, oid, version, _stuff=None):
        self._lock_acquire()
        try:
            p = self._cache.load(oid, version)
            if p is not None: return p
            p, s, v, pv, sv = self._call('zeoLoad', oid)
            self._cache.store(oid, p, s, v, pv, sv)
            if not v or not version or version != v:
                return p, s
            return pv, sv
        finally: self._lock_release()
                    
    def modifiedInVersion(self, oid):
        self._lock_acquire()
        try:
            v=self._cache.modifiedInVersion(oid)
            if v is not None: return v
            return self._call('modifiedInVersion', oid)
        finally: self._lock_release()

    def new_oid(self, last=None):
        self._lock_acquire()
        try: return self._call('new_oid')
        finally: self._lock_release()
        
    def pack(self, t, rf):
        # Note that we ignore the rf argument.  The server
        # will provide it's own implementation.
        self._lock_acquire()
        try: return self._call('pack', t)
        finally: self._lock_release()

    def store(self, oid, serial, data, version, transaction):
        if transaction is not self._transaction:
            raise POSException.StorageTransactionError(self, transaction)
        self._lock_acquire()
        try:
            serial=self._call('store', oid, serial,
                              data, version, self._serial)
            
            write=self._tfile.write
            write(oid+serial+pack(">HI", len(version), len(data))+version)
            write(data)

            return serial
        
        finally: self._lock_release()

    def supportsUndo(self): return self._supportsUndo
    def supportsVersions(self): return self._supportsVersions
        
    def tpc_abort(self, transaction):
        self._lock_acquire()
        try:
            if transaction is not self._transaction: return
            self._call('tpc_abort', self._serial)
            self._transaction=None
            self._tfile.seek(0)
            self._commit_lock_release()
        finally: self._lock_release()

    def tpc_begin(self, transaction):
        self._lock_acquire()
        try:
            if self._transaction is transaction: return

            user=transaction.user
            desc=transaction.description
            ext=transaction._extension
            t=time.time()
            t=apply(TimeStamp,(time.gmtime(t)[:5]+(t%60,)))
            self._ts=t=t.laterThan(self._ts)
            self._serial=id=`t`

            self._tfile.seek(0)

            while 1:
                self._lock_release()
                self._commit_lock_acquire()
                self._lock_acquire()
                if self._call(self.__begin, id, user, desc, ext) is None:
                    break

            self._transaction=transaction
            
        finally: self._lock_release()

    def tpc_finish(self, transaction, f=None):
        self._lock_acquire()
        try:
            if transaction is not self._transaction: return
            if f is not None: f()

            self._call('tpc_finish', self._serial,
                       transaction.user,
                       transaction.description,
                       transaction._extension)

            tfile=self._tfile
            seek=tfile.seek
            read=tfile.read
            cache=self._cache
            size=tfile.tell()
            seek(0)
            i=0
            while i < size:
                oid=read(8)
                s=read(8)
                h=read(6)
                vlen, dlen = unpack(">HI", h)
                if vlen: v=read(vlen)
                else: v=''
                p=read(dlen)
                cache.update(oid, s, v, p)
                i=i+22+vlen+dlen

            seek(0)

            self._transaction=None
            self._commit_lock_release()
        finally: self._lock_release()

    def undo(self, transaction_id):
        self._lock_acquire()
        try: return self._call('undo', transaction_id)
        finally: self._lock_release()

    def undoLog(self, version, first, last, filter=None):
        # Waaaa, we really need to get the filter through
        # but how can we send it over the wire?

        # I suppose we could try to run the filter in a restricted execution
        # env.

        # Maybe .... we are really going to want to pass lambdas, hm.
        
        self._lock_acquire()
        try: return self._call('undoLog', version, first, last) # Eek!
        finally: self._lock_release()

    def versionEmpty(self, version):
        self._lock_acquire()
        try: return self._call('versionEmpty', version)
        finally: self._lock_release()

    def versions(self, max=None):
        self._lock_acquire()
        try: return self._call('versionEmpty', max)
        finally: self._lock_release()

Zope-2.0.1-ZEO-nonbin/lib/python/ZEO/README100644   1007   1403        2235  6752362501  17720 0ustar  petrillipetrilliZope Enterprize Option, iteration 1

  Put this package in your Zope lib/python.

  To start the storage server, go to your Zope install directory and::

    lib/python/ZEO/start.py -p port_number

  (Run start without arguments to see options.)

  To get Zope to use the server, create a custom_zodb module,
  custom_zodb.py, in your Zope install directory, so that uses a
  ClientStorage::

    import ZEO.ClientStorage
    Storage=ZEO.ClientStorage.ClientStorage(('',port_number), async=1)

  You can specify a host name (rather than '') if you want.
  The port number is, of course, the port number used to start the 
  storage server.  The async switch tells the client to switch
  itself to async mode (if and) when the asyncore main loop is called.

  If you want a persistent client cache, you need to define the
  environment variable, ZEO_CLIENT to a unique name for the
  client. This is needed so that unique cache name files can be
  computed. Otherwise, the client cache is stored in temporary files.
  For example, to start two Zope processes with unique caches, use
  something like:

    python z2.py -P8700 ZEO_CLIENT=8700
    python z2.py -P8800 ZEO_CLIENT=8800
Zope-2.0.1-ZEO-nonbin/lib/python/ZEO/StorageServer.py100644   1007   1403       21077  6761025551  22233 0ustar  petrillipetrilli
import asyncore, socket, string, sys, cPickle
from smac import smac
from ZODB import POSException
from ZODB.Transaction import Transaction
import traceback
from zLOG import LOG, INFO, ERROR

class StorageServerError(POSException.StorageError): pass

def blather(*args):
    LOG('ZEO Server', INFO, string.join(args))

class StorageServer(asyncore.dispatcher):

    def __init__(self, connection, storages):
        
        self.host, self.port = connection
        self.__storages=storages

        self.__connections={}
        self.__get_connections=self.__connections.get


        asyncore.dispatcher.__init__(self)
        self.create_socket(socket.AF_INET, socket.SOCK_STREAM)

        self.bind((self.host, self.port))

        self.listen(5)

    def register_connection(self, connection, storage_id):
        storage=self.__storages.get(storage_id, None)
        if storage is None:
            connection.close()
            return None, None
        
        connections=self.__get_connections(storage_id, None)
        if connections is None:
            self.__connections[storage_id]=connections=[]
        connections.append(connection)
        return storage, storage_id

    def unregister_connection(self, connection, storage_id):
        
        connections=self.__get_connections(storage_id, None)
        if connections: 
            n=[]
            for c in connections:
                if c is not connection:
                    n.append(c)
        
            self.__connections[storage_id]=n

    def invalidate(self, connection, storage_id, invalidated,
                   dumps=cPickle.dumps):
        for c in self.__connections[storage_id]:
            if c is connection: continue
            c.message_output('I'+dumps(invalidated))

    def writable(self): return 0
    
    def handle_read(self): pass
    
    def readable(self): return 1
    
    def handle_connect (self): pass
    
    def handle_accept(self):
        try:
            sock, addr = self.accept()
        except socket.error:
            sys.stderr.write('warning: accept failed\n')

        Connection(self, sock, addr)

    def log_info(self, message, type='info'):
        if type=='error': type=ERROR
        else: type=INFO
        LOG('ZEO Server', type, message)

    log=log_info

storage_methods={}
for n in ('get_info', 'abortVersion', 'commitVersion', 'history',
          'load', 'modifiedInVersion', 'new_oid', 'pack', 'store',
          'tpc_abort', 'tpc_begin', 'tpc_begin_sync', 'tpc_finish', 'undo',
          'undoLog', 'versionEmpty',
          'zeoLoad', 'zeoVerify',
          ):
    storage_methods[n]=1
storage_method=storage_methods.has_key

_noreturn=[]
class Connection(smac):

    _transaction=None
    __storage=__storage_id=None

    def __init__(self, server, sock, addr):
        smac.__init__(self, sock, addr)
        self.__server=server
        self.__invalidated=[]
        self.__closed=None

    def close(self):
        t=self._transaction
        if (t is not None and self.__storage is not None and
            self.__storage._transaction is t):
            self.tpc_abort(t.id)

        self.__server.unregister_connection(self, self.__storage_id)
        self.__closed=1
        smac.close(self)

    def message_input(self, message):
        if __debug__:
            m=`message`
            if len(m) > 60: m=m[:60]+' ...'
            blather('message_input', m)

        if self.__storage is None:
            self.__storage, self.__storage_id = (
                self.__server.register_connection(self, message))
            return
            
        rt='R'
        try:
            args=cPickle.loads(message)
            name, args = args[0], args[1:]
            if __debug__:
                m=`tuple(args)`
                if len(m) > 60: m=m[:60]+' ...'
                blather('call: %s%s' % (name, m))
                
            if not storage_method(name):
                raise 'Invalid Method Name', name
            if hasattr(self, name):
                r=apply(getattr(self, name), args)
            else:
                r=apply(getattr(self.__storage, name), args)
            if r is _noreturn: return
        except:
            LOG('ZEO Server', ERROR, 'error', error=sys.exc_info())
            t, r = sys.exc_info()[:2]
            if type(r) is not type(self): r=t,r
            rt='E'

        if __debug__:
            m=`r`
            if len(m) > 60: m=m[:60]+' ...'
            blather('%s: %s' % (rt, m))
            
        r=cPickle.dumps(r,1)
        self.message_output(rt+r)

    def get_info(self):
        storage=self.__storage
        return {
            'length': len(storage),
            'size': storage.getSize(),
            'name': storage.getName(),
            'supportsUndo': storage.supportsUndo(),
            'supportsVersions': storage.supportsVersions(),
            }

    def zeoLoad(self, oid):
        storage=self.__storage
        v=storage.modifiedInVersion(oid)
        if v: pv, sv = storage.load(oid, v)
        else: pv=sv=None
        p, s = storage.load(oid,'')
        return p, s, v, pv, sv

    def zeoVerify(self, oid, s, sv,
                  dumps=cPickle.dumps):
        try: p, os, v, pv, osv = self.zeoLoad(oid)
        except: return _noreturn
        p=pv=None # free the pickles
        if os != s:
            self.message_output('I'+dumps(((oid, os, ''),)))            
        elif osv != sv:
            self.message_output('I'+dumps(((oid, osv, v),)))
            
        return _noreturn
        

    def store(self, oid, serial, data, version, id):
        t=self._transaction
        if t is None or id != t.id:
            raise POSException.StorageTransactionError(self, id)
        newserial=self.__storage.store(oid, serial, data, version, t)
        if serial != '\0\0\0\0\0\0\0\0':
            self.__invalidated.append(oid, serial, version)
        return newserial

    def tpc_abort(self, id):
        t=self._transaction
        if t is None or id != t.id: return
        r=self.__storage.tpc_abort(t)

        storage=self.__storage
        try: waiting=storage.__waiting
        except: waiting=storage.__waiting=[]
        while waiting:
            f, args = waiting.pop(0)
            if apply(f,args): break

        self._transaction=None
        self.__invalidated=[]
        
    def unlock(self):
        if self.__closed: return
        self.message_output('UN.')

    def tpc_begin(self, id, user, description, ext):
        t=self._transaction
        if t is not None and id == t.id: return
        storage=self.__storage
        if storage._transaction is not None:
            try: waiting=storage.__waiting
            except: waiting=storage.__waiting=[]
            waiting.append(self.unlock, ())
            return 1 # Return a flag indicating a lock condition.
            
        self._transaction=t=Transaction()
        t.id=id
        t.user=user
        t.description=description
        storage.tpc_begin(t)
        self.__invalidated=[]

    def tpc_begin_sync(self, id, user, description, ext):
        if self.__closed: return
        t=self._transaction
        if t is not None and id == t.id: return
        storage=self.__storage
        if storage._transaction is None:
            self.try_again_sync(id, user, description, ext)
        else:
            try: waiting=storage.__waiting
            except: waiting=storage.__waiting=[]
            waiting.append(self.try_again_sync, (id, user, description, ext))

        return _noreturn
        
    def try_again_sync(self, id, user, description, ext):
        storage=self.__storage
        if storage._transaction is None:
            self._transaction=t=Transaction()
            t.id=id
            t.user=user
            t.description=description
            storage.tpc_begin(t)
            self.__invalidated=[]
            self.message_output('RN.')
            
        return 1

    def tpc_finish(self, id, user, description, ext):
        t=self._transaction
        if id != t.id: return
        t.user=user
        t.description=description
        t.ext=ext

        storage=self.__storage
        r=storage.tpc_finish(t)
        
        try: waiting=storage.__waiting
        except: waiting=storage.__waiting=[]
        while waiting:
            f, args = waiting.pop(0)
            if apply(f,args): break

        self._transaction=None
        self.__server.invalidate(self, self.__storage_id, self.__invalidated)
        self.__invalidated=[]
        

if __name__=='__main__':
    import ZODB.FileStorage
    name, port = sys.argv[1:3]
    blather(name, port)
    try: port='',string.atoi(port)
    except: pass
    StorageServer(port, ZODB.FileStorage.FileStorage(name))
    asyncore.loop()
Zope-2.0.1-ZEO-nonbin/lib/python/ZEO/__init__.py100644   1007   1403           0  6747144700  21060 0ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/lib/python/ZEO/smac.py100644   1007   1403        4016  6761025500  20327 0ustar  petrillipetrilli"""Sized message async connections
"""

import asyncore, string, struct, zLOG
from zLOG import LOG, INFO, ERROR

class smac(asyncore.dispatcher):

    def __init__(self, sock, addr):
        asyncore.dispatcher.__init__(self, sock)
        self.addr=addr
        self.__state=None
        self.__inp=None
        self.__l=4
        self.__output=output=[]
        self.__append=output.append
        self.__pop=output.pop

    def handle_read(self,
                    join=string.join, StringType=type('')):
        l=self.__l
        d=self.recv(l)
        inp=self.__inp
        if inp is None:
            inp=d
        elif type(inp) is StringType:
            inp=[inp,d]
        else:
            inp.append(d)

        l=l-len(d)
        if l <= 0:
            if type(inp) is not StringType: inp=join(inp,'')
            if self.__state is None:
                # waiting for message
                self.__l=struct.unpack(">i",inp)[0]
                self.__state=1
                self.__inp=None
            else:
                self.__inp=None
                self.__l=4
                self.__state=None
                self.message_input(inp)
        else:
            self.__l=l
            self.__inp=inp

    def readable(self): return 1
    def writable(self): return not not self.__output

    def handle_write(self):
        output=self.__output
        if output:
            v=output[0]
            n=self.send(v)
            if n < len(v):
                output[0]=v[n:]
            else:
                del output[0]

    def handle_close(self): self.close()

    def message_output(self, message,
                       pack=struct.pack, len=len):
        if __debug__:
            if len(message) > 40: m=message[:40]+' ...'
            else: m=message
            LOG('smax', INFO, 'message_output %s' % `m`)
        self.__append(pack(">i",len(message))+message)

    def log_info(self, message, type='info'):
        if type=='error': type=ERROR
        else: type=INFO
        LOG('ZEO Server', type, message)

    log=log_info
Zope-2.0.1-ZEO-nonbin/lib/python/ZEO/start.py100644   1007   1403        4054  6761025530  20546 0ustar  petrillipetrilli# Start the server storage

import sys, os, getopt, string

def directory(p, n=1):
    d=p
    while n:
        d=os.path.split(d)[0]
        if not d or d=='.': d=os.getcwd()
        n=n-1
        
    return d
    

def main(argv):
    me=argv[0]
    sys.path[:]==filter(None, sys.path)
    sys.path.insert(0, directory(me, 2))

    args=[]
    for a in argv[1:]:
        if string.find(a, '=') > 0:
            a=string.split(a,'=')
            os.environ[a[0]]=string.join(a[1:],'=')
            continue
        args.append(a)

    INSTANCE_HOME=os.environ.get('INSTANCE_HOME', directory(me, 4))

    zeo_pid=os.environ.get('ZEO_SERVER_PID',
                           os.path.join(INSTANCE_HOME, 'var', 'ZEO_SERVER.pid')
                           )

    opts, args = getopt.getopt(args, 'p:Dh:')
    
    fs=os.path.join(INSTANCE_HOME, 'var', 'Data.fs')

    usage="""%s -p port [options] [filename]

    where options are:

       -D -- Run in debug mode

       -h -- host address to listen on

    if no file name is specified, then %s is used.
    """ % (me, fs)

    port=None
    debug=0
    host=''
    for o, v in opts:
        if o=='-p': port=string.atoi(v)
        elif o=='-h': host=v
        elif o=='-D': debug=1

    if port is None:
        print usage
        print 'No port specified.'
        sys.exit(1)

    if args:
        if len(args) > 1:
            print usage
            print 'Unrecognizd arguments: ', string.join(args[1:])
            sys.exit(1)
        fs=args[0]

    __builtins__.__debug__=debug
    if debug: os.environ['Z_DEBUG_MODE']='1'

    try: import posix
    except: pass
    else:
        import zdaemon
        zdaemon.run(sys.argv, '')

    import ZEO.StorageServer, ZODB.FileStorage, asyncore, zLOG

    zLOG.LOG('ZEO Server', zLOG.INFO, 'Serving %s' % fs)

    ZEO.StorageServer.StorageServer(
        (host,port),
        {
            '1': ZODB.FileStorage.FileStorage(fs)
            },
        )

    open(zeo_pid,'w').write("%s %s" % (os.getpid(), os.getppid()))
    
    asyncore.loop()


if __name__=='__main__': main(sys.argv)
Zope-2.0.1-ZEO-nonbin/lib/python/ZEO/zrpc.py100644   1007   1403        7261  6750350173  20374 0ustar  petrillipetrilli"""But simple rpc mechanisms
"""

from cPickle import dumps, loads
from thread import allocate_lock
from smac import smac
import socket, string, struct
TupleType=type(())

Wakeup=None


class sync:
    """Synchronous rpc"""

    _outOfBand=None

    def __init__(self, connection, outOfBand=None):
        host, port = connection
        s=socket.socket(socket.AF_INET, socket.SOCK_STREAM)
        s.connect(host, port)
        self._sync__s=s
        self._sync__q=[]
        self._outOfBand=outOfBand

    def setOutOfBand(self, f): self._outOfBand=f

    def close(self): self._sync__s.close()
        
    def __call__(self, *args):
        args=dumps(args,1)
        self._write(args)
        while 1:
            r=self._read()
            c=r[:1]
            if c=='R':
                return loads(r[1:])
            if c=='E':
                r=loads(r[1:])
                if type(r) is TupleType: raise r[0], r[1]
                raise r
            oob=self._outOfBand
            if oob is not None:
                oob(c, loads(r[1:]))
            else:
                raise UnrecognizedResult, r

    def queue(self, *args):
        self._sync__q.append(dumps(args,1))

    def send(self, *args):
        self._write(dumps(args,1))

    def _write(self, data, pack=struct.pack):
        send=self._sync__s.send
        h=pack(">i", len(data))
        l=len(h)
        while l > 0:
            sent=send(h)
            h=h[sent:]
            l=l-sent
        l=len(data)
        while l > 0:
            sent=send(data)
            data=data[sent:]
            l=l-sent

    def _read(self, _st=type(''), join=string.join, unpack=struct.unpack):
        recv=self._sync__s.recv

        l=4

        data=None
        while l > 0:
            d=recv(l)
            if data is None: data=d
            elif type(data) is _st: data=[data, d]
            else: data.append(d)
            l=l-len(d)
        if type(data) is not _st: data=join(data,'')

        l,=unpack(">i", data)

        data=None
        while l > 0:
            d=recv(l)
            if data is None: data=d
            elif type(data) is st: data=[data, d]
            else: data.append(d)
            l=l-len(d)
        if type(data) is not _st: data=join(data,'')

        return data
   
    
class async(smac, sync):

    def __init__(self, connection, outOfBand=None):
        try:
            host, port = connection
        except:
            s=connection._sync__s
            smac.__init__(self, s, None)
            self._outOfBand=connection._outOfBand
            for m in connection._sync__q:
                self.message_output(m)
                
        else:
            s=socket.socket(socket.AF_INET, socket.SOCK_STREAM)
            s.connect(host, port)
            smac.__init__(self, s, None)
            self._outOfBand=outOfBand
            
        l=allocate_lock()
        self.__la=l.acquire
        self.__lr=l.release
        self.__r=None
        l.acquire()

        global Wakeup
        if Wakeup is None:
            import ZServer.PubCore.ZEvent
            Wakeup=ZServer.PubCore.ZEvent.Wakeup

    def queue(self, *args):
        self.message_output(dumps(args,1))
        Wakeup() # You dumb bastard
    
    def _write(self, data):
        self.message_output(data)
        Wakeup() # You dumb bastard

    def message_input(self, m):
        if __debug__:
            md=`m`
            if len(m) > 60: md=md[:60]+' ...'
            print 'message_input', md
            

        c=m[:1]
        if c in 'RE':
            self.__r=m
            self.__lr()
        else:
            oob=self._outOfBand
            if oob is not None: oob(c, loads(m[1:]))

    def _read(self):
        self.__la()
        return self.__r
        


Zope-2.0.1-ZEO-nonbin/pcgi/ 40755   1007   1403           0  6772126761  15147 5ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/pcgi/Example/ 40755   1007   1403           0  6772126761  16542 5ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/pcgi/Example/pcgitest100755   1007   1403         722  6725025061  20355 0ustar  petrillipetrilli#!/usr/local/bin/pcgi-wrapper

# example pcgi info file - JeffBauer@bigfoot.com
# substitute 'BogusDirectory' with appropriate path
# and subsitute the correct path to your Python binary
# for PCGI_EXE.
#
# To invoke from browser:  http://.../cgi-bin/pcgitest/getTime

PCGI_EXE=/usr/local/bin/python
PCGI_PUBLISHER=/BogusDirectory/pcgi_publisher.py
PCGI_MODULE_PATH=/BogusDirectory/pcgitime.py
PCGI_SOCKET_FILE=/tmp/pcgitest.socket
PCGI_PID_FILE=/tmp/pcgitest.pid


Zope-2.0.1-ZEO-nonbin/pcgi/Example/pcgitime.py100755   1007   1403         525  6612715530  20766 0ustar  petrillipetrilli# pcgitime.py - example pcgi script - JeffBauer@bigfoot.com

from time import asctime, localtime, time

beginTime = "
    time started: %s" % asctime(localtime(time()))

def getTime(arg=None):
    """It's later than you think (don't remove this docstring)"""
    return "%s\ncurrent time: %s" % (beginTime, asctime(localtime(time())))
Zope-2.0.1-ZEO-nonbin/pcgi/Makefile.in100755   1007   1403       11101  6612715525  17321 0ustar  petrillipetrilli### Makefile.in - Persistent CGI configuration ###

### start of system configuration section ###

prefix=		@prefix@
exec_prefix=	@exec_prefix@

BINDIR=	$(exec_prefix)/bin

srcdir=	@srcdir@
VPATH = @srcdir@
VERSION=	@VERSION@
MACHDEP=	@MACHDEP@

CC = @CC@

DEFS= @DEFS@ -DUNIX -DOPT_NO_STDERR -DCLOSE_FDS

LIBS= @LIBS@

creosotedir = $(srcdir)/MrCreosote
testdir = $(srcdir)/Test
utildir = $(srcdir)/Util

### end of system configuration section ###

.c.o:
	$(CC) -c $(CPPFLAGS) $(DEFS) -I. -I$(srcdir) $(CFLAGS) $<

PROGS = pcgi-wrapper $(creosotedir)/pcgi-creosote $(testdir)/parseinfo
SRCS = pcgi-wrapper.c parseinfo.c $(creosotedir)/creosote.c
OBJS1 = pcgi-wrapper.o parseinfo.o 
OBJS2 = $(creosotedir)/pcgi-wrapper.o parseinfo.o $(creosotedir)/creosote.o
OBJS3 = $(srcdir)/pcgi-wrapper.o $(testdir)/parseinfo.o
HDRS = pcgi.h $(creosotedir)/creosote.h

# --with-XXX options for configure
WITH=

MANIFEST=$(srcdir)/manifest

# default path permission settings
DIRMODE=	775                                                             
EXEMODE=	755                                                             
FILEMODE=	644                                                             
                                                                                
# Portable install script (configure doesn't always guess right)                
INSTALL=	./install-sh -c                                                 
INSTALL_PROGRAM=${INSTALL} -m $(EXEMODE)                                        
INSTALL_DATA=   ${INSTALL} -m $(FILEMODE)                                       

##################################################

all:	pcgi-wrapper $(testdir)/parseinfo
	
pcgi-wrapper.o:	pcgi-wrapper.c pcgi.h
	$(CC) -c -I. -I$(srcdir) $(CFLAGS) -DPCGI_WRAPPER_MAIN -DVERSION=\"$(VERSION)\" $(DEFS) $(srcdir)/pcgi-wrapper.c

parseinfo.o: parseinfo.c pcgi.h
	$(CC) -c -I. -I$(srcdir) $(CFLAGS) $(DEFS) $(srcdir)/parseinfo.c

pcgi-wrapper: pcgi-wrapper.o parseinfo.o
	$(CC) $(LIBS) $(LDFLAGS) -o pcgi-wrapper $(OBJS1)

### begin CREOSOTE stuff ###

$(creosotedir)/creosote.o: $(creosotedir)/creosote.c $(creosotedir)/creosote.h
	$(CC) -c -o $(creosotedir)/creosote.o -I. -I$(srcdir) -I$(creosotedir) $(CFLAGS) -DCREOSOTE $(DEFS) $(creosotedir)/creosote.c

$(creosotedir)/pcgi-wrapper.o: $(srcdir)/pcgi-wrapper.c
	$(CC) -c -o $(creosotedir)/pcgi-wrapper.o -I. -I$(srcdir) -I$(creosotedir) $(CFLAGS) -DPCGI_WRAPPER_MAIN -DCREOSOTE $(DEFS) $(srcdir)/pcgi-wrapper.c

creosote: $(creosotedir)/pcgi-creosote

$(creosotedir)/pcgi-creosote: $(creosotedir)/pcgi-wrapper.o parseinfo.o $(creosotedir)/creosote.o
	$(CC) $(LIBS) $(LDFLAGS) -o $(creosotedir)/pcgi-creosote $(OBJS2)

### end CREOSOTE stuff ###

### begin TEST stuff ###

$(testdir)/parseinfo.o: $(srcdir)/parseinfo.c
	$(CC) -c -o $(testdir)/parseinfo.o -I. -I$(srcdir) -I$(testdir) $(CFLAGS) -DMAIN_PARSEINFO $(DEFS) $(srcdir)/parseinfo.c

$(testdir)/pcgi-wrapper.o: $(srcdir)/pcgi-wrapper.c
	$(CC) -c -o $(testdir)/pcgi-wrapper.o -I. -I$(srcdir) -I$(testdir) $(CFLAGS) $(DEFS) $(srcdir)/pcgi-wrapper.c

parseinfo: $(testdir)/parseinfo	

$(testdir)/parseinfo: $(testdir)/parseinfo.o $(testdir)/pcgi-wrapper.o
	$(CC) $(LIBS) $(LDFLAGS) -o $(testdir)/parseinfo $(testdir)/parseinfo.o $(testdir)/pcgi-wrapper.o

### end TEST stuff ###

install:	bininstall

bininstall:	altbininstall
	cp pcgi-wrapper $(BINDIR)
	chmod a+rx $(BINDIR)/pcgi-wrapper
	-if test -f $(BINDIR)/pcgi-wrapper; \
	then rm -f $(BINDIR)/pcgi-wrapper; \
	else true; \
	fi
	(cd $(BINDIR); ln pcgi-wrapper$(VERSION) pcgi-wrapper)

altbininstall:	pcgi-wrapper
	@for i in $(BINDIR); \
	do \
		if test ! -d $$i; then \
			echo "Creating directory $$i"; \
			mkdir $$i; \
			chmod $(DIRMODE) $$i; \
		else	true; \
		fi; \
	done
	$(INSTALL_PROGRAM) pcgi-wrapper $(BINDIR)/pcgi-wrapper$(VERSION)

clean:
	rm -f $(PROGS) *.o *.out core $(creosotedir)/*.o $(testdir)/*.o $(utildir)/*.o Win32/*.obj

distclean:	clean
	rm -f Makefile autoconf.h config.status config.cache config.log *~

tarball:
	cd $(srcdir); mkdir pcgi-$(VERSION)
	cpio -pd < $(MANIFEST) pcgi-$(VERSION)
	tar -czf $(srcdir)/pcgi-$(VERSION).tgz pcgi-$(VERSION)
	rm -rf pcgi-$(VERSION)

# Build the toplevel Makefile
#Makefile:	Makefile.in config.status
#		CONFIG_FILES=Makefile $(SHELL) config.status

# Run the configure script, calling it with --recheck if config.status exists
#config.status:	$(srcdir)/configure
#		if test -f config.status; \
#		then $(SHELL) config.status --recheck; \
#		     $(SHELL) config.status; \
#		else $(SHELL) $(srcdir)/configure $(WITH); \
#		fi

# Rebuild the configure script from configure.in
autoconf:
		(cd $(srcdir); autoconf)
		(cd $(srcdir); autoheader)

Zope-2.0.1-ZEO-nonbin/pcgi/README100755   1007   1403        1641  6612715525  16124 0ustar  petrillipetrilliREADME notes for Persistent CGI - version 2.0 alpha 4

What it is?

  Persistent CGI is an architecture designed by Digital Creations
  http://www.digicool.com to publish web objects as long-running
  processes.  The pcgi component is an integral part of DC's
  Principia product, but is also provided to Bobo developers
  under open software terms.  Please review the copyright appearing
  in the source code for full details.

How to build?

  Unix:
    ./configure
    make
    make install   <-- only copies the binary, not the .py modules

  Win32:
    cd Win32
    nmake /f Makefile.nt

  A Win32 binary (pcgi-wrapper.exe) is included with the source 
  distribution.

How to use?

  See the HOWTO section in notes I have published:

    http://starship.skyport.net/crew/jbauer/persistcgi/

How to get help?

  Subscribe to the Bobo mailing list:  bobo@digicool.com
  Contact me:  jeffbauer@bigfoot.com


Have fun.

-Jeff

Zope-2.0.1-ZEO-nonbin/pcgi/config.h.in100755   1007   1403        1351  6612715525  17265 0ustar  petrillipetrilli/* config.h.in.  Generated automatically from configure.in by autoheader.  */

/* Define to empty if the keyword does not work.  */
#undef const

/* Define if you have  that is POSIX.1 compatible.  */
#undef HAVE_SYS_WAIT_H

/* Define to `int' if  doesn't define.  */
#undef pid_t

/* Define as the return type of signal handlers (int or void).  */
#undef RETSIGTYPE

/* Define if you have the ANSI C header files.  */
#undef STDC_HEADERS

/* Define if you have the putenv function.  */
#undef HAVE_PUTENV

/* Define if you have the socket function.  */
#undef HAVE_SOCKET

/* Define if you have the strerror function.  */
#undef HAVE_STRERROR

/* Define if you have the  header file.  */
#undef HAVE_UNISTD_H
Zope-2.0.1-ZEO-nonbin/pcgi/configure100755   1007   1403      133375  6631611273  17216 0ustar  petrillipetrilli#! /bin/sh

# Guess values for system-dependent variables and create Makefiles.
# Generated automatically using autoconf version 2.12 
# Copyright (C) 1992, 93, 94, 95, 96 Free Software Foundation, Inc.
#
# This configure script is free software; the Free Software Foundation
# gives unlimited permission to copy, distribute and modify it.

# Defaults:
ac_help=
ac_default_prefix=/usr/local
# Any additions from configure.in:

# Initialize some variables set by options.
# The variables have the same names as the options, with
# dashes changed to underlines.
build=NONE
cache_file=./config.cache
exec_prefix=NONE
host=NONE
no_create=
nonopt=NONE
no_recursion=
prefix=NONE
program_prefix=NONE
program_suffix=NONE
program_transform_name=s,x,x,
silent=
site=
srcdir=
target=NONE
verbose=
x_includes=NONE
x_libraries=NONE
bindir='${exec_prefix}/bin'
sbindir='${exec_prefix}/sbin'
libexecdir='${exec_prefix}/libexec'
datadir='${prefix}/share'
sysconfdir='${prefix}/etc'
sharedstatedir='${prefix}/com'
localstatedir='${prefix}/var'
libdir='${exec_prefix}/lib'
includedir='${prefix}/include'
oldincludedir='/usr/include'
infodir='${prefix}/info'
mandir='${prefix}/man'

# Initialize some other variables.
subdirs=
MFLAGS= MAKEFLAGS=
# Maximum number of lines to put in a shell here document.
ac_max_here_lines=12

ac_prev=
for ac_option
do

  # If the previous option needs an argument, assign it.
  if test -n "$ac_prev"; then
    eval "$ac_prev=\$ac_option"
    ac_prev=
    continue
  fi

  case "$ac_option" in
  -*=*) ac_optarg=`echo "$ac_option" | sed 's/[-_a-zA-Z0-9]*=//'` ;;
  *) ac_optarg= ;;
  esac

  # Accept the important Cygnus configure options, so we can diagnose typos.

  case "$ac_option" in

  -bindir | --bindir | --bindi | --bind | --bin | --bi)
    ac_prev=bindir ;;
  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
    bindir="$ac_optarg" ;;

  -build | --build | --buil | --bui | --bu)
    ac_prev=build ;;
  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
    build="$ac_optarg" ;;

  -cache-file | --cache-file | --cache-fil | --cache-fi \
  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
    ac_prev=cache_file ;;
  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
    cache_file="$ac_optarg" ;;

  -datadir | --datadir | --datadi | --datad | --data | --dat | --da)
    ac_prev=datadir ;;
  -datadir=* | --datadir=* | --datadi=* | --datad=* | --data=* | --dat=* \
  | --da=*)
    datadir="$ac_optarg" ;;

  -disable-* | --disable-*)
    ac_feature=`echo $ac_option|sed -e 's/-*disable-//'`
    # Reject names that are not valid shell variable names.
    if test -n "`echo $ac_feature| sed 's/[-a-zA-Z0-9_]//g'`"; then
      { echo "configure: error: $ac_feature: invalid feature name" 1>&2; exit 1; }
    fi
    ac_feature=`echo $ac_feature| sed 's/-/_/g'`
    eval "enable_${ac_feature}=no" ;;

  -enable-* | --enable-*)
    ac_feature=`echo $ac_option|sed -e 's/-*enable-//' -e 's/=.*//'`
    # Reject names that are not valid shell variable names.
    if test -n "`echo $ac_feature| sed 's/[-_a-zA-Z0-9]//g'`"; then
      { echo "configure: error: $ac_feature: invalid feature name" 1>&2; exit 1; }
    fi
    ac_feature=`echo $ac_feature| sed 's/-/_/g'`
    case "$ac_option" in
      *=*) ;;
      *) ac_optarg=yes ;;
    esac
    eval "enable_${ac_feature}='$ac_optarg'" ;;

  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
  | --exec | --exe | --ex)
    ac_prev=exec_prefix ;;
  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
  | --exec=* | --exe=* | --ex=*)
    exec_prefix="$ac_optarg" ;;

  -gas | --gas | --ga | --g)
    # Obsolete; use --with-gas.
    with_gas=yes ;;

  -help | --help | --hel | --he)
    # Omit some internal or obsolete options to make the list less imposing.
    # This message is too long to be a string in the A/UX 3.1 sh.
    cat << EOF
Usage: configure [options] [host]
Options: [defaults in brackets after descriptions]
Configuration:
  --cache-file=FILE       cache test results in FILE
  --help                  print this message
  --no-create             do not create output files
  --quiet, --silent       do not print \`checking...' messages
  --version               print the version of autoconf that created configure
Directory and file names:
  --prefix=PREFIX         install architecture-independent files in PREFIX
                          [$ac_default_prefix]
  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
                          [same as prefix]
  --bindir=DIR            user executables in DIR [EPREFIX/bin]
  --sbindir=DIR           system admin executables in DIR [EPREFIX/sbin]
  --libexecdir=DIR        program executables in DIR [EPREFIX/libexec]
  --datadir=DIR           read-only architecture-independent data in DIR
                          [PREFIX/share]
  --sysconfdir=DIR        read-only single-machine data in DIR [PREFIX/etc]
  --sharedstatedir=DIR    modifiable architecture-independent data in DIR
                          [PREFIX/com]
  --localstatedir=DIR     modifiable single-machine data in DIR [PREFIX/var]
  --libdir=DIR            object code libraries in DIR [EPREFIX/lib]
  --includedir=DIR        C header files in DIR [PREFIX/include]
  --oldincludedir=DIR     C header files for non-gcc in DIR [/usr/include]
  --infodir=DIR           info documentation in DIR [PREFIX/info]
  --mandir=DIR            man documentation in DIR [PREFIX/man]
  --srcdir=DIR            find the sources in DIR [configure dir or ..]
  --program-prefix=PREFIX prepend PREFIX to installed program names
  --program-suffix=SUFFIX append SUFFIX to installed program names
  --program-transform-name=PROGRAM
                          run sed PROGRAM on installed program names
EOF
    cat << EOF
Host type:
  --build=BUILD           configure for building on BUILD [BUILD=HOST]
  --host=HOST             configure for HOST [guessed]
  --target=TARGET         configure for TARGET [TARGET=HOST]
Features and packages:
  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
  --with-PACKAGE[=ARG]    use PACKAGE [ARG=yes]
  --without-PACKAGE       do not use PACKAGE (same as --with-PACKAGE=no)
  --x-includes=DIR        X include files are in DIR
  --x-libraries=DIR       X library files are in DIR
EOF
    if test -n "$ac_help"; then
      echo "--enable and --with options recognized:$ac_help"
    fi
    exit 0 ;;

  -host | --host | --hos | --ho)
    ac_prev=host ;;
  -host=* | --host=* | --hos=* | --ho=*)
    host="$ac_optarg" ;;

  -includedir | --includedir | --includedi | --included | --include \
  | --includ | --inclu | --incl | --inc)
    ac_prev=includedir ;;
  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
  | --includ=* | --inclu=* | --incl=* | --inc=*)
    includedir="$ac_optarg" ;;

  -infodir | --infodir | --infodi | --infod | --info | --inf)
    ac_prev=infodir ;;
  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
    infodir="$ac_optarg" ;;

  -libdir | --libdir | --libdi | --libd)
    ac_prev=libdir ;;
  -libdir=* | --libdir=* | --libdi=* | --libd=*)
    libdir="$ac_optarg" ;;

  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
  | --libexe | --libex | --libe)
    ac_prev=libexecdir ;;
  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
  | --libexe=* | --libex=* | --libe=*)
    libexecdir="$ac_optarg" ;;

  -localstatedir | --localstatedir | --localstatedi | --localstated \
  | --localstate | --localstat | --localsta | --localst \
  | --locals | --local | --loca | --loc | --lo)
    ac_prev=localstatedir ;;
  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
  | --localstate=* | --localstat=* | --localsta=* | --localst=* \
  | --locals=* | --local=* | --loca=* | --loc=* | --lo=*)
    localstatedir="$ac_optarg" ;;

  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
    ac_prev=mandir ;;
  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
    mandir="$ac_optarg" ;;

  -nfp | --nfp | --nf)
    # Obsolete; use --without-fp.
    with_fp=no ;;

  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
  | --no-cr | --no-c)
    no_create=yes ;;

  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
    no_recursion=yes ;;

  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
  | --oldin | --oldi | --old | --ol | --o)
    ac_prev=oldincludedir ;;
  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
    oldincludedir="$ac_optarg" ;;

  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
    ac_prev=prefix ;;
  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
    prefix="$ac_optarg" ;;

  -program-prefix | --program-prefix | --program-prefi | --program-pref \
  | --program-pre | --program-pr | --program-p)
    ac_prev=program_prefix ;;
  -program-prefix=* | --program-prefix=* | --program-prefi=* \
  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
    program_prefix="$ac_optarg" ;;

  -program-suffix | --program-suffix | --program-suffi | --program-suff \
  | --program-suf | --program-su | --program-s)
    ac_prev=program_suffix ;;
  -program-suffix=* | --program-suffix=* | --program-suffi=* \
  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
    program_suffix="$ac_optarg" ;;

  -program-transform-name | --program-transform-name \
  | --program-transform-nam | --program-transform-na \
  | --program-transform-n | --program-transform- \
  | --program-transform | --program-transfor \
  | --program-transfo | --program-transf \
  | --program-trans | --program-tran \
  | --progr-tra | --program-tr | --program-t)
    ac_prev=program_transform_name ;;
  -program-transform-name=* | --program-transform-name=* \
  | --program-transform-nam=* | --program-transform-na=* \
  | --program-transform-n=* | --program-transform-=* \
  | --program-transform=* | --program-transfor=* \
  | --program-transfo=* | --program-transf=* \
  | --program-trans=* | --program-tran=* \
  | --progr-tra=* | --program-tr=* | --program-t=*)
    program_transform_name="$ac_optarg" ;;

  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
  | -silent | --silent | --silen | --sile | --sil)
    silent=yes ;;

  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
    ac_prev=sbindir ;;
  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
  | --sbi=* | --sb=*)
    sbindir="$ac_optarg" ;;

  -sharedstatedir | --sharedstatedir | --sharedstatedi \
  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
  | --sharedst | --shareds | --shared | --share | --shar \
  | --sha | --sh)
    ac_prev=sharedstatedir ;;
  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
  | --sha=* | --sh=*)
    sharedstatedir="$ac_optarg" ;;

  -site | --site | --sit)
    ac_prev=site ;;
  -site=* | --site=* | --sit=*)
    site="$ac_optarg" ;;

  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
    ac_prev=srcdir ;;
  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
    srcdir="$ac_optarg" ;;

  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
  | --syscon | --sysco | --sysc | --sys | --sy)
    ac_prev=sysconfdir ;;
  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
    sysconfdir="$ac_optarg" ;;

  -target | --target | --targe | --targ | --tar | --ta | --t)
    ac_prev=target ;;
  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
    target="$ac_optarg" ;;

  -v | -verbose | --verbose | --verbos | --verbo | --verb)
    verbose=yes ;;

  -version | --version | --versio | --versi | --vers)
    echo "configure generated by autoconf version 2.12"
    exit 0 ;;

  -with-* | --with-*)
    ac_package=`echo $ac_option|sed -e 's/-*with-//' -e 's/=.*//'`
    # Reject names that are not valid shell variable names.
    if test -n "`echo $ac_package| sed 's/[-_a-zA-Z0-9]//g'`"; then
      { echo "configure: error: $ac_package: invalid package name" 1>&2; exit 1; }
    fi
    ac_package=`echo $ac_package| sed 's/-/_/g'`
    case "$ac_option" in
      *=*) ;;
      *) ac_optarg=yes ;;
    esac
    eval "with_${ac_package}='$ac_optarg'" ;;

  -without-* | --without-*)
    ac_package=`echo $ac_option|sed -e 's/-*without-//'`
    # Reject names that are not valid shell variable names.
    if test -n "`echo $ac_package| sed 's/[-a-zA-Z0-9_]//g'`"; then
      { echo "configure: error: $ac_package: invalid package name" 1>&2; exit 1; }
    fi
    ac_package=`echo $ac_package| sed 's/-/_/g'`
    eval "with_${ac_package}=no" ;;

  --x)
    # Obsolete; use --with-x.
    with_x=yes ;;

  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
  | --x-incl | --x-inc | --x-in | --x-i)
    ac_prev=x_includes ;;
  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
    x_includes="$ac_optarg" ;;

  -x-libraries | --x-libraries | --x-librarie | --x-librari \
  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
    ac_prev=x_libraries ;;
  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
    x_libraries="$ac_optarg" ;;

  -*) { echo "configure: error: $ac_option: invalid option; use --help to show usage" 1>&2; exit 1; }
    ;;

  *)
    if test -n "`echo $ac_option| sed 's/[-a-z0-9.]//g'`"; then
      echo "configure: warning: $ac_option: invalid host type" 1>&2
    fi
    if test "x$nonopt" != xNONE; then
      { echo "configure: error: can only configure for one host and one target at a time" 1>&2; exit 1; }
    fi
    nonopt="$ac_option"
    ;;

  esac
done

if test -n "$ac_prev"; then
  { echo "configure: error: missing argument to --`echo $ac_prev | sed 's/_/-/g'`" 1>&2; exit 1; }
fi

trap 'rm -fr conftest* confdefs* core core.* *.core $ac_clean_files; exit 1' 1 2 15

# File descriptor usage:
# 0 standard input
# 1 file creation
# 2 errors and warnings
# 3 some systems may open it to /dev/tty
# 4 used on the Kubota Titan
# 6 checking for... messages and results
# 5 compiler messages saved in config.log
if test "$silent" = yes; then
  exec 6>/dev/null
else
  exec 6>&1
fi
exec 5>./config.log

echo "\
This file contains any messages produced by compilers while
running configure, to aid debugging if configure makes a mistake.
" 1>&5

# Strip out --no-create and --no-recursion so they do not pile up.
# Also quote any args containing shell metacharacters.
ac_configure_args=
for ac_arg
do
  case "$ac_arg" in
  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
  | --no-cr | --no-c) ;;
  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) ;;
  *" "*|*"	"*|*[\[\]\~\#\$\^\&\*\(\)\{\}\\\|\;\<\>\?]*)
  ac_configure_args="$ac_configure_args '$ac_arg'" ;;
  *) ac_configure_args="$ac_configure_args $ac_arg" ;;
  esac
done

# NLS nuisances.
# Only set these to C if already set.  These must not be set unconditionally
# because not all systems understand e.g. LANG=C (notably SCO).
# Fixing LC_MESSAGES prevents Solaris sh from translating var values in `set'!
# Non-C LC_CTYPE values break the ctype check.
if test "${LANG+set}"   = set; then LANG=C;   export LANG;   fi
if test "${LC_ALL+set}" = set; then LC_ALL=C; export LC_ALL; fi
if test "${LC_MESSAGES+set}" = set; then LC_MESSAGES=C; export LC_MESSAGES; fi
if test "${LC_CTYPE+set}"    = set; then LC_CTYPE=C;    export LC_CTYPE;    fi

# confdefs.h avoids OS command line length limits that DEFS can exceed.
rm -rf conftest* confdefs.h
# AIX cpp loses on an empty file, so make sure it contains at least a newline.
echo > confdefs.h

# A filename unique to this package, relative to the directory that
# configure is in, which we can look for to find out if srcdir is correct.
ac_unique_file=pcgi.h

# Find the source files, if location was not specified.
if test -z "$srcdir"; then
  ac_srcdir_defaulted=yes
  # Try the directory containing this script, then its parent.
  ac_prog=$0
  ac_confdir=`echo $ac_prog|sed 's%/[^/][^/]*$%%'`
  test "x$ac_confdir" = "x$ac_prog" && ac_confdir=.
  srcdir=$ac_confdir
  if test ! -r $srcdir/$ac_unique_file; then
    srcdir=..
  fi
else
  ac_srcdir_defaulted=no
fi
if test ! -r $srcdir/$ac_unique_file; then
  if test "$ac_srcdir_defaulted" = yes; then
    { echo "configure: error: can not find sources in $ac_confdir or .." 1>&2; exit 1; }
  else
    { echo "configure: error: can not find sources in $srcdir" 1>&2; exit 1; }
  fi
fi
srcdir=`echo "${srcdir}" | sed 's%\([^/]\)/*$%\1%'`

# Prefer explicitly selected file to automatically selected ones.
if test -z "$CONFIG_SITE"; then
  if test "x$prefix" != xNONE; then
    CONFIG_SITE="$prefix/share/config.site $prefix/etc/config.site"
  else
    CONFIG_SITE="$ac_default_prefix/share/config.site $ac_default_prefix/etc/config.site"
  fi
fi
for ac_site_file in $CONFIG_SITE; do
  if test -r "$ac_site_file"; then
    echo "loading site script $ac_site_file"
    . "$ac_site_file"
  fi
done

if test -r "$cache_file"; then
  echo "loading cache $cache_file"
  . $cache_file
else
  echo "creating cache $cache_file"
  > $cache_file
fi

ac_ext=c
# CFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options.
ac_cpp='$CPP $CPPFLAGS'
ac_compile='${CC-cc} -c $CFLAGS $CPPFLAGS conftest.$ac_ext 1>&5'
ac_link='${CC-cc} -o conftest $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS 1>&5'
cross_compiling=$ac_cv_prog_cc_cross

if (echo "testing\c"; echo 1,2,3) | grep c >/dev/null; then
  # Stardent Vistra SVR4 grep lacks -e, says ghazi@caip.rutgers.edu.
  if (echo -n testing; echo 1,2,3) | sed s/-n/xn/ | grep xn >/dev/null; then
    ac_n= ac_c='
' ac_t='	'
  else
    ac_n=-n ac_c= ac_t=
  fi
else
  ac_n= ac_c='\c' ac_t=
fi


# Extract the first word of "gcc", so it can be a program name with args.
set dummy gcc; ac_word=$2
echo $ac_n "checking for $ac_word""... $ac_c" 1>&6
echo "configure:525: checking for $ac_word" >&5
if eval "test \"`echo '$''{'ac_cv_prog_CC'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  if test -n "$CC"; then
  ac_cv_prog_CC="$CC" # Let the user override the test.
else
  IFS="${IFS= 	}"; ac_save_ifs="$IFS"; IFS="${IFS}:"
  for ac_dir in $PATH; do
    test -z "$ac_dir" && ac_dir=.
    if test -f $ac_dir/$ac_word; then
      ac_cv_prog_CC="gcc"
      break
    fi
  done
  IFS="$ac_save_ifs"
fi
fi
CC="$ac_cv_prog_CC"
if test -n "$CC"; then
  echo "$ac_t""$CC" 1>&6
else
  echo "$ac_t""no" 1>&6
fi

if test -z "$CC"; then
  # Extract the first word of "cc", so it can be a program name with args.
set dummy cc; ac_word=$2
echo $ac_n "checking for $ac_word""... $ac_c" 1>&6
echo "configure:554: checking for $ac_word" >&5
if eval "test \"`echo '$''{'ac_cv_prog_CC'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  if test -n "$CC"; then
  ac_cv_prog_CC="$CC" # Let the user override the test.
else
  IFS="${IFS= 	}"; ac_save_ifs="$IFS"; IFS="${IFS}:"
  ac_prog_rejected=no
  for ac_dir in $PATH; do
    test -z "$ac_dir" && ac_dir=.
    if test -f $ac_dir/$ac_word; then
      if test "$ac_dir/$ac_word" = "/usr/ucb/cc"; then
        ac_prog_rejected=yes
	continue
      fi
      ac_cv_prog_CC="cc"
      break
    fi
  done
  IFS="$ac_save_ifs"
if test $ac_prog_rejected = yes; then
  # We found a bogon in the path, so make sure we never use it.
  set dummy $ac_cv_prog_CC
  shift
  if test $# -gt 0; then
    # We chose a different compiler from the bogus one.
    # However, it has the same basename, so the bogon will be chosen
    # first if we set CC to just the basename; use the full file name.
    shift
    set dummy "$ac_dir/$ac_word" "$@"
    shift
    ac_cv_prog_CC="$@"
  fi
fi
fi
fi
CC="$ac_cv_prog_CC"
if test -n "$CC"; then
  echo "$ac_t""$CC" 1>&6
else
  echo "$ac_t""no" 1>&6
fi

  test -z "$CC" && { echo "configure: error: no acceptable cc found in \$PATH" 1>&2; exit 1; }
fi

echo $ac_n "checking whether the C compiler ($CC $CFLAGS $LDFLAGS) works""... $ac_c" 1>&6
echo "configure:602: checking whether the C compiler ($CC $CFLAGS $LDFLAGS) works" >&5

ac_ext=c
# CFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options.
ac_cpp='$CPP $CPPFLAGS'
ac_compile='${CC-cc} -c $CFLAGS $CPPFLAGS conftest.$ac_ext 1>&5'
ac_link='${CC-cc} -o conftest $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS 1>&5'
cross_compiling=$ac_cv_prog_cc_cross

cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then
  ac_cv_prog_cc_works=yes
  # If we can't run a trivial program, we are probably using a cross compiler.
  if (./conftest; exit) 2>/dev/null; then
    ac_cv_prog_cc_cross=no
  else
    ac_cv_prog_cc_cross=yes
  fi
else
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  ac_cv_prog_cc_works=no
fi
rm -fr conftest*

echo "$ac_t""$ac_cv_prog_cc_works" 1>&6
if test $ac_cv_prog_cc_works = no; then
  { echo "configure: error: installation or configuration problem: C compiler cannot create executables." 1>&2; exit 1; }
fi
echo $ac_n "checking whether the C compiler ($CC $CFLAGS $LDFLAGS) is a cross-compiler""... $ac_c" 1>&6
echo "configure:636: checking whether the C compiler ($CC $CFLAGS $LDFLAGS) is a cross-compiler" >&5
echo "$ac_t""$ac_cv_prog_cc_cross" 1>&6
cross_compiling=$ac_cv_prog_cc_cross

echo $ac_n "checking whether we are using GNU C""... $ac_c" 1>&6
echo "configure:641: checking whether we are using GNU C" >&5
if eval "test \"`echo '$''{'ac_cv_prog_gcc'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  cat > conftest.c <&5; (eval $ac_try) 2>&5; }; } | egrep yes >/dev/null 2>&1; then
  ac_cv_prog_gcc=yes
else
  ac_cv_prog_gcc=no
fi
fi

echo "$ac_t""$ac_cv_prog_gcc" 1>&6

if test $ac_cv_prog_gcc = yes; then
  GCC=yes
  ac_test_CFLAGS="${CFLAGS+set}"
  ac_save_CFLAGS="$CFLAGS"
  CFLAGS=
  echo $ac_n "checking whether ${CC-cc} accepts -g""... $ac_c" 1>&6
echo "configure:665: checking whether ${CC-cc} accepts -g" >&5
if eval "test \"`echo '$''{'ac_cv_prog_cc_g'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  echo 'void f(){}' > conftest.c
if test -z "`${CC-cc} -g -c conftest.c 2>&1`"; then
  ac_cv_prog_cc_g=yes
else
  ac_cv_prog_cc_g=no
fi
rm -f conftest*

fi

echo "$ac_t""$ac_cv_prog_cc_g" 1>&6
  if test "$ac_test_CFLAGS" = set; then
    CFLAGS="$ac_save_CFLAGS"
  elif test $ac_cv_prog_cc_g = yes; then
    CFLAGS="-g -O2"
  else
    CFLAGS="-O2"
  fi
else
  GCC=
  test "${CFLAGS+set}" = set || CFLAGS="-g"
fi

echo $ac_n "checking how to run the C preprocessor""... $ac_c" 1>&6
echo "configure:693: checking how to run the C preprocessor" >&5
# On Suns, sometimes $CPP names a directory.
if test -n "$CPP" && test -d "$CPP"; then
  CPP=
fi
if test -z "$CPP"; then
if eval "test \"`echo '$''{'ac_cv_prog_CPP'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
    # This must be in double quotes, not single quotes, because CPP may get
  # substituted into the Makefile and "${CC-cc}" will confuse make.
  CPP="${CC-cc} -E"
  # On the NeXT, cc -E runs the code through the compiler's parser,
  # not just through cpp.
  cat > conftest.$ac_ext <
Syntax Error
EOF
ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out"
{ (eval echo configure:714: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; }
ac_err=`grep -v '^ *+' conftest.out`
if test -z "$ac_err"; then
  :
else
  echo "$ac_err" >&5
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -rf conftest*
  CPP="${CC-cc} -E -traditional-cpp"
  cat > conftest.$ac_ext <
Syntax Error
EOF
ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out"
{ (eval echo configure:731: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; }
ac_err=`grep -v '^ *+' conftest.out`
if test -z "$ac_err"; then
  :
else
  echo "$ac_err" >&5
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -rf conftest*
  CPP=/lib/cpp
fi
rm -f conftest*
fi
rm -f conftest*
  ac_cv_prog_CPP="$CPP"
fi
  CPP="$ac_cv_prog_CPP"
else
  ac_cv_prog_CPP="$CPP"
fi
echo "$ac_t""$CPP" 1>&6


# Set VERSION here so we only need to edit it in one place

VERSION=2.0a5

# Set name for machine-dependent library files

echo $ac_n "checking MACHDEP""... $ac_c" 1>&6
echo "configure:761: checking MACHDEP" >&5
if test -z "$MACHDEP"
then
	ac_sys_system=`uname -s`
	if test "$ac_sys_system" = "AIX" ; then
		ac_sys_release=`uname -v`
	else
		ac_sys_release=`uname -r`
	fi
	ac_md_system=`echo $ac_sys_system | tr -d '/ ' | tr '[A-Z]' '[a-z]'`
	ac_md_release=`echo $ac_sys_release | tr -d '/ ' | sed 's/\..*//'`
	MACHDEP="$ac_md_system$ac_md_release"

	case $MACHDEP in
	'')	MACHDEP="unknown";;
	esac
fi
echo "$ac_t""$MACHDEP" 1>&6



case $ac_sys_system in
hp*|HP*)
    case $CC in
    cc|*/cc) CC="$CC -Aa -D_HPUX_SOURCE";;
    esac;;
esac

if test "$ac_sys_system" != IRIX
then
echo $ac_n "checking for inet_addr in -lnsl""... $ac_c" 1>&6
echo "configure:792: checking for inet_addr in -lnsl" >&5
ac_lib_var=`echo nsl'_'inet_addr | sed 'y%./+-%__p_%'`
if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  ac_save_LIBS="$LIBS"
LIBS="-lnsl  $LIBS"
cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then
  rm -rf conftest*
  eval "ac_cv_lib_$ac_lib_var=yes"
else
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -rf conftest*
  eval "ac_cv_lib_$ac_lib_var=no"
fi
rm -f conftest*
LIBS="$ac_save_LIBS"

fi
if eval "test \"`echo '$ac_cv_lib_'$ac_lib_var`\" = yes"; then
  echo "$ac_t""yes" 1>&6
  LIBS="-lnsl $LIBS"
else
  echo "$ac_t""no" 1>&6
fi
 # SVR4
echo $ac_n "checking for socket in -lsocket""... $ac_c" 1>&6
echo "configure:832: checking for socket in -lsocket" >&5
ac_lib_var=`echo socket'_'socket | sed 'y%./+-%__p_%'`
if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  ac_save_LIBS="$LIBS"
LIBS="-lsocket $LIBS $LIBS"
cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then
  rm -rf conftest*
  eval "ac_cv_lib_$ac_lib_var=yes"
else
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -rf conftest*
  eval "ac_cv_lib_$ac_lib_var=no"
fi
rm -f conftest*
LIBS="$ac_save_LIBS"

fi
if eval "test \"`echo '$ac_cv_lib_'$ac_lib_var`\" = yes"; then
  echo "$ac_t""yes" 1>&6
  LIBS="-lsocket $LIBS"
else
  echo "$ac_t""no" 1>&6
fi
 # SVR4 sockets
fi

echo $ac_n "checking for ANSI C header files""... $ac_c" 1>&6
echo "configure:874: checking for ANSI C header files" >&5
if eval "test \"`echo '$''{'ac_cv_header_stdc'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  cat > conftest.$ac_ext <
#include 
#include 
#include 
EOF
ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out"
{ (eval echo configure:887: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; }
ac_err=`grep -v '^ *+' conftest.out`
if test -z "$ac_err"; then
  rm -rf conftest*
  ac_cv_header_stdc=yes
else
  echo "$ac_err" >&5
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -rf conftest*
  ac_cv_header_stdc=no
fi
rm -f conftest*

if test $ac_cv_header_stdc = yes; then
  # SunOS 4.x string.h does not declare mem*, contrary to ANSI.
cat > conftest.$ac_ext <
EOF
if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
  egrep "memchr" >/dev/null 2>&1; then
  :
else
  rm -rf conftest*
  ac_cv_header_stdc=no
fi
rm -f conftest*

fi

if test $ac_cv_header_stdc = yes; then
  # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI.
cat > conftest.$ac_ext <
EOF
if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
  egrep "free" >/dev/null 2>&1; then
  :
else
  rm -rf conftest*
  ac_cv_header_stdc=no
fi
rm -f conftest*

fi

if test $ac_cv_header_stdc = yes; then
  # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi.
if test "$cross_compiling" = yes; then
  :
else
  cat > conftest.$ac_ext <
#define ISLOWER(c) ('a' <= (c) && (c) <= 'z')
#define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c))
#define XOR(e, f) (((e) && !(f)) || (!(e) && (f)))
int main () { int i; for (i = 0; i < 256; i++)
if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) exit(2);
exit (0); }

EOF
if { (eval echo configure:954: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null
then
  :
else
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -fr conftest*
  ac_cv_header_stdc=no
fi
rm -fr conftest*
fi

fi
fi

echo "$ac_t""$ac_cv_header_stdc" 1>&6
if test $ac_cv_header_stdc = yes; then
  cat >> confdefs.h <<\EOF
#define STDC_HEADERS 1
EOF

fi

echo $ac_n "checking for sys/wait.h that is POSIX.1 compatible""... $ac_c" 1>&6
echo "configure:978: checking for sys/wait.h that is POSIX.1 compatible" >&5
if eval "test \"`echo '$''{'ac_cv_header_sys_wait_h'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  cat > conftest.$ac_ext <
#include 
#ifndef WEXITSTATUS
#define WEXITSTATUS(stat_val) ((unsigned)(stat_val) >> 8)
#endif
#ifndef WIFEXITED
#define WIFEXITED(stat_val) (((stat_val) & 255) == 0)
#endif
int main() {
int s;
wait (&s);
s = WIFEXITED (s) ? WEXITSTATUS (s) : 1;
; return 0; }
EOF
if { (eval echo configure:999: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then
  rm -rf conftest*
  ac_cv_header_sys_wait_h=yes
else
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -rf conftest*
  ac_cv_header_sys_wait_h=no
fi
rm -f conftest*
fi

echo "$ac_t""$ac_cv_header_sys_wait_h" 1>&6
if test $ac_cv_header_sys_wait_h = yes; then
  cat >> confdefs.h <<\EOF
#define HAVE_SYS_WAIT_H 1
EOF

fi

for ac_hdr in unistd.h
do
ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'`
echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6
echo "configure:1023: checking for $ac_hdr" >&5
if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  cat > conftest.$ac_ext <
EOF
ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out"
{ (eval echo configure:1033: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; }
ac_err=`grep -v '^ *+' conftest.out`
if test -z "$ac_err"; then
  rm -rf conftest*
  eval "ac_cv_header_$ac_safe=yes"
else
  echo "$ac_err" >&5
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -rf conftest*
  eval "ac_cv_header_$ac_safe=no"
fi
rm -f conftest*
fi
if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then
  echo "$ac_t""yes" 1>&6
    ac_tr_hdr=HAVE_`echo $ac_hdr | sed 'y%abcdefghijklmnopqrstuvwxyz./-%ABCDEFGHIJKLMNOPQRSTUVWXYZ___%'`
  cat >> confdefs.h <&6
fi
done


echo $ac_n "checking for working const""... $ac_c" 1>&6
echo "configure:1061: checking for working const" >&5
if eval "test \"`echo '$''{'ac_cv_c_const'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  cat > conftest.$ac_ext <j = 5;
}
{ /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */
  const int foo = 10;
}

; return 0; }
EOF
if { (eval echo configure:1115: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then
  rm -rf conftest*
  ac_cv_c_const=yes
else
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -rf conftest*
  ac_cv_c_const=no
fi
rm -f conftest*
fi

echo "$ac_t""$ac_cv_c_const" 1>&6
if test $ac_cv_c_const = no; then
  cat >> confdefs.h <<\EOF
#define const 
EOF

fi

echo $ac_n "checking for pid_t""... $ac_c" 1>&6
echo "configure:1136: checking for pid_t" >&5
if eval "test \"`echo '$''{'ac_cv_type_pid_t'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  cat > conftest.$ac_ext <
#if STDC_HEADERS
#include 
#include 
#endif
EOF
if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
  egrep "pid_t[^a-zA-Z_0-9]" >/dev/null 2>&1; then
  rm -rf conftest*
  ac_cv_type_pid_t=yes
else
  rm -rf conftest*
  ac_cv_type_pid_t=no
fi
rm -f conftest*

fi
echo "$ac_t""$ac_cv_type_pid_t" 1>&6
if test $ac_cv_type_pid_t = no; then
  cat >> confdefs.h <<\EOF
#define pid_t int
EOF

fi


echo $ac_n "checking return type of signal handlers""... $ac_c" 1>&6
echo "configure:1170: checking return type of signal handlers" >&5
if eval "test \"`echo '$''{'ac_cv_type_signal'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  cat > conftest.$ac_ext <
#include 
#ifdef signal
#undef signal
#endif
#ifdef __cplusplus
extern "C" void (*signal (int, void (*)(int)))(int);
#else
void (*signal ()) ();
#endif

int main() {
int i;
; return 0; }
EOF
if { (eval echo configure:1192: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then
  rm -rf conftest*
  ac_cv_type_signal=void
else
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -rf conftest*
  ac_cv_type_signal=int
fi
rm -f conftest*
fi

echo "$ac_t""$ac_cv_type_signal" 1>&6
cat >> confdefs.h <&6
echo "configure:1213: checking for $ac_func" >&5
if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then
  echo $ac_n "(cached) $ac_c" 1>&6
else
  cat > conftest.$ac_ext <
/* Override any gcc2 internal prototype to avoid an error.  */
/* We use char because int might match the return type of a gcc2
    builtin and then its argument prototype would still apply.  */
char $ac_func();

int main() {

/* The GNU C library defines this for functions which it implements
    to always fail with ENOSYS.  Some functions are actually named
    something starting with __ and the normal name is an alias.  */
#if defined (__stub_$ac_func) || defined (__stub___$ac_func)
choke me
#else
$ac_func();
#endif

; return 0; }
EOF
if { (eval echo configure:1241: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest; then
  rm -rf conftest*
  eval "ac_cv_func_$ac_func=yes"
else
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -rf conftest*
  eval "ac_cv_func_$ac_func=no"
fi
rm -f conftest*
fi

if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then
  echo "$ac_t""yes" 1>&6
    ac_tr_func=HAVE_`echo $ac_func | tr 'abcdefghijklmnopqrstuvwxyz' 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'`
  cat >> confdefs.h <&6
fi
done


echo $ac_n "checking for union semun""... $ac_c" 1>&6
echo "configure:1267: checking for union semun" >&5
cat > conftest.$ac_ext <
#include 
#include 
int main() {
union semun semun;
; return 0; }
EOF
if { (eval echo configure:1278: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest; then
  rm -rf conftest*
  cat >> confdefs.h <<\EOF
#define HAVE_UNION_SEMUN 1
EOF
 echo "$ac_t""yes" 1>&6
else
  echo "configure: failed program was:" >&5
  cat conftest.$ac_ext >&5
  rm -rf conftest*
  echo "$ac_t""no" 1>&6
fi
rm -f conftest*


trap '' 1 2 15
cat > confcache <<\EOF
# This file is a shell script that caches the results of configure
# tests run on this system so they can be shared between configure
# scripts and configure runs.  It is not useful on other systems.
# If it contains results you don't want to keep, you may remove or edit it.
#
# By default, configure uses ./config.cache as the cache file,
# creating it if it does not exist already.  You can give configure
# the --cache-file=FILE option to use a different cache file; that is
# what configure does when it calls configure scripts in
# subdirectories, so they share the cache.
# Giving --cache-file=/dev/null disables caching, for debugging configure.
# config.status only pays attention to the cache file if you give it the
# --recheck option to rerun configure.
#
EOF
# The following way of writing the cache mishandles newlines in values,
# but we know of no workaround that is simple, portable, and efficient.
# So, don't put newlines in cache variables' values.
# Ultrix sh set writes to stderr and can't be redirected directly,
# and sets the high bit in the cache file unless we assign to the vars.
(set) 2>&1 |
  case `(ac_space=' '; set) 2>&1` in
  *ac_space=\ *)
    # `set' does not quote correctly, so add quotes (double-quote substitution
    # turns \\\\ into \\, and sed turns \\ into \).
    sed -n \
      -e "s/'/'\\\\''/g" \
      -e "s/^\\([a-zA-Z0-9_]*_cv_[a-zA-Z0-9_]*\\)=\\(.*\\)/\\1=\${\\1='\\2'}/p"
    ;;
  *)
    # `set' quotes correctly as required by POSIX, so do not add quotes.
    sed -n -e 's/^\([a-zA-Z0-9_]*_cv_[a-zA-Z0-9_]*\)=\(.*\)/\1=${\1=\2}/p'
    ;;
  esac >> confcache
if cmp -s $cache_file confcache; then
  :
else
  if test -w $cache_file; then
    echo "updating cache $cache_file"
    cat confcache > $cache_file
  else
    echo "not updating unwritable cache $cache_file"
  fi
fi
rm -f confcache

trap 'rm -fr conftest* confdefs* core core.* *.core $ac_clean_files; exit 1' 1 2 15

test "x$prefix" = xNONE && prefix=$ac_default_prefix
# Let make expand exec_prefix.
test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'

# Any assignment to VPATH causes Sun make to only execute
# the first set of double-colon rules, so remove it if not needed.
# If there is a colon in the path, we need to keep it.
if test "x$srcdir" = x.; then
  ac_vpsub='/^[ 	]*VPATH[ 	]*=[^:]*$/d'
fi

trap 'rm -f $CONFIG_STATUS conftest*; exit 1' 1 2 15

# Transform confdefs.h into DEFS.
# Protect against shell expansion while executing Makefile rules.
# Protect against Makefile macro expansion.
cat > conftest.defs <<\EOF
s%#define \([A-Za-z_][A-Za-z0-9_]*\) *\(.*\)%-D\1=\2%g
s%[ 	`~#$^&*(){}\\|;'"<>?]%\\&%g
s%\[%\\&%g
s%\]%\\&%g
s%\$%$$%g
EOF
DEFS=`sed -f conftest.defs confdefs.h | tr '\012' ' '`
rm -f conftest.defs


# Without the "./", some shells look in PATH for config.status.
: ${CONFIG_STATUS=./config.status}

echo creating $CONFIG_STATUS
rm -f $CONFIG_STATUS
cat > $CONFIG_STATUS </dev/null | sed 1q`:
#
# $0 $ac_configure_args
#
# Compiler output produced by configure, useful for debugging
# configure, is in ./config.log if it exists.

ac_cs_usage="Usage: $CONFIG_STATUS [--recheck] [--version] [--help]"
for ac_option
do
  case "\$ac_option" in
  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
    echo "running \${CONFIG_SHELL-/bin/sh} $0 $ac_configure_args --no-create --no-recursion"
    exec \${CONFIG_SHELL-/bin/sh} $0 $ac_configure_args --no-create --no-recursion ;;
  -version | --version | --versio | --versi | --vers | --ver | --ve | --v)
    echo "$CONFIG_STATUS generated by autoconf version 2.12"
    exit 0 ;;
  -help | --help | --hel | --he | --h)
    echo "\$ac_cs_usage"; exit 0 ;;
  *) echo "\$ac_cs_usage"; exit 1 ;;
  esac
done

ac_given_srcdir=$srcdir

trap 'rm -fr `echo "Makefile" | sed "s/:[^ ]*//g"` conftest*; exit 1' 1 2 15
EOF
cat >> $CONFIG_STATUS < conftest.subs <<\\CEOF
$ac_vpsub
$extrasub
s%@CFLAGS@%$CFLAGS%g
s%@CPPFLAGS@%$CPPFLAGS%g
s%@CXXFLAGS@%$CXXFLAGS%g
s%@DEFS@%$DEFS%g
s%@LDFLAGS@%$LDFLAGS%g
s%@LIBS@%$LIBS%g
s%@exec_prefix@%$exec_prefix%g
s%@prefix@%$prefix%g
s%@program_transform_name@%$program_transform_name%g
s%@bindir@%$bindir%g
s%@sbindir@%$sbindir%g
s%@libexecdir@%$libexecdir%g
s%@datadir@%$datadir%g
s%@sysconfdir@%$sysconfdir%g
s%@sharedstatedir@%$sharedstatedir%g
s%@localstatedir@%$localstatedir%g
s%@libdir@%$libdir%g
s%@includedir@%$includedir%g
s%@oldincludedir@%$oldincludedir%g
s%@infodir@%$infodir%g
s%@mandir@%$mandir%g
s%@CC@%$CC%g
s%@CPP@%$CPP%g
s%@VERSION@%$VERSION%g
s%@MACHDEP@%$MACHDEP%g

CEOF
EOF

cat >> $CONFIG_STATUS <<\EOF

# Split the substitutions into bite-sized pieces for seds with
# small command number limits, like on Digital OSF/1 and HP-UX.
ac_max_sed_cmds=90 # Maximum number of lines to put in a sed script.
ac_file=1 # Number of current file.
ac_beg=1 # First line for current file.
ac_end=$ac_max_sed_cmds # Line after last line for current file.
ac_more_lines=:
ac_sed_cmds=""
while $ac_more_lines; do
  if test $ac_beg -gt 1; then
    sed "1,${ac_beg}d; ${ac_end}q" conftest.subs > conftest.s$ac_file
  else
    sed "${ac_end}q" conftest.subs > conftest.s$ac_file
  fi
  if test ! -s conftest.s$ac_file; then
    ac_more_lines=false
    rm -f conftest.s$ac_file
  else
    if test -z "$ac_sed_cmds"; then
      ac_sed_cmds="sed -f conftest.s$ac_file"
    else
      ac_sed_cmds="$ac_sed_cmds | sed -f conftest.s$ac_file"
    fi
    ac_file=`expr $ac_file + 1`
    ac_beg=$ac_end
    ac_end=`expr $ac_end + $ac_max_sed_cmds`
  fi
done
if test -z "$ac_sed_cmds"; then
  ac_sed_cmds=cat
fi
EOF

cat >> $CONFIG_STATUS <> $CONFIG_STATUS <<\EOF
for ac_file in .. $CONFIG_FILES; do if test "x$ac_file" != x..; then
  # Support "outfile[:infile[:infile...]]", defaulting infile="outfile.in".
  case "$ac_file" in
  *:*) ac_file_in=`echo "$ac_file"|sed 's%[^:]*:%%'`
       ac_file=`echo "$ac_file"|sed 's%:.*%%'` ;;
  *) ac_file_in="${ac_file}.in" ;;
  esac

  # Adjust a relative srcdir, top_srcdir, and INSTALL for subdirectories.

  # Remove last slash and all that follows it.  Not all systems have dirname.
  ac_dir=`echo $ac_file|sed 's%/[^/][^/]*$%%'`
  if test "$ac_dir" != "$ac_file" && test "$ac_dir" != .; then
    # The file is in a subdirectory.
    test ! -d "$ac_dir" && mkdir "$ac_dir"
    ac_dir_suffix="/`echo $ac_dir|sed 's%^\./%%'`"
    # A "../" for each directory in $ac_dir_suffix.
    ac_dots=`echo $ac_dir_suffix|sed 's%/[^/]*%../%g'`
  else
    ac_dir_suffix= ac_dots=
  fi

  case "$ac_given_srcdir" in
  .)  srcdir=.
      if test -z "$ac_dots"; then top_srcdir=.
      else top_srcdir=`echo $ac_dots|sed 's%/$%%'`; fi ;;
  /*) srcdir="$ac_given_srcdir$ac_dir_suffix"; top_srcdir="$ac_given_srcdir" ;;
  *) # Relative path.
    srcdir="$ac_dots$ac_given_srcdir$ac_dir_suffix"
    top_srcdir="$ac_dots$ac_given_srcdir" ;;
  esac


  echo creating "$ac_file"
  rm -f "$ac_file"
  configure_input="Generated automatically from `echo $ac_file_in|sed 's%.*/%%'` by configure."
  case "$ac_file" in
  *Makefile*) ac_comsub="1i\\
# $configure_input" ;;
  *) ac_comsub= ;;
  esac

  ac_file_inputs=`echo $ac_file_in|sed -e "s%^%$ac_given_srcdir/%" -e "s%:% $ac_given_srcdir/%g"`
  sed -e "$ac_comsub
s%@configure_input@%$configure_input%g
s%@srcdir@%$srcdir%g
s%@top_srcdir@%$top_srcdir%g
" $ac_file_inputs | (eval "$ac_sed_cmds") > $ac_file
fi; done
rm -f conftest.s*

EOF
cat >> $CONFIG_STATUS <> $CONFIG_STATUS <<\EOF

exit 0
EOF
chmod +x $CONFIG_STATUS
rm -fr confdefs* $ac_clean_files
test "$no_create" = yes || ${CONFIG_SHELL-/bin/sh} $CONFIG_STATUS || exit 1

Zope-2.0.1-ZEO-nonbin/pcgi/configure.in100755   1007   1403        3014  6751637455  17562 0ustar  petrillipetrillidnl Process this file with autoconf to produce a configure script.
AC_INIT(pcgi.h)
AC_PROG_CC
AC_PROG_CPP

# Set VERSION here so we only need to edit it in one place
AC_SUBST(VERSION)
VERSION=2.0a5

# Set name for machine-dependent library files
AC_SUBST(MACHDEP)
AC_MSG_CHECKING(MACHDEP)
if test -z "$MACHDEP"
then
	ac_sys_system=`uname -s`
	if test "$ac_sys_system" = "AIX" ; then
		ac_sys_release=`uname -v`
	else
		ac_sys_release=`uname -r`
	fi
	ac_md_system=`echo $ac_sys_system | tr -d '[/ ]' | tr '[[A-Z]]' '[[a-z]]'`
	ac_md_release=`echo $ac_sys_release | tr -d '[/ ]' | sed 's/\..*//'`
	MACHDEP="$ac_md_system$ac_md_release"

	case $MACHDEP in
	'')	MACHDEP="unknown";;
	esac
fi
AC_MSG_RESULT($MACHDEP)

dnl Checks for programs.

dnl Checks for libraries.

case $ac_sys_system in
hp*|HP*)
    case $CC in
    cc|*/cc) CC="$CC -Aa -D_HPUX_SOURCE";;
    esac;;
esac

if test "$ac_sys_system" != IRIX
then
AC_CHECK_LIB(nsl, inet_addr, [LIBS="-lnsl $LIBS"]) # SVR4
AC_CHECK_LIB(socket, socket, [LIBS="-lsocket $LIBS"], [], $LIBS) # SVR4 sockets
fi

dnl Checks for header files.
AC_HEADER_STDC
AC_HEADER_SYS_WAIT
AC_CHECK_HEADERS(unistd.h)

dnl Checks for typedefs, structures, and compiler characteristics.
AC_C_CONST
AC_TYPE_PID_T

dnl Checks for library functions.
AC_TYPE_SIGNAL
AC_CHECK_FUNCS(putenv socket strerror)

AC_MSG_CHECKING(for union semun)
AC_TRY_LINK([#include 
#include 
#include ],
[union semun semun;],
AC_DEFINE(HAVE_UNION_SEMUN) AC_MSG_RESULT(yes),AC_MSG_RESULT(no))

AC_OUTPUT(Makefile)
Zope-2.0.1-ZEO-nonbin/pcgi/install-sh100755   1007   1403        4212  6612715525  17242 0ustar  petrillipetrilli#!/bin/sh

#
# install - install a program, script, or datafile
# This comes from X11R5; it is not part of GNU.
#
# $XConsortium: install.sh,v 1.2 89/12/18 14:47:22 jim Exp $
#
# This script is compatible with the BSD install script, but was written
# from scratch.
#


# set DOITPROG to echo to test this script

# Don't use :- since 4.3BSD and earlier shells don't like it.
doit="${DOITPROG-}"


# put in absolute paths if you don't have them in your path; or use env. vars.

mvprog="${MVPROG-mv}"
cpprog="${CPPROG-cp}"
chmodprog="${CHMODPROG-chmod}"
chownprog="${CHOWNPROG-chown}"
chgrpprog="${CHGRPPROG-chgrp}"
stripprog="${STRIPPROG-strip}"
rmprog="${RMPROG-rm}"

instcmd="$mvprog"
chmodcmd=""
chowncmd=""
chgrpcmd=""
stripcmd=""
rmcmd="$rmprog -f"
mvcmd="$mvprog"
src=""
dst=""

while [ x"$1" != x ]; do
    case $1 in
	-c) instcmd="$cpprog"
	    shift
	    continue;;

	-m) chmodcmd="$chmodprog $2"
	    shift
	    shift
	    continue;;

	-o) chowncmd="$chownprog $2"
	    shift
	    shift
	    continue;;

	-g) chgrpcmd="$chgrpprog $2"
	    shift
	    shift
	    continue;;

	-s) stripcmd="$stripprog"
	    shift
	    continue;;

	*)  if [ x"$src" = x ]
	    then
		src=$1
	    else
		dst=$1
	    fi
	    shift
	    continue;;
    esac
done

if [ x"$src" = x ]
then
	echo "install:  no input file specified"
	exit 1
fi

if [ x"$dst" = x ]
then
	echo "install:  no destination specified"
	exit 1
fi


# If destination is a directory, append the input filename; if your system
# does not like double slashes in filenames, you may need to add some logic

if [ -d $dst ]
then
	dst="$dst"/`basename $src`
fi

# Make a temp file name in the proper directory.

dstdir=`dirname $dst`
dsttmp=$dstdir/#inst.$$#

# Move or copy the file name to the temp name

$doit $instcmd $src $dsttmp

# and set any options; do chmod last to preserve setuid bits

if [ x"$chowncmd" != x ]; then $doit $chowncmd $dsttmp; fi
if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dsttmp; fi
if [ x"$stripcmd" != x ]; then $doit $stripcmd $dsttmp; fi
if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dsttmp; fi

# Now rename the file to the real destination.

$doit $rmcmd $dst
$doit $mvcmd $dsttmp $dst


exit 0
Zope-2.0.1-ZEO-nonbin/pcgi/manifest100755   1007   1403         624  6612715525  16755 0ustar  petrillipetrilliExample/pcgitest
Example/pcgitime.py
Makefile.in
MrCreosote/README.MrCreosote
MrCreosote/creosote.c
MrCreosote/creosote.h
MrCreosote/creosote.py
README
Test/README.parseinfo
Util/README
Util/killpcgi.py
Util/pcgifile.py
Win32/Makefile.nt
Win32/README.NT
Win32/parseinfo.exe
Win32/pcgi-wrapper.exe
config.h.in
configure
configure.in
install-sh
manifest
parseinfo.c
pcgi_publisher.py
pcgi-wrapper.c
pcgi.h
Zope-2.0.1-ZEO-nonbin/pcgi/parseinfo.c100755   1007   1403       47014  6656613515  17426 0ustar  petrillipetrilli/* parseinfo.c - module to parse the pcgi info file

Copyright (c) 1998, Digital Creations, Fredericksburg, VA, USA.  All
rights reserved. This software includes contributions from Jeff Bauer.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:

  o Redistributions of source code must retain the above copyright
    notice, this list of conditions, and the disclaimer that follows.

  o 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.

  o All advertising materials mentioning features or use of this
    software must display the following acknowledgement:

      This product includes software developed by Digital Creations
      and its contributors.

  o Neither the name of Digital Creations 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.
*/

#include "pcgi.h"

extern char **environ;
extern int CloseFileDescriptors;

int pcgiAssignCloseFileDescriptors(pcgiResource *r, char *val)
{
    if ((CloseFileDescriptors = pcgiTruthValue(val[0]) < 0))
    {
        sprintf(r->errmsg, "unknown value for PCGI_CLOSE_FDS: %s", val);
        return(-1);
    }
    return(0);
}

int pcgiAssignPublisher(pcgiResource *r)
{
    /*
    // Determine the publisher path based on the current values
    // of the pcgiResource structure.
    */
    char *p, *pBegin, *pEnd, testdir[MAXSZ];
    char combinedPaths[MAXPATH+MAXPATH+2];

    if (r->pubpath[0]) /* assignment already made, our work is done :) */
    {
        return(0);
    }
    /*
    //  Look through the PCGI_INSERT_PATH directories for the publisher.
    */
    strcat(combinedPaths, r->insertPath);
    strcat(combinedPaths, ":");
    strcat(combinedPaths, r->pythonPath);

    pBegin = combinedPaths;
    pEnd = pBegin + strlen(combinedPaths);
    while(pBegin < pEnd)
    {
        p = pBegin;
        do {
            if (*p == ':' || *p == '\0')
                break;
        } while(*p++);
        strncpy(testdir, pBegin, p-pBegin);
        testdir[p-pBegin] = '\0';
        if ((pcgiAssignPublisherPath(testdir, r))==0)
        {
            return(0);
        }
        if (p == pBegin) 
        {
            pBegin++;
        }
        else
        {
            pBegin = p; 
        }
    }

    /*
    //  Run through a gauntlet of misc. attempts to find the publisher.
    */
    if (r->modpath[0])
    {
        if ((pcgiAssignPublisherPath(r->modpath, r)) == 0)
            return(0);
    }
    if (r->sw_info[0])
    {
        if ((pcgiAssignPublisherPath(r->sw_info, r)) == 0)
            return(0);
    }
    if (r->sw_home[0])
    {
        if ((pcgiAssignPublisherPath(r->sw_home, r)) == 0)
            return(0);
    }
    if (r->sw_exe[0])
    {
        if ((pcgiAssignPublisherPath(r->sw_exe, r)) == 0)
            return(0);
    }
    return(-1);
}

#define PubCount 4  /* variations on a publisher name */

int pcgiAssignPublisherPath(char *path, pcgiResource *r)
{
    /*
    // Attempt to assign the path to the publisher, return 0 for success,
    // otherwise -1.
     */
    char *p[PubCount];
    char testdir[MAXSZ], pubpath[MAXSZ];
    int i, len;
    struct stat statbuf;

    p[0] = PUBLISHER_NAME_1;
    p[1] = PUBLISHER_NAME_2;
    p[2] = PUBLISHER_NAME_3;
    p[3] = PUBLISHER_NAME_4;

    strcpy(testdir, path); 
    len = strlen(testdir);
    if (len < 1 || (MAXSZ <= len + strlen(PUBLISHER_NAME_1) + 1))
    {
        return(-1);
    }
    if (PATHSEP == testdir[len-1]) 
    { 
        testdir[len-1] = '\0'; /* truncate trailing slash */
    }

    if (stat(testdir, &statbuf) == -1)
    {
        return(-1); /* unable to stat path */
    }

    if (!(statbuf.st_mode & S_IFDIR))
    {
        /* 
        // If the supplied path was not a directory, assume it was
        // a file and get the directory portion of it.
        */
        while(len > 0)
        {
            if (PATHSEP == testdir[--len])
            {
               testdir[len] = '\0';
               break;
            }
        }
        if (len < 1) { return(-1); }
    }

    for (i=0; i < PubCount; i++)
    {
        sprintf(pubpath, "%s%c%s", testdir, PATHSEP, p[i]);
        if (stat(pubpath, &statbuf) != -1)
        {
            if (statbuf.st_mode & S_IREAD)
            {
                strcpy(r->pubpath, pubpath);
                return(0);
            } 
        }
    }
    return(-1);
}

int pcgiEnvironmentToResourceAssignment(pcgiResource *r)
{
    /*
    // Read in the environment and make whatever appropriate assignments
    // prior to reading in the pcgi info file.  Values from the pcgi info
    // override environment settings.
    //
    // This function is necessary because the user may want to set
    // an enviroment variable globally (e.g. PCGI_PUBLISHER from 
    // a httpd .conf file),
    */
    char **env;
    char *p = NULL;
    char buf[MAXSZ];
    char *nam, *val;

    for (env=environ; *env != 0; env++)
    {
        if (strlen(*env) >= MAXSZ)
        {
            continue;
        }
        strcpy(buf, *env);

        if ((p = strchr(buf,'=')) != NULL)
        {
            *p++ = '\0';
            nam = buf;
            val = p;
            if((strncmp(nam, "SOFTWARE_", strlen("SOFTWARE_")))==0)
            {
                if((strcmp(nam,"SOFTWARE_NAME"))==0)
                    strcpy(r->sw_name, val);
                else if((strcmp(nam,"SOFTWARE_HOME"))==0)
                    strcpy(r->sw_home, val);
                else if((strcmp(nam,"SOFTWARE_EXE"))==0)
                    strcpy(r->sw_exe, val);
            }
            if((strcmp(nam,"PYTHONPATH"))==0)
            {
                /* TODO: check strlen against MAXPATH */
                strcpy(r->pythonPath, val);
            }
            else if((strncmp(nam, "PCGI_", strlen("PCGI_")))==0)
            {
                if ((strcmp(nam,"PCGI_CLOSE_FDS"))==0)
                {
                    if ((pcgiAssignCloseFileDescriptors(r, val)) < 0)
                        return(-1);
                }
                else if ((strcmp(nam,"PCGI_DISPLAY_ERRORS"))==0)
                      r->displayErrors = pcgiTruthValue(val[0]);
                else if ((strcmp(nam,"PCGI_ERROR_LOG"))==0)
                    strcpy(r->errlog, val);
                else if ((strcmp(nam,"PCGI_EXE"))==0)
                    strcpy(r->sw_exe, val);
                else if ((strcmp(nam,"PCGI_HOST"))==0)
                    strcpy(r->sockhost, val);
                else if ((strcmp(nam,"PCGI_INSERT_PATH"))==0 ||
                         (strcmp(nam,"PCGI_WORKING_DIR"))==0)
                {
                    if (strlen(val) >= MAXPATH)
                    {
                        strcpy(r->errmsg, "pcgiEnvironmentToResourceAssignment() length exceeds MAXPATH");
                        return(-1);
                    }
                    strcpy(r->insertPath, val);
                }
                else if ((strcmp(nam,"PCGI_MODULE_PATH"))==0)
                    strcpy(r->modpath, val);
                else if ((strcmp(nam,"PCGI_NAME"))==0)
                    strcpy(r->sw_name, val);
                else if ((strcmp(nam,"PCGI_PID_FILE"))==0)
                    strcpy(r->procpath, val);
                else if ((strcmp(nam,"PCGI_PORT"))==0)
                    r->sockport = atoi(val);
                else if ((strcmp(nam,"PCGI_PUBLISHER"))==0)
                    strcpy(r->pubpath, val);
                else if ((strcmp(nam,"PCGI_SOCKET_FILE"))==0)
                    strcpy(r->sockpath, val);
            }
        }
    }

    return(0);
}

/*
// pcgiParseInfo: Parse info file named in resource->sw_info
*/
int pcgiParseInfo(pcgiResource *r)
{   
    FILE *f;
    char buf[256];
    char *v=NULL;
    char *p=NULL;
    struct stat statbuf;
    int _newStyleDirectives = 0;
    int _oldStyleLineCount = 0;
    enum { oldStyleSocketFile, oldStyleProcessIdFile, oldStyleWorkDir, oldStyleModPath };

    if ((pcgiEnvironmentToResourceAssignment(r)) < 0)
    {
        if (!r->errmsg[0])
            strcpy(r->errmsg, "pcgiEnvironmentToResourceAssignment() error");
        return(-1);
    }

    if((f=fopen(r->sw_info, "r")) == NULL)
    {
        sprintf(r->errmsg, "unable to open info file: %s", r->sw_info);
        return(-1);
    }

    pcgiPutNameValueInEnvironment("PCGI_INFO_FILE", r->sw_info);

    while(fgets(buf, 255, f) != NULL)
    {   
      /* XXX - TODO: trim leading, trailing whitespace */

#ifdef WIN32
        amendPathSeparators(buf);
#endif
        if((buf[0] != '#') && (buf[0] != '\n'))
        {   
            p=(strrchr(buf,'\0')-sizeof(char));
            while((p >= buf) && (isspace(*p)))
            {  
                *p=0;
                p--;
            }

            if ((p=strchr(buf,'=')) != NULL)
            {
                _newStyleDirectives = 1;
                if ((pcgiPutEnvironment(buf) < 0))
                {
                    strcpy(r->errmsg, "pcgiPutEnvironment() failed");
                    fclose(f);
                    return(-1);
                }

                *p=0;
                p++;

                if((strcmp(buf,"SOFTWARE_NAME"))==0)
                {  
                    strcpy(r->sw_name, p);
                }
                else if((strcmp(buf,"SOFTWARE_HOME"))==0)
                {  
                    strcpy(r->sw_home, p);
                }
                else if((strcmp(buf,"SOFTWARE_EXE"))==0)
                {  
                    strcpy(r->sw_exe, p);
                }
                else if((strcmp(buf,"PCGI_CLOSE_FDS"))==0)
                {
                    if ((pcgiAssignCloseFileDescriptors(r, p)) < 0)
                        return(-1);
                }
                else if ((strcmp(buf,"PCGI_DISPLAY_ERRORS"))==0)
                    r->displayErrors = pcgiTruthValue(p[0]);
                else if((strcmp(buf,"PCGI_ERROR_LOG"))==0)
                {  
                    strcpy(r->errlog, p);
                }
                else if((strcmp(buf,"PCGI_EXE"))==0)
                {  
                    strcpy(r->sw_exe, p);
                }
                else if((strcmp(buf,"PCGI_HOST"))==0)
                {  
                    strcpy(r->sockhost, p);
                }
                else if((strcmp(buf,"PCGI_INSERT_PATH"))==0)
                {  
                    strcpy(r->insertPath, p);
                }
                else if((strcmp(buf,"PCGI_MODULE_PATH"))==0)
                {  
                    strcpy(r->modpath, p);
                }
                else if((strcmp(buf,"PCGI_NAME"))==0)
                {  
                    strcpy(r->sw_name, p);
                }
                else if((strcmp(buf,"PCGI_PID_FILE"))==0)
                {  
                    strcpy(r->procpath, p);
                }
                else if((strcmp(buf,"PCGI_PORT"))==0)
                {
                    r->sockport = atoi(p);
                }
                else if((strcmp(buf,"PCGI_PUBLISHER"))==0)
                {  
                    strcpy(r->pubpath, p);
                }
                else if((strcmp(buf,"PCGI_SOCKET_FILE"))==0)
                {  
                    strcpy(r->sockpath, p);
                }
                else if((strcmp(buf,"PCGI_WORKING_DIR"))==0)
                {  
                    strcpy(r->insertPath, p);
                }
                else if((strcmp(buf,"PYTHONPATH"))==0)
                {  
                    strcpy(r->pythonPath, p);
                }

            }
            else /* old-style (deprecated) directives */
            {
                /* assume old style where the first four lines correspond to */
                /* 1. path of the socket file */
                /* 2. path of the process id file */
                /* 3. working directory (to be added to path by publisher) */
                /* 4. path of the module to be published */
                if (_newStyleDirectives)
                {
                    strcpy(r->errmsg, "pcgi info file mixes old and new style directives (new style uses name=value)");
                    fclose(f);
                    return(-1);
                }
                if (oldStyleSocketFile == _oldStyleLineCount)
                {
                    strcpy(r->sockpath, buf);
                    pcgiPutNameValueInEnvironment("PCGI_SOCKET_FILE", buf);
                }
                else if (oldStyleProcessIdFile == _oldStyleLineCount)
                {
                    strcpy(r->procpath, buf);
                    pcgiPutNameValueInEnvironment("PCGI_PID_FILE", buf);
                }
                else if (oldStyleWorkDir == _oldStyleLineCount)
                {
                    strcpy(r->insertPath, buf);
                    if ((pcgiPutNameValueInEnvironment("PCGI_INSERT_PATH", buf)) < 0)
                    {
                        strcpy(r->errmsg, "pcgiPutNameValueInEnvironment() error");
                        fclose(f);
                        return(-1);
                    }
                }
                else if (oldStyleModPath == _oldStyleLineCount)
                {
                    strcpy(r->modpath, buf);
                    if ((pcgiPutNameValueInEnvironment("PCGI_MODULE_PATH", buf)) < 0)
                    {
                        strcpy(r->errmsg, "pcgiPutNameValueInEnvironment() error");
                        fclose(f);
                        return(-1);
                    }
                }
                else
                {
                    strcpy(r->errmsg, "oldStyleLineCount exceeds maximum");
                    fclose(f);
                    return(-1);
                }
                _oldStyleLineCount++;
            }     
        }
    }
    fclose(f);

    /* 
    //  Post-parsing work: decide if we have enough info to make it work. 
    */

    /*
    //  If the location of the publisher was not specified, try to
    //  locate it.
    */
    if (!r->pubpath[0])
    {
        pcgiAssignPublisher(r);
    }

    if (!r->pubpath[0])
    {
        strcpy(r->errmsg, "unable to determine the publisher location");
        return(-1);
    }
    else
    {
        if (stat(r->pubpath, &statbuf) == -1)
        {
            sprintf(r->errmsg, "missing publisher: %s", r->pubpath);
            return(-1);
        }
        else
        {
            if (!(statbuf.st_mode & S_IREAD))
            {
                sprintf(r->errmsg, "publisher read error: %s", r->pubpath);
                return(-1);
            }
        }
    }

    /*
    //  Assign defaults, where necessary, for backward compatibility.
    */
    if (r->sw_name[0] && r->sw_home[0])
    {
        if (!r->sw_exe[0])
        {
            strcpy(r->sw_exe,"/usr/local/bin/python1.4");
            pcgiPutNameValueInEnvironment("SOFTWARE_EXE", r->sw_exe);
        }
        if (!r->procpath[0])
        {
            sprintf(r->procpath,"%s/var/%s.pid", r->sw_home,r->sw_name);
            pcgiPutNameValueInEnvironment("PCGI_PID_FILE", r->procpath);
        }
        if (!r->sockpath[0])
        {
            sprintf(r->sockpath,"%s/var/%s.soc", r->sw_home,r->sw_name);
            pcgiPutNameValueInEnvironment("PCGI_SOCKET_FILE", r->sockpath);
        }
    }

    /*
    // Other than r->pubpath, the other required attributes to complete
    // the process are: r->procpath & r->sockpath.
    */
    if (!r->sockpath[0])
    {
        strcpy(r->errmsg, "missing parameter: PCGI_SOCKET_FILE");
        return(-1);
    }
    if (!r->procpath[0])
    {
        strcpy(r->errmsg, "missing parameter: PCGI_PID_FILE");
        return(-1);
    }

/* Add this at a later date:  jhb - 8/10/98 */
/*
    if (r->sockport && !r->sockhost[0])
    {
        strcpy(r->errmsg, "unable to determine hostname, recommend specifying: PCGI_HOST");
        return(-1);
    }
*/
    return(0);
}

int pcgiPutEnvironment(char *buf)
{
    /*
    // Stick a copy of the name=value pair in the
    // process environment. Note that this would
    // leak and need to be changed for any pcgi
    // implementations that work as web server api
    // extensions...
    */
    char *v = NULL;
    if((v=malloc(strlen(buf) + sizeof(char))) == NULL)
    {   
        return(-1);
    }
    strcpy(v, buf);
    if(putenv(v))
    {   
        return(-1);
    }
    return(0);
}

int pcgiPutNameValueInEnvironment(char *name, char *value)
{
    /* 
    //  Slight modification to pcgiPutEnvironment(), convenience function.
    */
    char *v = NULL;
    if ((v=malloc(strlen(name) + strlen(value) + (2 * sizeof(char)))) == NULL)
        return(-1);
    sprintf(v, "%s=%s", name, value);

    if(putenv(v))
        return(-1);
    return(0);
}

int pcgiTruthValue(char v)
{
    if (v=='1' || v=='t' || v=='T' || v=='y' || v=='Y') 
        return 1; 
    else if (v=='0' || v=='f' || v=='F' || v=='n' || v=='N') 
        return 0;
    else
        return -1;
}

#ifdef WIN32
/*
    This function lets both Unix & Win32 info files
    to use the same '/' character as a path separator.
    However it does this by assuming that we always
    want '\' backslashes as path separators in a
    Win32 environment.
*/
void amendPathSeparators(char *src)
{
    char ch, *ptr;
    ptr = src;
    while ((ch = *src++))
    {
        if (ch == PATHSEP_UNIX) { *ptr = PATHSEP_WIN32; }
        *ptr++;
    }
}
#endif

#ifdef MAIN_PARSEINFO
int main(int argc, char *argv[])
{
    /* char **env; */
    pcgiResource resource;
    pcgiResource *r = &resource;

    if (argc < 2)
    {
        printf("usage: parseinfo \n");
        return(-1);
    }

#ifdef CLOSE_FDS
    CloseFileDescriptors = 1;
#endif

    /* initialize pcgiResource */
    memset(r,0,sizeof(pcgiResource));
    r->conn=-1;

    strcpy(r->sw_info, argv[1]);
    if ((pcgiParseInfo(r)) < 0)
    {
        printf("error parsing info file: %s\n", r->sw_info);
        printf("  %s\n", r->errmsg);
        return(-1);
    }

    printf("pcgi resource attributes:\n");
    printf("  %-20s %s\n", "r->sw_info", r->sw_info);
    printf("  %-20s %s\n", "r->sw_name", r->sw_name);
    printf("  %-20s %s\n", "r->sw_home", r->sw_home);
    printf("  %-20s %s\n", "r->sw_exe", r->sw_exe);
    printf("  %-20s %s\n", "r->procpath", r->procpath);
    printf("  %-20s %s\n", "r->sockpath", r->sockpath);
    printf("  %-20s %s\n", "r->modpath", r->modpath);
    printf("  %-20s %s\n", "r->pubpath", r->pubpath);
    printf("  %-20s %d\n", "r->procid", r->procid);
    printf("  %-20s %s\n", "r->insertPath", r->insertPath);
    printf("  %-20s %s\n", "r->pythonPath", r->pythonPath);
    printf("  %-20s %d\n", "r->sockport", r->sockport);
    printf("  %-20s %s\n", "r->sockhost", r->sockhost);
    printf("  %-20s %d\n", "r->displayErrors", r->displayErrors);
    printf("  %-20s %d\n", "CloseFileDescriptors", CloseFileDescriptors);
    /* printf("\nenvironment:\n");         */
    /* for (env=environ; *env != 0; env++) */
    /*     printf("  %s\n", *env);         */
}
#endif
Zope-2.0.1-ZEO-nonbin/pcgi/pcgi-wrapper.c100755   1007   1403       55663  6631611767  20051 0ustar  petrillipetrilli/* pcgi-wrapper.c - Persistent CGI wrapper module

Copyright (c) 1998, Digital Creations, Fredericksburg, VA, USA.  All
rights reserved. This software includes contributions from Jeff Bauer.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:

  o Redistributions of source code must retain the above copyright
    notice, this list of conditions, and the disclaimer that follows.

  o 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.

  o All advertising materials mentioning features or use of this
    software must display the following acknowledgement:

      This product includes software developed by Digital Creations
      and its contributors.

  o Neither the name of Digital Creations 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.

|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
  - 2.0a5  29 October 1998
    - (brian) fixed arg type mismatch for semctl

  - 2.0a4  10 August 1998
    - (jeff) fixed Win32 local socket host address issues

  - 2.0a4  8 August 1998
    - (jeff) added Win32 support
*/
#include "pcgi.h"

#ifdef CREOSOTE
#include "creosote.h"  /* used for debugging */
char spewbuf[1024];    /* yes, it's a global, but only for debugging */
#endif

static char _id_[]="$Id: pcgi-wrapper.c,v 1.5 1998/12/03 22:43:03 brian Exp $";

/* Globals, OR: "I'll know I'll hate myself in the morning" */
extern char **environ;
int CloseFileDescriptors = 0;

#if UNIX
int g_lock = 0;
#endif

#if PCGI_WRAPPER_MAIN
int main(int argc, char *argv[])
{   pcgiResource resource;
    pcgiResource *r=&resource;
    long l       =0;
    char t[10]   ={0};
    char *estatus=NULL;
    char *emsg   =NULL;
    char *p      =NULL;
    char **env;

#ifdef CREOSOTE
    initializeMrCreosote();
    /* spew("pcgi-wrapper main()"); */
#endif

#ifdef CLOSE_FDS
    CloseFileDescriptors = 1;
#endif


    /*
    // Initialize resource info
    */
    memset(r,0,sizeof(pcgiResource));
    r->conn=-1;

    if (argc < 2) 
    {
        onError(E_500, "No pcgi info file given!", r);
    }

    strcpy(r->sw_info, argv[1]);
    if ((pcgiParseInfo(r)) < 0)
    {
        onError(E_500, "Error parsing pcgi info file", r);
    }

    /*
    // Copy environment to resource
    */
    for(env=environ; *env != 0; env++)
    {
        r->sz_env+=(strlen(*env)+sizeof(char));
    }
    if((r->p_env=malloc(((sizeof(char) * r->sz_env)+(sizeof(char)*HDRLEN))))==NULL)
    {
        onError(E_500, "Error allocating env", r);
    }
    p=r->p_env;
    sprintf(p, HDRFMT, r->sz_env);

    if (p[0] != '0')
    {
        if (!r->errmsg[0])
            strcpy(r->errmsg, ERR123_BAD_ENV_HEADER);
        onError(E_500, "Error allocating env", r);
    }

    p+=HDRLEN;
    for(env=environ; *env != 0; env++)
    {   l=strlen(*env);
        memcpy(p, *env, l);
        p+=l;
        *p=0;
        p++;
    }

    /*
    // Copy stdin to resource
    */
    p=getenv("CONTENT_LENGTH");
    if((p != NULL) && ((r->sz_input=atol(p)) > 0))
    {  
        if((r->p_input=malloc(((sizeof(char) * r->sz_input)+
                               (sizeof(char)*HDRLEN))))==NULL)
        {
            onError(E_500, "Error allocating stdin", r);
        }
        p=r->p_input;
        sprintf(p, HDRFMT, r->sz_input);

        if (p[0] != '0')
        {
            if (!r->errmsg[0])
                strcpy(r->errmsg, ERR124_BAD_STDIN_HEADER);
            onError(E_500, "Error allocating stdin", r);
        }

        p+=HDRLEN;
        if(pcgiRead(STDIN_FILENO, p, r->sz_input) != r->sz_input)
        {
            onError(E_500, "Error reading stdin", r);
        }
    }
    else
    {   
        if((r->p_input=malloc(sizeof(char)*HDRLEN))==NULL)
        {
            onError(E_500, "Error allocating stdin", r);
        }
        sprintf(r->p_input, HDRFMT, 0);
    }

    /*
    // Attempt to connect
    */
    if ((r->conn = pcgiConnect(r)) < 0)
    {   
        if(pcgiVerifyProc(r) < 0)
        {   
            if(pcgiStartProc(r) < 0) 
            {
                if (!r->errmsg[0])
                    strcpy(r->errmsg, ERR101_FAILURE_DURING_START); 
                onError(E_500, "Failed to start resource", r);
            }
            if ((r->conn=pcgiConnect(r)) < 0)
            {
                if (!r->errmsg[0])
                    strcpy(r->errmsg, ERR102_FAILURE_DURING_CONNECT); 
                onError(E_503, strerror(errno), r);
            }
        }
        else
        {   
            if (!r->errmsg[0])
                strcpy(r->errmsg, ERR103_UNABLE_VERIFY_RUNNING);
            onError(E_503, "pcgiVerifyProc failed", r);
        }
    } 

    /*
    // Send environment and stdin
    */
#ifdef WIN32
    if (pcgiWriteSocket(r->conn,r->p_env,(r->sz_env+HDRLEN)) != (r->sz_env+HDRLEN))
#endif
#ifdef UNIX
    if (pcgiWrite(r->conn,r->p_env,(r->sz_env+HDRLEN)) != (r->sz_env+HDRLEN))
#endif
    {
        if (!r->errmsg[0])
            strcpy(r->errmsg, ERR104_ENVIRONMENT_SEND);
        onError(E_500, "Error sending env", r);
    }

#ifdef WIN32
    if (pcgiWriteSocket(r->conn,r->p_input,(r->sz_input+HDRLEN)) != (r->sz_input+HDRLEN))
#endif
#ifdef UNIX
    if (pcgiWrite(r->conn,r->p_input,(r->sz_input+HDRLEN)) != (r->sz_input+HDRLEN))
#endif

    {
        if (!r->errmsg[0])
            strcpy(r->errmsg, ERR105_STDIN_SEND);
        onError(E_500, "Error sending stdin", r);
    }

#ifdef WIN32
shutdown(r->conn, 1); /* shutdown the socket so we can receive */
#endif

    /*
    // Receive stdout and stderr
    */
    t[0]='\0';
#ifdef WIN32
    if (!pcgiReadSocket(r->conn, t, HDRLEN))
#endif
#ifdef UNIX
    if (!pcgiRead(r->conn, t, HDRLEN))
#endif
    {
        if (!r->errmsg[0])
            strcpy(r->errmsg, ERR106_STDOUT_READ_HEADER);
        onError(E_503, strerror(errno), r);
    }

    if (strlen(t) <= 0)
    {
        if (!r->errmsg[0])
            sprintf(r->errmsg, "%s (%d)", ERR107_BAD_STDOUT_STRLEN, strlen(t));
       onError(E_503, strerror(errno), r);
    }

    if (t[0] != '0')
    {
      /* XXX - Later: process this as out-of-bound stdin data */
        sprintf(r->errmsg, "t[0] = %d", (int) t[0]);
        onError(E_500, "unexpected out-of-bound data in stdin", r);
    }
    else
    {
        r->sz_output=atol(t);
        l=(sizeof(char) * r->sz_output) + sizeof(char);
        r->p_output=(char *)malloc(l);
        memset(r->p_output,0,l);
#ifdef WIN32
        if (pcgiReadSocket(r->conn,r->p_output,r->sz_output) != r->sz_output)
#endif
#ifdef UNIX
        if (pcgiRead(r->conn,r->p_output,r->sz_output) != r->sz_output)
#endif
        {
            if (!r->errmsg[0])
                strcpy(r->errmsg, ERR108_STDOUT_READ_BODY);
            onError(E_500, "Error receiving stdout", r);
        }
    }

    t[0]='\0';
#ifdef WIN32
    if (!pcgiReadSocket(r->conn, t, HDRLEN))
#endif
#ifdef UNIX
    if (!pcgiRead(r->conn, t, HDRLEN))
#endif
    {
        if (!r->errmsg[0])
            strcpy(r->errmsg, ERR109_STDERR_READ_HEADER);
        onError(E_500, "Error receiving stderr size", r);
    }
    if (strlen(t) <= 0)
    {
        if (!r->errmsg[0])
            sprintf(r->errmsg, "%s (%d)", ERR110_BAD_STDERR_STRLEN, strlen(t));
        onError(E_500, "Error receiving stderr size", r);
    }

    if (t[0] != '0')
    {
      /* XXX - Later: process this as out-of-bound stderr data */
        sprintf(r->errmsg, "t[0] = %d", (int) t[0]);
        onError(E_500, "unexpected out-of-bound data in stderr", r);
    }
    else
    {
        r->sz_error=atol(t);
        if (r->sz_error > 0)
        {   
            l=(sizeof(char) * r->sz_error) + sizeof(char);
            r->p_error=(char *)malloc(l);
            memset(r->p_error,0,l);
#ifdef WIN32
            if (pcgiReadSocket(r->conn, r->p_error, r->sz_error) != r->sz_error)
#endif
#ifdef UNIX
            if (pcgiRead(r->conn, r->p_error, r->sz_error) != r->sz_error)
#endif
            {
                if (!r->errmsg[0])
                    strcpy(r->errmsg, ERR111_STDERR_READ_BODY);
                onError(E_500, "Error receiving stderr", r);
            }
        }
    }
#ifdef UNIX
    close(r->conn);
#endif
#ifdef WIN32
    closesocket(r->conn);
#endif

    /*
    // Return stdout and stderr to server
    */
    if (r->sz_output != 0)
    {
        if (pcgiWrite(STDOUT_FILENO,r->p_output,r->sz_output) != r->sz_output)
        {
            if (!r->errmsg[0])
                strcpy(r->errmsg, "(112) Error returning stdout to server"); 
            onError(E_500, ERR112_STDOUT_TO_SERVER, r);
        }
        free(r->p_output);
        r->p_output=NULL;
    }

    if (r->sz_error != 0)
    {   
        if (pcgiWrite(STDERR_FILENO,r->p_error,r->sz_error) != r->sz_error)
        {
            if (!r->errmsg[0])
                strcpy(r->errmsg, ERR113_STDOUT_TO_SERVER);
            onError(E_500, "Error returning stderr", r);
        }
        free(r->p_error);
        r->p_error=NULL;
    }

    /*
    // Free env & input buffers, release lock if needed
    */
    free(r->p_env);
    r->p_env=NULL;
    free(r->p_input);
    r->p_input=NULL;
    cleanup();
    fflush(stdout);
    fflush(stderr);
    /*exit(0);*/
    return 0;
}
#endif /* end of main(): PCGI_WRAPPER_MAIN */

/*
// onError: fatal pcgi error
 */
void onError(char *estatus, char *emsg, pcgiResource *r)
{
    FILE *f;
    time_t now;
#ifdef VERSION
    /* If VERSION isn't defined as a string, everything will blow up here
       during compilation. */
    char *pcgi_version="pcgi-wrapper-version " VERSION;
#else
    char *pcgi_version = "";
#endif
    char *displayError = "";

    if (r != NULL)
    {
#ifdef UNIX
        if(r->conn != -1)    close(r->conn);
        cleanup();
#endif
#ifdef WIN32
        if (r->conn)
        {
            shutdown(r->conn, 1);
            closesocket(r->conn);
            WSACleanup();
        }
#endif
        if (r->errlog[0])
        {   
            if((f=fopen(r->errlog, "ab")) != NULL)
            {
                now = time(NULL); 
                fprintf(f, "%s  pcgi-wrapper: %s  %s\n", 
                        ctime(&now), emsg, r->errmsg);
                fclose(f);
            }
        }

        if(r->p_env!=NULL)   free(r->p_env);
        if(r->p_input!=NULL) free(r->p_input);
    }
    if (r->displayErrors)
      displayError = r->errmsg;
    printf(errorHtml, estatus, displayError, emsg, pcgi_version);
    fflush(stdout);
    fflush(stderr);

    exit(0);
}

/*
// pcgiWrite: write n bytes to a an fd
*/
long pcgiWrite(pcgi_socket fd, const char *ptr, long nbytes)
{   
    long done    = 0;
    long notdone = nbytes;
    const char *cptr = (const char *)ptr;

    while (notdone > 0)
    {   
        done = write(fd, cptr, notdone);
        if (done <= 0) 
        {
            return (done);
        }
        notdone -= done;
        cptr += done;
    }
    return ((nbytes - notdone));
}

#ifdef WIN32
long pcgiWriteSocket(pcgi_socket fd, const char *ptr, long nbytes)
{
    /* The successful completion of a send does not indicate */
    /* that the data was successfully delivered.  */
    int count;
    int req;
    long bytesSent = 0;

/* begin superKludge(tm) - only for testing, do not leave in place XXX */
/*     if (STDOUT_FILENO == (int)fd) */
/*     { */
/*         printf("%s", ptr); */
/*         return 0; */
/*     } */
/* end superKludge(tm) - only for testing, do not leave in place XXX */

    while ( bytesSent < nbytes )
    {
        req = nbytes - bytesSent;
        count = send(fd, ptr + bytesSent, req, 0);
        if (SOCKET_ERROR == count)
        {
            return(-1);
        }
        bytesSent += (long) count;
    }

    return(bytesSent);
}
#endif

/*
// pcgiRead: read n bytes from an fd
*/
long pcgiRead(pcgi_socket fd, char *ptr, long n)
{   
    long done    = 0;
    long notdone = n;
    char *cptr   = ptr;

    while (notdone > 0)
    {   
        done = read(fd, cptr, notdone);
        if (done < 0)       
            return (done);   /* ERROR */
        else if (done == 0) 
            break;           /*  EOF  */
        notdone -= done;
        cptr += done;
    }
    return ((n - notdone));
}

#ifdef WIN32
long pcgiReadSocket(pcgi_socket fd, char *ptr, long nbytes)
{
    int count;
    int req;
    long bytesRecv = 0;

    while ( bytesRecv < nbytes )
    {
        req = nbytes - bytesRecv;
        count = recv(fd, ptr + bytesRecv, req, 0);
        if (SOCKET_ERROR == count)
        {
            /* TODO: add error reporting by calling WSAGetLastError */
            return(-1);
        }
        bytesRecv += (long) count;
    }
    return(bytesRecv);
}
#endif

/*
// pcgiVerifyProc: check to see if a resource is running
*/
int pcgiVerifyProc(pcgiResource *r)
{   FILE *f;
    char p[10];

    memset(p,0,10);
    if (r->procid == 0)
    {   if((f=fopen(r->procpath, "r")) == NULL)
            return(-1);
        if(fgets(p, HDRLEN, f) == NULL)
            return(-1);
        fclose(f);
        if(!(strlen(p) > 0))
            return(-1);
        r->procid=atoi(p);
    }
#ifdef UNIX
   return(kill(r->procid, 13));
#endif
#ifdef WIN32
    if ((NULL == OpenProcess(PROCESS_VM_READ, FALSE, r->procid)))
    {
        return(-1);
    }
    return(0);
#endif
}

/*
// pcgiConnect: return fd of a connected socket
*/
#ifdef UNIX
pcgi_socket pcgiConnect(pcgiResource *r)
{   
    struct sockaddr_un s;
    pcgi_socket fd;
    int addrlen=0;
    int connected=-1;
    int attempted=0;
    int retry=10;
    int delay=1;

    memset((char *) &s, 0, sizeof(s));
    s.sun_family=AF_UNIX;
    strcpy(s.sun_path, r->sockpath);

    addrlen = sizeof(struct sockaddr_un);  /* force to use sizeof(s) */

    if ((fd = socket(AF_UNIX, SOCK_STREAM, 0)) < 0)
    {
        if (!r->errmsg[0])
            strcpy(r->errmsg, ERR114_UNABLE_TO_OPEN_SOCKET);
        return (-1);
    }
    while ((connected < 0) && (attempted <= retry))
    {   
        if ((connected=connect(fd, (struct sockaddr *) &s, addrlen)) < 0)
        {   
            if((errno!=ECONNREFUSED) && (errno!=ENOENT))
            {   
                if (!r->errmsg[0])
                    strcpy(r->errmsg, ERR115_CONNECTION_REFUSED);
                return(-1);
            }
            sleep(delay);
            attempted++;
        }
    }
    if (!(connected < 0)) 
    {
        if (!r->errmsg[0])
            sprintf(r->errmsg, "%s, fd=%d", ERR116_UNABLE_TO_CONNECT, fd);
        return (fd);
    }
    return (connected);
}
#endif  /* UNIX pcgiConnect */


#ifdef WIN32
pcgi_socket pcgiConnect(pcgiResource *r)
{
    pcgi_socket destSocket;
    SOCKADDR_IN destSockAddr;
    unsigned long destAddr;
    int connected = SOCKET_ERROR;
    int attempted = 0;
    int status;
    WSADATA WsaData;

    char hostName[MAXSZ];
    LPHOSTENT hostEnt;
    SOCKADDR_IN hostAddr;

    /* initialize the Windows Socket DLL */
    /* TODO: move this startup code outside of pcgiConnect */
    if (0 != WSAStartup(MAKEWORD(2, 0), &WsaData))
    {
        return(-1);
    }

    /* destAddr = inet_addr("192.168.2.43"); */
    hostAddr.sin_addr.s_addr = INADDR_ANY;  /* init local address */

    /*  Bug: assumes r->sockhost is the host name, we should also
        check to see if it is the xxx.xxx.xxx.xxx octet string and
        act accordingly */

    if (r->sockhost[0])
        strcpy(hostName, r->sockhost);
    else if (SOCKET_ERROR == gethostname(hostName, MAXSZ))
        return(-1);
    hostEnt = gethostbyname((LPSTR) hostName);
    if (hostEnt)
    {
        /* resolve hostname for local address */
        hostAddr.sin_addr.s_addr = *((u_long FAR*) (hostEnt->h_addr));
    }
    if (INADDR_ANY == hostAddr.sin_addr.s_addr)
    {
        return(-1);
    }
    destAddr = hostAddr.sin_addr.s_addr;

    memcpy(&destSockAddr.sin_addr, &destAddr, sizeof(destAddr));
    destSockAddr.sin_port = htons((short)r->sockport);
    destSockAddr.sin_family = AF_INET;

    /* create socket */
    destSocket = socket(AF_INET, SOCK_STREAM, 0);
    if (INVALID_SOCKET == destSocket)
    {
        return(-1);
    }

    /* Connect */
    /*     The code below blithely duplicates the Unix version. */
    /*     TODO:  add better recovery/error handling. */

    while ((SOCKET_ERROR == connected) && (attempted <= CONNRETRY))
    {
        connected = connect(destSocket, (LPSOCKADDR) &destSockAddr, sizeof(destSockAddr));

        if (SOCKET_ERROR == connected)
        {
            status = WSAGetLastError();
            if ((status != WSAECONNREFUSED) && (status != ENOENT))
            {
                return(-1);
            }
            sleep(CONNDELAY);
            attempted++;
        }
    }
    if (SOCKET_ERROR == connected)
    {
        closesocket(destSocket);
        WSACleanup();
        return(-1);
    }

    return(destSocket);
}
#endif  /* Win32 pcgiConnect */


#ifdef UNIX
static sig_atomic_t sigflag;
static sigset_t nmask, omask, zmask;
#endif

#ifdef UNIX
void pcgiSIG(int s)
{   
    sigflag=1; 
    return;
}
#endif

void cleanup()
{   
#ifdef UNIX
    UNION_SEMUN arg;
    arg.val=0;
    if (g_lock > 0) 
    {
        semctl(g_lock, 1, IPC_RMID, arg);
    }
#endif
}

/*
// pcgiStartProc: manages starting a pcgi resource.
*/
#ifdef UNIX
int pcgiStartProc(pcgiResource *r)
{   
    pid_t pid;
    char  *p = NULL;
    int   i = 0;
    UNION_SEMUN arg;
    arg.val=0;

    if ((p=strrchr(r->sw_exe, PATHSEP))==NULL)
    {   
        p = r->sw_exe;
    }
    else
    {   
        p++;
    }

    /* Set up signal handlers to coordinate timing */
    signal(SIGUSR1, pcgiSIG);
    signal(SIGUSR2, pcgiSIG);
    sigemptyset(&zmask);
    sigemptyset(&nmask);
    sigaddset(&nmask, SIGUSR1);
    sigaddset(&nmask, SIGUSR2);
    sigprocmask(SIG_BLOCK, &nmask, &omask);

    /* Make sure another wrapper isn't already doing a restart */
    if ((r->lock=semget(101, 1, 0700 | IPC_CREAT | IPC_EXCL)) == -1)
    {
        if (errno == EACCES)
            strcpy(r->errmsg, ERR117_LOCK_ERROR_EACCES);
        else if (errno == EEXIST)
            strcpy(r->errmsg, ERR118_LOCK_ERROR_EEXIST);
        else if (errno == EINVAL)
            strcpy(r->errmsg, ERR119_LOCK_ERROR_EINVAL);
        else if (errno == ENOENT)
            strcpy(r->errmsg, ERR120_LOCK_ERROR_ENOENT);
        else if (errno == ENOSPC)
            strcpy(r->errmsg, ERR121_LOCK_ERROR_ENOSPC);
        else
            sprintf(r->errmsg, "%s, %d", ERR122_LOCK_ERROR_OTHER, errno);
        return(-1);
    }

    /* Keep us from dying without cleaning up our semaphore by
       setting signal handlers to ensure that the sem will always
       be released. We don't set handlers for SIGUSR1 SIGUSR2 or
       SIGCHLD, because we need those to coordinate with the child
       process(es) that we fork. */
    g_lock = r->lock;

    for(i=0; i<32; i++)
    {   
        if ((i!=SIGUSR1) && (i!=SIGUSR2) && (i != SIGCHLD))
        {
            signal(i, (void *)cleanup);
        }
    }

    /* If the old socket file exists and we have write permission,
       attempt to remove it. */
    if (r->sockport == 0 && access(r->sockpath, W_OK) == 0)
    {
        unlink(r->sockpath);
    }

    /* Fork a child which forks a child -- this is so that
       init will inherit the grandchild (so it won't die) */
    if ((pid = fork()) < 0)
    {   
        semctl(r->lock, 1, IPC_RMID, arg);
        return(-1);
    }
    else if (pid == 0)
    {   
        if ((pid = fork()) < 0) 
        {
            return(-1);
        }
        else if (pid > 0)
        {   /* Let child know we're going away so it can start */
            kill(pid, SIGUSR1);
            exit(0);
        }

        setsid();
        chdir("/");

        /* Wait for parent to go away */
        while(sigflag == 0) 
            sigsuspend(&zmask);
        sigflag = 0;
        sigprocmask(SIG_SETMASK, &omask, NULL);

        /* Platform oddities... */
        if (CloseFileDescriptors)
        {
            close(STDIN_FILENO);
            close(STDOUT_FILENO);
            close(STDERR_FILENO);
        }

        execl(r->sw_exe,
              p,
              r->pubpath,
              (char *)0);
        exit(0);           
    }

    /* Wait for the first child to finish */
    if (waitpid(pid, NULL, 0) < 0)
    {   semctl(r->lock, 1, IPC_RMID, arg);
        return(-1);
    }

    /*
    // Release restart lock!
    */
    semctl(r->lock, 1, IPC_RMID, arg);

    /*
    // Reset signal handlers
    */
    for(i=0; i<10; i++) 
    {
        signal(i, SIG_DFL);
    }

    sleep(2);
    return (0);
}
#endif  /* UNIX pcgiStartProc */

#ifdef WIN32
int pcgiStartProc(pcgiResource *r)
{
    HANDLE mutex = 0;
    char pythonExecutable[256];
    char command_line[1024];
    BOOL createProcessStatus;
    STARTUPINFO StartupInfo;
    PROCESS_INFORMATION ProcessInfo;
    int waitStatus;

    GetStartupInfo(&StartupInfo);

    /* Is another wrapper attempting a restart? */
    mutex = CreateMutex(NULL, FALSE, MUTEX_NAME);
    if (NULL == mutex)
    {
        //TODO: add error reporting
        return(-1);
    }

    waitStatus = WaitForSingleObject(mutex, (AUTODELAY * 1000));
    if (WAIT_TIMEOUT == waitStatus)
    {
        //TODO: add error reporting
        return(-1);
    }
    else if (WAIT_FAILED == waitStatus)
    {
        //TODO: add error handling by calling GetLastError()
        return(-1);
    }

    /*
    Travel beyond this point requires calling the
    ReleaseMutex function.  Fortunately, the Win32
    mutex is automatically released when a process
    terminates, but we could still encounter a
    situation where the process is hung or stalled ...
    */

  if (r->sw_exe[0])
      strcpy(pythonExecutable, r->sw_exe);
  else
    strcpy(pythonExecutable, "python");

    sprintf(command_line, "%s %s", pythonExecutable, r->pubpath);

    createProcessStatus = CreateProcess(
        NULL,
        command_line,
        NULL,
        NULL,
        FALSE,
        DETACHED_PROCESS,
        NULL,
        NULL,
        &StartupInfo,
        &ProcessInfo);

     /* wait a little bit to give the published
     application enough time to initialize itself */

//Yech!!!
    sleep(AUTODELAY); // <<<-- use a ReadySignal(tm), if available :)

    ReleaseMutex(mutex);
    CloseHandle(mutex);

    if (0 == createProcessStatus)
    {
        //TODO: report more information about failure
        return(-1);
    }
    else
    {
        r->procid = ProcessInfo.dwProcessId; /* assign process id */
        return(0);
    }
}
#endif
Zope-2.0.1-ZEO-nonbin/pcgi/pcgi.h100755   1007   1403       20361  6632000621  16341 0ustar  petrillipetrilli/* pcgi.h - Persistent CGI header file for pcgi-wrapper.c, parseinfo.c

Copyright (c) 1998, Digital Creations, Fredericksburg, VA, USA.  All
rights reserved. This software includes contributions from Jeff Bauer.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:

  o Redistributions of source code must retain the above copyright
    notice, this list of conditions, and the disclaimer that follows.

  o 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.

  o All advertising materials mentioning features or use of this
    software must display the following acknowledgement:

      This product includes software developed by Digital Creations
      and its contributors.

  o Neither the name of Digital Creations 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.

*/

#ifndef PCGI_H
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

#ifdef UNIX
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#endif
#ifdef WIN32
#include 
#include 
#include 
#include 
#endif

#define MAXLINEBUFFER   12
#define PATHSEP_UNIX    '/'
#define PATHSEP_WIN32   '\\'
#define DEFAULT_SOCK_PORT   7244
/*#define DEFAULT_SOCK_HOST "127.0.0.1"*/
#define MAXPATH 1024
#define PUBLISHER_NAME_1 "pcgi_publisher.py"
#define PUBLISHER_NAME_2 "pcgi_publisher.pyc"
#define PUBLISHER_NAME_3 "pcgi_publisher.pyo"
#define PUBLISHER_NAME_4 "pcgi_publisher"

#define HDRLEN 10
#define HDRFMT "%010ld"

#ifdef  UNIX
#define PATHSEP PATHSEP_UNIX
typedef int                     pcgi_socket;
#endif
#ifdef  WIN32
#define PATHSEP PATHSEP_WIN32
typedef SOCKET                  pcgi_socket;
#define sleep(x)                Sleep(x * 1000)
#define read(x,y,z)             _read(x,y,z)
#define write(x,y,z)            _write(x,y,z)
#define MUTEX_NAME              "pcgiMutex"
#define AUTODELAY       5
#define CONNRETRY       0
#define CONNDELAY       1
#endif
#ifndef CREOSOTE
/* no-op in case someone forgets to remove a spew() in their debug code */
#define spew(x) 
#endif

#ifndef STDIN_FILENO
#define STDIN_FILENO    0
#endif
#ifndef STDOUT_FILENO
#define STDOUT_FILENO   1
#endif
#ifndef STDERR_FILENO
#define STDERR_FILENO   2
#endif

#define MAXSZ           256
#define RKEY            99

#define E_500           "500 Server Error"
#define E_503           "503 Service Unavailable"

#define ERR101_FAILURE_DURING_START "(101) failure during start"
#define ERR102_FAILURE_DURING_CONNECT "(102) failure during connect"
#define ERR103_UNABLE_VERIFY_RUNNING "(103) unable to verify if process is running"
#define ERR104_ENVIRONMENT_SEND "(104) environment send"
#define ERR105_STDIN_SEND "(105) stdin send"
#define ERR106_STDOUT_READ_HEADER "(106) stdout read header"
#define ERR107_BAD_STDOUT_STRLEN "(107) bad stdout strlen"
#define ERR108_STDOUT_READ_BODY "(108) stdout read body"
#define ERR109_STDERR_READ_HEADER "(109 stderr read header"
#define ERR110_BAD_STDERR_STRLEN "(110) bad stderr strlen"
#define ERR111_STDERR_READ_BODY "(111) stderr read body"
#define ERR112_STDOUT_TO_SERVER "(112) error returning stdout to server"
#define ERR113_STDOUT_TO_SERVER "(113) error returning stderr to server"
#define ERR114_UNABLE_TO_OPEN_SOCKET "(114) unable to open socket"
#define ERR115_CONNECTION_REFUSED "(115) connection refused"
#define ERR116_UNABLE_TO_CONNECT "(116) unable to connect"
#define ERR117_LOCK_ERROR_EACCES "(117) lock error: EACCES"
#define ERR118_LOCK_ERROR_EEXIST "(118) lock error: EEXIST"
#define ERR119_LOCK_ERROR_EINVAL "(119) lock error: EINVAL"
#define ERR120_LOCK_ERROR_ENOENT "(120) lock error: ENOENT"
#define ERR121_LOCK_ERROR_ENOSPC "(121) lock error: ENOSPC"
#define ERR122_LOCK_ERROR_OTHER  "(122) lock error"
#define ERR123_BAD_ENV_HEADER "(123) bad environment header"
#define ERR124_BAD_STDIN_HEADER "(124) bad stdin header"

/* #define onError(s,x)    {estatus=s; emsg=x; goto error;} */


typedef struct resource_tag
{  
    char sw_info  [MAXSZ]; /* path to pcgi info file */
    char sw_name  [MAXSZ]; /* module name */
    char sw_home  [MAXSZ]; /* home path */
    char sw_exe   [MAXSZ]; /* path to executable, e.g. /usr/local/bin/python */
    char procpath [MAXSZ]; /* path to file containing pid */
    char sockpath [MAXSZ]; /* binding path for UNIX, Win32 named pipes */
    char pubpath  [MAXSZ]; /* path to pcgi_publisher.py(c) */
    int  sockport;         /* port number, if INET socket */
    char sockhost [MAXSZ]; /* hostname, if INET socket */
    char modpath  [MAXSZ]; /* module path */
    char errmsg   [MAXSZ]; /* last error, brief message */
    char errlog   [MAXSZ]; /* fully qualified path to error log file */
    char insertPath  [MAXPATH];  /* insert path by publisher */
    char pythonPath  [MAXPATH];  /* PYTHONPATH, if provided */
    short displayErrors;   /* displayErrors = 0,1 */
    long sz_env;
    long sz_input;
    long sz_output;
    long sz_error;
    char *p_env;
    char *p_input;
    char *p_output;
    char *p_error;
    int  procid;
    int  conn;
    int  lock;
} pcgiResource;

static char errorHtml[]=
"Status: %s\n"
"Content-Type: text/html\n"
"Pragma: nocache\n"
"Expires: Thu, 01 Dec 1994 16:00:00 GMT\n\n"
"\n"
"\n"
"Temporarily Unavailable\n"
"\n"
"\n"
"\n"
"\n"
"  \n"
"  \n"
"\n"
"
    \n"
"  
    \n"
"  !\n"
"  
    \n"
"  
    \n"
"  Temporarily Unavailable\n"
"  
    \n"
"  The resource you requested is temporarily unavailable - "
"please try again later.\n"
"  
    \n"
"%s\n"
"\n"
"";

/* To ensure backward compatibility with pcgi info files, */
/* don't change the order of the first 4 enum elements.   */
enum { resource_sockpath=0,
       resource_procpath=1,
       resource_workdir=2,
       resource_modpath=3, /* remaining elements not order dependent */
       resource_sockport,
       resource_sockhost,
       resource_exepath,
       resource_exefile,
       resource_pubpath,
       resource_ENUM };

/* Declarations */

void cleanup(void);
void onError(char *, char *, pcgiResource *);
int pcgiAssignPublisherPath(char *, pcgiResource *);
int pcgiPutEnvironment(char *);
long pcgiRead(pcgi_socket, char *, long);
long pcgiWrite(pcgi_socket, const char *, long);
int pcgiVerifyProc(pcgiResource *);
pcgi_socket pcgiConnect(pcgiResource *);
int pcgiStartProc(pcgiResource *);
int pcgiParseInfo(pcgiResource *);
int pcgiPutNameValueInEnvironment(char *, char *);
void pcgiSIG(int);
void pcgiPrintEnvironment();
void pcgiPrintResourceInfo(pcgiResource *);
int pcgiTruthValue(char);
#ifdef WIN32
void amendPathSeparators(char *);
long pcgiReadSocket(pcgi_socket, char *, long);
long pcgiWriteSocket(pcgi_socket, const char *, long);
#endif

#ifdef HAVE_UNION_SEMUN
#define UNION_SEMUN union semun
#else
#define UNION_SEMUN \
    union semun { \
        int val; \
        struct semid_ds *buf; \
        ushort *array; \
    } arg;
#endif

#define PCGI_H  1
#endif
Zope-2.0.1-ZEO-nonbin/pcgi/pcgi_publisher.py100755   1007   1403       32116  6714115176  20635 0ustar  petrillipetrilli# PCGIPublisher.py
# Persistent CGI Publisher - jeffbauer@bigfoot.com
#
# Copyright (c) 1998, Digital Creations, Fredericksburg, VA, USA.  All
# rights reserved. This software includes contributions from Jeff Bauer.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
#   o Redistributions of source code must retain the above copyright
#     notice, this list of conditions, and the disclaimer that follows.
#
#   o 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.
#
#   o All advertising materials mentioning features or use of this
#     software must display the following acknowledgement:
#
#       This product includes software developed by Digital Creations
#       and its contributors.
#
#   o Neither the name of Digital Creations 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.
#
# 2.0 alpha4:
#   - adds NT support, using INET sockets
#   - added Mike Fletcher's Microsoft IIS hack, suggested by Amos Latteier
#
# 2.0 alpha3:
#   - adds error checking
#   - expands header to 10 bytes (extra byte defines an out-of-band msg)
#
# 2.0 alpha1:
#   - add support for new PCGI_ directives
#   - re-write module as a class, rather than a set of functions

__version__ = "2.0a4"

import string, sys, os

class PCGIPublisher:
    def __init__(self, resource=None):
        ### resources passed from the environment, info file or pcgi-wrapper
        self.errorLogFile = None
        self.hostname = None
        self.port = 0
        self.insertPath = None
        self.moduleName = None
        self.modulePath = None
        self.socketFile = None
        self.pidFile = None
        self.swhome = None
        self.sock = None

        ### bound imports ###
        self.StringIO = None
        self.publish_module = None

        ### other ###
        self.bufsize = 8192
        self.error = 0

        if resource is None:
            self.getResources()
        else:
            self.resource = resource
        self.initPCGI()

    def cleanup(self):
        if self.socketFile:
            import os
            if os.path.exists(self.socketFile): 
                try:
                    os.unlink(self.socketFile)
                except os.error:
                    pass

    def getResources(self):
        """
        Obtain the publisher resources from the environment.  Done here
        in a separate method to make it easy to override, because we may
        not always and forever obtain our resources from the environment.
        """
        import os
        self.resource = os.environ

    def fatalError(self, errmsg=''):
        if self.errorLogFile:
            import sys, traceback, StringIO
            try:
                from time import asctime, localtime, time
                timeStamp = asctime(localtime(time()))
            except ImportError:
                timeStamp = '???'
            try:
                f = open(self.errorLogFile, 'a+')
                f.write("%s  %s\n" % (timeStamp, errmsg))
                if sys.exc_type != SystemExit:
                    trace=StringIO.StringIO()
                    traceback.print_exception(sys.exc_type,
                                              sys.exc_value,
                                              sys.exc_traceback,
                                              None,
                                              trace)
                    f.write("  %s\n" % trace.getvalue())
                f.close()
            except IOError:
                pass
        self.cleanup()
        self.error = 1

    def initPCGI(self):
        import os
        self.initPrincipia()
        if self.resource.has_key('PCGI_ERROR_LOG'):
            self.errorLogFile = self.resource['PCGI_ERROR_LOG']
        if self.resource.has_key('PCGI_HOST'):
            self.hostname = self.resource['PCGI_HOST']
        if self.resource.has_key('PCGI_INSERT_PATH'):
            self.insertPath = self.resource['PCGI_INSERT_PATH']
        if self.resource.has_key('PCGI_MODULE_PATH'):
            self.modulePath = self.resource['PCGI_MODULE_PATH']
        if self.resource.has_key('PCGI_NAME'):
            self.moduleName = self.resource['PCGI_NAME']
        if self.resource.has_key('PCGI_PID_FILE'):
            self.pidFile = self.resource['PCGI_PID_FILE']
        if self.resource.has_key('PCGI_PORT'):
            import string
            try: self.port = string.atoi(self.resource['PCGI_PORT'])
            except ValueError: pass
        if self.resource.has_key('PCGI_SOCKET_FILE'):
            self.socketFile = self.resource['PCGI_SOCKET_FILE']
        self.insertSysPath()

        if not self.moduleName:
            return self.fatalError("missing module name, try specifying PCGI_NAME")

        ### TODO: probably should make an attempt to import self.moduleName
        ### to provide the user with earliest possible response.

        try:
            from cStringIO import StringIO
        except:
            from StringIO import StringIO
        self.StringIO = StringIO

        try:
            from ZPublisher import publish_module
        except ImportError:
            try:
                from cgi_module_publisher import publish_module
            except ImportError:
                return self.fatalError(
                    "unable to import publish_module from ZPublisher")

        self.publish_module = publish_module

        if not self.pidFile:
            return self.fatalError("missing pid file")

        ### create pid file ###
        try:
            f = open(self.pidFile, 'wb')
            f.write(str(os.getpid()))
            f.close()
        except IOError:
            return self.fatalError("unable to write to pid file: %s" % self.pidFile)
        import socket
        if not self.socketFile:
            return self.fatalError("missing socket file")
        if self.port:
            if os.sep == '/':
                return self.fatalError("INET sockets not yet available on Unix")
            if self.hostname is None:
                self.hostname = socket.gethostname()
            try:
                self.sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
                self.sock.bind(self.hostname, self.port)
            except socket.error:
                return self.fatalError("error binding to socket: %s" % self.socketFile)
            try:
                sf = open(self.socketFile, 'wb')
                sf.write("%s\n%s\n" % (self.hostname, self.port))
                sf.close()
            except IOError:
                return self.fatalError("error attempting to write socket file: %s" % self.socketFile)
        else:
            try: os.unlink(self.socketFile)
            except os.error: pass
            try:
                self.sock = socket.socket(socket.AF_UNIX, socket.SOCK_STREAM)
                self.sock.bind(self.socketFile)
            except socket.error:
                return self.fatalError("error binding to socket: %s" % self.socketFile)
            try: os.chmod(self.socketFile, 0777)
            except os.error: pass

    def initPrincipia(self):
        if self.resource.has_key('SOFTWARE_NAME'):
            self.moduleName = self.resource['SOFTWARE_NAME']

    def insertSysPath(self, insertPath=None):
        import os, sys, string
        if insertPath is None: 
            insertPath = self.insertPath
        if insertPath:
            sys.path[0:0]=string.split(insertPath,':')
        elif self.resource.has_key('PCGI_WORKING_DIR'):
            ### Note: PCGI_WORKING_DIR is a deprecated pcgi directive ###
            workDir = self.resource['PCGI_WORKING_DIR']
            while workDir[-1:]=='/' or workDir[-1:]=='\\':
                workDir=workDir[:-1]
            sys.path[0:0]=[workDir]
        else:
            pass

        # The present assumption is that if the module path isn't in
        # sys.path, we want it put there, even if the PCGI_INSERT_PATH 
        # directive has been specified.
        if self.modulePath:
            d, s = os.path.split(self.modulePath)
            if not d in sys.path:
                sys.path[0:0] = [d]
            # If the moduleName is not known at this time, we make a
            # reasonable guess based on the path.  It might behoove the
            # user to explicitly specify PCGI_NAME, however.
            if not self.moduleName:
                import string
                self.moduleName = string.splitfields(s,'.')[0]

    def handler(self, conn):
        from string import split, join, atoi
        hdr = conn.recv(10)

        size = atoi(hdr)
        buff = []
        while size > 0:
            data = conn.recv(size)
            size = size - len(data)
            buff.append(data)

        ### XXX - Later: add out-of-band data handling ###
        if (hdr[0] != '0'):
            return

        env = {}
        for i in filter(None, split(join(buff,''),'\000')):
            e = split(i,'=')
            if len(e) >= 2:
                env[e[0]] = join(e[1:],'=')
            else:
                env[e[0]]=''
        size = atoi(conn.recv(10))
        if size > 1048576:
            ### write large upload data to a file ###
            from tempfile import TemporaryFile
            stdin = TemporaryFile('w+b')
            bufsize = self.bufsize
            while size > 0:
                if size < bufsize: 
                    bufsize=size
                data = conn.recv(bufsize)
                size = size - len(data)
                stdin.write(data)
            stdin.seek(0,0)
        else:
            ### use StringIO for smaller data ###
            buff = []
            while size > 0:
                data = conn.recv(size)
                size = size-len(data)
                buff.append(data)
            stdin = self.StringIO(join(buff,''))
        stdout = self.StringIO()
        stderr = self.StringIO()

        ### IIS hack to fix broken PATH_INFO
        ### taken from Mike Fletcher's win_cgi_module_publisher
        import string
        if env.has_key('SERVER_SOFTWARE') and string.find(env['SERVER_SOFTWARE'],'Microsoft-IIS') != -1:
            script = filter(None,string.split(string.strip(env['SCRIPT_NAME']),'/'))
            path = filter(None,string.split(string.strip(env['PATH_INFO']),'/'))
            env['PATH_INFO'] = string.join(path[len(script):],'/')

        try:
            self.publish_module(self.moduleName,stdin=stdin,stdout=stdout,stderr=stderr,environ=env)
        except:
            self.fatalError("unable to publish module")

        stdin.close()
        stdout=stdout.getvalue()
        stderr=stderr.getvalue()
        conn.send('%010d' % len(stdout))
        if len(stdout) > 0:
            conn.send(stdout)
        conn.send('%010d' % len(stderr))
        if len(stderr) > 0:
            conn.send(stderr)
        conn.close()

    def listen(self):
        """
        Note to sub-classes:  Aside from the constructor, listen() should 
        be the only method you *must* invoke.
        """
        if self.error:
            return self.fatalError("attempt to listen after fatal error")

        import os, sys
        if not self.sock:
            return self.fatalError("no socket available")

        self.sock.listen(512)

        stdlog('stderr')
        stdlog('stdout')

        while not self.error:
            conn, accept = self.sock.accept()
            try:
                self.handler(conn)
            except socket.error:
                pass

def stdlog(name):
    NAME=string.upper(name)+'_LOG'
    if os.environ.has_key(NAME):
        f=os.environ[NAME]
    else:
        f='/dev/null'
    try: f=open(f,'a')
    except: f=None
    getattr(sys, name).close()
    if f is not None: setattr(sys, name, f)

def main():
    try:
        import os, sys, string, traceback
        pcgiPublisher = PCGIPublisher(os.environ)
        if not pcgiPublisher.error:
            pcgiPublisher.listen()
    except ImportError:
        print "Content-type: text/html"
        print
        print "PCGIPublisher catastrophic import error"

if __name__ == '__main__':
    try: 
        main()
    finally:
        import os
        if os.environ.has_key('PCGI_SOCKET_FILE'):
            try: os.unlink(os.environ['PCGI_SOCKET_FILE'])
            except os.error: pass
Zope-2.0.1-ZEO-nonbin/pcgi/MrCreosote/ 40755   1007   1403           0  6772126761  17231 5ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/pcgi/MrCreosote/README.MrCreosote100755   1007   1403         577  6612715535  22257 0ustar  petrillipetrilliREADME.MrCreosote - JeffBauer@bigfoot.com - May 21, 1998

MrCreosote is a lightweight message-passing idiom I use
  to debug multi-processor/multi-user code sometimes.i
  It's basically just a matter of tossing out datagrams
  (connectionless sockets).  I'll document it later, in
  case anyone finds it useful for debugging.  For now,
  just ignore the contents of this directory.

Zope-2.0.1-ZEO-nonbin/pcgi/MrCreosote/creosote.c100755   1007   1403        5255  6612715535  21323 0ustar  petrillipetrilli/* creosote.c */

#include "creosote.h"

struct MrCreosote CreosoteServer;

void closeMrCreosote()
{
    struct MrCreosote *c = &CreosoteServer;
    if (c->socket)
    {
#ifdef UNIX
        close(c->socket);
#endif
#ifdef WIN32
        closesocket(c->socket);
        WSACleanup();
#endif
    }
    c->socket = 0;
}

#ifdef UNIX
int initializeMrCreosote()
{
    struct MrCreosote *c = &CreosoteServer;
    SOCKADDR_IN addr, *serv;
    creosote_socket *s;

    serv = &(c->serv_addr);
    s = &(c->socket);

    c->port = CREOSOTE_PORT;
    strcpy(c->host, CREOSOTE_HOST);

    bzero(serv, sizeof(*serv));
    serv->sin_family = AF_INET;
    serv->sin_addr.s_addr = inet_addr(c->host);
    serv->sin_port = htons(c->port);

    if ((*s = socket(AF_INET, SOCK_DGRAM, 0)) < 0)
    {
        return(-1);
    }

    bzero((char *) &addr, sizeof(addr));
    addr.sin_family = AF_INET;
    addr.sin_addr.s_addr = htonl(INADDR_ANY);
    addr.sin_port = htons(0);

    if (bind(*s, (struct sockaddr *) &addr, sizeof(addr)) < 0)
    {
        return(-1);
    }

    return(0);
}
#endif
#ifdef WIN32
int initializeMrCreosote()
{
    struct MrCreosote *c = &CreosoteServer;
    SOCKADDR_IN *serv;
    creosote_socket *s;
    WSADATA WsaData;
    int enable = 1;

    s = &(c->socket);

    if (!c->port)
    {
        c->port = CREOSOTE_PORT;
    }

    if (!c->host[0])
    {
        strcpy(c->host, CREOSOTE_HOST);
    }

    if (0 != WSAStartup(MAKEWORD(2,0), &WsaData))
    {
        return(-1);
    }

    /* Set the address */
    serv = &(c->serv_addr);
    serv->sin_family = AF_INET;
    serv->sin_addr.s_addr = inet_addr(c->host);
    serv->sin_port = htons((short)c->port);

    /* Create socket */
    *s = socket(AF_INET, SOCK_DGRAM, 0);
    if (INVALID_SOCKET == *s) { return(-1); }

    /* Permit the socket to broadcast */
    if (SOCKET_ERROR == setsockopt(*s, SOL_SOCKET, SO_BROADCAST, (char *) &enable, sizeof(enable)))
    {
        return(-1);
    }

    return(0);
}
#endif

void setMrCreosoteHost(char *host)
{
    /* 
       If not using localhost, setMrCreosoteHost() must be called
       before initializeMrCreosote(). 
    */
    strcpy(CreosoteServer.host, host);
}

void setMrCreosotePort(int port)
{
    /* must be done before initializeMrCreosote() is called */
    CreosoteServer.port = port;
}

void spewMrCreosote(char *msg)
{
    struct MrCreosote *c = &CreosoteServer;
    sendto(c->socket, msg, strlen(msg), 0, (struct sockaddr *) &(c->serv_addr), sizeof(c->serv_addr));
}

#if 0
int main(int argc, char *argv[])
{
    if ( (initializeMrCreosote()) < 0)
    {
        printf("initializeMrCreosote() failed\n");
        exit(1);
    }
    spew("Hello, world");
    closeMrCreosote();
    return(0);
}
#endif
Zope-2.0.1-ZEO-nonbin/pcgi/MrCreosote/creosote.h100755   1007   1403        1544  6612715535  21325 0ustar  petrillipetrilli/* creosote.h */

#include 
#include 
#include 
#include 
#include 
#include 

#define CREOSOTE_HOST  "127.0.0.1"
#define CREOSOTE_PORT  7739
#define spew(x) spewMrCreosote(x)

#ifdef UNIX
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
typedef int         creosote_socket;
typedef struct sockaddr_in SOCKADDR_IN;
#endif

#ifdef WIN32
#include 
#include 
#include 
typedef SOCKET      creosote_socket;
#endif

struct MrCreosote
{
    char host[256];
    int port;
    creosote_socket socket;
    SOCKADDR_IN serv_addr;
};

/* Declarations */
void closeMrCreosote();
int initializeMrCreosote();
void spewMrCreosote(char *msg);
Zope-2.0.1-ZEO-nonbin/pcgi/MrCreosote/creosote.py100755   1007   1403        4066  6612715535  21530 0ustar  petrillipetrilli#!/usr/bin/env python
# creosote.py - lightweight message passing with datagrams
# JeffBauer@bigfoot.com

import sys, socket

BUFSIZE = 1024
PORT = 7739

def spew(msg, host='localhost', port=PORT):
    s = socket.socket(socket.AF_INET, socket.SOCK_DGRAM)
    s.bind('', 0)
    s.sendto(msg, (host, port))

def bucket(port=PORT, logfile=None):
    s = socket.socket(socket.AF_INET, socket.SOCK_DGRAM)
    s.bind('', port)
    print 'creosote bucket waiting on port: %s' % port
    if logfile:
        f = open(logfile, 'a+')
    while 1:
        data, addr = s.recvfrom(BUFSIZE)
        print `data`[1:-1]
        if logfile:
            f.write(`data`[1:-1]+'\n')
            f.flush()

class MrCreosote:
    """lightweight message passing with datagrams"""
    def __init__(self, host='localhost', port=PORT):
        self.host = host
        self.port = port
        self.client = None
        self.disabled = 0
        self.redirect_server = None
        self.redirect_client = None
    def bucket(self, logfile=None):
        bucket(self.port, logfile)
    def redirector(self, host, port=PORT):
        if self.disabled:
            return
        if self.redirect_server == None:
            self.redirect_server = socket.socket(socket.AF_INET, socket.SOCK_DGRAM)
            self.redirect_server.bind('', self.port)
        if self.redirect_client == None:
            self.redirect_client = socket.socket(socket.AF_INET, socket.SOCK_DGRAM)
            self.redirect_client.bind('', 0)
        while 1:
            data, addr = self.redirect_server.recvfrom(BUFSIZE)
            self.redirect_client.sendto(data, (host, port))
    def spew(self, msg):
        if self.disabled:
            return
        if self.client == None:
            self.client = socket.socket(socket.AF_INET, socket.SOCK_DGRAM)
            self.client.bind('', 0)
        self.client.sendto(msg, (self.host, self.port))

if __name__ == '__main__':
    """usage: creosote [message]"""
    if len(sys.argv) < 2:
        bucket()
    else:
        from string import joinfields
        spew(joinfields(sys.argv[1:],' '))

Zope-2.0.1-ZEO-nonbin/pcgi/Test/ 40755   1007   1403           0  6772126761  16066 5ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/pcgi/Test/README.parseinfo100755   1007   1403        1742  6612715540  21027 0ustar  petrillipetrilliREADME.parseinfo - JeffBauer@bigfoot.com - May 21, 1998

parseinfo is an executable to test the parsing the pcgi
  info file.  Although pcgifile.py can be used to test
  how the pcgi-wrapper is expected to react "in vitro"
  (i.e. as a CGI process) the parseinfo program actually
  runs the info file through the parser code  (although
  it performs no further environment testing).

usage:  parseinfo  

sample output:

  r->sw_info           /export/home/jbauer/tmp/pcgiinfo
  r->sw_name           
  r->sw_home           
  r->sw_exe            /usr/local/bin/python
  r->procpath          /export/home/jbauer/var/pcgitime.pid
  r->sockpath          /export/home/jbauer/var/pcgitime.socket
  r->modpath           /export/home/jbauer/www/cgi-bin/pcgitime.py
  r->pubpath           /export/home/jbauer/www/cgi-bin/pcgi_publisher.py
  r->procid            0
  r->insertPath        
  r->pythonPath        .:/usr/local/lib/python1.5:/var/share/s0/python
  CloseFileDescriptors 0
Zope-2.0.1-ZEO-nonbin/pcgi/Util/ 40755   1007   1403           0  6772126761  16064 5ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/pcgi/Util/killpcgi.py100755   1007   1403        5175  6612715543  20337 0ustar  petrillipetrilli#!/usr/bin/env python
# killpcgi.py - kill a running pcgi process
# Copyright(c) 1998, Jeff Bauer, All rights reserved.

# killpcgi is a convenience script to kill a running
# pcgi process, provided that it is running on a 
# Unix system.  You pass it the path of the pcgi info
# file, and killpcgi will kill the running process and 
# remove the socket/pid files.
#
# killpcgi has been built at the request of several users,
# but you may want to first examine the script and modify it 
# to suit your environment.
#
# Bugs:  skimpy error handling

# 0.3a  minor win32 exception caught
# 0.2a  Added support for NT - 8/8/98
# 0.1a  Initial version

__version__ = "0.3a"

def win32_kill(pid):
    """posix-style kill command for the Win32 environment"""
    import win32api, pywintypes
    try:
        handle = win32api.OpenProcess(1, 0, pid)
    except pywintypes.error:
        return -1
    return (0 != win32api.TerminateProcess(handle, 0))

def killpcgi(pcgiInfoFile):
    import os, sys, string
    delimiter = '='
    pidFile = None
    socketFile = None
    infoFile = open(pcgiInfoFile, 'r')
    for i in infoFile.readlines():
        if delimiter in i:
            n,v = string.split(string.strip(i), delimiter)
            if n == 'PCGI_PID_FILE':
                pidFile = v
            elif n == 'PCGI_SOCKET_FILE':
                socketFile = v
    infoFile.close()

    if pidFile is None:
        print "unknown pid file"
    else:
        f = open(pidFile)
        pid = int(f.read())
        f.close()
        if os.name == 'nt':
            if not win32_kill(pid):
                print "process %d killed" % pid
        elif os.name == 'posix':
            if os.kill(pid, 0):
                print "process %d doesn't appear to be running" % pid
            else:
                # safety measure (exclude it if you're fearless)
                if os.system('/bin/ps -p %d | grep python > /dev/null' % pid):
                    print "process %d doesn't appear to be python" % pid
                else:
                    os.kill(pid, 15)
                    print "process %d killed" % pid
                    # conservative approach: don't remove pid/socket files
                    # unless we're reasonably certain we have killed the 
                    # running process
                    os.unlink(pidFile)
                    if socketFile is not None: 
                        os.unlink(socketFile)
        else:
            print "kill not supported for platform:", os.name

if __name__ == '__main__':
    import sys
    usage = "usage: killpcgi pcgi-info-file"
    if len(sys.argv) < 2:
        print usage
    else:
        killpcgi(sys.argv[1])
Zope-2.0.1-ZEO-nonbin/pcgi/Util/README100755   1007   1403         406  6612715543  17017 0ustar  petrillipetrillipcgifile.py - JeffBauer@bigfoot.com - May 21, 1998

The pcgifile.py is a sanity tester for pcgi info files and
can be run as a stand-alone program or a CGI script.  For
more information, refer to:

  http://starship.skyport.net/crew/jbauer/persistcgi/pcgifile/

Zope-2.0.1-ZEO-nonbin/pcgi/Util/pcgifile.py100755   1007   1403       46627  6612715543  20352 0ustar  petrillipetrilli#!/usr/local/bin/python
# pcgifile.py - pcgi info file sanity testing - jeffbauer@bigfoot.com
# Copyright(c) 1998, Jeff Bauer

# 0.6a  August 9, 1998
#   - added socket checking
#
# 0.5a  August 7, 1998
#   - added NT compatibility
#   - improved import checking
#
# 0.4a  July 27, 1998 
#   - added checks for executable permissions
#   - print versions of relevant modules

__version__ = "0.6a"
Delimiter = '='

# no class-based exceptions due to 1.4 compatbility
PcgiFileException='PcgiFileException' 

class PcgiFile:
    def __init__(self, pcgifile):
        self.pcgifile = pcgifile
        self.infodict = {}
        self.combined = {}
        self.log = []
        self.resource = []
        self.file_contents = []
        self.module_version = []
        self.continue_testing = 1
        self.pcgi_wrapper = None
        try:
            self.readInfoFile()
            self.checkRequiredKeys()
            self.checkPCGIValues()
            self.lookupPCGIPublisher()
            self.checkWritePermissions()
            self.checkImports()
            self.checkSockets()
        except PcgiFileException:
            self.continue_testing = 0

    def checkImports(self):
        try:
            from cgi_module_publisher import publish_module
        except ImportError:
            self.log.append("error attempting: 'from cgi_module_publisher import publish_module'")
            raise PcgiFileException

        try:
            import cgi_module_publisher, CGIResponse
            self.module_version.append("%-20s %-7s  %s" % \
                                       ('cgi_module_publisher',
                                        cgi_module_publisher.__version__,
                                        cgi_module_publisher.__file__) )
            self.module_version.append("%-20s %-7s  %s" % \
                                       ('CGIResponse',
                                        CGIResponse.__version__,
                                        CGIResponse.__file__) )
            self.module_version.append("%-20s %-7s  %s" % 
                                       ('pcgifile',
                                        __version__,
                                        sys.argv[0]) )
            self.module_version.append("%-20s %-7s  %s" % \
                                       ('pcgi-wrapper',
                                        self.getPcgiWrapperVersion(),
                                        self.pcgi_wrapper))
        except ImportError:
            pass
        except NameError:
            pass

        try:
            import pcgi_publisher
        except ImportError:
            if self.combined.has_key('PCGI_PUBLISHER'):
                d, s = os.path.split(self.combined['PCGI_PUBLISHER'])
                if not d in sys.path:
                    sys.path.append(d)
        try:
            import pcgi_publisher
            self.module_version.append("%-20s %-7s  %s" % \
                                       ('pcgi_publisher',
                                        pcgi_publisher.__version__,
                                        pcgi_publisher.__file__))
        except ImportError:
            pass
        except NameError:
            pass

    def checkPCGIValues(self):
        if self.combined.has_key('PCGI_EXE'):
            sw_exe = self.combined['PCGI_EXE']
        else:
            sw_exe = sys.executable
            self.log.append("advisory recommendation: specify PCGI_EXE=%s" % \
                            sys.executable)
        if os.path.isfile(sw_exe):
            self.resource.append("Executable:\t%s" % sw_exe)
        else:
            self.log.append("executable not found: %s" % sw_exe)
            raise PcgiFileException
        if self.combined.has_key('PCGI_PID_FILE'):
            f = self.combined['PCGI_PID_FILE']
            d = os.path.split(f)[0]
            if os.path.isdir(d):
                self.resource.append("PID file:\t%s" % f)
            else:
                self.log.append("directory not found: %s" % d)
                raise PcgiFileException
        if self.combined.has_key('PCGI_SOCKET_FILE'):
            f = self.combined['PCGI_SOCKET_FILE']
            d = os.path.split(f)[0]
            if os.path.isdir(d):
                self.resource.append("Socket file:\t%s" % f)
            else:
                self.log.append("directory not found: %s" % d)
                raise PcgiFileException
        if not self.combined.has_key('PCGI_NAME'):
            self.log.append("advisory recommendation: specify PCGI_NAME")
        if self.combined.has_key('PCGI_MODULE_PATH'):
            p = self.combined['PCGI_MODULE_PATH']
            if os.path.isfile(p):
                self.resource.append("Module:\t%s" % p)
            else:
                self.log.append("module not found: %s" % p)
                raise PcgiFileException
        if self.combined.has_key('PCGI_ERROR_LOG'):
            self.resource.append("Error Log:\t%s" % \
                                 self.combined['PCGI_ERROR_LOG'])
        if self.combined.has_key('PCGI_WORKING_DIR'): # deprecated
            d = self.combined['PCGI_WORKING_DIR']
            if os.path.isfile(d):
                self.resource.append("Working Directory:\t%s" % d)
            else:
                self.log.append("working directory not found: %s" % d)
                raise PcgiFileException

    def checkRequiredKeys(self):
        """
        Check for the required PCGI keys.
        """
        for (k,v) in os.environ.items():
            self.combined[k] = v
        for (k,v) in self.infodict.items():
            if self.combined.has_key(k):
                self.log.append("%s=%s, overwrites: %s" % (k, v, self.combined[k]))
            self.combined[k] = v
        for k in ['PCGI_PID_FILE','PCGI_SOCKET_FILE','PCGI_MODULE_PATH']:
            if not self.combined.has_key(k):
                self.log.append("missing parameter: %s" % k)
                raise PcgiFileException
        # PCGI_INFO_FILE is assigned by the pcgi-wrapper, so that it
        # may be known (made available) to pcgi_publisher.
        self.combined['PCGI_INFO_FILE'] = self.pcgifile

    def checkSockets(self):
        """
        Check for possible socket-related error conditions.
        """
        try:
            import socket
        except ImportError:
            self.log.append("unable to import socket module")
            raise PcgiFileException

        port = None
        if self.combined.has_key('PCGI_PORT'):
            try:
                port = string.atoi(self.combined['PCGI_PORT'])
            except ValueError:
                self.log.append("invalid port '%s', PCGI_PORT must be an integer" % self.combined['PCGI_PORT'])
                raise PcgiFileException
        if os.name == 'posix':
            if port:
                self.log.append("cannot specify PCGI_PORT directive on Unix - no support for INET sockets")
                raise PcgiFileException
        elif not port:
            self.log.append("win32 platform must specify missing PCGI_PORT directive (default=7244)");
            raise PcgiFileException

        if port:
            if self.combined.has_key('PCGI_HOST'):
                hostname = self.combined['PCGI_HOST']
                if hostname != socket.gethostname():
                    self.log.append("advisory recommendation: PCGI_HOST '%s' doesn't match '%s'" % (hostname, socket.gethostname()))
            else:
                hostname = socket.gethostname()

        if port:
            try:
                sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
                sock.bind(hostname, port)
            except socket.error:
                self.log.append("error creating/binding INET socket (%s, %s)" % (hostname, port))
                raise PcgiFileException
        else:
            try:
                sock = socket.socket(socket.AF_UNIX, socket.SOCK_STREAM)
            except socket.error:
                self.log.append("error creating UNIX socket")
                raise PcgiFileException

            socketFile = self.combined.get('PCGI_SOCKET_FILE')
            if os.path.exists(socketFile):
                self.log.append("advisory: socket %s in use, bind() not tested" % socketFile)
            else:
                try:
                    sock.bind(socketFile)
                    os.unlink(socketFile)
                except socket.error:
                    self.log.append("error binding UNIX socket (%s)" % socketFile)
                    raise PcgiFileException

    def checkWritePermissions(self):
        """
        Check write permissions for PCGI_SOCKET_FILE, PCGI_PID_FILE, and
        (if specified) PCGI_ERROR_LOG.
        """
        fn = {}
        if self.combined.has_key('PCGI_PID_FILE'):
            fn['PCGI_PID_FILE'] = self.combined['PCGI_PID_FILE']
        if self.combined.has_key('PCGI_SOCKET_FILE'):
            fn['PCGI_SOCKET_FILE'] = self.combined['PCGI_SOCKET_FILE']
        if self.combined.has_key('PCGI_ERROR_LOG'):
            fn['PCGI_ERROR_LOG'] = self.combined['PCGI_ERROR_LOG']
        for key, file in fn.items():
            if os.path.exists(file):
                try:
                    f = open(file,'a+')
                    f.close()
                except IOError:
                    self.log.append("%s write permission error: %s" % \
                                    (key, file))
                    raise PcgiFileException
            else:
                path = os.path.split(file)[0]
                import tempfile
                tempfile.tempdir = path
                tmpfile = tempfile.mktemp()
                try:
                    f = open(tmpfile,'w+')
                    f.close()
                    os.unlink(tmpfile)
                except IOError:
                    self.log.append("%s write permission error: %s" % \
                                    (key, file))
                    raise PcgiFileException

    def environList(self):
        """
        return a sorted list of how the environment would likely appear 
        if run through the pcgi-wrapper.
        """
        e = []
        keys = self.combined.keys()
        keys.sort()
        for k in keys:
            e.append("%s\t%s" % (k, self.combined[k]))
        return e

    def getPcgiWrapperVersion(self):
        """
        Execute pcgi-wrapper with no arguments and grab the version id.
        """
        try:
            import tempfile
            tmpfile = tempfile.mktemp()
            os.system("%s > %s" % (self.pcgi_wrapper, tmpfile))
            f = open(tmpfile, 'r')
            r = f.readlines()
            f.close()
            os.unlink(tmpfile)
            for l in r:
                s = string.strip(l)
                if s[:21] == 'pcgi-wrapper-version ':
                    return string.split(s)[1]
        except ImportError:
            pass
        return None

    def isexecutable(self, path, real=None):
        if os.name == 'posix':
            return self.pathperm(path, real)[2]
        else:
            return 1

    def lookupPCGIPublisher(self):
        """
        The most efficient way for pcgi-wrapper to determine which
        pcgi_publisher to use is for the pcgi info file to specify
        it with the PCGI_PUBLISHER directive.  Using the PCGI_PUBLISHER
        is arguably the *best* method, as pcgi-wrapper will find it
        quicker than otherwise.  Still, in the interest of flexibility,
        pcgi-wrapper will attempt to locate pcgi_publisher using the
        following rules:

        1.  PCGI_PUBLISHER  (*best*)

        Rules 2-5, look in the paths below for files named: pcgi_publisher.py,
          pcgi_publisher.pyc, pcgi_publisher.pyo, pcgi_publisher.
        2.  PCGI_INSERT_PATH, if available
        3.  PYTHONPATH, if available
        4.  Look in the directory of PCGI_MODULE_PATH
        5.  Look in the directory of the pcgi info file
        """
        if self.combined.has_key('PCGI_PUBLISHER'):
            p = self.combined['PCGI_PUBLISHER']
            if os.path.isfile(p):
                self.resource.append("Publisher:\t%s" % p)
            else:
                self.log.append("publisher not found: %s" % p)
                raise PcgiFileException
            return
        self.log.append("advisory recommendation: specify PCGI_PUBLISHER")
        # search through combined PCGI_INSERT_PATH + PYTHONPATH directories
        searchPath = ""
        if self.combined.has_key('PCGI_INSERT_PATH'):
            searchPath = searchPath + self.combined['PCGI_INSERT_PATH']
        if self.combined.has_key('PYTHONPATH'):
            searchPath = searchPath + self.combined['PYTHONPATH']
        publisherName = ['pcgi_publisher.py','pcgi_publisher.pyc','pcgi_publisher.pyo','pcgi_publisher']
        for d in string.split(searchPath, ':'):
            for p in publisherName:
                pcgiPublisher = "%s%s%s" % (d, os.sep, p)
                if os.path.isfile(pcgiPublisher):
                    self.resource.append("Publisher:\t%s" % pcgiPublisher)
                    return
        # look in module directory
        if self.combined.has_key('PCGI_MODULE_PATH'):
            (d, x) = os.path.split(self.combined['PCGI_MODULE_PATH'])
            for p in publisherName:
                pcgiPublisher = "%s%s%s" % (d, os.sep, p)
                if os.path.isfile(pcgiPublisher):
                    self.resource.append("Publisher:\t%s" % pcgiPublisher)
                    return
        # look in pcgi info file directory
        (d, x) = os.path.split(self.pcgifile)
        for p in publisherName:
            pcgiPublisher = "%s%s%s" % (d, os.sep, p)
            if os.path.isfile(pcgiPublisher):
                self.resource.append("Publisher:\t%s" % pcgiPublisher)
                return
        self.log.append("Unable to locate the pcgi_publisher")
        raise PcgiFileException

    def pathperm(self, path, real=None):
        """
        Returns a 3-tuple of booleans indicating whether the process has
        (read, write, execute) permission.  A true value for the 'real'
        argument indicates the test should occur for the real id rather
        than the effective id.
        """
        stat = os.stat(path)
        if real is None:
            uid = os.geteuid()
            gid = os.getegid()
        else:
            uid = os.getuid()
            gid = os.getgid()

        if uid == stat[4]:
            return (00400 & stat[0], 00200 & stat[0], 00100 & stat[0])
        elif gid == stat[5]:
            return (00040 & stat[0], 00020 & stat[0], 00010 & stat[0])
        else:
            return (00004 & stat[0], 00002 & stat[0], 00001 & stat[0])

    def readInfoFile(self):
        max_directives = 12  # arbitrary number defined in pcgi.h
        if not os.path.isfile(self.pcgifile):
            self.log.append("unable to locate file: %s" % self.pcgifile)
            raise PcgiFileException
        elif not self.isexecutable(self.pcgifile):
            self.log.append("info file '%s' not executable" % self.pcgifile)
            raise PcgiFileException
        f = open(self.pcgifile, 'r')
        lc = 0
        for r in f.readlines():
            lc = lc + 1
            s = string.strip(r)
            self.file_contents.append(s)
            if lc == 1:
                if s[:2] != '#!':
                    self.log.append("first line missing header, e.g. #!/usr/local/bin/pcgi-wrapper")
                    raise PcgiFileException
                else:
                    self.pcgi_wrapper = string.strip(s[2:])
                    if not os.path.isfile(self.pcgi_wrapper):
                        self.log.append("unable to find wrapper: %s" % \
                                        self.pcgi_wrapper)
                        raise PcgiFileException
                    elif not self.isexecutable(self.pcgi_wrapper):
                        self.log.append("wrapper '%s' is not executable" % \
                                        self.pcgi_wrapper)
                        raise PcgiFileException

            if len(s) < 1 or s[0] == '#':
                continue
            pos = string.find(s, Delimiter)
            if pos < 0:
                self.log.append("missing '%s' delimiter at line %d: %s" % \
                                (Delimiter, lc, s))
            else:
                self.infodict[string.strip(s[0:pos])] = string.strip(s[pos+1:])
        f.close()
        if len(self.infodict.keys()) > max_directives:
            self.log.append("info fileexceeds maximum (%d) number of directives" % max_directives)
            raise PcgiFileException

class PcgiFileTest:
    """
    CGI sanity check of the pcgi info file.
    """
    def __init__(self):
        fs = cgi.FieldStorage()
        infofile = None
        if fs.has_key('infofile'):
            infofile = fs['infofile'].value
        elif fs.has_key('filename'):
            infofile = fs['filename'].value

        if infofile is None:
            print "Please specify the pcgi info file in the following manner:"
            print "
    "
            print "  http://.../cgi-bin/pcgifile.py?infofile=pcgifile"
            print "
    "
            print "where pcgifile is the absolute path of the pcgi info file."
        else:
            print "
    "
            print "Python %s" % sys.version
            if os.environ.has_key('SERVER_SOFTWARE'):
                print "%s" % os.environ['SERVER_SOFTWARE']
                print
            print "PCGI info file:\t%s" % infofile
            pcgiFile = PcgiFile(infofile)
            print "PCGI wrapper:\t%s" % pcgiFile.pcgi_wrapper
            for m in pcgiFile.log:
                print m
            if not pcgiFile.continue_testing:
                print "status: FAILURE"
                print
                print "%s" % infofile
                for r in pcgiFile.file_contents:
                    print "  %s" % r
            else:
                print "looks OK"
                print
                print "%s" % infofile
                for r in pcgiFile.file_contents:
                    print "  %s" % r
                print
                print "Likely publisher resource values:"
                for r in pcgiFile.resource:
                    print "  %s" % r
                print
                print "Versions of modules used:"
                for r in pcgiFile.module_version:
                    print "  %s" % r
                print
                print "Resulting environment will probably appear to the publisher as:"
                for e in pcgiFile.environList():
                    print "  %s" % e

def test():
    usage = 'usage: pcgifile pcgi_info_file'
    if len(sys.argv) < 2:
        print usage
        sys.exit(1)
    infoFile = sys.argv[1]
    pcgiFile = PcgiFile(infoFile)
    for m in pcgiFile.log:
        print m
    if pcgiFile.continue_testing:
        print "%s looks OK" % infoFile

if __name__ == '__main__':
    try:
        import cgi, os, sys, string, traceback
        if os.environ.has_key('SERVER_PROTOCOL'):
            print "Content-type: text/html"
            print "Expires: Monday, 1-Jan-96 00:00:00 GMT"
            print "Pragma: no-cache"
            print
            sys.stderr = sys.stdout
            try:
                pcgiFileTest = PcgiFileTest()
            except:
                print "
    "
                traceback.print_exc()
        else:
            test()
    except ImportError:
        print "Content-type: text/html"
        print
        print "error during python imports; to fix try adding to pcgifile.py: 
    "
        print "    sys.path[0:0] = [path1, path2, ...]"
Zope-2.0.1-ZEO-nonbin/pcgi/Win32/ 40755   1007   1403           0  6772126761  16051 5ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/pcgi/Win32/Makefile.nt100755   1007   1403        2422  6612715545  20226 0ustar  petrillipetrilli# Makefile.nt

VERSION = 2.0a4
CC = cl
CFLAGS = /W3 /DWIN32 /I..
LIBS = wsock32.lib
SRCDIR= ..
CREOSOTE_DIR = $(SRCDIR)/MrCreosote
CORE = $(SRCDIR)/pcgi.h #parseinfo.c

.c.obj:
	$(CC) /c $(CFLAGS) $*.c

all:	pcgi-wrapper.exe parseinfo.exe creosote.obj

creosote.obj:	$(CREOSOTE_DIR)/creosote.c $(CREOSOTE_DIR)/creosote.h
	$(CC) /c $(CFLAGS) /I$(CREOSOTE_DIR) /Focreosote.obj $(CREOSOTE_DIR)/creosote.c

parseinfo1.obj:	$(SRCDIR)/parseinfo.c $(CORE)
	$(CC) /c $(CFLAGS) /DMAIN_PARSEINFO /Foparseinfo1.obj $(SRCDIR)/parseinfo.c 

parseinfo2.obj:	$(SRCDIR)/parseinfo.c $(CORE)
	$(CC) /c $(CFLAGS) $(SRCDIR)/parseinfo.c /Foparseinfo2.obj

pcgi-wrapper1.obj: $(SRCDIR)/pcgi-wrapper.c $(CORE)
	$(CC) /c $(CFLAGS) /I$(CREOSOTE_DIR) /DPCGI_WRAPPER_MAIN /DCREOSOTE /DVERSION=\"$(VERSION)\" /Fopcgi-wrapper1.obj $(SRCDIR)/pcgi-wrapper.c

pcgi-wrapper2.obj: $(SRCDIR)/pcgi-wrapper.c $(CORE)
	$(CC) /c $(CFLAGS) /I$(CREOSOTE_DIR) /DCREOSOTE /Fopcgi-wrapper2.obj $(SRCDIR)/pcgi-wrapper.c

parseinfo.exe:	parseinfo1.obj pcgi-wrapper2.obj creosote.obj
	link /OUT:parseinfo.exe parseinfo1.obj pcgi-wrapper2.obj creosote.obj $(LIBS)

pcgi-wrapper.exe: pcgi-wrapper1.obj parseinfo2.obj creosote.obj
	link /OUT:pcgi-wrapper.exe pcgi-wrapper1.obj parseinfo2.obj creosote.obj $(LIBS)
Zope-2.0.1-ZEO-nonbin/pcgi/Win32/README.NT100755   1007   1403        7242  6612715545  17353 0ustar  petrillipetrilliREADME.NT - one day this will grow up and become a real README file.

PCGI 2.0a4 Win32 binary release (alpha 4)  August 10, 1998
contact: jeffbauer@bigfoot.com

What is this?

    The collection of files below is the first Win32
    release of PCGI, the Persistent CGI wrapper for
    Bobo applications.  For more information about Bobo,
    go to Digital Creations site: http://www.digicool.com

Files (in relative order of importance):

    pcgi-wrapper.exe    - the main program
    pcgi_publisher.py   - modified to handle both Unix & Win32
    pcgifile.py         - indispensible for tracking down problems
    pcgitime.py         - sample module
    pcgitest            - sample PCGI info file
    killpcgi.py         - handy for killing the running process
    parseinfo.exe       - used only when necessary  (to view the pcgi
                            info file the way pcgi-wrapper sees it)

For information about Persistent CGI, check out:

  http://starship.skyport.net/crew/jbauer/persistcgi/

  (This information may soon move over to www.digicool.com)

Platforms tested?

    Apache/Win32 1.3.1 running on NT 4.0.  However, it should
    run on any Win32 platform running a server supporting http.

Basic checklist to get the sample application up and running:

    0.  Install Python, Bobo, and a web server on your machine.
        If you haven't got these things already working, please
        see my notes on the subject:

          http://starship.skyport.net/crew/jbauer/apachenotes/

    1.  Put pcgi-wrapper.exe where you normally place your
        binary executables, or in cgi-bin.

    2.  Put pcgi_publisher.py in a directory where you normally
        put your .py scripts -- cgi-bin is okay, but you will
        specify the path in your info file, regardless.

    3.  Put pcgitest & pcgitime.py in cgi-bin.  You will have
        to modify the first #! she-bang line in pcgitest to
        match the path of where you put pcgi-wrapper.exe.  Also,
        all directives must match your environment -- the examples
        included are for illustration purposes only.  Please
        read the online (URL above) PCGI documentation for
        further information.

    4.  Run your setup against pcgifile.py, a sanity check
        described in:

        http://starship.skyport.net/crew/jbauer/persistcgi/pcgifile/
        http://starship.skyport.net/crew/jbauer/persistcgi/howto

    5.  Give me feedback, please:  jeffbauer@bigfoot.com

-------------------
Microsoft IIS Notes:

    Amos Latteier notes that some web servers, notably Microsoft's IIS,
    cannot deal with the first line in a CGI program like Apache:

      #!C:\WINNT\system32\pcgi-wrapper.exe

    The solution is to use a .pcgi extension for your info file and create 
    a file association between .pcgi and pcgi-wrapper.exe with an IIS script 
    map registry entry, e.g.:

      .pcgi  C:\winnt\system32\pcgi-wrapper.exe  %s

    Now info files with the .pcgi extension will execute as cgi
    programs.

    [Amos further notes in a posting to the Bobo list:]

    IIS 4 by default sends a custom 404 error message which masks 
    Bobo's 404 error information.  This effectively keeps you from 
    seeing what Bobo is trying to tell you about why it is not 
    publishing your object.  To get rid of this annoyance go to 
    the web site properties dialog in the Microsoft Management 
    Console application.  Click on the "Custom Errors" tab.  Choose 
    the 404 error and change it to use "Default" error message. 

    Voila, you're back in business, and can read Bobo information in 
    the source of your 404 error messages now.
Zope-2.0.1-ZEO-nonbin/pcgi/Win32/parseinfo.exe100755   1007   1403      172000  6612715545  20677 0ustar  petrillipetrilliMZ@	!L!This program cannot be run in DOS mode.

$PEL5\@D@0 <!H.text `.rdata'@@.dataL8@.idata` @UEQ3҅‰`A=`At EPhH@M	Q!3]U	Et3URPhp@QURPR	ȉ;EM:t
EuUMMu֋U+RPQU+ƄEPQu3U;u	MBUtMQURu3}EtUREPju3[MtEPMQ>u3/UtMQURu3]U<Et@E@E@E@EPQRI|h@-TrJ\uƄPQ̊u@uN~4
\uƄÃ}Dž}{DPj\Qh@RPQt3tPMQU3m]UEA:5Qy=rȋPQj=RGE}EMMEEh@Ph@Qh@RuEPMQA^h@RuEPMQ.h@RuEPMQh$@RmuEPMQh0@!Ph8@Rh@@Pu!MQUR}}qhP@PuMRsMf<hd@RuEPM
Q	ht@RouEPMQh@R<uEPMQh@R	th@PtMMQ=rh@U	R#HEPMQ&h@RuEPMQh@RYuEPMQh@R&uEPMQlh$@RuEPM^h0@RuEPMQ
.h@@RuEPMQ3]U<DžEDžEEPV},M	uhT@E	Pph@MQu"URh@E	P>MQh@RhP9Q	#
jQREU;rW=@~jMRE@3fJtMUUj=PE}DžQ}.h@U	RPgTMUUh@P\uMQUR,h@P)uMQURoh@PuMQUR<h@Pu!MQUR}xh@PuMR&MfXh$@RUuEPM
Q%h4@R"uEPMQhh@@RuEPMQ5hL@RuEPMQh`@RuEPMQYht@RVuEPMQ&h@R#uEPMQih@RuEPMh@RuEPMQh@RuEPMQ^h@R[uEPMQ.h@R+uEPMQqt.h@U	RLP}u2QURPh0@6}u2QURPhD@}udQURPhT@j}.hh@M	QwR}u`PMQ<Rh@}-h@E	PQl.h@U	RPO<MMR*EuUREuh@U	RkPMQ}u(URh@E	P5u(URh4@E	P
TMEUu.hP@MQURhl@WEuAUREPh|@MQW
URh@EuAUREPh@MQ
URh@Euh@U	R,Euh@U	R3]UQEEP
PE}u'MQURFEPt3]UQVEEP
MQ
TRE}u0EPMQh@UREP%t3^]UE1t$MttUTtEyt	MYu4U0t$EftMFtUnt	ENu3]UEEMUEMMtU/uE\MM͋]U8E}}h@h4jMQUǂ,EHQUREP}0MQh4@0U	RhT@h\@EPhx@h@MQh@h@URh@h@EPh@h@MQh@h@URh@h@cEPh@h@HMQh @h,@,U(Ph8@hD@MQhP@h`@URhl@h|@EQh@h@URh@h@EQh@h@`ARh@h@j]UEdAEhA}E,t%jM,R)E,Q	U
tehT@M
QE}tEj,EU	REPMQPhX@UREPqMtUP#MtUPMtE	EMQUREPMQh@/h@h@j]UEEEMM}~6UREPMQTE}EU+UUEEEċE+E]UEE;E}8M+MMjUREEPMQ{E}uUUUE]UEEEMM}~>UREPMQE}}E"}uU+UUEEE뼋E+E]UEE;E}8M+MMjUREEPMQE}uUUUE]Uj
jEP#M(uvht@UR0E}upEPj
MQ`
uUUREPw4MQU(E(Qjj!Au3]UDž@DžDLPjtyEMtEPQhRu,Py<<t
At"5A;rtЋ
A;sh@h@:h$@h @(uUA!A^][ÐVt$W|$;stЃ;r_^Vt$WF@t
F_^ètJVVFP}F_^ËFtPoFF_^ÐQL$VA=w@3fJL$#^YË5@ЁDVtD$L$
D$L$D$
jL$jQT$PRju^YËD$L$%^#YÐUW}3AOEG8t3_S\$Ul$Wۉl$3_][KVtGt$FHFx3A	VCtG<
tKuԋD$^_][;u3^_][ËD$^_][Ð!uËL$T$PD$PQRÐD$L$j@PQÐAL$PQÐVt$Ww4u|$wV-3utV!u3_^ÐD$Vp|A;wQ1%uAVjR!A^ÐT$L$tG3D$Wr-كt+шGIuʃttGJuD$_ËD$VWh@4)L$D$PQh@h@V)_^ÐQ=L$r-=s+ȋą@PVt$uV^V6t^ËF@tFP)^3^ÐSVt$3WFȃuFt?F>+~4VWPR;NjFut$^FF_^[ FFF_^[Ðj	ÐAS\$UVW333~MAt7Ht/uPtEutPuAF;|t_^][ÐAVu
}
AjP*Au.jjA*AujFA3ҹ@A @@|3@ȋAtu @0@|^ÐAt*ÐQVt$t=D$L$PQV6!tT$PD$RP!^YË
AVjQ!A^YÐSVt$WVC&L$D$PQVVW&_^[ÐD$P+t
Pi*3ÐD$P!AL$Q!AfT$
f;Au?fD$f;Au1fL$f;
Au#fT$f;AufD$f;AuAfL$ Q!At&uf$t$t3T$L$AT$
AL$AA
AT$L$PD$%RT$PD$QL$ %RPQk,$tÐD$
A;SUVWȋA<A|$$t$La$83;݉l$l$ u
3_^][ tjUP4-@Q$4D$ۋD$(+;s(G
u
t$ 
F@t$ @ЍL$(+с|ЋT$(D$+T$$jPL$0VQL$$R"AD$T$;ƉT$|+;rt$D$umD$t9upAlA	_^][P+_^][ËL$$D@t}u
3_^][lA+D$ _^][lA	_^]pA[!AD$GL$U$8QSUR"AtD$D$D$!AD$AS\$UV;WÃA4At$D$PL$(|$$3DžHtT$R
tGID
T$jRQPQ"AuH!AupAlA	_^][Ãmu
3_^][PE*_^][ËT$LD t	?
u$D$$;ʼnl$<<
t	FGM;s
u

FGD$3L$UQT$0jRRG"Au!AuXD$tPL$DHtD$(<
u:
	FD/;t$$u|$(
u
T$ jjR)D$4<
t
Fl$;1+t$$_^][ËD$D@\u+t$$_^][3_^][_^]lA	pA[ÐUWVuM};v;xur)$HB@Ǻr$`A@$XB@$A@pA@A@A@#ъFGFGr$HB@.#ъFGr$HB@#ъFGr$HB@.?B@,B@$B@B@B@B@B@A@DDDDDDDDDDDDDD$HB@XB@`B@lB@B@E^_ÐE^_ÐFGE^_.FGFGE^_Ðt1|9u$r
$C@$C@.Ǻr+$B@$C@B@C@@C@F#шGNOr$C@.F#шGFGr$C@F#шGFGFGZ$C@.C@C@C@C@C@C@C@C@DDDDDDDDDDDDDD$C@C@C@D@D@E^_ÐFGE^_.FGFGE^_ÐFGFGFGE^_Ujh@hXu@dPd%SVWe"A3ҊԉAȁ
Aʉ
|AxAtu
jE/"AAU+At	Au
j('AAPAP
AQ;EP!E
MPQ%ËeEPEMd
_^[]Ð=At0D$P0h@@ÐSUVt$WFn
@3ۨt^N$FF^$Fu&@t@u
U2u	VP2FtlF>N+PI;N~WPUUV؊D$ StՋAA@ tjSU#VD$L$WQU;tF F_^][ËD$%_^][ _F^][ÐLSUVW$d33L$Gۈ\$@$d(t$(t$(L$T$<@T$,T$@DPt#$`L$QRP`G$d$`L$QRP=D$ D$D$D$Ã53ɊP@$O@D$0uD$D$t9$hRPD$`PQ/}.T$\D$4T$3$hQfD$\T$\T$
$hP@t:Ht3T$t(L$D$,(D$,L$=H@3|$ID$0uD$D$t$hQȋD$L$t:u

L@L$ND$,tf8t
Nu+'u

H@L$Nҋt
8t@Nu+$hP-L$ tfL$D$4fT$D$4D$D T$D$\D$D$@T$}
D$u
guD$$h|$$hHL$LPD$DT$PPWT$dQD$XRPAt$$tuL$\QAguuT$\RA|$\-uD$D$D$]D$|$3ID$D$0
@D$iD$0
_D$D$8D$8'D$D$0t5L$8D$"0QD$$L$#D$D$0tD$D$\$ǀt$hRb t3@t$hPgB$hQQ%*@t$hR4$hP!3@t|s؃ڀ\$ǀuL$}\$uD$$$[D$I҉L$tDD$0RUWVT$hI,T$XRUWV0+9~\$8D$L$HD$뫋L$$[+@D$t80uu	HED$0D$4\$@t*tD$"-tD$"+
t
D$" D$$|$(T$$++u$`D$PVWj [$`T$$L$QVD$*RPztuL$QVWj0D$,t$]fT$HPR0*~"$`L$QRPD$TPKuƋ\$t$`L$QRWj $dGۈ\$@$dD$_^][LËD$T$RVUPH@DG@iG@G@H@%H@jH@:I@G@G@G@G@G@N@H@I@H@*I@N@XI@'K@'K@*;tV1*P!Au
!A3Vq)UD:tS\_^][3_^][_^]lA	pA[ÐVt$Ft%t!FPF%F3FF^ÐQAS3UV5"A;WuBD$Pjh@jօt"L$Qjh@jS"AAuT$$D$ L$RT$PQR_^][YÃD$(\$;u	p	AD$(|$ L$T$(SSSSWQh R"A;u3_^][YVju3_^][YËD$L$(jjVUWPh Q"AtlT6R
؃tYD$,u`	AL$SVUQf;PfD;"Af|;D$tf<;uT$$WSRu(D$URSID$_^][YÐQASUV5"AW3;u#D$Pjh@jWօAu*D$,;u`	AT$$L$ RT$ QL$ RQP_^][YÃ\$(|$,;up	Al$ T$WWURj	S"AtKVjt:D$VWUPjS"At%L$$T$QPWR"AWR_^][YËt$,W=_^][YÍL$Qjh@j"AtA_^]3[YÐVt$WF@t F_^FuVv"FNVFQRPFtntiV‚u2Nt<A<AOႀu V~uNtuFH3҉F@_^ËNFȉN_^ÐL$SUV33W=t	AuGGh@hP("At-AJAGt;vwD$EHD$t
}׋t.zu(J 9u@=|=u	R;=\@tD$B_^][ÐL$X@;Hv;Hr=X@t:u3сr#T$T$%+ȉD3ÐD$L$V3+HtDL$0@uA@ Au
j^ÐQ
xAS\$UVWL$Ay +;s.;|9_vSPVucL$_;rҋiyq;s.;|9^vSPWuAL$^;rҋ	xA;ȉL$t7[L$
xA+Ӊy_^][YËL$
xA+Ӊq_^][YýX@9MtEumX@EuD$+3;u}PF;tjhPWD$ ,"A;T$D$3Ʌ~2GPPƀANuՋT$ -xA;s9t;r;#E_U
+ˉ
G+ÍLG_^][Yt5HYTxA+ӁQP+ӉP_^][Y_^]3[YÐT$SUVW|$G;‰L$r:;s7G+‰7GWGЍA+_^][8t;Ë\$suu<~Fu@A8t;s9l$;u	O+;L$%,;r;s	+ʉOyOko;s~;squ#~Fu@A8t;s+;rL%;t$r3_^][Í;s	+ʉO	/GF+_^][_^]3[ÐL$SUl$VWy+׋|$\$ 3L3ҊL$;v+AƉ_^][sp;;wc>;s:uB;r;uNE;w4;v0;sM3u	T@tE
EEED$+Ή_^][ÐVt$WFPa@u3
@ul
AA
AFuPAuhQAt-AFFFF
F_^_3^ÐD$Vt4t$Ft=VFFFF^ËD$Ht	P^ÐD$
A;s?ȋADt'PP0"Au!A3tpAlA	ÐHSUVWh?u
j5A;A 
s F^
A;rT$R!Af|$FD$HxL$,|D$D$
A;}iAhtI
A 
A;s@X;rAL$;|

AL$D$3~IMt4t.uQ<"At֋AUHD$FG;|-8"A3ۋAڍ4ڃuTFu
HPՋt*W<"At%>uF@uFF@FFC|AP4"A_^][HÐSUVt$t$Wwv!A3҃wB;5|Aw(PЃt3̓u-
AVjQӋЅuAtVu_^][_^][ÐAVW3;~QSAt7XtPdtG|
ARAAF;|[_^ÐVt$F@FA A @@f@@fAf@fAAAANQhA V@RP~:N@QPm:@RP]ȸQ VATRQ7ȋFdRQ 
@A^ÐVt$gfffL$Ћƀ0
AA^0ÐVt$>}3^=~f=}_+0AD$D$Py#4AVQ
8AD$T$+RD$<#F ^V(#V
t+8A
0A+<D$҉}щD$+D$L$ыNѹ<‰D$҉V}щVD$+D$L$ыNѹ‰D$҉V}щVD$+D$*l$Ћ…D$~,NFNVT$‰FD$ȋƉN^}MNDFVT$…FFlFFHFF^ËD$NȉN^Ð$S\$,lUVFW|$tf8uf8u+j@jjjUVjj"At>W4؃t/jjWSUVjj"AuS3VP"A_^][VP"A3_^][ÃuhuՋ؅t\ÄtH@uH@u+@VuSL"A3_^][Ë΋SL"A_^][_^]3[ÐD$SUVWP4	A;l$(u
3_^][3;uh3_^][3ҸA9(0B=pArL$QU\"A@30A󫪃|$vqD$t7T$
t-3B;w1A1A@;vBu͸1A1A@=rU-4	AR8	A54	A58	A33@	AD	AH	A_^][95L	Atq3_^][Ã_^][ù@30AR3AEt0Nt)3;wxA1A@;vFuGrD$(P4	AAA8	AA
@	A@D	A_^H	A]3[ÐD$L	AuL	A%d"AuL	A%`"Aup	AL	AÐD$\w'3Ɋt@$s@øøø3s@s@s@s@s@W@30A3_4	A8	A@	AD	AH	AÐj)ÐUSVWUjjhxt@uh(]_^[]ËL$AtD$T$SVWD$Pjht@d5d%D$ Xpt.;t$$t(4vL$H|uhD@Td_^[3d
yt@uQR9QuSQpA
SQpAMKCkY[VC20XC00USVWU]E@EEEECs{tav|tEVUkT]^]t3x<{SkVSvjDaCT{v4롸UkjS]]_^[]UL$)APAPy]At
u.=D@u%hP	AthÐL$ASUVW3;tE=Ar;AANu
=D@=o$hPjH"Aud@$f$3$уËAD"jUS7|$jUS$+3|$hS}PD$PSt+~Ճ=pAu
lA
WSX|$jWS_^][}?jQSmSPx"AMulA
!ApAjWS._^][lA	_^][ÐQSUl$VW|$3D$t
u_^][YÅ[
`	Au7L$f98fQf@;r_^][YÃ=@uXt$vUVn
p	AD$PjUWUVh Q"A*L$L8H_^][YË\$p	AT$RjUWjSh P"AD$tF_^][YÅ!Az;sZ@L$Q
p	AjD$$RPjSjQ"AL$u0;w3҅~LɈ>t
BF;|;r_^][Yá`	AuD$P)_^][YËT$p	AL$QjjjjRh P"AtL$uH_^][YlA*_^][YÐT$Vt$‹΅tf8tIut
f8u+@^Ë^ÐSAUVWuAt4ugAt]l$tU3IҋtA3I;v<=uVURtSu3_^][ËD_^][_^]3[ÐD$
A;Vs`ȃALTtDt$%u@uɀ
%^lA^lA	^ÐD$uË
4	AT$Q
8	APRPD$PjQuÃÐSAUVWtc-"AjjjjjPjjՋt>V
t/jjVWjPjjՅtjW7Cu_^][Ã_^][_^]3[Ðl
ASUVW="AuNjh@jh@jjׅtl
A*jh@jh@jj|"AMl
At$ ~\$VS,\$D$(~PD$(PD$(A9
l
AuL$$T$PD$QVSRP_^][Ã'|$,D$ u=p	AjjjjVS"Ah WӋu_^][U諣D$,u_^][ËL$jjUPVQh WӅtMT$(D$$jjjjRPh WӋt-V]D$ tL$(T$$jjVPQRh WӅu!D$,PܦL$$QϦ3_^][Ë|$ \$,T$D$VWUSRP|"AS衦W蘦_^][+u
_^][3H$_^][Ðp
AS|"AUVWuNjh@jh@jjӅtp
A*jh@jh@jj"Ap
At$8~l$4VUYl$4|$@~D$$L$T;ˉFu9\$Au|L$ɋ
Att
t\_^][YÅt3_^][YÅu"j藏AAu"jqAAL$+UQ#;SunMonTueWedThuFriSatJanFebMarAprMayJunJulAugSepOctNovDecTZGetLastActivePopupGetActiveWindowMessageBoxAuser32.dll.com.bat.cmd.exe./\?*9@:@Status: %s
Content-Type: text/html
Pragma: nocache
Expires: Thu, 01 Dec 1994 16:00:00 GMT



Temporarily Unavailable



    

    
  
  
    
  !
  
    
      		
  
    
  Temporarily Unavailable
  
    
  The resource you requested is temporarily unavailable - please try again later.
  
    		

    

    
%s

unknown value for PCGI_CLOSE_FDS: %s:pcgi_publisher.pypcgi_publisher.pycpcgi_publisher.pyopcgi_publisherpcgi_publisher.py%s%c%sSOFTWARE_SOFTWARE_SOFTWARE_NAMESOFTWARE_HOMESOFTWARE_EXEPYTHONPATHPCGI_PCGI_PCGI_CLOSE_FDSPCGI_DISPLAY_ERRORSPCGI_ERROR_LOGPCGI_EXEPCGI_HOSTPCGI_INSERT_PATHPCGI_WORKING_DIRpcgiEnvironmentToResourceAssignment() length exceeds MAXPATHPCGI_MODULE_PATHPCGI_NAMEPCGI_PID_FILEPCGI_PORTPCGI_PUBLISHERPCGI_SOCKET_FILEpcgiEnvironmentToResourceAssignment() errorrunable to open info file: %sPCGI_INFO_FILEpcgiPutEnvironment() failedSOFTWARE_NAMESOFTWARE_HOMESOFTWARE_EXEPCGI_CLOSE_FDSPCGI_DISPLAY_ERRORSPCGI_ERROR_LOGPCGI_EXEPCGI_HOSTPCGI_INSERT_PATHPCGI_MODULE_PATHPCGI_NAMEPCGI_PID_FILEPCGI_PORTPCGI_PUBLISHERPCGI_SOCKET_FILEPCGI_WORKING_DIRPYTHONPATHpcgi info file mixes old and new style directives (new style uses name=value)PCGI_SOCKET_FILEPCGI_PID_FILEPCGI_INSERT_PATHpcgiPutNameValueInEnvironment() errorPCGI_MODULE_PATHpcgiPutNameValueInEnvironment() erroroldStyleLineCount exceeds maximumunable to determine the publisher locationmissing publisher: %spublisher read error: %s/usr/local/bin/python1.4SOFTWARE_EXE%s/var/%s.pidPCGI_PID_FILE%s/var/%s.socPCGI_SOCKET_FILEmissing parameter: PCGI_SOCKET_FILEmissing parameter: PCGI_PID_FILE%s=%susage: parseinfo 
error parsing info file: %s
  %s
pcgi resource attributes:
r->sw_info  %-20s %s
r->sw_name  %-20s %s
r->sw_home  %-20s %s
r->sw_exe  %-20s %s
r->procpath  %-20s %s
r->sockpath  %-20s %s
r->modpath  %-20s %s
r->pubpath  %-20s %s
r->procid  %-20s %d
r->insertPath  %-20s %s
r->pythonPath  %-20s %s
r->sockport  %-20s %d
r->sockhost  %-20s %s
r->displayErrors  %-20s %d
CloseFileDescriptors  %-20s %d
Status: %s
Content-Type: text/html
Pragma: nocache
Expires: Thu, 01 Dec 1994 16:00:00 GMT



Temporarily Unavailable



    

    
  
  
    
  !
  
    
      		
  
    
  Temporarily Unavailable
  
    
  The resource you requested is temporarily unavailable - please try again later.
  
    		

    

    
%s

$Id: pcgi-wrapper.c,v 1.4 1998/08/05 15:25:46 jbauer Exp $ab%s  pcgi-wrapper: %s  %s
rpcgiMutexpython%s %s127.0.0.1@@         (((((                  H .AA3@|@l@X@X@p@p@X@

		


!
5A
CPR
S
WYl
m pr	

	
)


`y!@~ڣ @ڣ AϢ[@~QQ^ _j21~ @@	@
t@H@@@@@h@0@@@x@y@z@@@@@@@@@pPSTPDT@AA;Zx0Nm:Yw/MlD!""< h&!v$$<','N'''&&&&&&Z&""""##4#D#V#d#x#########$$&$<$N$`$l%v&$$$$$$$%"%8%R%%%%%%%%%%&&.&@&
4s9	otv$$<','N'''&&&&&&Z&""""##4#D#V#d#x#########$$&$<$N$`$l%v&$$$$$$$%"%8%R%%%%%%%%%%&&.&@&
4s9	otWSOCK32.dllOpenProcess?SleepCloseHandleReleaseMutex=CreateProcessAjWaitForSingleObject8CreateMutexA(GetStartupInfoAkExitProcessFTerminateProcessGetCurrentProcesshHeapAllocnHeapFreeHGetTimeZoneInformation5GetSystemTimeGetLocalTimeGetLastError{WriteFileReadFileGetCommandLineALGetVersionnWideCharToMultiByte+GetStringTypeA.GetStringTypeWMultiByteToWideCharlHeapDestroyjHeapCreate^VirtualFree[VirtualAllocFlushFileBuffersSetHandleCount*GetStdHandleGetFileTypeSetFilePointerPUnhandledExceptionFilterGetModuleFileNameAFreeEnvironmentStringsAFreeEnvironmentStringsWGetEnvironmentStringsGetEnvironmentStringsWGetCPInfoGetACP	GetOEMCPRtlUnwind)SetStdHandle1CreateFileAGetProcAddressLoadLibraryASetEndOfFileCompareStringACompareStringWSetEnvironmentVariableAqHeapReAllocKERNEL32.dll~FindClosexFileTimeToSystemTimewFileTimeToLocalFileTimeGetDriveTypeAFindFirstFileAGetFullPathNameAGetCurrentDirectoryASetEnvironmentVariableWLCMapStringALCMapStringWGetLocaleInfoAGetLocaleInfoWZope-2.0.1-ZEO-nonbin/pcgi/Win32/pcgi-wrapper.exe100755   1007   1403      202000  6612715545  21303 0ustar  petrillipetrilliMZ@	!L!This program cannot be run in DOS mode.

$PEL5b N@P@<AH.text `.rdata_@@.dataQ<@.idata`@@UX2EDžƅ3ɉDžDžE!%h4jUR2Eǀ,}}MQh@h@
UBPMQ0UR}EPh@h@

A8t)R
0MDM뽋U
P-/MUuEPh@h@	MUEQh@URk.E0t;U	uh@M	Q/URh<@hT@	E
E
A8tPR/PREP*MMUEEhh@)E}MQ(UEM
R-MUuEPhx@h@MUEQh@UR,E0t;U	uh@M	Qn.URh@h@E
EMREPj
M;tURh@h@Nj
,MUuEPh@h0@jhD@MR&,EP
M,U,EP
MQ~};U	uhL@M	QX-URhh@h@EPz
M,U,}FE	uh@U	R,EP
AQ9%Ph@;U	uh@M	Q,URh@h@]E
QUPM,RM
;t;E	uh0@U	R@,EPhH@h\@M
REQU,P{M
;t;E	uhp@U	R+EPh@h@ujM,R!ƅj
PM,RuFE	uh@U	RZ+EP
AQ#Ph@R*wZE	u+R*Ph@h@E	PM)MQAR*#Ph@0t:Qh@U	R)EPh$@hL@JQW$UER)M RjE Q+UPM RE,Q8U;t;E	uh`@U	R)EPhx@h@|ƅj
QU,Pu:M	uh@E	Ps)MQh@h@R(wOE	u+R(Ph@h@E	Pq'MQh@h(@0t:Ph<@M	Q0'URhH@hp@yP"MUER<'M$RjE$Q8)UPM$RE,QWU;t;E	uh@U	R'EPh@h@M,R2EMRE QjU;t;E	uh@U	Ro'EPh@h@M RGEǀ MUPM$Rj'M;t;U	uh,@M	Q&URhT@hl@E$QUǂ$EQUǂEQvUǂYh@'h@3]UE@ETA}E,t%jM,RtE,Q_fU
teh@M
Q)E}tEj](EU	REPMQ (Ph@UR'EPB'MtUPdMtUPFMtE	EMQUREPMQh0@&h@h@j]UEEEMM}~6UREPMQ(E}EU+UUEEEċE+E]UEE;E}8M+MMjUREEPMQE}uUUUE]UEEEMM}~>UREPMQB*E}}E"}uU+UUEEE뼋E+E]UEE;E}8M+MMjUREEPMQE}uUUUE]Uj
jEPT$M(uvh@URA'E}upEPj
MQ+uUUR$EP"w4MQkU(E(QjjAAu3]UDž@DžDLPj;tyEMtEPQ["hRu,P<<tu3/UtMQURu3]U<E$@E8@EL@E`@EPQ(R|hp@}TrJ\uƄPQlu@uN~4
\uƄÃ}Dž}{DPj\Qh@ROPQ虁t3tPMQ3m]UEA:5Q=rȋPQ(j=R&E}EMMEEh@\Ph@Qw%h@R$uEPMQ^h@R$uEPMQa.h@Rk$uEPMQ1h@R=$uEPMQh@qPh@R$h@P#u!MQUR}}qh@P#uMRsMf<h@Rr#uEPM
Q8	h$@R?#uEPMQh0@R#uEPMQh<@R"thP@P"tMMQ=rhd@U	RsHEPMQU&h@R\"uEPMQ"h@R)"uEPMQh@R!uEPMQh@R!uEPM^h@R!uEPMQZ.h@Rd!uEPMQ*3]U<DžEDžEEPV},M	uh@E	Ph0@MQu"URh4@E	PMQhT@RhP9Q	#
jQb"EU;rW=\@~jMR!EP@3fJtMUUj=P E}DžQ}.hd@U	RFPTMUUh@P,uMQUR,h@PuMQURh@PuMQURh@Pu!MQUR}xh@PZuMR&MfXh@R%uEPM
Q%h@RuEPMQh@RuEPMQh@RuEPMQRh@RYuEPMQYh$@R&uEPMQ&h0@RuEPMQh@@RuEP
MhL@RuEPMQTh\@R[uEPMQ!^hp@R+uEPMQ.h@RuEPMQt.h@U	RPM}u2QURfPh@6}u2QUR.Ph@}udQURPh@j}.h@M	QRx}u`PMQRh@@}-hT@E	P^Ql.h|@U	R.P<MMREuUREuh@U	RPMQZuu(URh@E	P
u(URh@E	P
TMEUu.h@MQURh@WEuAUREPh,@MQURh<@EuAUREPhL@MQURh\@Euhp@U	R,Euh@U	R
3]UQEEP@
PE}u'MQUR
EP:wt3]UQVEEPMQTRE}u0EPMQh@UREPvt3^]UE1t$MttUTtEyt	MYu4U0t$EftMFtUnt	ENu3]UEEMUEMMtU/uE\MM͋]UQEAEtMREǀ]UDždADž`dhdudǂ;duh@dRlPjBtdMUfdPMAdfPMfAjjjhh8u*j`Qj hhPu3]UEPhA
]UE A]UQEAjEPjMQ4
PUREQY]%BA%BA%BA%BA%BA%BA%BA%BA%BA%BA%BA%BA%BA%BA%BAVt$uV^V6t^ËF@tFP^3^ÐSVt$3WFȃuFt?F>+~4VWPR
;NjFut$^FF_^[ FFF_^[Ðj	Ð1AS\$UVW333~M!At7Ht/uPtEutPu1AF;|t_^][Ð1AVu
}
1AjP!Au.jj1A!Auj6!A3ҹ@!A P@|3@ȋ Atu @@@|^ÐAtÐQVt$t=D$L$PQVtT$PD$RP_^YË
 AVjQAA^YÐD$
`AVW|;|<A3+`Aȸ`A_^Ð!Ath@h@h@h@ËD$jjP2ÐD$jjPÐASUl$VuUAAPAAD$\$AAu>
!At"5!A;rtЋ
!A;sh@h@:h$@h @(uUAAA^][ÐVt$W|$;stЃ;r_^SUVW|$=\@~3jPP@3ɊJtG3G-t+u3ɊG3ۃ=\@~
jVzP@rt3ɊG\FЋʃ-u_^][ÐD$PVÐSAUVWuAtTugAt]l$tU3IҋtA3I;v<=uVURtSu3_^][ËD_^][_^]3[ÐUWVuM};v;xur)$=@Ǻr$=@$>@$=@ =@L=@p=@#ъFGFGr$=@.#ъFGr$=@#ъFGr$=@.=@=@=@=@=@=@=@=@DDDDDDDDDDDDDD$=@>@>@>@0>@E^_ÐE^_ÐFGE^_.FGFGE^_Ðt1|9u$r
$?@$@?@.Ǻr+$>@$?@>@>@>@F#шGNOr$?@.F#шGFGr$?@F#шGFGFGZ$?@.D?@L?@T?@\?@d?@l?@t?@?@DDDDDDDDDDDDDD$?@?@?@?@?@E^_ÐFGE^_.FGFGE^_ÐFGFGFGE^_̃ D$$L$(D$D$D$,VPT$QRD$BD$D$HD$xD$^ ÍL$Qj^ ÐAL$PQÐVt$Ww4u|$wV-3utVH'u3_^ÐD$VpA;wQu AVjRAA^ÐL$tAt@u~Ѓ3ƒtAt2t$tt͍AL$+ÍAL$+ÍAL$+ÍAL$+W|$j...L$WtAt;u~Ѓ3ƒtAt#ttt͍y
yyyL$tAtdGu~Ѓ3‹tt4t'ttljD$_fD$G_fD$_ÈD$_ËT$L$tG3D$Wr-كt+шGIuʃttGJuD$_ËD$Q=L$r-=s+ȋą@PVWh@%L$D$PQh@h@V{%_^ÐVt$WF@t
F_^ètJV9V~&FP%}F_^ËFtPFF_^ÐSVt$WVC$L$D$PQVNVW$_^[ÐD$PV't
P&3ÐD$PAAL$QAAfT$
f;Au?fD$f;Au1fL$f;
Au#fT$f;AufD$f;AuAfL$ QAAt&uf$t$t3T$L$AT$
AL$AA
AT$L$PD$%RT$PD$QL$ %RPQ($tÐ*uËL$T$PD$PQR(ÐD$L$j@PQÐD$
!A;SUVWȋ A< A|$$t$La$83;݉l$l$ u
3_^][ tjUP*@Q$4D$ۋD$(+;s(G
u
t$ 
F@t$ @ЍL$(+с|ЋT$(D$+T$$jPL$0VQL$$RBAD$T$;ƉT$|+;rt$D$umD$t9uAA	_^][P)_^][ËL$$D@t}u
3_^][A+D$ _^][A	_^]A[AAD$GL$U$8QSURBAtD$D$D$AAD$!AS\$UV;WÃ A4 At$D$PL$(|$$3DžHtT$R
tGID
T$jRQPQBAuHAAuAA	_^][Ãmu
3_^][P(_^][ËT$LD t	?
u$D$$;ʼnl$<<
t	FGM;s
u

FGD$3L$UQT$0jRRGBAuAAuXD$tPL$DHtD$(<
u:
	FD/;t$$u|$(
u
T$ jjRv'D$4<
t
Fl$;1+t$$_^][ËD$D@\u+t$$_^][3_^][_^]A	A[ÐS\$Ul$Wۉl$3_][KVtGt$FHFx3A	Vs'tG<
tKuԋD$^_][;u3^_][ËD$^_][ÐL$WtzVSًt$|$uuo!FGIt%t)uuQt
FGt/KuD$[^_tGIuulGKu[^D$_ÉIt~Ѓ3‹tބt,ttuƉ3҉3It
3IuuD$[^_̋T$L$u<:u.
t&:au%
t:Au
t:au
uҋ3Ð@ËtB:uA
ttf:u
t:au
tUWVSM&ً}3ˋuF3:GwtIIы[^_̍B[...3D$ST$t
B8tфtQuWV؋
~333ƃu%t%uu^_[3ËB8t6t8t't8tt8tt^_B[ÍB^_[ÍB^_[ÍB^_[QL$VA=wP@3fJL$#^YË5P@ЁDVtD$L$
D$L$D$
jL$jQT$PRj&u^YËD$L$%^#YÐUW}3AOEG8t3_Ujh@h@dPd%SVWeBA3ҊԉAȁ
Aʉ
AAdu
jE:U0BA!A,At	!Au
jD)O(ZAAPAP
AQ
EPa!E
MPQ~&ËeEP^EMd
_^[]Ð=At1D$P1hp@ÐD$
!A;s?ȋ ADt'Pd5PBAuAA3tAA	ÐHSUVWhu
jO5 A;!A 
s F^
 A;rT$RAAf|$FD$HxL$,|D$D$
!A;}i AhtI
!A 
!A;s@X;r!AL$;|

!AL$D$3~IMt4t.uQBAt֋ AUHD$FG;|-BA3ۋ Aڍ4ڃuTFu
HPՋt*WBAt%>uF@uFF@FFC|!APBA_^][HÐSUVt$t$WwvAA3҃wB;5Aw(PmЃt3̓u-
 AVjQӋЅuAtVu_^][_^][Ð1AVW3;~QS!At7XtPtG|
!AR!A1AF;|[_^ÐjhjAA Au"u APAA3øÐ@UVWu@ Ah  jPAA+=,BAjh h@j׋jhhVׅ@u(@u
@@@u'@@E@
@M-@U*@MEuMU33҃J#J@Qy=|@3E;s(VNU;rߋ_^]hjV(BA@t AUjPAA_^3]ÐVt$hjFP(BA95Au	N
A@t VVjVQ APAA^@^ÐSUVW=@3퍷 ?>uGGh@hP(BAt-AJAGt;vwD$EHD$t
}׋t.zu(J 9u@=|=u	R;=@tD$B_^][ÐL$@;Hv;Hr=@t:u3сr#T$T$%+ȉD3ÐD$L$V3+HtDL$0@uA@ Au
j^ÐQ
AS\$UVWL$Ay +;s.;|9_vSPVucL$_;rҋiyq;s.;|9^vSPWuAL$^;rҋ	A;ȉL$t7[L$
A+Ӊy_^][YËL$
A+Ӊq_^][Yý@9MtEum@EuD$+3;u}PF;tjhPWD$ ,BA;T$D$3Ʌ~2GPPƀANuՋT$ -A;s9t;r;#E_U
+ˉ
G+ÍLG_^][Yt5HYTA+ӁQP+ӉP_^][Y_^]3[YÐT$SUVW|$G;‰L$r:;s7G+‰7GWGЍA+_^][8t;Ë\$suu<~Fu@A8t;s9l$;u	O+;L$%,;r;s	+ʉOyOko;s~;squ#~Fu@A8t;s+;rL%;t$r3_^][Í;s	+ʉO	/GF+_^][_^]3[ÐL$SUl$VWy+׋|$\$ 3L3ҊL$;v+AƉ_^][sp;;wc>;s:uB;r;uNE;w4;v0;sM3u	T@tE
EEED$+Ή_^][ÐD$L$ȋL$u	D$S؋D$d$؋D$[̋D$uË
LAT$Q
PAPRPD$PjQ&,uÃÐSAUVWtc-0BAjjjjjPjjՋt>Vt/jjVWjPjjՅtjW.Cu_^][Ã_^][_^]3[ÐSUVt$WFn
@3ۨt^N$FF^$Fu&@t@u
U1u	V 1FtlF>N+PI;N~WPUV؊D$ StՋ Ax@@ tjSU6VD$L$WQU;tF F_^][ËD$%_^][ _F^][ÐLSUVW$d33L$Gۈ\$@$d(t$(t$(L$T$}3^$=~f=}_+ AD$D$P*$AV&
(AD$T$+RD$*F ^V*Vm&t+(A
 A+<D$҉}щD$+D$L$ыNѹ<‰D$҉V}щVD$+D$L$ыNѹ‰D$҉V}щVD$+D$*l$Ћ…D$~,NFNVT$‰FD$ȋƉN^}MNDFVT$…FFlFFHFF^ËD$NȉN^Ð$S\$,lUVFW|$tf8uf8u+j@jjjUVjj0BAt>W؃t/jjWSUVjj0BAuS3VPBA_^][VPBA3_^][ÃuhuՋ؅t\ÄtH@uH@u+@VuSLBA3_^][Ë΋SLBA_^][_^]3[ÐD$SUVWPLA;l$(u
3_^][3;uh3_^][3ҸpA9(0B=`ArL$QU\BA@3HA󫪃|$vqD$t7T$
t-3B;wIAIA@;vBu͸IAIA@=rU-LARPA5LA5PA33XA\A`A_^][95dAtq3_^][Ã_^][ù@3HAR3AEt0Nt)3;whAIA@;vFuGrD$(PLAtAxAPAtA
XA@\A_^`A]3[ÐD$dAudA%dBAudA%`BAuxAdAÐD$\w'3Ɋ~@$~@øøø3}~@~@~@~@~@W@3HA3_LAPAXA\A`AÐj)ÐUSVWUjjh@uX']_^[]ËL$AtD$T$SVWD$Pjh @d5d%D$ Xpt.;t$$t(4vL$H|uhD@Td_^[3d
y @uQR9QuSQ`A
SQ`AMKCkY[VC20XC00USVWU]E@EEEECs{tav|tEVUkT]^]t3x<{SkVSvjDaCT{v4롸UkjS]]_^[]UL$)APAPy]At
u.=t@u%hhAthÐL$pASUVW3;tE=Ar;pAANu
=t@=o$hPjHBAu@$f$3$уt
BF;|;r_^][YáhAuD$P	_^][YËT$xAL$QjjjjRh P0BAtL$uH_^][YA*_^][YÐT$Vt$‹΅tf8tIut
f8u+@^Ë^Ðf!AS$U3V;W>Ë AD"jUSg|$jUSL$+3|$hS}PD$PS腠t+~Ճ=Au
A
WS|$jWS_^][}?jQSStPAAMuA
AAAjWS^_^][A	_^][ÐD$
!A;Vs`ȃ ALTtDt$%u@uɀ
%^A^A	^Ð%hBA̋D$SVt$%WV΀:uN\t/uYt
u	ҿu@@Ѓj.VtKhP@V6t6hH@V$t$h@@Vth8@Vu@8_^[Ð`SU$lVWh\@UDtAA_^][`ÊE3<:u:E:t"8]uAA_^][`PU`L$,D$ QUAAhX@Uh$pUR;ti3It
VtKVAAv?jSSSjjhD$H\$d\$h\$t$FFF AA_^][`ÍD$$L$@PQAAT$D$$RPAAL$T$D$jQL$%RT$PD$ Q%RP>$L$T;ˉFu9\$Au|L$ɋ
AttK
t\_^][YÅt3_^][YÅu"jwAAu"jQAAL$+UQ#;SunMonTueWedThuFriSatJanFebMarAprMayJunJulAugSepOctNovDecTZGetLastActivePopupGetActiveWindowMessageBoxAuser32.dll.com.bat.cmd.exe./\?*8@p9@Status: %s
Content-Type: text/html
Pragma: nocache
Expires: Thu, 01 Dec 1994 16:00:00 GMT



Temporarily Unavailable



    

    
  
  
    
  !
  
    
      		
  
    
  Temporarily Unavailable
  
    
  The resource you requested is temporarily unavailable - please try again later.
  
    		

    

    
%s

$Id: pcgi-wrapper.c,v 1.4 1998/08/05 15:25:46 jbauer Exp $No pcgi info file given!500 Server ErrorError parsing pcgi info file500 Server ErrorError allocating env500 Server Error%010ld(123) bad environment headerError allocating env500 Server ErrorCONTENT_LENGTHError allocating stdin500 Server Error%010ld(124) bad stdin headerError allocating stdin500 Server ErrorError reading stdin500 Server ErrorError allocating stdin500 Server Error%010ld(101) failure during startFailed to start resource500 Server Error(102) failure during connect503 Service Unavailable(103) unable to verify if process is runningpcgiVerifyProc failed503 Service Unavailable(104) environment sendError sending env500 Server Error(105) stdin sendError sending stdin500 Server Error(106) stdout read header503 Service Unavailable(107) bad stdout strlen%s (%d)503 Service Unavailablet[0] = %dunexpected out-of-bound data in stdin500 Server Error(108) stdout read bodyError receiving stdout500 Server Error(109 stderr read headerError receiving stderr size500 Server Error(110) bad stderr strlen%s (%d)Error receiving stderr size500 Server Errort[0] = %dunexpected out-of-bound data in stderr500 Server Error(111) stderr read bodyError receiving stderr500 Server Error(112) Error returning stdout to server(112) error returning stdout to server500 Server Error(113) error returning stderr to serverError returning stderr500 Server Errorpcgi-wrapper-version 2.0a4ab%s  pcgi-wrapper: %s  %s
rpcgiMutexpython%s %sStatus: %s
Content-Type: text/html
Pragma: nocache
Expires: Thu, 01 Dec 1994 16:00:00 GMT



Temporarily Unavailable



    

    
  
  
    
  !
  
    
      		
  
    
  Temporarily Unavailable
  
    
  The resource you requested is temporarily unavailable - please try again later.
  
    		

    

    
%s

unknown value for PCGI_CLOSE_FDS: %s:pcgi_publisher.pypcgi_publisher.pycpcgi_publisher.pyopcgi_publisherpcgi_publisher.py%s%c%sSOFTWARE_SOFTWARE_SOFTWARE_NAMESOFTWARE_HOMESOFTWARE_EXEPYTHONPATHPCGI_PCGI_PCGI_CLOSE_FDSPCGI_DISPLAY_ERRORSPCGI_ERROR_LOGPCGI_EXEPCGI_HOSTPCGI_INSERT_PATHPCGI_WORKING_DIRpcgiEnvironmentToResourceAssignment() length exceeds MAXPATHPCGI_MODULE_PATHPCGI_NAMEPCGI_PID_FILEPCGI_PORTPCGI_PUBLISHERPCGI_SOCKET_FILEpcgiEnvironmentToResourceAssignment() errorrunable to open info file: %sPCGI_INFO_FILEpcgiPutEnvironment() failedSOFTWARE_NAMESOFTWARE_HOMESOFTWARE_EXEPCGI_CLOSE_FDSPCGI_DISPLAY_ERRORSPCGI_ERROR_LOGPCGI_EXEPCGI_HOSTPCGI_INSERT_PATHPCGI_MODULE_PATHPCGI_NAMEPCGI_PID_FILEPCGI_PORTPCGI_PUBLISHERPCGI_SOCKET_FILEPCGI_WORKING_DIRPYTHONPATHpcgi info file mixes old and new style directives (new style uses name=value)PCGI_SOCKET_FILEPCGI_PID_FILEPCGI_INSERT_PATHpcgiPutNameValueInEnvironment() errorPCGI_MODULE_PATHpcgiPutNameValueInEnvironment() erroroldStyleLineCount exceeds maximumunable to determine the publisher locationmissing publisher: %spublisher read error: %s/usr/local/bin/python1.4SOFTWARE_EXE%s/var/%s.pidPCGI_PID_FILE%s/var/%s.socPCGI_SOCKET_FILEmissing parameter: PCGI_SOCKET_FILEmissing parameter: PCGI_PID_FILE%s=%s127.0.0.1!A!AZ@Z@         (((((                  H .:@
@@@@@8@ @@@@@@@@l@X@4@ @@@@@@@@@@@`@L@(@@@@@@@@@@@|@@h@T@8@$@@@+@@
		


!
5A
CPR
S
WYl
m pr	

	
)


`y!@~ڣ @ڣ AϢ[@~QQ^ _j21~ (@@	@
@@P@,@@@@h@0@@x@y@z@@@0@0@0@0@0@0@pPSTPDT0ApA;Zx0Nm:Yw/MlDABB<@hFAjDxD8s8s8s8sH8s",
                   p64(oid+1),serial,p64(old),p64(pos),
                   0,p64(len(data))
                   )
              )

        write(data)

    def tpc_begin(self, tname, user, desc):
        del self._tindex[:]   # Just to be sure!
        self._tfile.seek(0)

        t=string.atof(tname)
        y,m,d,h,mi=time.gmtime(t)[:5]
        s=t%60
        self._serial=struct.pack(
            ">II",
            (((((y-1900)*12)+m-1)*31+d-1)*24+h)*60+mi,
            long(s * (1L << 32) / 60)
            )

        # Ugh, we have to record the transaction header length
        # so that we can get version pointers right.
        self._thl=23+len(user)+len(desc)

        # And we have to save the data used to compute the
        # header length. It's unlikely that this stuff would
        # change, but if it did, it would be a disaster.
        self._ud=user, desc

    def tpc_finish(self):
        file=self._file
        write=file.write
        tfile=self._tfile
        dlen=tfile.tell()
        tfile.seek(0)
        id=self._serial
        user, desc = self._ud
        self._ud=None
                        
        tlen=self._thl
        pos=self._pos
        tl=tlen+dlen
        stl=p64(tl)
        write(pack(
            ">8s" "8s" "c"  "H"        "H"        "H"
            ,id, stl, ' ', len(user), len(desc), 0,
            ))
        if user: write(user)
        if desc: write(desc)
            
        cp(tfile, file, dlen)
                
        write(stl)
        self._pos=pos+tl+8

        tindex=self._tindex
        index=self._index
        for oid, pos in tindex: index[oid]=pos
        del tindex[:]


class ZEXP:
    """Zope Export format 'report' writer
    """
    def __init__(self, fname, file):
        file.seek(0,2)
        self._input_size=file.tell()
        file.seek(0)
        self.__name__=fname
        self._file=open(fname,'w+b')
        self._file.write('ZEXP')

        self._pos=4
        self._progress=None
        

    def rpt(self, pos, oid, start, tname, user, t, p, first, newtrans):
        write=self._file.write
        if pos is None:
            write('\377'*16) # end marker
            sys.stderr.write(' %% 100     \n')
            return
        else:
            progress=' %% %.1f \r' % (pos*100.0/self._input_size)
            if progress != self._progress:
                sys.stderr.write(progress)
                self._progress=progress

        data=fixpickle(p, oid)
        l=len(data)
        write(p64(oid+1)+p64(l))
        write(data)
        self._pos=self._pos+l+16


t32 = 1L << 32

def p64(v, pack=struct.pack):
    if v < t32: h=0
    else:
        h=v/t32
        v=v%t32
    return pack(">II", h, v)

def cp(f1, f2, l):
    read=f1.read
    write=f2.write
    n=8192
    
    while l > 0:
        if n > l: n=l
        d=read(n)
        write(d)
        l = l - len(d)

    
class Ghost: pass

class Global:
    __safe_for_unpickling__=1
    
    def __init__(self, m, n):
        self._module, self._name = m, n

    def __call__(self, *args):
        return Inst(self, args)

    def __basicnew__(self):
        return Inst(self, None)

def _global(m, n):
    if m[:8]=='BoboPOS.':
        if m=='BoboPOS.PickleDictionary' and n=='Root':
            m='ZODB.conversionhack'
            n='hack'
        elif m=='BoboPOS.PersistentMapping': m='Persistence'
        elif m=='BoboPOS.cPickleJar' and n=='ec':
            m=n='ExtensionClass'
        else:
            raise 'Unexpected BoboPOS class', (m, n)
    elif m=='PersistentMapping': m='Persistence'

    return Global(m,n)
    

class Inst:

    _state=None
    
    def __init__(self, c, args):
        self._cls=c
        self._args=args

    def __setstate__(self, state): self._state=state


from pickle import INST, GLOBAL, MARK, BUILD, OBJ, REDUCE

InstanceType=type(Ghost())

class Unpickler(pickle.Unpickler):

    dispatch={}
    dispatch.update(pickle.Unpickler.dispatch)

    def load_inst(self):
        k = self.marker()
        args = tuple(self.stack[k+1:])
        del self.stack[k:]
        module = self.readline()[:-1]
        name = self.readline()[:-1]
        klass = _global(module, name)
        value=Inst(klass, args)
        self.append(value)
            
    dispatch[INST] = load_inst

    def load_global(self):
        module = self.readline()[:-1]
        name = self.readline()[:-1]
        klass = _global(module, name)
        self.append(klass)
    dispatch[GLOBAL] = load_global

    def persistent_load(self, oid,
                        TupleType=type(()), Ghost=Ghost, p64=p64):
        "Remap object ids from ZODB 2 stype to ZODB 3 style"

        if type(oid) is TupleType:
            oid, klass = oid
            oid = p64(oid+1), klass
        else:
            oid = p64(oid+1)
            
        Ghost=Ghost()
        Ghost.oid=oid
        return Ghost


class Pickler(pickle.Pickler):

    dispatch={}
    dispatch.update(pickle.Pickler.dispatch)

    def persistent_id(self, object, Ghost=Ghost):
        if hasattr(object, '__class__') and object.__class__ is Ghost:
            return object.oid

    def save_inst(self, object):
        d = id(object)
        cls = object.__class__

        memo  = self.memo
        write = self.write
        save  = self.save

        if cls is Global:
            memo_len = len(memo)
            write(GLOBAL + object._module + '\n' + object._name + '\n' +
                  self.put(memo_len))
            memo[d] = (memo_len, object)
            return

        self.save_inst(object._cls)
        save(object._args)

        memo_len = len(memo)
        write(REDUCE + self.put(memo_len))

        memo[d] = (memo_len, object)

        stuff=object._state
        save(stuff)
        write(BUILD)

    dispatch[InstanceType] = save_inst

    def save_global(self, object, name = None):
        write = self.write
        memo = self.memo

        if (name is None):
            name = object._name

        module=object._module

        memo_len = len(memo)
        write(GLOBAL + module + '\n' + name + '\n' +
            self.put(memo_len))
        memo[id(object)] = (memo_len, object)

    dispatch[type(Ghost)] = save_global
    
    
def fixpickle(p, oid):
    
    pfile=StringIO(p)
    unpickler=Unpickler(pfile)

    newp=StringIO()
    pickler=Pickler(newp,1)

    pickler.dump(unpickler.load())
    state=unpickler.load()
    if oid==-1: state={'_container': state}
    pickler.dump(state)
    p=newp.getvalue()

    return p
Zope-2.0.1-ZEO-nonbin/utilities/fixbbbts.py100644   1007   1403        4447  6704505574  20521 0ustar  petrillipetrilliimport sys

__doc__="""Fix BoboPOS time stamps

If a system has a problem with it's clock setting, it may cause
database records to be written with time stamps in the future.  This
causes problems when the clock is fixed or when the data are moved to
a system that doesn't have a broken clock.

The database has a requirement that records should be chronologically
ordered and that times not be in the future.

This copies a database, restamping the times as it goes.

%s [options] file1 file2

Copy file1 to file2 restamping the records.

  options:

    -o offset

       Records that are later offset seconds in the past
       are moved back to offset seconds in the past plus
       some small offset chosen so that times are not the same and
       are chronological.

""" % sys.argv[0]

InvalidFormat='Format Error'
Corrupted='Data Corruption'

def main():
    import getopt, string, struct, time
    file__version__=3.0
    packed_version='SDBMV'+struct.pack(">f",file__version__)

    try:
        opts, args = getopt.getopt(sys.argv[1:], 'o:')
        file1, file2 = args
        offset=86400
        for o, v in opts:
            if o=='-o':
                offset=string.atoi(v)
    except:
        print __doc__
        print "%s: %s" % sys.exc_info()[:2]

    start=time.time()-offset
    next=start+0.001
    input=open(file1,'rb')
    read=input.read
    output=open(file2,'wb')
    write=output.write
    pack=struct.pack
    unpack=struct.unpack
    
    h=read(len(packed_version))
    if h != packed_version:
        raise InvalidFormat, 'This is not a BoboPOS file'
    write(h)

    pos=len(h)

    while 1:
        h=read(24)
        if not h: break
        if len(h) < 24: raise Corrupted, pos
        oid, prev, t, tlen, plen = unpack(">iidii", h)
        if start is None or t > start:
            t=next
            next=next+0.001
            start=None
        if plen > tlen or tlen < 28: raise Corrupted, pos
        
        write(pack(">iidii", oid, prev, t, tlen, plen))
        l=tlen-28
        s=8196
        while l > 0:
            if s > l: s=l
            d=read(s)
            if not d: raise Corrupted, pos
            write(d)
            l=l-len(d)
        d=read(4)
        if d != h[16:20]: raise Corrupted, pos
        write(d)
        pos=pos+tlen

if __name__=='__main__': main()
            
Zope-2.0.1-ZEO-nonbin/utilities/bbb.py100644   1007   1403       30520  6756013446  17451 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################
"""Read and (re-)format BoboPOS 2 database files
"""

import struct, string, sys, time, os

try: from cStringIO import StringIO
except: from StringIO import StringIO

ppml=None

file__version__=3.0
packed_version='SDBMV'+struct.pack(">f",file__version__)

def error(message, fatal=0, exc=0):
    if exc:
        sys.stderr.write('%s: %s' % (sys.exc_info()[0], sys.exc_info()[1]))
    sys.stderr.write("\n%s\n" % message)
    if fatal: sys.exit(fatal)

def _read_and_report(file, rpt=None, fromEnd=0, both=0, n=99999999, show=0,
                     forgive=0, export=0):
    """\
    Read a file's index up to the given time.
    """
    first=1
    seek=file.seek
    read=file.read
    unpack=struct.unpack
    split=string.split
    join=string.join
    find=string.find
    seek(0,2)
    file_size=file.tell()
    if not export:
        seek(0)
        h=read(len(packed_version))
        if h != packed_version:
            if h[:4]=='FS21':
                error("The input file is a ZODB File Storage\n"
                      "This script only works with ZODB 2 (BoboPOS) "
                      "data or export files."
                      ,1)
            else:
                error("The input file is not a ZODB 2 database file.\n"
                      "This script only works with ZODB 2 (BoboPOS) "
                      "data or export files."
                      ,1)
            
    gmtime=time.gmtime

    if fromEnd: pos=file_size
    else:       pos=newpos=(not export) and len(packed_version)
     
    tlast=0
    err=0
    tnamelast=None
    while 1:
        if fromEnd:
            seek(pos-4)
            l=unpack(">i", read(4))[0]
            if l==0:
                b=pos
                p=pos-4
                while l==0:
                    p=p-4
                    seek(p)
                    l=unpack(">i", read(4))[0]

                pos=p+4
                error("nulls skipped from %s to %s" % (pos,b)) 
            p=pos-l
            if p < 0:
                error('Corrupted data before %s' % pos)
                if show > 0:
                    p=pos-show
                    if p < 0: p=0
                    seek(p)
                    p=read(pos-p)
                else:
                    p=''
                error(p,1)
            pos=p
        else:
            pos=newpos

        seek(pos)
        h=read(24) # 24=header_size
        if not h: break
        if len(h) !=  24: break
        oid,prev,start,tlen,plen=unpack(">iidii",h)
        
        if prev < 0 or (prev and (prev >= pos)):
            error('Bad previous record pointer (%s) at %s' % (prev, pos))
            if show > 0: error(read(show))
            if not forgive:
                err=1
                break

        if start < tlast:
            error('record time stamps are not chronological at %s' % pos)
            if show > 0: error(read(show))
            if not forgive:
                err=1
                break

        if plen > tlen or plen < 0 or oid < -999:
            error('Corrupted data record at %s' % pos)
            if show > 0: error(read(show))
            err=1
            break


        newpos=pos+tlen
        if newpos > file_size:
            error('Truncated data record at %s' % pos)
            if show > 0: error(read(show))
            if not forgive:
                err=1
                break

        seek(newpos-4)
        if read(4) != h[16:20]:
            __traceback_info__=pos, oid,prev,start,tlen,plen
            error('Corrupted data record at %s' % pos)
            if show > 0:
                seek(pos+24)
                error(read(show))
            err=1
            break

        tlast=start-100

        if rpt is None: continue
        n=n-1
        if n < 1: break

        seek(pos+24)
        if plen > 0:
            p=read(plen)
            if p[-1:] != '.': 
                error('Corrupted pickle at %s %s %s' % (pos,plen,len(p)))
                if show > 0:
                    seek(pos+24)
                    error(read(show))
                err=1
                break

        else: p=''
        t=split(read(tlen-plen-28),'\t')
        tname, user = (t+[''])[:2]
        t=join(t[2:],'\t')
        start,f=divmod(start,1)
        y,m,d,h,mn,s=gmtime(start)[:6]
        s=s+f
        start="%.4d-%.2d-%.2d %.2d:%.2d:%.3f" % (y,m,d,h,mn,s)
        rpt(pos,oid,start,tname,user,t,p,first,tname!=tnamelast)
        first=0
        tnamelast=tname

    if err and both and not fromEnd:
        _read_and_report(file, rpt, 1, 0, n, show)

    rpt(None, None, None, None, None, None, None, None, None)


def none(*ignored): pass

def positions(pos, *ignored): 
    if pos is not None: sys.stdout.write("%s\n" % pos)

def oids(pos, oid, *ignored): 
    if pos is not None: sys.stdout.write("%s\n" % oid)

def tab_delimited(*args):
    sys.stdout.write("%s\n" % string.join(args[:6],'\t'))

def undo_log(pos, oid, start, tname, user, t, p, first, newtrans):
    if not newtrans: return
    
    sys.stdout.write("%s:\t%s\t%s\t%s\n" % (pos, start, user, t))

        
reports={
    'none': (none,
             ('Read a database file checking for errors',
              'but producing no output')
             ),
    'oids': (oids,
             ('Read the database and output object ids',)),
    'positions': (positions,
                  ('Read the database and output record positions',)),
    'tab_delimited': (tab_delimited,
                      ('Output record meta-data in tab-delimited format',)),

    'undo': (undo_log,
             (
                 'Output a transaction summary that shows the position of',
                 'each transaction.  This is useful for undoing ',
                 'transactions from the OS command line when',
                 'some programming error has caused objects to get to',
                 'a state where Zope can\'t start up.',
                 '',
                 'Eventually, there will be an undo utility for undoing',
                 'individual transactions.  For now, you can simply',
                 'truncate the file at the position of a problem',
                 'transaction to return the database to the state it',
                 'was in before the transaction',
                 )),
    }

def main(argv):
    import getopt

    items=reports.items()
    items.sort()
    
    usage="""Usage: python %s [options] filename

    where filename is the name of the database file.

    options:

       -r report

          Specify an output report.

          The valid reports are:\n\n\t\t%s

       -e

          Read the file from back to front

       -l n

          Show only n records

       -b

          If an error is encountered while reading from front,
          ret reading from the back.

       -s n

          If a corrupted data record is found, show the first n
          bytes of the corrupted record.

       -f filename

          Convert to ZODB 3 File-Storage format

       -p path

          Add a directory to the Python path.

       -x

          The input file is a ZODB 2 export file.

          
    """ % (sys.argv[0],
           string.join(map(
               lambda i:
               ("%s --\n\t\t\t%s" % (i[0], string.join(i[1][1],'\n\t\t\t'))),
               items),
               ',\n\n\t\t'))

    sys.path.append(os.path.split(sys.argv[0])[0])

    try:
        opts, args = getopt.getopt(argv,'r:ebl:s:f:p:x')
        filename,=args
    except: error(usage,1,1)

    try: file=open(filename,'rb')
    except: error('Coud not open %s' % filename,1,1)
    
    rpt=none
    fromEnd=0
    both=0
    n=99999999
    show=0
    export=0
    convert=0
    for o, v in opts:
        o=o[1:]
        if o=='r':
            try: rpt=reports[v][0]
            except: error('Invalid report: %s' % v, 1)
        elif o=='l':
            try: n=string.atoi(v)
            except: error('The number of records, %s, shuld ne an integer'
                          % v, 1)
        elif o=='s':
            try: show=string.atoi(v)
            except: error('The number of bytes, %s, shuld ne an integer'
                          % v, 1)
        elif o=='e': fromEnd=1
        elif o=='x': export=1
        elif o=='f': convert=1
        elif o=='b': both=1
        elif o=='p':
            if v=='-':
                v=os.path.join(
                    os.path.split(sys.argv[0])[0],
                    '..','lib','python')
            sys.path.insert(0,v)
            print sys.path
        else: error('Unrecognized option: -%s' % o, 1)

    if convert:
        import FS
        if export:
            rpt=FS.ZEXP(v, file).rpt
        else:
            rpt=FS.FS(v, file).rpt

    _read_and_report(file, rpt, fromEnd, both, n, show,
                     forgive=1, export=export)

if __name__=='__main__': main(sys.argv[1:])
Zope-2.0.1-ZEO-nonbin/utilities/load_site.py100644   1007   1403       15365  6734252522  20675 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################
"""Load a Zope site from a collection of files or directories
"""

usage=""" [options] url file .....

    where options are:

      -p path

         Path to ZPublisher

      -u user:password

         Credentials

      -v

         Run in verbose mode.

      -9

         Use *old* zope method names.
"""

import sys, getopt, os, string
ServerError=''
verbose=0
old=0

def main():
    user, password = 'superuser', '123'
    opts, args = getopt.getopt(sys.argv[1:], 'p:u:v9')
    global verbose
    global old
    for o, v in opts:
        if o=='-p':
            d, f = os.path.split(v)
            if f=='ZPublisher': sys.path.insert(0,d)
            else: sys.path.insert(0,v)
        elif o=='-u':
            v = string.split(v,':')
            user, password = v[0], string.join(v[1:],':')
        elif o=='-v': verbose=1
        elif o=='-9': old=1

    if not args:
        print sys.argv[0]+usage
        sys.exit(1)

    url=args[0]
    files=args[1:]

    import ZPublisher.Client
    global ServerError
    ServerError=ZPublisher.Client.ServerError
    object=ZPublisher.Client.Object(url, username=user, password=password)

    for f in files: upload_file(object, f)

def call(f, *args, **kw):
    # Call a function ignoring redirect bci errors.
    try: apply(f,args, kw)
    except ServerError, v:
        if str(v)[:1] != '3':
            raise sys.exc_info()[0], sys.exc_info()[1], sys.exc_info()[2]

def upload_file(object, f):
    if os.path.isdir(f): return upload_dir(object, f)
    dir, name = os.path.split(f)
    root, ext = os.path.splitext(name)
    if ext in ('file', 'dir'): ext=''
    else:
        ext=string.lower(ext)
        if ext and ext[0] in '.': ext=ext[1:]
    if ext and globals().has_key('upload_'+ext):
        if verbose: print 'upload_'+ext, f
        return globals()['upload_'+ext](object, f)

    if verbose: print 'upload_file', f, ext
    call(object.manage_addFile, id=name, file=open(f))

def upload_dir(object, f):
    if verbose: print 'upload_dir', f
    dir, name = os.path.split(f)
    call(object.manage_addFolder, id=name)
    object=object.__class__(object.url+'/'+name,
                            username=object.username,
                            password=object.password)
    for n in os.listdir(f):
        upload_file(object, os.path.join(f,n))

def upload_html(object, f):
    dir, name = os.path.split(f)
    f=open(f)
    # There is a Document bugs that causes file uploads to fail.
    # Waaa.  This will be fixed in 1.10.2.
    f=f.read()
    if old:
        call(object.manage_addDocument, id=name, file=f)
    else:
        call(object.manage_addDTMLDocument, id=name, file=f)
    
upload_htm=upload_html

def upload_dtml(object, f):
    dir, name = os.path.split(f)
    if old:
        call(object.manage_addDocument, id=name, file=open(f))
    else:
        call(object.manage_addDTMLDocument, id=name, file=f)
        

def upload_gif(object, f):
    dir, name = os.path.split(f)
    call(object.manage_addImage, id=name, file=open(f))

upload_jpg=upload_gif
upload_png=upload_gif

if __name__=='__main__': main()


Zope-2.0.1-ZEO-nonbin/var/ 40755   1007   1403           0  6772126761  15015 5ustar  petrillipetrilliZope-2.0.1-ZEO-nonbin/var/.cvsignore100644   1007   1403         124  6676777720  17101 0ustar  petrillipetrilliserve.log
gadfly
Data.bbb
Data.bbb.index
Data.bbb.trans
Data.bbb.trans.index
pcgi.*
Zope-2.0.1-ZEO-nonbin/var/Data.fs.in100644   1007   1403      225716  6734263726  17000 0ustar  petrillipetrilliFS21)*ϱ( )*ϱ(y(cApp.ApplicationManager
ApplicationManager
qNtq.}qUProductsq(Uq(UApp.ProductqU
ProductFolderqtqtqQs.)*ϱ({(cAccessControl.User
UserFolder
qNtq.}qUdataq(U	q(UBoboPOS.PersistentMappingqUPersistentMappingqtqtqQs.	)*ϱ(=(cPersistence
PersistentMapping
qNtq.}qU
_containerq}qs.)*ϱ((cOFS.Document
Document
qNtq.}q(UtitleqUStandard Html HeaderqU__name__qUstandard_html_headerqUglobalsq}qUrawq	UQ<!--#var title_or_id-->q
U_varsq}qu.)*ϵ;7 )*ϵ;(cApp.Product
Product
qNtq.}q(UiconqUp_/InstalledProduct_iconqUidqUOFSPqUmanage_distributionqNUmanage_optionsq(}q	(Ulabelq
UContentsqUtargetqUmanage_mainq
Uactionqh
u}q(h
U
Propertiesqhh
hUmanage_propertiesFormqu}q(h
USecurityqhh
hU
manage_accessqu}q(h
UUndoqhh
hUmanage_UndoFormqu}q(h
UFindqhh
hUmanage_findFramequtqUversionqUqUtitleqUInstalled product OFSPqU
_distributionq NUthisIsAnInstalledProductq!Ku.)*ϵ;(cApp.Product
Product
qNtq.}q(UiconqUp_/InstalledProduct_iconqUidqUExternalMethodqUmanage_distributionqNUmanage_optionsq(}q	(Ulabelq
UContentsqUtargetqUmanage_mainq
Uactionqh
u}q(h
U
Propertiesqhh
hUmanage_propertiesFormqu}q(h
USecurityqhh
hU
manage_accessqu}q(h
UUndoqhh
hUmanage_UndoFormqu}q(h
UFindqhh
hUmanage_findFramequtqUversionqUqUtitleqU Installed product ExternalMethodqU
_distributionq NUthisIsAnInstalledProductq!Ku.)*ϵ;(cApp.Product
Product
qNtq.}q(UiconqUp_/InstalledProduct_iconqUidqU	ZGadflyDAqUmanage_distributionqNUmanage_optionsq(}q	(Ulabelq
UContentsqUtargetqUmanage_mainq
Uactionqh
u}q(h
U
Propertiesqhh
hUmanage_propertiesFormqu}q(h
USecurityqhh
hU
manage_accessqu}q(h
UUndoqhh
hUmanage_UndoFormqu}q(h
UFindqhh
hUmanage_findFramequtqUversionqUqUtitleqUInstalled product ZGadflyDAqU
_distributionq NUthisIsAnInstalledProductq!Ku.
)*ϵ;(cApp.Product
Product
qNtq.}q(UiconqUp_/InstalledProduct_iconqUidqUZSQLMethodsqUmanage_distributionqNUmanage_optionsq(}q	(Ulabelq
UContentsqUtargetqUmanage_mainq
Uactionqh
u}q(h
U
Propertiesqhh
hUmanage_propertiesFormqu}q(h
USecurityqhh
hU
manage_accessqu}q(h
UUndoqhh
hUmanage_UndoFormqu}q(h
UFindqhh
hUmanage_findFramequtqUversionqUqUtitleqUInstalled product ZSQLMethodsqU
_distributionq NUthisIsAnInstalledProductq!Ku.7)*o;  amos/manage_importHack)*o;(cOFS.Folder
Folder
qNtq.}q(Ustandard_html_headerq(Uq(UOFS.DocumentqUDocumentqtqtqQU
index_htmlq	(Uq
(hUDocumentqtqtq
QUidqU
QuickStartqU_objectsq(}q(U	meta_typeqUDocumentqUidqh	u}q(hUFolderqhUOutlinequ}q(U	meta_typeqUDocumentqUidqhu}q(hhhUstandard_html_footerqutqUtitleqUZope QuickStart Outlineq h(Uq!(U
OFS.Folderq"UFolderq#tq$tq%Qh(Uq&(hUDocumentq'tq(tq)Qu.)*o;|(cOFS.Document
Document
qNtq.}q(U__name__qUstandard_html_footerqUglobalsq}qUrawqUqU_varsq	}q
u.)*o;(cOFS.Folder
Folder
qNtq.}q(UidqUOutlineqU_objectsq(}q(U	meta_typeqUImageqUidq	UClosedBook.gifq
u}q(hhh	UOpenBook.gifqu}q
(hUFolderqh	UDatabasequ}q(hhh	UContentqu}q(hUDocumentqh	UdtcTemplatequ}q(hhh	U	dtContentqu}q(U	meta_typeqUFolderqUidqUApplicationsqu}q(hhhUObjectsqutqh(Uq(U	OFS.Imageq UImageq!tq"tq#Qh
(Uq$(h UImageq%tq&tq'Qh(Uq((U
OFS.Folderq)UFolderq*tq+tq,Qh(Uq-(UOFS.Documentq.UDocumentq/tq0tq1QUtitleq2Uq3h(Uq4(h)UFolderq5tq6tq7Qh(Uq8(h.UDocumentq9tq:tq;Qh(Uq<(h)UFolderq=tq>tq?Qh(Uq@(h)UFolderqAtqBtqCQu.)*o;(cOFS.Folder
Folder
qNtq.}q(U	Scriptingq(Uq(U
OFS.FolderqUFolderqtqtqQUidq	UApplicationsq
U_objectsq(}q(U	meta_typeq
UFolderqUidqhu}q(h
hhUExternalqu}q(h
hhUTabulaqu}q(h
hhU	Smartdataqu}q(h
hhULeverqutqh(U q(hUFolderqtqtqQUtitleqUApplication Developmentqh(Uq(hUFolderq tq!tq"Qh(Uq#(hUFolderq$tq%tq&Qh(Uq'(hUFolderq(tq)tq*Qu. )*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUThe Almighty LeverqU	dtContentq(U!q(UOFS.DocumentqUDocumentqtq	tq
QUidqULeverqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.!)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT
    
An exiting new development being worked on for Zope is The 
Lever.  The Lever will give Zope web application developers the 
ability to crank out and reuse their applications.  Zope 
applications run the gamut of being just folder and document objects to 
complex data driven applications with pluggable brains and external 
methods.  The lever will enable you to create such an application as a 
drop-in object.  If you use a Tabula or Aqueduct and had a few 
reports and submission forms to create a shopping cart application for 
example, it could then be levered and dropped in anywhere as a 
Shopping Cart object.

    
qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUProgramming Data with TabulaqU	dtContentq(U"q(UOFS.DocumentqUDocumentqtq	tq
QUidqUTabulaqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.")*o;-(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT
    
Zope enables "stupid" data to become smart.  Aqueduct gives smarts to 
relational data, Tabula gives it to desktop-based data (such as DBF files).  
While Aqueduct's data is external to Zope, Tabula brings its data 
inside.  Besides speedy searches and flexible reports, Tabula adds 
intelligence to its data through computed fields, hierarchies and 
acquisition, plus all the features of DTML Scripting, especially direct 
querying.

    qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUExternal MethodsqU	dtContentq(U#q(UOFS.DocumentqUDocumentqtq	tq
QUidqUExternalqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.#)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT.
    
Sometimes DTML Scripting is not enough to get the job done.  Getting into a 
full featured unrestricted language to extend the application at hand is 
what is needed.  Enter External Methods.  External Methods are written in 
Python and, like Pluggable Brains, have full access to all of the modules 
available for it.  External Methods are natural extensions for Zope 
objects and are an easy way to interact with other system resources, like 
already existing Python modules, shell scripts, COM objects, and more.  The 
possibilities are endless!

    
qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqU)Adding Object Behavior to Relational DataqU	dtContentq(U$q(UOFS.DocumentqUDocumentqtq	tq
QUidqU	SmartdataqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.$)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT|
    
With Zope and Aqueduct, you can make stupid data "smart".  Pluggable 
Brains turn flat records returned from Aqueduct Database Methods (SQL Queries) 
into intelligent objects.  These objects benifit from all the Python and 
Zope object technologies, including inheritence and acquisition, and 
have full access to the large suite of modules available in Python and 
Zope.

    qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUDTML ScriptingqU	dtContentq(U%q(UOFS.DocumentqUDocumentqtq	tq
QUidqU	ScriptingqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.%)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT
    
Zope's DTML is more than just a variable insertion and batch processing 
language.  It also exposes a powerful expression language.  While this 
expression language can be used to compute variables and text complex 
conditions on the fly, it can also be used to directly call methods on 
Zope objects.  This powerful feature, referred to as DTML 
Scripting is the first level of advanced web application development 
in Zope.  It is editable through the web, secure, and flexible enough 
for many applications.

    
qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.)*o; (cOFS.Document
Document
qNtq.}q(UrawqU

 


    
qUglobalsq}qU__name__qUdtcTemplateqU_varsq	}q
u.)*o;(cOFS.Folder
Folder
qNtq.}q(U
Integratedq(U)q(U
OFS.FolderqUFolderqtqtqQUUndoq	(U+q
(hUFolderqtqtq
QUidqUObjectsqU_objectsq(}q(U	meta_typeqUFolderqUidqhu}q(hhhUDataSharingqu}q(hhhU
Managementqu}q(hhhUNiceURLsqu}q(hhhUSecurityqu}q(hhhUSessionsqu}q(hhhh	utq h(U'q!(hUFolderq"tq#tq$Qh(U(q%(hUFolderq&tq'tq(Qh(U&q)(hUFolderq*tq+tq,QUtitleq-UWeb to Objectsq.h(U*q/(hUFolderq0tq1tq2Qh(U,q3(hUFolderq4tq5tq6Qu.,)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUSessionsqU	dtContentq(U-q(UOFS.DocumentqUDocumentqtq	tq
QUidqUSessionsqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.-)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqTA
    
Sessions are a form of a long running transaction in Zope. 
Sessions allow the site to be worked on live without 
affecting its normal use.  Only users who have joined a session to work on 
the site can see the changes being made.  Everyone else won't see the 
changes until the session is saved.  Sessions can span minutes or weeks, 
depending on the job.

    


    
There are numerous advantages to Sessions over some other means of site 
editing.  The main advantage is the fact that you are modifying a 
live site, instead of working on a mirror copy of the site 
only to discover minor conflicts when you move it onto the live site. 
Sessions let you catch and fix errors that often happen when doing both 
major and minor overhauls such as broken links before your users do.

    

qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.+)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUUndoqU	dtContentq(U.q(UOFS.DocumentqUDocumentqtq	tq
QUidqUUndoqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu..)*o;z(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT
    
One of the main features of Zope's object database is its ability to 
Undo actions.  This is not your typical undo 
found in text editors, spreadsheets, and other desktop applications.  Made 
a change in some DTML that you didn't like?  Wish you hadn't deleted those 
three images?  Realize you uploaded the wrong file object?  Clicking on the 
Undo tag (found on most Zope folderish 
objects, along with a few others) can help you.  Since Zope is based 
on an object oriented database that stamps times on transactions (changes) 
to the system, Undo is a robust and solid benefit of this technology.

    


    
It also works with sessions.  While you can discard changes made in a 
session instead of saving them, you might do some work in a session and 
make it public only to find out it's not as good as you thought.  Since the 
session is saved as a single transaction, you can undo a massive amount of 
changes in one click.  Be careful though - there is no redo!

    

qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.*)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUManaged Through the WebqU	dtContentq(U/q(UOFS.DocumentqUDocumentqtq	tq
QUidqU
ManagementqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu./)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT
    
Another significant feature of Zope that comes from its web-to-objects 
philosophy is its entirely through the web management.  A 
Zope is like its own little file system (but smarter, see 
Integrated object database above), and a web browser is 
its navigation and management interface.  Combined with Zope's 
security options, this makes maintainence an anywhere-in-the-world task. 
Want to hand management of an area of the site off to someone else?  Add a 
user folder to the folder you want to give them access to, make a user 
object with a name and a password, and tell them the URL to go to.  If they 
have a browser that supports frames, they now have access.  No setting up 
FTP and Telnet acounts.  No requiring them to download and learn another 
client program.  No having to deny users access because there's no client 
support for their particular operating system.

    


    
Zope's management interface is intuitive and simple.  The left frame 
contains a tree of folderish objects (objects that can contain other 
Zope objects) for navigating to different points.  The right frame is 
the workspace for the objects which uses a tabbed-style interface (a row of 
links across the top) for switching between different views and management 
options for an object.  And it's fast loading due to its use of simple 
non-flashy images (which are less bulky and distracting) and light frame 
and table use.  It uses standard HTML as much as possible to ensure the 
widest browser support without sacrificing usability.

If you haven't done so already, check it out!


    

qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.))*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUIntegrated Object DatabaseqU	dtContentq(U0q(UOFS.DocumentqUDocumentqtq	tq
QUidqU
IntegratedqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.0)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT7
    At the heart of Zope is an integrated object database.
This database mirrors the URL used to access objects, and behaves like a 
file system.  The neat trick, however, is that these are 
intelligent objects, not dumb files.  Information can be shared 
easily and dynamically across folders and documents and other Zope 
objects without the need to batch process every file in the system to 
accomodate a small change, say in a header or footer.
    


    These objects can be "dropped in" at any time and anywhere.  Out of the 
box Zope comes with support for some already common objects such 
as folders, images, arbitrary files, and documents.  These objects, through 
use of folder properties, acquisition, and DTML (Zope's Document 
Template Markup Language) already give you enough to make a dynamic smart 
site using objects similar to what is used with static, "dumb" means of 
publishing.
    


    But there's more.  Out of the box Zope also comes with support for 
User Folders for managing access at any level of the site (and all 
Zope objects have configurable security attributes).  There are also 
Session objects which allow the entire site or portions of the 
site to be modified live without affecting normal use of 
the site.  Only users that have joined the session can see the changes 
until they're commited to the main database.  Lastly, there are 
MailHost objects for configuring access to SMTP servers for use 
with the DTML sendmail tag.  These objects, along with others 
available seperately, may be combined together in any fashion to achieve 
the results you want.  Database integration, discussion groups, 
desktop database publishing mechanisms are all examples of some of
the other objects available for use on the Zope platform.
    


    Furthermore, this object database is transactional, meaning that 
only succesful changes will be commited to the database.  It supports 
multi-level Undo, allowing the state of objects to be rolled back 
to previous versions.
    
qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.()*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUDirect URL Access to ObjectsqU	dtContentq(U1q(UOFS.DocumentqUDocumentqtq	tq
QUidqUNiceURLsqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.1)*o;`(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT
    
An added benefit of Zope's web-to-object mapping is that URL's address 
objects directly and most importantly make sense.  Instead 
of addressing an object with a URL like:

    


    
/blu/347FGNNFUY2387H49YH796YY@874374NN.U897632S1?form_id=309823&action=nameForm&pid=438095739

    


    
You can use a URL like

    


    
/blu/forms/nameForm?form_id=309823

    


    
This calls the method (or Document) nameForm on the object 
forms contained by the object blu, and 
passes the parameter form_id to the method.  This is more in step 
with traditional file-based publishing which is a hierarchy of 
folders/directories containing HTML documents.  But now, the folders and 
documents have brains.  And those brains don't tax yours by forcing you to 
manage long and ugly object access keys.  So using a regular URL you can 
communicate with any object in the system directly.  All through a regular 
web browser.

    

qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.')*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUSecurityqU	dtContentq(U2q(UOFS.DocumentqUDocumentqtq	tq
QUidqUSecurityqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.2)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT-
    
Part of Zope's security model is based on the User Folder At 
any step in a URL, you can add a UserFolder	for	that customer. This	is 
their part of the URL and the UserFolder	holds their admin folks.	They, in 
turn, can create sub-URLs and add UserFolders beneath. Have you lost 
control?	No,	because	anyone allowed above can get in below. Moreover, 
if	the	customer goes away,	you	delete their URL and all of	their users, 
their customer's users,	etc.  go as	well.

    


    
To the browser, Zope uses standard HTTP Authentication.  Not only does 
this eliminate the hassle of making and maintaining an HTML form based 
login screen, but it also avoids the hassle of tracking an authenticated 
user through cookies.  Furthermore, the information exposed to DTML allows 
you to write documents that can show or not show certain portions based on 
the authentication roles of a user.  Lastly, Zope's security model 
takes extra care to ensure that users deep down in the hierarchy cannot 
affect or steal from above without the authorization to do so.

    

qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.&)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUData SharingqU	dtContentq(U3q(UOFS.DocumentqUDocumentqtq	tq
QUidqUDataSharingqUdatasharing1.gifq
(U4q(U	OFS.ImageqUImageqtqtqQU_objectsq(}q(U	meta_typeqUDocumentqUidqhu}q(hUImageqhh
utqu.4)*o;(cOFS.Image
Image
qNtq.}q(UsizeqM
Ucontent_typeqU	image/gifqUdataq(U5q(U	OFS.ImageqUPdataq	tq
tqQU__name__qUdatasharing1.gifq
UtitleqUdatasharing figurequ.5)*o;$(cOFS.Image
Pdata
qNtq.}qUdataqT
GIF89af3̙f3f3ffffff3f3333f333f3f3̙f3̙̙̙̙f̙3̙ffffff3f3333f333f3̙f3̙̙f3̙f3ff̙ffff3f33̙33f333̙f3ffffff3ffff̙fff3fffffff3ffffffffffff3fff3f3f3f3ff33f3ffffff3f3333f333333̙3f3333333f3333f3f3f3ff3f33f33333333f333333333f333f3̙f3f3ffffff3f3333f333f3wUD"wUD"wUD"ݻwwwUUUDDD""",H*\ȰÇ#JHŋ3N1Ə C|hEGǒʗȜ93aɓ8;)O`mHxd
'O8则{ճ'HiY/Wؠ#wp#
2nY+]W.sU]uڹOnGrMk#uq&8{5߀FxZK%s
f*G|"h(,0xN2HRV)ٸb}2٤NXbj!J[aǚ}HdYIuQJ L:Q\-Y%y$fDԬCoF9@]nf%mNYjh	
r۝X9P
if9)n(YFכ}ti::>j"*jy穰ƚd L8=}LS@
PJԥX$R'0Rb!|j0'Up"u!iI2wFj9ۢU$q
)kl 0tWbT/•}g`wVb
S!y*pk
48PIֺmE
ʶI$ʫNT\=@$fܼfQR2hlJ'+*ѫΊݿRV?6UZ38Mlw^1fu,)_96 BiQJյ^ kZƱ9M݄o{Rm+[Q:ΩD[|Kܪ7#PW|1eIcbP1Jk])qYяWd2~dSowhF[yȀlLj0|S>ܵoL:+9H&qlM0
Ua\lp3S/rjfG:f.܍tkCM4'2אN>F9.֟K&f>l±X쵰Mb;xagt[h"wYE#wmg6d
2ۉ?{Wo(`!n/х2}]Yrf7c[2p;qs.3)*o;(cOFS.Document
Document
qNtq.}q(U__name__qU	dtContentqUglobalsq}qUrawqT
    Problem: You have a common footer that you want on every page in your 
site.  Well, not every page.  There's one folder that needs a slightly 
different footer, but only that folder and its subfolders need it.  Another 
problem: in that footer you want to have a feedback button to send email to 
someone about the site, but that someone can change and may need to be 
different in certain folders, and go unaffected in others.  Solution: 
Acquisition!
    


    
Think of Acquisition as a sort of run-time inheritence (for the 
object savvy).  Another way of looking at it is Environmental 
inheritence.  When you're at work, your phone number is different than 
your phone number at home.  You're the same person in both places, but your 
phone number changes depending on where you are.  You acquire it 
from your environment.  Acquisition is the same thing. Let's show how this 
is being used in the Objects section of this QuickStart.

    

Data Sharing Tree


    
You'll notice that every item in this tree that expands into content is 
indented in the tree properly and closes with a horizontal rule.  While 
every document could have had a closing <HR> added at the end of it 
by hand, what if suddenly we decided to change the width of the rule or set 
it to noshade?  Or even wanted to change with a different element such as 
an image?  We'd have to go into and change each document by hand.  
Unacceptable.  Instead, we use Acquisition.  In the 
Outline (1) folder there is a document 
dtcTemplate.  dtcTemplate is used to render the 
content sections (also known as leaves) of the tree you're 
viewing.  The actual contents of the leaves are defined much further below.  
This section is defined in DataSharing (2), and is being 
rendered using dtcTemplate.  But how is this possible if 
dtcTemplate is not in the DataSharing folder?  
Because of Acquisition, DataSharing acquires 
dtcTemplate from its parent (Objects) who acquires it from its 
parent (Outline).  But because of Acquisition, 
dtcTemplate appears to be (and acts) like a regular member 
object of DataSharing.

    


    
So if that's the case, why do all of the leaves in object have a similar 
style but different content?  The DTML source code for the 
dtcTemplate document is as follows:

    


    <!--#var standard_html_header-->
<!--#var dtContent-->
<HR>
<!--#var standard_html_footer-->
    


    
The dtContent is a DTML 
document inside of each subfolder that gets inserted into the 
dtcTemplate document.  Again, each leaf appears different 
because the dtContent is specified at the leaf level here, while 
keeping a similar identity because the dtcTemplate document that 
is being called to render each leaf is shared across all of the leaf 
subfolders.  When we started working on this QuickStart project, a 
dtContent document was defined in the top folder that is being 
used for the entire QuickStart tree that you are now reading so that all of 
the leaves would render a simple document until a real 
dtcTemplate was defined for their level.  Meaning: all of the 
empty folders acquired the default document from higher up until it got 
overridden.

    

qU_varsq	}q
u.)*o;3(cOFS.Folder
Folder
qNtq.}q(UPublishq(U7q(U
OFS.FolderqUFolderqtqtqQUidq	UDatabaseq
U
MultiPlatformq(U:q(hUFolderq
tqtqQU	MultiRoleq(U8q(hUFolderqtqtqQU_objectsq(}q(U	meta_typeqUFolderqUidqUBasicExamplequ}q(hhhUHighPerformancequ}q(hhhhu}q(hhhhu}q(hhhUMultiTieredq u}q!(hhhUMultiSourceq"u}q#(hhhhutq$Utitleq%UDatabase Integrationq&h(U
Zope and Aqueduct take great pains to maintain high transaction rates 
and performance.  Chief among these is the persistent database logins 
established and maintained by Aqueduct.  Multiple, persistent logins (each 
with their own database privileges) can be created and maintained.

    


    
Another signficant performance boost also comes from the fact that 
Zope (and hence Aqueduct) are long-running processes.  This completely 
avoids the performance-bashing startup latency associated with complex CGI 
applications.

    
qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.;)*o;-(cOFS.Folder
Folder
qNtq.}q(UtitleqUMultiple Data SourcesqU	dtContentq(U>q(UOFS.DocumentqUDocumentqtq	tq
QUidqUMultiSourceqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhu}q(hUImageqhUMultiSourceAqueductDiagram.gifqutqh(U?q(U	OFS.ImageqUImageqtqtqQu.?)*o;(cOFS.Image
Image
qNtq.}q(UsizeqM
Ucontent_typeqU	image/gifqUdataq(U@q(U	OFS.ImageqUPdataq	tq
tqQU__name__qUMultiSourceAqueductDiagram.gifq
UtitleqUqu.@)*o;(cOFS.Image
Pdata
qNtq.}qUdataqT
GIF89a !, @I8ͻ`(dihlpmO-:=nal	
k_nVجv2;zFw|.sB:c9TIMt_G`~cX77w{w^rHq1Ea65->,Y3gyRf#)%ψt&ن0$"!]@ma	H h7/x_K7(jd:)h'pp:hy+`HT'"36b1qS:TzLOZ;-k%x7Qk^Mv%FԐ

Kڒ&6\ng>i™%Ø+!G \g0&x|U#Zm5UbW9`TMdu׀U ΖNguw;tbt1}gn'7;cRj_UӑRQڣd37N!M8	+a"ie !C9%]%܆NN„W0dx-D~0KeKZ^rRi0F2ϗ$/kg~"6(<>f0$V6Re6хBy3Om=Wɀ"N7bd(
6-yИZVЈlkD-s3
#GMx$'r?G*]ms^$6BvQLZǦ7]fozJږBڇ
dL5Dvԩׇ9	(XRRsnj%#ZP*I~`T֧Jm`R
URYOXkE+=:*Ge;Cˤ͏cҚe7^jOKޥT-kE:Q'\.n\pA[TގIխKY1].mv5>e>]uFxKy#C5t[{[
ͯ~pG)`r9VS|RT#<hp9Rr
Y\_ʀ&E})vq+W>)NzEWN1Ij>f3‹F>:]R9b"+V,1*W+cx+|l4zoɾB;F>2${{-u|2)ers%d3dWWHgʕM-xEHHYvW|dC=(d_tI]C
F!ôdeZ03:}n$]Zꎱֳ5<2[˓sMPr'ŊJ}ԘsYq*!:Vi{)U^.gUEMJ`lbwl@`S7U
qOֳ/owmJN'<78ڱ/xxٽK;ʚЙysx98X-3͎Ejį*q*sat,LG;9vsq]o$jJwgx&Q7>j	+886E#9clYU7y0]/B=f~҆4]!_	9;a[܉x"ȕ'+#7?ëvpN4Wqr4kنfiǻVU#;o?[:0PTvbw+|g{Ser
XvutDWs(%S~9NU]tvY*pt|$g
TueRAwVF-m@06e;4X1pN#rW'{N7?ăy{sҁp\h؆RĄGJ8ddvZ7WJ1uvbOiu3#__D҂1Gyf!V@7S00w!4[kh"3']ciJ1`BTw\keՕV%GHW]<~jIQ-Vɘ79)Eŗ.3((8Mhm7{x9+E՚(yɇ]ǒ16DE)}gv8^əCGK0izGy/ɍ	t/wfx+f3뙚كIr(w)`yw/)ڥx1ii~YSwnAh ":$Z&JxXHdwfN)
'Rtd/~1*e+7x%D׶I4?JLڤN2;qs.>)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqTB
    
Aqueduct can also be implemented in a 
multi-database architecture.  What if 
your sales data was kept in Oracle® on 
sales.plutonia.com and your human resources data 
was kept in a Sybase® database on hr.plutonia.com.  
All this and your web server of choice is 
Apache on Linux!  Sound like an impossible 
situation!?  Not with Zope and Aqueduct.  
Consider the following 
diagram which implements this very architecture.

    


    


    qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.:)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUMulti-PlatformqU	dtContentq(UAq(UOFS.DocumentqUDocumentqtq	tq
QUidqU
MultiPlatformqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.A)*o;`(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT
    
Zope (and therefore Aqueduct) runs on many platforms.  This list is 
always growing!  The lastest list of supported platforms and databases can 
be found on our website.

    


    
As of April 1998, Digital Creations supported:

    


      
	
    • Linux v2
      • 
	
    • BSDI v3
      • 
	
    • OSF1v3
      • 
	
    • Solaris 2.5
      • 
	
    • Solaris 2.6
      • 
	
    • HP/UX 10.x
      • 
	
    • Irix 6.46
      • 
	
    • Windows NT Server v4
      • 
	
    • Windows NT Workstation v4
      • 

    
qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.9)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUMulti-TieredqU	dtContentq(UBq(UOFS.DocumentqUDocumentqtq	tq
QUidqUMultiTieredqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhu}q(hUImageqhUNTierAqueductDiagram.gifqutqh(UCq(U	OFS.ImageqUImageqtqtqQu.C)*o;(cOFS.Image
Image
qNtq.}q(UsizeqMFUcontent_typeqU	image/gifqUdataq(UDq(U	OFS.ImageqUPdataq	tq
tqQU__name__qUNTierAqueductDiagram.gifq
UtitleqUqu.D)*o;s(cOFS.Image
Pdata
qNtq.}qUdataqTFGIF89a@!,@@I8ͻ`(dihlp,t]O_GVGRL.ШtJ5F1j{Wr9ΪI_7y֭^
;}E]c{7~h'bo>r^B3G.p[nP@+VrDžZsv#׋eѕd㟠k(݂|ߺs*ӗl
ft"$F"1Dɓ(S\Y9%͉oNu)Ҳ?{BLjh	Յ+-O7$s

ULK:%Eo"W+
̭Yd*^sfkBkˎkܫ.g|ud+{Nk{,֓kзEo`Nwȓ+y|gFNֳks&J*=OkϿ߀\g&`<n]Vxaf!n4zUx#NA&u,r&-(#	މmbw&h3؋6@)^5u_aEǖ=
$difK`lPKXnֹ_zi)|aߡ&|XcMXe4唌fڑAi逤m]9@#k(<:Rqj~XYwlIXJ*NA"&yl,:JݖD"ʒ"kymkb}/+RoX!龽*ĩIQ%Ý)$B( 镚N9
56"΅0D
cHC	cwf~5D,*(AZ,(ZXVE
R,Ib%FXE5񍅒YE'8 .g_Ȣ(nGEBjB>INrw؛⸿ŅT^?iT@yxl)cnle1mD1DIƂ(Ddβ	2]NF?$R	VLT3beT`/ujm@)qjmSӖUv2
$dn#טB^}Mz_vY+^*ivH|Bڑ>˚.I߅ZU,z7Wlc3z7ad%m@9sMϩ&awVm`Em7s 7>Hh/^n9V'Khf_[v񘳤qk`꣞Y]q
fRϛ̴YhSge^/N~[6ڠn0*aMg=j$YZ}E&[a<Watw^'?}Bh«:6'z<1=Dbg1N+iCy7ӷm|A5%2ק%X]']BOg
kFi~buwSfhl˖p~u8mfb7Zy29KO.gM9.IWiS\ٕ^`bgegT#>wY7gd?#xkQwt%t;u8sJvmk^spF>ɅijISC5\bNKWcY֧}c)=py0̸y\w؎fmSuVLck'gxvIR跁ITbNrECH*9n'ԕ\Dphutq'voV$|B穆Iö%IxXSmv})$ꉚX6%h	|	f~DW:YGgڟBeDJ喢DnAF`!ʋ'z}B5Ym%ƜNjNG'
C'bVHT٣֢aTYEhLzkPnXÅ.f"q-ƥ#vnjh2}zW3R*~(2'LXJzb87Y<)*[*?4H.o,cڴ*&`TY:ڱO[o-
Uj\El7Z:7Rylli~&|I'm`aopCl@3{h~䴨jL}Bf?ޣ~_sWW }\v+l*_j+&@*㺴$GZ:I{\ZHĄk4*+S۽ZGT)+A߫w?4X=4D=ӿ,Iz@
YY~V{]]͒+|Q{Ln1}ýf>9}T]nK)nr2)iտ	"~\੦Ȁ:@Iέqu|EG4-\~WUCdl]ObʄV>d]p(Eeؐ	nyݑX撌Thu=E_<$Q#"&(OĜ6M.`AN=khϨBM~/ni}h,{^؊40-!fL!NtFY͌鼚..Mv]>ixcQXk'EW~k^UymW"ܕrN.aNՄHJnq?~G2~K/Ǝ,.(۵n ?r7	{>xf^aq>A/F8XY̅|׌X.]M-d_fm!jȾgyGه8X,
?v_F'm2l3%B:$OrOt$/-+s?]+ECpg?¬빯R['nɗOaE?Oĝ5'ZNҎwg/O?|t?O%1NEs3PZ9ONZYoCq$KDS5y%`~㩦u罸n/C&KfFELV¬[iwR8.Ekv}rz~$,4;RZ~65.
'+_=톏
P@!";qs.B)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqTw
    
Arguably the most powerful and 
complex implementation of Zope is one 
which involves a multi-tier architecture and 
multiple datasources.

    

    
Consider the following common scenario:

    

    
For various and sundry reasons Plutonia Computer's (our example company) webmaster has chosen to run the main Plutonia website on the Linux operating system and use Apache as the web server.  Unfortunately for our webmaster, Plutonia's corporate database standards are Oracle® and Sybase®.  Last we checked, neither Sybase or Oracle had (or were planning on having) client-side drivers for Linux.  If they did a clever and efficient webmaster could develop interesting CGI applications against the client-side drivers.  Alas, no drivers, no integration...

    

    
Until Zope and Aqueduct that is!  Using Zope's unique Network Client capabilities, Zope developers can publish searchable objects from one Zope to another.  In the scenario above a developer can use Zope on a platform for which there are Oracle/Sybase client drivers.  From this platform they would publish one or more query objects.  For example, Oracle client drivers are available for the Solaris operating system.  We can use Zope on Solaris to publish (over the network) queries against an Oracle database.  This Oracle database is either a) on the same Solaris machine, or b) available to the Solaris machine over the network.  In any case, the following queries can be published by the Solaris server.

    


    

    

    
Searchable Object
Query String

    

    
qryListAllCustomers
SELECT * FROM customers

    

    
qryListAllBackOrders
SELECT order_id, quantity, part_number FROM orders
    WHERE shipped < quantity    		

    

    

    



    
We can now return to our Linux web server where we use a Network Client to access the remote searchable objects published from the Solaris server.  Once we correctly configure a Network Client we have access to all of the data on Linux!!!  This architecture works perfectly whether you are SELECTing, UPDATEing or INSERTing data.  As a matter of fact it even works for CREATEing and DROPping your tables!

    


    
Security and Performance is critical!  The network connection between the Linux web server and the Solaris machine that is publishing searchable objects is both encrypted (for strong security) and compressed (for strong network performance).

    


    
The scenario described above is illustrated in the following software component diagram.  Note that while not depicted on the diagram it is certainly possible (and, in fact, common) for the Linux webserver the be publishing databases (e.g., SOLID, mySQL, mSQL, etc.) directly in conjunction with the Oracle and Sybase databases.

    

    


    qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.8)*o;)(cOFS.Folder
Folder
qNtq.}q(UtitleqUSQL and HTML in HarmonyqU	dtContentq(UFq(UOFS.DocumentqUDocumentqtq	tq
QUidqU	MultiRoleqU_objectsq
(}q(U	meta_typeqUFileqUidqUsample_aqueduct_dtml_snippetqu}q(hUDocumentqhhutqh(UEq(U	OFS.ImageqUFileqtqtqQu.F)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqTv
    
Here's a common problem...  The people that are experienced and talented in the development of efficient SQL queries are often not the people that have the best eye for aesthetics and presentation.  Similarly, an organization's best graphics specialists and HTML authors might not be qualified to write efficient SQL.  What to do?!

    

    
The combination of Zope and Aqueduct allows website managers to segregate the responsibility for the SQL queries from the responsibility for developing a visually attractive and appealing interface.  Consider the following SQL query (note the template variable substitution is highlighted in red:

    


    

    

    


SELECT
    
parts.part_id, description, price, 
    
order_number, quantity, shipped, 
    
customers.name, customers.address
    
FROM parts, orders, customers 
    
WHERE 
    
parts.part_id = orders.part_id 
    
AND 
    
orders.customer_id = customers.customer_id
    
AND orders.order_number = <!--#VAR order_number-->
    
ORDER BY order_number
    
    
    		

    

    

    


    
This query is certainly not the most complex or complicated query that's ever been devised.  However, it does involve joining two relational tables and sorting/ordering the output.  So, while not terribly complex, it might very well be beyond the expertise of an HTML developer or graphics artist.  No problem!  Just get your local SQL guru to create a Zope SQL Method that implements this SQL query.  Let's call it qryListOrderInformation.

    

    
With the qryListOrderInformation object created our HTML developers and graphics artists can do what they do best...  make the site look visually appealing.  Our graphic designer can now access the data returned from the query using the Document Template Markup Language (DTML) as follows:

    



    


    
    


    
When the query was run, it would return data which would, in turn, be merged with the template to produce the folllwing HTML:

    


    <table>
  <tr>
    <th>Order<br>Number</th>
    <th>Quantity</th>
    <th>Shipped</th>
  </tr>

    <tr>
      <td>2</td>
      <td>4</td>
      <td>3</td>
    </tr>

    <tr>
      <td>3</td>
      <td>6</td>
      <td>0</td>
    </tr>

</table>

    



    
Which when rendered in a browser would appear as follows:

    


    
  
    
    Order
    Number    		
    Quantity
    Shipped
  
    

    
    
      2
      4
      3
    
    

    
    
      3
      6
      0
    
    


    
qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.E)*o;(cOFS.Image
File
qNtq.}q(UsizeqMUcontent_typeqUapplication/octet-streamqUdataq(UGq(U	OFS.ImageqUPdataq	tq
tqQU__name__qUsample_aqueduct_dtml_snippetq
UtitleqUqu.G)*o;K(cOFS.Image
Pdata
qNtq.}qUdataqT
    
  
    
    Order
    Number    		
    Quantity
    Shipped
  
    

  
    
    
      
      
      
    
    
  

    
qs.7)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUPublish DatabasesqU	dtContentq(UHq(UOFS.DocumentqUDocumentqtq	tq
QUidqUPublishqUSingleTierDiagram.gifq
(UIq(U	OFS.ImageqUImageqtqtqQU_objectsq(}q(U	meta_typeqUDocumentqUidqhu}q(hUImageqhh
utqu.I)*o;(cOFS.Image
Image
qNtq.}q(UsizeqM
Ucontent_typeqU	image/gifqUdataq(UJq(U	OFS.ImageqUPdataq	tq
tqQU__name__qUSingleTierDiagram.gifq
UtitleqUqu.J)*o;
(cOFS.Image
Pdata
qNtq.}qUdataqT
GIF89a !, @I8ͻ`(dihlp,TvO?N+| GaΞJZج3t0+.h8J%ӫ;ک^jsB2JS~(0eZn4m<<`7rE.-dmpHRCkpl"Xīf`aPTѫ'|:qtoٿ)%#Qgu站0Rw >LA%aNc.aL8nLƓtfXhRʊj2ys|QAtGɁ%tF1o%A9f*F\ojɃ=zj#&]er
+Xix漣۟bʝKnPJm^F
H7 ˷q`OLS_q̹[zMAܐ/fӰcGThP^hۮ_.MP&i/ ^NgkGG7ӫ7.}K2?ϟ*' =5&<
Q6fYa\\QUqTA!l݈xkmu]㎸eO(X~B5V}M}$4\J
b(3-erfRU"J(F!H fV^'ZߚXgOB3ߠX%~.$ЈZ&mTXԗQa wFWhkif^*WDS)se8}
+1z
k]窝=[byMŒڸkdAbܹ;iyݙbբoqJl0z*t.l>^ql\QcxLj8 c1[3<І0.H+$IMGm|RW}	Vg(Zw
/
h594!	mL9g6MQ,tC-K^'ҍ^JW7n%Fj]J#.t]\SRj+؏26S;RF`^>&:ȧ{n^&w2_rO!E40Ӿ`b=G{Cb/"?0
RˬgzXTF(HIp˨Fǫ:mo'zt;(L
5:EʁƊa/!x M1oFzC;d5|R(<Au,щMt%_Ec\6B
B†
uҪ'"
/;%2>D$#0E]aZ_Ikv$g@uKKFH:E!$2i'LVdLXӸXڒ]a.|ӵr5+JK;e"KN4W@!K
v4Y4Dx,gܬ~	RIb9K+va8(vV;ZA'
f.kC?T&h>*bB(HT(,OҖB.]pioQIc?ɓ˟dӢz4*O£T۔Ԡ@uH"x՘v8EYfUfuq6`YoҭzkE/WQ.ϩq(;zbj^fקg}W0Ab/6UFeьf
h5-gZ
jcBdqvE
oKwaaqM	α\tKZ]. kZBpSϡ^S-R`1ֹvcܐ(MX6O	Tbf10bawøV5["ʆJ"̂H|:_ՊިiX466Fȉ7㴱v"[*Cdi.̞/޶U<]L:mAM8w<o;Yq*d̴
rIN1H>/Ѡ&3LtvNjfEHZ4-6ш3UƜ$bt(HnRXϡdg4B'=@5ci-KGF5ݻۜu۬l!L/8)KmRK*-}HPkۉ4HCB[Cs$siH2WkD!H78!^&^I
x?䖷ı3Y.qo1akfGHw	(7ZÓcʇ^;zyxO{a'.3S:ߜusnBҕLϤ\_'NŸ(٣DG˝7}('뜳סy^#@clMP::qq)\	ve54$&C٧ouvDXln/ZZvqruӾr0ۨ_#{6l/MgK>9D	T4&}vzQb_
W8aB%
|%ThevjgthEY6Z#Xg{What's the secret?

    
It's no longer a secret...  The fastest way to show significant demonstrable returns from 
your internet/intranet/extranet website is to web-enable existing operational databases.  A 
close second is the design and development of new web-centric databases designed to deliver 
enhanced sales, marketing and customer service capabilities to your organization.  Like we 
said, what needs to be done is no longer a secret.

    


    How to do it...
    

    
Today's most precious commodity?  Your time.  In Zope (our web application development 
and delivery platform) and Aqueduct (our relational database publishing solution) Digital 
Creations has developed a suite of software that lets you work smarter, not harder.

    


    
Take for example, Aqueduct.  Aqueduct packages your database queries (i.e., the SQL queries) 
into reusable objects that are made available throughout your website in accordance with the 
security parameters you establish.  Aqueduct supports two-tier and n-tier implementations.  
Consider the following diagram which depicts a single-tier Aqueduct implementation.  This 
diagram might depict a centralized web server serving data from a centralized database 
server.

    


    


    


    

    
  
    
    Key
    Description
  
    

  
    
    
    1
    		
    
"Standard" web-browser (whatever that means!)

    
  
    

  
    
    
    2
    		
    

A "Standard" web server: (e.g., Apache, Netscape's 
Enterprise Server, Open Market's web server and others).  Zope's long running process 
is messaged by very small CGI programs launched by the web server.  This elegant 
architecture allows Zope to easily scale into higher transaction rates.

    
  
    

  
    
    
    3
    		
    
Zope Server Process:  Zope is based on a strong 
web-to-objects model that marries an object-oriented database and scripting envrironment 
with user sessions, an Undo capability and more.  It is the well-matched interface between 
this object-orientation and underlying relational databases that is Aqueduct's most 
distringuishing feature.
    
  
    

  
    
    
    4
    		
    Aqueduct SQL Method(s):  SQL Methods expose templated 
SQL statements to the Zope object system.  This exposure allows you to take advantage 
of Zope capabilities like Acquisition, hierarchical security and authentication, Folder 
Properties and Document Template Markup Language.
  
    

  
    
    
    5
    		
    
Aqueduct Database Adapter:  On Unix-variant operating systems 
Aqueduct uses native database libraries and persistent database connections for 
high-performance database operations.  On Linux Database Adpaters are available for mySQL, 
miniSQL, and SOLID.  However, the list of supported databases is growing all the time.  
Please check our website for the most current list.

  
    

  
    
    
    6
    		
    
A "Standard" Database Server:  Examples include SOLID, 
mySQL, mSQL and others.
    
  
    

    

    
qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.6)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUA Basic ExampleqU	dtContentq(UKq(UOFS.DocumentqUDocumentqtq	tq
QUidqUBasicExampleqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.K)*o;(cOFS.Document
Document
qNtq.}q(U__name__qU	dtContentqUglobalsq}qUrawqTZConsider the following basic personnel report.  This report highlights (in red) anyone whose 
last raise was more than 25%.


    

    Personnel Report
    

    
Plutonia Company - Marketing Department peronnel listing as of 1/1/98:

    

    


    
Employee Number
Name
Department
Email
Current Salary
Last Raise (%)


    


    
SJ34
Jones, Steve
Marketing
stevej@plutonia.com
[SEND]

    $50,995
    		

    27%
    		

    


    
JD334
Doe, James
Marketing
doej@plutonia.com
[SEND]

    $43,995
    		

    24%
    		

    


    

    

    Example Code - The SQLMethod
    

    
This is implemented with two basic objects.  The first object is the SQL Method (which we've named qryAllMarketingEmployees as follows:

    


SELECT * from PlutoniaEmployees WHERE 
    
department = '<!--#var department-->'
    


    
You should note that this SQL statement is actually an SQL statement template.  The variable department will be inserted into the SQL statement when the query is run.  In the example above the variable department is equal to MARKETING.  Thus, when this SQL template is rendered the following SQL statement is sent to the database for evaluation/execution:

    

SELECT * from PlutoniaEmployees WHERE 
    
department = 'MARKETING'
    

    
An SQL Method returns a sequence of items which can be interated over inside other queries or in HTML document templates.  In this particular example, this query returns the following results:

    


    


    

  
    
    employee_id
    last_name
    first_name
    department
    emailaddress
    salary
    precent_raise
  
    

  
    
    SJ34
    Jones
    Steve
    Marketing
    stevej@plutonia.com
    50995
    27
  
    

  
    
    JD334
    Doe
    James
    Marketing
    doej@plutonia.com
    43995
    24
  
    


    


    


    Example Code - The Document Template
    

    
The second object is the Document Template required to render the HTML page.  The table above was created with the following DTML:

    


<!--#var standard_html_header-->
    

<h3>Personnel Report</h3>
    
<p>
    
Plutonia Company - Marketing Department peronnel listing as of 1/1/98:
    
</p>
    

    
<table border="1">
    

  <tr>
    
    <th>Employee Number</th>
    
    <th>Name</th>
    
    <th>Department</th>
    
    <th colspan="2">Email</th>
    
    <th>Current Salary</th>
    
    <th>Last Raise (%)</th>
    
  </tr>

    

    
<--#in qryAllMarketingEmployees-->

    

    
  <tr>
    
    <td><!--#var employee_id--></td>
    
    <td><!--#var last_name--></td>
    
    <td><!--#var department--></td>
    
    <td><!--#var emailaddress--></td>
    
    <td><a href="mailto:<!--#var emailaddress-->">[SEND]</a></td>
    
    <td><center>$<!--#var salary-->;</center></td>
    

    <td>
    
      <!--#if expr="percent_raise > 25"-->
    
        <font color="FF0000">
    
        <!--#var percent_raise-->%
    
      </font>
    
      <!--#else-->
    
        <!--#var percent_raise-->%
    
      <!--#/if-->
    
    </td>
    


  </tr>
    
    


    

<--#/in-->


    
</table>
    

    

    
Take note of the <!--#in QUERY_NAME--> tag which allows you to loop through a section of document template once for each "record" or item in the sequence.  Also note that the percent_raise value was highlighted in red (using the HTML <FONT> tag).  This was done using the Document Template expr tag which allows us to evaluate arbitrary expressions.  In this case, if percent_raise is less than 25 no highlighting is done.  If, however, the percent_raise is greater than 25 the value highlighted.

    

    
These are only a few of the powerful capabilities in Aqueduct!  If this looks interesting, read on!

    qU_varsq	}q
u.)*o;(cOFS.Document
Document
qNtq.}q(UrawqU2
    This is a document about 
    
qUglobalsq}qU__name__qU	dtContentqU_varsq	}q
u.)*o;0(cOFS.Folder
Folder
qNtq.}q(UtitleqUContent ManagementqUidqUContentqUDropinq(UMq(U
OFS.Folderq	UFolderq
tqtqQU	Documentsq
(ULq(h	UFolderqtqtqQUBuiltinq(UNq(h	UFolderqtqtqQU_objectsq(}q(U	meta_typeqUFolderqUidqhu}q(hhhh
u}q(hhhhutqu.N)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUBuiltin ObjectsqU	dtContentq(UOq(UOFS.DocumentqUDocumentqtq	tq
QUidqUBuiltinqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.O)*o;F(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT
    
Zope automatically provides useful objects for web site builders. 
These include Documents, Images, Folders, UserFolders, and MailHost 
objects. A content manager can use these objects to create a highly
interactive, yet maintainable web site. Content managers can take 
advantage of Zope's powerful object model and data sharing abilities 
to reduce redundant work and delegate responsibility for content.

    


    
Most web sites try to maintain a consistent style, such as common HTML 
menus or feedback links. Using Zope, a content manager can define a 
Document that renders the HTML menu in one Folder - and simply refer to 
that from other Documents in the system. When the menu needs to be changed, 
it can be changed once and the changes will instantly be visible throughout 
the site.

    


    
Documents also give content managers access to HTTP request variables,
cookies, programmatic control of the object system and more. A content
manager could create a Document that renders itself completely differently
based on the browser, identity or even the remote network address of
the viewer. Using the built-in Zope MailHost object, one could even 
arrange for a Document to send out an email anytime it is viewed!

    
qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.M)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUDropin ObjectsqU	dtContentq(UPq(UOFS.DocumentqUDocumentqtq	tq
QUidqUDropinqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.P)*o;4(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT
    
Drop-in products for Zope provide allow content managers to  
add new functionality like discussion groups and database access 
to their site as easily as they new add Documents or Folders. 
Products designed for Zope register new types of objects which 
can be dropped into any Folder - even into objects defined by other 
products!

    


    
The Confera product adds the ability to create full-featured web 
discussion groups to a site. A content manager can simply add a 
new Confera Topic in any Folder. The newly added Confera Topic is 
fully functional, complete with generic Documents that can be customized 
to brand the topic and full-text searching.

    


    
The Aqueduct line of products allow content managers to easily integrate 
back-end data with their site by dropping in Database Connections and 
Database Methods which perform database queries. The resulting data can 
then be used in site Documents, taking full advantage of DTML.

    

qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.L)*o;(cOFS.Folder
Folder
qNtq.}q(UtitleqUDocument TemplatesqU	dtContentq(UQq(UOFS.DocumentqUDocumentqtq	tq
QUidqU	DocumentsqU_objectsq
(}q(U	meta_typeqUDocumentqUidqhutqu.Q)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT
    
Zope Documents provide a powerful system for dynamic content 
delivery. Documents add rich programming to HTML, including iterations, 
conditional testing, variable insertion, access to HTTP headers, cookies, 
and more. Since these rich HTML templates are objects, your users can undo 
mistakes, work on Documents in private Sessions, and take advantage of
Zope's built-in security.  These rich programming additions are known 
as the Document Template Markup Language (DTML), a 
server-side-include style syntax.

    

qUglobalsq}qU__name__q	U	dtContentq
U_varsq}qu.)*o;(cOFS.Image
Image
qNtq.}q(UsizeqKUcontent_typeqU	image/gifqUdataq(URq(U	OFS.ImageqUPdataq	tq
tqQU__name__qUClosedBook.gifq
UtitleqUqu.R)*o;(cOFS.Image
Pdata
qNtq.}qUdataqUGIF89a!,@D0~Q}6^F'zm+&LB9"&&	qtAhjG%e;qs.)*o;(cOFS.Image
Image
qNtq.}q(UsizeqKUcontent_typeqU	image/gifqUdataq(USq(U	OFS.ImageqUPdataq	tq
tqQU__name__qUOpenBook.gifq
UtitleqUqu.S)*o;(cOFS.Image
Pdata
qNtq.}qUdataqUGIF89a!,@RY¤aT	)`r<gDTPBW'+9#h%`[60R
dJVAt:xߋ;qs.)*o;(cOFS.Document
Document
qNtq.}q(UtitleqUqUrawqT

Zope QuickStart
    


    
Welcome to Zope - a new generation of software that 
we call a web application platform. Like web application servers, Zope
provides very high performance and a strong framework for dynamic 
applications.

    


    

    


  This QuickStart is built with Zope objects -- 
  
  take a look!
  



    

    


    
Zope, though, is distinguished by its integrated object database 
which, when combined with a revolutionary object model, provides a 
completely unique facility for servicing content managers and web 
application developers.  This outline, implemented in Zope, talks 
about the various strengths of the Zope platform and some of the other 
products available for it.

    


    Start working in the management screens
    


 
  
    
    
    
    
    
    

  

    
    
    
    

  
 


qUglobalsq}qU__name__q	U
index_htmlq
U_varsq}qu.)*o;
(cOFS.Document
Document
qNtq.}q(UrawqT<!--#var title_or_id-->




qUglobalsq}qU__name__qUstandard_html_headerqU_varsq	}q
u.)*С- ! amos/standard_html_footer/manage_edit)*С(cOFS.Document
Document
qNtq.}q(UtitleqUStandard Html FooterqU__name__qUstandard_html_footerqUglobalsq}qUrawq	U7
    
q
U_varsq}qu.-+."[ U+."<(cApp.Product
Product
qNtq.}q(UiconqUp_/InstalledProduct_iconqUidqU	MIMEToolsqUmanage_distributionqNUmanage_optionsq(}q	(Ulabelq
UContentsqUactionqUmanage_mainq
u}q(h
U
PropertiesqhUmanage_propertiesFormqu}q(h
U
Import/ExportqhUmanage_importExportFormqu}q(h
USecurityqhU
manage_accessqu}q(h
UUndoqhUmanage_UndoFormqu}q(h
UFindqhUmanage_findFramequ}q(h
UREADMEqhU
manage_readmequtq Uversionq!Uq"Utitleq#UInstalled product MIMEToolsq$U
_distributionq%NUthisIsAnInstalledProductq&Ku.[+a3 Installed product MailHost+a3(cOFS.Application
Application
qNtq.}q(Ustandard_html_headerq(Uq(UOFS.DTMLMethodqU
DTMLMethodqtqtqQU__allow_groups__q	(Uq
(UAccessControl.UserqU
UserFolderqtq
tqQU_objectsq(}q(U	meta_typeqUUser FolderqUidqU	acl_usersqu}q(hU
Control PanelqhU
Control_Panelqu}q(hUDocumentqhhu}q(hhhUstandard_html_footerqu}q(hhhUstandard_error_messagequ}q(hUFolderqhU
QuickStartq u}q!(hhhU
index_htmlq"utq#U
index_htmlq$(UTq%(hU
DTMLMethodq&tq'tq(Qh(Uq)(hU
DTMLMethodq*tq+tq,Qh(Uq-(UApp.ApplicationManagerq.UApplicationManagerq/tq0tq1Qh(Uq2(hU
DTMLMethodq3tq4tq5Qh (Uq6(U
OFS.Folderq7UFolderq8tq9tq:Qh(Uq;(hU
UserFolderqQU_product_meta_typesq?)u.+a3"(cApp.Product
ProductFolder
qNtq.}q(UZSQLMethodsq(U
q(UApp.ProductqUProductqtqtqQU	ZGadflyDAq	(Uq
(hUProductqtqtq
QU_objectsq(}q(U	meta_typeqUProductqUidqUExternalMethodqu}q(hhhUOFSPqu}q(hhhU	ZGadflyDAqu}q(hhhUZSQLMethodsqu}q(U	meta_typeqUProductqUidqU	MIMEToolsqu}q(hhhUMailHostq utq!UExternalMethodq"(Uq#(hUProductq$tq%tq&QUMailHostq'(UVq((hUProductq)tq*tq+QUOFSPq,(Uq-(hUProductq.tq/tq0QU	MIMEToolsq1(UUq2(hUProductq3tq4tq5Qu.V+a37(cApp.Product
Product
qNtq.}q(UiconqUp_/InstalledProduct_iconqUidqUMailHostqUmanage_distributionqNUmanage_optionsq(}q	(Ulabelq
UContentsqUactionqUmanage_mainq
u}q(h
U
PropertiesqhUmanage_propertiesFormqu}q(h
U
Import/ExportqhUmanage_importExportFormqu}q(h
USecurityqhU
manage_accessqu}q(h
UUndoqhUmanage_UndoFormqu}q(h
UFindqhUmanage_findFramequ}q(h
UREADMEqhU
manage_readmequtq Uversionq!UMailHost-1-1-0q"Utitleq#U+Installed product MailHost (MailHost-1-1-0)q$U
_distributionq%NUthisIsAnInstalledProductq&Ku.+MAh # amos/standard_error_message/manage_edit+MA(cOFS.DTMLMethod
DTMLMethod
qNtq.}q(UtitleqUStandard Error MessageqU__name__qUstandard_error_messageqUglobalsq}qUrawq	Te


 



    

    


Zope



  
    Zope Error
    
  
    Zope has encountered an error while publishing this resource.
  
    
  
  
    
  Error Type: 
    
  Error Value: 
     
  
    
 
  
    
 
  
    Troubleshooting Suggestions
    

  
      
  
  
    • This resource may be trying to reference a
  nonexistent object or variable .
      • 
  
  
    • The URL may be incorrect.
      • 
  
    • The parameters passed to this resource may be incorrect.
      • 
  
    • A resource that this resource relies on may be encountering an error.
      • 
  
    

  
    For more detailed information about the error, please
  refer to the HTML source for this page.
  
    

  
    If the error persists please contact the site maintainer.
  Thank you for your patience.
  
    

    

    


 Here, events like logging and other actions may also be performed, such as
 sending mail automatically to the administrator.



q
U_varsq}qu.h+N`ųD +N`ųD%"(cZODB.conversionhack
hack
qNtq.}qU
_containerq}q(U
_pack_timeqGA˗/WcUApplicationq(Uq(UOFS.ApplicationqUApplicationq	tq
tqQus.+~  amos/index_html/manage_editT+~&(cOFS.DTMLMethod
DTMLMethod
qNtq.}q(UtitleqUWelcome to ZopeqU__name__qU
index_htmlqUglobalsq}qUrawq	T


    Welcome to Zope!
    


    Congratulations, your Zope is up and running.  To view 
some shameless Zope propaganda, please visit the included 
QuickStart material.
    


    To visit the management interface, please click on the 
following link.  You will be prompted for the username and password 
you used when you ran the Zope install utility.  If 
you have forgotten, it is stored in the access file in 
the Zope directory.
    


    If that username and password does not work and you are 
integrating it with your web server, then this probably 
means that your web server does not pass authentication information 
to CGI scripts.  The Support area
on the Zope website has information to help you with this and
other problems.
    


    Visit the management screen!
    

q
U_varsq}qu.+޳ +޳%9*(cZODB.conversionhack
hack
qNtq.}qU
_containerq}q(U
_pack_timeqGA˗bVœUApplicationq(Uq(UOFS.ApplicationqUApplicationq	tq
tqQus.Zope-2.0.1-ZEO-nonbin/w_pcgi.py100644   1007   1403       10614  6745712161  16161 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################
"""Try to do all of the installation steps.

This must be run from the top-level directory of the installation.
(Yes, this is cheezy.  We'll fix this when we have a chance.

"""

import sys, os

def setup(me):
    home=os.path.split(me)[0]
    if not home or home=='.': home=os.getcwd()
    sys.path.insert(0, os.path.join(home,'inst'))
    sys.path.insert(0, home)
    return home

def main(me):
    home=setup(me)
    
    import build_pcgi
    user=group=''
    pcgi=os.path.join(home, 'Zope.cgi')
    import make_resource; make_resource.main(home, pcgi, user, group)
    os.chdir(home) # Just making sure
    import wo_pcgi; wo_pcgi.main(me)

if __name__=='__main__': main(sys.argv[0])
Zope-2.0.1-ZEO-nonbin/wo_pcgi.py100644   1007   1403       10735  6746103000  16327 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################
"""Try to do all of the installation steps.

This must be run from the top-level directory of the installation.
\(Yes, this is cheezy.  We'll fix this when we have a chance.

"""

import sys, os

def setup(me):
    home=os.path.split(me)[0]
    if not home or home=='.': home=os.getcwd()
    sys.path.insert(0, os.path.join(home,'inst'))
    return home

def main(me):
    home=setup(me)

    import compilezpy
    import build_extensions
    user=group=''
    import zpasswd; zpasswd.write_access(home, user, group)
    import default_content; default_content.main(home, user, group)
    pcgi=os.path.join(home, 'Zope.cgi')
    import make_start; make_start.sh(home, user, group)

    print '-'*78
    print
    print 'Done!'

if __name__=='__main__': main(sys.argv[0])
Zope-2.0.1-ZEO-nonbin/z2.py100755   1007   1403       41420  6767452013  15247 0ustar  petrillipetrilli##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################
"""Zope 2 ZServer start-up file

Usage: %(program)s [options] [environment settings]

Options:

  -h

    Output this text.

  -z path

    The location of the Zope installation.
    The default is the location of this script, %(here)s.

  -Z path

    Unix only! This option is ignored on windows.

    If this option is specified, a separate managemnt process will
    be created that restarts Zope after a shutdown (or crash).
    The path must point to a pid file that the process will record its
    process id in. The path may be relative, in which case it will be
    relative to the Zope location.

    To prevent use of a separate management process, provide an
    empty string: -Z ''

  -t n

    The number of threads to use, if ZODB3 is used. The default is
    %(NUMBER_OF_THREADS)s.

  -D

    Run in Zope debug mode.  This causes the Zope process not to
    detach from the controlling terminal, and is equivalent to
    supplying the environment variable setting Z_DEBUG_MODE=1

  -a ipaddress

    The IP address to listen on.  If this is an empty string
    (e.g. -a ''), then all addresses on the machine are used. The
    default is %(IP_ADDRESS)s.

  -d ipaddress

    IP address of your DNS server. If this is an empty string
    (e.g. -d ''), then IP addresses will not be logged. If you have
    DNS service on your local machine then you can set this to
    127.0.0.1.  The default is: %(DNS_IP)s.
    
  -u username or uid number
  
    The username to run ZServer as. You may want to run ZServer as 'nobody'
    or some other user with limited resouces. The only works under Unix, and
    if ZServer is started by root. The default is: %(UID)s

  -P number

    Set the web, ftp and monitor port numbers simultaneously
    as offsets from the number.  The web port number will be number+80.
    The FTP port number will be number+21.  The monitor port number will
    be number+99.
    
  -w port
  
    The Web server (HTTP) port.  This defaults to %(HTTP_PORT)s. The
    standard port for HTTP services is 80.  If this is an empty string
    (e.g. -w ''), then HTTP is disabled.

  -f port
  
    The FTP port.  If this is an empty string (e.g. -f ''), then FTP
    is disabled.  The standard port for FTP services is 21.  The
    default is %(FTP_PORT)s.

  -p path

    Path to the PCGI resource file.  The default value is
    %(PCGI_FILE)s, relative to the Zope location.  If this is an empty
    string (-p '') or the file does not exist, then PCGI is disabled.

  -m port
  
    The secure monitor server port. If this is an empty string
    (-m ''), then the monitor server is disabled. The monitor server
    allows interactive Python style access to a running ZServer. To
    access the server see medusa/monitor_client.py or
    medusa/monitor_client_win32.py. The monitor server password is the
    same as the Zope super manager password set in the 'access'
    file. The default is %(MONITOR_PORT)s.

  -l path

    Path to the ZServer log file. If this is a relative path then the
    log file will be written to the 'var' directory. The default is
    %(LOG_FILE)s. 

  -r
    
    Run ZServer is read-only mode. ZServer won't write anything to disk.
    No log files, no pid files, nothing. This means that you can't do a
    lot of stuff like use PCGI, and zdaemon. ZServer will log hits to
    STDOUT and zLOG will log to STDERR.

  -L
  
    Enable locale (internationalization) support. The value passed for
    this option should be the name of the locale to be used (see your
    operating system documentation for locale information specific to
    your system). If an empty string is passed for this option (-L ''),
    Zope will set the locale to the user's default setting (typically
    specified in the $LANG environment variable). If your Python
    installation does not support the locale module, the requested
    locale is not supported by your system or an empty string was
    passed but no default locale can be found, an error will be raised
    and Zope will not start.


Environment settings are of the form: NAME=VALUE.

Note: you *must* use Python 1.5.2 or later!
"""
import os, sys, getopt, string

program=sys.argv[0]
here=os.path.join(os.getcwd(), os.path.split(program)[0])
Zpid=''

########################################################################
# Configuration section

## General configuration options
##

# If you want run as a daemon, then uncomment the line below:
if sys.platform=='win32': Zpid=''
else: Zpid='var/zProcessManager.pid'

# This is the IP address of the network interface you want your servers to
# be visible from.  This can be changed to '' to listen on all interfaces.
IP_ADDRESS=''

# IP address of your DNS server. Set to '' if you do not want to resolve
# IP addresses. If you have DNS service on your local machine then you can
# set this to '127.0.0.1'
DNS_IP=''

# User id to run ZServer as. Note that this only works under Unix, and if
# ZServer is started by root.
UID='nobody'

# Log file location. If this is a relative path, then it is joined the
# the 'var' directory.
LOG_FILE='Z2.log'

## HTTP configuration
##

# Port for HTTP Server. The standard port for HTTP services is 80.
HTTP_PORT=8080

# HTTP enivornment settings.
HTTP_ENV={}

## FTP configuration

# Port for the FTP Server. The standard port for FTP services is 21.
FTP_PORT=8021

## PCGI configuration

# You can configure the PCGI server manually, or have it read its
# configuration information from a PCGI info file.
PCGI_FILE='Zope.cgi'

## Monitor configuration
MONITOR_PORT=8099

# Module to be published, which must be Main or Zope
MODULE='Zope'

# The size of the thread pool, if ZODB3 is used.
NUMBER_OF_THREADS=4

# Localization support
LOCALE_ID=None



#
########################################################################

########################################################################
# Handle command-line arguments:

try:
    if string.split(sys.version)[0] < '1.5.2':
        raise 'Invalid python version', string.split(sys.version)[0]
    
    opts, args = getopt.getopt(sys.argv[1:], 'hz:Z:t:a:d:u:w:f:p:m:Sl:2DP:rL:')
    DEBUG=0
    READ_ONLY=0
    
    # Get environment variables
    for a in args:
        if string.find(a,'='):
            a=string.split(a,'=')
            o=a[0]
            v=string.join(a[1:],'=')
            if o: 
              os.environ[o]=v
              HTTP_ENV[o]=v
        else:
            raise 'Invalid argument', a

    for o, v in opts:
        if o=='-z': here=v
        elif o=='-Z': Zpid=v
        elif o=='-r': READ_ONLY=1
        elif o=='-t':
            try: v=string.atoi(v)
            except: raise 'Invalid number of threads', v
            NUMBER_OF_THREADS=v
        elif o=='-a': IP_ADDRESS=v
        elif o=='-d': DNS_IP=v
        elif o=='-u': UID=v
        elif o=='-D':
            os.environ['Z_DEBUG_MODE']='1'
            DEBUG=1
        elif o=='-S': sys.ZMANAGED=1
        elif o=='-m':
            if v:
                try: 
                    v=string.atoi(v)
                    if v < 1: raise 'Invalid port', v
                except: raise 'Invalid port', v
            MONITOR_PORT=v
        elif o=='-w':
            if v:
                try: 
                    v=string.atoi(v)
                    if v < 1: raise 'Invalid port', v
                except: raise 'Invalid port', v
            HTTP_PORT=v
        elif o=='-f':
            if v:
                try:
                    v=string.atoi(v)
                    if v < 1: raise 'Invalid port', v
                except: raise 'Invalid port', v
            FTP_PORT=v
        elif o=='-P':
            if v:
                try: v=string.atoi(v)
                except: raise 'Invalid port', v
            FTP_PORT=v+21
            HTTP_PORT=v+80
            MONITOR_PORT=v+99
        elif o=='-p': PCGI_FILE=v
        elif o=='-h':
            print __doc__ % vars()
            sys.exit(0)
        elif o=='-2': MODULE='Main'
        elif o=='-l': LOG_FILE=v
        elif o=='-L':
            if v: LOCALE_ID=v
            else: LOCALE_ID=''

    __builtins__.__debug__=DEBUG

except SystemExit: sys.exit(0)
except:
    print __doc__ % vars()
    print
    print 'Error:'
    print "%s: %s" % (sys.exc_type, sys.exc_value)
    sys.exit(1)

if sys.platform=='win32': Zpid=''

#
########################################################################

########################################################################
# OK, let's get going!

# Jigger path:
sys.path=[os.path.join(here,'lib','python'),here
          ]+filter(None, sys.path)


# Try to set the locale if specified on the command
# line. If the locale module is not available or the
# requested locale is not supported by the local
# machine, raise an error so that the user is made
# aware of the problem.

def set_locale(val):
    try:
        import locale
    except:
        raise SystemExit, (
            'The locale module could not be imported.\n' \
            'To use localization options, you must ensure\n' \
            'that the locale module is compiled into your\n' \
            'Python installation.'
            )
    try:
        locale.setlocale(locale.LC_ALL, val)
    except:
        raise SystemExit, (
            'The specified locale is not supported by your system.\n' \
            'See your operating system documentation for more\n' \
            'information on locale support.'
            )
if LOCALE_ID is not None:
    set_locale(LOCALE_ID)



# from this point forward we can use the zope logger

# Import ZServer before we open the database or get at interesting
# application code so that ZServer's asyncore gets to be the
# official one.
import ZServer

if Zpid and not READ_ONLY:
    import zdaemon, App.FindHomes, posix
    sys.ZMANAGED=1
    
    zdaemon.run(sys.argv, os.path.join(INSTANCE_HOME, Zpid))

# Import Zope (or Main), and thus get SOFTWARE_HOME and INSTANCE_HOME
exec "import "+MODULE in {}

import zLOG
from Zope import ZLogger

if READ_ONLY:
    zLOG._stupid_dest=sys.stderr
else:
    zLOG.log_write = ZLogger.ZLogger.log_write


# Location of the ZServer log file. This file logs all ZServer activity.
# You may wish to create different logs for different servers. See
# medusa/logger.py for more information.
if not os.path.isabs(LOG_FILE):
    LOG_PATH=os.path.join(INSTANCE_HOME, 'var', LOG_FILE)
else:
    LOG_PATH=LOG_FILE

# Location of the ZServer pid file. When ZServer starts up it will write
# its PID to this file.
PID_FILE=os.path.join(INSTANCE_HOME, 'var', 'Z2.pid')


# import ZServer stuff

# First, we need to increase the number of threads
if MODULE=='Zope':
    from ZServer import setNumberOfThreads
    setNumberOfThreads(NUMBER_OF_THREADS)

from ZServer import resolver, logger, asyncore
from ZServer import zhttp_server, zhttp_handler, PCGIServer,FTPServer
from ZServer import secure_monitor_server

## ZServer startup
##

# Resolver and Logger, used by other servers
if DNS_IP:
    rs = resolver.caching_resolver(DNS_IP)
else:
    rs=None

if READ_ONLY:
    lg = logger.file_logger('-') # log to stdout
else:
    lg = logger.file_logger(LOG_PATH)

# HTTP Server
if HTTP_PORT:
    hs = zhttp_server(
        ip=IP_ADDRESS,
        port=HTTP_PORT,
        resolver=rs,
        logger_object=lg)

    # Handler for a published module. zhttp_handler takes 3 arguments:
    # The name of the module to publish, and optionally the URI base
    # which is basically the SCIRPT_NAME, and optionally a dictionary
    # with CGI environment variables which override default
    # settings. The URI base setting is useful when you want to
    # publish more than one module with the same HTTP server. The CGI
    # environment setting is useful when you want to proxy requests
    # from another web server to ZServer, and would like the CGI
    # environment to reflect the CGI environment of the other web
    # server.    
    zh = zhttp_handler(MODULE, '', HTTP_ENV)
    hs.install_handler(zh)


# FTP Server
if FTP_PORT:
    zftp = FTPServer(
        module=MODULE,
        port=FTP_PORT,
        resolver=rs,
        logger_object=lg)

# PCGI Server
if PCGI_FILE and not READ_ONLY:
    PCGI_FILE=os.path.join(here, PCGI_FILE)
    if os.path.exists(PCGI_FILE):
        zpcgi = PCGIServer(
            module=MODULE,
            ip=IP_ADDRESS,
            pcgi_file=PCGI_FILE,
            resolver=rs,
            logger_object=lg)

# Monitor Server
if MONITOR_PORT:
    from AccessControl.User import super
    monitor=secure_monitor_server(
        password=super._getPassword(),
        hostname='127.0.0.1',
        port=MONITOR_PORT)

# Try to set uid to server's uid. 
# This will only work if this script is run by root.
try:
    import pwd
    try:
        try:
            uid=string.atoi(UID)
        except:
            pass
        if type(UID) == type(""):
            uid = pwd.getpwnam(UID)[2]
        os.setuid(uid)
    except KeyError:
        zLOG.LOG("z2", zLOG.ERROR, ("can't find UID %s" % UID))
    
except:
    pass


# if it hasn't failed at this point, create a .pid file.
if not READ_ONLY:
    pf = open(PID_FILE, 'w')
    pid=str(os.getpid())
    try: pid=str(os.getppid())+' '+pid
    except: pass
    pf.write(pid)
    pf.close()

# Start Medusa, Ye Hass!
sys.ZServerExitCode=0
asyncore.loop()
sys.exit(sys.ZServerExitCode)








Zope-2.0.1-ZEO-nonbin/zpasswd.py100644   1007   1403       21110  6753562141  16375 0ustar  petrillipetrilli#!/usr/bin/env python
##############################################################################
# 
# Zope Public License (ZPL) Version 1.0
# -------------------------------------
# 
# Copyright (c) Digital Creations.  All rights reserved.
# 
# This license has been certified as Open Source(tm).
# 
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# 
# 1. Redistributions in 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. Digital Creations requests that attribution be given to Zope
#    in any manner possible. Zope includes a "Powered by Zope"
#    button that is installed by default. While it is not a license
#    violation to remove this button, it is requested that the
#    attribution remain. A significant investment has been put
#    into Zope, and this effort will continue if the Zope community
#    continues to grow. This is one way to assure that growth.
# 
# 4. All advertising materials and documentation mentioning
#    features derived from or use of this software must display
#    the following acknowledgement:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    In the event that the product being advertised includes an
#    intact Zope distribution (with copyright and license included)
#    then this clause is waived.
# 
# 5. Names associated with Zope or Digital Creations must not be used to
#    endorse or promote products derived from this software without
#    prior written permission from Digital Creations.
# 
# 6. Modified redistributions of any form whatsoever must retain
#    the following acknowledgment:
# 
#      "This product includes software developed by Digital Creations
#      for use in the Z Object Publishing Environment
#      (http://www.zope.org/)."
# 
#    Intact (re-)distributions of any official Zope release do not
#    require an external acknowledgement.
# 
# 7. Modifications are encouraged but must be packaged separately as
#    patches to official Zope releases.  Distributions that do not
#    clearly separate the patches from the original work must be clearly
#    labeled as unofficial distributions.  Modifications which do not
#    carry the name Zope may be packaged in any form, as long as they
#    conform to all of the clauses above.
# 
# 
# Disclaimer
# 
#   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
#   EXPRESSED 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 DIGITAL CREATIONS OR ITS
#   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 software consists of contributions made by Digital Creations and
# many individuals on behalf of Digital Creations.  Specific
# attributions are listed in the accompanying credits file.
# 
##############################################################################
"""Zope password change system"""

__version__='$Revision: 1.7 $ '[11:-2]

import sys, string, sha, binascii, whrandom, getopt, getpass, os

try:
    from crypt import crypt
except ImportError:
    crypt = None

def generate_salt():
    """Generate a salt value for the crypt function."""
    salt_choices = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" \
                   "abcdefghijklmnopqrstuvwxyz" \
                   "0123456789./"
    return whrandom.choice(salt_choices)

def generate_passwd(password, encoding):
    encoding=string.upper(encoding)
    if encoding == 'SHA':
        pw = '{SHA}' + binascii.b2a_base64(sha.new(password).digest())[:-1]
    elif encoding == 'CRYPT':
        pw = '{CRYPT}' + crypt(password, generate_salt())
    elif encoding == 'CLEARTEXT':
        pw = password

    return pw

def write_access(home, user='', group=''):
    import whrandom
    pw_choices = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" \
                 "abcdefghijklmnopqrstuvwxyz" \
                 "0123456789!"

    ac_path=os.path.join(home, 'access')
    if not os.path.exists(ac_path):
        print '-'*78
        print 'creating default access file'
        acfile=open(ac_path, 'w')
        pw = ''
        for i in range(8):
            pw = pw + whrandom.choice(pw_choices)
        acfile.write('superuser:' + generate_passwd(pw, 'SHA'))
        acfile.close()
        os.system('chmod 644 access')

        print """Note:
        The super user name and password are 'superuser'
        and '%s'.

        You can change the superuser name and password with the
        zpasswd script.  To find out more, type:

        %s zpasswd.py
        """ % (pw, sys.executable)

        import do; do.ch(ac_path, user, group)

def main(argv):
    short_options = ':u:p:e:d:'
    long_options = ['username=',
                    'password=',
                    'encoding=',
                    'domains=']

    usage = """%s [options] filename

If this program is called without command-line options, it will prompt
for all necessary information.  The available options are:

    -u / --username=
    Set the username to be used for the superuser

    -p / --password=
    Set the password

    -e / --encoding=
    Set the encryption/encoding rules.  Defaults to SHA-1. OPTIONAL

    -d / --domains=
    Set the domain names that the user user can log in from.  Defaults to
    any. OPTIONAL.

    Filename is not option, and should be the name of the file to store the
    information in.

Copyright (C) 1999 Digital Creations, Inc.
""" % argv[0]

    try:
        if len(argv) < 2:
            raise "CommandLineError"
        
        optlist, args = getopt.getopt(sys.argv[1:], short_options, long_options)

        if len(args) != 1:
            raise "CommandLineError"

        access_file = open(args[0], 'w')

        if len(optlist) > 0:
            # Set the sane defaults
            username = 'superuser'
            encoding = 'SHA'
            domains = ''
        
            for opt in optlist:
                if (opt[0] == '-u') or (opt[0] == '--username'):
                    username = opt[1]
                elif (opt[0] == '-p') or (opt[0] == '--password'):
                    password = opt[1]
                elif (opt[0] == '-e') or (opt[0] == '--encoding'):
                    encoding = opt[1]
                elif (opt[0] == '-d') or (opt[0] == '--domains'):
                    domains = ":" + opt[1]

            # Verify that we got what we need
            if not username or not password:
                raise "CommandLineError"

            access_file.write(username + ':' +
                              generate_passwd(password, encoding) +
                              domains)

        else:
            # Run through the prompts
            while 1:
                username = raw_input("Username: ")
                if username != '':
                    break
               
            while 1:
                password = getpass.getpass("Password: ")
                verify = getpass.getpass("Vefify password: ")
                if verify == password:
                    break
                else:
                    password = verify = ''
                    print "Password mismatch, please try again..."

            while 1:
                print """
Please choose a format from:

SHA - SHA-1 hashed password
CRYPT - UNIX-style crypt password
CLEARTEXT - no protection.
"""
                encoding = raw_input("Encoding: ")
                if encoding != '':
                    break

            domains = raw_input("Domain restrictions: ")
            if domains: domains = ":" + domains

            access_file.write(username + ":" +
                      generate_passwd(password, encoding) +
                      domains)
            
    except "CommandLineError":
        sys.stderr.write(usage)
        sys.exit(1)

    
# If called from the command line
if __name__=='__main__': main(sys.argv)