HAL
coordinate_from_data.h
Go to the documentation of this file.
1 // MIT License
2 //
3 // Copyright (c) 2019 Ruhr University Bochum, Chair for Embedded Security. All Rights reserved.
4 // Copyright (c) 2019 Marc Fyrbiak, Sebastian Wallat, Max Hoffmann ("ORIGINAL AUTHORS"). All rights reserved.
5 // Copyright (c) 2021 Max Planck Institute for Security and Privacy. All Rights reserved.
6 // Copyright (c) 2021 Jörn Langheinrich, Julian Speith, Nils Albartus, René Walendy, Simon Klix ("ORIGINAL AUTHORS"). All Rights reserved.
7 //
8 // Permission is hereby granted, free of charge, to any person obtaining a copy
9 // of this software and associated documentation files (the "Software"), to deal
10 // in the Software without restriction, including without limitation the rights
11 // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
12 // copies of the Software, and to permit persons to whom the Software is
13 // furnished to do so, subject to the following conditions:
14 //
15 // The above copyright notice and this permission notice shall be included in all
16 // copies or substantial portions of the Software.
17 //
18 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
19 // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
21 // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
22 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
23 // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
24 // SOFTWARE.
25 
26 #pragma once
27 
28 #include "hal_core/defines.h"
29 
30 #include <QPoint>
31 #include <QHash>
32 #include <QSet>
33 #include <map>
34 #include <limits.h>
35 
36 uint qHash(const QPoint& pnt);
37 
38 namespace hal {
39 
40  class Module;
41  class Gate;
42  class Node;
43 
48  class CoordinateFromData : public QPoint
49  {
50  public:
51  CoordinateFromData(int x_=INT_MIN, int y_=INT_MIN);
52  bool isUndefined() const { return x()==INT_MIN || y()==INT_MIN; }
53  static CoordinateFromData fromNode(const Node& nd);
54  private:
55  static CoordinateFromData fromData(const std::map<std::tuple<std::string, std::string>, std::tuple<std::string, std::string>>& dc);
56  };
57 
62  class CoordinateFromDataMap : public QHash<hal::Node,CoordinateFromData>
63  {
64  public:
65  CoordinateFromDataMap(const QSet<u32>& modules, const QSet<u32>& gates);
66  bool good() const;
67  void simplify();
68  void clear();
69  bool isPlacementComplete() const;
70  const QSet<u32>& placedGates() const { return mPlacedGates; }
71  const QSet<u32>& placedModules() const { return mPlacedModules; }
72  private:
73  int mUndefCount;
74  int mPlacedCount;
75  int mDoubleCount;
76  QHash<QPoint,int> mPositionHash;
77  void insertNode(const hal::Node& nd, const CoordinateFromData& cfd);
78 
79  QSet<u32> mPlacedGates;
80  QSet<u32> mPlacedModules;
81  };
82 }
Utility class that extracts (if possible) x and y coordinates contained in the netlist.
static CoordinateFromData fromNode(const Node &nd)
CoordinateFromData(int x_=INT_MIN, int y_=INT_MIN)
Utility class that stores the nodes that contained existing x and y coordinates.
CoordinateFromDataMap(const QSet< u32 > &modules, const QSet< u32 > &gates)
const QSet< u32 > & placedModules() const
const QSet< u32 > & placedGates() const
The Node class object represents a module or a gate.
Definition: gui_def.h:61
uint qHash(const QPoint &pnt)
Definition: node_box.cpp:6
int x() const const
int y() const const