Searched refs:nnodes (Results 1 – 10 of 10) sorted by relevance
42 size_t nnodes; member184 entry->maxnodes = entry->nnodes = 0; in tag_put()203 while (entry->nnodes > 0) { in tag_put()204 nold = entry->nodes[--entry->nnodes]; in tag_put()217 if (entry->maxnodes == entry->nnodes) { in tag_put()222 entry->nodes[entry->nnodes++] = n; in tag_put()
339 unsigned int nnodes; in bt_space() local342 nnodes = nrecs * (bt->hdr.bthDepth + 1); in bt_space()344 if (nnodes <= bt->hdr.bthFree) in bt_space()359 nnodes = space * (bt->f.vol->mdb.drAlBlkSiz / bt->hdr.bthNodeSize); in bt_space()361 bt->hdr.bthNNodes += nnodes; in bt_space()362 bt->hdr.bthFree += nnodes; in bt_space()
900 int nnodes; in cgraph_decide_inlining() local936 nnodes = cgraph_postorder (order); in cgraph_decide_inlining()951 for (i = nnodes - 1; i >= 0; i--) in cgraph_decide_inlining()1014 for (i = nnodes - 1; i >= 0; i--) in cgraph_decide_inlining()1177 static int nnodes; variable1197 nnodes = cgraph_postorder (order); in cgraph_early_inlining()1198 for (i = nnodes - 1; i >= 0; i--) in cgraph_early_inlining()1205 for (i = nnodes - 1; i >= 0; i--) in cgraph_early_inlining()1223 nnodes = 0; in cgraph_early_inlining()
37 int nnodes; member439 forest->nnodes = 0; in et_forest_create()450 if (forest->nnodes)472 forest->nnodes++;534 forest->nnodes--;
906 unsigned nnodes; member985 dfst[src->index].node[dfst[src->index].nnodes++]1014 if (node->nnodes)1016 node = node->node[--node->nnodes];
98 extern int nnodes;
200 nnodes = LS3_NODEID(fls(loongson_cpumask) - 1) + 1; in generic3a_setup()
88 for (node = 0; node < nnodes; node++) { in loongson3_intr_init()
116 int nnodes = 1; /* Number of NUMA nodes, only on 3A. */ variable
2175 int nnodes = 0, nonht = 0, nonhtassoc = 0; in ieee80211_clean_nodes() local 2190 nnodes++; in ieee80211_clean_nodes() 2243 nnodes--; in ieee80211_clean_nodes() 2293 nnodes != ic->ic_nnodes) in ieee80211_clean_nodes() 2295 "possible nodes leak\n", ifp->if_xname, nnodes, in ieee80211_clean_nodes()