Lines Matching refs:Jump

375   explicit ChainEdge(JumpT *Jump)
376       : SrcChain(Jump->Source->CurChain), DstChain(Jump->Target->CurChain),
377         Jumps(1, Jump) {}
387   void appendJump(JumpT *Jump) { Jumps.push_back(Jump); }
453   for (JumpT *Jump : OutJumps)
454     if (Jump->Target == Other)
461   for (JumpT *Jump : OutJumps)
462     Count += Jump->ExecutionCount;
468   for (JumpT *Jump : InJumps)
469     Count += Jump->ExecutionCount;
548         for (JumpT *Jump : *Jumps)
549           Func(Jump);
652     for (JumpT &Jump : AllJumps) {
653       assert(OutDegree[Jump.Source->Index] > 0 &&
655       Jump.IsConditional = OutDegree[Jump.Source->Index] > 1;
672       for (JumpT *Jump : PredNode.OutJumps) {
673         assert(Jump->ExecutionCount > 0 && "incorrectly initialized jump");
674         NodeT *SuccNode = Jump->Target;
679           CurEdge->appendJump(Jump);
683         AllEdges.emplace_back(Jump);
835     Jumps.forEach([&](const JumpT *Jump) {
836       const NodeT *SrcBlock = Jump->Source;
837       const NodeT *DstBlock = Jump->Target;
839                              DstBlock->EstimatedAddr, Jump->ExecutionCount,
840                              Jump->IsConditional);
888     for (JumpT *Jump : ChainSucc->Nodes.front()->InJumps) {
889       const NodeT *SrcBlock = Jump->Source;
897     for (JumpT *Jump : ChainSucc->Nodes.back()->OutJumps) {
898       const NodeT *DstBlock = Jump->Target;
1111       for (JumpT *Jump : PredNode.OutJumps) {
1112         NodeT *SuccNode = Jump->Target;
1117           CurEdge->appendJump(Jump);
1121         AllEdges.emplace_back(Jump);
1312     Jumps.forEach([&](const JumpT *Jump) {
1313       uint64_t SrcAddr = Jump->Source->EstimatedAddr + Jump->Offset;
1314       uint64_t DstAddr = Jump->Target->EstimatedAddr;
1315       NewScore += distScore(SrcAddr, DstAddr, Jump->ExecutionCount);
1316       CurScore += distScore(0, TotalSize, Jump->ExecutionCount);