blob: 44eddf01a982161bf5384a76f4b90a6cc73c1134 (
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
|
/*
* Copyright 2011 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#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;
}
delete rec;
}
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;
}
|
