Home
last modified time | relevance | path

Searched refs:b_next (Results 1 – 3 of 3) sorted by relevance

/external/tensorflow/tensorflow/core/kernels/
Dgather_functor.h69 SliceIndex b_next = batch_idx + 1; in HandleCopies() local
75 b_next = batch_idx; in HandleCopies()
76 } else if (b_next <= batch_idx_end) { in HandleCopies()
77 port::prefetch<port::PREFETCH_HINT_T0>(&params(b_next, indices(0), 0)); in HandleCopies()
78 port::prefetch<port::PREFETCH_HINT_T0>(&out(b_next, 0, 0)); in HandleCopies()
103 batch_idx = b_next; in HandleCopies()
/external/python/cpython2/Python/
Dcompile.c69 struct basicblock_ *b_next; member
600 c->u->u_curblock->b_next = block; in compiler_next_block()
609 c->u->u_curblock->b_next = block; in compiler_use_next_block()
3418 if (b->b_next != NULL) in dfs()
3419 dfs(c, b->b_next, a); in dfs()
3465 if (b->b_next) in stackdepth_walk()
3466 maxdepth = stackdepth_walk(c, b->b_next, depth, maxdepth); in stackdepth_walk()
/external/python/cpython3/Python/
Dcompile.c66 struct basicblock_ *b_next; member
779 c->u->u_curblock->b_next = block; in compiler_next_block()
788 c->u->u_curblock->b_next = block; in compiler_use_next_block()
4968 for (j = end; b && !b->b_seen; b = b->b_next) { in dfs()
5026 basicblock *next = b->b_next; in stackdepth()