Let list_for_each_entry(), list_for_each_entry_reverse() and list_for_each_entry_safe() declare their iterator variables.

Add wrapper macros for set_first() and set_next(), which have the return type as additional parameter.

(no changes in functionality)

(There is a timelimit option in becopyilp anyway)

This tries to get the names in a consistent format. We basically have 2
views on register allocation/constraints now:

1) Register Requirements and Assigments are per-instruction. Each
   instruction has requirements on its inputs and outputs, register get
   assigned for outputs of an instruction (assignment is an attribute of
   an instruction, not of the Proj-nodes).
   The internal datastructures model this form!

   The functions here have the form:
     arch_get_irn_register_req_in(node, input_nr)
     arch_get_irn_register_in(node, input_nr)
     arch_get_irn_register_req_out(node, output_nr)
     arch_set_irn_register_out(node, output_nr, register)

2) Register Requirements and Assignments are on firm-values. This view
   allows to query/assign requirements and registers at the Proj nodes
   instead of the repsective predecessors.
   This is a convenience interface modeled on top of the other!

   The functions have the form:
     arch_get_irn_register_req(node)
     arch_get_irn_register(node)
     arch_set_irn_register(node, register)

lpp: call the constraint types lpp_{less|greater}_equal because they are a {less|greater} equal operation

Note that this is an ugly change because ALL index variables used inside
bitset_foreach() MUST be switched to size_t now, or the magical

elm != (size_t) -1;

will fail :-(

[r28199]

[r28071]

[r28030]

[r27924]

[r27647]

[r27293]

[r27291]

[r27277]

[r27153]

[r27145]

[r26498]

[r26317]

	Node flags and node registers are stored in a generic backend_info struct now
	instead of every part of the backend doing custom (and slow) stuff

[r23142]

[r22985]

[r22896]

[r22889]

[r22843]