| /external/llvm/lib/CodeGen/ |
| ShadowStackGC.cpp | 13 // to identify roots.
22 // In order to support this particular transformation, all stack roots are
43 /// roots.
51 /// Roots - GC roots in the current function. Each is a pair of the
53 std::vector<std::pair<CallInst*,AllocaInst*> > Roots;
209 for (unsigned I = 0; I != Roots.size(); ++I) {
210 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
220 ConstantInt::get(Int32Ty, Roots.size(), false),
262 for (size_t I = 0; I != Roots.size(); I++
[all...] |
| GCStrategy.cpp | 14 // Roots are identified in SelectionDAGISel.
50 AllocaInst **Roots, unsigned Count);
181 bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **Roots,
198 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I)
212 // action. The default for roots is no action.
286 SmallVector<AllocaInst*, 32> Roots;
316 Roots.push_back(cast<AllocaInst>(
329 if (Roots.size())
330 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size())
[all...] |
| /external/skia/tests/ |
| PathOpsCubicQuadIntersectionTest.cpp | 51 int roots = i.intersect(cubic, quad); local
52 SkASSERT(roots == quadCubicTests[index].answerCount);
53 for (int pt = 0; pt < roots; ++pt) {
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkDQuadLineIntersection.cpp | 108 int intersectRay(double roots[2]) {
110 solve by rotating line+quad so line is horizontal, then finding the roots
135 return SkDQuad::RootsValidT(A, 2 * B, C, roots);
141 int roots = intersectRay(rootVals); local
142 for (int index = 0; index < roots; ++index) {
156 int horizontalIntersect(double axisIntercept, double roots[2]) {
163 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
169 int roots = horizontalIntersect(axisIntercept, rootVals); local
170 for (int index = 0; index < roots; ++index) {
187 int verticalIntersect(double axisIntercept, double roots[2])
200 int roots = verticalIntersect(axisIntercept, rootVals); local
342 int roots = q.horizontalIntersect(pt.fY, rootVals); local
357 int roots = q.verticalIntersect(pt.fX, rootVals); local
[all...] |
| SkDCubicLineIntersection.cpp | 96 int intersectRay(double roots[3]) {
105 return SkDCubic::RootsValidT(A, B, C, D, roots);
111 int roots = intersectRay(rootVals); local
112 for (int index = 0; index < roots; ++index) {
131 int horizontalIntersect(double axisIntercept, double roots[3]) {
135 return SkDCubic::RootsValidT(A, B, C, D, roots);
141 int roots = horizontalIntersect(axisIntercept, rootVals); local
142 for (int index = 0; index < roots; ++index) {
159 int verticalIntersect(double axisIntercept, double roots[3]) {
163 return SkDCubic::RootsValidT(A, B, C, D, roots);
169 int roots = verticalIntersect(axisIntercept, rootVals); local
[all...] |
| /external/skia/src/pathops/ |
| SkDQuadLineIntersection.cpp | 108 int intersectRay(double roots[2]) {
110 solve by rotating line+quad so line is horizontal, then finding the roots
135 return SkDQuad::RootsValidT(A, 2 * B, C, roots);
141 int roots = intersectRay(rootVals); local
142 for (int index = 0; index < roots; ++index) {
156 int horizontalIntersect(double axisIntercept, double roots[2]) {
163 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
169 int roots = horizontalIntersect(axisIntercept, rootVals); local
170 for (int index = 0; index < roots; ++index) {
187 int verticalIntersect(double axisIntercept, double roots[2])
200 int roots = verticalIntersect(axisIntercept, rootVals); local
342 int roots = q.horizontalIntersect(pt.fY, rootVals); local
357 int roots = q.verticalIntersect(pt.fX, rootVals); local
[all...] |
| SkDCubicLineIntersection.cpp | 96 int intersectRay(double roots[3]) {
105 return SkDCubic::RootsValidT(A, B, C, D, roots);
111 int roots = intersectRay(rootVals); local
112 for (int index = 0; index < roots; ++index) {
131 int horizontalIntersect(double axisIntercept, double roots[3]) {
135 return SkDCubic::RootsValidT(A, B, C, D, roots);
141 int roots = horizontalIntersect(axisIntercept, rootVals); local
142 for (int index = 0; index < roots; ++index) {
159 int verticalIntersect(double axisIntercept, double roots[3]) {
163 return SkDCubic::RootsValidT(A, B, C, D, roots);
169 int roots = verticalIntersect(axisIntercept, rootVals); local
[all...] |
| /dalvik/vm/alloc/ |
| Verify.h | 32 * Verifies the contents of various global roots.
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| GlyphPageTreeNode.cpp | 46 HashMap<int, GlyphPageTreeNode*>* GlyphPageTreeNode::roots = 0;
54 roots = new HashMap<int, GlyphPageTreeNode*>;
61 if (GlyphPageTreeNode* foundNode = roots->get(pageNumber))
68 roots->set(pageNumber, node);
75 if (roots) {
76 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end();
77 for (HashMap<int, GlyphPageTreeNode*>::iterator it = roots->begin(); it != end; ++it)
99 // Enumerate all the roots and prune any tree that contains our custom font data.
100 if (roots) {
101 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end()
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| functools.py | 69 roots = set(dir(cls)) & set(convert)
70 if not roots:
72 root = max(roots) # prefer __lt__ to __le__ to __gt__ to __ge__
74 if opname not in roots:
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| functools.py | 69 roots = set(dir(cls)) & set(convert)
70 if not roots:
72 root = max(roots) # prefer __lt__ to __le__ to __gt__ to __ge__
74 if opname not in roots:
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/ |
| UiModelTreeContentProvider.java | 92 ArrayList<UiElementNode> roots = new ArrayList<UiElementNode>(); local
96 roots.add(ui_node);
100 roots.add(ui_node);
107 return roots.toArray();
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_codec.cc | 19 const char* BookmarkCodec::kRootsKey = "roots";
53 DictionaryValue* roots = new DictionaryValue(); local
54 roots->Set(kRootFolderNameKey, EncodeNode(bookmark_bar_node));
55 roots->Set(kOtherBookmarkFolderNameKey, EncodeNode(other_folder_node));
64 main->Set(kRootsKey, roots);
137 Value* roots; local
138 if (!d_value.Get(kRootsKey, &roots))
139 return false; // No roots.
141 if (roots->GetType() != Value::TYPE_DICTIONARY)
142 return false; // Invalid type for roots
[all...] |
| /frameworks/base/test-runner/src/junit/runner/ |
| ClassPathTestCollector.java | 33 Hashtable collectFilesInRoots(Vector roots) {
35 Enumeration e= roots.elements();
|
| /development/tools/idegen/src/ |
| Eclipse.java | 43 * root directory, we'll order source roots based on how they match
44 * regular expressions in that file. Source roots that match earlier
66 // Put source roots in respective buckets.
79 // Output source roots to configuration file.
121 // Exclude nested source roots.
173 * A precedence bucket for source roots.
|
| Configuration.java | 36 /** Java source tree roots. */
53 * for .java and .jar files and identifying source roots.
76 Log.debug(sourceRoots.size() + " source roots");
111 * Recursively finds .java source roots, .jar files, and excluded
120 * source roots in our generated source directory (specifically,
134 // Keep track of source roots for .java files.
224 * Picks out excluded directories that are under source roots.
|
| /external/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 37 std::vector<BasicBlock*> Roots;
48 inline const std::vector<BasicBlock*> &getRoots() const { return Roots; }
166 assert(Roots.size() == 1 && "Should always have entry node!");
167 return Roots[0];
173 Roots = DT.getRoots();
174 assert(Roots.size() == 1 && "Only one entry block for forward domfronts!");
175 calculate(DT, DT[Roots[0]]);
|
| /frameworks/base/packages/DocumentsUI/res/values/ |
| strings.xml | 58 <!-- Accessibility title to open the drawer showing all roots where documents can be stored [CHAR LIMIT=32] -->
59 <string name="drawer_open">Show roots</string>
60 <!-- Accessibility title to close the drawer showing all roots where documents can be stored [CHAR LIMIT=32] -->
61 <string name="drawer_close">Hide roots</string>
75 <!-- Header title for list of storage roots that contains cloud services [CHAR LIMIT=24] -->
77 <!-- Header title for list of storage roots that contains shortcuts to documents that may be available elsewhere [CHAR LIMIT=24] -->
79 <!-- Header title for list of storage roots that contains physical devices [CHAR LIMIT=24] -->
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkGeometry.cpp | 135 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2])
137 SkASSERT(roots);
140 return valid_unit_divide(-C, B, roots);
142 SkScalar* r = roots;
146 if (R < 0 || SkScalarIsNaN(R)) { // complex roots
165 if (r - roots == 2)
167 if (roots[0] > roots[1])
168 SkTSwap<SkScalar>(roots[0], roots[1])
[all...] |
| SkQuadClipper.cpp | 46 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
47 int count = SkFindUnitQuadRoots(A, B, C, roots);
49 *t = roots[0];
|
| /external/skia/src/core/ |
| SkGeometry.cpp | 135 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2])
137 SkASSERT(roots);
140 return valid_unit_divide(-C, B, roots);
142 SkScalar* r = roots;
146 if (R < 0 || SkScalarIsNaN(R)) { // complex roots
165 if (r - roots == 2)
167 if (roots[0] > roots[1])
168 SkTSwap<SkScalar>(roots[0], roots[1])
[all...] |
| SkQuadClipper.cpp | 46 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
47 int count = SkFindUnitQuadRoots(A, B, C, roots);
49 *t = roots[0];
|
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 67 std::vector<change_ty> Roots;
201 // Compute the roots.
205 Roots.push_back(*it);
208 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
253 llvm::errs() << "Roots: [";
254 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
255 ie = Roots.end(); it != ie; ++it) {
256 if (it != Roots.begin()) llvm::errs() << ", ";
309 // The current set of changes we are minimizing, starting at the roots
[all...] |
| /external/chromium_org/chrome_frame/ready_mode/internal/ |
| registry_ready_mode_state.cc | 34 HKEY roots[] = {HKEY_CURRENT_USER, HKEY_LOCAL_MACHINE}; local
36 for (int i = 0; i < arraysize(roots); i++) {
38 if (version_key.Open(roots[i], version_key_name.c_str(),
200 HKEY roots[] = { HKEY_CURRENT_USER, HKEY_LOCAL_MACHINE }; local
202 for (int i = 0; i < arraysize(roots); i++) {
204 result = config_key.Open(roots[i], key_name_.c_str(), KEY_QUERY_VALUE);
|
| /external/chromium_org/net/cert/ |
| test_root_certs_mac.cc | 84 // Avoid any copying if system roots are not to be trusted. This acts as
91 // creating a copy of the system roots and merging with temporary_roots_.
|
