1

/******************************************************************************

     2

 *

     3

 *  $Id$

     4

 *

     5

 *  Copyright (C) 2006-2008  Florian Pose, Ingenieurgemeinschaft IgH

     6

 *

     7

 *  This file is part of the IgH EtherCAT Master.

     8

 *

     9

 *  The IgH EtherCAT Master is free software; you can redistribute it and/or

    10

 *  modify it under the terms of the GNU General Public License version 2, as

    11

 *  published by the Free Software Foundation.

    12

 *

    13

 *  The IgH EtherCAT Master is distributed in the hope that it will be useful,

    14

 *  but WITHOUT ANY WARRANTY; without even the implied warranty of

    15

 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General

    16

 *  Public License for more details.

    17

 *

    18

 *  You should have received a copy of the GNU General Public License along

    19

 *  with the IgH EtherCAT Master; if not, write to the Free Software

    20

 *  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

    21

 *

    22

 *  Using the EtherCAT technology and brand is permitted in compliance with

    23

 *  the industrial property and similar rights of Beckhoff Automation GmbH.

    24

 *

    25

 *****************************************************************************/

    26

    27

/**

    28

   \file

    29

   EtherCAT process data object methods.

    30

*/

    31

    32

/*****************************************************************************/

    33

    34

#include <linux/slab.h>

    35

#include <linux/err.h>

    36

    37

#include "pdo.h"

    38

    39

/*****************************************************************************/

    40

    42

 */

    43

void ec_pdo_init(

    45

        )

    46

{

    47

    pdo->sync_index = -1; // not assigned 

    48

    pdo->name = NULL;

    49

    INIT_LIST_HEAD(&pdo->entries);

    50

}

    51

    52

/*****************************************************************************/

    53

    55

 *

    56

 * \retval  0 Success.

    57

 * \retval <0 Error code.

    58

 */

    59

int ec_pdo_init_copy(ec_pdo_t *pdo, const ec_pdo_t *other_pdo)

    60

{

    61

    int ret = 0;

    62

    63

    pdo->index = other_pdo->index;

    64

    pdo->sync_index = other_pdo->sync_index;

    65

    pdo->name = NULL;

    66

    INIT_LIST_HEAD(&pdo->entries);

    67

    68

    ret = ec_pdo_set_name(pdo, other_pdo->name);

    69

    if (ret < 0)

    70

        goto out_return;

    71

    72

    ret = ec_pdo_copy_entries(pdo, other_pdo);

    73

    if (ret < 0)

    74

        goto out_clear;

    75

    76

    return 0;

    77

    78

out_clear:

    79

    ec_pdo_clear(pdo);

    80

out_return:

    81

    return ret;

    82

}

    83

    84

/*****************************************************************************/

    85

    89

{

    90

    if (pdo->name)

    91

        kfree(pdo->name);

    92

    93

    ec_pdo_clear_entries(pdo);

    94

}

    95

    96

/*****************************************************************************/

    97

   101

{

   102

    ec_pdo_entry_t *entry, *next;

   103

   105

    list_for_each_entry_safe(entry, next, &pdo->entries, list) {

   106

        list_del(&entry->list);

   107

        ec_pdo_entry_clear(entry);

   108

        kfree(entry);

   109

    }

   110

}

   111

   112

/*****************************************************************************/

   113

   115

 *

   116

 * \retval  0 Success.

   117

 * \retval <0 Error code.

   118

 */

   119

int ec_pdo_set_name(

   121

        const char *name /**< New name. */

   122

        )

   123

{

   124

    unsigned int len;

   125

   126

    if (pdo->name && name && !strcmp(pdo->name, name))

   127

        return 0;

   128

   129

    if (pdo->name)

   130

        kfree(pdo->name);

   131

   132

    if (name && (len = strlen(name))) {

   133

        if (!(pdo->name = (char *) kmalloc(len + 1, GFP_KERNEL))) {

   135

            return -ENOMEM;

   136

        }

   137

        memcpy(pdo->name, name, len + 1);

   138

    } else {

   139

        pdo->name = NULL;

   140

    }

   141

   142

    return 0;

   143

}

   144

   145

/*****************************************************************************/

   146

   148

 *

   149

 * \retval Pointer to the added entry, otherwise a ERR_PTR() code.

   150

 */

   151

ec_pdo_entry_t *ec_pdo_add_entry(

   152

        ec_pdo_t *pdo,

   153

        uint16_t index,

   154

        uint8_t subindex,

   155

        uint8_t bit_length

   156

        )

   157

{

   158

    ec_pdo_entry_t *entry;

   159

   160

    if (!(entry = kmalloc(sizeof(ec_pdo_entry_t), GFP_KERNEL))) {

   162

        return ERR_PTR(-ENOMEM);

   163

    }

   164

   165

    ec_pdo_entry_init(entry);

   166

    entry->index = index;

   167

    entry->subindex = subindex;

   168

    entry->bit_length = bit_length;

   169

    list_add_tail(&entry->list, &pdo->entries);

   170

    return entry;

   171

}

   172

   173

/*****************************************************************************/

   174

   176

 *

   177

 * \retval  0 Success.

   178

 * \retval <0 Error code.

   179

 */

   180

int ec_pdo_copy_entries(ec_pdo_t *pdo, const ec_pdo_t *other)

   181

{

   182

    ec_pdo_entry_t *entry, *other_entry;

   183

    int ret;

   184

   185

    ec_pdo_clear_entries(pdo);

   186

   187

    list_for_each_entry(other_entry, &other->entries, list) {

   188

        if (!(entry = (ec_pdo_entry_t *)

   189

                    kmalloc(sizeof(ec_pdo_entry_t), GFP_KERNEL))) {

   191

            return -ENOMEM;

   192

        }

   193

   194

        ret = ec_pdo_entry_init_copy(entry, other_entry);

   195

        if (ret < 0) {

   196

            kfree(entry);

   197

            return ret;

   198

        }

   199

   200

        list_add_tail(&entry->list, &pdo->entries);

   201

    }

   202

   203

    return 0;

   204

}

   205

   206

/*****************************************************************************/

   207

   212

 */

   213

int ec_pdo_equal_entries(

   216

        )

   217

{

   218

    const struct list_head *head1, *head2, *item1, *item2;

   219

    const ec_pdo_entry_t *entry1, *entry2;

   220

   221

    head1 = item1 = &pdo1->entries;

   222

    head2 = item2 = &pdo2->entries;

   223

   224

    while (1) {

   225

        item1 = item1->next;

   226

        item2 = item2->next;

   227

   228

        if ((item1 == head1) ^ (item2 == head2)) // unequal lengths

   229

            return 0;

   230

        if (item1 == head1) // both finished

   231

            break;

   232

   233

        entry1 = list_entry(item1, ec_pdo_entry_t, list);

   234

        entry2 = list_entry(item2, ec_pdo_entry_t, list);

   235

        if (!ec_pdo_entry_equal(entry1, entry2))

   236

            return 0;

   237

    }

   238

   239

    return 1;

   240

}

   241

   242

/*****************************************************************************/

   243

   247

 */

   248

unsigned int ec_pdo_entry_count(

   250

        )

   251

{

   252

    const ec_pdo_entry_t *entry;

   253

    unsigned int num = 0;

   254

   255

    list_for_each_entry(entry, &pdo->entries, list) {

   256

        num++;

   257

    }

   258

   259

    return num;

   260

}

   261

   262

/*****************************************************************************/

   263

   265

 *

   266

 * Const version.

   267

 */

   268

const ec_pdo_entry_t *ec_pdo_find_entry_by_pos_const(

   270

        unsigned int pos /**< Position in the list. */

   271

        )

   272

{

   273

    const ec_pdo_entry_t *entry;

   274

   275

    list_for_each_entry(entry, &pdo->entries, list) {

   276

        if (pos--)

   277

            continue;

   278

        return entry;

   279

    }

   280

   281

    return NULL;

   282

}

   283

   284

/*****************************************************************************/