root / snf-pithos-backend / pithos / backends / lib / hashfiler / store.py @ fda50d75
History | View | Annotate | Download (3 kB)
1 |
# Copyright 2011-2012 GRNET S.A. All rights reserved.
|
---|---|
2 |
#
|
3 |
# Redistribution and use in source and binary forms, with or
|
4 |
# without modification, are permitted provided that the following
|
5 |
# conditions are met:
|
6 |
#
|
7 |
# 1. Redistributions of source code must retain the above
|
8 |
# copyright notice, this list of conditions and the following
|
9 |
# disclaimer.
|
10 |
#
|
11 |
# 2. Redistributions in binary form must reproduce the above
|
12 |
# copyright notice, this list of conditions and the following
|
13 |
# disclaimer in the documentation and/or other materials
|
14 |
# provided with the distribution.
|
15 |
#
|
16 |
# THIS SOFTWARE IS PROVIDED BY GRNET S.A. ``AS IS'' AND ANY EXPRESS
|
17 |
# OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
18 |
# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
19 |
# PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GRNET S.A OR
|
20 |
# CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
21 |
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
22 |
# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
23 |
# USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
|
24 |
# AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
25 |
# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
26 |
# ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
27 |
# POSSIBILITY OF SUCH DAMAGE.
|
28 |
#
|
29 |
# The views and conclusions contained in the software and
|
30 |
# documentation are those of the authors and should not be
|
31 |
# interpreted as representing official policies, either expressed
|
32 |
# or implied, of GRNET S.A.
|
33 |
|
34 |
import os |
35 |
|
36 |
from blocker import Blocker |
37 |
from mapper import Mapper |
38 |
|
39 |
|
40 |
class Store(object): |
41 |
"""Store.
|
42 |
Required constructor parameters: path, block_size, hash_algorithm,
|
43 |
umask, blockpool, mappool.
|
44 |
"""
|
45 |
|
46 |
def __init__(self, **params): |
47 |
umask = params['umask']
|
48 |
if umask is not None: |
49 |
os.umask(umask) |
50 |
|
51 |
pb = {'blocksize': params['block_size'], |
52 |
'hashtype': params['hash_algorithm'], |
53 |
} |
54 |
self.blocker = Blocker(**pb)
|
55 |
pm = {'namelen': self.blocker.hashlen, |
56 |
} |
57 |
self.mapper = Mapper(**pm)
|
58 |
|
59 |
def map_get(self, name): |
60 |
return self.mapper.map_retr(name) |
61 |
|
62 |
def map_get_archipelago(self, name, size): |
63 |
return self.mapper.map_retr_archipelago(name, size) |
64 |
|
65 |
def map_put(self, name, map): |
66 |
self.mapper.map_stor(name, map) |
67 |
|
68 |
def map_delete(self, name): |
69 |
pass
|
70 |
|
71 |
def block_get(self, hash): |
72 |
blocks = self.blocker.block_retr((hash,)) |
73 |
if not blocks: |
74 |
return None |
75 |
return blocks[0] |
76 |
|
77 |
def block_get_archipelago(self, hash): |
78 |
blocks = self.blocker.block_retr_archipelago((hash,)) |
79 |
if not blocks: |
80 |
return None |
81 |
return blocks[0] |
82 |
|
83 |
def block_put(self, data): |
84 |
hashes, absent = self.blocker.block_stor((data,))
|
85 |
return hashes[0] |
86 |
|
87 |
def block_update(self, hash, offset, data): |
88 |
h, e = self.blocker.block_delta(hash, offset, data) |
89 |
return h
|
90 |
|
91 |
def block_search(self, map): |
92 |
return self.blocker.block_ping(map) |