Commit 31d8fcb9 authored by Barry Warsaw's avatar Barry Warsaw

Code cleanup, and fixed comments.

parent 27cc5663
############################################################################## ##############################################################################
# #
# Copyright (c) 2001, 2002 Zope Corporation and Contributors. # Copyright (c) 2001, 2002, 2003 Zope Corporation and Contributors.
# All Rights Reserved. # All Rights Reserved.
# #
# This software is subject to the provisions of the Zope Public License, # This software is subject to the provisions of the Zope Public License,
...@@ -13,118 +13,50 @@ ...@@ -13,118 +13,50 @@
############################################################################## ##############################################################################
"""Very Simple Mapping ZODB storage """Very Simple Mapping ZODB storage
The Mapping storage provides an extremely simple storage The Mapping storage provides an extremely simple storage implementation that
implementation that doesn't provide undo or version support. doesn't provide undo or version support.
It is meant to illustrate the simplest possible storage. It is meant to illustrate the simplest possible storage.
The Mapping storage uses a single data structure to map The Mapping storage uses a single data structure to map object ids to data.
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.9 $'[11:-2]
""" from ZODB import utils
__version__='$Revision: 1.8 $'[11:-2] from ZODB import BaseStorage
from ZODB import POSException
from ZODB.TimeStamp import TimeStamp
import POSException, BaseStorage, string, utils
from TimeStamp import TimeStamp
class MappingStorage(BaseStorage.BaseStorage): class MappingStorage(BaseStorage.BaseStorage):
def __init__(self, name='Mapping Storage'): def __init__(self, name='Mapping Storage'):
BaseStorage.BaseStorage.__init__(self, name) BaseStorage.BaseStorage.__init__(self, name)
self._index = {}
self._index={} self._tindex = []
self._tindex=[]
self._ltid = None self._ltid = None
# Note: If you subclass this and use a persistent mapping facility
# Note: # (e.g. a dbm file), you will need to get the maximum key and save it
# If you subclass this and use a persistent mapping facility # as self._oid. See dbmStorage.
# (e.g. a dbm file), you will need to get the maximum key and
# save it as self._oid. See dbmStorage.
def __len__(self): def __len__(self):
return len(self._index) return len(self._index)
def getSize(self): def getSize(self):
s=32 # These constants are for Python object memory overheads
index=self._index s = 32
for oid in index.keys(): for oid in self._index.keys():
p=index[oid] p = self._index[oid]
s=s+56+len(p) s += 56 + len(p)
return s return s
def load(self, oid, version): def load(self, oid, version):
self._lock_acquire() self._lock_acquire()
try: try:
p=self._index[oid] p = self._index[oid]
return p[8:], p[:8] # pickle, serial return p[8:], p[:8] # pickle, serial
finally: self._lock_release() finally:
self._lock_release()
def store(self, oid, serial, data, version, transaction): def store(self, oid, serial, data, version, transaction):
if transaction is not self._transaction: if transaction is not self._transaction:
...@@ -136,67 +68,61 @@ class MappingStorage(BaseStorage.BaseStorage): ...@@ -136,67 +68,61 @@ class MappingStorage(BaseStorage.BaseStorage):
self._lock_acquire() self._lock_acquire()
try: try:
if self._index.has_key(oid): if self._index.has_key(oid):
old=self._index[oid] old = self._index[oid]
oserial=old[:8] oserial = old[:8]
if serial != oserial: if serial != oserial:
raise POSException.ConflictError(serials=(oserial, serial)) raise POSException.ConflictError(serials=(oserial, serial))
serial=self._serial serial = self._serial
self._tindex.append((oid,serial+data)) self._tindex.append((oid, serial+data))
finally: self._lock_release() finally:
self._lock_release()
return serial return serial
def _clear_temp(self): def _clear_temp(self):
self._tindex=[] self._tindex = []
def _finish(self, tid, user, desc, ext): def _finish(self, tid, user, desc, ext):
for oid, p in self._tindex:
index=self._index self._index[oid] = p
for oid, p in self._tindex: index[oid]=p
self._ltid = self._serial self._ltid = self._serial
def lastTransaction(self): def lastTransaction(self):
return self._ltid return self._ltid
def pack(self, t, referencesf): def pack(self, t, referencesf):
self._lock_acquire() self._lock_acquire()
try: try:
# Build an index of *only* those objects reachable # Build an index of *only* those objects reachable from the root.
# from the root. rootl = ['\0\0\0\0\0\0\0\0']
index=self._index pindex = {}
rootl=['\0\0\0\0\0\0\0\0']
pop=rootl.pop
pindex={}
referenced=pindex.has_key
while rootl: while rootl:
oid=pop() oid = rootl.pop()
if referenced(oid): continue if pindex.has_key(oid):
continue
# Scan non-version pickle for references # Scan non-version pickle for references
r=index[oid] r = self._index[oid]
pindex[oid]=r pindex[oid] = r
p=r[8:] p = r[8:]
referencesf(p, rootl) referencesf(p, rootl)
# Now delete any unreferenced entries: # Now delete any unreferenced entries:
for oid in index.keys(): for oid in self._index.keys():
if not referenced(oid): del index[oid] if not pindex.has_key(oid):
del self._index[oid]
finally: self._lock_release() finally:
self._lock_release()
def _splat(self): def _splat(self):
"""Spit out a string showing state. """Spit out a string showing state."""
""" o = []
o=[]
o.append('Index:') o.append('Index:')
index=self._index keys = self._index.keys()
keys=index.keys()
keys.sort() keys.sort()
for oid in keys: for oid in keys:
r=index[oid] r = self._index[oid]
o.append(' %s: %s, %s' % o.append(' %s: %s, %s' %
(utils.u64(oid),TimeStamp(r[:8]),`r[8:]`)) (utils.u64(oid),TimeStamp(r[:8]),`r[8:]`))
return string.join(o,'\n') return '\n'.join(o)
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment