Lines Matching defs:stride
110 // last in the loop. The trip-counter have to stride by a constant;
119 // the form (Op old-trip-counter stride). The old-trip-counter is produced
120 // by a Phi connected to the CountedLoopNode. The stride is constant.
132 // loop-invariant stride and the loop-invariant limit value. CountedLoopNodes
175 Node *stride() const;
259 Node *stride() const { Node *tmp = incr (); return (tmp && tmp->req()==3) ? tmp->in(2) : NULL; }
263 bool stride_is_con() const { Node *tmp = stride (); return (tmp != NULL && tmp->is_Con()); }
294 inline Node *CountedLoopNode::stride() const { return loopexit() ? loopexit()->stride() : NULL; }
303 // trip_count = (limit - init_trip + stride - 1)/stride
304 // final_value= trip_count * stride + init_trip.
307 // limit check: limit <= max_int-stride.
311 LoopLimitNode( Compile* C, Node *init, Node *limit, Node *stride ) : Node(0,init,limit,stride) {
908 Node* init, Node* limit, Node* stride,
979 // Returns nonzero constant stride if-node is a possible iv test (otherwise returns zero.)