Searched refs:constraintPartition (Results 1 – 2 of 2) sorted by path
15129 constraintPartition[i] = constraintPartition[i-1] + nLongsNeeded; in LargestMovableSubtree()15180 SetBit(j, constraintPartition[numPartitions]); in LargestMovableSubtree()15196 if (IsPartNested(constraintPartition[j], constraintPartition[i], nLongsNeeded)) in LargestMovableSubtree()15214 free(constraintPartition[0]); in LargestMovableSubtree()15215 free(constraintPartition); in LargestMovableSubtree()15253 BitsLong *constraintPartition, *mask; in NumInformativeHardConstraints() local15259 if (!constraintPartition) in NumInformativeHardConstraints()15264 mask = constraintPartition + nLongsNeeded; in NumInformativeHardConstraints()15276 ClearBits(constraintPartition, nLongsNeeded); in NumInformativeHardConstraints()15282 SetBit(j, constraintPartition); in NumInformativeHardConstraints()[all …]
2318 if (!constraintPartition) in BuildConstraintTree()2514 free (constraintPartition); in BuildConstraintTree()2529 free (constraintPartition); in BuildConstraintTree()2690 if (!constraintPartition) in CheckConstraints()2740 free (constraintPartition); in CheckConstraints()2759 free (constraintPartition); in CheckConstraints()2801 if (!constraintPartition) in CheckSetConstraints()2869 free (constraintPartition); in CheckSetConstraints()2878 free (constraintPartition); in CheckSetConstraints()2884 free (constraintPartition); in CheckSetConstraints()[all …]