Lines Matching defs:memory
63 memory required for the table is prohibitive. */
230 period, so use memory to avoid rescanning known occurrences
232 size_t memory = 0;
237 i = MAX (suffix, memory);
245 while (memory < i + 1 && (CANON_ELEMENT (needle[i])
248 if (i + 1 < memory + 1)
253 memory = needle_len - period;
258 memory = 0;
264 /* The two halves of needle are distinct; no extra memory is
334 period, so use memory to avoid rescanning known occurrences
336 size_t memory = 0;
346 if (memory && shift < period)
352 memory = 0;
359 i = MAX (suffix, memory);
367 while (memory < i + 1 && (CANON_ELEMENT (needle[i])
370 if (i + 1 < memory + 1)
375 memory = needle_len - period;
380 memory = 0;
386 /* The two halves of needle are distinct; no extra memory is