🚀 go-pugleaf

I need to know how difficult it is to recognize a loop for purposes of
loop folding similar to a DBRA in the m68k.md.  I need to know before any
of the code for the body of the loop is to generated.


pseudo 68k:

   l:
     ...
     DBRA xxyyzz l:    I think....

 where:

(define_insn ""
  [(set (pc)
	(if_then_else
	 (ne (compare (plus:HI (match_operand:HI 0 "general_operand" "g")
			       (const_int -1))
		      (const_int -1))
	     (const_int 0))
	 (label_ref (match_operand 1 "" ""))
	 (pc)))
   (set (match_dup 0)
	(plus:HI (match_dup 0)
		 (const_int -1)))]
...)


we need this:

   do l until lce 

     ...
   l:

Any suggestions?


-- 
-----------------------
marc.hoffman@analog.com