aboutsummaryrefslogtreecommitdiffstats
path: root/resources/libraries/python/IncrementUtil.py
blob: fca0839ac0ffbf35028761ff3004164a1792d067 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
# Copyright (c) 2021 PANTHEON.tech s.r.o.
# 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.

"""Increment utilities library."""


class ObjIncrement(object):
    """
    An iterator class used to generate incremented values in each iteration
    or when inc_fmt is called.

    Subclasses should override:
        _incr: when a simple '+' binary operation isn't sufficient.
        _str_fmt: when a simple str representation of the incremented object
            isn't the proper format.
    """
    def __init__(self, initial_value, increment):
        """
        :param initial_value: The first value to be returned.
        :param increment: Each iteration/inc_fmt call will return the previous
            value incremented by this.
        :type initial_value: object supporting the '+' binary operation
        :type increment: object supporting the '+' binary operation
        """
        self._value = initial_value
        self._increment = increment

    def _incr(self):
        """
        This function will be called in each iteration/inc_fmt call. Subclasses
        should override this when their object is incremented differently.
        The function must compute the next iterated value and store it in
        self._value.
        """
        self._value += self._increment

    def __next__(self):
        """
        Each iteration returns the current object and stores the incremented
        object (which will be returned in the next iteration). The first
        iteration returns the initial value.
        """
        return_value = self._value
        self._incr()
        return return_value

    def __iter__(self):
        return self

    def _str_fmt(self):
        """
        The string representation is a standard string representation of the
        incremented object. Subclasses may override this for a different
        string representation.
        """
        return str(self._value)

    def inc_fmt(self):
        """
        Return a string representation and increment the current value.
        """
        return_value = self._str_fmt()
        self._incr()
        return return_value
lass="p">); return r; } always_inline uword clib_fifo_free_elts (void *v) { return clib_fifo_len (v) - clib_fifo_elts (v); } always_inline void clib_fifo_reset (void *v) { clib_fifo_header_t *f = clib_fifo_header (v); if (v) { f->head_index = f->tail_index = 0; vec_set_len (v, 0); } } /* External resize function. */ void *_clib_fifo_resize (void *v, uword n_elts, uword align, uword elt_bytes); #define clib_fifo_resize(f, n_elts) \ f = _clib_fifo_resize ((f), (n_elts), _vec_align (f, 0), _vec_elt_sz (f)) always_inline void * _clib_fifo_validate (void *v, uword n_elts, uword align, uword elt_bytes) { if (clib_fifo_free_elts (v) < n_elts) v = _clib_fifo_resize (v, n_elts, align, elt_bytes); return v; } #define clib_fifo_validate(f, n_elts) \ f = _clib_fifo_validate ((f), (n_elts), _vec_align (f, 0), _vec_elt_sz (f)) /* Advance tail pointer by N_ELTS which can be either positive or negative. */ always_inline void * _clib_fifo_advance_tail (void *v, word n_elts, uword align, uword elt_bytes, uword *tail_return) { word i, l, n_free; clib_fifo_header_t *f; n_free = clib_fifo_free_elts (v); if (n_free < n_elts) { v = _clib_fifo_resize (v, n_elts, align, elt_bytes); n_free = clib_fifo_free_elts (v); } ASSERT (n_free >= n_elts); n_free -= n_elts; f = clib_fifo_header (v); l = _clib_fifo_len (v); i = f->tail_index; if (n_free == 0) { /* Mark fifo full. */ f->tail_index = f->head_index + l; } else { word n = f->tail_index + n_elts; if (n >= l) n -= l; else if (n < 0) n += l; ASSERT (n >= 0 && n < l); f->tail_index = n; } ASSERT (clib_fifo_free_elts (v) == n_free); if (tail_return) *tail_return = n_elts > 0 ? i : f->tail_index; return v; } #define clib_fifo_advance_tail(f, n_elts) \ ({ \ uword _i; \ (f) = _clib_fifo_advance_tail ((f), (n_elts), _vec_align (f, 0), \ _vec_elt_sz (f), &_i); \ (f) + _i; \ }) always_inline uword clib_fifo_advance_head (void *v, uword n_elts) { clib_fifo_header_t *f; uword l, i, n; ASSERT (clib_fifo_elts (v) >= n_elts); f = clib_fifo_header (v); l = _clib_fifo_len (v); /* If fifo was full, restore tail pointer. */ if (f->tail_index == f->head_index + l) f->tail_index = f->head_index; n = i = f->head_index; n += n_elts; n = n >= l ? n - l : n; ASSERT (n < l); f->head_index = n; return i; } /* Add given element to fifo. */ #define clib_fifo_add1(f, e) \ do \ { \ uword _i; \ (f) = _clib_fifo_advance_tail ((f), 1, _vec_align (f, 0), \ _vec_elt_sz (f), &_i); \ (f)[_i] = (e); \ } \ while (0) /* Add element to fifo; return pointer to new element. */ #define clib_fifo_add2(f, p) \ do \ { \ uword _i; \ (f) = _clib_fifo_advance_tail ((f), 1, _vec_align (f, 0), \ _vec_elt_sz (f), &_i); \ (p) = (f) + _i; \ } \ while (0) /* Add several elements to fifo. */ #define clib_fifo_add(f, e, n) \ do \ { \ uword _i, _l; \ word _n0, _n1; \ \ _n0 = (n); \ (f) = _clib_fifo_advance_tail ((f), _n0, _vec_align (f, 0), \ _vec_elt_sz (f), &_i); \ _l = clib_fifo_len (f); \ _n1 = _i + _n0 - _l; \ _n1 = _n1 < 0 ? 0 : _n1; \ _n0 -= _n1; \ clib_memcpy_fast ((f) + _i, (e), _n0 * sizeof ((f)[0])); \ if (_n1) \ clib_memcpy_fast ((f) + 0, (e) + _n0, _n1 * sizeof ((f)[0])); \ } \ while (0) /* Subtract element from fifo. */ #define clib_fifo_sub1(f,e) \ do { \ uword _i; \ ASSERT (clib_fifo_elts (f) >= 1); \ _i = clib_fifo_advance_head ((f), 1); \ (e) = (f)[_i]; \ } while (0) #define clib_fifo_sub2(f,p) \ do { \ uword _i; \ ASSERT (clib_fifo_elts (f) >= 1); \ _i = clib_fifo_advance_head ((f), 1); \ (p) = (f) + _i; \ } while (0) always_inline uword clib_fifo_head_index (void *v) { clib_fifo_header_t *f = clib_fifo_header (v); return v ? f->head_index : 0; } always_inline uword clib_fifo_tail_index (void *v) { clib_fifo_header_t *f = clib_fifo_header (v); return v ? f->tail_index : 0; } #define clib_fifo_head(v) ((v) + clib_fifo_head_index (v)) #define clib_fifo_tail(v) ((v) + clib_fifo_tail_index (v)) #define clib_fifo_free(f) vec_free ((f)) always_inline uword clib_fifo_elt_index (void *v, uword i) { clib_fifo_header_t *f = clib_fifo_header (v); uword result = 0; ASSERT (i < clib_fifo_elts (v)); if (v) { result = f->head_index + i; if (result >= _vec_len (v)) result -= _vec_len (v); } return result; } #define clib_fifo_elt_at_index(v, i) ((v) + (i)) #define clib_fifo_foreach(v,f,body) \ do { \ uword _i, _l, _n; \ \ _i = clib_fifo_head_index (f); \ _l = clib_fifo_len (f); \ _n = clib_fifo_elts (f); \ while (_n > 0) \ { \ (v) = (f) + _i; \ do { body; } while (0); \ _n--; \ _i++; \ _i = _i >= _l ? 0 : _i; \ } \ } while (0) #endif /* included_fifo_h */ /* * fd.io coding-style-patch-verification: ON * * Local Variables: * eval: (c-set-style "gnu") * End: */