Lines Matching refs:mark
41 // Here, mark is the start of the node, while p->mark is the end.
44 _PyPegen_insert_memo(Parser *p, int mark, int type, void *node)
53 m->mark = p->mark;
54 m->next = p->tokens[mark]->memo;
55 p->tokens[mark]->memo = m;
61 _PyPegen_update_memo(Parser *p, int mark, int type, void *node)
63 for (Memo *m = p->tokens[mark]->memo; m != NULL; m = m->next) {
67 m->mark = p->mark;
72 return _PyPegen_insert_memo(p, mark, type, node);
298 if (p->mark == p->fill) {
305 Token *t = p->tokens[p->mark];
311 long count = m->mark - p->mark;
319 p->mark = m->mark;
330 int mark = p->mark;
332 p->mark = mark;
339 int mark = p->mark;
341 p->mark = mark;
348 int mark = p->mark;
350 p->mark = mark;
357 int mark = p->mark;
359 p->mark = mark;
366 if (p->mark == p->fill) {
372 Token *t = p->tokens[p->mark];
376 p->mark += 1;
400 if (p->mark == p->fill) {
406 Token *t = p->tokens[p->mark];
411 p->mark += 1;
418 if (p->mark == p->fill) {
424 Token *t = p->tokens[p->mark];
442 assert(p->mark >= 0);
444 for (int m = p->mark - 1; m >= 0; m--) {
782 p->mark = 0;
821 p->mark = 0;