| 33 | */ |
| 34 | |
| 35 | int C_FUNCTION(Node * Na, Node * Nb) |
| 36 | { |
| 37 | Node *Nc; |
| 38 | Candidate *Cand; |
| 39 | int Index, i, j; |
| 40 | |
| 41 | if (PredSucCostAvailable) { |
| 42 | if (Na->Suc == Nb) |
| 43 | return Na->SucCost; |
| 44 | if (Na->Pred == Nb) |
| 45 | return Na->PredCost; |
| 46 | } |
| 47 | if ((Cand = Na->CandidateSet)) |
| 48 | for (; (Nc = Cand->To); Cand++) |
| 49 | if (Nc == Nb) |
| 50 | return Cand->Cost; |
| 51 | if ((Cand = Nb->CandidateSet)) |
| 52 | for (; (Nc = Cand->To); Cand++) |
| 53 | if (Nc == Na) |
| 54 | return Cand->Cost; |
| 55 | if ((Cand = Na->BackboneCandidateSet)) |
| 56 | for (; (Nc = Cand->To); Cand++) |
| 57 | if (Nc == Nb) |
| 58 | return Cand->Cost; |
| 59 | if ((Cand = Nb->BackboneCandidateSet)) |
| 60 | for (; (Nc = Cand->To); Cand++) |
| 61 | if (Nc == Na) |
| 62 | return Cand->Cost; |
| 63 | if (CacheSig == 0) |
| 64 | return D(Na, Nb); |
| 65 | i = Na->Id; |
| 66 | j = Nb->Id; |
| 67 | if (i > j) { |
| 68 | int k = i; |
| 69 | i = j; |
| 70 | j = k; |
| 71 | } |
| 72 | Index = ((i << 8) + i + j) & CacheMask; |
| 73 | if (CacheSig[Index] == i) |
| 74 | return CacheVal[Index]; |
| 75 | CacheSig[Index] = i; |
| 76 | return (CacheVal[Index] = D(Na, Nb)); |
| 77 | } |
| 78 | |
| 79 | int D_EXPLICIT(Node * Na, Node * Nb) |
| 80 | { |
nothing calls this directly
no outgoing calls
no test coverage detected