Lines Matching refs:stack
145 * Able to recurse using an explicit non-CPU stack to resolve CNAME usages
157 struct label_stack stack[4];
163 lws_strncpy(stack[0].name, expname, sizeof(stack[0].name));
164 stack[0].enl = (int)strlen(expname);
202 sp = stack[0].name;
207 sizeof(stack[0].name) -
208 lws_ptr_diff_size_t(sp, stack[0].name));
257 n = lws_ptr_diff(sp, stack[0].name);
258 if (stack[0].name[n - 1] == '.')
261 m = stack[stp].enl;
262 if (stack[stp].name[m - 1] == '.')
266 strncmp(stack[0].name, stack[stp].name, (unsigned int)n)) {
268 // stack[0].name, stack[stp].name);
310 cb(stack[0].name, opaque, ttl, rrtype, p);
318 * So switch tack, stack where to resume from and
323 * stack level buffer for it.
326 if (++stp == (int)LWS_ARRAY_SIZE(stack)) {
331 sp = stack[stp].name;
334 sizeof(stack[stp].name) -
335 lws_ptr_diff_size_t(sp, stack[stp].name));
354 lwsl_notice("%s: recursing looking for %s\n", __func__, stack[stp].name);
357 stack[stp].name);
359 stack[stp].enl = lws_ptr_diff(sp, stack[stp].name);
361 stack[stp].p = pay + rrpaylen;
377 stack[stp].name);
419 while (stack[stp].name[n])
420 *cp++ = (char)tolower(stack[stp].name[n++]);