Lines Matching defs:cases
53 cases : (backendIC * word) list,
223 set to true since the only cases where a closure is not needed,
491 same effect. More complicated cases could be considered but
538 (* Can use a case. Can we combine two cases?
543 IsACase { cases=nextCases, test=nextTest, default=nextDefault, caseType=nextCaseType } =>
552 cases = (insThen, caseTags) ::
563 cases = [(insThen, caseTags)],
572 cases = [(insThen, caseTags)],
584 and reconvertCase(IsACase{cases, test, default, caseType}) =
586 (* Count the number of cases and compute the maximum and minimum. *)
596 CaseTag _ => (* Exhaustive *) List.length cases > 4
599 val (_, aLabel) = hd cases
601 val (min, max) = List.foldl foldCases (aLabel, aLabel) cases
602 val numberOfCases = List.length cases
613 val labelCount = List.length cases
616 val ordered = ListPair.zipEq (cases, List.tabulate(labelCount, fn n=>n))
628 val cases = filter sorted
636 val (_, aLabel) = hd cases
638 val (min, max) = List.foldl foldCases (aLabel, aLabel) cases
643 (* Create labels for each of the cases. Fill in any gaps with entries that
658 val fullCaseRange = extendCase(0w0, cases)
661 BICCase{cases=fullCaseRange, test=test, default=default, isExhaustive=isExhaustive, firstIndex=min}
679 reconvert cases