File: malloc_aligned.hpp

package info (click to toggle)
supercollider 1%3A3.13.0%2Brepack-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 80,292 kB
  • sloc: cpp: 476,363; lisp: 84,680; ansic: 77,685; sh: 25,509; python: 7,909; makefile: 3,440; perl: 1,964; javascript: 974; xml: 826; java: 677; yacc: 314; lex: 175; objc: 152; ruby: 136
file content (98 lines) | stat: -rw-r--r-- 2,719 bytes parent folder | download | duplicates (4)
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
//  functions for aligned memory allocation
//  Copyright (C) 2009 Tim Blechmann
//
//  This program is free software; you can redistribute it and/or modify
//  it under the terms of the GNU General Public License as published by
//  the Free Software Foundation; either version 2 of the License, or
//  (at your option) any later version.
//
//  This program is distributed in the hope that it will be useful,
//  but WITHOUT ANY WARRANTY; without even the implied warranty of
//  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//  GNU General Public License for more details.
//
//  You should have received a copy of the GNU General Public License
//  along with this program; see the file COPYING.  If not, write to
//  the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
//  Boston, MA 02111-1307, USA.

#pragma once

#include <cstdlib>
#include <cstring>

#include <new> // for std::bad_alloc
#include <utility> // for std::forward

#include <boost/align/aligned_alloc.hpp>

#include "function_attributes.h"

namespace nova {

const int malloc_memory_alignment = 64;

inline void* MALLOC ASSUME_ALIGNED(64) malloc_aligned(std::size_t bytes) {
    return boost::alignment::aligned_alloc(malloc_memory_alignment, bytes);
}

inline void free_aligned(void* ptr) { return boost::alignment::aligned_free(ptr); }

inline void* MALLOC ASSUME_ALIGNED(64) calloc_aligned(std::size_t bytes) {
    void* ret = malloc_aligned(bytes);
    if (ret)
        std::memset(ret, 0, bytes);
    return ret;
}

template <typename T> T* MALLOC ASSUME_ALIGNED(64) malloc_aligned(std::size_t n) {
    return static_cast<T*>(malloc_aligned(n * sizeof(T)));
}

template <typename T> T* MALLOC ASSUME_ALIGNED(64) calloc_aligned(std::size_t n) {
    return static_cast<T*>(calloc_aligned(n * sizeof(T)));
}


/** smart-pointer, freeing the managed pointer via free_aligned */
template <class T, bool managed = true> class aligned_storage_ptr {
public:
    explicit aligned_storage_ptr(T* p = 0): ptr(p) {}

    explicit aligned_storage_ptr(size_t count): ptr(malloc_aligned<T>(count)) {}

    ~aligned_storage_ptr(void) {
        if (managed && ptr)
            free_aligned(ptr);
    }

    void reset(T* p = 0) {
        if (managed && ptr)
            free_aligned(ptr);
        ptr = p;
    }

    T& operator*() const { return *ptr; }

    T* operator->() const { return ptr; }

    T* get() const { return ptr; }

    aligned_storage_ptr& operator=(T* p) {
        reset(p);
        return *this;
    }

    operator bool() const { return bool(ptr); }

    void swap(aligned_storage_ptr& b) {
        T* p = ptr;
        ptr = b.ptr;
        b.ptr = p;
    }

private:
    T* ptr;
};

} /* namespace nova */