リビジョン | 1007 (tree) |
---|---|
日時 | 2020-05-07 09:02:35 |
作者 | jakobthomsen |
emit dynamic memory allocation if flag set
@@ -97789,6 +97789,57 @@ | ||
97789 | 97789 | case 18446744073709547378LLU: // 999999987w''''''''''''''' |
97790 | 97790 | { |
97791 | 97791 | fprintf(stdout, "%s", " + 1)"); |
97792 | + { | |
97793 | + uint64_t arg = 0; | |
97794 | + LOCAL_PUSH_MOVE(&heap, 10, &(heap.data[0].elem1)/*address of current closure*/, &arg); | |
97795 | + } | |
97796 | + { | |
97797 | + uint64_t match = 0; | |
97798 | + for(int i = 0; i < argc; i++) | |
97799 | + { | |
97800 | + if(strcmp(args[i], "dynamic") == 0) | |
97801 | + { | |
97802 | + match = 1; | |
97803 | + break; | |
97804 | + } | |
97805 | + } | |
97806 | + *LOCAL_ACCESS(heap.data, 11LLU, 10LLU) = match; | |
97807 | + } | |
97808 | + state.addr = *LOCAL_ACCESS(heap.data, 11LLU, 10LLU) ? 18446744073709547377LLU : 18446744073709547376LLU; | |
97809 | + (void)LOCAL_POP_MOVE(&heap, 11LLU, &(heap.data[0].elem1)/*address of current closure*/); // RELEASE temporary reference at 11 | |
97810 | + break; | |
97811 | + } | |
97812 | + case 18446744073709547377LLU: // 999999987v''''''''''''''' | |
97813 | + { | |
97814 | + fprintf(stdout, "%s", "\n struct pair *heapraw = calloc("); | |
97815 | + // ACCUMULATE ARGUMENTS - BEGIN | |
97816 | + { | |
97817 | + uint64_t arg = /*heapsize__*/LOCAL_ACCESS_ADDR(heap.data, 10LLU, 3LLU); | |
97818 | + LOCAL_PUSH_MOVE(&heap, 0LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); | |
97819 | + } | |
97820 | + // ACCUMULATE ARGUMENTS - END | |
97821 | + uint64_t return_to = 18446744073709547374LLU; | |
97822 | + const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)); | |
97823 | + uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); | |
97824 | + *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; | |
97825 | + heap.data[0].elem1 = heap.data[0].elem0; | |
97826 | + heap.data[0].elem0 = restore; | |
97827 | + state.addr = 787446708198178816LLU; // printnr___ | |
97828 | + break; | |
97829 | + } | |
97830 | + case 18446744073709547374LLU: // 999999987s''''''''''''''' | |
97831 | + { | |
97832 | + fprintf(stdout, "%s", " + 1, sizeof(struct pair));"); | |
97833 | + fprintf(stdout, "%s", "\n if(!heapraw)"); | |
97834 | + fprintf(stdout, "%s", "\n {"); | |
97835 | + fprintf(stdout, "%s", "\n fprintf(stderr, \"FAILED TO ALLOCATE MEMORY\\n\");"); | |
97836 | + fprintf(stdout, "%s", "\n exit(-1);"); | |
97837 | + fprintf(stdout, "%s", "\n }"); | |
97838 | + state.addr = 18446744073709547375LLU; // 999999987t''''''''''''''' | |
97839 | + break; | |
97840 | + } | |
97841 | + case 18446744073709547376LLU: // 999999987u''''''''''''''' | |
97842 | + { | |
97792 | 97843 | fprintf(stdout, "%s", "\n struct pair heapraw["); |
97793 | 97844 | // ACCUMULATE ARGUMENTS - BEGIN |
97794 | 97845 | { |
@@ -97796,7 +97847,7 @@ | ||
97796 | 97847 | LOCAL_PUSH_MOVE(&heap, 0LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
97797 | 97848 | } |
97798 | 97849 | // ACCUMULATE ARGUMENTS - END |
97799 | - uint64_t return_to = 18446744073709547377LLU; | |
97850 | + uint64_t return_to = 18446744073709547373LLU; | |
97800 | 97851 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)); |
97801 | 97852 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
97802 | 97853 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -97805,9 +97856,14 @@ | ||
97805 | 97856 | state.addr = 787446708198178816LLU; // printnr___ |
97806 | 97857 | break; |
97807 | 97858 | } |
97808 | - case 18446744073709547377LLU: // 999999987v''''''''''''''' | |
97859 | + case 18446744073709547373LLU: // 999999987r''''''''''''''' | |
97809 | 97860 | { |
97810 | 97861 | fprintf(stdout, "%s", " + 1];"); |
97862 | + state.addr = 18446744073709547375LLU; // 999999987t''''''''''''''' | |
97863 | + break; | |
97864 | + } | |
97865 | + case 18446744073709547375LLU: // 999999987t''''''''''''''' | |
97866 | + { | |
97811 | 97867 | fprintf(stdout, "%s", "\n struct all all = init(heapraw);"); |
97812 | 97868 | fprintf(stdout, "%s", "\n struct heap heap = all.heap;"); |
97813 | 97869 | fprintf(stdout, "%s", "\n struct state state = all.state;"); |
@@ -97821,7 +97877,7 @@ | ||
97821 | 97877 | LOCAL_PUSH_MOVE(&heap, 0LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
97822 | 97878 | } |
97823 | 97879 | // ACCUMULATE ARGUMENTS - END |
97824 | - uint64_t return_to = 18446744073709547376LLU; | |
97880 | + uint64_t return_to = 18446744073709547372LLU; | |
97825 | 97881 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)); |
97826 | 97882 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
97827 | 97883 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -97830,7 +97886,7 @@ | ||
97830 | 97886 | state.addr = 536089416471863296LLU; // builtins__ |
97831 | 97887 | break; |
97832 | 97888 | } |
97833 | - case 18446744073709547376LLU: // 999999987u''''''''''''''' | |
97889 | + case 18446744073709547372LLU: // 999999987q''''''''''''''' | |
97834 | 97890 | { |
97835 | 97891 | // ACCUMULATE ARGUMENTS - BEGIN |
97836 | 97892 | { |
@@ -97854,7 +97910,7 @@ | ||
97854 | 97910 | LOCAL_PUSH_MOVE(&heap, 4LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
97855 | 97911 | } |
97856 | 97912 | // ACCUMULATE ARGUMENTS - END |
97857 | - uint64_t return_to = 18446744073709547375LLU; | |
97913 | + uint64_t return_to = 18446744073709547371LLU; | |
97858 | 97914 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 5LLU, 0/*address of closure-in-construction*/, 0)); |
97859 | 97915 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
97860 | 97916 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 5LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -97863,7 +97919,7 @@ | ||
97863 | 97919 | state.addr = 782701543537682560LLU; // parseprog_ |
97864 | 97920 | break; |
97865 | 97921 | } |
97866 | - case 18446744073709547375LLU: // 999999987t''''''''''''''' | |
97922 | + case 18446744073709547371LLU: // 999999987p''''''''''''''' | |
97867 | 97923 | { |
97868 | 97924 | { |
97869 | 97925 | uint64_t arg = 0; |
@@ -97897,7 +97953,7 @@ | ||
97897 | 97953 | LOCAL_PUSH_MOVE(&heap, 4LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
97898 | 97954 | } |
97899 | 97955 | // ACCUMULATE ARGUMENTS - END |
97900 | - uint64_t return_to = 18446744073709547374LLU; | |
97956 | + uint64_t return_to = 18446744073709547370LLU; | |
97901 | 97957 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 5LLU, 0/*address of closure-in-construction*/, 0)); |
97902 | 97958 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
97903 | 97959 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 5LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -97906,7 +97962,7 @@ | ||
97906 | 97962 | state.addr = 587881350213857280LLU; // emitinit__ |
97907 | 97963 | break; |
97908 | 97964 | } |
97909 | - case 18446744073709547374LLU: // 999999987s''''''''''''''' | |
97965 | + case 18446744073709547370LLU: // 999999987o''''''''''''''' | |
97910 | 97966 | { |
97911 | 97967 | // ACCUMULATE ARGUMENTS - BEGIN |
97912 | 97968 | { |
@@ -97914,7 +97970,7 @@ | ||
97914 | 97970 | LOCAL_PUSH_MOVE(&heap, 0LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
97915 | 97971 | } |
97916 | 97972 | // ACCUMULATE ARGUMENTS - END |
97917 | - uint64_t return_to = 18446744073709547373LLU; | |
97973 | + uint64_t return_to = 18446744073709547369LLU; | |
97918 | 97974 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)); |
97919 | 97975 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
97920 | 97976 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -97923,7 +97979,7 @@ | ||
97923 | 97979 | state.addr = 587881345921715008LLU; // emitenter_ |
97924 | 97980 | break; |
97925 | 97981 | } |
97926 | - case 18446744073709547373LLU: // 999999987r''''''''''''''' | |
97982 | + case 18446744073709547369LLU: // 999999987n''''''''''''''' | |
97927 | 97983 | { |
97928 | 97984 | fprintf(stdout, "%s", "\n // program starts here with call into main"); |
97929 | 97985 | { |
@@ -97969,7 +98025,7 @@ | ||
97969 | 98025 | LOCAL_PUSH_MOVE(&heap, 3LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
97970 | 98026 | } |
97971 | 98027 | // ACCUMULATE ARGUMENTS - END |
97972 | - uint64_t return_to = 18446744073709547372LLU; | |
98028 | + uint64_t return_to = 18446744073709547368LLU; | |
97973 | 98029 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 4LLU, 0/*address of closure-in-construction*/, 0)); |
97974 | 98030 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
97975 | 98031 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 4LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -97978,7 +98034,7 @@ | ||
97978 | 98034 | state.addr = 548487490190330432LLU; // callbegin_ |
97979 | 98035 | break; |
97980 | 98036 | } |
97981 | - case 18446744073709547372LLU: // 999999987q''''''''''''''' | |
98037 | + case 18446744073709547368LLU: // 999999987m''''''''''''''' | |
97982 | 98038 | { |
97983 | 98039 | { |
97984 | 98040 | uint64_t arg = 0; |
@@ -98011,7 +98067,7 @@ | ||
98011 | 98067 | LOCAL_PUSH_MOVE(&heap, 5LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98012 | 98068 | } |
98013 | 98069 | // ACCUMULATE ARGUMENTS - END |
98014 | - uint64_t return_to = 18446744073709547371LLU; | |
98070 | + uint64_t return_to = 18446744073709547367LLU; | |
98015 | 98071 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 6LLU, 0/*address of closure-in-construction*/, 0)); |
98016 | 98072 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98017 | 98073 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 6LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98020,7 +98076,7 @@ | ||
98020 | 98076 | state.addr = 517221173180428288LLU; // argconst__ |
98021 | 98077 | break; |
98022 | 98078 | } |
98023 | - case 18446744073709547371LLU: // 999999987p''''''''''''''' | |
98079 | + case 18446744073709547367LLU: // 999999987l''''''''''''''' | |
98024 | 98080 | { |
98025 | 98081 | // ACCUMULATE ARGUMENTS - BEGIN |
98026 | 98082 | { |
@@ -98044,7 +98100,7 @@ | ||
98044 | 98100 | LOCAL_PUSH_MOVE(&heap, 4LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98045 | 98101 | } |
98046 | 98102 | // ACCUMULATE ARGUMENTS - END |
98047 | - uint64_t return_to = 18446744073709547370LLU; | |
98103 | + uint64_t return_to = 18446744073709547366LLU; | |
98048 | 98104 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 5LLU, 0/*address of closure-in-construction*/, 0)); |
98049 | 98105 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98050 | 98106 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 5LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98053,7 +98109,7 @@ | ||
98053 | 98109 | state.addr = 548487493561614336LLU; // callend___ |
98054 | 98110 | break; |
98055 | 98111 | } |
98056 | - case 18446744073709547370LLU: // 999999987o''''''''''''''' | |
98112 | + case 18446744073709547366LLU: // 999999987k''''''''''''''' | |
98057 | 98113 | { |
98058 | 98114 | fprintf(stdout, "%s", "\n fprintf(stderr, \"INTERNAL ERROR: 0-instruction-address\\n\"); // this should never be reached"); |
98059 | 98115 | fprintf(stdout, "%s", "\n exit(-1);"); |
@@ -98081,7 +98137,7 @@ | ||
98081 | 98137 | LOCAL_PUSH_MOVE(&heap, 3LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98082 | 98138 | } |
98083 | 98139 | // ACCUMULATE ARGUMENTS - END |
98084 | - uint64_t return_to = 18446744073709547369LLU; | |
98140 | + uint64_t return_to = 18446744073709547365LLU; | |
98085 | 98141 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 4LLU, 0/*address of closure-in-construction*/, 0)); |
98086 | 98142 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98087 | 98143 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 4LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98090,7 +98146,7 @@ | ||
98090 | 98146 | state.addr = 587881357748664875LLU; // emitpoptmp |
98091 | 98147 | break; |
98092 | 98148 | } |
98093 | - case 18446744073709547369LLU: // 999999987n''''''''''''''' | |
98149 | + case 18446744073709547365LLU: // 999999987j''''''''''''''' | |
98094 | 98150 | { |
98095 | 98151 | // variable u64 level_____ goes out of scope |
98096 | 98152 | // emitted destructur for type u64 |
@@ -98109,7 +98165,7 @@ | ||
98109 | 98165 | LOCAL_PUSH_MOVE(&heap, 2LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98110 | 98166 | } |
98111 | 98167 | // ACCUMULATE ARGUMENTS - END |
98112 | - uint64_t return_to = 18446744073709547368LLU; | |
98168 | + uint64_t return_to = 18446744073709547364LLU; | |
98113 | 98169 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 3LLU, 0/*address of closure-in-construction*/, 0)); |
98114 | 98170 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98115 | 98171 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 3LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98118,7 +98174,7 @@ | ||
98118 | 98174 | state.addr = 587881353282000896LLU; // emitleave_ |
98119 | 98175 | break; |
98120 | 98176 | } |
98121 | - case 18446744073709547368LLU: // 999999987m''''''''''''''' | |
98177 | + case 18446744073709547364LLU: // 999999987i''''''''''''''' | |
98122 | 98178 | { |
98123 | 98179 | // variable u64 resultaddr goes out of scope |
98124 | 98180 | // emitted destructur for type u64 |
@@ -98156,7 +98212,7 @@ | ||
98156 | 98212 | LOCAL_PUSH_MOVE(&heap, 0LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98157 | 98213 | } |
98158 | 98214 | // ACCUMULATE ARGUMENTS - END |
98159 | - uint64_t return_to = 18446744073709547367LLU; | |
98215 | + uint64_t return_to = 18446744073709547363LLU; | |
98160 | 98216 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)); |
98161 | 98217 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98162 | 98218 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98165,7 +98221,7 @@ | ||
98165 | 98221 | state.addr = 891913148528723755LLU; // verifyheap |
98166 | 98222 | break; |
98167 | 98223 | } |
98168 | - case 18446744073709547367LLU: // 999999987l''''''''''''''' | |
98224 | + case 18446744073709547363LLU: // 999999987h''''''''''''''' | |
98169 | 98225 | { |
98170 | 98226 | fprintf(stdout, "%s", "\n if(heap.availilable_size_for_dynamic_objects != "); |
98171 | 98227 | fprintf(stdout, "%llu", (unsigned long long)/*heapsize__*/*LOCAL_ACCESS(heap.data, 12LLU, 3LLU)); |
@@ -98181,6 +98237,35 @@ | ||
98181 | 98237 | fprintf(stdout, "%s", "\n exit(-1);"); |
98182 | 98238 | fprintf(stdout, "%s", "\n }"); |
98183 | 98239 | fprintf(stdout, "%s", "\n"); |
98240 | + { | |
98241 | + uint64_t arg = 0; | |
98242 | + LOCAL_PUSH_MOVE(&heap, 12, &(heap.data[0].elem1)/*address of current closure*/, &arg); | |
98243 | + } | |
98244 | + { | |
98245 | + uint64_t match = 0; | |
98246 | + for(int i = 0; i < argc; i++) | |
98247 | + { | |
98248 | + if(strcmp(args[i], "dynamic") == 0) | |
98249 | + { | |
98250 | + match = 1; | |
98251 | + break; | |
98252 | + } | |
98253 | + } | |
98254 | + *LOCAL_ACCESS(heap.data, 13LLU, 12LLU) = match; | |
98255 | + } | |
98256 | + state.addr = *LOCAL_ACCESS(heap.data, 13LLU, 12LLU) ? 18446744073709547362LLU : 18446744073709547361LLU; | |
98257 | + (void)LOCAL_POP_MOVE(&heap, 13LLU, &(heap.data[0].elem1)/*address of current closure*/); // RELEASE temporary reference at 13 | |
98258 | + break; | |
98259 | + } | |
98260 | + case 18446744073709547362LLU: // 999999987g''''''''''''''' | |
98261 | + { | |
98262 | + fprintf(stdout, "%s", "\n free(heapraw);"); | |
98263 | + state.addr = 18446744073709547361LLU; // 999999987f''''''''''''''' | |
98264 | + break; | |
98265 | + } | |
98266 | + case 18446744073709547361LLU: // 999999987f''''''''''''''' | |
98267 | + { | |
98268 | + fprintf(stdout, "%s", "\n"); | |
98184 | 98269 | fprintf(stdout, "%s", "\n return (int)main_result;"); |
98185 | 98270 | fprintf(stdout, "%s", "\n}"); |
98186 | 98271 | fprintf(stdout, "%s", "\n"); |
@@ -98194,7 +98279,7 @@ | ||
98194 | 98279 | LOCAL_PUSH_MOVE(&heap, 1LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98195 | 98280 | } |
98196 | 98281 | // ACCUMULATE ARGUMENTS - END |
98197 | - uint64_t return_to = 18446744073709547366LLU; | |
98282 | + uint64_t return_to = 18446744073709547360LLU; | |
98198 | 98283 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 2LLU, 0/*address of closure-in-construction*/, 0)); |
98199 | 98284 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98200 | 98285 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 2LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98203,7 +98288,7 @@ | ||
98203 | 98288 | state.addr = 587881350213860864LLU; // emitinit2_ |
98204 | 98289 | break; |
98205 | 98290 | } |
98206 | - case 18446744073709547366LLU: // 999999987k''''''''''''''' | |
98291 | + case 18446744073709547360LLU: // 999999987e''''''''''''''' | |
98207 | 98292 | { |
98208 | 98293 | fprintf(stdout, "%s", "\n"); |
98209 | 98294 | { |
@@ -98226,7 +98311,7 @@ | ||
98226 | 98311 | LOCAL_PUSH_MOVE(&heap, 1LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98227 | 98312 | } |
98228 | 98313 | // ACCUMULATE ARGUMENTS - END |
98229 | - uint64_t return_to = 18446744073709547365LLU; | |
98314 | + uint64_t return_to = 18446744073709547359LLU; | |
98230 | 98315 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 2LLU, 0/*address of closure-in-construction*/, 0)); |
98231 | 98316 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98232 | 98317 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 2LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98235,7 +98320,7 @@ | ||
98235 | 98320 | state.addr = 819847183514601582LLU; // reportdefs |
98236 | 98321 | break; |
98237 | 98322 | } |
98238 | - case 18446744073709547365LLU: // 999999987j''''''''''''''' | |
98323 | + case 18446744073709547359LLU: // 999999987d''''''''''''''' | |
98239 | 98324 | { |
98240 | 98325 | |
98241 | 98326 | list_size(heap.data, &*LOCAL_ACCESS(heap.data, 14LLU, 12LLU), /*fndefs____*/*LOCAL_ACCESS(heap.data, 14LLU, 8LLU)); |
@@ -98245,7 +98330,7 @@ | ||
98245 | 98330 | LOCAL_PUSH_MOVE(&heap, 0LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98246 | 98331 | } |
98247 | 98332 | // ACCUMULATE ARGUMENTS - END |
98248 | - uint64_t return_to = 18446744073709547364LLU; | |
98333 | + uint64_t return_to = 18446744073709547358LLU; | |
98249 | 98334 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)); |
98250 | 98335 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98251 | 98336 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98254,7 +98339,7 @@ | ||
98254 | 98339 | state.addr = 819847183517274112LLU; // reportnr__ |
98255 | 98340 | break; |
98256 | 98341 | } |
98257 | - case 18446744073709547364LLU: // 999999987i''''''''''''''' | |
98342 | + case 18446744073709547358LLU: // 999999987c''''''''''''''' | |
98258 | 98343 | { |
98259 | 98344 | fprintf(stderr, "%s", " procedure-/function-definitions\n"); |
98260 | 98345 | // ACCUMULATE ARGUMENTS - BEGIN |
@@ -98267,7 +98352,7 @@ | ||
98267 | 98352 | LOCAL_PUSH_MOVE(&heap, 1LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98268 | 98353 | } |
98269 | 98354 | // ACCUMULATE ARGUMENTS - END |
98270 | - uint64_t return_to = 18446744073709547363LLU; | |
98355 | + uint64_t return_to = 18446744073709547357LLU; | |
98271 | 98356 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 2LLU, 0/*address of closure-in-construction*/, 0)); |
98272 | 98357 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98273 | 98358 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 2LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98276,7 +98361,7 @@ | ||
98276 | 98361 | state.addr = 819847183518878446LLU; // reporttyps |
98277 | 98362 | break; |
98278 | 98363 | } |
98279 | - case 18446744073709547363LLU: // 999999987h''''''''''''''' | |
98364 | + case 18446744073709547357LLU: // 999999987b''''''''''''''' | |
98280 | 98365 | { |
98281 | 98366 | |
98282 | 98367 | list_size(heap.data, &*LOCAL_ACCESS(heap.data, 14LLU, 12LLU), /*typedefs__*/*LOCAL_ACCESS(heap.data, 14LLU, 9LLU)); |
@@ -98286,7 +98371,7 @@ | ||
98286 | 98371 | LOCAL_PUSH_MOVE(&heap, 0LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98287 | 98372 | } |
98288 | 98373 | // ACCUMULATE ARGUMENTS - END |
98289 | - uint64_t return_to = 18446744073709547362LLU; | |
98374 | + uint64_t return_to = 18446744073709547356LLU; | |
98290 | 98375 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)); |
98291 | 98376 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98292 | 98377 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98295,7 +98380,7 @@ | ||
98295 | 98380 | state.addr = 819847183517274112LLU; // reportnr__ |
98296 | 98381 | break; |
98297 | 98382 | } |
98298 | - case 18446744073709547362LLU: // 999999987g''''''''''''''' | |
98383 | + case 18446744073709547356LLU: // 999999987a''''''''''''''' | |
98299 | 98384 | { |
98300 | 98385 | fprintf(stderr, "%s", " type-definitions\n"); |
98301 | 98386 | // variable u64 def_id____ goes out of scope |
@@ -98314,14 +98399,14 @@ | ||
98314 | 98399 | (void)LOCAL_POP_MOVE(&heap, 11LLU, &(heap.data[0].elem1)/*address of current closure*/); // RELEASE reference mainsize__ at 11 |
98315 | 98400 | // variable list<typedef___> typedefs__ goes out of scope |
98316 | 98401 | // emitted destructur for type list<typedef___> |
98317 | - state.addr = 18446744073709547360LLU; // 999999987e''''''''''''''' | |
98402 | + state.addr = 18446744073709547354LLU; // 999999987Z''''''''''''''' | |
98318 | 98403 | break; |
98319 | 98404 | } |
98320 | - case 18446744073709547360LLU: // 999999987e''''''''''''''' | |
98405 | + case 18446744073709547354LLU: // 999999987Z''''''''''''''' | |
98321 | 98406 | { |
98322 | 98407 | if(!*LOCAL_ACCESS(heap.data, 10LLU, 9LLU)/*list*/) |
98323 | 98408 | { |
98324 | - state.addr = 18446744073709547361LLU; // 999999987f''''''''''''''' | |
98409 | + state.addr = 18446744073709547355LLU; // 999999987$''''''''''''''' | |
98325 | 98410 | break; |
98326 | 98411 | } |
98327 | 98412 | // temporary list-element |
@@ -98335,7 +98420,7 @@ | ||
98335 | 98420 | LOCAL_PUSH_MOVE(&heap, 0LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98336 | 98421 | } |
98337 | 98422 | // ACCUMULATE ARGUMENTS - END |
98338 | - uint64_t return_to = 18446744073709547359LLU; | |
98423 | + uint64_t return_to = 18446744073709547353LLU; | |
98339 | 98424 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)); |
98340 | 98425 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98341 | 98426 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98344,26 +98429,26 @@ | ||
98344 | 98429 | state.addr = 18446744073709551171LLU; // 999999993C''''''''''''''' |
98345 | 98430 | break; |
98346 | 98431 | } |
98347 | - case 18446744073709547359LLU: // 999999987d''''''''''''''' | |
98432 | + case 18446744073709547353LLU: // 999999987Y''''''''''''''' | |
98348 | 98433 | { |
98349 | 98434 | // RELEASE temporary destructor-variable |
98350 | 98435 | (void)LOCAL_POP_MOVE(&heap, 11LLU, &(heap.data[0].elem1)/*address of current closure*/); // RELEASE temporary reference at 11 |
98351 | - state.addr = 18446744073709547360LLU; // 999999987e''''''''''''''' | |
98436 | + state.addr = 18446744073709547354LLU; // 999999987Z''''''''''''''' | |
98352 | 98437 | break; |
98353 | 98438 | } |
98354 | - case 18446744073709547361LLU: // 999999987f''''''''''''''' | |
98439 | + case 18446744073709547355LLU: // 999999987$''''''''''''''' | |
98355 | 98440 | { |
98356 | 98441 | (void)LOCAL_POP_MOVE(&heap, 10LLU, &(heap.data[0].elem1)/*address of current closure*/); // RELEASE reference typedefs__ at 10 |
98357 | 98442 | // variable list<defidfn___> fndefs____ goes out of scope |
98358 | 98443 | // emitted destructur for type list<defidfn___> |
98359 | - state.addr = 18446744073709547357LLU; // 999999987b''''''''''''''' | |
98444 | + state.addr = 18446744073709547351LLU; // 999999987W''''''''''''''' | |
98360 | 98445 | break; |
98361 | 98446 | } |
98362 | - case 18446744073709547357LLU: // 999999987b''''''''''''''' | |
98447 | + case 18446744073709547351LLU: // 999999987W''''''''''''''' | |
98363 | 98448 | { |
98364 | 98449 | if(!*LOCAL_ACCESS(heap.data, 9LLU, 8LLU)/*list*/) |
98365 | 98450 | { |
98366 | - state.addr = 18446744073709547358LLU; // 999999987c''''''''''''''' | |
98451 | + state.addr = 18446744073709547352LLU; // 999999987X''''''''''''''' | |
98367 | 98452 | break; |
98368 | 98453 | } |
98369 | 98454 | // temporary list-element |
@@ -98377,7 +98462,7 @@ | ||
98377 | 98462 | LOCAL_PUSH_MOVE(&heap, 0LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98378 | 98463 | } |
98379 | 98464 | // ACCUMULATE ARGUMENTS - END |
98380 | - uint64_t return_to = 18446744073709547356LLU; | |
98465 | + uint64_t return_to = 18446744073709547350LLU; | |
98381 | 98466 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)); |
98382 | 98467 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98383 | 98468 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98386,26 +98471,26 @@ | ||
98386 | 98471 | state.addr = 18446744073709551173LLU; // 999999993E''''''''''''''' |
98387 | 98472 | break; |
98388 | 98473 | } |
98389 | - case 18446744073709547356LLU: // 999999987a''''''''''''''' | |
98474 | + case 18446744073709547350LLU: // 999999987V''''''''''''''' | |
98390 | 98475 | { |
98391 | 98476 | // RELEASE temporary destructor-variable |
98392 | 98477 | (void)LOCAL_POP_MOVE(&heap, 10LLU, &(heap.data[0].elem1)/*address of current closure*/); // RELEASE temporary reference at 10 |
98393 | - state.addr = 18446744073709547357LLU; // 999999987b''''''''''''''' | |
98478 | + state.addr = 18446744073709547351LLU; // 999999987W''''''''''''''' | |
98394 | 98479 | break; |
98395 | 98480 | } |
98396 | - case 18446744073709547358LLU: // 999999987c''''''''''''''' | |
98481 | + case 18446744073709547352LLU: // 999999987X''''''''''''''' | |
98397 | 98482 | { |
98398 | 98483 | (void)LOCAL_POP_MOVE(&heap, 9LLU, &(heap.data[0].elem1)/*address of current closure*/); // RELEASE reference fndefs____ at 9 |
98399 | 98484 | // variable list<nametoaddr> translate_ goes out of scope |
98400 | 98485 | // emitted destructur for type list<nametoaddr> |
98401 | - state.addr = 18446744073709547354LLU; // 999999987Z''''''''''''''' | |
98486 | + state.addr = 18446744073709547348LLU; // 999999987T''''''''''''''' | |
98402 | 98487 | break; |
98403 | 98488 | } |
98404 | - case 18446744073709547354LLU: // 999999987Z''''''''''''''' | |
98489 | + case 18446744073709547348LLU: // 999999987T''''''''''''''' | |
98405 | 98490 | { |
98406 | 98491 | if(!*LOCAL_ACCESS(heap.data, 8LLU, 7LLU)/*list*/) |
98407 | 98492 | { |
98408 | - state.addr = 18446744073709547355LLU; // 999999987$''''''''''''''' | |
98493 | + state.addr = 18446744073709547349LLU; // 999999987U''''''''''''''' | |
98409 | 98494 | break; |
98410 | 98495 | } |
98411 | 98496 | // temporary list-element |
@@ -98419,7 +98504,7 @@ | ||
98419 | 98504 | LOCAL_PUSH_MOVE(&heap, 0LLU, &(heap.data[0].elem0)/*address of closure-in-construction*/, &arg); |
98420 | 98505 | } |
98421 | 98506 | // ACCUMULATE ARGUMENTS - END |
98422 | - uint64_t return_to = 18446744073709547353LLU; | |
98507 | + uint64_t return_to = 18446744073709547347LLU; | |
98423 | 98508 | const uint64_t restore = *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)); |
98424 | 98509 | uint64_t baseinfo = pair_move(&heap, &(heap.data[0].elem1)/*memory root*/, &return_to); |
98425 | 98510 | *access_heap(heap.data, tree_elem_addr_internal(heap.data, 1 + 1LLU, 0/*address of closure-in-construction*/, 0)) = baseinfo; |
@@ -98428,14 +98513,14 @@ | ||
98428 | 98513 | state.addr = 18446744073709551395LLU; // 999999996h''''''''''''''' |
98429 | 98514 | break; |
98430 | 98515 | } |
98431 | - case 18446744073709547353LLU: // 999999987Y''''''''''''''' | |
98516 | + case 18446744073709547347LLU: // 999999987S''''''''''''''' | |
98432 | 98517 | { |
98433 | 98518 | // RELEASE temporary destructor-variable |
98434 | 98519 | (void)LOCAL_POP_MOVE(&heap, 9LLU, &(heap.data[0].elem1)/*address of current closure*/); // RELEASE temporary reference at 9 |
98435 | - state.addr = 18446744073709547354LLU; // 999999987Z''''''''''''''' | |
98520 | + state.addr = 18446744073709547348LLU; // 999999987T''''''''''''''' | |
98436 | 98521 | break; |
98437 | 98522 | } |
98438 | - case 18446744073709547355LLU: // 999999987$''''''''''''''' | |
98523 | + case 18446744073709547349LLU: // 999999987U''''''''''''''' | |
98439 | 98524 | { |
98440 | 98525 | (void)LOCAL_POP_MOVE(&heap, 8LLU, &(heap.data[0].elem1)/*address of current closure*/); // RELEASE reference translate_ at 8 |
98441 | 98526 | // variable u64 end_______ goes out of scope |
@@ -98548,6 +98633,7 @@ | ||
98548 | 98633 | exit(-1); |
98549 | 98634 | } |
98550 | 98635 | |
98636 | + | |
98551 | 98637 | return (int)main_result; |
98552 | 98638 | } |
98553 | 98639 |