1 | /* |
2 | * Copyright (C) 2014, 2015 Apple Inc. All rights reserved. |
3 | * |
4 | * Redistribution and use in source and binary forms, with or without |
5 | * modification, are permitted provided that the following conditions |
6 | * are met: |
7 | * 1. Redistributions of source code must retain the above copyright |
8 | * notice, this list of conditions and the following disclaimer. |
9 | * 2. Redistributions in binary form must reproduce the above copyright |
10 | * notice, this list of conditions and the following disclaimer in the |
11 | * documentation and/or other materials provided with the distribution. |
12 | * |
13 | * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY |
14 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
15 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR |
17 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
18 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
19 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
20 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
21 | * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
22 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
23 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
24 | */ |
25 | |
26 | #pragma once |
27 | |
28 | #if ENABLE(DFG_JIT) |
29 | |
30 | #include "DFGBasicBlock.h" |
31 | #include "DFGBlockSet.h" |
32 | #include <wtf/GraphNodeWorklist.h> |
33 | |
34 | namespace JSC { namespace DFG { |
35 | |
36 | struct BasicBlock; |
37 | |
38 | typedef GraphNodeWorklist<BasicBlock*, BlockSet> BlockWorklist; |
39 | |
40 | // When you say BlockWith<int> you should read it as "block with an int". |
41 | template<typename T> using BlockWith = GraphNodeWith<BasicBlock*, T>; |
42 | |
43 | // Extended block worklist is useful for enqueueing some meta-data along with the block. It also |
44 | // permits forcibly enqueueing things even if the block has already been seen. It's useful for |
45 | // things like building a spanning tree, in which case T (the auxiliary payload) would be the |
46 | // successor index. |
47 | template<typename T> using ExtendedBlockWorklist = ExtendedGraphNodeWorklist<BasicBlock*, T, BlockSet>; |
48 | |
49 | typedef GraphVisitOrder VisitOrder; |
50 | |
51 | typedef GraphNodeWithOrder<BasicBlock*> BlockWithOrder; |
52 | |
53 | typedef PostOrderGraphNodeWorklist<BasicBlock*, BlockSet> PostOrderBlockWorklist; |
54 | |
55 | } } // namespace JSC::DFG |
56 | |
57 | #endif // ENABLE(DFG_JIT) |
58 | |