summaryrefslogtreecommitdiffstats
path: root/cpukit/rtems/src/scheduleraddprocessor.c
blob: 1f8c1c502e8f6afad4260c4ecfeca43886db45a5 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
/* SPDX-License-Identifier: BSD-2-Clause */

/**
 * @file
 *
 * @ingroup RTEMSImplClassicScheduler
 *
 * @brief This source file contains the implementation of
 *   rtems_scheduler_add_processor().
 */

/*
 * Copyright (c) 2016 embedded brains GmbH.  All rights reserved.
 *
 *  embedded brains GmbH
 *  Dornierstr. 4
 *  82178 Puchheim
 *  Germany
 *  <rtems@embedded-brains.de>
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include <rtems/rtems/scheduler.h>
#include <rtems/score/assert.h>
#include <rtems/score/schedulerimpl.h>
#include <rtems/config.h>

rtems_status_code rtems_scheduler_add_processor(
  rtems_id scheduler_id,
  uint32_t cpu_index
)
{
  uint32_t                 scheduler_index;
#if defined(RTEMS_SMP)
  Per_CPU_Control         *cpu;
  rtems_status_code        status;
#endif

  scheduler_index = _Scheduler_Get_index_by_id( scheduler_id );

  if ( scheduler_index >= _Scheduler_Count ) {
    return RTEMS_INVALID_ID;
  }

  if ( cpu_index >= rtems_configuration_get_maximum_processors() ) {
    return RTEMS_NOT_CONFIGURED;
  }

#if defined(RTEMS_SMP)
  cpu = _Per_CPU_Get_by_index( cpu_index );

  if ( _Scheduler_Initial_assignments[ cpu_index ].scheduler == NULL ) {
    return RTEMS_NOT_CONFIGURED;
  }

  if ( !_Per_CPU_Is_processor_online( cpu ) ) {
    return RTEMS_INCORRECT_STATE;
  }

  _Objects_Allocator_lock();

  if ( cpu->Scheduler.control == NULL ) {
    const Scheduler_Control *scheduler;
    Scheduler_Context       *scheduler_context;
    Priority_Control         idle_priority;
    Thread_Control          *idle;
    Scheduler_Node          *scheduler_node;
    ISR_lock_Context         lock_context;
    Per_CPU_Control         *cpu_self;

    scheduler = &_Scheduler_Table[ scheduler_index ];
    scheduler_context = _Scheduler_Get_context( scheduler );
    idle_priority =
      _Scheduler_Map_priority( scheduler, scheduler->maximum_priority );

    idle = cpu->Scheduler.idle_if_online_and_unused;
    _Assert( idle != NULL );
    cpu->Scheduler.idle_if_online_and_unused = NULL;

    idle->Scheduler.home_scheduler = scheduler;
    idle->Start.initial_priority = idle_priority;
    scheduler_node =
      _Thread_Scheduler_get_node_by_index( idle, scheduler_index );
    _Priority_Node_set_priority( &idle->Real_priority, idle_priority );
    _Priority_Initialize_one(
      &scheduler_node->Wait.Priority,
      &idle->Real_priority
    );
    _Assert( _Chain_Is_empty( &idle->Scheduler.Wait_nodes ) );
    _Chain_Initialize_one(
      &idle->Scheduler.Wait_nodes,
      &scheduler_node->Thread.Wait_node
    );
    _Assert( _Chain_Is_empty( &idle->Scheduler.Scheduler_nodes ) );
    _Chain_Initialize_one(
      &idle->Scheduler.Scheduler_nodes,
      &scheduler_node->Thread.Scheduler_node.Chain
    );

    _ISR_lock_ISR_disable( &lock_context );
    _Scheduler_Acquire_critical( scheduler, &lock_context );
    _Processor_mask_Set( &scheduler_context->Processors, cpu_index );
    cpu->Scheduler.control = scheduler;
    cpu->Scheduler.context = scheduler_context;
    ( *scheduler->Operations.add_processor )( scheduler, idle );
    cpu_self = _Thread_Dispatch_disable_critical( &lock_context );
    _Scheduler_Release_critical( scheduler, &lock_context );
    _ISR_lock_ISR_enable( &lock_context );
    _Thread_Dispatch_direct( cpu_self );
    status = RTEMS_SUCCESSFUL;
  } else {
    status = RTEMS_RESOURCE_IN_USE;
  }

  _Objects_Allocator_unlock();
  return status;
#else
  return RTEMS_RESOURCE_IN_USE;
#endif
}