121 lines
3.4 KiB
C
121 lines
3.4 KiB
C
/*-
|
|
* BSD LICENSE
|
|
*
|
|
* Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* * 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.
|
|
* * Neither the name of Intel Corporation nor the names of its
|
|
* contributors may be used to endorse or promote products derived
|
|
* from this software without specific prior written permission.
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
#include <errno.h>
|
|
#include <stdint.h>
|
|
#include <stdio.h>
|
|
#include <sys/queue.h>
|
|
|
|
#include <rte_launch.h>
|
|
#include <rte_memory.h>
|
|
#include <rte_memzone.h>
|
|
#include <rte_tailq.h>
|
|
#include <rte_eal.h>
|
|
#include <rte_atomic.h>
|
|
#include <rte_per_lcore.h>
|
|
#include <rte_lcore.h>
|
|
|
|
/*
|
|
* Wait until a lcore finished its job.
|
|
*/
|
|
int
|
|
rte_eal_wait_lcore(unsigned slave_id)
|
|
{
|
|
if (lcore_config[slave_id].state == WAIT)
|
|
return 0;
|
|
|
|
while (lcore_config[slave_id].state != WAIT &&
|
|
lcore_config[slave_id].state != FINISHED);
|
|
|
|
rte_rmb();
|
|
|
|
/* we are in finished state, go to wait state */
|
|
lcore_config[slave_id].state = WAIT;
|
|
return lcore_config[slave_id].ret;
|
|
}
|
|
|
|
/*
|
|
* Check that every SLAVE lcores are in WAIT state, then call
|
|
* rte_eal_remote_launch() for all of them. If call_master is true
|
|
* (set to CALL_MASTER), also call the function on the master lcore.
|
|
*/
|
|
int
|
|
rte_eal_mp_remote_launch(int (*f)(void *), void *arg,
|
|
enum rte_rmt_call_master_t call_master)
|
|
{
|
|
int lcore_id;
|
|
int master = rte_get_master_lcore();
|
|
|
|
/* check state of lcores */
|
|
RTE_LCORE_FOREACH_SLAVE(lcore_id) {
|
|
if (lcore_config[lcore_id].state != WAIT)
|
|
return -EBUSY;
|
|
}
|
|
|
|
/* send messages to cores */
|
|
RTE_LCORE_FOREACH_SLAVE(lcore_id) {
|
|
rte_eal_remote_launch(f, arg, lcore_id);
|
|
}
|
|
|
|
if (call_master == CALL_MASTER) {
|
|
lcore_config[master].ret = f(arg);
|
|
lcore_config[master].state = FINISHED;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Return the state of the lcore identified by slave_id.
|
|
*/
|
|
enum rte_lcore_state_t
|
|
rte_eal_get_lcore_state(unsigned lcore_id)
|
|
{
|
|
return lcore_config[lcore_id].state;
|
|
}
|
|
|
|
/*
|
|
* Do a rte_eal_wait_lcore() for every lcore. The return values are
|
|
* ignored.
|
|
*/
|
|
void
|
|
rte_eal_mp_wait_lcore(void)
|
|
{
|
|
unsigned lcore_id;
|
|
|
|
RTE_LCORE_FOREACH_SLAVE(lcore_id) {
|
|
rte_eal_wait_lcore(lcore_id);
|
|
}
|
|
}
|
|
|