Searched refs:StartPositions (Results 1 – 8 of 8) sorted by relevance
66 StartPositions.Clear(); in ~BPMiniGame_PerfectPaths()328 StartPositions.Clear(); in LevelUp()332 StartPositions.Add(8); in LevelUp()333 StartPositions.Add(16); in LevelUp()334 StartPositions.Add(24); in LevelUp()339 StartPositions.Add(32); in LevelUp()340 StartPositions.Add(40); in LevelUp()341 StartPositions.Add(48); in LevelUp()347 StartPositions.Shuffle(); in LevelUp()350 StartPos = Squares[StartPositions[0]]; in LevelUp()
75 BPList<int> StartPositions; variable
41 static field_t *StartPositions = NULL; /* [NWarriors] */ variable150 if (StartPositions) { free(StartPositions); StartPositions = NULL; } in free_related_memory()167 StartPositions = (field_t*)malloc(sizeof(field_t)*NWarriors); in alloc_related_memory()180 if (!(Warriors && Positions && StartPositions && Deaths && in alloc_related_memory()394 StartPositions[i] = in set_starting_order()593 nalive = sim_mw( NWarriors, &StartPositions[0], &Deaths[0] ); in main()
46 static field_t *StartPositions = NULL; /* [NWarriors] */ variable148 if (StartPositions) { in free_related_memory()149 free (StartPositions); in free_related_memory()150 StartPositions = NULL; in free_related_memory()173 StartPositions = (field_t *) malloc (sizeof (field_t) * NWarriors); in alloc_related_memory()388 StartPositions[i] = (Positions[j] + Warriors[j].start) % OPT_coresize; in set_starting_order()
43 static field_t StartPositions[MAX_WARRIORS]; variable332 StartPositions[i] = in set_starting_order()530 nalive = sim_mw( NWarriors, &StartPositions[0], &Deaths[0] ); in main()
53 static field_t StartPositions[MAX_WARRIORS]; variable