ret+="\tgs_uint32_t *aggr_table_hashmap; // hash val, plus control info.\n";
// ret+="\tint bitmap_size;\n";
ret += "\tint n_aggrs; // # of non-empty slots in aggr_table\n";
+ ret += "\tgs_int32_t n_ticks; // for limiting slow flush\n";
ret += "\tint max_aggrs; // size of aggr_table and its hashmap.\n";
ret += "\tint max_windows; // max number of open windows.\n";
ret += "\tunsigned int generation; // initially zero, increment on\n";
// ret += "#include \"fta.h\"\n\n");
string ret = "#ifndef LFTA_IN_NIC\n";
- ret += "char *"+generate_schema_string_name(node_name)+" = " +schema_embed_str+";\n";
+ ret += "const char *"+generate_schema_string_name(node_name)+" = " +schema_embed_str+";\n";
ret += "#include<stdio.h>\n";
ret += "#include <limits.h>\n";
ret += "#include <float.h>\n";
ret += ";\n";
- ret += "\t\t\ttuple = allocate_tuple(f, tuple_size );\n";
+ ret += "\t\t\ttuple = (struct "+generate_tuple_name(node_name)+" *)allocate_tuple(f, tuple_size );\n";
ret += "\t\t\tif( tuple != NULL){\n";
ret+="\tif(command == FTA_COMMAND_FLUSH){\n";
ret+="\t\tif (!t->n_aggrs) {\n";
- ret+="\t\t\ttuple = allocate_tuple(f, 0);\n";
+ ret+="\t\t\ttuple = (struct "+generate_tuple_name(node_name)+" *)allocate_tuple(f, 0);\n";
ret+="\t\t\tif( tuple != NULL)\n";
ret+="\t\t\t\tpost_tuple(tuple);\n";
}
ret += "\t\ttuple_size = sizeof( struct "+generate_tuple_name(node_name)+");\n";
- ret += "\t\ttuple = allocate_tuple(f, tuple_size );\n";
+ ret += "\t\ttuple = ( struct "+generate_tuple_name(node_name)+" *)allocate_tuple(f, tuple_size );\n";
ret += "\t\tif( tuple == NULL)\n\t\treturn 1;\n";
/* mark tuple as EOF_TUPLE */
sprintf(tmpstr,"\t\tt->last_gb_%d = gb_attr_%d;\n",g,g); ret += tmpstr;
}
}
+ ret += "\t\tt->n_ticks = 0; // reset clock tick counter, limit slow flush\n";
+ ret += "\t}else{\n";
+ ret += "//\tLimit slow flush, do a full flush at two clock ticks past the change in generation.\n";
+ ret += "\t\tt->n_ticks++;\n";
+ ret += "\t\tif(t->n_ticks == 2){\n";
+ ret += "\t\t\tif(t->flush_pos<t->max_aggrs) \n";
+ ret += "\t\t\t\tfta_aggr_flush_old_"+node_name+"(f,t->max_aggrs);\n";
+ ret += "\t\t}\n";
ret += "\t}\n\n";
+
}
ret += "\ttuple_size = sizeof( struct "+generate_tuple_name(node_name)+") + sizeof(gs_uint64_t) + sizeof(struct fta_stat);\n";
- ret += "\ttuple = allocate_tuple(f, tuple_size );\n";
+ ret += "\ttuple = ( struct "+generate_tuple_name(node_name)+"*)allocate_tuple(f, tuple_size );\n";
ret += "\tif( tuple == NULL)\n\t\treturn 1;\n";
ret+="\tpost_tuple(tuple);\n";
ret += "\n\t/* Send a heartbeat message to clearinghouse */\n";
- ret += "\tfta_heartbeat(f->ftaid, t->trace_id++, 1, &stats);\n";
+ ret += "\n\t/* Disable heartbeats for now to avoid overloading clearinghouse */\n";
+ ret += "\t/* fta_heartbeat(f->ftaid, t->trace_id++, 1, &stats); */\n";
ret += "\n\t/* Reset runtime stats */\n";
ret += "\tt->in_tuple_cnt = 0;\n";
temporal_flush+="\t\t/* \t\tmark all groups as old */\n";
temporal_flush+="\t\tt->generation++;\n";
temporal_flush+="\t\tt->flush_pos = 0;\n";
+ temporal_flush+="\t\tt->n_ticks = 0; // reset clock tick counter, to limit slow flush\n";
// Now set the saved temporal value of the gb to the
ret += ";\n";
- ret += "\ttuple = allocate_tuple(f, tuple_size );\n";
+ ret += "\ttuple = ( struct "+generate_tuple_name(node_name)+" *)allocate_tuple(f, tuple_size );\n";
ret += "\tif( tuple == NULL)\n\t\tgoto end;\n";
// Test passed, make assignments to the tuple.
ret += ";\n";
- ret += "\ttuple = allocate_tuple(f, tuple_size );\n";
+ ret += "\ttuple = ( struct "+generate_tuple_name(node_name)+" *)allocate_tuple(f, tuple_size );\n";
ret += "\tif( tuple == NULL)\n\t\tgoto end;\n";
// Test passed, make assignments to the tuple.
ret += ";\n";
- ret += "\ttuple = allocate_tuple(f, tuple_size );\n";
+ ret += "\ttuple = ( struct "+generate_tuple_name(node_name)+" *)allocate_tuple(f, tuple_size );\n";
ret += "\tif( tuple == NULL)\n\t\tgoto end;\n";
// Test passed, make assignments to the tuple.
ret+="\tstruct "+generate_fta_name(node_name)+"* f;\n";
ret+="\tint i;\n";
ret += "\n";
- ret+="\tif((f=fta_alloc(0,sizeof(struct "+generate_fta_name(node_name)+")))==0){\n\t\treturn(0);\n\t}\n";
+ ret+="\tif((f=(struct "+generate_fta_name(node_name)+" *)fta_alloc(0,sizeof(struct "+generate_fta_name(node_name)+")))==0){\n\t\treturn(0);\n\t}\n";
// assign a streamid to fta instance
ret+="\t/* assign a streamid */\n";
if(is_aggr_query){
ret += "\tf->n_aggrs = 0;\n";
+ ret += "\tf->n_ticks = 0; // for limiting slow flush\n";
ret += "\tf->max_aggrs = ";
}
ret += ";\n";
- ret+="\tif ((f->aggr_table = sp_fta_alloc((struct FTA *)f,sizeof(struct "+generate_aggr_struct_name(node_name)+") * f->max_aggrs))==0) {\n";
+ ret+="\tif ((f->aggr_table = (struct "+generate_aggr_struct_name(node_name)+" *)sp_fta_alloc((struct FTA *)f,sizeof(struct "+generate_aggr_struct_name(node_name)+") * f->max_aggrs))==0) {\n";
ret+="\t\treturn(0);\n";
ret+="\t}\n\n";
// ret+="/* compute how many integers we need to store the hashmap */\n";
// ret+="\tf->bitmap_size = (f->max_aggrs % (sizeof(gs_uint32_t) * 4)) ? (f->max_aggrs / (sizeof(gs_uint32_t) * 4) + 1) : (f->max_aggrs / (sizeof(gs_uint32_t) * 4));\n\n";
- ret+="\tif ((f->aggr_table_hashmap = sp_fta_alloc((struct FTA *)f,sizeof(gs_uint32_t) * f->max_aggrs))==0) {\n";
+ ret+="\tif ((f->aggr_table_hashmap = (gs_uint32_t *)sp_fta_alloc((struct FTA *)f,sizeof(gs_uint32_t) * f->max_aggrs))==0) {\n";
ret+="\t\treturn(0);\n";
ret+="\t}\n";
ret+="/*\t\tfill bitmap with zero \t*/\n";
int bf_byte_size = bf_bit_size / (8*sizeof(char));
int bf_tot = n_bloom*bf_byte_size;
- ret+="\tif ((f->bf_table = sp_fta_alloc((struct FTA *)f,"+int_to_string(bf_tot)+"))==0) {\n";
+ ret+="\tif ((f->bf_table = (unsigned char *)sp_fta_alloc((struct FTA *)f,"+int_to_string(bf_tot)+"))==0) {\n";
ret+="\t\treturn(0);\n";
ret+="\t}\n";
ret +=
}
ht_size = hs;
}
- ret+="\tif ((f->join_table = sp_fta_alloc((struct FTA *)f,sizeof(struct "+generate_fj_struct_name(node_name)+") * "+int_to_string(ht_size)+"))==0) {\n";
+ ret+="\tif ((f->join_table = (struct "+generate_fj_struct_name(node_name)+" *) sp_fta_alloc((struct FTA *)f,sizeof(struct "+generate_fj_struct_name(node_name)+") * "+int_to_string(ht_size)+"))==0) {\n";
ret+="\t\treturn(0);\n";
ret+="\t}\n\n";
ret +=
}
// Build list of "partial functions", by clause.
-// NOTE : partial fcns are not handles well.
+// NOTE : partial fcns are not handled well.
// The act of searching for them associates the fcn call
// in the SE with an index to an array. Refs to the
// fcn value are replaced with refs to the variable they are
ag_fcns_start = gb_fcns_end = partial_fcns.size();
if(aggr_tbl != NULL){
for(i=0;i<aggr_tbl->size();i++){
- find_partial_fcns(aggr_tbl->get_aggr_se(i), NULL, NULL, &is_partial_fcn, Ext_fcns);
+ find_partial_fcns(aggr_tbl->get_aggr_se(i), &partial_fcns, NULL, &is_partial_fcn, Ext_fcns);
}
}
ag_fcns_end = partial_fcns.size();