1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
6 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 only,
10 * as published by the Free Software Foundation.
12 * This program is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License version 2 for more details (a copy is included
16 * in the LICENSE file that accompanied this code).
18 * You should have received a copy of the GNU General Public License
19 * version 2 along with this program; If not, see
20 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
22 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
23 * CA 95054 USA or visit www.sun.com if you need additional information or
29 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
30 * Use is subject to license terms.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * libcfs/libcfs/user-prim.c
38 * Implementations of portable APIs for liblustre
40 * Author: Nikita Danilov <nikita@clusterfs.com>
44 * liblustre is single-threaded, so most "synchronization" APIs are trivial.
49 #include <libcfs/libcfs.h>
52 * Wait queue. No-op implementation.
55 void cfs_waitq_init(struct cfs_waitq *waitq)
57 LASSERT(waitq != NULL);
61 void cfs_waitlink_init(struct cfs_waitlink *link)
63 LASSERT(link != NULL);
67 void cfs_waitq_add(struct cfs_waitq *waitq, struct cfs_waitlink *link)
69 LASSERT(waitq != NULL);
70 LASSERT(link != NULL);
75 void cfs_waitq_add_exclusive(struct cfs_waitq *waitq, struct cfs_waitlink *link)
77 LASSERT(waitq != NULL);
78 LASSERT(link != NULL);
83 void cfs_waitq_del(struct cfs_waitq *waitq, struct cfs_waitlink *link)
85 LASSERT(waitq != NULL);
86 LASSERT(link != NULL);
91 int cfs_waitq_active(struct cfs_waitq *waitq)
93 LASSERT(waitq != NULL);
98 void cfs_waitq_signal(struct cfs_waitq *waitq)
100 LASSERT(waitq != NULL);
104 void cfs_waitq_signal_nr(struct cfs_waitq *waitq, int nr)
106 LASSERT(waitq != NULL);
110 void cfs_waitq_broadcast(struct cfs_waitq *waitq)
112 LASSERT(waitq != NULL);
116 void cfs_waitq_wait(struct cfs_waitlink *link, cfs_task_state_t state)
118 LASSERT(link != NULL);
121 /* well, wait for something to happen */
122 cfs_call_wait_handler(0);
125 int64_t cfs_waitq_timedwait(struct cfs_waitlink *link, cfs_task_state_t state,
128 LASSERT(link != NULL);
130 cfs_call_wait_handler(timeout);
134 void cfs_schedule_timeout_and_set_state(cfs_task_state_t state, int64_t timeout)
137 /* sleep(timeout) here instead? */
138 cfs_waitq_timedwait(&l, state, timeout);
142 cfs_pause(cfs_duration_t d)
146 cfs_duration_nsec(d, &s);
150 int cfs_need_resched(void)
155 void cfs_cond_resched(void)
163 void cfs_init_timer(cfs_timer_t *t)
165 CFS_INIT_LIST_HEAD(&t->tl_list);
168 void cfs_timer_init(cfs_timer_t *l, cfs_timer_func_t *func, void *arg)
170 CFS_INIT_LIST_HEAD(&l->tl_list);
172 l->data = (ulong_ptr_t)arg;
176 int cfs_timer_is_armed(cfs_timer_t *l)
178 if (cfs_time_before(cfs_time_current(), l->expires))
184 void cfs_timer_arm(cfs_timer_t *l, cfs_time_t deadline)
186 l->expires = deadline;
189 void cfs_timer_disarm(cfs_timer_t *l)
192 cfs_time_t cfs_timer_deadline(cfs_timer_t *l)
198 #ifdef HAVE_LIBPTHREAD
204 struct lustre_thread_arg {
208 static void *cfs_thread_helper(void *data)
210 struct lustre_thread_arg *targ = data;
211 cfs_thread_t f = targ->f;
212 void *arg = targ->arg;
219 int cfs_create_thread(cfs_thread_t func, void *arg)
222 pthread_attr_t tattr;
224 struct lustre_thread_arg *targ_p = malloc(sizeof(struct lustre_thread_arg));
226 if ( targ_p == NULL )
232 pthread_attr_init(&tattr);
233 pthread_attr_setdetachstate(&tattr, PTHREAD_CREATE_DETACHED);
234 rc = pthread_create(&tid, &tattr, cfs_thread_helper, targ_p);
235 pthread_attr_destroy(&tattr);
240 uid_t cfs_curproc_uid(void)
245 gid_t cfs_curproc_gid(void)
250 uid_t cfs_curproc_fsuid(void)
255 gid_t cfs_curproc_fsgid(void)
260 void cfs_enter_debugger(void)
267 void cfs_daemonize(char *str)
272 int cfs_daemonize_ctxt(char *str)
277 cfs_sigset_t cfs_block_allsigs(void)
284 rc = sigprocmask(SIG_SETMASK, &all, &old);
290 cfs_sigset_t cfs_block_sigs(cfs_sigset_t blocks)
295 rc = sigprocmask(SIG_SETMASK, &blocks, &old);
301 void cfs_restore_sigs(cfs_sigset_t old)
303 int rc = sigprocmask(SIG_SETMASK, &old, NULL);
308 int cfs_signal_pending(void)
314 rc = sigpending(&set);
319 return !memcmp(&empty, &set, sizeof(set));
322 void cfs_clear_sigpending(void)
330 * In glibc (NOT in Linux, so check above is not right), implement
331 * stack-back-tracing through backtrace() function.
333 #include <execinfo.h>
335 void cfs_stack_trace_fill(struct cfs_stack_trace *trace)
337 backtrace(trace->frame, ARRAY_SIZE(trace->frame));
340 void *cfs_stack_trace_frame(struct cfs_stack_trace *trace, int frame_no)
342 if (0 <= frame_no && frame_no < ARRAY_SIZE(trace->frame))
343 return trace->frame[frame_no];
350 void cfs_stack_trace_fill(struct cfs_stack_trace *trace)
352 void *cfs_stack_trace_frame(struct cfs_stack_trace *trace, int frame_no)
360 void lbug_with_loc(const char *file, const char *func, const int line)
362 /* No libcfs_catastrophe in userspace! */
363 libcfs_debug_msg(NULL, 0, D_EMERG, file, func, line, "LBUG\n");
372 * c-indentation-style: "K&R"