| /external/chromium_org/third_party/skia/experimental/iOSSampleApp/iPad/ |
| SkUISplitViewController.h | 14 SkUIRootViewController* fRoot;
17 @property (nonatomic, retain) IBOutlet SkUIRootViewController* fRoot;
|
| /external/chromium_org/third_party/skia/experimental/iOSSampleApp/iPhone/ |
| AppDelegate_iPhone.h | 14 SkUINavigationController* fRoot;
17 @property (nonatomic, retain) IBOutlet SkUINavigationController* fRoot;
|
| SkUINavigationController.h | 14 SkUIRootViewController* fRoot;
17 @property (nonatomic, retain) IBOutlet SkUIRootViewController* fRoot;
|
| /external/skia/experimental/iOSSampleApp/iPad/ |
| SkUISplitViewController.h | 14 SkUIRootViewController* fRoot;
17 @property (nonatomic, retain) IBOutlet SkUIRootViewController* fRoot;
|
| /external/skia/experimental/iOSSampleApp/iPhone/ |
| AppDelegate_iPhone.h | 14 SkUINavigationController* fRoot;
17 @property (nonatomic, retain) IBOutlet SkUINavigationController* fRoot;
|
| SkUINavigationController.h | 14 SkUIRootViewController* fRoot;
17 @property (nonatomic, retain) IBOutlet SkUIRootViewController* fRoot;
|
| /external/chromium_org/third_party/skia/dm/ |
| DMWriteTask.h | 32 explicit Expectations(const char* root) : fRoot(root) {}
36 const char* fRoot;
|
| /external/skia/dm/ |
| DMWriteTask.h | 32 explicit Expectations(const char* root) : fRoot(root) {}
36 const char* fRoot;
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkQuadTree.cpp | 49 SkQuadTree::SkQuadTree(const SkIRect& bounds) : fRoot(NULL) {
164 if (NULL == fRoot) {
167 this->insert(fRoot, entry);
172 SkASSERT(NULL != fRoot);
175 this->search(fRoot, query, results);
181 if (NULL != fRoot) {
182 this->clear(fRoot);
183 fNodePool.release(fRoot);
184 fRoot = NULL;
191 return this->getDepth(fRoot);
[all...] |
| SkRTree.cpp | 63 fRoot.fChild.subtree = allocateNode(0);
64 fRoot.fChild.subtree->fNumChildren = 0;
68 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
69 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
72 Node* oldRoot = fRoot.fChild.subtree;
75 *newRoot->child(0) = fRoot;
77 fRoot.fChild.subtree = newRoot;
78 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree)
[all...] |
| SkPictureStateTree.cpp | 17 fRoot.fParent = NULL;
18 fRoot.fMatrix = &fRootMatrix;
19 fRoot.fFlags = Node::kSave_Flag;
20 fRoot.fOffset = 0;
21 fRoot.fLevel = 0;
22 fCurrentState.fNode = &fRoot;
78 return Iterator(draws, canvas, &fRoot);
|
| SkRTree.h | 89 return this->isEmpty() ? 0 : fRoot.fChild.subtree->fLevel + 1;
190 Branch fRoot;
|
| SkPictureStateTree.h | 154 Node fRoot;
|
| SkQuadTree.h | 100 Node* fRoot;
|
| /external/skia/src/core/ |
| SkQuadTree.cpp | 49 SkQuadTree::SkQuadTree(const SkIRect& bounds) : fRoot(NULL) {
164 if (NULL == fRoot) {
167 this->insert(fRoot, entry);
172 SkASSERT(NULL != fRoot);
175 this->search(fRoot, query, results);
181 if (NULL != fRoot) {
182 this->clear(fRoot);
183 fNodePool.release(fRoot);
184 fRoot = NULL;
191 return this->getDepth(fRoot);
[all...] |
| SkRTree.cpp | 63 fRoot.fChild.subtree = allocateNode(0);
64 fRoot.fChild.subtree->fNumChildren = 0;
68 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
69 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
72 Node* oldRoot = fRoot.fChild.subtree;
75 *newRoot->child(0) = fRoot;
77 fRoot.fChild.subtree = newRoot;
78 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree)
[all...] |
| SkPictureStateTree.cpp | 17 fRoot.fParent = NULL;
18 fRoot.fMatrix = &fRootMatrix;
19 fRoot.fFlags = Node::kSave_Flag;
20 fRoot.fOffset = 0;
21 fRoot.fLevel = 0;
22 fCurrentState.fNode = &fRoot;
78 return Iterator(draws, canvas, &fRoot);
|
| SkRTree.h | 89 return this->isEmpty() ? 0 : fRoot.fChild.subtree->fLevel + 1;
190 Branch fRoot;
|
| /external/chromium-trace/trace-viewer/third_party/gl-matrix/src/gl-matrix/ |
| quat.js | 413 var fRoot;
417 fRoot = Math.sqrt(fTrace + 1.0); // 2w
418 out[3] = 0.5 * fRoot;
419 fRoot = 0.5/fRoot; // 1/(4w)
420 out[0] = (m[7]-m[5])*fRoot;
421 out[1] = (m[2]-m[6])*fRoot;
422 out[2] = (m[3]-m[1])*fRoot;
433 fRoot = Math.sqrt(m[i*3+i]-m[j*3+j]-m[k*3+k] + 1.0);
434 out[i] = 0.5 * fRoot;
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrRedBlackTree.h | 176 Node* fRoot;
227 fRoot = NULL;
236 RecursiveDelete(fRoot);
256 Node* n = fRoot;
272 Node* n = fRoot;
292 Node* n = fRoot;
310 return onCountOf(fRoot, t);
335 RecursiveDelete(fRoot);
336 fRoot = NULL;
357 Node* n = fRoot;
[all...] |
| /external/skia/src/gpu/ |
| GrRedBlackTree.h | 176 Node* fRoot;
227 fRoot = NULL;
236 RecursiveDelete(fRoot);
256 Node* n = fRoot;
272 Node* n = fRoot;
292 Node* n = fRoot;
310 return onCountOf(fRoot, t);
335 RecursiveDelete(fRoot);
336 fRoot = NULL;
357 Node* n = fRoot;
[all...] |
| /external/chromium_org/third_party/skia/bench/ |
| ResultsWriter.h | 109 , fRoot()
110 , fResults(fRoot["results"])
115 fRoot["options"][name] = value;
136 stream.writeText(Json::FastWriter().write(fRoot).c_str());
142 Json::Value fRoot;
|
| /external/skia/bench/ |
| ResultsWriter.h | 109 , fRoot()
110 , fResults(fRoot["results"])
115 fRoot["options"][name] = value;
136 stream.writeText(Json::FastWriter().write(fRoot).c_str());
142 Json::Value fRoot;
|
| /external/chromium_org/third_party/skia/src/xml/ |
| SkDOM.cpp | 68 SkDOM::SkDOM() : fAlloc(kMinChunkSize), fRoot(NULL)
78 return fRoot;
206 fRoot = NULL;
210 SkDOM::Node* getRoot() const { return fRoot; }
225 if (fRoot == NULL)
228 fRoot = node;
233 SkASSERT(fRoot && parent);
285 SkDOM::Node* fRoot;
300 fRoot = NULL;
304 fRoot = parser.getRoot()
[all...] |
| /external/skia/src/xml/ |
| SkDOM.cpp | 68 SkDOM::SkDOM() : fAlloc(kMinChunkSize), fRoot(NULL)
78 return fRoot;
206 fRoot = NULL;
210 SkDOM::Node* getRoot() const { return fRoot; }
225 if (fRoot == NULL)
228 fRoot = node;
233 SkASSERT(fRoot && parent);
285 SkDOM::Node* fRoot;
300 fRoot = NULL;
304 fRoot = parser.getRoot()
[all...] |
