2 * Flow - walk the linearized flowgraph, simplifying it as we
5 * Copyright (C) 2004 Linus Torvalds
16 #include "expression.h"
17 #include "linearize.h"
21 unsigned long bb_generation
;
24 * Dammit, if we have a phi-node followed by a conditional
25 * branch on that phi-node, we should damn well be able to
26 * do something about the source. Maybe.
28 static int rewrite_branch(struct basic_block
*bb
,
29 struct basic_block
**ptr
,
30 struct basic_block
*old
,
31 struct basic_block
*new)
33 if (*ptr
!= old
|| new == old
)
36 /* We might find new if-conversions or non-dominating CSEs */
37 repeat_phase
|= REPEAT_CSE
;
39 replace_bb_in_list(&bb
->children
, old
, new, 1);
40 remove_bb_from_list(&old
->parents
, bb
, 1);
41 add_bb(&new->parents
, bb
);
46 * Return the known truth value of a pseudo, or -1 if
49 static int pseudo_truth_value(pseudo_t pseudo
)
51 switch (pseudo
->type
) {
53 return !!pseudo
->value
;
56 struct instruction
*insn
= pseudo
->def
;
58 /* A symbol address is always considered true.. */
59 if (insn
->opcode
== OP_SYMADDR
&& insn
->target
== pseudo
)
69 * Does a basic block depend on the pseudos that "src" defines?
71 static int bb_depends_on(struct basic_block
*target
, struct basic_block
*src
)
75 FOR_EACH_PTR(src
->defines
, pseudo
) {
76 if (pseudo_in_list(target
->needs
, pseudo
))
78 } END_FOR_EACH_PTR(pseudo
);
83 * When we reach here, we have:
84 * - a basic block that ends in a conditional branch and
85 * that has no side effects apart from the pseudos it
87 * - the phi-node that the conditional branch depends on
88 * - full pseudo liveness information
90 * We need to check if any of the _sources_ of the phi-node
91 * may be constant, and not actually need this block at all.
93 static int try_to_simplify_bb(struct basic_block
*bb
, struct instruction
*first
, struct instruction
*second
)
98 FOR_EACH_PTR(first
->phi_list
, phi
) {
99 struct instruction
*def
= phi
->def
;
100 struct basic_block
*source
, *target
;
102 struct instruction
*br
;
109 if (!pseudo
|| !source
)
111 br
= last_instruction(source
->insns
);
114 if (br
->opcode
!= OP_BR
)
116 true = pseudo_truth_value(pseudo
);
119 target
= true ? second
->bb_true
: second
->bb_false
;
120 if (bb_depends_on(target
, bb
))
122 changed
|= rewrite_branch(source
, &br
->bb_true
, bb
, target
);
123 changed
|= rewrite_branch(source
, &br
->bb_false
, bb
, target
);
124 } END_FOR_EACH_PTR(phi
);
128 static int bb_has_side_effects(struct basic_block
*bb
)
130 struct instruction
*insn
;
131 FOR_EACH_PTR(bb
->insns
, insn
) {
132 switch (insn
->opcode
) {
134 /* FIXME! This should take "const" etc into account */
142 /* FIXME! This should take "volatile" etc into account */
148 } END_FOR_EACH_PTR(insn
);
152 static int simplify_phi_branch(struct basic_block
*bb
, struct instruction
*br
)
154 pseudo_t cond
= br
->cond
;
155 struct instruction
*def
;
157 if (cond
->type
!= PSEUDO_REG
)
160 if (def
->bb
!= bb
|| def
->opcode
!= OP_PHI
)
162 if (bb_has_side_effects(bb
))
164 return try_to_simplify_bb(bb
, def
, br
);
167 static int simplify_branch_branch(struct basic_block
*bb
, struct instruction
*br
,
168 struct basic_block
**target_p
, int true)
170 struct basic_block
*target
= *target_p
, *final
;
171 struct instruction
*insn
;
176 insn
= last_instruction(target
->insns
);
177 if (!insn
|| insn
->opcode
!= OP_BR
|| insn
->cond
!= br
->cond
)
180 * Ahhah! We've found a branch to a branch on the same conditional!
181 * Now we just need to see if we can rewrite the branch..
184 final
= true ? insn
->bb_true
: insn
->bb_false
;
185 if (bb_has_side_effects(target
))
186 goto try_to_rewrite_target
;
187 if (bb_depends_on(final
, target
))
188 goto try_to_rewrite_target
;
189 return rewrite_branch(bb
, target_p
, target
, final
);
191 try_to_rewrite_target
:
193 * If we're the only parent, at least we can rewrite the
194 * now-known second branch.
196 if (bb_list_size(target
->parents
) != 1)
198 insert_branch(target
, insn
, final
);
199 kill_instruction(insn
);
203 static int simplify_one_branch(struct basic_block
*bb
, struct instruction
*br
)
205 if (simplify_phi_branch(bb
, br
))
207 return simplify_branch_branch(bb
, br
, &br
->bb_true
, 1) |
208 simplify_branch_branch(bb
, br
, &br
->bb_false
, 0);
211 static int simplify_branch_nodes(struct entrypoint
*ep
)
214 struct basic_block
*bb
;
216 FOR_EACH_PTR(ep
->bbs
, bb
) {
217 struct instruction
*br
= last_instruction(bb
->insns
);
219 if (!br
|| br
->opcode
!= OP_BR
|| !br
->bb_false
)
221 changed
|= simplify_one_branch(bb
, br
);
222 } END_FOR_EACH_PTR(bb
);
227 * This is called late - when we have intra-bb liveness information..
229 int simplify_flow(struct entrypoint
*ep
)
231 return simplify_branch_nodes(ep
);
234 static inline void concat_user_list(struct pseudo_user_list
*src
, struct pseudo_user_list
**dst
)
236 concat_ptr_list((struct ptr_list
*)src
, (struct ptr_list
**)dst
);
239 void convert_instruction_target(struct instruction
*insn
, pseudo_t src
)
242 struct pseudo_user
*pu
;
244 * Go through the "insn->users" list and replace them all..
246 target
= insn
->target
;
249 FOR_EACH_PTR(target
->users
, pu
) {
250 if (*pu
->userp
!= VOID
) {
251 assert(*pu
->userp
== target
);
254 } END_FOR_EACH_PTR(pu
);
255 concat_user_list(target
->users
, &src
->users
);
256 target
->users
= NULL
;
259 void convert_load_instruction(struct instruction
*insn
, pseudo_t src
)
261 convert_instruction_target(insn
, src
);
262 /* Turn the load into a no-op */
263 insn
->opcode
= OP_LNOP
;
267 static int overlapping_memop(struct instruction
*a
, struct instruction
*b
)
269 unsigned int a_start
= bytes_to_bits(a
->offset
);
270 unsigned int b_start
= bytes_to_bits(b
->offset
);
271 unsigned int a_size
= a
->size
;
272 unsigned int b_size
= b
->size
;
274 if (a_size
+ a_start
<= b_start
)
276 if (b_size
+ b_start
<= a_start
)
281 static inline int same_memop(struct instruction
*a
, struct instruction
*b
)
283 return a
->offset
== b
->offset
&& a
->size
== b
->size
;
287 * Return 1 if "dom" dominates the access to "pseudo"
290 * Return 0 if it doesn't, and -1 if you don't know.
292 int dominates(pseudo_t pseudo
, struct instruction
*insn
, struct instruction
*dom
, int local
)
294 int opcode
= dom
->opcode
;
296 if (opcode
== OP_CALL
|| opcode
== OP_ENTRY
)
297 return local
? 0 : -1;
298 if (opcode
!= OP_LOAD
&& opcode
!= OP_STORE
)
300 if (dom
->src
!= pseudo
) {
303 /* We don't think two explicitly different symbols ever alias */
304 if (dom
->src
->type
== PSEUDO_SYM
)
306 /* We could try to do some alias analysis here */
309 if (!same_memop(insn
, dom
)) {
310 if (dom
->opcode
== OP_LOAD
)
312 if (!overlapping_memop(insn
, dom
))
319 static int find_dominating_parents(pseudo_t pseudo
, struct instruction
*insn
,
320 struct basic_block
*bb
, unsigned long generation
, struct pseudo_list
**dominators
,
321 int local
, int loads
)
323 struct basic_block
*parent
;
328 if (bb_list_size(bb
->parents
) > 1)
330 FOR_EACH_PTR(bb
->parents
, parent
) {
331 struct instruction
*one
;
332 struct instruction
*br
;
335 FOR_EACH_PTR_REVERSE(parent
->insns
, one
) {
339 dominance
= dominates(pseudo
, insn
, one
, local
);
341 if (one
->opcode
== OP_LOAD
)
347 if (one
->opcode
== OP_LOAD
&& !loads
)
349 goto found_dominator
;
350 } END_FOR_EACH_PTR_REVERSE(one
);
352 if (parent
->generation
== generation
)
354 parent
->generation
= generation
;
356 if (!find_dominating_parents(pseudo
, insn
, parent
, generation
, dominators
, local
, loads
))
361 br
= delete_last_instruction(&parent
->insns
);
362 phi
= alloc_phi(parent
, one
->target
, one
->size
);
363 phi
->ident
= phi
->ident
? : pseudo
->ident
;
364 add_instruction(&parent
->insns
, br
);
365 use_pseudo(insn
, phi
, add_pseudo(dominators
, phi
));
366 } END_FOR_EACH_PTR(parent
);
371 * We should probably sort the phi list just to make it easier to compare
372 * later for equality.
374 void rewrite_load_instruction(struct instruction
*insn
, struct pseudo_list
*dominators
)
379 * Check for somewhat common case of duplicate
382 new = first_pseudo(dominators
)->def
->src1
;
383 FOR_EACH_PTR(dominators
, phi
) {
384 if (new != phi
->def
->src1
)
386 new->ident
= new->ident
? : phi
->ident
;
387 } END_FOR_EACH_PTR(phi
);
390 * All the same pseudo - mark the phi-nodes unused
391 * and convert the load into a LNOP and replace the
394 FOR_EACH_PTR(dominators
, phi
) {
396 } END_FOR_EACH_PTR(phi
);
397 convert_load_instruction(insn
, new);
401 /* We leave symbol pseudos with a bogus usage list here */
402 if (insn
->src
->type
!= PSEUDO_SYM
)
403 kill_use(&insn
->src
);
404 insn
->opcode
= OP_PHI
;
405 insn
->phi_list
= dominators
;
408 static int find_dominating_stores(pseudo_t pseudo
, struct instruction
*insn
,
409 unsigned long generation
, int local
)
411 struct basic_block
*bb
= insn
->bb
;
412 struct instruction
*one
, *dom
= NULL
;
413 struct pseudo_list
*dominators
;
416 /* Unreachable load? Undo it */
418 insn
->opcode
= OP_LNOP
;
423 FOR_EACH_PTR(bb
->insns
, one
) {
427 dominance
= dominates(pseudo
, insn
, one
, local
);
429 /* Ignore partial load dominators */
430 if (one
->opcode
== OP_LOAD
)
440 } END_FOR_EACH_PTR(one
);
442 warning(pseudo
->sym
->pos
, "unable to find symbol read");
449 convert_load_instruction(insn
, dom
->target
);
453 /* OK, go find the parents */
454 bb
->generation
= generation
;
457 if (!find_dominating_parents(pseudo
, insn
, bb
, generation
, &dominators
, local
, 1))
460 /* This happens with initial assignments to structures etc.. */
465 convert_load_instruction(insn
, value_pseudo(0));
470 * If we find just one dominating instruction, we
471 * can turn it into a direct thing. Otherwise we'll
472 * have to turn the load into a phi-node of the
475 rewrite_load_instruction(insn
, dominators
);
479 static void kill_store(struct instruction
*insn
)
483 insn
->opcode
= OP_SNOP
;
484 kill_use(&insn
->target
);
488 /* Kill a pseudo that is dead on exit from the bb */
489 static void kill_dead_stores(pseudo_t pseudo
, unsigned long generation
, struct basic_block
*bb
, int local
)
491 struct instruction
*insn
;
492 struct basic_block
*parent
;
494 if (bb
->generation
== generation
)
496 bb
->generation
= generation
;
497 FOR_EACH_PTR_REVERSE(bb
->insns
, insn
) {
498 int opcode
= insn
->opcode
;
500 if (opcode
!= OP_LOAD
&& opcode
!= OP_STORE
) {
503 if (opcode
== OP_CALL
)
507 if (insn
->src
== pseudo
) {
508 if (opcode
== OP_LOAD
)
515 if (insn
->src
->type
!= PSEUDO_SYM
)
517 } END_FOR_EACH_PTR_REVERSE(insn
);
519 FOR_EACH_PTR(bb
->parents
, parent
) {
520 struct basic_block
*child
;
521 FOR_EACH_PTR(parent
->children
, child
) {
522 if (child
&& child
!= bb
)
524 } END_FOR_EACH_PTR(child
);
525 kill_dead_stores(pseudo
, generation
, parent
, local
);
526 } END_FOR_EACH_PTR(parent
);
530 * This should see if the "insn" trivially dominates some previous store, and kill the
531 * store if unnecessary.
533 static void kill_dominated_stores(pseudo_t pseudo
, struct instruction
*insn
,
534 unsigned long generation
, struct basic_block
*bb
, int local
, int found
)
536 struct instruction
*one
;
537 struct basic_block
*parent
;
539 /* Unreachable store? Undo it */
544 if (bb
->generation
== generation
)
546 bb
->generation
= generation
;
547 FOR_EACH_PTR_REVERSE(bb
->insns
, one
) {
555 dominance
= dominates(pseudo
, insn
, one
, local
);
560 if (one
->opcode
== OP_LOAD
)
563 } END_FOR_EACH_PTR_REVERSE(one
);
566 warning(bb
->pos
, "Unable to find instruction");
570 FOR_EACH_PTR(bb
->parents
, parent
) {
571 struct basic_block
*child
;
572 FOR_EACH_PTR(parent
->children
, child
) {
573 if (child
&& child
!= bb
)
575 } END_FOR_EACH_PTR(child
);
576 kill_dominated_stores(pseudo
, insn
, generation
, parent
, local
, found
);
577 } END_FOR_EACH_PTR(parent
);
580 void check_access(struct instruction
*insn
)
582 pseudo_t pseudo
= insn
->src
;
584 if (insn
->bb
&& pseudo
->type
== PSEUDO_SYM
) {
585 int offset
= insn
->offset
, bit
= bytes_to_bits(offset
) + insn
->size
;
586 struct symbol
*sym
= pseudo
->sym
;
588 if (sym
->bit_size
> 0 && (offset
< 0 || bit
> sym
->bit_size
))
589 warning(insn
->pos
, "invalid access %s '%s' (%d %d)",
590 offset
< 0 ? "below" : "past the end of",
591 show_ident(sym
->ident
), offset
,
592 bits_to_bytes(sym
->bit_size
));
596 static void simplify_one_symbol(struct entrypoint
*ep
, struct symbol
*sym
)
598 pseudo_t pseudo
, src
;
599 struct pseudo_user
*pu
;
600 struct instruction
*def
;
602 int all
, stores
, complex;
604 /* Never used as a symbol? */
605 pseudo
= sym
->pseudo
;
609 /* We don't do coverage analysis of volatiles.. */
610 if (sym
->ctype
.modifiers
& MOD_VOLATILE
)
613 /* ..and symbols with external visibility need more care */
614 mod
= sym
->ctype
.modifiers
& (MOD_NONLOCAL
| MOD_STATIC
| MOD_ADDRESSABLE
);
616 goto external_visibility
;
621 FOR_EACH_PTR(pseudo
->users
, pu
) {
622 /* We know that the symbol-pseudo use is the "src" in the instruction */
623 struct instruction
*insn
= pu
->insn
;
625 switch (insn
->opcode
) {
635 mod
|= MOD_ADDRESSABLE
;
636 goto external_visibility
;
643 warning(sym
->pos
, "symbol '%s' pseudo used in unexpected way", show_ident(sym
->ident
));
645 complex |= insn
->offset
;
646 } END_FOR_EACH_PTR(pu
);
654 * Goodie, we have a single store (if even that) in the whole
655 * thing. Replace all loads with moves from the pseudo,
656 * replace the store with a def.
662 FOR_EACH_PTR(pseudo
->users
, pu
) {
663 struct instruction
*insn
= pu
->insn
;
664 if (insn
->opcode
== OP_LOAD
) {
666 convert_load_instruction(insn
, src
);
668 } END_FOR_EACH_PTR(pu
);
670 /* Turn the store into a no-op */
678 FOR_EACH_PTR_REVERSE(pseudo
->users
, pu
) {
679 struct instruction
*insn
= pu
->insn
;
680 if (insn
->opcode
== OP_LOAD
)
681 all
&= find_dominating_stores(pseudo
, insn
, ++bb_generation
, !mod
);
682 } END_FOR_EACH_PTR_REVERSE(pu
);
684 /* If we converted all the loads, remove the stores. They are dead */
686 FOR_EACH_PTR(pseudo
->users
, pu
) {
687 struct instruction
*insn
= pu
->insn
;
688 if (insn
->opcode
== OP_STORE
)
690 } END_FOR_EACH_PTR(pu
);
693 * If we couldn't take the shortcut, see if we can at least kill some
696 FOR_EACH_PTR(pseudo
->users
, pu
) {
697 struct instruction
*insn
= pu
->insn
;
698 if (insn
->opcode
== OP_STORE
)
699 kill_dominated_stores(pseudo
, insn
, ++bb_generation
, insn
->bb
, !mod
, 0);
700 } END_FOR_EACH_PTR(pu
);
702 if (!(mod
& (MOD_NONLOCAL
| MOD_STATIC
))) {
703 struct basic_block
*bb
;
704 FOR_EACH_PTR(ep
->bbs
, bb
) {
706 kill_dead_stores(pseudo
, ++bb_generation
, bb
, !mod
);
707 } END_FOR_EACH_PTR(bb
);
714 void simplify_symbol_usage(struct entrypoint
*ep
)
718 FOR_EACH_PTR(ep
->accesses
, pseudo
) {
719 simplify_one_symbol(ep
, pseudo
->sym
);
720 } END_FOR_EACH_PTR(pseudo
);
723 static void mark_bb_reachable(struct basic_block
*bb
, unsigned long generation
)
725 struct basic_block
*child
;
727 if (bb
->generation
== generation
)
729 bb
->generation
= generation
;
730 FOR_EACH_PTR(bb
->children
, child
) {
731 mark_bb_reachable(child
, generation
);
732 } END_FOR_EACH_PTR(child
);
735 static void kill_defs(struct instruction
*insn
)
737 pseudo_t target
= insn
->target
;
739 if (!has_use_list(target
))
741 if (target
->def
!= insn
)
744 convert_instruction_target(insn
, VOID
);
747 void kill_bb(struct basic_block
*bb
)
749 struct instruction
*insn
;
750 struct basic_block
*child
, *parent
;
752 FOR_EACH_PTR(bb
->insns
, insn
) {
753 kill_instruction(insn
);
756 * We kill unreachable instructions even if they
757 * otherwise aren't "killable" (e.g. volatile loads)
760 } END_FOR_EACH_PTR(insn
);
763 FOR_EACH_PTR(bb
->children
, child
) {
764 remove_bb_from_list(&child
->parents
, bb
, 0);
765 } END_FOR_EACH_PTR(child
);
768 FOR_EACH_PTR(bb
->parents
, parent
) {
769 remove_bb_from_list(&parent
->children
, bb
, 0);
770 } END_FOR_EACH_PTR(parent
);
774 void kill_unreachable_bbs(struct entrypoint
*ep
)
776 struct basic_block
*bb
;
777 unsigned long generation
= ++bb_generation
;
779 mark_bb_reachable(ep
->entry
->bb
, generation
);
780 FOR_EACH_PTR(ep
->bbs
, bb
) {
781 if (bb
->generation
== generation
)
783 /* Mark it as being dead */
786 DELETE_CURRENT_PTR(bb
);
787 } END_FOR_EACH_PTR(bb
);
788 PACK_PTR_LIST(&ep
->bbs
);
791 static int rewrite_parent_branch(struct basic_block
*bb
, struct basic_block
*old
, struct basic_block
*new)
794 struct instruction
*insn
= last_instruction(bb
->insns
);
799 /* Infinite loops: let's not "optimize" them.. */
803 switch (insn
->opcode
) {
805 changed
|= rewrite_branch(bb
, &insn
->bb_true
, old
, new);
806 changed
|= rewrite_branch(bb
, &insn
->bb_false
, old
, new);
810 struct multijmp
*jmp
;
811 FOR_EACH_PTR(insn
->multijmp_list
, jmp
) {
812 changed
|= rewrite_branch(bb
, &jmp
->target
, old
, new);
813 } END_FOR_EACH_PTR(jmp
);
822 static struct basic_block
* rewrite_branch_bb(struct basic_block
*bb
, struct instruction
*br
)
824 struct basic_block
*parent
;
825 struct basic_block
*target
= br
->bb_true
;
826 struct basic_block
*false = br
->bb_false
;
828 if (target
&& false) {
829 pseudo_t cond
= br
->cond
;
830 if (cond
->type
!= PSEUDO_VAL
)
832 target
= cond
->value
? target
: false;
836 * We can't do FOR_EACH_PTR() here, because the parent list
837 * may change when we rewrite the parent.
839 while ((parent
= first_basic_block(bb
->parents
)) != NULL
) {
840 if (!rewrite_parent_branch(parent
, bb
, target
))
846 static void vrfy_bb_in_list(struct basic_block
*bb
, struct basic_block_list
*list
)
849 struct basic_block
*tmp
;
850 int no_bb_in_list
= 0;
852 FOR_EACH_PTR(list
, tmp
) {
855 } END_FOR_EACH_PTR(tmp
);
856 assert(no_bb_in_list
);
860 static void vrfy_parents(struct basic_block
*bb
)
862 struct basic_block
*tmp
;
863 FOR_EACH_PTR(bb
->parents
, tmp
) {
864 vrfy_bb_in_list(bb
, tmp
->children
);
865 } END_FOR_EACH_PTR(tmp
);
868 static void vrfy_children(struct basic_block
*bb
)
870 struct basic_block
*tmp
;
871 struct instruction
*br
= last_instruction(bb
->insns
);
874 assert(!bb
->children
);
877 switch (br
->opcode
) {
878 struct multijmp
*jmp
;
880 vrfy_bb_in_list(br
->bb_true
, bb
->children
);
881 vrfy_bb_in_list(br
->bb_false
, bb
->children
);
884 case OP_COMPUTEDGOTO
:
885 FOR_EACH_PTR(br
->multijmp_list
, jmp
) {
886 vrfy_bb_in_list(jmp
->target
, bb
->children
);
887 } END_FOR_EACH_PTR(jmp
);
893 FOR_EACH_PTR(bb
->children
, tmp
) {
894 vrfy_bb_in_list(bb
, tmp
->parents
);
895 } END_FOR_EACH_PTR(tmp
);
898 static void vrfy_bb_flow(struct basic_block
*bb
)
904 void vrfy_flow(struct entrypoint
*ep
)
906 struct basic_block
*bb
;
907 struct basic_block
*entry
= ep
->entry
->bb
;
909 FOR_EACH_PTR(ep
->bbs
, bb
) {
913 } END_FOR_EACH_PTR(bb
);
917 void pack_basic_blocks(struct entrypoint
*ep
)
919 struct basic_block
*bb
;
921 /* See if we can merge a bb into another one.. */
922 FOR_EACH_PTR(ep
->bbs
, bb
) {
923 struct instruction
*first
, *insn
;
924 struct basic_block
*parent
, *child
, *last
;
926 if (!bb_reachable(bb
))
932 FOR_EACH_PTR(bb
->insns
, first
) {
935 switch (first
->opcode
) {
936 case OP_NOP
: case OP_LNOP
: case OP_SNOP
:
939 struct basic_block
*replace
;
940 replace
= rewrite_branch_bb(bb
, first
);
950 } END_FOR_EACH_PTR(first
);
954 * See if we only have one parent..
957 FOR_EACH_PTR(bb
->parents
, parent
) {
964 } END_FOR_EACH_PTR(parent
);
967 if (!parent
|| parent
== bb
)
971 * Goodie. See if the parent can merge..
973 FOR_EACH_PTR(parent
->children
, child
) {
976 } END_FOR_EACH_PTR(child
);
981 repeat_phase
|= REPEAT_CSE
;
983 parent
->children
= bb
->children
;
987 FOR_EACH_PTR(parent
->children
, child
) {
988 replace_bb_in_list(&child
->parents
, bb
, parent
, 0);
989 } END_FOR_EACH_PTR(child
);
991 kill_instruction(delete_last_instruction(&parent
->insns
));
992 FOR_EACH_PTR(bb
->insns
, insn
) {
994 assert(insn
->bb
== bb
);
997 add_instruction(&parent
->insns
, insn
);
998 } END_FOR_EACH_PTR(insn
);
1002 /* nothing to do */;
1003 } END_FOR_EACH_PTR(bb
);