This page is intended for anyone to post questions and everyone to answer them. Please insert questions at the beginning and separate each question with a horizontal rule separator. For other formatting instructions read the answer to this question.

**A**: Suppose `node`

is the node, use `debug_tree(node);`

to do the dump.
I think another useful dump function is dump_node(node, TDF_SLIM, stderr), which prints detailed information about a node.

**Q**: *How to get the number of parameters of a function call?*

**A**: Suppose `stmt`

is the function call, then do the following and `num_parms`

is the number .

tree parms = TREE_OPERAND (stmt, 1); int num_parms; tree p; for (p = parms, num_parms = 0; p; p = TREE_CHAIN (p)) num_parms++;

**Q**: *More of remarks and vague ideas than questions: in class we discussed about Chris' idea to perform the a=b-c <=> b=c+1 analysis. I had doubts about the idea because I was thinking "=" more of as an assignment operator, rather than the algebraic equality alternative, which pretty much is what it is in this analysis step. I guess thus, that at this level we can perform an even wider variety of symbolic analysis (something that would resemble what Maple does for the common mathematical notations, but in our case solely for Algebra) and generate an even wider range of possible optimizations one cannot possible expect at first sight. I was wondering though to what extent this actually happens, since the way we program brakes down the simplest algebraic expressions into difficult to track simplified steps. I was also wondering whether one can run any optimizations as (syntax) tree-data structure operations, i.e whether instead of a hash there exists an advanced data structure that keeps the tree-like structure of the syntax tree and optimizations are realized as (for example) rotations, insertions/deletions/pruning etc. After all, after the optimizations we should be able to build a new syntax tree from an optimized version of the code ; does there exist a possible repetitive transformation that does not need intermediate hash-based analysis (maybe I 'm making a hard problem impossible here)?*

**A**: Okay let's add a category for remarks and begin them with symbol **R**. You are right that the optimization of algebraic expressions is not different from the classic problem of mathematics. When we start talking about the equivalence between programs we need to understand the basic semantics of programming languages, which we'll discuss in the last two weeks of the course. (added by ChenDing, 10pm, 1/31)

**Q**: *Is there only one immediate dominator for every block, or might it be the case that there are more?*

**A**: I quite think that this was what we were asked to work upon in class. So I repeat the definition as we mentioned them in class :

A block X is a Dominator of Y in a Control Flow Graph, if X appears on every path that enters Y. We write X>>Y and say X dominates Y. We also say that if X!=Y , then X "strictly" dominates Y.

The Immediate Dominator of Y is the strict dominator that is closest to Y in an execution path.

Question was can that "an" be one/some, or should it be every ?

We denote the list of possible dominators of X as DOM(X) and the immediate dominator of X as IDOM(X). The question we were asked to prove in class was whether IDOM definition possibly allows for two different possible immediate dominators. Let's denote with SDOM(X) the strict dominators of X. Then SDOM(X)=DOM(X)-{X}. Let's assume that the definition of IDOM allows for two different immediate dominators ; if it doesn't allow for two, it certainly cannot allow for more, since X will definitely have 2 immediate dominators if it has 3. Say IDOM(X)={Y,Z} . Then, there exist two options : either Y and Z are on the same execution path, or not. By the property of "closeness in an execution path", only one of the possible predecessors of X in the same path can be closer to X ; That should hold because Y!=X and Z!=X, since the immediate dominator is in SDOM. So either Y==Z or the two immediate dominators reside on different paths. If Y and Z are on different paths, then the do not belong in SDOM, because by definition, Y and Z should appear in every path that enters X, though we just claimed that they reside on different execution paths and thus one does not exist in the execution path of the other and consequently in all execution paths entering X. Thus, "There can be only one". I hope this is a decent proof.

**R** I don't understand the logic completely. Is it possible that Y and Z both appear on two paths from entry to X. Y is closer to X on one path and Z is closer to X on the other? Good try. (added by ChenDing, 10pm, 1/31)

**R** Oh, you 're right, I had a typo on the "options" description which I didn't notice (and I added some clarifications to make the whole thing more readable). I wanted to say exactly that Y and Z either appear on the same path or not. I corrected the previous version (wiki-like) so if someone was to see the mistake they shall try the history view.

**R** Thanks for the clarification. Correcting in the proof is a good idea. Can the proof rule out the case I had in the last remark, where both Y and Z are strict dominators of X but the closest one is not the same in the two paths? --Main.ChenDing

**A**: A question and an answer start with the bold letter **Q** and **A** respectively followed by a colon. Use italic text for the question and normal text for the answer. Use a separator (a horizontal rule) after each question. Add new questions to the beginning of the list.

Copyright © 2008-2018 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.

Ideas, requests, problems regarding URCS? Send feedback

Ideas, requests, problems regarding URCS? Send feedback