3 * Copyright 2006 Free Software Foundation, Inc.
5 * This file is part of GNU Radio
7 * GNU Radio is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2, or (at your option)
12 * GNU Radio is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with GNU Radio; see the file COPYING. If not, write to
19 * the Free Software Foundation, Inc., 51 Franklin Street,
20 * Boston, MA 02110-1301, USA.
32 static const int CACHE_LINE_SIZE = 64; // good guess
34 # if (PMT_LOCAL_ALLOCATOR)
36 static pmt_pool global_pmt_pool(sizeof(pmt_pair), CACHE_LINE_SIZE);
39 pmt_base::operator new(size_t size)
41 void *p = global_pmt_pool.malloc();
43 // fprintf(stderr, "pmt_base::new p = %p\n", p);
44 assert((reinterpret_cast<intptr_t>(p) & (CACHE_LINE_SIZE - 1)) == 0);
49 pmt_base::operator delete(void *p, size_t size)
51 global_pmt_pool.free(p);
59 // nop -- out of line virtual destructor
62 ////////////////////////////////////////////////////////////////////////////
64 ////////////////////////////////////////////////////////////////////////////
66 pmt_exception::pmt_exception(const std::string &msg, pmt_t obj)
67 : logic_error(msg + ": " + pmt_write_string(obj))
71 pmt_wrong_type::pmt_wrong_type(const std::string &msg, pmt_t obj)
72 : pmt_exception(msg + ": wrong_type ", obj)
76 pmt_out_of_range::pmt_out_of_range(const std::string &msg, pmt_t obj)
77 : pmt_exception(msg + ": out of range ", obj)
81 pmt_notimplemented::pmt_notimplemented(const std::string &msg, pmt_t obj)
82 : pmt_exception(msg + ": notimplemented ", obj)
86 ////////////////////////////////////////////////////////////////////////////
88 ////////////////////////////////////////////////////////////////////////////
93 return dynamic_cast<pmt_symbol*>(x.get());
99 return dynamic_cast<pmt_integer*>(x.get());
105 return dynamic_cast<pmt_real*>(x.get());
111 return dynamic_cast<pmt_complex*>(x.get());
117 return dynamic_cast<pmt_pair*>(x.get());
123 return dynamic_cast<pmt_vector*>(x.get());
126 static pmt_uniform_vector *
127 _uniform_vector(pmt_t x)
129 return dynamic_cast<pmt_uniform_vector*>(x.get());
135 return dynamic_cast<pmt_dict*>(x.get());
141 return dynamic_cast<pmt_any*>(x.get());
144 ////////////////////////////////////////////////////////////////////////////
146 ////////////////////////////////////////////////////////////////////////////
148 const pmt_t PMT_T = pmt_t(new pmt_bool()); // singleton
149 const pmt_t PMT_F = pmt_t(new pmt_bool()); // singleton
150 const pmt_t PMT_NIL = pmt_t(new pmt_null()); // singleton
151 const pmt_t PMT_EOF = pmt_cons(PMT_NIL, PMT_NIL); // singleton
153 ////////////////////////////////////////////////////////////////////////////
155 ////////////////////////////////////////////////////////////////////////////
157 pmt_bool::pmt_bool(){}
160 pmt_is_true(pmt_t obj)
166 pmt_is_false(pmt_t obj)
172 pmt_is_bool(pmt_t obj)
174 return obj->is_bool();
178 pmt_from_bool(bool val)
180 return val ? PMT_T : PMT_F;
184 pmt_to_bool(pmt_t val)
190 throw pmt_wrong_type("pmt_to_bool", val);
193 ////////////////////////////////////////////////////////////////////////////
195 ////////////////////////////////////////////////////////////////////////////
197 static const unsigned int SYMBOL_HASH_TABLE_SIZE = 701;
198 static std::vector<pmt_t> s_symbol_hash_table(SYMBOL_HASH_TABLE_SIZE);
200 pmt_symbol::pmt_symbol(const std::string &name) : d_name(name){}
204 hash_string(const std::string &s)
209 for (std::string::const_iterator p = s.begin(); p != s.end(); ++p){
210 h = (h << 4) + (*p & 0xff);
221 pmt_is_symbol(pmt_t obj)
223 return obj->is_symbol();
227 pmt_string_to_symbol(const std::string &name)
229 unsigned hash = hash_string(name) % SYMBOL_HASH_TABLE_SIZE;
231 // Does a symbol with this name already exist?
232 for (pmt_t sym = s_symbol_hash_table[hash]; sym; sym = _symbol(sym)->next()){
233 if (name == _symbol(sym)->name())
234 return sym; // Yes. Return it
237 // Nope. Make a new one.
238 pmt_t sym = pmt_t(new pmt_symbol(name));
239 _symbol(sym)->set_next(s_symbol_hash_table[hash]);
240 s_symbol_hash_table[hash] = sym;
246 pmt_intern(const std::string &name)
248 return pmt_string_to_symbol(name);
252 pmt_symbol_to_string(pmt_t sym)
254 if (!sym->is_symbol())
255 throw pmt_wrong_type("pmt_symbol_to_string", sym);
257 return _symbol(sym)->name();
262 ////////////////////////////////////////////////////////////////////////////
264 ////////////////////////////////////////////////////////////////////////////
267 pmt_is_number(pmt_t x)
269 return x->is_number();
272 ////////////////////////////////////////////////////////////////////////////
274 ////////////////////////////////////////////////////////////////////////////
276 pmt_integer::pmt_integer(long value) : d_value(value) {}
279 pmt_is_integer(pmt_t x)
281 return x->is_integer();
286 pmt_from_long(long x)
288 return pmt_t(new pmt_integer(x));
295 return _integer(x)->value();
297 throw pmt_wrong_type("pmt_to_long", x);
300 ////////////////////////////////////////////////////////////////////////////
302 ////////////////////////////////////////////////////////////////////////////
304 pmt_real::pmt_real(double value) : d_value(value) {}
313 pmt_from_double(double x)
315 return pmt_t(new pmt_real(x));
319 pmt_to_double(pmt_t x)
322 return _real(x)->value();
324 return _integer(x)->value();
326 throw pmt_wrong_type("pmt_to_double", x);
329 ////////////////////////////////////////////////////////////////////////////
331 ////////////////////////////////////////////////////////////////////////////
333 pmt_complex::pmt_complex(std::complex<double> value) : d_value(value) {}
336 pmt_is_complex(pmt_t x)
338 return x->is_complex();
342 pmt_make_rectangular(double re, double im)
344 return pmt_t(new pmt_complex(std::complex<double>(re, im)));
348 pmt_to_complex(pmt_t x)
351 return _complex(x)->value();
353 return _real(x)->value();
355 return _integer(x)->value();
357 throw pmt_wrong_type("pmt_to_complex", x);
360 ////////////////////////////////////////////////////////////////////////////
362 ////////////////////////////////////////////////////////////////////////////
364 pmt_null::pmt_null() {}
365 pmt_pair::pmt_pair(pmt_t car, pmt_t cdr) : d_car(car), d_cdr(cdr) {}
374 pmt_is_pair(pmt_t obj)
376 return obj->is_pair();
380 pmt_cons(pmt_t x, pmt_t y)
382 return pmt_t(new pmt_pair(x, y));
389 return _pair(pair)->car();
391 throw pmt_wrong_type("pmt_car", pair);
398 return _pair(pair)->cdr();
400 throw pmt_wrong_type("pmt_cdr", pair);
404 pmt_set_car(pmt_t pair, pmt_t obj)
407 _pair(pair)->set_car(obj);
409 throw pmt_wrong_type("pmt_set_car", pair);
413 pmt_set_cdr(pmt_t pair, pmt_t obj)
416 _pair(pair)->set_cdr(obj);
418 throw pmt_wrong_type("pmt_set_cdr", pair);
421 ////////////////////////////////////////////////////////////////////////////
423 ////////////////////////////////////////////////////////////////////////////
425 pmt_vector::pmt_vector(size_t len, pmt_t fill)
428 for (size_t i = 0; i < len; i++)
433 pmt_vector::ref(size_t k) const
436 throw pmt_out_of_range("pmt_vector_ref", pmt_from_long(k));
441 pmt_vector::set(size_t k, pmt_t obj)
444 throw pmt_out_of_range("pmt_vector_set", pmt_from_long(k));
449 pmt_vector::fill(pmt_t obj)
451 for (size_t i = 0; i < length(); i++)
456 pmt_is_vector(pmt_t obj)
458 return obj->is_vector();
462 pmt_make_vector(size_t k, pmt_t fill)
464 return pmt_t(new pmt_vector(k, fill));
468 pmt_vector_ref(pmt_t vector, size_t k)
470 if (!vector->is_vector())
471 throw pmt_wrong_type("pmt_vector_ref", vector);
472 return _vector(vector)->ref(k);
476 pmt_vector_set(pmt_t vector, size_t k, pmt_t obj)
478 if (!vector->is_vector())
479 throw pmt_wrong_type("pmt_vector_set", vector);
480 _vector(vector)->set(k, obj);
484 pmt_vector_fill(pmt_t vector, pmt_t obj)
486 if (!vector->is_vector())
487 throw pmt_wrong_type("pmt_vector_set", vector);
488 _vector(vector)->fill(obj);
491 ////////////////////////////////////////////////////////////////////////////
492 // Uniform Numeric Vectors
493 ////////////////////////////////////////////////////////////////////////////
496 pmt_is_uniform_vector(pmt_t x)
498 return x->is_uniform_vector();
502 pmt_uniform_vector_elements(pmt_t vector, size_t &len)
504 if (!vector->is_uniform_vector())
505 throw pmt_wrong_type("pmt_uniform_vector_elements", vector);
506 return _uniform_vector(vector)->uniform_elements(len);
510 pmt_uniform_vector_writeable_elements(pmt_t vector, size_t &len)
512 if (!vector->is_uniform_vector())
513 throw pmt_wrong_type("pmt_uniform_vector_writeable_elements", vector);
514 return _uniform_vector(vector)->uniform_writeable_elements(len);
517 ////////////////////////////////////////////////////////////////////////////
519 ////////////////////////////////////////////////////////////////////////////
527 pmt_dict::set(pmt_t key, pmt_t value)
529 pmt_t p = pmt_assv(key, d_alist); // look for (key . value) pair
530 if (pmt_is_pair(p)){ // found existing pair...
531 pmt_set_cdr(p, value); // overrwrite cdr with new value
533 else { // not in the dict
534 d_alist = pmt_cons(pmt_cons(key, value), d_alist); // add new (key . value) pair
539 pmt_dict::ref(pmt_t key, pmt_t not_found) const
541 pmt_t p = pmt_assv(key, d_alist); // look for (key . value) pair
549 pmt_dict::has_key(pmt_t key) const
551 return pmt_is_pair(pmt_assv(key, d_alist));
555 pmt_dict::items() const
561 pmt_dict::keys() const
563 return pmt_map(pmt_car, d_alist);
567 pmt_dict::values() const
569 return pmt_map(pmt_cdr, d_alist);
573 pmt_is_dict(pmt_t obj)
575 return obj->is_dict();
581 return pmt_t(new pmt_dict());
585 pmt_dict_set(pmt_t dict, pmt_t key, pmt_t value)
587 if (!dict->is_dict())
588 throw pmt_wrong_type("pmt_dict_set", dict);
590 _dict(dict)->set(key, value);
594 pmt_dict_has_key(pmt_t dict, pmt_t key)
596 if (!dict->is_dict())
597 throw pmt_wrong_type("pmt_dict_has_key", dict);
599 return _dict(dict)->has_key(key);
603 pmt_dict_ref(pmt_t dict, pmt_t key, pmt_t not_found)
605 if (!dict->is_dict())
606 throw pmt_wrong_type("pmt_dict_ref", dict);
608 return _dict(dict)->ref(key, not_found);
612 pmt_dict_items(pmt_t dict)
614 if (!dict->is_dict())
615 throw pmt_wrong_type("pmt_dict_items", dict);
617 return _dict(dict)->items();
621 pmt_dict_keys(pmt_t dict)
623 if (!dict->is_dict())
624 throw pmt_wrong_type("pmt_dict_keys", dict);
626 return _dict(dict)->keys();
630 pmt_dict_values(pmt_t dict)
632 if (!dict->is_dict())
633 throw pmt_wrong_type("pmt_dict_values", dict);
635 return _dict(dict)->values();
638 ////////////////////////////////////////////////////////////////////////////
640 ////////////////////////////////////////////////////////////////////////////
642 pmt_any::pmt_any(const boost::any &any) : d_any(any) {}
645 pmt_is_any(pmt_t obj)
647 return obj->is_any();
651 pmt_make_any(const boost::any &any)
653 return pmt_t(new pmt_any(any));
657 pmt_any_ref(pmt_t obj)
660 throw pmt_wrong_type("pmt_any_ref", obj);
661 return _any(obj)->ref();
665 pmt_any_set(pmt_t obj, const boost::any &any)
668 throw pmt_wrong_type("pmt_any_set", obj);
672 ////////////////////////////////////////////////////////////////////////////
674 ////////////////////////////////////////////////////////////////////////////
677 pmt_eq(pmt_t x, pmt_t y)
683 pmt_eqv(pmt_t x, pmt_t y)
688 if (x->is_integer() && y->is_integer())
689 return _integer(x)->value() == _integer(y)->value();
691 if (x->is_real() && y->is_real())
692 return _real(x)->value() == _real(y)->value();
694 if (x->is_complex() && y->is_complex())
695 return _complex(x)->value() == _complex(y)->value();
701 pmt_equal(pmt_t x, pmt_t y)
706 if (x->is_pair() && y->is_pair())
707 return pmt_equal(pmt_car(x), pmt_car(y)) && pmt_equal(pmt_cdr(x), pmt_cdr(y));
709 if (x->is_vector() && y->is_vector()){
710 pmt_vector *xv = _vector(x);
711 pmt_vector *yv = _vector(y);
712 if (xv->length() != yv->length())
715 for (unsigned i = 0; i < xv->length(); i++)
716 if (!pmt_equal(xv->_ref(i), yv->_ref(i)))
722 if (x->is_uniform_vector() && y->is_uniform_vector()){
723 pmt_uniform_vector *xv = _uniform_vector(x);
724 pmt_uniform_vector *yv = _uniform_vector(y);
725 if (xv->length() != yv->length())
729 if (memcmp(xv->uniform_elements(len_x),
730 yv->uniform_elements(len_y),
737 // FIXME add other cases here...
746 return _vector(x)->length();
748 if (x->is_uniform_vector())
749 return _uniform_vector(x)->length();
752 // FIXME dictionary length (number of entries)
754 throw pmt_wrong_type("pmt_length", x);
758 pmt_assq(pmt_t obj, pmt_t alist)
760 while (pmt_is_pair(alist)){
761 pmt_t p = pmt_car(alist);
762 if (!pmt_is_pair(p)) // malformed alist
765 if (pmt_eq(obj, pmt_car(p)))
768 alist = pmt_cdr(alist);
774 pmt_assv(pmt_t obj, pmt_t alist)
776 while (pmt_is_pair(alist)){
777 pmt_t p = pmt_car(alist);
778 if (!pmt_is_pair(p)) // malformed alist
781 if (pmt_eqv(obj, pmt_car(p)))
784 alist = pmt_cdr(alist);
790 pmt_assoc(pmt_t obj, pmt_t alist)
792 while (pmt_is_pair(alist)){
793 pmt_t p = pmt_car(alist);
794 if (!pmt_is_pair(p)) // malformed alist
797 if (pmt_equal(obj, pmt_car(p)))
800 alist = pmt_cdr(alist);
806 pmt_map(pmt_t proc(pmt_t), pmt_t list)
810 while(pmt_is_pair(list)){
811 r = pmt_cons(proc(pmt_car(list)), r);
812 list = pmt_cdr(list);
815 return pmt_reverse_x(r);
819 pmt_reverse(pmt_t listx)
824 while(pmt_is_pair(list)){
825 r = pmt_cons(pmt_car(list), r);
826 list = pmt_cdr(list);
828 if (pmt_is_null(list))
831 throw pmt_wrong_type("pmt_reverse", listx);
835 pmt_reverse_x(pmt_t list)
837 // FIXME do it destructively
838 return pmt_reverse(list);
842 pmt_nth(size_t n, pmt_t list)
844 pmt_t t = pmt_nthcdr(n, list);
852 pmt_nthcdr(size_t n, pmt_t list)
854 if (!(pmt_is_null(list) || pmt_is_pair(list)))
855 throw pmt_wrong_type("pmt_nthcdr", list);
858 if (pmt_is_pair(list)){
859 list = pmt_cdr(list);
863 if (pmt_is_null(list))
866 throw pmt_wrong_type("pmt_nthcdr: not a LIST", list);
872 pmt_memq(pmt_t obj, pmt_t list)
874 while (pmt_is_pair(list)){
875 if (pmt_eq(obj, pmt_car(list)))
877 list = pmt_cdr(list);
883 pmt_memv(pmt_t obj, pmt_t list)
885 while (pmt_is_pair(list)){
886 if (pmt_eqv(obj, pmt_car(list)))
888 list = pmt_cdr(list);
894 pmt_member(pmt_t obj, pmt_t list)
896 while (pmt_is_pair(list)){
897 if (pmt_equal(obj, pmt_car(list)))
899 list = pmt_cdr(list);
905 pmt_subsetp(pmt_t list1, pmt_t list2)
907 while (pmt_is_pair(list1)){
908 pmt_t p = pmt_car(list1);
909 if (pmt_is_false(pmt_memv(p, list2)))
911 list1 = pmt_cdr(list1);
919 return pmt_cons(x1, PMT_NIL);
923 pmt_list2(pmt_t x1, pmt_t x2)
925 return pmt_cons(x1, pmt_cons(x2, PMT_NIL));
929 pmt_list3(pmt_t x1, pmt_t x2, pmt_t x3)
931 return pmt_cons(x1, pmt_cons(x2, pmt_cons(x3, PMT_NIL)));
935 pmt_list4(pmt_t x1, pmt_t x2, pmt_t x3, pmt_t x4)
937 return pmt_cons(x1, pmt_cons(x2, pmt_cons(x3, pmt_cons(x4, PMT_NIL))));
943 return (pmt_car(pmt_car(pair)));
949 return pmt_car(pmt_cdr(pair));
955 return pmt_cdr(pmt_car(pair));
961 return pmt_cdr(pmt_cdr(pair));
965 pmt_caddr(pmt_t pair)
967 return pmt_car(pmt_cdr(pmt_cdr(pair)));
971 pmt_cadddr(pmt_t pair)
973 return pmt_car(pmt_cdr(pmt_cdr(pmt_cdr(pair))));
977 pmt_is_eof_object(pmt_t obj)
979 return pmt_eq(obj, PMT_EOF);
985 printf("sizeof(pmt_t) = %3zd\n", sizeof(pmt_t));
986 printf("sizeof(pmt_base) = %3zd\n", sizeof(pmt_base));
987 printf("sizeof(pmt_bool) = %3zd\n", sizeof(pmt_bool));
988 printf("sizeof(pmt_symbol) = %3zd\n", sizeof(pmt_symbol));
989 printf("sizeof(pmt_integer) = %3zd\n", sizeof(pmt_integer));
990 printf("sizeof(pmt_real) = %3zd\n", sizeof(pmt_real));
991 printf("sizeof(pmt_complex) = %3zd\n", sizeof(pmt_complex));
992 printf("sizeof(pmt_null) = %3zd\n", sizeof(pmt_null));
993 printf("sizeof(pmt_pair) = %3zd\n", sizeof(pmt_pair));
994 printf("sizeof(pmt_vector) = %3zd\n", sizeof(pmt_vector));
995 printf("sizeof(pmt_dict) = %3zd\n", sizeof(pmt_dict));
996 printf("sizeof(pmt_uniform_vector) = %3zd\n", sizeof(pmt_uniform_vector));