1 /* Common operations for native functions. 2 3 Copyright (C) 2016, 2017 Paul Boddie <paul@boddie.org.uk> 4 5 This program is free software; you can redistribute it and/or modify it under 6 the terms of the GNU General Public License as published by the Free Software 7 Foundation; either version 3 of the License, or (at your option) any later 8 version. 9 10 This program is distributed in the hope that it will be useful, but WITHOUT 11 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS 12 FOR A PARTICULAR PURPOSE. See the GNU General Public License for more 13 details. 14 15 You should have received a copy of the GNU General Public License along with 16 this program. If not, see <http://www.gnu.org/licenses/>. 17 */ 18 19 #include "types.h" 20 #include "exceptions.h" 21 #include "ops.h" 22 #include "progconsts.h" 23 #include "progops.h" 24 #include "progtypes.h" 25 #include "main.h" 26 27 /* Utility functions. */ 28 29 __attr __new_int(int i) 30 { 31 /* Search the integer cache first. */ 32 if ((i >= 0) && (i < __INTEGER_CACHE_SIZE)) 33 { 34 return __ATTRVALUE((__ref) &__integer_cache[i]); 35 } 36 37 /* Create a new integer and mutate the __data__ attribute. */ 38 __attr attr = __NEWINSTANCE(__builtins___int_int); 39 attr.value->attrs[__ATTRPOS(__data__)].intvalue = i; 40 return attr; 41 } 42 43 __attr __new_str(char *s, int size) 44 { 45 /* Create a new string and mutate the __data__, __size__ and __key__ attributes. */ 46 __attr attr = __NEWINSTANCE(__builtins___str_string); 47 attr.value->attrs[__ATTRPOS(__data__)].strvalue = s; 48 attr.value->attrs[__ATTRPOS(__size__)].intvalue = size; 49 attr.value->attrs[__ATTRPOS(__key__)] = __NULL; 50 return attr; 51 } 52 53 __attr __new_list(__fragment *f) 54 { 55 /* Create a new list and mutate the __data__ attribute. */ 56 __attr attr = __NEWINSTANCE(__builtins___list_list); 57 attr.value->attrs[__ATTRPOS(__data__)].seqvalue = f; 58 return attr; 59 } 60 61 __fragment *__fragment_append(__fragment *data, __attr * const value) 62 { 63 __fragment *newdata = data; 64 unsigned int size = data->size, capacity = data->capacity; 65 unsigned int n; 66 67 /* Re-allocate the fragment if the capacity has been reached. */ 68 if (size >= capacity) 69 { 70 /* NOTE: Consider various restrictions on capacity increases. */ 71 n = capacity ? capacity * 2 : 1; 72 newdata = (__fragment *) __REALLOCATE(data, __FRAGMENT_SIZE(n)); 73 newdata->capacity = n; 74 } 75 76 /* Insert the new element and increment the list size. */ 77 newdata->attrs[size] = *value; 78 newdata->size = size + 1; 79 80 return newdata; 81 }