aboutsummaryrefslogtreecommitdiffstats
path: root/src/mhdlsim/mhdlsim.ads
blob: ef1eed2756933192f6650cc3850f2963e4cb0a65 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
with Grt.Types; use Grt.Types;

package Mhdlsim is
   function Process_Param (Opt : Ghdl_C_String; Len : Natural)
                          return Integer;
   pragma Export (C, Process_Param, "mhdlsim_vhdl_process_param");

   procedure Analyze_Init;
   pragma Export (C, Analyze_Init, "mhdlsim_vhdl_analyze_init");

   function Analyze_File (File : Ghdl_C_String; Len : Natural)
                    return Integer;
   pragma Export (C, Analyze_File, "mhdlsim_vhdl_analyze_file");

   function Known_Top_Unit return Integer;
   pragma Export (C, Known_Top_Unit, "mhdlsim_vhdl_known_top_unit");

   procedure Elaborate;
   pragma Export (C, Elaborate, "mhdlsim_vhdl_elaborate");

   procedure Run;
   pragma Export (C, Run, "mhdlsim_vhdl_run");
end Mhdlsim;
BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. **************************************************************************************************/ #ifndef Minisat_Sort_h #define Minisat_Sort_h #include "Vec.h" //================================================================================================= // Some sorting algorithms for vec's namespace Minisat { template<class T> struct LessThan_default { bool operator () (T x, T y) { return x < y; } }; template <class T, class LessThan> void selectionSort(T* array, int size, LessThan lt) { int i, j, best_i; T tmp; for (i = 0; i < size-1; i++){ best_i = i; for (j = i+1; j < size; j++){ if (lt(array[j], array[best_i])) best_i = j; } tmp = array[i]; array[i] = array[best_i]; array[best_i] = tmp; } } template <class T> static inline void selectionSort(T* array, int size) { selectionSort(array, size, LessThan_default<T>()); } template <class T, class LessThan> void sort(T* array, int size, LessThan lt) { if (size <= 15) selectionSort(array, size, lt); else{ T pivot = array[size / 2]; T tmp; int i = -1; int j = size; for(;;){ do i++; while(lt(array[i], pivot)); do j--; while(lt(pivot, array[j])); if (i >= j) break; tmp = array[i]; array[i] = array[j]; array[j] = tmp; } sort(array , i , lt); sort(&array[i], size-i, lt); } } template <class T> static inline void sort(T* array, int size) { sort(array, size, LessThan_default<T>()); } //================================================================================================= // For 'vec's: template <class T, class LessThan> void sort(vec<T>& v, LessThan lt) { sort((T*)v, v.size(), lt); } template <class T> void sort(vec<T>& v) { sort(v, LessThan_default<T>()); } //================================================================================================= } #endif