shared/irq/irq-handler-remove.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /**
0004  * @file
0005  *
0006  * @ingroup RTEMSImplClassicIntr
0007  *
0008  * @brief This source file contains the implementation of
0009  *   rtems_interrupt_handler_remove().
0010  */
0011
0012 /*
0013  * Copyright (C) 2021 embedded brains GmbH & Co. KG
0014  *
0015  * Redistribution and use in source and binary forms, with or without
0016  * modification, are permitted provided that the following conditions
0017  * are met:
0018  * 1. Redistributions of source code must retain the above copyright
0019  *    notice, this list of conditions and the following disclaimer.
0020  * 2. Redistributions in binary form must reproduce the above copyright
0021  *    notice, this list of conditions and the following disclaimer in the
0022  *    documentation and/or other materials provided with the distribution.
0023  *
0024  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
0025  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
0026  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
0027  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
0028  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
0029  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
0030  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
0031  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
0032  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
0033  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
0034  * POSSIBILITY OF SUCH DAMAGE.
0035  */
0036
0037 #include <bsp/irq-generic.h>
0038
0039 #include <stdlib.h>
0040
0041 static rtems_status_code bsp_interrupt_handler_do_remove(
0042   rtems_vector_number     vector,
0043   rtems_interrupt_handler routine,
0044   void                   *arg
0045 )
0046 {
0047   rtems_interrupt_entry    *entry;
0048   rtems_interrupt_entry   **previous_next;
0049
0050   entry = bsp_interrupt_entry_find( vector, routine, arg, &previous_next );
0051
0052   if ( entry == NULL ) {
0053     return RTEMS_UNSATISFIED;
0054   }
0055
0056   bsp_interrupt_entry_remove( vector, entry, previous_next );
0057   free( entry );
0058
0059   return RTEMS_SUCCESSFUL;
0060 }
0061
0062 rtems_status_code rtems_interrupt_handler_remove(
0063   rtems_vector_number     vector,
0064   rtems_interrupt_handler routine,
0065   void                   *arg
0066 )
0067 {
0068   rtems_status_code sc;
0069
0070   sc = bsp_interrupt_check_and_lock( vector, routine );
0071
0072   if ( sc != RTEMS_SUCCESSFUL ) {
0073     return sc;
0074   }
0075
0076   sc = bsp_interrupt_handler_do_remove( vector, routine, arg );
0077   bsp_interrupt_unlock();
0078
0079   return sc;
0080 }