blob: 6f1e7ca378b9abf6a0366b19592fdfebe4b4cbeb (
plain)
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
|
/*
Copyright 2011 Google Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#include "SkRefDict.h"
#include "SkString.h"
struct SkRefDict::Impl {
Impl* fNext;
SkString fName;
SkRefCnt* fData;
};
SkRefDict::SkRefDict() : fImpl(NULL) {}
SkRefDict::~SkRefDict() {
this->removeAll();
}
SkRefCnt* SkRefDict::find(const char name[]) const {
if (NULL == name) {
return NULL;
}
Impl* rec = fImpl;
while (rec) {
if (rec->fName.equals(name)) {
return rec->fData;
}
rec = rec->fNext;
}
return NULL;
}
void SkRefDict::set(const char name[], SkRefCnt* data) {
if (NULL == name) {
return;
}
Impl* rec = fImpl;
Impl* prev = NULL;
while (rec) {
if (rec->fName.equals(name)) {
if (data) {
// replace
data->ref();
rec->fData->unref();
rec->fData = data;
} else {
// remove
rec->fData->unref();
if (prev) {
prev->fNext = rec->fNext;
} else {
fImpl = rec->fNext;
}
}
return;
}
prev = rec;
rec = rec->fNext;
}
// if get here, name was not found, so add it
data->ref();
rec = new Impl;
rec->fName.set(name);
rec->fData = data;
// prepend to the head of our list
rec->fNext = fImpl;
fImpl = rec;
}
void SkRefDict::removeAll() {
Impl* rec = fImpl;
while (rec) {
Impl* next = rec->fNext;
rec->fData->unref();
delete rec;
rec = next;
}
fImpl = NULL;
}
|
