reactos/include/reactos/helper.h

   1 #ifndef _HELPER_H
   2 #define _HELPER_H
   3
   4 #define ROUNDUP(a,b)    ((((a)+(b)-1)/(b))*(b))
   5 #define ROUNDDOWN(a,b)  (((a)/(b))*(b))
   6 #define ROUND_UP ROUNDUP
   7 #define ROUND_DOWN ROUNDDOWN
   8 #define PAGE_ROUND_DOWN(x) (((ULONG)x)&(~(PAGE_SIZE-1)))
   9 #define PAGE_ROUND_UP(x) ( (((ULONG)x)%PAGE_SIZE) ? ((((ULONG)x)&(~(PAGE_SIZE-1)))+PAGE_SIZE) : ((ULONG)x) )
  10 #define ABS_VALUE(V) (((V) < 0) ? -(V) : (V))
  11 #define RtlRosMin(X,Y) (((X) < (Y))? (X) : (Y))
  12 #define RtlRosMin3(X,Y,Z) (((X) < (Y)) ? RtlRosMin(X,Z) : RtlRosMin(Y,Z))
  13 #define KEBUGCHECKEX(a,b,c,d,e) DbgPrint("KeBugCheckEx at %s:%i\n",__FILE__,__LINE__), KeBugCheckEx(a,b,c,d,e)
  14 #define KEBUGCHECK(a) DbgPrint("KeBugCheck at %s:%i\n",__FILE__,__LINE__), KeBugCheck(a)
  15 #define EXPORTED __declspec(dllexport)
  16 #define IMPORTED __declspec(dllimport)
  17 #define LIST_FOR_EACH(entry, head) \
  18    for(entry = (head)->Flink; entry != (head); entry = entry->Flink)
  19 #define LIST_FOR_EACH_SAFE(tmp_entry, head, ptr, type, field) \
  20    for ((tmp_entry)=(head)->Flink; (tmp_entry)!=(head) && \
  21         ((ptr) = CONTAINING_RECORD(tmp_entry,type,field)) && \
  22         ((tmp_entry) = (tmp_entry)->Flink); )
  23 #define OPTHDROFFSET(a) ((LPVOID)((BYTE *)a                  +  \
  24                          ((PIMAGE_DOS_HEADER)a)->e_lfanew    +  \
  25                          sizeof (IMAGE_NT_SIGNATURE)                 +  \
  26                          sizeof (IMAGE_FILE_HEADER)))
  27 #define TAG(A, B, C, D) (ULONG)(((A)<<0) + ((B)<<8) + ((C)<<16) + ((D)<<24))
  28 #define RVA(m, b) ((ULONG)b + m)
  29 #define NTSTAT_SEVERITY_SHIFT 30
  30 #define NTSTAT_SEVERITY_MASK  0x00000003
  31 #define NTSTAT_FACILITY_SHIFT 16
  32 #define NTSTAT_FACILITY_MASK  0x00000FFF
  33 #define NTSTAT_CUSTOMER_MASK  0x20000000
  34 #define NT_SEVERITY(StatCode) (((StatCode) >> NTSTAT_SEVERITY_SHIFT) & NTSTAT_SEVERITY_MASK)
  35 #define NT_FACILITY(StatCode) (((StatCode) >> NTSTAT_FACILITY_SHIFT) & NTSTAT_FACILITY_MASK)
  36 #define NT_CUSTOMER(StatCode) ((StatCode) & NTSTAT_CUSTOMER_MASK)
  37 #define RELATIVE_TIME(wait) (-(wait))
  38 #define NANOS_TO_100NS(nanos) (((LONGLONG)(nanos)) / 100)
  39 #define MICROS_TO_100NS(micros) (((LONGLONG)(micros)) * NANOS_TO_100NS(1000))
  40 #define MILLIS_TO_100NS(milli) (((LONGLONG)(milli)) * MICROS_TO_100NS(1000))
  41 #define SECONDS_TO_100NS(seconds) (((LONGLONG)(seconds)) * MILLIS_TO_100NS(1000))
  42 #define MINUTES_TO_100NS(minutes) (((LONGLONG)(minutes)) * SECONDS_TO_100NS(60))
  43 #define HOURS_TO_100NS(hours) (((LONGLONG)(hours)) * MINUTES_TO_100NS(60))
  44 #define TYPE_ALIGNMENT(t) FIELD_OFFSET(struct { char x; t test; }, test)
  45 #define InsertAscendingListFIFO(ListHead, Type, ListEntryField, NewEntry, SortField)\
  46 {\
  47   PLIST_ENTRY current;\
  48 \
  49   current = (ListHead)->Flink;\
  50   while (current != (ListHead))\
  51   {\
  52     if (CONTAINING_RECORD(current, Type, ListEntryField)->SortField >\
  53         (NewEntry)->SortField)\
  54     {\
  55       break;\
  56     }\
  57     current = current->Flink;\
  58   }\
  59 \
  60   InsertTailList(current, &((NewEntry)->ListEntryField));\
  61 }
  62
  63 #define InsertDescendingListFIFO(ListHead, Type, ListEntryField, NewEntry, SortField)\
  64 {\
  65   PLIST_ENTRY current;\
  66 \
  67   current = (ListHead)->Flink;\
  68   while (current != (ListHead))\
  69   {\
  70     if (CONTAINING_RECORD(current, Type, ListEntryField)->SortField <\
  71         (NewEntry)->SortField)\
  72     {\
  73       break;\
  74     }\
  75     current = current->Flink;\
  76   }\
  77 \
  78   InsertTailList(current, &((NewEntry)->ListEntryField));\
  79 }
  80
  81 #define InsertAscendingList(ListHead, Type, ListEntryField, NewEntry, SortField)\
  82 {\
  83   PLIST_ENTRY current;\
  84 \
  85   current = (ListHead)->Flink;\
  86   while (current != (ListHead))\
  87   {\
  88     if (CONTAINING_RECORD(current, Type, ListEntryField)->SortField >=\
  89         (NewEntry)->SortField)\
  90     {\
  91       break;\
  92     }\
  93     current = current->Flink;\
  94   }\
  95 \
  96   InsertTailList(current, &((NewEntry)->ListEntryField));\
  97 }
  98
  99 #define InsertDescendingList(ListHead, Type, ListEntryField, NewEntry, SortField)\
 100 {\
 101   PLIST_ENTRY current;\
 102 \
 103   current = (ListHead)->Flink;\
 104   while (current != (ListHead))\
 105   {\
 106     if (CONTAINING_RECORD(current, Type, ListEntryField)->SortField <=\
 107         (NewEntry)->SortField)\
 108     {\
 109       break;\
 110     }\
 111     current = current->Flink;\
 112   }\
 113 \
 114   InsertTailList(current, &((NewEntry)->ListEntryField));\
 115 }
 116
 117 #endif