2012-09-04 12:54:00 +00:00
|
|
|
/*-
|
|
|
|
* BSD LICENSE
|
2014-06-03 23:42:50 +00:00
|
|
|
*
|
2014-02-10 11:46:50 +00:00
|
|
|
* Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
|
2012-09-04 12:54:00 +00:00
|
|
|
* All rights reserved.
|
2014-06-03 23:42:50 +00:00
|
|
|
*
|
2013-09-18 10:00:00 +00:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
2012-09-04 12:54:00 +00:00
|
|
|
* are met:
|
2014-06-03 23:42:50 +00:00
|
|
|
*
|
2013-09-18 10:00:00 +00:00
|
|
|
* * Redistributions of source code must retain the above copyright
|
2012-09-04 12:54:00 +00:00
|
|
|
* notice, this list of conditions and the following disclaimer.
|
2013-09-18 10:00:00 +00:00
|
|
|
* * 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
|
2012-09-04 12:54:00 +00:00
|
|
|
* distribution.
|
2013-09-18 10:00:00 +00:00
|
|
|
* * Neither the name of Intel Corporation nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived
|
2012-09-04 12:54:00 +00:00
|
|
|
* from this software without specific prior written permission.
|
2014-06-03 23:42:50 +00:00
|
|
|
*
|
2013-09-18 10:00:00 +00:00
|
|
|
* 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
|
2012-09-04 12:54:00 +00:00
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <sys/queue.h>
|
|
|
|
|
|
|
|
#include <rte_common.h>
|
|
|
|
#include <rte_memory.h>
|
|
|
|
#include <rte_memzone.h>
|
|
|
|
#include <rte_per_lcore.h>
|
|
|
|
#include <rte_launch.h>
|
|
|
|
#include <rte_atomic.h>
|
|
|
|
#include <rte_rwlock.h>
|
|
|
|
#include <rte_eal.h>
|
|
|
|
#include <rte_per_lcore.h>
|
|
|
|
#include <rte_lcore.h>
|
|
|
|
#include <rte_cycles.h>
|
|
|
|
|
|
|
|
#include "test.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* rwlock test
|
|
|
|
* ===========
|
|
|
|
*
|
|
|
|
* - There is a global rwlock and a table of rwlocks (one per lcore).
|
|
|
|
*
|
|
|
|
* - The test function takes all of these locks and launches the
|
|
|
|
* ``test_rwlock_per_core()`` function on each core (except the master).
|
|
|
|
*
|
|
|
|
* - The function takes the global write lock, display something,
|
|
|
|
* then releases the global lock.
|
|
|
|
* - Then, it takes the per-lcore write lock, display something, and
|
|
|
|
* releases the per-core lock.
|
|
|
|
* - Finally, a read lock is taken during 100 ms, then released.
|
|
|
|
*
|
|
|
|
* - The main function unlocks the per-lcore locks sequentially and
|
|
|
|
* waits between each lock. This triggers the display of a message
|
|
|
|
* for each core, in the correct order.
|
|
|
|
*
|
|
|
|
* Then, it tries to take the global write lock and display the last
|
|
|
|
* message. The autotest script checks that the message order is correct.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static rte_rwlock_t sl;
|
|
|
|
static rte_rwlock_t sl_tab[RTE_MAX_LCORE];
|
|
|
|
|
|
|
|
static int
|
|
|
|
test_rwlock_per_core(__attribute__((unused)) void *arg)
|
|
|
|
{
|
|
|
|
rte_rwlock_write_lock(&sl);
|
|
|
|
printf("Global write lock taken on core %u\n", rte_lcore_id());
|
|
|
|
rte_rwlock_write_unlock(&sl);
|
|
|
|
|
|
|
|
rte_rwlock_write_lock(&sl_tab[rte_lcore_id()]);
|
|
|
|
printf("Hello from core %u !\n", rte_lcore_id());
|
|
|
|
rte_rwlock_write_unlock(&sl_tab[rte_lcore_id()]);
|
|
|
|
|
|
|
|
rte_rwlock_read_lock(&sl);
|
|
|
|
printf("Global read lock taken on core %u\n", rte_lcore_id());
|
|
|
|
rte_delay_ms(100);
|
|
|
|
printf("Release global read lock on core %u\n", rte_lcore_id());
|
|
|
|
rte_rwlock_read_unlock(&sl);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-08-18 11:29:23 +00:00
|
|
|
static int
|
2012-09-04 12:54:00 +00:00
|
|
|
test_rwlock(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
rte_rwlock_init(&sl);
|
|
|
|
for (i=0; i<RTE_MAX_LCORE; i++)
|
|
|
|
rte_rwlock_init(&sl_tab[i]);
|
|
|
|
|
|
|
|
rte_rwlock_write_lock(&sl);
|
|
|
|
|
|
|
|
RTE_LCORE_FOREACH_SLAVE(i) {
|
|
|
|
rte_rwlock_write_lock(&sl_tab[i]);
|
|
|
|
rte_eal_remote_launch(test_rwlock_per_core, NULL, i);
|
|
|
|
}
|
|
|
|
|
|
|
|
rte_rwlock_write_unlock(&sl);
|
|
|
|
|
|
|
|
RTE_LCORE_FOREACH_SLAVE(i) {
|
|
|
|
rte_rwlock_write_unlock(&sl_tab[i]);
|
|
|
|
rte_delay_ms(100);
|
|
|
|
}
|
|
|
|
|
|
|
|
rte_rwlock_write_lock(&sl);
|
|
|
|
/* this message should be the last message of test */
|
|
|
|
printf("Global write lock taken on master core %u\n", rte_lcore_id());
|
|
|
|
rte_rwlock_write_unlock(&sl);
|
|
|
|
|
|
|
|
rte_eal_mp_wait_lcore();
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2014-08-18 11:29:23 +00:00
|
|
|
|
|
|
|
static struct test_command rwlock_cmd = {
|
|
|
|
.command = "rwlock_autotest",
|
|
|
|
.callback = test_rwlock,
|
|
|
|
};
|
|
|
|
REGISTER_TEST_COMMAND(rwlock_cmd);
|