4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2012, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
37 #ifndef __LIBCFS_WINNT_LIBCFS_H__
38 #define __LIBCFS_WINNT_LIBCFS_H__
40 #ifndef __LIBCFS_LIBCFS_H__
41 #error Do not #include this file directly. #include <libcfs/libcfs.h> instead
44 /* workgroud for VC compiler */
46 #define __FUNCTION__ ("generic")
50 #include <libcfs/winnt/winnt-types.h>
51 #include <libcfs/list.h>
52 #include <libcfs/winnt/winnt-time.h>
53 #include <libcfs/winnt/winnt-lock.h>
54 #include <libcfs/winnt/winnt-mem.h>
55 #include <libcfs/winnt/winnt-prim.h>
56 #include <libcfs/winnt/winnt-fs.h>
57 #include <libcfs/winnt/winnt-tcpip.h>
58 #include <libcfs/winnt/kp30.h>
63 /* if you change this, update darwin-util.c:cfs_stack_trace_fill() */
64 CFS_STACK_TRACE_DEPTH = 16
67 struct cfs_stack_trace {
68 void *frame[CFS_STACK_TRACE_DEPTH];
71 static inline __u32 query_stack_size()
73 ULONG LowLimit, HighLimit;
75 IoGetStackLimits((PULONG_PTR)&LowLimit, (PULONG_PTR)&HighLimit);
76 ASSERT(HighLimit > LowLimit);
78 return (__u32) (HighLimit - LowLimit);
81 /* disable watchdog */
84 #else /* !__KERNEL__*/
86 #include <libcfs/user-bitops.h>
88 static inline __u32 query_stack_size()
90 return PAGE_SIZE; /* using one page in default */
93 #endif /* __KERNEL__*/
96 # define THREAD_SIZE query_stack_size()
100 #define CDEBUG_STACK() (THREAD_SIZE - (__u32)IoGetRemainingStackSize())
101 #define CFS_CHECK_STACK(msgdata, mask, cdls) do {} while(0)
102 #else /* !__KERNEL__ */
103 #define CFS_CHECK_STACK(msgdata, mask, cdls) do {} while(0)
104 #define CDEBUG_STACK() (0L)
105 #endif /* __KERNEL__ */
108 #define LUSTRE_LNET_PID 12345
110 #define ENTRY_NESTING_SUPPORT (0)
111 #define ENTRY_NESTING do {} while (0)
112 #define EXIT_NESTING do {} while (0)
113 #define __current_nesting_level() (0)
115 #endif /* _WINNT_LIBCFS_H */