aboutsummaryrefslogtreecommitdiffstats
path: root/src
diff options
context:
space:
mode:
Diffstat (limited to 'src')
-rw-r--r--src/composite.c22
1 files changed, 11 insertions, 11 deletions
diff --git a/src/composite.c b/src/composite.c
index b75d2b64727..82f31ade4a7 100644
--- a/src/composite.c
+++ b/src/composite.c
@@ -74,8 +74,8 @@ along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
74 composition rules to tell how to compose (2N+2)th element with 74 composition rules to tell how to compose (2N+2)th element with
75 the previously composed 2N glyphs. 75 the previously composed 2N glyphs.
76 76
77 COMPONENTS-VEC -- Vector of integers. In relative composition, the 77 COMPONENTS-VEC -- Vector of integers. In a relative composition,
78 elements are characters to be composed. In rule-base 78 the elements are the characters to be composed. In a rule-base
79 composition, the elements are characters or encoded 79 composition, the elements are characters or encoded
80 composition rules. 80 composition rules.
81 81
@@ -95,13 +95,13 @@ along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
95 get_composition_id checks the validity of `composition' property, 95 get_composition_id checks the validity of `composition' property,
96 and, if valid, assigns a new ID, registers the information in 96 and, if valid, assigns a new ID, registers the information in
97 composition_hash_table and composition_table, and changes the form 97 composition_hash_table and composition_table, and changes the form
98 of the property value. If the property is invalid, return -1 98 of the property value. If the property is invalid,
99 without changing the property value. 99 get_composition_id returns -1 without changing the property value.
100 100
101 We use two tables to keep information about composition; 101 We use two tables to keep the information about composition;
102 composition_hash_table and composition_table. 102 composition_hash_table and composition_table.
103 103
104 The former is a hash table in which keys are COMPONENTS-VECs and 104 The former is a hash table whose keys are COMPONENTS-VECs and
105 values are the corresponding COMPOSITION-IDs. This hash table is 105 values are the corresponding COMPOSITION-IDs. This hash table is
106 weak, but as each key (COMPONENTS-VEC) is also kept as a value of the 106 weak, but as each key (COMPONENTS-VEC) is also kept as a value of the
107 `composition' property, it won't be collected as garbage until all 107 `composition' property, it won't be collected as garbage until all
@@ -162,8 +162,8 @@ Lisp_Object Vauto_composition_function;
162Lisp_Object Qauto_composition_function; 162Lisp_Object Qauto_composition_function;
163Lisp_Object Vcomposition_function_table; 163Lisp_Object Vcomposition_function_table;
164 164
165/* Maxinum number of characters to lookback to check 165/* Maximum number of characters to look back for
166 auto-composition. */ 166 auto-compositions. */
167#define MAX_AUTO_COMPOSITION_LOOKBACK 3 167#define MAX_AUTO_COMPOSITION_LOOKBACK 3
168 168
169EXFUN (Fremove_list_of_text_properties, 4); 169EXFUN (Fremove_list_of_text_properties, 4);
@@ -1241,7 +1241,7 @@ struct position_record
1241 unsigned char *p; 1241 unsigned char *p;
1242}; 1242};
1243 1243
1244/* Update the members of POSTION to the next character boundary. */ 1244/* Update the members of POSITION to the next character boundary. */
1245#define FORWARD_CHAR(POSITION, STOP) \ 1245#define FORWARD_CHAR(POSITION, STOP) \
1246 do { \ 1246 do { \
1247 (POSITION).pos++; \ 1247 (POSITION).pos++; \
@@ -1257,7 +1257,7 @@ struct position_record
1257 } \ 1257 } \
1258 } while (0) 1258 } while (0)
1259 1259
1260/* Update the members of POSTION to the previous character boundary. */ 1260/* Update the members of POSITION to the previous character boundary. */
1261#define BACKWARD_CHAR(POSITION, STOP) \ 1261#define BACKWARD_CHAR(POSITION, STOP) \
1262 do { \ 1262 do { \
1263 if ((POSITION).pos == STOP) \ 1263 if ((POSITION).pos == STOP) \
@@ -1429,7 +1429,7 @@ find_automatic_composition (pos, limit, start, end, gstring, string)
1429 } 1429 }
1430 if (need_adjustment) 1430 if (need_adjustment)
1431 { 1431 {
1432 /* As we have called Lisp, there's a possibilily that 1432 /* As we have called Lisp, there's a possibility that
1433 buffer/string is relocated. */ 1433 buffer/string is relocated. */
1434 if (NILP (string)) 1434 if (NILP (string))
1435 cur.p = BYTE_POS_ADDR (cur.pos_byte); 1435 cur.p = BYTE_POS_ADDR (cur.pos_byte);