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
|
/* Store cloning
Copyright (C) 1996 Free Software Foundation, Inc.
Written by Miles Bader <miles@gnu.ai.mit.edu>
This file is part of the GNU Hurd.
The GNU Hurd 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, or (at
your option) any later version.
The GNU Hurd 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 this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include <string.h>
#include <stdlib.h>
#include "store.h"
/* Return in TO a copy of FROM. */
error_t
store_clone (struct store *from, struct store **to)
{
error_t err = 0;
struct store *c =
_make_store (from->class, from->port, from->flags, from->block_size,
from->runs, from->num_runs, from->end);
if (! c)
return ENOMEM;
if (from->name)
{
c->name = strdup (from->name);
if (! c->name)
err = ENOMEM;
}
if (from->misc_len)
{
c->misc = malloc (from->misc_len);
if (! c->misc)
err = ENOMEM;
}
if (!err && c->port != MACH_PORT_NULL)
{
err = mach_port_mod_refs (mach_task_self (),
c->port, MACH_PORT_RIGHT_SEND, 1);
if (err)
c->port = MACH_PORT_NULL; /* Don't deallocate it. */
}
if (!err && from->source != MACH_PORT_NULL)
{
err = mach_port_mod_refs (mach_task_self (),
from->source, MACH_PORT_RIGHT_SEND, 1);
if (! err)
c->source = from->source;
}
if (!err && from->num_children > 0)
{
int k;
c->children = malloc (from->num_children * sizeof (struct store *));
if (! c->children)
err = ENOMEM;
for (k = 0; !err && k < from->num_children; k++)
{
err = store_clone (from->children[k], &c->children[k]);
if (! err)
c->num_children++;
}
}
if (!err && from->class->clone)
err = (*from->class->clone)(from, c);
if (err)
store_free (c);
else
*to = c;
return err;
}
|
