MCPcopy Create free account
hub / github.com/acl-dev/acl / dlink_iter

Function dlink_iter

lib_acl/samples/iterator/main.c:346–381  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

344}
345
346static void dlink_iter(void)
347{
348 ACL_DLINK *dlink = acl_dlink_create(10);
349 ACL_ITER iter;
350 ACL_DITEM *ditem;
351
352 printf("\n>>> dlink_iter:\n");
353
354 (void) acl_dlink_insert(dlink, 1000, 2000);
355 printf(">>add 1000 -- 2000\n");
356 (void) acl_dlink_insert(dlink, 1, 1);
357 printf(">>add 1 -- 1\n");
358 (void) acl_dlink_insert(dlink, 2, 3);
359 printf(">>add 2 -- 3\n");
360 (void) acl_dlink_insert(dlink, 4, 8);
361 printf(">>add 10 -- 100\n");
362 (void) acl_dlink_insert(dlink, 10, 100);
363 printf(">>add 99 -- 200\n");
364 (void) acl_dlink_insert(dlink, 99, 200);
365 printf(">>add 201 -- 300\n");
366 (void) acl_dlink_insert(dlink, 201, 300);
367 printf(">>add 201 -- 300\n");
368 (void) acl_dlink_insert(dlink, 300, 400);
369 printf(">>add 300 -- 400\n");
370 (void) acl_dlink_insert(dlink, 500, 600);
371 printf(">>add 500 -- 600\n");
372
373 printf("\n>>>acl_foreach for acl_dlink:\n");
374 acl_foreach(iter, dlink) {
375 ditem = (ACL_DITEM*) iter.data;
376 printf(">> i: %d, range: %lld -- %lld\n",
377 iter.i, ditem->begin, ditem->end);
378 }
379
380 acl_dlink_free(dlink);
381}
382
383static void cache_free(const ACL_CACHE_INFO *info acl_unused, void *ptr)
384{

Callers 1

mainFunction · 0.85

Calls 4

acl_dlink_createFunction · 0.85
acl_dlink_insertFunction · 0.85
acl_dlink_freeFunction · 0.85
acl_foreachFunction · 0.50

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…