]> www.ginac.de Git - cln.git/blob - src/vector/cl_GV_number.cc
cl_{GV,SV}: use std::size_t for size of vectors (instead of obscure uintC).
[cln.git] / src / vector / cl_GV_number.cc
1 // cl_make_heap_GV_number().
2
3 // General includes.
4 #include "base/cl_sysdep.h"
5
6 // Specification.
7 #include "cln/GV_number.h"
8
9
10 // Implementation.
11
12 #include "cln/exception.h"
13 #include "base/cl_offsetof.h"
14
15 namespace cln {
16
17 static void cl_gvector_number_destructor (cl_heap* pointer)
18 {
19 #if (defined(__mips__) || defined(__mips64__)) && !defined(__GNUC__) // workaround SGI CC bug
20         (*(cl_heap_GV_number*)pointer).~cl_heap_GV();
21 #else
22         (*(cl_heap_GV_number*)pointer).~cl_heap_GV_number();
23 #endif
24 }
25
26 // XXX: this ought to be const, but it would be impossible to register
27 // the printing function (in cl_GV_number_debug.cc)
28 cl_class& cl_class_gvector_number()
29 {
30         static cl_class instance = {
31                 cl_gvector_number_destructor,
32                 0
33         };
34         return instance;
35 }
36
37 static inline cl_heap_GV_number * outcast (cl_GV_inner<cl_number>* vec)
38 {
39         return (cl_heap_GV_number *)((char *) vec - offsetof(cl_heap_GV_number,v));
40 }
41 static inline const cl_heap_GV_number * outcast (const cl_GV_inner<cl_number>* vec)
42 {
43         return (const cl_heap_GV_number *)((const char *) vec - offsetof(cl_heap_GV_number,v));
44 }
45
46
47 // Vectors of numbers.
48
49 struct cl_heap_GV_number_general : public cl_heap_GV_number {
50         cl_number data[1];
51         // Standard allocation disabled.
52         void* operator new (size_t size) { unused size; throw runtime_exception(); }
53         // Standard deallocation disabled.
54         void operator delete (void* ptr) { unused ptr; throw runtime_exception(); }
55         // No default constructor.
56         cl_heap_GV_number_general ();
57 };
58
59 static const cl_number general_element (const cl_GV_inner<cl_number>* vec, std::size_t index)
60 {
61         return ((const cl_heap_GV_number_general *) outcast(vec))->data[index];
62 }
63
64 static void general_set_element (cl_GV_inner<cl_number>* vec, std::size_t index, const cl_number& x)
65 {
66         ((cl_heap_GV_number_general *) outcast(vec))->data[index] = x;
67 }
68
69 static void general_do_delete (cl_GV_inner<cl_number>* vec)
70 {
71         cl_heap_GV_number_general* hv = (cl_heap_GV_number_general *) outcast(vec);
72         std::size_t len = hv->v.size();
73         for (std::size_t i = 0; i < len; i++)
74                 hv->data[i].~cl_number();
75 }
76
77 static void general_copy_elements (const cl_GV_inner<cl_number>* srcvec, std::size_t srcindex, cl_GV_inner<cl_number>* destvec, std::size_t destindex, std::size_t count)
78 {
79         if (count > 0) {
80                 const cl_heap_GV_number_general* srcv =
81                   (const cl_heap_GV_number_general *) outcast(srcvec);
82                 cl_heap_GV_number_general* destv =
83                   (cl_heap_GV_number_general *) outcast(destvec);
84                 std::size_t srclen = srcv->v.size();
85                 std::size_t destlen = destv->v.size();
86                 if (!(srcindex <= srcindex+count && srcindex+count <= srclen))
87                         throw runtime_exception();
88                 if (!(destindex <= destindex+count && destindex+count <= destlen))
89                         throw runtime_exception();
90                 do {
91                         destv->data[destindex++] = srcv->data[srcindex++];
92                 } while (--count > 0);
93         }
94 }
95
96
97 cl_heap_GV_number* cl_make_heap_GV_number (std::size_t len)
98 {
99         static cl_GV_vectorops<cl_number> general_vectorops = {
100                 general_element,
101                 general_set_element,
102                 general_do_delete,
103                 general_copy_elements
104         };
105
106         cl_heap_GV_number_general* hv = (cl_heap_GV_number_general*) malloc_hook(offsetofa(cl_heap_GV_number_general,data)+sizeof(cl_number)*len);
107         hv->refcount = 1;
108         hv->type = &cl_class_gvector_number();
109         new (&hv->v) cl_GV_inner<cl_number> (len,&general_vectorops);
110         for (std::size_t i = 0; i < len; i++)
111                 init1(cl_number, hv->data[i]) ();
112         return hv;
113 }
114
115 // An empty vector.
116 const cl_GV_number cl_null_GV_number = cl_null_GV_number;
117
118 int cl_GV_number_init_helper::count = 0;
119
120 cl_GV_number_init_helper::cl_GV_number_init_helper()
121 {
122         if (count++ == 0)
123                 new ((void *)&cl_null_GV_number) cl_GV_number((std::size_t)0);
124 }
125
126 cl_GV_number_init_helper::~cl_GV_number_init_helper()
127 {
128         if (--count == 0) {
129                 // Nothing to clean up
130         }
131 }
132
133 }  // namespace cln
134