contrib/gcc/stmt.c

297    inputs and NOUTPUTS outputs to this extended-asm.  Upon return,
661 expand_asm_operands (tree string, tree outputs, tree inputs,
667   int noutputs = list_length (outputs);
685   /* An ASM with no outputs needs to be treated as volatile, for now.  */
689   if (! check_operand_nalternatives (outputs, inputs))
692   string = resolve_asm_operand_names (string, outputs, inputs);
696   for (t = outputs; t ; t = TREE_CHAIN (t), i++)
705   clobbers = targetm.md_asm_clobbers (outputs, inputs, clobbers);
739   /* First pass over inputs and outputs checks validity and sets
743   for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
804   for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
1020       for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
1034       /* If there are no outputs (but there are some clobbers)
1071 	     input and outputs that hasn't been handled.  Such overlap
1096   /* For any outputs that needed reloading into registers, spill them
1109   tree outputs, tail;
1118   outputs = ASM_OUTPUTS (exp);
1119   noutputs = list_length (outputs);
1124   for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
1129   expand_asm_operands (ASM_STRING (exp), outputs, ASM_INPUTS (exp),
1133   /* Copy all the intermediate outputs into the specified outputs.  */
1134   for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
1152 check_operand_nalternatives (tree outputs, tree inputs)
1154   if (outputs || inputs)
1156       tree tmp = TREE_PURPOSE (outputs ? outputs : inputs);
1167       tmp = outputs;
1196 check_unique_operand_names (tree outputs, tree inputs)
1200   for (i = outputs; i ; i = TREE_CHAIN (i))
1220       for (j = outputs; j ; j = TREE_CHAIN (j))
1238 resolve_asm_operand_names (tree string, tree outputs, tree inputs)
1245   check_unique_operand_names (outputs, inputs);
1256 	    p = resolve_operand_name_1 (p, outputs, inputs);
1299 	  p = resolve_operand_name_1 (p, outputs, inputs);
1315 resolve_operand_name_1 (char *p, tree outputs, tree inputs)
1332   for (op = 0, t = outputs; t ; t = TREE_CHAIN (t), op++)