Several basic blocks could be merged into a hyperblock in predicated execution so that instructions could be scheduled on a larger scope and more instruction level parallelism could be extracted.But it also brings some new challenges to traditional optimizers without predicate analysis

which can only yield conservative results.But unfortunately

limited by predicate representations

current methods need reconstructing control flow information before analyzing predicate relationships

which limits the effectiveness and efficiency of optimization.A new representation based on path information is proposed in this paper

which can convert predicate definitions into equivalent domain codes.And a global predicate relationship query system is constructed based on it.Experiment results indicated that precise and efficient global predicate analysis could be achieved with this system and the performance of optimized codes can also be improved with little impact on compilation efficiency.