eb66cfe767
This patch implements the register/deregister/lookup operations for the sharding manager. As a result of this patch, the sharding driver now takes the control driver as a paramater. This gives it the access needed to make decisions about queue placement (and lookups) based on the entries in the control plane. In order to get the sharding manager working correctly, several methods had to be overridden to properly handle the QueueNotMapped error. When a QueueNotMapped error is encountered under normal conditions, it is equivalent to the target resource not being found. The overrides mimic the default behavior of those controllers' methods in the case where the queue isn't found. An inconsistency was found between the base storage driver and the concrete implementations. message_controller.list did not provide an include_claimed parameter. This has been corrected. To avoid DuplicateOptErrors in the mongodb driver in a sharded context, a filtering algorithm is applied. To make it clear to data drivers that they need to apply this filtering algorithm, conf.dynamic is set by the sharding driver. Unit tests have been added for the weighted select algorithm. Up next: sharded queue listing support, caching Change-Id: Ic36cd657ba13fa4c0b624dc5c71bfe99f9a70139 Partitally-implements: blueprint storage-sharding
67 lines
2.6 KiB
Python
67 lines
2.6 KiB
Python
# Copyright (c) 2013 Rackspace, Inc.
|
|
#
|
|
# Licensed under the Apache License, Version 2.0 (the "License");
|
|
# you may not use this file except in compliance with the License.
|
|
# You may obtain a copy of the License at
|
|
#
|
|
# http://www.apache.org/licenses/LICENSE-2.0
|
|
#
|
|
# Unless required by applicable law or agreed to in writing, software
|
|
# distributed under the License is distributed on an "AS IS" BASIS,
|
|
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
|
# implied.
|
|
# See the License for the specific language governing permissions and
|
|
# limitations under the License.
|
|
|
|
import testtools
|
|
|
|
from marconi.common.storage import select
|
|
|
|
|
|
class TestSelect(testtools.TestCase):
|
|
|
|
def test_weighted_returns_none_if_no_objs(self):
|
|
self.assertIsNone(select.weighted([]))
|
|
|
|
def test_weighted_returns_none_if_objs_have_zero_weight(self):
|
|
objs = [{'weight': 0, 'name': str(i)} for i in range(2)]
|
|
self.assertIsNone(select.weighted(objs))
|
|
|
|
def test_weighted_ignores_zero_weight_objs(self):
|
|
objs = [{'weight': 0, 'name': str(i)} for i in range(2)]
|
|
expect = {'weight': 1, 'name': 'theone'}
|
|
objs.append(expect)
|
|
self.assertEqual(select.weighted(objs), expect)
|
|
|
|
def test_weighted_returns_an_object_it_was_given(self):
|
|
objs = [{'weight': 10, 'name': str(i)} for i in range(10)]
|
|
ret = select.weighted(objs)
|
|
self.assertIn(ret, objs)
|
|
|
|
def test_weighted_returns_none_if_selector_oob(self):
|
|
objs = [{'weight': 10, 'name': str(i)} for i in range(10)]
|
|
sum_weights = sum([o['weight'] for o in objs])
|
|
capped_gen = lambda x, y: sum_weights
|
|
self.assertIsNone(select.weighted(objs,
|
|
generator=capped_gen))
|
|
|
|
def test_weighted_returns_first_if_selector_is_zero(self):
|
|
objs = [{'weight': 10, 'name': str(i)} for i in range(10)]
|
|
zero_gen = lambda x, y: 0
|
|
self.assertEqual(select.weighted(objs, generator=zero_gen),
|
|
objs[0])
|
|
|
|
def test_weighted_returns_last_if_selector_is_sum_minus_one(self):
|
|
objs = [{'weight': 10, 'name': str(i)} for i in range(10)]
|
|
sum_weights = sum([o['weight'] for o in objs])
|
|
capped_gen = lambda x, y: sum_weights - 1
|
|
self.assertEqual(select.weighted(objs, generator=capped_gen),
|
|
objs[-1])
|
|
|
|
def test_weighted_boundaries(self):
|
|
objs = [{'weight': 1, 'name': str(i)} for i in range(3)]
|
|
for i in range(len(objs)):
|
|
fixed_gen = lambda x, y: i
|
|
self.assertEqual(select.weighted(objs, generator=fixed_gen),
|
|
objs[i])
|