File: GradientMachine.cc

package info (click to toggle)
torch 2-1
  • links: PTS
  • area: main
  • in suites: woody
  • size: 5,488 kB
  • ctags: 3,217
  • sloc: cpp: 14,272; makefile: 201
file content (107 lines) | stat: -rw-r--r-- 2,204 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
// Copyright (C) 2002 Ronan Collobert (collober@iro.umontreal.ca)
//                
//
// This file is part of Torch. Release II.
// [The Ultimate Machine Learning Library]
//
// Torch is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// Torch is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Torch; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

#include "GradientMachine.h"

namespace Torch {

GradientMachine::GradientMachine()
{
  is_free = false;
  n_params = 0;
  params = NULL;
  der_params = NULL;

  beta = NULL;
}

void GradientMachine::allocateMemory()
{
  n_params = numberOfParams();

  if(n_params > 0)
  {
    addToList(&params, n_params, (real *)xalloc(sizeof(real)*n_params));
    addToList(&der_params, n_params, (real *)xalloc(sizeof(real)*n_params));
  }

  beta = (real *)xalloc(sizeof(real)*n_inputs);
  addToList(&outputs, n_outputs, (real *)xalloc(sizeof(real)*n_outputs));
}

void GradientMachine::freeMemory()
{
  if(is_free)
    return;

  if(n_params > 0)
  {
    freeList(&params, true);
    freeList(&der_params, true);
  }

  free(beta);
  freeList(&outputs, true);
  is_free = true;
}

void GradientMachine::init()
{
  Machine::init();
  allocateMemory();
}

void GradientMachine::iterInitialize()
{
}

void GradientMachine::reset()
{
}

void GradientMachine::loadFILE(FILE *file)
{
  List *liste = params;

  while(liste)
  {
    xfread(liste->ptr, sizeof(real), liste->n, file);
    liste = liste->next;
  }
}

void GradientMachine::saveFILE(FILE *file)
{
  List *liste = params;

  while(liste)
  {
    xfwrite(liste->ptr, sizeof(real), liste->n, file);
    liste = liste->next;
  }
}

GradientMachine::~GradientMachine()
{
  freeMemory();
}

}