HomeSort by relevance Sort by last modified time
    Searched full:nodecount (Results 1 - 25 of 135) sorted by null

1 2 3 4 5 6

  /external/v8/src/compiler/
all-nodes.cc 15 is_reachable_(graph->NodeCount(), false, local_zone),
23 is_reachable_(graph->NodeCount(), false, local_zone),
29 DCHECK_LT(end->id(), graph->NodeCount());
46 if (use == nullptr || use->id() >= graph->NodeCount()) {
graph-trimmer.cc 15 live_.reserve(graph->NodeCount());
machine-graph-verifier.cc 28 representation_vector_(graph->NodeCount(), MachineRepresentation::kNone,
88 for (size_t i = 0; i <= block->NodeCount(); ++i) {
90 i < block->NodeCount() ? block->NodeAt(i) : block->control_input();
92 DCHECK_EQ(block->NodeCount(), i);
290 for (size_t i = 0; i <= block->NodeCount(); ++i) {
292 i < block->NodeCount() ? block->NodeAt(i) : block->control_input();
294 DCHECK_EQ(block->NodeCount(), i);
loop-analysis.cc 59 info_(graph->NodeCount(), {nullptr, nullptr}, zone),
61 loop_num_(graph->NodeCount(), -1, zone),
509 new (graph->zone()) LoopTree(graph->NodeCount(), graph->zone());
store-store-elimination.cc 347 // Initialize unobservable_ with js_graph->graph->NodeCount() empty sets.
352 in_revisit_(js_graph->graph()->NodeCount(), temp_zone),
353 unobservable_(js_graph->graph()->NodeCount(),
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
wct.h 66 typedef VOID (CALLBACK *PWAITCHAINCALLBACK)(HWCT WctHandle,DWORD_PTR Context,DWORD CallbackStatus,LPDWORD NodeCount,PWAITCHAIN_NODE_INFO NodeInfoArray,LPBOOL IsCycle);
70 WINBOOL WINAPI GetThreadWaitChain(HWCT WctHandle,DWORD_PTR Context,DWORD Flags,DWORD ThreadId,LPDWORD NodeCount,PWAITCHAIN_NODE_INFO NodeInfoArray,LPBOOL IsCycle);
  /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/printer/
DotPrinter.java 39 private int nodeCount;
47 nodeCount = 0;
104 return "n" + (nodeCount++);
  /prebuilts/go/darwin-x86/src/cmd/vendor/github.com/google/pprof/internal/driver/
driver.go 168 v.set("nodecount", "0")
171 if v["nodecount"].intValue() == -1 {
172 v.set("nodecount", "0")
175 if v["nodecount"].intValue() == -1 {
176 v.set("nodecount", "80")
180 v.set("nodecount", "0")
261 NodeCount: vars["nodecount"].intValue(),
interactive_test.go 244 "nodecount": "10",
254 "nodecount": "10",
264 "nodecount": "80",
272 "nodecount": "80",
284 "nodecount": "0",
295 "nodecount": "0",
interactive.go 206 case n == "nodecount" && v == "-1":
260 vcopy.set("nodecount", t)
291 if vcopy["nodecount"].intValue() == -1 && (name == "text" || name == "top") {
292 vcopy.set("nodecount", "10")
  /prebuilts/go/linux-x86/src/cmd/vendor/github.com/google/pprof/internal/driver/
driver.go 168 v.set("nodecount", "0")
171 if v["nodecount"].intValue() == -1 {
172 v.set("nodecount", "0")
175 if v["nodecount"].intValue() == -1 {
176 v.set("nodecount", "80")
180 v.set("nodecount", "0")
261 NodeCount: vars["nodecount"].intValue(),
interactive_test.go 244 "nodecount": "10",
254 "nodecount": "10",
264 "nodecount": "80",
272 "nodecount": "80",
284 "nodecount": "0",
295 "nodecount": "0",
interactive.go 206 case n == "nodecount" && v == "-1":
260 vcopy.set("nodecount", t)
291 if vcopy["nodecount"].intValue() == -1 && (name == "text" || name == "top") {
292 vcopy.set("nodecount", "10")
  /tools/apksig/src/main/java/com/android/apksig/internal/apk/v3/
V3SigningCertificateLineage.java 79 int nodeCount = 0;
114 nodeCount++;
137 + nodeCount + " using " + jcaSignatureAlgorithm + " when verifying"
154 + "SigningCertificateLineage at certificate #" + nodeCount + ". All "
168 "Failed to verify signature over signed data for certificate #" + nodeCount
171 throw new SecurityException("Failed to decode certificate #" + nodeCount
  /developers/build/prebuilts/gradle/AutofillFramework/Application/src/main/java/com/example/android/autofill/app/
CommonUtil.java 96 int nodeCount = structure.getWindowNodeCount();
98 + " numberNodes=" + nodeCount);
99 for (int i = 0; i < nodeCount; i++) {
  /developers/build/prebuilts/gradle/AutofillFramework/afservice/src/main/java/com/example/android/autofill/service/
CommonUtil.java 96 int nodeCount = structure.getWindowNodeCount();
98 + " numberNodes=" + nodeCount);
99 for (int i = 0; i < nodeCount; i++) {
  /developers/samples/android/input/autofill/AutofillFramework/Application/src/main/java/com/example/android/autofill/app/
Util.java 96 int nodeCount = structure.getWindowNodeCount();
98 + " numberNodes=" + nodeCount);
99 for (int i = 0; i < nodeCount; i++) {
  /external/e2fsprogs/lib/support/
dict.c 65 #define nodecount dict_nodecount macro
270 new->nodecount = 0;
319 dict->nodecount = 0;
347 dict->nodecount = 0;
368 dict->nodecount = 0;
385 dict->nodecount = 0;
603 dict->nodecount++;
750 dict->nodecount--;
960 return dict->nodecount;
965 return dict->nodecount == 0
1097 dictcount_t fullcount = DICTCOUNT_T_MAX, nodecount = dict->nodecount; local
    [all...]
  /external/f2fs-tools/fsck/
dict.c 60 #define nodecount dict_nodecount macro
257 new->nodecount = 0;
303 dict->nodecount = 0;
330 dict->nodecount = 0;
350 dict->nodecount = 0;
366 dict->nodecount = 0;
579 dict->nodecount++;
725 dict->nodecount--;
930 return dict->nodecount;
935 return dict->nodecount == 0
1067 dictcount_t fullcount = DICTCOUNT_T_MAX, nodecount = dict->nodecount; local
    [all...]
  /external/aac/libDRCdec/src/
drcGainDec_preprocess.cpp 399 int nodeCount = pCChar->characteristicNodeCount;
400 for (k = 0; k < nodeCount; k++) {
406 if (gainDb <= nodeGain[nodeCount]) {
407 *inLev = FX_SGL2FX_DBL(nodeLevel[nodeCount]);
412 for (n = 0; n < nodeCount; n++) {
426 *inLev = FX_SGL2FX_DBL(nodeLevel[nodeCount]);
430 if (gainDb >= nodeGain[nodeCount]) {
431 *inLev = FX_SGL2FX_DBL(nodeLevel[nodeCount]);
436 for (n = 0; n < nodeCount; n++) {
450 *inLev = FX_SGL2FX_DBL(nodeLevel[nodeCount]);
    [all...]
  /developers/samples/android/input/autofill/AutofillFramework/afservice/src/main/java/com/example/android/autofill/service/util/
Util.java 106 int nodeCount = structure.getWindowNodeCount();
108 structure.getActivityComponent(), nodeCount);
109 for (int i = 0; i < nodeCount; i++) {
  /frameworks/base/core/java/android/view/accessibility/
AccessibilityCache.java 389 final int nodeCount = nodes.size();
390 for (int i = nodeCount - 1; i >= 0; i--) {
491 final int nodeCount = nodes.size();
492 for (int j = 0; j < nodeCount; j++) {
  /prebuilts/go/darwin-x86/src/cmd/vendor/github.com/google/pprof/internal/report/
report.go 70 NodeCount int
159 if nodeCount := o.NodeCount; nodeCount > 0 {
164 if nodesKept := g.SelectTopNodePtrs(nodeCount, visualMode); len(g.Nodes) != len(nodesKept) {
169 if nodesKept := g.SelectTopNodes(nodeCount, visualMode); len(g.Nodes) != len(nodesKept) {
867 rpt.options.NodeCount = 0
1146 nodeCount := len(g.Nodes)
    [all...]
  /prebuilts/go/linux-x86/src/cmd/vendor/github.com/google/pprof/internal/report/
report.go 70 NodeCount int
159 if nodeCount := o.NodeCount; nodeCount > 0 {
164 if nodesKept := g.SelectTopNodePtrs(nodeCount, visualMode); len(g.Nodes) != len(nodesKept) {
169 if nodesKept := g.SelectTopNodes(nodeCount, visualMode); len(g.Nodes) != len(nodesKept) {
867 rpt.options.NodeCount = 0
1146 nodeCount := len(g.Nodes)
    [all...]
  /external/icu/icu4c/source/test/intltest/
ssearch.cpp 214 int32_t nodeCount = 0;
224 nodeCount++;
231 nodeCount++;
241 nodeCount++;
249 nodeCount++;
253 TEST_ASSERT(nodeCount == testCase->countChildren());
    [all...]

Completed in 1633 milliseconds

1 2 3 4 5 6