Searched refs:childtasks (Results 1 – 4 of 4) sorted by relevance
233 const tArray<int>& childtasks = phenotype.GetCurTaskCount(); in Divide_CheckViable() local251 for (int i=0; i<childtasks.GetSize(); i++) in Divide_CheckViable()253 if (childtasks[i] > parenttasks[i]) { in Divide_CheckViable()257 else if (childtasks[i] < parenttasks[i]) in Divide_CheckViable()920 for (int i=0; i<childtasks.GetSize(); i++) in Divide_TestFitnessMeasures()922 if (childtasks[i] > parenttasks[i]) { in Divide_TestFitnessMeasures()926 else if (childtasks[i] < parenttasks[i]) in Divide_TestFitnessMeasures()1031 const tArray<int>& childtasks = test_info.GetTestPhenotype().GetLastTaskCount(); in Divide_TestFitnessMeasures1() local1034 for (int i=0; i<childtasks.GetSize(); i++) in Divide_TestFitnessMeasures1()1036 if (childtasks[i] > parenttasks[i]) { in Divide_TestFitnessMeasures1()[all …]
41 int childtasks; /* count of parallel child tasks */ member102 a.childtasks = 0; /* integers */ in m_Slab()104 a.childtasks = 0; in m_Slab()242 if (a->childtasks >= a->nprocs) in Object_Slab()303 a->childtasks += numparts; in Object_Slab()328 a->childtasks -= numparts; in Object_Slab()359 a->childtasks += numparts; in Object_Slab()397 a->childtasks -= numparts; in Object_Slab()418 a->childtasks += numparts; in Object_Slab()459 a->childtasks -= numparts; in Object_Slab()
35 int childtasks; /* count of parallel child tasks */ member90 a.childtasks = 0; /* integers */ in m_Slice()92 a.childtasks = 0; in m_Slice()210 if (a->childtasks >= a->nprocs) in Object_Slice()271 a->childtasks += numparts; in Object_Slice()297 a->childtasks -= numparts; in Object_Slice()328 a->childtasks += numparts; in Object_Slice()365 a->childtasks -= numparts; in Object_Slice()387 a->childtasks += numparts; in Object_Slice()427 a->childtasks -= numparts; in Object_Slice()
509 .taskitem .childtasks {