nitlanguage
/
nit.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Update c_src. Enable one gcc pass bootstrap.
[nit.git]
/
c_src
/
sorter._sep.c
diff --git
a/c_src/sorter._sep.c
b/c_src/sorter._sep.c
index
0c4b4e2
..
5fa7c2e
100644
(file)
--- a/
c_src/sorter._sep.c
+++ b/
c_src/sorter._sep.c
@@
-1,8
+1,9
@@
/* This C file is generated by NIT to compile module sorter. */
#include "sorter._sep.h"
val_t sorter___AbstractSorter___compare(val_t self, val_t param0, val_t param1) {
/* This C file is generated by NIT to compile module sorter. */
#include "sorter._sep.h"
val_t sorter___AbstractSorter___compare(val_t self, val_t param0, val_t param1) {
- struct trace_t trace = {NULL, LOCATE_sorter, 22, LOCATE_sorter___AbstractSorter___compare};
+ struct trace_t trace = {NULL, NULL, 22, LOCATE_sorter___AbstractSorter___compare};
trace.prev = tracehead; tracehead = &trace;
trace.prev = tracehead; tracehead = &trace;
+ trace.file = LOCATE_sorter;
fprintf(stderr, "Deferred method %s called");
fprintf(stderr, " (%s:%d)\n", LOCATE_sorter, 22);
nit_exit(1);
fprintf(stderr, "Deferred method %s called");
fprintf(stderr, " (%s:%d)\n", LOCATE_sorter, 22);
nit_exit(1);
@@
-10,10
+11,11
@@
val_t sorter___AbstractSorter___compare(val_t self, val_t param0, val_t param
return NIT_NULL;
}
void sorter___AbstractSorter___sort(val_t self, val_t param0) {
return NIT_NULL;
}
void sorter___AbstractSorter___sort(val_t self, val_t param0) {
- struct trace_t trace = {NULL, LOCATE_sorter, 29, LOCATE_sorter___AbstractSorter___sort};
+ struct trace_t trace = {NULL, NULL, 29, LOCATE_sorter___AbstractSorter___sort};
val_t variable0;
val_t variable1;
trace.prev = tracehead; tracehead = &trace;
val_t variable0;
val_t variable1;
trace.prev = tracehead; tracehead = &trace;
+ trace.file = LOCATE_sorter;
variable0 = param0;
variable1 = ((array___AbstractArray___length_t)CALL( variable0 /*array*/,COLOR_abstract_collection___Collection___length))( variable0 /*array*/) /*AbstractArray::length*/;
variable1 = TAG_Int(UNTAG_Int(variable1)-UNTAG_Int( TAG_Int(1)));
variable0 = param0;
variable1 = ((array___AbstractArray___length_t)CALL( variable0 /*array*/,COLOR_abstract_collection___Collection___length))( variable0 /*array*/) /*AbstractArray::length*/;
variable1 = TAG_Int(UNTAG_Int(variable1)-UNTAG_Int( TAG_Int(1)));
@@
-22,12
+24,13
@@
void sorter___AbstractSorter___sort(val_t self, val_t param0) {
return;
}
void sorter___AbstractSorter___sub_sort(val_t self, val_t param0, val_t param1, val_t param2) {
return;
}
void sorter___AbstractSorter___sub_sort(val_t self, val_t param0, val_t param1, val_t param2) {
- struct trace_t trace = {NULL, LOCATE_sorter, 32, LOCATE_sorter___AbstractSorter___sub_sort};
+ struct trace_t trace = {NULL, NULL, 32, LOCATE_sorter___AbstractSorter___sub_sort};
val_t variable0;
val_t variable1;
val_t variable2;
val_t variable3;
trace.prev = tracehead; tracehead = &trace;
val_t variable0;
val_t variable1;
val_t variable2;
val_t variable3;
trace.prev = tracehead; tracehead = &trace;
+ trace.file = LOCATE_sorter;
variable0 = param0;
variable1 = param1;
variable2 = param2;
variable0 = param0;
variable1 = param1;
variable2 = param2;
@@
-48,7
+51,7
@@
void sorter___AbstractSorter___sub_sort(val_t self, val_t param0, val_t param
return;
}
void sorter___AbstractSorter___quick_sort(val_t self, val_t param0, val_t param1, val_t param2) {
return;
}
void sorter___AbstractSorter___quick_sort(val_t self, val_t param0, val_t param1, val_t param2) {
- struct trace_t trace = {NULL, LOCATE_sorter, 44, LOCATE_sorter___AbstractSorter___quick_sort};
+ struct trace_t trace = {NULL, NULL, 44, LOCATE_sorter___AbstractSorter___quick_sort};
val_t variable0;
val_t variable1;
val_t variable2;
val_t variable0;
val_t variable1;
val_t variable2;
@@
-60,6
+63,7
@@
void sorter___AbstractSorter___quick_sort(val_t self, val_t param0, val_t par
val_t variable8;
val_t variable9;
trace.prev = tracehead; tracehead = &trace;
val_t variable8;
val_t variable9;
trace.prev = tracehead; tracehead = &trace;
+ trace.file = LOCATE_sorter;
variable0 = param0;
variable1 = param1;
variable2 = param2;
variable0 = param0;
variable1 = param1;
variable2 = param2;
@@
-199,7
+203,7
@@
void sorter___AbstractSorter___quick_sort(val_t self, val_t param0, val_t par
return;
}
void sorter___AbstractSorter___bubble_sort(val_t self, val_t param0, val_t param1, val_t param2) {
return;
}
void sorter___AbstractSorter___bubble_sort(val_t self, val_t param0, val_t param1, val_t param2) {
- struct trace_t trace = {NULL, LOCATE_sorter, 65, LOCATE_sorter___AbstractSorter___bubble_sort};
+ struct trace_t trace = {NULL, NULL, 65, LOCATE_sorter___AbstractSorter___bubble_sort};
val_t variable0;
val_t variable1;
val_t variable2;
val_t variable0;
val_t variable1;
val_t variable2;
@@
-211,6
+215,7
@@
void sorter___AbstractSorter___bubble_sort(val_t self, val_t param0, val_t pa
val_t variable8;
val_t variable9;
trace.prev = tracehead; tracehead = &trace;
val_t variable8;
val_t variable9;
trace.prev = tracehead; tracehead = &trace;
+ trace.file = LOCATE_sorter;
variable0 = param0;
variable1 = param1;
variable2 = param2;
variable0 = param0;
variable1 = param1;
variable2 = param2;
@@
-303,11
+308,12
@@
void sorter___AbstractSorter___bubble_sort(val_t self, val_t param0, val_t pa
return;
}
val_t sorter___ComparableSorter___compare(val_t self, val_t param0, val_t param1) {
return;
}
val_t sorter___ComparableSorter___compare(val_t self, val_t param0, val_t param1) {
- struct trace_t trace = {NULL, LOCATE_sorter, 93, LOCATE_sorter___ComparableSorter___compare};
+ struct trace_t trace = {NULL, NULL, 93, LOCATE_sorter___ComparableSorter___compare};
val_t variable0;
val_t variable1;
val_t variable2;
trace.prev = tracehead; tracehead = &trace;
val_t variable0;
val_t variable1;
val_t variable2;
trace.prev = tracehead; tracehead = &trace;
+ trace.file = LOCATE_sorter;
variable0 = param0;
variable1 = param1;
variable2 = ((kernel___Comparable_____leqg_t)CALL( variable0 /*a*/,COLOR_kernel___Comparable_____leqg))( variable0 /*a*/, variable1 /*b*/) /*Comparable::<=>*/;
variable0 = param0;
variable1 = param1;
variable2 = ((kernel___Comparable_____leqg_t)CALL( variable0 /*a*/,COLOR_kernel___Comparable_____leqg))( variable0 /*a*/, variable1 /*b*/) /*Comparable::<=>*/;
@@
-317,8
+323,9
@@
val_t sorter___ComparableSorter___compare(val_t self, val_t param0, val_t par
return variable2;
}
void sorter___ComparableSorter___init(val_t self, int* init_table) {
return variable2;
}
void sorter___ComparableSorter___init(val_t self, int* init_table) {
- struct trace_t trace = {NULL, LOCATE_sorter, 96, LOCATE_sorter___ComparableSorter___init};
+ struct trace_t trace = {NULL, NULL, 96, LOCATE_sorter___ComparableSorter___init};
trace.prev = tracehead; tracehead = &trace;
trace.prev = tracehead; tracehead = &trace;
+ trace.file = LOCATE_sorter;
if (init_table[VAL2OBJ( self)->vft[INIT_TABLE_POS_ComparableSorter].i]) return;
init_table[VAL2OBJ( self)->vft[INIT_TABLE_POS_ComparableSorter].i] = 1;
tracehead = trace.prev;
if (init_table[VAL2OBJ( self)->vft[INIT_TABLE_POS_ComparableSorter].i]) return;
init_table[VAL2OBJ( self)->vft[INIT_TABLE_POS_ComparableSorter].i] = 1;
tracehead = trace.prev;