|
| 1 | +/* |
| 2 | + * Copyright (c) 2018, Intel Corporation |
| 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 are met: |
| 7 | + * * Redistributions of source code must retain the above copyright |
| 8 | + * notice, this list of conditions and the following disclaimer. |
| 9 | + * * Redistributions in binary form must reproduce the above copyright |
| 10 | + * notice, this list of conditions and the following disclaimer in the |
| 11 | + * documentation and/or other materials provided with the distribution. |
| 12 | + * * Neither the name of the Intel Corporation nor the |
| 13 | + * names of its contributors may be used to endorse or promote products |
| 14 | + * derived from this software without specific prior written permission. |
| 15 | + * |
| 16 | + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 17 | + * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 18 | + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 19 | + * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 20 | + * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 21 | + * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 22 | + * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 23 | + * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 24 | + * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 25 | + * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 26 | + * POSSIBILITY OF SUCH DAMAGE. |
| 27 | + * |
| 28 | + * Author: Marcin Maka <marcin.maka@linux.intel.com> |
| 29 | + */ |
| 30 | + |
| 31 | +#include <sof/dai.h> |
| 32 | + |
| 33 | +struct dai_info { |
| 34 | + struct dai_type_info *dai_type_array; |
| 35 | + size_t num_dai_types; |
| 36 | +}; |
| 37 | + |
| 38 | +static struct dai_info lib_dai = { |
| 39 | + .dai_type_array = NULL, |
| 40 | + .num_dai_types = 0 |
| 41 | +}; |
| 42 | + |
| 43 | +void dai_install(struct dai_type_info *dai_type_array, size_t num_dai_types) |
| 44 | +{ |
| 45 | + lib_dai.dai_type_array = dai_type_array; |
| 46 | + lib_dai.num_dai_types = num_dai_types; |
| 47 | +} |
| 48 | + |
| 49 | +struct dai *dai_get(uint32_t type, uint32_t index) |
| 50 | +{ |
| 51 | + int i; |
| 52 | + struct dai_type_info *dti; |
| 53 | + |
| 54 | + for (dti = lib_dai.dai_type_array; |
| 55 | + dti < lib_dai.dai_type_array + lib_dai.num_dai_types; dti++) { |
| 56 | + if (dti->type == type) { |
| 57 | + for (i = 0; i < dti->num_dais; i++) { |
| 58 | + if (dti->dai_array[i].index == index) |
| 59 | + return dti->dai_array + i; |
| 60 | + } |
| 61 | + } |
| 62 | + } |
| 63 | + return NULL; |
| 64 | +} |
0 commit comments