| /external/llvm/include/llvm/Analysis/ |
| DominatorInternals.h | 40 InfoRec &VInfo = DT.Info[DT.Roots[i]];
156 bool MultipleRoots = (DT.Roots.size() > 1);
168 for (unsigned i = 0, e = static_cast<unsigned>(DT.Roots.size());
170 N = DFSPass<GraphT>(DT, DT.Roots[i], N);
246 if (DT.Roots.empty()) return;
252 typename GraphT::NodeType* Root = !MultipleRoots ? DT.Roots[0] : 0;
|
| Dominators.h | 39 std::vector<NodeT*> Roots;
42 Roots(), IsPostDominators(isPostDom) {}
49 inline const std::vector<NodeT*> &getRoots() const { return Roots; }
231 this->Roots.clear();
417 assert(this->Roots.size() == 1 && "Should always have entry node!");
418 return this->Roots[0];
643 this->Roots.push_back(BB);
657 this->Roots.push_back(entry);
663 // Initialize the roots list
|
| /external/blktrace/btt/ |
| devs.c | 45 static void __destroy_heads(struct rb_root *roots)
50 __destroy(roots[i].rb_node);
52 free(roots);
|
| /external/clang/lib/ARCMigrate/ |
| Transforms.h | 186 bool TraverseStmt(Stmt *rootS) {
187 if (rootS)
188 BODY_TRANS(Pass).transformBody(rootS, ParentD);
|
| /bootable/recovery/ |
| Android.mk | 24 roots.cpp \
|
| /dalvik/hit/src/com/android/hit/ |
| RootObj.java | 27 * These two fields are only used by roots that are static
|
| /external/chromium/build/ |
| common.croc | 9 'roots' : [
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/scripts_cvs/searchcvs/ |
| setup.sh | 21 # list projects to extract; add other cvs roots (eg. /cvsroot/modeling) as necessary below
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/descriptors/ |
| DocumentDescriptor.java | 28 * It has a children list which represent all the possible roots of the document.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/model/ |
| UiClassAttributeNode.java | 478 IPackageFragmentRoot[] roots = javaProject.getPackageFragmentRoots();
479 for (int i = 0; i < roots.length; i++) {
480 IClasspathEntry entry = roots[i].getRawClasspathEntry();
484 result.add(roots[i]);
528 IPackageFragmentRoot[] roots = getPackageFragmentRoots(getProject(),
535 for (IPackageFragmentRoot root : roots) {
616 for (IPackageFragmentRoot root : roots) {
629 } else if (roots.length > 0) {
631 page.setPackageFragmentRoot(roots[0], true /* canBeModified*/);
|
| UiPackageAttributeNode.java | 269 IPackageFragmentRoot[] roots = javaProject.getPackageFragmentRoots(); local
270 for (int i = 0; i < roots.length; i++) {
271 IClasspathEntry entry = roots[i].getRawClasspathEntry();
273 result.add(roots[i]);
|
| /tools/motodev/src/plugins/android.codeutils/src/com/motorola/studio/android/model/ |
| BuildingBlockModel.java | 343 IPackageFragmentRoot[] roots = project.getPackageFragmentRoots(); local
345 if ((roots != null) && (roots.length > 0))
349 for (IPackageFragmentRoot root : roots)
|
| /external/speex/libspeex/ |
| lsp.c | 68 The zeros (roots) of P(z) also happen to alternate, which is why we
69 swap coefficients as we find roots. So the process of finding the
70 LSP frequencies is basically finding the roots of 5th order
241 int roots=0; /* DR 8/2/94: number of roots found */ local
355 roots++;
387 return(roots);
|
| /external/webkit/Source/JavaScriptCore/heap/ |
| Heap.cpp | 213 // We gather conservative roots before clearing mark bits because
255 // opaque roots to determine reachability.
261 // If the set of opaque roots has grown, more weak handles may have become reachable.
|
| /development/tools/idegen/src/ |
| IntelliJ.java | 49 * under source roots but leave the rest in so you can still pull
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_html_writer.cc | 104 Value* roots; local
108 BookmarkCodec::kRootsKey, &roots) ||
109 roots->GetType() != Value::TYPE_DICTIONARY) {
114 DictionaryValue* roots_d_value = static_cast<DictionaryValue*>(roots);
|
| /external/clang/test/Analysis/ |
| array-struct.c | 117 // building: a->e, e->d. Only then 'a' could be added to live region roots.
|
| /external/clang/test/Unit/ |
| lit.cfg | 58 # Get the source and object roots.
|
| /external/dropbear/libtommath/ |
| bn_mp_n_root.c | 26 * find huge roots [square and cube, etc].
|
| /external/libvorbis/lib/ |
| lsp.c | 25 /* Note that the lpc-lsp conversion finds the roots of polynomial with
28 happen with absurdly closely spaced roots (very sharp peaks in the
421 /* Remove the roots at +1 and -1. */
439 /* Find the roots of the 2 even polynomials.*/
|
| /external/llvm/test/Unit/ |
| lit.cfg | 58 # Get the source and object roots.
|
| /external/smali/util/src/main/java/org/jf/util/ |
| PathUtil.java | 61 //if the roots aren't the same (i.e. different drives on a windows machine), we can't construct a relative
|
| /external/webkit/Tools/Scripts/ |
| new-run-webkit-httpd | 83 help='Absolute path to DocumentRoot (overrides layout test roots)')
|
| /dalvik/vm/alloc/ |
| Visit.cpp | 160 * Visits all roots associated with a thread.
210 * Visits roots. TODO: visit cached global references.
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/digests/ |
| SHA256Digest.java | 126 * The first 32 bits of the fractional parts of the square roots
282 * cube roots of the first sixty-four prime numbers)
|
