51                               Idx nregs, int regs_allocated);
61 				      Idx str_idx, Idx dest_node, Idx nregs,
375   Idx nregs;  in re_search_stub()  local
405     nregs = 1;  in re_search_stub()
409       nregs = regs->num_regs;  in re_search_stub()
410       if (__glibc_unlikely (nregs < 1))  in re_search_stub()
414 	  nregs = 1;  in re_search_stub()
418     nregs = bufp->re_nsub + 1;  in re_search_stub()
419   pmatch = re_malloc (regmatch_t, nregs);  in re_search_stub()
427 			       nregs, pmatch, eflags);  in re_search_stub()
437       bufp->regs_allocated = re_copy_regs (regs, pmatch, nregs,  in re_search_stub()
460 re_copy_regs (struct re_registers *regs, regmatch_t *pmatch, Idx nregs,  in re_copy_regs()  argument
465   Idx need_regs = nregs + 1;  in re_copy_regs()
508       DEBUG_ASSERT (nregs <= regs->num_regs);  in re_copy_regs()
513   for (i = 0; i < nregs; ++i)  in re_copy_regs()
1212 proceed_next_node (const re_match_context_t *mctx, Idx nregs, regmatch_t *regs,  in proceed_next_node()  argument
1249 		       && push_fail_stack (fs, *pidx, candidate, nregs, regs,  in proceed_next_node()
1272 	  if (subexp_idx < nregs)  in proceed_next_node()
1276 	      if (subexp_idx >= nregs  in proceed_next_node()
1323 		 Idx nregs, regmatch_t *regs, regmatch_t *prevregs,  in push_fail_stack()  argument
1340   fs->stack[num].regs = re_malloc (regmatch_t, 2 * nregs);  in push_fail_stack()
1343   memcpy (fs->stack[num].regs, regs, sizeof (regmatch_t) * nregs);  in push_fail_stack()
1344   memcpy (fs->stack[num].regs + nregs, prevregs, sizeof (regmatch_t) * nregs);  in push_fail_stack()
1350 pop_fail_stack (struct re_fail_stack_t *fs, Idx *pidx, Idx nregs,  in pop_fail_stack()  argument
1358   memcpy (regs, fs->stack[num].regs, sizeof (regmatch_t) * nregs);  in pop_fail_stack()
1359   memcpy (prevregs, fs->stack[num].regs + nregs, sizeof (regmatch_t) * nregs);  in pop_fail_stack()