| 1 | /*
|
|---|
| 2 | * Copyright (c) 2010 Lenka Trochtova
|
|---|
| 3 | * All rights reserved.
|
|---|
| 4 | *
|
|---|
| 5 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 6 | * modification, are permitted provided that the following conditions
|
|---|
| 7 | * are met:
|
|---|
| 8 | *
|
|---|
| 9 | * - Redistributions of source code must retain the above copyright
|
|---|
| 10 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 11 | * - Redistributions in binary form must reproduce the above copyright
|
|---|
| 12 | * notice, this list of conditions and the following disclaimer in the
|
|---|
| 13 | * documentation and/or other materials provided with the distribution.
|
|---|
| 14 | * - The name of the author may not be used to endorse or promote products
|
|---|
| 15 | * derived from this software without specific prior written permission.
|
|---|
| 16 | *
|
|---|
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|---|
| 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|---|
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|---|
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|---|
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|---|
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|---|
| 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|---|
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|---|
| 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|---|
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|---|
| 27 | */
|
|---|
| 28 |
|
|---|
| 29 | /** @addtogroup devman
|
|---|
| 30 | * @{
|
|---|
| 31 | */
|
|---|
| 32 |
|
|---|
| 33 | #include <str.h>
|
|---|
| 34 |
|
|---|
| 35 | #include "devman.h"
|
|---|
| 36 |
|
|---|
| 37 | int get_match_score(driver_t *drv, node_t *dev)
|
|---|
| 38 | {
|
|---|
| 39 | link_t *drv_head = &drv->match_ids.ids;
|
|---|
| 40 | link_t *dev_head = &dev->match_ids.ids;
|
|---|
| 41 |
|
|---|
| 42 | if (list_empty(drv_head) || list_empty(dev_head))
|
|---|
| 43 | return 0;
|
|---|
| 44 |
|
|---|
| 45 | link_t *drv_link = drv->match_ids.ids.next;
|
|---|
| 46 | link_t *dev_link = dev->match_ids.ids.next;
|
|---|
| 47 |
|
|---|
| 48 | match_id_t *drv_id = list_get_instance(drv_link, match_id_t, link);
|
|---|
| 49 | match_id_t *dev_id = list_get_instance(dev_link, match_id_t, link);
|
|---|
| 50 |
|
|---|
| 51 | int score_next_drv = 0;
|
|---|
| 52 | int score_next_dev = 0;
|
|---|
| 53 |
|
|---|
| 54 | do {
|
|---|
| 55 | match_id_t *tmp_ma_id;
|
|---|
| 56 |
|
|---|
| 57 | if (0 == str_cmp(drv_id->id, dev_id->id)) {
|
|---|
| 58 | /*
|
|---|
| 59 | * We found a match.
|
|---|
| 60 | * Return the score of the match.
|
|---|
| 61 | */
|
|---|
| 62 | return drv_id->score * dev_id->score;
|
|---|
| 63 | }
|
|---|
| 64 |
|
|---|
| 65 | /*
|
|---|
| 66 | * Compute the next score we get, if we advance in the driver's
|
|---|
| 67 | * list of match ids.
|
|---|
| 68 | */
|
|---|
| 69 | if (drv_head != drv_link->next) {
|
|---|
| 70 | tmp_ma_id = list_get_instance(drv_link->next,
|
|---|
| 71 | match_id_t, link);
|
|---|
| 72 | score_next_drv = dev_id->score * tmp_ma_id->score;
|
|---|
| 73 | } else {
|
|---|
| 74 | score_next_drv = 0;
|
|---|
| 75 | }
|
|---|
| 76 |
|
|---|
| 77 | /*
|
|---|
| 78 | * Compute the next score we get, if we advance in the device's
|
|---|
| 79 | * list of match ids.
|
|---|
| 80 | */
|
|---|
| 81 | if (dev_head != dev_link->next) {
|
|---|
| 82 | tmp_ma_id = list_get_instance(dev_link->next,
|
|---|
| 83 | match_id_t, link);
|
|---|
| 84 | score_next_dev = drv_id->score * tmp_ma_id->score;
|
|---|
| 85 | } else {
|
|---|
| 86 | score_next_dev = 0;
|
|---|
| 87 | }
|
|---|
| 88 |
|
|---|
| 89 | /*
|
|---|
| 90 | * Advance in one of the two lists, so we get the next highest
|
|---|
| 91 | * score.
|
|---|
| 92 | */
|
|---|
| 93 | if (score_next_drv > score_next_dev) {
|
|---|
| 94 | drv_link = drv_link->next;
|
|---|
| 95 | drv_id = list_get_instance(drv_link, match_id_t, link);
|
|---|
| 96 | } else {
|
|---|
| 97 | dev_link = dev_link->next;
|
|---|
| 98 | dev_id = list_get_instance(dev_link, match_id_t, link);
|
|---|
| 99 | }
|
|---|
| 100 |
|
|---|
| 101 | } while (drv_head != drv_link->next && dev_head != dev_link->next);
|
|---|
| 102 |
|
|---|
| 103 | return 0;
|
|---|
| 104 | }
|
|---|
| 105 |
|
|---|
| 106 | /** @}
|
|---|
| 107 | */
|
|---|
