Lines Matching refs:tag

63  * only leaf nodes with the given tag.  to reduce amount of nodes to visit for
392 * if tagmask is not zero, search only for nodes with the tag set.
863 * return if the tag is set for the node at the given index. (true if set)
894 * set the tag for the node at the given index.
928 * clear the tag for the node at the given index.
953 * clear the tag only if no children have the tag.
1170 printops(const char *title, const char *name, int tag, unsigned int n,
1176 printf("RESULT %s %s %d %lf op/s\n", title, name, tag,
1202 radix_tree_tagid_t tag;
1209 for (tag = 0; tag < RADIX_TREE_TAG_ID_MAX; tag++) {
1210 ntagged[tag] = 0;
1227 for (tag = 0; tag < RADIX_TREE_TAG_ID_MAX; tag++) {
1228 n->tagged[tag] = test2_should_tag(i, tag);
1229 if (n->tagged[tag]) {
1230 radix_tree_set_tag(t, n->idx, tag);
1231 ntagged[tag]++;
1233 assert(n->tagged[tag] ==
1234 radix_tree_get_tag(t, n->idx, tag));
1246 for (tag = 0; tag < RADIX_TREE_TAG_ID_MAX; tag++) {
1254 tagged = radix_tree_get_tag(t, n->idx, tag);
1255 assert(n->tagged[tag] == tagged);
1261 assert(ntagged[tag] == count);
1262 printops(title, "get_tag", tag, nnodes, &stv, &etv);
1281 for (tag = 0; tag < RADIX_TREE_TAG_ID_MAX; tag++) {
1282 ntagged[tag] = 0;
1286 if (n->tagged[tag]) {
1287 radix_tree_set_tag(t, n->idx, tag);
1288 ntagged[tag]++;
1292 printops(title, "set_tag", tag, ntagged[tag], &stv, &etv);
1339 for (tag = 0; tag < RADIX_TREE_TAG_ID_MAX; tag++) {
1351 tag)) > 0) {
1355 assert(total == ntagged[tag]);
1358 printops(title, "ganglookup_tag", tag, ntagged[tag], &stv,
1362 for (tag = 0; tag < RADIX_TREE_TAG_ID_MAX; tag++) {
1375 tag)) > 0) {
1382 assert(total == ntagged[tag]);
1385 printops(title, "ganglookup_tag_reverse", tag, ntagged[tag],
1390 for (tag = 0; tag < RADIX_TREE_TAG_ID_MAX; tag++) {
1403 tag)) > 0) {
1414 assert(tag != 0 || total == ntagged[tag]);
1415 assert(total <= ntagged[tag]);
1418 printops(title, "ganglookup_tag+remove", tag, total, &stv,