paul@354 | 1 | /* Common operations for native functions. |
paul@354 | 2 | |
paul@971 | 3 | Copyright (C) 2016, 2017, 2018, 2021, 2023 Paul Boddie <paul@boddie.org.uk> |
paul@354 | 4 | |
paul@354 | 5 | This program is free software; you can redistribute it and/or modify it under |
paul@354 | 6 | the terms of the GNU General Public License as published by the Free Software |
paul@354 | 7 | Foundation; either version 3 of the License, or (at your option) any later |
paul@354 | 8 | version. |
paul@354 | 9 | |
paul@354 | 10 | This program is distributed in the hope that it will be useful, but WITHOUT |
paul@354 | 11 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS |
paul@354 | 12 | FOR A PARTICULAR PURPOSE. See the GNU General Public License for more |
paul@354 | 13 | details. |
paul@354 | 14 | |
paul@354 | 15 | You should have received a copy of the GNU General Public License along with |
paul@354 | 16 | this program. If not, see <http://www.gnu.org/licenses/>. |
paul@354 | 17 | */ |
paul@354 | 18 | |
paul@354 | 19 | #include "types.h" |
paul@354 | 20 | #include "exceptions.h" |
paul@354 | 21 | #include "ops.h" |
paul@354 | 22 | #include "progconsts.h" |
paul@354 | 23 | #include "progops.h" |
paul@354 | 24 | #include "progtypes.h" |
paul@354 | 25 | #include "main.h" |
paul@354 | 26 | |
paul@354 | 27 | /* Utility functions. */ |
paul@354 | 28 | |
paul@941 | 29 | __attr __new_str(char *s, __int size) |
paul@354 | 30 | { |
paul@583 | 31 | /* Create a new string and mutate the __data__, __size__ and __key__ attributes. */ |
paul@938 | 32 | __attr attr = __NEWINSTANCE(__builtins___str_str); |
paul@849 | 33 | __store_via_object(__VALUE(attr), __data__, (__attr) {.strvalue=s}); |
paul@974 | 34 | __store_via_object(__VALUE(attr), __size__, __INTVALUE(size)); |
paul@849 | 35 | __store_via_object(__VALUE(attr), __key__, __NULL); |
paul@354 | 36 | return attr; |
paul@354 | 37 | } |
paul@354 | 38 | |
paul@354 | 39 | __attr __new_list(__fragment *f) |
paul@354 | 40 | { |
paul@354 | 41 | /* Create a new list and mutate the __data__ attribute. */ |
paul@573 | 42 | __attr attr = __NEWINSTANCE(__builtins___list_list); |
paul@849 | 43 | __store_via_object(__VALUE(attr), __data__, (__attr) {.seqvalue=f}); |
paul@354 | 44 | return attr; |
paul@354 | 45 | } |
paul@354 | 46 | |
paul@971 | 47 | __attr __new_float(__attr __result, double n) |
paul@850 | 48 | { |
paul@971 | 49 | __attr attr; |
paul@971 | 50 | |
paul@971 | 51 | /* Identify any suitable target for value replacement. The assumption is |
paul@971 | 52 | that locally referenced float objects are always replaceable since they |
paul@971 | 53 | will be appropriately initialised. */ |
paul@971 | 54 | |
paul@971 | 55 | __ref obj = __VALUE(__result); |
paul@971 | 56 | int replace = (obj != NULL) && __is_instance(obj) && (__get_class(obj) == &__builtins___float_float); |
paul@971 | 57 | |
paul@971 | 58 | if (replace) |
paul@971 | 59 | attr = __result; |
paul@971 | 60 | |
paul@971 | 61 | /* Alternatively, create a new float. */ |
paul@971 | 62 | else |
paul@971 | 63 | attr = __NEWINSTANCEIM(__builtins___float_float); |
paul@971 | 64 | |
paul@971 | 65 | /* Set the trailing data, replacing an existing value if applicable. */ |
paul@850 | 66 | __set_trailing_data(attr, __builtins___float_float, n); |
paul@971 | 67 | |
paul@971 | 68 | if (replace) |
paul@971 | 69 | return __REPLACEMENT(attr); |
paul@971 | 70 | else |
paul@971 | 71 | return attr; |
paul@850 | 72 | } |
paul@850 | 73 | |
paul@664 | 74 | __fragment *__fragment_append(__fragment *data, __attr value) |
paul@354 | 75 | { |
paul@354 | 76 | __fragment *newdata = data; |
paul@941 | 77 | __int size = data->size, capacity = data->capacity; |
paul@941 | 78 | __int n; |
paul@354 | 79 | |
paul@354 | 80 | /* Re-allocate the fragment if the capacity has been reached. */ |
paul@354 | 81 | if (size >= capacity) |
paul@354 | 82 | { |
paul@354 | 83 | /* NOTE: Consider various restrictions on capacity increases. */ |
paul@354 | 84 | n = capacity ? capacity * 2 : 1; |
paul@354 | 85 | newdata = (__fragment *) __REALLOCATE(data, __FRAGMENT_SIZE(n)); |
paul@354 | 86 | newdata->capacity = n; |
paul@354 | 87 | } |
paul@354 | 88 | |
paul@354 | 89 | /* Insert the new element and increment the list size. */ |
paul@664 | 90 | newdata->attrs[size] = value; |
paul@354 | 91 | newdata->size = size + 1; |
paul@354 | 92 | |
paul@354 | 93 | return newdata; |
paul@354 | 94 | } |